SDN中基于KMOBPSO的高可靠性控制器部署算法

针对SDN中控制器系统的单节点故障问题,兼顾系统成本和系统时延,应用N+1冗余备份模型来提高SDN控制器部署的可靠性,并将其抽象为多目标优化问题.同时,提出了一种融合K-means聚类算法和遗传算子的多目标二进制粒子群算法——KMOBPSO算法,以求解SDN控制器高可靠性部署问题的解.仿真结果表明,所提算法具有求解精度高、分布均匀、沿Pareto前沿面覆盖广的特点,能够显著提高SDN中控制器部署的可靠性.     

On the performance of band-limited asynchronous DS-CDMA over nakagami-m channels

In this paper we investigated the BER performance of DS-CDMA using various chip-waveforms, which include three time-limited chip-waveforms and two band-limited chip-waveforms. Closed-form formulae were derived for evaluating the achievable bit-error rate performance with the aid of the standard Gaussian approximation, when communicating over a Nakagami-m channel. The time-limited waveforms impose a low implementational complexity, since they maybe over sampled and read from a look-up table. However, they are outperformed by the frequency-domain raised-cosine waveform as well as the optimum waveform specifically designed by Cho and Lehnert for achieving the lowest possible bit error rate     

关于天然气水合物钻采工艺技术进展的研究

目前全球正面临着前所未有的能源危机，天然气水合物由于储量大、能量密度高而将成为一种诱人的新型能源。天然气水合物主要存在于冻土带和海洋，在地下处于低温和高压状态，以现有的技术，钻井和开采都存在很大的困难。简要介绍了天然气水合物的性质及储量，阐述了天然气水合物钻井的六个挑战及目前国外天然气水合物的两种钻探方法；同时阐述了以热力法、降压法和化学试剂注入法为主的天然气水合物开采方法，并针对天然气水合物钻采技术现状指出了下一步的研究方向。     

炼油厂全流程优化建模方法研究

为了克服使用线性规划和单处理单元非线性规划进行生产优化的内在缺点，在建立原油单元、催化裂化、催化重整和汽油调合等4个重要处理单元详细模型的基础上，将单处理单元非线性过程模型集成到一个全流程优化非线性模型中。优化的目标函数是使炼油厂全厂利润最大。决策变量是那些显著影响全厂效益的变量，约束条件是单个处理单元约束条件的集合。对某炼油厂进行实例研究，结果表明该全流程模型能有效处理全厂优化问题，所得利润在线性规划的基础上提高4．5％。     

相关条件下基于N-P准则的分布式检测理论研究

本文针对并行网络、二元局部判决的情况,研究了在相关条件下基于N-P准则的分布式检测融合算法,给出了在联合概率密度已知和未知两种情况下的最优融合规则的理论推导及相应的解决方案,并在实验仿真的基础上,得到了部分有益的结论。     

应用时频分析方法辨识时变系统的模态参数

应用Gabor展开及Hilbert变换进行时变线性系统模态参数的辨识。利用非平稳信号的Gabor变换将结构响应信号表示在时频面上，并通过Gabor展开重构分离模态分量，建立每一阶模态的时变线性模型。对单模态时变线性模型应用Hilbert变换来辨识随时间变化的模态频率和阻尼。通过对刚度和阻尼慢变的两自由度系统模态参数的仿真辨识验证辨识方法的有效性。仿真结果表明：本文方法为时变线性系统的模态参数辨识提供了一条新的途径。     

微流控分析芯片制作中的低温键合技术

微流控分析芯片制作方法的研究是微流控分析的基础。制作性能良好的微流控分析芯片时,基片与盖片的键合技术十分重要。本文针对近年来发展迅速的低温键合技术,对各种方法进行了评价,并对其发展前景进行了展望。     

Modeling node mobility for reliable packet delivery in mobile ip networks

In this paper, we analyze node mobility for reliable packet delivery in mobile IP networks. In mobile IP, packets destined to roaming nodes are intercepted by their home agents and delivered via tunneling to their care of addresses (CoA). A mobile node may roam across multiple subnets. At each boundary crossing, a handoff is initiated such that the CoA is updated and a new tunnel is established. We consider both basic mobile IP handoff and smooth handoff. We find that reliable packet delivery in mobile IP networks can be modeled as a renewal process, because the retransmission over a new tunnel after each boundary crossing is independent of the previous history. We then derive the probability distribution of boundary crossings for each successful packet, based on which the packet reliable delivery time can be obtained. Our analytical model is derived based on a general distribution of residence time in a subnet and a general distribution of successful retransmission attempts in each subnet. The results can be readily applied to any distributions for both items. We also provide numerical examples to calculate the probability distribution of boundary crossings, and conduct simulations to validate our analytical results