Callable products for an implicit time model with dependent demands

Capacity providers such as airlines and hotels have traditionally increased revenues by practicing market segmentation and revenue management, enabling them to sell the same capacity pool to different consumers at different prices. Callable products can enhance profits and improve consumers' welfare by allowing the firm to broker capacity between consumers with different willingness to pay. A consumer who buys a callable product gives the capacity provider the right to recall capacity at a prespecified recall price. This article studies callable products in the context of the model most commonly used in industry, which handles time implicitly imposing fewer restrictions on the nature of randomness compared to the Poisson arrival process favored in academia. In the implicit time model, capacity providers set booking limits to protect capacity for future high-fare demand. Our numerical study identifies conditions where callable products result in significant gains in profits.     

一种高速实时数据采集处理系统设计

针对目前高速数据采集中的实时性和同步性问题,提出了一种高速实时数据采集处理设计方案。根据上述方案进行了系统的硬件和软件设计,该系统以FPGA器件作为下位机控制核心,设计了时钟同步、数据采集、数据处理、数据缓存、数据通讯等功能模块;整个系统采用ARM微处理器作为上位机控制核心,基于嵌入式Linux 2.6内核进行软件编程,负责向FPGA发送设置参数和控制指令,同时对数据前端采样和处理数据进行存储、显示、统计等。经测试验证,该方案具有高速率、高精度、同步测量、实时处理、体积小、功耗低等优点。     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

密封库房中降湿机的使用分析

本文对国防仓库配用的不同类型的冷冻式降湿机的使用进行了研究,给出了确定开机时间的计算公式,为正确使用降湿机提供了依据。     

辐射传热时活塞式气缸中加热气体的最大膨胀功

对热辐射传热定律q∝Δ(T4)下,给定初态内能、体积,末态体积以及过程时间时,加热气体膨胀的最优构型进行了研究,利用最优控制理论得出最大膨胀功输出时膨胀的最优构型由两个瞬时绝热分支和一个E-L分支组成的结论.给出了各分支之间转换点参数的求解方法及最优构型的数值算例,最后将线性唯象传热定律、牛顿传热定律、平方传热定律、立方传热定律和辐射传热定律下加热气体膨胀的最优构型进行了比较.结果显示,随着传热指数的增加,理想气体的内能呈现出明显的整体增加趋势,而体积则呈现出明显的整体减小趋势.     

外辐射源雷达系统中时延估计算法及仿真

时延估计的方法有经典的广义相关法、自适应法、循环平稳法、高阶累积量法、时频分析法等,重点分析了外辐射源雷达系统中用于时延估计的循环平稳法和相关法,并给出了循环平稳法和相关法用于时延估计的仿真,得出了仿真结果。仿真结果表明,对QPSK信号无法用循环平稳的方法来进行时差的获取,用相关法在极低信噪比条件下检测出目标信号,长时间的信号积累是必需的。     

一类脉冲时滞抛物型方程解的振动准则

讨论了一类含脉冲的时滞抛物型方程解的振动性,利用格林公式以及Jensen不等式,得出了该方程在一类边界条件下解的振动准则。     

Waiting time analysis for a queueing system with time‐limited service and exponential timer

We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001.     

纳秒级电磁脉冲模拟器的研制

介绍了纳秒级电磁脉冲模拟器的组成和主要指标,分析了脉冲高压电源的各项参数对脉冲模拟器输出波形上升前沿的影响,给出了实测数值和波形。测量结果表明此电磁脉冲模拟器可以输出前沿大约为2 58ns、衰落时间约55ns的双指数脉冲波。