飞秒激光脉冲测量原理与数值模拟分析方法

飞秒fs(1fs=10~(-15)s)激光脉冲测量是飞秒激光技术中非常重要的研究内容,由于测量的复杂性,操作上一般是实际测量与数值模拟结合进行,因而非常注重测量的方法性,但在实际测量中,许多测量者只注重单一方法的使用,最终往往很难达到理想的结果。为此,在对自相关测量法原理作简要介绍的基础上,着重阐述了近年发展起来的基于其上的光学频率光栅开关法(FROG)和自参考光谱位相相干电场重建法(SPIDER)的原理,及其数值模拟分析方法,以给实际测量者提供一个较全面的方法参考选择。     

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     

Reliability of a two-dimensional demand-based networked system with multistate components

Existing research on multistate system reliability has mainly focused on one-dimensional systems such as parallel systems, linear sliding window systems, and linearly consecutively connected systems. However, two-dimensional networked systems widely exist in real-world applications such as lighting systems, monitoring systems, and computer network systems. This research considers a two-dimensional networked system consisting of multistate components. The system fails if the cumulative performance of any row or any column cannot meet a predetermined demand. A novel reliability evaluation algorithm is proposed for the considered two-dimensional networked system by extending the universal generating function technique. Furthermore, the proposed model and reliability evaluation algorithm are extended to a two-dimensional networked system with phased missions. The proposed models and algorithms are illustrated by a matrix heating system in a thermoforming machine.     

石油库站油料筹措中的灰色存储论综合模型及应用

将灰色系统理论、存储论、数理统计理论综合运用,建立综合数学模型,并将该模型运用于石油库站油料管理中,以提高库站油料管理者的决策水平。建立的多阶段油料订购模型可制定最佳油料订购方案,该模型具有通用性,具有简洁、实用、拟合精度高等特点。     

管道在线检测技术及检测机器人研究

概述了管道检测技术发展现状,介绍了最新检测技术的原理,分析了管道内检测机器人的技术要点,概括介绍了课题组在差压式管内检测机器人周围流场建模与仿真、腐蚀环境下管道钢裂纹群演化的混沌动力学、差压式管内检测机器人的通过性能、管内检测机器人运行速度和姿态分析及运动状态控制、管内检测机器人小型化、小型化管内检测机器人检测精度、小型化管内检测机器人定位精度及管道剩余寿命的预测方法等方面的研究进展,为今后的研究打下了坚实的基础。     

目标指示时延对潜舰导弹攻击的影响

首先根据目标信息来源的不同分析了4种目标指示方法的特点;其次从潜舰导弹攻击过程出发,分析了导弹攻击阶段的时间关系,给出了目标指示时延的概念;最后通过对四种目标指示方式、不同目标指示时延时导弹雷达捕捉概率的计算,分析了目标指示时延对潜舰导弹攻击的影响。     

基于体系结构的C~4ISR系统可靠性指标体系

可靠性分析与设计是C4ISR系统总体设计的重要环节。由于系统的复杂性,传统的可靠性分析方法很难直接应用到C4ISR系统中。随着体系结构技术的不断发展,及其在系统设计中的广泛应用,如何将体系结构技术应用于C4ISR系统可靠性分析与设计成为一个亟待解决的问题。利用体系结构框架对C4ISR系统可靠性指标进行研究。通过分析体系结构产品间关系及其在系统可靠性分析中的作用,提出了作战、连接、功能、系统、系统部件等可靠性指标,并给出相应的可靠性参数。     

A nested benders decomposition approach for telecommunication network planning

Despite its ability to result in more effective network plans, the telecommunication network planning problem with signal‐to‐interference ratio constraints gained less attention than the power‐based one because of its complexity. In this article, we provide an exact solution method for this class of problems that combines combinatorial Benders decomposition, classical Benders decomposition, and valid cuts in a nested way. Combinatorial Benders decomposition is first applied, leading to a binary master problem and a mixed integer subproblem. The subproblem is then decomposed using classical Benders decomposition. The algorithm is enhanced using valid cuts that are generated at the classical Benders subproblem and are added to the combinatorial Benders master problem. The valid cuts proved efficient in reducing the number of times the combinatorial Benders master problem is solved and in reducing the overall computational time. More than 120 instances of the W‐CDMA network planning problem ranging from 20 demand points and 10 base stations to 140 demand points and 30 base stations are solved to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010