Geographic location of nodes is very useful in a sensor network. Previous localization algorithms assume that there exist some anchor nodes in this kind of network, and then other nodes are estimated to create their coordinates. Once there are not anchors to be deployed, those localization algorithms will be invalidated. Many papers in this field focus on anchor-based solutions. The use of anchors introduces many limitations, since anchors require external equipments such as global position system, cause additional power consumption. A novel positioning algorithm is proposed to use a virtual coordinate system based on a new concept—virtual anchor. It is executed in a distributed fashion according to the connectivity of a node and the measured distances to its neighbors. Both the adjacent member information and the ranging distance result are combined to generate the estimated position of a network, one of which is independently adopted for localization previously. At the position refinement stage the intermediate estimation of a node begins to be evaluated on its reliability for position mutation; thus the positioning optimization process of the whole network is avoided falling into a local optimal solution. Simulation results prove that the algorithm can resolve the distributed localization problem for anchor-free sensor networks, and is superior to previous methods in terms of its positioning capability under a variety of circumstances.

To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform (STFT) is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.

With the development of CMOS and MEMS technologies, the implementation of a large number of wireless distributed micro-sensors that can be easily and rapidly deployed to form highly redundant, self-configuring, and ad hoc sensor networks. To facilitate ease of deployment, these sensors operate on battery for extended periods of time. A particular challenge in maintaining extended battery lifetime lies in achieving communications with low power. For better understanding of the design tradeoffs of wireless sensor network (WSN), a more accurate energy model for wireless sensor node is proposed, and an optimal design method of energy efficient wireless sensor node is described as well. Different from power models ever shown which assume the power cost of each component in WSN node is constant, the new one takes into account the energy dissipation of circuits in practical physical layer. It shows that there are some parameters, such as data rate, carrier frequency, bandwidth, Tsw, etc, which have a significant effect on the WSN node energy consumption per useful bit (EPUB). For a given quality specification, how energy consumption can be reduced by adjusting one or more of these parameters is shown.

Joint probabilistic data association is an effective method for tracking multiple targets in clutter, but only the target kinematic information is used in measure-to-track association. If the kinematic likelihoods are similar for different closely spaced targets, there is ambiguity in using the kinematic information alone; the correct association probability will decrease in conventional joint probabilistic data association algorithm and track coalescence will occur easily. A modified algorithm of joint probabilistic data association with classification-aided is presented, which avoids track coalescence when tracking multiple neighboring targets. Firstly, an identification matrix is defined, which is used to simplify validation matrix to decrease computational complexity. Then, target class information is integrated into the data association process. Performance comparisons with and without the use of class information in JPDA are presented on multiple closely spaced maneuvering targets tracking problem. Simulation results quantify the benefits of classification-aided JPDA for improved multiple targets tracking, especially in the presence of association uncertainty in the kinematic measurement and target maneuvering. Simulation results indicate that the algorithm is valid.

A novel statistical method based on particle filtering is presented for multiple vehicle acoustic signals separation problem in wireless sensor network. The particle filtering method is able to deal with non-Gaussian and nonlinear models and non-stationary sources. Using some instantaneously mixed observations of several real-world vehicle acoustic signals, the proposed statistical method is compared with a conventional non-stationary Blind Source Separation algorithm and attractive simulation results are achieved. Moreover, considering the natural convenience to transmit particles between sensor nodes, the algorithm based on particle filtering is believed to have potential to enable the task of multiple vehicles recognition collaboratively performed by sensor nodes in distributed wireless sensor network.

A site-specific model of UWB pulse propagation in indoor environment is addressed. The simulation utilizes the principles of geometrical optics (GO) for direct and reflected paths’ tracing and the time domain technique for describing the transient electromagnetic field reflected from wall, floor, ceiling, and objects. The polarization of the received waveform is determined by taking into account the radiation pattern of the transmitting and receiving antennas, as well as the polarization changes owing to every reflection. The model provides more intrinsical interpretations for UWB pulse propagation in realistic indoor environment.

When a new user accesses the CDMA system, the load will change drastically, and therefore, the advanced outer loop power control (OLPC) technology has to be adopted to enrich the target signal interference ratio (SIR) and improve the system performance. The existing problems about DS-CDMA outer loop power control for multi-service are introduced and the power control theoretical model is analyzed. System simulation is adopted on how to obtain the theoretical performance and parameter optimization of the power control algorithm. The OLPC algorithm is improved and the performance comparisons between the old algorithm and the improved algorithm are given. The results show good performance of the improved OLPC algorithm and prove the validity of the improved method for multi-service.

