Examples of the use of an equivalence theorem in constructing optimum experimental designs for random-effects nonlinear regression models

The problem considered is that of finding an optimum measurement schedule to estimate population parameters in a nonlinear model when the patient effects are random. The paper presents examples of the use of sensitivity functions, derived from the General Equivalence Theorem for D-optimality, in the construction of optimum population designs for such schedules. With independent observations, the theorem applies to the potential inclusion of a single observation. However, in population designs the observations are correlated and the theorem applies to the inclusion of an additional measurement schedule. In one example, three groups of patients of differing size are subject to distinct schedules. Numerical, as opposed to analytical, calculation of the sensitivity function is advocated. The required covariances of the observations are found by simulation.     

A study of simulated annealing and a revised cascade algorithm for image reconstruction

We describe an image reconstruction problem and the computational difficulties arising in determining the maximum a posteriori (MAP) estimate. Two algorithms for tackling the problem, iterated conditional modes (ICM) and simulated annealing, are usually applied pixel by pixel. The performance of this strategy can be poor, particularly for heavily degraded images, and as a potential improvement Jubb and Jennison (1991) suggest the cascade algorithm in which ICM is initially applied to coarser images formed by blocking squares of pixels. In this paper we attempt to resolve certain criticisms of cascade and present a version of the algorithm extended in definition and implementation. As an illustration we apply our new method to a synthetic aperture radar (SAR) image. We also carry out a study of simulated annealing, with and without cascade, applied to a more tractable minimization problem from which we gain insight into the properties of cascade algorithms.     

A LOTTO SYSTEMS PROBLEM

A Lotto Systems bet allows the player to nominate n numbers from which (s)he believes the winning six numbers will be drawn, and to bet on all combinations of six of these n numbers. Assume that the winning six numbers come from the nominated n. How many combinations must be entered to guarantee that one combination will include at least five of the winning six numbers? The problem is generalized in this paper, and the method of simulated annealing is used to find solutions for various situations. The case where two supplementary numbers are drawn after the initial six winning numbers is also considered.     

基于需求不确定性的供应链库存控制研究

通过建立需求不确定性环境下供应链成员的独立存货成本模型,运用模拟退火法对该模型进行52周的仿真,求解存货最佳订购数量与最佳再订购点,从而比较出不同存货控制策略的供应链存货总成本及订单满足率的差异。     

Testing the Equality of Two Exponential Distributions

This paper proposes an overlapping-based test statistic for testing the equality of two exponential distributions with different scale and location parameters. The test statistic is defined as the maximum likelihood estimate of the Weitzman's overlapping coefficient, which estimates the agreement of two densities. The proposed test statistic is derived in closed form. Simulated critical points are generated for the proposed test statistic for various sample sizes and significance levels via Monte Carlo Simulations. Statistical powers of the proposed test are computed via simulation studies and compared to those of the existing Log likelihood ratio test.     

Estimation and Properties of a Time-Varying EGARCH(1,1) in Mean Model

Time-varying GARCH-M models are commonly employed in econometrics and financial economics. Yet the recursive nature of the conditional variance makes likelihood analysis of these models computationally infeasible. This article outlines the issues and suggests to employ a Markov chain Monte Carlo algorithm which allows the calculation of a classical estimator via the simulated EM algorithm or a simulated Bayesian solution in only O(T) computational operations, where T is the sample size. Furthermore, the theoretical dynamic properties of a time-varying-parameter EGARCH(1,1)-M are derived. We discuss them and apply the suggested Bayesian estimation to three major stock markets.     

Two-dimensional generalisations of dynamic programming for image analysis

Dynamic programming (DP) is a fast, elegant method for solving many one-dimensional optimisation problems but, unfortunately, most problems in image analysis, such as restoration and warping, are two-dimensional. We consider three generalisations of DP. The first is iterated dynamic programming (IDP), where DP is used to recursively solve each of a sequence of one-dimensional problems in turn, to find a local optimum. A second algorithm is an empirical, stochastic optimiser, which is implemented by adding progressively less noise to IDP. The final approach replaces DP by a more computationally intensive Forward-Backward Gibbs Sampler, and uses a simulated annealing cooling schedule. Results are compared with existing pixel-by-pixel methods of iterated conditional modes (ICM) and simulated annealing in two applications: to restore a synthetic aperture radar (SAR) image, and to warp a pulsed-field electrophoresis gel into alignment with a reference image. We find that IDP and its stochastic variant outperform the remaining algorithms.     

A simulation study of the Bennett test and Miller test for coefficients of variation

In the article, properties of the Bennett test and Miller test are analyzed. Assuming that the sample size is the same for each sample and considering the null hypothesis that the coefficients of variation for k populations are equal against the hypothesis that k ? 1 coefficients of variation are the same but differ from the coefficient of variation for the kth population, the empirical significance level and the power of the test are studied. Moreover, the dependence of the test statistic and the power of the test on the ratio of coefficients of variation are considered. The analyses are performed on simulated data.     

Virtual Worlds and Social Work Education

ABSTRACT

The introduction of computerised virtual worlds in the early twenty-first century was considered to be an innovation that would be widely used in higher education. There are a number of examples of virtual worlds used for higher education in medicine, nursing, and allied health, including examples in social work. The aim of this article is to explore the potential value of virtual-world technology to enhance the student learning experience for social work education in interpersonal communication skills in a virtual health centre. Findings of a study of Australian undergraduate social work students who engaged in a role play in a virtual health centre for skill development in interpersonal communication are presented. The study findings highlight issues for social work educators to consider when deciding whether or not to use virtual-world technology in social work education, and when designing further research on similar innovations.     

Expert system for production manager recruitment

Abstract

Production manager recruitment poses a three-fold problem: finding a broad-knowtedged recruiter; obtaining an objective evaluation of the candidate; and the ever present risk of accepting unqualified candidates and rejecting qualified candidates A prototype expert system (ES) was developed for the purpose of testing the technical potential for computer assisted recruiting. The ES embodied a three-fold strategy: probing the candidate's past; asking questions from a business case study; and from several human-behaviour, video-taped episodes. The candidate's responses are graded, rated for competency (excellent, good, fair, poor), and weighted. A hiring action is recommended based on the composite weight. The prototype effectively demonstrated thit potential for expert system-conducted recruiting.