Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.     

r－不可分矩阵的本原指数（Ⅱ）

本文给出了 n阶 r-不可分矩阵的本原指数的上界 ,即任 n阶 r—不可分矩阵 A的本原指数 (A)≤n+(r- ) 2r (1≤ r相似文献   

完全正矩阵的整数分解

n阶矩阵A称为完全正的,如果A有分解:A=BB^T,其中B为元素非负矩阵,B的最小可能列数称为A的分解指数.本文考察低阶双非负矩阵在整数环上的完全正分解及其分解指数.     

非负矩阵与有向图的谱半径

本文给出非负矩阵的谱半径的上界、下界,由此给出有向图的谱半径的界.     

反对称正交对称矩阵反问题

本文讨论一类反对称正交对称矩阵反问题及其最佳逼近．研究了这类矩阵的一些性质，利用这些性质给出了反问题解存在的一些条件和解的一般表达式，不仅证明了最佳逼近解的存在唯一性，而且给出了此解的具体表达式．     

On the group extension of the transformation associated to non-archimedean continued fractions

Summary Let F_q be a finite field with q elements. We consider formal Laurent series of F_q -coefficients with their continued fraction expansions by F_q -polynomials. We prove some arithmetic properties for almost every formal Laurent series with respect to the Haar measure. We construct a group extension of the non-archimedean continued fraction transformation and show its ergodicity. Then we get some results as an application of the individual ergodic theorem. We also discuss the convergence rate for limit behaviors.     

Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.     

完备可分度量群上的齐次Levy过程的复合Poisson逼近

该文利用算子半群的方法给出了取值于具有左不变度量的完备可分群的齐次Levy过程是复合Poisson过程的弱极限这一结论．     

Prederivations of Lie Algebras and Isometries of Bi-invariant Lie Group

Lie groups with bi-invariant semi-Riemannian metrics are considered. We study the decomposition of the algebra of prederivations of a direct sum of Lie algebras and derive some results on the isotropy group of a bi-invariant product Lie group. We also give necessary and sufficient conditions to ensure that all isometries of a complex Lie group, endowed with a bi-invariant Norden metric, are holomorphic.     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.