Parametric models of local search progression

Algorithms that search for good solutions to optimization problems present a trace of current best objective values over time. We describe an empirical study of parametric models of this progression that are both interesting as ways to characterize the search progression compactly and useful as means of predicting search behavior. In our computational experiments, we give examples of a variety of problems and algorithms where we are able to use the parametric models to make predictions of performance that cross instances and instance sizes.     

Searching for differences in race: Is there evidence for preferential detection of other-race faces?

Previous research has suggested that like animal and social fear-relevant stimuli, other-race faces (African American) are detected preferentially in visual search. Three experiments using Chinese or Indonesian faces as other-race faces yielded the opposite pattern of results: faster detection of same-race faces among other-race faces. This apparently inconsistent pattern of results was resolved by showing that Asian and African American faces are detected preferentially in tasks that have small stimulus sets and employ fixed target searches. Asian and African American other-race faces are found slower among Caucasian face backgrounds if larger stimulus sets are used in tasks with a variable mapping of stimulus to background or target. Thus, preferential detection of other-race faces was not found under task conditions in which preferential detection of animal and social fear-relevant stimuli is evident. Although consistent with the view that same-race faces are processed in more detail than other-race faces, the current findings suggest that other-race faces do not draw attention preferentially. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Maximum vertex occupation time and inert fugitive: Recontamination does help

Given a simple graph G, we consider the node search problem with inert fugitive. We are interested in minimizing the maximum vertex occupation time, i.e. the maximum number of steps in which a vertex is occupied by a searcher during a search of G. We prove that a search program which does not allow a recontamination may not find an optimal solution to this problem. Moreover, the difference between the minimum maximum vertex occupation time computed by a monotone search program and a program without such a restriction may be arbitrarily large.     

一种基于启发式搜索的论文元数据提取算法

随着大量的科研论文以电子文档的形式出现, 为了高效地检索这些科研文献资料,从中精确地抽取这些论文头部的元数据信息显得十分有必要.在条件随机场模型的基础上,提出了一种启发式搜索算法来对论文头部的元数据信息进行提取.该算法首先利用文本分块技术和特征提取规则来对文本进行预处理,然后结合条件随机场概率模型利用启发式搜索来进行元数据的提取.实验结果表明,在相同概率模型的基础上,该算法有着较好的性能,在精确度和召回率方面都有了明显的提高.     

新蚁群算法模型在大学课程时间表问题中的应用

分析大学课程时间表问题的特征,结合已有蚁群算法的求解策略,构建了新的问题求解模型,提出了一种基于蚁群算法和改进过程的求解算法,并在不同规模的问题实例上进行实验。结果表明,算法在目标函数解的质量上有明显改进。     

基于P2P的结构化半分布式语义搜索算法

目前的搜索引擎算法大多是基于关键词搜索,体系上是集中式结构,在安全性和语义性上存在缺陷.基于P2P的结构化半分布式语义搜索算法--DPSS(Distributed P2P Semantic Search),通过研究词与词的关联度,在传统的P2P覆盖语义层,实现语义功能.同时,结合文章距离算法,能够应用在文本分类、文章聚类等领域.     

Effects of magnification methods and magnifier shapes on visual inspection

This study investigated the effectiveness of the novel differential linear and differential nonlinear magnification methods, and the effects of magnifier shape and magnification power on visual search performance. With the differential magnification, objects that were more peripheral were scaled at a level higher than those in the vicinity of fixation. It was hypothesized that 1) owing to the ineffectiveness of scaling stimulus in the vicinity of fixation, the differential magnification methods would enhance magnification effectiveness and thereby improve inspection performance, and 2) because an elliptical lens shape resembles the shape of human visual field, for the same area of magnified view, an elliptical magnifier would be more effective than the circular one. In this study, objective performance measures of speed and accuracy and subjective workload evaluation using the NASA Task Load Index paradigm were used. The results showed that 4× magnification increased the overall inspection time as compared with 3× magnification, suggesting that a trade-off might have occurred between magnification and field size. The two hypotheses were not confirmed; however, a number of questions arose which need further investigation. Discussions of the concerned questions were made on i) the unfamiliarity of subjects with the new differential magnification methods, ii) perceptual discomfort due to image duplication, discontinuity, and distortion resulting from stimulus scaling, iii) the movement of fixation points, and iv) the competition for attention between foveal and peripheral magnified objects. This study prompts the authors to consider a training programme on the differential linear and nonlinear magnification methods in future studies. With proper instructions regarding the nature of lens and magnified images, subjects' performance with the novel differential magnification methods may be improved.     

可验证的多等级门限多秘密共享方案

目前的多等级门限共享方案中,高等级用户的作用可以被若干个低等级用户联合取代,而多秘密门限共享方案中,所有秘密只能在同一级门限下共享。为克服这两个问题,利用Birkhoff插值法和离散对数的困难性,提出了一个可认证的多等级门限多秘密共享方案。该方案可以同时划分多个等级,而每级门限下可以共享多个秘密。每个参与者只需持有一个子秘密,方便管理与使用。     

NKChemSQL——针对MySQL的化学信息学扩展

化学数据库是进行化学信息学研究的重要资源,分子属性与指纹计算、分子结构格式转换、分子相似度匹配、精确匹配和子结构匹配以及分子结构图片导出等,都是必需的基本服务内容。应用广泛的数据库系统MySQL却缺乏这些功能,难以满足化学信息处理、网站开发等开发的需求。NKChemSQL是自行编制的MySQL扩展库,通过对开源软件OpenBabel的功能进行包装,以SQL语言的格式完成相应操作。NKChemSQL具有良好的运行表现,经过对含26万余条分子结构信息的NCI数据库进行的测试,全结构匹配只需不到1秒而子结构匹配达300个结构/秒,相似度匹配则达1万个结构/秒。NKChemSQL为开发化学信息学软件和网站提供了非常便利的新方式。