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)     

神经网络分类器的快速构造算法

使用ＢＰ算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法，先构造决策树，然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长，它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果，本文的算法比用ＢＰ算法训练多层网络要快，而其分类精度不低于用ＢＰ算法训练的多层神经网。     

一种产生式系统的并行推理模型

1.引言 在人工智能领域中,产生式系统是一种比较有效的知识表示方法,并得到了广泛应用。目前许多较为成功的专家系统都是用产生式系统实现的~[1]。随着应用领域的不断扩士其知识座的抓橄称渐增     

红外目标精跟踪方法的研究

本文提出了一种直接把红外前视传感器的输出作为测量值来跟踪红外目标的扩展型卡尔曼滤波跟踪算法。在滤波处理时,设置可变的测量矩阵,其目的在于提高运算速度和抑制噪声干扰。通过具体的实例,对所提跟踪算法的特点和有效性进行了细致的分析。     

WKB近似下的Fourier衍射成象方法

对于介质目标微波衍射成象，本文引入了ＷＫＢ近似来模拟目标内部总场。基于这种近似，我们导出了Ｆｏｕｒｉｅｒ衍射公式，并采用了广义滤波逆传播方法由目标空间谱实现目标特性的重建。计算机模拟结果表明采用ＷＫＢ近似重建目标特性较Ｂｏｒｎ近似有明显改善。     

The pickup and delivery problem: Faces and branch-and-cut algorithm

This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.     

LZW压缩算法解析及应用设计

ＬＺＷ压缩算法是一种无限压缩算法，它主要是用一种代码来表示数据流中出现的重复串，以达到压缩的目的。     

A Progressive Radiosity Algorithm for Scenes Containing Curved Surfaces

Based on the theory of light energy transfer between two differential diffuse surface areas, a generalized radiosity approach is presented. Unlike the conventional radiosity method, curved surfaces are subdivided into triangular surface patches, radiosity is assummed to be vary across each triangular surface patch. By adopting linear interpolation scheme over each triangular surface patch, we have established a complete set of approximated radiosity equations. Their unknowns are radiosities of differential surface areas located at all vertices of surface patches. The generalized radiosity equation has also been extended to non-diffuse environments. Theoretical analysis and experimental results demonstrate the great potential of this method,