Analysis of nonlinear sliding structures by modified stochastic linearization methods

Probabilistic characteristics of a sliding structure is investigated by using new versions of stochastic linearization technique. The structure is composed of base part and upper part, which are connected to each other in a spring-damping system. Coulomb friction between the base structure and earth ground is considered. Two alternative versions of stochastic linearization approach, suggested by X. Zhang and I. Elishakoff, respectively, are applied to such a sliding structure to evaluate its statistical properties. Compared with the results of Monte Carlo simulation, the two new approaches are performing much better than the conventional one in their applications to the sliding structure. Moreover, numerical results indicate that the criterion proposed by Elishakoff turns out to be superior to all other versions in the problem under study. Numerical results also suggest that the entire structure may be replaced by the rigid body in the sliding problem as long as the difference of velocity responses are considered less important than those of displacement responses.     

第二讲合成孔径声纳成像及其研究进展

文章在介绍了图像声纳的特点、合成孔径声纳（synthetic aperture sonar,SAS）产生背景和发展过程的基础上,对合成孔径声纳的原理、技术难点、成像算法等问题进行了讨论.着重分析了合成孔径声纳成像过程中高分辨率的获取方法、水声信道对成像的影响、多子阵技术及其成像算法、稳定的声纳运动平台和运动监测问题、运动补偿与自聚焦方法等.文章还给出了国内外合成孔径声纳研究的最新进展情况,进而展望了合成孔径声纳的应用前景.     

Single-server queues with spatially distributed arrivals

Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The service times are independent, but arbitrarily distributed. The model generalizes the continuous cyclic polling system (the diffusion coefficient of the Brownian motion is zero in this case) and can be interpreted as a continuous version of a Markov polling system. Using Tweedie's lemma for positive recurrence of Markov chains with general state space, we show that the system is stable if and only if the traffic intensity is less than one. Moreover, we derive a stochastic decomposition result which leads to equilibrium equations for the stationary configuration of customers on the circle. Steady-state performance characteristics are determined, in particular the expected number of customers in the system as seen by a travelling server and at an arbitrary point in time.     

SOLVABILITY OF FORWARD-BACKWARD SDES AND THE NODAL SET OF HAMILTON-JACOBI-BELLMAN EQUATIONS

The solvability of a class of forward-backward stochastic differential equations (SDEs for short) over an arbitrarily prescribed time duration is studied. The authors design a stochastic relaxed control problem, with both drift and difftusion all being controlled, so that the solvability problem is converted to a problem of finding the nodal set of the viscosity solution to a certain Hamilton-Jacobi-Bellman equation. This method overcomes the fatal difficulty encountered in the traditional contraction mapping approach to the existence theorem of such SDEs.     

关于双重时序AR-MA模型的相关结构及与ARMA模型的比较

本文在文［４］的基础上讨论了双重时序ＡＲ（１）－ＭＡ（ｑ）模型的相关结构，在不假定白噪声序列为正态的情况下，证明了安鸿志［２］关于模型的相关结构的猜想是正确的，具体地构造了ＡＲ（１）－ＭＡ（３）模型的相关结构，并与ＡＲＭＡ模型进行了初步的比较，给出了一些抛砖引玉的讨论．     

Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment

We present an overview of the author’s Ph.D. thesis, supervised by P. Dejax and N. Bostel, which was defended in February 2006 at école des Mines de Nantes, France. The thesis is written in French, and is available at . It was conducted in the context of a research contract with a water distribution company. In a first section, we define multiperiod routing problems for service technicians. In a second section, we present some heuristics and a memetic algorithm used to solve these problems. The third section introduces optimal and near-optimal approaches based on column generation. Finally, we present some applications to the real-life case. The methods presented in Sects. 2, 3 and 4 were tested over several sets of problems, based on real-life statistics provided by the company.      

A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem

In this paper we address a two-dimensional (2D) orthogonal packing problem, where a fixed set of small rectangles has to be placed on a larger stock rectangle in such a way that the amount of trim loss is minimized. The algorithm we propose hybridizes a placement procedure with a genetic algorithm based on random keys. The approach is tested on a set of instances taken from the literature and compared with other approaches. The computation results validate the quality of the solutions and the effectiveness of the proposed algorithm.     

Soluble models for dynamics driven by a super-diffusive noise

We explicitly discuss scalar Langevin type of equations where the deterministic part is linear, but where the integrated noise source is a non-linear diffusion process exhibiting superdiffusive behavior. We calculate transient and stationary probabilities and study the possibility of noise induced transitions from a unimodal to a bimodal probability shape. Illustrations from finance and dynamical systems are given.     

Symmetric form of the Hudson-Parthasarathy stochastic equation

We prove that the Hudson-Parthasarathy equation corresponds, up to unitary equivalence, to the strong resolvent limit of Schrödinger Hamiltonians in Fock space and that the symmetric form of this equation corresponds to the weak limit of the Schrödinger Hamiltonians.Translated fromMatematicheskie Zametki, Vol. 60, No. 5, pp. 726–750, November, 1996.     

Proof of the Mixing Theorem for Statistical Systems in Classical Physics

In a general measure-theoretic context, it is proved that the action of a stochastic map on a pair of probability distributions can be characterized by the criterion of decreasing mixing distance.