CS-Chord:基于聚类分离的分布式高维向量索引

M-Chord是一种基于P2P网络的高维向量索引,其聚类边缘的向量容易与搜索圆频繁相交,使得查找的区域增多,降低了M-Chord的效率。提出一种基于聚类分离的分布式高维向量索引(CS-Chord),将边缘区域的高频检索向量从Chord环中分离出来,集中存储在服务器上,中心区域的向量仍存储于Chord环中,节省了大量资源的定位时间,从而提高检索效率。实验结果表明:在查询半径为0.2时,CS-Chord距离计算次数约为2000,比M-Chord减少了约2500次;CS-Chord消息转发次数约降低150次,仅为M-Chord的50%。     

资源受限网络中高效XML交换的性能评估

为了研究高效XML交换(EXI)在资源受限网络中的使用情况,文中基于传感器观测服务的真实数据,对四种交换模式下的数据大小进行了对比:XML、高效XML、Gzip压缩的XML以及开启压缩模式的高效XML。通过在ns-2中建模,对资源受限网络环境下各交换格式的平均成功率、平均延时、平均能量消耗等性能进行了分析。实验结果表明,无论是否开启压缩模式,高效XML比XML具有更小的体积、更高的成功率、更短的延时和更少的能量消耗。高效XML交换更加适合于资源受限网络。     

模糊系统逼近理论：现状与展望

近年来,各类模糊系统已被证明是万能函数逼 近器,它们能实现任意的非线性连续控制规律和动态模型．本文综述与分析了模糊系统逼近 理论研究的最新成果,并指出了进一步研究工作的方向．     

论室内色彩设计的人性化

人性化的色彩设计理念体现出对使用者的人文精神关怀。本文从色彩的基本特征出发,对室内设计色彩人性化问题加以探讨。以理论和实际相结合的论述手法,探索室内环境人性化色彩设计的方法。人性化是未来室内环境色彩设计的必然趋势。     

A Fast Search Algorithm for a Large Fuzzy Database

In this paper, we propose a fast search algorithm for a large fuzzy database that stores iris codes or data with a similar binary structure. The fuzzy nature of iris codes and their high dimensionality render many modern search algorithms, mainly relying on sorting and hashing, inadequate. The algorithm that is used in all current public deployments of iris recognition is based on a brute force exhaustive search through a database of iris codes, looking for a match that is close enough. Our new technique, Beacon Guided Search (BGS), tackles this problem by dispersing a multitude of ldquobeaconsrdquo in the search space. Despite random bit errors, iris codes from the same eye are more likely to collide with the same beacons than those from different eyes. By counting the number of collisions, BGS shrinks the search range dramatically with a negligible loss of precision. We evaluate this technique using 632,500 iris codes enrolled in the United Arab Emirates (UAE) border control system, showing a substantial improvement in search speed with a negligible loss of accuracy. In addition, we demonstrate that the empirical results match theoretical predictions.