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.     

Galerkin Approximations for the Linear Parabolic Equation with the Third Boundary Condition

We solve a linear parabolic equation in ^d , d 1, with the third nonhomogeneous boundary condition using the finite element method for discretization in space, and the -method for discretization in time. The convergence of both, the semidiscrete approximations and the fully discretized ones, is analysed. The proofs are based on a generalization of the idea of the elliptic projection. The rate of convergence is derived also for variable time step-sizes.     

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.     

Irreducible Representations of Wreath Products of Association Schemes

The wreath product of finite association schemes is a natural generalization of the notion of the wreath product of finite permutation groups. We determine all irreducible representations (the Jacobson radical) of a wreath product of two finite association schemes over an algebraically closed field in terms of the irreducible representations (Jacobson radicals) of the two factors involved.     

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.     

亚纯函数及其k阶导数的唯一性

本文研究具有特殊亏量关系的亚纯函数与其k阶导数分担小函数集合的唯一性，改进，推广了李江涛，顾永兴，杨重骏，仪洪勋等人的有关结果.     

二维抛物型方程的高精度多重网格解法

提出了数值求解二维抛物型方程的一种新的高精度加权平均紧隐格式，利用Fourier分析方法证明了该格式是无条件稳定的，为了克服传统迭代法在求解隐格式是收敛速度慢的缺陷，利用了多重网格加速技术，大大加快了迭代收敛速度，提高了求解效率，数值实验结果验证了方法的精确性和可靠性。     

On Linear Representations of Analytic Moufang Loops

Mathematical Notes -