查询驱动模式下两层传感器网络Top-k查询汇聚算法研究

在两层传感器网络中,查询驱动模式是将查询请求在下层传感器网络层进行分布式处理的一种查询处理模式.在传感器节点产生数据的频率较高而用户发出查询请求的频率较低的情况下,查询驱动模式能够大大减少数据传输量,降低节点的能量消耗.在这种模式下,如何有效支持局部区域性Top-k查询是一个很有挑战性的问题.针对这一问题,本文首先构造了一种新的数据汇聚树(DAT),接着在DAT的基础上提出了一种支持区域性Top-k查询的数据汇聚方案.理论分析和仿真实验表明,与已有算法相比,本文提出的方案更加高效.     

基于Chord覆盖网络索引结构的多属性查询

文中给出了一种基于Chord覆盖网络索引结构的多属性查询处理技术.利用卡诺图计算查询结果所在的节点,并以多播树的方式将查询请求发送到对应的节点上,从而实现了相邻数据之间的快速路由.实验证明了该方法在处理多属性查询时的有效性和高效性.     

面向差异化业务请求的虚拟网络映射算法

网络虚拟化是克服当前网络僵化的重要方法,而资源分配是网络虚拟化实现的核心.为了解决业务差异性需求导致的物理网络资源分布不均,造成虚拟网络接受率下降的问题,提出面向差异化业务请求的虚拟网络映射算法.该算法首先定义反应节点和所连接链路资源比的节点饱和度,依此将虚拟节点映射在节点饱和度最接近虚拟网络请求的物理节点上,最后基于所映射的物理节点和节点饱和度约束,将虚拟链路映射在由物理链路组成的路径上.仿真结果表明该算法能够满足不同业务的差异化请求,具有较高的资源利用率和虚拟网络接受率.     

一种基于树的无线传感器网络数据收集方法

该文提出一种基于树的无线传感器网络数据收集方法,它将查询请求的传递与数据回传结构的建立有机结合起来,通过使用一种洪泛避免的方法传递查询请求,建立起一棵以sink节点为根的、包含最少中间节点的查询转发树,作为数据回传结构。理论分析和仿真试验表明,该方法不会降低无线传感器网络的连通性,可以有效节省能量。     

光路可靠性和频谱整合因子感知的虚拟光网络生存性映射

针对多链路故障,本文提出一种基于光路可靠性和频谱整合因子感知的空分复用弹性光网络中虚拟光网络生存性映射算法.在虚拟节点映射时,综合考虑物理节点属性的权重评估准则.在虚拟链路映射时,本文设计联合考虑频谱资源和可靠性的工作光路选择策略和基于频谱整合因子感知的工作光路频谱分区分配方法,并设计提高保护带宽共享度的保护光路选择策略.仿真结果显示,本文算法提高了虚拟光网络请求接受率,降低了带宽阻塞率.     

基于多商品流模型的虚拟链路映射

网络虚拟化是解决网络僵化问题和更好地共享底层网络资源的一种有效途径,虚拟网络映射是实施网络虚拟化的关键问题之～。虚拟网络映射包括节点映射和链路映射两个方面,其目标是为虚拟网络请求分配合适的底层网络节点和链路资源。阐述了底层网络支持路径分割时,如何基于多商品流模型实现VN链路映射。     

一种推断XML关键字查询目标节点类型方法

为准确推断可扩展标记语言（XML）关键字查询中的用户搜索意图,提出了一种新的推断XML关键字查询目标节点类型方法IXKSNT.在获取目标节点类型时,考虑不同节点类型下关键字出现的频率以及节点类型的层次信息,赋予不同的查询相关度,同时结合目标节点类型应存在实例节点包含所有查询关键字这一因素,推断目标节点类型,以保证查询结果节点含有全部关键字.实验证明,该方法可以更准确地得到目标节点类型,提高查准率.     

基于深度卷积神经网络的多节点间链路预测方法

目前,链路预测的研究主要针对拓扑结构变化缓慢的社交网络,集中在单节点对的链路预测.本文针对拓扑变化频繁的机会网络,提出一种基于模式分类的多节点间链路预测方法.该方法基于混沌时间序列理论确定机会网络的切片时间,采用状态图表征网络的拓扑结构,借助深度卷积神经网络在特征提取上的优势,从状态图的演化过程中提取机会网络的结构特征,根据当前特征推断未来链路的演化模式,实现多节点间的链路预测.在ITC（Imote-Traces-Cambridge）真实数据集上的实验结果表明,相比于基于CN（Common Neighbor）、AA（Adamic-Adar）、Katz等预测方法,本文方法具有更好的精度和稳定性.     

属性网络中相似性增强随机游走的多社区搜索

