In this paper, the solution of the matrix second semi-tensor product equation A∘lX∘lB=Cis studied. Firstly, the solvability of the matrix-vector second semi-tensor product equation is investigated. At the same time,...In this paper, the solution of the matrix second semi-tensor product equation A∘lX∘lB=Cis studied. Firstly, the solvability of the matrix-vector second semi-tensor product equation is investigated. At the same time, the compatibility conditions, the sufficient and necessary conditions and the specific solution methods for the matrix solution are given. Secondly, we further consider the solvability of the second semi-tensor product equation of the matrix. For each part, several examples are given to illustrate the validity of the results.展开更多
This paper proposes a new matrix product, namely, semi-tensor product. It is a general-ization of the conventional matrix product. Meanwhile, it is also closely related to Kronecker (tensor) product of matrices. The p...This paper proposes a new matrix product, namely, semi-tensor product. It is a general-ization of the conventional matrix product. Meanwhile, it is also closely related to Kronecker (tensor) product of matrices. The purpose of introducing this product is twofold: (i) treat multi-dimensional da-ta; (ii) treat nonlinear problems in a linear way. Then the computer and numerical methods can be easily used for solving nonlinear problems. Properties and formulas are deduced. As an application, the Morgan's problem for control systems is formulated as a numerically solvable problem.展开更多
This paper investigates the transition function and the reachability conditions of finite automata by using a semitensor product of matrices, which is a new powerful matrix analysis tool. The states and input symbols ...This paper investigates the transition function and the reachability conditions of finite automata by using a semitensor product of matrices, which is a new powerful matrix analysis tool. The states and input symbols are first expressed in vector forms, then the transition function is described in an algebraic form. Using this algebraic representation, a sufficient and necessary condition of the reachability of any two states is proposed, based on which an algorithm is developed for discovering all the paths from one state to another. Furthermore, a mechanism is established to recognize the language acceptable by a finite automaton. Finally, illustrative examples show that the results/algorithms presented in this paper are suitable for both deterministic finite automata （DFA） and nondeterministic finite automata （NFA）.展开更多
Abstract The left semi-tensor product of matrices was proposed in [2]. In this paper the right semi-tensor product is introduced first. Some basic properties are presented and compared with those of the left semi-tens...Abstract The left semi-tensor product of matrices was proposed in [2]. In this paper the right semi-tensor product is introduced first. Some basic properties are presented and compared with those of the left semi-tensor product.Then two new applications are investigated. Firstly, its applications to connection, an important concept in differential geometry, is considered. The structure matrix and the Christoffel matrix are introduced. The transfer formulas under coordinate transformation are expressed in matrix form. Certain new results are obtained. Secondly, the structure of finite dimensional Lie algebra, etc. are investigated under the matrix expression.These applications demonstrate the usefulness of the new matrix products.展开更多
This paper gives a matrix expression of logic. Under the matrix expression, a general description of the logical operators is proposed. Using the semi-tensor product of matrices, the proofs of logical equivalences, im...This paper gives a matrix expression of logic. Under the matrix expression, a general description of the logical operators is proposed. Using the semi-tensor product of matrices, the proofs of logical equivalences, implications, etc., can be simplified a lot. Certain general properties are revealed. Then, based on matrix expression, the logical operators are extended to multi-valued logic, which provides a foundation for fuzzy logical inference. Finally, we propose a new type of logic, called mix-valued logic, and a new design technique, called logic-based fuzzy control. They provide a numerically computable framework for the application of fuzzy logic for the control of fuzzy systems.展开更多
The stability of Non-Linear Feedback Shift Registers(NFSRs)plays an important role in the cryptographic security.Due to the complexity of nonlinear systems and the lack of efficient algebraic tools,the theorems relate...The stability of Non-Linear Feedback Shift Registers(NFSRs)plays an important role in the cryptographic security.Due to the complexity of nonlinear systems and the lack of efficient algebraic tools,the theorems related to the stability of NFSRs are still not well-developed.In this paper,we view the NFSR with periodic inputs as a Boolean control network.Based on the mathematical tool of semi-tensor product(STP),the Boolean network can be mapped into an algebraic form.Through these basic theories,we analyze the state space of non-autonomous NFSRs,and discuss the stability of an NFSR with periodic inputs of limited length or unlimited length.The simulation results are provided to prove the efficiency of the model.Based on these works,we can provide a method to analyze the stability of the NFSR with periodic input,including limited length and unlimited length.By this,we can efficiently reduce the computational complexity,and its efficiency is demonstrated by applying the theorem in simulations dealing with the stability of a non-autonomous NFSR.展开更多
An equivalent definition of hypermatrices is introduced.The matrix expression of hypermatrices is proposed.Using permu-tation matrices,the conversion between different matrix expressions is revealed.The various kinds ...An equivalent definition of hypermatrices is introduced.The matrix expression of hypermatrices is proposed.Using permu-tation matrices,the conversion between different matrix expressions is revealed.The various kinds of contracted products of hypermatrices are realized by semi-tensor products(STP)of matrices via matrix expressions of hypermatrices.展开更多
Boolean control network consists of a set of Boolean variables whose state is determined by other variables in the network. Boolean network is used for modeling complex system. In this paper, we have presented a model...Boolean control network consists of a set of Boolean variables whose state is determined by other variables in the network. Boolean network is used for modeling complex system. In this paper, we have presented a model of a context-aware system used in smart home based on Boolean control networks. This modeling describes the relationship between the context elements (person, time, location, and activity) and services (Morning Call, Sleeping, Guarding, Entertainment, and normal), which is effective to logical inference. We apply semi tensor matrix product to describe the dynamic of the system. This matrix form of expression is a convenient and reasonable way to design logic control system.展开更多
Traditional matrix-based approaches in the field of finite state machines construct state transition matrices,and then use the powers of the state transition matrices to represent corresponding dynamic transition proc...Traditional matrix-based approaches in the field of finite state machines construct state transition matrices,and then use the powers of the state transition matrices to represent corresponding dynamic transition processes,which are cornerstones of system analysis.In this study,we propose a static matrix-based approach that revisits a finite state machine from its structure rather than its dynamic transition process,thus avoiding the“explosion of complexity”problem inherent in the existing approaches.Based on the static approach,we reexamine the issues of closed-loop detection and controllability for deterministic finite state machines.In addition,we propose controllable equivalent form and minimal controllable equivalent form concepts and give corresponding algorithms.展开更多
文摘In this paper, the solution of the matrix second semi-tensor product equation A∘lX∘lB=Cis studied. Firstly, the solvability of the matrix-vector second semi-tensor product equation is investigated. At the same time, the compatibility conditions, the sufficient and necessary conditions and the specific solution methods for the matrix solution are given. Secondly, we further consider the solvability of the second semi-tensor product equation of the matrix. For each part, several examples are given to illustrate the validity of the results.
基金This work was supported by the National Natural Science Foundation of China ( Grant Nos. G69774008, G59837270) National 973 Project (Grant No. G1998020308) National Key Project of China.
文摘This paper proposes a new matrix product, namely, semi-tensor product. It is a general-ization of the conventional matrix product. Meanwhile, it is also closely related to Kronecker (tensor) product of matrices. The purpose of introducing this product is twofold: (i) treat multi-dimensional da-ta; (ii) treat nonlinear problems in a linear way. Then the computer and numerical methods can be easily used for solving nonlinear problems. Properties and formulas are deduced. As an application, the Morgan's problem for control systems is formulated as a numerically solvable problem.
基金Acknowledgements This work was supported by the National Natural Science Foundation of China （Grant No. 61174094）, and the Tianjin Natural Science Foundation of China under （14JCYBJC18700 and 13JCY- BJC17400）.
文摘This paper investigates the transition function and the reachability conditions of finite automata by using a semitensor product of matrices, which is a new powerful matrix analysis tool. The states and input symbols are first expressed in vector forms, then the transition function is described in an algebraic form. Using this algebraic representation, a sufficient and necessary condition of the reachability of any two states is proposed, based on which an algorithm is developed for discovering all the paths from one state to another. Furthermore, a mechanism is established to recognize the language acceptable by a finite automaton. Finally, illustrative examples show that the results/algorithms presented in this paper are suitable for both deterministic finite automata （DFA） and nondeterministic finite automata （NFA）.
基金Partially supported by the National Science Foundation (G.59837270)the National Key Project (G.1998020308) of China.
文摘Abstract The left semi-tensor product of matrices was proposed in [2]. In this paper the right semi-tensor product is introduced first. Some basic properties are presented and compared with those of the left semi-tensor product.Then two new applications are investigated. Firstly, its applications to connection, an important concept in differential geometry, is considered. The structure matrix and the Christoffel matrix are introduced. The transfer formulas under coordinate transformation are expressed in matrix form. Certain new results are obtained. Secondly, the structure of finite dimensional Lie algebra, etc. are investigated under the matrix expression.These applications demonstrate the usefulness of the new matrix products.
基金the National Natural Science Foundation of China (No.60274010, 60343001, 60221301, 60334040)
文摘This paper gives a matrix expression of logic. Under the matrix expression, a general description of the logical operators is proposed. Using the semi-tensor product of matrices, the proofs of logical equivalences, implications, etc., can be simplified a lot. Certain general properties are revealed. Then, based on matrix expression, the logical operators are extended to multi-valued logic, which provides a foundation for fuzzy logical inference. Finally, we propose a new type of logic, called mix-valued logic, and a new design technique, called logic-based fuzzy control. They provide a numerically computable framework for the application of fuzzy logic for the control of fuzzy systems.
基金This work is supported by the National Natural Science Foundation of China(Grants Nos.61672020,U1803263,61662069,61762068,31560622,31260538,30960246,31672385,71761029)Project funded by China Postdoctoral Science Foundation(2013M542560,2015T81129)+6 种基金A Project of Shandong Province Higher Educational Science and Technology Program(No.J16LN61)Inner Mongolia Colleges and Universities Scientific and Technological Research Projects(Grant No.NJZC17148)CERNET Innovation Project(No.NGII20161209)Natural Science Foundation of Inner Mongolia Autonomous Region of china(No.2017MS0610,No.2017MS717)Program for Young Talents of Science and Technology in Universities of Inner Mongolia Autonomous Region(No.NJYT-18-A13)Inner Mongolia Key Laboratory of economic data analysis and mining China-Mongolia Scientific Research Capacity Building of Incubator,Joint Laboratory and Technology Transfer Center,Education research project of national finance and economics(No.MZCJYB1803)Postgraduate research and innovation project of Inner Mongolia university of finance and economics.
文摘The stability of Non-Linear Feedback Shift Registers(NFSRs)plays an important role in the cryptographic security.Due to the complexity of nonlinear systems and the lack of efficient algebraic tools,the theorems related to the stability of NFSRs are still not well-developed.In this paper,we view the NFSR with periodic inputs as a Boolean control network.Based on the mathematical tool of semi-tensor product(STP),the Boolean network can be mapped into an algebraic form.Through these basic theories,we analyze the state space of non-autonomous NFSRs,and discuss the stability of an NFSR with periodic inputs of limited length or unlimited length.The simulation results are provided to prove the efficiency of the model.Based on these works,we can provide a method to analyze the stability of the NFSR with periodic input,including limited length and unlimited length.By this,we can efficiently reduce the computational complexity,and its efficiency is demonstrated by applying the theorem in simulations dealing with the stability of a non-autonomous NFSR.
基金This work was supported partly by the National Natural Science Foundation of China(NSFC)(Nos.62073315,62103305)the Shanghai Pujiang Program(No.21PJ 1413100)China Postdoctoral Science Foundation(Nos.2021M703423,2022T150686).
文摘An equivalent definition of hypermatrices is introduced.The matrix expression of hypermatrices is proposed.Using permu-tation matrices,the conversion between different matrix expressions is revealed.The various kinds of contracted products of hypermatrices are realized by semi-tensor products(STP)of matrices via matrix expressions of hypermatrices.
文摘Boolean control network consists of a set of Boolean variables whose state is determined by other variables in the network. Boolean network is used for modeling complex system. In this paper, we have presented a model of a context-aware system used in smart home based on Boolean control networks. This modeling describes the relationship between the context elements (person, time, location, and activity) and services (Morning Call, Sleeping, Guarding, Entertainment, and normal), which is effective to logical inference. We apply semi tensor matrix product to describe the dynamic of the system. This matrix form of expression is a convenient and reasonable way to design logic control system.
基金supported by the National Natural Science Foundation of China(Nos.U1804150,62073124,and 61973175)。
文摘Traditional matrix-based approaches in the field of finite state machines construct state transition matrices,and then use the powers of the state transition matrices to represent corresponding dynamic transition processes,which are cornerstones of system analysis.In this study,we propose a static matrix-based approach that revisits a finite state machine from its structure rather than its dynamic transition process,thus avoiding the“explosion of complexity”problem inherent in the existing approaches.Based on the static approach,we reexamine the issues of closed-loop detection and controllability for deterministic finite state machines.In addition,we propose controllable equivalent form and minimal controllable equivalent form concepts and give corresponding algorithms.
