UNIFORM CONVERGENCE OF CESARO MEANS OF NEGATIVE ORDER OF DOUBLE TRIGONOMETRIC FOURIER SERIES

In this paper we prove that iff ∈ C([-π,π]2) and the function f is bounded partial p-variation for some p ∈ [1, ∞), then the double trigonometric Fourier series of a function f is uniformly (C;-α,-β) summable (α β＜ 1/p,α,β＞ 0) in the sense of Pringsheim. If α β≥ 1/p, then there exists a continuous function f0 of bounded partial double trigonometric Fourier series of fo diverge over cubes.     

n维氢原子的散射态

研究了n维氢原子的散射态性质．给出了精确的按“k/2π标度”归一化的散射态的精确解波函数及相移表达式，讨论了相移的解析性质，获得了束缚-连续跃迁矩阵元的解析计算公式．普通氢原子(n=3)散射态的有关结果作为特例包含在本文的一般结论之中． 关键词： n维氢原子 散射态 精确解 相移 束缚-连续跃迁矩阵元     

Flow Search Approach and New Bounds for the m-Step Linear Conjugate Gradient Algorithm

A flow search approach is presented in this paper. In the approach, each iterative process involves a subproblem, whose variables are the stepsize parameters. Every feasible solution of the subproblem corresponds to some serial search stages, the stepsize parameters in different search stages may interact mutually, and their optimal values are determined by evaluating the total effect of the interaction. The main idea of the flow search approach is illustrated via the minimization of a convex quadratic function. Based on the flow search approach, some properties of the m-step linear conjugate gradient algorithm are analyzed and new bounds on its convergence rate are also presented. Theoretical and numerical results indicate that the new bounds are better than the well-known ones.     

Finding Robust Solutions Using Local Search

This paper investigates how a local search metaheuristic for continuous optimisation can be adapted so that it finds broad peaks, corresponding to robust solutions. This is relevant in problems in which uncertain or noisy data is present. When using a genetic or evolutionary algorithm, it is standard practice to perturb solutions once before evaluating them, using noise from a given distribution. This approach however, is not valid when using population-less techniques like local search and other heuristics that use local search. For those algorithms to find robust solutions, each solution needs to be perturbed and evaluated several times, and these evaluations need to be combined into a measure of robustness. In this paper, we examine how many of these evaluations are needed to reliably find a robust solution. We also examine the effect of the parameters of the noise distribution. Using a simple tabu search procedure, the proposed approach is tested on several functions found in the literature. This revised version was published online in August 2006 with corrections to the Cover Date.     

Analysis of a Multiserver Queue with Setup Times

This paper deals with the analysis of an M/M/c queueing system with setup times. This queueing model captures the major characteristics of phenomena occurring in production when the system consists in a set of machines monitored by a single operator. We carry out an extensive analysis of the system including limiting distribution of the system state, waiting time analysis, busy period and maximum queue length. AMS subject classification: 90B22, 60K25     

Nonparametric estimation of distributions with categorical and continuous data

In this paper we consider the problem of estimating an unknown joint distribution which is defined over mixed discrete and continuous variables. A nonparametric kernel approach is proposed with smoothing parameters obtained from the cross-validated minimization of the estimator's integrated squared error. We derive the rate of convergence of the cross-validated smoothing parameters to their ‘benchmark’ optimal values, and we also establish the asymptotic normality of the resulting nonparametric kernel density estimator. Monte Carlo simulations illustrate that the proposed estimator performs substantially better than the conventional nonparametric frequency estimator in a range of settings. The simulations also demonstrate that the proposed approach does not suffer from known limitations of the likelihood cross-validation method which breaks down with commonly used kernels when the continuous variables are drawn from fat-tailed distributions. An empirical application demonstrates that the proposed method can yield superior predictions relative to commonly used parametric models.     

GaAs／AlGaAs发光二极管列阵场分布特性的电光测量

应用一种新颖的无损伤测量技术－连续波电光检测法（ＣＷＥＯＰ）对ＧａＡｓ／ＧａＡｌＡｓ单异质结发光管列阵电场分布进行了扫描测量。实验结果反映了器件内电流注入的方向和载流子扩展情况；通过比较各单元电场分布，反映器件发光均匀性。文中详细介绍了测量原理、实验装置和实验结果及讨论，最后用计算机对电场分布作了模拟计算并与实验结果进行了对照。     

Continuous Selectors of Fixed Point Sets of Multifunctions with Decomposable Values

Existence theorems of continuous selectors whose values are fixed points of multivalued contractions are proved. As an application, the existence of continuous selectors to generalized solution sets of partial differential inclusions, depending on a parameter, is obtained.     

The course scheduling problem at Lufthansa Technical Training

Lufthansa Technical Training GmbH (LTT) performs training courses for Lufthansa Technik AG as well as for several other international airlines. Courses of about 670 different types are offered of which several hundred take place each year. The course scheduling problem faced by LTT is to construct a yearly schedule which maximizes the profit margin incurred while meeting a variety of complex precedence, temporal, and resource-related constraints. A “good” operational schedule should also meet a number of additional subordinate objectives. We formalize the problem and develop a heuristic scheme along with several priority rules, as well as a local search algorithm to determine well-suited weights for weighted composite rules. The operational planning situation of 1996 served as our major test instance; additional test instances were constructed by modifying this data. Several computational experiments were carried out to evaluate the performance of the algorithms. It turned out that the best so-found schedule is substantially better in terms of the profit margin incurred than the solution manually constructed by LTT.     

Fast neighborhood search for the single machine total weighted tardiness problem

Most successful heuristics for solving 1||∑w_jT_j are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n³) to O(n²). We show that this result also improves the complexity of the recently developed dynasearch heuristics.