略论新世纪图书馆立身之本

在21世纪,图书馆只有以信息为基础,面向读者,提高效益,不断革新才能生存和发展。     

Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue

We use the matrix‐geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady‐state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981), 945–958] can be extended to an upper triangular block structure. Moreover, the subblock matrices of matrix R also have such a structure. With this special structure, we develop a procedure to compute the matrix R. After obtaining the stationary distribution of the system, we study two primary performance indices, namely, the distributions of the number of jobs of each type in the system and their waiting times. Although most of our analysis is carried out for the case of K = 3, the developed approach is general enough to study the other cases (K ≥ 4). © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 662–682, 2003.     

Scheduling patients in an ambulatory surgical center

This paper presents a deterministic approach to schedule patients in an ambulatory surgical center (ASC) such that the number of postanesthesia care unit nurses at the center is minimized. We formulate the patient scheduling problem as new variants of the no‐wait, two‐stage process shop scheduling problem and present computational complexity results for the new scheduling models. Also, we develop a tabu search‐based heuristic algorithm to solve the patient scheduling problem. Our algorithm is shown to be very effective in finding near optimal schedules on a set of real data from a university hospital's ASC. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine

This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed‐integer linear programming formulation. By relaxing some constraints, a Lagrangean relaxation algorithm is designed which gives both lower and upper bounds. The special case where jobs have equal weights is analyzed. Computational results are presented and, although the duality gap becomes larger with the number of jobs, it is possible to solve problems of more than 100 jobs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003     

一种快速有效的循环平稳信号检测方法

TSAE-Z算法把时间切片自相关包络检测和可变步进的Zoom-FFT检测相结合,实现了对循环平稳信号的快速、精确检测,仿真结果表明,在相同数据长度条件下,TSAE-Z算法能够使检测运算时间减少3个数量级;在相同执行时间的条件下,TSAE-Z算法能在提高检测分辨率的同时使检测性能提升6dB以上。     

Economic design of sampling plans with multi-decision alternatives

For situations where there are several markets with different profit-cost structures, economic attributes sampling plans are developed for determining the market to ship the lot to. Two sampling plans are considered; the fixed-size sampling plan with several levels of acceptance numbers, and the inverse sampling plan with several levels of sample sizes. Linear profit models are constructed which involve four profit/cost components; profit from a conforming item, inspection cost, replacement cost, and cost from an accepted nonconforming item. For fixed-size and inverse sampling plans, methods of finding optimal sampling plans are presented and examples with beta-binomial prior distributions are given.     

Optimal production ramp-up in the smartphone manufacturing industry

Motivated by challenges in the smartphone manufacturing industry, we develop a dynamic production ramp-up model that can be applied to economically satisfy nonstationary demand for short-life-cycle products by high-tech companies. Due to shorter life cycles and more rapid evolution of smartphones, production ramp-up has been increasingly critical to the success of a new smartphone. In the production ramp-up, the key challenge is to match the increasing capacity to nonstationary demand. The high-tech smartphone manufacturers are urged to jointly consider the effect of increasing capacity and decreasing demand. We study the production planning problem using a high-dimensional Markov decision process (MDP) model to characterize the production ramp-up. To address the curse of dimensionality, we refine Monte Carlo tree search (MCTS) algorithm and theoretically analyze its convergence and computational complexity. In a real case study, we find that the MDP model achieves revenue improvement by stopping producing the existing product earlier than the benchmark policy. In synthetic instances, we validate that the proposed MCTS algorithm saves computation time without loss of solution quality compared with traditional value iteration algorithm. As part of the Lenovo production solution, our MDP model enables high-tech smartphone manufacturers to better plan the production ramp-up.     

空间非合作目标捕获方法综述

随着空间事故和失效航天器的增多,地球附近的轨道资源越来越紧张。如今世界各国都在大力发展在轨服务和太空碎片清除,作为其中最关键的技术之一,空间非合作目标捕获近年来成了太空研究领域的重点。目前,国内外各大研究机构针对非合作目标进行了深入研究,并提出了多种捕获方法,取得了较大的进展。对非合作目标进行分类,基于现有的捕获方法介绍了国内外非合作目标捕获技术发展的最新状况,总结了原理方案,分析了捕获方法和关键技术,为我国后续开展相关研究提供了一种研究思路。     

基于HHT的助飞反潜鱼雷入水信号检测方法

针对助飞反潜鱼雷入水信号在浅海条件下信噪比低、干扰成分多导致难以检测的问题,采用HHT处理方法,通过CEEMD分解方法提高原始信号的信噪比;通过希尔伯特变换突出入水信号的时域特征,降低了入水信号检测的难度。所提方法应用于实航试验数据,显著提高了信号检测的可靠性。     

基于LSSVM的JPEG图像信息隐藏盲检测算法

提出了一种基于LSSVM的针对JPEG图像的信息隐藏盲检测算法。该算法在提取JPEG图像的12维特征向量的基础上,通过LSSVM分类器对待测图像进行分类,以达到检测载密图像的目的。实验结果表明,该算法构建的LSSVM分类器对载密图像进行盲检测时,正确检测率较高,能够实现针对各类JPEG图像信息隐藏算法的有效检测。