A method based on vector type for sparse storage and quick access to projection matrix

For sparse storage and quick access to projection matrix based on vector type, this paper proposes a method to solve the problems of the repetitive computation of projection coefficient, the large space occupation and low retrieval efficiency of projection matrix in iterative reconstruction algorithms, which calculates only once the projection coefficient and stores the data sparsely in binary format based on the variable size of library vector type. In the iterative reconstruction process, these binary files are accessed iteratively and the vector type is used to quickly obtain projection coefficients of each ray. The results of the experiments show that the method reduces the memory space occupation of the projection matrix and the computation of projection coefficient in iterative process, and accelerates the reconstruction speed.

Adaptive generalized matrix projective lag synchronization between two different complex networks with non-identical nodes and different dimensions

The adaptive generalized matrix projective lag synchronization between two different complex networks with non-identical nodes and different dimensions is investigated in this paper. Based on Lyapunov stability theory and Barbalat＇s lemma, generalized matrix projective lag synchronization criteria are derived by using the adaptive control method. Furthermore, each network can be undirected or directed, connected or disconnected, and nodes in either network may have identical or different dynamics. The proposed strategy is applicable to almost all kinds of complex networks. In addition, numerical simulation results are presented to illustrate the effectiveness of this method, showing that the synchronization speed is sensitively influenced by the adaptive law strength, the network size, and the network topological structure.

Fixed-Time Adaptive Time-Varying Matrix Projective Synchronization of Time-Delayed Chaotic Systems with Different Dimensions

This paper deals with the fixed-time adaptive time-varying matrix projective synchronization(ATVMPS)of different dimensional chaotic systems(DDCSs)with time delays and unknown parameters.Firstly,to estimate the unknown parameters,adaptive parameter updated laws are designed.Secondly,to realize the fixed-time ATVMPS of the time-delayed DDCSs,an adaptive delay-unrelated controller is designed,where time delays of chaotic systems are known or unknown.Thirdly,some simple fixed-time ATVMPS criteria are deduced,and the rigorous proof is provided by employing the inequality technique and Lyapunov theory.Furthermore,the settling time of fixed-time synchronization(Fix-TS)is obtained,which depends only on controller parameters and system parameters and is independent of the system’s initial states.Finally,simulation examples are presented to validate the theoretical analysis.

BEAM BROADENING SYNTHESIS FOR SAR ANTENNA ARRAY BASED ON PROJECTION MATRIX ALGORITHM

A new beam broadening synthesis technique for Synthetic Aperture Radar(SAR) antenna array, namely Projection Matrix Algorithm(PMA) is presented. The theory of PMA is introduced firstly, and then the iterative renewed manner is improved to resolve the unbalance problem under amplitude and phase control. In order to validate the algorithm correct and effective, an actual engineering application example is investigated. The beam synthesis results of 1.0~4.5 times broadening under the phase only control and the amplitude and phase control using improved PMA are given. The results show that the beam directivity, the beam broadening, and the side-lobe level requirements were met. It is demonstrated that the improved PMA was effective and feasible for SAR application.

A New Model for Network Security Situation Assessment of the Industrial Internet

To address the problem of network security situation assessment in the Industrial Internet,this paper adopts the evidential reasoning(ER)algorithm and belief rule base(BRB)method to establish an assessment model.First,this paper analyzes the influencing factors of the Industrial Internet and selects evaluation indicators that contain not only quantitative data but also qualitative knowledge.Second,the evaluation indicators are fused with expert knowledge and the ER algorithm.According to the fusion results,a network security situation assessment model of the Industrial Internet based on the ER and BRB method is established,and the projection covariance matrix adaptive evolution strategy(P-CMA-ES)is used to optimize the model parameters.This method can not only utilize semiquantitative information effectively but also use more uncertain information and prevent the problem of combinatorial explosion.Moreover,it solves the problem of the uncertainty of expert knowledge and overcomes the problem of low modeling accuracy caused by insufficient data.Finally,a network security situation assessment case of the Industrial Internet is analyzed to verify the effectiveness and superiority of the method.The research results showthat this method has strong applicability to the network security situation assessment of complex Industrial Internet systems.It can accurately reflect the actual network security situation of Industrial Internet systems and provide safe and reliable suggestions for network administrators to take timely countermeasures,thereby improving the risk monitoring and emergency response capabilities of the Industrial Internet.

