最短时限运输问题及图上求解法

提出了最短时限运输问题,借助于赋权二分图研究了其解的最优性充要条件,并给出了在赋权二分图上求解的具体步骤,最后给出了一个实例。事实证明,该法是一个有效的算法     

Activity periods of an infinite server queue and performance of certain heavy tailed fluid queues

A fluid queue with ON periods arriving according to a Poisson process and having a long-tailed distribution has long range dependence. As a result, its performance deteriorates. The extent of this performance deterioration depends on a quantity determined by the average values of the system parameters. In the case when the the performance deterioration is the most extreme, we quantify it by studying the time until the amount of work in the system causes an overflow of a large buffer. This turns out to be strongly related to the tail behavior of the increase in the buffer content during a busy period of the M/G/∞ queue feeding the buffer. A large deviation approach provides a powerful method of studying such tail behavior. This revised version was published online in June 2006 with corrections to the Cover Date.     

Limit Theorems for the Maximum Terms of a Sequence of Random Variables with Marginal Geometric Distributions

Let X _n1 ^* , ... X _nn ^* be a sequence of n independent random variables which have a geometric distribution with the parameter p _n = 1/n, and M _n ^* = \max\{X _n1 ^* , ... X _nn ^* }. Let Z ₁, Z₂, Z₃, ... be a sequence of independent random variables with the uniform distribution over the set N _n = {1, 2, ... n}. For each j N _n let us denote X _nj = min{k : Z_k = j}, M _n = max{X_n1, ... X_nn}, and let S _n be the 2nd largest among X _n1, X_n2, ... X_nn. Using the methodology of verifying D(u_n) and D'(u_n) mixing conditions we prove herein that the maximum M _n has the same type I limiting distribution as the maximum M _n ^* and estimate the rate of convergence. The limiting bivariate distribution of (S_n, M_n) is also obtained. Let _n, _n N_n, , and T _n = min{M(A_n), M(B_n)}. We determine herein the limiting distribution of random variable T _n in the case _n , _n/_n > 0, as n .     

一类奇异抛物方程的超过程解法

对于如下一类奇异非线性抛物型方程：ｔｕ（ｔ,ｘ）＝Δｕ（ｔ,ｘ）－ｕβ（ｔ,ｘ）,ｘ∈Ｂ（０,ａ）,ｕ（０,ｘ）＝０,ｕ（ｔ,ｘ）｜ｘ｜→ａ－→∞,ｔ＞０,这里,１≤β≤２,Ｂ（ｏ,ａ）表示以ｏ为中心,以ａ为半径的Ｒｄ中的闭球,利用超过程的理论,给出了它的概率解法,从而推广了文［１］相应的结论     

HITTING TIME AND PLACE TO A SPHERE OR SPHERICAL SHELL FOR BROWNIAN MOTION

61.IntroductionLetX~{X,(w),t20}beastandardd-dimensionalBrownianmotioninR'(d22).ThefirsthittingtimeofXforaBorelsetBinRdisdefinedtobeThefirsthittingplaceisX(TB).InthispapergwemainlyconsiderthesphereZ'--,(0,r)~{x:xERd,lxl~r}andthesphericalshellZ'--,(0,a)UZ'--,(0,b)~{x.xER',lxl=aorlxl~b},wherer>0,a>0,b>0anda相似文献   

Choiceless polynomial time

Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures and compute exactly PTime properties? This question can be recast as follows: Does there exist a logic that captures polynomial time (without presuming the presence of a linear order)? Earlier, one of us conjectured a negative answer. The problem motivated a quest for stronger and stronger PTime logics. All these logics avoid arbitrary choice. Here we attempt to capture the choiceless fragment of PTime. Our computation model is a version of abstract state machines (formerly called evolving algebras). The idea is to replace arbitrary choice with parallel execution. The resulting logic expresses all properties expressible in any other PTime logic in the literature. A more difficult theorem shows that the logic does not capture all of PTime.     

Completely J —positive linear systems of finite order

Completely J — positive linear systems of finite order are introduced as a generalization of completely symmetric linear systems. To any completely J — positive linear system of finite order there is associated a defining measure with respect to which the transfer function has a certain integral representation. It is proved that these systems are asymptotically stable. The observability and reachability operators obey a certain duality rule and the number of negative squares of the Hankel operator is estimated. The Hankel operator is bounded if and only if a certain measure associated with the defining measure is of Carleson type. We prove that a real symmetric operator valued function which is analytic outside the unit disk has a realization with a completely J — symmetric linear space which is reachable, observable and parbalanced. Uniqueness and spectral minimality of the completely J — symmetric realizations are discussed.     

Some degenerate and quasilinear parabolic systems not in divergence form

This paper deals with positive solutions of degenerate and quasilinear parabolic systems not in divergence form: u_t=u^p(Δu+av), v_t=v^q(Δv+bu), with null Dirichlet boundary conditions and positive initial conditions, where p, q, a and b are all positive constants. The local existence and uniqueness of classical solution are proved. Moreover, it will be proved that all solutions exist globally if and only if ab?λ₁², where λ₁ is the first eigenvalue of −Δ in Ω with homogeneous Dirichlet boundary condition.     

竖向地震对建筑结构抗震性能的影响研究

应用弹塑性时程分析方法研究了组合墙结构在竖向和水平地震共同作用下的抗震性能.研究结果表明结构的最大层间位移由于受到竖向地震的影响有向结构中部转移的趋势.而且,层间位移增大.     

基于系统调用的实时IDS方案

给出一种基于进程系统调用的实时IDS方案.该方案选择网络服务进程(特权进程)作为系统的代表进行监测,使用隐马尔可夫模型(HMM)对系统行为进行模拟和测试,使用实时P(O|λ)值和近期对“某些重要文件”的读、写频率这两个条件作为判断系统是否遭受入侵的标准.实验和分析表明,该方案有较高的预报准确率和较小的时间开销.