Distributed Optimal Formation Control for Unmanned Surface Vessels by a Regularized Game-Based Approach

Dear Editor,This letter explores optimal formation control for a network of unmanned surface vessels(USVs).By designing an individual objective function for each USV,the optimal formation problem is transformed into a noncooperative game.Under this game theoretic framework,the optimal formation is achieved by seeking the Nash equilibrium of the regularized game.A modular structure consisting of a distributed Nash equilibrium seeker and a regulator is proposed.

THE GLOBAL EXISTENCE AND ANALYTICITY OF A MILD SOLUTION TO THE 3D REGULARIZED MHD EQUATIONS

In this paper,we study the three-dimensional regularized MHD equations with fractional Laplacians in the dissipative and diffusive terms.We establish the global existence of mild solutions to this system with small initial data.In addition,we also obtain the Gevrey class regularity and the temporal decay rate of the solution.

Solving Neumann Boundary Problem with Kernel-Regularized Learning Approach

We provide a kernel-regularized method to give theory solutions for Neumann boundary value problem on the unit ball. We define the reproducing kernel Hilbert space with the spherical harmonics associated with an inner product defined on both the unit ball and the unit sphere, construct the kernel-regularized learning algorithm from the view of semi-supervised learning and bound the upper bounds for the learning rates. The theory analysis shows that the learning algorithm has better uniform convergence according to the number of samples. The research can be regarded as an application of kernel-regularized semi-supervised learning.

Two-level Bregmanized method for image interpolation with graph regularized sparse coding

A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inner-level Bregmanized method devotes to dictionary updating and sparse represention of small overlapping image patches. The introduced constraint of graph regularized sparse coding can capture local image features effectively, and consequently enables accurate reconstruction from highly undersampled partial data. Furthermore, modified sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge within a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can effectively reconstruct images and it outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.

Three-dimensional magnetotelluric regularized inversion based on smoothness-constrained model

How to get the rapid and stable inversion results and reconstruct the clear subsurface resistivity structures is a focus problem in current magnetotelluric inversion. A stable solution of an ill-posed inverse problem was obtained by the regularization methods in which some desired structures were imposed to stabilize the inverse problem. By the smoothness-constrained model and approximate sensitivity method, the stable subsurface resistivity structures were reconstructed. The synthetic examples show that the smoothness-constrained regularized inversion method is effective and can be reasonable to reconstruct three-dimensional subsurface resistivity structures.

首次积分法求Modified Regularized Long Wave方程的解

非线性偏微分方程的精确解在力学、工程学以及其他科学应用方面都有很重要的意义.利用首次积分法研究了一个非线性偏微分方程:the Modified Regularized Long Wave(MRLW)方程的精确解.

Regularized least-squares migration of simultaneous-source seismic data with adaptive singular spectrum analysis

Simultaneous-source acquisition has been recog- nized as an economic and efficient acquisition method, but the direct imaging of the simultaneous-source data produces migration artifacts because of the interference of adjacent sources. To overcome this problem, we propose the regularized least-squares reverse time migration method （RLSRTM） using the singular spectrum analysis technique that imposes sparseness constraints on the inverted model. Additionally, the difference spectrum theory of singular values is presented so that RLSRTM can be implemented adaptively to eliminate the migration artifacts. With numerical tests on a fiat layer model and a Marmousi model, we validate the superior imaging quality, efficiency and convergence of RLSRTM compared with LSRTM when dealing with simultaneoussource data, incomplete data and noisy data.

Fast cross validation for regularized extreme learning machine

A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is opposite to that of naive 1-fold cross validation. As opposed to naive l-fold cross validation, fast l-fold cross validation takes the advantage in terms of computational time, especially for the large fold number such as l 〉 20. To corroborate the efficacy and feasibility of fast l-fold cross validation, experiments on five benchmark regression data sets are evaluated.

Graph Regularized L_p Smooth Non-negative Matrix Factorization for Data Representation