Two adaptive power and bit loading algorithms to maximize the throughput of MIMO-OFDM systems in frequency selective fading environment are proposed. The two algorithms allocate bit based on maximizing the overall throughput. One algorithm allocates power based on guaranteeing that the bit error rate (BER) of each sub-carrier and the total allocated power remain below a target BER threshold and a power threshold, respectively; another one allocates power based on guaranteeing that the mean BER of sub-carriers and the total allocated power remain below a target BER threshold and a power threshold, respectively. The simulation results show that the proposed algorithms can achieve faster throughput with lower computational complexity, which indicates that the proposed algorithms are effective when compared to some existing algorithms.

A kind of novel electromagnetic structure of Cassini cross section is proposed and simulation is implemented with business microwave soft CST based on finite integral technique (FIT). The electromagnetic field mode type of Cassini wave-guide belongs to TE, and the electromagnetic field intensity is stronger near the neck region than at other areas. For Cassini electromagnetic patches and lumped elements, the radar cross section (RCS) is smaller around 7 GHz with –30.85 dBsm, and the absorbing property is better around 13 GHz with 4.56 dBsm difference of RCS from comparing of pure medium. For novel radiation structure of Cassini cross-section patches, the electromagnetic field value is larger in the neck areas of two half patches. At last, the potential application and development of Cassini oval structure are put forward in the electromagnetic stealth technology and antennae design.

To estimate the direction-of-arrival (DOA) of wideband coherent signals, a new method by modifying the orthogonality of the projected subspaces method is proposed. And it can deal with randomly position perturbed arrays by using the Toeplitz method. This method needn’t the primary information of DOA for focusing matrix and the sector dividing of interpolated method, which improving the precision of estimation and reducing the computational complexity. Simulations illustrate the effectiveness of this method.

A real-time dwell scheduling model, which takes the time and energy constraints into account is founded from the viewpoint of scheduling gain. Scheduling design is turned into a nonlinear programming procedure. The real-time dwell scheduling algorithm based on the scheduling gain is presented with the help of two heuristic rules. The simulation results demonstrate that compared with the conventional adaptive scheduling method, the algorithm proposed not only increases the scheduling gain and the time utility but also decreases the task drop rate.

Based on the analysis of the principles of frequency-phase scanning 3-D (three-dimensional) radar and the scattering mechanism of 3-D radar, the target and clutter IF (intermediate frequency) signals model of frequencyphase scanning 3-D radar is presented. The IF signals model of different channels of 3-D radar is presented in one simple formula in which complex waveform effects are considered. The simulation results obtained during tests are also provided in the end.

Multifrequency polarimetric SAR imagery provides a very convenient approach for signal processing and acquisition of radar image. However, the amount of information is scattered in several images, and redundancies exist between different bands and polarizations. Similar to signal-polarimetric SAR image, multifrequency polarimetric SAR image is corrupted with speckle noise at the same time. A method of information compression and speckle reduction for multifrequency polarimetric SAR imagery is presented based on kernel principal component analysis (KPCA). KPCA is a nonlinear generalization of the linear principal component analysis using the kernel trick. The NASA/JPL polarimetric SAR imagery of P, L, and C bands quadpolarizations is used for illustration. The experimental results show that KPCA has better capability in information compression and speckle reduction as compared with linear PCA.

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.

In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness.

To study the uncertain optimization problems on implementation schedule, time-cost trade-off and quality in enterprise resource planning (ERP) implementation, combined with program evaluation and review technique (PERT), some optimization models are proposed, which include the implementation schedule model, the timecost trade-off model, the quality model, and the implementation time-cost-quality synthetic optimization model. A PERT-embedded genetic algorithm (GA) based on stochastic simulation technique is introduced to the optimization models solution. Finally, an example is presented to show that the models and algorithm are reasonable and effective, which can offer a reliable quantitative decision method for ERP implementation.

Two pairs of approximation operators, which are the scale lower and upper approximations as well as the real line lower and upper approximations, are defined. Their properties and antithesis characteristics are analyzed. The rough function model is generalized based on rough set theory, and the scheme of rough function theory is made more distinct and complete. Therefore, the transformation of the real function analysis from real line to scale is achieved. A series of basic concepts in rough function model including rough numbers, rough intervals, and rough membership functions are defined in the new scheme of the rough function model. Operating properties of rough intervals similar to rough sets are obtained. The relationship of rough inclusion and rough equality of rough intervals is defined by two kinds of tools, known as the lower (upper) approximation operator in real numbers domain and rough membership functions. Their relative properties are analyzed and proved strictly, which provides necessary theoretical foundation and technical support for the further discussion of properties and practical application of the rough function model.

