Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

Design and Fabrication of Composite Smart Structures with High Electric and Mechanical Performances for Future Mobile Communication

In this paper, we have developed a load-bearing outer skin for antennas, which is termed a composite smart structure (CSS). The CSS is a multilayer composite sandwich structure in which antenna layers are inserted. A direct-feed stacked patch antenna is considered. A design procedure including the structure design, material selection, and design of antenna elements in order to obtain high electric and mechanical performances is presented. An optimized honeycomb thickness is selected for efficient radiation and impedance characteristics. High gain conditions can be obtained by placing the outer facesheet in the resonance position, which is at about a half wavelength distance from the ground plane. The measured electrical performances show that the CSS has a great bandwidth (over 10%) and a higher gain than an antenna without a facesheet and has excellent mechanical performances, owing to the composite laminates and honeycomb cores. The CSS concept can be extended to give a useful guide for manufacturers of structural body panels and for antenna designers.     

Indexing text using the Ziv–Lempel trie

Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog₂n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m³logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found.     

Symmetries of flat rank two distributions and sub-Riemannian structures

Flat sub-Riemannian structures are local approximations -- nilpotentizations -- of sub-Riemannian structures at regular points. Lie algebras of symmetries of flat maximal growth distributions and sub-Riemannian structures of rank two are computed in dimensions 3, 4, and 5.

     

WZW–Poisson manifolds

We observe that a term of the WZW-type can be added to the Lagrangian of the Poisson σ-model in such a way that the algebra of the first class constraints remains closed. This leads to a natural generalization of the concept of Poisson geometry. The resulting “WZW–Poisson” manifold M is characterized by a bivector Π and by a closed three-form H such that 1/2[Π,Π]_Schouten=H,ΠΠΠ.     

Anderson transition in dilute systems with pure exponential interactions

Summary Assuming a completely disordered lattice it is shown that all the states are localized when the disorder parameterx=a ₀/0 reachesthe value 0.31, wherea is the mean atomic separation anda ₀ is the Bohr radius.     

Wave-vector diagrams for two-dimensional photonic crystals

Photonic crystals exhibit band gaps, meaning that electromagnetic fields cannot propagate in them for specific ranges of wavelengths and directions. The calculation of band structure diagrams has been intensively studied and is now well understood. In contrast to that, so-called wave-vector diagrams (i.e. dispersion surfaces, depicting the loci of all relevant wave vectors at a fixed wavelength) are less known and used. In principle, they show how the effective index of the structure depends on the direction of propagation. A method to calculate explicitly wave-vector diagrams for two-dimensional photonic crystals is derived which leads finally to quadratic eigenvalue problems. Results for square and triangular lattices are presented and some applications are discussed.     

Thermal and chemical nanofractal relaxation

We studied shape relaxation of nano-fractal islands, during annealing, after their growth from antimony cluster deposition on graphite surface. Annealing at 180^°C shows evidence of an increase of the fractal branch width with time followed by branch fragmentation, without changing the fractal dimension. The time evolution of the width of the arm suggests the surface self-diffusion mechanism as the main relaxation process. With Monte Carlo simulations, we confirmed the observed behavior. Comparison is done with our previous results on fragmentation of nano-fractal silver islands when impurity added to the incident cluster promotes rapid fragmentation by surface self-diffusion enhancement [1].