A pseudospectral method is presented for direct trajectory optimization of optimal control problems using collocation at Chebyshev-Gauss points, and therefore, it is called Chebyshev-Gauss pseudospectral method. The costate and constraint multiplier estimates for the proposed method are rigorously derived by comparing the discretized optimality conditions of an optimal control problem with the Karush-Kuhn-Tucker conditions of the resulting nonlinear programming problem from collocation. The distinctive advantages of the proposed method over other pseudopsectral methods are the good numerical stability and computational efficiency. In order to achieve this goal, the barycentric Lagrange interpolation is substituted for the classic Lagrange interpolation in the state approximation. Furthermore, a simple yet efficient method is presented to alleviate the numerical errors of state differential matrix using the trigonometric identity especially when the number of Chebyshev-Gauss points is large. The method presented in this paper has been taken to two optimal control problems from the open literature, and the results have indicated its ability to obtain accurate solutions to complex constrained optimal control problems.

Two new approximate formulations to joint chance-constrained optimization problems are proposed in this paper. The relationships of CVaR (conditional-value-at-risk), chance constrains and robust optimization are reviewed. Firstly, two new upper bounds on E((·) +) are proposed, where E stands for the expectation and x+ = max(0, x), based on which two approximate formulations for individual chance-constrained problems are derived. The approximations are proved to be the robust optimization with the corresponding uncertain sets. Then the approximations are extrapolated to joint chance-constrained problem. Finally numerical studies are performed to compare the solutions of individual and joint chance constraints approximations and the results demonstrate the validity of our method.

Synthetic aperture radar (SAR) image is usually polluted by multiplicative speckle noise, which can affect further processing of SAR image. This paper presents a new approach for multiplicative noise removal in SAR images based on sparse coding by shearlets filtering. First, a SAR despeckling model is built by the theory of compressed sensing (CS). Secondly, obtain shearlets coefficient through shearlet transform, each scale coefficient is represented as a unit. For each unit, sparse coefficient is iteratively estimated by using Bayesian estimation based on shearlets domain. The represented units are finally collaboratively aggregated to construct the despeckling image. Our results in SAR image despeckling show the good performance of this algorithm, and prove that the algorithm proposed is robustness to noise, which is not only good for reducing speckle, but also has an advantage in holding information of the edge.

In this work, the affine point set matching is formulated under a variational Bayesian framework and the model points are projected forward into the scene space by a linear transformation. A directed acyclic graph is presented to represent the relationship between the parameters, latent variables, model and scene point sets and an iterative approximate algorithm is proposed for the estimation of the posterior distributions over parameters. Furthermore, the anisotropic covariance is assumed on the transition variable and one Gaussian component is provided for the inference of outlier points. Experimental results demonstrate that the proposed algorithm achieves good performance in terms of both robustness and accuracy.

In recent years both industry and academia have paid much attention to the theory and applications of Petri nets. Reachability is a basic property of a Petri net, and many properties can be analyzed via it. However, analyzing the reachability problem of unbounded Petri nets by finite reachability trees has been an open problem since the inception of Petri nets. Researchers began to study the problem of reachability trees over 40 years ago. However, they made only limited progress over the last 20 years due to its complexity and difficulty. We present an overview of some important contributions toward its solution. The focuses are on four novel finite reachability trees: finite reachability tree(FRT),augmented reachability tree(ART), modified reachability tree(MRT) and new modified reachailbity tree(NMRT). The paper concludes with a discussion of directions for future research of the reachability problem of unbounded Petri nets.

A semi-supervised agglomerative hierarchical clustering method based on dynamically updating constraints is proposing in this research. Following the existing semi-supervised clustering algorithm, this method uses the must-link and cannot-link constraints. Instead of using the idea that the instances with must-link constraints are pre-clustered before agglomerating with the others, this method employs a more general and reasonable process. Firstly, must-link and cannot-link constraints are expanded to compose a constraints closure. Then, a standard agglomeration instructed by cannot-link constraints is processed. During this procedure, the must-link and cannot-link are dynamically updated according to the intermediate clustering results. This updating process guarantees the validity of the final results. The fundamental advantage of this method is omitting the pre-clustering process of the instances with must-link constraints. This modification ensures that data points gain a more reasonable agglomeration order, which may result in a significant improvement on the clustering results. This research also introduces an implementation of this model based on Ward0s method, leading to the C-Ward algorithm. The experimental analyses on both Artificial simulated datasets and real world datasets show that this method is much better than the others.

Fifty years ago in 1964, H. S. Tsien translated LASER into Ji Guang for a Chinese intelligence magazine on light amplification by stimulated emission of radiation. 20 years later from this event in 1983, Tsien proposed a concept for intelligence called "information inspiritment" or Ji Huo in Chinese, with the desire to make intelligence as "LASER Intelligence" so that it will be like "the sharpest knife, the brightest light, the most accurate rule" for decision and action.This paper discusses Tsien s idea of inspiration and parallel intelligence and how to implement "intelligence inspiritors"based on ACP theory.

In this paper, the problem of state feedback stabilization for stochastic feedforward nonlinear systems with input time-delay is considered for the first time. By introducing a variable transformation, skillfully combining the homogeneous domination method, and constructing an appropriate Lyapunov-Krasovskii functional, a state feedback controller is developed to guarantee the closed-loop system globally asymptotically stable in probability.

This paper focuses on investigating the issue of adaptive state-feedback control based on neural networks (NNs) for a class of high-order stochastic uncertain systems with unknown nonlinearities. By introducing the radial basis function neural network (RBFNN) approximation method, utilizing the backstepping method and choosing an approximate Lyapunov function, we construct an adaptive state-feedback controller which assures the closed-loop system to be mean square semi-global-uniformly ultimately bounded (M-SGUUB). A simulation example is shown to illustrate the effectiveness of the design scheme.