振动非平衡喷管流场的数值研究

从非定常的基本方程出发,采用时间相关法,利用带有平滑项的ＭａｃＣｏｒｍａｃｋ格式对以氮气为实验气体的一维振动非平衡喷管流场进行了数值计算。分析了不同条件下振动非平衡对流场的影响,确定了支配振动非平衡的主要因素。计算结果表明,对于一些实际应用的喷管条件,振动非平衡具有较为显著的影响。     

一种实用的有线电视加解扰方案

在分析了电视加扰技术中的模拟加扰方式和数字加扰方式后,对数字加扰时基处理中的行旋转、行置换、行变换等方法做了详细分析;为了保护有线电视加扰系统的安全,采用了随机数的产生、数据的加密等技术。最后详细介绍了一个包括加、解扰系统和用户控制的实验系统     

Estimating value in a uniform auction

Consider an auction in which increasing bids are made in sequence on an object whose value θ is known to each bidder. Suppose n bids are received, and the distribution of each bid is conditionally uniform. More specifically, suppose the first bid X₁ is uniformly distributed on [0, θ], and the i^th bid is uniformly distributed on [X_i?1, θ] for i = 2, …?, n. A scenario in which this auction model is appropriate is described. We assume that the value θ is un known to the statistician and must be esimated from the sample X₁, X₂, …?, X_n. The best linear unbiased estimate of θ is derived. The invariance of the estimation problem under scale transformations in noted, and the best invariant estimation problem under scale transformations is noted, and the best invariant estimate of θ under loss L(θ, a) = [(a/θ) ? 1]² is derived. It is shown that this best invariant estimate has uniformly smaller mean-squared error than the best linear unbiased estimate, and the ratio of the mean-squared errors is estimated from simulation experiments. A Bayesian formulation of the estimation problem is also considered, and a class of Bayes estimates is explicitly derived.     

关于烟雾对光电成像装备的干扰效果试验及其试验靶标

主题是如何通过外场试验定量评价烟雾对光电成像装备的干扰效果。提出一种综合靶标,可用于这种外场试验,也可考察光电成像装备抗烟雾干扰的能力。它适用于普通观瞄器材、照相侦察和摄像装备、微光夜视设备、热成像系统等。     

雷达目标回波信号的混沌、多重分形分析与识别

本文旨在将混沌、多重分形的理论和方法引入雷达信号处理，从混沌、分形动力学角度来揭示和刻划复杂目标散射机理，为进行有效信号处理和可靠目标识别寻找新的理论和技术实现方法。文中统计了五种飞机目标回波信号的Ｌｙａｐｕｎｏｖ指数分布情况，并计算了其多重分形维数，然后在此基础上，进行了目标识别的实验，获得了较高识别率。本文的研究表明，混沌、多重分形理论在目标特性及识别的研究中具有良好的应用前景。     

Nonperiodic preventive maintenance for repairable systems

As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

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.     

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     

燃气轮机仿真软件构造方法综述

从方法论的角度综述了燃气轮机仿真软件的研究现状,分析了过程式方法和过程式模块化方法的不足,阐明采用面向对象方法的必要性,并对未来的发展方向作了初步探讨.