一类几乎最优循环图{C_p(m,m+1,p/a)}

本文比较了循环图类{c_p(n_1,…,n_p)}和{c-p(n_1…,n_p,p/α)}的直径下界。对于p和α满足一定条件的循环图类{c_p(n_1,n_2,p/α)},本文给出了达到或几乎达到此图类直径下界的一类几乎最优循环图{c_p(m,m+1,p/α)}。     

A simple formula for mean multiplexing delay for independent regenerative sources

Simple expressions are given for the mean delay, mean waiting time, and mean busy period length in a multiplexer. Data streams with active periods having a general distribution are permitted, and the data rate during the active periods can be random. Data can also arrive in batches. The key restrictions of the model are that the sources are independent, idle periods are exponentially distributed, and a source generates at least enough data during an active period to keep the server busy throughout the period. The exact formulas allow evaluation of the error in approximations such as a heavy traffic diffusion approximation.Both continuous and discrete time models are considered. The discrete-time model includes that studied by Viterbi and subsequently generalized by Neuts. The Pollaczek-Khinchine formula for the mean amount of work in anM/GI/1 queue is retrieved as a limiting case.Preliminary version presented at IEEE INFOCOM, San Francisco, April 1993.     

电子直线加速器磁控管频率稳定的自适应线性神经元方法

 电子直线加速器电子束能量的稳定与否取决于功率源工作频率的稳定性,磁控管在短时间内的散谱和轻微跳谱造成稳频系统的控制精度下降,最后电子束的扫描均匀度下降。引入自适应线性神经元方法(ADALINE)和噪声对消技术以消除对工作频率长期稳定性的影响,从而保证了电子束的扫描均匀度。     

On distributionally regenerative processes

The paper is concerned with characterization results for distributional regeneration. It is shown that distributional regeneration is equivalent to renewal representation of the associated (shift) Markov operator. A sufficient condition for the distributional regeneration of the transfer operator in terms of variation is also formulated. Finally, a minorization condition is formulated and proved to be sufficient for recurrent co-Feller operators.     

Effective-field theory and the nuclear many-body problem

We review many-body calculations of the equation of state of dilute neutron matter in the context of effective-field theories of the nucleon-nucleon interaction.     

A new formula for the saddle-to-scission time

We propose a new formula for the saddle-to-scission time that is more general that the one based on Kramers' approach. Its validity and applicability is then studied in detail. Such a formula is useful for the evaluation of the fission time of very heavy nuclei.     

技术不确定环境下新产品策略的设计应用

技术的动态发展和企业间的竞争对企业新产品策略有很大影响,直接决定新产品的引进周期。本文在产业技术动态变化的随机环境下构建随机动态规划模型,关注产业技术进步、投资成本和产品市场竞争等影响因素,探讨企业进行新产品引进的周期选择,对新产品引进的周期和质量决策进行方法设计和应用举例。利用随机动态规划模型得出新产品引进的最优时间周期,用算例分析技术进步和产品研发成本对企业引进周期策略的影响,采取策略迭代的方法进行求解,发现技术进步较快时企业的新产品引进步伐也较快,研发成本的提高使企业的新产品引入步伐降低。     

Concentration factors for functions with harmonic bounded mean variation

We discuss determination of jumps for functions with generalized bounded variation. The questions are motivated by A. Gelb and E. Tadmor [1], F. Móricz [5] and [6] and Q. L. Shi and X. L. Shi [7]. Corollary 1 improves the results proved in B. I. Golubov [2] and G. Kvernadze [3]. Supported by NSFC 10671062.     

Empirical minimization

We investigate the behavior of the empirical minimization algorithm using various methods. We first analyze it by comparing the empirical, random, structure and the original one on the class, either in an additive sense, via the uniform law of large numbers, or in a multiplicative sense, using isomorphic coordinate projections. We then show that a direct analysis of the empirical minimization algorithm yields a significantly better bound, and that the estimates we obtain are essentially sharp. The method of proof we use is based on Talagrand's concentration inequality for empirical processes. Research partially supported by NSF under award DMS-0434393. Research partially supported by the Australian Research Council Discovery Porject DP0343616.     

Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms

We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions.