最优的单纯形-中心设计

对于一般的ｑ－１维正规单纯形利益区域和多重线性多项式模型,给出了Ａ 最优的混料设计,Ａ 最优的混料设计的柱点是所有的正规单纯形的各类中心·令ｒｉ(ｉ＝１,２,…,ｑ)表示每个第ｉ类中心点上的设计测度,给出了以ｒｊ／ｒｑ(ｊ＝１,２,…,ｑ－１)形式表示的Ａ 最优测度比,按此测度比给出的广义单纯形中心设计是Ａ 最优的     

Positive observer design for positive Markovian jump systems with partly known transition rates

The paper is concerned with positive observer design for positive Markovian jump systems with partly known transition rates. By applying a linear co-positive type Lyapunov-Krasovskii function, a sufficient condition is proposed to ensure the stochastic stability of the error positive system and the existence of the positive observer, which is computed in linear programming. Finally, an example is given to demonstrate the validity of the main results.     

Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems

Hybrid systems are dynamical systems with interacting discrete computation and continuous physical processes, which have become more common, more indispensable, and more complicated in our modern life. Particularly, many of them are safety-critical, and therefore are required to meet a critical safety standard. Invariant generation plays a central role in the verification and synthesis of hybrid systems. In the previous work, the fourth author and his coauthors gave a necessary and sufficient condition for a semi-algebraic set being an invariant of a polynomial autonomous dynamical system, which gave a confirmative answer to the open problem. In addition, based on which a complete algorithm for generating all semi-algebraic invariants of a given polynomial autonomous hybrid system with the given shape was proposed. This paper considers how to extend their work to non-autonomous dynamical and hybrid systems. Non-autonomous dynamical and hybrid systems are with inputs, which are very common in practice; in contrast, autonomous ones are without inputs. Furthermore, the authors present a sound and complete algorithm to verify semi-algebraic invariants for non-autonomous polynomial hybrid systems. Based on which, the authors propose a sound and complete algorithm to generate all invariants with a pre-defined template.     

Parametric adaptive time-frequency representation based on time-sheared Gabor atoms

A localized parametric time-sheared Gabor atom is derived by convolving a linear frequency modulated factor, modulating in frequency and translating in time to a dilated Gaussian function, which is the generalization of Gabor atom and is more delicate for matching most of the signals encountered in practice, especially for those having frequency dispersion characteristics. The time-frequency distribution of this atom concentrates in its time center and frequency center along energy curve, with the curve being oblique to a certain extent along the time axis. A novel parametric adaptive time-frequency distribution based on a set of the derived atoms is then proposed using a adaptive signal subspace decomposition method in frequency domain, which is non-negative time-frequency energy distribution and free of cross-term interference for multicomponent signals. The results of numerical simulation manifest the effectiveness of the approach in time-frequency representation and signal de-noising processing.     

Researching and implementation of reconfigurable Hash chip based on FPGA

The reconfigurable cryptographic chip is an integrated circuit that is designed by means of the method of reconfigurable architecture, and is used for encryption and decryption. Many different cipher algorithms can be flexibly implemented with the aid of a reconfigurable cryptographic chip and can be used in many fields. This article takes an example for the SHA-1/224/256 algorithms, and then designs a reconfigurable cryptographic chip based on the thought and method of the reconfigurable architecture. Finally, this paper gives the implementation result based on the FPGA of the family of Stratix II of Altera Corporation, and presents a good research trend for resolving the storage in hardware implementation using FPGAs.     

Ad hoc distributed mutual exclusion algorithm based on token-asking

The solution of distributed mutual exclusion is difficult in Ad hoc networks owing to dynamic topologies and mobility. Based on the analysis of the properties of Ad hoc networks and the disadvantages of the traditional algorithms, an improved Ad hoc system model was given and a novel algorithm was presented as AHDME (Ad Hoc Distributed Mutual Exclusion); it was based on the token-asking algorithms. It utilized broadcast to search for the token and to decrease the message complexity of multi-hop Ad hoc networks. Lamport's timestamp was improved to ensure the time sequence and to prevent nodes from starvation. When compared to traditional algorithms, AHDME does not require the fixed size of request queues and the global system information, which adapts itself to the frequent arrival/departures and the limited computing capability of nodes in Ad hoc networks. Performance analysis and simulation results show that the AHDME algorithm has low message complexity, small space complexity, and short response delay.     

The self-organizing worm algorithm

A new multi-modal optimization algorithm called the self-organizing worm algorithm (SOWA) is presented for optimization of multi-modal functions.The main idea of this algorithm can be described as followsdisperse some worms equably in the domain;the worms exchange the information each other and creep toward the nearest high point;at last they will stop on the nearest high point.All peaks of multi-modal function can be found rapidly through studying and chasing among the worms.In contrast with the classical multi-modal optimization algorithms,SOWA is provided with a simple calculation,strong convergence,high precision,and does not need any prior knowledge.Several simulation experiments for SOWA are performed,and the complexity of SOWA is analyzed amply.The results show that SOWA is very effective in optimization of multi-modal functions.     

Adaptive immune-genetic algorithm for global optimization to multivariable function

An adaptive immune-genetic algorithm(AIGA)is proposed to avoid premature convergence and guarantee the diversity of the population.Rapid immune response (secondary response),adaptive mutation and density operators in the AIGA are emphatically designed to improve the searching ability,greatly increase the converging speed,and decrease locating the local maxima due to the premature convergence.The simulation results obtained from the global optimization to four multivariable and multi-extreme functions show that AIGA converges rapidly,guarantees the diversity,stability and good searching ability.     

INFORMATION CHARACTERIZATION OF COMMUNICATION CHANNELS FOR SYSTEM IDENTIFICATION

This paper studies identification of systems in which the system output is quantized, transmitted through a digital communication channel, and observed afterwards. The concept of the CR Ratio is introduced to characterize impact of communication channels on identification. The relationship between the CR Ratio and Shannon channel capacity is discussed. Identification algorithms are further developed when the channel error probability is unknown.