内网安全存取的双向验证

考察内部网络数据的安全传输与访问需要,通过对数据资源分布粒度和操作权限多重性的 分析,给出资源的操作模型,并提出双向验证的安全控制策略。最后,讨论了如何提高控制效率的措施。     

雷达辐射源识别的算法研究

针对现有雷达辐射源识别算法的不足,探索雷达辐射源数据库识别的新算法。运用属性测度理论建立了雷达辐射源属性识别模型,结合距离算法、灰关联算法和神经网络样本训练思想,设计出基于属性测度模型的雷达辐射源属性识别算法。通过仿真验证,该算法兼具识别准确度高和识别速度快优点,实用性较强。     

杂合数据的粗糙集属性约简方法

针对决策表中属性取值为杂合数据的情况,提出了基于粗糙集理论的属性约简算法.首先给出了对象间在杂合数据下的相似度计算定义.为了获取合理的对象集合的软划分,给出了阈值计算的最优化模型,并基于粗糙集的上、下近似的概念,得到对象集合在条件属性下的上、下近似的覆盖划分.之后,通过各对象基于条件属性和决策属性的上、下近似下的分布矩阵描述,利用最大分布矩阵,直观地得到两种不同观点下的约简结果.实验结果表明了本算法的合理和有效性.     

高层建筑消防供电可靠性探析

根据目前乌鲁木齐城网的供电方式,通过对高层建筑消防供电的可靠性分析,指出在哪些情况下,为满足高层建筑的一级负荷供电要求,用户应增设自备发电机。     

对信息化条件下院校与部队共育人才的思考

院校与部队共育人才是我军信息化条件下人才培养的有效途径。当前,应着力做好创建有机衔接的人才共育体系、打造联教联训的人才共育平台、建立科学长效的人才共育机制等方面工作。     

项目管理模式下的装备研制合同管理的研究

本文首先明确了装备研制合同项目的概念及其意义,并针对我军装备研制合同管理的现状,提出了基于项目管理模式的装备研制合同管理机构及管理流程。为进一步加强装备研制合同管理,使得装备研制合同得以有效履行提供了可行的方法,对于提高我军装备研制效益具有一定的理论和实践意义。     

科技创新中的企业标准化工作

一、科技创新中标准化工作的重要意义 创新是一个民族的灵魂,是一个国家兴旺发达的不竭动力。整个人类历史,就是一个不断创新、不断进步的过程。没有创新,就没有人类的进步,就没有人类的未来。当代科学技术的发展,更加雄辩地证明了这一点。对企业来说,大力推进科技创新、实现技术发展的跨越极为重要。     

军事通信中ad hoc网络路由协议性能分析

移动ad hoc组网灵活,抗毁性很强,将在未来的军事通信中发挥重要作用。因此,对于移动ad hoc网络研究中的首要的路由问题作了探讨,先简要介绍了两种典型的路由协议OLSR(Optimized Link State Routing)和AODV(Ad hoc On-Demand Distance Vector Routing),接着利用网络仿真工具OPNET分析了AODV的协议特点,最后比较了两种路由协议的性能。仿真结果表明AODV路由开销小,但时延大,节点移动过快时存在路由稳定性的问题;OLSR路由开销很大,但时延相对较小。因此在搭建军用adhoc网时,应根据实际使用情形做出选择。     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Level workforce planning for multistage transfer lines

In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016