Design of ontology mapping framework and improvement of similarity computation

Ontology heterogeneity is the primary obstacle for interoperation of ontologies. Ontology mapping is the best way to solve this problem. The key of ontology mapping is the similarity computation. At present, the method of similarity computation is imperfect. And the computation quantity is high. To solve these problems, an ontology-mapping framework with a kind of hybrid architecture is put forward, with an improvement in the method of similarity computation. Different areas have different local ontologies. Two ontologies are taken as examples, to explain the specific mapping framework and improved method of similarity computation. These two ontologies are about classes and teachers in a university. The experimental results show that using this framework and improved method can increase the accuracy of computation to a certain extent. Otherwise, the quantity of computation can be decreased.

Improved method for the feature extraction of laser scanner using genetic clustering

Feature extraction of range images provided by ranging sensor is a key issue of pattern recognition. To automatically extract the environmental feature sensed by a 2D ranging sensor laser scanner, an improved method based on genetic clustering VGA-clustering is presented. By integrating the spatial neighbouring information of range data into fuzzy clustering algorithm, a weighted fuzzy clustering algorithm （WFCA） instead of standard clustering algorithm is introduced to realize feature extraction of laser scanner. Aimed at the unknown clustering number in advance, several validation index functions are used to estimate the validity of different clustering algorithms and one validation index is selected as the fitness function of genetic algorithm so as to determine the accurate clustering number automatically. At the same time, an improved genetic algorithm IVGA on the basis of VGA is proposed to solve the local optimum of clustering algorithm, which is implemented by increasing the population diversity and improving the genetic operators of elitist rule to enhance the local search capacity and to quicken the convergence speed. By the comparison with other algorithms, the effectiveness of the algorithm introduced is demonstrated.

End-to-end rate-based congestion control with random loss:convergence and stability

The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. The convergence rates of these two algorithms are analyzed by linearizing them around their equilibrium points, since they are globally stable and can converge to their unique equilibrium points. Some sufficient conditions for local stability in the presence of round-trip delay are obtained based on the general Nyquist criterion of stability. The stability conditions can be considered to be more general. If random loss in the first congestion control algorithm is not considered, they reduce to the local stability conditions which have been obtained in some literatures. Furthermore, sufficient conditions for local stability of a new congestion control algorithm have also been obtained if random loss is not considered in the second congestion control algorithm.

Feedforward and feedback optimal control for linear time-varying systems with persistent disturbances

The optimal control problem for linear time-varying systems affected by external persistent disturbances with known dynamic characteristics but unknown initial conditions is consider and a design procedure of a feedforward and feedbaek optimal controller is presented. The condition of existence and uniqueness of the control law is given. The disturbanee observer is proposed to make the feedforward control law realizable physically. Simulation results demonstrate that the feedforward and feedbaek optimal control law is more effective and robust than the elassical state feedbaek control law with respect to external disturbanees.

Universal construction of control Lyapunov functions for a class of nonlinear systems

A method is developed by which control Lyapunov functions of a class of nonlinear systems can be constructed systematically. Based on the control Lyapunov function, a feedback control is obtained to stabilize the closed-loop system. In addition, this method is applied to stabilize the Benchmark system. A simulation shows the effectiveness of the method.

New computing method of weighted coefficients for tracking a maneuvering target using PDAF in the presence of clutter

To avoid or reduce the influence of unpredictable motion mode on data association, a new computing method of weighted coefficients of measurements for PDAF is presented in which it is assumed that the current turn rate of a maneuvering target changes within a limited range and its turn may be in arbitrary direction during data association. Thus, the predicted center for computing the weighted coefficients is a curved surface in 3-D space, which differs from the predicted center for setting up a validation gate, namely, a point in 3-D space. The distance between a measurement and the curved surface is used to compute its weighted coefficient. To reduce the computational complexity of weighted coefficients, the formulas for computing the maneuvering direction angle and turn rate corresponding to a measurement are presented. Simulation results show the proposed method reduces the percentage of lost tracks and improves the state estimation accuracy in tracking a maneuvering target using PDAF in the presence of clutter.

Volterra series based predistortion for broadband RF power amplifiers with memory effects

RF power amplifiers （PAs） are usually considered as memoryless devices in most existing predistortion techniques. However, in broadband communication systems, such as WCDMA, the PA memory effects are significant, and memoryless predistortion cannot linearize the PAs effectively. After analyzing the PA memory effects, a novel predistortion method based on the simplified Volterra series is proposed to linearize broadband RF PAs with memory effects. The indirect learning architecture is adopted to design the predistortion scheme and the reeursive least squares algorithm with forgetting factor is applied to identify the parameters of the predistorter. Simulation results show that the proposed predistortion method can compensate the nonlinear distortion and memory effects of broadband RF PAs effectively.

PD-type iterative learning control for nonlinear time-delay system with external disturbance

The PD-type iterative learning control design of a class of affine nonlinear time-delay systems with external disturbances is considered. Sufficient conditions guaranteeing the convergence of the n-norm of the tracking error are derived. It is shown that the system outputs can be guaranteed to converge to desired trajectories in the absence of external disturbances and output measurement noises. And in the presence of state disturbances and measurement noises, the tracking error will be bounded uniformly. A numerical simulation example is presented to validate the effectiveness of the proposed scheme.

Optimal tracking control for linear time-delay large-scale systems with persistent disturbances

An optimal tracking control （OTC） problem for linear time-delay large-scale systems affected by external persistent disturbances is investigated. Based on the internal model principle, a disturbance compensator is constructed. The system with persistent disturbances is transformed into an augmented system without persistent disturbances. The original OTC problem of linear time-delay system is transformed into a sequence of linear two- point boundary value （TPBV） problems by introducing a sensitivity parameter and expanding Maclaurin series around it. By solving an OTC law of the augmented system, the OTC law of the original system is obtained. A numerical simulation is provided to illustrate the effectiveness of the proposed method.

Optimal deterministic disturbances rejection for singularly perturbed linear systems

Optimal deterministic disturbances rejection control problem for singularly perturbed linear systems is considered. By using the slow-fast decomposition theory of singular perturbation, the existent and unique conditions of the feedforward and feedback composite control （FFCC） laws for both infinite-time and finite-time are proposed, and the design approaches are given. A disturbance observer is introduced to make the FFCC laws realizable physically. Simulation results indicate that the FFCC laws are robust with respect to external disturbances.