Modified MUSIC estimation for correlated signals with compressive sampling arrays

This paper addresses the issue of the direction of arrival （DOA） estimation under the compressive sampling （CS） framework. A novel approach, modified multiple signal classification （MMUSIC） based on the CS array （CSA-MMUSIC）, is proposed to resolve the DOA estimation of correlated signals and two closely adjacent signals. By using two random CS matrices, a large size array is compressed into a small size array, which effectively reduces the number of the front end circuit. The theoretical analysis demonstrates that the proposed approach has the advantages of low computational complexity and hardware structure compared to other MMUSIC approaches. Simulation results show that CSAMMUSIC can possess similar angular resolution as MMUSIC.     

Frequency domain polarization weighted ESPRIT method for bearing angle

The signal to noise ratio （SNR） of seismic waves is usually very low after long distance transmission. For this condition, to improve the bearing estimation capability in the low SNR, a frequency domain polarization weighted ESPRIT method using a single vector device is proposed. The frequency domain polari- zation parameters extracted from the signals are used to design the weighted function which is applied to the received signals. The bearing angle and the target frequency are estimated through ESPRIT using the weighted signals. The simulation and experiment results show that the presented method can obtain accurate estimation values under the low SNR with little prior information.     

Blind channel estimation for multiple antenna OFDM system subject to unknown carrier frequency offset

The problem of channel estimation for multiple an- tenna orthogonal frequency division multiplexing （OFDM） systems subject to unknown carrier frequency offset （CFO） is addressed. Multiple signal classification （MUSIC）-Iike algorithm, which generally has been used for direction estimation or frequency estimation, is used for channel estimation in multiple antenna OFDM systems. A reduced dimensional （RD）-MUSIC based algorithm for channel estimation is proposed in multiple antenna OFDM systems with unknown CFO. The Cramer-Rao bound （CRB） of channel estimation in multiple antenna OFDM systems with unknown CFO is derived. The proposed algorithm has a superior performance of channel estimation compared with the Capon method and the least squares method.     

Modulation recognition of MIMO radar signal based on joint HOS and SNR algorithm

This paper presents a joint high order statistics （HOS） and signal-to-noise ratio （SNR） algorithm for the recognition of multiple-input multiple-output （MIMO） radar signal without a priori knowledge of the signal parameters. This method is capable of recognizing the MIMO radar signal as well as discriminating it from single-carrier signal adopted by conventional radar. Meanwhile, the sub-carrier number of the none-coding MIMO radar signal is estimated. Extensive simulations are carried out in different operating conditions. Simulation results prove the feasibility and indicate that the recognition probability could reach over 90% when the value of SNR is above 0 dB.     

Grating lobes suppression method for stepped frequency GB-SAR system

A grating lobes suppression method for chirp-subpulse stepped frequency（CSSF） signals is proposed, which is applied to deformation monitoring using the ground based synthetic aperture radar（GB-SAR） system. This method is based on accurate estimation and correction of the phase and amplitude error along two dimensions（range and azimuth）, i.e., the error estimation inside the subpulse（in-subpulse error） and across the stepped frequency subpulses（cross-subpulse error） of transmitted CSSF signals. Validated both with simulated data and experimental data recorded in the deformation monitoring campaign, it can be seen that the method as well as the relative conclusions can be fully and effectively applied to most of the stepped frequency systems.     

X-ray pulsar signal detection using photon interarrival time

The distribution probability of the photon interarrival time （PIT） without signal initial phases is derived based on the Poisson model of X-ray pulsar signals, and a pulsar signal detection algorithm employing the PIT sequence is put forward. The joint probability of the PIT sequence is regarded as a function of the distribution probability and used to compare a constant radiation intensity model with the nonhomogeneous Poisson model for the signal detection. The relationship between the number of detected photons and the probabilities of false negative and positive is studied, and the success rate and mean detection time are estimated based on the number of the given photons. For the spacecraft velocity data detection, the changes of time of photon arrival （TOPA） and PIT caused by spacecraft motion are presented first, then the influences on detection are analyzed respectively. By using the analytical pulse profile of PSR B0531＋21, the simulation of the Xray pulsar signal detection is implemented. The simulation results verify the effectiveness of the proposed method, and the contrast tests show that the proposed method is suitable for the spacecraft velocity data detection.     

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.     

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.     

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.     

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.     

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.     

Spiking neural P systems with anti-spikes and without annihilating priority as number acceptors

Spiking neural P systems with anti-spikes （ASN P systems） are variant forms of spiking neural P systems, which are inspired by inhibitory impulses/spikes or inhibitory synapses. The typical feature of ASN P systems is when a neuron contains both spikes and anti-spikes, spikes and anti-spikes wil immediately annihilate each other in a maximal way. In this paper, a restricted variant of ASN P systems, cal ed ASN P systems without anni-hilating priority, is considered, where the annihilating rule is used as the standard rule, i.e., it is not obligatory to use in the neuron associated with both spikes and anti-spikes. If the annihilating rule is used in a neuron, the annihilation wil consume one time unit. As a result, such systems using two categories of spiking rules （identified by （a, a） and （a,a^-）） can achieve Turing completeness as number accepting devices.     

Higher-order principal component pursuit via tensor approximation and convex optimization

