Image encryption using exclusive-OR with DNA complementary rules and double random phase encoding

We propose an optical image encryption scheme based on the Deoxyribonucleic Acid (DNA) theory and the double random phase encoding (DRPE) technique. The piecewise linear chaotic map (PWLCM) is used to generate key images and random phase masks, and to determine DNA encoding rules. In order to achieve ultra-fast DNA encryption, we propose using an optical exclusive-OR (XOR) gate to achieve XOR operation in DNA encryption. Different plaintexts use different initial values of PWLCM, which are generated by Message Digest Algorithm 5 (MD5). The plaintext is encrypted by two rounds of DNA and then by DRPE to form a ciphertext. Numerical simulation and the analysis of attacks on encrypted image are implemented to demonstrate the security and validity of the proposed approach.     

Sorting Using Complete Subintervals and the Maximum Number of Runs in a Randomly Evolving Sequence

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a string of 0’s, and then evolves by changing each 0 to 1, with the n changes done in random order. What is the maximal number of runs of 1’s? We give asymptotic results for the distribution and mean. It turns out that, as in many problems involving a maximum, the maximum is asymptotically normal, with fluctuations of order n ^1/2, and to the first order well approximated by the number of runs at the instance when the expectation is maximized, in this case when half the elements have changed to 1; there is also a second order term of order n ^1/3. We also treat some variations, including priority queues and sock-sorting. The proofs use methods originally developed for random graphs.     

The size of the giant high‐order component in random hypergraphs

The phase transition in the size of the giant component in random graphs is one of the most well‐studied phenomena in random graph theory. For hypergraphs, there are many possible generalizations of the notion of a connected component. We consider the following: two j‐sets (sets of j vertices) are j‐connected if there is a walk of edges between them such that two consecutive edges intersect in at least j vertices. A hypergraph is j‐connected if all j‐sets are pairwise j‐connected. In this paper, we determine the asymptotic size of the unique giant j‐connected component in random k‐uniform hypergraphs for any and .     

Noncommutative Dynamics of Random Operators

We continue our program of unifying general relativity and quantum mechanics in terms of a noncommutative algebra А on a transformation groupoid Γ = E × G where E is the total space of a principal fibre bundle over spacetime, and G a suitable group acting on Γ . We show that every a ∊ А defines a random operator, and we study the dynamics of such operators. In the noncommutative regime, there is no usual time but, on the strength of the Tomita–Takesaki theorem, there exists a one-parameter group of automorphisms of the algebra А which can be used to define a state dependent dynamics; i.e., the pair (А, ϕ), where ϕ is a state on А, is a “dynamic object.” Only if certain additional conditions are satisfied, the Connes–Nikodym–Radon theorem can be applied and the dependence on ϕ disappears. In these cases, the usual unitary quantum mechanical evolution is recovered. We also notice that the same pair (А, ϕ) defines the so-called free probability calculus, as developed by Voiculescu and others, with the state ϕ playing the role of the noncommutative probability measure. This shows that in the noncommutative regime dynamics and probability are unified. This also explains probabilistic properties of the usual quantum mechanics.     

Some new constructions of bivariate Weibull models

In this article, several approaches are advanced towards the construction of bivariate Weibull models from the consideration of failure behaviors of the components of a two-component system. First, a general method of construction of bivariate life models is developed in the setting of random environmental effects. Some new bivariate Weibull models are derived as special cases and added insights are provided for some of the existing ones. In the course of model formulation in terms of the dependence structure, a new bivariate family of life distributions is constructed so as to incorporate both positive and negative quadrant dependence in the same parametric setting, and a bivariate Weibull model is obtained as a special case. Finally, some distributional properties are presented for a bivariate Weibull model derived from the consideration of random hazards.     

Lower bounds for the maximal Lyapunov exponent

Upper bounds for the maximal Lyapunov exponent,E, of a sequence of matrix-valued random variables are easy to come by asE is the infimum of a real-valued sequence. We shall show that under irreducibility conditions similar to those needed to prove the Perron-Frobenius theorem, one can find sequences which increase toE. As a byproduct of the proof we shall see that we may replace the matrix norm with the spectral radius when computingE in such cases. Finally, a sufficient condition for transience of random walk in a random environment is given.     

Stochastic resonance in an ion channel following the non-Arrhenius gating rate

Stochastic resonance (SR) is a novel cooperative phenomenon occurring in nonlinear systems due to coupling of an ambient noise and an external signal. Biological systems may use SR mechanism to detect the signal efficiently from an external environment. A number of studies have addressed the SR in artificial ion channels considering external voltages as noises. More important than these external noises is the internal, thermal noise which changes the channel conformations essential for biological functions. In this work, we consider that the channel gating rates follow a non-Arrhenius temperature dependence derived from experimental data of a real biological channel. Using the Monte-Carlo simulations, we find that in this channel SR occurs near a physiological temperature in a very distinctive manner compared with that for the Arrhenius gating model.     

静态随机访问存储器型现场可编程门阵列辐照效应测试系统研制

在调研静态随机访问存储器型现场可编程门阵列(FPGA)器件空间辐照效应失效机理的基础上,详细论述FPGA辐照效应测试系统内部存储器测试、功能测试及功耗测试的实现原理,给出了系统的软硬件实现方法。所建立的系统可以测试FPGA器件的配置存储器翻转截面、块存储器翻转截面、功能失效截面、闭锁截面等多个参数,其长线传输距离达到50 m以上,最大可测门数达到了100万门,为FPGA辐照效应研究提供了测试平台。     

Composition, structure and magnetic properties of sputter deposited Ni-Mn-Ga ferromagnetic shape memory thin films

Polycrystalline Ni-Mn-Ga thin films were deposited by the d.c. magnetron sputtering on well-cleaned substrates of Si(1 0 0) and glass at a constant sputtering power of 36 W. We report the influence of sputtering pressure on the composition, structure and magnetic properties of the sputtered thin films. These films display ferromagnetic behaviour only after annealing at an elevated temperature and a maximum saturation magnetization of 335 emu/cc was obtained for the films investigated. Evolution of martensitic microstructure was observed in the annealed thin films with the increase of sputtering pressure. The thermo-magnetic curves exhibited only magnetic transition in the temperature range of 339-374 K. The thin film deposited at high sputtering pressure of 0.025 mbar was found to be ordered L2₁ austenitic phase.