能量高效的无线传感器网络时空查询处理算法

 在无线传感器网络环境中,用户经常提交的查询是时空查询,如“获得区域A在某个给定时间段内的感知数据”.由于传感器节点能量十分有限,因此,能量高效的时空查询处理是目前亟需解决的问题.首先指出了现有的时空查询处理算法能量消耗大的原因在于查询协调节点选择不合理.然后给出了理论上最优的查询协调节点的位置及其证明,并基于该理论提出了一类能量高效的传感器网络时空查询算法ECSTA.最后通过实验分析了节点密度和查询区域大小对算法能量消耗的影响.理论和实验结果表明ECSTA算法优于现有的STWin框架下的算法.     

基于网络Voronoi图的道路网络连续k近邻查询

道路网络中的连续查询是查找在一条路径上满足查询条件的对象。它是空间网络数据库中的一种重要查询类型。现提出了道路网络中基于k阶Voronoi图的连续k近邻查询方法，该查询方法用分枝限界的思想动态地创建局部Voronoi图，降低了查询代价。     

ATTI:负载关注的查询自适应轨迹索引

当前基于空间切分的轨迹索引不能实现时空同步,在负载和查询范围动态变化时性能显著下降.本文提出负载自适应的时空八叉树,实现轨迹索引的时空同步;进而扩充单棵时空八叉树数据结构形成虚拟森林,优化现有基于查询范围均值的单树索引,以适应时空查询范围的动态变化.实验表明,该索引可将时空范围查询延迟降低50%以上.     

移动P2P网络中能量有效连续查询研究

在移动P2P网络中一个基本应用问题是访问分布式空间数据库中的数据对象,同时节省电量.文中提出了在移动P2P网络中能量有效连续查询处理（Energy Efficient Continuous Query Processing,EECQP）算法,包括范围查询和k个最近邻居节点查询（k-nearest-neighbor queries, k-NN）.EECQP算法能够提供移动用户找到一个有质量保证的连续查询结果.EECQP算法主要的想法是允许用户与节点合作,持续保存查询结果,而不是总是从头开始处理查询,从而减少通信开销.实验结果表明所提出的EECQP算法对于范围查询和k个最近邻居节点查询在通信开销和QoS保证是能量有效和可扩展的.     

基于卫星信息的海事应用时空数据模型研究

卫星遥感作为一种新兴的探测方式为海事应用信息系统提供了丰富的数据源,同时将数据分析与数据建模引入了新的领域。在分析研究现有时空数据模型的基础上,综合分析了海洋环境要素与海事要素的数据特点,剖析了卫星数据源的数据结构,总结出用以建立时空数据库的数据类型。采用面向对象技术,基于改进的ESTDM模型,分别针对海洋实体、环境和海事任务予以UML建模,提出海事应用时空数据模型结构。     

轨迹大数据：数据、应用与技术现状

移动互联技术的飞速发展催生了大量的移动对象轨迹数据。这些数据刻画了个体和群体的时空动态性,蕴含着人类、车辆、动物的行为信息,对交通导航、城市规划、车辆监控等应用具有重要的价值。为了实现有效的轨迹数据价值提取,近年来学术界和工业界针对轨迹管理问题开展了大量研究工作,包括轨迹数据预处理,以解决数据冗余高、精度差、不一致等问题;轨迹数据库技术,以支持有效的数据组织和高效的查询处理;轨迹数据仓库,支持大规模轨迹的统计、理解和分析;最后是知识提取,从数据中挖掘有价值的模式与规律。因此,综述轨迹大数据分析,从企业数据、企业应用、前沿技术这3个角度揭示该领域的现状。     

面向态势可视化的海战场时空数据模型

针对海战场作战实体的特点提出了一种面向态势可视化的海战场时空数据模型,并对其时空状态查询进行了详细分析.针对海战场作战单位的运动特点,采用5次Hermite插值的方法对作战单位过去时空状态查询,既符合海战场作战实体的运动特点,又不会过多地加大计算的时间复杂度.模型支持对作战单位未来时空状态的确定性查询和不确定性查询,在一定程度上满足指挥员指挥决策的需要.     

时空道路网络连续最近邻查询的新方法

时空道路网络里连续最近邻查询在时空数据库查询的领域是一个新的重要课题，本文提出一个有效的方法（IE）以处理道路网络里的移动对象的k个最近邻居（k-NN）查询问题。     

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

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

Approximate all nearest neighbor search for high dimensional entropy estimation for image registration

Information theoretic criteria such as mutual information are often used as similarity measures for inter-modality image registration. For better performance, it is useful to consider vector-valued pixel features. However, this leads to the task of estimating entropy in medium to high dimensional spaces, for which standard histogram entropy estimator is not usable. We have therefore previously proposed to use a nearest neighbor-based Kozachenko-Leonenko (KL) entropy estimator.Here we address the issue of determining a suitable all nearest neighbor (NN) search algorithm for this relatively specific task.We evaluate several well-known state-of-the-art standard algorithms based on k-d trees (FLANN), balanced box decomposition (BBD) trees (ANN), and locality sensitive hashing (LSH), using publicly available implementations. In addition, we present our own method, which is based on k-d trees with several enhancements and is tailored for this particular application.We conclude that all tree-based methods perform acceptably well, with our method being the fastest and most suitable for the all-NN search task needed by the KL estimator on image data, while the ANN and especially FLANN methods being most often the fastest on other types of data. On the other hand, LSH is found the least suitable, with the brute force search being the slowest.     

