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

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

高频雷达射频干扰抑制研究

分析了高频雷达射频干扰抑制方案中对目标信号相干积累的影响,在此基础上提出了一种新型的天线方向图综合算法,并进一步将其应用到改进的干扰抑制新方案中。新方案兼顾了射频干扰的抑制和目标信号的相干积累。计算机仿真结果表明新方案较大地改善了高频雷达抑制射频干扰的性能。     

Optimal control of an M/G/1 queue with impatient priority customers

An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 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     

IDEF0方法在军事综合电子信息系统分析设计中的应用

就IDEF0方法在军事综合电子信息系统分析设计、系统升级与集成及仿真等方面的应用进行了深入探讨。由于IDEF0模型具有简单、全面且描述能力强等优点 ,使其在多个领域尤其在制造业中得到了广泛应用。军事综合电子信息系统是以活动为支撑 ,以信息为基础的复杂大系统 ,用IDEF0模型对其进行描述可以加深指挥人员和技术人员对系统的共同理解 ,从而提高系统开发的效率并提高系统的实用性。     

基于机械故障诊断的算法及小波基选择研究

针对小波分析在机械故障诊断应用中的快速算法和小波基选择存在的问题,对常用的正交、半正交、双正交小波提取信号特征的能力进行了分析比较,研究表明半正交B样条小波因具有线性相位和采用较长的分解序列而具有较好的频率局部化特性和较小的变换误差,具有比较好的综合性能。推导了正交小波包的图形显示算法,利用该算法解决了小波变换快速算法中存在的数据长度随分解层数成倍减小的问题。研究结果为机械故障诊断中选择小波基进行信号处理提供了依据和途径。     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

基于峰值点形态信息的SAR图像舰船尾迹检测算法

在分析合成孔径雷达(SAR)图像中舰船尾迹线性特性的基础上,针对SAR图像线性特征产生因素的多样性,及由此引起的Radon变换域中尾迹峰值点检测的不确定性,提出了一种基于峰值点形态信息的尾迹检测算法。算法门限化图像的Radon变换系数,提取出所有可能的峰值点;对这些相应的局部峰值点的一维截面进行连续小波变换峰值点匹配,根据提取到的参数形成决策矢量在特征空间中进行决策。仿真和实际数据处理的结果表明,该方法能有效、准确地检测到SAR图像中的舰船尾迹并判决其真假类别。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000