《军械工程学院学报》（自然科学版）1989—2001年载文信息的统计分析

以《军械工程学院学报》 (自然科学版 ) 1989- 2 0 0 1年发表的 74 0篇论文为统计样本 ,对其载文信息进行统计分析。得到载文总量 ,平均年载文量 ,平均期载文量 ,篇均页码 ,信息密度 ,发文时滞 ,基金论文率等指标值 ,从一个侧面反映了学院的科研学术成果和《学报》的学术质量     

Discrete equal‐capacity p‐median problem

This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000.     

Workload distribution of discrete‐time parallel queues with two servers

We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000     

基于方差分析的RSA计时攻击

结合差分统计分析方法,引入方差分析假设检验,提出一种可行的计时攻击算法,并针对RSA算法的软件应用进行攻击实验。实验结果表明,该攻击算法不仅比传统攻击方式具有更高的可行性,而且能够适用于不同密钥长度的攻击。     

Flow‐shop batch scheduling with identical processing‐time jobs

In many practical situations of production scheduling, it is either necessary or recommended to group a large number of jobs into a relatively small number of batches. A decision needs to be made regarding both the batching (i.e., determining the number and the size of the batches) and the sequencing (of batches and of jobs within batches). A setup cost is incurred whenever a batch begins processing on a given machine. This paper focuses on batch scheduling of identical processing‐time jobs, and machine‐ and sequence‐independent setup times on an m‐machine flow‐shop. The objective is to find an allocation to batches and their schedule in order to minimize flow‐time. We introduce a surprising and nonintuitive solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Sojourn time analysis of a queueing system with two‐phase service and server vacations

We consider a two‐phase service queueing system with batch Poisson arrivals and server vacations denoted by M^X/G₁‐G₂/1. The first phase service is an exhaustive or a gated bulk service, and the second phase is given individually to the members of a batch. By a reduction to an M^X/G/1 vacation system and applying the level‐crossing method to a workload process with two types of vacations, we obtain the Laplace–Stieltjes transform of the sojourn time distribution in the M^X/G₁‐G₂/1 with single or multiple vacations. The decomposition expression is derived for the Laplace–Stieltjes transform of the sojourn time distribution, and the first two moments of the sojourn time are provided. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

L—R型模糊数及其在装备贮存可靠性研究中的应用

由于数据不足,在全寿命周期的初始阶段使用传统的可靠性分析技术,难以对装备的贮存可靠性进行研究。在模糊集理论的基础上,应用L-R型模糊数的模糊故障树分析技术,探讨了装备贮存可靠性的研究问题。