TRACE qualification via analysis of the EIR gas-loop experiments with smooth rods

Several gas-loop experimental programs were carried out during the 1970–1980s at the Eidgenössisches Institut für Reaktorforschung (EIR, now PSI), Switzerland. In the present work, a wide range of thermal–hydraulics tests for smooth rods, which form part of the experiments conducted at the time, have been reanalyzed with the aim of qualifying the TRACE code. The latter constitutes the thermal–hydraulics module of PSI’s FAST code system, currently being applied to the multi-physics analysis of advanced fast reactor systems, including the Generation IV Gas-Cooled Fast Reactor (GFR). It is shown, from the present analysis, that the built-in TRACE heat transfer and friction correlations are indeed quite suitable for gas cooling under prototypic GFR conditions.     

Robust Algorithms for Object Localization

Model-based localization, the task of estimating an object's pose from sensed and corresponding model features, is a fundamental task in machine vision. Exact constant time localization algorithms have been developed for the case where the sensed features and the model features are the same type. Still, it is not uncommon for the sensed features and the model features to be of different types, i.e., sensed data points may correspond to model faces or edges. Previous localization approaches have handled different model and sensed features of different types via sampling and synthesizing virtual features to reduce the problem of matching features of dissimilar types to the problem of matching features of similar types. Unfortunately, these approaches may be suboptimal because they introduce artificial errors. Other localization approaches have reformulated object localization as a nonlinear least squares problem where the error is between the sensed data and model features in image coordinates (the Euclidean image error metric). Unfortunately, all of the previous approaches which minimized the Euclidean image error metric relied on gradient descent methods to find the global minima, and gradient descent methods may suffer from problems of local minima. In this paper, we describe an exact, efficient solution to the nonlinear least squares minimization problem based upon resultants, linear algebra, and numerical techniques. On a SPARC 20, our localization algorithm runs in a few microseconds for rectilinear polygonal models, a few milliseconds for generic polygonal models, and one second for generalized polygonal models (models composed of linear edges and circular arcs).     

Cerebral: visualizing multiple experimental conditions on a graph with biological context

Systems biologists use interaction graphs to model the behavior of biological systems at the molecular level. In an iterative process, such biologists obser ve the reactions of living cells under various experimental conditions, view the results in the context of the interaction graph, and then propose changes to the graph model. These graphs ser ve as a form of dynamic knowledge representation of the biological system being studied and evolve as new insight is gained from the experimental data. While numerous graph layout and drawing packages are available, these tools did not fully meet the needs of our immunologist collaborators. In this paper, we describe the data information display needs of these immunologists and translate them into design decisions. These decisions led us to create Cerebral, a system that uses a biologically guided graph layout and incor porates experimental data directly into the graph display. Small multiple views of different experimental conditions and a data-driven parallel coordinates view enable correlations between experimental conditions to be analyzed at the same time that the data is viewed in the graph context. This combination of coordinated views allows the biologist to view the data from many different perspectives simultaneously. To illustrate the typical analysis tasks performed, we analyze two datasets using Cerebral. Based on feedback from our collaboratorsweconcludethat Cerebral is a valuable tool for analyzing experimental data in the context of an interaction graph model.      

Optofluidic waveguides: II. Fabrication and structures

We review fabrication methods and common structures for optofluidic waveguides, defined as structures capable of optical confinement and transmission through fluid filled cores. Cited structures include those based on total internal reflection, metallic coatings, and interference based confinement. Configurations include optical fibers and waveguides fabricated on flat substrates (integrated waveguides). Some examples of optofluidic waveguides that are included in this review are Photonic Crystal Fibers (PCFs) and two-dimensional photonic crystal arrays, Bragg fibers and waveguides, and Anti Resonant Reflecting Optical Waveguides (ARROWs). An emphasis is placed on integrated ARROWs fabricated using a thin-film deposition process, which illustrates how optofluidic waveguides can be combined with other microfluidic elements in the creation of lab-on-a-chip devices.     

Chaotic frequency scaling in a coupled oscillator model for free rhythmic actions

The question of how best to model rhythmic movements at self-selected amplitude-frequency combinations, and their variability, is a long-standing issue. This study presents a systematic analysis of a coupled oscillator system that has successfully accounted for the experimental result that humans' preferred oscillation frequencies closely correspond to the linear resonance frequencies of the biomechanical limb systems, a phenomenon known as resonance tuning or frequency scaling. The dynamics of the coupled oscillator model is explored by numerical integration in different areas of its parameter space, where a period doubling route to chaotic dynamics is discovered. It is shown that even in the regions of the parameter space with chaotic solutions, the model still effectively scales to the biomechanical oscillator's natural frequency. Hence, there is a solution providing for frequency scaling in the presence of chaotic variability. The implications of these results for interpreting variability as fundamentally stochastic or chaotic are discussed.     

