Stochastic stabilization of Markovian jump cloud control systems based on max-plus algebra

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.

The Relation between the Stabilization Problem for Discrete Event Systems Modeled with Timed Petri Nets via Lyapunov Methods and Max-Plus Algebra

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.

Complexity of comparing expressions in max-plus algebra

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.

Permutation orbifolds of vertex operator superalgebras and associative algebras

Let V be a vertex operator superalgebra and g=(12···k)be a k-cycle which is viewed as an automorphism of the tensor product vertex operator superalgebra V■k.In this paper,we construct an explicit isomorphism from Ag(V■k)to A(V)if k is odd and to Aσ(V)if k is even whereσis the canonical automorphism of V of order 2 determined by the superspace structure of V.These recover previous results by Barron(2016)and Barron and Vander Werf(2014)that there is a one-to-one correspondence between irreducible g-twisted V■k-modules and irreducible V-modules(resp.irreducibleσ-twisted V-modules)when k is odd(resp.even).This explicit isomorphism is expected to be useful in our further study on the Zhu algebra of the fixed point subalgebra.

基于Max-plus方法的列车运行图稳定性评价

列车运行图是铁路运输组织重要的技术文件,因而列车运行图质量的评估历来受到铁路部门的重视。而列车运行图稳定性是评估工作中的重要内容之一,它是指列车运行图在实施过程中出现列车晚点的概率和消除晚点以及晚点传播的能力。本文介绍max-plus方法,并将该方法引入列车运行图稳定性评估工作。建立用以评价列车运行图稳定性的恢复矩阵,提出评价的定量指标,并应用Matlab编程实现了恢复矩阵计算分析的自动化。Max-plus的应用需要与图论等方法结合,比较复杂,应进一步研究。

MAX-plusⅡ仿真在VHDL课程设计教学改革中的应用

电子通信等信息类专业注重所学理论与实践动手能力相结合,在VHDL课程设计教学中更应该注重这点。将MAX-plusⅡ仿真引入VHDL课程设计教学中,以一个具体的二人抢答器电路设计仿真实例进行展开,可形成理论学习与动手实践相结合的创新教学模式。该模式不仅可以使VHDL课程设计教学变得生动灵活,更加有利于提高学生们的创新创造、动手实践能力,增强教与学之间沟通,从而提高VHDL课程设计的教学效果。

Max-plus代数中analogy-transitive矩阵及其本征问题

定义一类analogy-transitive矩阵,讨论其基本性质,给出判定一个矩阵是否为analogytransitive矩阵的判定定理及算法,最后讨论关于analogy-transitive矩阵的本征问题.对于analogytransitive矩阵,存在一个O(n2)的算法计算其唯一本征值λ(A)和所有本征向量x=(x1,…,xn)使得max j=1,…,n(aij+xj)=λ+xi(i=1,…,n).该结果较一般情况下O(n3)的算法有所改进.

MAX-PLUSⅡ软件在数字系统设计中的应用

通过具体实例介绍了MAX

基于Max-plus代数法的市域铁路快慢车运行特性

目的:为编制市域铁路快慢车模式的运行计划和检验快慢车方案的鲁棒性,针对快慢车运行特点,提出一种基于Max-plus代数法的市域铁路快慢车运行系统的闭环模型。方法:将列车运行系统作为典型的离散事件动态系统,定义其模型变量与参数,同时定义系统约束规则;基于Max-plus代数法建立列车运行系统Max-plus开环线性模型,并进行了快慢车模式下开环线性模型的变换;基于Max-plus代数法建立列车运行系统Max-plus闭环线性模型,并以一段计划开行快慢车的市域铁路作为算例,对该算例建立闭环模型,并求解与分析输出演化过程,最后通过状态转移变量矩阵的求解结果生成列车运行时刻表。结果及结论:该算例的快慢车运行系统稳定,一个周期系统的缓冲时间为291 s;通过单参数摄动情形下的鲁棒性分析获得了使快慢车运行系统保持运行一致均衡性的摄动元取值区间;首班车在始发站的出发时刻不具备鲁棒性,当第4列列车为快车时,其越行后成为第3列列车,该列车在越行站越行时刻不具备鲁棒性。

Max-plus代数下区间方程组的一般解

通过区间一般线性方程组的AE解的研究,在max-plus代数的结构下,定义了区间方程组基于逻辑运算符的一般解,继而建立了max-plus代数下一般解的充要条件。

Max-plus代数上区间线性不等式系统的EA解

引入了max-plus代数上区间线性不等式系统EA解的概念,研究了该系统下EA解的特征。最后,给出关于max-plus代数上区间线性不等式系统的2个推论。

Reduction and Analysis of a Max-Plus Linear System to a Constraint Satisfaction Problem for Mixed Integer Programming

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.

基于Max-Plus代数的列车运行图稳定性分析方法研究

列车运行图是行车组织工作的基础,其稳定性关乎整个路网线路的运输效率和运营质量。为评估列车运行图的稳定性,通过分析列车运行间隔限制、接续限制、运行线路限制3类列车运行过程限制事件的逻辑关系,总结出列车运行过程具有典型离散事件动态系统(DEDS)特征;采用Max-Plus代数求解DEDS分析理论,探索Max-Plus代数与运行图限制事件的映射关联,建立列车运行图稳定性分析的Max-Plus代数模型;通过模型计算,求解Max-Plus代数最大特征值及运行余量时间矩阵、延迟传播时间矩阵,并以此定量评估列车运行图稳定性。经过实验算例的建模、计算及指标分析,表明采用Max-Plus代数可以科学评估列车运行图的稳定性。此分析方法可为铁路部门改善运行图铺画质量、降低晚点造成的影响,提供有效的参考。

THE BSE PROPERTY FOR SOME VECTOR-VALUED BANACH FUNCTION ALGEBRAS

In this paper,X is a locally compact Hausdorff space and A is a Banach algebra.First,we study some basic features of C0(X,A)related to BSE concept,which are gotten from A.In particular,we prove that if C0(X,A)has the BSE property then A has so.We also establish the converse of this result,whenever X is discrete and A has the BSE-norm property.Furthermore,we prove the same result for the BSE property of type I.Finally,we prove that C0(X,A)has the BSE-norm property if and only if A has so.

Groupoid Approach to Ergodic Dynamical System of Commutative von Neumann Algebra

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∞(X, μ) on X. We confirm that the commutative von Neumann algebras M⊂B(H), with H=L2(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) .

Representations of Hom-Jacobi-Jordan Algebras

Some relationships between the representation of Hom-Jacobi-Jordan algebra and that of Jacobi-Jordan algebra are studied.Moreover,by using the notion ofαk-anti-derivation,a property theorem of multiplicative Hom-Jacobi-Jordan algebras is also given.

BANACH ALGEBRA STRUCTURE IN DERIVATIVE HARDY SPACES

In this paper,we consider the algebraic structure of derivative Hardy Spaces.By using the method of[6,12,15],we get the Duhamel product forming Banach algebra in derivative Hardy Spaces,and invertibility criterion,and describe the extended eigenvalue of the integral operator V.We generalize the results in[1,2,6,11,16].

Split-Tetraquaternion Algebra and Applications

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.

Discussion on the Homology Theory of Lie Algebras

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).

Derivations and 2-Local Derivations on the BMS-Weyl Algebra

Using the theory of derivations on finitely generated and graded Lie algebras, we determine that derivations of the BMS-Weyl algebra are all inner. On this basis, it is proved that every 2-local derivation of the BMS-Weyl algebra is a derivation.