关于《机械设计工程》教学体系的研究与实践

论述了机械设计系列课程体系改革的必要性,分析了国内外机械设计系列课程的教学体系,重点介绍了机械设计系列课程新的教学体系的内容,并规划了教改实践的方法和步骤.     

装备器材库温湿度监控系统的设计与实现

军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计.     

从区域特色看兵团经济持续发展战略

世纪之交,在全球社会经济增长模式及产业结构大调整的历史时期,围绕兵团的特殊地位及资源区位优势研究探讨适合兵团特性的持续发展战略,从宏观上探索兵团中长期社会发展规律,为兵团充分发挥自身优势参与国内外经济一体化进程,责无旁贷地肩负起屯垦戍边的历史使命,作一些有益的探索。     

地面防空威胁估计模糊优化计算方法及使用

在近年来研制成功的战术单位级地面防空作战指挥辅助决策支持系统基础上,介绍了为指挥员提供目标威胁判断使用的模糊优化评估算法以及威胁估计在地面防空指挥决策中的使用.     

发控车维修系统设计

发控车维修系统设计关键是建立发控车维修体系.介绍了现代发控车维修系统设计的要求、维修体系的建立、软硬件设计的方法.     

多属性决策(MADM)在防空C~3I系统效能评估中的应用研究

介绍了防空C3I系统效能的定义及效能评估的一般处理过程。通过专家群组决策确定效能指标体系 ,针对效能指标的多样性 ,提出了基于多属性决策 (MADM )的效能评估方法 ,并通过一个示例给出MADM方法的处理过程 ,有效地解决了防空C3I系统效能评估这一复杂而困难的问题。     

CAPP系统中工艺表格自动生成技术研究

针对企业应用CAPP的需要 ,研制成功了工艺表格自动生成系统。该系统建立一个处理工艺表格的通用模型 ,把企业的具体工艺表格当作模型的实例 ,并将工艺表格的形式和要求等作为实例的属性。系统采用ODBC(开放式数据库互连 )技术 ,为MIS、PDM等系统内部不同模式数据交换提供接口。实践证明系统具有设计方法新颖、通用性强和实用性好等特点。     

关于分形插值函数的积分

用反例说明在 [1 ,2 ]中关于分形插值函数的积分公式是错误的 ,并建立了关于分形插值函数积分的正确公式。     

Waiting time analysis for a queueing system with time‐limited service and exponential timer

We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001.     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001