Practical considerations for high spatial and temporal resolution dynamic transmission electron microscopy

Although recent years have seen significant advances in the spatial resolution possible in the transmission electron microscope (TEM), the temporal resolution of most microscopes is limited to video rate at best. This lack of temporal resolution means that our understanding of dynamic processes in materials is extremely limited. High temporal resolution in the TEM can be achieved, however, by replacing the normal thermionic or field emission source with a photoemission source. In this case the temporal resolution is limited only by the ability to create a short pulse of photoexcited electrons in the source, and this can be as short as a few femtoseconds. The operation of the photo-emission source and the control of the subsequent pulse of electrons (containing as many as 5 x 10(7) electrons) create significant challenges for a standard microscope column that is designed to operate with a single electron in the column at any one time. In this paper, the generation and control of electron pulses in the TEM to obtain a temporal resolution <10(-6)s will be described and the effect of the pulse duration and current density on the spatial resolution of the instrument will be examined. The potential of these levels of temporal and spatial resolution for the study of dynamic materials processes will also be discussed.     

Influence of age and proximity warning devices on collision avoidance in simulated driving

OBJECTIVE: We conducted a set of experiments to examine the utility of several different uni- and multimodal collision avoidance systems (CASs) on driving performance of young and older adult drivers in a high-fidelity simulator. BACKGROUND: Although previous research has examined the efficacy of different CASs on collision avoidance, there has been a dearth of studies that have examined such devices in different driving situations with different populations of drivers. METHOD: Several different CAS warnings were examined in varying traffic and collision configurations both without (Experiment 1a) and with (Experiment 2) a distracting in-vehicle task. RESULTS: Overall, collision avoidance performance for both potential forward and side object collisions was best for an auditory/visual CAS, which alerted drivers using both modalities. Interestingly, older drivers (60-82 years of age) benefited as much as younger drivers from the CAS, and sometimes they benefited more. CONCLUSION: These data suggest that CASs can be beneficial across a number of different driving scenarios, types of collisions, and driver populations. APPLICATION: These results have important implications for the design and implementation of CASs for different driver populations and driving conditions.     

Quorum Systems Constructed from Combinatorial Designs

A quorum system is a set system in which any two subsets have nonempty intersection. Quorum systems have been extensively studied as a method of maintaining consistency in distributed systems. Important attributes of a quorum system include the load, balancing ratio, rank (i.e., quorum size), and availability. Many constructions have been presented in the literature for quorum systems in which these attributes take on optimal or otherwise favorable values. In this paper, we point out an elementary connection between quorum systems and the classical covering systems studied in combinatorial design theory. We look more closely at the quorum systems that are obtained from balanced incomplete block designs (BIBDs). We study the properties of these quorum systems and observe that they have load, balancing ratio, and rank that are all within a constant factor of being optimal. We also provide several observations about computing the failure polynomials of a quorum system (failure polynomials are used to measure availability). Asymptotic properties of failure polynomials have previously been analyzed for certain infinite families of quorum systems. We give an explicit formula for the failure polynomials for an easily constructed infinite class of quorum systems. We also develop two algorithms that are useful for computing failure polynomials for quorum systems and prove that computing failure polynomials is #P-hard. Computational results are presented for several “small” quorum systems obtained from BIBDs.     

Connection and coordination: the interplay between architecture and dynamics in evolved model pattern generators

We undertake a systematic study of the role of neural architecture in shaping the dynamics of evolved model pattern generators for a walking task. First, we consider the minimum number of connections necessary to achieve high performance on this task. Next, we identify architectural motifs associated with high fitness. We then examine how high-fitness architectures differ in their ability to evolve. Finally, we demonstrate the existence of distinct parameter subgroups in some architectures and show that these subgroups are characterized by differences in neuron excitabilities and connection signs.     

Branded interface toolkits

Typical software companies want the applications they market to have a consistent look and feel, so as to brand or identify their particular family of products or product line. Current user interface (UI) implementation techniques serve this business need poorly, tending to treat each application as a unique, independent artifact sharing little, if any, UI implementation code with other applications. Coupled with the overwhelming complexity found in modern UI toolkits, this results in unnecessarily high development costs for interfaces, and is at odds with the need of software companies to devote their resources to value‐added application code rather than incidental user‐interface implementation. This paper presents a model for a domain‐based UI application framework that addresses these issues: consistency in a family of products, both in operation and presentation; reduced implementation costs; and rapid development times. Copyright © 2001 John Wiley & Sons, Ltd.     

Optimizing multiple dimensional queries simultaneously in multidimensional databases

Some significant progress related to multidimensional data analysis has been achieved in the past few years, including the design of fast algorithms for computing datacubes, selecting some precomputed group-bys to materialize, and designing efficient storage structures for multidimensional data. However, little work has been carried out on multidimensional query optimization issues. Particularly the response time (or evaluation cost) for answering several related dimensional queries simultaneously is crucial to the OLAP applications. Recently, Zhao et al. first exploited this problem by presenting three heuristic algorithms. In this paper we first consider in detail two cases of the problem in which all the queries are either hash-based star joins or index-based star joins only. In the case of the hash-based star join, we devise a polynomial approximation algorithm which delivers a plan whose evaluation cost is $ O(n^{\epsilon }$) times the optimal, where n is the number of queries and is a fixed constant with . We also present an exponential algorithm which delivers a plan with the optimal evaluation cost. In the case of the index-based star join, we present a heuristic algorithm which delivers a plan whose evaluation cost is n times the optimal, and an exponential algorithm which delivers a plan with the optimal evaluation cost. We then consider a general case in which both hash-based star-join and index-based star-join queries are included. For this case, we give a possible improvement on the work of Zhao et al., based on an analysis of their solutions. We also develop another heuristic and an exact algorithm for the problem. We finally conduct a performance study by implementing our algorithms. The experimental results demonstrate that the solutions delivered for the restricted cases are always within two times of the optimal, which confirms our theoretical upper bounds. Actually these experiments produce much better results than our theoretical estimates. To the best of our knowledge, this is the only development of polynomial algorithms for the first two cases which are able to deliver plans with deterministic performance guarantees in terms of the qualities of the plans generated. The previous approaches including that of [ZDNS98] may generate a feasible plan for the problem in these two cases, but they do not provide any performance guarantee, i.e., the plans generated by their algorithms can be arbitrarily far from the optimal one. Received: July 21, 1998 / Accepted: August 26, 1999     

