基于遗传算法的有柔性路径的动态调度问题研究

建立了有柔性路径的FMS动态调度问题的模型．采用离线重调度的方法，提出一种结合离线重调度两种生成调度方式的方法来阐述FMS的有柔性路径动态调度问题．最后给出了该问题的遗传算法解决方法和计算示例．     

基于定位辅助按需拓扑维护的超宽带自组网路由算法

提出了一种基于定位辅助按需拓扑维护的超宽带自组网路由算法,该算法利用超宽带技术精确定位信息所获得的网络拓扑信息和路由信息进行分组转发,路由维护阶段在定位信息辅助下采用按需方式进行断链路由的修复和拓扑维护,通过基于位置信息的按需路由发现和限制路由查找范围,以及定位信息和网络拓扑信息的及时更新,在降低协议开销的同时保证了算法的有效性。仿真表明,该算法在分组丢失率、平均端到端时延和路由附加开销等方面具有良好性能,其优良的分布式控制特征能适应超宽带自组网的动态环境。     

Improving Convergence of the HastingsMetropolis Algorithm with an Adaptive Proposal

The HastingsMetropolis algorithm is a general MCMC method for sampling from a density known up to a constant. Geometric convergence of this algorithm has been proved under conditions relative to the instrumental (or proposal) distribution. We present an inhomogeneous HastingsMetropolis algorithm for which the proposal density approximates the target density, as the number of iterations increases. The proposal density at the n th step is a non-parametric estimate of the density of the algorithm, and uses an increasing number of i.i.d. copies of the Markov chain. The resulting algorithm converges (in n ) geometrically faster than a HastingsMetropolis algorithm with any fixed proposal distribution. The case of a strictly positive density with compact support is presented first, then an extension to more general densities is given. We conclude by proposing a practical way of implementation for the algorithm, and illustrate it over simulated examples.     

Estimating rating transition probabilites with missing data

In this article we provide a rigorous treatment of one of the central statistical issues of credit risk management. GivenK-1 rating categories, the rating of a corporate bond over a certain horizon may either stay the same or change to one of the remainingK-2 categories; in addition, it is usually the case that the rating of some bonds is withdrawn during the time interval considered in the analysis. When estimating transition probabilities, we have thus to consider aK-th category, called withdrawal, which contains (partially) missing data. We show how maximum likelihood estimation can be performed in this setup; whereas in discrete time our solution gives rigorous support to a solution often used in applications, in continuous time the maximum likelihood estimator of the transition matrix computed by means of the EM algorithm represents a significant improvement over existing methods.     

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

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

民主与法治：财政支出监督中的问题与对策

财政支出的监督是宪法和法律规定的一项重要的法律制度，监督是财政得以正确实施的保护伞。文章分析了当前我国财政监督法律制度的缺失，提出相应的对策，阐明了财政支出监督的重要性和紧迫性。     

网络人肉搜索与侵犯个人隐私权问题研究

通过对一些有关于人肉搜索的典型案例分析的基础上，揭示了人肉搜索的运行机制。人肉搜索是一种特殊的信息搜索方式，同时也是一种新的信息生产方式。正确使用的话可以弥补机器搜索引擎的不足，但如果被滥用的话，则可能造成对个人隐私权的侵犯。     

Optimal scaling of Metropolis algorithms: Heading toward general target distributions

The authors provide an overview of optimal scaling results for the Metropolis algorithm with Gaussian proposal distribution. They address in more depth the case of high‐dimensional target distributions formed of independent, but not identically distributed components. They attempt to give an intuitive explanation as to why the well‐known optimal acceptance rate of 0.234 is not always suitable. They show how to find the asymptotically optimal acceptance rate when needed, and they explain why it is sometimes necessary to turn to inhomogeneous proposal distributions. Their results are illustrated with a simple example.     

A bayesian estimator for the dependence function of a bivariate extreme‐value distribution

Any continuous bivariate distribution can be expressed in terms of its margins and a unique copula. In the case of extreme‐value distributions, the copula is characterized by a dependence function while each margin depends on three parameters. The authors propose a Bayesian approach for the simultaneous estimation of the dependence function and the parameters defining the margins. They describe a nonparametric model for the dependence function and a reversible jump Markov chain Monte Carlo algorithm for the computation of the Bayesian estimator. They show through simulations that their estimator has a smaller mean integrated squared error than classical nonparametric estimators, especially in small samples. They illustrate their approach on a hydrological data set.