社区搜索旨在寻找与给定查询节点高度相关的个性化社区.现有社区搜索方法多面向简单网络且处理单个查询节点或假定多个查询节点来自同一社区,这种严格的假设使得算法灵活性受限.据此,提出一种在属性网络中利用查询节点随机游走路径的相似性增强的多社区搜索方法,可以有效地定位查询节点所属的多个局部目标社区.具体地,有效融合网络中高阶结构与属性信息,利用重启随机游走计算各查询节点的重要性分数向量;计算查询节点随机游走路径的相似性并设计一种相似性增强策略,使得在无监督学习中相似路径游走者彼此增强关联从而定位不同查询节点所属的多个社区结构;基于结合结构和属性的并行电导值精准查询社区.真实数据集和人工数据集的实验验证了本文方法的有效性和效率.     

鲁棒的无线传感器网络空间范围聚集查询处理算法

现有无线传感器网络环境下的空间范围聚集查询处理算法没有综合考虑节点移动、节点失效和通信链路失效等因素对查询处理的影响,导致查询成功率低和能量消耗大.本文提出了利用节点冗余保证查询处理过程鲁棒性的空间范围聚集查询处理算法RSA(Robust Spatial window aggregation query processing Algorithm),它将查询区域划分为若干个网格,沿一条路线依次收集各网格内所有节点的数据.RSA算法给出了一种自适应的网格大小设置方法和基于网格面积的网格代表节点选择策略,以减少算法的能量消耗和提高查询成功率;给出了基于目标矩形的方法以绕过不存在节点的区域,从而避免查询处理过程出现中断.仿真实验结果表明,RSA算法优于现有的IWQE算法.     

COACS: A Cooperative and Adaptive Caching System for MANETs

This paper introduces a cooperation-based database caching system for Mobile Ad Hoc Networks (MANETs). The heart of the system is the nodes that cache submitted queries. The queries are used as indices to data cached in nodes that previously requested them. We discuss how the system is formed and how requested data is found if cached, or retrieved from the external database and then cached. Analysis is performed and expressions are derived for the different parameters, including upper and lower bounds for the number of query caching nodes as well as the average load they experience, generated network traffic, node bandwidth consumption, and other performance-related measures. Simulations with the ns-2 software were used to study the performance of the system in terms of average delay and hit ratio, and to compare it with the performance of two other caching schemes for MANETs, namely CachePath and CacheData. The results demonstrate the effectiveness of the proposed system in terms of achieved hit ratio and low delay.     

Design and evaluation of data allocation algorithms for distributedmultimedia database systems

A major cost in retrieving multimedia data from multiple sites is the cost incurred in transferring multimedia data objects (MDOs) from different sites to the site where the query is initiated. The objective of a data allocation algorithm is to locate the MDOs at different sites so as to minimize the total data transfer cost incurred in executing a given set of queries. The optimal allocation of MDOs depends on the query execution strategy employed by a distributed multimedia system while the query execution strategy optimizes a query based on this allocation. We fix the query execution strategy and develop a site-independent MDO dependency graph representation to model the dependencies among the MDOs accessed by a query. Given the MDO dependency graphs as well as the set of multimedia database sites, data transfer costs between the sites, the allocation limit on the number of MDOs that can be allocated at a site, and the query execution frequencies from the sites, an allocation scheme is generated. We formulate the data allocation problem as an optimization problem. We solve this problem with a number of techniques that broadly belong to three classes: max-flow min-cut, state-space search, and graph partitioning heuristics. The max-flow min-cut technique formulates the data allocation problem as a network-flow problem, and uses a hill-climbing approach to try to find the optimal solution. For the state-space search approach, the problem is solved using a best-first search algorithm. The graph partitioning approach uses two clustering heuristics, the agglomerative clustering and divisive clustering. We evaluate and compare these approaches, and assess their cost-performance trade-offs. All algorithms are also compared with optimal solutions obtained through exhaustive search. Conclusions are also made on the suitability of these approaches to different scenarios     

基于XML的电力数据集成平台研究

为了解决电力系统内部异构数据共享和集中管理的问题,提出基于“集成数据库-中间件”的四层电力数据集成平台框架设计方案。该方案结合可扩展标记语言XML的优势定义数据交换格式,参考HSDA视图的组织形式搭建集成数据库,通过查询转换器、数据合法性验证工具以及数据转换器实现对用户请求的中间处理,最终将转换得到的XML文件提供给Web服务器,实现电力数据集成平台系统。实践证明,该方案对异构数据集成问题的解决提供了一个切实可行的模式和方法,具有较好的可扩展性和适应性。     

自组织反馈光纤环形激光器相位调制产生强度混沌的实验研究

