Sensing Matrix Optimization for Multi-Target Localization Using Compressed Sensing in Wireless Sensor Network

In the multi-target localization based on Compressed Sensing(CS),the sensing matrix's characteristic is significant to the localization accuracy.To improve the CS-based localization approach's performance,we propose a sensing matrix optimization method in this paper,which considers the optimization under the guidance of the t%-averaged mutual coherence.First,we study sensing matrix optimization and model it as a constrained combinatorial optimization problem.Second,the t%-averaged mutual coherence is adopted as the optimality index to evaluate the quality of different sensing matrixes,where the threshold t is derived through the K-means clustering.With the settled optimality index,a hybrid metaheuristic algorithm named Genetic Algorithm-Tabu Local Search(GA-TLS)is proposed to address the combinatorial optimization problem to obtain the final optimized sensing matrix.Extensive simulation results reveal that the CS localization approaches using different recovery algorithms benefit from the proposed sensing matrix optimization method,with much less localization error compared to the traditional sensing matrix optimization methods.

Augmented Lagrangian Methods for Convex Matrix Optimization Problems

In this paper,we provide some gentle introductions to the recent advance in augmented Lagrangian methods for solving large-scale convex matrix optimization problems(cMOP).Specifically,we reviewed two types of sufficient conditions for ensuring the quadratic growth conditions of a class of constrained convex matrix optimization problems regularized by nonsmooth spectral functions.Under a mild quadratic growth condition on the dual of cMOP,we further discussed the R-superlinear convergence of the Karush-Kuhn-Tucker(KKT)residuals of the sequence generated by the augmented Lagrangian methods(ALM)for solving convex matrix optimization problems.Implementation details of the ALM for solving core convex matrix optimization problems are also provided.

Optimality Conditions for Rank-Constrained Matrix Optimization

In this paper,we comprehensively study optimality conditions for rank-constrained matrix optimization(RCMO).By calculating the Clarke tangent and normal cones to a rank-constrained set,along with the given Fréchet,Mordukhovich normal cones,we investigate four kinds of stationary points of the RCMO and analyze the relations between each stationary point and local/global minimizer of the RCMO.Furthermore,the second-order optimality condition of the RCMO is achieved with the help of the Clarke tangent cone.

Improved nonconvex optimization model for low-rank matrix recovery

Low-rank matrix recovery is an important problem extensively studied in machine learning, data mining and computer vision communities. A novel method is proposed for low-rank matrix recovery, targeting at higher recovery accuracy and stronger theoretical guarantee. Specifically, the proposed method is based on a nonconvex optimization model, by solving the low-rank matrix which can be recovered from the noisy observation. To solve the model, an effective algorithm is derived by minimizing over the variables alternately. It is proved theoretically that this algorithm has stronger theoretical guarantee than the existing work. In natural image denoising experiments, the proposed method achieves lower recovery error than the two compared methods. The proposed low-rank matrix recovery method is also applied to solve two real-world problems, i.e., removing noise from verification code and removing watermark from images, in which the images recovered by the proposed method are less noisy than those of the two compared methods.

Effective Customer Review Analysis Using Combined Capsule Networks with Matrix Factorization Filtering

Nowadays,commercial transactions and customer reviews are part of human life and various business applications.The technologies create a great impact on online user reviews and activities,affecting the business process.Customer reviews and ratings are more helpful to the new customer to purchase the product,but the fake reviews completely affect the business.The traditional systems consume maximum time and create complexity while analyzing a large volume of customer information.Therefore,in this work optimized recommendation system is developed for analyzing customer reviews with minimum complexity.Here,Amazon Product Kaggle dataset information is utilized for investigating the customer review.The collected information is analyzed and processed by batch normalized capsule networks(NCN).The network explores the user reviews according to product details,time,price purchasing factors,etc.,ensuring product quality and ratings.Then effective recommendation system is developed using a butterfly optimized matrix factorizationfiltering approach.Then the system’s efficiency is evaluated using the Rand Index,Dunn index,accuracy,and error rate.

Dispersion function of Rayleigh waves in porous layered half-space system

Rayleigh wave exploration is based on an elastic layered half-space model. If practical formations contain porous layers, these layers need to be simplified as an elastic medium. We studied the effects of this simplification on the results of Rayleigh wave exploration. Using a half-space model with coexisting porous and elastic layers, we derived the dispersion functions of Rayleigh waves in a porous layered half-space system with porous layers at different depths, and the problem of transferring variables to matrices of different orders is solved. To solve the significant digit overflow in the multiplication of transfer matrices, we propose a simple, effective method. Results suggest that dispersion curves differ in a low- frequency region when a porous layer is at the surface; otherwise, the difference is small.

Sensor fault diagnosis of nonlinear processes based on structured kernel principal component analysis

A new sensor fault diagnosis method based on structured kernel principal component analysis （KPCA） is proposed for nonlinear processes. By performing KPCA on subsets of variables, a set of structured residuals, i.e., scaled powers of KPCA, can be obtained in the same way as partial PCA. The structured residuals are utilized in composing an isolation scheme for sensor fault diagnosis, according to a properly designed incidence matrix. Sensor fault sensitivity and critical sensitivity are defined, based on which an incidence matrix optimization algorithm is proposed to improve the performance of the structured KPCA. The effectiveness of the proposed method is demonstrated on the simulated continuous stirred tank reactor （CSTR） process.

