Second order asymptotic comparison of estimators of a common parameter in the double exponential case

Summary The problem to estimate a common parameter for the pooled sample from the double exponential distributions is discussed in the presence of nuisance parameters. The maximum likelihood estimator, a weighted median, a weighted mean and others are asymptotically compared up to the second order, i.e. the ordern ^−1/2 with the asymptotic expansions of their distributions. University of Electro-communications     

两阶段选址优化问题研究

本文主要考虑如下实际问题:假设选址决策者需要建设p个设施,但是由于资金等等的影响,实际建设时会被要求先建设q个设施,其次再建设p-q个设施(设p>q),同时要求,在建设p-q个设施的时候,已经建设好的q个设施不被删除。本文建立了一个两阶段优化问题,问题的输出是两个待修建的设施的集合Fq,Fp,|Fp|=p,|Fq|=q,且Fq是Fp的子集,问题的目标是最小化这两个设施集合的费用同对应的最优费用的比值的最大值。本文给出一个近似比为9的近似算法,并对一些特殊的情况进行了讨论。所得结论对实际的选址决策具有理论意义,同时也完善已有相关研究结果。     

基于ARM的视觉导航AGV图像处理方法研究

为了实现更加简单高效的标识线图像的检测与处理,提出了一种优化的基于ARM的视觉导航AGV标识线图像处理方法。首先对采集到的图像进行灰度化处理并使用Otsu算法对图像进行阈值分割;然后采用优化的中值滤波算法进行图像滤波并使用高效的边缘提取策略获取路径边缘特征;最后采用角度判断的方法剔除错误点并使用最小二乘法拟合成路径的中心线。实验结果表明,该方法有较高的准确率和较好的实时性,可以满足工业生产中的实际需求,适用于基于嵌入式系统开发的视觉导航AGV。     

一种改进的基于分水岭的图像分割算法

针对分水岭算法过分割现象,提出一种综合分水岭算法、中值过滤算法和归一化割算法的改进算法。该算法首先应用改进型的中值过滤算法对图像进行适当的除噪;然后通过分水岭变换对图像进行了初步分割,最后使用归一化割算法进行图像精度分割。算法集合了分水岭算法、中值过滤算法及归一化割算法的优点,既较好地解决了分水岭算法中过度分割的问题,又降低了归一化割算法的时间复杂度。实验结果表明该算法是一种切实可行的图像分割方法。     

On a Ramanujan equation connected with the median of the gamma distribution

In this paper, we consider the sequence solving the Ramanujan equation

The three main achievements are the following. We introduce a continuous-time extension of and show its close connections with the medians of the distributions and the Charlier polynomials. We give upper and lower bounds for both and , in particular for , which are sharper than other known estimates. Finally, we show (and at the same time complete) two conjectures by Chen and Rubin referring to the sequence of medians .

     

The incoming statistical knowledge of undergraduate majors in a department of mathematics and statistics

Studies have shown that at the end of an introductory statistics course, students struggle with building block concepts, such as mean and standard deviation, and rely on procedural understandings of the concepts. This study aims to investigate the understandings entering freshman of a department of mathematics and statistics (including mathematics education), students who are presumably better prepared in terms of mathematics and statistics than the average university student, have of introductory statistics. This case study found that these students enter college with common statistical misunderstandings, lack of knowledge, and idiosyncratic collections of correct statistical knowledge. Moreover, they also have a wide range of beliefs about their knowledge with some of the students who believe that they have the strongest knowledge also having significant misconceptions. More attention to these statistical building blocks may be required in a university introduction statistics course.     

Allocation strategies in hub networks

In this paper, we study allocation strategies and their effects on total routing costs in hub networks. Given a set of nodes with pairwise traffic demands, the p-hub median problem is the problem of choosing p nodes as hub locations and routing traffic through these hubs at minimum cost. This problem has two versions; in single allocation problems, each node can send and receive traffic through a single hub, whereas in multiple allocation problems, there is no such restriction and a node may send and receive its traffic through all p hubs. This results in high fixed costs and complicated networks. In this study, we introduce the r-allocation p-hub median problem, where each node can be connected to at most r hubs. This new problem generalizes the two versions of the p-hub median problem. We derive mixed-integer programming formulations for this problem and perform a computational study using well-known datasets. For these datasets, we conclude that single allocation solutions are considerably more expensive than multiple allocation solutions, but significant savings can be achieved by allowing nodes to be allocated to two or three hubs rather than one. We also present models for variations of this problem with service quality considerations, flow thresholds, and non-stop service.     

便携式X光机图像降噪复合算法研究

便携式X光机应用越来越广,因而对其所成图像的降噪也显得尤为重要.本文首先讨论和分析了便携式X光机成像系统噪声的来源及其特性,针对传统单一降噪算法存在的不足,提出了一种新的复合式降噪算法.该复合算法不仅对高斯噪声和脉冲噪声有很好的滤除效果,同时也能有效地保护图像的细节部分.仿真实验证明,该算法切实可行.     

Seymour's Second Neighborhood Conjecture for Tournaments Missing a Generalized Star

Seymour's Second Neighborhood Conjecture asserts that every digraph (without digons) has a vertex whose first out‐neighborhood is at most as large as its second out‐neighborhood. We prove its weighted version for tournaments missing a generalized star. As a consequence the weighted version holds for tournaments missing a sun, star, or a complete graph. © 2011 Wiley Periodicals, Inc. J Graph Theory 71:89–94, 2012