网络办公自动化系统的发展与思考

随着计算机网络技术的普及,利用互联网实现办公自动化在技术和应用上都得到了更高层次的发展,成为现代信息社会的重要标志,也成为高校信息化建设的重要组成部分。办公自动化应用逐步普及到管理和服务保障领域中已成为一种迫切的需求。     

VB程序设计课程教学的探索与实践

实践表明,对影响VB程序设计课程教学中存在的突出问题进行认真分析,充分利用网络教学平台,改革课堂教学方法、抓好上机实践环节。此举有效地激发了学生的学习兴趣,提高学生的编程能力,同时也有助于提高教学质量和效果。     

对加强网络化思想政治工作的几点思考

随着时代发展,网络已成为报纸、电台、电视以外的“第四媒体”,亦成为思想政治工作一个新的重要阵地。它既给军队思想政治工作带来了机遇,也带来了前所未有的挑战。探索如何充分运用网络这一特殊的文化载体,开拓军队思想政治工作新途径,抢占“制高点”,弘扬主旋律,具有重要的理论和实践意义。     

基于新课程的地理教师专业技能及结构

随着新课程改革的逐步实施,人们逐渐意识到,在新课程环境下促使教师理念与行为的变革,将是课程改革取得成功的前提和保证。本文以新课程理念为指导,以地理课程的特殊性质和功能为基础,阐述了当代地理教师从事地理教育教学应该具备的专业技能,构建了基于新课程的地理教师专业结构。探讨在新课程标准下教师专业技能发展,对于改革师范教育,优化培养模式,加强教师队伍的现代化建设和提高质量具有重要意义。     

基于贝叶斯网络的装备损伤定位系统研究

分析了贝叶斯网络在装备损伤定位方面的优势,及其损伤定位的方法与流程,建立了用于装备损伤定位的贝叶斯网络模型,并开发了损伤定位系统。以某型火炮为例,演示了其损伤定位的一般过程,验证了贝叶斯网络在装备损伤定位中应用的可行性与有效性。     

无线传感器网络DV—Hop定位算法的研究与改进

为了改善DV—Hop算法对节点的定位精度和提高覆盖率,对DV—Hop定位算法中未知节点到锚节点间距离计算方法进行了改进,提出了一种新的距离计算方法,并对改进算法和原算法进行了对比仿真。仿真结果表明了改进算法的有效性。     

基于人工神经网络的特征压缩方法及应用

分析了人工神经网络特征提取方法用于特征压缩的原理,研究了多层网络的隐层提取模型、Oja网络模型和基于Sanger算法的网络模型,以坦克柴油机燃油系统典型故障的特征处理为例,采用Sanger算法对特征参数进行了压缩,实现了特征空间的约简。该方法有利于简化分类器的设计,对于解决复杂设备的状态检测与故障诊断问题具有重要意义。     

基于感知信息共享的C2网络特征分析*

指挥控制(C2,Command and Control)关系网络连接数的增加会增强指控节点之间的信息共享,但也会增加节点信息处理和交换负荷,如果达到一定程度,则会造成节点本身的"信息过载"从而影响C2网络性能.对此,通过研究C2网络在两种不同处理方式下的共享感知信息平均提交时间,用网络节点响应时间的均方差表征一个C2网络的共享态势感知时间的一致性,最后对两种不同结构C2网络特征参数的计算,说明了网络连接增加会导致信息提交时间的延长,但一致性会增强.     

Competition under time‐varying demands and dynamic lot sizing costs

We develop a competitive pricing model which combines the complexity of time‐varying demand and cost functions and that of scale economies arising from dynamic lot sizing costs. Each firm can replenish inventory in each of the T periods into which the planning horizon is partitioned. Fixed as well as variable procurement costs are incurred for each procurement order, along with inventory carrying costs. Each firm adopts, at the beginning of the planning horizon, a (single) price to be employed throughout the horizon. On the basis of each period's system of demand equations, these prices determine a time series of demands for each firm, which needs to service them with an optimal corresponding dynamic lot sizing plan. We establish the existence of a price equilibrium and associated optimal dynamic lotsizing plans, under mild conditions. We also design efficient procedures to compute the equilibrium prices and dynamic lotsizing plans.© 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009