Computational analysis of MMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline

This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000     

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     

机载激光雷达数据的三维深度学习树种分类

针对传统基于激光雷达(Light Detection And Ranging,LiDAR)数据的树种分类方法难以直接且全面地利用点云的三维结构信息的问题,提出一种基于三维深度学习的机载LiDAR数据的树种分类方法.该方法直接从三维数据中抽象出高维特征,而无须将点云转化为体素或二维图像.以塞罕坝国家森林公园内白桦和落叶松...     

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     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

柴油油滴蒸发和燃烧过程的理论计算

提出了柴油油滴蒸发和燃烧过程理论计算方法.对油滴蒸发考虑了不定常蒸发和定常蒸发2个阶段,提出了一个求解蒸发时,油滴直径瞬时变化的代数方程式.对一台直喷式柴油机进行了实例计算,计算得到的瞬时燃烧放热率和气缸压力,与试验值符合很好.     

阻燃剂的包覆研究

本文对溴系阻燃剂三（２,３－二溴丙基）异三聚氰酸酯（ＴＢＣ）进行了较深入的包覆研究,对包覆ＴＢＣ进行了热分析、电镜扫描和阻燃性能测试,并将包覆ＴＢＣ用于阻燃聚乙烯,在提高材料氧指数上优于未包覆者。     

遥感图像自动配准的串行与并行策略研究

面对数据量呈指数增长的全球遥感图像,研究快速、有效、高精度的自动图像配准算法成为遥感领域迫切需要解决的问题。综述了遥感图像自动配准算法的研究现状和关键技术,且从新的角度分类总结了已有算法的特点及适用情况,并给出了综合的解决方案;同时研究并提出了三种新的并行策略,获得了较好的实验结论。由于算法采用粗粒度的数据并行方法,因此可扩展性和可移植性较好,无论在理论上还是在实践上都能为实际的遥感应用提供有益的指导和借鉴。最后提出了有待进一步研究的问题。     

高性能路由器并行转发技术

随着线路传输速率的快速提高,报文线速转发面临极大挑战。基于并行处理技术,提出分布式并行转发引擎结构,实现高速报文转发。针对并行转发引擎负载分配问题,设计AHDA(Adaptive Hashing DispatchAlgorithm)算法,该算法为综合考虑负载均衡和报文保序提供支持。模拟结果表明,AHDA算法均匀分配负载,保证很低的报文乱序率,对网络处理器规模具有良好的可扩展性。