无线传感器网络层次型拓扑结构控制

无线传感器网络拓扑控制是在满足网络覆盖和连通度的前提下,通过骨干网节点选择,剔除节点之间不必要的无线通信链路,生成一个高效的数据转发网络拓扑结构。层次型的拓扑结构控制利用分簇机制,让一些节点作为簇头节点,由簇头节点形成一个处理并转发数据的骨干网,其他非骨干网节点可以暂时关闭通信模块,进入休眠状态以节省能量。研究了改进的GAF虚拟地理网格分簇算法和TopD isc成簇算法。     

一种基于知识发现的拓展型竞争情报系统

目前,制约竞争情报发展的一个关键问题就是情报的收集与分析手段比较落后,远远不能胜任竞争情报系统所蕴含的特点和功效。本文将竞争情报作为一种特殊的知识,吸纳知识发现理论成果和方法,提升现有竞争情报系统的构造技术,真正做到快速、全面、准确和智能化的竞争情报生成和利用。     

基于QoS的Web服务发现技术的研究

为了满足用户对带有Qos约束的Web服务请求的需求,就需要建立一种能够按QOS值进行查询服务的方法.服务的QoS描述具有正和负两个方面的属性,因此如何量化成为一个具有成为查询依据的值成为该问题的的关键.给出一种时服务QoS量化计算的方法,可以把一组具有相同功能服务的QoS的进行量化,并作为用户需求发现的依据,从而为解决基于QoS约束的Web服务发现问题提出了一种有效的方法.     

Digital boundary tracking

In many three-dimensional imaging applications, the three-dimensional space is represented by an array of cubical volume elements (voxels) and a subset of the voxels is specified by some property. Objects in the scene are then recognised by being components of the specified set and individual boundaries are recognised as sets of voxel faces separating objects from components in the complement of the specified set. This paper deals with the problem of algorithmic tracking of such a boundary specified by one of the voxel faces lying in it. The paper is expository in that all ideas are carefully motivated and introduced. Its original contribution is the investigation of the question of whether the use of a queue (of loose ends in the tracking process which are to be picked up again to complete the tracking) is necessary for an algorithmic tracker of boundaries in three-dimensional space. Such a queue is not needed for two-dimensional boundary tracking, but published three-dimensional boundary trackers all make use of such a thing. We prove that this is not accidental: under some mild assumptions, a boundary tracker without a queue will fail its task on some three-dimensional boundaries.     

The role of topology in engineering design research

Aspects of the mathematical specialty of topology appear within several seemingly distinct areas of engineering design and engineering design theory. Indeed, the expression topology of a design is often used informally. In this article a primary intent is to demonstrate the diversity of applications of topology within engineering design. A complementary goal is to introduce the engineering design community to topology as a rich, formal, well-established mathematical discipline that may be of value for wider study. Upon reviewing some of these topological applications, it appears that topology holds promise as a basis for formalizing engineering design theory. This article considers topology as a basis for unifying design abstractions. The potential benefit may be the realization of commonalities between design aspects previously considered separately, where each now has its own attendant specialized, expensive analyses.     

IPv6中的邻居发现协议——NDP功能浅析

介绍了IPv6中的邻居发观协议的功能,并且详细阐述了知何利用ICMPv6中的信息控制报文来实现这些功能.     

分布式结构在IP网络管理中的应用

计算机网络被日益广泛地应用,越来越深入地影响着人类的生活。随着网络规模的不断扩大,管理维护网络的任务变得越来越困难。传统的网络管理系统采用集中式结构,已经不能适应现在普遍存在的大型网络的管理需要。当前存在三种典型网络管理体系结构:集中式、分布式、分层式,通过分析比较三种结构的优缺点,可以看出分布式结构拥有最多的忧点,非常适应当前大型网络管理的需要。本文介绍了一种分布式结构的实现方式。通过选举机制,通过拓扑发现节点之间维持一种动态的主从关系,并且系统对自身节点的故障有检测手段和一定的处理措施,从而大大增强了系统的健壮性。     

IPv4&IPv6共存网络隧道发现方法研究

本文对当前IPv4&IPv6共存网络中的隧道技术进行分析,提出一套改进型的基于源路由单点探测的骨干网隧道发现方法。该方法根据路径中双栈节点间的跳数变化和PMTU变化情况发现隧道,可以发现骨干网络交叉链路中的多级隧道。这对进一步研究过渡时期的网络拓扑发现技术具有一定的参考价值。     

Tree pattern mining with tree automata constraints

Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chemical compounds, protein structures, XML and Web log databases and social networks, require much more sophisticated data structures such as trees and graphs. In these contexts, interesting patterns involve not only frequent object values (labels) appearing in the graphs (or trees) but also frequent specific topologies found in these structures. Recently, several techniques for tree and graph mining have been proposed in the literature. In this paper, we focus on constraint-based tree pattern mining. We propose to use tree automata as a mechanism to specify user constraints over tree patterns. We present the algorithm CoBMiner which allows user constraints specified by a tree automata to be incorporated in the mining process. An extensive set of experiments executed over synthetic and real data (XML documents and Web usage logs) allows us to conclude that incorporating constraints during the mining process is far more effective than filtering the interesting patterns after the mining process.     

跨域服务注册中心的数据同步研究

为减少Web服务注册中心的用户响应时间,根据UDDIV3规范在分布式环境下建立跨域服务注册中心系统。将系统分为域间和域内两层,域间使用基于订阅的方式进行数据异步复制,域内使用动态主从复制方式进行数据同步复制,并优化UDDI的数据结构。分析优化前后的数据量,对该系统和节点间完全复制的系统进行比较。实验结果表明,该系统能够有效地提高服务注册中心的性能。