This paper proposes a Graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information of a data set and produces smooth and stable solutions. The main contributions are as follows: first, graph regularization is added into NMF to discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. Second,the Lpsmoothing constraint is incorporated into NMF to combine the merits of isotropic(L_2-norm) and anisotropic(L_1-norm)diffusion smoothing, and produces a smooth and more accurate solution to the optimization problem. Finally, the update rules and proof of convergence of GSNMF are given. Experiments on several data sets show that the proposed method outperforms related state-of-the-art methods.

Application of Bayesian regularized BP neural network model for analysis of aquatic ecological data—A case study of chlorophyll-a prediction in Nanzui water area of Dongting Lake

Bayesian regularized BP neural network（BRBPNN） technique was applied in the chlorophyll-α prediction of Nanzui water area in Dongting Lake. Through BP network interpolation method, the input and output samples of the network were obtained. After the selection of input variables using stepwise/multiple linear regression method in SPSS i1.0 software, the BRBPNN model was established between chlorophyll-α and environmental parameters, biological parameters. The achieved optimal network structure was 3-11-1 with the correlation coefficients and the mean square errors for the training set and the test set as 0.999 and 0.000？8426, 0.981 and 0.0216 respectively. The sum of square weights between each input neuron and the hidden layer of optimal BRBPNN models of different structures indicated that the effect of individual input parameter on chlorophyll- α declined in the order of alga amount 〉 secchi disc depth（SD） 〉 electrical conductivity （EC）. Additionally, it also demonstrated that the contributions of these three factors were the maximal for the change of chlorophyll-α concentration, total phosphorus（TP） and total nitrogen（TN） were the minimal. All the results showed that BRBPNN model was capable of automated regularization parameter selection and thus it may ensure the excellent generation ability and robustness. Thus, this study laid the foundation for the application of BRBPNN model in the analysis of aquatic ecological data（chlorophyll-α prediction） and the explanation about the effective eutrophication treatment measures for Nanzui water area in Dongting Lake.

AN IMPROVED SPARSITY ADAPTIVE MATCHING PURSUIT ALGORITHM FOR COMPRESSIVE SENSING BASED ON REGULARIZED BACKTRACKING

Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown. In order to match the sparsity more accurately, we presented an improved SAMP algorithm based on Regularized Backtracking (SAMP-RB). By adapting a regularized backtracking step to SAMP algorithm in each iteration stage, the proposed algorithm can flexibly remove the inappropriate atoms. The experimental results show that SAMP-RB reconstruction algorithm greatly improves SAMP algorithm both in reconstruction quality and computational time. It has better reconstruction efficiency than most of the available matching pursuit algorithms.

Numerical solutions to regularized long wave equation based on mixed covolume method

The mixed covolume method for the regularized long wave equation is devel- oped and studied. By introducing a transfer operator γh, which maps the trial function space into the test function space, and combining the mixed finite element with the finite volume method, the nonlinear and linear Euler fully discrete mixed covolume schemes are constructed, and the existence and uniqueness of the solutions are proved. The optimal error estimates for these schemes are obtained. Finally, a numerical example is provided to examine the efficiency of the proposed schemes.

Kernel matrix learning with a general regularized risk functional criterion

Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.

Two-dimensional regularized inversion of AMT data based on rotation invariant of Central impedance tensor

Considering the uncertainty of the electrical axis for two-dimensional audo-magnetotelluric(AMT) data processing, an AMT inversion method with the Central impedance tensor was presented. First, we present a calculation expression of the Central impedance tensor in AMT, which can be considered as the arithmetic mean of TE-polarization mode and TM-polarization mode in the twodimensional geo-electrical model. Second, a least-squares iterative inversion algorithm is established, based on a smoothnessconstrained model, and an improved L-curve method is adopted to determine the best regularization parameters. We then test the above inversion method with synthetic data and field data. The test results show that this two-dimensional AMT inversion scheme for the responses of Central impedance is effective and can reconstruct reasonable two-dimensional subsurface resistivity structures. We conclude that the Central impedance tensor is a useful tool for two-dimensional inversion of AMT data.