报道了自组织反馈光纤环形激光器中施加相位调制后产生的强度混沌现象。对自组织反馈光纤环形激光器进行稍大于阈值的泵浦,通过压电陶瓷引入相位调制;保持泵浦功率及调制电压不变,改变调制频率,得出光强随不同调制频率变化的分岔图,观察到某些特定频率区域内激光器输出进入类似混沌的状态。针对类似混沌的光强输出序列进行非线性时间序列分析,通过功率谱计算、相空间重构、关联积分计算等方法得到了多段调制频率区间内光强序列具有混沌特征的证据。初步分析产生混沌的机理得出:特定条件下施加的相位调制等同于损耗调制。     

一种基于JSON的异构数据查询方法

异构数据的查询是近年来研究的热点,用户不能同时对异构数据进行查询。提出一种基于JSON的异构数据查询方法,该方法以JSON传输格式为基础,为不同设备端提供访问异构数据源的接口,使JSON作为统一的模型对异构数据进行编写。使用JSON格式的数据查询方法可以为用户节省流量成本,同时简化了对异构数据的查询问题。理论分析和实验结果证明基于JSON的异构数据查询算法具有高效、稳定的优势。     

基于JSON格式的自定义组合条件查询设计与实现

查询模块在软件系统的开发中属于基本的必需模块,条件与对象属性相对应,而对象属性与表字段相对应,前台条件以And或者Or组装成JSON格式的数据,后台接受来自于前台的JSON数据进行一系列处理最终拼接为Hql字符串进而查询出满足条件的数据返回给前台展示。前台的查询条件组装成JSON格式数据借助于ligerui的ligerFilter插件,后台借助java代码对JSON格式数据进行处理。由于对象属性字段与数据表字段的对应采用了Hibernate映射框架,故在程序中对实体对象的操作相当于对数据库表的操作,这样简化了后台查询代码的编写工作,并且使得查询代码易于维护。     

一种基于虚拟数据仓库的查询优化方法

跨地区企业集团如何从分布在各地数据仓库的数据中获取信息以帮助他们决策是数据仓库研究的一个重要问题.本文提出了一种虚拟数据仓库三层模型及其查询优化方法,引入了虚拟元数据、查询快表等概念,通过查询快表可以快速得到查询方案,通过虚拟元数据与各结点元数据的映射,可形成查询方案,从而获得查询结果.分析表明,该方法能够有效地提高查询效率.     

Dynamic network layer for data query in sensor network

Query processing systems in wireless sensor networks usually support tasks such as data acquisition, data aggregation, and event‐based query. The performances of query processing with these tasks are greatly varied according to different routing protocols. Most existing data query systems usually use one routing protocol to deal with all kinds of queries. This work demonstrates that proper selection of routing protocols can improve the performance of query processing. We propose a dynamic routing layer that makes protocol selection on the basis of query tasks and can automatically switch between different routing protocols. Simulation results show that dynamic routing scheme is more energy efficient than single routing protocol. Copyright © 2012 John Wiley & Sons, Ltd.     

Data Replication in Cooperative Mobile Ad-Hoc Networks

The mobile computing environment provides many benefits such as ubiquitous access to computing but includes constraints on resources such as available bandwidth and battery life. Replication is a widely recognized method for balancing the demands of storage space with bandwidth and battery life. We propose a novel scheme that seeks to strategically balance these constrained resources through a cooperative game-theory approach for replication in a mobile environment. Our replication strategy relies on the cooperation of the nodes within the network to make replica caching decisions which are spatiotemporally local-optimal for the network from an energy and bandwidth conservation standpoint. In cooperative altruistic data replication, each node calculates the net global benefit, for caching a replica of the requested data, as the result data is returned from the responding node to the requesting node, where it determines the spatiotemporally local-optimal node for replicating the data item. Performance results from our research indicate that our scheme, CADR, improves the query response time by 25 and 45 %, mean hop count is improved by 26 and 46 %, query error is reduced by 30 and 48 %, while energy utilization is reduced 30 and 57 % when compared with both another game theoretic replication approach and standard cooperative caching respectively.     

Linked Open Data Query Based on Natural Language

Linked open data (LOD) supports the SPARQL query strongly. A translation system from the natural language query to the SPARQL query based on the syntax rules is proposed. For a natural language query, a parsing method is proposed to represent the query in-tention and construct the corresponding query graph. The algorithms for obtaining and instantiating triple patterns are designed based on the rules. A mapping method for different types of graph nodes is lastly proposed to im-prove the recall. The experiments based on test data from QALD-4 are conducted. Compared with the other systems, our system is more easy and effective, and evaluation re-sults are outstanding in the field of unsupervised learning.