基于规则的动态频谱接入研究

动态频谱接入面临的关键技术之一是对接入时机和方式进行有效地管控,防止由于频谱的接入使用过于灵活造成用频的干扰和混乱。将频谱接入的时间和方式给予规则上的约束和指导,基于规则构建动态频谱管理框架可以有效实现频谱的实时管控。对动态频谱接入的规则及表述方式进行了讨论,分析了基于规则的动态频谱接入过程,最后结合美军XG项目的试验结果分析了基于规则的动态频谱接入的应用前景。     

对流层散射下MPLS重路由信号去噪研究

针对对流层散射信道MPLS重路由信号数据含有噪声的问题,分析了Facility重路由原理和MPLS标签转发过程,引入小波阈值去噪算法对含噪声标签信号数据进行处理。利用一种随分解层数变化的阈值和折中阈值函数规则,来解决传统算法中的阈值确定和阈值函数选取存在的问题,针对折中阈值函数规则中参数a的确定问题,利用模拟数据,以信噪比(SNR)为目标函数,采用定步长变a形式,从而得到去噪效果最好时对应的a值,并用实测数据加以验证。仿真结果表明,改进后的算法在信噪比上有1.5 d B~3.4 d B的提高,均方差(RMSE)下降约0.01~0.03,为路由修复信号的去噪提供一种可行的方案。     

A bivariate optimal replacement policy for a cold standby repairable system with repair priority

In this article, an optimal replacement policy for a cold standby repairable system consisting of two dissimilar components with repair priority is studied. Assume that both Components 1 and 2, after repair, are not as good as new, and the main component (Component 1) has repair priority. Both the sequence of working times and that of the components'repair times are generated by geometric processes. We consider a bivariate replacement policy (T,N) in which the system is replaced when either cumulative working time of Component 1 reaches T, or the number of failures of Component 1 reaches N, whichever occurs first. The problem is to determine the optimal replacement policy (T,N)* such that the long run average loss per unit time (or simply the average loss rate) of the system is minimized. An explicit expression of this rate is derived, and then optimal policy (T,N)* can be numerically determined through a two‐dimensional‐search procedure. A numerical example is given to illustrate the model's applicability and procedure, and to illustrate some properties of the optimal solution. We also show that if replacements are made solely on the basis of the number of failures N, or solely on the basis of the cumulative working time T, the former class of policies performs better than the latter, albeit only under some mild conditions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Rolling‐horizon replenishment: Policies and performance analysis

We consider a rolling‐horizon (RH) replenishment modeling framework under which a buyer can update demand information and inventory status, modify order quantities committed previously, place an advanced order for a new period at the end of the RH, and move along in time seamlessly. We show that the optimal order policy for the two‐period RH problem is a dual‐threshold type for updating period(s) plus a base‐stock type for the advanced order. We provide analytical formulas and algorithms to compute the optimal thresholds and the optimal base‐stock level exactly. With our analytical results and numerical procedures, we demonstrate the significant value of RH replenishment in matching supplies to demands more closely. We also show that with RH updating (flexibility), the value of additional demand information beyond the RH diminishes quickly. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

无人机滑跑航迹控制模型与控制精度分析

航迹偏差的控制精度对滑跑起降至关重要,地面滑跑纠偏建模和地空航迹控制的切换策略是起降航迹控制设计的难点。从运动学关系出发,提出了地面滑跑纠偏控制的设计模型,使得复杂的地面航偏控制规律易于设计;利用同-反馈结构在多个状态的协调控制,实现了地空状态自然过渡的航迹控制切换策略;最后提出了提高航迹控制精度和进行风干扰补偿的措施。     

A note on “resource flexibility with responsive pricing”

We revisit the capacity investment decision problem studied in the article “Resource Flexibility with Responsive Pricing” by Chod and Rudi [Operations Research 53, (2005) 532–548]. A monopolist firm producing two dependent (substitutable or complementary) products needs to determine the capacity of one flexible resource under demand risk so as to maximize its expected profit. Product demands are linear functions of the prices of both products, and the market potentials are random and correlated. We perform a comparative statics analysis on how demand variability and correlation impact the optimal capacity and the resulting expected profit. In particular, C&R study this problem under the following assumptions/approximations: (i) demand intercepts follow a bivariate Normal distribution; (ii) demand uncertainty is of an additive form; (iii) and under approximate expressions for the optimal capacity and optimal expected profit. We revisit Propositions 2, 3, 4, 5, and 10 of C&R without these assumptions and approximations, and show that these results continue to hold (i) for the exact expressions for the optimal expected profit and optimal capacity, and (ii) under any arbitrary continuous distribution of demand intercepts. However, we also show that the additive demand uncertainty is a critical assumption for the C&R results to hold. In particular, we provide a case of multiplicative uncertainty under which the C&R results (Propositions 2 and 3) fail. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

复合材料层合板疲劳寿命形状参数与门槛值分析方法

复合材料性能具有较大的分散性,在表征复合材料疲劳寿命时,必须考虑分散性的影响.以M21C复合材料开孔层合板为研究对象,采用Sendeckyj等效静强度模型和随机变量函数的概率分布方法推导了复合材料层合板疲劳寿命形状参数和剩余强度形状参数的关系,通过试验和统计的方法获得了M21 C复合材料开孔层合板的疲劳寿命形状参数和疲...     

基于复杂背景的图像分割算法

针对圆柱形钢棒在线计数特定的复杂背景提出了基于双阈值结合数学形态学运算的分割算法。首先分别根据2个阈值进行分割得到2幅二值图像,然后根据目标是圆形以及其大致位置等先验知识分别对2幅图进行腐蚀,开启,闭合等数学形态学运算,最后将高阈值分割得到的图像中的边界信息叠加到低阈值分割得到的图像中。实验结果表明,本方法作为本系统的图像预处理是有效的。     

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