Direct P-code acquisition algorithm based on bidirectional overlap technique

According to the signal-to-noise ratio （SNR） loss of average algorithms in direct P-code acquisition method, this paper analyzes the SNR performance of the overlap average algorithm quantitatively, and derives the relationship of SNR loss with overlap shift value and initial average phase difference in the overlap average algorithm. On this basis, the bidirectional overlap average algorithm based on optimal correlation SNR is proposed. The algorithm maintains SNR consistent in the entire initial average phase difference space, and has a better SNR performance than the overlap average algorithm. The effectiveness of the algorithm is verified by both theoretical analysis and simulation results. The SNR performance of the bidirectional overlap average algorithm is 5 dB better than that of the direct average algorithm, and 2 dB better than that of the overlap average algorithm, which provides the support for direct P-code acquisition in low SNR.     

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.     

ESTIMATION AND INFERENCE FOR VARYING-COEFFICIENT REGRESSION MODELS WITH ERROR-PRONE COVARIATES

This paper studies the estimation and inference for a class of varying-coefficient regression models with error-prone covariates. The authors focus on the situation where the covariates are unobserved, there are no repeated measurements and the covariance matrix of the measurement errors is unknown, but some auxiliary information is available. The authors propose an instrumental variable type local polynomial estimator for the unknown varying-coefficient functions, and show that the estimator achieves the optimal nonparametric convergence rate, is asymptotically normal, and avoids using undersmoothing to allow the bandwidths to be selected using data-driven methods. A simulation is carried out to study the finite sample performance of the proposed estimator, and a real date set is analyzed to illustrate the usefulness of the developed methodology.     

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.     

Novel multi-objective optimization algorithm

Many multi-objective evolutionary algorithms （MOEAs） can converge to the Pareto optimal front and work well on two or three objectives, but they deteriorate when faced with manyobjective problems. Indicator-based MOEAs, which adopt various indicators to evaluate the fitness values （instead of the Paretodominance relation to select candidate solutions）, have been regarded as promising schemes that yield more satisfactory results than well-known algorithms, such as non-dominated sort- ing genetic algorithm （NSGA-II） and strength Pareto evolutionary algorithm （SPEA2）. However, they can suffer from having a slow convergence speed. This paper proposes a new indicatorbased multi-objective optimization algorithm, namely, the multi- objective shuffled frog leaping algorithm based on the ε indicator （ε-MOSFLA）. This algorithm adopts a memetic meta-heuristic, namely, the SFLA, which is characterized by the powerful capability of global search and quick convergence as an evolutionary strategy and a simple and effective E-indicator as a fitness assignment scheme to conduct the search procedure. Experimental results, in comparison with other representative indicator-based MOEAs and traditional Pareto-based MOEAs on several standard test problems with up to 50 objectives, show that ε-MOSFLA is the best algorithm for solving many-objective optimization problems in terms of the solution quality as well as the speed of convergence.     

Global minimization of adaptive local image fitting energy for image segmentation

The active contour model based on local image fitting （LIF） energy is an effective method to deal with intensity inhomo- geneities, but it always conflicts with the local minimum problem because LIF has a nonconvex energy function form. At the same time, the parameters of LIF are hard to be chosen for better per- formance. A global minimization of the adaptive LIF energy model is proposed. The regularized length term which constrains the zero level set is introduced to improve the accuracy of the bound- aries, and a global minimization of the active contour model is presented, in addition, based on the statistical information of the intensity histogram, the standard deviation σ with respect to the truncated Gaussian window is automatically computed according to images. Consequently, the proposed method improves the performance and adaptivity to deal with the intensity inhomo- geneities. Experimental results for synthetic and real images show desirable performance and efficiency of the proposed method.     

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,     

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.     

Angular extent effect of micromotion target in SAR image by polar format algorithm

Target micromotion not only plays an important role in target recognition but also leads to esoteric characteristics in synthetic aperture radar （SAR） imaging. This paper finds out an interesting phenomenon, i.e. the angular extent effect, in micro-motion target images formulated by the polar format algorithm. A micromotion target takes on multiple pairs of paired echoes （PEs） around the true point, and each PE extends for an angle which is exactly equal to the angular extent of the synthetic aperture, regardless of the micromotion frequency. The effect is derived and interpreted by using the characteristics of Bessel functions. Then it is demonstrated by simulation experiments of a target with different micromotion frequencies. The revelation and interpretation of the effect is highly beneficial to micromotion-target SAR image understanding as wel as target recognition.     

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.     

Improved algorithms to plan missions for agile earth observation satellites

This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.     

New analytical imaging algorithm for general case airborne bistatic SAR

This paper focuses on the general case （GC） airborne bistatic synthetic aperture radar （SAR） data processing, and a new analytical imaging algorithm based on the extended Loffeld＇s bistatic formula （ELBF） is proposed. According to the bistatic SAR geometry, the track decoupling formulas that convert the bistatic geometry to the receiver-referenced geometry in a concise way are derived firstly. Then phase terms of ELBF are decomposed into two independent phase terms as the range phase term and the azimuth phase term in a new way. To get the focusing result, the bistatic deformation （BD） term is compensated in the two-dimensional （2- D） frequency domain, and the space-variances of the range phase term and the azimuth phase term are eliminated by chirp scaling （CS） and chirp z-transform （CZT）, respectively. The effectiveness of the proposed algorithm is verified by the simulation results.     