The autonomous "celestial navigation scheme" for deep space probe departing from the earth and the autonomous "optical navigation scheme" for encountering object celestial body are presented. Then, aiming at the conditions that large initial estimation errors and non-Gaussian distribution of state or measurement errors may exist in orbit determination process of the two phases, UPF (unscented particle flter) is introduced into the navigation schemes. By tackling nonlinear and non-Gaussian problems, UPF overcomes the accuracy in uence brought by the traditional EKF (extended Kalman flter), UKF (unscented Kalman flter), and PF (particle flter) schemes in approximate treatment to nonlinear and non-Gaussian state model and measurement model. The numerical simulations demonstrate the feasibility and higher accuracy of the UPF navigation scheme.

A robust adaptive trajectory linearization control (RATLC) algorithm for a class of nonlinear systems with uncertainty and disturbance based on the T-S fuzzy system is presented. The unknown disturbance and uncertainty are estimated by the T-S fuzzy system, and a robust adaptive control law is designed by the Lyapunov theory. Irrespective of whether the dimensions of the system and the rules of the fuzzy system are large or small, there is only one parameter adjusting on line. Uniformly ultimately boundedness of all signals of the composite closed-loop system are proved by theory analysis. Finally, a numerical example is studied based on the proposed method. The simulation results demonstrate the effectiveness and robustness of the control scheme.

The problem of delay-dependent stability and guaranteed cost control (GCC) for a class of uncertain time-delay Lur’e systems are studied. By using an improved integral inequality, a less conservative delay-dependent stability criterion is formulated as the feasibility problem of the linear matrix inequality (LMI). The criterion is proved theoretically to be less conservative than some existing results for linear time-delay systems. Because of the fact that the matrices in the LMI-based stability criteria usually have different dimensions, different structures, and different variables, the conservatism analysis of the criteria is difficult. This study brings about a new insight into the comparison of conservatism among different stability criteria, which are expressed in certain LMI forms. The existence of the guaranteed cost controller is given in terms of matrix inequalities. The condition can be solved by using an iterative procedure and does not need any parameter tuning. A numerical example is given to illustrate the effectiveness of the proposed method.

Neural networks require a lot of training to understand the model of a plant or a process. Issues such as learning speed, stability, and weight convergence remain as areas of research and comparison of many training algorithms. The application of neural networks to control interior permanent magnet synchronous motor using direct torque control (DTC) is discussed. A neural network is used to emulate the state selector of the DTC. The neural networks used are the back-propagation and radial basis function. To reduce the training patterns and increase the execution speed of the training process, the inputs of switching table are converted to digital signals, i.e., one bit represent the flux error, one bit the torque error, and three bits the region of stator flux. Computer simulations of the motor and neural-network system using the two approaches are presented and compared. Discussions about the back-propagation and radial basis function as the most promising training techniques are presented, giving its advantages and disadvantages. The system using back-propagation and radial basis function networks controller has quick parallel speed and high torque response.

The identification of the correspondences of points of views is an important task. A new feature matching algorithm for weakly calibrated stereo images of curved scenes is proposed, based on mere geometric constraints. After initial correspondences are built via the epipolar constraint, many point-to-point image mappings called homographies are set up to predict the matching position for feature points. To refine the predictions and reject false correspondences, four schemes are proposed. Extensive experiments on simulated data as well as on real images of scenes of variant depths show that the proposed method is effective and robust.

The robust fault-tolerant control problem of linear uncertain systems is studied. It is shown that a solution for this problem can be obtained from a H∞ robust predictive controller (RMPC) by the method of linear matrix inequality (LMI). This approach has the advantages of both H∞ control and MPC: the robustness and ability to handle constraints explicitly. The robust closed-loop stability of the linear uncertain system with input and output constraints is proven under an actuator and sensor faults condition. Finally, satisfactory results of simulation experiments verify the validity of this algorithm.

To determine the optimal or near optimal parameters of PID controller with incomplete derivation, a novel design method based on differential evolution (DE) algorithm is presented. The controller is called DE-PID controller. To overcome the disadvantages of the integral performance criteria in the frequency domain such as IAE, ISE, and ITSE, a new performance criterion in the time domain is proposed. The optimization procedures employing the DE algorithm to search the optimal or near optimal PID controller parameters of a control system are demonstrated in detail. Three typical control systems are chosen to test and evaluate the adaptation and robustness of the proposed DE-PID controller. The simulation results show that the proposed approach has superior features of easy implementation, stable convergence characteristic, and good computational efficiency. Compared with the ZN, GA, and ASA, the proposed design method is indeed more efficient and robust in improving the step response of a control system.

