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.     

Nd~(3+):YAG激光的光纤传输

首先叙述了光纤传输Nd~(3+): YAG激光的优点,接着分析了不同光纤和其传输Nd~(3+): YAG激光的特点。然后通过对光纤传输系统各部分的分析与设计,结合实际,设计了光纤耦合机构。最后,对来自于工件反射光问题提出了解决方案。     

Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph

Let G be a 2-connected graph with minimum degree at least 3. We prove that there exists an even circuit C in G with factorization F={F₁,F₂} such that G−E(F₁) is 2-connected.     

BIFURCATIONS OF ROUGH 3—POINT—LOOP WITH HIGHER DIMENSIONS

The authors study the bifurcation problems of rough heteroclinic loop connecting three saddle points for the case β1 > 1, β2 > 1, β3 < 1 and β1β2β3 < 1. The existence, number, coexistence and incoexistence of 2-point-loop, 1-homoclinic orbit and 1-periodic orbit are studied. Meanwhile, the bifurcation surfaces and existence regions are given.     

Mean value in invexity analysis

In this paper, a generalization of the mean value theorem is considered in the case of functions defined on an invex set with respect to η (which is not necessarily connected).     

Thinking and Turing's test

The questions raised by A. M. Turing in his paper on thought and machines are discussed. Human thought is considered in turn as a concept of normal language usage, as a basic concept of psychology, and as the basis of intellectual activity. It is concluded that neither of these notions of thought identifies something specific that a human being can or cannot do. The imitation game proposed by Turing for deciding whether a machine can think is found to result from an arbitrary empoverishment of the channel of communication between the interrogator and the item under investigation. Turing's notions of thinking are shown to lead to logical difficulties. An alternative view of consciousness, that would place it beyond the reach of any finite test, is finally discussed.     

形变谐振子相干态及其对SUq（3）的应用

该文讨论了形变诺振子相干态的一些有意义的性质，利用量子代数SUq（3）的形变谐振子实现，构造了SU3（q）在玻色、费米两种情况下的相干态．     

On a Question of Phillips

In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case.