The <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/∞ system revisited: finiteness,summability, long range dependence,and reverse engineering

We explore M/G/∞ systems ‘fed’ by Poissonian inflows with infinite arrival rates. Three processes – corresponding to the system's state, workload, and queue-size – are studied and analyzed. Closed form formulae characterizing the system's stationary structure and correlation structure are derived. And, the issues of queue finiteness, workload summability, and Long Range Dependence are investigated. We then turn to devise a ‘reverse engineering’ scheme for the design of the system's correlation structure. Namely: how to construct an M/G/∞ system with a pre-desired ‘target’ workload/queue auto-covariance function. The ‘reverse engineering’ scheme is applied to various examples, including ones with infinite queues and non-summable workloads. AMS Subject Classifications Primary: 60K25; Secondary: 60G55, 60G10     

The location of median paths on grid graphs

In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located. The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case.     

The Asymptotic Behaviour of the Fourier Transforms of Orthogonal Polynomials I: Mellin Transform Techniques

The Fourier transform of orthogonal polynomials with respect to their own orthogonality measure defines the family of Fourier–Bessel functions. We study the asymptotic behaviour of these functions and of their products, for large real values of the argument. By employing a Mellin analysis we construct a general framework to exhibit the relation of the asymptotic decay laws to certain dimensions of the orthogonality measure, that are defined via the divergence abscissas of suitable integrals. The unifying r?le of Mellin transform techniques in deriving classical and new results is underlined. Submitted: November 5, 2004. Accepted: January 6, 2006.     

Learning and transfer in dynamic decision environments

An important aspect of learning is the ability to transfer knowledge to new contexts. However, in dynamic decision tasks, such as bargaining, firefighting, and process control, where decision makers must make repeated decisions under time pressure and outcome feedback may relate to any of a number of decisions, such transfer has proven elusive. This paper proposes a two-stage connectionist model which hypothesizes that decision makers learn to identify categories of evidence requiring similar decisions as they perform in dynamic environments. The model suggests conditions under which decision makers will be able to use this ability to help them in novel situations. These predictions are compared against those of a one-stage decision model that does not learn evidence categories, as is common in many current theories of repeated decision making. Both models' predictions are then tested against the performance of decision makers in an Internet bargaining task. Both models correctly predict aspects of decision makers' learning under different interventions. The two-stage model provides closer fits to decision maker performance in a new, related bargaining task and accounts for important features of higher-performing decision makers' learning. Although frequently omitted in recent accounts of repeated decision making, the processes of evidence category formation described by the two-stage model appear critical in understanding the extent to which decision makers learn from feedback in dynamic tasks. Faison (Bud) Gibson is an Assistant Professor at College of Business, Eastern Michigan University. He has extensive experience developing and empirically testing models of decision behavior in dynamic decision environments.     

Necessary conditions and duality for inexact nonlinear semi-infinite programming problems

First order necessary conditions and duality results for general inexact nonlinear programming problems formulated in nonreflexive spaces are obtained. The Dubovitskii–Milyutin approach is the main tool used. Particular cases of linear and convex programs are also analyzed and some comments about a comparison of the obtained results with those existing in the literature are given.     

Timetabling County Cricket Fixtures Using a Form of Tabu Search

This paper concerns a computer system which has been devised to timetable the county cricket matches in England. The context of the work is discussed and the many constraints and objectives described. Details of the solution method are given; it involves tabu search with a form of diversification dependent on the solution subcosts as well as the overall cost. Experiments are described which suggest that this type of diversification may have wide applicability to large, complex, multi-objective combinatorial problems.     

The Nature of Community OR

This paper outlines the results of a study undertaken to investigate the nature of Community Operational Research (COR). The objective was to contact the people involved in COR through a series of personal interviews and a questionnaire survey, in order to clarify many of the issues that have emerged within the profession relating to the practice of OR within the community and voluntary sector. A total of 20 individuals were successfully contacted, and they have been responsible for at least two-thirds of the projects in the COR area.     

第Ⅰ种强度不对称三态叠加多模叠加态光场N次方Y压缩—第一正交相位分量的压缩情况

根据量子力学中的线性叠加原理,构造了由三个强度不等的多模相干态光场|{Z_j^(A)}>_q、|{Z_j^(B)}>_q和|{Z_j^(C)}>_q的线性叠加所组成的第Ⅰ种强度不对称三态叠加多模叠加态光场|ψ_l^(ABC)>_q.利用多模压缩态理论,研究了态|ψ_l^(ABC)>_q的第一正交方分量(即磁场分量)的广义非线性等幂次N次方Y压缩特性.结果发现:①在上述各多模相干态光场中各模的强度和各模的初始相位各不相等的情况下,态|ψ_l^(ABC)>_q的第一正交分量-磁场分量在一定的条件下,总可呈现出周期性变化的、任意等幂次的N次方Y压缩效应;②当上述各多模相干态光场的强度和各模的初始相位相等时,态|ψ_l^(ABC)>_q的磁场分量的N次方Y压缩现象消失,态|ψ_l^(ABC)>_q可恒处于等幂次N-Y最小测不准态.     

亚细胞器诱导的2,4,6-三硝基甲苯阴离子自由基的ESR研究

本文在无氧条件下利用ESR分别观察了肝脏和晶状体的微粒体及线粒体酶在NADPH存在下还原三硝基甲苯(TNT)的过程,检测到参数为g=2.0048±0.0005,A_对位~N=1.215mT,A~N=0.800±0.010mT,A~H=0.122±0.0206mT的自由基信号,并通过电子计算机对ESR谱的模拟证明该自由基信号为TNT硝基阴离子自由基,根据其超精细分裂常数认为,其不配对电子的电子云密度主要分布在对位硝基上。     

Frequent oscillation in a nonlinear partial difference equation

This paper is concerned with a class of nonlinear delay partial difference equations with variable coefficients, which may change sign. By making use of frequency measures, some new oscillatory criteria are established. This is the first time oscillation of these partial difference equations is discussed by employing frequency measures.