On the Convergence of the Monte Carlo Maximum Likelihood Method for Latent Variable Models

While much used in practice, latent variable models raise challenging estimation problems due to the intractability of their likelihood. Monte Carlo maximum likelihood (MCML), as proposed by Geyer & Thompson (1992 ), is a simulation-based approach to maximum likelihood approximation applicable to general latent variable models. MCML can be described as an importance sampling method in which the likelihood ratio is approximated by Monte Carlo averages of importance ratios simulated from the complete data model corresponding to an arbitrary value of the unknown parameter. This paper studies the asymptotic (in the number of observations) performance of the MCML method in the case of latent variable models with independent observations. This is in contrast with previous works on the same topic which only considered conditional convergence to the maximum likelihood estimator, for a fixed set of observations. A first important result is that when is fixed, the MCML method can only be consistent if the number of simulations grows exponentially fast with the number of observations. If on the other hand, is obtained from a consistent sequence of estimates of the unknown parameter, then the requirements on the number of simulations are shown to be much weaker.     

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.     

虚拟环境下产品装配设计的交互改进方法

装配设计是产品制造过程中的一个重要环节 .与传统的 CAD软件不同 ,本文论述的交互方式下改进的装配设计方法 ,借助于先进的计算机虚拟技术 ,支持自顶向下的设计思想 .继而构造了产品装配设计的环境     

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周的仿真,求解存货最佳订购数量与最佳再订购点,从而比较出不同存货控制策略的供应链存货总成本及订单满足率的差异。     

Rare and clustered population estimation using the adaptive cluster sampling with some robust measures

The use of robust measures helps to increase the precision of the estimators, especially for the estimation of extremely skewed distributions. In this article, a generalized ratio estimator is proposed by using some robust measures with single auxiliary variable under the adaptive cluster sampling (ACS) design. We have incorporated tri-mean (TM), mid-range (MR) and Hodges-Lehman (HL) of the auxiliary variable as robust measures together with some conventional measures. The expressions of bias and mean square error (MSE) of the proposed generalized ratio estimator are derived. Two types of numerical study have been conducted using artificial clustered population and real data application to examine the performance of the proposed estimator over the usual mean per unit estimator under simple random sampling (SRS). Related results of the simulation study show that the proposed estimators provide better estimation results on both real and artificial population over the competing estimators.     

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.     

Weighted simulated integrated conditional moment tests for parametric conditional distributions of stationary time series processes

In this article, we propose a weighted simulated integrated conditional moment (WSICM) test of the validity of parametric specifications of conditional distribution models for stationary time series data, by combining the weighted integrated conditional moment (ICM) test of Bierens (1984 Bierens, H. J. (1984). Model specification testing of time series regressions. Journal of Econometrics 26:323–353.[Crossref], [Web of Science ®] , [Google Scholar]) for time series regression models with the simulated ICM test of Bierens and Wang (2012 Bierens, H. J., Wang, L. (2012). Integrated conditional moment tests for parametric conditional distributions. Econometric Theory 28:328–362.[Crossref], [Web of Science ®] , [Google Scholar]) of conditional distribution models for cross-section data. To the best of our knowledge, no other consistent test for parametric conditional time series distributions has been proposed yet in the literature, despite consistency claims made by some authors.     

Solving the part families problem in discrete-parts manufacture by simulated annealing

In the production planning and control of discrete-parts manufacture, aggregation of parts into families, on the basis of similarity, is carried out to ease both long-horizon planning and short-horizon scheduling. Additional advantages are related to those of group technology (GT), such as simplifying the flow of parts and tools and reducing both set-up and production costs. The problem of formally forming part families is presented and discussed. Previous work is reviewed and assessed. Two solution approaches, one based on a location model, the other on simulated annealing, are presented and compared along with test results. The location formulation, which results in an integer programming model solved by Lagrangian relaxation, proved capable of producing solutions of excellent quality, but only for relatively small problem instances. In contrast, simulated annealing, which is a general heuristic approach to combinatorial optimization, produced solutions of comparable quality and could handle realistically large problem instances. However, careful design of the simulated annealing algorithm is crucially important. An effective design is presented.     

模拟法庭教学法在“法律基础”课中的应用

在"法律基础"课教学中应用模拟法庭教学法应选择适当案例、把握使用频次、协调模拟法庭教学与课堂系统讲授之间的关系以及与法律法规教学相互配合.模拟法庭教学法在"法律基础"课教学中的应用在培养大学生的综合能力、提高任课教师教学水平与培养大学生的参与意识、竞争意识和团结协作意识等方面都具有非常重要的意义.