首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14篇
  完全免费   5篇
  自动化技术   19篇
  2015年   1篇
  2014年   1篇
  2012年   1篇
  2011年   2篇
  2010年   1篇
  2008年   3篇
  2007年   3篇
  2006年   3篇
  2005年   2篇
  2002年   1篇
  2001年   1篇
排序方式: 共有19条查询结果,搜索用时 31 毫秒
1.
QUERY ROUTING IN A PEER-TO-PEER SEMANTIC LINK NETWORK   总被引:9,自引:0,他引:9  
Hai  Zhuge  Jie  Liu  Liang  Feng  Xiaoping  Sun  Chao  He 《Computational Intelligence》2005,21(2):197-216
A semantic link peer-to-peer (P2P) network specifies and manages semantic relationships between peers' data schemas and can be used as the semantic layer of a scalable Knowledge Grid. The proposed approach consists of an automatic semantic link discovery method, a tool for building and maintaining P2P semantic link networks (P2PSLNs), a semantic-based peer similarity measurement for efficient query routing, and the schema mapping algorithms for query reformulation and heterogeneous data integration. The proposed approach has three important aspects. First, it uses semantic links to enrich the relationships between peers' data schemas. Second, it considers not only nodes but also the XML structure in measuring the similarity between schemas to efficiently and accurately forward queries to relevant peers. Third, it copes with semantic and structural heterogeneity and data inconsistency so that peers can exchange and translate heterogeneous information within a uniform view.  相似文献
2.
基于P2P的路由选择技术的研究   总被引:5,自引:0,他引:5  
庄明  董健全 《计算机工程》2006,32(6):134-136
引用的特殊模型将解决基于P2P网络管理难的问题。但在此模型基础上的资源搜索策略和路由策略,都是以单纯广播方式进行的,因此提出了提高搜索和路由效率的改进方法,同时建立了查询路由表,增强了网络的效率和健壮性。  相似文献
3.
基于P2P的Web搜索技术   总被引:4,自引:0,他引:4       下载免费PDF全文
方启明  杨广文  武永卫  郑纬民 《软件学报》2008,19(10):2706-2719
Web搜索引擎已经成为人们从海量Web信息中快速找到所需信息的重要工具,随着Web数据量的爆炸性增长,传统的集中式搜索引擎已经越来越不能满足人们不断增长的信息获取需求.随着对等网络(peer-to-peer,简称P2P)技术的快速发展,人们提出了基于P2P的Web搜索技术并迅速成为研究热点.研究的目的是对现有的基于P2P的Web搜索技术进行总结,以期为进一步研究指明方向.首先分析了基于P2P的Web搜索面临的诸多挑战;然后重点总结分析了基于P2P的Web搜索的各项关键技术的研究现状,包括系统拓扑结构、数据存放策略、查询路由机制、索引切分策略、数据集选择、相关性排序、网页收集方法等;最后对已有的3个较有特色的基于P2P的Web搜索原型系统进行了介绍.  相似文献
4.
高速路由器设计方案研究   总被引:2,自引:0,他引:2  
千兆级的高端路由器成为近两年路由器研究的热点,讨论了路由器的背板结构、交通方式、阻塞问题及路由表查找算法等设计路由器时所要考虑的关键问题,对相关的技术进行比较和选择,并给出了一个交换式高速路由器的设计方案。  相似文献
5.
Context-based caching and routing for P2P web service discovery   总被引:1,自引:0,他引:1  
In modern heterogeneous environments, such as mobile, pervasive and ad-hoc networks, architectures based on web services offer an attractive solution for effective communication and inter-operation. In such dynamic and rapidly evolving environments, efficient web service discovery is an important task. Usually this task is based on the input/output parameters or other functional attributes, however this does not guarantee the validity or successful utilization of retrieved web services. Instead, non-functional attributes, such as device power features, computational resources and connectivity status, that characterize the context of both service providers and consumers play an important role to the quality and usability of discovery results. In this paper we introduce context-awareness in web service discovery, enabling the provision of the most appropriate services at the right location and time. We focus on context-based caching and routing for improving web service discovery in a mobile peer-to-peer environment. We conducted a thorough experimental study, using our prototype implementation based on the JXTA framework, while simulations are employed for testing the scalability of the approach. We illustrate the advantages that this approach offers, both by evaluating the context-based cache performance and by comparing the efficiency of location-based routing to broadcast-based approaches. Recommended by: Zakaria Maamar  相似文献
6.
无线传感器网络中数据查询处理算法研究*   总被引:1,自引:1,他引:0       下载免费PDF全文
提出一种改进的定向扩散路由,将传感器网络分簇,查询兴趣由sink节点发,只在各簇头节点扩散,簇头以广播的方式在簇内发散兴趣消息,簇成员将感知数据传送到簇头节点,簇头负责将收到的数据进行融合后传到sink节点。仿真结果表明,改进后的查询路由比典型的查询路由定向扩散具有更高的能量有效性和更低的时延,能较好地延长网络的生命周期,提高了传感器网络数据查询处理效率。  相似文献
7.
Optimized query routing trees for wireless sensor networks   总被引:1,自引:0,他引:1  
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be transmitted to the querying node. We found that current methods deployed in predominant data acquisition systems construct T in a sub-optimal manner which leads to significant waste of energy. In particular, since T is constructed in an ad hoc manner there is no guarantee that a given query workload will be distributed equally among all sensors. That leads to data collisions which represent a major source of energy waste. Additionally, current methods only provide a topological-based method, rather than a query-based method, to define the interval during which a sensing device should enable its transceiver in order to collect the query results from its children. We found that this imposes an order of magnitude increase in energy consumption.  相似文献
8.
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortest path query efficiently, we introduce two pruning algorithms. These algorithms differ on the extent of materialization of shortest path cost and on how the search space is pruned. By grouping shortest path queries properly, batch processing improves the performance of shortest path query evaluation. Extensive study is also done on fragment sizes, cache sizes and query types that we show that affect the performance of a disk-based shortest path algorithm. The performance and scalability of proposed techniques are evaluated with large road systems in the Eastern United States. To demonstrate that the proposed disk-based algorithms are viable, we show that their search times are significant better than that of main-memory Dijkstra's algorithm.  相似文献
9.
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, such as location-based services and advanced traveler information systems. This paper addresses the problem of finding the in-route nearest neighbor (IRNN) for a query object tuple which consists of a given route with a destination and a current location on it. The IRNN is a facility instance via which the detour from the original route on the way to the destination is smallest. This paper addresses four alternative solution methods. Comparisons among them are presented using an experimental framework. Extensive experiments using real road map datasets are conducted to examine the behaviors of the solutions in terms of five parameters affecting the performance. The overall experiments show that our strategy to reduce the expensive path computations to minimize the response time is reasonable. The spatial distance join-based method always shows better performance with fewer path computations compared to the recursive methods. The computation costs for all methods except the precomputed zone-based method increase with increases in the road map size and the query route length but decrease with increases in the facility density. The precomputed zone-based method shows the most efficiency when there are no updates on the road map.  相似文献
10.
网络上的专业搜索引擎数量众多,普通用户在选择时往往无所适从。文章提出了一个自动的查询导向系统,可以将用户查询自动导向到合适的专业搜索引擎,解决了这个矛盾。  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号