Sequential testing procedures for a class of distributions representing various life-testing models

A class of probability density functions is considered, which covers several life-testing models as specific cases. Sequential probability ratio tests are developed for testing simple and composite hypotheses regarding the parameters of the probabilistic model. Expressions for the operating characteristic and the average sample number functions are derived and their behaviour is studied by means of graph-plotting.     

On the distribution of linear combinations of the components of a Dirichlet random vector

On making use of a result of Imhof, an integral representation of the distribution function of linear combinations of the components of a Dirichlet random vector is obtained. In fact, the distributions of several statistics such as Moran and Geary's indices, the Cliff‐Ord statistic for spatial correlation, the sample coefficient of determination, F‐ratios and the sample autocorrelation coefficient can be similarly determined. Linear combinations of the components of Dirichlet random vectors also turn out to be a key component in a decomposition of quadratic forms in spherically symmetric random vectors. An application involving the sample spectrum associated with series generated by ARMA processes is discussed.     

A discrete choice model for labor supply and childcare

A discrete choice model for labor supply and childcare for mothers of preschoolers is presented. The mothers are assumed to make choices from a finite set of job possibilities and from a finite set of childcare options. Options in the markets for childcare are characterized by opening hours, fees and quality attributes. Similarly, jobs are characterized by a fixed wage rate, working hours and a number of variables related to job satisfaction. In the estimation of the model, we take into account that the number of options available might vary across work/care combinations and that some mothers are rationed in the market for care at day care centers. The model is employed to simulate the female labor supply effects of the Norwegian home care allowance reform.

Bayesian beta nonlinear models with constrained parameters to describe ruminal degradation kinetics

The models used to describe the kinetics of ruminal degradation are usually nonlinear models where the dependent variable is the proportion of degraded food. The method of least squares is the standard approach used to estimate the unknown parameters but this method can lead to unacceptable predictions. To solve this issue, a beta nonlinear model and the Bayesian perspective is proposed in this article. The application of standard methodologies to obtain prior distributions, such as the Jeffreys prior or the reference priors, involves serious difficulties here because this model is a nonlinear non-normal regression model, and the constrained parameters appear in the log-likelihood function through the Gamma function. This paper proposes an objective method to obtain the prior distribution, which can be applied to other models with similar complexity, can be easily implemented in OpenBUGS, and solves the problem of unacceptable predictions. The model is generalized to a larger class of models. The methodology was applied to real data with three models that were compared using the Deviance Information Criterion and the root mean square prediction error. A simulation study was performed to evaluate the coverage of the credible intervals.     

Computer-Aided Process Structuring Via Mixed Integer Programming

Systems development managers today are working with increasingly complex systems, revealing a need for computer-aided techniques in software system definition, design, and construction. The ultimate task of the software engineer is the development of tools and procedures which reduce the effort involved in production of effective software. To be effective, software must possess characteristics of correctness, reliability, efficiency, documentation, and flexibility. This paper develops a measure for software effectiveness and a computer aid for determining process structure in program module specification. The proposed method uses various criteria and a mixed integer program to decompose a system graph into program modules.     

Equation-solving estimator based on the general n-step MHDR algorithm

Markov chain Monte Carlo (MCMC) methods provide an important means to simulate from almost any probability density. To approximate non-standard discrete distributions, the equation-solving MCMC estimator was developed as an alternative to the classical frequency estimator. The used simulation scheme is the Metropolis–Hastings (M–H) algorithm. Recently, this estimator has been extended to the specific context of 2-step Metropolis-Hastings with delayed rejection (MHDR) algorithm, which allowed a considerable reduction in asymptotic variance. In this paper, we propose an adaptation of equation-solving estimator to the case of general n-step MHDR sampler. The aim is to further improve the precision. An application to a Bayesian hypothesis test problem shows the high performance, in terms of accuracy, of the equation-solving estimator, based on a MHDR algorithm with more than two stages.     

Nonlinear semiparametric autoregressive model with finite mixtures of scale mixtures of skew normal innovations

We propose data generating structures which can be represented as the nonlinear autoregressive models with single and finite mixtures of scale mixtures of skew normal innovations. This class of models covers symmetric/asymmetric and light/heavy-tailed distributions, so provide a useful generalization of the symmetrical nonlinear autoregressive models. As semiparametric and nonparametric curve estimation are the approaches for exploring the structure of a nonlinear time series data set, in this article the semiparametric estimator for estimating the nonlinear function of the model is investigated based on the conditional least square method and nonparametric kernel approach. Also, an Expectation–Maximization-type algorithm to perform the maximum likelihood (ML) inference of unknown parameters of the model is proposed. Furthermore, some strong and weak consistency of the semiparametric estimator in this class of models are presented. Finally, to illustrate the usefulness of the proposed model, some simulation studies and an application to real data set are considered.     

A method for combining p-values in meta-analysis by gamma distributions

Combining p-values from statistical tests across different studies is the most commonly used approach in meta-analysis for evolutionary biology. The most commonly used p-value combination methods mainly incorporate the z-transform tests (e.g., the un-weighted z-test and the weighted z-test) and the gamma-transform tests (e.g., the CZ method [Z. Chen, W. Yang, Q. Liu, J.Y. Yang, J. Li, and M.Q. Yang, A new statistical approach to combining p-values using gamma distribution and its application to genomewide association study, Bioinformatics 15 (2014), p. S3]). However, among these existing p-value combination methods, no method is uniformly most powerful in all situations [Chen et al. 2014]. In this paper, we propose a meta-analysis method based on the gamma distribution, MAGD, by pooling the p-values from independent studies. The newly proposed test, MAGD, allows for flexible accommodating of the different levels of heterogeneity of effect sizes across individual studies. The MAGD simultaneously retains all the characters of the z-transform tests and the gamma-transform tests. We also propose an easy-to-implement resampling approach for estimating the empirical p-values of MAGD for the finite sample size. Simulation studies and two data applications show that the proposed method MAGD is essentially as powerful as the z-transform tests (the gamma-transform tests) under the circumstance with the homogeneous (heterogeneous) effect sizes across studies.     

A Pitman measure of similarity in k-means for clustering heavy-tailed data

One of the most popular methods and algorithms to partition data to k clusters is k-means clustering algorithm. Since this method relies on some basic conditions such as, the existence of mean and finite variance, it is unsuitable for data that their variances are infinite such as data with heavy tailed distribution. Pitman Measure of Closeness (PMC) is a criterion to show how much an estimator is close to its parameter with respect to another estimator. In this article using PMC, based on k-means clustering, a new distance and clustering algorithm is developed for heavy tailed data.     

A new class of slash-elliptical distributions

In this paper, we consider a generalization of the modified slash distribution. We define the new family through the quotient between an elliptically distributed random variable and the power of an exponential random variable with parameter equals to 2, both independent. We use the same idea to extend the model for the multivariate case and study general important properties from the resultant family. We perform inference by the method of moments and maximum likelihood. We present a simulation study which indicates satisfactory parameter recovery by using the estimation approaches. Illustrations reveals that it has potential for doing well in real problems.