Generalizations of Several Identities Related to Mercier's

The purpose of this paper is to establish sev eral identities containing Gaussian binomial coefficient. These results generali ze several Mercier's results. Key words:Gaussian binomial coefficient; identity; the functio n A(T,T 2,...,T n)culating eige nvalues of auto-correlation matrix of the physical control force of actuators. T he optimization algorithm calculating the optimal actuator placement is then put forward via the minimization of an energy criterion, which is chosen as the con trol index. Numerical examples show the effectiveness of the proposed method.

A multi-objective decision-making method for the treatment scheme of landslide hazard

The treatment engineering of landslide hazard is a complicated systemengineering. The selecting treatment scheme is influenced by many factors such as technology,economics, environment, and risk. The decision-making of treatment schemes of landslide hazard is aproblem of comprehensive judgment with multi-hierarchy and multi-objective. The traditional analysishierarchy process needs identity test. The traditional analysis hierarchy process is improved bymeans of optimal transfer matrix here. An improved hierarchy decision-making model for the treatmentof landslide hazard is set up. The judgment matrix obtained by the method can naturally meet therequirement of identity, so the identity test is not necessary. At last, the method is applied tothe treatment decision-making of the dangerous rock mass at the Slate Mountain, and its applicationis discussed in detail.

Proximal Point-Like Method for Updating Simultaneously Mass and Stiffness Matrices of Finite Element Model

The problem of correcting simultaneously mass and stiffness matrices of finite element model of undamped structural systems using vibration tests is considered in this paper.The desired matrix properties,including satisfaction of the characteristic equation,symmetry,positive semidefiniteness and sparsity,are imposed as side constraints to form the optimal matrix pencil approximation problem.Using partial Lagrangian multipliers,we transform the nonlinearly constrained optimization problem into an equivalent matrix linear variational inequality,develop a proximal point-like method for solving the matrix linear variational inequality,and analyze its global convergence.Numerical results are included to illustrate the performance and application of the proposed method.

Hand-eye calibration with a new linear decomposition algorithm

To solve the homogeneous transformation equation of the form AX=XB in hand-eye calibration, where X represents an unknown transformation from the camera to the robot hand, and A and B denote the known movement transformations associated with the robot hand and the camera, respectively, this paper introduces a new linear decomposition algorithm which consists of singular value decomposition followed by the estimation of the optimal rotation matrix and the least squares equation to solve the rotation matrix of X. Without the requirements of traditional methods that A and B be rigid transformations with the same rotation angle, it enables the extension to non-rigid transformations for A and B. The details of our method are given, together with a short discussion of experimental results, showing that more precision and robustness can be achieved.

First-order optimality condition of basis pursuit denoise problem

A new first-order optimality condition for the basis pursuit denoise （BPDN） problem is derived. This condition provides a new approach to choose the penalty param- eters adaptively for a fixed point iteration algorithm. Meanwhile, the result is extended to matrix completion which is a new field on the heel of the compressed sensing. The numerical experiments of sparse vector recovery and low-rank matrix completion show validity of the theoretic results.

New judging model of fuzzy cluster optimal dividing based on rough sets theory

To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totality sample space, two algorithms are proposed on the basis of the data analysis method in rough sets theory： information system discrete algorithm （algorithm 1） and samples representatives judging algorithm （algorithm 2）. On the principle of the farthest distance, algorithm 1 transforms continuous data into discrete form which could be transacted by rough sets theory. Taking the approximate precision as a criterion, algorithm 2 chooses the sample space with a good representative. Hence, the clustering sample set in inducing and computing optimal dividing matrix can be achieved. Several theorems are proposed to provide strict theoretic foundations for the execution of the algorithm model. An applied example based on the new algorithm model is given, whose result verifies the feasibility of this new algorithm model.

Conditional Quadratic Semidefinite Programming:Examples and Methods

The conditional quadratic semidefinite programming(cQSDP)refers to a class of matrix optimization problems whose matrix variables are required to be positive semidefinite on a subspace,and the objectives are quadratic.The chief purpose of this paper is to focus on two primal examples of cQSDP:the problem of matrix completion/approximation on a subspace and the Euclidean distance matrix problem.For the latter problem,we review some classical contributions and establish certain links among them.Moreover,we develop a semismooth Newton method for a special class of cQSDP and establish its quadratic convergence under the condition of constraint nondegeneracy.We also include an application in calibrating the correlation matrix in Libor market models.We hope this work will stimulate new research in cQSDP.

Comprehensive and efficient discovery of time series motifs

Time series motifs are previously unknown,frequently occurring patterns in time series or approximately repeated subsequences that are very similar to each other.There are two issues in time series motifs discovery,the deficiency of the definition of K-motifs given by Lin et al.(2002) and the large computation time for extracting motifs.In this paper,we propose a relatively comprehensive definition of K-motifs to obtain more valuable motifs.Tominimize the computation time as much as possible,we extend the triangular inequality pruning method to avoid unnecessary operations and calculations,and propose an optimized matrix structure to produce the candidate motifs almost immediately.Results of two experiments on three time series datasets show that our motifs discovery algorithm is feasible and efficient.