A REPLACEMENT SCHEME ON THE CONSTRUCTION OF ORTHOGONAL ARRAYS

A method of constructing orthogonal arrays is presented by Zhang, Lu and Pang in 1999.In this paper,the method is developed by introducing a replacement scheme on the construction of orthogonal arrays ,and some new mixed-level orthogonal arrays of run size 36 are constructed.

A NOVEL DIRECTION OF ARRIVAL ESTIMATOR

A Direction Of Arrival(DOA) estimator based on the signal separation principle is introduced, and one of representative multidimensional estimators is established by introducing Matrix Operator projection signal steering Vector Excision(MOVE) operation. Thanks to Alternating Separation (AS) technique, the multidimensional problem is transformed into a series of one-dimensional optimal ones. Furthermore, an equivalent simplified implementation of the AS is obtained. Finally the definiteness and uniqueness of the estimator are analyzed.

THE FREE-INTERFACE METHOD OF COMPONENT MODE SYNTHESIS FOR SYSTEMS WITH VISCOUS DAMPING

This paper presents a new free-interface method of component mode synthesis for linear systems with arbitrary viscous damping. The left and right projection matrices described by state-variable vectors are first introduced for components with rigid-body freedom. The operator function of projection matrices for state displacement and state force is proved, and then the state residual flexibility matrix and the state residual inertia-relief attachment mode are defined and employed. The results of three examples demonstrate that the method proposed in this paper leads to very accurate system eigenvalues and high mode-synthesis efficiency

HYBRID INTERFERENCE CANCELLATION SCHEME FOR BLIND MULTIUSER DETECTION IN MULTIPATH FADING CHANNELS

This paper introduces and analyzes a detection scheme for adaptive suppression of Multiuser Access Interference (MAI) and MultiPath Distortion (MPD) for mobile station of DS/CDMA system. The proposed detection scheme may amount to a RAKE receiver structure,wherein each branch is considered as a linear multiuser filter designed under a Linear Constrained Minimum Variance (LCMV) optimization strategy to suppress MAI, followed by a proper combining rule to suppress MPD. The adaptive blind multiuser detecting and optimum combining of the proposed receiver are realized, based on the Least-Mean-Square (LMS) algorithm and an adaptive vector tracking algorithm respectively. Finally, the feasibility of the above two algorithms is proved by the numerical results provided by computer simulation.

Construction of a Class of Quantum Boolean Functions Based on the Hadamard Matrix

In this study, a new methodology based on the Hadamard matrix is proposed to construct quantum Boolean functions f such that f ： I2n --2P2n, where I2n is an identity matrix of order 2n and P2n is a projective matrix with the same order as I2n. The enumeration of this class of quantum Boolean functions is also presented.

On the Properties of Cheng Projection

This paper mainly investigates some properties of Cheng projection,which was proposed recently by Prof.Cheng to reduce the dimension of vector.As a linear transformation from the original vector space to the target vector space,the matrix representation of Cheng projection is given.Then,the structure matrix of Cheng projection,called the Cheng projection matrix,is obtained.Algebraic properties of Cheng projection are derived via its projection matrix.Furthermore,the product and norm of Cheng projection matrices are concerned.

A new result on recovery sparse signals using orthogonal matching pursuit

Orthogonal matching pursuit(OMP)algorithm is a classical greedy algorithm widely used in compressed sensing.In this paper,by exploiting the Wielandt inequality and some properties of orthogonal projection matrix,we obtained a new number of iterations required for the OMP algorithm to perform exact recovery of sparse signals,which improves significantly upon the latest results as we know.

CONSTRUCTION OF A NEW CLASS OF ORTHOGONAL ARRAYS

By using the generalized Hadamard product, difference matrix and projection matrices, we present a class of orthogonal projection matrices and related orthogonal arrays of strength two. A new class of orthogonal arrays are constructed.

A GENERALIZED GRADIENT PROJECTION METHOD FOR OPTIMIZATION PROBLEMS WITH EQUALITY AND INEQUALITY CONSTRAINTS ABOUT ARBITRARY INITIAL POINT

In this paper, we give a new generalized gradient projection algorithm for nonlinear optimization problems with arbitrary initial point. This new algorithm has some important advantages as follows: (1) The algorithm does not require initial feasible point; (2) It can deal with nonlinear equality and inequality constraints problems; (3) The structure of our algorithm is very simple;(4) Under some mild assumptions, it has global convergence.