多维正态分布均值在序约束下的假设检验

在序限制下的统计推断是统计分析中的一个重要领域，保序回归理论在这个领域中起着关键性的作用。多维保序回归是一维保序回归的推广，本文给出了k=2,p=2时多维保序回归的求解方法。令Xij,j=1,2…，n是来自总体为二维正态分布N（μi，Λ)的样本，这是μi是未知的，Λ是已知的，i=1,2。令μ=（μ1,μ2)，-={（μ1,μ2)|μ1,μ∈R^2,}-0={(μ1,μ2)|μ1≤μ2,μ1，μ2∈R^2}。μ1≤μ2表示μ2-μ1的每一个分量为非负。本文也讨论了假设检验问题H0:μ∈-0,H1:μ∈-0=---0(H0是零假设）。     

Orders on Braid Groups

It is shown that the braid group defies lattice ordering.     

Empirical likelihood for partial linear models

In this paper the empirical likelihood method due to Owen (1988,Biometrika,75, 237–249) is applied to partial linear random models. A nonparametric version of Wilks' theorem is derived. The theorem is then used to construct confidence regions of the parameter vector in the partial linear models, which has correct asymptotic coverage. A simulation study is conducted to compare the empirical likelihood and normal approximation based method. Research supported by NNSF of China and a grant to the first author for his excellent Ph.D. dissertation work in China. Research supported by Hong Kong RGC CERG No. HKUST6162/97P.     

A New Technique for Ill-Conditioned Linear Systems

The technique we propose for solving ill-conditioned linear systems consists of two steps. First we compute the regularized solution on some values of the regularization parameter . Then we use these solutions either to extrapolate at =0 or to estimate the regularized solution with determined by the generalized cross validation or by the L-curve method.     

On Korovkin Type Theorem in the Space of Locally Integrable Functions

It is shown that a Korovkin type theorem for a sequence of linear positive operators acting in weighted space L _p,w (loc) does not hold in all this space and is satisfied only on some subspace.     

A Hybrid Approach to Scheduling with Earliness and Tardiness Costs

A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time.     

Optimal Operations Management and Network Planning of a District Heating System with a Combined Heat and Power Plant

District heating plants are becoming more common in European cities. These systems make it possible to furnish users with warm water while locating the production plants in the outskirts having the double benefit of lowering the impact of pollution on the center of the city and achieving better conversion performances. In order to amortize the costs throughout the year, the system often includes a combined heat and power (CHP) plant, to exploit the energy during the summer as well, when the demand for warm water decreases. A linear programming model for the optimal resource management of such a plant is presented and some results for a real case are reported. A distribution network design problem is also addressed and solved by means of mixed integer linear programming.     

On Linear Representations of Analytic Moufang Loops

Mathematical Notes -     

New class of generating functions associated with generalized hypergeometric polynomials

In this paper authors prove a general theorem on generating relations for a certain sequence of functions. Many formulas involving the families of generating functions for generalized hypergeometric polynomials are shown here to be special cases of a general class of generating functions involving generalized hypergeometric polynomials and multiple hypergeometric series of several variables. It is then shown how the main result can be applied to derive a large number of generating functions involving hypergeometric functions of Kampé de Fériet, Srivastava, Srivastava-Daoust, Chaundy, Fasenmyer, Cohen, Pasternack, Khandekar, Rainville and other multiple Gaussian hypergeometric polynomials scattered in the literature of special functions.     

Initial data truncation for multivariate output of discrete-event simulations using the Kalman filter

Data truncation is a commonly accepted method of dealing with initialization bias in discrete-event simulation. An algorithm for determining the appropriate initial-data truncation point for multivariate output is proposed. The technique entails averaging across independent replications and estimating a steady-state output model in a state-space framework. A Bayesian technique called Multiple Model Adaptive Estimation (MMAE) is applied to compute a time varying estimate of the output's steady-state mean vector. This MMAE implementation features the use, in paralle, of a bank of Kalman filters. Each filter is constructed under a different assumption concerning the output's steady-state mean vector. One of the filters assumes that the steady-state mean vector is accurately reflected by an estimate, called the assumed steady-state mean vector, taken from the last half of the simulation data. As the filters process the output through the effective transient, this particular filter becomes more likely (in a Bayesian sense) to be the best filter to represent the data and the MMAE mean estimator is influenced increasingly towards the assumed steady-state mean vector. The estimated truncation point is selected when a norm of the MMAE mean vector estimate is within a small tolerance of the assumed steady-state mean vector. A Monte Carlo analysis using data from simulations of open and closed queueing models is used to evaluate the technique. The evaluation criteria include the ability to construct accurate and reliable confidence regions for the mean response vector based on the truncated sequences.