结合公钥加密和关键字可搜索加密的加密方案

带关键字搜索的公钥加密(PEKS)是一种有用的加密原语，它允许用户将在加密数据上搜索的功能委托给不可信的第三方服务器，而不影响原始数据的安全性和隐私性。但是，由于缺乏对于数据的加密以及解密能力，PEKS方案不能单独进行使用，必须与标准的公钥加密方案(PKE)相结合。因此，Baek等人在2006年引入了一种新的加密原语，称为结合PKE和PEKS的加密方案(PKE+PEKS)，它同时提供了PKE和PEKS的功能。目前，已有文献提出了几种PKE+PEKS方案。然而，他们都没有考虑关键字猜测攻击的问题。本文提出一个新的高效且能够抵抗关键字猜测攻击的PKE+PEKS方案，与已有方案相比，该方案在性能上有很大的提升，并且在生成关键字和数据密文时，不需要使用双线性对，极大地降低了计算和存储成本。安全性分析表明，本文中所提出的方案能够满足密文隐私安全性、陷门不可区分性和抗关键字猜测攻击的安全性。效率分析表明，本分提出的方案更加高效。     

一种自动布线方法：多级线探索法

本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念，通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法，但有较传统线探索法更强的探索能力，不需要结合李氏算法而能单独完成布线任务，是一种较理想的算法，通过实验获得了较为满意的效果。     

Sphere packing with a geometric based compression algorithm

An efficient algorithm for the random packing of spheres can significantly save the cost of the preparation of an initial configuration often required in discrete element simulations. It is not trivial to generate such random packing at a large scale, particularly when spheres of various sizes and geometric domains of different shapes are present. Motivated by the idea of compression complemented by an efficient physical process to increase packing density, shaking, a new approach, termed compression algorithm, is proposed in this work to randomly fill any arbitrary polyhedral or cylindrical domains with spheres of various sizes. The algorithm features both simplicity and high efficiency. Tests show that it takes 181 s on a 1.4-GHz PC to complete the filling of a cylindrical domain with a total number of 26,787 spheres, achieving a packing density of 52.89%.     

When danger lurks in the background: Attentional capture by animal fear-relevant distractors is specific and selectively enhanced by animal fear.

Across 2 experiments, a new experimental procedure was used to investigate attentional capture by animal fear-relevant stimuli. In Experiment 1 (N = 34), unselected participants were slower to detect a neutral target animal in the presence of a spider than a cockroach distractor and in the presence of a snake than a large lizard distractor. This result confirms that phylogenetically fear-relevant animals capture attention specifically and to a larger extent than do non-fear-relevant animals. In Experiment 2 (N = 86), detection of a neutral target animal was slowed more in the presence of a feared fear-relevant distractor (e.g., a snake for snake-fearful participants) than in presence of a not-feared fear-relevant distractor (e.g., a spider for snake-fearful participants). These results indicate preferential attentional capture that is specific to phylogenetically fear-relevant stimuli and is selectively enhanced in individuals who fear these animals. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Serial deployment of attention during visual search.

This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

Color Grouping in Space and Time: Evidence From Negative Color-Based Carryover Effects in Preview Search.

Five experiments addressed the role of color grouping in preview search (D. G. Watson & G. W. Humphreys, 1997). Experiment 1 used opposite color ratios of distractors in preview and second search displays, creating equal numbers of distractors in each color group in the final display. There was selective slowing for new targets carrying the majority color of the old items. This effect held when there was no bias in the preview and only the second search set had an uneven color ratio (Experiment 2). In Experiment 3, participants had foreknowledge of the target color, and effects were shown over and above those due to color biases. Experiment 4 demonstrated negative color carryover even when previews changed color. Experiment 5 showed reduced color carryover effects when previews were presented more briefly. Collectively, the results provide evidence for inhibitory carryover effects in preview search based on feature grouping. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Response Selection in Visual Search: The Influence of Response Compatibility of Nontargets.

The authors used visual search tasks in which components of the classic flanker task (B. A. Eriksen & C. W. Eriksen, 1974) were introduced. In several experiments the authors obtained evidence of parallel search for a target among distractor elements. Therefore, 2-stage models of visual search predict no effect of the identity of those distractors. However, clear compatibility effects of the distractors were obtained: Responses were faster when the distractors were compatible with the response than when they were incompatible. These results show that even in parallel search tasks identity information is extracted from the distractors. In addition, alternative interpretations of the results in terms of the occasional identification of a distractor before or after the target was identified could be ruled out. The results showed that flat search slopes obtained in visual search experiments provide no benchmark for preattentive processing. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Effects of surrounding brightness on visual search for safety colors

The present article reports the investigation of the effects of surrounding brightness on a visual search for three safety colors: red, orange, and yellow. Images of visual stimuli consisting of an array of colored circles placed on a large visual field (a visual angle of 40°) were displayed on an 80‐in. screen with a DLP projector. Experiment I examined the search efficiency under three levels of background luminance that were equivalent to the three target luminances. The results showed that the search efficiency for the orange target decreased as the number of distractors increased, under each of the background luminance levels, whereas the efficiency scarcely decreased for the red and yellow targets. Although a reduction in background luminance increased the search efficiency for the orange target, it is suggested that the effect of background luminance is smaller than the effect of the target color in search efficiency. Experiment II examined the search efficiency under three conditions of low levels of incident illuminance, which were matched with a linear regression to the luminance of color chips of safety colors measured twilight conditions. The results showed that the search efficiency for the orange target decreased as the number of distractors increased under each of the different illuminance conditions, whereas the efficiency scarcely decreased for red and yellow targets. Furthermore, as illuminance decreased, the search time for the orange target was more greatly impacted than for red or yellow. These results imply that the recognition of orange tends to be influenced by the surrounding brightness. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 400–409, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20152