The Convergence Rate of Ergodic Limits for Regularized Resolvent Families

This paper is concerned with the convergence rates of ergodic limits and approximation for regularized resolvent families for a linear Volterra integral equation. The results contain C 0-semigroups, cosine operator functions and α-times integrated resolvent family as special cases.

Application of regularized logistic regression for movement-related potentials-based EEG classification

In order to improve classification accuracy, the regularized logistic regression is used to classify single-trial electroencephalogram （EEG）. A novel approach, named local sparse logistic regression （LSLR）, is proposed. The LSLR integrates the locality preserving projection regularization term into the framework of sparse logistic regression. It tries to maintain the neighborhood information of original feature space, and, meanwhile, keeps sparsity. The bound optimization algorithm and component-wise update are used to compute the weight vector in the training data, thus overcoming the disadvantage of the Newton-Raphson method and iterative re-weighted least squares （IRLS）. The classification accuracy of 80% is achieved using ten-fold cross-validation in the self-paced finger tapping data set. The results of LSLR are compared with SLR, showing the effectiveness of the proposed method.

EXPONENTIAL ATTRACTOR FOR THE GENERALIZED SYMMETRIC REGULARIZED LONG WAVE EQUATION WITH DAMPING TERM

The global fast dynamics for the generalized symmetric regularized long wave equation with damping term is considered. The squeezing property of the nonlinear semi_group associated with this equation and the existence of exponential attractor are proved. The upper bounds of its fractal dimension are also estimated.

Single-trial EEG-based emotion recognition using temporally regularized common spatial pattern

This study addresses the problem of classifying emotional words based on recorded electroencephalogram （EEG） signals by the single-trial EEG classification technique. Emotional two-character Chinese words are used as experimental materials. Positive words versus neutral words and negative words versus neutral words are classified, respectively, using the induced EEG signals. The method of temporally regularized common spatial patterns （TRCSP） is chosen to extract features from the EEG trials, and then single-trial EEG classification is achieved by linear discriminant analysis. Classification accuracies are between 55% and 65%. The statistical significance of the classification accuracies is confirmed by permutation tests, which shows the successful identification of emotional words and neutral ones, and also the ability to identify emotional words. In addition, 10 out of 15 subjects obtain significant classification accuracy for negative words versus neutral words while only 4 are significant for positive words versus neutral words, which demonstrate that negative emotions are more easily identified.

NOVEL REGULARIZED BOUNDARY INTEGRAL EQUATIONS FOR POTENTIAL PLANE PROBLEMS

The universal practices have been centralizing on the research of regularization to the direct boundary integal equations （DBIEs）. The character is elimination of singularities by using the simple solutions. However, up to now the research of regularization to the first kind integral equations for plane potential problems has never been found in previous literatures. The presentation is mainly devoted to the research on the regularization of the singular boundary integral equations with indirect unknowns. A novel view and idea is presented herein, in which the regularized boundary integral equations with indirect unknowns without including the Cauchy principal value （CPV） and Hadamard-finite-part （HFP） integrals are established for the plane potential problems. With some numerical results, it is shown that the better accuracy and higher efficiency, especially on the boundary, can be achieved by the present system.

SEMI-SUPERVISED RADIO TRANSMITTER CLASSIFICATION BASED ON ELASTIC SPARSITY REGULARIZED SVM

Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which can be obtained much easier, a novel semi-supervised classification method named Elastic Sparsity Regularized Support Vector Machine (ESRSVM) is proposed for radio transmitter classification. ESRSVM first constructs an elastic-net graph over data samples to capture the robust and natural discriminating information and then incorporate the information into the manifold learning framework by an elastic sparsity regularization term. Experimental results on 10 GMSK modulated Automatic Identification System radios and 15 FM walkie-talkie radios show that ESRSVM achieves obviously better performance than KNN and SVM, which use only labeled samples for classification, and also outperforms semi-supervised classifier LapSVM based on manifold regularization.