Noise-assisted mound coarsening in epitaxial growth

Two types of mechanisms are proposed for mound coarsening during unstable epitaxial growth: stochastic, due to deposition noise, and deterministic, due to mass currents driven by surface energy differences. Both yield the relation H=(RWL)² between the typical mound height W, mound size L, and the film thickness H. An analysis of simulations and experimental data shows that the parameter R saturates to a value which discriminates sharply between stochastic () and deterministic () coarsening. We derive a scaling relation between the coarsening exponent 1/z and the mound-height exponent which, for a saturated mound slope, yields . Received: 11 November 1997 / Revised in final form: 28 November 1997 / Accepted: 28 November 1997     

Computation of confined coflow jets with three turbulence models

A numerical study of confined jets in a cylindrical duct is carried out to examine the performance of two recently proposed turbulence models: an RNG-based K-? model and a realizable Reynolds stress algebraic equation model. The former is of the same form as the standard K-? model but has different model coefficients. The latter uses an explicit quadratic stress-strain relationship to model the turbulent stresses and is capable of ensuring the positivity of each turbulent normal stress. The flow considered involves recirculation with unfixed separation and reatachment points and severe adverse pressure gradients, thereby providing a valuable test of the predictive capability of the models for complex flows. Calculations are performed with a finite volume procedure. Numerical credibility of the solutions is ensured by using second-order-accurate differencing schemes and sufficiently fine grids. Calculations with the standard K-? model are also made for comparison. Detailed comparisons with experiments show that the realizable Reynolds stress algebraic equation model consistently works better than does the standard K-? model in capturing the essential flow features, while the RNG-based K-? model does not seem to give improvements over the standard K-? model under the flow conditions considered.     

Reaction dynamics of synthesis of superheavy elements

Based on the theory of the compound nucleus reaction, a brief review is given on the special aspects of the reaction dynamics in the synthesis of the superheavy elements (SHE), where the fusion probability is the most unknown factor. A new viewpoint of the fusion reaction is proposed that it consists of two processes; the first process up to the contact of two nuclei of the incident channel and the second one of a dynamical evolution to the spherical compound nucleus from the contact configuration. The fusion probability is, thus, given as a product of a contact probability and a formation probability. Analytic studies of the latter probability are discussed in the one-dimensional model, where a simple expression is given to the so-called extra-push energy in terms of the reduced friction, the curvature parameter of the conditional saddle point and the nuclear temperature. Preliminary results of numerical analyses of the contact probability are given, using the surface friction model (SFM). Remarks are given on the present status of our knowledge and for future developments. Received: 1 May 2001 / Accepted: 4 December 2001     

ATM网VBR编码会议电视业务模型的研究

文章研究了ATM网中VBR编码的会议电视业务的模型，提出一阶自回归、瑞利分布残差而不是高斯分布的AR序列模型──RAR（1），实验表明，该模型能产生足够多的大信元帧数，这对于研究信元丢失率特性具有至关重要的影响，而且简单实用。此外，RAR（1）模型在较少（16个）和较多（128个）VBR信源统计复用时，能很好地拟合实际的会议电视业务的统计数据。     

Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.     

Monitoring the packet gap of real-time packet traffic

Real-time packet traffic is characterized by a strict deadline on the end-to-end time delay and an upper bound on the information loss. Due to the high correlation among consecutive packets, the individual packet loss does not well characterize the performance of real-time packet sessions. An additional measure of packet loss is necessary to adequately assess the quality of each real-time connection. The additional measure considered here is the average number of consecutively lost packets, also called the average packet gap. We derive a closed form for the average packet gap for the multiclassG/G/m/B queueing system in equilibrium and show that it only depends on the loss behavior of two consecutive packets. This result considerably simplifies the monitoring process of real-time packet traffic sessions. If the packet loss process is markovian, the consecutive packet loss has a geometric distribution.     

Universality in some classical Coulomb systems of restricted dimension

Coulomb systems in which the particles interact through thed-dimensional Coulomb potential but are confined in a flat manifold of dimensiond–1 are considered. The actual Coulomb potential acting is defined by particular boundary conditions involving a characteristic macroscopic distanceW in the direction perpendicular to the manifold: either it is periodic of periodW in that direction, or it vanishes on one ideal conductor wall parallel to the manifold at a distanceW from it, or it vanishes on two parallel walls at a distanceW from each other with the manifold equidistant from them. Under the assumptions that classical equilibrium statistical mechanics is applicable and that the system has the macroscopic properties of a conductor, it is shown that the suitably smoothed charge correlation function is universal, and that the free energy and the grand potential have universal dependences onW (universal means independent of the microscopic detail). The casesd=2 are discussed in detail, and the generic results are checked on an exactly solvable model. The cased=3 of a plane parallel to an ideal conductor is also explicitly worked out.Laboratoire associé au Centre National de la Recherche Scientifique-URA D0063.     

Sigma Models and Minimal Surfaces

Correspondence is established between sigma models, minimal surfaces and the Monge–Ampére equation. The Lax pairs of the minimality condition of the minimal surfaces and the Monge–Ampére equations are given. Existence of infinitely many nonlocal conservation laws is shown and some Bäcklund transformations are also given.     

Network traffic prediction based on a new time series model

Fast and accurate methods for predicting traffic properties and trend are essential for dynamic network resource management and congestion control. With the aim of performing online and feasible prediction of network traffic, this paper proposes a novel time series model, named adaptive autoregressive (AAR). This model is built upon an adaptive memory‐shortening technique and an adaptive‐order selection method originally developed by this study. Compared to the conventional one‐step ahead prediction using traditional Box–Jenkins time series models (e.g. AR, MA, ARMA, ARIMA and ARFIMA), performance results obtained from actual Internet traffic traces have demonstrated that the proposed AAR model is able to support online prediction of dynamic network traffic with reasonable accuracy and relatively low computation complexity. Copyright © 2005 John Wiley & Sons, Ltd.     

Detecting and Diagnostic Checking Multivariate Conditional Heteroscedastic Time Series Models

Two tests for multivariate conditional heteroscedastic models are proposed. One is based on the cross-correlations of standardized squared residuals and the other is a score (Lagrange multiplier) test. The cross-correlations test can be used to detect the presence of multivariate conditional heteroscedasticity whereas the other test can be used for diagnostic checking. Simulation studies on the size and power of the test statistics are reported. The application of the tests is illustrated by an example using the S & P 500 and Sydney All Ordinary Indexes.