In this paper, stochastic stabilization is investigated by max-plus algebra for a Markovian jump cloud control system with a reference signal. For the Markovian jump cloud control system, there exists framework adjust...In this paper, stochastic stabilization is investigated by max-plus algebra for a Markovian jump cloud control system with a reference signal. For the Markovian jump cloud control system, there exists framework adjustment whose evolution is satisfied with a Markov chain. Using max-plus algebra, a maxplus stochastic system is used to describe the Markovian jump cloud control system. A causal feedback matrix is obtained by exponential stability analysis for a causal feedback controller of the Markovian jump cloud control system. A sufficient condition is given to ensure existence on the causal feedback matrix of the causal feedback controller. Based on the causal feedback controller, stochastic stabilization in probability is analyzed for the Markovian jump cloud control system with a reference signal.Simulation results are given to show effectiveness of the causal feedback controller for the Markovian jump cloud control system.展开更多
A discrete event system is a dynamical system whose state evolves in time by the occurrence of events at possibly irregular time intervals. Timed Petri nets are a graphical and mathematical modeling tool applicable to...A discrete event system is a dynamical system whose state evolves in time by the occurrence of events at possibly irregular time intervals. Timed Petri nets are a graphical and mathematical modeling tool applicable to discrete event systems in order to represent its states evolution where the timing at which the state changes is taken into consideration. One of the most important performance issues to be considered in a discrete event system is its stability. Lyapunov theory provides the required tools needed to aboard the stability and stabilization problems for discrete event systems modeled with timed Petri nets whose mathematical model is given in terms of difference equations. By proving stability one guarantees a bound on the discrete event systems state dynamics. When the system is unstable, a sufficient condition to stabilize the system is given. It is shown that it is possible to restrict the discrete event systems state space in such a way that boundedness is achieved. However, the restriction is not numerically precisely known. This inconvenience is overcome by considering a specific recurrence equation, in the max-plus algebra, which is assigned to the timed Petri net graphical model.展开更多
Max-plus algebra has been widely used in the study of discrete-event dynamic systems.Using max-plus algebra makes it easy to specify safety constraints on events since they can be described as a set of inequalities of...Max-plus algebra has been widely used in the study of discrete-event dynamic systems.Using max-plus algebra makes it easy to specify safety constraints on events since they can be described as a set of inequalities of state variables,i.e.,firing times of relevant events.This paper proves that the problem of solving max-plus inequalities in a cube(MAXINEQ)is nondeterministic polynomial-time hard(NP-hard)in strong sense and the problem of verifying max-plus inequalities(VERMAXINEQ)is co-NP.As a corollary,the problem of solving a system of multivariate max-algebraic polynomial equalities and inequalities(MPEI)is shown to be NP-hard in strong sense.The results indicate the difficulties in comparing max-plus formulas in general.Problem structures of specific systems have to be explored to enable the development of efficient algorithms.展开更多
Given a compact and regular Hausdorff measure space (X, μ), with μ a Radon measure, it is known that the generalised space M(X) of all the positive Radon measures on X is isomorphic to the space of essentially bound...Given a compact and regular Hausdorff measure space (X, μ), with μ a Radon measure, it is known that the generalised space M(X) of all the positive Radon measures on X is isomorphic to the space of essentially bounded functions L<sup>∞</sup>(X, μ) on X. We confirm that the commutative von Neumann algebras M⊂B(H), with H=L<sup>2</sup>(X, μ), are unitary equivariant to the maximal ideals of the commutative algebra C(X). Subsequenly, we use the measure groupoid to formulate the algebraic and topological structures of the commutative algebra C(X) following its action on M(X) and define its representation and ergodic dynamical system on the commutative von Neumann algebras of M of B(H) .展开更多
In this paper, from the spacetime algebra associated with the Minkowski space ℝ3,1by means of a change of signature, we describe a quaternionic representation of the split-tetraquaternion algebra which incorporates th...In this paper, from the spacetime algebra associated with the Minkowski space ℝ3,1by means of a change of signature, we describe a quaternionic representation of the split-tetraquaternion algebra which incorporates the Pauli algebra, the split-biquaternion algebra and the split-quaternion algebra, we relate these algebras to Clifford algebras and we show the emergence of the stabilized Poincaré-Heisenberg algebra from the split-tetraquaternion algebra. We list without going into details some of their applications in Physics and in Born geometry.展开更多
Because homology on compact homogeneous nilpotent manifolds is closely related to homology on Lie algebras, studying homology on Lie algebras is helpful for further studying homology on compact homogeneous nilpotent m...Because homology on compact homogeneous nilpotent manifolds is closely related to homology on Lie algebras, studying homology on Lie algebras is helpful for further studying homology on compact homogeneous nilpotent manifolds. So we start with the differential sequence of Lie algebras. The Lie algebra g has the differential sequence E0,E1,⋯,Es⋯, which leads to the chain complex Es0→Δs0Ess→Δs1⋯→ΔsiEs(i+1)s→Δsi+1⋯of Esby discussing the chain complex E10→Δ10E11→Δ11⋯→Δ1r−1E1r→Δ1r⋯of E1and proves that Es+1i≅Hi(Es)=KerΔsi+1/ImΔsiand therefore Es+1≅H(Es)by the chain complex of Es(see Theorem 2).展开更多
The superiority of hypothetical quantum computers is not due to faster calculations but due to different scheme of calculations running on special hardware. At the same time, one should realize that quantum computers ...The superiority of hypothetical quantum computers is not due to faster calculations but due to different scheme of calculations running on special hardware. At the same time, one should realize that quantum computers would only provide dramatic speedups for a few specific problems, for example, factoring integers and breaking cryptographic codes in the conventional quantum computing approach. The core of quantum computing follows the way a state of a quantum system is defined when basic things interact with each other. In the conventional approach, it is implemented through the tensor product of qubits. In the suggested geometric algebra formalism simultaneous availability of all the results for non-measured observables is based on the definition of states as points on a three-dimensional sphere, which is very different from the usual Hilbert space scheme.展开更多
In this paper,we define a new class of control functions through aggregate special functions.These class of control functions help us to stabilize and approximate a tri-additiveψ-functional inequality to get a better...In this paper,we define a new class of control functions through aggregate special functions.These class of control functions help us to stabilize and approximate a tri-additiveψ-functional inequality to get a better estimation for permuting tri-homomorphisms and permuting tri-derivations in unital C*-algebras and Banach algebras by the vector-valued alternative fixed point theorem.展开更多
This research develops a solution method for project scheduling represented by a max-plus-linear (MPL) form. Max-plus-linear representation is an approach to model and analyze a class of discrete-event systems, in whi...This research develops a solution method for project scheduling represented by a max-plus-linear (MPL) form. Max-plus-linear representation is an approach to model and analyze a class of discrete-event systems, in which the behavior of a target system is represented by linear equations in max-plus algebra. Several types of MPL equations can be reduced to a constraint satisfaction problem (CSP) for mixed integer programming. The resulting formulation is flexible and easy-to-use for project scheduling;for example, we can obtain the earliest output times, latest task-starting times, and latest input times using an MPL form. We also develop a key method for identifying critical tasks under the framework of CSP. The developed methods are validated through a numerical example.展开更多
In this paper, we review some of their related properties of derivations on MValgebras and give some characterizations of additive derivations. Then we prove that the fixed point set of Boolean additive derivations an...In this paper, we review some of their related properties of derivations on MValgebras and give some characterizations of additive derivations. Then we prove that the fixed point set of Boolean additive derivations and that of their adjoint derivations are isomorphic.In particular, we prove that every MV-algebra is isomorphic to the direct product of the fixed point set of Boolean additive derivations and that of their adjoint derivations. Finally we show that every Boolean algebra is isomorphic to the algebra of all Boolean additive(implicative)derivations. These results also give the negative answers to two open problems, which were proposed in [Fuzzy Sets and Systems, 303(2016), 97-113] and [Information Sciences, 178(2008),307-316].展开更多
Dear Editor, The time-dependent algebraic Riccati equation(TDARE) problem is applied to many optimal control industrial applications. It is susceptible to interference from measurement noises in the virtual environmen...Dear Editor, The time-dependent algebraic Riccati equation(TDARE) problem is applied to many optimal control industrial applications. It is susceptible to interference from measurement noises in the virtual environment, which current methods cannot effectively address. A normbased adaptive coefficient zeroing neural network(NACZNN) model to solve the TDARE problem is proposed.展开更多
We introduce and investigate the properties of a generalization of the derivation of dendriform algebras. We specify all possible parameter values for the generalized derivations, which depend on parameters. We provid...We introduce and investigate the properties of a generalization of the derivation of dendriform algebras. We specify all possible parameter values for the generalized derivations, which depend on parameters. We provide all generalized derivations for complex low-dimensional dendriform algebras.展开更多
基金supported by the National Natural Science Foundation of China (61973230)Tianjin Research Innovation Project for Postgraduate Students (2021YJSO2S03)。
文摘In this paper, stochastic stabilization is investigated by max-plus algebra for a Markovian jump cloud control system with a reference signal. For the Markovian jump cloud control system, there exists framework adjustment whose evolution is satisfied with a Markov chain. Using max-plus algebra, a maxplus stochastic system is used to describe the Markovian jump cloud control system. A causal feedback matrix is obtained by exponential stability analysis for a causal feedback controller of the Markovian jump cloud control system. A sufficient condition is given to ensure existence on the causal feedback matrix of the causal feedback controller. Based on the causal feedback controller, stochastic stabilization in probability is analyzed for the Markovian jump cloud control system with a reference signal.Simulation results are given to show effectiveness of the causal feedback controller for the Markovian jump cloud control system.
文摘A discrete event system is a dynamical system whose state evolves in time by the occurrence of events at possibly irregular time intervals. Timed Petri nets are a graphical and mathematical modeling tool applicable to discrete event systems in order to represent its states evolution where the timing at which the state changes is taken into consideration. One of the most important performance issues to be considered in a discrete event system is its stability. Lyapunov theory provides the required tools needed to aboard the stability and stabilization problems for discrete event systems modeled with timed Petri nets whose mathematical model is given in terms of difference equations. By proving stability one guarantees a bound on the discrete event systems state dynamics. When the system is unstable, a sufficient condition to stabilize the system is given. It is shown that it is possible to restrict the discrete event systems state space in such a way that boundedness is achieved. However, the restriction is not numerically precisely known. This inconvenience is overcome by considering a specific recurrence equation, in the max-plus algebra, which is assigned to the timed Petri net graphical model.
基金supported by the National Natural Science Foundation of China (Grant Nos.60574067 and 60721003).
文摘Max-plus algebra has been widely used in the study of discrete-event dynamic systems.Using max-plus algebra makes it easy to specify safety constraints on events since they can be described as a set of inequalities of state variables,i.e.,firing times of relevant events.This paper proves that the problem of solving max-plus inequalities in a cube(MAXINEQ)is nondeterministic polynomial-time hard(NP-hard)in strong sense and the problem of verifying max-plus inequalities(VERMAXINEQ)is co-NP.As a corollary,the problem of solving a system of multivariate max-algebraic polynomial equalities and inequalities(MPEI)is shown to be NP-hard in strong sense.The results indicate the difficulties in comparing max-plus formulas in general.Problem structures of specific systems have to be explored to enable the development of efficient algorithms.
文摘Given a compact and regular Hausdorff measure space (X, μ), with μ a Radon measure, it is known that the generalised space M(X) of all the positive Radon measures on X is isomorphic to the space of essentially bounded functions L<sup>∞</sup>(X, μ) on X. We confirm that the commutative von Neumann algebras M⊂B(H), with H=L<sup>2</sup>(X, μ), are unitary equivariant to the maximal ideals of the commutative algebra C(X). Subsequenly, we use the measure groupoid to formulate the algebraic and topological structures of the commutative algebra C(X) following its action on M(X) and define its representation and ergodic dynamical system on the commutative von Neumann algebras of M of B(H) .
文摘In this paper, from the spacetime algebra associated with the Minkowski space ℝ3,1by means of a change of signature, we describe a quaternionic representation of the split-tetraquaternion algebra which incorporates the Pauli algebra, the split-biquaternion algebra and the split-quaternion algebra, we relate these algebras to Clifford algebras and we show the emergence of the stabilized Poincaré-Heisenberg algebra from the split-tetraquaternion algebra. We list without going into details some of their applications in Physics and in Born geometry.
文摘Because homology on compact homogeneous nilpotent manifolds is closely related to homology on Lie algebras, studying homology on Lie algebras is helpful for further studying homology on compact homogeneous nilpotent manifolds. So we start with the differential sequence of Lie algebras. The Lie algebra g has the differential sequence E0,E1,⋯,Es⋯, which leads to the chain complex Es0→Δs0Ess→Δs1⋯→ΔsiEs(i+1)s→Δsi+1⋯of Esby discussing the chain complex E10→Δ10E11→Δ11⋯→Δ1r−1E1r→Δ1r⋯of E1and proves that Es+1i≅Hi(Es)=KerΔsi+1/ImΔsiand therefore Es+1≅H(Es)by the chain complex of Es(see Theorem 2).
文摘The superiority of hypothetical quantum computers is not due to faster calculations but due to different scheme of calculations running on special hardware. At the same time, one should realize that quantum computers would only provide dramatic speedups for a few specific problems, for example, factoring integers and breaking cryptographic codes in the conventional quantum computing approach. The core of quantum computing follows the way a state of a quantum system is defined when basic things interact with each other. In the conventional approach, it is implemented through the tensor product of qubits. In the suggested geometric algebra formalism simultaneous availability of all the results for non-measured observables is based on the definition of states as points on a three-dimensional sphere, which is very different from the usual Hilbert space scheme.
基金partially supported by the Natural Sciences and Engineering Research Council of Canada(2019-03907)。
文摘In this paper,we define a new class of control functions through aggregate special functions.These class of control functions help us to stabilize and approximate a tri-additiveψ-functional inequality to get a better estimation for permuting tri-homomorphisms and permuting tri-derivations in unital C*-algebras and Banach algebras by the vector-valued alternative fixed point theorem.
文摘This research develops a solution method for project scheduling represented by a max-plus-linear (MPL) form. Max-plus-linear representation is an approach to model and analyze a class of discrete-event systems, in which the behavior of a target system is represented by linear equations in max-plus algebra. Several types of MPL equations can be reduced to a constraint satisfaction problem (CSP) for mixed integer programming. The resulting formulation is flexible and easy-to-use for project scheduling;for example, we can obtain the earliest output times, latest task-starting times, and latest input times using an MPL form. We also develop a key method for identifying critical tasks under the framework of CSP. The developed methods are validated through a numerical example.
基金Supported by a grant of National Natural Science Foundation of China(12001243,61976244,12171294,11961016)the Natural Science Basic Research Plan in Shaanxi Province of China(2020JQ-762,2021JQ-580)。
文摘In this paper, we review some of their related properties of derivations on MValgebras and give some characterizations of additive derivations. Then we prove that the fixed point set of Boolean additive derivations and that of their adjoint derivations are isomorphic.In particular, we prove that every MV-algebra is isomorphic to the direct product of the fixed point set of Boolean additive derivations and that of their adjoint derivations. Finally we show that every Boolean algebra is isomorphic to the algebra of all Boolean additive(implicative)derivations. These results also give the negative answers to two open problems, which were proposed in [Fuzzy Sets and Systems, 303(2016), 97-113] and [Information Sciences, 178(2008),307-316].
基金supported in part by the Natural Science Foundation of Guangdong Province,China(2021A 1515011847)Postgraduate Education Innovation Project of Guangdong Ocean University(202214,202250,202251,202159,202160)+1 种基金the Special Project in Key Fields of Universities in Department of Education of Guangdong Province(2019KZDZX1036)the Key Laboratory of Digital Signal and Image Processing of Guangdong Province(2019GDDSIPL-01)。
文摘Dear Editor, The time-dependent algebraic Riccati equation(TDARE) problem is applied to many optimal control industrial applications. It is susceptible to interference from measurement noises in the virtual environment, which current methods cannot effectively address. A normbased adaptive coefficient zeroing neural network(NACZNN) model to solve the TDARE problem is proposed.
文摘We introduce and investigate the properties of a generalization of the derivation of dendriform algebras. We specify all possible parameter values for the generalized derivations, which depend on parameters. We provide all generalized derivations for complex low-dimensional dendriform algebras.