基于Mean-Shift的传感器动态偏差估计方法

针对系统误差变化规律未知时的传感器探测系统偏差估计问题,提出了一种改进的基于Mean-Shift(均值偏移)的传感器动态偏差估计算法.该算法利用Mean-Shift方法对不同样本点对估计结果贡献不同的特点,根据样本点偏离均值的偏移量以及偏移时间构建权系数.仿真结果表明,该方法在系统误差变化规律未知的情况下,可有效估计多...     

基于动力学和扩散分段控制的Mg/H2O反应模型及数值分析

为了数值研究宽广温度范围内Mg/H2O的反应特性,分别建立了考虑部分MgO在液滴表面凝聚的Mg/H2O扩散燃烧模型和基于Arrhenius公式的Mg/H2O反应动力学模型.数值研究了Mg/H2O反应速率在扩散控制和化学动力学控制下随反应条件变化的规律.研究结果表明,Mg液滴扩散燃烧时间计算结果与文献值相符;提高温度和水...     

Concavity and monotonicity properties in a groundwater management model

We consider a discrete‐time groundwater model in which the cost of pumping takes a slightly different form to that which has been traditional in the research literature to date. This enables us to prove that (a) the optimal pumping quantity is nondecreasing in the ground water stock, (b) the stock level remaining after each period's pumping is also nondecreasing in the groundwater stock, (c) the optimal decision is determined by maximizing a concave function, and finally (d) the optimal pumping quantity is nonincreasing in the number of periods to go. We show that (a)–(c), while intuitive, do not hold under traditional modeling assumptions. We also explain the connections between our results and similar ones for some classic problems of operations research. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2011     

多核系统中基于动态松弛时间回收的节能实时调度算法

许多嵌入式实时任务的实际执行时间往往小于最坏情况执行时间,因此可以产生大量的动态松弛时间.针对时限等于周期的偶发任务集,提出一种基于动态松弛时间回收的多核系统节能实时调度算法LRE-DVFS-ALL.该算法基于最优在线调度算法LRE-TL,利用TL面内节能实时调度思想,在每个TL面的提前完成时刻实现动态松弛时间回收,降...     

动态静态结合的雷达威力评估方法研究

静态评估方法利用标校系统模拟目标回波信号,检验雷达系统对于固定RCS目标的最远探测距离。动态评估方法根据动态校飞时目标运动参数,估算目标RCS和回波信号强度,推算出雷达系统的最小检测信号能力。两者相结合的方法可以使得雷达威力评估结果更加科学可信。     

基于虚拟样机的某型手枪发射动力学仿真研究

在分析某型手枪主要部件运动和受力特点的基础上,利用SolidWorks和ADAMS建立该手枪33个刚体28个自由度的虚拟样机模型。选取枪管角位移、枪机速度和位移为校验指标,将仿真结果与试验结果对比,验证了仿真分析的可信性;通过仿真得到了手枪各部件的运动和受力情况,为进一步的仿真及结构优化奠定了基础。     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Approximate dynamic programming methods for an inventory allocation problem under uncertainty

We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

动态教学法在《政治学原理》课程教学中的运用

政治学原理课程在授课过程中存在着教材内容的确定性和稳定性,而无论从国际国内形势还是从政治学研究而言,政治学所关注的范围和内容又都处于动态的不断发展变化的。笔者以为,只有在授课中具体运用动态教学法,通过联系学生自身、联系社会现实、联系国家大事、联系国际政治等实际,才能使政治学原理课程在马克思主义基本原则的指导下,更富有时代特征和生活气息,使学生真正学有所获。