Achieving fair service with a hybrid scheduling scheme for CICQ switches

Providing performance guarantees for arriving traffic flows has become an important measure for today’s routing and switching systems. However, none of current scheduling algorithms built on CICQ (combined input and cross-point buffered) switches can provide flow level performance guarantees. Aiming at meeting this requirement, the feasibility of implementing flow level scheduling is discussed thoroughly. Then, based on the discussion, it comes up with a hybrid and stratified fair scheduling (HSFS) scheme, which is hierarchical and hybrid, for CICQ switches. With HSFS, each input port and output port can schedule variable length packets independently with a complexity of O(1). Theoretical analysis show that HSFS can provide delay bound, service rate and fair performance guarantees without speedup. Finally, we implement HSFS in SPES (switch performance evaluation system) to verify the analytical results.     

基于C#的电子文档管理系统

鉴于工作中积累了各种各样的文件,数量多、存储分散,易造成文档查找困难等问题,设计了办公电子文档管理系统,实现了资料管理、资料查阅、用户管理、打印管理和系统管理功能。实用管理的功能保证了文档资料能够最大化实现其价值,作为科研人员有力的参考资料。     

A formal model for the interoperability of service clouds

Large-scale service-oriented computing is based on the idea that services from various servers are combined into one distributed application. Referring to a collection of services on one server as a ??service cloud??, the problem investigated in this paper is to define formal high-level specifications of such distributed applications and to enable the location of suitable services for them. Based on the language-independent model of Abstract State Services (AS²s), which serves as a universal integrated model for data and software as services, we extend AS²s by high-level action schemes called ??plots?? as a means to specify permitted sequences of service operations. On these grounds, we develop a model for service mediators, that is, specifications of composed services in which service slots have to be filled by actual services, and investigate matching conditions for slots of mediators and services. For a services to match a slot in a mediator, a (generalised) projection of the mediator must comply with the plot of the service. Furthermore, the service must be semantically adequate, which requires the use of a service ontology.     

主机数据流量检测的实现

分布式网络环境中主机数据流量的异常通常反映出主机是否遭受病毒、木马等恶意程序的入侵而成为网络攻击中的傀儡机,因此,对主机数据流量进行监测可以尽早发现潜在的危险。研究了基于Cisco路由器的主机数据流量检测的基本方法,并给出了具体的程序实现方法和网络硬件环境配置方法。     

An efficient search mechanism for supporting partial filename queries in structured peer-to-peer overlay

Accompanying the growth of the Internet, computers throughout the world can connect to each other and exchange information, increasing the convenience and efficiency of information-based work. The advent of data-sharing applications, such as Napster and Gnutella, has made peer-to-peer (P2P) systems popular for widespread exchange of resources and voluminous information between millions of users. In recent years, research issues associated with P2P systems have been discussed widely. To resolve the file-availability problem and improve the workload, a method called the Distributed Hash Table (DHT) has been proposed. However, DHT-based systems in structured architectures cannot support efficient queries, such as a similarity query, range query, and partial-match query, due to the characteristics of the hash function. This study presents a novel scheme that supports filename partial-matches in structured P2P systems. The proposed approach supports complex queries and guarantees result quality. Experimental results demonstrate the effectiveness of the proposed approach.     

A new parallel particle filter face tracking method based on heterogeneous system

This paper proposed a multi-cue-based face-tracking algorithm with the supporting framework using parallel multi-core and one Graphic Processing Unit (GPU). Due to illumination and partial-occlusion problems, face tracking usually cannot stably work based on a single cue. Focusing on the above-mentioned problems, we first combined three different visual cues??color histogram, edge orientation histogram, and wavelet feature??under the framework of particle filters to considerably improve tracking performance. Furthermore, an online updating strategy made the algorithm adaptive to illumination changes and slight face rotations. Subsequently, attempting two parallel approaches resulted in real-time responses. However, the computational efficiency decreased considerably with the increase of particles and visual cues. In order to handle the large amount of computation costs resulting from the introduced multi-cue strategy, we explored two parallel computing techniques to speed up the tracking process, especially the most computation-intensive observational steps. One is a multi-core-based parallel algorithm with a MapReduce thread model, and the other is a GPU-based speedup approach. The GPU-based technique uses features-matching and particle weight computations, which have been put into the GPU kernel. The results demonstrate that the proposed face-tracking algorithm can work robustly with cluttered backgrounds and differing illuminations; the multi-core parallel scheme can increase the speed by 2?C6 times compared with that of the corresponding sequential algorithms. Furthermore, a GPU parallel scheme and co-processing scheme can achieve a greater increase in speed (8×?C12×) compared with the corresponding sequential algorithms.     

Prediction mode modulated data-hiding algorithm for H.264/AVC

In this paper, a data-hiding algorithm with large data payload for H.264/AVC is proposed. The secret information is embedded by modulating the prediction modes of 4?×?4 luminance blocks. If the best mode does not match the information bit, the prediction mode should be modulated by replacing the best mode with the substitute mode. The substitute mode is the one with the least Lagrangian cost among those having different parity with the best mode. Due to high secrecy and easy reproducibility of chaos, the secret information is first encrypted by a chaotic sequence and then a small number of luminance blocks used for data embedding are randomly selected in each macroblock based on another chaotic sequence. The usefulness of multilevel chaotic keys and privacy of the number of 4?×?4 luminance blocks enhance the security. The hidden information can be extracted directly from the encoded stream without resorting to the original video, and merely requires decoding the intra-prediction mode from bit stream rather than decoding the whole video. Experimental results show that the proposed hiding scheme can effectively embed information with little bit rate increase and almost no quality degradation.     

边界对齐的平滑三维对称标架场

为了把广泛应用于网格四边形化和纹理合成的二维表面标架场拓展到三维,提出一种生成三维对称标架场的方法.不同于表面对称标架场(四对称方向场),二维标架场的对称性能用一个切平面的旋转角度来表示,而三维对称标架场的对称性却不能这样简单地表示.为了解决这个问题,利用球面函数来获得一个对称性表述,该表述对于绕任意一个轴的π/2旋转以及它们的复合是不变的.基于球面函数的表示可以获得一个有效的标架场光顺程度的度量,并以球面调和分析进行加速计算;基于一组边界约束,可以通过极小化这个度量函数来获得一个光顺的标架场,该标架场在表面上能很好地对齐法线.最后通过表面投影、流线追踪和奇异点来可视化这个标架场,并将这个光顺的标架场用于六面体网格生成,且讨论了它在生成高质量纯六面体网格方面的潜力,其与表面标架场在生成四边形网格方面的潜力是一致的.     

基于区间树硬件加速索引的Marching Cubes算法

为了充分利用GPU的海量线程并行架构,提高等值面可视化效率,提出一种基于区间树硬件加速索引的Marching Cubes算法.该算法在预计算阶段利用GPU构造多区域的区间树作为体数据体素的值域索引;在实时运行阶段根据用户给定的阈值,通过该索引并行地搜索活跃体素,并生成活跃体素的多级索引,然后分配线程处理活跃体素,抽取并绘制等值面.将文中算法应用到不同体数据上的实验结果表明,其能够显著地提高现有Marching Cubes算法的效率;与现有的GPU基准算法相比,最高能达到4～10倍的加速比.