Robust adaptive synchronization of chaotic neural networks by slide technique

In this paper, we focus on the robust adaptive synchronization between two coupled chaotic neural networks with all the parameters unknown and time-varying delay. In order to increase the robustness of the two coupled neural networks, the key idea is that a sliding-mode-type controller is employed. Moreover, without the estimate values of the network unknown parameters taken as an updating object, a new updating object is introduced in the constructing of controller. Using the proposed controller, without any requirements for the boundedness, monotonicity and differentiability of activation functions, and symmetry of connections, the two coupled chaotic neural networks can achieve global robust synchronization no matter what their initial states are. Finally, the numerical simulation validates the effectiveness and feasibility of the proposed technique.     

Breaking chaotic shift key communication via adaptive key identification

This paper proposes an adaptive parameter identification method for breaking chaotic shift key communication from the transmitted signal in public channel. The sensitive dependence property of chaos on parameter mismatch is used for chaos adaptive synchronization and parameter identification. An index function about the synchronization error is defined and conjugate gradient method is used to minimize the index function and to search the transmitter's parameter (key). By using proposed method, secure key is recovered from transmitted signal generated by low dimensional chaos and hyper chaos switching communication. Multi-parameters can also be identified from the transmitted signal with noise.     

闪光照相CCD图像的自适应中值滤波方法

中值滤波是一种在去除噪声的同时能较好地保护图像边缘细节的非线性图像处理方法。为了滤除闪光照相CCD图像中的脉冲噪声，同时能更好地保护图像边缘，提出了一种改进的自适应中值滤波方法。该方法采用局部中值和局部方差作为判断噪声点的阈值，实现了局部自适应的中值滤波，克服了传统自适应中值滤波方法的缺点，对椒盐噪声和随机脉冲噪声均有较好的滤波效果。实验结果表明，该方法消除图像脉冲噪声十分有效，对闪光照相CCD图像的处理结果也较好。     

Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Equality Constraints: Corrigendum and Addendum

In this paper we give corrections to our paper on an augmented Lagrangian type algorithm for strictly convex quadratic programming problems with equality constraints.     

Adaptive Robust Tracking for Flexible Spacecraft in Presence of Disturbances

The paper deals with trajectory tracking for a flexible spacecraft, subject to a gravity-gradient disturbance, under parameter uncertainties. The controls are gas jets and reaction wheels, and the measured variables describe the attitude and angular velocity of the rigid part. The flexible dynamics is treated as an additional disturbance acting on a rigid structure. First, an adaptive control is designed with only the gravity-gradient disturbance acting on the spacecraft; second, it is proved to be effective also in the presence of disturbance due to the flexibility, provided that appropriate robustness conditions on the controller gains are satisfied. These conditions use partial knowledge of the parameters describing the elastic dynamics. Simulations show the good performance of such control scheme and demonstrate its applicability even in the presence of input saturation.     

Local generalized empirical estimation of regression

Let f(x) be the density of a design variable X and m(x) = E[Y\X = x] the regression function. Then m(x) - G(x)/f(x), where G(x) = m(x)f(x). The Dirac δ-function is used to define a generalized empirical function Gn (x) for G(x) whose expectation equals G(x). This generalized empirical function exists only in the space of Schwartz distributions, so we introduce a local polynomial of order p approximation to Gn(.) which provides estimators of the function G(x) and its derivatives. The density f(x) can be estimated in a similar manner. The resulting local generalized empirical estimator (LGE) of m(x) is exactly the Nadaraya-Watson estimator at interior points when p = 1, but on the boundary the estimator automatically corrects the boundary effect. Asymptotic normality of the estimator is established. Asymptotic expressions for the mean squared errors are obtained and used in bandwidth selection. Boundary behavior of the estimators is investigated in details. We use Monte Carlo simulations to show that the     

Letter: Trace Anomaly and Backreaction of the Dynamical Casimir Effect

The Casimir energy for massless scalar field which satisfies periodic boundary conditions in two-dimensional domain wall background is calculated by making use of general properties of renormalized stress-tensor. The line element of domain wall is time dependent, the trace anomaly which is the nonvanishing T for a conformally invariant field after renormalization, represent the back reaction of the dynamical Casimir effect.     

Implementation of an adaptive umbrella sampling method for the calculation of multidimensional potential of mean force of chemical reactions in solution

We describe the implementation of an adaptive umbrella sampling method, making use of the weighted histogram analysis method, for computing multidimensional potential of mean force for chemical reaction in solution. The approach is illustrated by investigating the effect of aqueous solution on the free energy surface for the proton transfer reaction of [H(3)N-H-NH(3)](+) using a combined quantum mechanical and molecular mechanical AM1/TIP3P potential.     

Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems

We study a processing system comprised of parallel queues, whose individual service rates are specified by a global service mode (configuration). The issue is how to switch the system between various possible service modes, so as to maximize its throughput and maintain stability under the most workload-intensive input traffic traces (arrival processes). Stability preserves the job inflow–outflow balance at each queue on the traffic traces. Two key families of service policies are shown to maximize throughput, under the mild condition that traffic traces have long-term average workload rates. In the first family of cone policies, the service mode is chosen based on the system backlog state belonging to a corresponding cone. Two distinct policy classes of that nature are investigated, MaxProduct and FastEmpty. In the second family of batch policies (BatchAdapt), jobs are collectively scheduled over adaptively chosen horizons, according to an asymptotically optimal, robust schedule. The issues of nonpreemptive job processing and non-negligible switching times between service modes are addressed. The analysis is extended to cover feed-forward networks of such processing systems/nodes. The approach taken unifies and generalizes prior studies, by developing a general trace-based modeling framework (sample-path approach) for addressing the queueing stability problem. It treats the queueing structure as a deterministic dynamical system and analyzes directly its evolution trajectories. It does not require any probabilistic superstructure, which is typically used in previous approaches. Probability can be superposed later to address finer performance questions (e.g., delay). The throughput maximization problem is seen to be primarily of structural nature. The developed methodology appears to have broader applicability to other queueing systems.     

Some Limit Theorems in Geometric Processes

Geometric process (GP) was introduced by Lam[4,5], it is defined as a stochastic process {Xn, n = 1, 2,…} for which there exists a real number a > 0, such that {an-1 Xn, n = 1,2, …} forms a renewal process (RP). In this paper, we study some limit theorems in GP. We first derive the Wald equation for GP and then obtain the limit theorems of the age, residual life and the total life at t for a GP. A general limit theorem for Sn with a > 1 is also studied. Furthermore, we make a comparison between GP and RP, including the comparison of their limit distributions of the age, residual life and the total life at t.