An application of a minimax Bayes rule and shrinkage estimators to the portofolio selection problem under the Bayesian approach

This paper shows that a minimax Bayes rule and shrinkage estimators can be effectively applied to portfolio selection under the Bayesian approach. Specifically, it is shown that the portfolio selection problem can result in a statistical decision problem in some situations. Following that, we present a method for solving a problem involved in portfolio selection under the Bayesian approach.     

在划分多种专业性作业条件下工程施工组织优化理论研究及应用

本文探讨了在考虑作业专业性条件下，工程施工组织优化的工作程序、工作目标与工作原则，在此基础上给出了一个应用实例以证明上述理论的有效性。     

Estimation of Polygons and Areas

Abstract.  In forestry the problem of estimating areas is central. This paper addresses area estimation through fitting of a polygon to observed coordinate data. Coordinates of corners and points along the sides of a simple closed polygon are measured with independent random errors. This paper focuses on procedures to adjust the coordinates for estimation of the polygon and its area. Different new techniques that consider different amounts of prior information are described and compared. The different techniques use restricted least squares, maximum likelihood and the expectation maximization algorithm. In a simulation study it is shown that the root mean square errors of the estimates are decreased when coordinates are adjusted before estimation. Minor further improvement is achieved by using prior information about the order and the distribution of the points along the sides of the polygon. This paper has its origin in forestry but there are also other applications.     

Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property

Abstract.  The Andersson–Madigan–Perlman (AMP) Markov property is a recently proposed alternative Markov property (AMP) for chain graphs. In the case of continuous variables with a joint multivariate Gaussian distribution, it is the AMP rather than the earlier introduced Lauritzen–Wermuth–Frydenberg Markov property that is coherent with data-generation by natural block-recursive regressions. In this paper, we show that maximum likelihood estimates in Gaussian AMP chain graph models can be obtained by combining generalized least squares and iterative proportional fitting to an iterative algorithm. In an appendix, we give useful convergence results for iterative partial maximization algorithms that apply in particular to the described algorithm.     

Analysis of Revenue Maximization Under Two Movie‐Screening Policies

A few weeks before the start of a major season, movie distributors arrange a private screening of the movies to be released during that season for exhibitors and, subsequently, solicit bids for these movies (from exhibitors). Since the number of such solicitations far exceeds the number of movies that can be feasibly screened at a multiplex (i.e., a theater with multiple screens), the problem of interest for an exhibitor is that of choosing a subset of movies for which to submit bids to the distributors. We consider the problem of the selection and screening of movies for a multiplex to maximize the exhibitor's cumulative revenue over a fixed planning horizon. The release times of the movies that can potentially be selected during the planning horizon are known a priori. If selected for screening, a movie must be scheduled through its obligatory period, after which its run may or may not be extended. The problem involves two primary decisions: (i) the selection of a subset of movies for screening from those that can potentially be screened during the planning horizon and (ii) the determination of the duration of screening for the selected movies. We investigate two basic and popular screening policies: preempt‐resume and non‐preempt. In the preempt‐resume policy, the screening of a movie can be preempted and resumed in its post‐obligatory period. In the non‐preempt policy, a movie is screened continuously from its release time until the time it is permanently withdrawn from the multiplex. We show that optimizing under the preempt‐resume policy is strongly NP‐hard while the problem under the non‐preempt policy is polynomially solvable. We develop efficient algorithms for the problem under both screening policies and show that the revenue obtained from the preempt‐resume policy can be significantly higher as compared with that from the non‐preempt policy. Our work provides managers of multiplexes with valuable insights into the selection and screening of movies and offers an easy‐to‐use computational tool to compare the revenues obtainable from adopting these popular policies.     

A Bayesian Meta-Modeling Approach for Gaussian Stochastic Process Models Using a Non Informative Prior

In this article, an efficient Bayesian meta-modeling approach is proposed for Gaussian stochastic process models in computer experiments. Different prior densities and particularly, a non informative hyper prior have been employed on the parameters involved in the correlation matrix. And the estimation of related parameters is obtained by the expectation-maximization algorithm. Compared with the recent work of Li and Sudjianto (2005 Li , R. , Sudjianto , A. ( 2005 ). Analysis of computer experiments using penalized likelihood in Kriging models . Technometrics 47 : 111 – 120 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]), the proposed approach is not only of higher prediction accuracy but also of lower computational cost, due to the utilization of the non informative prior and the absence of tuning parameters. Experimental results demonstrate that our approach yields state-of-the-art performance.     

Coherent Frequentism: A Decision Theory Based on Confidence Sets

By representing fair betting odds according to one or more pairs of confidence set estimators, dual parameter distributions called confidence posteriors secure the coherence of actions without any prior distribution. This theory reduces to the maximization of expected utility when the pair of posteriors is induced by an exact or approximate confidence set estimator or when a reduction rule is applied to the pair. Unlike the p-value, the confidence posterior probability of an interval hypothesis is suitable as an estimator of the indicator of hypothesis truth since it converges to 1 if the hypothesis is true or to 0 otherwise.     

Parameter estimation of nonlinear mixed-effects models using first-order conditional linearization and the EM algorithm

Nonlinear mixed-effects (NLME) models are flexible enough to handle repeated-measures data from various disciplines. In this article, we propose both maximum-likelihood and restricted maximum-likelihood estimations of NLME models using first-order conditional expansion (FOCE) and the expectation–maximization (EM) algorithm. The FOCE-EM algorithm implemented in the ForStat procedure SNLME is compared with the Lindstrom and Bates (LB) algorithm implemented in both the SAS macro NLINMIX and the S-Plus/R function nlme in terms of computational efficiency and statistical properties. Two realworld data sets an orange tree data set and a Chinese fir (Cunninghamia lanceolata) data set, and a simulated data set were used for evaluation. FOCE-EM converged for all mixed models derived from the base model in the two realworld cases, while LB did not, especially for the models in which random effects are simultaneously considered in several parameters to account for between-subject variation. However, both algorithms had identical estimated parameters and fit statistics for the converged models. We therefore recommend using FOCE-EM in NLME models, particularly when convergence is a concern in model selection.     

An efficient algorithm for finding the M most probable configurationsin probabilistic expert systems

A probabilistic expert system provides a graphical representation of a joint probability distribution which enables local computations of probabilities. Dawid (1992) provided a flow- propagation algorithm for finding the most probable configuration of the joint distribution in such a system. This paper analyses that algorithm in detail, and shows how it can be combined with a clever partitioning scheme to formulate an efficient method for finding the M most probable configurations. The algorithm is a divide and conquer technique, that iteratively identifies the M most probable configurations.     

我国企业财务管理的目标

通过系统论证,提出我国企业财务管理目标是业主财富最大化而非利润最大化。