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.     

OU型Markov过程的不变测度及弱对偶性

本文研究ＯＵ型Ｍａｒｋｏｖ过程的不变测度、参考测度和弱对偶半群的存在性问题，并得出了不变测度的唯一性。     

Some non-local problems for the parabolic-hyperbolic type equation with non-characteristic line of changing type

In this work two non-local problems for the parabolic-hyperbolic type equation with non-characteristic line of changing type are considered. Unique solvability of these problems is proven. The uniqueness of the solution is proven by the method of energy integrals and the existence is proven by the method of integral equations.     

一个推广的Hardy-Hilbert型不等式及其逆式

本文引入单参数λ及应用Beta函数,给一个Hardy-Hilbert型不等式以具有最佳常数因子的推广,作为应用,给出了它的逆向形式．     

一类广义Bent型S-Box的构造

S-box是密码理论与实践中十分重要的一种装置 ,它的密码性能由其分量函数所决定 .于是 ,选择适当的分量函数来构造 S-box就成了一个重要的研究课题 .在一定意义上 ,Bent函数是最优良的密码函数 .本文通过函数序列半群和置换群来构造其任何非零线性组合为 Bent函数与线性函数之和的函数组 ,从而可由 Bent函数构造出具有高度非线性度和其他良好性状的 S-box     

Necessary and sufficient conditions in constrained optimization

Additional conditions are attached to the Kuhn-Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications. Necessary and sufficient conditions are also given for optimality of the dual problem. Duality and converse duality are treated accordingly.     

用三个关系式与Mathematica软件求第二类自然数幂和公式

首先介绍三个第二类自然数幂和关系式并对其中的两式给出证明,接着利用这些关系式与数学软件M athem atica4.0,给出求解第二类自然数幂和公式的若干机械计算方法.     

Exceptional set of a representation with fractional powers

We prove that for any given c, 1 < c < 17/11, almost all natural numbers are representable in the form [x ^c] + [p ^c], where x is a natural number and p is a prime.     

Recognition of the Finite Simple Groups F 4(2m) by Spectrum

The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F ₄(2 ^m ) is recognizable by spectrum.