Shape control on probability density function in stochastic systems

A novel strategy of probability density function （PDF） shape control is proposed in stochastic systems. The control er is designed whose parameters are optimal y obtained through the improved particle swarm optimization algorithm. The parameters of the control er are viewed as the space position of a particle in particle swarm optimization algorithm and updated continual y until the control er makes the PDF of the state variable as close as possible to the expected PDF. The proposed PDF shape control technique is compared with the equivalent linearization technique through simulation experiments. The results show the superiority and the effectiveness of the proposed method. The control er is excellent in making the state PDF fol ow the expected PDF and has the very smal error between the state PDF and the expected PDF, solving the control problem of the PDF shape in stochastic systems effectively.     

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.     

Novel magnetic field computation model in pattern classification

Field computation, an emerging computation technique, has inspired passion of intelligence science research. A novel field computation model based on the magnetic field theory is constructed. The proposed magnetic field computation （MFC） model consists of a field simulator, a non-derivative optimization algo- rithm and an auxiliary data processing unit. The mathematical model is deduced and proved that the MFC model is equivalent to a quadratic discriminant function. Furthermore, the finite element prototype is derived, and the simulator is developed, combining with particle swarm optimizer for the field configuration. Two benchmark classification experiments are studied in the numerical experiment, and one notable advantage is demonstrated that less training samples are required and a better generalization can be achieved.     

Response surface method using grey relational analysis for decision making in weapon system selection

A proper weapon system is very important for a na- tional defense system. Generally, it means selecting the optimal weapon system among many alternatives, which is a multiple- attribute decision making （MADM） problem. This paper proposes a new mathematical model based on the response surface method （RSM） and the grey relational analysis （GRA）. RSM is used to obtain the experimental points and analyze the factors that have a significant impact on the selection results. GRA is used to an- alyze the trend relationship between alternatives and reference series. And then an RSM model is obtained, which can be used to calculate all alternatives and obtain ranking results. A real world application is introduced to illustrate the utilization of the model for the weapon selection problem. The results show that this model can be used to help decision-makers to make a quick comparison of alternatives and select a proper weapon system from multiple alternatives, which is an effective and adaptable method for solving the weapon system selection problem.     

Autotuning algorithm of particle swarm PID parameter based on D-Tent chaotic model

An improved particle swarm algorithm based on the D-Tent chaotic model is put forward aiming at the standard particle swarm algorithm. The convergence rate of the late of proposed algorithm is improved by revising the inertia weight of global optimal particles and the introduction of D-Tent chaotic sequence. Through the test of typical function and the autotuning test of proportionalintegral-derivative （PID） parameter, finally a simulation is made to the servo control system of a permanent magnet synchronous motor （PMSM） under double-loop control of rotating speed and current by utilizing the chaotic particle swarm algorithm. Studies show that the proposed algorithm can reduce the iterative times and improve the convergence rate under the condition that the global optimal solution can be got.     

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.     

Reduced K-best sphere decoding algorithm based on minimum route distance and noise variance

This paper focuses on reducing the complexity of K-best sphere decoding （SD） algorithm for the detection of uncoded multi-ple input multiple output （MIMO） systems. The proposed algorithm utilizes the threshold-pruning method to cut nodes with partial Euclidean distances （PEDs） larger than the threshold. Both the known noise value and the unknown noise value are considered to generate the threshold, which is the sum of the two values. The known noise value is the smal est PED of signals in the detected layers. The unknown noise value is generated by the noise power, the quality of service （QoS） and the signal-to-noise ratio （SNR） bound. Simulation results show that by considering both two noise values, the proposed algorithm makes an efficient reduction while the performance drops little.     

Inference for constant-stress accelerated life test with Type-I progressively hybrid censored data from Burr-Xll distribution

This paper proposes a simple constant-stress accel- erated life test （ALT） model from Burr type XII distribution when the data are Type-I progressively hybrid censored. The maximum likelihood estimation （MLE） of the parameters is obtained through the numerical method for solving the likelihood equations. Approxi- mate confidence interval （CI）, based on normal approximation to the asymptotic distribution of MLE and percentile bootstrap Cl is derived. Finally, a numerical example is introduced and then a Monte Carlo simulation study is carried out to illustrate the pro- posed method.     

Solution for polarimetric radar cross section measurement and calibration

The exact radar cross-section （RCS） measurement is difficult when the scattering of targets is low. Ful polarimetric cali-bration is one technique that offers the potential for improving the accuracy of RCS measurements. There are numerous polarimetric calibration algorithms. Some complex expressions in these algo-rithms cannot be easily used in an engineering practice. A radar polarimetric coefficients matrix （RPCM） with a simpler expression is presented for the monostatic radar polarization scattering matrix （PSM） measurement. Using a rhombic dihedral corner reflector and a metal ic sphere, the RPCM can be obtained by solving a set of equations, which can be used to find the true PSM for any target. An example for the PSM of a metal ic dish shows that the proposed method obviously improves the accuracy of cross-polarized RCS measurements.     

Near optimal condition of OMP algorithm in recovering sparse signal from noisy measurement

This paper analyzes the performance of the orthogonal matching pursuit （OMP） algorithm in recovering sparse signals from noisy measurement. Considering the fact that some matrices satisfy some restricted isometry properties （RIPs） but not the coherence condition, a superior RIP-based condition is proposed, which means that if the measurement matrix satisfies δk＋1 〈 1/（2 ＋ √k） and the minimum component signal-to-noise ratio （MCSNR） is bounded, the OMP algorithm can exactly identify the support of the original sparse signal within k iterations. Finally, the theoretical results are verified by numerical simulations con- cerning different values of MCSNR and noise levels.     

