An inequality connecting entropy distance,Fisher Information and large deviations

In this paper we introduce a new generalisation of the relative Fisher Information for Markov jump processes on a finite or countable state space, and prove an inequality which connects this object with the relative entropy and a large deviation rate functional. In addition to possessing various favourable properties, we show that this generalised Fisher Information converges to the classical Fisher Information in an appropriate limit. We then use this generalised Fisher Information and the aforementioned inequality to qualitatively study coarse-graining problems for jump processes on discrete spaces.     

Analysis of G/D/1 Queueing Systems with Inputs Satisfying Large Deviation Principle under Weak* Topology

The large deviation principle (LDP) which has been effectively used in queueing analysis is the sample path LDP, the LDP in a function space endowed with the uniform topology. Chang [5] has shown that in the discrete-time G/D/1 queueing system under the FIFO discipline, the departure process satisfies the sample path LDP if so does the arrival process. In this paper, we consider arrival processes satisfying the LDP in a space of measures endowed with the weak^* topology (Lynch and Sethuraman [12]) which holds under a weaker condition. It is shown that in the queueing system mentioned above, the departure processes still satisfies the sample path LDP. Our result thus covers arrival processes which can be ruled out in the work of Chang [5]. The result is then applied to obtain the exponential decay rate of the queue length probability in an intree network as was obtained by Chang [5], who considered the arrival process satisfying the sample path LDP.     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

On a bifurcation governed by hysteresis nonlinearity

We consider autonomous systems with a nonlinear part depending on a parameter and study Hopf bifurcations at infinity. The nonlinear part consists of the nonlinear functional term and the Prandtl--Ishlinskii hysteresis term. The linear part of the system has a special form such that the close-loop system can be considered as a hysteresis perturbation of a quasilinear Hamiltonian system. The Hamiltonian system has a continuum of arbitrarily large cycles for each value of the parameter. We present sufficient conditions for the existence of bifurcation points for the non-Hamiltonian system with hysteresis. These bifurcation points are determined by simple characteristics of the hysteresis nonlinearity.     

大口径宽视场双波段扫描红外相机光学设计

通过分析计算,设计了一种大口径宽视场折射式红外相机光学系统。该系统设计用于超长线阵扫描红外相机的地面演示成像,它能同时对短波2μm—3μm、中波3μm—4.5μm双波段成像,且同时具有24°的大视场和150mm的宽口径,成像质量接近衍射极限。该系统在航天遥感领域应用广泛。     

Interference of probabilities and number field structure of quantum models

We study the probabilistic consequences of the choice of the basic number field in the quantum formalism. We demonstrate that by choosing a number field for a linear space representation of quantum model it is possible to describe various interference phenomena. We analyse interference of probabilistic alternatives induced by real, complex, hyperbolic (Clifford) and p‐adic representations.     

Direct numerical simulation of settling of a large solid particle during bioconvection

Settling of a large solid particle in bioconvection flow caused by gyrotactic microorganisms is investigated. The particle is released from the top of the bioconvection chamber; its settling pattern depends on whether it is released in the centre of the bioconvection plume or at its periphery. The Chimera method is utilized; a subgrid is generated around a moving particle. The method suggested by Liu and Wang (Comput. Fluid 2004; 33 :223–255) is further developed to account for the presence of a moving boundary in the streamfunction‐vorticity formulation using the finite‐difference method. A number of cases for different release positions of the particle are computed. It is demonstrated that bioconvection can either accelerate or decelerate settling of the particle depending on the initial position of the particle relative to the plume centre. It is also shown that the particle impacts bioconvection plume by changing its shape and location in the chamber. Copyright © 2005 John Wiley & Sons, Ltd.     

LES of turbulent heat transfer: proper convection numerical schemes for temperature transport

Large eddy simulations of two basic configurations (decay of isotropic turbulence, and the academic plane channel flow) with heat transfer have been performed comparing several convection numerical schemes, in order to discuss their ability to evaluate temperature fluctuations properly. Results are compared with the available incompressible heat transfer direct numerical simulation data. It is shown that the use of regularizing schemes (such as high order upwind type schemes) for the temperature transport equation in combination with centered schemes for momentum transport equation gives better results than the use of centred schemes for both equations. Copyright © 2004 John Wiley & Sons, Ltd.     

层次分析中广义最小偏差法的性质

广义最小偏差法（GLDM）是层次分析中一种重要的排序方法．本文讨论了广义最小偏差法的性质和灵敏度分析问题．     

Large deviations and the generalized processor sharing scheduling for a two-queue system

We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The result is obtained using the sample-path large deviation principle and has implications in call admission control for high-speed communication networks. This revised version was published online in June 2006 with corrections to the Cover Date.