Based on the delay-independent rule, the problem of optimal guaranteed cost control for a class of Takagi-Sugeno (T-S ) fuzzy descriptor systems with time-varying delay is studied. A linear quadratic cost function is considered as the performance index of the closed-loop system. Sufficient conditions for the existence of guaranteed cost controllers via state feedback are given in terms of linear matrix inequalities (LMIs), and the design of an optimal guaranteed cost controller can be reduced to a convex optimization problem. It is shown that the designed controller not only guarantees the asymptotic stability of the closed-loop fuzzy descriptor delay system, but also provides an optimized upper bound of the guaranteed cost. At last, a numerical example is given to illustrate the effectiveness of the proposed method and the perfect performance of the optimal guaranteed cost controller.

Delay-dependent robust stability of cellular neural networks with time-varying discrete and distributed time-varying delays is considered. Based on Lyapunov stability theory and the linear matrix inequality (LMIs) technique, delay-dependent stability criteria are derived in terms of LMIs avoiding bounding certain cross terms, which often leads to conservatism. The effectiveness of the proposed stability criteria and the improvement over the existing results are illustrated in the numerical examples.

A novel method for detecting anomalous program behavior is presented, which is applicable to hostbased intrusion detection systems that monitor system call activities. The method constructs a homogeneous Markov chain model to characterize the normal behavior of a privileged program, and associates the states of the Markov chain with the unique system calls in the training data. At the detection stage, the probabilities that the Markov chain model supports the system call sequences generated by the program are computed. A low probability indicates an anomalous sequence that may result from intrusive activities. Then a decision rule based on the number of anomalous sequences in a locality frame is adopted to classify the program’s behavior. The method gives attention to both computational efficiency and detection accuracy, and is especially suitable for on-line detection. It has been applied to practical host-based intrusion detection systems.

One of the goals of data collection is preparing for decision-making, so high quality requirement must be satisfied. Rational evaluation of data quality is an effective way to identify data problem in time, and the quality of data after this evaluation is satisfactory with the requirement of decision maker. A fuzzy neural network based research method of data quality evaluation is proposed. First, the criteria for the evaluation of data quality are selected to construct the fuzzy sets of evaluating grades, and then by using the learning ability of NN, the objective evaluation of membership is carried out, which can be used for the effective evaluation of data quality. This research as been used in the platform of ‘data report of national compulsory education outlay guarantee’ from the Chinese Ministry of Education. This method can be used for the effective evaluation of data quality worldwide, and the data quality situation can be found out more completely, objectively, and in better time by using the method.

A fast encoding algorithm based on the mean square error (MSE) distortion for vector quantization is introduced. The vector, which is effectively constructed with wavelet transform (WT) coefficients of images, can simplify the realization of the non-linear interpolated vector quantization (NLIVQ) technique and make the partial distance search (PDS) algorithm more efficient. Utilizing the relationship of vector L2-norm and its Euclidean distance, some conditions of eliminating unnecessary codewords are obtained. Further, using inequality constructed by the subvector L2-norm, more unnecessary codewords are eliminated. During the search process for code, mostly unlikely codewords can be rejected by the proposed algorithm combined with the non-linear interpolated vector quantization technique and the partial distance search technique. The experimental results show that the reduction of computation is outstanding in the encoding time and complexity against the full search method.

Image interpolation plays an important role in image process applications. A novel support vector machines (SVMs) based interpolation scheme is proposed with increasing the local spatial properties in the source image as SVMs input patterns. After the proper neighbor pixels region is selected, trained support vectors are obtained by training SVMs with local spatial properties that include the average of the neighbor pixels gray values and the gray value variations between neighbor pixels in the selected region. The support vector regression machines are employed to estimate the gray values of unknown pixels with the neighbor pixels and local spatial properties information. Some interpolation experiments show that the proposed scheme is superior to the linear, cubic, neural network and other SVMs based interpolation approaches.

A new antenna selection algorithm for multiple input multiple output (MIMO) wireless systems is proposed. The modified Tanimoto coefficient is used to compare the similarity of the rows/columns of the channel matrix. Based on the calculated similarity, the proposed algorithm chooses the antenna subset, which has the maximum product of dissimilarity and Frobenius norm. The proposed algorithm requires low computational complexity as to the optimal selection but with comparative outage capacity and average signal to noise ratio (SNR) performance. It can improve both the outage capacity and the average SNR as compared to random selection. The simulation results are shown to validate our algorithm.

The basic principles of IF/THEN rules in rough set theory are analyzed first, and then the automatic process of knowledge acquisition is given. The numerical data is qualitatively processed by the classification of membership functions and membership degrees to get the normative decision table. The regular method of relations and the reduction algorithm of attributes are studied. The reduced relations are presented by the multi-representvalue method and its algorithm is offered. The whole knowledge acquisition process has high degree of automation and the extracted knowledge is true and reliable.