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.     

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

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

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.     

解析PowerBuilder的数据处理机制

数据窗口对象是专门为了访问后台的数据库服务的,在数据窗口对象中定义数据的来源和数据的显示风格.数据窗口根据所需的显示风格将数据源表设计好.在运行时将所要的数据从数据库服务器上下栽到客户机上处理,更改后的数据进行提交或回滚.     

VB教学方法浅析

程序设计是计算机专业课程中的重要内容之一。在程序设计课程教学中,如何解决程序设计本身枯燥、难懂这个问题,找到一条比较新颖的教学方式,一直是广大计算机教师颇感兴趣的课题。结合几年来VB程序设计的实际经验,并进行深刻的反思,总结出一个四步教学法。     

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.     

On-Line Approximate String Searching Algorithms: Survey and Experimental Results

The problem of approximate string searching comprises two classes of problems: string searching with k mismatches and string searching with k differences. In this paper we present a short survey and experimental results for well known sequential approximate string searching algorithms. We consider algorithms based on different approaches including dynamic programming, deterministic finite automata, filtering, counting and bit parallelism. We compare these algorithms in terms of running time against pattern length and for several values of k for four different kinds of text: binary alphabet, alphabet of size 8, English alphabet and DNA alphabet. Finally, we compare the experimental results of the algorithms with their theoretical complexities.     

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

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

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

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

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.