激励器结构参数对合成射流影响的试验研究

为了设计高性能的合成射流激励器,实验采用热线风速仪测量激励器出口的流动速度,对不同大小激励器、不同出口形状激励器、单 双膜激励器以及金属振动膜处于不同装配受压状态下的激励器分别进行了试验。实验结果显示:激励器的结构决定了合成射流激励器的性能;激励器出口射流平均速度除了与激励器大小、出口面积有关外,还与出口形状有关,采用方孔 矩形孔形式的开口有利于建立较强的合成射流;双膜与单膜工作相比,合成射流最大速度基本上是成两倍关系;金属振动膜的安装形式(受压状态)不影响合成射流随频率的变化规律,但对合成射流速度影响很大,当激励器振动膜处于螺栓拧紧受压状态时,与振动膜不受压状态相比,合成射流出口速度几乎下降了一个数量级。     

Due‐window assignment with unit processing‐time jobs

In due‐window assignment problems, jobs completed within a designated time interval are regarded as being on time, whereas early and tardy jobs are penalized. The objective is to determine the location and size of the due‐window, as well as the job schedule. We address a common due‐window assignment problem on parallel identical machines with unit processing time jobs. We show that the number of candidate values for the optimal due‐window starting time and for the optimal due‐window completion time are bounded by 2. We also prove that the starting time of the first job on each of the machines is either 0 or 1, thus introducing a fairly simple, constant‐time solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

ANFIS网络在舰船维修费用预测中的应用

利用自适应模糊推理系统(ANFIS)的模糊推理能力和学习功能相结合的优点,运用于舰船维修费用预测中.分析了影响维修费用的因素,采用变量投影重要性分析方法(VIP)对影响因素进行评估和筛选,使用ANFIS网络建立模型.通过实际算例进行分析,用历史数据训练ANFIS网络,预测舰船维修费用,在数据样本量小的情况下,较一般神经网络精度有明显提高.     

数组越界软件测试系统的设计与实现

软件测试系统的研制是现阶段软件测试领域研究的一个热点.首先针对C/C 语言常见数组越界错误类型进行了分析,介绍了软件测试的一些基本概念,而后给出了软件测试系统设计,对系统设计的各个阶段进行了说明,并且给出了一种错误类型检查的算法设计,它在软件测试检测中具有通用性和代表性,最后给出了软件测试的实验结果.     

Optimal path finding in direction,location, and time dependent environments

This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Averaging frameworks for simulation optimization with applications to simulated annealing

We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Optimal inventory control policy for periodic‐review inventory systems with inventory‐level‐dependent demand

We consider a setting in which inventory plays both promotional and service roles; that is, higher inventories not only improve service levels but also stimulate demand by serving as a promotional tool (e.g., as the result of advertising effect by the enhanced product visibility). Specifically, we study the periodic‐review inventory systems in which the demand in each period is uncertain but increases with the inventory level. We investigate the multiperiod model with normal and expediting orders in each period, that is, any shortage will be met through emergency replenishment. Such a model takes the lost sales model as a special case. For the cases without and with fixed order costs, the optimal inventory replenishment policy is shown to be of the base‐stock type and of the (s,S) type, respectively. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Irreducibility of joint inventory positions in an assemble‐to‐order system under (r,nQ) policies

In a typical assemble‐to‐order system, a customer order may request multiple items, and the order may not be filled if any of the requested items are out of stock. A key customer service measure when unfilled orders are backordered is the order‐based backorder level. To evaluate this crucial performance measure, a fundamental question is whether the stationary joint inventory positions follow an independent and uniform distribution. In this context, this is equivalent to the irreducibility of the Markov chain formed by the joint inventory positions. This article presents a necessary and sufficient condition for the irreducibility of such a Markov chain through a set of simultaneous Diophantine equations. This result also leads to sufficient conditions that are more general than those in the published reports. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network

Scheduling IT projects and assigning the project work to human resources are an important and common tasks in almost any IT service company. It is particularly complex because human resources usually have multiple skills. Up to now only little work has considered IT‐specific properties of the project structure and human resources. In this article, we present an optimization model that simultaneously schedules the activities of multiple IT projects with serial network structures and assigns the project work to multiskilled internal and external human resources with different efficiencies. The goal is to minimize costs. We introduce a metaheuristic that decomposes the problem into a binary scheduling problem and a continuous staffing problem where the latter is solved efficiently by exploiting its underlying network structure. For comparison, we solve the mixed–binary linear program with a state–of–the–art commercial solver. The impacts of problem parameters on computation time and solution gaps between the metaheuristic and the solver are assessed in an experimental study. Our results show that the metaheuristic provides very favorable results in considerable less time than the solver for midsize problems. For larger problems, it shows a similar performance while the solver fails to return feasible solutions. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 111–127, 2012     

k-ary n-cube中的移动气泡流控策略

在k-ary n-cube网络中,气泡流控是一种有效、实用的死锁避免技术,它不必依赖虚通道就能避免环网中出现的死锁问题。如果流控策略能感知到维度内缓冲区的总体使用情况,就能够更加高效地进行调度,从而提高网络性能。为了避免关键气泡机制引起的阻塞,提出了伪报文协议;结合伪报文协议,设计了移动气泡流控策略,它有效实现了维度内的全局资源感知能力。与局部气泡流控相比,路由器每条输入通道仅设置一个报文缓冲区就可以避免环网中的死锁,即最小资源需求减少了一半。网络模拟结果表明,该机制不会出现永久阻塞;在distribute、hotregion和uniform传输模式中,该机制可以有效提高网络吞吐率20%以上,并且在网络饱和后吞吐率依然维持稳定。