频谱感知次序的在线最优选择

动态频谱接入是解决无线电频谱资源短缺和频谱使用效率低下问题的有效方法,它允许次级用户在授权频谱空闲时动态地接入,以进行数据传输。而频谱感知是实现动态频谱接入的关键挑战之一。由于次级用户的感知能力有限,为了获得更多的频谱接入机会,需要尽快找到频谱空闲概率最大的频段,并研究频谱感知次序问题。考虑到频谱空闲概率对次级用户是不可知的,并且会随时间变化,提出了在线学习框架,把频谱感知次序问题归纳成经典多摇臂赌博机问题,并利用在线学习方法——满意折现汤普森抽样算法处理优化问题。仿真结果表明,和其他算法相比,所提算法可以获得更多的频谱接入机会并且能够跟踪频谱空闲概率的变化。     

嵌入式在线航空摄影测量方法

为满足空间数据实时处理的需求,提高航空摄影测量系统在线处理能力,研究一种在线摄影测量的理论与方法,运用嵌入式架构设计一种在线摄影测量系统,使用可编程门阵列(FPGA)方法、高级精简指令集机器组合数字信号处理器(ARM+DSP)方法等嵌入式计算技术建立专门的硬件运行环境,移植并优化现有算法到嵌入式系统中,实现摄影测量数据的在线处理。机载航摄实验结果表明,该方法能够实现对摄影测量数据进行快速稳定的在线处理,验证了运用嵌入式架构的在线摄影测量的可行性,把摄影测量的处理效率提高到了一个更高的水平,同时也进一步拓宽了摄影测量技术的应用领域。     

基于在线动平衡的磁轴承参数辨识

针对磁悬浮刚性转子系统,提出了一种基于在线动平衡的磁轴承参数辨识方法。采用已知大小和相位的不平衡质量作为激振源,根据动平衡仪测得的转子不平衡响应,求得磁轴承位移刚度和电流刚度。利用某型磁悬浮控制力矩陀螺对该方法进行了试验验证,得到了一定转速范围内的磁轴承位移刚度和电流刚度,证明了该方法的正确性和实用性。试验结果表明外转子型磁轴承位移刚度和电流刚度随转速的增加而下降明显。     

Improved bounds for batch scheduling with nonidentical job sizes

Here, we revisit the bounded batch scheduling problem with nonidentical job sizes on single and parallel identical machines, with the objective of minimizing the makespan. For the single machine case, we present an algorithm which calls an online algorithm (chosen arbitrarily) for the one‐dimensional bin‐packing problem as a sub‐procedure, and prove that its worst‐case ratio is the same as the absolute performance ratio of . Hence, there exists an algorithm with worst‐case ratio , which is better than any known upper bound on this problem. For the parallel machines case, we prove that there does not exist any polynomial‐time algorithm with worst‐case ratio smaller than 2 unless P = NP, even if all jobs have unit processing time. Then we present an algorithm with worst‐case ratio arbitrarily close to 2. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 351–358, 2014     

情报大数据治理框架研究

本文从情报处理的发展和演变着手,面向当前大数据技术飞速发展和情报数据量呈爆炸式增长的趋势,介绍了大数据治理的概念和本文对于大数据治理的理解,并进一步针对数据治理和数据清洗内涵的不同进行了区别说明。此外,还梳理了当前各国在大数据治理和大数据开发方面的现状,对我国在大数据治理方面的政策环境和技术发展情况进行了概括。本研究针对情报大数据的特点,分析了大数据治理对于情报数据发挥作用的重要性;针对情报大数据在数据治理方面面临的问题,分析了情报大数据治理的需求;在情报大数据治理框架方面,构建了由人员组织机构、治理机制、形成的能力、治理策略等方面组成的情报大数据治理模型;对情报大数据管理生命周期内的治理内容进行了描述;最后对情报大数据治理的前景进行了简单展望。     

On competitive analysis for polling systems

Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems.     

环境参数在线辨识及其在滑翔段制导中的应用

针对助推滑翔导弹,提出基于飞行环境参数在线辨识的滑翔段数值预测校正制导方法。综合考虑大气密度和气动系数对导弹运动的影响,引入滑翔段综合环境参数,利用扩展Kalman滤波方法对综合参数进行在线辨识。基于在线辨识结果,利用渐消记忆递推最小二乘方法在线建立环境参数预测模型,并利用最新辨识结果进行模型的在线修正。设计了纵向和横向制导律,并基于环境参数在线预测模型进行落点预测,以克服飞行环境扰动对落点预测精度的影响。进行了大气密度非定常扰动下的制导仿真,以及密度和气动参数随机扰动下的Monte Carlo仿真。仿真结果表明:环境参数在线预测模型能准确预报飞行环境参数,制导方法对飞行环境扰动具有较强的鲁棒性。     

On online bin packing with LIB constraints

In many applications of packing, the location of small items below large items, inside the packed boxes, is forbidden. We consider a variant of the classic online one‐dimensional bin packing, in which items allocated to each bin are packed there in the order of arrival, satisfying the condition above. This variant is called online bin packing problem with LIB (larger item in the bottom) constraints. We give an improved analysis of First Fit showing that its competitive ratio is at most , and design a lower bound of 2 on the competitive ratio of any online algorithm. In addition, we study the competitive ratio of First Fit as a function of an upper bound (where d is a positive integer) on the item sizes. Our upper bound on the competitive ratio of First Fit tends to 2 as d grows, whereas the lower bound of two holds for any value of d. Finally, we consider several natural and well known algorithms, namely, Best Fit, Worst Fit, Almost Worst Fit, and Harmonic, and show that none of them has a finite competitive ratio for the problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

舰载箔条冲淡干扰效果在线评估方法

针对作战应用时电子对抗干扰效果的在线评估问题,以舰载箔条冲淡干扰为例,提出基于我方干扰装备和被保护目标的实际状态和预期状态的差别进行评估。具体思路是综合考虑干扰弹发射延误、是否出现哑弹等作战使用因素对干扰成功概率的影响,结合舰载箔条冲淡干扰的干扰成功概率理论模型,实现干扰效果的在线评估。仿真结果表明,新方法对干扰效果的评估更具有实际应用价值。     

On the asymptotic optimality of algorithms for the flow shop problem with release dates

We consider the nonpermutation flow shop problem with release dates, with the objective of minimizing the sum of the weighted completion times on the final machine. Since the problem is NP‐hard, we focus on the analysis of the performance of several approximation algorithms, all of which are related to the classical Weighted Shortest Processing Time Among Available Jobs heuristic. In particular, we perform a probabilistic analysis and prove that two online heuristics and one offline heuristic are asymptotically optimal. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.