Synchronization of unified chaotic system by sliding mode/mixed <Emphasis Type="Italic">H</Emphasis><Subscript>2</Subscript>/<Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> control

This paper deals with the synchronization of uncertain unified chaotic system in the presence of two kinds of disturbances, white noise and bounded power signal. A sliding mode controller (SMC) is established to guarantee the sliding motion. Moreover, a proportional-integral (PI) switching surface is used to determine the performance of the system in the sliding motion. Also, by using a mixed H ₂/H _∞ approach, the effect of external disturbances on the sliding motion is reduced. The necessary parameters of constructing controller and switching surface are found via semidefinite programming (SDP) which can be solved effectively by a standard software. Finally, a numerical simulation is presented to show the effectiveness of the proposed method.     

Circuit implementation and finite-time synchronization of the 4D Rabinovich hyperchaotic system

This paper studies the problem of the circuit implementation and the finite-time synchronization for the 4D (four-dimensional) Rabinovich hyperchaotic system. The electronic circuit of 4D hyperchaotic system is designed. It is rigorously proven that global finite-time synchronization can be achieved for hyperchaotic systems which have uncertain parameters.     

Predicting a cyclic Poisson process

We construct and investigate a (1−α)-upper prediction bound for a future observation of a cyclic Poisson process using past data. A normal based confidence interval for our upper prediction bound is established. A comparison of the new prediction bound with a simpler nonparametric prediction bound is also given.     

Homogeneity and local symmetry of complex (<Emphasis Type="Italic">κ</Emphasis>, µ)-spaces

We prove that a complex (κ, μ)-space with κ < 1 is a locally homogeneous complex contact metric manifold. Also, a complex (κ, μ)-space has either κ = 1 or is GH-locally symmetric.     

On a question of A. E. Nussbaum on measurability of families of closed linear operators in a Hilbert space

The purpose of this note is to answer a question A. E. Nussbaum formulated in 1964 about the possible equivalence between weak measurability of a family of densely defined, closed operators {T(t)} _t∈ℝ in a separable complex Hilbert space H\mathcal{H} on one hand, and the notion of measurability of the 2 × 2 operator-valued matrix of projections {(P(Γ(T(t))) _j,k )_1⩽j,k⩽2} _t∈ℝ onto the graph Γ(T(t)) of T(t) on the other, in the negative.     

Controllability of Second Order Impulsive Neutral Functional Differential Inclusions with Infinite Delay

This paper is concerned with controllability of a partial neutral functional differential inclusion of second order with impulse effect and infinite delay. We introduce a new phase space to prove the controllability of an inclusion which consists of an impulse effect with infinite delay. We claim that the phase space considered by different authors is not correct. We establish the controllability of mild solutions using a fixed point theorem for contraction multi-valued maps and without assuming compactness of the family of cosine operators.     

A Mesh Adaptive Basin Hopping Method for the Design of Circular Antenna Arrays

The design of circular antenna arrays is a challenging optimization problem, which requires ad-hoc methods to fulfill the engineering requirements. In this work, we introduce the Mesh Adaptive Basin Hopping algorithm to tackle such problem effectively; the experimental results show that the new approach proposed outperforms the state-of-the-art methods, both in terms of quality of the solutions and computational efficiency.     

Gabor pairs,and a discrete approach to wave-front sets

We introduce admissible lattices and Gabor pairs to define discrete versions of wave-front sets with respect to Fourier–Lebesgue and modulation spaces. We prove that these wave-front sets agree with each other and with corresponding wave-front sets of “continuous type”. This implies that the coefficients of a Gabor frame expansion of f are parameter dependent, and describe the wave-front set of f.     

Global asymptotic stability for half-linear differential systems with generalized almost periodic coefficients

The following system considered in this paper:

$$x' = -\,e(t)x + f(t)\phi_{p^*}(y), \qquad y'= -\,(p-1)g(t)\phi_p(x) - (p-1)h(t)y,$$

where \({p > 1, p^* > 1 (1/p + 1/p^* = 1)}\) and \({\phi_q(z) = |z|^{q-2}z}\) for q = p or q = p ^*. This system is referred to as a half-linear system. The coefficient f(t) is assumed to be bounded, but the coefficients e(t), g(t) and h(t) are not necessarily bounded. Sufficient conditions are obtained for global asymptotic stability of the zero solution. Our results can be applied to not only the case that the signs of f(t) and g(t) change like the periodic function but also the case that f(t) and g(t) irregularly have zeros. Some suitable examples are included to illustrate our results.

     

Generic cryptographic weakness of k-normal Boolean functions in certain stream ciphers and cryptanalysis of grain-128

This paper considers security implications of k-normal Boolean functions when they are employed in certain stream ciphers. A generic algorithm is proposed for cryptanalysis of the considered class of stream ciphers based on a security weakness of k-normal Boolean functions. The proposed algorithm yields a framework for mounting cryptanalysis against particular stream ciphers within the considered class. Also, the proposed algorithm for cryptanalysis implies certain design guidelines for avoiding certain weak stream cipher constructions. A particular objective of this paper is security evaluation of stream cipher Grain-128 employing the developed generic algorithm. Contrary to the best known attacks against Grain-128 which provide complexity of a secret key recovery lower than exhaustive search only over a subset of secret keys which is just a fraction (up to 5%) of all possible secret keys, the cryptanalysis proposed in this paper provides significantly lower complexity than exhaustive search for any secret key. The proposed approach for cryptanalysis primarily depends on the order of normality of the employed Boolean function in Grain-128. Accordingly, in addition to the security evaluation insights of Grain-128, the results of this paper are also an evidence of the cryptographic significance of the normality criteria of Boolean functions.