多种类病毒相互作用下网络信道破坏程度估计

在多种类病毒的相互作用下,网络信道破坏程度呈现较强的非线性特点,不能准确约束病毒在相互作用下的破坏性.传统的网络破坏程度估计的过程中,仅仅以单一病毒破坏程度叠加的方式去计算参数,计算具有较强的主观性,没有准确描述不同病毒的破坏作用,对评估结果误差影响较大.为解决上述问题,提出一种基于粒子滤波算法的多种类病毒相互作用下网络信道破坏程度估计方法,利用欧式距离方法对全部病毒进行分类,获取不同类型病毒的网络信道破坏程度值.通过粒子滤波算法对单一个体约束的优势,将每一个不同类型的病毒看作一个粒子,并进行训练.根据训练结果,利用粒子滤波算法对当前时刻网络信道破坏程度进行估计,完成整体评估.实验结果表明,利用改进算法进行多种类病毒相互作用下网络信道破坏程度估计,能够有效提高估计的准确率.     

Recover Fault Services via Complex Service-to-Node Mappings in Wireless Sensor Networks

With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node’s perspective i.e., migrating the service of faulty node to it’s nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don’t fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level.     

虚拟化技术在数字化校园建设中的研究与应用

随着信息化技术的加速发展,数字化校园建设势必导致服务器数量的不断增加,给管理带来了巨大挑战.本文研究了服务器虚拟化部署方案,并将江西财经大学选课系统的WEB应用从实体服务器迁移到虚拟机上,通过对虚拟机和实体机的性能监测对比分析,发现虚拟机具有很强的替代性和推广型,为今后基于虚拟机技术构建数字化校园服务平台提供了可参考的实践依据.     

Nonsmooth identification of mechanical systems with backlash-like hysteresis

Backlash-like hysteresis is one of the nonsmooth and multi-valued nonlinearities usually existing in mechanical systems. The traditional identification method is quite difficult to be used to model the systems involved with such complex nonlinearities. In this paper, a nonsmooth recursive identification algorithm for the systems with backlash-like hysteresis is proposed. In this method, the concept of Clarke subgradient is introduced to approximate the gradients at nonsmooth points and the so-called bundle method is used to obtain the optimization search direction in nonsmooth cases. Then, a recursive algorithm based on the idea of bundle method is developed for parameter estimation. After that, the convergence analysis of the algorithm is investigated. Finally, simulation results to validate the proposed method on a simulated mechanical transmission system are presented.     

A High-Precision Time Handling Library

An appropriate assessment of end-to-end network performance presumes highly efficient time tracking and measurement with precise time control of the stopping and resuming of program operation. In this paper, a novel approach to solving the problems of highly efficient and precise time measurements on PC-platforms and on ARM-architectures is proposed. A new unified High Performance Timer and a corresponding software library offer a unified interface to the known time counters and automatically identify the fastest and most reliable time source, available in the user space of a computing system. The research is focused on developing an approach of unified time acquisition from the PC hardware and accordingly substituting the common way of getting the time value through Linux system calls. The presented approach provides a much faster means of obtaining the time values with a nanosecond precision than by using conventional means. Moreover, it is capable of handling the sequential time value, precise sleep functions and process resuming. This ability means the reduction of wasting computer resources during the execution of a sleeping process from 100% （busy-wait） to 1-1.5%, whereas the benefits of very accurate process resuming times on long waits are maintained.