The history and development of the helium ion microscope

The helium ion microscope has recently emerged as a commercially available instrument. However, its roots go back more than 60 years to the development of the field ion microscope in Berlin, first reported in 1951. Over the intervening years, numerous researchers have pursued the development of a gas field ionization source with the goal of producing a suitable source for an ion microscope. This proved to be an elusive goal until early in this century when a number of discoveries led to a successful source, and shortly thereafter, an instrument fully able to exploit its advantages. Many individuals and many technical advances have come together to make this new class of microscope. The long history of this quest is reviewed along with the recent advances that led to the achievement of this milestone. A brief summary of the current status of the technology and its applications are given.     

Population shift bias in tests of space–time interaction

Common to all tests of space–time interaction is the assumption that the population underlying the events of interest exhibits a trajectory of growth that is consistent through time and across space. In practice, however, this assumption is often untenable and, when violated, can introduce population shift bias into the results of these tests. While this problem is widely recognized, more work remains to compare its effect across tests and to determine the extent to which it is a problem for study short periods. This paper quantifies and compares the population shift bias present in the results of the Knox, Mantel, and Jacquez tests of space–time interaction. A simulation study is carried out which quantifies the bias present in each test across a variety of population movement scenarios. Results show a positive relationship between population shift bias and the heterogeneity in population growth across all the tests. They also demonstrate variability in the size of the bias across the three tests for space–time interaction considered. Finally, the results illustrate that population shift bias can be a serious problem for short study periods. Collectively, these findings suggest that an unbiased approach to assessing the significance of space–time interaction test results is needed whenever spatially heterogeneous population change is identified within a study area.     

Psychological and Physiological Adaptations to Sperm Competition in Humans.

Postcopulatory competition between males, in the form of sperm competition, is a widespread phenomenon in many animal species. The extent to which sperm competition has been an important selective pressure during human evolution remains controversial, however. The authors review critically the evidence that human males and females have psychological, behavioral, and physiological adaptations that evolved in response to selection pressures associated with sperm competition. The authors consider, using evidence from contemporary societies, whether sperm competition is likely to have been a significant adaptive problem for ancestral humans and examine the evidence suggesting that human males have physiological and psychological mechanisms that allow for "prudent" sperm allocation in response to variations in the risk of sperm competition. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Redux: A Dynamic Dataflow Tracer

Redux is a tool that generates dynamic dataflow graphs. It generates these graphs by tracing a program's execution and recording every value-producing operation that takes place, building up a complete computational history of every value produced. For that execution, by considering the parts of the graph reachable from system call inputs, we can choose to see only the dataflow that affects the outside world. Redux works with program binaries, and thus is not restricted to programs written in any particular language.We explain how Redux works, and show how dynamic dataflow graphs give the essence of a program's computation. We show how Redux can be used for debugging and program slicing, and consider a range of other possible uses.     

Electronic Commerce Customer Relationship Management: A Research Agenda

In this paper, we approach electronic commerce Customer Relationship Management (e-CRM) from the perspective of five research areas. Our purpose is to define a conceptual framework to examine the relationships among and between these five research areas within e-CRM and to propose how they might be integrated to further research this area. We begin with a discussion of each of the research areas through brief reviews of relevant literature for each and a discussion of the theoretical and strategic implications associated with some CRM technologies and research areas. Next we present our framework, which focuses on e-CRM from the five research perspectives. We then present a theoretical framework for e-CRM in terms of the five research areas and how they affect one another, as well as e-CRM processes and both performance and non-performance outcomes.     

Scheduling and Lot Streaming in Flowshops with No-Wait in Process

Lot streaming involves splitting a production lot into a number of sublots, in order to allow the overlapping of successive operations, in multi-machine manufacturing systems. In no-wait flowshop scheduling, sublots are necessarily consistent, that is, they remain the same over all machines. The benefits of lot streaming include reductions in lead times and work-in-process, and increases in machine utilization rates. We study the problem of minimizing the makespan in no-wait flowshops producing multiple products with attached setup times, using lot streaming. Our study of the single product problem resolves an open question from the lot streaming literature. The intractable multiple product problem requires finding the optimal number of sublots, sublot sizes, and a product sequence for each machine. We develop a dynamic programming algorithm to generate all the nondominated schedule profiles for each product that are required to formulate the flowshop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and computationally test an efficient heuristic for this problem. Our results indicate that solutions can quickly be found for flowshops with up to 10 machines and 50 products. Moreover, the solutions found by our heuristic provide a substantial improvement over previously published results.     

Uniform Distribution, Distance and Expectation Problems for Geometric Features Processing

Complex geometric features such as oriented points, lines or 3D frames are increasingly used in image processing and computer vision. However, processing these geometric features is far more difficult than processing points, and a number of paradoxes can arise. We establish in this article the basic mathematical framework required to avoid them and analyze more specifically three basic problems: (1) what is a random distribution of features, (2) how to define a distance between features, (3) and what is the “mean feature” of a number of feature measurements? We insist on the importance of an invariance hypothesis for these definitions relative to a group of transformations that models the different possible data acquisitions. We develop general methods to solve these three problems and illustrate them with 3D frame features under rigid transformations. The first problem has a direct application in the computation of the prior probability of a false match in classical model-based object recognition algorithms. We also present experimental results of the two other problems for the statistical analysis of anatomical features automatically extracted from 24 three-dimensional images of a single patient's head. These experiments successfully confirm the importance of the rigorous requirements presented in this article.     

Isotropic Energies, Filters and Splines for Vector Field Regularization

The aim of this paper is to propose new regularization and filtering techniques for dense and sparse vector fields, and to focus on their application to non-rigid registration. Indeed, most of the regularization energies used in non-rigid registration operate independently on each coordinate of the transformation. The only common exception is the linear elastic energy, which enables cross-effects between coordinates. Cross-effects are yet essential to give realistic deformations in the uniform parts of the image, where displacements are interpolated.In this paper, we propose to find isotropic quadratic differential forms operating on a vector field, using a known theorem on isotropic tensors, and we give results for differentials of order 1 and 2. The quadratic approximation induced by these energies yields a new class of vectorial filters, applied numerically in the Fourier domain. We also propose a class of separable isotropic filters generalizing Gaussian filtering to vector fields, which enables fast smoothing in the spatial domain. Then we deduce splines in the context of interpolation or approximation of sparse displacements. These splines generalize scalar Laplacian splines, such as thin-plate splines, to vector interpolation. Finally, we propose to solve the problem of approximating a dense and a sparse displacement field at the same time. This last formulation enables us to introduce sparse geometrical constraints in intensity based non-rigid registration algorithms, illustrated here on intersubject brain registration.     

Stochastic inverse heat conduction using a spectral approach

An adjoint‐based functional optimization technique in conjunction with the spectral stochastic finite element method is proposed for the solution of an inverse heat conduction problem in the presence of uncertainties in material data, process conditions and measurement noise. The ill‐posed stochastic inverse problem is restated as a conditionally well‐posed L₂ optimization problem. The gradient of the objective function is obtained in a distributional sense by defining an appropriate stochastic adjoint field. The L₂ optimization problem is solved using a conjugate‐gradient approach. Accuracy and effectiveness of the proposed approach is appraised with the solution of several stochastic inverse heat conduction problems. Copyright © 2004 John Wiley & Sons, Ltd.