论局域网安全内部防范

近些年,随着科技的飞速发展,我国正在逐步迈入信息化的社会,网络改变了人们的工作、生活以及学习的方式。然而,尽管信息产业给人们的生活带来了很多便利,但是也面临很多的风险。在现实生活中,系统随时都遭到病毒的感染或者是黑客的入侵,给人们造成无法计算的损失。现如今,很多单位都已经建立了局域网络,工作人员在局域网中共享单位的内部信息,尽管局域网具有传输速度快、运行稳定等特点,但是局域网的安全保障结构缺少。由此看来,科学、合理的使用局域网显得非常重要。文章通过对局域网相关方面的保护进行了详细阐述,提高局域网内部安全的管理水平。     

基于PCC的励磁调节器在水电站的应用

PCC由于其可靠性和可扩展性而被应用到励磁调节器实现方案中。本文介绍了一种基于PCC（CPU模块IP161）的励磁调节器,描述了其测频、测相、交流采样、脉冲形成等高速任务的实现原理,给出了现场试验波形。最后在控制性能和可靠性方面与常规DSP励磁调节器做了对比。     

电子文档防扩散体系建设研究

本文针对目前日益凸显的电子文档泄漏问题,对国内电子文档保护现状和存在的问题进行了分析,从原理和实现方式等方面对比了主流文档保护产品,总结了在建立电子文档防扩散体系时应确定的防护原则,并对管理和技术要点进行了分析,为电子文档防扩散系统的建设提供了建议。     

A data access framework for service-oriented rich clients

Facilitated by the SOA and new Web technologies, Service-Oriented Rich Clients (SORCs) compose various Web-delivered services in Web browser to create new applications. The SORCs support client-side data storage and manipulation and provide more features than traditional thin clients. However, the SORCs might suffer from data access issues, mainly due to both client-side incompatible data sources and server-side improper or even undesirable cache strategies. Addressing the data access issues, this paper proposes a data access framework for SORCs. The main contributions of this paper are as follows. First, the framework makes the SORCs accommodate heterogeneous local storage solutions and diverse Web browsers properly. The framework abstracts the underlying details of different local storages and selects the most proper data sources for current SORC in use. Secondly, the framework provides a cache mechanism, which supports client-side customized cache strategies. An adaptive technique for the strategies is also proposed to adjust cache strategies based on users?? historical actions to achieve better performance.     

基于无线网络控制的智能照明系统

根据节能环保、智能家居的需求,采用LED灯和TI的SoC芯片CC2431设计了一套基于ZigBee无线网络控制的智能照明系统。该系统可在兼容已有调光模式的基础上,利用照度值来精细调节局部照度,从而实现简单的照明定位控制。文中详细阐述了系统各个模块的软硬件设计方法。经实际室内测试表明:该系统性能良好,操控简便,而且更加人性化。     

Towards an effective integration of cellular users to the structured Peer-to-Peer network

Integration of cellular users into the peer-to-peer (P2P) network is still in limbo due to limitations caused by heterogeneity, mobility and time-varying capacities of the wireless channel. If traditional Chord is employed to include users from the cellular networks, users under the same base station scatter in logical topology randomly. In this paper, we present a novel cellular Chord (C-Chord) P2P system that integrates the cellular users into the well-established structured P2P network in a topology-aware fashion. C-Chord offers the cellular users a choice of downloading contents either from the Internet peers at a faster rate or from other cellular users from the same base station avoiding the Internet data penalty. We also incorporate the peer selection module based on stable marriage problem that chooses the appropriate candidate from the discovered potential senders. We conduct extensive simulations to evaluate the performance of the proposed C-Chord P2P system and the peer selection module. Simulation results show that the path-length per lookup query is smaller than that of the traditional Chord system. Overhead due to renewal of routing information is also smaller for the cellular users in the C-Chord system. We also measure the throughput at the cellular receivers to analyze the effects of selecting peers either from same base station or from outside the Internet gateway. Throughput also increases dramatically due to an intelligent selection of peers among the potential senders.     

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.     

多特征自适应融合的粒子滤波跟踪算法

针对跟踪过程中目标形态不断变化或部分遮挡导致鲁棒性差的问题,提出一种基于多特征自适应融合的粒子滤波跟踪算法.该算法从视觉特征集中选取了描述能力强的2种特征,并将其按照与目标模型的多尺度相似度进行线性融合;为了减小跟踪漂移,通过计算当前目标模型与初始目标模型的多尺度相似度自适应地更新目标模型.大量仿真实验结果表明,文中算法可以鲁棒地跟踪到部分遮挡和形态变化的运动目标.     

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

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