基于ABM方法的空间碎片网捕体系结构建模

空间碎片网捕是一种新型的空间碎片清理方式。首先介绍了基于活动的建模方法(ABM)以及进行体系结构建模的流程,之后基于系统的基本工作流程,使用System Architect软件对空间碎片网捕任务的体系结构进行了可视化建模,得到了典型的作战视图,并进行了任务流程的仿真;对理解空间目标网捕系统的功能、研究空间碎片网捕任务的流程,提出系统构建需求具有一定的参考价值。。     

应然与实然:网络对大学生政治社会化的影响及对策分析

随着现代科学技术的发展,网络是大学生获取政治信息、进行政治表达、参与政治活动的重要途径。由于网络信息传播的特性,对大学生政治社会化具有双重影响,为保证大学生政治社会化的健康发展,文章探析了网络对大学生政治社会化的影响,并针对负面影响提出了发挥"两课"教育作用促进政治文化习得,营造良好的网络环境促进政治文化认同,引导理性的政治实践提升政治生活参与能力等具体对策。     

A sequential dynamic pricing model and its applications

Consider a sequential dynamic pricing model where a seller sells a given stock to a random number of customers. Arriving one at a time, each customer will purchase one item if the product price is lower than her personal reservation price. The seller's objective is to post a potentially different price for each customer in order to maximize the expected total revenue. We formulate the seller's problem as a stochastic dynamic programming model, and develop an algorithm to compute the optimal policy. We then apply the results from this sequential dynamic pricing model to the case where customers arrive according to a continuous‐time point process. In particular, we derive tight bounds for the optimal expected revenue, and develop an asymptotically optimal heuristic policy. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

The “signature” of a coherent system and its application to comparisons among systems

Various methods and criteria for comparing coherent systems are discussed. Theoretical results are derived for comparing systems of a given order when components are assumed to have independent and identically distributed lifetimes. All comparisons rely on the representation of a system's lifetime distribution as a function of the system's “signature,” that is, as a function of the vector p= (p₁, … , p_n), where p_i is the probability that the system fails upon the occurrence of the ith component failure. Sufficient conditions are provided for the lifetime of one system to be larger than that of another system in three different senses: stochastic ordering, hazard rate ordering, and likelihood ratio ordering. Further, a new preservation theorem for hazard rate ordering is established. In the final section, the notion of system signature is used to examine a recently published conjecture regarding componentwise and systemwise redundancy. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 507–523, 1999     

Optimal policies for stochastic clearing systems with time-dependent delay penalties

We study stochastic clearing systems with a discrete-time Markovian input process, and an output mechanism that intermittently and instantaneously clears the system partially or completely. The decision to clear the system depends on both quantities and delays of outstanding inputs. Clearing the system incurs a fixed cost, and outstanding inputs are charged a delay penalty, which is a general increasing function of the quantities and delays of individual inputs. By recording the quantities and delays of outstanding inputs in a sequence, we model the clearing system as a tree-structured Markov decision process over both a finite and infinite horizon. We show that the optimal clearing policies, under realistic conditions, are of the on-off type or the threshold type. Based on the characterization of the optimal policies, we develop efficient algorithms to compute parameters of the optimal policies for such complex clearing systems for the first time. We conduct a numerical analysis on the impact of the nonlinear delay penalty cost function, the comparison of the optimal policy and the classical hybrid policy (ie, quantity and age thresholds), and the impact of the state of the input process. Our experiments demonstrate that (a) the classical linear approximation of the cost function can lead to significant performance differences; (b) the classical hybrid policy may perform poorly (as compared to the optimal policies); and (c) the consideration of the state of the input process makes significant improvement in system performance.     

Optimal stopping in software testing

In this paper we address the problem of how to decide when to terminate the testing/modification process and to release the software during the development phase. We present a Bayesian decision theoretic approach by formulating the optimal release problem as a sequential decision problem. By using a non‐Gaussian Kalman filter type model, proposed by Chen and Singpurwalla (1994), to track software reliability, we are able to obtain tractable expressions for inference and determine a one‐stage look ahead stopping rule under reasonable conditions and a class of loss functions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Simultaneous production of market‐specific and global products: A two‐stage stochastic program with additional demand after recourse

This paper analyzes the simultaneous production of market‐specific products tailored to the needs of individual regions and a global product that could be sold in many regions. We assume that the global product costs more to manufacture, but allows the decision concerning the allocation of products to regions to be delayed until after the manufacturing process has been completed. We further assume that there is additional demand after the region allocation but prior to delivery, extending the two‐stage stochastic program with recourse to include additional stochastic demand after the recourse. This scenario arises, for example, when there is additional uncertainty during a delivery delay which might occur with transoceanic shipments. We develop conditions for optimality assuming a single build‐allocate‐deliver cycle and stochastic demand during both the build and deliver periods. The optimal policy calls for the simultaneous production of market‐specific and global products, even when the global product is substantially more costly than the market‐specific product. In addition, we develop bounds on the performance of the optimal policy for the multicycle problem. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 438–461, 2003     

Inventory control and periodic price discounting campaigns

This paper develops an inventory model that determines replenishment strategies for buyers facing situations in which sellers offer price‐discounting campaigns at random times as a way to drive sales or clear excess inventory. Specifically, the model deals with the inventory of a single item that is maintained to meet a constant demand over time. The item can be purchased at two different prices denoted high and low. We assume that the low price goes into effect at random points in time following an exponential distribution and lasts for a random length of time following another exponential distribution. We highlight a replenishment strategy that will lead to the lowest inventory holding and ordering costs possible. This strategy is to replenish inventory only when current levels are below a certain threshold when the low price is offered and the replenishment is to a higher order‐up‐to level than the one currently in use when inventory depletes to zero and the price is high. Our analysis provides new insight into the behavior of the optimal replenishment strategy in response to changes in the ratio of purchase prices together with changes in the ratio of the duration of a low‐price period to that of a high‐price period. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

防空组网雷达“四抗”能力综合评估

为正确评估防空组网雷达"四抗"能力,结合雷达组网的因素分析,建立了组网雷达系统层次结构模型,并利用层次分析法确定了各因素的权重,用最优指标法得出指标层的得分值,提出了组网雷达"四抗"综合能力量化评估方法.其评估结果在一定程度上为组网雷达性能优化提供了决策依据.     

基于Petri网的指挥流程建模与优化

鉴于Petri网在企业业务流程优化与重组方面的成功运用,遂将Petri网原理应用于作战指挥流程的建模与优化,以期获得最优作战指挥流程.文中首先阐述Petri网基本原理,然后介绍指挥流程建模的Petri网模型,最后给出指挥流程优化的原则及基本模型,并利用Petri网对指挥流程进行建模和优化,结果表明Petri网理论能够明显优化作战指挥流程.提高作战指挥效率.