一类复杂循环排队系统的计算机模拟及其在进程调度中的应用

讨论了顾客到达时间和服务时间与等待队列队长有关的排队系统模拟,顾客服务次数不止1次即出现循环的复杂排队系统,引入到达因子、服务台因子和循环因子,在串并联多服务台情形下建立了4类计算机模拟模型,给出该复杂循环排队系统在进程调度中的应用并进行了计算机模拟.     

Tribute to Endre Csáki and Pál Révész

Summary This article provides a glimpse of some of the highlights of the joint work of Endre Csáki and Pál Révész since 1979. The topics of this short exploration of the rich stochastic milieu of this inspiring collaboration revolve around Brownian motion, random walks and their long excursions, local times and additive functionals, iterated processes, almost sure local and global central limit theorems, integral functionals of geometric stochastic processes, favourite sites--favourite values and jump sizes for random walk and Brownian motion, random walking in a random scenery, and large void zones and occupation times for coalescing random walks.     

ASYMPTOTIC NORMALITY OF KERNEL ESTIMATES OF A DENSITY FUNCTION UNDER ASSOCIATION DEPENDENCE

Let {X_n, n≥1} be a strictly stationary sequence of random variables, whichare either associated or negatively associated, f(·) be their common density. In this paper,the author shows a central limit theorem for a kernel estimate of f(·) under certain regularconditions.     

一种改进的进化规划算法

本对于全局优化问题提出一个改进的进化规划算法，该算法以概率p接收基于电磁理论求出合力方向作为随机搜索方向，以概率1-p接收按正态分布产生的随机搜索方向。改进算法不仅克服了传统进化规划算法随机搜索的盲目性，而且保留了传统进化规划算法全局搜索性。本算法应用于几个典型例题，数值结果表明本算法是可行的，有效的。     

Inhomogeneous Voter Models in One Dimension

We establish conditions for survival and extinction of types of one-dimensional voter models, and show that increasing the flip rates at a finite number of sites typically does not affect survival, unless the flipping mechanism is altered. We provide an example of a modified voter model that does not survive but can be made to survive simply by altering the flip mechanism at one site. We also show that a rather general class of such models have clustering behavior.     

Two‐stage copolycondensation of preformed oligomers with bisphenols by tosyl chloride/dimethylformamide/pyridine from distributions of resulting oligomers determined by a combination of gel permeation chromatography and NMR

A two‐stage co‐oligomerization of the oligomers initially formed from an equimolar mixture of isophthalic acid (IPA) and terephthalic acid (TPA) and 2,2‐bis(4‐hydroxyphenyl)propane (BPA, 50 mol %) with bisphenols (BPs, 20 mol %) was carried out using a tosyl chloride/dimethylformamide/pyridine condensing agent. The distributions of the resulting oligomers (n_x‐mers), which were quenched with methanol, were determined by a combination of gel permeation chromatography (GPC) and NMR. These distributions (presented by molar percentage) were conveniently calculated with the equation n_x (mol %) = n_x (% mol by GPC) × n₀ (mol % by NMR)/n₀ (% mol by GPC), where n_x (% mol) = n_x (wt % by GPC)/its molecular weight. The results showed the distributions of the preformed IPA/TPA‐BPA oligomers to be in fairly good accord with those obtained directly from GPC and to be supported by the NMR results. The calculation was applied to the co‐oligomers prepared up to a reaction of 0.7, at which there was an increase in the number of higher oligomers indivisible by GPC and the distributions could no longer be determined by molar percentage. The calculated distributions are discussed in relation to the results of copolycondensation. The sequence distributions in the resulting co‐oligomers, which were also examined by NMR, are compared with those in the copolymers. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 44–51, 2004     

Factorization of operator valued Lp for 0 ≤ p < 1

In [5], it is proved that a bounded linear operator u, from a Banach space Y into an L_p(S, ν) factors through L_p1 (S, ν) for some p₁ > 1, if Y* is of finite cotype; (S, ν) is a probability space for p = 0, and any measure space for 0 < p < 1. In this paper, we generalize this result to uv, where u : Y → L_p(S, ν) and v : X → Y are linear operators such that v* is of finite Ka?in cotype. This result gives also a new proof of Grothendieck's theorem. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Pseudorandom properties of prime factors

In this paper we study some pseudo-random properties related to the prime factors of integers. We prove some results concerning the well distribution of the greatest prime factor modulo 4, and give some computational insight on the correlations, which seem to be beyond reach of proof.