基于合作规则的脉冲神经膜系统的小通用性

基于合作规则的脉冲神经膜系统是一类受神经元利用脉冲进行信息处理与通讯的生物功能启发得到的分布式并行计算模型的变体.在这类系统中,每个神经元具有相同有限数量的规则集合,且所有神经元中的集合用相同的标签进行标记,规则的集合称为组件.文中研究了基于合作规则的脉冲神经膜系统的小通用性:作为产生数的装置,构造了一个需要6个神经元的通用脉冲神经膜系统,这个结果回答了Metta等提出的一个公开问题。     

Blind reconstruction of linear scrambler

An algorithm based on eigenanalysis technique and Walsh-Hadamard transform （WriT） is proposed. The algorithm contains two steps. Firstly, the received sequence is divided into temporal windows, and a covariance matrix is computed. The linear feedback shift register （LFSR） sequence is reconstructed from the first eigenvector of this matrix. Secondly, equations according to the recovered LFSR sequence are constructed, and the Walsh spectrum corresponding to the equations is computed. The feedback polynomial of LFSR is estimated from the Walsh spectrum. The validity of the algorithm is verified by the simulation result. Finally, case studies are presented to illustrate the performance of the blind reconstruction method.     

Efficient matrix inversion based on VLIW architecture

Matrix inversion is a critical part in communication, signal processing and electromagnetic system. A flexible and scalable very long instruction word （VLIW） processor with clustered architecture is proposed for matrix inversion. A global register file （RF） is used to connect al the clusters. Two nearby clusters share a local register file. The instruction sets are also designed for the VLIW processor. Experimental results show that the proposed VLIW architecture takes only 45 latency to invert a 4 × 4 matrix when running at 150 MHz. The proposed design is roughly five times faster than the DSP solution in processing speed.     

Method of neural network modulation recognition based on clustering and Polak-Ribiere algorithm

To improve the recognition rate of signal modulation recognition methods based on the clustering algorithm under the low SNR, a modulation recognition method is proposed. The characteristic parameter of the signal is extracted by using a clustering algorithm, the neural network is trained by using the algorithm of variable gradient correction （Polak-Ribiere） so as to enhance the rate of convergence, improve the performance of recognition under the low SNR and realize modulation recognition of the signal based on the modulation system of the constellation diagram. Simulation results show that the recognition rate based on this algorithm is enhanced over 30% compared with the methods that adopt clustering algorithm or neural network based on the back propagation algorithm alone under the low SNR. The recognition rate can reach 90% when the SNR is 4 dB, and the method is easy to be achieved so that it has a broad application prospect in the modulating recognition.     

Direct adaptive control for a class of MIMO nonlinear discrete-time systems

This paper considers the problem of adaptive con-trol for a class of multiple input multiple output （MIMO） nonlinear discrete-time systems based on input-output model with unknown interconnections between subsystems. Based on the Taylor ex-pand technology, an equivalent model in affine-like form is derived for the original nonaffine nonlinear system. Then a direct adap-tive neural network （NN） control er is implemented based on the affine-like model. By finding an orthogonal matrix to tune the NN weights, the closed-loop system is proven to be semiglobal y uni-formly ultimately bounded. The σ-modification technique is used to remove the requirement of persistence excitation during the adaptation. The control performance of the closed-loop system is guaranteed by suitably choosing the design parameters.     

Fast cross validation for regularized extreme learning machine

A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is opposite to that of naive 1-fold cross validation. As opposed to naive l-fold cross validation, fast l-fold cross validation takes the advantage in terms of computational time, especially for the large fold number such as l 〉 20. To corroborate the efficacy and feasibility of fast l-fold cross validation, experiments on five benchmark regression data sets are evaluated.     

IUKF neural network modeling for FOG temperature drift

A novel neural network based on iterated unscented Kalman filter （IUKF） algorithm is established to model and com- pensate for the fiber optic gyro （FOG） bias drift caused by temperature. In the network, FOG temperature and its gradient are set as input and the FOG bias drift is set as the expected output. A 2-5-1 network trained with IUKF algorithm is established. The IUKF algorithm is developed on the basis of the unscented Kalman filter （UKF）. The weight and bias vectors of the hidden layer are set as the state of the UKF and its process and measurement equations are deduced according to the network architecture. To solve the unavoidable estimation deviation of the mean and covariance of the states in the UKF algorithm, iterative computation is introduced into the UKF after the measurement update. While the measure- ment noise R is extended into the state vectors before iteration in order to meet the statistic orthogonality of estimate and mea- surement noise. The IUKF algorithm can provide the optimized estimation for the neural network because of its state expansion and iteration. Temperature rise （-20-20℃） and drop （70-20℃） tests for FOG are carried out in an attemperator. The temperature drift model is built with neural network, and it is trained respectively with BP, UKF and IUKF algorithms. The results prove that the proposed model has higher precision compared with the back- propagation （BP） and UKF network models.     

