Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines

We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A facility reliability problem: Formulation,properties, and algorithm

Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于条件熵的不完备信息系统属性约简算法

在相容关系下定义了三种不完备条件熵——H′条件熵、E′条件熵和I′条件熵,并对它们的性质进行了分析比较,研究发现,H′条件熵和I′条件熵不适用于相容关系下信息观点的约简。利用E′条件熵刻画信息系统中属性的相对重要性,设计了一种新的基于信息论观点的启发式约简算法,它统一了完备信息系统与非完备信息系统中的约简方法。通过实例说明,该算法能得到决策表的相对约简。     

于综合大学教师教育专业课程设置的分析

综合大学举办教师教育是世界教育事业发展的趋势。目前我国综合大学在教师教育专业课程设置方面存在着诸多弊端。改革综合大学的教育专业课程设置成为当务之急。针对综合大学教育专业课程设置中的问题,本文提出了一些较为可行的改革对策和建议,以期优化综合大学教育专业课程的设置。     

地理信息系统专业实践教学体系研究

实践教学是GIS专业教学至关重要的环节。结合GIS知识体系结构、专业特点和社会需求,讨论了GIS专业实践教学体系的基本框架及其依托。     

建设社会主义核心价值体系大力弘扬时代精神

社会主义核心价值体系是社会主义意识形态的本质体现。马克思主义指导思想是社会主义核心价值体系的旗帜与灵魂。社会主义核心价值体系是中国共产党领导人民建设中国特色社会主义的共同价值追求;以爱国主义为核心的民族精神和以改革创新为核心的时代精神是社会主义核心价值体系的精髓;弘扬以改革创新为核心的时代精神是建设社会主义核心价值体系的根本途径;大力弘扬以改革创新为核心的时代精神是实现中华民族伟大复兴的强大动力。     

基于层间嵌入式多级支持向量机的特征选择

针对多故障样本一次性映射之后分类不理想,研究了多级层次式支持向量机,应用UCI数据仿真,结果表明该方法缩短了训练时间、提升了测试准确率、改善了样本的可分类性。由于误差积累,在此基础上,提出了层间嵌入式多级支持向量机,采用Abalone数据仿真,结果表明分类精度有所提高并减少了分类步骤。结合ReliefF算法,对制导设备的故障特征参数进行了选择。     

基于HLA的维修保障仿真系统设计研究

针对作战单元维修保障能力评估的需求,提出建立基于HLA的维修保障仿真分析平台。在分析维修保障系统构成和运行过程的基础上,阐述了仿真联邦的设计思想和构建方法,并进行了系统设计。根据实际系统的运行逻辑开发了联邦剧情,基于HLA的开发和执行过程模型构建了联邦系统框架,设计了联邦对象模型,并指出了仿真实现的关键技术所在。     

基于数字混沌序列的变换域通信系统基函数产生方法

提出了一种新的变换域通信系统基函数生成方法——Logistic数字混沌映射法,并对基于Logistic混沌序列基函数的特性进行仿真,同时将其与基于m序列的基函数进行对比分析。仿真结果表明,基于Logistic混沌序列基函数具有较好的伪随机特性、多址特性,且函数数量巨大。     

便携式电磁辐射检测仪的研制与测试

研制一款便携式电磁辐射检测仪,详细阐述了其内部结构及部分电路组成,该检测仪采用单片机处理采集信号,方便实用。通过大量实验对其进行测试,结果表明,液晶显示屏上显示的电磁辐射电场强度的测量精度在±2.5 dB之内,达到了设计标准,能够对电磁环境进行有效监测。