Children's Reasoning About the Causal Significance of the Temporal Order of Events.

Four experiments examined children's ability to reason about the causal significance of the order in which 2 events occurred (the pressing of buttons on a mechanically operated box). In Study 1, 4-year-olds were unable to make the relevant inferences, whereas 5-year-olds were successful on one version of the task. In Study 2, 3-year-olds were successful on a simplified version of the task in which they were able to observe the events although not their consequences. Study 3 found that older children had difficulties with the original task even when provided with cues to attend to order information. However, 5-year-olds performed successfully in Study 4, in which the causally relevant event was made more salient. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Barrier Trees on Poset-Valued Landscapes

Fitness landscapes have proved to be a valuable concept in evolutionary biology, combinatorial optimization, and the physics of disordered systems. Usually, a fitness landscape is considered as a mapping from a configuration space equipped with some notion of adjacency, nearness, distance, or accessibility, into the real numbers. In the context of multi-objective optimization problems this concept can be extended to poset-valued landscapes. In a geometric analysis of such a structure, local Pareto points take on the role of local minima. We show that the notion of saddle points, barriers, and basins can be extended to the poset-valued case in a meaningful way and describe an algorithm that efficiently extracts these features from an exhaustive enumeration of a given generalized landscape.     

Adaptive polygonization of geometrically constrained surfaces

n -dimensional space, where n>3. This definition can be used for given surfaces that are implicit or parametric. This paper presents a robust, adaptive polygonization algorithm for evaluating and visualizing geometrically constrained surfaces. Let be the constrained surface, a 2-surface in n-space, and let π() be its projection into the subspace spanned by the first three coordinates. Our polygonization algorithm computes π(). The method works directly with the n-space representation, but performs all major computations in 3-space. Techniques for triangulation, polygon decimation, and local refinement are also presented.     

An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach

In this paper we consider the no-wait job shop problem with a makespan objective. This problem has usually been addressed by its decomposition into a sequencing and a timetabling problem. Here, first we focus on the timetabling problem and take advantage of the symmetry of the problem in order to suggest a new timetabling procedure. Secondly, we suggest embedding this timetabling into a recent metaheuristic named complete local search with memory.     

Das Problem der verantworteten Therapieentscheidung in der Neonatologie

Definition of the problem: Physicians and nurses who work in neonatology—as in intensive care at all—are often forced to decide whether to stop or to continue with the treatment of a severely ill patient. The literature provides several decision making instruments, which are meant to help and to rationalize such decisions. Method and conclusion: Two of these instruments (“Schema zur ethischen Urteilsbildung nach dem Muster der aristotelischen Ethik”, Honnefelder 1994; “Nimwegener Methode für ethische Fallbesprechung”, Gordijn 1998) were tested by retrospectively examining two cases of our NICU. Results of our study show that the use of a decision making instrument is basically helpful. But the above mentioned instruments showed also shortcomings when used in the framework of neonatology. Therefore we developed the “Kölner Arbeitsbogen zur ethischen Entscheidungsfindung in der Neonatologie”, which is adapted to the specific needs of neonatology.