DIS系统中实时通讯技术的研究

针对DIS系统实时通讯的要求 ,以UDP通讯协议为基础 ,结合采用多线程技术 ,给出了一种实时通讯方法 .经模拟试验表明该方法在WindowsNT环境下是有效的 .     

瞬态温度场有限元法求解的研究

介绍了瞬态热分析的定义和步进积分的特点;研究了两点时问差分格式的瞬态导热温度场有限元法数值解的稳定性和振荡现象;比较和分析了几种差分格式的特点,并应用算例对几种差分算法进行了验证;总结说明了几种差分算法在实际当中的应用。     

Estimating failure time distribution and its parameters based on intermediate data from a Wiener degradation model

Instead of measuring a Wiener degradation or performance process at predetermined time points to track degradation or performance of a product for estimating its lifetime, we propose to obtain the first‐passage times of the process over certain nonfailure thresholds. Based on only these intermediate data, we obtain the uniformly minimum variance unbiased estimator and uniformly most accurate confidence interval for the mean lifetime. For estimating the lifetime distribution function, we propose a modified maximum likelihood estimator and a new estimator and prove that, by increasing the sample size of the intermediate data, these estimators and the above‐mentioned estimator of the mean lifetime can achieve the same levels of accuracy as the estimators assuming one has failure times. Thus, our method of using only intermediate data is useful for highly reliable products when their failure times are difficult to obtain. Furthermore, we show that the proposed new estimator of the lifetime distribution function is more accurate than the standard and modified maximum likelihood estimators. We also obtain approximate confidence intervals for the lifetime distribution function and its percentiles. Finally, we use light‐emitting diodes as an example to illustrate our method and demonstrate how to validate the Wiener assumption during the testing. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

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     

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     

一种改进方位向非线性CS大斜视角SAR成像算法

大斜视角SAR成像时存在严重的距离走动现象,慢时域的距离走动校正在解决这一问题同时导致了聚焦深度问题.分析了二维频域解耦合后残余相位误差以及时域走动校正后的多普勒调频率误差,提出一种改进的方位向非线性CS算法,校正了三次以上距离迁徙带来的相位误差,同时采用改进非线性CS扰动方程补偿了随方位偏移量线性变化的调频率误差.仿真结果表明,改进算法的大斜视角大场景成像性能优于传统的高分辨大斜视角成像算法.     

铝导线短路熔珠对固体可燃物引燃能力实验研究

在模拟试验平台上进行了铝导线短路熔珠引燃棉布、聚氨酯泡沫塑料和纸张的试验,得到了不同材料的临界加栽电压值和引燃规律。初步分析了加栽电压与短路熔珠粒径及引燃能力的关系。结果表明,随着短路电压增大,导线熔珠的粒径逐渐增大,熔珠对固体材料的引燃能力逐渐增强,氧指数越低、表面粗糙、易蓄热的材料越容易被点燃。棉布、聚氨酯泡沫塑料和纸屑被引燃的短路临界电压分别为50V、35V和45V。     

改进的Euler方法应用于非线性方程求根

本文通过引入动力系统,将改进的Euler方法应用于非线性方程求根问题,给出非线性方程求根的预估-再校正迭代格式,证明了该格式至少二阶收敛并可以调节参数达到超收敛。最后给出数值实验,数值结果验证了算法的有效性。     

Hilbert空间中次连续拟非扩张映像不动点的迭代方法

首次引用一种迭代算法,用来构造Hilbert空间中次连续拟非扩张映像的不动点;使用新的算法证明了一个强收敛定理,其优点是不要求映像具有次闭性质。     

第Ⅳ类时滞捕食系统的Hopf分支

研究了具有第Ⅳ类功能性反应的两种群时滞捕食系统正平衡点的稳定性,讨论了该系统的Hopf分支现象,并进行了数值模拟。