Radial acceleration estimation of multiple high maneuvering targets

The acceleration of a high maneuvering target in signal processing is helpful to enhance the performance of the tracker and facilitate the classification of targets. At present, most of the research on acceleration estimation is carried out in cases of a single target with time-frequency analysis methods such as fractional Fourier transform （FRFT）, Hough-ambiguity transform （HAT）, and Wigner-Vil e distribution （WVD）, which need to satisfy enough time duration and sampling theorem. Only one reference proposed a method of acceleration estimation for multiple targets based on modified polynomial phase transform （MPPT） in the lin-ear frequency modulation （LFM） continuous-wave （CW） radar. The method of acceleration estimation for multiple targets in the pulse Doppler （PD） radar has not been reported so far. Compressive sensing （CS） has the advantage of sampling at a low rate and short duration without sacrificing estimation performance. There-fore, this paper proposes a new method of acceleration estimation for multiple maneuvering targets with the unknown number based on CS with pulse Doppler signals. Simulation results validate the effectiveness of the proposed method under several conditions with different duration, measurement numbers, signal to noise ra-tios （SNR）, and regularization parameters, respectively. Simulation results also show that the performance of the proposed method is superior to that of FRFT and HAT in the condition of multiple targets.     

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.     

Blind reconstruction of convolutional code based on segmented Walsh-Hadamard transform

Walsh-Hadamard transform （WriT） can solve linear error equations on Field F2, and the method can be used to recover the parameters of convolutional code. However, solving the equations with many unknowns needs enormous computer memory which limits the application of WriT. In order to solve this problem, a method based on segmented WriT is proposed in this paper. The coefficient vector of high dimension is reshaped and two vectors of lower dimension are obtained. Then the WriT is operated and the requirement for computer memory is much reduced. The code rate and the constraint length of convolutional code are detected from the Walsh spectrum. And the check vector is recovered from the peak position. The validity of the method is verified by the simulation result, and the performance is proved to be optimal.     

DCT domain filtering method for multi-antenna code acquisition

For global navigation satellite system （GNSS） signals in Gaussian and Rayleigh fading channel, a novel signal detection algorithm is proposed. Under the low frequency uncertainty case, after performing discrete cosine transform （DCT） to the outputs of the partial matched filter （PMF） for every antenna, the high order com- ponents in the transforming domain will be filtered, then the equalgain （EG） combination for the inverse discrete cosine transform （IDCT） reconstructed signal would be done subsequently. Thus, due to the different frequency distribution characteristics between the noise and signals, after EG combination, the energy of signals has almost no loss and the noise energy is greatly reduced. The theoretical analysis and simulation results show that the detection algorithm can effectively improve the signal-to-noise ratio of the captured signal and increase the probability of detection under the same false alarm probability. In addition, it should be pointed out that this method can also be applied to Rayleigh fading channels with moving antenna.     

Method for electromagnetic detection satellites scheduling based on genetic algorithm with alterable penalty coefficient

The electromagnetic detection satellite （EDS） is a type of earth observation satellites （EOSs）. The Information collected by EDSs plays an important role in some fields, such as industry, science and military. The scheduling of EDSs is a complex combinatorial optimization problem. Current research mainly focuses on the scheduling of imaging satellites and SAR satellites, but little work has been done on the scheduling of EDSs for its specific characteristics. A multi-satellite scheduling model is established, in which the specific constrains of EDSs are considered, then a scheduling algorithm based on the genetic algorithm （GA） is proposed. To deal with the specific constrains of EDSs, a penalty function method is introduced. However, it is hard to determine the appropriate penalty coefficient in the penalty function. Therefore, an adaptive adjustment mechanism of the penalty coefficient is designed to solve the problem, as well as improve the scheduling results. Experimental results are used to demonstrate the correctness and practicability of the proposed scheduling algorithm.     

The Grid Algorithm of the Development Coefficient and the Combination Coefficient of Background Value in GM（1,1） Model

This article gives the algorithm of the sector in which the development coefficient is, and the steps to simultaneously calculate the development coefficient and combination coefficient of background value. Unifying the development coefficient and the background value＇s coefficient of combination to optimize the model together, avoiding the malpractice to separate the two in traditional method, and avoiding the error brought out by matrix multiplication because of matrix＇s illness and so on in the traditional way, therefore increases the precision of the model.     

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.     

Improved HHT and its application in narrowband radar imaging for precession cone-shaped targets

Imaging the spatial precession cone-shaped targets with narrowband radar is a new technical approach in mid-course recognition problem. However, most existing time-frequency methods still have some inevitable deficiencies for extracting microDoppler information in practical applications, which leads to blurring of the image. A new narrowband radar imaging algorithm for the precession cone-shaped targets is proposed. The instantaneous frequency of each scattering point is gained by using the improved Hilbert-Huang transform, then the positions of scattering points in the parameter domain are reconstructed. Numerical simulation and experiment results confirm the effectiveness and high precision of the proposed algorithm.     

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.     

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.     

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.     

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.     

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.     

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.     

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.     

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.     

Flocking of multi-robot systems with connectivity maintenance on directed graphs

Analysis and design techniques for cooperative flocking of nonholonomic multi-robot systems with connectivity maintenance on directed graphs are presented. First, a set of bounded and smoothly distributed control protocols are devised via carefully designing a class of bounded artificial potential fields （APF） which could guarantee the connectivity maintenance, col ision avoidance and distance stabilization simultaneously during the system evolution. The connectivity of the underlying network can be preserved, and the desired stable flocking behavior can be achieved provided that the initial communication topology is strongly connected rather than undirected or balanced, which relaxes the constraints for group topology and extends the previous work to more generalized directed graphs. Furthermore, the proposed control algorithm is extended to solve the flocking problem with a virtual leader. In this case, it is shown that al robots can asymptotically move with the desired velocity and orientation even if there is only one informed robot in the team. Finally, nontrivial simulations and experiments are conducted to verify the effectiveness of the proposed algorithm.     

Low side lobe pattern synthesis using projection method with genetic algorithm for truncated cone conformal phased arrays

A hybrid method for synthesizing antenna＇s three dimensional （3D） pattern is proposed to obtain the low sidelobe feature of truncated cone conformal phased arrays. In this method, the elements of truncated cone conformal phased arrays are projected to the tangent plane in one generatrix of the truncated cone. Then two dimensional （2D） Chebyshev amplitude distribution optimization is respectively used in two mutual vertical directions of the tangent plane. According to the location of the elements, the excitation current amplitude distribution of each element on the conformal structure is derived reversely, then the excitation current amplitude is further optimized by using the genetic algorithm （GA）. A truncated cone problem with 8x8 elements on it, and a 3D pattern desired side lobe level （SLL） up to 35 dB, is studied. By using the hybrid method, the optimal goal is accomplished with acceptable CPU time, which indicates that this hybrid method for the low sidelobe synthesis is feasible.