On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

Estimating a reduced rank regression model for non-normal variables

A method using third order moments for estimating the regression coefficients as well as the latent state scores of the reduced-rank regression model when the latent variable(s) are non-normally distributed is presented in this paper. It is shown that the factor analysis type indeterminacy of the regression coefficient matrices is eliminated. A real life example of the proposed method is presented. Differences of this solution with the reduced-rank regression eigen solution are discussed.     

Radiative lifetimes in Ce I and Ce II

New radiative lifetime measurements based on time-resolved laser-induced fluorescence techniques are reported for 18 even-parity levels belonging to the 4f5d^26p and 4f ²5d ² configurations of Ce I and 6 even-parity levels belonging to the 5d^26s, 4f5d6p, and 4f6s6p configurations of Ce II. Free neutral and singly ionized cerium atoms were produced by laser ablation. The Ce I and Ce II levels range in energy from 26 545 to 29 102 cm^-1, and 42 573 to 48 152 cm^-1, respectively. Received 25 September 2002 Published online 4 March 2003     

190区超形变核中转动带的组态结构

通过系统研究A～190区超形变核中转动带的转动惯量、角动量顺排、旋称分裂随转动频率的变化规律, 结合我们用处理对力的粒子数守恒方法的计算结果, 对A～190区所有转动带的组态结构给出了一个整体的描述. 绝大多数超形变带都建立在强耦合轨道上, 例如中子[512]5/2, [624]9/2. 少数超形变带则建立在高j闯入轨道上, 即中子[761]3/2, [752]5/2. 根据我们提出的组态结构所进行的理论计算结果表明, A～190区所有转动带的一般行为、反常变化和带交叉都得到了满意的解释.     

Heterochain model for simultaneous long‐chain branching and crosslinking. III. Multicomponent polymerization

The matrix formula developed in the context of heterochain theory, M?_w = M?_wp + WF ( I ? M )^?1 S , was applied to describe the molecular weight development during free‐radical multicomponent polymerization. All of the required probabilistic parameters are expressed in terms of the kinetic‐rate constants and the various concentrations associated with them. In free‐radical polymerization, the number of heterochain types, N, needs to be extrapolated to infinity, and such extrapolation is conducted with only three different N values. This matrix formula can be used as a benchmark test if other approximate approaches can give reasonable estimates of the weight‐average molecular weights. The moment equations with the average pseudo‐kinetic‐rate constants for branching and crosslinking reactions may provide poor estimates when the copolymer composition drift during polymerization is very significant. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 2801–2812, 2004     

一类二元相关威布尔分布的可靠性问题

本文考虑生存函数为${\ol{F}(x_{1},x_{2})}=\exp\{-[(x_{1}^{1/\alpha}/\theta_{1})^{1/\delta}+(x_{2}^{1/\alpha}/\theta_{2})^{1/\delta}]^{\delta}\},\;x_{i}>0,\;\alpha>0$, $1\geq\delta>0,\;\theta_{i}>0\;(i=1,2)$的二元威布尔分布的两种可靠性问题, 提出可靠度$\pr$的估计并讨论了它们的渐近性, 最后还作了模拟计算.     

Upper and lower bounds for the energy of bipartite graphs

Using Lagrange's multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp.     

Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation

Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points.