Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011     

Replicated batch means for steady‐state simulations

This paper studies a new steady‐state simulation output analysis method called replicated batch means in which a small number of replications are conducted and the observations in these replications are grouped into batches. This paper also introduces and compares methods for selecting the initial state of each replication. More specifically, we show that confidence intervals constructed by the replicated batch means method are valid for large batch sizes and derive expressions for the expected values and variances of the steady‐state mean and variance estimators for stationary processes and large sample sizes. We then use these expressions, analytical examples, and numerical experiments to compare the replicated batch means method with the standard batch means and multiple replications methods. The numerical results, which are obtained from an AR(1) process and a small, nearly‐decomposable Markov chain, show that the multiple replications method often gives confidence intervals with poorer coverage than the standard and replicated batch means methods and that the replicated batch means method, implemented with good choices of initialization method and number of replications, provides confidence interval coverages that range from being comparable with to being noticeably better than coverages obtained by the standard batch means method. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

论军队院校科研管理资源配置机制建设

分析了目前军队院校科研管理资源配置机制中存在的问题及原因,提出了军队院校建立科学高效优化合理的科研管理资源配置机制的基本思路:建立基于学科的资源优化配置机制;建立和完善资源开放平台和共享机制;建立尊重和适应市场规律、科学合理的人才资源配置机制。     

基于改进半监督FCM聚类的复合材料超声检测脱粘缺陷识别

针对径向基（RBF）神经网络在进行超声检测脱粘缺陷识别时存在参数选择不确定、网络结构鲁棒性差等问题,提出一种改进的自适应半监督模糊C均值聚类（FCM）的RBF神经网络的方法,将kw近邻估计法和半监督模糊C均值聚类方法相结合,改进了隶属度函数,自适应确定聚类数目。将改进的RBF神经网络应用于超声检测脱粘缺陷识别,实验结果表明：与传统RBF神经网络相比,本方法减弱了孤立样本对网络结构的影响,增强了网络结构的鲁棒性,提高了脱粘缺陷识别的准确率,是一种较好的超声检测脱粘缺陷识别分类方法．     

Combining standardized time series area and Cramér–von Mises variance estimators

We propose three related estimators for the variance parameter arising from a steady‐state simulation process. All are based on combinations of standardized‐time‐series area and Cramér–von Mises (CvM) estimators. The first is a straightforward linear combination of the area and CvM estimators; the second resembles a Durbin–Watson statistic; and the third is related to a jackknifed version of the first. The main derivations yield analytical expressions for the bias and variance of the new estimators. These results show that the new estimators often perform better than the pure area, pure CvM, and benchmark nonoverlapping and overlapping batch means estimators, especially in terms of variance and mean squared error. We also give exact and Monte Carlo examples illustrating our findings.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

论公安现役本科院校基础课改革

教育改革应当以课程改革为先导。根据培养目标的内在要求,注重师资队伍建设,发挥教师的主体作用,积极参与基础课程改革,落实基础课职称岗位制度。     

计算机导论课的教学研究与实践

本文在分析课程改革的基础上 ,结合计算机基础教学在提高教学质量上所起的重要作用 ,对计算机导论课在近两年来所采取的教学改革手段和实践方法进行了详细论述     

Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1

A queueing system characterized by the discrete batch Markovian arrival process (D-BMAP) and a probability of phase type distribution for the service time is one that arises frequently in the area of telecommunications. Under this arrival process and service time distribution we derive the waiting time distribution for three queue disciplines: first in first out (FIFO), last in first out (LIFO), and service in random order (SIRO). We also outline efficient algorithmic procedures for computing the waiting time distributions under each discipline. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 559–576, 1997     

校园文化管理效能的探索与思考

校园文化既是一种文化现象,又是一种新的学校管理模式,必须充分发挥校园文化在学校管理中的潜在性、规范性、深远性和持久性功能。加强组织领导,构建校园文化建设工作体系,这是加强校园文化建设,发挥校园文化管理效能的前提条件;运用现代科学技术,夯实校园文化载体,这是加强校园文化建设,发挥校园文化管理效能不可缺少的技术手段;重视校园物质文化建设,用物质文化陶冶人,这是加强校园文化建设,发挥校园文化管理效能的初级目标;重视校园制度文化建设,用制度文化规范人,这是加强校园文化建设,发挥校园文化管理效能的中级目标;重视校园思想文化建设,用思想文化凝聚人,这是加强校园文化建设,发挥校园文化管理效能的最高目标。     

消防行政强制研究

汇总分析了消防行政强制的特征和类型,研究了消防监督工作中常见的行政强制措施和行政强制执行的一般程序,探讨了有效应用消防行政强制这一手段的基本方法和重大意义。