To validate the potential space-time adaptive processing (STAP) algorithms for airborne bistatic radar clutter suppression under nonstationary and non-Gaussian clutter environments, a statistically non-Gaussian, spacetime clutter model in varying bistatic geometrical scenarios is presented. The inclusive effects of the model contain the range dependency of bistatic clutter spectrum and clutter power variation in range-angle cells. To capture them, a new approach to coordinate system conversion is initiated into formulating bistatic geometrical model, and the bistatic non-Gaussian amplitude clutter representation method based on a compound model is introduced. The veracity of the geometrical model is validated by using the bistatic configuration parameters of multi-channel airborne radar measurement (MCARM) experiment. And simulation results manifest that the proposed model can accurately shape the space-time clutter spectrum tied up with specific airborne bistatic radar scenario and can characterize the heterogeneity of clutter amplitude distribution in practical clutter environments.
The asymptotic and stable properties of general stochastic functional differential equations are investigated by the multiple Lyapunov function method, which admits non-negative upper bounds for the stochastic derivatives of the Lyapunov functions, a theorem for asymptotic properties of the LaSalle-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 well-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 illustrate the usage of the method.
To investigate a class of nonlinear network control system, a robust fault diagnosis method is presented based on the robust state observer. To access the objective that the designed robust filter is maximally tolerant to disturbances and sensitive to fault, the robustness and stability properties of the fault diagnosis scheme are established rigorously. Using the residual vector, a fault tolerant controller is established in order to guarantee the stability of the closed-loop system, and the controller law can be obtained by solving a set of linear matrix inequalities. Then, some relevant sufficient conditions for the existence of a solution are given by applying Lyapunov stability theory. Finally, a simulation example is performed to show the effectiveness of the proposed approach.
This paper focuses on fast algorithm for computing the assignment reduct in inconsistent incomplete decision systems. It is quite inconvenient to judge the assignment reduct directly according to its definition. We propose the judgment theorem for the assignment reduct in the inconsistent incomplete decision system, which greatly simplifies judging this type reduct. On such basis, we derive a novel attribute significance measure and construct the fast assignment reduction algorithm (F-ARA), intended for computing the assignment reduct in inconsistent incomplete decision systems. Finally, we make a comparison between F-ARA and the discernibility matrix-based method by experiments on 13 University of California at Irvine (UCI) datasets, and the experimental results prove that F-ARA is efficient and feasible.
Adopting“simultaneous transmitting, simultaneous receiving”operational scheme, instantaneous polarization radar (IPR) can measure target polarization scattering matrix (PSM) using only once target echoes in two orthogonal polarization channels. Firstly, signal model and signal process are advanced under narrowband condition. Secondly, measurement performances of two typical IPR waveforms are analyzed in detail. At last, field experiments are carried out using X-band IPR system designed by National University of Defense Technology (NUDT), China. Compared with results obtained by alternative polarization measurement scheme, following results can be obtained: the difference of relative amplitude measurement results is smaller than 2 dB and that of relative phase measurement results is smaller than 10?, verifying the validity of instantaneous polarization measurement scheme.
By analyzing the traditional star-tracking correction technology, this paper studies the star-tracking direct correction method which is based on star sensor dynamic separation initial displacement angles and main errors of inertial measure unit (IMU) in order to carry out automatic navigation and improve the hitting accuracy and quick reaction capability of near-earth flight vehicles. Through comprehensive application and improvement of the best correction factor method, this paper proposes the startracking comprehensive correction method which combines the two methods above-mentioned and the accelerometer dynamic error separation technology. The simulation results show that obvious effects can be achieved by using the star-tracking integrated correction method.
For a large-scale adaptive array, the heavy computational load and the high-rate data transmission are two challenges in the implementation of an adaptive digital beamforming system. An efficient parallel digital beamforming (DBF) algorithm based on the least mean square algorithm (PLMS) is proposed. An appropriate method is found to partition the least mean square (LMS) algorithm into a number of operational modules, which can be easily executed in a distributed-parallel-processing fashion. As a result, the proposed PLMS algorithm provides an effective solution that can alleviate the bottleneck of high-rate data transmission and reduce the computational cost. PLMS requires less computational load than that of the conventional parallel algorithms based on the recursive least square (RLS) algorithm, as well as it is easier to be implemented to do real time adaptive array processing. Moreover, low sidelobe of the beam pattern is obtained by constraining the static steering vector with Tschebyscheff coefficients. Finally, a scheme of the PLMS algorithm using distributed-parallel-processing system is also proposed. The simulation results demonstrate that the PLMS algorithm has the same interference cancellation performance as that of the conventional LMS algorithm. Moreover, the PLMS algorithm can obtain the same good beamforming performance, regardless how the algorithm is partitioned. It is expected that the proposed algorithm will be used in a large-scale adaptive array system to deal with real time adaptive digital beamforming processing.
Failure prediction plays an important role for many tasks such as optimal resource management in large-scale system. However, accurately failure number prediction of repairable largescale long-running computing (RLLC) is a challenge because of the reparability and large-scale. To address the challenge, a general Bayesian serial revision prediction method based on Bootstrap approach and moving average approach is put forward, which can make an accurately prediction for the failure number. To demonstrate the performance gains of our method, extensive experiments on the data of Los Alamos National Laboratory (LANL) cluster is implemented, which is a typical RLLC system. And experimental results show that the prediction accuracy of our method is 80.2 %, and it is a greatly improvement with 4 % compared with some typical methods. Finally, the managerial implications of the models are discussed.
In this paper, a comprehensive overview of radar detection methods for low-altitude targets in maritime environments is presented, focusing on the challenges posed by sea clutter and multipath scattering. The performance of the radar detection methods under sea clutter, multipath, and combined conditions is categorized and summarized, and future research directions are outlined to enhance radar detection performance for low–altitude targets in maritime environments.
The problem of scheduling radar dwells in multifunction phased array radar systems is addressed. A novel dwell scheduling algorithm is proposed. The whole scheduling process is based on an online pulse interleaving technique. It takes the system timing and energy constraints into account. In order to adapt the dynamic task load, the algorithm considers both the priorities and deadlines of tasks. The simulation results demonstrate that compared with the conventional adaptive dwell scheduling algorithm, the proposed one can improve the task drop rate and system resource utility effectively.
For multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems, a joint timing synchronization and frequency offset acquisition algorithm based on fractional Fourier transform (FRFT) is proposed. The linear frequency modulation signals superimposed on the data signals are used as the training signals. By performing FRFT on the received signals and searching the peak value of the FRFT results, the receiver can realize timing synchronization and frequency offset acquisition simultaneously. Compared with the existing methods, the proposed algorithm can provide better timing synchronization performance and larger frequency offset acquisition range even under multi-path channels with low signal to noise ratio. Theoretical analysis and simulation results prove this point.
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 number 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 software 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 impulsive 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.
To investigate the low-complex and high-precise tracking method, a novel single link tracking scheme based on UWB localization is proposed. Two antenna arrays are settled at the fixed station (FS) to receive the UWB signal from mobile terminal (MT), one FS is enough for the proposed scheme to track the MT. The UWB multipath detection algorithm for time difference of arrival (TDOA) estimation is presented and TDOA is thus adopted to estimate angle of arrival (AOA), avoiding the synchronization and complicated beamforming for AOA. The impacts of localization errors, concluding multipath and non-line-of-sight (NLOS) errors are simulated for the proposed track scheme. It is demonstrated that the simulation curve can match the real target moving, and the feasibility of the proposed scheme is proved.
The problem of observer-based robust predictive control is studied for the singular systems with norm-bounded uncertainties and time-delay, and the design method of robust predictive observer-based controller is proposed. By constructing the Lyapunov function with the error terms, the infinite time domain “min-max” optimization problems are converted into convex optimization problems solving by the linear matrix inequality (LMI), and the sufficient conditions for the existence of this control are derived. It is proved that the robust stability of the closed-loop singular systems can be guaranteed by the initial feasible solutions of the optimization problems, and the regular and the impulse-free of the singular systems are also guaranteed. A simulation example illustrates the efficiency of this method.
To detect high frequency (HF) first-order sea echo spectra contaminated with ships, ionosphere interference, and other, a new characteristic-knowledge-aided detection method is proposed. With 2-D image features in range-Doppler spectrum, the trend of first-order sea echoes is extracted as indicative information by a multi-scale filter. Detection rules for both single and splitting first-order sea echoes are given based on the characteristic knowledge combining the indicative information with the global characteristics such as amplitude, symmetry, continuity,etc. Compared with the classical algorithms, the proposed method can detect and locate the first-order sea echo in the HF band more accurately especially in the environment with targets/clutters smearing. Experiments with real data verify the validity of the algorithm.
The robust H∞ filtering problem for uncertain discrete-time Markovian jump linear systems with modedependent time-delays is investigated. Attention is focused on designing a Markovian jump linear filter that ensures robust stochastic stability while achieving a prescribed H∞ performance level of the resulting filtering error system, for all admissible uncertainties. The key features of the approach include the introduction of a new type of stochastic Lyapunov functional and some free weighting matrix variables. Sufficient conditions for the solvability of this problem are obtained in terms of a set of linear matrix inequalities. Numerical examples are provided to demonstrate the reduced conservatism of the proposed approach.
A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the total inconsistency between the rankings of all alternatives for the group and the ones for every decision maker is defined after the decision maker weights in respect to the criteria are considered. Similarly, the otal nconsistency between their final rankings for the group and the ones under every criteria is determined after the criteria weights are taken into account. Then two nonlinear integer programming models minimizing respectively the two total inconsistencies above are developed and then transformed to two dynamic programming models to obtain separately the rankings of all alternatives for the group with respect to each criteria and their final rankings. A supplier selection case illustrated the proposed method, and some discussions on the results verified its effectiveness. This work develops a new measurement of ordinal preferences’ inconsistency in multi-criteria group decision-making (MCGDM) and extends the cook-seiford social selection function to MCGDM considering weights of criteria and decision makers and can obtain unique ranking result.
The time optimal problem for a two level quantum system is studied. We compare two different control strategies of bang-bang control and the geometric control, respectively, especially in the case of minimizing the time of steering the state from North Pole to South Pole on the Bloch sphere with bounded control. The time performances are compared for different parameters by the individual numerical simulation experiments, and the experimental results are analyzed. The results show that the geometric control spends less time than the bang-bang control does.
A novel multi-view 3D face registration method based on principal axis analysis and labeled regions orientation called local orientation registration is proposed. The pre-registration is achieved by transforming the multi-pose models to the standard frontal model’s reference frame using the principal axis analysis algorithm. Some significant feature regions, such as inner and outer canthus, nose tip vertices, are then located by using geometrical distribution characteristics. These regions are subsequently employed to compute the conversion parameters using the improved iterative closest point algorithm, and the optimal parameters are applied to complete the final registration. Experimental results implemented on the proper database demonstrate that the proposed method significantly outperforms others by achieving 1.249 and 1.910 mean root-mean-square measure with slight and large view variation models, respectively.
In the field of supercomputing, one key issue for scalable shared-memory multiprocessors is the design of the directory which denotes the sharing state for a cache block. A good directory design intends to achieve three key attributes: reasonable memory overhead, sharer position precision and implementation complexity. However, researchers often face the problem that gaining 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 typically small. Analysis results show that for 4 096 nodes, the ratio of memory overhead to the full-map directory is 2.7%. Theoretical analysis and cycleaccurate execution-driven simulations on a 16 and 64-node cache coherence non uniform memory access (CC-NUMA) multiprocessor 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 full-map directory, except for the slight implementation complexity. Using the directory cache to explore directory access locality is also studied. The experimental result shows that this is a promising approach to be used in the state-of-the-art high performance computing domain.
Rotating machinery is widely used in the industry. They are vulnerable to many kinds of damages especially for those working under tough and time-varying operation conditions. Early detection of these damages is important, otherwise, they may lead to large economic loss even a catastrophe. Many signal processing methods have been developed for fault diagnosis of the rotating machinery. Local mean decomposition (LMD) is an adaptive mode decomposition method that can decompose a complicated signal into a series of mono-components, namely product functions (PFs). In recent years, many researchers have adopted LMD in fault detection and diagnosis of rotating machines. We give a comprehensive review of LMD in fault detection and diagnosis of rotating machines. First, the LMD is described. The advantages, disadvantages and some improved LMD methods are presented. Then, a comprehensive review on applications of LMD in fault diagnosis of the rotating machinery is given. The review is divided into four parts:fault diagnosis of gears, fault diagnosis of rotors, fault diagnosis of bearings, and other LMD applications. In each of these four parts, a review is given to applications applying the LMD, improved LMD, and LMD-based combination methods, respectively. We give a summary of this review and some future potential topics at the end.
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.
The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented. The minimum distance and weight property lemmas and the theorem are proved for the generator matrix. Based upon the property of generator matrix, the structured algorithms of linear block codes are demonstrated. Since the complexity of optimal structured algorithm is very high, the binary linear block codes is searched by using the suboptimal structured algorithm. The comparison with Bose-Chaudhuri-Hocquenqhem (BCH) codes shows that the searched linear block codes are equivalent on minimum distance and can be designed for more block lengths. Because the linear block codes are used widely in communication systems and digital applications, the optimal and suboptimal structured algorithms must have great future being widely used in many applications and perspectives.
This paper focuses on the performance analysis of flexible reactive systems. The performance analysis consists of two phases: first system modeling, second performance evaluation. The paper models the flexible reactive system by the stochastic statecharts method, and uses the simulation method to evaluate the performance. To make use of the feature of event-triggered state transitions in the statecharts, a new method of simulation is proposed based on the techniques of the discrete-event system simulation. The new method solves the problem of computer implementation of stochastic events, probabilistic transition, concurrent states, parallel actions, and broadcast communication mechanism in the stochastic statecharts. An example of a flexible manufacturing system is presented. The simulation result of the example is consistent with the analytical result, which shows the feasibility of the proposed new simulation method.
A novel strategy of probability density function (PDF) shape control is proposed in stochastic systems. The controller is designed whose parameters are optimally obtained through the improved particle swarm optimization algorithm. The parameters of the controller are viewed as the space position of a particle in particle swarm optimization algorithm and updated continually until the controller 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 controller is excellent in making the state PDF follow the expected PDF and has the very small error between the state PDF and the expected PDF, solving the control problem of the PDF shape in stochastic systems effectively.
The design and performance analysis of networked control systems with random network delay in the forward channel is proposed, which are described in a state-space form. A new control scheme is used to overcome the effects of network transmission delay, which is termed networked predictive control (NPC). Furthermore, three different ways to choose control input are discussed and the performances are analyzed, respectively. Both real-time simulations and practical experiments show the effectiveness of the control scheme.
Modern battlefield doctrine is based on mobility, flexibility, and rapid response to changing situations. As is well known, mobile ad hoc network systems are among the best utilities for battlefield activity. Although much research has been done on secure routing, security issues have largely been ignored in applying mobile ad hoc network theory to computer technology. An ad hoc network is usually assumed to be homogeneous, which is an irrational assumption for armies. It is clear that soldiers, commanders, and commanders-in-chief should have different security levels and computation powers as they have access to asymmetric resources. Imitating basic military rank levels in battlefield situations, how multilevel security can be introduced into ad hoc networks is indicated, thereby controlling restricted classified information flows among nodes that have different security levels.
For target tracking and localization in bearing-only sensor network, it is an essential and significant challenge to solve the problem of plug-and-play expansion while stably enhancing the accuracy of state estimation. This paper proposes a distributed state estimation method based on two-layer factor graph. Firstly, the measurement model of the bearing-only sensor network is constructed, and by investigating the observability and the Cramer-Rao lower bound of the system model, the preconditions are analyzed. Subsequently, the location factor graph and cubature information filtering algorithm of sensor node pairs are proposed for localized estimation. Building upon this foundation, the mechanism for propagating confidence messages within the fusion factor graph is designed, and is extended to the entire sensor network to achieve global state estimation. Finally, groups of simulation experiments are conducted to compare and analyze the results, which verifies the rationality, effectiveness, and superiority of the proposed method.
The indirect method for the continuous low-thrust near minimum cumulative longitude orbit transfer problem is addressed. The movement of the satellite is described by the Gauss equation using the modified equinoctial elements and replacing time as the system independent variable by the cumulative longitude. The maximum principle is adapted to design the optimal control in order to minimize the final cumulative longitude, and the twopoint- boundary-value problem is derived from the orbit transfer problem. The single shooting method is applied in a numerical experiment, and the simulations demonstrate that the orbit transfer mission is fulfilled and the product of the maximal thrust and the minimum cumulative longitude is near constant.
When performing tasks, unmanned clusters often face a variety of strategy choices. One of the key issues in unmanned cluster tasks is the method through which to design autonomous collaboration and cooperative evolution mechanisms that allow for unmanned clusters to maximize their overall task effectiveness under the condition of strategic diversity. This paper analyzes these task requirements from three perspectives: the diversity of the decision space, information network construction, and the autonomous collaboration mechanism. Then, this paper proposes a method for solving the problem of strategy selection diversity under two network structures. Next, this paper presents a Moran-rule-based evolution dynamics model for unmanned cluster strategies and a vision-driven-mechanism-based evolution dynamics model for unmanned cluster strategy in the context of strategy selection diversity according to various unmanned cluster application scenarios. Finally, this paper provides a simulation analysis of the effects of relevant parameters such as the payoff factor and cluster size on cooperative evolution in autonomous cluster collaboration for the two types of models. On this basis, this paper presents advice for effectively addressing diverse choices in unmanned cluster tasks, thereby providing decision support for practical applications of unmanned cluster tasks.
A new scheduling scheme based on users’ quality of service (QoS) in mobile WiMAX networks is presented. The proposed scheme tracks each user’s average rate and adjusts the corresponding scheduling weight adaptively to result in: (a) each user’s average rate is proportional to the corresponding QoS level; (b) the constraints of the minimal and/or maximal rates required by QoS can be satisfied; (c) the utility function of system is maximal under the constraints (a) and (b). Theoretical analysis based on utility function and simulation results indicates the system throughput can be improved dramatically in the proposed scheme.
The multiple attribute decision making problems are studied, in which the information about attribute weights is partly known and the attribute values take the form of intuitionistic fuzzy numbers. The operational laws of intuitionistic fuzzy numbers are introduced, and the score function and accuracy function are presented to compare the intuitionistic fuzzy numbers. The intuitionistic fuzzy ordered weighted averaging (IFOWA) operator which is an extension of the well-known ordered weighted averaging (OWA) operator is investigated to aggregate the intuitionistic fuzzy information. In order to determine the weights of intuitionistic fuzzy ordered weighted averaging operator, a linear goal programming procedure is proposed for learning the weights from data. Finally, an example is illustrated to verify the effectiveness and practicability of the developed method.
This paper presents a path planning approach for rotary unmanned aerial vehicles (R-UAVs) in a known static rough terrain environment. This approach aims to find collision-free and feasible paths with minimum altitude, length and angle variable rate. First, a three-dimensional (3D) modeling method is proposed to reduce the computation burden of the dynamic models of R-UAVs. Considering the length, height and tuning angle of a path, the path planning of R-UAVs is described as a tri-objective optimization problem. Then, an improved multi-objective particle swarm optimization algorithm is developed. To render the algorithm more effective in dealing with this problem, a vibration function is introduced into the collided solutions to improve the algorithm efficiency. Meanwhile, the selection of the global best position is taken into account by the reference point method. Finally, the experimental environment is built with the help of the Google map and the 3D terrain generator World Machine. Experimental results under two different rough terrains from Guilin and Lanzhou of China demonstrate the capabilities of the proposed algorithm in finding Pareto optimal paths.
The research of cluster supply chains is a new direction and a hotspot of the industrial cluster theory. On the condition of the coordination game, the enterprises may be stuck on the non-efficient equilibrium status, which becomes an important problem that must be considered on cluster supply chains. A symmetrical coordination game model is constituted to describe the competition and cooperation relationship of the same-quality manufacturers on cluster supply chains. The methods of the non-cooperation game theory and the evolutionary game theory are respectively used to analyze the model, whose parameters’ influences under each method are then compared. It can be concluded that the analysis of the evolutionary game theory is more realistic and practical. Finally, three approaches are considered to break away from being path-dependence locked-in non-efficient status during this coordination game evolutionary process, which provide the development of cluster supply chains with an effective forecasting and Pareto optimizing method.
This paper presents an approach of singular value decomposition plus digital phase lock loop to solve the difficult problem of blind pseudo-noise (PN) sequence estimation in low signal to noise ratios (SNR) direct sequence spread spectrum (DS-SS) signals with residual carrier. This approach needs some given parameters, such as the period and code rate of PN sequence. The received signal is firstly sampled and divided into non-overlapping signal vectors according to a temporal window, whose duration is two periods of PN sequence. An autocorrelation matrix is then computed and accumulated by those signal vectors one by one. The PN sequence with residual carrier can be estimated by the principal eigenvector of the autocorrelation matrix. Further more, a digital phase lock loop is used to process the estimated PN sequence, it estimates and tracks the residual carrier and removes the residual carrier in the end. Theory analysis and computer simulation results show that this approach can effectively realize the PN sequence blind estimation from the input DS-SS signals with residual carrier in lower SNR.
