环与环上矩阵的正则性

本文主要研究环及其上矩阵的正则性 .当 R是一个有单位元的环时 ,本文引进并刻划了Mm× n( R)的正则性并由此重新证明了环 R与全矩阵环 Mn( R)正则的等价性 。

Improved results on synchronization in arrays of coupled delayed neural networks with hybrid coupling

In order to investigate the influence of hybrid coupling on the synchronization of delayed neural networks, by choosing an improved delay-dependent Lyapunov-Krasovskii functional, one less conservative asymptotical criterion based on linear matrix inequality （LMI） is established. The Kronecker product and convex combination techniques are employed. Also the bounds of time-varying delays and delay derivatives are fully considered. By adjusting the inner coupling matrix parameters and using the Matlab LMI toolbox, the design and applications of addressed coupled networks can be realized. Finally, the efficiency and applicability of the proposed results are illustrated by a numerical example with simulations.

A Fully Homomorphic Encryption Scheme with Better Key Size

Fully homomorphic encryption is faced with two problems now. One is candidate fully homomorphic encryption schemes are few. Another is that the efficiency of fully homomorphic encryption is a big question. In this paper, we propose a fully homomorphic encryption scheme based on LWE, which has better key size. Our main contributions are： （1） According to the binary-LWE recently, we choose secret key from binary set and modify the basic encryption scheme proposed in Linder and Peikert in 2010. We propose a fully homomorphic encryption scheme based on the new basic encryption scheme. We analyze the correctness and give the proof of the security of our scheme. The public key, evaluation keys and tensored ciphertext have better size in our scheme. （2） Estimating parameters for fully homomorphic encryption scheme is an important work. We estimate the concert parameters for our scheme. We compare these parameters between our scheme and Bral2 scheme. Our scheme have public key and private key that smaller by a factor of about logq than in Bral2 scheme. Tensored ciphertext in our scheme is smaller by a factor of about log2q than in Bral2 scheme. Key switching matrix in our scheme is smaller by a factor of about log3q than in Bra12 scheme.

Stability Analysis for Stochastic Delayed High-order Neural Networks

In this paper, the global asymptotic stability analysis problem is considered for a class of stochastic high-order neural networks with tin.delays. Based on a Lyapunov-Krasovskii functional and the stochastic stability analysis theory, several sufficient conditions are derived in order to guarantee the global asymptotic convergence of the equilibtium paint in the mean square. Investigation shows that the addressed stochastic highorder delayed neural networks are globally asymptotically stable in the mean square if there are solutions to some linear matrix inequalities （LMIs）. Hence, the global asymptotic stability of the studied stochastic high-order delayed neural networks can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed global stability criteria.

The Volterra-Lyapunov matrix theory for global stability analysis of a model of the HIV/AIDS

In this paper, we analyze a nonlinear mathematical model of the HIV/AIDS and screening of unaware infectives on the transmission dynamics of the disease in a homoge- neous population with constant immigration of susceptibles incorporating use of condom, screening of unaware infectives and treatment of the infected. We consider constant con- trols and thereafter by incorporating the theory of Volterra-Lyapunov stable matrices into the classical method of Lyapunov functions, we present an approach for global stability analysis of HIV/AIDS. The analysis and results presented in this paper make building blocks toward a comprehensive study and deeper understanding of the funda- mental mechanism in HIV/AIDS. A numerical study of the model is also carried out to investigate the analytical results.