运用动态规划的智能卫星集群星间通信路由算法

通过建立智能卫星集群网络模型,把智能卫星集群星间通信路由问题转换为时延最短路径问题,进而提出一种求解此问题的智能卫星集群星间通信路由算法.该路由算法采用动态规划策略分阶段规划智能卫星集群两个成员之间的星间通信路由,在每个规划阶段,负责发送数据的智能卫星自主调用一种星间通信路由静态规划算法,以求出其在当前时刻的后继卫星来...     

农学专业无机及分析化学课的教学探讨

无机及分析化学是高等院校农学类各专业的基础课。教学过程中应该把农学学科实际与教学环节紧密结合起来,充分调动学生学习积极性,这样既有利于培养学生的多种能力,又有利于提高教师的教学及科研水平。     

大型舰船电力系统网络重构研究

大型舰船电力系统的出现使供电方式由原来的辐射状向环形发展,其网络重构是一个崭新的问题.文中给出了大型舰船电力系统的网络拓扑结构并综合考虑了线路容量限制、节点电压约束及供电负荷优先性的重构数学模型,保证了各种情况下最大限度地给负荷供电.将规划遗传算法应用于所建模型的求解,并应用算例验证了此解法的可行性.     

基于现场总线的设备自动化监控系统

从设备信息管理系统的升级和业务功能扩展的角度,阐述了采用现场总线技术构成的设备监控系统的必要性和作用,并结合某工程背景,介绍了基于现场总线设备自动化监控系统的体系结构、网络拓扑结构及应用软件设计等关键技术。     

体验式大学英语视听说教学模式探究

视听说教学的优化是提高大学生英语综合应用能力,特别是听说能力的关键。本文在论述体验式教学理论基础、原则及其优势的基础上,结合目前大学英语听说教学的现状,提出了一种体验式视听说教学模式,该模式由具体体验、观察模仿、探讨总结和实践运用四个阶段构成。文章介绍了应用该模式的具体实施方法和结果。实践证明,应用该模式能有效提高视听说教学质量。     

边检机关围绕和谐通关创新社会管理的几点思考

边检机关围绕和谐通关创新社会管理,应进一步深化“服务”理念,实现三个转变;把握“创新”实质,做到四个“坚持”;抓住关键环节,加强制度建设;让群众在口岸通行时更快捷、更便利、更文明、更有尊严。     

非饱和土与特殊土力学的理论与实践

对非饱和土与特殊土(包括填土、黄土、膨胀土、膨润土等)开展了持久深入的研究,取得了系统的创造性成果:在国内率先研制成非饱和土固结仪、直剪仪、渗气仪、小型三轴仪、温控三轴仪、多功能三轴仪和土工CT-三轴仪等一系列仪器设备,揭示了非饱和土与特殊土的水气运动规律、变形、强度、屈服、水量变化、细观结构演化、温度效应等许多重要力...     

国外保障性试验与评价的做法与启示

保障性试验与评价是实现装备战备完好性目标、降低装备寿命周期费用和研制风险的重要而有效的决策手段.分别介绍了美、法、德、日等国家在保障性试验与评价方面的组织、结构、管理和实际做法,并得出几点启示,为我国开展保障性试验与评价提供了借鉴和参考.     

Algorithms for solving the conditional covering problem on paths

Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

On parallel machine replacement problems with general replacement cost functions and stochastic deterioration

The parallel machine replacement problem consists of finding a minimum cost replacement policy for a finite population of economically interdependent machines. In this paper, we formulate a stochastic version of the problem and analyze the structure of optimal policies under general classes of replacement cost functions. We prove that for problems with arbitrary cost functions, there can be optimal policies where a machine is replaced only if all machines in worse states are replaced (Worse Cluster Replacement Rule). We then show that, for problems with replacement cost functions exhibiting nonincreasing marginal costs, there are optimal policies such that, in any stage, machines in the same state are either all kept or all replaced (No‐Splitting Rule). We also present an example that shows that economies of scale in replacement costs do not guarantee optimal policies that satisfy the No‐Splitting Rule. These results lead to the fundamental insight that replacement decisions are driven by marginal costs, and not by economies of scale as suggested in the literature. Finally, we describe how the optimal policy structure, i.e., the No‐Splitting and Worse Cluster Replacement Rules, can be used to reduce the computational effort required to obtain optimal replacement policies. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005