基于隐马尔可夫模型的行为轨迹还原算法

针对行为轨迹还原过程中观察序列状态缺失、无法对终端轨迹进行精确还原的问题,提出一种基于隐马尔可夫模型的行为轨迹还原算法。利用基站布局的空间相关性,在不考虑缺失观察状态的情况下,对隐马尔可夫模型求解过程中的局部概率进行修订,还原出轨迹序列。性能分析和仿真结果表明,状态倾向度越大,轨迹还原成功率越高,当状态倾向度取0.8时,轨迹还原成功率在90%左右。     

多重QoS的区分业务到无线链路的优化映射

提出一种新的具有多重服务质量保证的区分业务到无线链路的优化映射。在保证丢包率的条件下,建立线性整数规划模型,采用搜索求解,实现资源消耗最小的区分业务到无线链路业务类别映射。在已知类别映射的条件下,基于统计流模型,用最陡下降法求解丢包率,建立时延误差最小映射的带宽分配优化模型,且考虑链路时变对带宽分配的影响。仿真结果表明,相比其他方法,该优化映射可使总的资源消耗、丢包率以及时延映射误差达到最小,并能够跟踪链路时变。     

无标度网络中的链路预测问题研究

研究无标度网络中的链路预测问题。针对人造网络和实际社会网络,分别介绍静态和动态2种链路预测的实现过程,探究利用相似性进行链路预测的可行性,并验证多种相似度计算方法的准确性。对预测结果进行有效性分析,同时根据不同网络特性给出相应的预测算法。     

基于双观测器的网络控制系统稳定性分析

网络控制系统存在网络诱导时延和数据包丢失等问题,使网络控制系统控制性能下降甚至导致系统不稳定,同时在实际应用中存在双闭环的情况,并且一些系统的状态不可测量。针对上述问题,设计2个状态观测器,利用测量输出进行状态重构,并采用状态观测器对丢包进行补偿,应用指数稳定定理分析整个系统的闭环稳定性,给出状态控制率的求解方法。仿真结果证明,该方法能有效补偿网络控制系统的性能,保证在时延和有数据包丢失情况下的网络控制品质。     

基于非光滑观测器的间隙三明治系统状态估计

在工业领域, 机械传动系统、液压系统等往往含有间隙特性, 这类系统可以用带间隙的三明治系统描述. 本文针对带间隙的三明治系统特点, 构建了一种非光滑观测器以对系统状态进行估计. 首先根据带间隙三明治系统的特点, 采用分离原理, 建立了描述系统特性的非光滑状态空间方程. 据此构造了能够随系统工作区间变化而自动切换的非光滑观测器, 给出了相应的收敛定理及其证明. 最后通过伺服液压系统的例子, 分别比较了非光滑观测器和传统的观测器对状态的跟踪效果, 比较结果表明非光滑观测器对于带间隙三明治系统状态变量估计的准确性要优于传统的观测器.     

改进的GMPF在动态跟踪系统中的应用

针对动态跟踪系统的非线性问题,提出一种非线性非高斯性能较优的状态估计器:考虑最新观测值的影响,使用基于平方根二阶差分(SRDD2)的高斯混合(GM)模型给出粒子滤波的建议分布.重要性采样和再采样阶段分别采用基于蒙特卡罗的重要性采样和进化的再采样方法,以减轻粒子滤波(PF)的样本退化问题,增强样本的多样性.实验结果表明,与平方根二阶差分Kalman滤波、PF、GM粒子滤波相比,该状态估计器提高了动态跟踪系统状态估计器的综合估计性能.     

多速率传感器不完全测量数据自适应融合算法

针对不完全测量的多速率传感器系统,建立了自适应的分级融合算法。该算法构建了传感器子系统故障检测方法,检测子系统故障,确认不完全测量,避免单点故障污染整个系统;建立子系统的切换控制逻辑,引入映射矩阵,构成新的信息分享系数,自适应地选择子系统参与中心融合;对于不完全测量信息的传感器子系统,利用子滤波预测值代替估计值进行融合;全局状态估计利用各子系统的当前与前一时刻的估计值,提高了融合性能。对建立的算法进行仿真,验证了该算法的有效性。     

基于隐Lyapunov 函数的软变结构控制: 一种控制策略

针对变结构控制的抖振问题,基于隐Lyapunov函数,提出一种新的控制策略:软变结构控制.首先给出软变结构控制的定义和控制器的构造方法;然后设计软变结构控制器和隐Lyapunov区域,给出了控制不受限和控制受限两种情形的软变结构控制,同时,分析了带有状态观测器的软变结构控制.软变结构控制是无滑模的变结构控制,能有效削弱抖振,保持高速调节速度和缩短趋近时间.仿真实例表明了该方法的有效性和可行性.     

Improving Application Launch Performance on Solid State Drives

Application launch performance is of great importance to system platform developers and vendors as it greatly affects the degree of users’ satisfaction.The single most effective way to improve application launch performance is to replace a hard disk drive (HDD) with a solid state drive (SSD),which has recently become affordable and popular.A natural question is then whether or not to replace the traditional HDD-aware application launchers with a new SSD-aware optimizer.We address this question by analyzing the inefficiency of the HDD-aware application launchers on SSDs and then proposing a new SSD-aware application prefetching scheme,called the Fast Application STarter (FAST).The key idea of FAST is to overlap the computation (CPU) time with the SSD access (I/O) time during an application launch.FAST is composed of a set of user-level components and system debugging tools provided by Linux OS (operating system).Hence,FAST can be easily deployed in any recent Linux versions without kernel recompilation.We implement FAST on a desktop PC with an SSD running Linux 2.6.32 OS and evaluate it by launching a set of widely-used applications,demonstrating an average of 28% reduction of application launch time as compared to PC without a prefetcher.     

Combining an alternative multi-delivery policy into economic production lot size problem with partial rework

This paper combines an alternative multi-delivery policy into an imperfect economic production quantity (EPQ) model with partial rework, with the purpose of reducing supplier’s stock holding cost. We extend the problem examined by Chiu et al. [Chiu, Y.-S. P, Chiu, S. W., Li, C.-Y., & Ting, C.-K. (2009). Incorporating multi-delivery policy and quality assurance into economic production lot size problem. Journal of Scientific and Industrial Research, 68(6), 505-512] by considering an n + 1 delivery policy in lieu of n multi-delivery plan for the specific EPQ model with partial rework. Under such a policy, an initial delivery of perfect (finished) items is distributed to customer for satisfying product demand during manufacturer’s regular production time and rework time. At the end of rework, fixed quantity n installments of the finished products are delivered to customer at a fixed interval of time. As a result, a closed-form optimal replenishment batch size solution to the problem is obtained. A numerical example with analysis and comparison is provided to show practical usage of the proposed model and demonstrate its significant savings in stock holding cost.