Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee

The paper presents a general method of designing constant-factor approximation algorithms for some discrete optimization problems with assignment-type constraints. The core of the method is a simple deterministic procedure of rounding of linear relaxations (referred to as pipage rounding). With the help of the method we design approximation algorithms with better performance guarantees for some well-known problems including MAXIMUM COVERAGE, MAX CUT with given sizes of parts and some of their generalizations.     

Flexible work planning of service agents with load balancing

This work emerged from the need to better plan the daily work of 29 travelling service agents, who provide 1090 services to 412 customers in 283 sites, on daily average. A handy and flexible tool was developed and is presented herein. A major contribution of this study is an explicit consideration of the multi-dimensional nature of the problem by the inclusion of workload balancing, which may stand in conflict to cost minimisation. Further, the geographical distribution of the demand is highly irregular. Therefore, two load measures are required and balanced. This required to fitting a proper planning scheme. The planning tool has been applied successfully by the commercial service provider. Improvements in the order of 20% and more were obtained in key performance measures. Moreover, cost reductions, service improvement and load balance were obtained simultaneously: the standard deviations of the service times and working day’s duration were reduced by 18 and 58%, respectively. This enables to reduce the number of agents with no significant harm in performance. Additional practical advantages of the proposed tool are also discussed and demonstrated, for example, the ability to cope with geographical distributions and the flexibility to respond to daily variations in demand.     

Asymptotic expaxsioxs for the joint distribution of cirrelated hotellings t2 statlstics under normality

Let T² _i=z′_iS^?1z_i, i==,…k be correlated Hotelling's T² statistics under normality. where z=(z′_i,…,z′_k)′ and nS are independently distributed as N_kp((O,ρ?∑) and Wishart distribution W_p(∑, n), respectively. The purpose of this paper is to study the distribution function F(x₁,…,x_k) of (T² _i,…,T² _k) when n is large. First we derive an asymptotic expansion of the characteristic function of (T² _i,…,T² _k) up to the order n^?2. Next we give asymptotic expansions for (T² _i,…,T² _k) in two cases (i)ρ=I_k and (ii) k=2 by inverting the expanded characteristic function up to the orders n^?2 and n^?1, respectively. Our results can be applied to the distribution function of max (T² _i,…,T² _k) as a special case.     

On tail behaviour of kth upper order statistics under fixed and random sample sizes via tail equivalence

For a fixed positive integer k, limit laws of linearly normalized kth upper order statistics are well known. In this article, a comprehensive study of tail behaviours of limit laws of normalized kth upper order statistics under fixed and random sample sizes is carried out using tail equivalence which leads to some interesting tail behaviours of the limit laws. These lead to definitive answers about their max domains of attraction. Stochastic ordering properties of the limit laws are also studied. The results obtained are not dependent on linear norming and apply to power norming as well and generalize some results already available in the literature. And the proofs given here are elementary.     

Max‐infinitely divisible models and inference for spatial extremes

For many environmental processes, recent studies have shown that the dependence strength is decreasing when quantile levels increase. This implies that the popular max‐stable models are inadequate to capture the rate of joint tail decay, and to estimate joint extremal probabilities beyond observed levels. We here develop a more flexible modeling framework based on the class of max‐infinitely divisible processes, which extend max‐stable processes while retaining dependence properties that are natural for maxima. We propose two parametric constructions for max‐infinitely divisible models, which relax the max‐stability property but remain close to some popular max‐stable models obtained as special cases. The first model considers maxima over a finite, random number of independent observations, while the second model generalizes the spectral representation of max‐stable processes. Inference is performed using a pairwise likelihood. We illustrate the benefits of our new modeling framework on Dutch wind gust maxima calculated over different time units. Results strongly suggest that our proposed models outperform other natural models, such as the Student‐t copula process and its max‐stable limit, even for large block sizes.     

中国野生大豆遗传多样性研究

遗传多样性研究是保护生物学研究的重要内容之一,对种质资源的保存利用和研究有重要的理论价值及实践意义.野生大豆是栽培大豆的野生近缘种,在长期自然环境选择下形成了较为丰富的变异类型,是大豆的珍贵基因库,具有高蛋白含量、较强的抗逆性和较高的繁殖系数等优良特点,为栽培大豆的遗传育种和种质改良提供了重要的基因资源.从20世纪80年代初开始,中国科研工作者在对全国野生大豆（Glycine soja Sieb.et Zucc.）搜集考察基础上,分别从农艺性状、酶水平、基因水平和细胞质水平揭示了野生大豆的遗传多样性.近30年野生大豆遗传多样性的研究成果表明,野生大豆遗传多样性研究为野生大豆的种质保护与保存奠定了理论基础,同时,也为野生大豆作为栽培大豆的遗传资源提供了有效利用的理论依据.     

Sampling from a Max‐Stable Process Conditional on a Homogeneous Functional with an Application for Downscaling Climate Data

Conditional simulation of max‐stable processes allows for the analysis of spatial extremes taking into account additional information provided by the conditions. Instead of observations at given sites as usually done, we consider a single condition given by a more general functional of the process as may occur in the context of climate models. As the problem turns out to be intractable analytically, we make use of Markov chain Monte Carlo methods to sample from the conditional distribution. Simulation studies indicate fast convergence of the Markov chains involved. In an application to precipitation data, the utility of the procedure as a tool to downscale climate data is demonstrated.     

Sample reuse simulation in optimal design for Tmax in pharmacokinetic experiments

T _max and C _max are important pharmacokinetic parameters in drug development processes. Often a nonparametric procedure is needed to estimate them when model independence is required. This paper proposes a simulation-based optimal design procedure for finding optimal sampling times for nonparametric estimates of T _max and C _max for each subject, assuming that the drug concentration follows a non-linear mixed model. The main difficulty of using standard optimal design procedures is that the property of the nonparametric estimate is very complicated. This procedure uses a sample reuse simulation to calculate the design criterion, which is an integral of multiple dimension, so that effective optimization procedures such as Newton-type procedures can be used directly to find optimal designs. This procedure is used to construct optimal designs for an open one-compartment model. An approximation based on the Taylor expansion is also derived and showed results that were consistent with those based on the sample reuse simulation.     

氨基酸氯化稀土配合物的制备

在非水溶剂中合成了氯化稀土甘氨酸配合物Ln（Gly）3Cl3·3H2O和氯化稀土与甘氨酸及邻菲罗琳多元配合物LnGly（phen）2Cl3·H2O（Ln＝Pr,Nd）．通过元素分析,红外光谱和热重分析确定了配合物的组成．     

Evaluating the Contributions of Individual Variables to a Quadratic Form

Quadratic forms capture multivariate information in a single number, making them useful, for example, in hypothesis testing. When a quadratic form is large and hence interesting, it might be informative to partition the quadratic form into contributions of individual variables. In this paper it is argued that meaningful partitions can be formed, though the precise partition that is determined will depend on the criterion used to select it. An intuitively reasonable criterion is proposed and the partition to which it leads is determined. The partition is based on a transformation that maximises the sum of the correlations between individual variables and the variables to which they transform under a constraint. Properties of the partition, including optimality properties, are examined. The contributions of individual variables to a quadratic form are less clear‐cut when variables are collinear, and forming new variables through rotation can lead to greater transparency. The transformation is adapted so that it has an invariance property under such rotation, whereby the assessed contributions are unchanged for variables that the rotation does not affect directly. Application of the partition to Hotelling's one‐ and two‐sample test statistics, Mahalanobis distance and discriminant analysis is described and illustrated through examples. It is shown that bootstrap confidence intervals for the contributions of individual variables to a partition are readily obtained.