Helmholtz potentiality conditions for systems of difference-differential equations

For operators corresponding to systems ofμth-order difference-differential equations of neutral type, necessary and sufficient conditions for potentiality with respect to the classical bilinear form are obtained. These results are applied to first-order quasilinear systems. Translated fromMatematicheskie Zametki, Vol. 64, No. 3, pp. 437–442, September, 1998. The author wishes to express his thanks to V. M. Savchin for fruitful discussions and useful remarks.     

Infinite classes of anti‐mitre and 5‐sparse Steiner triple systems

In this paper, we present three constructions for anti‐mitre Steiner triple systems and a construction for 5‐sparse ones. The first construction for anti‐mitre STSs settles two of the four unsettled admissible residue classes modulo 18 and the second construction covers such a class modulo 36. The third construction generates many infinite classes of anti‐mitre STSs in the remaining possible orders. As a consequence of these three constructions we can construct anti‐mitre systems for at least 13/14 of the admissible orders. For 5‐sparse STS(υ), we give a construction for υ ≡ 1, 19 (mod 54) and υ ≠ 109. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 237–250, 2006     

Wavelet and harmonic filtering for distortion-invariant volume holographic correlation

The wavelet and harmonic filtering method suggested by Zalevsky and Ouzieli is introduced in this paper and adopted in our volume holographic image recognition system. This composite filter combines several scaled versions of the cascaded wavelet and harmonic filter, obtaining high discrimination ability and wide dynamic range of rotation and scale deformations. Optical experiments are conducted to demonstrate the validity and practicability of the algorithm. To the best of our knowledge, this is the first report of using this algorithm in a volume holographic system. Moreover, the separate correlation approach proposed in this paper greatly simplifies the manufacturing process and reduces the cost of the system.     

Vector Lattices on a Set of Two Generators

It is proved that the center of an automorphism group Aut(FVL2) of a free vector lattice FVL2 on a set of two free generators is isomorphic to a multiplicative group of positive reals. It is shown that the free vector lattice FVL2 has an isomorphic representation by continuous piecewise linear functions of the real line; as a consequence, the ideal lattice and the root system for rectifying ideals in FVL2 are amply described. Similar results are obtained for a free vector lattice FVL2 _Q 2 generated by two elements over a field of rational numbers.     

Existence and Nonlinear Stability of Stationary States of the Schrödinger–Poisson System

We consider the Schrödinger–Poisson system in the repulsive (plasma physics) Coulomb case. Given a stationary state from a certain class we prove its nonlinear stability, using an appropriately defined energy-Casimir functional as Lyapunov function. To obtain such states we start with a given Casimir functional and construct a new functional which is in some sense dual to the corresponding energy-Casimir functional. This dual functional has a unique maximizer which is a stationary state of the Schrödinger–Poisson system and lies in the stability class. The stationary states are parameterized by the equation of state, giving the occupation probabilities of the quantum states as a strictly decreasing function of their energy levels.     

Discrete and Continuous Time Modulated Random Walks with Heavy-Tailed Increments

We consider a modulated process S which, conditional on a background process X, has independent increments. Assuming that S drifts to −∞ and that its increments (jumps) are heavy-tailed (in a sense made precise in the paper), we exhibit natural conditions under which the asymptotics of the tail distribution of the overall maximum of S can be computed. We present results in discrete and in continuous time. In particular, in the absence of modulation, the process S in continuous time reduces to a Lévy process with heavy-tailed Lévy measure. A central point of the paper is that we make full use of the so-called “principle of a single big jump” in order to obtain both upper and lower bounds. Thus, the proofs are entirely probabilistic. The paper is motivated by queueing and Lévy stochastic networks.     

On Computability of Decaying and Nondecaying States in Quantum Systems with Cantor Spectra

We study Hamiltonians with singular spectra of Cantor type with a constant ratio of dissection. The decay properties of the states in such systems depend on the nature of the dissection rate that can be characterized in terms of the algebraic number theory. We show that in spite of simplicity of the considered model the computational modeling of nondecaying states is in general impossible.     

一维接触过程的光滑性与稳定性

本文证明了一维接触过程在适当的小扰动下，其极点平稳分布除在临界点λ＿ｃ处外总是光滑的．特别，一维接触过程本身的极点平稳分布关于其参数除在临界点处外总是光滑的．     

Phase-Only Encryption and Single Path Decryption System Using Phase-Encoded Exclusive-OR Rules in Fourier Domain

A phase-only encryption scheme using phase-encoded exclusive-OR (XOR) rules in a Fourier plane and a single path decryption system are presented. To generate phase-only encrypted data, a zero-padded original image, multiplied by a random phase image, is Fourier transformed and its real-valued data is encrypted with key data by using phase-encoded XOR rules. Since the original information is encrypted on the Fourier plane, the proposed encryption is more tolerant to loss of key information by scratching or cutting than previous XOR encryption in a space domain. A decryption is simply performed based on 2-f setup with spatial filter by Fourier transform for multiplication phase-only encrypted data with phase-only key data. Due to single path architecture without a reference wave, the proposed system is resistant to mechanical vibrations and fluctuation. Numerical simulations have confirmed the validity of the proposed encryption scheme and simple decryption architecture.