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%.     

高分辨率合成孔径雷达图像舰船检测方法

寻找针对高分辨率SAR图像的舰船目标检测算法。利用KSW双阈值分割技术，其效果比传统检测方法好，有利于进一步的目标分类和识别。且必须根据SAR图像分辨率来选择舰船检测算法。     

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)     

Kernel Spectral Matched Filter for Hyperspectral Imagery

In this paper a kernel-based nonlinear spectral matched filter is introduced for target detection in hyperspectral imagery, which is implemented by using the ideas in kernel-based learning theory. A spectral matched filter is defined in a feature space of high dimensionality, which is implicitly generated by a nonlinear mapping associated with a kernel function. A kernel version of the matched filter is derived by expressing the spectral matched filter in terms of the vector dot products form and replacing each dot product with a kernel function using the so called kernel trick property of the Mercer kernels. The proposed kernel spectral matched filter is equivalent to a nonlinear matched filter in the original input space, which is capable of generating nonlinear decision boundaries. The kernel version of the linear spectral matched filter is implemented and simulation results on hyperspectral imagery show that the kernel spectral matched filter outperforms the conventional linear matched filter.     

基于ANN的声目标识别系统及其DSP实时实现

介绍了一种基于人工神经网络(ANN)的声目标识别系统,概述了用MATLAB专用工具箱对神经网络权值进行训练及仿真的过程,叙述了ANN目标识别系统的数字信号处理器(DSP)实时实现过程,并着重分析定点实现过程中程序变量的定标、非线性运算的实现、溢出的处理等关键步骤.对不同字长的识别结果进行比较表明,基于定点实时实现的系统数据保持很高的精度,可以得到与浮点处理相同的识别率.     

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)     

用Promax处理LD22-l“模糊带”地震资料

通过LD22-l构造地震资料目标处理,搞清了“模糊带”,引进交互处理系统是成功的.     

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.     

Gorillas (Gorilla gorilla) and Orangutans (Pongo pygmaeus) Encode Relevant Problem Features in a Tool-Using Task.

Two important elements in problem solving are the abilities to encode relevant task features and to combine multiple actions to achieve the goal. The authors investigated these 2 elements in a task in which gorillas (Gorilla gorilla) and orangutans (Pongo pygmaeus) had to use a tool to retrieve an out-of-reach reward. Subjects were able to select tools of an appropriate length to reach the reward even when the position of the reward and tools were not simultaneously visible. When presented with tools that were too short to retrieve the reward, subjects were more likely to refuse to use them than when tools were the appropriate length. Subjects were proficient at using tools in sequence to retrieve the reward. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Programming tool-use actions.

When humans plan to execute a tool-use action, they can only specify the bodily movement parameters by taking into account the external target or goal of the tool-use action and the target-movement mapping implemented by the tool. In this study, the authors used the movement precuing method to investigate how people prepare for actions made with tools. More specifically, they asked whether people would be able to specify the spatial target and the target-movement mapping of the tool-use action independently of each other, and to what degree they would be able to prepare these components in advance. In 3 experiments, they precued either the target or the target-movement mapping of tool-use actions involving either a compatible or an incompatible target-movement mapping. Results indicate that participants benefit from partial advance information about the target-movement mapping, whereas no significant effects were found for precuing the spatial target of the action. These results occurred regardless of whether the target-movement mapping was compatible or incompatible and provide evidence for the notion that the target-movement mapping of a tool-use action is part of its cognitive representation. (PsycINFO Database Record (c) 2010 APA, all rights reserved)