The economic design of multivariate binomial EWMA VSSI control charts

Since multi-attribute control charts have received little attention compared with multivariate variable control charts, this research is concerned with developing a new methodology to employ the multivariate exponentially weighted moving average (MEWMA) charts for m-attribute binomial processes; the attributes being the number of nonconforming items. Moreover, since the variable sample size and sampling interval (VSSI) MEWMA charts detect small process mean shifts faster than the traditional MEWMA, an economic design of the VSSI MEWMA chart is proposed to obtain the optimum design parameters of the chart. The sample size, the sampling interval, and the warning/action limit coefficients are obtained using a genetic algorithm such that the expected total cost per hour is minimized. At the end, a sensitivity analysis has been carried out to investigate the effects of the cost and the model parameters on the solution of the economic design of the VSSI MEWMA chart.     

回族学研究新视角——分子遗传学和生物信息学在回族学研究中的应用初探

为探讨回族学学科体系与方法论创新问题,进一步揭示回族的群体遗传特征和起源、迁徙途径,本文将分子遗传学和生物信息学的方法移植到回族学研究中。对回族和相关的国内外人群的Y染色体上SNP位点的多态性数据进行了研究,使用Arlequ in2.0软件计算了Fst遗传距离,并且进行了主成分分析,结果显示分子遗传学和生物信息学的方法对回族起源迁徙研究得出的证据可以与结合民族研究的成果和相关历史资料相对应;证明分子遗传学和生物信息学的方法可以很好地应用和移植到回族学研究中;同时,分子遗传学和生物信息学在回族学研究中的成果将为回族群体的医学基因组学、药物基因组学研究开辟新的领域,直接为回族群体的人口健康服务。     

The Effects of Multitasking on Operations Scheduling

This study considers a typical scheduling environment that is influenced by the behavioral phenomenon of multitasking. Under multitasking, the processing of a selected job suffers from interruption by other jobs that are available but unfinished. This situation arises in a wide variety of applications; for example, administration, manufacturing, and process and project management. Several classical solution methods for scheduling problems no longer apply in the presence of multitasking. The solvability of any scheduling problem under multitasking is no easier than that of the corresponding classical problem. We develop optimal algorithms for some fundamental and practical single machine scheduling problems with multitasking. For other problems, we show that they are computationally intractable, even though in some cases the corresponding problem in classical scheduling is efficiently solvable. We also study the cost increase and value gained due to multitasking. This analysis informs companies about how much it would be worthwhile to invest in measures to reduce or encourage multitasking.     

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.     

Penalized proportion estimation for non parametric mixture of regressions

Abstract

In this article, we propose a penalized local log-likelihood method to locally select the number of components in non parametric finite mixture of regression models via proportion shrinkage method. Mean functions and variance functions are estimated simultaneously. We show that the number of components can be estimated consistently, and further establish asymptotic normality of functional estimates. We use a modified EM algorithm to estimate the unknown functions. Simulations are conducted to demonstrate the performance of the proposed method. We illustrate our method via an empirical analysis of the housing price index data of United States.     

基于决策树算法的农业上市公司股利分配政策研究

股利分配政策是上市公司对盈利进行分配或留存的决策问题.在大数据时代运用微软商业智能中的决策树算法,可以对农业上市公司的相关财务数据进行深入挖掘.通过决策树规则进行分析,找出农业上市公司股利分配采购影响因素,为农业上市公司制定现金股利分配股利分配政策提供决策依据,也为商业智能工具在企业决策中的运用提供借鉴.     

一种应用于药品泡罩包装检测的改进分水岭算法研究

针对分水岭算法存在的过分割问题以及泡罩包装药品图像的特点,提出一种改进的分水岭分割算法对泡罩包装的药品进行分割。该方法将形态学重建运算与使用控制标记符的方法相结合,首先对原图像进行开闭重建,根据邻域像素连通性提取重建后图像的局部极大值作为标记,从而抑制其他的局部极小值,然后依据标记对原始的梯度图像进行修正,最后对修改后的梯度图像进行分水岭分割。试验表明,该方法在缺陷药品检测中,可以有效的抑制传统分水岭的过分割,分割效果良好。     

稳压电源的自适应去火弧技术

针对传统基于继电器控制的稳压电源在带负载工作时,档位切换常常伴随火弧现象的问题,设计了一种可广泛 应用于此类稳压电源上的自适应去火弧技术：使用光耦和多级运放完成对零点和电压电流的采样;基于单片机的10量, 实现对继电器的驱动和控制;基于RCC自激震荡原理为系统提供稳定电源;设计了稳压器的完整软件系统程序,并在软 件中应用自适应去火弧算法。实验结果表明：自适应去火弧技术,能够有效地规避火弧现象的产生,并能够根据条件作 出调整。采用自适应去火弧技术的稳压系统达到了设计目标,延长了系统工作寿命。     

改进离散人工蜂群算法规划异形满版服饰图案切割路径

服饰图案切割路径规划是服饰图案自动切割技术的关键部分之一。文中用改进的离散人工蜂群算法实现了激 光切割系统对异形满版服饰图案的切割工艺路径规划优化。首先,把满版服饰图案激光切割路径规划转化为广义旅行 商问题求解,证明了路径规划转化成普通TSP问题比转化成第一类广义TSP问题更为有效,并给出了路径规划中“图案 始切割点”的优化选择方法。然后结合部分匹配交叉和启发式变异搜索方法的人工蜂群算法求解TSP问题,证明了与 A*算法及遗传算法相比,该方法更为优越。并且该方法已应用于激光切割机切割异形满版服饰图案路径规划的生产实 践,运行可靠,比未规划时的工艺路线平均提高效率33.7%。该方法提供了一种解决TSP问题的新方法,具有一定的理 论意义和价值     

Subgroup Analysis with Time‐to‐Event Data Under a Logistic‐Cox Mixture Model

Subgroup detection has received increasing attention recently in different fields such as clinical trials, public management and market segmentation analysis. In these fields, people often face time‐to‐event data, which are commonly subject to right censoring. This paper proposes a semiparametric Logistic‐Cox mixture model for subgroup analysis when the interested outcome is event time with right censoring. The proposed method mainly consists of a likelihood ratio‐based testing procedure for testing the existence of subgroups. The expectation–maximization iteration is applied to improve the testing power, and a model‐based bootstrap approach is developed to implement the testing procedure. When there exist subgroups, one can also use the proposed model to estimate the subgroup effect and construct predictive scores for the subgroup membership. The large sample properties of the proposed method are studied. The finite sample performance of the proposed method is assessed by simulation studies. A real data example is also provided for illustration.