SQLS: A Storm-Based Query Language System for Real-Time Stream Data Analysis

In this work,a Storm-based query language System (SQLS) is proposed for real-time data stream analysis.The system is compatible with Continuous query language (CQL) specification.It supports both continuous queries and one-time queries over streaming data,and meets the requirements of user experience (traditional SQL queries) and QoS (such as real-time and throughput).In order to better meet the requirement of throughput and enhance the processing efficiency,the load shedding algorithm and cache optimization are employed during the implementation of SQL-like operators.Finally,performance testing of the proposed SQLS has been conducted on standalone Storm platform and Storm clusters.Experimental resuits show that our system can not only meet the needs of users,but also extend the function of real-time streaming queries processing.     

Recursive nearest neighbor search in a sparse and multiscale domain for comparing audio signals

We investigate recursive nearest neighbor search in a sparse domain at the scale of audio signals. Essentially, to approximate the cosine distance between the signals we make pairwise comparisons between the elements of localized sparse models built from large and redundant multiscale dictionaries of time-frequency atoms. Theoretically, error bounds on these approximations provide efficient means for quickly reducing the search space to the nearest neighborhood of a given data; but we demonstrate here that the best bound defined thus far involving a probabilistic assumption does not provide a practical approach for comparing audio signals with respect to this distance measure. Our experiments show, however, that regardless of these non-discriminative bounds, we only need to make a few atom pair comparisons to reveal, e.g., the origin of an excerpted signal, or melodies with similar time-frequency structures.     

Spatio-temporal segmentation of image sequences for object-oriented low bit-rate image coding

This paper describes a new method of segmentation of time-varying image sequences whose goal is object-oriented image coding. The segmentation represents a partition of each frame of the sequence into a set of regions which are homogeneous with regard to motion criterion. The region borders correspond to spatial contours of objects in the frame. Each spatio-temporal region is characterized by its temporal component, which is a model-dependent vector of motion parameters, and a structural component representing the polygonal approximation of the spatial contour of the region.

The construction of spatio-temporal segmentation includes two phases: the initialization step and temporal tracking. The initialization step is based on the spatial segmentation of the first frame of the sequence. Then homogeneous spatial regions are merged through motion estimation in accordance with a motion-based criterion. The temporal tracking consists of the projection of the segmentation along the time axis, and its adjustment. Special attention is paid to the processing of occlusions.

A predictive coding scheme is proposed which is based on the temporal coherence of the segmentation. This scheme is promising for a low bit-rate image compression.

The results for teleconference and TV sequences show the high visual quality of reconstructed only by prediction images. Moreover, the bit-rates for motion coding are very low: from 0.002 to 0.007 bit/pixel for teleconference sequence and from 0.004 to 0.021 bit/pixel for complex TV sequence. A scheme for encoding of the structural information is proposed which requires 0.083 – 0.17 bit per pixel depending on the content of the sequence.     

GPS接收机抗多径技术研究现状与趋势

多径在GPS接收机设计中是最显著的误差源,它能引起接收机定位精度的恶化,导致系统性能的下降.首先介绍了多径的影响及多径误差模型;然后,对国内外抑制多径的技术研究进行了综述,归纳为基于空域处理和基于时域处理两大类抑制技术,并基于Rake分集思想提高卫星导航接收机性能的新颖方法进行了讨论,给出了各种技术的优缺点;最后,讨论...     

基于时频子空间的多分量宽带调频信号DOA估计

为在复杂电磁环境下实现对多分量宽带线性调频信号的到达角(DOA)估计,研究了基于时频子空间的到达角估计算法,对阵列接收信号通过二维时频掩膜滤波逐一提取各信源的时频自项,建立了空时频矩阵,运用子空间技术得到各信源的到达角估计,并与宽带聚汇算法比较,进行了仿真实验.仿真结果表明,由于充分利用了多分量线性调频信号的时频信息,在低信噪比条件下,宽带时频子空间方法比宽带聚汇算法具有更高的DOA估计的分辨率和估计精度.     

Study of Time Delay Estimation for Multichannel Noise Suppresion System

ＳｔｕｄｙｏｆＴｉｍｅＤｅｌａｙＥｓｔｉｍａｔｉｏｎｆｏｒＭｕｌｔｉｃｈａｎｎｅｌＮｏｉｓｅＳｕｐｐｒｅｓｉｏｎＳｙｓｔｅｍＺｈｕＱｉ（ＤｅｐａｒｔｍｅｎｔｏｆＲａｄｉｏＥｎｇｉｎｅｅｒｉｎｇ，ＮａｎｊｉｎｇＵｎｉｖｅｒｓｉｔｙｏｆＰｏｓｔｓａｎｄＴ...     

一种新的DS-CDMA系统多径角度时延联合估计方法

本文针对DS－CDMA系统,提出了一种新的期望用户多径信号波达方向和时延联合估计方法。在匹配滤波器输出中,期望用户信号的平方与多址干扰信号的平方具有不同的频谱特性。对各个频率上的空域相关矩阵进行预处理后,本文采用两维unitary-ESPRIT算法完成角度时延的闭式估计和自动配对。本文方法计算量小,并且在存在远近效应的情况下,仍能完成参数的准确估计。