应用烃类直接检测技术预测天然气藏

柴达木盆地位于青藏高原北部，是中国大型含油气盆地之一，历经４０年的勘探，发现了丰富的油气资源。柴达木盆地东部地区是第四纪沉降与沉积中心，区内第二系生储气岩厚度大、分布广、第四纪新构造运动形成的同生沉积构造发育、保存完整、具有形成大中型天然气田的地质条件。此外，由于该地区含气地层时代新、埋藏浅、成岩与胶结作用差、含气层厚度大、孔渗性好，加之构造条件简单，人文干扰小、是应用烃直接检测技术寻找天然气的有     

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

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

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

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

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的数据结构。分析优化前后的数据量,对该系统和节点间完全复制的系统进行比较。实验结果表明,该系统能够有效地提高服务注册中心的性能。     

Dynamic Web Service discovery architecture based on a novel peer based overlay network

Service Oriented Computing and its most famous implementation technology Web Services (WS) are becoming an important enabler of networked business models. Discovery mechanisms are a critical factor to the overall utility of Web Services. So far, discovery mechanisms based on the UDDI standard rely on many centralized and area-specific directories, which poses information stress problems such as performance bottlenecks and fault tolerance. In this context, decentralized approaches based on Peer to Peer overlay networks have been proposed by many researchers as a solution. In this paper, we propose a new structured P2P overlay network infrastructure designed for Web Services Discovery. We present theoretical analysis backed up by experimental results, showing that the proposed solution outperforms popular decentralized infrastructures for web discovery, Chord (and some of its successors), BATON (and it’s successor) and Skip-Graphs.     

移动Ad hoc网络服务发现协议

介绍移动Ad hoc网络的应用前景和主要研究内容,阐述服务协议的重要性以及服务发现协议中的基本概念,针对现有的移动Ad hoc网络服务发现协议的核心技术和设计思想进行分析,选取几种典型的服务发现协议进行对比,总结得出各类服务发现协议的优缺点和适用范围,并指出该领域的进一步研究方向。     

漏洞自动发现与修复技术研究

网络安全漏洞风险问题越来越受到人们的重视。介绍网络安全漏洞风险的指标体系和量化评估技术;重点研究漏洞自动发现技术、漏洞自动修复技术的内容;介绍网络漏洞检测、评估及修复的研究方向。     

一个高效的关联规则增量式更新算法

针对关联规则的维护问题,设计了一个高效的增量式更新算法ＦＩＵＡ,并将ＦＩＵＡ和已有的ＩＵＡ算法进行了比较,并通过实验证实了ＦＩＵＡ算法的高效性。