一种实用的多数据库量子信息检索协议

针对目前量子私有信息检索不能适用与云存储的多数据库问题,基于现在成熟的量子密钥分发方法,提出了一种适合在多数据库环境下,实用的量子私有信息检索协议。对于不同大小的数据库,协议可通过调节参数θ和k,在保证数据库安全及用户隐私的情况下,完成信息的检索。性能分析结果表明,协议的通信复杂度低,检索成功率高、易于实施。     

Farthest-point queries with geometric and combinatorial constraints

In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log²n) time. Our data structure needs O(nlogn) space and preprocessing time. To the best of our knowledge no solution to this problem has been suggested yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other.     

Matching subsequences in trees

Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new algorithms improving the previously best known time and space bounds.     

Approximate colored range and point enclosure queries

In this paper, we formulate two classes of problems, the colored range query problems and the colored point enclosure query problems to model multi-dimensional range and point enclosure queries in the presence of categorical information. Many of these problems are difficult to solve using traditional data structural techniques. Based on a new framework of combining sketching techniques and traditional data structures, we obtain two sets of results in solving the problems approximately and efficiently. In addition, the framework can be employed to attack other related problems by finding the appropriate summary structures.     

基于量子第三方的隐私数据库查询协议

保障查询数据库时用户及数据库的隐私性具有重要意义。该文利用三光子GHZ(Greenberger-Horne- Zeilinger)态的量子关联性,提出一个基于量子第三方的隐私数据库查询协议。协议对于信道损耗具有很高的容忍度,并且能够有效地抵抗第三方发动伪造量子纠缠态和量子记忆存储攻击。在第三方的帮助下,协议能够确定地控制用户获得数据库隐私信息的数量。同时,利用Mermin-Bell不等式进行真正的三方纠缠验证保证协议的安全性,这一思想也拓展了设备无关纠缠验证的应用领域。     

TMWSNs中一种确保数据完整性的高能效时空Top-k查询协议

时空Top-k查询是TMWSNs（双层移动无线传感网）中的一类重要查询.在敌对环境中,攻击者易通过捕获TMWSNs中的关键节点来破坏时空Top-k查询的数据完整性.提出一种确保数据完整性的时空Top-k查询处理协议VIP-TQ.该协议利用虚拟化节点技术与绑定加密技术通过构建传感器节点的数据预处理方法、数据存储节点的时空Top-k查询处理方法以及Sink端的数据完整性验证方法来实现TMWSNs中时空Top-k查询的数据完整性保护.理论分析和实验结果显示,VIP-TQ能够以100%的概率侦测出不完整的时空Top-k查询结果,并具有相对已有方案更高的能效性.     

On the use of electron paramagnetic resonance to implement thermogravimetry data: the thermal decomposition of zinc oxalate dihydrate

The complementary use of thermogravimetric analysis and electron paramagnetic resonance spectroscopy enables the identification on interrelated and successive steps in the vacuum decomposition of ZnC₂O₄ · 2H₂O. After completion of the oxalate dehydration, CO adsorbed species (analogous to those previously reported on MgO) are observed by EPR, starting at a temperature of 250°C. In the temperature range 250–350°C, the CO ad-species disappear while paramagnetic ZnO_1?x and possibly CO^?₄ entities are formed. It is proposed that the latter stems from the reaction of oxygen released by the decomposition of ZnO with CO₂ produced during the oxalate decomposition. Above 300°C, ZnO_1?x and CO^?₄ disappear, leading to the formation of O^3?₃ centers. The latter are gradually decomposed between 350 and 575°C, releasing O₂ observed in EPR as O^?₂ molecular anions and trapped electrons which are again detected as ZnO_1?x. A partially reduced ZnO phase is most probably the end-product of the decomposition.     

基于有向无环图的区间覆盖率求解算法

给定一个有向无环图,回答可达性查询是图的基本操作之一.虽然很多方法使用树区间来加速可达查询的处理速度,但并不明确使用多少个区间比较合适.本文提出一种快速计算区间覆盖率的算法,该方法通过使用有效的剪枝策略来支持高效的覆盖率计算.基于所得到的区间覆盖率,可针对不同数据图确定合适的区间个数,以便在加速查询处理的同时,降低索引...     

一种有效的不确定数据流Top-K查询算法

Top-K查询处理是不确定性数据管理中一项重要技术。本文在分析不确定性数据模型和可能世界模型的基础上,定义了不确定数据流元组的查询语义,提出了基于记录向量的Top-K查询算法,该算法根据K值,计算并返回分值最高前K个结果,其查询结果评价综合考虑了查询结果在可能世界语义下的概率大小。实验结果表明,与CSQ和SCSQ算法相比,本算法更具高效性和实用性。