Just how insoluble are monoterpenes?

Prior generalizations about the ecological roles of monoterpenes may be misleading if based on the presumed insolubility of monoterpenes in water. We determined the aqueous solubility of 31 biologically active monoterpenes by gas chromatography. While hydrocarbons were of low solubility (< 35 ppm), oxygenated monoterpenes exhibited solubilities one or two orders of magnitude higher, with ranges of 155–6990 ppm for ketones and of 183–1360 ppm for alcohols. Many monoterpenes are phytotoxic in concentrations under 100 ppm, well below the saturated aqueous concentrations of oxygenated monoterpenes. Therefore, even dilute, unsaturated solutions of monoterpenes, occurring naturally in plant tissues and soil solutions, may act as potent biological inhibitors.     

First evidence of grass carp recruitment in the Great Lakes Basin

We use aging techniques, ploidy analysis, and otolith microchemistry to assess whether four grass carp Ctenopharyngodon idella captured from the Sandusky River, Ohio were the result of natural reproduction within the Lake Erie Basin. All four fish were of age 1 +. Multiple lines of evidence indicate that these fish were not aquaculture-reared and that they were most likely the result of successful reproduction in the Sandusky River. First, at least two of the fish were diploid; diploid grass carp cannot legally be released in the Great Lakes Basin. Second, strontium:calcium (Sr:Ca) ratios were elevated in all four grass carp from the Sandusky River, with elevated Sr:Ca ratios throughout the otolith transect, compared to grass carp from Missouri and Arkansas ponds. This reflects the high Sr:Ca ratio of the Sandusky River, and indicates that these fish lived in a high-strontium environment throughout their entire lives. Third, Sandusky River fish were higher in Sr:Ca ratio variability than fish from ponds, reflecting the high but spatially and temporally variable strontium concentrations of southwestern Lake Erie tributaries, and not the stable environment of pond aquaculture. Fourth, Sr:Ca ratios in the grass carp from the Sandusky River were lower in their 2011 growth increment (a high water year) than the 2012 growth increment (a low water year), reflecting the observed inverse relationship between discharge and strontium concentration in these rivers. We conclude that these four grass carp captured from the Sandusky River are most likely the result of natural reproduction within the Lake Erie Basin.     

HiCOO: Hierarchical cooperation for scalable communication in Global Address Space programming models on Cray XT systems

Global Address Space (GAS) programming models enable a convenient, shared-memory style addressing model. Typically this is realized through one-sided operations that can enable asynchronous communication and data movement. With the size of petascale systems reaching 10,000s of nodes and 100,000s of cores, the underlying runtime systems face critical challenges in (1) scalably managing resources (such as memory for communication buffers), and (2) gracefully handling unpredictable communication patterns and any associated contention. For any solution that addresses these resource scalability challenges, equally important is the need to maintain the performance of GAS programming models. In this paper, we describe a Hierarchical COOperation (HiCOO) architecture for scalable communication in GAS programming models. HiCOO formulates a cooperative communication architecture: with inter-node cooperation amongst multiple nodes (a.k.a multinode) and hierarchical cooperation among multinodes that are arranged in various virtual topologies. We have implemented HiCOO for a popular GAS runtime library, Aggregate Remote Memory Copy Interface (ARMCI). By extensively evaluating different virtual topologies in HiCOO in terms of their impact to memory scalability, network contention, and application performance, we identify MFCG as the most suitable virtual topology. The resulting HiCOO architecture is able to realize scalable resource management and achieve resilience to network contention, while at the same time maintaining or enhancing the performance of scientific applications. In one case, it reduces the total execution time of an NWChem application by 52%.     

A system for debugging via online tracing and dynamic slicing

Dynamic slicing is a promising trace based technique that helps programmers in the process of debugging. In order to debug a failed run, dynamic slicing requires the dynamic dependence graph (DDG) information for that particular run. The two major challenges involved in utilizing dynamic slicing as a debugging technique are the efficient computation of the DDG and the efficient computation of the dynamic slice, given the DDG. In this paper, we present an efficient debugger, which first computes the DDG efficiently while the program is executing; dynamic slicing is later performed efficiently on the computed DDG, on demand. To minimize program slowdown during the online computation of DDG, we make the design decision of not outputting the computed dependencies to a file, instead, storing them in memory in a specially allocated fixed size circular buffer. The size of the buffer limits the length of the execution history that can be stored. To maximize the execution history that can be maintained, we introduce optimizations to eliminate the storage of most of the generated dependencies, at the same time ensuring that those that are stored are sufficient to capture the bug. Experiments conducted on CPU‐intensive programs show that our optimizations are able to reduce the trace rate from 16 to 0.8 bytes per executed instruction. This enables us to store the dependence trace history for a window of 20 million executed instructions in a 16‐MB buffer. Our debugger is also very efficient, yielding slicing times of around a second, and only slowing down the execution of the program by a factor of 19 during the online tracing step. Using recently proposed architectural support for monitoring, we are also able to handle multithreaded programs running on multicore processors. Copyright © 2011 John Wiley & Sons, Ltd.