A note on conservation laws for a multiclass service queueing system with setup times

This paper derives a conservation law for mean waiting times in a single-server multi-class service queueing system (M ^X/G/1 type queue) with setup times which may be dependent on multiple customer classes and its arrival batch size by using the work decomposition property in the queueing system with vacations.     

托卡马克能量约束及自举电流效应的初步考虑

基于Lee等人的离子温度梯度模导致的反常热能输运系数,本文研究了辅助加热托卡马克等离子体的能量约束行为,并对自举电流的效应作了初步考虑。结果表明,计算得到的能量约束时间随等离子体电流I_p和托卡马克大半径R增大而增长,随注入功率P_t、环向场B_t以及等离子体小半径α的增大而缩短。这些结果与Kaye-Goldston的经验约束定标具有相同的趋势。自举电流的存在总是导致能量约束时间的增加,当自举电流与总电流的比值γ较小时,能量约束时间的增加率约为γ/2。此外,自举电流将造成锯齿反转半径的减小。     

Classical limit of relativistic quantal system with attractive Coulomb interaction

Using the appropriate harmonic oscillator states and reasonable approximations, we construct coherent wavepackets corresponding to the solutions of the Klein-Gordon equation for the attractive potentialV(r)=−k/r, k>0, in two and three space dimensions. We deduce the corresponding classical limit in two dimension by requiring that the expectation value 〈r〉 of the radial variable is large. In the case of three dimensions, besides the condition of large 〈r〉, we make the uncertainty Δr=[〈r ²〉 − 〈r〉²]^1/2 a minimum with respect to certain parameter of the wavepacket. We then investigate the trajectory traversed by the wavepacket in the classical limit. We find that the classical limit of this relativistic quantal problem gives, in the leading order, the same expression for the rate of motion of the perihelion as that given by the solution of the corresponding special relativistic classical dynamical problem. We also briefly discuss some of the subtle aspects of the classical limit of the relativistic quantal system, in general.     

Solution of the hyperbolic mild‐slope equation using the finite volume method

A finite volume solver for the 2D depth‐integrated harmonic hyperbolic formulation of the mild‐slope equation for wave propagation is presented and discussed. The solver is implemented on unstructured triangular meshes and the solution methodology is based upon a Godunov‐type second‐order finite volume scheme, whereby the numerical fluxes are computed using Roe's flux function. The eigensystem of the mild‐slope equations is derived and used for the construction of Roe's matrix. A formulation that updates the unknown variables in time implicitly is presented, which produces a more accurate and reliable scheme than hitherto available. Boundary conditions for different types of boundaries are also derived. The agreement of the computed results with analytical results for a range of wave propagation/transformation problems is very good, and the model is found to be virtually paraxiality‐free. Copyright © 2003 John Wiley & Sons, Ltd.     

The application of spectral distribution of product of two random matrices in the factor analysis

In the factor analysis model with large cross-section and time-series dimensions,we pro- pose a new method to estimate the number of factors.Specially if the idiosyncratic terms satisfy a linear time series model,the estimators of the parameters can be obtained in the time series model. The theoretical properties of the estimators are also explored.A simulation study and an empirical analysis are conducted.     

Stable marker-particle method for the Voronoi diagram in a flow field

The Voronoi diagram in a flow field is a tessellation of water surface into regions according to the nearest island in the sense of a “boat-sail distance”, which is a mathematical model of the shortest time for a boat to move from one point to another against the flow of water. The computation of the diagram is not easy, because the equi-distance curves have singularities. To overcome the difficulty, this paper derives a new system of equations that describes the motion of a particle along the shortest path starting at a given point on the boundary of an island, and thus gives a new variant of the marker-particle method. In the proposed method, each particle can be traced independently, and hence the computation can be done stably even though the equi-distance curves have singular points.     

Duality theorems for convex problems with time delay

In this paper, we examine a class of convex problems of Bolza type, involving a time delay in the state. It encompasses a variety of time-delay problems arising in the calculus of variations and optimal control. A duality analysis is carried out which, among other things, leads to a characterization of minimizers in terms of the Euler-Lagrange inclusion. The results obtained improve in significant respects on what is achievable by techniques previously employed, based on elimination of the time delay by introduction of an infinite-dimensional state space or on the method of steps.     

Numerical analysis for stochastic age-dependent population equations with Poisson jumps

In this paper, stochastic age-dependent population equations with Poisson jumps are considered. In general, most of stochastic age-dependent population equations with jumps do not have explicit solutions, thus numerical approximation schemes are invaluable tools for exploring their properties. The main purpose of this paper is to develop a numerical Euler scheme and show the convergence of the numerical approximation solution to the true solution.     

A note on scheduling to meet two min-sum objectives

We consider a single machine scheduling problem with two min-sum objective functions: the sum of completion times and the sum of weighted completion times. We propose a simple polynomial time (1+(1/γ),1+γ)-approximation algorithm, and show that for γ>1, there is no (x,y)-approximation with 1<x<1+(1/γ) and 1<y<1+(γ-1)/(2+γ).     

Stationary remaining service time conditional on queue length

In Mandelbaum and Yechiali [The conditional residual service time in the M/G/1 queue, http://www.math.tau.ac.il/∼uriy/publications (No. 30a), 1979] and in Fakinos [The expected remaining service time in a single-server queue, Oper. Res. 30 (1982) 1014-1018] a simple formula is derived for the (stationary) expected remaining service time in a M/G/1 queue, conditional on the number of customers in the system. We give a short new proof of the formula using Rate Conservation Law, and generalize to handle higher moments.