scholarly journals Polynomial Reconstruction Based Cryptography

2001 ◽  
pp. 129-133 ◽  
Author(s):  
Aggelos Kiayias ◽  
Moti Yung
Keyword(s):  
Polynomial Reconstruction

A Homomorphic Digit Fragmentation Encryption Scheme Based on the Polynomial Reconstruction Problem

2020 ◽  
Author(s):  
Mostefa Kara ◽  
Abdelkader Laouid ◽  
Reinhardt Euler ◽  
Mohammed Amine Yagoub ◽  
Ahcene Bounceur ◽  
...  
Keyword(s):  
Encryption Scheme ◽  
Reconstruction Problem ◽  
Polynomial Reconstruction

Two-way nesting ocean models with different vertical coordinates

2021 ◽  
Author(s):  
Jerome Chanut ◽  
James Harle ◽  
Tim Graham ◽  
Laurent Debreu
Keyword(s):  
Vertical Direction ◽  
Test Cases ◽  
Numerical Representation ◽  
Arbitrary Lagrangian Eulerian ◽  
Coordinate Systems ◽  
Vertical Coordinate ◽  
Terrain Following ◽  
New Feature ◽  
Polynomial Reconstruction ◽  
Horizontal Grid

<p>The NEMO platform possesses a versatile block-structured refinement capacity thanks to the AGRIF library. It is however restricted up to versions 4.0x, to the horizontal direction only. In the present work, we explain how we extended the nesting capabilities to the vertical direction, a feature which can appear, in some circumstances, as beneficial as refining the horizontal grid.</p><p>Doing so is not a new concept per se, except that we consider here the general case of child and parent grids with possibly different vertical coordinate systems, hence not logically defined from each other as in previous works. This enables connecting together for instance z (geopotential), s (terrain following) or eventually ALE (Arbitrary Lagrangian Eulerian) coordinate systems. In any cases, two-way exchanges are enabled, which is the other novel aspect tackled here.  </p><p>Considering the vertical nesting procedure itself, we describe the use of high order conservative and monotone polynomial reconstruction operators to remap from parent to child grids and vice versa. Test cases showing the feasibility of the approach are presented, with particular attention on the connection of s and z grids in the context of gravity flow modelling. This work can be considered as a preliminary step towards the application of the vertical nesting concept over major overflow regions in global realistic configurations. The numerical representation of these areas is indeed known to be particularly sensitive to the vertical coordinate formulation. More generally, this work illustrates the typical methodology from the development to the validation of a new feature in the NEMO model.</p>

scholarly journals Polynomial reconstruction and terminal vertices

2002 ◽  
Vol 356 (1-3) ◽  
pp. 145-156 ◽  
Author(s):  
Irene Sciriha
Keyword(s):  
Polynomial Reconstruction

Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2

2016 ◽  
Vol 31 ◽  
pp. 740-753 ◽  
Author(s):  
Slobodan Simić ◽  
Zoran Stanic
Keyword(s):  
Characteristic Polynomial ◽  
Reconstruction Problem ◽  
Signed Graphs ◽  
Simple Graphs ◽  
Least Eigenvalue ◽  
Polynomial Reconstruction ◽  
Special Classes

The polynomial reconstruction problem for simple graphs has been considered in the literature for more than forty years and is not yet resolved except for some special classes of graphs. Recently, the same problem has been put forward for signed graphs. Here, the reconstruction of the characteristic polynomial of signed graphs whose vertex-deleted subgraphs have least eigenvalue greater than $-2$ is considered.

Sign in / Sign up

Export Citation Format

Share Document