Knowledge-based detection method for SAR targets

When the classical constant false-alarm rate （CFAR） combined with fuzzy C-means （FCM） algorithm is applied to target detection in synthetic aperture radar （SAR） images with complex background, CFAR requires block-by-block estimation of clutter models and FCM clustering converges to local optimum. To address these problems, this paper pro-poses a new detection algorithm： knowledge-based combined with improved genetic algorithm-fuzzy C-means （GA-FCM） algorithm. Firstly, the algorithm takes target region＇s maximum and average intensity, area, length of long axis and long-to-short axis ratio of the external ellipse as factors which influence the target appearing probabil- ity. The knowledge-based detection algorithm can produce preprocess results without the need of estimation of clutter models as CFAR does. Afterward the GA-FCM algorithm is improved to cluster pre-process results. It has advantages of incorporating global optimizing ability of GA and local optimizing ability of FCM, which will further eliminate false alarms and get better results. The effectiveness of the proposed technique is experimentally validated with real SAR images.     

Self-adjusting decision feedback equalizer for variational underwater acoustic channel environments

Aimed at the abominable influences to blind equaliza-tion algorithms caused by complex time-space variability existing in underwater acoustic channels, a new self-adjusting decision feedback equalization （DFE） algorithm adapting to different under-water acoustic channel environments is proposed by changing its central tap position. Besides, this new algorithm behaves faster convergence speed based on the analysis of equalizers’ working rules, which is more suitable to implement communications in dif-ferent unknown channels. Corresponding results and conclusions are validated by simulations and spot experiments.     

Test selection and optimization for PHM based on failure evolution mechanism model

The test selection and optimization （TSO） can improve the abilities of fault diagnosis, prognosis and health-state evalua- tion for prognostics and health management （PHM） systems. Traditionally, TSO mainly focuses on fault detection and isolation, but they cannot provide an effective guide for the design for testability （DFT） to improve the PHM performance level. To solve the problem, a model of TSO for PHM systems is proposed. Firstly, through integrating the characteristics of fault severity and propa- gation time, and analyzing the test timing and sensitivity, a testability model based on failure evolution mechanism model （FEMM） for PHM systems is built up. This model describes the fault evolution- test dependency using the fault-symptom parameter matrix and symptom parameter-test matrix. Secondly, a novel method of in- herent testability analysis for PHM systems is developed based on the above information. Having completed the analysis, a TSO model, whose objective is to maximize fault trackability and mini- mize the test cost, is proposed through inherent testability analysis results, and an adaptive simulated annealing genetic algorithm （ASAGA） is introduced to solve the TSO problem. Finally, a case of a centrifugal pump system is used to verify the feasibility and effectiveness of the proposed models and methods. The results show that the proposed technology is important for PHM systems to select and optimize the test set in order to improve their performance level.     

Optimized LDPC differential-encoded 16QAM scheme for high-speed transmission systems

The 16-ary quadrature amplitude modulation （16QAM） is a high spectral efficient scheme for high-speed transmission systems. To remove the phase ambiguity in the coherent detection system, differential-encoded 16QAM （DE-16QAM） is usually used, however, it will cause performance degradation about 3 dB as compared to the conventional 16QAM. To overcome the performance loss, a serial concatenated system with outer low density parity check （LDPC） codes and inner DE-16QAM is proposed. At the receiver, joint iterative differential demodulation and decoding （ID） is carried out to approach the maximum likelihood performance. Moreover, a genetic evolution algorithm based on the extrinsic information transfer chart is proposed to optimize the degree distribution of the outer LDPC codes. Both theoretical analyses and simulation results indicate that this algorithm not only compensates the performance loss, but also obtains a significant performance gain, which is up to 1 dB as compared to the conventional non-DE-16QAM.     

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.     

Multi-dimensional scattering properties diagnosis system of scale aircraft model in an anechoic chamber

Aiming at the concept of ＂diagnosis＂, a simple and effective broadband radar cross section （RCS） measurement system is constructed, and some multi-dimensional scattering properties diagnosis techniques are presented based on the system. Firstly, a stepped-frequency signal is employed to achieve high range resolution, combining with a variety of signal processing tech- niques. Secondly, cross-range resolution is gained with a rotating table, and the high-resolution two-dimensional （2-D） imaging of the scale model is obtained by the microwave imaging theory. Finally, two receiving antennas with a small distance in altitude are used, and the three-dimensional （3-D） height distribution of scattering points on the scale model is extracted from the phase of images. Some typical bodies and a scale aircraft model are diagnosed in an anechoic chamber. The experimental results show that, after scaling with a metal sphere, the accurate one- dimensional （l-D） RCS pattern of the model is obtained, and it has a large dynamic range. When the bandwidth of the transmitting signal is 4 GHz, the resolution of the 2-D image can reach to 0.037 5 m. The 3-D height distribution of scattering points is given by interferometric measurement. This paper provides a feasible way to obtain high-precision scattering properties parameters of the scale aircraft model in a conventional rectangular anechoic chamber.     

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.     

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.