谈英语听力中的数字

在听力中,迅速准确地对数字作出反应是十分重要的一项技能。大量事实表明,扎实的语言基本功及丰富的 背景知识,是应付听力中数字的最佳对策。     

The fibonacci distribution revisited

The Fibonacci distributions of Shane (1973) are extended to a family of power series distributions having the higher order Fibonacci numbers as coefficients. The distributions possess a waiting time interpretation that generalizes the geometric distribution and, in a special case, solves a waiting time problem in genetics Hazard function and modal behavior is examined In particular, the distributions can have an unlimited number of modes     

Conditional and Restricted Pareto Sampling: Two New Methods for Unequal Probability Sampling

Abstract. Two new unequal probability sampling methods are introduced: conditional and restricted Pareto sampling. The advantage of conditional Pareto sampling compared with standard Pareto sampling, introduced by Rosén (J. Statist. Plann. Inference, 62, 1997, 135, 159), is that the factual inclusion probabilities better agree with the desired ones. Restricted Pareto sampling, preferably conditioned or adjusted, is able to handle cases where there are several restrictions on the sample and is an alternative to the recent cube method for balanced sampling introduced by Deville and Tillé (Biometrika, 91, 2004, 893). The new sampling designs have high entropy and the involved random numbers can be seen as permanent random numbers.     

C334. On the neutron and proton masses: a numerological case study

The intercomponent rank test suggested by Thompson (1991a) for the bivariate two sample problem is compared with the intracomponent rank test discussed by Puri and Sen (1971) and Hettmansperger (1984) and with the Hotelling T ² test. Asymptotic relative efficiencies are discussed and the results of a simulation study are presented. Power studies show that for small sample sizes and small Type 1 error rates, say n = 5 and α = .01, the intercomponent rank test of Thompson (1991a) is somewhat liberal and the intracomponent test is quite conservative. For larger sample sizes and larger Type 1 error rates, both rank tests have improved properties under the null hypothesis. In almost all simulated cases, the intercomponent test is more powerful. In light of these studies it is suggested that the intercomponent rank test of Thompson (1991a), which has the added advantage of being easily computed with standard statistical software, is a strong competitor to the intracomponent rank test.     

Evaluation of Beta Generation Algorithms

In this article, we discuss the maximum likelihood estimates (MLEs) for the exponential and Weibull distributions by considering progressive Type-I interval censored data. For exponential distribution, the explicit expression of MLE of failure rate cannot be obtained when the intervals are not equal in length. The direct application of some numerical algorithms, such as the Newton–Raphson algorithm, is non-ideal because of the cumbersome second derivative. We apply some equivalent quantities to obtain the MLE of failure rate of exponential distribution. Based on the equivalent quantities and the Weibull-to-exponential transformation technique, we propose a new algorithm to obtain the MLEs for the parameters of progressive Type-I interval Weibull data. An example reanalysis and some simulation studies are carried out to illustrate the performance of the estimations using the new algorithm.     

Fast Random Number Generation Using 128-Bit Multimedia Extension Registers on Pentium Class Machines

In this article, it is shown how 128-bit SSE2 multimedia extension registers, present in Pentium IV class 32-bit processors, may be used to generate random numbers at several times greater speed then when regular general purpose registers are used. In particular, a 128-bit algorithm is presented for the Marsaglia MWC1616 generator from the DIEHARD battery of random number generator tests, and its performance is compared to that of the conventional approach.     

Two Birthday Problems

ABSTRACT

This article focuses on two birthday problems which naturally follow from the most common birthday problems taught in statistics courses. The solutions to these new problems provide a good illustration of several combinatorial techniques.     

The strong law of large numbers and the Shannon-McMillan theorem for the mth-order nonhomogeneous Markov chains indexed by an m rooted Cayley tree

ABSTRACT

In this article, we studied the strong law of large numbers(LLN) and Shannon-McMillan theorem for an mth-order nonhomogeneous Markov chain indexed by an m- rooted Cayley tree. This article generalized the relative results of level mth-order nonhomogeneous Markov chains indexed by an m- rooted Cayley tree.     

Convergence properties for weighted sums of NSD random variables

Abstract

Let {X_n, n ? 1} be a sequence of negatively superadditive dependent (NSD, in short) random variables and {b_ni, 1 ? i ? n, n ? 1} be an array of real numbers. In this article, we study the strong law of large numbers for the weighted sums ∑ⁿ_{i = 1}b_niX_i without identical distribution. We present some sufficient conditions to prove the strong law of large numbers. As an application, the Marcinkiewicz-Zygmund strong law of large numbers for NSD random variables is obtained. In addition, the complete convergence for the weighted sums of NSD random variables is established. Our results generalize and improve some corresponding ones for independent random variables and negatively associated random variables.     

Third-Order Translog Utility Functions

This article examines the advantages of estimating a third-order rather than a second-order translog utility function in a theoretical and empirical context. It is demonstrated that the rigor of tests for appropriate functional form is increased by increasing the order of approximation. An empirical example demonstrates that a second-order approximation can lead to inconsistent parameter estimates, whereas the third-order translog allows for better modeling of the preference structure and more consistent estimates for policy decisions.