互连网络拓扑优化设计

论述了互连网络拓扑优化设计问题,建立了必要的数学模型,该数学模型是一个非线性组合优化问题,它属于NP—完备类问题。采取拉格朗日松弛法、次梯度迭代算法和启发式算法,得出最优下确界和结论。     

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable

A fully odd K₄ is a subdivision of K₄ such that each of the six edges of the K₄ is subdivided into a path of odd length. In 1974, Toft conjectured that every graph containing no fully odd K₄ can be vertex-colored with three colors. The purpose of this paper is to prove Toft's conjecture.     

On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time

We investigate the problem of on-line scheduling two-machine open shops with the objective of minimizing the makespan.Jobs arrive independently over time, and the existence of a job is not known until its arrival. In the clairvoyant on-line model, the processing requirement of every job becomes fully known at the arrival of the job, while inthe non-clairvoyant on-line model, this processing requirement is notknown until the job is processed and completed.In both models, scheduling of a job is irrevocable.We study the two-machine open shop problem for both models in the preemptive and in the non-preemptive version. For each of the four variants, we provide an algorithm that is best possible with respect to the worst-case performance. In the clairvoyant on-line model, the best worst-case performance ratios are 5/4 (preemptive) and 3/2 (non-preemptive), and in the non-clairvoyant on-line model, they are 3/2 (preemptive and non-preemptive).     

A Note on Inconsistency of NPMLE of the Distribution Function from Left Truncated and Case I Interval Censored Data

We show that under reasonable conditions the nonparametric maximum likelihood estimate (NPMLE) of the distribution function from left-truncated and case 1 interval-censored data is inconsistent, in contrast to the consistency properties of the NPMLE from only left-truncated data or only interval-censored data. However, the conditional NPMLE is shown to be consistent. Numerical examples are provided to illustrate their finite sample properties.     

Identifiable finite mixtures of location models for clustering mixed-mode data

For clustering mixed categorical and continuous data, Lawrence and Krzanowski (1996) proposed a finite mixture model in which component densities conform to the location model. In the graphical models literature the location model is known as the homogeneous Conditional Gaussian model. In this paper it is shown that their model is not identifiable without imposing additional restrictions. Specifically, for g groups and m locations, (g!)m–1 distinct sets of parameter values (not including permutations of the group mixing parameters) produce the same likelihood function. Excessive shrinkage of parameter estimates in a simulation experiment reported by Lawrence and Krzanowski (1996) is shown to be an artifact of the model's non-identifiability. Identifiable finite mixture models can be obtained by imposing restrictions on the conditional means of the continuous variables. These new identified models are assessed in simulation experiments. The conditional mean structure of the continuous variables in the restricted location mixture models is similar to that in the underlying variable mixture models proposed by Everitt (1988), but the restricted location mixture models are more computationally tractable.     

Modelling Variability in the Branching Structure of Strawberry Inflorescences

The branching structure of inflorescences of the cultivated strawberry ( Fragaria × ananassa Duch.) is very variable. This paper demonstrates that some aspects of this variability are well described by a simple stochastic model of branching that has two adjustable parameters. The model is shown to provide a good fit to data from a set of almost 700 inflorescences of the cultivar Elsanta, collected over two successive years. For one parameter the maximum likelihood estimator is a moment estimator which is fully efficient even if the detailed branching structure of the inflorescences is not recorded. This parameter provides a convenient summary of branching vigour. The maximum likelihood estimator of the second parameter must be determined iteratively and can be quite inefficient unless the full branching structure is recorded. The model demonstrates that branching structure is affected by the order in which inflorescences emerge on the plant.     

Book Reviews

Books reviewed:
David Griffiths, W. Douglas Stirling, and K. Laurence Weldon, Understanding Data: Principles and Practice of Statistics
Ingwer Borg and Patrick Groenen, Modern Multidimensional Scaling: Theory and Applications
Jeffrey H. Dorfman, Bayesian Economics Through Numerical Methods: A Guide to Econometrics and Decision-making with Prior Information
Marek Musiela and Marek Rutkowski, Martingale Methods in Financial Modelling: Theory and Applications
Aad W. van der Vaart and Jon A. Wellner, Weak Convergence and Empirical Processes     

信用风险中回收率分布的双Beta模型

本文研究了随机回收率的分布,建立了回收率的双Beta分布密度模型,它具有双峰分布的特点,这与Moody公司的最新研究相吻合,弥补了现有回收率分布模型均为单峰的不足。利用基于数论网格的序贯优化算法对所建模型的参数做出了估计,借助于核密度估计的工具,进行了实证分析,结果表明双Beta模型的拟合误差很小,远小于Beta模型的误差,它是表示回收率理想的模型。最后给出了抽取双Beta分布随机数的方法。     

Fitting competing risks data to bivariate Pareto models

This paper revisits two bivariate Pareto models for fitting competing risks data. The first model is the Frank copula model, and the second one is a bivariate Pareto model introduced by Sankaran and Nair (1993 Sankaran, P. G., and N. U. Nair. 1993. A bivariate Pareto model and its applications to reliability. Naval Research Logistics 40 (7):1013–1020. doi:10.1002/1520-6750(199312)40:7%3c1013::AID-NAV3220400711%3e3.0.CO;2-7.[Crossref], [Web of Science ®] , [Google Scholar]). We discuss the identifiability issues of these models and develop the maximum likelihood estimation procedures including their computational algorithms and model-diagnostic procedures. Simulations are conducted to examine the performance of the maximum likelihood estimation. Real data are analyzed for illustration.     

Implementing Monte Carlo tests with p-value buckets

Software packages usually report the results of statistical tests using p-values. Users often interpret these values by comparing them with standard thresholds, for example, 0.1, 1, and 5%, which is sometimes reinforced by a star rating (***, **, and *, respectively). We consider an arbitrary statistical test whose p-value p is not available explicitly, but can be approximated by Monte Carlo samples, for example, by bootstrap or permutation tests. The standard implementation of such tests usually draws a fixed number of samples to approximate p. However, the probability that the exact and the approximated p-value lie on different sides of a threshold (the resampling risk) can be high, particularly for p-values close to a threshold. We present a method to overcome this. We consider a finite set of user-specified intervals that cover [0, 1] and that can be overlapping. We call these p-value buckets. We present algorithms that, with arbitrarily high probability, return a p-value bucket containing p. We prove that for both a bounded resampling risk and a finite runtime, overlapping buckets need to be employed, and that our methods both bound the resampling risk and guarantee a finite runtime for such overlapping buckets. To interpret decisions with overlapping buckets, we propose an extension of the star rating system. We demonstrate that our methods are suitable for use in standard software, including for low p-value thresholds occurring in multiple testing settings, and that they can be computationally more efficient than standard implementations.