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.     

Balance constraints reduction of large-scale linear programming problems

This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation.     

A COMPLETE METRIC OF POSITIVE CURVATURE ON R~n AND EXISTENCE OF CLOSED GEODESICS

ＡＣＯＭＰＬＥＴＥＭＥＴＲＩＣＯＦＰＯＳＩＴＩＶＥＣＵＲＶＡＴＵＲＥＯＮＲ~ｎＡＮＤＥＸＩＳＴＥＮＣＥＯＦＣＬＯＳＥＤＧＥＯＤＥＳＩＣＳ￥ＺＨＵＤＡＸＩＮ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＴｉａｎｊｉｎＵｎｉｖｅｒｓｉｔｙｌＴｉａｎｊ?..     

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.     

Aqueous solution and solid state interactions of lanthanide ions with a methacrylic ester polymer bearing pendant 15‐crown‐5 moieties

The interaction between trivalent lanthanide ions and poly(1,4,7,10,13‐pentaoxacyclopentadecan‐2‐yl‐methyl methacrylate), PCR5, in aqueous solution and in the solid state have been studied. In aqueous solution, evidence of a weak interaction between the lanthanides and PCR5 comes from the small red shift of the Ce(III) emission spectra and the slight broadening of the Gd(III) EPR spectra. From the Tb(III) lifetimes in the presence of H₂O and D₂O the loss of one or two water coordinated molecules is confirmed when Tb(III) is bound to PCR5. An association constant of the order of 200 M^?1 was obtained for a 1:1 (lanthanide:15‐crown‐5) complex from the shift of the polymer NMR signals induced by Tb(III). A similar association constant is obtained from the differences of the molar conductivity of Ce(III) solution at various concentrations in presence and absence of PCR5. When Tb(III) is adsorbed on PCR5 membranes, lifetime experiments in H₂O and D₂O confirm the loss of 5 or 6 water coordinated molecules indicating that in solid state the lanthanide(III)‐PCR5 interaction is stronger than in solution. The adsorption of Ce(III) in PCR5 membranes shows a Langmuir type isotherm, from which an equilibrium constant of 39 M^?1 has been calculated. SEM shows that the membrane morphology is not much affected by lanthanide adsorption. Support for lanthanide ion–crown interactions comes from ab initio calculations on 15‐crown‐5/La(III) complex. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 1788–1799, 2007     

屋顶绿化的自动灌溉系统设计

屋顶绿化对提高城市空气质量、减少“热岛效应”、改善居住环境有积极的意义，但其灌溉环节与普通园林绿化灌溉相比有更高的要求．为了增强屋顶灌溉的科学性，根据其特点提出了建立自动灌溉系统的设想，并对灌溉过程建立了混杂自动机模型，从离散事件动态系统与连续变量动态系统的角度共同描述了自动灌溉的过程，最后给出了自动灌溉系统的工程设计方案，对屋顶绿化自动化、精细化程度的提高具有一定的启示意义．     

Neuro-fuzzy approach to processing inputs with missing values in pattern recognition problems

An approach to dealing with missing data, both during the design and normal operation of a neuro-fuzzy classifier is presented in this paper. Missing values are processed within a general fuzzy min–max neural network architecture utilising hyperbox fuzzy sets as input data cluster prototypes. An emphasis is put on ways of quantifying the uncertainty which missing data might have caused. This takes a form of classification procedure whose primary objective is the reduction of a number of viable alternatives rather than attempting to produce one winning class without supporting evidence. If required, the ways of selecting the most probable class among the viable alternatives found during the primary classification step, which are based on utilising the data frequency information, are also proposed. The reliability of the classification and the completeness of information is communicated by producing upper and lower classification membership values similar in essence to plausibility and belief measures to be found in the theory of evidence or possibility and necessity values to be found in the fuzzy sets theory. Similarities and differences between the proposed method and various fuzzy, neuro-fuzzy and probabilistic algorithms are also discussed. A number of simulation results for well-known data sets are provided in order to illustrate the properties and performance of the proposed approach.     

Expert systems as a tool for statistics: A review

The current state of using expert system (ES) techniques for statistics is expounded through the difficulties of defining the notion of statistical expert system (SES) and through several well-known examples. The main characteristics of statistical expertise, and particularly the important concept of strategy are emphasized. The current state of SESs is seen in the context of the global trend of the evolution of ES, i.e. within the growth of second generation expert system (SGESs). The knowledge base of these ESs represent an attempt to represent not only experts' knowledge but also the way experts acquire their expertise, thanks to the existence of an underlying model. We show through many examples how far SESs are and/or will be able to be SGESs.     

一类It型非线性时滞关联随机大系统的分散鲁棒控制

在非线性项满足全局Lipschitz条件下,本文研究了一类It型非线性时滞关联随机大系统的分散鲁棒控制问题.系统的时滞是关于状态和控制输入的.基于Lyapunov泛函及线性矩阵不等式(LMI)的分析方法,得到了无记忆状态反馈控制器使整个时滞关联随机大系统可镇定的充分条件.