A comment on “Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embedding”

A geodesic distance-based approach to build the neighborhood graph for isometric embedding is proposed to deal with the highly twisted and folded manifold by Wen et al. [Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embedding, Pattern Recognition 41 (2008) 2226-2236]. This comment is to identify the error in their example and the ineffectiveness of their algorithm.     

Commentary on Krishnaswamy et al. - Quantifying and mapping biodiversity and ecosystem services: Utility of a multi-season NDVI based Mahalanobis distance surrogate

Remote sensing is a powerful tool for characterizing, estimating or modelling species diversity. Differences in environmental properties of different habitats should lead to differences of spectral responses, which can be detected by satellite imagery. Hence, spectral distance may be related to species diversity. Based on previous studies, Krishnaswamy et al. [Krishnaswamy, J., Bawa, K. S., Ganeshaiah, K. N., & Kiran, M. C. (2009). Quantifying and mapping biodiversity and ecosystem services: Utility of a multi-season NDVI based Mahalanobis distance surrogate. Remote Sensing of Environment.] used spectral distance to estimate species diversity. Since a noisy scatterplot of species versus spectral diversity is expected, the commonly used Ordinary Least Square regression may fail to detect trends which occur across other quantiles than the mean.Krishnaswamy et al. [Krishnaswamy, J., Bawa, K. S., Ganeshaiah, K. N., & Kiran, M. C. (2009). Quantifying and mapping biodiversity and ecosystem services: Utility of a multi-season NDVI based Mahalanobis distance surrogate. Remote Sensing of Environment.] proposed a quantile-quantile plot method as an alternative to conventional regression based approaches which are inappropriate for dependent pair-wise dissimilarity or similarity data. By this commentary I demonstrate the utility of a quantile regression technique to complement the Krishnaswamy et al. [Krishnaswamy, J., Bawa, K. S., Ganeshaiah, K. N., & Kiran, M. C. (2009). Quantifying and mapping biodiversity and ecosystem services: Utility of a multi-season NDVI based Mahalanobis distance surrogate. Remote Sensing of Environment.] graphical approach in terms of a predictive model.     

Learning a color distance metric for region-based image segmentation

In this paper we describe an experiment where we studied empirically the application of a learned distance metric to be used as discrimination function for an established color image segmentation algorithm. For this purpose we chose the Mumford–Shah energy functional and the Mahalanobis distance metric. The objective was to test our approach in an objective and quantifiable way on this specific algorithm employing this particular distance model, without making generalization claims. The empirical validation of the results was performed in two experiments: one applying the resulting segmentation method on a subset of the Berkeley Image Database, an exemplar image set possessing ground-truths and validating the results against the ground-truths using two well-known inter-cluster validation methods, namely, the Rand and BGM indexes, and another experiment using images of the same context divided into training and testing set, where the distance metric is learned from the training set and then applied to segment all the images. The obtained results suggest that the use of the specified learned distance metric provides better and more robust segmentations, even if no other modification of the segmentation algorithm is performed.     

基于文档空间向量距离的查询扩展

查询扩展是信息检索中优化查询的一种有效方法。在分析几种基于互信息的查询扩展方法的基础上,将检索词在文档空间中的距离引入到互信息计算中,提出基于向量距离的改进互信息的查询扩展方法。实验结果表明,该方法能够有效提高信息检索中的查询效果。     

基于网络距离度量和分簇的P2P流量控制

针对BitTorrent(BT)系统中对等连接消耗大量骨干网络带宽导致网络拥塞的问题,提出基于网络距离度量和网络分簇的节点分配策略。仿真实验表明,在不影响BT客户端下载性能的情况下,该分配策略能够将更多的数据流量限制在网络簇内部,提高数据流量的局部性,有效地减少BT系统对骨干网络带宽的消耗。     

面向入侵检测的改进BMHS模式匹配算法

模式匹配算法是入侵检测系统中使用较多的一种算法。分析几种常用模式匹配算法,提出一种基于BMHS的改进算法——N-BMHS算法。该算法对字符串进行双向模式匹配,引入一个新的数组s记录模式串中字符的出现次数,次数为1时可以利用已匹配的信息来辅助得到模式串的最大移动距离。实验结果表明,改进的模式匹配算法能减少比较次数,有效提高匹配速度。     

基于间隔控制的信息隐藏算法

提出一种在图像离散余弦变换（DCT）域内的信息隐藏算法。为了在基本保证隐秘图像视觉质量的前提下有效提高载体图像的信息隐藏量,该方法使用随机序列进行间隔控制,选择信息嵌入位,把随机序列的种子看成密钥,通过比较变换后的2个DCT系数完成信息的隐藏。试验结果表明,该算法可以兼顾秘密信息隐藏的不可见性和鲁棒性,密钥空间大,能够实现自适应隐藏和提取信息的盲检测。     

一种基于码本聚类的低复杂度用户选择算法

现有块对角化(BD)预编码系统用户选择算法较少考虑利用已选用户与剩余用户之间的关系来排除不可选用户.针对这点不足,给出了一种采用码本聚类的低复杂度用户选择算法( CodeGreedy算法).该算法采用弦距离刻画用户信道的相关性,以此为依据将用户划分到不同码本空间中,聚集在同一码本空间的用户信道具有较强的相关性,形成互斥...     

Multi‐agent collaboration based on enhanced cognitive awareness: an architecture for agents' profiling on the semantic web

This paper applies cognitive models, inspired by cognitive science, with the aim to propose architectural and knowledge‐based requirements to structure ontological models for the cognitive profiling of agents. The proposed architecture aims to address the lack of flexibility that most agent‐based collaborations are affected by. The resulting agents, equipped with advanced cognitive profiling, have an increased cognitive awareness of themselves and are more capable of interacting with other agents in a multi‐agents based environment. In this research, cognitive awareness identifies the ability of the web agents to diagnose their processing limitations and to establish interactions with the external environment. The outcome is the enhanced flexibility, reusability and predictability of the agent behaviour; thus contributing towards minimizing human cognitive demands. The concept of cognitive profiling presented in this paper considers the semantic web as an action mediating space, where ontological models provide affordances for improving cognitive awareness through shared knowledge‐base. The conceptual model for the cognitive profile architecture is developed with Protégé Ontology editor to generate OWL Ontology and evaluated through a proof of concept. The results show that agents equipped with cognitive awareness can undertake complex tasks more dynamically.     

Property Testing of Regular Tree Languages

We consider the edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and generalize it to the class of ranked and unranked regular trees. We also show that this distance problem is -complete on ordered trees. A preliminary version of this paper appeared in Proceedings of 31st International Colloquium on Automata, Languages and Programming, volume 3142 of Lecture Notes in Computer Science, pages 932–944, Springer, 2005. Work supported by ACI Sécurité Informatique: VERA of the French Ministry of research.