WHO WON THE 2008 OLYMPICS？ A MULTICRITERIA DECISION OF MEASURING INTANGIBLES

It often happens that at the end of Olympics games the medals won by more than one country are many and close in total number as in the 2008 games where China won 100 medals with many gold ones and the United States won 110 medals but with a lesser number of gold medals. The question is： Although it is often done arbitrarily, is there a way to quantify the values of gold, silver and bronze medals legitimately to resolve this concern？ This short exposition shows that there is by using the author＇s theory for the measurement of intangibles, the Analytic Hierarchy Process.     

Asymptotic and stable proper ties of general stochastic functional differential equations

The asymptotic and stable properties of general stochastic functional differential equations are investigated by the multiple Lyapunov function method, which admits non-negative up-per bounds for the stochastic derivatives of the Lyapunov functions, a theorem for asymptotic properties of the LaSal e-type described by limit sets of the solutions of the equations is obtained. Based on the asymptotic properties to the limit set, a theorem of asymptotic stability of the stochastic functional differential equations is also established, which enables us to construct the Lyapunov functions more easily in application. Particularly, the wel-known classical theorem on stochastic stability is a special case of our result, the operator LV is not required to be negative which is more general to fulfil and the stochastic perturbation plays an important role in it. These show clearly the improvement of the traditional method to find the Lyapunov functions. A numerical simulation example is given to il ustrate the usage of the method.     

FAMILIES OF p-ARY SEQUENCES WITH LOW CORRELATION AND LARGE LINEAR COMPLEXITY

This paper generalizes a method of generating shift sequences in the interleaved construc- tion proposed by Gong. With the new shift sequences, some new families of p-ary sequences with desired properties can be obtained. A lower bound on the number of new families of binary sequences is also established.     

Spectral analysis and stabilization of a coupled wave-ODE system

In this paper, an interconnected wave-ODE system with K-V damping in the wave equation and unknown parameters in the ODE is considered. It is found that the spectrum of the system operator is composed of two parts： Point spectrum and continuous spectrum. The continuous spectrum consists of an isolated point 1 1/d, and there are two branches of the asymptotic eigenvalues： The first branch is accumulating towards 1 -2, and the other branch tends to -∞. It is shown that there is a sequence of generalized eigenfunctions, which forms a Riesz basis for the Hilbert state space. As a consequence, the spectrum-determined growth condition and exponential stability of the system are concluded.     

Interactive multigraph visualization and exploration with a two-phase strategy

While it is very reasonable to use a multigraph consisting of multiple edges between vertices to represent various relationships, the multigraph has not drawn much attention in research. To visualize such a multigraph, a clear layout representing a global structure is of great importance, and interactive visual analysis which allows the multiple edges to be adjusted in appropriate ways for detailed presentation is also essential. A novel interactive two-phase approach to visualizing and exploring multigraph is proposed. The approach consists of two phases： the first phase improves the previous popular works on force-directed methods to produce a brief drawing for the aggregation graph of the input multigraph, while the second phase proposes two interactive strategies, the magnifier model and the thematic-oriented subgraph model. The former highlights the internal details of an aggregation edge which is selected interactively by user, and draws the details in a magnifying view by cubic Bezier curves; the latter highlights only the thematic subgraph consisting of the selected multiple edges that the user concerns. The efficiency of the proposed approach is demonstrated with a real-world multigraph dataset and how it is used effectively is discussed for various potential applications.     

Adaptive actuator failure compensation and disturbance rejection scheme for spacecraft

An adaptive actuator failure compensation scheme is proposed for attitude tracking control of spacecraft with unknown disturbances and uncertain actuator failures. A new feature of this adaptive control scheme is the adaptation of the failure pattern parameter estimates, as well as the failure signal parameter estimates, for direct adaptive actuator failure compensation. Based on an adaptive backstepping control design, the estimates of the disturbance parameters are used to solve the disturbance rejection problem. The unknown disturbances are compensated completely with the stability of the whole closed-loop system. The scheme is not only able to accommodate uncertain actuator failures, but also robust against unknown external disturbances. Simulation results verify the desired adaptive actuator failure compensation performance.     

Optimal binary codes from one-lee weight codes and two-lee weight projective codes over ℤ4

This paper investigates the structures and properties of one-Lee weight codes and two-Lee weight projective codes over Z4.The authors first give the Pless identities on the Lee weight of linear codes over Z4.Then the authors study the necessary conditions for linear codes to have one-Lee weight and two-Lee projective weight respectively,the construction methods of one-Lee weight and two-Lee weight projective codes over Z4 are also given.Finally,the authors recall the weight-preserving Gray map from（Z4n,Lee weight）to（F2（2n）,Hamming weight）,and produce a family of binary optimal oneweight linear codes and a family of optimal binary two-weight projective linear codes,which reach the Plotkin bound and the Griesmer bound.     

Robust bounded control for uncertain flight dynamics using disturbance observer

