Commitment-based device-pairing protocol with synchronized drawings and comparison metrics

This article presents a new method for pairing devices securely. The commitment-based authentication uses a fuzzy secret that the devices only know approximately. Its novel feature is time-based opening of commitments in a single round. We also introduce a new source for the fuzzy secret: synchronized drawing with two fingers of the same hand on two touch screens or surfaces. The drawings are encoded as strings and compared with an edit-distance metric. A prototype implementation of this surprisingly simple and natural pairing mechanism shows that it accurately differentiates between true positives and man-in-the-middle attackers.     

Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem

In this paper we develop an intelligent path relinking procedure for the capacitated vehicle routing problem, based on the relocate distance. This procedure transforms an incumbent solution into a guiding solution in a minimal number of relocate moves. In each step of the path relinking procedure, one customer is removed from the solution and re-inserted in another position.     

Java开发工具分析与研究(二)

Java技术具有卓著的通用性、高效性、平台移植性和安全性,使得它能已经被广泛的应用于个人电脑、游戏控制台、移动通信、互联网、科学计算和超级计算机中,同时拥有全球最大的开发人员专业社群.由于关注Java程序设计语言工具的厂商如此众多,有如此多的开发工具,对于学习Java的初学者,甚至是对Java程序设计有基础的人员来说在面对具体问题的时候都常常难以抉择.本文通过介绍、分析、点评部分Java开发工具,给程序开发人员提供具体的参考.     

Java开发工具分析与研究(一)

Java技术具有卓越的通用性、高效性、平台移植性和安全性,广泛应用于个人PC、数据中心、游戏控制台、科学超级计算机、移动电话和互联网,同时拥有全球最大的开发者专业社群.因此,同时关注Java程序设计语言工具的厂商如此众多,有如此多的开发工具,对于学习Java的初学者,甚至是对Java程序设计有基础的人员来说都很难做出选择.本文向热爱Java程序设计的开发者介绍一些Java开发工具,并进行分析和点评.     

Learning Natural Colors for Image Recoloring

We present a data‐driven method for automatically recoloring a photo to enhance its appearance or change a viewer's emotional response to it. A compact representation called a RegionNet summarizes color and geometric features of image regions, and geometric relationships between them. Correlations between color property distributions and geometric features of regions are learned from a database of well‐colored photos. A probabilistic factor graph model is used to summarize distributions of color properties and generate an overall probability distribution for color suggestions. Given a new input image, we can generate multiple recolored results which unlike previous automatic results, are both natural and artistic, and compatible with their spatial arrangements.     

A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings

Let X and Y be two strings of lengths n and m, respectively, and k and l, respectively, be the numbers of runs in their corresponding run-length encoded forms. We propose a simple algorithm for computing the longest common subsequence of two given strings X and Y in O(kl+min{p₁,p₂}) time, where p₁ and p₂ denote the numbers of elements in the bottom and right boundaries of the matched blocks, respectively. It improves the previously known time bound O(min{nl,km}) and outperforms the time bounds O(kllogkl) or O((k+l+q)log(k+l+q)) for some cases, where q denotes the number of matched blocks.     

8096/8098单片机集成开发系统

本集成开发环境集编辑、编译、调试和运行于一体,模拟了MCS-96系列单片机的指令系统,并给教学、实验、应用、科研和单片机的开发提供了强有力的手段。     

一种有效的编辑距离和编辑路径求解技术

给定字符串Ｔ．Ｐ，将Ｔ转换成Ｐ所需的插入，删除，替代序列称为Ｔ到Ｐ的编辑路径，其最短编辑路径所需的插入，删除替代总数称为Ｔ到Ｐ的编辑距离，本文提出一种有效的编辑距离和编辑路径求解技术，该技术首先通过一有效的字符串相似匹配算法计算出编辑距离，而后仅通过简单的二进制字位运算正确计算出编辑路径。     

Sublinear approximate string matching and biological applications

Given a text string of lengthn and a pattern string of lengthm over ab-letter alphabet, thek differences approximate string matching problem asks for all locations in the text where the pattern occurs with at mostk differences (substitutions, insertions, deletions). We treatk not as a constant but as a fraction ofm (not necessarily constant-fraction). Previous algorithms require at leastO(kn) time (or exponential space). We give an algorithm that is sublinear time0((n/m)k log _b m) when the text is random andk is bounded by the threshold m/(log_b m + O(1)). In particular, whenk=o(m/log_b m) the expected running time iso(n). In the worst case our algorithm is O(kn), but is still an improvement in that it is practical and uses0(m) space compared with0(n) or0(m ²). We define three problems motivated by molecular biology and describe efficient algorithms based on our techniques: (1) approximate substring matching, (2) approximate-overlap detection, and (3) approximate codon matching. Respectively, applications to biology are local similarity search, sequence assembly, and DNA-protein matching.This work was supported in part by NSF Grants CCR-87-04184 and FD-89-02813; by the Human Genome Center, Lawrence Berkeley Laboratory, supported by the Director, Office of Health and Environmental Research, of the U.S. Department of Energy under Contract DE-AC03-76SF00098; and by Department of Energy Grants DE-FG03-90ER60999 and DE-FG02-91ER61190. Earlier versions of this paper appeared as [8] and part of [5].     

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.