Recovering the low-rank structure of data matrix from sparse errors arises in the principal component pursuit （PCP）. This paper exploits the higher-order generalization of matrix recovery, named higher-order principal component pursuit （HOPCP）, since it is critical in multi-way data analysis. Unlike the convexification （nuclear norm） for matrix rank function, the tensorial nuclear norm is stil an open problem. While existing preliminary works on the tensor completion field provide a viable way to indicate the low complexity estimate of tensor, therefore, the paper focuses on the low multi-linear rank tensor and adopt its convex relaxation to formulate the convex optimization model of HOPCP. The paper further propose two algorithms for HOPCP based on alternative minimization scheme： the augmented Lagrangian alternating direction method （ALADM） and its truncated higher-order singular value decomposition （ALADM-THOSVD） version. The former can obtain a high accuracy solution while the latter is more efficient to handle the computationally intractable problems. Experimental results on both synthetic data and real magnetic resonance imaging data show the applicability of our algorithms in high-dimensional tensor data processing.     

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.     

Composite nonlinear feedback control for output regulation problem of linear discrete-time systems with input saturation

Transient performance for output regulation problems of linear discrete-time systems with input saturation is addressed by using the composite nonlinear feedback（CNF） control technique. The regulator is designed to be an additive combination of a linear regulator part and a nonlinear feedback part. The linear regulator part solves the regulation problem independently which produces a quick output response but large oscillations. The nonlinear feedback part with well-tuned parameters is introduced to improve the transient performance by smoothing the oscillatory convergence. It is shown that the introduction of the nonlinear feedback part does not change the solvability conditions of the linear discrete-time output regulation problem. The effectiveness of transient improvement is illustrated by a numeric example.     

Identification of multiple inputs single output errors-in-variables system using cumulant

A higher-order cumulant-based weighted least square（HOCWLS） and a higher-order cumulant-based iterative least square（HOCILS） are derived for multiple inputs single output（MISO） errors-in-variables（EIV） systems from noisy input/output data. Whether the noises of the input/output of the system are white or colored, the proposed algorithms can be insensitive to these noises and yield unbiased estimates. To realize adaptive parameter estimates, a higher-order cumulant-based recursive least square（HOCRLS） method is also studied. Convergence analysis of the HOCRLS is conducted by using the stochastic process theory and the stochastic martingale theory. It indicates that the parameter estimation error of HOCRLS consistently converges to zero under a generalized persistent excitation condition. The usefulness of the proposed algorithms is assessed through numerical simulations.     

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.     

Ranking grey numbers based on dominance grey degrees

With respect to the decision making problems where a lot of fuzzy and grey information always exists in the real-life decision making information system methods as fuzzy mathematics, it is difficult for such uncertainty probability, and interval numbers to deal with. To this end, based on the thought and method of grey numbers, grey degrees and interval numbers, the concept of dominance grey degree is defined. And then a method of ranking interval grey numbers based on the dominance grey degree is proposed. After discussing the relevant properties, the paper finally uses an example to demonstrate the effectiveness and applicability of the model. The result shows that the proposed model can more accurately describe uncertainty decision making problems, and realize the total ordering process for multiple-attribute decision-making problems.     

Adaptive link layer security architecture for telecommand communications in space networks

Impressive advances in space technology are enabling complex missions, with potentially significant and long term impacts on human life and activities. In the vision of future space exploration, communication links among planets, satel ites, spacecrafts and crewed vehicles wil be designed according to a new paradigm, known as the disruption tolerant networking. In this scenario, space channel peculiarities impose a massive reengineering of many of the protocols usually adopted in terrestrial networks; among them, security solutions are to be deeply reviewed, and tailored to the specific space requirements. Security is to be provided not only to the payload data exchanged on the network, but also to the telecommands sent to a spacecraft, along possibly differentiated paths. Starting from the secure space telecommand design developed by the Consultative Committee for Space Data Systems as a response to agency-based requirements, an adaptive link layer security architecture is proposed to address some of the chal enges for future space networks. Based on the analysis of the communication environment and the error diffusion properties of the authentication algorithms, a suitable mechanism is proposed to classify frame retransmission requests on the basis of the originating event （error or security attack） and reduce the impact of security operations. An adaptive algorithm to optimize the space control protocol, based on estimates of the time varying space channel, is also presented. The simulation results clearly demonstrate that the proposed architecture is feasible and efficient, especially when facing malicious attacks against frame transmission.     

ROBUST CONSENSUS FOR MULTI-AGENT SYSTEMS OVER UNBALANCED DIRECTED NETWORKS

In this paper, a distributed consensus protocol is proposed for discrete-time single-integer multi-agent systems with measurement noises under general fixed directed topologies, The time-varying control gains satisfying the stochastic approximation conditions are introduced to attenuate noises, thus the closed-loop multi-agent system is intrinsically a linear time-varying stochastic difference system. Then the mean square consensus convergence analysis is developed based on the Lyapunov technique, and the construction of the Lyapunov function especially does not require the typical balanced network topology condition assumed for the existence of quadratic Lyapunov function. Thus, the proposed consensus protocol can be applicable to more general networked multi-agent systems, particularly when the bidirectional and/or balanced information exchanges between agents are not required. Under the proposed protocol, it is proved that the state of each agent converges in mean square to a common random variable whose mathematical expectation is the weighted average of agents＇ initial state values; meanwhile, the random variable＇s variance is bounded.