The robust bounded flight control scheme is developed for the uncertain longitudinal flight dynamics of the fighter with control input saturation invoking the backstepping technique. To enhance the disturbance rejection ability of the robust flight control for fighters, the sliding mode disturbance observer is designed to estimate the compounded disturbance including the unknown external disturbance and the effect of the control input saturation. Based on the backstepping technique and the compounded disturbance estimated output, the robust bounded flight control scheme is proposed for the fighter with the unknown external disturbance and the control input saturation. The closed-loop system stability under the developed robust bounded flight control scheme is rigorously proved using the Lyapunov method and the uniformly asymptotical convergences of all closed-loop signals are guaranteed. Finally, simulation results are presented to show the effectiveness of the proposed robust bounded flight control scheme for the uncertain longitudinal flight dynamics of the fighter.     

Exact inference for two exponential populations with competing risks data

In a reliability comparative test, the joint censoring model is usually adopted to evaluate the performances of units with the same facility. However, most researchers ignore the pos- sibility that there is more than one factor for the failure when a test unit fails. To solve this problem, we consider a joint Type-II hybrid censoring model for the analysis of exponential competing failure data. Based on the maximum likelihood theory, we compute the maximum likelihood estimators （MLEs） of parameters and then obtain the condition ensuring MLEs existence for every unknown parameter. Then we derive the conditional exact distributions and corresponding moment properties for parameters by the moment generating function （MGF）. A Monte-Carlo simulation is conducted to compare the performances of different ways. And finally, we conduct a numerical example to illustrate the proposed method.     

Multi-agent consensus with time-varying delays and switching topologies

The consensus problems of multi-agents with time-varying delays and switching topologies are studied. First, assume that an agent receives state information from its neighbors with fixed communication delays and processes its own state information with time-varying self-delay respectively. The state time-delay feedback is introduced into the existing consensus protocol to begenerate an improved protocol. Then a sufficient condition is derived which can make the system with time-varying self-delays achieve the consensus. On this basis, a specific form of consensus equilibrium influenced by the initial states of agents, time-delays and state feedback intensity is figured out. In addition, the multi-agent consensus is considered with time-varying topologies. Finally, simulations are presented to il ustrate the validity of theoretical results.     

Shallow water source localization using a mobile shor t horizontal array

This paper presents an approach to the challenging is- sue of passive source localization in shallow water using a mobile short horizontal linear array with length less than ten meters. The short array can be conveniently placed on autonomous underwa- ter vehicles and deployed for adaptive spatial sampling. However, the use of such small aperture passive sonar systems makes it difficult to acquire sufficient spatial gain for localizing long-range sources. To meet the requirement, a localization approach that employs matched-field based techniques that enable the short ho- rizontal linear array is used to passively localize acoustic sources in shallow water. Furthermore, the broadband processing and inter-position processing provide robustness against ocean en- vironmental mismatch and enhance the stability of the estimation process. The proposed approach＇s ability to localize acoustic sources in shallow water at different signal-to-noise ratios is examined through the synthetic test cases where the sources are located at the endfire and some other bearing of the mobile short horizontal linear array. The presented results demonstrate that the positional parameters of the estimated source build up over time as the array moves at a low speed along a straight line at a constant depth.     

Optimal redundancy allocation for reliability systems with imperfect switching

The problem of stochastically allocating redundant com- ponents to increase the system lifetime is an important topic of reliability. An optimal redundancy allocation is proposed, which maximizes the expected lifetime of a reliability system with sub- systems consisting of components in parallel. The constraints are minimizing the total resources and the sizes of subsystems. In this system, each switching is independent with each other and works with probability p. Two optimization problems are studied by an incremental algorithm and dynamic programming technique respectively. The incremental algorithm proposed could obtain an approximate optimal solution, and the dynamic programming method could generate the optimal solution,     

Elastic pointer directory organization for scalable shared memory multiprocessors

In the field of supercomputing, one key issue for scal-able shared-memory multiprocessors is the design of the directory which denotes the sharing state for a cache block. A good direc-tory design intends to achieve three key attributes： reasonable memory overhead, sharer position precision and implementation complexity. However, researchers often face the problem that gain-ing one attribute may result in losing another. The paper proposes an elastic pointer directory （EPD） structure based on the analysis of shared-memory applications, taking the fact that the number of sharers for each directory entry is typical y smal . Analysis re-sults show that for 4 096 nodes, the ratio of memory overhead to the ful-map directory is 2.7%. Theoretical analysis and cycle-accurate execution-driven simulations on a 16 and 64-node cache coherence non uniform memory access （CC-NUMA） multiproces-sor show that the corresponding pointer overflow probability is reduced significantly. The performance is observed to be better than that of a limited pointers directory and almost identical to the ful-map directory, except for the slight implementation complex-ity. Using the directory cache to explore directory access locality is also studied. The experimental result shows that this is a promis-ing approach to be used in the state-of-the-art high performance computing domain.