Cramer-Rao bound of joint estimation of target location and velocity for coherent MIMO radar

The optimal estimation performance of target parameters is studied. First, the general form of Cramer-Rao bound （CRB） for joint estimation of target location and velocity is derived for coherent multiple input multiple output （MIMO） radars. To gain some insight into the behavior of the CRB, the CRB with a set of given orthogonal waveforms is studied as a specific case. Second, a maximum likelihood （ML） estimation algorithm is proposed. The mean square error （MSE） of the ML estimation of target location and velocity is obtained by Monte Carlo simulation and it approaches CRB in the high signal-to-noise ratio （SNR） region.     

Simulated annealing spectral clustering algorithm for image segmentation

The similarity measure is crucial to the performance of spectral clustering. The Gaussian kernel function based on the Euclidean distance is usual y adopted as the similarity measure. However, the Euclidean distance measure cannot ful y reveal the complex distribution data, and the result of spectral clustering is very sensitive to the scaling parameter. To solve these problems, a new manifold distance measure and a novel simulated anneal-ing spectral clustering （SASC） algorithm based on the manifold distance measure are proposed. The simulated annealing based on genetic algorithm （SAGA）, characterized by its rapid convergence to the global optimum, is used to cluster the sample points in the spectral mapping space. The proposed algorithm can not only reflect local and global consistency better, but also reduce the sensitivity of spectral clustering to the kernel parameter, which improves the algorithm’s clustering performance. To efficiently apply the algorithm to image segmentation, the Nystrom method is used to reduce the computation complexity. Experimental results show that compared with traditional clustering algorithms and those popular spectral clustering algorithms, the proposed algorithm can achieve better clustering performances on several synthetic datasets, texture images and real images.     

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.     

Cramer-Rao bound and signal-to-noise ratio gain in distributed coherent aperture radar

This paper studies the estimation performance of the coherent processing parameter （CPP）, including time delay differences and phase synchronization errors among different apertures of the distributed coherent aperture radar （DCAR）. Firstly, three architectures of signal processing in the DCAR are introduced. Secondly, the closed-form Cramer-Rao bound （CRB） of the CPP estimation is derived and compared. Then, the closed-form CRB is verified by numerical simulations. Finally, when the next generation radar works in a fully coherent mode, the closed-form signal-to-noise ratio （SNR） gain of the three architectures is presented.     

Novel sensor selection strategy for LPI based on an improved IMMPF tracking method

Sensor platforms with active sensing equipment such as radar may betray their existence, by emitting energy that will be intercepted by enemy surveillance sensors. The radar with less emission has more excellent performance of the low probability of intercept（LPI）. In order to reduce the emission times of the radar, a novel sensor selection strategy based on an improved interacting multiple model particle filter（IMMPF） tracking method is presented. Firstly the IMMPF tracking method is improved by increasing the weight of the particle which is close to the system state and updating the model probability of every particle. Then a sensor selection approach for LPI takes use of both the target＇s maneuverability and the state＇s uncertainty to decide the radar＇s radiation time. The radar will work only when the target＇s maneuverability and the state＇s uncertainty exceed the control capability of the passive sensors. Tracking accuracy and LPI performance are demonstrated in the Monte Carlo simulations.     

Codebook design for uplink of densely small cells

The shrinking of cell-size brings significant changes to the wireless uplink of densely small cells （DSCs）. A codebook design is proposed that utilizes the strong line of sight （LOS） chan- nel component existing in a DSC system for uplink of the DSC system. To further improve the uplink performance, the high-rank codebook is designed based on singular value decomposition （SVD） due to the unnecessary preservation of strict constant modulus in the DSC system. And according to the simulation result, the proposed codebook leads to significant sum-rate gain and appreciable block error rate （BLER） performance improvement in the DSC system.     

Multi-polarization reconstruction from compact polarimetry based on modified four-component scattering decomposition

An improved algorithm for multi-polarization reconstruction from compact polarimetry （CP） is proposed. According to two fundamental assumptions in compact polarimetric reconstruction, two improvements are proposed. Firstly, the four-component model-based decomposition algorithm is modified with a new volume scattering model. The decomposed helix scattering component is then used to deal with the non-reflection symmetry condition in compact polarimetric measurements. Using the decomposed power and considering the scattering mechanism of each component, an average relationship between copolarized and crosspolarized channels is developed over the original polarization state extrapolation model. E-SAR polarimetric data acquired over the Oberpfaffenhofen area and JPL/AIRSAR polarimetric data acquired over San Francisco are used for verification, and good reconstruction results are obtained, demonstrating the effectiveness of the proposed algorithm.     

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.     

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.     

Web software reliability modeling with random impulsive shocks

As the web-server based business is rapidly developed and popularized, how to evaluate and improve the reliability of web-servers has been extremely important. Although a large num- ber of software reliability growth models （SRGMs）, including those combined with multiple change-points （CPs）, have been available, these conventional SRGMs cannot be directly applied to web soft- ware reliability analysis because of the complex web operational profile. To characterize the web operational profile precisely, it should be realized that the workload of a web server is normally non-homogeneous and often observed with the pattern of random impulsive shocks. A web software reliability model with random im- pulsive shocks and its statistical analysis method are developed. In the proposed model, the web server workload is characterized by a geometric Brownian motion process. Based on a real data set from IIS server logs of ICRMS website （www.icrms.cn）, the proposed model is demonstrated to be powerful for estimating impulsive shocks and web software reliability.