基于选择准则的参数模型评价方法

为评价参数模型的优劣,分析了模型信息量与数据被模型拟合后的残差信息量之间的关系,提出了综合考虑模型拟合残差大小、残差信息量与参数数目的一种模型选择的新方法RIA。结合RIA方法,定义了时序模型评价的一种准则,并以航天测量数据处理为例,说明了不同模型在工程实际中的不同表现和本质区别的意义所在。     

针对无线移动环境的音频同步视频连环画的自动生成

针对无线移动通信网络的客观制约,给出了一种音频同步的基于视频连环画模式摘要自动生成的实用视频服务方案,使得系统在向用户提交连续音频流的同时,能够随着网络带宽条件的变化,按照动态采样频率,基于视频内容选择重要帧递送,并按照与音轨同步的模式播放,从而在降低数据量的同时,满足用户对视频内容综合理解的需求。     

机动目标建模及机动检测算法

为解决机动目标跟踪问题,建立了非机动(匀速直线运动)和机动目标当前统计两种动态模型,并对机动目标当前统计模型的输入控制的估计进行了适当改进.同时对非机动模型的观测残差和机动模型的输入估计进行检验,以便准确检测目标机动.     

Efficient multinomial selection in simulation

Consider a simulation experiment consisting of v independent vector replications across k systems, where in any given replication one system is selected as the best performer (i.e., it wins). Each system has an unknown constant probability of winning in any replication and the numbers of wins for the individual systems follow a multinomial distribution. The classical multinomial selection procedure of Bechhofer, Elmaghraby, and Morse (Procedure BEM) prescribes a minimum number of replications, denoted as v*, so that the probability of correctly selecting the true best system (PCS) meets or exceeds a prespecified probability. Assuming that larger is better, Procedure BEM selects as best the system having the largest value of the performance measure in more replications than any other system. We use these same v* replications across k systems to form (v*)^k pseudoreplications that contain one observation from each system, and develop Procedure AVC (All Vector Comparisons) to achieve a higher PCS than with Procedure BEM. For specific small-sample cases and via a large-sample approximation we show that the PCS with Procedure AVC exceeds the PCS with Procedure BEM. We also show that with Procedure AVC we achieve a given PCS with a smaller v than the v* required with Procedure BEM. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 459–482, 1998     

Two exact algorithms for the vehicle routing problem on trees

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time‐constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 75–89, 1999     

Pairwise model discrimination with applications in lifetime distributions and degradation processes

Reliability data obtained from life tests and degradation tests have been extensively used for purposes such as estimating product reliability and predicting warranty costs. When there is more than one candidate model, an important task is to discriminate between the models. In the literature, the model discrimination was often treated as a hypothesis test and a pairwise model discrimination procedure was carried out. Because the null distribution of the test statistic is unavailable in most cases, the large sample approximation and the bootstrap were frequently used to find the acceptance region of the test. Although these two methods are asymptotically accurate, their performance in terms of size and power is not satisfactory in small sample size. To enhance the small‐sample performance, we propose a new method to approximate the null distribution, which builds on the idea of generalized pivots. Conventionally, the generalized pivots were often used for interval estimation of a certain parameter or function of parameters in presence of nuisance parameters. In this study, we further extend the idea of generalized pivots to find the acceptance region of the model discrimination test. Through extensive simulations, we show that the proposed method performs better than the existing methods in discriminating between two lifetime distributions or two degradation models over a wide range of sample sizes. Two real examples are used to illustrate the proposed methods.     

SpaceWire网络混合路由机制设计

针对星上系统总线多元性导致的星载网络接口和协议不能标准化的发展瓶颈,基于SpaceWire总线协议,通过将静态路由(时间触发)与动态路由(事件触发)机制结合,实现了控制数据和载荷数据共用网络。静态路由完全遵循SpaceWire-D协议,在保证确定性传输的同时,通过启发式调度算法首次实现了多时间窗并行调度,并提出利用最大公约数法设计时间窗,以提高网络吞吐量;动态路由通过对随机事件和载荷数据分配优先级,实现传输路径冲突时对紧急任务的优先处理。在OPENT中搭建网络系统仿真模型,对所提出的路由机制进行了仿真。实验结果表明,静态路由时段网络吞吐量较现有调度算法有明显提高,动态路由实现了紧急事件优先传输。     

低地球轨道卫星网络节能方法

通常卫星的唯一能源来源是太阳能,因此星上网络设备的能源供应问题比地面网络的更加严峻。通过修改和扩展链路容量受限的最小代价多商品流模型来适应卫星网络这一特殊的体系结构,并基于低轨道卫星网络的多重覆盖机制和流量分布模型,改进现有的启发式算法来关闭冗余的卫星节点、星地链路和星间链路。在满足链路利用率和路由跳数增加比例约束的条件下,仿真实验中关闭上述三种参数的比例分别可达59%、61%和72%,卫星网络的总体节能比例可达65%。     

A selective newsvendor approach to order management

Consider a supplier offering a product to several potential demand sources, each with a unique revenue, size, and probability that it will materialize. Given a long procurement lead time, the supplier must choose the orders to pursue and the total quantity to procure prior to the selling season. We model this as a selective newsvendor problem of maximizing profits where the total (random) demand is given by the set of pursued orders. Given that the dimensionality of a mixed‐integer linear programming formulation of the problem increases exponentially with the number of potential orders, we develop both a tailored exact algorithm based on the L‐shaped method for two‐stage stochastic programming as well as a heuristic method. We also extend our solution approach to account for piecewise‐linear cost and revenue functions as well as a multiperiod setting. Extensive experimentation indicates that our exact approach rapidly finds optimal solutions with three times as many orders as a state‐of‐the‐art commercial solver. In addition, our heuristic approach provides average gaps of less than 1% for the largest problems that can be solved exactly. Observing that the gaps decrease as problem size grows, we expect the heuristic approach to work well for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

基于综合性能的C3I系统通信效能

论述了C3I的重要性及其效能,分析了影响通信系统性能的因素,力求在实时综合性能的基础上选择通信路由,论述了传统Petri网和模糊Petri网的一些基本概念和特点及其区别,描述了用模糊Petri网进行系统综合性能分析时的有效算法,提出一种基于综合性能的路由选择算法,最后,通过实例来说明通信路由综合性能评价以及路由选择方法.