中国学术期刊网燕化镜像站点建设

通过中国学术期刊网燕化镜像站点的建设，介绍了燕山石化镜像站点的配置及主要管理功能和对全文数据库的检索，浏览功能，同时介绍了新形势下，信息化建设的新观念，新思路，以及强化信息意识，加强信息服务产业化发展的重要性和迫切性。     

The GENIUS-test-facility—first results on background from Rn daughters

GENIUS-TF (Nucl. Instr. and Meth. A 511 (2003) 341; Nucl. Instr. and Meth. A 481 (2002) 149.) is a test-facility for the GENIUS project (GENIUS-Proposal, 20 November 1997; Z. Phys. A 359 (1997) 351; CERN Courier, November 1997, 16; J. Phys. G 24 (1998) 483; Z. Phys. A 359 (1997) 361; in: H.V. Klapdor-Kleingrothaus, H. Pas. (Eds.), First International Conference on Particle Physics Beyond the Standard Model, Castle Ringberg, Germany, 8–14 June 1997, IOP Bristol (1998) 485 and in Int. J. Mod. Phys. A 13 (1998) 3953; in: H.V. Klapdor-Kleingrothaus, I.V. Krivosheina (Eds.), Proceedings of the Second International Conference on Particle Physics Beyond the Standard Model BEYOND’ 99, Castle Ringberg, Germany 6–12 June 1999, IOP Bristol (2000) 915), a proposed large scale underground observatory for rare events which is based on operation of naked germanium detectors in liquid nitrogen for an extreme background reduction. Operation of naked Ge crystals in liquid nitrogen has been applied routinely already for more than 20 years by the CANBERRA Company for technical functions tests (CANBERRA Company, private communication, 5 March 2004.), but it never had found entrance into basic research. Only in 1997 first tests of application of this method for nuclear spectroscopy have been performed, successfully, in Heidelberg (Klapdor-Kleingrothaus et al., 1997, 1998; J. Hellmig and H.V. Klapdor-Kleingrothaus, 1997).

On May 5, 2003 the first four naked high-purity germanium detectors (total mass 10.52 kg) were installed in liquid nitrogen in the GENIUS Test Facility at the Gran Sasso underground laboratory. Since then the experiment has been running continuously, testing for the first time the novel technique in an underground laboratory and for a long-lasting period.

In this work, we present the first analysis of the GENIUS-TF background after the completion of the external shielding, which took place in December 2003. We focus especially on the background coming from ²²²Rn daughters. This is found to be at present by a factor of 200 higher than expected from simulation. It is still compatible with the scientific goal of GENIUS-TF, namely to search for cold dark matter by the modulation signal, but on the present level would cause serious problems for a full GENIUS—like experiment using liquid nitrogen.     

Optimization by random search with jumps

We give a random optimization (RO) algorithm to optimize a real‐valued function of n real variables. During the optimization process, interpolation points are examined to follow valleys, and jumps to new starting points are executed to avoid numerous iterations in local minima. Convergence with probability one to the global minimum of a function is proved. The proposed RO method is a simple, derivative‐free and computationally moderate algorithm, with excellent performance compared to other RO methods. Seven functions, which are commonly used to test the performance of optimization methods, are used to evaluate the performance of the RO algorithm given here. Copyright © 2004 John Wiley & Sons, Ltd.     

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

毛家河水电站库区岩溶发育特征及邻谷渗漏分析

毛家河水电站位于碳酸盐岩地区，库首距左岸邻谷可渡河14—23km、距右岸邻谷北盘江干流14．8km，水库两岸大型落水洞、溶洞及地下岩溶管道相对较为发育。为初步判断水库存在邻谷渗漏的可能性，对水库两岸可溶岩地层岩溶发育形态、特征及规律进行了勘察，并根据现场地质调查资料对3条可疑渗漏带进行了分析论证。     

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)     

Infinite-horizon Scheduling Algorithms for Optimal Search for Hidden Objects

This paper considers discrete search problems in which a decision-maker has to find objects lost or hidden in a given set of locations so as to minimize the expected losses incurred. Given a chance to look for a hidden object in the same location infinitely many times, this type of problem, in contrast to standard scheduling problems, has an infinite sequence as its solution. Thus we are concerned to find an algorithm that yields an optimal solution, rather than the optimal sequence itself. Using combinatorial techniques, fast optimal algorithms for solving the problems are obtained, and optimality conditions are presented for search criteria, under which the local-search algorithms yield the global optimum.     

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)