基于重大偏差标准的软件项目工作量管理方法研究

为有效管理软件项目工作量,本文研究了一个基于重大偏差标准的软件项目工作量管理模型。该模型利用过程控制的原理和数理统计的方法,提出依据重大偏差标准和风险储备时间对软件项目进行动态控制,并介绍了风险储备时间与重大偏差标准的定量设置方法。该模型涵盖了从风险储备时间的确定,到重大偏差标准的提出,再根据风险储备时间和重大偏差标准进行监控的整个过程。为提高软件项目管理精度,保证项目在可接受的偏差范围内顺利完成打下坚实的基础。     

Fisher's Information for Discretely Sampled Lévy Processes

This paper studies the asymptotic behavior of Fisher's information for a Lévy process discretely sampled at an increasing frequency. As a result, we derive the optimal rates of convergence of efficient estimators of the different parameters of the process and show that the rates are often nonstandard and differ across parameters. We also show that it is possible to distinguish the continuous part of the process from its jumps part, and even different types of jumps from one another.     

Optimal Bandwidth Selection in Heteroskedasticity–Autocorrelation Robust Testing

This paper considers studentized tests in time series regressions with nonparametrically autocorrelated errors. The studentization is based on robust standard errors with truncation lag M=bT for some constant b∈(0, 1] and sample size T. It is shown that the nonstandard fixed‐b limit distributions of such nonparametrically studentized tests provide more accurate approximations to the finite sample distributions than the standard small‐b limit distribution. We further show that, for typical economic time series, the optimal bandwidth that minimizes a weighted average of type I and type II errors is larger by an order of magnitude than the bandwidth that minimizes the asymptotic mean squared error of the corresponding long‐run variance estimator. A plug‐in procedure for implementing this optimal bandwidth is suggested and simulations (not reported here) confirm that the new plug‐in procedure works well in finite samples.     

Bimodality based on the generalized skew-normal distribution

This paper focuses on the development of a new extension of the generalized skew-normal distribution introduced in Gómez et al. [Generalized skew-normal models: properties and inference. Statistics. 2006;40(6):495–505]. To produce the generalization a new parameter is introduced, the signal of which has the flexibility of yielding unimodal as well as bimodal distributions. We study its properties, derive a stochastic representation and state some expressions that facilitate moments derivation. Maximum likelihood is implemented via the EM algorithm which is based on the stochastic representation derived. We show that the Fisher information matrix is singular and discuss ways of getting round this problem. An illustration using real data reveals that the model can capture well special data features such as bimodality and asymmetry.     

Performance of coefficient of variation estimators in ranked set sampling

In this paper, we propose and evaluate the performance of different parametric and nonparametric estimators for the population coefficient of variation considering Ranked Set Sampling (RSS) under normal distribution. The performance of the proposed estimators was assessed based on the bias and relative efficiency provided by a Monte Carlo simulation study. An application in anthropometric measurements data from a human population is also presented. The results showed that the proposed estimators via RSS present an expressively lower mean squared error when compared to the usual estimator, obtained via Simple Random Sampling. Also, it was verified the superiority of the maximum likelihood estimator, given the necessary assumptions of normality and perfect ranking are met.     

The Burr XII System of densities: properties,regression model and applications

We introduce a new class of distributions called the Burr XII system of densities with two extra positive parameters. We provide a comprehensive treatment of some of its mathematical properties. We estimate the model parameters by maximum likelihood. We assess the performance of the maximum likelihood estimators in terms of biases and mean squared errors by means of a simulation study. We also introduce a new family of regression models based on this system of densities. The usefulness of the proposed models is illustrated by means of three real data sets.     

Parallelizing computation of expected values in recombinant binomial trees

Recombinant binomial trees are binary trees where each non-leaf node has two child nodes, but adjacent parents share a common child node. Such trees arise in option pricing in finance. For example, an option can be valued by evaluating the expected payoffs with respect to random paths in the tree. The cost to exactly compute expected values over random paths grows exponentially in the depth of the tree, rendering a serial computation of one branch at a time impractical. We propose a parallelization method that transforms the calculation of the expected value into an embarrassingly parallel problem by mapping the branches of the binomial tree to the processes in a multiprocessor computing environment. We also discuss a parallel Monte Carlo method and verify the convergence and the variance reduction behavior by simulation study. Performance results from R and Julia implementations are compared on a distributed computing cluster.