数字签名技术改进方案研究

分析了采用秘密密钥和公开密钥的数字签名技术的不足,提出了相应的改进方案,从而可实现数字签名的各种功能,最后提出一种更为安全的多方数字签名方案。     

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     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

基于神经网络技术和小波分析的发动机 气缸气密性能检测研究

提出了一种基于小波分析和神经网络技术检测发动机气缸气密性能的新方法。对电涡流位移传感器拾取的飞轮位移信号直接进行时域采样 ,通过处理和小波分析 ,获得反映发动机启动瞬时转速尺度参数 ,BP神经网络以此作为输入向量 ,从而有效地检测发动机气缸气密性能。     

基于信息神经网络的内燃机故障诊断方法

在统计概率基础上建立了信息神经网络 ,探讨了利用该网络诊断内燃机故障的方法 ;并在 1 2 1 50L内燃机上进行了模拟故障的诊断试验。试验结果表明 ,该方法是可行的。     

基于模糊集理论和D-S证据推理的空袭目标识别

目标识别是防空作战指挥过程中信息处理的一个重要环节。在基于模糊理论目标识别基础上,引入D-S证据理论,通过对模糊隶属度进行重新分配,较好地克服了随机因素的影响,可望进一步提高对空中目标的正确识别率。     

混沌信号处理

描述了混沌特征参量 ,包括Lyapunov指数和分形维 ;讨论了信号相空间重构和Takens嵌入定理 ,以及嵌入维数、时间延迟等参数。还阐述应用神经网络进行混沌信号非线性处理     

一种雷达类型识别方法

针对目前雷达辐射源识别中存在的,对于数据库中未存储的雷达类型识别能力较差的情况,提出了一个雷达辐射源识别系统,在系统中将雷达的识别分为已知雷达识别和未知雷达识别两个部分分别进行,并给出了系统各个组成部分的实现原理。试验证明,本系统对于未知的雷达类型有着较强的识别能力。