Shorthand Universal Cycles for Permutations

The set of permutations of ??n??={1,??,n} in one-line notation is ??(n). The shorthand encoding of a ₁?a _n ????(n) is a ₁?a _n?1. A shorthand universal cycle for permutations (SP-cycle) is a circular string of length n! whose substrings of length n?1 are the shorthand encodings of ??(n). When an SP-cycle is decoded, the order of ??(n) is a Gray code in which successive permutations differ by the prefix-rotation ?? _i =(1 2 ? i) for i??{n?1,n}. Thus, SP-cycles can be represented by n! bits. We investigate SP-cycles with maximum and minimum ??weight?? (number of ?? _n?1s in the Gray code). An SP-cycle n a n b?n z is ??periodic?? if its ??sub-permutations?? a,b,??,z equal ??(n?1). We prove that periodic min-weight SP-cycles correspond to spanning trees of the (n?1)-permutohedron. We provide two constructions: B(n) and C(n). In B(n) the spanning trees use ??half-hunts?? from bell-ringing, and in C(n) the sub-permutations use cool-lex order by Williams (SODA, 987?C996, 2009). Algorithmic results are: (1)?memoryless decoding of B(n) and C(n), (2)?O((n?1)!)-time generation of B(n) and C(n) using sub-permutations, (3)?loopless generation of B(n)??s binary representation n bits at a time, and (4)?O(n+??(n))-time ranking of B(n)??s permutations where ??(n) is the cost of computing a permutation??s inversion vector. Results (1)?C(4) improve on those for the previous SP-cycle construction D(n) by Ruskey and Williams (ACM Trans. Algorithms 6(3):Art.?45, 2010), which we characterize here using ??recycling??.     

Automated zebrafish chorion removal and single embryo placement: optimizing throughput of zebrafish developmental toxicity screens

The potential of the developing zebrafish model for toxicology and drug discovery is limited by inefficient approaches to manipulating and chemically exposing zebrafish embryos-namely, manual placement of embryos into 96- or 384-well plates and exposure of embryos while still in the chorion, a barrier of poorly characterized permeability enclosing the developing embryo. We report the automated dechorionation of 1600 embryos at once at 4 h postfertilization (hpf) and placement of the dechorionated embryos into 96-well plates for exposure by 6 hpf. The process removed ≥95% of the embryos from their chorions with 2% embryo mortality by 24 hpf, and 2% of the embryos malformed at 120 hpf. The robotic embryo placement allocated 6-hpf embryos to 94.7% ± 4.2% of the wells in multiple 96-well trials. The rate of embryo mortality was 2.8% (43 of 1536) from robotic handling, the rate of missed wells was 1.2% (18 of 1536), and the frequency of multipicks was <0.1%. Embryo malformations observed at 24 hpf occurred nearly twice as frequently from robotic handling (16 of 864; 1.9%) as from manual pipetting (9 of 864; 1%). There was no statistical difference between the success of performing the embryo placement robotically or manually.     

Using Semantic Context to Rank the Results of Keyword Search

In an empirical user study, we assessed two approaches to ranking the results from a keyword search using semantic contextual match based on Latent Semantic Analysis. These techniques involved searches initiated from words found in a seed document within a corpus. The first approach used the sentence around the search query in the document as context while the second used the entire document. With a corpus of 20,000 documents and a small proportion of relevant documents (<0.1%), both techniques outperformed a conventional keyword search on a recall-based information retrieval (IR) task. These context-based techniques were associated with a reduction in the number of searches conducted, an increase in users’ precision and, to a lesser extent, an increase in recall. This improvement was strongest when the ranking was based on document, rather than sentence, context. Individuals were more effective on the IR task when the lists returned by the techniques were ranked better. User performance on the task also correlated with achievement on a generalized IQ test but not on a linguistic ability test.     

The Feline Josephus Problem

In the classic Josephus problem, elements 1,2,…,n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consists of traveling around the circle from the current position, and selecting the kth remaining element to be eliminated from the circle. After n rounds, every element is eliminated. Special attention is given to the last surviving element, denote it by j. We generalize this popular problem by introducing a uniform number of lives ℓ, so that elements are not eliminated until they have been selected for the ℓth time. We prove two main results: 1) When n and k are fixed, then j is constant for all values of ℓ larger than the nth Fibonacci number. In other words, the last surviving element stabilizes with respect to increasing the number of lives. 2) When n and j are fixed, then there exists a value of k that allows j to be the last survivor simultaneously for all values of ℓ. In other words, certain skip values ensure that a given position is the last survivor, regardless of the number of lives. For the first result we give an algorithm for determining j (and the entire sequence of selections) that uses O(n ²) arithmetic operations.