履带车辆动力舱空气流场的CFD模拟与试验研究

以某履带车辆动力舱为研究对象,建立了舱内空气流动与传热计算的物理模型和数学模型,采用标准k-ε方程湍流模型对动力舱内的空气流动进行了描述,采用Fluent软件中的薄面模型对散热器与冷却风扇进行了简化处理,对舱内空气的速度场和温度场进行了三维数值模拟,采用热线风速仪对进、排气窗处的气体流速与温度进行了试验测试,测试值与模拟值的最大相对误差为9．42％,精度能够满足工程需要,表明该计算模型合理可行。     

MSPWVD-HOUGH变换的多目标分辨和雷达回波参数估计

传统的时频分析方法,如Winger Ville Distribution,smoothed pseudo Wigner-Ville distribution等在多目标分辨的时候,无法同时在时频分辨率和抑制交叉项两方面同时达到较好的效果,所提出的MSPWVD解决了这一问题,MSPWVDHOUGH还可在低信噪比的情况下检测出多目标,并估算其参数,可利用来进行雷达成像的运动补偿.     

多退化模式下的电子装备可靠性建模

通常加速退化分析中退化失效只考虑或者假设只有一个退化通道,而实际上很多情况下会存在多退化模式.产品的各个退化通道间的关系存在随机性,即任意两个退化通道间不可能只是单一的相关或者独立.在考虑这种相关性的条件下,深入研究了电子产品的性能退化理论和机理,提出了两个多退化模式竞争失效的数学模型,分别阐述了退化通道相关与独立的两种不同情况下产品可靠度评估方法.     

分布式虚拟战场地形实时渲染策略

大规模地形作为分布式虚拟战场的重要组成部分,在非常有限的资源下,很难达到实时性绘制。针对此问题,设计了两级三层的概要四叉树组织地形数据,用多线程模式算法调度数据,以提高庞大地形数据的交互速率;提出基于衔接索引模板的算法来消除裂缝,实现不同细节层次的无缝拼接;引入样本纹理堆栈的纹理合成算子,增强各层次细节地貌的逼真表现。实验表明:该方法能够很好地实现战场环境下地形的实时性绘制,提供稳定的视觉漫游效果。     

A localization property for facility-location problems with arbitrary norms

In an earlier article we showed that, for facilities-location problems characterized by generalized distance norms and any even number of existing facilities, the optimal location of the new facility is at the intersection of the lines joining the pairs of facilities if these lines intersect at a single point. In this article we extend this concept to show that, for a more general class of problems, the optimal location is one of a set of points which is specified by the existing facilities.     

结构振动系统的模态解耦控制

基于特征结构配置的参数化结果,给出了实现结构振动系统模态解耦的充要条件,导出了期望的反馈增益阵及闭环特征向量矩阵的全体参数化表示。该方法在实现模态解耦的同时,还提供了全部自由度,可用来实现系统设计中某些性能要求。该方法直接基于原系统的参数矩阵,便于工程应用。三级质量弹簧系统的实例表明该方法有效。     

An empirical evaluation of further approximations to an approximate continuous review inventory model

This paper describes an empirical evaluation of several approximations to Hadley and Whitin's approximate continuous review inventory model with backorders. It is assumed that lead time demand is normally distributed and various exponential functions are used to approximate the upper tail of this distribution. These approximations offer two important advantages in computing reorder points and reorder quantities. One advantage is that normal tables are no longer required to obtain solutions, and a second advantage is that solutions may be obtained directly rather than iteratively. These approximations are evaluated on two distinct inventory systems. It is shown that an increase in average annual cost of less that 1% is expected as a result of using these approximations. The only exception to this statement is with inventory systems in which a high shortage cost is specified and ordering costs are unusually low.     

A note on sojourn times in M/G/1 queues with instantaneous,bernoulli feedback

Queueing systems which include the possibility for a customer to return to the same server for additional service are called queueing systems with feedback. Such systems occur in computer networks for example. In these systems a chosen customer will wait in the queue, be serviced and then, with probability p, return to wait again, be serviced again and continue this process until, with probability (1 – p) = q, it departs the system never to return. The time of waiting plus service time, the nth time the customer goes through, we will call his nth sojourn time. The (random) sum of these sojourn times we will call the total sojourn time (abbreviated, sojourn time when there is no confusion which sojourn time we are talking about). In this paper we study the total sojourn time in a queueing system with feedback. We give the details for M/G/1 queues in which the decision to feedback or not is a Bernoulli process. While the details of the computations can be more difficult, the structure of the sojourn time process is unchanged for the M/G/1 queue with a more general decision process as will be shown. We assume the reader is familiar with Disney, McNickle and Simon [1].