Non parametric mixture of strictly monotone regression models

In this article, we propose the non parametric mixture of strictly monotone regression models. For implementation, a two-step procedure is derived. We further establish the asymptotic normality of the resultant estimator and demonstrate its good performance through numerical examples.     

A non-iterative posterior sampling algorithm for linear quantile regression model

In this article, a non-iterative posterior sampling algorithm for linear quantile regression model based on the asymmetric Laplace distribution is proposed. The algorithm combines the inverse Bayes formulae, sampling/importance resampling, and the expectation maximization algorithm to obtain independently and identically distributed samples approximately from the observed posterior distribution, which eliminates the convergence problems in the iterative Gibbs sampling and overcomes the difficulty in evaluating the standard deviance in the EM algorithm. The numeric results in simulations and application to the classical Engel data show that the non-iterative sampling algorithm is more effective than the Gibbs sampling and EM algorithm.     

Comparison between method of moments and entropy regularization algorithm applied to parameter estimation for mixed-Weibull distribution

Mixed-Weibull distribution has been used to model a wide range of failure data sets, and in many practical situations the number of components in a mixture model is unknown. Thus, the parameter estimation of a mixed-Weibull distribution is considered and the important issue of how to determine the number of components is discussed. Two approaches are proposed to solve this problem. One is the method of moments and the other is a regularization type of fuzzy clustering algorithm. Finally, numerical examples and two real data sets are given to illustrate the features of the proposed approaches.     

A Unified Way to Represent and Compute the Cumulative Distribution Function for Noncentral t,F, and χ2

This short article shows an unified approach to representing and computing the cumulative distribution function for noncentral t, F, and χ². Unlike the existing algorithms, which involve different expansion and/or recurrence, the new approach consistently represents all the three noncentral cumulative distribution functions as the integral of the normal cumulative distribution function and χ² density function.     

从saragur到salr——撒拉族源流的语言人类学研究

本文以撒拉族相关族名为重点,通过语言人类学的研究,提出撒拉族源自Qaramang(尕勒莽)部,和土库曼、土耳其的Karaman,乌兹别克的努尔塔Salur人都应是源自历史上著名的、Salur乌古斯部的一位领袖Karaman的观点。撒拉族的自称Salr,是由历史上的Salur、Salgur、*Saragur、*Sarg Ogur等演变而来。Sarg Ogur意为"黄箭(部落)",曾是匈奴的一个重要组成部分。撒拉族等一些乌古斯(Ouz)民族和维吾尔族、裕固族的祖先回纥(Ogur)都同出一源。     

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.     

特低渗透油藏 CO2 驱室内实验研究

针对大庆外围油田特低渗透油藏剩余油潜力大、井网加密效益差、水驱采收率低等问题，提出了特低渗透油藏 CO2驱技术。通过细管实验和天然岩芯 CO2 驱油实验，确定了 CO2 与高台子油田原油的最小混相压力，评价了特低渗透砂岩油藏 CO2 驱油效果。实验结果表明，CO2 驱可以应用于高台子油田，并取得较好的驱油效果。当天然岩芯空气渗透率为0.58 mD 时，在水驱基础上，气驱可以进一步提高采收率 8% 以上，特低渗透油藏实施 CO2 驱油技术是可行的。     

A Method of Finding Predictor Genes for a Particular Disease Using a Clustering Algorithm

Clustering Algorithms are nowadays really important tools in microarray data analysis. The different clustering algorithm generally used in biological science does not take into consideration the underlying probability distribution of the data. In this sense, they are heuristic in nature. In this work we proposed a clustering algorithm based on EM Algorithm. It gives 28% less misclassification than the K-means algorithm (which is mostly use in Bio science). We have also shown on a real data set that this algorithm can be efficiently used for detecting the genes which are responsible for a particular disease.     

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.     

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.