蒙特卡罗方法及其在辐射剂量计算中的应用

概述了蒙特卡罗方法的产生与发展,阐述了蒙特卡罗方法的基本特点,最后就蒙特卡罗方法在辐射剂量计算上的应用进行了讨论。     

协同运输管理运行机制研究

协同运输管理是在CPFR基础上发展起来的一种供应链管理方法。它通过降低供应链中的运输成本、缩短商品交付时间和提高准时交货率,实现供应链价值的最大化。协同运输管理的有效实施,需要建立完善的运行机制,包括动力机制、约束机制、实际行为和惩罚机制,并配备相应的软硬件条件。     

进化的精神和生活的道德——鲁迅与契诃夫人生哲学比较论

面对着现实困境的鲁迅与契诃夫都珍视人生的价值,强调人的自我意识与主体力量,但是由于文化传统与历史背景的不同,他们的人生哲学各具特色。鲁迅的人生哲学体现了战斗的进化精神,契诃夫的人生哲学探讨了超脱的生活道德。     

BAYESIAN SUBSET SELECTION AND MODEL AVERAGING USING A CENTRED AND DISPERSED PRIOR FOR THE ERROR VARIANCE

This article proposes a new data‐based prior distribution for the error variance in a Gaussian linear regression model, when the model is used for Bayesian variable selection and model averaging. For a given subset of variables in the model, this prior has a mode that is an unbiased estimator of the error variance but is suitably dispersed to make it uninformative relative to the marginal likelihood. The advantage of this empirical Bayes prior for the error variance is that it is centred and dispersed sensibly and avoids the arbitrary specification of hyperparameters. The performance of the new prior is compared to that of a prior proposed previously in the literature using several simulated examples and two loss functions. For each example our paper also reports results for the model that orthogonalizes the predictor variables before performing subset selection. A real example is also investigated. The empirical results suggest that for both the simulated and real data, the performance of the estimators based on the prior proposed in our article compares favourably with that of a prior used previously in the literature.     

Factor analysis for ranked data with application to a job selection attitude survey

Summary.  Factor analysis is a powerful tool to identify the common characteristics among a set of variables that are measured on a continuous scale. In the context of factor analysis for non-continuous-type data, most applications are restricted to item response data only. We extend the factor model to accommodate ranked data. The Monte Carlo expectation–maximization algorithm is used for parameter estimation at which the E-step is implemented via the Gibbs sampler. An analysis based on both complete and incomplete ranked data (e.g. rank the top q out of k items) is considered. Estimation of the factor scores is also discussed. The method proposed is applied to analyse a set of incomplete ranked data that were obtained from a survey that was carried out in GuangZhou, a major city in mainland China, to investigate the factors affecting people's attitude towards choosing jobs.     

Discrete time modelling of disease incidence time series by using Markov chain Monte Carlo methods

Summary.  A stochastic discrete time version of the susceptible–infected–recovered model for infectious diseases is developed. Disease is transmitted within and between communities when infected and susceptible individuals interact. Markov chain Monte Carlo methods are used to make inference about these unobserved populations and the unknown parameters of interest. The algorithm is designed specifically for modelling time series of reported measles cases although it can be adapted for other infectious diseases with permanent immunity. The application to observed measles incidence series motivates extensions to incorporate age structure as well as spatial epidemic coupling between communities.     

HEAVY-TAILED-DISTRIBUTED THRESHOLD STOCHASTIC VOLATILITY MODELS IN FINANCIAL TIME SERIES

To capture mean and variance asymmetries and time‐varying volatility in financial time series, we generalize the threshold stochastic volatility (THSV) model and incorporate a heavy‐tailed error distribution. Unlike existing stochastic volatility models, this model simultaneously accounts for uncertainty in the unobserved threshold value and in the time‐delay parameter. Self‐exciting and exogenous threshold variables are considered to investigate the impact of a number of market news variables on volatility changes. Adopting a Bayesian approach, we use Markov chain Monte Carlo methods to estimate all unknown parameters and latent variables. A simulation experiment demonstrates good estimation performance for reasonable sample sizes. In a study of two international financial market indices, we consider two variants of the generalized THSV model, with US market news as the threshold variable. Finally, we compare models using Bayesian forecasting in a value‐at‐risk (VaR) study. The results show that our proposed model can generate more accurate VaR forecasts than can standard models.     

论新文学思潮与新文学流派的动态关系

新文学思潮与新文学流派之间因果莫辨、源流纠缠的动态关系 ,充分证明了近百年来新文学思潮与新文学流派本身非线性、非对称的生存状态。所谓非线性与非对称 ,其实质就是不稳定性和不成熟性 ,它们直接制约着新文学近百年发展进程 ,使之在历时态和共时态上始终呈现出某种程度的不良生存状态和发展趋势。     

基于知识链的管理

论述了知识链的有关概念和特点,通过分析以往的知识链模型,提出了改进的知识链模型;对知识链管理的机制进行了分析;从控制论的角度,对知识链内部知识成长的机制进行了分析,并指出知识链内部知识转移的影响因素,为知识管理的发展提供了一定的理论依据。     

Improving flexibility and efficiency by adding parallelism to genetic algorithms

In this paper we develop a study on several types of parallel genetic algorithms (PGAs). Our motivation is to bring some uniformity to the proposal, comparison, and knowledge exchange among the traditionally opposite kinds of serial and parallel GAs. We comparatively analyze the properties of steady-state, generational, and cellular genetic algorithms. Afterwards, this study is extended to consider a distributed model consisting in a ring of GA islands. The analyzed features are the time complexity, selection pressure, schema processing rates, efficacy in finding an optimum, efficiency, speedup, and resistance to scalability. Besides that, we briefly discuss how the migration policy affects the search. Also, some of the search properties of cellular GAs are investigated. The selected benchmark is a representative subset of problems containing real world difficulties. We often conclude that parallel GAs are numerically better and faster than equivalent sequential GAs. Our aim is to shed some light on the advantages and drawbacks of various sequential and parallel GAs to help researchers using them in the very diverse application fields of the evolutionary computation.