Scheduling railway traffic at a construction site

We consider the problem of rescheduling trains in the case where one track of a railway section consisting of two tracks in opposing directions is closed due to construction activities. After presenting an appropriate model for this situation we derive a polynomial algorithm for the subproblem of finding an optimal schedule with minimal latenesss if the subsequences of trains for both directions outside the construction site are fixed. Based on this algorithm we propose a local search procedure for the general problem of finding good schedules and report test results for some real world instances. Received: December 8, 1999 / Accepted: May 2, 2001     

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

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

基于混沌电路的一种混合噪声调制雷达引信

提出了一种基于混沌电路的随机脉位调制（RPPM）和随机二相码调相（RBCPM）混合调制的雷达引信系统。介绍了该引信波形的数学模型，平均模型函数及引信的实现框图和工作原理，研究了基于混沌电路的混合调制信号的产生方法，这种引信波形不仅具有结构简单和易于处理等特点，而且具有良好的测距和测速性能，以及极低的截获概率和很强的抗干扰特性。     

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

Logistic Regression Analysis of Customer Satisfaction Data

Variation exists in all processes. Significant work has been done to identify and remove sources of variation in manufacturing processes resulting in large returns for companies. However, business process optimization is an area that has a large potential return for a company. Business processes can be difficult to optimize due to the nature of the output variables associated with them. Business processes tend to have output variables that are binary, nominal or ordinal. Examples of these types of output include whether a particular event occurred, a customer's color preference for a new product and survey questions that assess the extent of the survey respondent's agreement with a particular statement. Output variables that are binary, nominal or ordinal cannot be modeled using ordinary least‐squares regression. Logistic regression is a method used to model data where the output is binary, nominal or ordinal. This article provides a review of logistic regression and demonstrates its use in modeling data from a business process involving customer feedback. Copyright © 2006 John Wiley & Sons, Ltd.     

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)     

Configurational and nonconfigurational interactions between odorants in binary mixtures.

Studies on odor mixture perception suggest that although odor components can often be identified in mixtures, mixtures can also give rise to novel perceptual qualities that are not present in the components. Using an olfactory habituation task, the authors evaluated how the perceptual similarity between components in a mixture affects the perceptual quality of the mixture itself. Rats perceived binary mixtures composed of similar components as different from their 2 components, whereas binary mixtures composed of dissimilar components were perceived as very similar to their components. Results show that for both types of mixtures, pretraining to Component A reduces subsequent learning about Component B in rats trained in the presence of A. (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)