Saddlepoint approximations for some models of circular data

In this article we provide saddlepoint approximations for some important models of circular data. The particularity of these saddlepoint approximations is that they do not require solving the saddlepoint equation iteratively, so their evaluation is immediate. We first give very accurate approximations to P-values, critical values and power functions for some optimal tests regarding the concentration parameter under wrapped symmetric α-stable and circular normal models. Then, we consider an approximation to the distribution of a projection of the two-dimensional Pearson random walk with exponential step sizes.     

一种基于RCPT码的渐进图像传输方法

将等级树中的集分割编码器输出的码流分组,根据输出的分组数据对重建图像重要性的不同,传输前采用纠错能力不同的RCPT码保护。在总的码率限制下,采用遗传算法从有限码率集中选择每组数据的RCPT码码率,使接收端恢复的图像失真最小。将等误差保护码率作为遗传算法的初始种群,减少了最优码率集的搜索时间。在二进制对称信道上的仿真结果表明,该渐进图像传输方法实现简单,在高误码率信道条件下恢复图像仍能得到很高的峰值信噪比。     

Using sibling data to understand the impact of family group decision-making on child welfare outcomes

Few studies have examined the impact of family group decision-making (FGDM) on child welfare outcomes. Studies in this area have often suffered from small sample sizes and lack of adequate comparison groups. Since FGDM is administered at the family level, sibling data provides an ideal way to compensate for small sample sizes and low enrollment rates in research evaluating FGDM. This study utilized sibling data from California's Title IV-E Waiver Demonstration Project Evaluation in Fresno and Riverside Counties to compare child welfare outcomes for children of families randomly assigned to receive FGDM (Fresno County, n = 110; Riverside County, n = 87) to children of families assigned to receive traditional child welfare services (Fresno County, n = 74; Riverside County, n = 52). After controlling for clustering effects using general estimating equations (GEE), group differences in child maltreatment, placement stability, and permanence were modeled using linear and logistic regression. Outcomes from both counties suggested no group differences. Though neutral outcomes on child welfare indicators may bring into question FGDM's efficacy for changing child welfare outcomes, this study confirms previous findings with smaller sample sizes on the impact of FGDM and demonstrates a methodological improvement over individual or family-case analyses.     

Likelihood Estimation for Censored Random Vectors

This article shows how to construct a likelihood for a general class of censoring problems. This likelihood is proven to be valid, i.e. its maximizer is consistent and the respective root-n estimator is asymptotically efficient and normally distributed under regularity conditions. The method generalizes ordinary maximum likelihood estimation as well as several standard estimators for censoring problems (e.g. tobit type I-tobit type V).     

Model and design correspondence in finite population sampling

A correspondence rule is suggested for the choice of a sampling design when prior knowledge concerning a finite population is available. Designs satisfying the correspondence rule are discussed in the case of random permutations models. A general optimality theorem is given for strategies under such models. Approximate correspondences satisfied by systematic sampling and πps sampling are also indicated.     

On random variate generation for the generalized hyperbolic secant distributions

We give random variate generators for the generalized hyperbolic secant distribution and related families such as Morris's skewed generalized hyperbolic secant family and a family introduced by Laha and Lukacs. The rejection method generators are uniformly fast over the parameter space and are based upon a complex function representation of the distributions due to Harkness and HarknessThe author's research was sponsored by NSERC Grant A3456 and FCAR Grant 90-ER-0291.     

关于鲁迅与陈独秀等“随感录”的比较

本文通过对鲁迅与陈独秀等人《随感录》的比较，分析了他们在《随感录》内容指向、提炼与构思、文风特征及艺术品性等方面的诸多差异，对比性显示了鲁迅关注中国现实问题的独异视角和艺术上的独特创造     

The random robin problem for laplace's equation

A random generalized solution to the Robin problem for Laplace's equation is defined in terms of the sections of the random boundary data. Existence, uniqueness, and properties are established for such a solution. Particularizations to the Dirichlet and Newmann problems as well as generalization to the Robin-Poisson problem are mentioned. Applications of the results are provided.     

A genetic algorithm tutorial

This tutorial covers the canonical genetic algorithm as well as more experimental forms of genetic algorithms, including parallel island models and parallel cellular genetic algorithms. The tutorial also illustrates genetic search by hyperplane sampling. The theoretical foundations of genetic algorithms are reviewed, include the schema theorem as well as recently developed exact models of the canonical genetic algorithm.     

Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs

We present a tractable class of integer feasibility problems. This class of max-closed IP problems was studied in somewhat restricted form by Glover, Pnueli, Hochbaum and Chandrasekaran and has a logic counterpart known as the class of Horn formulas. First we modify the existing algorithms in order to avoid the related recognition problem. Then we show that in order to solve these max-closed IP problems, simplicial path following methods can be used. This is important because these methods are flexible with respect to starting conditions, which make them more suitable than the top-down truncation algorithms that have been suggested.