VLSI Implementation Of The Fast Fourier Transform
NASA Astrophysics Data System (ADS)
Chau, Paul M.; Ku, Walter H.
1986-03-01
A VLSI implementation of a Fast Fourier Transform (FFT) processor consisting of a mesh interconnection of complex floating-point butterfly units is presented. The Cooley-Tukey radix-2 Decimation-In-Frequency (DIF) formulation of the FFT was chosen since it offered the best overall compromise between the need for fast and efficient algorithmic computation and the need for a structure amenable to VLSI layout. Thus the VLSI implementation is modular, regular, expandable to various problem sizes and has a simple systolic flow of data and control. To evaluate the FFT architecture, VLSI area-time complexity concepts are used, but are now adapted to a complex floating-point number system rather than the usual integer ring representation. We show by our construction that the Thompson area-time optimum bound for the VLSI computation of an N-point FFT, area-time2oc = ORNlogN)1+a] can be attained by an alternative number representation, and hence the theoretical bound is a tight bound regardless of number system representation.
Fast Hardware Implementation Of The DOLP Transform
NASA Astrophysics Data System (ADS)
Waltz, Frederick M.
1988-03-01
The Difference-of-Low-Pass (DOLP) Transform uses a hierarchy of bandpass filters to perform size discrimination and pattern matching of objects and features in a visual field. Like the Discrete Fourier Transform (DFT), it "sorts" entities according to their size or spatial frequencies; but unlike the DFT, it also retains positional information.This positional information is essential for the very common industrial web inspection problem in which a "flaw map" must be produced - mere flaw detection (as provided by the DFT) is not enough. The DOLP Transform is usually implemented using finite-impulse-response difference-of-Gaussian (DOG) filters of progressively increasing kernel size. Various potential industrial applications have been described and demonstrated, but implementations have been hampered by the heavy computational burden involved in the generation of the Transform. This paper describes a fast implementation of Crowley's resampled DOLP Transform using commercially-available board-level hardware. With a moderate investment in hardware modules, a nine-band DOLP Transform can be computed for a 485 by 512 image in about one second. Additional hardware modules could be added to bring the speed up to 30 complete 9-band Transforms per second, if desired. Additional bands beyond the first nine, while seldom needed, require very little additional time, because the image has been repeatedly resampled down to a small size.
Fast compression implementation for hyperspectral sensor
NASA Astrophysics Data System (ADS)
Hihara, Hiroki; Yoshida, Jun; Ishida, Juro; Takada, Jun; Senda, Yuzo; Suzuki, Makoto; Seki, Taeko; Ichikawa, Satoshi; Ohgi, Nagamitsu
2010-11-01
Fast and small foot print lossless image compressors aiming at hyper-spectral sensor for the earth observation satellite have been developed. Since more than one hundred channels are required for hyper-spectral sensors on optical observation satellites, fast compression algorithm with small foot print implementation is essential for reducing encoder size and weight resulting in realizing light-weight and small-size sensor system. The image compression method should have low complexity in order to reduce size and weight of the sensor signal processing unit, power consumption and fabrication cost. Coding efficiency and compression speed enables enlargement of the capacity of signal compression channels, which resulted in reducing signal compression channels onboard by multiplexing sensor signal channels into reduced number of compression channels. The employed method is based on FELICS1, which is hierarchical predictive coding method with resolution scaling. To improve FELICS's performance of image decorrelation and entropy coding, we applied two-dimensional interpolation prediction and adaptive Golomb-Rice coding, which enables small footprint. It supports progressive decompression using resolution scaling, whilst still delivering superior performance as measured by speed and complexity. The small footprint circuitry is embedded into the hyper-spectral sensor data formatter. In consequence, lossless compression function has been added without additional size and weight.
A Fast Implementation of the ISOCLUS Algorithm
NASA Technical Reports Server (NTRS)
Memarsadeghi, Nargess; Mount, David M.; Netanyahu, Nathan S.; LeMoigne, Jacqueline
2003-01-01
Unsupervised clustering is a fundamental tool in numerous image processing and remote sensing applications. For example, unsupervised clustering is often used to obtain vegetation maps of an area of interest. This approach is useful when reliable training data are either scarce or expensive, and when relatively little a priori information about the data is available. Unsupervised clustering methods play a significant role in the pursuit of unsupervised classification. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points (or samples) in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute a set of cluster centers in d-space. Although there is no specific optimization criterion, the algorithm is similar in spirit to the well known k-means clustering method in which the objective is to minimize the average squared distance of each point to its nearest center, called the average distortion. One significant feature of ISOCLUS over k-means is that clusters may be merged or split, and so the final number of clusters may be different from the number k supplied as part of the input. This algorithm will be described in later in this paper. The ISOCLUS algorithm can run very slowly, particularly on large data sets. Given its wide use in remote sensing, its efficient computation is an important goal. We have developed a fast implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm, the filtering algorithm, by Kanungo et al.. They showed that, by storing the data in a kd-tree, it was possible to significantly reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm. For technical reasons, which are explained later, it is necessary to make a minor
Fixed Point Implementations of Fast Kalman Algorithms.
1983-11-01
fined point multiply. ve &geete a meatn ’C.- nero. variance N random vector s~t) each time weAfilter is said to be 12 Scaled if udae 8(t+11t0 - 3-1* AS...nl.v by bl ’k rn.b.) 20 AST iA C T ’Cnnin to .- a , o. a ide It .,oco ea ry and Idenuty by block number) In this paper we study scaling rules and round...realized in a -fast form that uses the so-called fast Kalman gain algorithm. The algorithm for the gain is fixed point. Scaling rules and expressions for
A Fast Implementation of the ISOCLUS Algorithm
NASA Technical Reports Server (NTRS)
Memarsadeghi, Nargess; Mount, David M.; Netanyahu, Nathan S.; LeMoigne, Jacqueline
2003-01-01
Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O
NASA Astrophysics Data System (ADS)
Hauth, T.; Innocente and, V.; Piparo, D.
2012-12-01
The processing of data acquired by the CMS detector at LHC is carried out with an object-oriented C++ software framework: CMSSW. With the increasing luminosity delivered by the LHC, the treatment of recorded data requires extraordinary large computing resources, also in terms of CPU usage. A possible solution to cope with this task is the exploitation of the features offered by the latest microprocessor architectures. Modern CPUs present several vector units, the capacity of which is growing steadily with the introduction of new processor generations. Moreover, an increasing number of cores per die is offered by the main vendors, even on consumer hardware. Most recent C++ compilers provide facilities to take advantage of such innovations, either by explicit statements in the programs sources or automatically adapting the generated machine instructions to the available hardware, without the need of modifying the existing code base. Programming techniques to implement reconstruction algorithms and optimised data structures are presented, that aim to scalable vectorization and parallelization of the calculations. One of their features is the usage of new language features of the C++11 standard. Portions of the CMSSW framework are illustrated which have been found to be especially profitable for the application of vectorization and multi-threading techniques. Specific utility components have been developed to help vectorization and parallelization. They can easily become part of a larger common library. To conclude, careful measurements are described, which show the execution speedups achieved via vectorised and multi-threaded code in the context of CMSSW.
Hybrid multicore/vectorisation technique applied to the elastic wave equation on a staggered grid
NASA Astrophysics Data System (ADS)
Titarenko, Sofya; Hildyard, Mark
2017-07-01
In modern physics it has become common to find the solution of a problem by solving numerically a set of PDEs. Whether solving them on a finite difference grid or by a finite element approach, the main calculations are often applied to a stencil structure. In the last decade it has become usual to work with so called big data problems where calculations are very heavy and accelerators and modern architectures are widely used. Although CPU and GPU clusters are often used to solve such problems, parallelisation of any calculation ideally starts from a single processor optimisation. Unfortunately, it is impossible to vectorise a stencil structured loop with high level instructions. In this paper we suggest a new approach to rearranging the data structure which makes it possible to apply high level vectorisation instructions to a stencil loop and which results in significant acceleration. The suggested method allows further acceleration if shared memory APIs are used. We show the effectiveness of the method by applying it to an elastic wave propagation problem on a finite difference grid. We have chosen Intel architecture for the test problem and OpenMP (Open Multi-Processing) since they are extensively used in many applications.
Fast implementation of neural network classification
NASA Astrophysics Data System (ADS)
Seo, Guiwon; Ok, Jiheon; Lee, Chulhee
2013-09-01
Most artificial neural networks use a nonlinear activation function that includes sigmoid and hyperbolic tangent functions. Most artificial networks employ nonlinear functions such as these sigmoid and hyperbolic tangent functions, which incur high complexity costs, particularly during hardware implementation. In this paper, we propose new polynomial approximation methods for nonlinear activation functions that can substantially reduce complexity without sacrificing performance. The proposed approximation methods were applied to pattern classification problems. Experimental results show that the processing time was reduced by up to 50% without any performance degradations in terms of computer simulation.
OPC solution by implementing fast converging methodology
NASA Astrophysics Data System (ADS)
Yang, Qing; Du, Yaojun
2015-03-01
Traditionally, the optical proximity correction (OPC) is to deliver the solution to ensure the nominal after-development-inspection (ADI) contours on target. As the technology node keeps shrinking to 28nm and beyond, the OPC is expected to cover the lithography process window (PW), etch PW, and overlay margin as well. As a result, more and more advanced functions are included in OPC to achieve the awareness of multiple cost functions, such as the nominal EPE, PW effective EPE, the enclosure of above and underneath layers, and so on. These inclusions are at the cost of the run time and complexity of OPC solution. In this paper, we demonstrated a methodology by adopting design rule check (DRC) algorithm in repair flow to fix hot spots. In accordance to OPC verification check, the subsequent DRC movements were applied to those hot spots only. With a straightforward recipe tuning, a fast convergence of OPC can be achieved. The results exhibit the run time improvement without compromising the OPC performance. We further evaluated by real cases the effects of the DRC-based repair algorithm on the error convergence and final repair effects, by comparing to the standard OPC solution.
Error-Detection Codes: Algorithms and Fast Implementation
2005-01-01
information on this or any other computing topic, please visit our Digital Library at www.computer.org/publications/ dlib . NGUYEN: ERROR-DETECTION CODES: ALGORITHMS AND FAST IMPLEMENTATION 11 ...in Appendix C (which can be found on the Computer Society Digital Library at http:// computer.org/tc/archives.htm). In this paper, we focus on code...the Computer Society Digital Library at http://computer.org/ tc/archives.htm) that include theoremproofs, code segments implemented in C programming
A highly vectorised "link-cell" FORTRAN code for the DL_POLY molecular dynamics simulation package
NASA Astrophysics Data System (ADS)
Kholmurodov, Kholmirzo; Smith, William; Yasuoka, Kenji; Ebisuzaki, Toshikazu
2000-03-01
Highly vectorised FORTRAN subroutines, based on the link-cell algorithm for DL_POLY molecular dynamics simulation package, are developed. For several specific benchmark systems the efficiency of the proposed codes on a Fujitsu VPP700/128E vector computer has been tested. It is shown that in constructing the neighbor list and in calculating atomic forces our link-cell method is significantly faster than the original code.
Implementation and parallelization of fast matrix multiplication for a fast Legendre transform
Chen, Wentao
1993-09-01
An algorithm was presented by Alpert and Rokhlin for the rapid evaluation of Legendre transforms. The fast algorithm can be expressed as a matrix-vector product followed by a fast cosine transform. Using the Chebyshev expansion to approximate the entries of the matrix and exchanging the order of summations reduces the time complexity of computation from O(n{sup 2}) to O(n log n), where n is the size of the input vector. Our work has been focused on the implementation and the parallelization of the fast algorithm of matrix-vector product. Results have shown the expected performance of the algorithm. Precision problems which arise as n becomes large can be resolved by doubling the precision of the calculation.
Error correction and fast detectors implemented by ultrafast neuronal plasticity.
Vardi, Roni; Marmari, Hagar; Kanter, Ido
2014-04-01
We experimentally show that the neuron functions as a precise time integrator, where the accumulated changes in neuronal response latencies, under complex and random stimulation patterns, are solely a function of a global quantity, the average time lag between stimulations. In contrast, momentary leaps in the neuronal response latency follow trends of consecutive stimulations, indicating ultrafast neuronal plasticity. On a circuit level, this ultrafast neuronal plasticity phenomenon implements error-correction mechanisms and fast detectors for misplaced stimulations. Additionally, at moderate (high) stimulation rates this phenomenon destabilizes (stabilizes) a periodic neuronal activity disrupted by misplaced stimulations.
Freddi: Fast Rise Exponential Decay accretion Disk model Implementation
NASA Astrophysics Data System (ADS)
Malanchev, K. L.; Lipunova, G. V.
2016-10-01
Freddi (Fast Rise Exponential Decay: accretion Disk model Implementation) solves 1-D evolution equations of the Shakura-Sunyaev accretion disk. It simulates fast rise exponential decay (FRED) light curves of low mass X-ray binaries (LMXBs). The basic equation of the viscous evolution relates the surface density and viscous stresses and is of diffusion type; evolution of the accretion rate can be found on solving the equation. The distribution of viscous stresses defines the emission from the source. The standard model for the accretion disk is implied; the inner boundary of the disk is at the ISCO or can be explicitely set. The boundary conditions in the disk are the zero stress at the inner boundary and the zero accretion rate at the outer boundary. The conditions are suitable during the outbursts in X-ray binary transients with black holes. In a binary system, the accretion disk is radially confined. In Freddi, the outer radius of the disk can be set explicitely or calculated as the position of the tidal truncation radius.
Weighted divergence correction scheme and its fast implementation
NASA Astrophysics Data System (ADS)
Wang, ChengYue; Gao, Qi; Wei, RunJie; Li, Tian; Wang, JinJun
2017-05-01
Forcing the experimental volumetric velocity fields to satisfy mass conversation principles has been proved beneficial for improving the quality of measured data. A number of correction methods including the divergence correction scheme (DCS) have been proposed to remove divergence errors from measurement velocity fields. For tomographic particle image velocimetry (TPIV) data, the measurement uncertainty for the velocity component along the light thickness direction is typically much larger than for the other two components. Such biased measurement errors would weaken the performance of traditional correction methods. The paper proposes a variant for the existing DCS by adding weighting coefficients to the three velocity components, named as the weighting DCS (WDCS). The generalized cross validation (GCV) method is employed to choose the suitable weighting coefficients. A fast algorithm for DCS or WDCS is developed, making the correction process significantly low-cost to implement. WDCS has strong advantages when correcting velocity components with biased noise levels. Numerical tests validate the accuracy and efficiency of the fast algorithm, the effectiveness of GCV method, and the advantages of WDCS. Lastly, DCS and WDCS are employed to process experimental velocity fields from the TPIV measurement of a turbulent boundary layer. This shows that WDCS achieves a better performance than DCS in improving some flow statistics.
Maintenance implementation plan for the Fast Flux Test Facility
Boyd, J.A.
1997-01-30
This plan implements the U.S. Department of Energy (DOE) 4330.4B, Maintenance Management Program (1994), at the Fast Flux Test Facility (FFTF). The FFTF is a research and test reactor located near Richland, Washington, and is operated under contract for the DOE by the B&W Hanford Company (BWHC). The intent of this Maintenance Implementation Plan (MIP) is to describe the manner in which the activities of the maintenance function are executed and controlled at the FFTF and how this compares to the requirements of DOE 4330.4B. The MIP ii a living document that is updated through a Facility Maintenance Self- Assessment Program. During the continuing self-assessment program, any discrepancies found are resolved to meet DOE 4330.4B requirements and existing practices. The philosophy of maintenance management at the FFTF is also describe within this MIP. This MIP has been developed based on information obtained from various sources including the following: * A continuing self-assessment against the requirements of the Conduct of Maintenance Order * In-depth reviews conducted by the members of the task team that assembled this MIP * Inputs from routine audits and appraisals conducted at the facility The information from these sources is used to identify those areas in which improvements could be made in the manner in which the facility conducts maintenance activities. The action items identified in Rev. 1 of the MIP have been completed. The MIP is arranged in six sections. Section I is this Executive Summary. Section 2 describes the facility and its 0683 history. Section 3 describes the philosophy of the graded approach and how it is applied at FFTF. Section 3 also discusses the strategy and the basis for the prioritizing resources. Section 4 contains the detailed discussion of `the elements of DOE 4330.4B and their state of implementation. Section 5 is for waivers and requested deviations from the requirements of the order. Section 6 contains a copy of the Maintenance
NASA Astrophysics Data System (ADS)
Scheins, J. J.; Vahedipour, K.; Pietrzyk, U.; Shah, N. J.
2015-12-01
For high-resolution, iterative 3D PET image reconstruction the efficient implementation of forward-backward projectors is essential to minimise the calculation time. Mathematically, the projectors are summarised as a system response matrix (SRM) whose elements define the contribution of image voxels to lines-of-response (LORs). In fact, the SRM easily comprises billions of non-zero matrix elements to evaluate the tremendous number of LORs as provided by state-of-the-art PET scanners. Hence, the performance of iterative algorithms, e.g. maximum-likelihood-expectation-maximisation (MLEM), suffers from severe computational problems due to the intensive memory access and huge number of floating point operations. Here, symmetries occupy a key role in terms of efficient implementation. They reduce the amount of independent SRM elements, thus allowing for a significant matrix compression according to the number of exploitable symmetries. With our previous work, the PET REconstruction Software TOolkit (PRESTO), very high compression factors (>300) are demonstrated by using specific non-Cartesian voxel patterns involving discrete polar symmetries. In this way, a pre-calculated memory-resident SRM using complex volume-of-intersection calculations can be achieved. However, our original ray-driven implementation suffers from addressing voxels, projection data and SRM elements in disfavoured memory access patterns. As a consequence, a rather limited numerical throughput is observed due to the massive waste of memory bandwidth and inefficient usage of cache respectively. In this work, an advantageous symmetry-driven evaluation of the forward-backward projectors is proposed to overcome these inefficiencies. The polar symmetries applied in PRESTO suggest a novel organisation of image data and LOR projection data in memory to enable an efficient single instruction multiple data vectorisation, i.e. simultaneous use of any SRM element for symmetric LORs. In addition, the calculation
Implementation of pipelined FastICA on FPGA for real-time blind source separation.
Shyu, Kuo-Kai; Lee, Ming-Huan; Wu, Yu-Te; Lee, Po-Lei
2008-06-01
Fast independent component analysis (FastICA) algorithm separates the independent sources from their mixtures by measuring non-Gaussian. FastICA is a common offline method to identify artifact and interference from their mixtures such as electroencephalogram (EEG), magnetoencephalography (MEG), and electrocardiogram (ECG). Therefore, it is valuable to implement FastICA for real-time signal processing. In this paper, the FastICA algorithm is implemented in a field-programmable gate array (FPGA), with the ability of real-time sequential mixed signals processing by the proposed pipelined FastICA architecture. Moreover, in order to increase the numbers precision, the hardware floating-point (FP) arithmetic units had been carried out in the hardware FastICA. In addition, the proposed pipeline FastICA provides the high sampling rate (192 kHz) capability by hand coding the hardware FastICA in hardware description language (HDL). To verify the features of the proposed hardware FastICA, simulations are first performed, then real-time signal processing experimental results are presented using the fabricated platform. Experimental results demonstrate the effectiveness of the presented hardware FastICA as expected.
Outline of a fast hardware implementation of Winograd's DFT algorithm
NASA Technical Reports Server (NTRS)
Zohar, S.
1980-01-01
The main characteristics of the discrete Fourier transform (DFT) algorithm considered by Winograd (1976) is a significant reduction in the number of multiplications. Its primary disadvantage is a higher structural complexity. It is, therefore, difficult to translate the reduced number of multiplications into faster execution of the DFT by means of a software implementation of the algorithm. For this reason, a hardware implementation is considered in the current study, taking into account a design based on the algorithm prescription discussed by Zohar (1979). The hardware implementation of a FORTRAN subroutine is proposed, giving attention to a pipelining scheme in which 5 consecutive data batches are being operated on simultaneously, each batch undergoing one of 5 processing phases.
Study of hardware implementations of fast tracking algorithms
NASA Astrophysics Data System (ADS)
Song, Z.; De Lentdecker, G.; Dong, J.; Huang, G.; Léonard, A.; Robert, F.; Wang, D.; Yang, Y.
2017-02-01
Real-time track reconstruction at high event rates is a major challenge for future experiments in high energy physics. To perform pattern-recognition and track fitting, artificial retina or Hough transformation methods have been introduced in the field which have to be implemented in FPGA firmware. In this note we report on a case study of a possible FPGA hardware implementation approach of the retina algorithm based on a Floating-Point core. Detailed measurements with this algorithm are investigated. Retina performance and capabilities of the FPGA are discussed along with perspectives for further optimization and applications.
[Fast Implementation Method of Protein Spots Detection Based on CUDA].
Xiong, Bangshu; Ye, Yijia; Ou, Qiaofeng; Zhang, Haodong
2016-02-01
In order to improve the efficiency of protein spots detection, a fast detection method based on CUDA was proposed. Firstly, the parallel algorithms of the three most time-consuming parts in the protein spots detection algorithm: image preprocessing, coarse protein point detection and overlapping point segmentation were studied. Then, according to single instruction multiple threads executive model of CUDA to adopted data space strategy of separating two-dimensional (2D) images into blocks, various optimizing measures such as shared memory and 2D texture memory are adopted in this study. The results show that the operative efficiency of this method is obviously improved compared to CPU calculation. As the image size increased, this method makes more improvement in efficiency, such as for the image with the size of 2,048 x 2,048, the method of CPU needs 52,641 ms, but the GPU needs only 4,384 ms.
NASA Astrophysics Data System (ADS)
Asztalos, Stephen J.; Hennig, Wolfgang; Warburton, William K.
2016-01-01
Pulse shape discrimination applied to certain fast scintillators is usually performed offline. In sufficiently high-event rate environments data transfer and storage become problematic, which suggests a different analysis approach. In response, we have implemented a general purpose pulse shape analysis algorithm in the XIA Pixie-500 and Pixie-500 Express digital spectrometers. In this implementation waveforms are processed in real time, reducing the pulse characteristics to a few pulse shape analysis parameters and eliminating time-consuming waveform transfer and storage. We discuss implementation of these features, their advantages, necessary trade-offs and performance. Measurements from bench top and experimental setups using fast scintillators and XIA processors are presented.
Fast, parallel implementation of particle filtering on the GPU architecture
NASA Astrophysics Data System (ADS)
Gelencsér-Horváth, Anna; Tornai, Gábor János; Horváth, András; Cserey, György
2013-12-01
In this paper, we introduce a modified cellular particle filter (CPF) which we mapped on a graphics processing unit (GPU) architecture. We developed this filter adaptation using a state-of-the art CPF technique. Mapping this filter realization on a highly parallel architecture entailed a shift in the logical representation of the particles. In this process, the original two-dimensional organization is reordered as a one-dimensional ring topology. We proposed a proof-of-concept measurement on two models with an NVIDIA Fermi architecture GPU. This design achieved a 411- μs kernel time per state and a 77-ms global running time for all states for 16,384 particles with a 256 neighbourhood size on a sequence of 24 states for a bearing-only tracking model. For a commonly used benchmark model at the same configuration, we achieved a 266- μs kernel time per state and a 124-ms global running time for all 100 states. Kernel time includes random number generation on the GPU with curand. These results attest to the effective and fast use of the particle filter in high-dimensional, real-time applications.
GPU implementation issues for fast unmixing of hyperspectral images
NASA Astrophysics Data System (ADS)
Legendre, Maxime; Capriotti, Luca; Schmidt, Frédéric; Moussaoui, Saïd; Schmidt, Albrecht
2013-04-01
Space missions usually use hyperspectral imaging techniques to analyse the composition of planetary surfaces. Missions such as ESA's Mars Express and Venus Express generate extensive datasets whose processing demands so far have exceeded the resources available to many researchers. To overcome this limitation, the challenge is to develop numerical methods allowing to exploit the potential of modern calculation tools. The processing of a hyperspectral image consists of the identification of the observed surface components and eventually the assessment of their fractional abundances inside each pixel area. In this latter case, the problem is referred to as spectral unmixing. This work focuses on a supervised unmixing approach where the relevant component spectra are supposed to be part of an available spectral library. Therefore, the question addressed here is reduced to the estimation of the fractional abundances, or abundance maps. It requires the solution of a large-scale optimization problem subject to linear constraints; positivity of the abundances and their partial/full additivity (sum less/equal to one). Conventional approaches to such a problem usually suffer from a high computational overhead. Recently, an interior-point optimization using a primal-dual approach has been proven an efficient method to solve this spectral unmixing problem at reduced computational cost. This is achieved with a parallel implementation based on Graphics Processing Units (GPUs). Several issues are discussed such as the data organization in memory and the strategy used to compute efficiently one global quantity from a large dataset in a parallel fashion. Every step of the algorithm is optimized to be GPU-efficient. Finally, the main steps of the global system for the processing of a large number of hyperspectral images are discussed. The advantage of using a GPU is demonstrated by unmixing a large dataset consisting of 1300 hyperspectral images from Mars Express' OMEGA instrument
Fast implementation of window-based methods for stereo correspondence
NASA Astrophysics Data System (ADS)
Uddin, Mohammad Shorif; Son, Tran Thai; Mita, Seiichi
2003-11-01
Stereo correspondence is a common tool in computer or robot vision, with numerous applications, such as determination of three-dimensional depth information of objects for virtual reality, autonomous vehicle and robot navigation, using a pair of left and right images from a stereo camera system. Computation time is an important factor in estimating dense disparity for the above applications. For of a pixel in the left image, its correspondence has to be searched in the right image based on epipolar line and maximum disparity search range. The intensity of a pixel alone in the left image does not have sufficient discriminatory power to determine its correspondence uniquely from the right image, thus other pixels in its neighborhood comprising a window is used for accurate estimation. In window-based approaches, this correspondence or disparity is conventionally determined based on matching windows of pixels by using sum of square differences, sum of absolute differences, or normalized correlation techniques. With a view to reduce the computation time, we propose a fast algorithm where it is not necessary to compute the window costs for all candidate pixels in the right image within the search range. To determine the correspondence of a pixel in the left image we just compute the window costs for candidate pixels in the right image whose intensities are different within a certain value to the intensity of the pixel in the left image. We applied our proposal to standard stereo images and found that we can easily reduce the computation time of about 30% with almost no degradation of accuracy.
A fast portable implementation of the Secure Hash Algorithm, III.
McCurley, Kevin S.
1992-10-01
In 1992, NIST announced a proposed standard for a collision-free hash function. The algorithm for producing the hash value is known as the Secure Hash Algorithm (SHA), and the standard using the algorithm in known as the Secure Hash Standard (SHS). Later, an announcement was made that a scientist at NSA had discovered a weakness in the original algorithm. A revision to this standard was then announced as FIPS 180-1, and includes a slight change to the algorithm that eliminates the weakness. This new algorithm is called SHA-1. In this report we describe a portable and efficient implementation of SHA-1 in the C language. Performance information is given, as well as tips for porting the code to other architectures. We conclude with some observations on the efficiency of the algorithm, and a discussion of how the efficiency of SHA might be improved.
Fast neuromimetic object recognition using FPGA outperforms GPU implementations.
Orchard, Garrick; Martin, Jacob G; Vogelstein, R Jacob; Etienne-Cummings, Ralph
2013-08-01
Recognition of objects in still images has traditionally been regarded as a difficult computational problem. Although modern automated methods for visual object recognition have achieved steadily increasing recognition accuracy, even the most advanced computational vision approaches are unable to obtain performance equal to that of humans. This has led to the creation of many biologically inspired models of visual object recognition, among them the hierarchical model and X (HMAX) model. HMAX is traditionally known to achieve high accuracy in visual object recognition tasks at the expense of significant computational complexity. Increasing complexity, in turn, increases computation time, reducing the number of images that can be processed per unit time. In this paper we describe how the computationally intensive and biologically inspired HMAX model for visual object recognition can be modified for implementation on a commercial field-programmable aate Array, specifically the Xilinx Virtex 6 ML605 evaluation board with XC6VLX240T FPGA. We show that with minor modifications to the traditional HMAX model we can perform recognition on images of size 128 × 128 pixels at a rate of 190 images per second with a less than 1% loss in recognition accuracy in both binary and multiclass visual object recognition tasks.
A Simple and Efficient Parallel Implementation of the Fast Marching Method
NASA Astrophysics Data System (ADS)
Yang, Jianming; Stern, Frederick
2011-11-01
The fast marching method is a widely used numerical method for solving the Eikonal equation arising from a variety of applications. However, this method is inherently serial and doesn't lend itself to a straightforward parallelization. In this study, we present a simple and efficient algorithm for the parallel implementation of the fast marching method using a domain decomposition approach. Properties of the Eikonal equation are explored to greatly relax the serial interdependence of neighboring sub-domains. Overlapping sub-domains are employed to reduce communication overhead and improve parallelism among sub-domains. There are no iterative procedures or rollback operations involved in the present algorithm and the changes to the serial version of the fast marching method are minimized. Examples are performed to demonstrate the efficiency of our parallel fast marching method. This study was supported by ONR.
Fast implementation of sparse iterative covariance-based estimation for source localization.
Zhang, Qilin; Abeida, Habti; Xue, Ming; Rowe, William; Li, Jian
2012-02-01
Fast implementations of the sparse iterative covariance-based estimation (SPICE) algorithm are presented for source localization with a uniform linear array (ULA). SPICE is a robust, user parameter-free, high-resolution, iterative, and globally convergent estimation algorithm for array processing. SPICE offers superior resolution and lower sidelobe levels for source localization compared to the conventional delay-and-sum beamforming method; however, a traditional SPICE implementation has a higher computational complexity (which is exacerbated in higher dimensional data). It is shown that the computational complexity of the SPICE algorithm can be mitigated by exploiting the Toeplitz structure of the array output covariance matrix using Gohberg-Semencul factorization. The SPICE algorithm is also extended to the acoustic vector-sensor ULA scenario with a specific nonuniform white noise assumption, and the fast implementation is developed based on the block Toeplitz properties of the array output covariance matrix. Finally, numerical simulations illustrate the computational gains of the proposed methods.
A low-power VLSI implementation for fast full-search variable block size motion estimation
NASA Astrophysics Data System (ADS)
Li, Peng; Tang, Hua
2013-09-01
Variable block size motion estimation (VBSME) is becoming the new coding technique in H.264/AVC. This article presents a low-power VLSI implementation for VBSME, which employs a fast full-search block-matching algorithm to reduce power consumption, while preserving the optimal motion vectors (MVs). The fast full-search algorithm is based on the comparison of the current minimum sum of absolute difference (SAD) to a conservative lower bound so that unnecessary SAD calculations can be eliminated. We first experimentally determine the specific conservative lower bound of SAD and then implement the fast full-search algorithm in FPGA and 0.18 µm CMOS technology. To the best of our knowledge, this is the first time that a fast full-search block-matching algorithm is explored to reduce power consumption in the context of VBSME and implemented in hardware. Experiment results show that the proposed design can save power consumption by 45% compared to conventional VBSME designs that give optimal MV based on the full-search algorithms.
Using single buffers and data reorganization to implement a multi-megasample fast Fourier transform
NASA Technical Reports Server (NTRS)
Brown, R. D.
1992-01-01
Data ordering in large fast Fourier transforms (FFT's) is both conceptually and implementationally difficult. Discribed here is a method of visualizing data orderings as vectors of address bits, which enables the engineer to use more efficient data orderings and reduce double-buffer memory designs. Also detailed are the difficulties and algorithmic solutions involved in FFT lengths up to 4 megasamples (Msamples) and sample rates up to 80 MHz.
The Sharper Image: Implementing a Fast Fourier Transform (FFT) to Enhance a Video-Captured Image.
1994-01-01
mathematical system to quantitatively analyze and compare complex wave forms. In 1307, Baron Jean - Baptiste - Joseph Fourier proved that any periodic wave can be...HOVEY ROAD, PENSACOLA, FL 32508-1046 NAMRL Special Report 94-1 THE SHARPER IMAGE: 16 IMPLEMENTING A FAST FOURIER TRANSFORM (FFT) TO ENHANCE A VIDEO...most visually impaired persons fail to discern the higher spatial frequencies present in an image. Based on the Fourier analysis of vision, Peli et al
The Vanderbilt University fast track to IAIMS: transition from planning to implementation.
Stead, W W; Borden, R; Bourne, J; Giuse, D; Giuse, N; Harris, T R; Miller, R A; Olsen, A J
1996-01-01
Vanderbilt University Medical Center is implementing an Integrated Advanced Information Management System (IAIMS) using a fast-track approach. The elapsed time between start-up and completion of implementation will be 7.5 years. The Start-Up and Planning phases of the project are complete. The Implementation phase asks one question: How does an organization create an environment that redirects and coordinates a variety of individual activities so that they come together to provide an IAIMS? Four answers to this question are being tested. First, design resources to be "scalable"--i.e., capable of supporting enterprise-wide use. Second, provide information technology planning activities as ongoing core functions that direct local efforts. Third, design core infrastructure resources to be both reusable and expandable at the local level. Fourth, use milestones to measure progress toward selected endpoints to permit early refinement of plans and strategies. PMID:8880678
Nathavitharana, R R; Daru, P; Barrera, A E; Mostofa Kamal, S M; Islam, S; Ul-Alam, M; Sultana, R; Rahman, M; Hossain, Md S; Lederer, P; Hurwitz, S; Chakraborty, K; Kak, N; Tierney, D B; Nardell, E
2017-09-01
National Institute of Diseases of the Chest and Hospital, Dhaka; Bangladesh Institute of Research and Rehabilitation in Diabetes, Endocrine and Metabolic Disorders, Dhaka; and Chittagong Chest Disease Hospital, Chittagong, Bangladesh. To present operational data and discuss the challenges of implementing FAST (Find cases Actively, Separate safely and Treat effectively) as a tuberculosis (TB) transmission control strategy. FAST was implemented sequentially at three hospitals. Using Xpert® MTB/RIF, 733/6028 (12.2%, 95%CI 11.4-13.0) patients were diagnosed with unsuspected TB. Patients with a history of TB who were admitted with other lung diseases had more than twice the odds of being diagnosed with unsuspected TB as those with no history of TB (OR 2.6, 95%CI 2.2-3.0, P < 0.001). Unsuspected multidrug-resistant TB (MDR-TB) was diagnosed in 89/1415 patients (6.3%, 95%CI 5.1-7.7). Patients with unsuspected TB had nearly five times the odds of being diagnosed with MDR-TB than those admitted with a known TB diagnosis (OR 4.9, 95%CI 3.1-7.6, P < 0.001). Implementation challenges include staff shortages, diagnostic failure, supply-chain issues and reliance on external funding. FAST implementation revealed a high frequency of unsuspected TB in hospitalized patients in Bangladesh. Patients with a previous history of TB have an increased risk of being diagnosed with unsuspected TB. Ensuring financial resources, stakeholder engagement and laboratory capacity are important for sustainability and scalability.
Implementation and audit of 'Fast-Track Surgery' in gynaecological oncology surgery.
Sidhu, Verinder S; Lancaster, Letitia; Elliott, David; Brand, Alison H
2012-08-01
Fast-track surgery is a multidisciplinary approach to surgery that results in faster recovery from surgery and decreased length of stay (LOS). The aims of this study were as follows: (i) to report on the processes required for the introduction of fast-track surgery to a gynaecological oncology unit and (ii) to report the results of a clinical audit conducted after the protocol's implementation. A fast-track protocol, specific to our unit, was developed after a series of multidisciplinary meetings. The protocol, agreed upon by those involved in the care of women in our unit, was then introduced into clinical practice. An audit was conducted of all women undergoing laparotomy, with known or suspected malignancy. Information on LOS, complication and readmission rates was collected. Descriptive statistics and Poisson regression were used for statistical analysis. The developed protocol involved a multidisciplinary approach to pre-, intra- and postoperative care. The audit included 104 consecutive women over a 6-month period, who were followed for 6 weeks postoperatively. The median LOS was 4 days. The readmission rate was 7% and the complication rate was 19% (1% intraoperative, 4% major and 14% minor). Multivariate analysis revealed that increased duration of surgery and increasing age were predictors of longer LOS. The development of a fast-track protocol is achievable in a gynaecological oncology unit, with input from a multidisciplinary team. Effective implementation of the protocol can result in a short LOS, with acceptable complication and readmission rates when applied non-selectively to gynaecological oncology patients. © 2012 The Authors ANZJOG © 2012 The Royal Australian and New Zealand College of Obstetricians and Gynaecologists.
A novel approach to Hough Transform for implementation in fast triggers
NASA Astrophysics Data System (ADS)
Pozzobon, Nicola; Montecassiano, Fabio; Zotto, Pierluigi
2016-10-01
Telescopes of position sensitive detectors are common layouts in charged particles tracking, and programmable logic devices, such as FPGAs, represent a viable choice for the real-time reconstruction of track segments in such detector arrays. A compact implementation of the Hough Transform for fast triggers in High Energy Physics, exploiting a parameter reduction method, is proposed, targeting the reduction of the needed storage or computing resources in current, or next future, state-of-the-art FPGA devices, while retaining high resolution over a wide range of track parameters. The proposed approach is compared to a Standard Hough Transform with particular emphasis on their application to muon detectors. In both cases, an original readout implementation is modeled.
Fast Detection Anti-Collision Algorithm for RFID System Implemented On-Chip
NASA Astrophysics Data System (ADS)
Sampe, Jahariah; Othman, Masuri
This study presents a proposed Fast Detection Anti-Collision Algorithm (FDACA) for Radio Frequency Identification (RFID) system. Our proposed FDACA is implemented on-chip using Application Specific Integrated Circuit (ASIC) technology and the algorithm is based on the deterministic anti-collision technique. The FDACA is novel in terms of a faster identification by reducing the number of iterations during the identification process. The primary FDACA also reads the identification (ID) bits at once regardless of its length. It also does not require the tags to remember the instructions from the reader during the communication process in which the tags are treated as address carrying devices only. As a result simple, small, low cost and memoryless tags can be produced. The proposed system is designed using Verilog HDL. The system is simulated using Modelsim XE II and synthesized using Xilinx Synthesis Technology (XST). The system is implemented in hardware using Field Programmable Grid Array (FPGA) board for real time verification. From the verification results it can be shown that the FDACA system enables to identify the tags without error until the operating frequency of 180 MHZ. Finally the FDACA system is implemented on chip using 0.18 μm Library, Synopsys Compiler and tools. From the resynthesis results it shows that the identification rate of the proposed FDACA system is 333 Mega tags per second with the power requirement of 3.451 mW.
Airborne Demonstration of FPGA Implementation of Fast Lossless Hyperspectral Data Compression System
NASA Technical Reports Server (NTRS)
Keymeulen, D.; Aranki, N.; Bakhshi, A.; Luong, H.; Sartures, C.; Dolman, D.
2014-01-01
Efficient on-board lossless hyperspectral data compression reduces data volume in order to meet NASA and DoD limited downlink capabilities. The technique also improves signature extraction, object recognition and feature classification capabilities by providing exact reconstructed data on constrained downlink resources. At JPL a novel, adaptive and predictive technique for lossless compression of hyperspectral data was recently developed. This technique uses an adaptive filtering method and achieves a combination of low complexity and compression effectiveness that far exceeds state-of-the-art techniques currently in use. The JPL-developed 'Fast Lossless' algorithm requires no training data or other specific information about the nature of the spectral bands for a fixed instrument dynamic range. It is of low computational complexity and thus well-suited for implementation in hardware.
Design of fast signal processing readout front-end electronics implemented in CMOS 40 nm technology
NASA Astrophysics Data System (ADS)
Kleczek, Rafal
2016-12-01
The author presents considerations on the design of fast readout front-end electronics implemented in a CMOS 40 nm technology with an emphasis on the system dead time, noise performance and power dissipation. The designed processing channel consists of a charge sensitive amplifier with different feedback types (Krummenacher, resistive and constant current blocks), a threshold setting block, a discriminator and a counter with logic circuitry. The results of schematic and post-layout simulations with randomly generated input pulses in a time domain according to the Poisson distribution are presented and analyzed. Dead time below 20 ns is possible while keeping noise ENC ≈ 90 e- for a detector capacitance CDET = 160 fF.
Airborne Demonstration of FPGA Implementation of Fast Lossless Hyperspectral Data Compression System
NASA Technical Reports Server (NTRS)
Keymeulen, D.; Aranki, N.; Bakhshi, A.; Luong, H.; Sartures, C.; Dolman, D.
2014-01-01
Efficient on-board lossless hyperspectral data compression reduces data volume in order to meet NASA and DoD limited downlink capabilities. The technique also improves signature extraction, object recognition and feature classification capabilities by providing exact reconstructed data on constrained downlink resources. At JPL a novel, adaptive and predictive technique for lossless compression of hyperspectral data was recently developed. This technique uses an adaptive filtering method and achieves a combination of low complexity and compression effectiveness that far exceeds state-of-the-art techniques currently in use. The JPL-developed 'Fast Lossless' algorithm requires no training data or other specific information about the nature of the spectral bands for a fixed instrument dynamic range. It is of low computational complexity and thus well-suited for implementation in hardware.
Fialkov, Alexander B; Moragn, Mati; Amirav, Aviv
2011-12-30
A new type of low thermal mass (LTM) fast gas chromatograph (GC) was designed and operated in combination with gas chromatography mass spectrometry (GC-MS) with supersonic molecular beams (SMB), including GC-MS-MS with SMB, thereby providing a novel combination with unique capabilities. The LTM fast GC is based on a short capillary column inserted inside a stainless steel tube that is resistively heated. It is located and mounted outside the standard GC oven on its available top detector port, while the capillary column is connected as usual to the standard GC injector and supersonic molecular beam interface transfer line. This new type of fast GC-MS with SMB enables less than 1 min full range temperature programming and cooling down analysis cycle time. The operation of the fast GC-MS with SMB was explored and 1 min full analysis cycle time of a mixture of 16 hydrocarbons in the C(10)H(22) up to C(44)H(90) range was achieved. The use of 35 mL/min high column flow rate enabled the elution of C(44)H(90) in less than 45 s while the SMB interface enabled splitless acceptance of this high flow rate and the provision of dominant molecular ions. A novel compound 9-benzylazidanthracene was analyzed for its purity and a synthetic chemistry process was monitored for the optimization of the chemical reaction yield. Biodiesel was analyzed in jet fuel (by both GC-MS and GC-MS-MS) in under 1 min as 5 ppm fatty acid methyl esters. Authentic iprodion and cypermethrin pesticides were analyzed in grapes extract in both full scan mode and fast GC-MS-MS mode in under 1 min cycle time and explosive mixture including TATP, TNT and RDX was analyzed in under 1 min combined with exhibiting dominant molecular ion for TATP. Fast GC-MS with SMB is based on trading GC separation for speed of analysis while enhancing the separation power of the MS via the enhancement of the molecular ion in the electron ionization of cold molecules in the SMB. This paper further discusses several features of
Fast focal zooming scheme for direct drive fusion implemented by inserting KD2PO4 crystal
NASA Astrophysics Data System (ADS)
Zhong, Zheqiang; Hu, Xiaochuan; Zhang, Bin
2016-06-01
The highly required uniformity of target in direct-drive fusion is difficult to achieve and maintain during the entire laser fusion implosion. To mitigate the increasing nonuniformity, the fast focal zooming scheme implemented by inserting an electro-optic (EO) crystal in the front end of beamline has been proposed. Functioning as a phase plate, the specifically designed EO crystal may add the induced spherical wavefront to the laser beam and alter its focusing characteristics. However, in order to zoom out the focal spot by half, the required voltage for KD2PO4 (DKDP) with single pair of electrodes is relatively high. In order to decrease the voltage while maintaining the zooming performance, the DKDP cylinder with multi pairs of electrodes has been presented. The continuous phase plate (CPP) is designed according to both the injected beam and the output field. However, the conventional CPP is designed based on the assumption of an injected beam without wavefront distortion, which would zoom in the focal spot variation in the focal zooming scheme. In order to zoom out the focal spot, a redesigned CPP has been proposed by adding a spherical wavefront to the phase variation of the conventional CPP and further optimizing. On the basis, the focusing characteristics of laser beam during the fast focal zooming process have been analyzed. Results indicate that the focal spot size decreases with the increasing voltage on DKDP crystal, meanwhile the uniformity maintains high during the focal zooming process.
Marhadour, Sophie; Wu, Hanxiang; Yang, Wen; Marivingt-Mounir, Cécile; Bonnemain, Jean-Louis; Chollet, Jean-François
2017-09-01
Excessive agrochemical use poses significant threats to environmental safety and human health. Reducing pesticide use without reducing yield is necessary for sustainable agriculture. Therefore, we developed a vectorisation strategy to enhance agrochemical delivery through plant amino acid carriers. In addition to a fenpiclonil conjugate recently described, three new amino acid conjugates were synthesised by coupling fenpiclonil to an l-α-amino acid. Phloem mobility of these conjugates, which exhibit different structures of the spacer arm introduced between fenpiclonil and the α-amino acid function, was studied using the Ricinus model. Conjugate L-14, which contains a triazole ring with the shortest amino acid chain, showed the best phloem systemicity among the four conjugates. By contrast, removing the triazole ring in the spacer arm did not improve systemicity. L-14 exhibited phloem systemicity at all reported pH values (pH values from 5.0 to 6.5) of the foliar apoplast, while acidic derivatives of fenpiclonil were translocated only at pH values near 5.0. The conjugates were recognised by a pH-dependent transporter system and translocated at distance in the phloem. They exhibited a broader phloem systemicity than fenpiclonil acidic derivatives within the pH value range of the foliar apoplast. © 2017 Society of Chemical Industry. © 2017 Society of Chemical Industry.
Implementation of a fast 16-Bit dynamic clamp using LabVIEW-RT.
Kullmann, Paul H M; Wheeler, Diek W; Beacom, Joshua; Horn, John P
2004-01-01
The dynamic-clamp method provides a powerful electrophysiological tool for creating virtual ionic conductances in living cells and studying their influence on membrane potential. Here we describe G-clamp, a new way to implement a dynamic clamp using the real-time version of the Lab-VIEW programming environment together with a Windows host, an embedded microprocessor that runs a real-time operating system and a multifunction data-acquisition board. The software includes descriptions of a fast voltage-dependent sodium conductance, delayed rectifier, M-type and A-type potassium conductances, and a leak conductance. The system can also read synaptic conductance waveforms from preassembled data files. These virtual conductances can be reliably implemented at speeds < or =43 kHz while simultaneously saving two channels of data with 16-bit precision. G-clamp also includes utilities for measuring current-voltage relations, synaptic strength, and synaptic gain. Taking an approach built on a commercially available software/hardware platform has resulted in a system that is easy to assemble and upgrade. In addition, the graphical programming structure of LabVIEW should make it relatively easy for others to adapt G-clamp for new experimental applications.
Fast implementation of Oliker's ellipses technology to build free form reflector
NASA Astrophysics Data System (ADS)
Magarill, S.
2013-09-01
The field of illumination optics has a number of applications where using free-form reflective surfaces to create a required light distribution can be beneficial. Oliker's concept of combining elliptical surfaces is the foundation of forming a reflector for an arbitrary illuminance distribution. The algorithm for fast implementation of this concept is discussed in detail. It is based on an analytical computation of a 3D cloud of points in order to map the reflector shape with the required flux distribution. Flux delivered to chosen zones across the target can be calculated based on the number of associated cloud points and its locations. This allows optimized ellipse parameters to achieve the required flux distribution without raytracing through the reflector geometry. Such a strictly analytical optimization is much faster than building reflector geometry and raytracing each step of the optimization. A generated 3D cloud of points can be used with a standard SolidWorks feature to build the loft surface. This surface consists of adjacent elliptical facets and should be smooth to maintain continuous irradiance across the target. A secondary operation to smooth the surface profile between elliptical facets is discussed. Examples of proposed algorithm implementations are presented.
Pre-Hardware Optimization and Implementation Of Fast Optics Closed Control Loop Algorithms
NASA Technical Reports Server (NTRS)
Kizhner, Semion; Lyon, Richard G.; Herman, Jay R.; Abuhassan, Nader
2004-01-01
One of the main heritage tools used in scientific and engineering data spectrum analysis is the Fourier Integral Transform and its high performance digital equivalent - the Fast Fourier Transform (FFT). The FFT is particularly useful in two-dimensional (2-D) image processing (FFT2) within optical systems control. However, timing constraints of a fast optics closed control loop would require a supercomputer to run the software implementation of the FFT2 and its inverse, as well as other image processing representative algorithm, such as numerical image folding and fringe feature extraction. A laboratory supercomputer is not always available even for ground operations and is not feasible for a night project. However, the computationally intensive algorithms still warrant alternative implementation using reconfigurable computing technologies (RC) such as Digital Signal Processors (DSP) and Field Programmable Gate Arrays (FPGA), which provide low cost compact super-computing capabilities. We present a new RC hardware implementation and utilization architecture that significantly reduces the computational complexity of a few basic image-processing algorithm, such as FFT2, image folding and phase diversity for the NASA Solar Viewing Interferometer Prototype (SVIP) using a cluster of DSPs and FPGAs. The DSP cluster utilization architecture also assures avoidance of a single point of failure, while using commercially available hardware. This, combined with the control algorithms pre-hardware optimization, or the first time allows construction of image-based 800 Hertz (Hz) optics closed control loops on-board a spacecraft, based on the SVIP ground instrument. That spacecraft is the proposed Earth Atmosphere Solar Occultation Imager (EASI) to study greenhouse gases CO2, C2H, H2O, O3, O2, N2O from Lagrange-2 point in space. This paper provides an advanced insight into a new type of science capabilities for future space exploration missions based on on-board image processing
Implementation of fast handover for proxy mobile IPv6: Resolving out-of-order packets.
Kang, Byungseok; Anh, Khuong Quoc; Choo, Hyunseung
2017-01-01
Mobile IP allows for location-independent routing of IP datagrams on the Internet. Mobile IP specifies how a mobile node (MN) registers with its home agent and how the home agent routes datagrams to the MN through the tunnel. Current Mobile IP protocols have difficulties meeting the stringent handover delay requirements of future wireless networks. Fast handover for Proxy Mobile IPv6 (FPMIPv6) is used to resolve handover latency and packet loss problems that occur in the Proxy Mobile IPv6 (PMIPv6) protocol. However, while implementing the FPMIPv6 scheme in a testbed, we encounter the out-of-order packet (OoOP) problem. The cause of this problem is the existence of two paths for data transmitted from a correspondent node (CN) to an MN. Since the problem affects the quality of service (QoS) of the network and the performance of the MN, we propose a new scheme using the last packet marker and packet buffering to solve this problem in FPMIPv6. The new Mobile Access Gateway (MAG) can control and deliver the data transmitted via the old path or the new path to an MN in order, using the last packet marker to notify the end of the data delivery in the old path and the packet buffering for holding the data delivered in the new path. We implement both the proposed scheme and FPMIPv6 in a testbed as a real network environment to demonstrate the correctness, cost effectiveness, and performance of the proposed scheme. A performance evaluation reveals that the proposed scheme can handle the OoOP problem efficiently.
Detector-device-independent quantum key distribution: Security analysis and fast implementation
Boaron, Alberto; Korzh, Boris; Houlmann, Raphael; Boso, Gianluca; Lim, Charles Ci Wen; Martin, Anthony; Zbinden, Hugo
2016-08-09
One of the most pressing issues in quantum key distribution (QKD) is the problem of detector side-channel attacks. To overcome this problem, researchers proposed an elegant “time-reversal” QKD protocol called measurement-device-independent QKD (MDI-QKD), which is based on time-reversed entanglement swapping. But, MDI-QKD is more challenging to implement than standard point-to-point QKD. Recently, we proposed an intermediary QKD protocol called detector-device-independent QKD (DDI-QKD) in order to overcome the drawbacks of MDI-QKD, with the hope that it would eventually lead to a more efficient detector side-channel-free QKD system. We analyze the security of DDI-QKD and elucidate its security assumptions. We find that DDI-QKD is not equivalent to MDI-QKD, but its security can be demonstrated with reasonable assumptions. On the more practical side, we consider the feasibility of DDI-QKD and present a fast experimental demonstration (clocked at 625 MHz), capable of secret key exchange up to more than 90 km.
Detector-device-independent quantum key distribution: Security analysis and fast implementation
Boaron, Alberto; Korzh, Boris; Boso, Gianluca; Martin, Anthony Zbinden, Hugo; Houlmann, Raphael; Lim, Charles Ci Wen
2016-08-14
One of the most pressing issues in quantum key distribution (QKD) is the problem of detector side-channel attacks. To overcome this problem, researchers proposed an elegant “time-reversal” QKD protocol called measurement-device-independent QKD (MDI-QKD), which is based on time-reversed entanglement swapping. However, MDI-QKD is more challenging to implement than standard point-to-point QKD. Recently, an intermediary QKD protocol called detector-device-independent QKD (DDI-QKD) has been proposed to overcome the drawbacks of MDI-QKD, with the hope that it would eventually lead to a more efficient detector side-channel-free QKD system. Here, we analyze the security of DDI-QKD and elucidate its security assumptions. We find that DDI-QKD is not equivalent to MDI-QKD, but its security can be demonstrated with reasonable assumptions. On the more practical side, we consider the feasibility of DDI-QKD and present a fast experimental demonstration (clocked at 625 MHz), capable of secret key exchange up to more than 90 km.
Detector-device-independent quantum key distribution: Security analysis and fast implementation
Boaron, Alberto; Korzh, Boris; Houlmann, Raphael; Boso, Gianluca; Lim, Charles Ci Wen; Martin, Anthony; Zbinden, Hugo
2016-08-09
One of the most pressing issues in quantum key distribution (QKD) is the problem of detector side-channel attacks. To overcome this problem, researchers proposed an elegant “time-reversal” QKD protocol called measurement-device-independent QKD (MDI-QKD), which is based on time-reversed entanglement swapping. But, MDI-QKD is more challenging to implement than standard point-to-point QKD. Recently, we proposed an intermediary QKD protocol called detector-device-independent QKD (DDI-QKD) in order to overcome the drawbacks of MDI-QKD, with the hope that it would eventually lead to a more efficient detector side-channel-free QKD system. We analyze the security of DDI-QKD and elucidate its security assumptions. We find that DDI-QKD is not equivalent to MDI-QKD, but its security can be demonstrated with reasonable assumptions. On the more practical side, we consider the feasibility of DDI-QKD and present a fast experimental demonstration (clocked at 625 MHz), capable of secret key exchange up to more than 90 km.
Sun, Yan V; Jacobsen, Douglas M; Turner, Stephen T; Boerwinkle, Eric; Kardia, Sharon L R
2009-03-15
In order to take into account the complex genomic distribution of SNP variations when identifying chromosomal regions with significant SNP effects, a single nucleotide polymorphism (SNP) association scan statistic was developed. To address the computational needs of genome wide association (GWA) studies, a fast Java application, which combines single-locus SNP tests and a scan statistic for identifying chromosomal regions with significant clusters of significant SNP effects, was developed and implemented. To illustrate this application, SNP associations were analyzed in a pharmacogenomic study of the blood pressure lowering effect of thiazide-diuretics (N=195) using the Affymetrix Human Mapping 100K Set. 55,335 tagSNPs (pair-wise linkage disequilibrium R(2)<0.5) were selected to reduce the frequency correlation between SNPs. A typical workstation can complete the whole genome scan including 10,000 permutation tests within 3 hours. The most significant regions locate on chromosome 3, 6, 13 and 16, two of which contain candidate genes that may be involved in the underlying drug response mechanism. The computational performance of ChromoScan-GWA and its scalability were tested with up to 1,000,000 SNPs and up to 4,000 subjects. Using 10,000 permutations, the computation time grew linearly in these datasets. This scan statistic application provides a robust statistical and computational foundation for identifying genomic regions associated with disease and provides a method to compare GWA results even across different platforms.
Detector-device-independent quantum key distribution: Security analysis and fast implementation
Boaron, Alberto; Korzh, Boris; Houlmann, Raphael; ...
2016-08-09
One of the most pressing issues in quantum key distribution (QKD) is the problem of detector side-channel attacks. To overcome this problem, researchers proposed an elegant “time-reversal” QKD protocol called measurement-device-independent QKD (MDI-QKD), which is based on time-reversed entanglement swapping. But, MDI-QKD is more challenging to implement than standard point-to-point QKD. Recently, we proposed an intermediary QKD protocol called detector-device-independent QKD (DDI-QKD) in order to overcome the drawbacks of MDI-QKD, with the hope that it would eventually lead to a more efficient detector side-channel-free QKD system. We analyze the security of DDI-QKD and elucidate its security assumptions. We find thatmore » DDI-QKD is not equivalent to MDI-QKD, but its security can be demonstrated with reasonable assumptions. On the more practical side, we consider the feasibility of DDI-QKD and present a fast experimental demonstration (clocked at 625 MHz), capable of secret key exchange up to more than 90 km.« less
NASA Astrophysics Data System (ADS)
Nagata, Yuichi
We propose an genetic algorithm (GA) that applies to the traveling salesman problem (TSP). The GA uses edge assembly crossover (EAX), which is known to be effective for solving the TSP. We first propose a fast implementation of a localized EAX where localized edge exchanges are used in the EAX procedure. We also propose a selection model with an effective combination of the localized EAX that can maintain population diversity at negligible computational costs. Edge entropy measure is used to evaluate population diversity. We demonstrate that the proposed GA is comparable to state-of-the-art heuristics for the TSP. Especially, the GA is superior to them on large instances more than 10,000 cities. For example, the GA found an optimal solution of brd14051 (14,051 cities instance) with a reasonable computational cost. The results are quite impressive because the GA does not use Lin-Kernighan local search (LKLS) even though almost all existing state-of-the-art heuristics for the TSP based on LKLS and its variants.
A Fast Healthcare Interoperability Resources (FHIR) layer implemented over i2b2.
Boussadi, Abdelali; Zapletal, Eric
2017-08-14
Standards and technical specifications have been developed to define how the information contained in Electronic Health Records (EHRs) should be structured, semantically described, and communicated. Current trends rely on differentiating the representation of data instances from the definition of clinical information models. The dual model approach, which combines a reference model (RM) and a clinical information model (CIM), sets in practice this software design pattern. The most recent initiative, proposed by HL7, is called Fast Health Interoperability Resources (FHIR). The aim of our study was to investigate the feasibility of applying the FHIR standard to modeling and exposing EHR data of the Georges Pompidou European Hospital (HEGP) integrating biology and the bedside (i2b2) clinical data warehouse (CDW). We implemented a FHIR server over i2b2 to expose EHR data in relation with five FHIR resources: DiagnosisReport, MedicationOrder, Patient, Encounter, and Medication. The architecture of the server combines a Data Access Object design pattern and FHIR resource providers, implemented using the Java HAPI FHIR API. Two types of queries were tested: query type #1 requests the server to display DiagnosticReport resources, for which the diagnosis code is equal to a given ICD-10 code. A total of 80 DiagnosticReport resources, corresponding to 36 patients, were displayed. Query type #2, requests the server to display MedicationOrder, for which the FHIR Medication identification code is equal to a given code expressed in a French coding system. A total of 503 MedicationOrder resources, corresponding to 290 patients, were displayed. Results were validated by manually comparing the results of each request to the results displayed by an ad-hoc SQL query. We showed the feasibility of implementing a Java layer over the i2b2 database model to expose data of the CDW as a set of FHIR resources. An important part of this work was the structural and semantic mapping between the
Implementation of rooftop reciculation parameterization into the QUIC fast response urban wind model
Bagal, N.; Singh, B.; Pardyjak, E. R.; Brown, M. J.
2004-01-01
The QUIC (Quick Urban & Industrial Complex) dispersion modeling system has been developed to provide high-resolution wind and concentration fields in cities. The fast response 3D urban wind model QUIC-URB explicitly solves for the flow field around buildings using a suite of empirical parameterizations and mass conservation. This procedure is based on the work of Rockle (1990). The current Rockle (1990) model does not capture the rooftop recirculation region associated with flow separation from the leading edge of an isolated building. According to Banks et al. (2001), there are two forms of separation depending on the incident wind angle. For an incident wind angle within 20{sup o} of perpendicular to the front face of the building, 'bubble separation' occurs in which cylindrical vortices whose axis are orthogonal to the flow are generated along the rooftop surface (see Fig. 1). For a 'corner wind' flow or incident wind angle of 30{sup o} to 70{sup o} of perpendicular to the front face of the building, 'conical' or 'delta wing' vortices form along the roof surface (Fig. 3). In this work, a model for rooftop recirculation is implemented into the QUIC- URB model for the two incident wind angle regimes described above. The parameterizations for the length and height of the recirculation region are from Wilson (1979) for the case of flow perpendicular or near perpendicular to the building and from Banks et al. (2000) for the case of off-angle flow. In this paper, we describe the rooftop algorithms and show how the model results are improved through comparisons to experimental data (Snyder and Lawson 1994).
Wang, Z.; Lupo, J.; Patnaik, S.S.; McKenney, A.; Pachter, R.
1999-07-01
The Fast Multipole Method (FMM) offers an efficient way (order O(N)) to handle long range electrostatic interactions, thus enabling more realistic molecular dynamics simulations of large molecular systems. The performance of the fast molecular dynamics (FMD) code, a parallel MD code being developed in the group, using the three-dimensional fast multipole method, shows a good speedup. The application to the full atomic-scale molecular dynamics simulation of a liquid crystalline droplet of 4-n-pentyl-4{prime}-cyanobiphenyl (5CB) molecules, of size 35,872 atoms, shows strong surface effects on various orientational order parameters.
ERIC Educational Resources Information Center
Holland, Rochelle
2006-01-01
The purpose of this case study was to examine the efficacy of a developing technique that has been coined by this author as a Mental Wellness Fast. Therefore, this paper has been written for therapists who utilize spirituality and/or religion into their practice. The technique is geared to assist clients with healing poor inner dialogues and it…
ERIC Educational Resources Information Center
Edgecombe, Nikki; Jaggars, Shanna Smith; Baker, Elaine DeLott; Bailey, Thomas
2013-01-01
Originally designed for students who test into at least two levels of developmental education in a particular subject area, FastStart is a compressed course program model launched in 2005 at the Community College of Denver (CCD). The program combines multiple semester-length courses into a single intensive semester, while providing case…
NASA Astrophysics Data System (ADS)
Yarnykh, V.; Korostyshevskaya, A.
2017-08-01
Macromolecular proton fraction (MPF) is a biophysical parameter describing the amount of macromolecular protons involved into magnetization exchange with water protons in tissues. MPF represents a significant interest as a magnetic resonance imaging (MRI) biomarker of myelin for clinical applications. A recent fast MPF mapping method enabled clinical translation of MPF measurements due to time-efficient acquisition based on the single-point constrained fit algorithm. However, previous MPF mapping applications utilized only 3 Tesla MRI scanners and modified pulse sequences, which are not commonly available. This study aimed to test the feasibility of MPF mapping implementation on a 1.5 Tesla clinical scanner using standard manufacturer’s sequences and compare the performance of this method between 1.5 and 3 Tesla scanners. MPF mapping was implemented on 1.5 and 3 Tesla MRI units of one manufacturer with either optimized custom-written or standard product pulse sequences. Whole-brain three-dimensional MPF maps obtained from a single volunteer were compared between field strengths and implementation options. MPF maps demonstrated similar quality at both field strengths. MPF values in segmented brain tissues and specific anatomic regions appeared in close agreement. This experiment demonstrates the feasibility of fast MPF mapping using standard sequences on 1.5 T and 3 T clinical scanners.
Xiao, Ying; Zhao, Yubin; Xie, Yanming
2017-01-01
Traditional Chinese medicine (TCM) injections are prepared from active substances extracted from TCMs and other natural medicines to establish scientific and technological methods, based on TCM hypotheses and experiences. A device was designed to provide a fast allergy skin test detector for TCM injections that could be applied to drugs of a single component or complex components. A novel fast allergy skin test detector for TCM injections was developed combining direct-current main, drug solution permeation devices of various shape that were compatible with the skin test electrode, nano-sponge patch adsorption, and flexible liposome coverage technologies with high-amplitude pulse. The detector was characterized by simple structure, easy manipulation, low dose of drug required for the skin test, no irritation to human skin, and low-false positive rate. According to the pilot clinical use, it was able to meet the clinical demand and was promising for the prevention of allergy to TCM injections. PMID:28565781
Fast Implementation of New S-Band Capability in the Deep Space Network
NASA Astrophysics Data System (ADS)
Velazco, J. E.; Sosnowski, J.; Bowen, J.; Hanson, T.; Ocampo, J.; Huleis, J.; Taylor, M.; Pereira, E.; Montanez, S.; Young, M.; Link, C.; Long, E.; Lin, H.; Franco, M.
2016-11-01
We report on the implementation of a new S-band (2025-2120 MHz uplink, 2200-2300 MHz downlink) communications system capability for the Deep Space Network's (DSN) Deep Space Station 36 (DSS-36) performed by JPL's Communications Ground Systems Section (333). The newly implemented S-band system, consisting of a transmitter, a receiver, a waveguide system, and a feed, will enhance the capabilities of NASA's DSN to communicate with spacecraft in near-Earth orbit. A key milestone achieved during this project, described in detail in this article, is the implementation of an S-band receiver that features the best sensitivity to date in the DSN S-band systems. It is noteworthy that, in order to alleviate scheduling issues associated with installation of other systems into DSS-36, this successful implementation was carried out in record time.
2009-01-01
In 1990, the Fast Track Project was initiated to evaluate the feasibility and effectiveness of a comprehensive, multicomponent prevention program targeting children at risk for conduct disorders in four demographically diverse American communities (Conduct Problems Prevention Research Group [CPPRG], 1992). Representing a prevention science approach toward community-based preventive intervention, the Fast Track intervention design was based upon the available data base elucidating the epidemiology of risk for conduct disorder and suggesting key causal developmental influences (R. P. Weissberg & M. T. Greenberg, 1998). Critical questions about this approach to prevention center around the extent to which such a science-based program can be effective at (1) engaging community members and stakeholders, (2) maintaining intervention fidelity while responding appropriately to the local norms and needs of communities that vary widely in their demographic and cultural/ethnic composition, and (3) maintaining community engagement in the long-term to support effective and sustainable intervention dissemination. This paper discusses these issues, providing examples from the Fast Track project to illustrate the process of program implementation and the evidence available regarding the success of this science-based program at engaging communities in sustainable and effective ways as partners in prevention programming. PMID:11930968
Webb, Thomas L; Sheeran, Paschal; Pepper, John
2012-03-01
The present research investigated whether forming implementation intentions could promote fast responses to attitude-incongruent associations (e.g., woman-manager) and thereby modify scores on popular implicit measures of attitude. Expt 1 used the Implicit Association Test (IAT) to measure associations between gender and science versus liberal arts. Planning to associate women with science engendered fast responses to this category-attribute pairing and rendered summary scores more neutral compared to standard IAT instructions. Expt 2 demonstrated that forming egalitarian goal intentions is not sufficient to produce these effects. Expt 3 extended these findings to a different measure of implicit attitude (the Go/No-Go Association Task) and a different stereotypical association (Muslims-terrorism). In Expt 4, managers who planned to associate women with superordinate positions showed more neutral IAT scores relative to non-planners and effects were maintained 3 weeks later. In sum, implementation intentions enable people to gain control over implicit attitude responses. © 2010 The British Psychological Society.
Chang, Chia-Hua; Chou, Min-Te; Wu, Yi-Chung; Hong, Ting-Wei; Li, Yun-Lung; Yang, Chia-Hsiang; Hung, Jui-Hung
2016-11-15
The Full-text index in Minute space (FM-index) derived from the Burrows-Wheeler transform (BWT) is broadly used for fast string matching in large genomes or a huge set of sequencing reads. Several graphic processing unit (GPU) accelerated aligners based on the FM-index have been proposed recently; however, the construction of the index is still handled by central processing unit (CPU), only parallelized in data level (e.g. by performing blockwise suffix sorting in GPU), or not scalable for large genomes. To fulfill the need for a more practical, hardware-parallelizable indexing and matching approach, we herein propose sBWT based on a BWT variant (i.e. Schindler transform) that can be built with highly simplified hardware-acceleration-friendly algorithms and still suffices accurate and fast string matching in repetitive references. In our tests, the implementation achieves significant speedups in indexing and searching compared with other BWT-based tools and can be applied to a variety of domains. sBWT is implemented in C ++ with CPU-only and GPU-accelerated versions. sBWT is open-source software and is available at http://jhhung.github.io/sBWT/Supplementary information: Supplementary data are available at Bioinformatics online. chyee@ntu.edu.tw or jhhung@nctu.edu.tw (also juihunghung@gmail.com). © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.
NASA Astrophysics Data System (ADS)
Du, Qiang; Yang, Jiang
2017-03-01
This work is concerned with the Fourier spectral approximation of various integral differential equations associated with some linear nonlocal diffusion and peridynamic operators under periodic boundary conditions. For radially symmetric kernels, the nonlocal operators under consideration are diagonalizable in the Fourier space so that the main computational challenge is on the accurate and fast evaluation of their eigenvalues or Fourier symbols consisting of possibly singular and highly oscillatory integrals. For a large class of fractional power-like kernels, we propose a new approach based on reformulating the Fourier symbols both as coefficients of a series expansion and solutions of some simple ODE models. We then propose a hybrid algorithm that utilizes both truncated series expansions and high order Runge-Kutta ODE solvers to provide fast evaluation of Fourier symbols in both one and higher dimensional spaces. It is shown that this hybrid algorithm is robust, efficient and accurate. As applications, we combine this hybrid spectral discretization in the spatial variables and the fourth-order exponential time differencing Runge-Kutta for temporal discretization to offer high order approximations of some nonlocal gradient dynamics including nonlocal Allen-Cahn equations, nonlocal Cahn-Hilliard equations, and nonlocal phase-field crystal models. Numerical results show the accuracy and effectiveness of the fully discrete scheme and illustrate some interesting phenomena associated with the nonlocal models.
A display module implemented by the fast high-temperatue response of carbon nanotube thin yarns.
Wei, Yang; Liu, Peng; Jiang, Kaili; Fan, Shoushan
2012-05-09
Suspending superaligned multiwalled carbon nanotube (MWCNT) films were processed into CNT thin yarns, about 1 μm in diameter, by laser cutting and an ethanol atomization bath treatment. The fast high-temperature response under a vacuum was revealed by monitoring the incandescent light with a photo diode. The thin yarns can be electrically heated up to 2170 K in 0.79 mS, and the succeeding cool-down time is 0.36 mS. The fast response is attributed to the ultrasmall mass of the independent single yarn, large radiation coefficient, and improved thermal conductance through the two cool ends. The millisecond response time makes it possible to use the visible hot thin yarns as light-emitting elements of an incandescent display. A fully sealed display with 16 × 16 matrix was successfully fabricated using screen-printed thick electrodes and CNT thin yarns. It can display rolling characters with a low power consumption. More applications can be further developed based on the addressable CNT thermal arrays.
NASA Astrophysics Data System (ADS)
Rein, Hanno; Tamayo, Daniel
2015-09-01
We present WHFAST, a fast and accurate implementation of a Wisdom-Holman symplectic integrator for long-term orbit integrations of planetary systems. WHFAST is significantly faster and conserves energy better than all other Wisdom-Holman integrators tested. We achieve this by significantly improving the Kepler solver and ensuring numerical stability of coordinate transformations to and from Jacobi coordinates. These refinements allow us to remove the linear secular trend in the energy error that is present in other implementations. For small enough timesteps, we achieve Brouwer's law, i.e. the energy error is dominated by an unbiased random walk due to floating-point round-off errors. We implement symplectic correctors up to order 11 that significantly reduce the energy error. We also implement a symplectic tangent map for the variational equations. This allows us to efficiently calculate two widely used chaos indicators the Lyapunov characteristic number and the Mean Exponential Growth factor of Nearby Orbits. WHFAST is freely available as a flexible C package, as a shared library, and as an easy-to-use PYTHON module.
ERIC Educational Resources Information Center
Riley-Ayers, Shannon; Costanza, Vincent J.
2014-01-01
Local education agencies (LEAs) are working to manage and maintain commitment and enthusiasm to numerous initiatives mandated by the state to improve student success. The rapid pace of scaling up many initiatives at once often leads to relying on local administrators and educators to interpret and unpack the complexity of implementing these…
ERIC Educational Resources Information Center
Riley-Ayers, Shannon; Costanza, Vincent J.
2014-01-01
Local education agencies (LEAs) are working to manage and maintain commitment and enthusiasm to numerous initiatives mandated by the state to improve student success. The rapid pace of scaling up many initiatives at once often leads to relying on local administrators and educators to interpret and unpack the complexity of implementing these…
NASA Technical Reports Server (NTRS)
Yan, T. Y.; Yao, K.
1981-01-01
The theory and implementation of a multiplication-free linear mean-square error criterion equalizer for data transmission are considered. For many real-time signal processing situations, a large number of multiplications is objectionable. The linear estimation problem on a binary computer is considered where the estimation parameters are constrained to be powers of two and thus all multiplications are replaced by shifts. The optimal solution is obtained from an integer-programming-like problem except that the allowable discrete points are non-integers. The branch-and-bound algorithm is used to obtain the coefficients of the equalization TDL. Specific experimental performance results are given for an equalizer implemented with a 12 bit A/D device and a 8080 microprocessor.
FUX-Sim: Implementation of a fast universal simulation/reconstruction framework for X-ray systems
Garcia- Blas, Javier; García, Ines; de Molina, Claudia; Carretero, Jesus; Desco, Manuel
2017-01-01
The availability of digital X-ray detectors, together with advances in reconstruction algorithms, creates an opportunity for bringing 3D capabilities to conventional radiology systems. The downside is that reconstruction algorithms for non-standard acquisition protocols are generally based on iterative approaches that involve a high computational burden. The development of new flexible X-ray systems could benefit from computer simulations, which may enable performance to be checked before expensive real systems are implemented. The development of simulation/reconstruction algorithms in this context poses three main difficulties. First, the algorithms deal with large data volumes and are computationally expensive, thus leading to the need for hardware and software optimizations. Second, these optimizations are limited by the high flexibility required to explore new scanning geometries, including fully configurable positioning of source and detector elements. And third, the evolution of the various hardware setups increases the effort required for maintaining and adapting the implementations to current and future programming models. Previous works lack support for completely flexible geometries and/or compatibility with multiple programming models and platforms. In this paper, we present FUX-Sim, a novel X-ray simulation/reconstruction framework that was designed to be flexible and fast. Optimized implementation for different families of GPUs (CUDA and OpenCL) and multi-core CPUs was achieved thanks to a modularized approach based on a layered architecture and parallel implementation of the algorithms for both architectures. A detailed performance evaluation demonstrates that for different system configurations and hardware platforms, FUX-Sim maximizes performance with the CUDA programming model (5 times faster than other state-of-the-art implementations). Furthermore, the CPU and OpenCL programming models allow FUX-Sim to be executed over a wide range of hardware
FUX-Sim: Implementation of a fast universal simulation/reconstruction framework for X-ray systems.
Abella, Monica; Serrano, Estefania; Garcia-Blas, Javier; García, Ines; de Molina, Claudia; Carretero, Jesus; Desco, Manuel
2017-01-01
The availability of digital X-ray detectors, together with advances in reconstruction algorithms, creates an opportunity for bringing 3D capabilities to conventional radiology systems. The downside is that reconstruction algorithms for non-standard acquisition protocols are generally based on iterative approaches that involve a high computational burden. The development of new flexible X-ray systems could benefit from computer simulations, which may enable performance to be checked before expensive real systems are implemented. The development of simulation/reconstruction algorithms in this context poses three main difficulties. First, the algorithms deal with large data volumes and are computationally expensive, thus leading to the need for hardware and software optimizations. Second, these optimizations are limited by the high flexibility required to explore new scanning geometries, including fully configurable positioning of source and detector elements. And third, the evolution of the various hardware setups increases the effort required for maintaining and adapting the implementations to current and future programming models. Previous works lack support for completely flexible geometries and/or compatibility with multiple programming models and platforms. In this paper, we present FUX-Sim, a novel X-ray simulation/reconstruction framework that was designed to be flexible and fast. Optimized implementation for different families of GPUs (CUDA and OpenCL) and multi-core CPUs was achieved thanks to a modularized approach based on a layered architecture and parallel implementation of the algorithms for both architectures. A detailed performance evaluation demonstrates that for different system configurations and hardware platforms, FUX-Sim maximizes performance with the CUDA programming model (5 times faster than other state-of-the-art implementations). Furthermore, the CPU and OpenCL programming models allow FUX-Sim to be executed over a wide range of hardware
Tuomas, V.; Jaakko, L.
2013-07-01
This article discusses the optimization of the target motion sampling (TMS) temperature treatment method, previously implemented in the Monte Carlo reactor physics code Serpent 2. The TMS method was introduced in [1] and first practical results were presented at the PHYSOR 2012 conference [2]. The method is a stochastic method for taking the effect of thermal motion into account on-the-fly in a Monte Carlo neutron transport calculation. It is based on sampling the target velocities at collision sites and then utilizing the 0 K cross sections at target-at-rest frame for reaction sampling. The fact that the total cross section becomes a distributed quantity is handled using rejection sampling techniques. The original implementation of the TMS requires 2.0 times more CPU time in a PWR pin-cell case than a conventional Monte Carlo calculation relying on pre-broadened effective cross sections. In a HTGR case examined in this paper the overhead factor is as high as 3.6. By first changing from a multi-group to a continuous-energy implementation and then fine-tuning a parameter affecting the conservativity of the majorant cross section, it is possible to decrease the overhead factors to 1.4 and 2.3, respectively. Preliminary calculations are also made using a new and yet incomplete optimization method in which the temperature of the basis cross section is increased above 0 K. It seems that with the new approach it may be possible to decrease the factors even as low as 1.06 and 1.33, respectively, but its functionality has not yet been proven. Therefore, these performance measures should be considered preliminary. (authors)
Bhanot, Gyan V.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Vranas, Pavlos M.
2008-01-01
The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.
Bhanot, Gyan V [Princeton, NJ; Chen, Dong [Croton-On-Hudson, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY
2012-01-10
The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.
Shi, Yingzhong; Chung, Fu-Lai; Wang, Shitong
2015-09-01
Recently, a time-adaptive support vector machine (TA-SVM) is proposed for handling nonstationary datasets. While attractive performance has been reported and the new classifier is distinctive in simultaneously solving several SVM subclassifiers locally and globally by using an elegant SVM formulation in an alternative kernel space, the coupling of subclassifiers brings in the computation of matrix inversion, thus resulting to suffer from high computational burden in large nonstationary dataset applications. To overcome this shortcoming, an improved TA-SVM (ITA-SVM) is proposed using a common vector shared by all the SVM subclassifiers involved. ITA-SVM not only keeps an SVM formulation, but also avoids the computation of matrix inversion. Thus, we can realize its fast version, that is, improved time-adaptive core vector machine (ITA-CVM) for large nonstationary datasets by using the CVM technique. ITA-CVM has the merit of asymptotic linear time complexity for large nonstationary datasets as well as inherits the advantage of TA-SVM. The effectiveness of the proposed classifiers ITA-SVM and ITA-CVM is also experimentally confirmed.
Implementation of a Synchronized Oscillator Circuit for Fast Sensing and Labeling of Image Objects
Kowalski, Jacek; Strzelecki, Michal; Kim, Hyongsuk
2011-01-01
We present an application-specific integrated circuit (ASIC) CMOS chip that implements a synchronized oscillator cellular neural network with a matrix size of 32 × 32 for object sensing and labeling in binary images. Networks of synchronized oscillators are a recently developed tool for image segmentation and analysis. Its parallel network operation is based on a “temporary correlation” theory that attempts to describe scene recognition as if performed by the human brain. The synchronized oscillations of neuron groups attract a person’s attention if he or she is focused on a coherent stimulus (image object). For more than one perceived stimulus, these synchronized patterns switch in time between different neuron groups, thus forming temporal maps that code several features of the analyzed scene. In this paper, a new oscillator circuit based on a mathematical model is proposed, and the network architecture and chip functional blocks are presented and discussed. The proposed chip is implemented in AMIS 0.35 μm C035M-D 5M/1P technology. An application of the proposed network chip for the segmentation of insulin-producing pancreatic islets in magnetic resonance liver images is presented. PMID:22163803
Implementation Plan for Qualification of Sodium-Cooled Fast Reactor Technology Information
Moe, Wayne; Honma, George
2016-03-01
This document identifies and discusses implementation elements that can be used to facilitate consistent and systematic evaluation processes relating to quality attributes of technical information (with focus on SFR technology) that will be used to support licensing of advanced reactor designs. Information may include, but is not limited to, design documents for SFRs, research-and-development (R&D) data and associated documents, test plans and associated protocols, operations and test data, international research data, technical reports, and information associated with past U.S. Nuclear Regulatory Commission (NRC) reviews of SFR designs. The approach for determining acceptability of test data, analysis, and/or other technical information is based on guidance provided in INL/EXT-15-35805, “Guidance on Evaluating Historic Technology Information for Use in Advanced Reactor Licensing.” The implementation plan can be adopted into a working procedure at each of the national laboratories performing data qualification, or by applicants seeking future license application for advanced reactor technology.
Implementation of a synchronized oscillator circuit for fast sensing and labeling of image objects.
Kowalski, Jacek; Strzelecki, Michal; Kim, Hyongsuk
2011-01-01
We present an application-specific integrated circuit (ASIC) CMOS chip that implements a synchronized oscillator cellular neural network with a matrix size of 32 × 32 for object sensing and labeling in binary images. Networks of synchronized oscillators are a recently developed tool for image segmentation and analysis. Its parallel network operation is based on a "temporary correlation" theory that attempts to describe scene recognition as if performed by the human brain. The synchronized oscillations of neuron groups attract a person's attention if he or she is focused on a coherent stimulus (image object). For more than one perceived stimulus, these synchronized patterns switch in time between different neuron groups, thus forming temporal maps that code several features of the analyzed scene. In this paper, a new oscillator circuit based on a mathematical model is proposed, and the network architecture and chip functional blocks are presented and discussed. The proposed chip is implemented in AMIS 0.35 μm C035M-D 5M/1P technology. An application of the proposed network chip for the segmentation of insulin-producing pancreatic islets in magnetic resonance liver images is presented.
Kurzak, Jakub; Pettitt, B Montgomery
2008-01-01
Biomolecular simulations require increasingly efficient parallel codes. We present an efficient communication algorithm for irregular problems exhibiting an all-to-many communication pattern. The algorithm is developed using message passing on distributed memory machines and assumes explicit knowledge of the interconnection topology. The algorithm maximizes locality of interprocessor communication by adopting to an arbitrary interconnection topology and at the same time takes multiprocessor nodes into account. The solution is incorporated into our implementation of the fast multipole method with periodic boundary conditions used for molecular dynamics simulations, but we believe it generalizes to many algorithms demonstrating an all-to-many communication pattern. We show that an irregular algorithm can be forced to behave like a systolic algorithm.
Design and Implementation of the Control System for a 2 kHz Rotary Fast Tool Servo
Montesanti, R C; Trumper, D L
2004-03-29
This paper presents a summary of the performance of our 2 kHz rotary fast tool servo and an overview of its control systems. We also discuss the loop shaping techniques used to design the power amplifier current control loop and the implementation of that controller in an op-amp circuit. The design and development of the control system involved a long list of items including: current compensation; tool position compensation; notch filter design and phase stabilizing with an additional pole for a plant with an undamped resonance; adding viscous damping to the fast tool servo; voltage budget for driving real and reactive loads; dealing with unwanted oscillators; ground loops; digital-to-analog converter glitches; electrical noise from the spindle motor switching power supply; and filtering the spindle encoder signal to generate smooth tool tip trajectories. Eventually, all of these topics will be discussed in detail in a Ph.D. thesis that will include this work. For the purposes of this paper, rather than present a diluted discussion that attempts to touch on all of these topics, we will focus on the first item with sufficient detail for providing insight into the design process.
NASA Astrophysics Data System (ADS)
Ren, Jianfeng; Kehtarnavaz, Nasser; Budagavi, Madhukar
2008-02-01
In the H.264/AVC video coding standard, the mode decision component involves a large amount of computation. This paper presents a fast or computationally efficient mode prediction and selection approach which has the following attributes: (a) both the spatial and temporal information are used to achieve early termination using adaptive thresholds, (b) inclusion of a modulator capable of trading off computational efficiency and accuracy, (c) a homogenous region detection procedure for 8×8 blocks based on adaptive thresholds. The developed approach consists of three main steps: (1) mode prediction, (2) early termination based on adaptive thresholds, and (3) refinement by checking all the modes. In addition, in order to avoid sub-partitions into smaller block sizes for 8x8 blocks, texture information is utilized. It is shown that the developed approach leads to a computationally efficient video coding implementation as compared to the previous fast approaches. The results obtained on QCIF, CIF, and HD format video sequences based on x264 are presented to demonstrate the computational efficiency of the developed approach at the expense of acceptably low losses in video quality.
Banić, Nikola; Lončarić, Sven
2015-11-01
Removing the influence of illumination on image colors and adjusting the brightness across the scene are important image enhancement problems. This is achieved by applying adequate color constancy and brightness adjustment methods. One of the earliest models to deal with both of these problems was the Retinex theory. Some of the Retinex implementations tend to give high-quality results by performing local operations, but they are computationally relatively slow. One of the recent Retinex implementations is light random sprays Retinex (LRSR). In this paper, a new method is proposed for brightness adjustment and color correction that overcomes the main disadvantages of LRSR. There are three main contributions of this paper. First, a concept of memory sprays is proposed to reduce the number of LRSR's per-pixel operations to a constant regardless of the parameter values, thereby enabling a fast Retinex-based local image enhancement. Second, an effective remapping of image intensities is proposed that results in significantly higher quality. Third, the problem of LRSR's halo effect is significantly reduced by using an alternative illumination processing method. The proposed method enables a fast Retinex-based image enhancement by processing Retinex paths in a constant number of steps regardless of the path size. Due to the halo effect removal and remapping of the resulting intensities, the method outperforms many of the well-known image enhancement methods in terms of resulting image quality. The results are presented and discussed. It is shown that the proposed method outperforms most of the tested methods in terms of image brightness adjustment, color correction, and computational speed.
NASA Astrophysics Data System (ADS)
Hu, Chialun John
2014-04-01
LPED method, or Local Polar Edge Detection method, is a novel method the author discovered and implemented in many image processing schemes in the last 3 years with 3 papers published in this and other SPIE national conferences. It uses a special real-time boundary extraction method applied to some binary images taken by an uncooled IR camera on some high temperature objects embedded in a cold environment background in the far field. The unique boundary shape of each high temperature object can then be used to construct a 36D analog vector (a 36 - "digit" number U, with each "digit" being a positive analog number of any magnitude). This 36D analog vector U then represents the ID code to identify this object possessing this particular boundary shape. Therefore, U may be used for tracking and targeting on this particular object when this object is moving very fast in a 2D space and criss-crossing with other fast moving objects embedded in the same field of view. The current paper will report a preliminary optical bench design of the optical system that will use the above developed soft-ware to construct a real-time, instant-detect, instant track, and automatic targeting high power laser gun system, for shooting down any spontaneously launched enemy surface-to-air-missiles from the near-by battle ground. It uses the total reflection phenomenon in the Wollastron beam combiner and real-time monitor screen auto-targeting and firing system to implement this "instant-detect, instant-kill, SAM killer system".
Bierman, Karen L.
2012-01-01
Childhood conduct problems are predictive of a number of serious long-term difficulties (e.g., school failure, delinquent behavior, and mental health problems), making the design of effective prevention programs a priority. The Fast Track Program is a demonstration project currently underway in four demographically diverse areas of the United States, testing the feasibility and effectiveness of a comprehensive, multicomponent prevention program targeting children at risk for conduct disorders. This paper describes some lessons learned about the implementation of this program in a rural area. Although there are many areas of commonality in terms of program needs, program design, and implementation issues in rural and urban sites, rural areas differ from urban areas along the dimensions of geographical dispersion and regionalism, and community stability and insularity. Rural programs must cover a broad geographical area and must be sensitive to the multiple, small and regional communities that constitute their service area. Small schools, homogeneous populations, traditional values, limited recreational, educational and mental health services, and politically conservative climates are all more likely to emerge as characteristics of rural rather than urban sites (Sherman, 1992). These characteristics may both pose particular challenges to the implementation of prevention programs in rural areas, as well as offer particular benefits. Three aspects of program implementation are described in detail: (a) community entry and program initiation in rural areas, (b) the adaptation of program components and service delivery to meet the needs of rural families and schools, and (c) issues in administrative organization of a broadly dispersed tricounty rural prevention program. PMID:9338956
Numerical implementation of non-local polycrystal plasticity using fast Fourier transforms
Lebensohn, Ricardo A.; Needleman, Alan
2016-03-28
Here, we present the numerical implementation of a non-local polycrystal plasticity theory using the FFT-based formulation of Suquet and co-workers. Gurtin (2002) non-local formulation, with geometry changes neglected, has been incorporated in the EVP-FFT algorithm of Lebensohn et al. (2012). Numerical procedures for the accurate estimation of higher order derivatives of micromechanical fields, required for feedback into single crystal constitutive relations, are identified and applied. A simple case of a periodic laminate made of two fcc crystals with different plastic properties is first used to assess the soundness and numerical stability of the proposed algorithm and to study the influence of different model parameters on the predictions of the non-local model. Different behaviors at grain boundaries are explored, and the one consistent with the micro-clamped condition gives the most pronounced size effect. The formulation is applied next to 3-D fcc polycrystals, illustrating the possibilities offered by the proposed numerical scheme to analyze the mechanical response of polycrystalline aggregates in three dimensions accounting for size dependence arising from plastic strain gradients with reasonable computing times.
Numerical implementation of non-local polycrystal plasticity using fast Fourier transforms
Lebensohn, Ricardo A.; Needleman, Alan
2016-03-28
Here, we present the numerical implementation of a non-local polycrystal plasticity theory using the FFT-based formulation of Suquet and co-workers. Gurtin (2002) non-local formulation, with geometry changes neglected, has been incorporated in the EVP-FFT algorithm of Lebensohn et al. (2012). Numerical procedures for the accurate estimation of higher order derivatives of micromechanical fields, required for feedback into single crystal constitutive relations, are identified and applied. A simple case of a periodic laminate made of two fcc crystals with different plastic properties is first used to assess the soundness and numerical stability of the proposed algorithm and to study the influencemore » of different model parameters on the predictions of the non-local model. Different behaviors at grain boundaries are explored, and the one consistent with the micro-clamped condition gives the most pronounced size effect. The formulation is applied next to 3-D fcc polycrystals, illustrating the possibilities offered by the proposed numerical scheme to analyze the mechanical response of polycrystalline aggregates in three dimensions accounting for size dependence arising from plastic strain gradients with reasonable computing times.« less
Numerical implementation of non-local polycrystal plasticity using fast Fourier transforms
NASA Astrophysics Data System (ADS)
Lebensohn, Ricardo A.; Needleman, Alan
2016-12-01
We present the numerical implementation of a non-local polycrystal plasticity theory using the FFT-based formulation of Suquet and co-workers. Gurtin (2002) non-local formulation, with geometry changes neglected, has been incorporated in the EVP-FFT algorithm of Lebensohn et al. (2012). Numerical procedures for the accurate estimation of higher order derivatives of micromechanical fields, required for feedback into single crystal constitutive relations, are identified and applied. A simple case of a periodic laminate made of two fcc crystals with different plastic properties is first used to assess the soundness and numerical stability of the proposed algorithm and to study the influence of different model parameters on the predictions of the non-local model. Different behaviors at grain boundaries are explored, and the one consistent with the micro-clamped condition gives the most pronounced size effect. The formulation is applied next to 3-D fcc polycrystals, illustrating the possibilities offered by the proposed numerical scheme to analyze the mechanical response of polycrystalline aggregates in three dimensions accounting for size dependence arising from plastic strain gradients with reasonable computing times.
Murphy, Mark; Alley, Marcus; Demmel, James; Keutzer, Kurt; Vasanawala, Shreyas; Lustig, Michael
2012-06-01
We present l₁-SPIRiT, a simple algorithm for auto calibrating parallel imaging (acPI) and compressed sensing (CS) that permits an efficient implementation with clinically-feasible runtimes. We propose a CS objective function that minimizes cross-channel joint sparsity in the wavelet domain. Our reconstruction minimizes this objective via iterative soft-thresholding, and integrates naturally with iterative self-consistent parallel imaging (SPIRiT). Like many iterative magnetic resonance imaging reconstructions, l₁-SPIRiT's image quality comes at a high computational cost. Excessively long runtimes are a barrier to the clinical use of any reconstruction approach, and thus we discuss our approach to efficiently parallelizing l₁-SPIRiT and to achieving clinically-feasible runtimes. We present parallelizations of l₁-SPIRiT for both multi-GPU systems and multi-core CPUs, and discuss the software optimization and parallelization decisions made in our implementation. The performance of these alternatives depends on the processor architecture, the size of the image matrix, and the number of parallel imaging channels. Fundamentally, achieving fast runtime requires the correct trade-off between cache usage and parallelization overheads. We demonstrate image quality via a case from our clinical experimentation, using a custom 3DFT spoiled gradient echo (SPGR) sequence with up to 8× acceleration via Poisson-disc undersampling in the two phase-encoded directions.
Procacci, Piero
2016-06-27
We present a new release (6.0β) of the ORAC program [Marsili et al. J. Comput. Chem. 2010, 31, 1106-1116] with a hybrid OpenMP/MPI (open multiprocessing message passing interface) multilevel parallelism tailored for generalized ensemble (GE) and fast switching double annihilation (FS-DAM) nonequilibrium technology aimed at evaluating the binding free energy in drug-receptor system on high performance computing platforms. The production of the GE or FS-DAM trajectories is handled using a weak scaling parallel approach on the MPI level only, while a strong scaling force decomposition scheme is implemented for intranode computations with shared memory access at the OpenMP level. The efficiency, simplicity, and inherent parallel nature of the ORAC implementation of the FS-DAM algorithm, project the code as a possible effective tool for a second generation high throughput virtual screening in drug discovery and design. The code, along with documentation, testing, and ancillary tools, is distributed under the provisions of the General Public License and can be freely downloaded at www.chim.unifi.it/orac .
Winters-Hilt, Stephen; Baribault, Carl
2007-01-01
Background Hidden Markov Models (HMMs) provide an excellent means for structure identification and feature extraction on stochastic sequential data. An HMM-with-Duration (HMMwD) is an HMM that can also exactly model the hidden-label length (recurrence) distributions – while the regular HMM will impose a best-fit geometric distribution in its modeling/representation. Results A Novel, Fast, HMM-with-Duration (HMMwD) Implementation is presented, and experimental results are shown that demonstrate its performance on two-state synthetic data designed to model Nanopore Detector Data. The HMMwD experimental results are compared to (i) the ideal model and to (ii) the conventional HMM. Its accuracy is clearly an improvement over the standard HMM, and matches that of the ideal solution in many cases where the standard HMM does not. Computationally, the new HMMwD has all the speed advantages of the conventional (simpler) HMM implementation. In preliminary work shown here, HMM feature extraction is then used to establish the first pattern recognition-informed (PRI) sampling control of a Nanopore Detector Device (on a "live" data-stream). Conclusion The improved accuracy of the new HMMwD implementation, at the same order of computational cost as the standard HMM, is an important augmentation for applications in gene structure identification and channel current analysis, especially PRI sampling control, for example, where speed is essential. The PRI experiment was designed to inherit the high accuracy of the well characterized and distinctive blockades of the DNA hairpin molecules used as controls (or blockade "test-probes"). For this test set, the accuracy inherited is 99.9%. PMID:18047718
NASA Astrophysics Data System (ADS)
Valencia, David; Plaza, Antonio; Vega-Rodríguez, Miguel A.; Pérez, Rosa M.
2005-11-01
Hyperspectral imagery is a class of image data which is used in many scientific areas, most notably, medical imaging and remote sensing. It is characterized by a wealth of spatial and spectral information. Over the last years, many algorithms have been developed with the purpose of finding "spectral endmembers," which are assumed to be pure signatures in remotely sensed hyperspectral data sets. Such pure signatures can then be used to estimate the abundance or concentration of materials in mixed pixels, thus allowing sub-pixel analysis which is crucial in many remote sensing applications due to current sensor optics and configuration. One of the most popular endmember extraction algorithms has been the pixel purity index (PPI), available from Kodak's Research Systems ENVI software package. This algorithm is very time consuming, a fact that has generally prevented its exploitation in valid response times in a wide range of applications, including environmental monitoring, military applications or hazard and threat assessment/tracking (including wildland fire detection, oil spill mapping and chemical and biological standoff detection). Field programmable gate arrays (FPGAs) are hardware components with millions of gates. Their reprogrammability and high computational power makes them particularly attractive in remote sensing applications which require a response in near real-time. In this paper, we present an FPGA design for implementation of PPI algorithm which takes advantage of a recently developed fast PPI (FPPI) algorithm that relies on software-based optimization. The proposed FPGA design represents our first step toward the development of a new reconfigurable system for fast, onboard analysis of remotely sensed hyperspectral imagery.
Burguera, M; Gandía, R; Chorro, F J; García-Civera, R; Ruiz, R; López-Merino, V
1995-07-01
A new method for the analysis of 24-hour heart rate variability (HRV) using complex demodulation (CDM) implemented with the fast Fourier transform (FFT) and its inverse is described. In a control group with palpitations and dizzy spells (n = 30, 47.2 +/- 16.7 years) the relationship between HRV parameters and subject age was investigated. CDM was used to obtain the amplitude and frequency of the low frequency (LF) and high frequency (HF) oscillations for 8 diurnal hours and 4 nocturnal hours. Differences between the two periods were seen in the LF/HF ratio (2.2 +/- 0.6 vs 1.5 +/- 0.6; P < 0.0001), HF amplitudes (12 +/- 6 vs 17 +/- 7 normalized units, P < 0.05), and in the mean frequency of the LF oscillations (0.078 +/- 0.008 vs 0.073 +/- 0.007 Hz, P < 0.01). During the daytime, age was inversely correlated to HF amplitude (r = -0.60), directly correlated to HF mean central frequency (r = 0.40), inversely correlated to LF amplitude (r = -0.55), and likewise inversely correlated to LF mean central frequency (r = -0.74, P < 0.001). At night, age was only inversely correlated to HF amplitude and to LF mean central frequency. Continuous HRV monitoring through CDM implemented with the FFT and its inverse differentiates the periods of diurnal activity and nocturnal rest as an expression of two different activity states of the autonomic nervous system. It allows nonstationary analysis, and separately provides mean and instantaneous oscillation amplitude and frequency. Subject age is not equally related to mean amplitude and frequency of a given oscillation.
2015-06-01
ARL-TR-7315 ● JUNE 2015 US Army Research Laboratory Analysis and Implementation of Particle -to- Particle (P2P) Graphics Processor... Particle -to- Particle (P2P) Graphics Processor Unit (GPU) Kernel for Black-Box Adaptive Fast Multipole Method by Richard H Haney and Dale Shires...
Describes elements for the set of activities to ensure that control strategies are put into effect and that air quality goals and standards are fulfilled, permitting programs, and additional resources related to implementation under the Clean Air Act.
NASA Astrophysics Data System (ADS)
Manohar, Arun; Lanza di Scalea, Francesco
2013-01-01
Delaminations are a common type of defect that occurs in composite structures like wind turbine blades. In this study, a Nondestructive Testing technique based on Fast Lock-In thermography is proposed to detect delaminations present in a 9m CX-100 wind turbine blade. A set of image processing algorithms and Multivariate Outlier Analysis were used in conjunction with the Fast Lock-In thermography technique to counter the 'blind frequency' effects and to improve the defect contrast. Receiver Operating Characteristic curves was used to quantify the gains obtained by using Multivariate Outlier Analysis. Experiments were performed on a set of sixteen defects of various sizes that were incorporated during the construction of the CX-100 wind turbine blade.
NASA Astrophysics Data System (ADS)
Patil, Dinesh; Das, Niva; Routray, Aurobinda
2011-01-01
The main focus of the paper is to bring out the differences in performance related issues of Fast-ICA algorithm associated with floating point and fixed point digital signal processing (DSP) platforms. The DSP platforms consisting of TMS320C6713 floating point processor and TMS320C6416 fixed point processor from Texas Instruments have been chosen for this purpose. To study the consistency of performance, the algorithm has been subjected to three different test cases comprising of a mixture of synthetic signals, a mixture of speech signals and a mixture of synthetic signals in presence of noise, respectively. The performance of the Fast-ICA algorithm on floating point and fixed point platform are compared on the basis of accuracy of separation and execution time. Experimental results show insignificant differences in the accuracy of separation and execution time obtained from fixed point processor when compared with those obtained from floating point processor. This clearly strengthens the feasibility issue concerning hardware realization of Fast-ICA on fixed point platform for specific applications.
Watson, P; Mainegra-Hing, E; Soisson, E; Naqa, I El; Seuntjens, J
2012-07-01
A fast and accurate MC-based scatter correction algorithm was implemented on real cone-beam computed tomography (CBCT) data. An ACR CT accreditation phantom was imaged on a Varian OBI CBCT scanner using the standard-dose head protocol (100 kVp, 151 mAs, partial-angle). A fast Monte Carlo simulation developed in the EGSnrc framework was used to transport photons through the uncorrected CBCT scan. From the simulation output, the contribution from both primary and scattered photons for each projection image was estimated. Using these estimates, a subtractive scatter correction was performed on the CBCT projection data. Implementation of the scatter correction algorithm on real CBCT data was shown to help mitigate scatter-induced artifacts, such as cupping and streaking. The scatter corrected images were also shown to have improved accuracy in reconstructed attenuation coefficient values. In three regions of interest centered on material inserts in the ACR phantom, the reconstructed CT numbers agreed with clinical CT scan data to within 35 Hounsfield units after scatter correction. These results suggest that the proposed scatter correction algorithm is successful in improving image quality in real CBCT images. The accuracy of the attenuation coefficients extracted from the corrected CBCT scan renders the data suitable for adaptive on the fly dose calculations on individual fractions, as well as vastly improved image registration. © 2012 American Association of Physicists in Medicine.
Kemeny, Steven Frank; Clyne, Alisa Morss
2011-04-01
Fiber alignment plays a critical role in the structure and function of cells and tissues. While fiber alignment quantification is important to experimental analysis and several different methods for quantifying fiber alignment exist, many studies focus on qualitative rather than quantitative analysis perhaps due to the complexity of current fiber alignment methods. Speed and sensitivity were compared in edge detection and fast Fourier transform (FFT) for measuring actin fiber alignment in cells exposed to shear stress. While edge detection using matrix multiplication was consistently more sensitive than FFT, image processing time was significantly longer. However, when MATLAB functions were used to implement edge detection, MATLAB's efficient element-by-element calculations and fast filtering techniques reduced computation cost 100 times compared to the matrix multiplication edge detection method. The new computation time was comparable to the FFT method, and MATLAB edge detection produced well-distributed fiber angle distributions that statistically distinguished aligned and unaligned fibers in half as many sample images. When the FFT sensitivity was improved by dividing images into smaller subsections, processing time grew larger than the time required for MATLAB edge detection. Implementation of edge detection in MATLAB is simpler, faster, and more sensitive than FFT for fiber alignment quantification.
NASA Technical Reports Server (NTRS)
Farhat, Nabil H.
1987-01-01
Self-organization and learning is a distinctive feature of neural nets and processors that sets them apart from conventional approaches to signal processing. It leads to self-programmability which alleviates the problem of programming complexity in artificial neural nets. In this paper architectures for partitioning an optoelectronic analog of a neural net into distinct layers with prescribed interconnectivity pattern to enable stochastic learning by simulated annealing in the context of a Boltzmann machine are presented. Stochastic learning is of interest because of its relevance to the role of noise in biological neural nets. Practical considerations and methodologies for appreciably accelerating stochastic learning in such a multilayered net are described. These include the use of parallel optical computing of the global energy of the net, the use of fast nonvolatile programmable spatial light modulators to realize fast plasticity, optical generation of random number arrays, and an adaptive noisy thresholding scheme that also makes stochastic learning more biologically plausible. The findings reported predict optoelectronic chips that can be used in the realization of optical learning machines.
NASA Technical Reports Server (NTRS)
Farhat, Nabil H.
1987-01-01
Self-organization and learning is a distinctive feature of neural nets and processors that sets them apart from conventional approaches to signal processing. It leads to self-programmability which alleviates the problem of programming complexity in artificial neural nets. In this paper architectures for partitioning an optoelectronic analog of a neural net into distinct layers with prescribed interconnectivity pattern to enable stochastic learning by simulated annealing in the context of a Boltzmann machine are presented. Stochastic learning is of interest because of its relevance to the role of noise in biological neural nets. Practical considerations and methodologies for appreciably accelerating stochastic learning in such a multilayered net are described. These include the use of parallel optical computing of the global energy of the net, the use of fast nonvolatile programmable spatial light modulators to realize fast plasticity, optical generation of random number arrays, and an adaptive noisy thresholding scheme that also makes stochastic learning more biologically plausible. The findings reported predict optoelectronic chips that can be used in the realization of optical learning machines.
Farhat, N H
1987-12-01
Self-organization and learning is a distinctive feature of neural nets and processors that sets them apart from conventional approaches to signal processing. It leads to self-programmability which alleviates the problem of programming complexity in artificial neural nets. In this paper architectures for partitioning an optoelectronic analog of a neural net into distinct layers with prescribed interconnectivity pattern to enable stochastic learning by simulated annealing in the context of a Boltzmann machine are presented. Stochastic learning is of interest because of its relevance to the role of noise in biological neural nets. Practical considerations and methodologies for appreciably accelerating stochastic learning in such a multilayered net are described. These include the use of parallel optical computing of the global energy of the net, the use of fast nonvolatile programmable spatial light modulators to realize fast plasticity, optical generation of random number arrays, and an adaptive noisy thresholding scheme that also makes stochastic learning more biologically plausible. The findings reported predict optoelectronic chips that can be used in the realization of optical learning machines.
Huang, Christina Y.; Bassett, Mary T.; Silver, Lynn D.
2010-01-01
Objectives. We assessed consumer awareness of menu calorie information at fast-food chains after the introduction of New York City's health code regulation requiring these chains to display food-item calories on menus and menu boards. Methods. At 45 restaurants representing the 15 largest fast-food chains in the city, we conducted cross-sectional surveys 3 months before and 3 months after enforcement began. At both time points, customers were asked if they had seen calorie information and, if so, whether it had affected their purchase. Data were weighted to the number of city locations for each chain. Results. We collected 1188 surveys pre-enforcement and 1229 surveys postenforcement. Before enforcement, 25% of customers reported seeing calorie information; postenforcement, this figure rose to 64% (P < .001; 38% and 72%, weighted). Among customers who saw calorie information postenforcement, 27% said they used the information, which represents a 2-fold increase in the percentage of customers making calorie-informed choices (10% vs 20%, weighted; P < .001). Conclusions. Posting calorie information on menu boards increases the number of people who see and use this information. Since enforcement of New York's calorie labeling regulation began, approximately 1 million New York adults have seen calorie information each day. PMID:20966367
NASA Technical Reports Server (NTRS)
Habiby, Sarry F.; Collins, Stuart A., Jr.
1987-01-01
The design and implementation of a digital (numerical) optical matrix-vector multiplier are presented. A Hughes liquid crystal light valve, the residue arithmetic representation, and a holographic optical memory are used to construct position coded optical look-up tables. All operations are performed in effectively one light valve response time with a potential for a high information density.
Namba, Alexa; Auchincloss, Amy; Leonberg, Beth L; Wootan, Margo G
2013-06-20
Since 2008, several states and municipalities have implemented regulations requiring provision of nutrition information at chain restaurants to address obesity. Although early research into the effect of such labels on consumer decisions has shown mixed results, little information exists on the restaurant industry's response to labeling. The objective of this exploratory study was to evaluate the effect of menu labeling on fast-food menu offerings over 7 years, from 2005 through 2011. Menus from 5 fast-food chains that had outlets in jurisdictions subject to menu-labeling laws (cases) were compared with menus from 4 fast-food chains operating in jurisdictions not requiring labeling (controls). A trend analysis assessed whether case restaurants improved the healthfulness of their menus relative to the control restaurants. Although the overall prevalence of "healthier" food options remained low, a noteworthy increase was seen after 2008 in locations with menu-labeling laws relative to those without such laws. Healthier food options increased from 13% to 20% at case locations while remaining static at 8% at control locations (test for difference in the trend, P = .02). Since 2005, the average calories for an à la carte entrée remained moderately high (approximately 450 kilocalories), with less than 25% of all entrées and sides qualifying as healthier and no clear systematic differences in the trend between chain restaurants in case versus control areas (P ≥ .50). These findings suggest that menu labeling has thus far not affected the average nutritional content of fast-food menu items, but it may motivate restaurants to increase the availability of healthier options.
Namba, Alexa; Leonberg, Beth L.; Wootan, Margo G.
2013-01-01
Introduction Since 2008, several states and municipalities have implemented regulations requiring provision of nutrition information at chain restaurants to address obesity. Although early research into the effect of such labels on consumer decisions has shown mixed results, little information exists on the restaurant industry’s response to labeling. The objective of this exploratory study was to evaluate the effect of menu labeling on fast-food menu offerings over 7 years, from 2005 through 2011. Methods Menus from 5 fast-food chains that had outlets in jurisdictions subject to menu-labeling laws (cases) were compared with menus from 4 fast-food chains operating in jurisdictions not requiring labeling (controls). A trend analysis assessed whether case restaurants improved the healthfulness of their menus relative to the control restaurants. Results Although the overall prevalence of “healthier” food options remained low, a noteworthy increase was seen after 2008 in locations with menu-labeling laws relative to those without such laws. Healthier food options increased from 13% to 20% at case locations while remaining static at 8% at control locations (test for difference in the trend, P = .02). Since 2005, the average calories for an à la carte entrée remained moderately high (approximately 450 kilocalories), with less than 25% of all entrées and sides qualifying as healthier and no clear systematic differences in the trend between chain restaurants in case versus control areas (P ≥ .50). Conclusion These findings suggest that menu labeling has thus far not affected the average nutritional content of fast-food menu items, but it may motivate restaurants to increase the availability of healthier options. PMID:23786908
Dickson, Bradley M; de Waal, Parker W; Ramjan, Zachary H; Xu, H Eric; Rothbart, Scott B
2016-10-21
In this communication we introduce an efficient implementation of adaptive biasing that greatly improves the speed of free energy computation in molecular dynamics simulations. We investigated the use of accelerated simulations to inform on compound design using a recently reported and clinically relevant inhibitor of the chromatin regulator BRD4 (bromodomain-containing protein 4). Benchmarking on our local compute cluster, our implementation achieves up to 2.5 times more force calls per day than plumed2. Results of five 1 μs-long simulations are presented, which reveal a conformational switch in the BRD4 inhibitor between a binding competent and incompetent state. Stabilization of the switch led to a -3 kcal/mol improvement of absolute binding free energy. These studies suggest an unexplored ligand design principle and offer new actionable hypotheses for medicinal chemistry efforts against this druggable epigenetic target class.
NASA Astrophysics Data System (ADS)
Dickson, Bradley M.; de Waal, Parker W.; Ramjan, Zachary H.; Xu, H. Eric; Rothbart, Scott B.
2016-10-01
In this communication we introduce an efficient implementation of adaptive biasing that greatly improves the speed of free energy computation in molecular dynamics simulations. We investigated the use of accelerated simulations to inform on compound design using a recently reported and clinically relevant inhibitor of the chromatin regulator BRD4 (bromodomain-containing protein 4). Benchmarking on our local compute cluster, our implementation achieves up to 2.5 times more force calls per day than plumed2. Results of five 1 μs-long simulations are presented, which reveal a conformational switch in the BRD4 inhibitor between a binding competent and incompetent state. Stabilization of the switch led to a -3 kcal/mol improvement of absolute binding free energy. These studies suggest an unexplored ligand design principle and offer new actionable hypotheses for medicinal chemistry efforts against this druggable epigenetic target class.
Navarro-Vázquez, Armando; Santamaría-Fernández, Raquel; Sardina, Francisco Javier
2017-09-26
MSpin-JCoupling is a modular program for the prediction of scalar couplings using a large variety of Karplus relationships. The program was specially designed for small molecule analysis and can be run in graphical or command-line mode. The architecture of the program is highly modular and new equations can be rapidly implemented, through a complete C++ programming interface, and deployed as run-time loadable plugins. This article is protected by copyright. All rights reserved.
Lee, Tai-Sung; Hu, Yuan; Sherborne, Brad; Guo, Zhuyan; York, Darrin M
2017-07-11
We report the implementation of the thermodynamic integration method on the pmemd module of the AMBER 16 package on GPUs (pmemdGTI). The pmemdGTI code typically delivers over 2 orders of magnitude of speed-up relative to a single CPU core for the calculation of ligand-protein binding affinities with no statistically significant numerical differences and thus provides a powerful new tool for drug discovery applications.
Ho, T.-S.; Rabitz, H.; Aoiz, F. J.; Banares, L.; Vazquez, S. A.; Harding, L. B.; Chemistry; Princeton Univ.; Univ. Complutense
2003-08-08
A new implementation is presented for the potential energy surface (PES) of the 1{sup 2}A' state of the N({sup 2}D)+H{sub 2} system based on a set of 2715 ab initio points resulting from the multireference configuration interaction (MRCI) calculations. The implementation is carried out using the reproducing Kernel Hilbert Space interpolation method. Range parameters, via bond-order-like coordinates, are properly chosen to render a sufficiently short-range three-body interaction and a regularization procedure is invoked to yield a globally smooth PES. A fast algorithm, with the help of low-order spline reproducing kernels, is implemented for the computation of the PES and, particularly, its gradients, whose fast evaluation is essential for large scale quasi-classical trajectory calculations. It is found that the new PES can be evaluated more than ten times faster than that of an existing (old) PES based on a smaller number (1141) of data points resulting from the same MRCI calculations and a similar interpolation procedure. Although there is a general good correspondence between the two surfaces, the new PES is in much better agreement with the ab initio calculations, especially in key stationary point regions including the C{sub 2v} minimum, the C{sub 2v} transition state, and the N-H-H linear barrier. Moreover, the new PES is free of spurious small scale features. Analytic gradients are made available in the new PES code to further facilitate quasiclassical trajectory calculations, which have been performed and compared with the results based on the old surface.
Guerra, Nancy G; Knox, Lyndee
2008-06-01
We consider how culture impacts the translation of research into practice, focusing on the culture of the client and the culture of the agency implementing selected programs. We build on lessons learned from a pilot study of an evidence-based family-school partnership, Families and Schools Together (FAST), to prevent youth violence with low-income, immigrant Latino families in Southern California. We examine the impact of cultural characteristics on the translation of this innovation into practice at the community level, relying on an interactive systems framework developed recently by Wandersman and colleagues (2008, American Journal of Community Psychology, 41(3-4), in press) discussed in this issue. As we point out, the culture of the client and the culture of the agency can facilitate or impede connections within and across these interactive systems.
NASA Technical Reports Server (NTRS)
Saracino, G.; Greenberg, N. L.; Shiota, T.; Corsi, C.; Lamberti, C.; Thomas, J. D.
2002-01-01
Real-time three-dimensional echocardiography (RT3DE) is an innovative cardiac imaging modality. However, partly due to lack of user-friendly software, RT3DE has not been widely accepted as a clinical tool. The object of this study was to develop and implement a fast and interactive volume renderer of RT3DE datasets designed for a clinical environment where speed and simplicity are not secondary to accuracy. Thirty-six patients (20 regurgitation, 8 normal, 8 cardiomyopathy) were imaged using RT3DE. Using our newly developed software, all 3D data sets were rendered in real-time throughout the cardiac cycle and assessment of cardiac function and pathology was performed for each case. The real-time interactive volume visualization system is user friendly and instantly provides consistent and reliable 3D images without expensive workstations or dedicated hardware. We believe that this novel tool can be used clinically for dynamic visualization of cardiac anatomy.
NASA Technical Reports Server (NTRS)
Saracino, G.; Greenberg, N. L.; Shiota, T.; Corsi, C.; Lamberti, C.; Thomas, J. D.
2002-01-01
Real-time three-dimensional echocardiography (RT3DE) is an innovative cardiac imaging modality. However, partly due to lack of user-friendly software, RT3DE has not been widely accepted as a clinical tool. The object of this study was to develop and implement a fast and interactive volume renderer of RT3DE datasets designed for a clinical environment where speed and simplicity are not secondary to accuracy. Thirty-six patients (20 regurgitation, 8 normal, 8 cardiomyopathy) were imaged using RT3DE. Using our newly developed software, all 3D data sets were rendered in real-time throughout the cardiac cycle and assessment of cardiac function and pathology was performed for each case. The real-time interactive volume visualization system is user friendly and instantly provides consistent and reliable 3D images without expensive workstations or dedicated hardware. We believe that this novel tool can be used clinically for dynamic visualization of cardiac anatomy.
Bierman, K L
1997-08-01
Childhood conduct problems are predictive of a number of serious long-term difficulties (e.g., school failure, delinquent behavior, and mental health problems), making the design of effective prevention programs a priority. The Fast Track Program is a demonstration project currently underway in four demographically diverse areas of the United States, testing the feasibility and effectiveness of a comprehensive, multicomponent prevention program targeting children at risk for conduct disorders. This paper describes some lessons learned about the implementation of this program in a rural area. Although there are many areas of commonality in terms of program needs, program design, and implementation issues in rural and urban sites, rural areas differ from urban areas along the dimensions of geographical dispersion and regionalism, and community stability and insularity. Rural programs must cover a broad geographical area and must be sensitive to the multiple, small and regional communities that constitute their service area. Small schools, homogeneous populations, traditional values, limited recreational, educational and mental health services, and politically conservative climates are all more likely to emerge as characteristics of rural rather than urban sites (Sherman, 1992). These characteristics may both pose particular challenges to the implementation of prevention programs in rural areas, as well as offer particular benefits. Three aspects of program implementation are described in detail: (a) community entry and program initiation in rural areas, (b) the adaptation of program components and service delivery to meet the needs of rural families and schools, and (c) issues in administrative organization of a broadly dispersed tricounty rural prevention program.
Grey Ballard, Austin Benson
2014-11-26
This software provides implementations of fast matrix multiplication algorithms. These algorithms perform fewer floating point operations than the classical cubic algorithm. The software uses code generation to automatically implement the fast algorithms based on high-level descriptions. The code serves two general purposes. The first is to demonstrate that these fast algorithms can out-perform vendor matrix multiplication algorithms for modest problem sizes on a single machine. The second is to rapidly prototype many variations of fast matrix multiplication algorithms to encourage future research in this area. The implementations target sequential and shared memory parallel execution.
AbdelWareth, Laila O; Pallinalakam, Fasila; Ibrahim, Faisal; Anderson, Peter; Liaqat, Muneezeh; Palmer, Bryson; Harris, Jonathan; Bashir, Saber; Alatoom, Adnan; Algora, Manuel; Alduaij, Ahmad; Mirza, Imran
2017-08-31
- This review examines challenges and opportunities in preparing laboratories in a startup phase for accreditation by both College of American Pathologists (CAP) and International Organization for Standardization (ISO) 15189 in an international setting as it relates to our experience at Cleveland Clinic Abu Dhabi Laboratory. It also discusses some of the strategies used in executing those projects and the added advantages in perusing both types of accreditations. - To share our experience with CAP and ISO 15189 accreditations in a startup international operation in relation to the challenges encountered and implementation strategy success factors. - MEDLINE (PubMed) database was used to review this topic as well as peer-reviewed articles and World Health Organization publications on the topic. - Accreditation is a perfect means toward building quality medical laboratories in a diverse workforce environment and improving patient safety. Further, it establishes a strong foundation on which any new operation can build a sustainable quality improvement culture. Accreditations by CAP and/or ISO are among the most reputable and well-established accreditation systems that clinical laboratories could aim for. As a result of both accreditations offering synergistic and complementing features, we recommend that any laboratory seeking excellence in quality and performance should consider exploring both. Key elements to success include having dedicated project management and change management support while preparing for accreditation. Laboratories seeking accreditation in early operational stages may face a number of challenges; however, significant opportunities will also be present to optimize various operational components from the beginning.
O'Brien, Travis A.; Kashinath, Karthik
2015-05-22
This software implements the fast, self-consistent probability density estimation described by O'Brien et al. (2014, doi: ). It uses a non-uniform fast Fourier transform technique to reduce the computational cost of an objective and self-consistent kernel density estimation method.
ERIC Educational Resources Information Center
Korn, Abe
1994-01-01
Presents an activity that enables students to answer for themselves the question of how fast a body must travel before the nonrelativistic expression must be replaced with the correct relativistic expression by deciding on the accuracy required in describing the kinetic energy of a body. (ZWH)
Davies, R. J.; Ewings, P.; Welbourn, R.; Collins, C.; Kennedy, R.; Royle, C.
2002-01-01
OBJECTIVE: This prospective study assesses the introduction of a fast-track referral system for patients with suspected colorectal cancer. PATIENTS AND METHODS: The referral system was initiated in Yeovil District Hospital and Taunton and Somerset Hospital using six screening criteria to select high-risk patients. Data on all high-risk patients from 1 November 1999 to 30 April 2000 was recorded prospectively. Patients with proven colorectal cancer diagnosed between 1 November 1998 and 30 April 1999 have been identified for comparison. RESULTS: There were 158 new cases of colorectal cancer in total (111 elective, 47 emergency). 59 cases of colorectal cancer were diagnosed from 433 fast-track referrals (53% of total elective cases). Median time from referral to diagnosis in the fast-track group was 11 days vs. 32.5 days for nonfast-track elective patients (P < 0.001). Median time from referral to diagnosis for all elective cases was 17 days vs. 38.5 days for patients presenting one year earlier (P < 0.001). 75% of fast-track patients were diagnosed with colorectal cancer within two weeks, compared with 17% of nonfast-track elective patients (P < 0.001). The proportion of emergency admissions was reduced from 40% to 30% (P=0.07) following the introduction of this system. CONCLUSION: Data from the first six months reveal that over half of the elective cases of colorectal cancer were diagnosed within the fast-track system. The median time from referral to diagnosis in these patients was within two weeks and there has been a significant reduction in the time to diagnosis associated with the introduction of this service.
TNAMD: Implementation of TIGER2 in NAMD
NASA Astrophysics Data System (ADS)
Menz, William J.; Penna, Matthew J.; Biggs, Mark J.
2010-12-01
Replica-exchange molecular dynamics (REMD) must be used to enhance sampling when there are significant (relative to kT) barriers between different parts of the phase space. TIGER2 is a next-generation REMD method that offers more efficient sampling compared to the original REMD method by reducing the number of replicas required to span a given temperature range. In this paper, we present an implementation of the TIGER2 algorithm in the NAMD software package. This implementation exploits the capacity of NAMD to interpret Tcl scripts. The Tcl script implementing TIGER2 is provided and explained in detail, and demonstrated for alanine dipeptide in water. Program summaryProgram title: TNAMD Catalogue identifier: AEHH_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHH_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 24 837 No. of bytes in distributed program, including test data, etc.: 610 107 Distribution format: tar.gz Programming language: Tcl 8.5 Computer: Clusters, workstations. Tested on Intel Clovertown, Atom. Operating system: Linux, Windows (with Linux shell) Has the code been vectorised or parallelised?: Yes. Parallelised with MPI Classification: 3 External routines: NAMD 2.6 ( http://www.ks.uiuc.edu/Research/namd/) Nature of problem: Replica-exchange molecular dynamics. Solution method: Replicas are assigned to unique processes, and pass through a series of cycles of heating, equilibration, quenching and sampling; after which temperatures are swapped between replicas. Running time: The test run can take up to twenty minutes.
NASA Astrophysics Data System (ADS)
Esposito, S.; Pisanti, O.
The following sections are included: * Elementary Considerations * The Integral Equation to the Neutron Distribution * The Critical Size for a Fast Reactor * Supercritical Reactors * Problems and Exercises
Dutta, Abhijit; Schaidle, Joshua A.; Humbird, David; Baddour, Frederick G.; Sahir, Asad
2015-10-06
Ex situ catalytic fast pyrolysis of biomass is a promising route for the production of fungible liquid biofuels. There is significant ongoing research on the design and development of catalysts for this process. However, there are a limited number of studies investigating process configurations and their effects on biorefinery economics. Herein we present a conceptual process design with techno-economic assessment; it includes the production of upgraded bio-oil via fixed bed ex situ catalytic fast pyrolysis followed by final hydroprocessing to hydrocarbon fuel blendstocks. This study builds upon previous work using fluidized bed systems, as detailed in a recent design report led by the National Renewable Energy Laboratory (NREL/TP-5100-62455); overall yields are assumed to be similar, and are based on enabling future feasibility. Assuming similar yields provides a basis for easy comparison and for studying the impacts of areas of focus in this study, namely, fixed bed reactor configurations and their catalyst development requirements, and the impacts of an inline hot gas filter. A comparison with the fluidized bed system shows that there is potential for higher capital costs and lower catalyst costs in the fixed bed system, leading to comparable overall costs. The key catalyst requirement is to enable the effective transformation of highly oxygenated biomass into hydrocarbons products with properties suitable for blending into current fuels. Potential catalyst materials are discussed, along with their suitability for deoxygenation, hydrogenation and C–C coupling chemistry. This chemistry is necessary during pyrolysis vapor upgrading for improved bio-oil quality, which enables efficient downstream hydroprocessing; C–C coupling helps increase the proportion of diesel/jet fuel range product. One potential benefit of fixed bed upgrading over fluidized bed upgrading is catalyst flexibility, providing greater control over chemistry and product composition. Since this
Dutta, Abhijit; Schaidle, Joshua A.; Humbird, David; ...
2015-10-06
Ex situ catalytic fast pyrolysis of biomass is a promising route for the production of fungible liquid biofuels. There is significant ongoing research on the design and development of catalysts for this process. However, there are a limited number of studies investigating process configurations and their effects on biorefinery economics. Herein we present a conceptual process design with techno-economic assessment; it includes the production of upgraded bio-oil via fixed bed ex situ catalytic fast pyrolysis followed by final hydroprocessing to hydrocarbon fuel blendstocks. This study builds upon previous work using fluidized bed systems, as detailed in a recent design reportmore » led by the National Renewable Energy Laboratory (NREL/TP-5100-62455); overall yields are assumed to be similar, and are based on enabling future feasibility. Assuming similar yields provides a basis for easy comparison and for studying the impacts of areas of focus in this study, namely, fixed bed reactor configurations and their catalyst development requirements, and the impacts of an inline hot gas filter. A comparison with the fluidized bed system shows that there is potential for higher capital costs and lower catalyst costs in the fixed bed system, leading to comparable overall costs. The key catalyst requirement is to enable the effective transformation of highly oxygenated biomass into hydrocarbons products with properties suitable for blending into current fuels. Potential catalyst materials are discussed, along with their suitability for deoxygenation, hydrogenation and C–C coupling chemistry. This chemistry is necessary during pyrolysis vapor upgrading for improved bio-oil quality, which enables efficient downstream hydroprocessing; C–C coupling helps increase the proportion of diesel/jet fuel range product. One potential benefit of fixed bed upgrading over fluidized bed upgrading is catalyst flexibility, providing greater control over chemistry and product composition
NASA Astrophysics Data System (ADS)
Hoffman, John; VanderPlas, Jake; Hartman, Joel; Bakos, Gáspár
2017-09-01
This proceedings contribution presents a novel, non-linear extension to the Lomb-Scargle periodogram that allows periodograms to be generated for arbitrary signal shapes. Such periodograms are already known as "template periodograms" or "periodic matched filters," but current implementations are computationally inefficient. The "fast template periodogram" presented here improves existing techniques by a factor of ˜a few for small test cases (O(10) observations), and over three orders of magnitude for lightcurves containing O(104) observations. The fast template periodogram scales asymptotically as O(HNf log HNf + H4Nf), where H denotes the number of harmonics required to adequately approximate the template and Nf is the number of trial frequencies. Existing implementations scale as O(NobsNf), where Nobs is the number of observations in the lightcurve. An open source Python implementation is available on GitHub.
NASA Astrophysics Data System (ADS)
Sellitto, P.; Dufour, G.; Eremenko, M.; Cuesta, J.; Peuch, V.-H.; Eldering, A.; Edwards, D. P.; Flaud, J.-M.
2013-03-01
Practical implementations of chemical OSSEs (Observing System Simulation Experiments) usually rely on approximations of the pseudo-observations by means of a prior parametrization of the averaging kernels, which describe the sensitivity of the observing systems to the target atmospheric species. This is intended to avoid the need for use of a computationally expensive pseudo-observations simulator that relies on full radiative transfer calculations. Here we present an investigation on how no, or limited, scene dependent averaging kernels parametrizations may misrepresent the sensitivity of an observing system, and thus possibly lead to inaccurate results of OSSEs. We carried out the full radiative transfer calculation for a three-days period over Europe, to produce reference pseudo-observations of lower tropospheric ozone, as they would be observed by a concept geostationary observing system called MAGEAQ (Monitoring the Atmosphere from Geostationary orbit for European Air Quality). The selected spatiotemporal interval is characterized by a peculiar ozone pollution event. We then compared our reference with approximated pseudo-observations, following existing simulation exercises made for both the MAGEAQ and GEOstationary Coastal and Air Pollution Events (GEO-CAPE) missions. We found that approximated averaging kernels may fail to replicate the variability of the full radiative transfer calculations. Then, we compared the full radiative transfer and the approximated pseudo-observations during a pollution event. We found that the approximations substantially overestimate the capability of the MAGEAQ to follow the spatiotemporal variations of the lower tropospheric ozone in selected areas. We conclude that such approximations may lead to false conclusions if used in an OSSE. Thus, we recommend to use comprehensive scene-dependent approximations of the averaging kernels, in cases where the full radiative transfer is computationally too costly for the OSSE being
NASA Astrophysics Data System (ADS)
Sellitto, P.; Dufour, G.; Eremenko, M.; Cuesta, J.; Peuch, V.-H.; Eldering, A.; Edwards, D. P.; Flaud, J.-M.
2013-08-01
Practical implementations of chemical OSSEs (Observing System Simulation Experiments) usually rely on approximations of the pseudo-observations by means of a predefined parametrization of the averaging kernels, which describe the sensitivity of the observing system to the target atmospheric species. This is intended to avoid the use of a computationally expensive pseudo-observations simulator, that relies on full radiative transfer calculations. Here we present an investigation on how no, or limited, scene dependent averaging kernels parametrizations may misrepresent the sensitivity of an observing system. We carried out the full radiative transfer calculation for a three-days period over Europe, to produce reference pseudo-observations of lower tropospheric ozone, as they would be observed by a concept geostationary observing system called MAGEAQ (Monitoring the Atmosphere from Geostationary orbit for European Air Quality). The selected spatio-temporal interval is characterised by an ozone pollution event. We then compared our reference with approximated pseudo-observations, following existing simulation exercises made for both the MAGEAQ and GEOstationary Coastal and Air Pollution Events (GEO-CAPE) missions. We found that approximated averaging kernels may fail to replicate the variability of the full radiative transfer calculations. In addition, we found that the approximations substantially overestimate the capability of MAGEAQ to follow the spatio-temporal variations of the lower tropospheric ozone in selected areas, during the mentioned pollution event. We conclude that such approximations may lead to false conclusions if used in an OSSE. Thus, we recommend to use comprehensive scene-dependent approximations of the averaging kernels, in cases where the full radiative transfer is computationally too costly for the OSSE being investigated.
Li, Shengtai; Li, Hui
2012-06-14
We develop a 3D simulation code for interaction between the proto-planetary disk and embedded proto-planets. The protoplanetary disk is treated as a three-dimensional (3D), self-gravitating gas whose motion is described by the locally isothermal Navier-Stokes equations in a spherical coordinate centered on the star. The differential equations for the disk are similar to those given in Kley et al. (2009) with a different gravitational potential that is defined in Nelson et al. (2000). The equations are solved by directional split Godunov method for the inviscid Euler equations plus operator-split method for the viscous source terms. We use a sub-cycling technique for the azimuthal sweep to alleviate the time step restriction. We also extend the FARGO scheme of Masset (2000) and modified in Li et al. (2001) to our 3D code to accelerate the transport in the azimuthal direction. Furthermore, we have implemented a reduced 2D (r, {theta}) and a fully 3D self-gravity solver on our uniform disk grid, which extends our 2D method (Li, Buoni, & Li 2008) to 3D. This solver uses a mode cut-off strategy and combines FFT in the azimuthal direction and direct summation in the radial and meridional direction. An initial axis-symmetric equilibrium disk is generated via iteration between the disk density profile and the 2D disk-self-gravity. We do not need any softening in the disk self-gravity calculation as we have used a shifted grid method (Li et al. 2008) to calculate the potential. The motion of the planet is limited on the mid-plane and the equations are the same as given in D'Angelo et al. (2005), which we adapted to the polar coordinates with a fourth-order Runge-Kutta solver. The disk gravitational force on the planet is assumed to evolve linearly with time between two hydrodynamics time steps. The Planetary potential acting on the disk is calculated accurately with a small softening given by a cubic-spline form (Kley et al. 2009). Since the torque is extremely sensitive to
Van Dyke, William J.
1992-01-01
A fast valve is disclosed that can close on the order of 7 milliseconds. It is closed by the force of a compressed air spring with the moving parts of the valve designed to be of very light weight and the valve gate being of wedge shaped with O-ring sealed faces to provide sealing contact without metal to metal contact. The combination of the O-ring seal and an air cushion create a soft final movement of the valve closure to prevent the fast air acting valve from having a harsh closing.
Van Dyke, W.J.
1992-04-07
A fast valve is disclosed that can close on the order of 7 milliseconds. It is closed by the force of a compressed air spring with the moving parts of the valve designed to be of very light weight and the valve gate being of wedge shaped with O-ring sealed faces to provide sealing contact without metal to metal contact. The combination of the O-ring seal and an air cushion create a soft final movement of the valve closure to prevent the fast air acting valve from having a harsh closing. 4 figs.
ERIC Educational Resources Information Center
Essexville-Hampton Public Schools, MI.
Described are components of Project FAST (Functional Analysis Systems Training) a nationally validated project to provide more effective educational and support services to learning disordered children and their regular elementary classroom teachers. The program is seen to be based on a series of modules of delivery systems ranging from mainstream…
2009-10-01
or any other computing topic, please visit our Digital Library at www.computer.org/publications/ dlib . NGUYEN: FAST CRCS 1331 Authorized licensed use... Library at http://doi.ieeecomputersociety.org/10.1109/ TC.2009.83. The notation ðk; l; dÞ denotes a systematic code with k ¼ the total bit length of
NASA Astrophysics Data System (ADS)
Ginnebaugh, D.; Liang, J.; Jacobson, M. Z.
2007-12-01
The study of urban, regional, and global air pollution requires the accurate and fast simulation of atmospheric chemistry, particularly for determining the composition of gases that condense to particulate matter. To date, atmospheric models that have solved chemistry in 3-D have been constrained by computer time, requiring chemical mechanisms used within them to be condensed. When chemicals are grouped within the mechanism, though, individual characteristics and accuracy are often lost. Here, the near-explicit Master Chemical Mechanism (MCM, version 3.1, LEEDS University) is implemented into the SMVGEAR II chemical ordinary differential solver to provide the speed necessary to simulate explicit chemistry in three dimensions. The MCM has over 13,500 organic reactions and 4,600 species. SMVGEAR II is a sparse-matrix vectorized Gear solver that reduces the computation time significantly while maintaining any specified accuracy. The near-explicit mechanism allows species to maintain their individual characteristics and improves the modeling of organic and inorganic chemicals in the atmosphere. This is important for simulating the gas-to-particle conversion of explicit chemicals. The model is used to compare the MCM treatment of alkene and aromatic chemistry with smog chamber data and another chemical mechanism. A test case for the air-pollution impacts of the tailpipe emissions from E85 is also performed. Potential impacts of ethanol are increasingly relevant today because of the increased use of ethanol in transportation fuels. The air pollution impacts of all fuels should be investigated before they are used widely.
Efficient Computer Implementations of Fast Fourier Transforms.
1980-12-01
TRANSFORMS, THESIS Presented to the Faculty of the School of Engineering of the Air Force Institute of Technology Air University in Partial Fulfillment of...The Algorithm * of S. Winograd", NASA, Jet Propulsion Lab, California Ins.titute of Technology , Pasadena, CA, 15 February 79 (AS N79-19733). 1 ’ 192...M. :- E. ,._T-. OF THE A ’rY TO B E TRANFO:-:F ’. :3:’ -:f1 .QT E:-7T TE:-T FLAG3=1 IF PE :-L TRAN’-FORM :34"(1 TEST FLAG = IF IF ,OMLE. TRA;:FORM 7 T
LIDIA, S.M.; LUND, S.M.; SEIDL, P.A.
2010-01-04
This milestone has been accomplished. The Heavy Ion Fusion Science Virtual National Laboratory has completed simulations of a fast correction scheme to compensate for chromatic and time-dependent defocusing effects in the transport of ion beams to the target plane in the NDCX-1 facility. Physics specifications for implementation in NDCX-1 and NDCX-2 have been established. This milestone has been accomplished. The Heavy Ion Fusion Science Virtual National Laboratory has completed simulations of a fast correction scheme to compensate for chromatic and time-dependent defocusing effects in the transport of ion beams to the target plane in the NDCX-1 facility. Physics specifications for implementation in NDCX-1 and NDCX-2 have been established. Focal spot differences at the target plane between the compressed and uncompressed regions of the beam pulse have been modeled and measured on NDCX-1. Time-dependent focusing and energy sweep from the induction bunching module are seen to increase the compressed pulse spot size at the target plane by factors of two or more, with corresponding scaled reduction in the peak intensity and fluence on target. A time-varying beam envelope correction lens has been suggested to remove the time-varying aberration. An Einzel (axisymmetric electric) lens system has been analyzed and optimized for general transport lines, and as a candidate correction element for NDCX-1. Attainable high-voltage holdoff and temporal variations of the lens driving waveform are seen to effect significant changes on the beam envelope angle over the duration of interest, thus confirming the utility of such an element on NDCX-1. Modeling of the beam dynamics in NDCX-1 was performed using a time-dependent (slice) envelope code and with the 3-D, self-consistent, particle-in-cell code WARP. Proof of concept was established with the slice envelope model such that the spread in beam waist positions relative to the target plane can be minimized with a carefully designed
NASA Technical Reports Server (NTRS)
Bishop, Matt
1988-01-01
The organization of some tools to help improve passwork security at a UNIX-based site is described along with how to install and use them. These tools and their associated library enable a site to force users to pick reasonably safe passwords (safe being site configurable) and to enable site management to try to crack existing passworks. The library contains various versions of a very fast implementation of the Data Encryption Standard and of the one-way encryption functions used to encryp the password.
MontePython: Implementing Quantum Monte Carlo using Python
NASA Astrophysics Data System (ADS)
Nilsen, Jon Kristian
2007-11-01
We present a cross-language C++/Python program for simulations of quantum mechanical systems with the use of Quantum Monte Carlo (QMC) methods. We describe a system for which to apply QMC, the algorithms of variational Monte Carlo and diffusion Monte Carlo and we describe how to implement theses methods in pure C++ and C++/Python. Furthermore we check the efficiency of the implementations in serial and parallel cases to show that the overhead using Python can be negligible. Program summaryProgram title: MontePython Catalogue identifier: ADZP_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADZP_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 49 519 No. of bytes in distributed program, including test data, etc.: 114 484 Distribution format: tar.gz Programming language: C++, Python Computer: PC, IBM RS6000/320, HP, ALPHA Operating system: LINUX Has the code been vectorised or parallelized?: Yes, parallelized with MPI Number of processors used: 1-96 RAM: Depends on physical system to be simulated Classification: 7.6; 16.1 Nature of problem: Investigating ab initio quantum mechanical systems, specifically Bose-Einstein condensation in dilute gases of 87Rb Solution method: Quantum Monte Carlo Running time: 225 min with 20 particles (with 4800 walkers moved in 1750 time steps) on 1 AMD Opteron TM Processor 2218 processor; Production run for, e.g., 200 particles takes around 24 hours on 32 such processors.
Fast, efficient lossless data compression
NASA Technical Reports Server (NTRS)
Ross, Douglas
1991-01-01
This paper presents lossless data compression and decompression algorithms which can be easily implemented in software. The algorithms can be partitioned into their fundamental parts which can be implemented at various stages within a data acquisition system. This allows for efficient integration of these functions into systems at the stage where they are most applicable. The algorithms were coded in Forth to run on a Silicon Composers Single Board Computer (SBC) using the Harris RTX2000 Forth processor. The algorithms require very few system resources and operate very fast. The performance of the algorithms with the RTX enables real time data compression and decompression to be implemented for a wide range of applications.
Fast, efficient lossless data compression
NASA Technical Reports Server (NTRS)
Ross, Douglas
1991-01-01
This paper presents lossless data compression and decompression algorithms which can be easily implemented in software. The algorithms can be partitioned into their fundamental parts which can be implemented at various stages within a data acquisition system. This allows for efficient integration of these functions into systems at the stage where they are most applicable. The algorithms were coded in Forth to run on a Silicon Composers Single Board Computer (SBC) using the Harris RTX2000 Forth processor. The algorithms require very few system resources and operate very fast. The performance of the algorithms with the RTX enables real time data compression and decompression to be implemented for a wide range of applications.
Fasting in paediatric ambulatory surgery.
Klemetti, Seija; Suominen, Tarja
2008-02-01
The purpose of this descriptive study was to examine how preoperative fasting and postoperative termination of the fast was experienced in ambulatory surgery by child patients and their mothers. The target group consisted of children (n = 12, age 2-10 years) who had undergone tonsillectomy/adenoidectomy, and their mothers. In the interviews, the mothers were asked to describe the problems connected with their child's preoperative fast and postoperative termination of the fast, as well as the things that went well in the process. Content analysis was carried out inductively. Preoperatively, the children were thirsty and anxious, but understood the fasting situation well. In some cases, there were conflicts between the child and his/her parent if fasting was prolonged. Parents also had doubts about their ability to implement the child's fast. Postoperatively, children had pains in their throats and stomachs, suffered from nausea, and had difficulty taking in nutrition and medication. Parents had worries about their child's home care, such as food intake and administration of pain medication. The possibility of postoperative bleeding and exacerbation of the child's condition was also worrying for the parents. The most evident result of the study was that parents need more information before their child's operation. Preparing the child for the operation by giving him/her nutrition as long as permitted enhances postoperative recovery and improves parents' control over the ambulatory surgical experience. Nurses should take a more active part in children's perioperative fasting and preoperative preparation of children and their parents. In further research, experimental studies should be designed in order to receive more evidence-based information for clinical practice.
FAST: FAST Analysis of Sequences Toolbox
Lawrence, Travis J.; Kauffman, Kyle T.; Amrine, Katherine C. H.; Carper, Dana L.; Lee, Raymond S.; Becich, Peter J.; Canales, Claudia J.; Ardell, David H.
2015-01-01
FAST (FAST Analysis of Sequences Toolbox) provides simple, powerful open source command-line tools to filter, transform, annotate and analyze biological sequence data. Modeled after the GNU (GNU's Not Unix) Textutils such as grep, cut, and tr, FAST tools such as fasgrep, fascut, and fastr make it easy to rapidly prototype expressive bioinformatic workflows in a compact and generic command vocabulary. Compact combinatorial encoding of data workflows with FAST commands can simplify the documentation and reproducibility of bioinformatic protocols, supporting better transparency in biological data science. Interface self-consistency and conformity with conventions of GNU, Matlab, Perl, BioPerl, R, and GenBank help make FAST easy and rewarding to learn. FAST automates numerical, taxonomic, and text-based sorting, selection and transformation of sequence records and alignment sites based on content, index ranges, descriptive tags, annotated features, and in-line calculated analytics, including composition and codon usage. Automated content- and feature-based extraction of sites and support for molecular population genetic statistics make FAST useful for molecular evolutionary analysis. FAST is portable, easy to install and secure thanks to the relative maturity of its Perl and BioPerl foundations, with stable releases posted to CPAN. Development as well as a publicly accessible Cookbook and Wiki are available on the FAST GitHub repository at https://github.com/tlawrence3/FAST. The default data exchange format in FAST is Multi-FastA (specifically, a restriction of BioPerl FastA format). Sanger and Illumina 1.8+ FastQ formatted files are also supported. FAST makes it easier for non-programmer biologists to interactively investigate and control biological data at the speed of thought. PMID:26042145
Fast algorithms for free-space diffraction patterns calculation
NASA Astrophysics Data System (ADS)
Mas, David; Garcia, Javier; Ferreira, Carlos; Bernardo, Luis M.; Marinho, Francisco
1999-06-01
Here we present a fast algorithm for Fresnel integral calculation. Some fast algorithms using the fast Fourier transform are analysed and their performance has been checked. These methods are of easy implementation, but are only valid for a specific range of distances. Fast algorithms based on the Fractional Fourier transform allow accurate evaluation of the Fresnel integral from object to Fraunhofer domain in a single step.
Very fast approximate reconstruction of MR images.
Angelidis, P A
1998-11-01
The ultra fast Fourier transform (UFFT) provides the means for a very fast computation of a magnetic resonance (MR) image, because it is implemented using only additions and no multiplications at all. It achieves this by approximating the complex exponential functions involved in the Fourier transform (FT) sum with computationally simpler periodic functions. This approximation introduces erroneous spectrum peaks of small magnitude. We examine the performance of this transform in some typical MRI signals. The results show that this transform can very quickly provide an MR image. It is proposed to be used as a replacement of the classically used FFT whenever a fast general overview of an image is required.
Enhanced Model for Fast Ignition
Mason, Rodney J.
2010-10-12
Laser Fusion is a prime candidate for alternate energy production, capable of serving a major portion of the nation's energy needs, once fusion fuel can be readily ignited. Fast Ignition may well speed achievement of this goal, by reducing net demands on laser pulse energy and timing precision. However, Fast Ignition has presented a major challenge to modeling. This project has enhanced the computer code ePLAS for the simulation of the many specialized phenomena, which arise with Fast Ignition. The improved code has helped researchers to understand better the consequences of laser absorption, energy transport, and laser target hydrodynamics. ePLAS uses efficient implicit methods to acquire solutions for the electromagnetic fields that govern the accelerations of electrons and ions in targets. In many cases, the code implements fluid modeling for these components. These combined features, "implicitness and fluid modeling," can greatly facilitate calculations, permitting the rapid scoping and evaluation of experiments. ePLAS can be used on PCs, Macs and Linux machines, providing researchers and students with rapid results. This project has improved the treatment of electromagnetics, hydrodynamics, and atomic physics in the code. It has simplified output graphics, and provided new input that avoids the need for source code access by users. The improved code can now aid university, business and national laboratory users in pursuit of an early path to success with Fast Ignition.
... this page: //medlineplus.gov/ency/article/003766.htm Acid-fast stain To use the sharing features on this page, please enable JavaScript. The acid-fast stain is a laboratory test that determines ...
Fast foods are quick, reasonably priced, and readily available alternatives to home cooking. While convenient and economical for a busy lifestyle, fast foods are typically high in calories, fat, saturated ...
Fernández-Carrión, E; Ivorra, B; Martínez-López, B; Ramos, A M; Sánchez-Vizcaíno, J M
2016-04-01
Be-FAST is a computer program based on a time-spatial stochastic spread mathematical model for studying the transmission of infectious livestock diseases within and between farms. The present work describes a new module integrated into Be-FAST to model the economic consequences of the spreading of classical swine fever (CSF) and other infectious livestock diseases within and between farms. CSF is financially one of the most damaging diseases in the swine industry worldwide. Specifically in Spain, the economic costs in the two last CSF epidemics (1997 and 2001) reached jointly more than 108 million euros. The present analysis suggests that severe CSF epidemics are associated with significant economic costs, approximately 80% of which are related to animal culling. Direct costs associated with control measures are strongly associated with the number of infected farms, while indirect costs are more strongly associated with epidemic duration. The economic model has been validated with economic information around the last outbreaks in Spain. These results suggest that our economic module may be useful for analysing and predicting economic consequences of livestock disease epidemics. Copyright © 2016 Elsevier B.V. All rights reserved.
NASA Technical Reports Server (NTRS)
Steele, G. L., Jr.
1977-01-01
MacLISP provides a compiler which produces numerical code competitive in speed with some FORTRAN implementations and yet compatible with the rest of the MacLISP system. All numerical programs can be run under the MacLISP interpreter. Additional declarations to the compiler specify type information which allows the generation of optimized numerical code which generally does not require the garbage collection of temporary numerical results. Array accesses are almost as fast as in FORTRAN, and permit the use of dynamically allocated arrays of varying dimensions. The implementation decisions regarding user interface, data representations, and interfacing conventions are discussed which allow the generation of fast numerical LISP code.
Garber, Andrea K; Lustig, Robert H
2011-09-01
Studies of food addiction have focused on highly palatable foods. While fast food falls squarely into that category, it has several other attributes that may increase its salience. This review examines whether the nutrients present in fast food, the characteristics of fast food consumers or the presentation and packaging of fast food may encourage substance dependence, as defined by the American Psychiatric Association. The majority of fast food meals are accompanied by a soda, which increases the sugar content 10-fold. Sugar addiction, including tolerance and withdrawal, has been demonstrated in rodents but not humans. Caffeine is a "model" substance of dependence; coffee drinks are driving the recent increase in fast food sales. Limited evidence suggests that the high fat and salt content of fast food may increase addictive potential. Fast food restaurants cluster in poorer neighborhoods and obese adults eat more fast food than those who are normal weight. Obesity is characterized by resistance to insulin, leptin and other hormonal signals that would normally control appetite and limit reward. Neuroimaging studies in obese subjects provide evidence of altered reward and tolerance. Once obese, many individuals meet criteria for psychological dependence. Stress and dieting may sensitize an individual to reward. Finally, fast food advertisements, restaurants and menus all provide environmental cues that may trigger addictive overeating. While the concept of fast food addiction remains to be proven, these findings support the role of fast food as a potentially addictive substance that is most likely to create dependence in vulnerable populations.
Spherical demons: fast surface registration.
Yeo, B T Thomas; Sabuncu, Mert; Vercauteren, Tom; Ayache, Nicholas; Fischl, Bruce; Golland, Polina
2008-01-01
We present the fast Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regularizers for the modified demons objective function can be efficiently implemented on the sphere using convolution. Based on the one parameter subgroups of diffeomorphisms, the resulting registration is diffeomorphic and fast - registration of two cortical mesh models with more than 100k nodes takes less than 5 minutes, comparable to the fastest surface registration algorithms. Moreover, the accuracy of our method compares favorably to the popular FreeSurfer registration algorithm. We validate the technique in two different settings: (1) parcellation in a set of in-vivo cortical surfaces and (2) Brodmann area localization in ex-vivo cortical surfaces.
Spherical Demons: Fast Surface Registration
Yeo, B.T. Thomas; Sabuncu, Mert; Vercauteren, Tom; Ayache, Nicholas; Fischl, Bruce; Golland, Polina
2009-01-01
We present the fast Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regularizers for the modified demons objective function can be efficiently implemented on the sphere using convolution. Based on the one parameter subgroups of diffeomorphisms, the resulting registration is diffeomorphic and fast – registration of two cortical mesh models with more than 100k nodes takes less than 5 minutes, comparable to the fastest surface registration algorithms. Moreover, the accuracy of our method compares favorably to the popular FreeSurfer registration algorithm. We validate the technique in two different settings: (1) parcellation in a set of in-vivo cortical surfaces and (2) Brodmann area localization in ex-vivo cortical surfaces. PMID:18979813
Sampath, Rahul S; Sundar, Hari; Veerapaneni, Shravan
2010-01-01
We present fast adaptive parallel algorithms to compute the sum of N Gaussians at N points. Direct sequential computation of this sum would take O(N{sup 2}) time. The parallel time complexity estimates for our algorithms are O(N/n{sub p}) for uniform point distributions and O( (N/n{sub p}) log (N/n{sub p}) + n{sub p}log n{sub p}) for non-uniform distributions using n{sub p} CPUs. We incorporate a plane-wave representation of the Gaussian kernel which permits 'diagonal translation'. We use parallel octrees and a new scheme for translating the plane-waves to efficiently handle non-uniform distributions. Computing the transform to six-digit accuracy at 120 billion points took approximately 140 seconds using 4096 cores on the Jaguar supercomputer. Our implementation is 'kernel-independent' and can handle other 'Gaussian-type' kernels even when explicit analytic expression for the kernel is not known. These algorithms form a new class of core computational machinery for solving parabolic PDEs on massively parallel architectures.
Fast multi-core based multimodal registration of 2D cross-sections and 3D datasets
2010-01-01
Background Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve overall performance. The Cell Broadband Engine (CBE), a heterogeneous multi-core processor, provides power-efficient and cost-effective high-performance computing. One application area is image analysis and visualisation, in particular registration of 2D cross-sections into 3D image datasets. Such techniques can be used to put different image modalities into spatial correspondence, for example, 2D images of histological cuts into morphological 3D frameworks. Results We evaluate the CBE-driven PlayStation 3 as a high performance, cost-effective computing platform by adapting a multimodal alignment procedure to several characteristic hardware properties. The optimisations are based on partitioning, vectorisation, branch reducing and loop unrolling techniques with special attention to 32-bit multiplies and limited local storage on the computing units. We show how a typical image analysis and visualisation problem, the multimodal registration of 2D cross-sections and 3D datasets, benefits from the multi-core based implementation of the alignment algorithm. We discuss several CBE-based optimisation methods and compare our results to standard solutions. More information and the source code are available from http://cbe.ipk-gatersleben.de. Conclusions The results demonstrate that the CBE processor in a PlayStation 3 accelerates computational intensive multimodal registration, which is of great importance in biological/medical image processing. The PlayStation 3 as a low cost CBE-based platform offers an efficient option to conventional hardware to solve computational problems in image processing and bioinformatics. PMID:20064262
Fast Food Occupations. Coordinator's Guide. First Edition.
ERIC Educational Resources Information Center
Hohhertz, Durwin
This coordinator's guide consists of materials for use in implementing four individualized units that have been developed for students enrolled in cooperative part-time training and are employed in fast food restaurants. Addressed in the individual units are the following occupations: cashier (DOT No. 211.462-010), counter attendant (DOT No.…
Fast flux test facility hazards assessment
Sutton, L.N.
1994-10-24
This document establishes the technical basis in support of Emergency Planning Activities for the Fast Flux Test Facility on the Hanford Site. The document represents an acceptable interpretation of the implementing guidance document for DOE Order 5500.3A. Through this document, the technical basis for the development of facility specific Emergency Action Levels and the Emergency Planning Zone is demonstrated.
Goree, J.; Ono, M.; Colestock, P.; Horton, R.; McNeill, D.; Park, H.
1985-07-01
Fast wave current drive is demonstrated in the Princeton ACT-I toroidal device. The fast Alfven wave, in the range of high ion-cyclotron harmonics, produced 40 A of current from 1 kW of rf power coupled into the plasma by fast wave loop antenna. This wave excites a steady current by damping on the energetic tail of the electron distribution function in the same way as lower-hybrid current drive, except that fast wave current drive is appropriate for higher plasma densities.
Fast ignition of inertial confinement fusion targets
NASA Astrophysics Data System (ADS)
Gus'kov, S. Yu.
2013-01-01
Results of studies on fast ignition of inertial confinement fusion (ICF) targets are reviewed. The aspects of the fast ignition concept, which consists in the separation of the processes of target ignition and compression due to the synchronized action of different energy drivers, are considered. Criteria for the compression ratio and heating rate of a fast ignition target, the energy balance, and the thermonuclear gain are discussed. The results of experimental and theoretical studies of the heating of a compressed target by various types of igniting drivers, namely, beams of fast electrons and light ions produced under the action of a petawatt laser pulse on the target, a heavy-ion beam generated in the accelerator, an X-ray pulse, and a hydrodynamic flow of laser-accelerated matter, are analyzed. Requirements to the igniting-driver parameters that depend on the fast ignition criteria under the conditions of specific target heating mechanisms, as well as possibilities of practical implementation of these requirements, are discussed. The experimental programs of various laboratories and the prospects of practical implementation of fast ignition of ICF targets are reviewed. To date, fast ignition is the most promising method for decreasing the ignition energy and increasing the thermonuclear gain of an ICF plasma. A large number of publications have been devoted to investigations of this method and adjacent problems of the physics of igniting drivers and their interaction with plasma. This review presents results of only some of these studies that, in the author's opinion, allow one to discuss in detail the main physical aspects of the fast ignition concept and understand the current state and prospects of studies in this direction.
Fast algorithm for computing complex number-theoretic transforms
NASA Technical Reports Server (NTRS)
Reed, I. S.; Liu, K. Y.; Truong, T. K.
1977-01-01
A high-radix FFT algorithm for computing transforms over FFT, where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.
Fast algorithm for computing complex number-theoretic transforms
NASA Technical Reports Server (NTRS)
Reed, I. S.; Liu, K. Y.; Truong, T. K.
1977-01-01
A high-radix FFT algorithm for computing transforms over FFT, where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.
Integrative Physiology of Fasting.
Secor, Stephen M; Carey, Hannah V
2016-03-15
Extended bouts of fasting are ingrained in the ecology of many organisms, characterizing aspects of reproduction, development, hibernation, estivation, migration, and infrequent feeding habits. The challenge of long fasting episodes is the need to maintain physiological homeostasis while relying solely on endogenous resources. To meet that challenge, animals utilize an integrated repertoire of behavioral, physiological, and biochemical responses that reduce metabolic rates, maintain tissue structure and function, and thus enhance survival. We have synthesized in this review the integrative physiological, morphological, and biochemical responses, and their stages, that characterize natural fasting bouts. Underlying the capacity to survive extended fasts are behaviors and mechanisms that reduce metabolic expenditure and shift the dependency to lipid utilization. Hormonal regulation and immune capacity are altered by fasting; hormones that trigger digestion, elevate metabolism, and support immune performance become depressed, whereas hormones that enhance the utilization of endogenous substrates are elevated. The negative energy budget that accompanies fasting leads to the loss of body mass as fat stores are depleted and tissues undergo atrophy (i.e., loss of mass). Absolute rates of body mass loss scale allometrically among vertebrates. Tissues and organs vary in the degree of atrophy and downregulation of function, depending on the degree to which they are used during the fast. Fasting affects the population dynamics and activities of the gut microbiota, an interplay that impacts the host's fasting biology. Fasting-induced gene expression programs underlie the broad spectrum of integrated physiological mechanisms responsible for an animal's ability to survive long episodes of natural fasting. Copyright © 2016 John Wiley & Sons, Inc.
NASA Technical Reports Server (NTRS)
Cezairliyan, Ared
1988-01-01
Design and operation of accurate millisecond and microsecond resolution optical pyrometers developed at the National Bureau of Standards during the last two decades are described. Results of tests are presented and estimates of uncertainties in temperature measurements are given. Calibration methods are discussed and examples of applications of fast pyrometry are given. Ongoing research in developing fast multiwavelength and spatial scanning pyrometers are summarized.
Trueland, Jennifer
2013-12-18
The 5.2 diet involves two days of fasting each week. It is being promoted as the key to sustained weight loss, as well as wider health benefits, despite the lack of evidence on the long-term effects. Nurses need to support patients who wish to try intermittent fasting.
Fast protein folding kinetics.
Gelman, Hannah; Gruebele, Martin
2014-05-01
Fast-folding proteins have been a major focus of computational and experimental study because they are accessible to both techniques: they are small and fast enough to be reasonably simulated with current computational power, but have dynamics slow enough to be observed with specially developed experimental techniques. This coupled study of fast-folding proteins has provided insight into the mechanisms, which allow some proteins to find their native conformation well <1 ms and has uncovered examples of theoretically predicted phenomena such as downhill folding. The study of fast folders also informs our understanding of even 'slow' folding processes: fast folders are small; relatively simple protein domains and the principles that govern their folding also govern the folding of more complex systems. This review summarizes the major theoretical and experimental techniques used to study fast-folding proteins and provides an overview of the major findings of fast-folding research. Finally, we examine the themes that have emerged from studying fast folders and briefly summarize their application to protein folding in general, as well as some work that is left to do.
Gelman, Hannah; Gruebele, Martin
2014-01-01
Fast folding proteins have been a major focus of computational and experimental study because they are accessible to both techniques: they are small and fast enough to be reasonably simulated with current computational power, but have dynamics slow enough to be observed with specially developed experimental techniques. This coupled study of fast folding proteins has provided insight into the mechanisms which allow some proteins to find their native conformation well less than 1 ms and has uncovered examples of theoretically predicted phenomena such as downhill folding. The study of fast folders also informs our understanding of even “slow” folding processes: fast folders are small, relatively simple protein domains and the principles that govern their folding also govern the folding of more complex systems. This review summarizes the major theoretical and experimental techniques used to study fast folding proteins and provides an overview of the major findings of fast folding research. Finally, we examine the themes that have emerged from studying fast folders and briefly summarize their application to protein folding in general as well as some work that is left to do. PMID:24641816
Minati, Ludovico; Zacà, Domenico; D'Incerti, Ludovico; Jovicich, Jorge
2014-09-01
An outstanding issue in graph-based analysis of resting-state functional MRI is choice of network nodes. Individual consideration of entire brain voxels may represent a less biased approach than parcellating the cortex according to pre-determined atlases, but entails establishing connectedness for 1(9)-1(11) links, with often prohibitive computational cost. Using a representative Human Connectome Project dataset, we show that, following appropriate time-series normalization, it may be possible to accelerate connectivity determination replacing Pearson correlation with l1-norm. Even though the adjacency matrices derived from correlation coefficients and l1-norms are not identical, their similarity is high. Further, we describe and provide in full an example vector hardware implementation of l1-norm on an array of 4096 zero instruction-set processors. Calculation times <1000 s are attainable, removing the major deterrent to voxel-based resting-sate network mapping and revealing fine-grained node degree heterogeneity. L1-norm should be given consideration as a substitute for correlation in very high-density resting-state functional connectivity analyses.
Fast convolution algorithms for SAR processing
NASA Astrophysics Data System (ADS)
dall, Jorgen
Most high resolution SAR processors apply the Fast Fourier Transform (FFT) to implement convolution by a matched filter impulse response. However, a lower computational complexity is attainable with other algorithms which accordingly have the potential of offering faster and/or simpler processors. Thirteen different fast transform and convolution algorithms are presented, and their characteristics are compared with the fundamental requirements imposed on the algorithms by various SAR processing schemes. The most promising algorithm is based on a Fermat Number Transform (FNT). SAR-580 and SEASAT SAR images have been successfully processed with the FNT, and in this connection the range curvature correction, noise properties and processing speed are discussed.
Controlling fast chaos in delay dynamical systems.
Blakely, Jonathan N; Illing, Lucas; Gauthier, Daniel J
2004-05-14
We introduce a novel approach for controlling fast chaos in time-delay dynamical systems and use it to control a chaotic photonic device with a characteristic time scale of approximately 12 ns. Our approach is a prescription for how to implement existing chaos-control algorithms in a way that exploits the system's inherent time delay and allows control even in the presence of substantial control-loop latency (the finite time it takes signals to propagate through the components in the controller). This research paves the way for applications exploiting fast control of chaos, such as chaos-based communication schemes and stabilizing the behavior of ultrafast lasers.
NASA Astrophysics Data System (ADS)
Nan, R. D.; Zhang, H. Y.; Zhang, Y.; Yang, L.; Cai, W. J.; Liu, N.; Xie, J. T.; Zhang, S. X.
2016-11-01
The Five-hundred-meter Aperture Spherical radio Telescope (FAST) is a Chinese mega-science project to build the largest single dish radio telescope in the world. A unique karst depression in Guizhou province has been selected as the site to build an active reflector radio telescope with a diameter of 500 m and three outstanding aspects, which enables FAST to have a large sky coverage and the ability of observing astronomical targets with a high precision. Chinese Academy of Sciences and Guizhou province are in charge of FAST construction. The first light of the telescope was expected on September 25, 2016.
Van Devender, J.P.; Emin, D.
1983-12-21
A reusable fast opening switch for transferring energy, in the form of a high power pulse, from an electromagnetic storage device such as an inductor into a load. The switch is efficient, compact, fast and reusable. The switch comprises a ferromagnetic semiconductor which undergoes a fast transition between conductive and metallic states at a critical temperature and which undergoes the transition without a phase change in its crystal structure. A semiconductor such as europium rich europhous oxide, which undergoes a conductor to insulator transition when it is joule heated from its conductor state, can be used to form the switch.
Van Devender, John P.; Emin, David
1986-01-01
A reusable fast opening switch for transferring energy, in the form of a high power pulse, from an electromagnetic storage device such as an inductor into a load. The switch is efficient, compact, fast and reusable. The switch comprises a ferromagnetic semiconductor which undergoes a fast transition between conductive and insulating states at a critical temperature and which undergoes the transition without a phase change in its crystal structure. A semiconductor such as europium rich europhous oxide, which undergoes a conductor to insulator transition when it is joule heated from its conductor state, can be used to form the switch.
Fasting and cognitive function.
Pollitt, E; Lewis, N L; Garza, C; Shulman, R J
The effects of short-term fasting (skipping breakfast) on the problem-solving performance of 9 to 11 yr old children were studied under the controlled conditions of a metabolic ward. The behavioral test battery included an assessment of IQ, the Matching Familiar Figure Test and Hagen Central Incidental Test. Glucose and insulin levels were measured in blood. All assessments were made under fasting and non-fasting conditions. Skipping breakfast was found to have adverse effects on the children's late morning problem-solving performance. These findings support observations that the timing and nutrient composition of meals have acute and demonstrable effects on behavior.
Till, C.E.; Chang, Y.I.; Kittel, J.H.; Fauske, H.K.; Lineberry, M.J.; Stevenson, M.G.; Amundson, P.I.; Dance, K.D.
1980-07-01
This report is a compilation of Fast Breeder Reactor (FBR) resource documents prepared to provide the technical basis for the US contribution to the International Nuclear Fuel Cycle Evaluation. The eight separate parts deal with the alternative fast breeder reactor fuel cycles in terms of energy demand, resource base, technical potential and current status, safety, proliferation resistance, deployment, and nuclear safeguards. An Annex compares the cost of decommissioning light-water and fast breeder reactors. Separate abstracts are included for each of the parts.
FastMag: Fast micromagnetic simulator for complex magnetic structures (invited)
NASA Astrophysics Data System (ADS)
Chang, R.; Li, S.; Lubarda, M. V.; Livshitz, B.; Lomakin, V.
2011-04-01
A fast micromagnetic simulator (FastMag) for general problems is presented. FastMag solves the Landau-Lifshitz-Gilbert equation and can handle multiscale problems with a high computational efficiency. The simulator derives its high performance from efficient methods for evaluating the effective field and from implementations on massively parallel graphics processing unit (GPU) architectures. FastMag discretizes the computational domain into tetrahedral elements and therefore is highly flexible for general problems. The magnetostatic field is computed via the superposition principle for both volume and surface parts of the computational domain. This is accomplished by implementing efficient quadrature rules and analytical integration for overlapping elements in which the integral kernel is singular. Thus, discretized superposition integrals are computed using a nonuniform grid interpolation method, which evaluates the field from N sources at N collocated observers in O(N) operations. This approach allows handling objects of arbitrary shape, allows easily calculating of the field outside the magnetized domains, does not require solving a linear system of equations, and requires little memory. FastMag is implemented on GPUs with ?> GPU-central processing unit speed-ups of 2 orders of magnitude. Simulations are shown of a large array of magnetic dots and a recording head fully discretized down to the exchange length, with over a hundred million tetrahedral elements on an inexpensive desktop computer.
Intermittent fasting: a "new" historical strategy for controlling seizures?
Hartman, Adam L; Rubenstein, James E; Kossoff, Eric H
2013-05-01
In antiquity, fasting was a treatment for epilepsy and a rationale for the ketogenic diet (KD). Preclinical data indicate the KD and intermittent fasting do not share identical anticonvulsant mechanisms. We implemented an intermittent fasting regimen in six children with an incomplete response to a KD. Three patients adhered to the combined intermittent fasting/KD regimen for 2 months and four had transient improvement in seizure control, albeit with some hunger-related adverse reactions. Copyright © 2012 Elsevier B.V. All rights reserved.
Pneumococcal Disease Fast Facts
... Home About Pneumococcal Types of Infection Risk Factors & Transmission Symptoms & Complications Diagnosis & Treatment Prevention Photos Fast Facts Pneumococcal Vaccination For Clinicians Streptococcus pneumoniae Transmission Clinical Features Risk Factors Diagnosis & Management Prevention For ...
FAST joins Breakthrough programme
NASA Astrophysics Data System (ADS)
Banks, Michael
2016-11-01
The 180m Five-hundred-meter Aperture Spherical radio Telescope (FAST) - the world's largest single-aperture radio receiver - has become part of the Breakthrough Listen programme, which launched in July 2015 to look for intelligent life beyond Earth.
NASA Astrophysics Data System (ADS)
Wilkinson, P.
2016-02-01
FAST offers "transformational" performance well-suited to finding new phenomena - one of which might be polarised spectral transients. But discoveries will only be made if "the system" provides its users with the necessary opportunities. In addition to designing in as much observational flexibility as possible, FAST should be operated with a philosophy which maximises its "human bandwidth". This band includes the astronomers of tomorrow - many of whom not have yet started school or even been born.
NASA Astrophysics Data System (ADS)
Zhang, J. S.
2014-09-01
FAST, the Five-hundred meter Aperture Spherical radio Telescope, will become the largest operating single-dish telescope in the coming years. It has many advantages: much better sensitivity for its largest collecting area; large sky coverage due to its innovative design of the active primary surface; extremely radio quiet from its unique location, etc. In this work, I will highlight the future capabilities of FAST to discover and observe both galactic and extragalactic masers.
Clinical implementation of pharmacogenetics.
García-González, Xandra; Cabaleiro, Teresa; Herrero, María José; McLeod, Howard; López-Fernández, Luis A
2016-03-01
In the last decade, pharmacogenetic research has been performed in different fields. However, the application of pharmacogenetic findings to clinical practice has not been as fast as desirable. The current situation of clinical implementation of pharmacogenetics is discussed. This review focuses on the advances of pharmacogenomics to individualize cancer treatments, the relationship between pharmacogenetics and pharmacodynamics in the clinical course of transplant patients receiving a combination of immunosuppressive therapy, the needs and barriers facing pharmacogenetic clinical application, and the situation of pharmacogenetic testing in Spain. It is based on lectures presented by speakers of the Clinical Implementation of Pharmacogenetics Symposium at the VII Conference of the Spanish Pharmacogenetics and Pharmacogenomics Society, held in April 20, 2015.
Education For All (EFA) - Fast Track Initiative Progress Report 30046
ERIC Educational Resources Information Center
World Bank Education Advisory Service, 2004
2004-01-01
Launched in June 2002, the Education For All-Fast Track Initiative (FTI) is a performance-based program focusing on the implementation of sustainable policies in support of universal primary completion (UPC) and the required resource mobilization. During its twenty months of implementation, FTI has delivered on results, which give reason for…
Fast track management and control
Cameron, M.D.O.
1996-12-31
This paper, one of a group of papers describing the development of BP`s West of Shetland Foinaven field will set-out the challenges experienced in managing a fast-track project from system design through to offshore installation. ABB Seatec Limited (formerly GEC Marconi Oil and Gas) were commissioned to provide a Multiplexed Electro-Hydraulic Subsea Control System designed for deepwater and for installation/retrieval in a hostile environment. The paper will address the projects critical phase, the project controls implemented, the practical working methods used within a Subsea Alliance and those involved in Client Interaction, Concurrent Engineering, Team Coaching, Internal Procedures and Interface Management in order to meet the exacting schedule for First Oil deliveries. The Project is currently proceeding on routine production deliveries to complete the field development requirements.
Fastphylo: Fast tools for phylogenetics
2013-01-01
Background Distance methods are ubiquitous tools in phylogenetics. Their primary purpose may be to reconstruct evolutionary history, but they are also used as components in bioinformatic pipelines. However, poor computational efficiency has been a constraint on the applicability of distance methods on very large problem instances. Results We present fastphylo, a software package containing implementations of efficient algorithms for two common problems in phylogenetics: estimating DNA/protein sequence distances and reconstructing a phylogeny from a distance matrix. We compare fastphylo with other neighbor joining based methods and report the results in terms of speed and memory efficiency. Conclusions Fastphylo is a fast, memory efficient, and easy to use software suite. Due to its modular architecture, fastphylo is a flexible tool for many phylogenetic studies. PMID:24255987
Fast data parallel polygon rendering
Ortega, F.A.; Hansen, C.D.
1993-09-01
This paper describes a parallel method for polygonal rendering on a massively parallel SIMD machine. This method, based on a simple shading model, is targeted for applications which require very fast polygon rendering for extremely large sets of polygons such as is found in many scientific visualization applications. The algorithms described in this paper are incorporated into a library of 3D graphics routines written for the Connection Machine. The routines are implemented on both the CM-200 and the CM-5. This library enables a scientists to display 3D shaded polygons directly from a parallel machine without the need to transmit huge amounts of data to a post-processing rendering system.
FAST (Faceted Application of Subject Terminology) Users: Summary and Case Studies
ERIC Educational Resources Information Center
Mixter, Jeffrey; Childress, Eric R.
2013-01-01
Over the past ten years, various organizations, both public and private, have expressed interest in implementing the Faceted Application of Subject Terminology (FAST) in their cataloging workflows. As interest in FAST has grown, so too has interest in knowing how FAST is being used and by whom. Since 2002 eighteen institutions in six countries…
The Gemini Observatory fast turnaround program
NASA Astrophysics Data System (ADS)
Mason, R. E.; Côté, S.; Kissler-Patig, M.; Levenson, N. A.; Adamson, A.; Emmanuel, C.; Crabtree, D.
2014-08-01
Gemini's Fast Turnaround program is intended to greatly decrease the time from having an idea to acquiring the supporting data. The scheme will offer monthly proposal submission opportunities, and proposals will be reviewed by the principal investigators or co-investigators of other proposals submitted during the same round. Here, we set out the design of the system and outline the plan for its implementation, leading to the launch of a pilot program at Gemini North in January 2015.
NASA Astrophysics Data System (ADS)
Goree, J.; Ono, M.; Colestock, P.; Horton, R.; McNeill, D.; Park, H.
1985-07-01
Experiments on the fast wave in the range of high ion cyclotron harmonics in the ACT-1 device show that current drive is possible with the fast wave just as it is for the lower hybrid wave, except that it is suitable for higher plasma densities. A 140° loop antenna launched the high ion cyclotron harmonic fast wave [ω/Ω=O(10)] into a He+ plasma with ne≂4×1012 cm-3 and B=4.5 kG. Probe and magnetic loop diagnostics and FIR laser scattering confirmed the presence of the fast wave, and the Rogowski loop indicated that the circulating plasma current increased by up to 40A with 1 kW of coupled power, which is comparable to lower hybrid current drive in the same device with the same unidirectional fast electron beam used as the target for the rf. A phased antenna array would be used for FWCD in a tokamak without the E-beam.
Fast Algorithms for Exact Exchange
NASA Astrophysics Data System (ADS)
Manzer, Samuel Fenton
This thesis describes several new theoretical developments that facilitate the computation of the exact exchange energy, a vital component of accurate molecular simulations. The primary technique on which these developments are based is the resolution of the identity approximation, particularly the pair atomic resolution of the identity approximation (PARI). We prove that computation of exact exchange using the PARI approximation is variationally stable, and provide benchmarks of the performance and accuracy of our implementation. We then show that the most commonly used SCF convergence acceleration algorithm, DIIS, enables the design of a new fast exchange algorithm that we designate as occ-RI-K. Next, we combine the preceding occ-RI-K algorithm with the PARI approximation to create a linear-scaling exact exchange algorithm for the specific case of large weakly-interacting systems. Finally, we discuss our development of a high-level, object-oriented software library for block-sparse tensor operations. This library provides the underlying implementation for all of the algorithms discussed in this thesis.
Generalized Backprojection Operator: Fast Calculation
NASA Astrophysics Data System (ADS)
Miqueles, Eduardo X.; Helou, Elias S.; De Pierro, Alvaro R.
2014-03-01
The inverse Radon transform and his straightforward implementation, known as filtered backprojection (also known as FBP), has become a powerful algorithm for solving a tomographic inverse problem. It has a wide range of applications, including geophysics, medicine and synchrotrons, and from kilo to centi to micro scale respectively. Such a classical inversion has a major computational disadvantage: increasing slowness proportionally to the data size. An ordinary implementation of this algorithm relies on a simple integral that has to be done pixelwise. Many accelerating techniques were proposed in the literature so as to make this part of the inversion as fast as possible. One the most promising strategies is converting the backprojection as a convolution operator (at log-polar coordinates). The generalized backprojector has many applications, for instance in the analytical inversion of single-photon emission tomography or x-ray fluorescence tomography. Our aim in this paper is to show how these ideas can be used for other inversion methods, the iterative ones; which deal much better with noise.
Leibon, Gregory; Rockmore, Daniel N; Park, Wooram; Taintor, Robert; Chirikjian, Gregory S
2008-12-17
We present algorithms for fast and stable approximation of the Hermite transform of a compactly supported function on the real line, attainable via an application of a fast algebraic algorithm for computing sums associated with a three-term relation. Trade-offs between approximation in bandlimit (in the Hermite sense) and size of the support region are addressed. Numerical experiments are presented that show the feasibility and utility of our approach. Generalizations to any family of orthogonal polynomials are outlined. Applications to various problems in tomographic reconstruction, including the determination of protein structure, are discussed.
Fast Overcurrent Tripping Circuit
NASA Technical Reports Server (NTRS)
Sullender, Craig C.; Davies, Bryan L.; Osborn, Stephen H.
1993-01-01
Fast overcurrent tripping circuit designed for incorporation into power metal oxide/semiconductor field-effect transistor (MOSFET) switching circuit. Serves as fast electronic circuit breaker by sensing voltage across MOSFET's during conduction and switching MOSFET's off within 1 microsecond after voltage exceeds reference value corresponding to tripping current. Acts more quickly than Hall-effect current sensor and, in comparison with shunt current-measuring circuits, smaller and consumes less power. Also ignores initial transient overcurrents during first 5 microseconds of switching cycle.
A Fast Implementation of the ISODATA Clustering Algorithm
NASA Technical Reports Server (NTRS)
Memarsadeghi, Nargess; Mount, David M.; Netanyahu, Nathan S.; LeMoigne, Jacqueline
2005-01-01
Clustering is central to many image processing and remote sensing applications. ISODATA is one of the most popular and widely used clustering methods in geoscience applications, but it can run slowly, particularly with large data sets. We present a more efficient approach to ISODATA clustering, which achieves better running times by storing the points in a kd-tree and through a modification of the way in which the algorithm estimates the dispersion of each cluster. We also present an approximate version of the algorithm which allows the user to further improve the running time, at the expense of lower fidelity in computing the nearest cluster center to each point. We provide both theoretical and empirical justification that our modified approach produces clusterings that are very similar to those produced by the standard ISODATA approach. We also provide empirical studies on both synthetic data and remotely sensed Landsat and MODIS images that show that our approach has significantly lower running times.
Fast modular network implementation for support vector machines.
Huang, Guang-Bin; Mao, K Z; Siew, Chee-Kheong; Huang, De-Shuang
2005-11-01
Support vector machines (SVMs) have been extensively used. However, it is known that SVMs face difficulty in solving large complex problems due to the intensive computation involved in their training algorithms, which are at least quadratic with respect to the number of training examples. This paper proposes a new, simple, and efficient network architecture which consists of several SVMs each trained on a small subregion of the whole data sampling space and the same number of simple neural quantizer modules which inhibit the outputs of all the remote SVMs and only allow a single local SVM to fire (produce actual output) at any time. In principle, this region-computing based modular network method can significantly reduce the learning time of SVM algorithms without sacrificing much generalization performance. The experiments on a few real large complex benchmark problems demonstrate that our method can be significantly faster than single SVMs without losing much generalization performance.
Towards a fast implementation of spectral nested dissection
NASA Technical Reports Server (NTRS)
Pothen, Alex; Simon, Horst D.; Wang, Lie; Barnard, Stephen T.
1992-01-01
We describe the spectral nested dissection (SND) algorithm, a new algorithm for computing orderings appropriate for parallel factorization of sparse, symmetric matrices. The algorithm makes use of spectral properties of the Laplacian matrix associated with the given matrix to compute separators. We evaluate the quality of the spectral orderings with respect to several measures: fill, elimination tree height, height and weight balances of elimination trees, and clique tree heights. We use some very large structural analysis problems as test cases and demonstrate on these real applications (such as the Space Shuttle Solid Rocket Booster) that spectral orderings compare quite favorably with commonly used orderings, outperforming them by a wide margin for some of these measures. The only disadvantage of SND is its relatively long execution time. We will present some recent efforts to improve the execution time using both a multilevel and a hybrid approach. We use SND in computing a multifrontal numerical factorization with the different orderings on an eight processor Cray Y-MP and show its effectiveness. We believe that spectral nested dissection is a major breakthrough in terms of generating efficient sparse orderings for parallel machines.
Fast Implementation of Matched Filter Based Automatic Alignment Image Processing
Awwal, A S; Rice, K; Taha, T
2008-04-02
Video images of laser beams imprinted with distinguishable features are used for alignment of 192 laser beams at the National Ignition Facility (NIF). Algorithms designed to determine the position of these beams enable the control system to perform the task of alignment. Centroiding is a common approach used for determining the position of beams. However, real world beam images suffer from intensity fluctuation or other distortions which make such an approach susceptible to higher position measurement variability. Matched filtering used for identifying the beam position results in greater stability of position measurement compared to that obtained using the centroiding technique. However, this gain is achieved at the expense of extra processing time required for each beam image. In this work we explore the possibility of using a field programmable logic array (FPGA) to speed up these computations. The results indicate a performance improvement of 20 using the FPGA relative to a 3 GHz Pentium 4 processor.
Implementation of a fast reconfigurable array for tissue impedance characterization.
Habibi, Mohammad; Klemer, David P; Raicu, Valerica
2009-01-01
Various tissue properties have been used in the past and present as metrics which can serve to discriminate healthy from diseased tissue. Electromagnetic absorption (of x-rays and optical signals), scattering of near-infrared light, and electrical impedance are a few such parameters. In order to serve as discriminants for diseased (e.g., neoplastic) tissue, the characteristics of these tissues must first be precisely determined. In this paper, we consider the electrical impedance properties of tissues and cell aggregates, and present the design of a reconfigurable electrode array which is capable of providing a well-defined electromagnetic interface to the tissue under study, for characterization in the 0.01-30 MHz range. The configuration of array elements may be easily changed under digital control, allowing for various electromagnetic field configurations to be applied to the tissue under study. The array is designed to interface to four-point as well as two-point impedance instrumentation, and may be used for two-dimensional bioimaging systems based on electrical impedances. The design may be scaled to higher frequencies and smaller dimensions, allowing for studies of electrical properties at the cellular level.
Towards a fast implementation of spectral nested dissection
NASA Technical Reports Server (NTRS)
Pothen, Alex; Simon, Horst D.; Wang, Lie; Barnard, Stephen T.
1992-01-01
We describe the spectral nested dissection (SND) algorithm, a new algorithm for computing orderings appropriate for parallel factorization of sparse, symmetric matrices. The algorithm makes use of spectral properties of the Laplacian matrix associated with the given matrix to compute separators. We evaluate the quality of the spectral orderings with respect to several measures: fill, elimination tree height, height and weight balances of elimination trees, and clique tree heights. We use some very large structural analysis problems as test cases and demonstrate on these real applications (such as the Space Shuttle Solid Rocket Booster) that spectral orderings compare quite favorably with commonly used orderings, outperforming them by a wide margin for some of these measures. The only disadvantage of SND is its relatively long execution time. We will present some recent efforts to improve the execution time using both a multilevel and a hybrid approach. We use SND in computing a multifrontal numerical factorization with the different orderings on an eight processor Cray Y-MP and show its effectiveness. We believe that spectral nested dissection is a major breakthrough in terms of generating efficient sparse orderings for parallel machines.
Intermittent fasting: A “new” historical strategy for controlling seizures?
Hartman, Adam L.; Rubenstein, James E.; Kossoff, Eric H.
2013-01-01
Summary In antiquity, fasting was a treatment for epilepsy and a rationale for the ketogenic diet (KD). Preclinical data indicate the KD and intermittent fasting do not share identical anticonvulsant mechanisms. We implemented an intermittent fasting regimen in six children with an incomplete response to a KD. Three patients adhered to the combined intermittent fasting/KD regimen for 2 months and four had transient improvement in seizure control, albeit with some hunger-related adverse reactions. PMID:23206889
Till, C.E.; Chang, Y.I.
1986-01-01
The Integral Fast Reactor (IFR) is an innovative LMR concept, being developed at Argonne National Laboratory, that fully exploits the inherent properties of liquid metal cooling and metallic fuel to achieve breakthroughs in economics and inherent safety. This paper describes key features and potential advantages of the IFR concept, technology development status, fuel cycle economics potential, and future development path.
Till, C.E.; Chang, Y.I. ); Lineberry, M.J. )
1990-01-01
Argonne National Laboratory, since 1984, has been developing the Integral Fast Reactor (IFR). This paper will describe the way in which this new reactor concept came about; the technical, public acceptance, and environmental issues that are addressed by the IFR; the technical progress that has been made; and our expectations for this program in the near term. 5 refs., 3 figs.
ERIC Educational Resources Information Center
Education Commission of the States, Denver, CO.
This paper provides an overview of Fast ForWord, a CD-ROM and Internet-based training program for children (pre-K to grade 8) with language and reading problems that helps children rapidly build oral language comprehension and other critical skills necessary for learning to read or becoming a better reader. With the help of computers, speech…
Bull, G; Maffetone, M A; Miller, S K
1992-01-01
Total quality management (TQM) is an organized, systematic approach to problem solving and continuous improvement. American corporations have found that TQM is an excellent way to improve competitiveness, lower operating costs, and improve productivity. Increasing numbers of laboratories are investigating the benefits of TQM. For this month's column, we asked our respondents: What steps has your laboratory taken to implement TQM?
NASA Technical Reports Server (NTRS)
Murphy, Gerald
2003-01-01
The point of the implementation review is to prevent problems from occurring later by trying to get our arms around the planning from the start. fmplementation reviews set the tone for management of the project. They establish a teaming relationship (if they are run properly), and they level the playing field instead of setting up turf wars.
Does Ramadan fasting affect sleep?
Bahammam, A
2006-12-01
Experimental fasting has been shown to alter the sleep-wakefulness pattern in various species. As fasting during Ramadan is distinct from experimental fasting, the physiological and behavioural changes occurring during Ramadan fasting may differ from those occurring during experimental fasting. There has been increased interest in recent years in sleep changes and daytime sleepiness during Ramadan. Moreover, many of those who fast during Ramadan associate this fasting with increased daytime sleepiness and decreased performance. This raises the question of whether Ramadan fasting affects sleep. In this review, we discuss the findings of research conducted to assess changes in sleep pattern, chronobiology, circadian rhythms, daytime sleepiness and function and sleep architecture during the month of Ramadan. Where applicable, these findings are compared with those obtained during experimental fasting.
FAST - FREEDOM ASSEMBLY SEQUENCING TOOL PROTOTYPE
NASA Technical Reports Server (NTRS)
Borden, C. S.
1994-01-01
-Language and has been implemented on DEC VAX series computers running VMS. The program is distributed in executable form. The source code is also provided, but it cannot be compiled without the Tree Manipulation Based Routines (TMBR) package from the Jet Propulsion Laboratory, which is not currently available from COSMIC. The main memory requirement is based on the data used to drive the FAST program. All applications should easily run on an installation with 10Mb of main memory. FAST was developed in 1990 and is a copyrighted work with all copyright vested in NASA. DEC, VAX and VMS are trademarks of Digital Equipment Corporation.
Fast packet switch architectures for broadband integrated services digital networks
NASA Technical Reports Server (NTRS)
Tobagi, Fouad A.
1990-01-01
Background information on networking and switching is provided, and the various architectures that have been considered for fast packet switches are described. The focus is solely on switches designed to be implemented electronically. A set of definitions and a brief description of the functionality required of fast packet switches are given. Three basic types of packet switches are identified: the shared-memory, shared-medium, and space-division types. Each of these is described, and examples are given.
Wu, Kesheng
2007-08-02
An index in a database system is a data structure that utilizes redundant information about the base data to speed up common searching and retrieval operations. Most commonly used indexes are variants of B-trees, such as B+-tree and B*-tree. FastBit implements a set of alternative indexes call compressed bitmap indexes. Compared with B-tree variants, these indexes provide very efficient searching and retrieval operations by sacrificing the efficiency of updating the indexes after the modification of an individual record. In addition to the well-known strengths of bitmap indexes, FastBit has a special strength stemming from the bitmap compression scheme used. The compression method is called the Word-Aligned Hybrid (WAH) code. It reduces the bitmap indexes to reasonable sizes and at the same time allows very efficient bitwise logical operations directly on the compressed bitmaps. Compared with the well-known compression methods such as LZ77 and Byte-aligned Bitmap code (BBC), WAH sacrifices some space efficiency for a significant improvement in operational efficiency. Since the bitwise logical operations are the most important operations needed to answer queries, using WAH compression has been shown to answer queries significantly faster than using other compression schemes. Theoretical analyses showed that WAH compressed bitmap indexes are optimal for one-dimensional range queries. Only the most efficient indexing schemes such as B+-tree and B*-tree have this optimality property. However, bitmap indexes are superior because they can efficiently answer multi-dimensional range queries by combining the answers to one-dimensional queries.
Fast Legendre moment computation for template matching
NASA Astrophysics Data System (ADS)
Li, Bing C.
2017-05-01
Normalized cross correlation (NCC) based template matching is insensitive to intensity changes and it has many applications in image processing, object detection, video tracking and pattern recognition. However, normalized cross correlation implementation is computationally expensive since it involves both correlation computation and normalization implementation. In this paper, we propose Legendre moment approach for fast normalized cross correlation implementation and show that the computational cost of this proposed approach is independent of template mask sizes which is significantly faster than traditional mask size dependent approaches, especially for large mask templates. Legendre polynomials have been widely used in solving Laplace equation in electrodynamics in spherical coordinate systems, and solving Schrodinger equation in quantum mechanics. In this paper, we extend Legendre polynomials from physics to computer vision and pattern recognition fields, and demonstrate that Legendre polynomials can help to reduce the computational cost of NCC based template matching significantly.
NASA Technical Reports Server (NTRS)
1983-01-01
Meeting the identified needs of Earth science requires approaching EOS as an information system and not simply as one or more satellites with instruments. Six elements of strategy are outlined as follows: implementation of the individual discipline missions as currently planned; use of sustained observational capabilities offered by operational satellites without waiting for the launch of new mission; put first priority on the data system; deploy an Advanced Data Collection and Location System; put a substantial new observing capability in a low Earth orbit in such a way as to provide for sustained measurements; and group instruments to exploit their capabilities for synergism; maximize the scientific utility of the mission; and minimize the costs of implementation where possible.
NASA Astrophysics Data System (ADS)
Uvarov, I. V.; Postnikov, A. V.; Svetovoy, V. B.
2016-03-01
Lack of fast and strong microactuators is a well-recognized problem in MEMS community. Electrochemical actuators can develop high pressure but they are notoriously slow. Water electrolysis produced by short voltage pulses of alternating polarity can overcome the problem of slow gas termination. Here we demonstrate an actuation regime, for which the gas pressure is relaxed just for 10 μs or so. The actuator consists of a microchamber filled with the electrolyte and covered with a flexible membrane. The membrane bends outward when the pressure in the chamber increases. Fast termination of gas and high pressure developed in the chamber are related to a high density of nanobubbles in the chamber. The physical processes happening in the chamber are discussed so as problems that have to be resolved for practical applications of this actuation regime. The actuator can be used as a driving engine for microfluidics.
Fast tracking hospital construction.
Quirk, Andrew
2013-03-01
Hospital leaders should consider four factors in determining whether to fast track a hospital construction project: Expectations of project length, quality, and cost. Whether decisions can be made quickly as issues arise. Their own time commitment to the project, as well as that of architects, engineers, construction managers, and others. The extent to which they are willing to share with the design and construction teams how and why decisions are being made.
Soha, Aria; Chiu, Mickey; Mannel, Eric; Stoll, Sean; Lynch, Don; Boose, Steve; Northacker, Dave; Alfred, Marcus; Lindesay, James; Chujo, Tatsuya; Inaba, Motoi; Nonaka, Toshihiro; Sato, Wataru; Sakatani, Ikumi; Hirano, Masahiro; Choi, Ihnjea
2014-01-15
This is a technical scope of work (TSW) between the Fermi National Accelerator Laboratory (Fermilab) and the experimenters of PHENIX Fast TOF group who have committed to participate in beam tests to be carried out during the FY2014 Fermilab Test Beam Facility program. The goals for this test beam experiment are to verify the timing performance of the two types of time-of-flight detector prototypes.
Chang, Y.I.
1988-01-01
The Integral Fast Reactor (IFR) is an innovative liquid metal reactor concept being developed at Argonne National Laboratory. It seeks to specifically exploit the inherent properties of liquid metal cooling and metallic fuel in a way that leads to substantial improvements in the characteristics of the complete reactor system. This paper describes the key features and potential advantages of the IFR concept, with emphasis on its safety characteristics. 3 refs., 4 figs., 1 tab.
NASA Astrophysics Data System (ADS)
Rane, Akshaya; Lorimer, Duncan
2017-09-01
We summarize our current state of knowledge of fast radio bursts (FRBs) which were first discovered a decade ago. Following an introduction to radio transients in general, including pulsars and rotating radio transients, we discuss the discovery of FRBs. We then discuss FRB follow-up observations in the context of repeat bursts before moving on to review propagation effects on FRB signals, FRB progenitor models and an outlook on FRBs as potential cosmological tools.
NASA Astrophysics Data System (ADS)
Chadwick, Alan V.
Fast ion conductors, sometimes referred to as superionic conductors or solid electrolytes, are solids with ionic conductivities that are comparable to those found in molten salts and aqueous solutions of strong electrolytes, i.e., 10-2-10 S cm-1. Such materials have been known of for a very long time and some typical examples of the conductivity are shown in Fig. 1, along with sodium chloride as the archetypal normal ionic solid. Faraday [1] first noted the high conductivity of solid lead fluoride (PbF2) and silver sulphide (Ag2S) in the 1830s and silver iodide was known to be unusually high ionic conductor to the German physicists early in the 1900s. However, the materials were regarded as anomalous until the mid 1960s when they became the focus of intense interest to academics and technologists and they have remained at the forefront of materials research [2-4]. The academic aim is to understand the fundamental origin of fast ion behaviour and the technological goal is to utilize the properties in applications, particularly in energy applications such as the electrolyte membranes in solid-state batteries and fuel cells, and in electrochemical sensors. The last four decades has seen an expansion of the types of material that exhibit fast ion behaviour that now extends beyond simple binary ionic crystals to complex solids and even polymeric materials. Over this same period computer simulations of solids has also developed (in fact these methods and the interest in fast ion conductors were almost coincidental in their time of origin) and the techniques have played a key role in this area of research.
"Fast" Capitalism and "Fast" Schools: New Realities and New Truths.
ERIC Educational Resources Information Center
Robertson, Susan L.
This paper locates the phenomenon of self-managing schools within the framework of "fast capitalism" and identifies themes of organization central to fast capitalism, which are argued to also underpin the self-managing schools. "Fast capitalism" refers to the rapidly intensified integration of regionalized productive activities into the global…
Fast global orbit feedback system in PLS-II
NASA Astrophysics Data System (ADS)
Lee, J.; Kim, C.; Kim, J. M.; Kim, K. R.; Lee, E. H.; Lee, J. W.; Lee, T. Y.; Park, C. D.; Shin, S.; Yoon, J. C.; Cho, W. S.; Park, G. S.; Kim, S. C.
2016-12-01
The transverse position of the electron beam in the Pohang Light Source-II is stabilized by the global orbit feedback system. A slow orbit feedback system has been operating at 2 Hz, and a fast orbit feedback (FOFB) system at 813 Hz was installed recently. This FOFB system consists of 96 electron-beam-position monitors, 48 horizontal fast correctors, 48 vertical fast correctors and Versa Module Europa bus control system. We present the design and implementation of the FOFB system and its test result. Simulation analysis is presented and future improvements are suggested.
Efficient Kriging via Fast Matrix-Vector Products
NASA Technical Reports Server (NTRS)
Memarsadeghi, Nargess; Raykar, Vikas C.; Duraiswami, Ramani; Mount, David M.
2008-01-01
Interpolating scattered data points is a problem of wide ranging interest. Ordinary kriging is an optimal scattered data estimator, widely used in geosciences and remote sensing. A generalized version of this technique, called cokriging, can be used for image fusion of remotely sensed data. However, it is computationally very expensive for large data sets. We demonstrate the time efficiency and accuracy of approximating ordinary kriging through the use of fast matrixvector products combined with iterative methods. We used methods based on the fast Multipole methods and nearest neighbor searching techniques for implementations of the fast matrix-vector products.
Fast controller for a unity-power-factor PWM rectifier
Eissa, M.O.; Leeb, S.B.; Verghese, G.C.; Stankovic, A.M.
1996-01-01
This paper presents an analog implementation of a fast controller for a unity-power-factor (UPF) PWM rectifier. The best settling times of many popular controllers for this type of converter are on the order of a few line cycles, corresponding to bandwidths under 20 Hz. The fast controller demonstrated in this paper can exercise control action at a rate comparable to the switching frequency rather than the line frequency. In order to accomplish this while maintaining unity power factor during steady-state operation, the fast controller employs a ripple-feedback cancellation scheme.
Density Estimation Trees as fast non-parametric modelling tools
NASA Astrophysics Data System (ADS)
Anderlini, Lucio
2016-10-01
A Density Estimation Tree (DET) is a decision trees trained on a multivariate dataset to estimate the underlying probability density function. While not competitive with kernel techniques in terms of accuracy, DETs are incredibly fast, embarrassingly parallel and relatively small when stored to disk. These properties make DETs appealing in the resource- expensive horizon of the LHC data analysis. Possible applications may include selection optimization, fast simulation and fast detector calibration. In this contribution I describe the algorithm and its implementation made available to the HEP community as a RooFit object. A set of applications under discussion within the LHCb Collaboration are also briefly illustrated.
NASA Technical Reports Server (NTRS)
1996-01-01
The NASA Fast Track Study supports the efforts of a Special Study Group (SSG) made up of members of the Advanced Project Management Class number 23 (APM-23) that met at the Wallops Island Management Education Center from April 28 - May 8, 1996. Members of the Class expressed interest to Mr. Vem Weyers in having an input to the NASA Policy Document (NPD) 7120.4, that will replace NASA Management Institute (NMI) 7120.4, and the NASA Program/Project Management Guide. The APM-23 SSG was tasked with assisting in development of NASA policy on managing Fast Track Projects, defined as small projects under $150 million and completed within three years. 'Me approach of the APM-23 SSG was to gather data on successful projects working in a 'Better, Faster, Cheaper' environment, within and outside of NASA and develop the Fast Track Project section of the NASA Program/Project Management Guide. Fourteen interviews and four other data gathering efforts were conducted by the SSG, and 16 were conducted by Strategic Resources, Inc. (SRI), including five interviews at the Jet Propulsion Laboratory (JPL) and one at the Applied Physics Laboratory (APL). The interviews were compiled and analyzed for techniques and approaches commonly used to meet severe cost and schedule constraints.
Mason, R.J.; Tabak, M.
1997-10-01
The Fast Ignitor is an alternate approach to ICF in which short pulse lasers are used to initiate burn at the surface of the compressed DT fuel. The aim is to avoid the need for careful central focusing of final shocks, and possibly to lower substantially the energy requirements for ignition. Ultimately, both goals may prove crucial to Science Based Stockpile Stewardship (SBSS). This will be the case should either emerging energetic needs, or funding difficulties render the presently planned radiative fusion approach to ignition with the NIF impractical. Ignition is a first step towards the achievement of substantial energy and neutron outputs for such Stewardship. For success with the Fast Ignitor, the laser energy must be efficiently deposited into megavolt electrons (suprathermal), which must, in turn, couple to the background ions within an alpha particle range. To understand the electron fuel coupling, we have used ANTHEM plasma simulation code to model the transport of hot electrons generated by an intense short pulse laser into plasma targets over a broad range of densities. Our study will spell out the acceleration and transport mechanisms active in the Fast Ignitor environment.
Lipid metabolism during fasting.
Jensen, M D; Ekberg, K; Landau, B R
2001-10-01
These studies were conducted to understand the relationship between measures of systemic free fatty acid (FFA) reesterification and regional FFA, glycerol, and triglyceride metabolism during fasting. Indirect calorimetry was used to measure fatty acid oxidation in six men after a 60-h fast. Systemic and regional (splanchnic, renal, and leg) FFA ([(3)H]palmitate) and glycerol ([(3)H]glycerol) kinetics, as well as splanchnic triglyceride release, were measured. The rate of systemic FFA reesterification was 366 +/- 93 micromol/min, which was greater (P < 0.05) than splanchnic triglyceride fatty acid output (64 +/- 6 micromol/min), a measure of VLDL triglyceride fatty acid export. The majority of glycerol uptake occurred in the splanchnic and renal beds, although some leg glycerol uptake was detected. Systemic FFA release was approximately double that usually present in overnight postabsorptive men, yet the regional FFA release rates were of the same proportions previously observed in overnight postabsorptive men. In conclusion, FFA reesterification at rest during fasting far exceeds splanchnic triglyceride fatty acid output. This indicates that nonhepatic sites of FFA reesterification are important, and that peripheral reesterification of FFA exceeds the rate of simultaneous intracellular triglyceride fatty acid oxidation.
Johnstone, A M
2007-05-01
Adult humans often undertake acute fasts for cosmetic, religious or medical reasons. For example, an estimated 14% of US adults have reported using fasting as a means to control body weight and this approach has long been advocated as an intermittent treatment for gross refractory obesity. There are unique historical data sets on extreme forms of food restriction that give insight into the consequences of starvation or semi-starvation in previously healthy, but usually non-obese subjects. These include documented medical reports on victims of hunger strike, famine and prisoners of war. Such data provide a detailed account on how the body adapts to prolonged starvation. It has previously been shown that fasting for the biblical period of 40 days and 40 nights is well within the overall physiological capabilities of a healthy adult. However, the specific effects on the human body and mind are less clearly documented, either in the short term (hours) or in the longer term (days). This review asks the following three questions, pertinent to any weight-loss therapy, (i) how effective is the regime in achieving weight loss, (ii) what impact does it have on psychology? and finally, (iii) does it work long-term?
NASA Technical Reports Server (NTRS)
Smith, David D.
2015-01-01
Next-generation space missions are currently constrained by existing spacecraft navigation systems which are not fully autonomous. These systems suffer from accumulated dead-reckoning errors and must therefore rely on periodic corrections provided by supplementary technologies that depend on line-of-sight signals from Earth, satellites, or other celestial bodies for absolute attitude and position determination, which can be spoofed, incorrectly identified, occluded, obscured, attenuated, or insufficiently available. These dead-reckoning errors originate in the ring laser gyros themselves, which constitute inertial measurement units. Increasing the time for standalone spacecraft navigation therefore requires fundamental improvements in gyroscope technologies. One promising solution to enhance gyro sensitivity is to place an anomalous dispersion or fast light material inside the gyro cavity. The fast light essentially provides a positive feedback to the gyro response, resulting in a larger measured beat frequency for a given rotation rate as shown in figure 1. Game Changing Development has been investing in this idea through the Fast Light Optical Gyros (FLOG) project, a collaborative effort which began in FY 2013 between NASA Marshall Space Flight Center (MSFC), the U.S. Army Aviation and Missile Research, Development, and Engineering Center (AMRDEC), and Northwestern University. MSFC and AMRDEC are working on the development of a passive FLOG (PFLOG), while Northwestern is developing an active FLOG (AFLOG). The project has demonstrated new benchmarks in the state of the art for scale factor sensitivity enhancement. Recent results show cavity scale factor enhancements of approx.100 for passive cavities.
Accelerating read mapping with FastHASH.
Xin, Hongyi; Lee, Donghyuk; Hormozdiari, Farhad; Yedkar, Samihan; Mutlu, Onur; Alkan, Can
2013-01-01
With the introduction of next-generation sequencing (NGS) technologies, we are facing an exponential increase in the amount of genomic sequence data. The success of all medical and genetic applications of next-generation sequencing critically depends on the existence of computational techniques that can process and analyze the enormous amount of sequence data quickly and accurately. Unfortunately, the current read mapping algorithms have difficulties in coping with the massive amounts of data generated by NGS.We propose a new algorithm, FastHASH, which drastically improves the performance of the seed-and-extend type hash table based read mapping algorithms, while maintaining the high sensitivity and comprehensiveness of such methods. FastHASH is a generic algorithm compatible with all seed-and-extend class read mapping algorithms. It introduces two main techniques, namely Adjacency Filtering, and Cheap K-mer Selection.We implemented FastHASH and merged it into the codebase of the popular read mapping program, mrFAST. Depending on the edit distance cutoffs, we observed up to 19-fold speedup while still maintaining 100% sensitivity and high comprehensiveness.
Metabolic Effects of Intermittent Fasting.
Patterson, Ruth E; Sears, Dorothy D
2017-08-21
The objective of this review is to provide an overview of intermittent fasting regimens, summarize the evidence on the health benefits of intermittent fasting, and discuss physiological mechanisms by which intermittent fasting might lead to improved health outcomes. A MEDLINE search was performed using PubMed and the terms "intermittent fasting," "fasting," "time-restricted feeding," and "food timing." Modified fasting regimens appear to promote weight loss and may improve metabolic health. Several lines of evidence also support the hypothesis that eating patterns that reduce or eliminate nighttime eating and prolong nightly fasting intervals may result in sustained improvements in human health. Intermittent fasting regimens are hypothesized to influence metabolic regulation via effects on (a) circadian biology, (b) the gut microbiome, and (c) modifiable lifestyle behaviors, such as sleep. If proven to be efficacious, these eating regimens offer promising nonpharmacological approaches to improving health at the population level, with multiple public health benefits.
Using ultra fast analog memories for fast photodetector readout
NASA Astrophysics Data System (ADS)
Breton, Dominique; Delagnes, Eric; Maalmi, Jihane
2012-12-01
The recent progresses in the field of photodetection have pushed the performances of the detectors toward the picosecond scale. Necessary precise charge and time measurement are mainly based on high-end oscilloscopes or commercial modules, but these solutions are expensive and house very few channels. The USB-WaveCatcher board provides high performances over a short time window. It houses two 12-bit 500-MHz-bandwidth digitizers sampling up to 3.2 GS/s. Its low consumption allows it to be USB-powered and it offers a lot of functionalities. The board has been used in different test benches dedicated to fast MCP-PMTs or SiPMs, and a reproducible time precision better than 10 ps rms has been demonstrated. Implementations with up to 16 channels have been designed and exhibit the same time precision. The USB-WaveCatcher thus seems to be a wonderful tool for photodetector characterization. Our next step is to widely expand the number of channels while keeping the 10 ps time precision.
Neighborhood fast food availability and fast food consumption.
Oexle, Nathalie; Barnes, Timothy L; Blake, Christine E; Bell, Bethany A; Liese, Angela D
2015-09-01
Recent nutritional and public health research has focused on how the availability of various types of food in a person's immediate area or neighborhood influences his or her food choices and eating habits. It has been theorized that people living in areas with a wealth of unhealthy fast-food options may show higher levels of fast-food consumption, a factor that often coincides with being overweight or obese. However, measuring food availability in a particular area is difficult to achieve consistently: there may be differences in the strict physical locations of food options as compared to how individuals perceive their personal food availability, and various studies may use either one or both of these measures. The aim of this study was to evaluate the association between weekly fast-food consumption and both a person's perceived availability of fast-food and an objective measure of fast-food presence - Geographic Information Systems (GIS) - within that person's neighborhood. A randomly selected population-based sample of eight counties in South Carolina was used to conduct a cross-sectional telephone survey assessing self-report fast-food consumption and perceived availability of fast food. GIS was used to determine the actual number of fast-food outlets within each participant's neighborhood. Using multinomial logistic regression analyses, we found that neither perceived availability nor GIS-based presence of fast-food was significantly associated with weekly fast-food consumption. Our findings indicate that availability might not be the dominant factor influencing fast-food consumption. We recommend using subjective availability measures and considering individual characteristics that could influence both perceived availability of fast food and its impact on fast-food consumption. If replicated, our findings suggest that interventions aimed at reducing fast-food consumption by limiting neighborhood fast-food availability might not be completely effective.
Neighborhood fast food availability and fast food consumption
Oexle, Nathalie; Barnes, Timothy L; Blake, Christine E; Bell, Bethany A; Liese, Angela D
2015-01-01
Recent nutritional and public health research has focused on how the availability of various types of food in a person’s immediate area or neighborhood influences his or her food choices and eating habits. It has been theorized that people living in areas with a wealth of unhealthy fast-food options may show higher levels of fast-food consumption, a factor that often coincides with being overweight or obese. However, measuring food availability in a particular area is difficult to achieve consistently: there may be differences in the strict physical locations of food options as compared to how individuals perceive their personal food availability, and various studies may use either one or both of these measures. The aim of this study was to evaluate the association between weekly fast-food consumption and both a person’s perceived availability of fast-food and an objective measure of fast-food presence—Geographic Information Systems (GIS)—within that person’s neighborhood. A randomly selected population-based sample of eight counties in South Carolina was used to conduct a cross-sectional telephone survey assessing self-report fast-food consumption and perceived availability of fast food. GIS was used to determine the actual number of fast-food outlets within each participant’s neighborhood. Using multinomial logistic regression analyses, we found that neither perceived availability nor GIS-based presence of fast-food was significantly associated with weekly fast-food consumption. Our findings indicate that availability might not be the dominant factor influencing fast-food consumption. We recommend using subjective availability measures and considering individual characteristics that could influence both perceived availability of fast food and its impact on fast-food consumption. If replicated, our findings suggest that interventions aimed at reducing fast-food consumption by limiting neighborhood fast-food availability might not be completely
Fast curve fitting using neural networks
NASA Astrophysics Data System (ADS)
Bishop, C. M.; Roach, C. M.
1992-10-01
Neural networks provide a new tool for the fast solution of repetitive nonlinear curve fitting problems. In this article we introduce the concept of a neural network, and we show how such networks can be used for fitting functional forms to experimental data. The neural network algorithm is typically much faster than conventional iterative approaches. In addition, further substantial improvements in speed can be obtained by using special purpose hardware implementations of the network, thus making the technique suitable for use in fast real-time applications. The basic concepts are illustrated using a simple example from fusion research, involving the determination of spectral line parameters from measurements of B iv impurity radiation in the COMPASS-C tokamak.
Introduction to FAST central control system
NASA Astrophysics Data System (ADS)
Sun, Jinghai; Zhu, Lichun; Jiang, Zhiqian
2016-07-01
FAST is the largest single dish radio telescope in the world. During observation, part of spherical reflector forms paraboloid to the source direction, meanwhile the feed is placed to instant focus. The control of telescope is difficult and complicated. An autonomous central control system is designed and implemented for methodically and efficiently operation. The system connects and coordinates all subsystems including control, measurement and health monitoring for reflector, feed support and receiver respectively. The main functions are managing observation tasks, commanding subsystems, storing operating data, monitoring statuses and providing the uniform time standard. In this paper, the functions, software and hardware of FAST central control system are presented. The relative infrastructures such as power, network and control room arrangement are introduced.
Fast multipole methods for particle dynamics
Kurzak, J.; Pettitt, B. M.
2008-01-01
The growth of simulations of particle systems has been aided by advances in computer speed and algorithms. The adoption of O(N) algorithms to solve N-body simulation problems has been less rapid due to the fact that such scaling was only competitive for relatively large N. Our work seeks to find algorithmic modifications and practical implementations for intermediate values of N in typical use for molecular simulations. This article reviews fast multipole techniques for calculation of electrostatic interactions in molecular systems. The basic mathematics behind fast summations applied to long ranged forces is presented along with advanced techniques for accelerating the solution, including our most recent developments. The computational efficiency of the new methods facilitates both simulations of large systems as well as longer and therefore more realistic simulations of smaller systems. PMID:19194526
Fabrication techniques for very fast diffractive lenses
NASA Technical Reports Server (NTRS)
Tai, Anthony M.; Marron, Joseph C.
1993-01-01
Aspheric lenses with arbitrary phase functions can be fabricated on thin light weight substrates via the binary optics fabrication technique. However, it is difficult and costly to fabricate a fast lens (f/number less than 1) for use as the shorter wavelengths. The pitch of the masks and the alignment accuracy must be very fine. For a large lens, the space-bandwidth product of the element can also become impractically large. In this paper, two alternate approaches for the fabrication of fast aspheric diffractive lenses are described. The first approach fabricates the diffractive lens interferometrically, utilizing a spherical wavefront to provide the optical power of the lens and a computer generated hologram to create the aspheric components. The second approach fabricates the aspheric diffractive lens in the form if a higher order kinoform which trades groove profile fidelity for coarser feature size. The design and implementation issues for these two fabrication techniques are discussed.
Fast interferometric second harmonic generation microscopy
Bancelin, Stéphane; Couture, Charles-André; Légaré, Katherine; Pinsard, Maxime; Rivard, Maxime; Brown, Cameron; Légaré, François
2016-01-01
We report the implementation of fast Interferometric Second Harmonic Generation (I-SHG) microscopy to study the polarity of non-centrosymmetric structures in biological tissues. Using a sample quartz plate, we calibrate the spatially varying phase shift introduced by the laser scanning system. Compensating this phase shift allows us to retrieve the correct phase distribution in periodically poled lithium niobate, used as a model sample. Finally, we used fast interferometric second harmonic generation microscopy to acquire phase images in tendon. Our results show that the method exposed here, using a laser scanning system, allows to recover the polarity of collagen fibrils, similarly to standard I-SHG (using a sample scanning system), but with an imaging time about 40 times shorter. PMID:26977349
Fast evaluation of polarizable forces.
Wang, Wei; Skeel, Robert D
2005-10-22
Polarizability is considered to be the single most significant development in the next generation of force fields for biomolecular simulations. However, the self-consistent computation of induced atomic dipoles in a polarizable force field is expensive due to the cost of solving a large dense linear system at each step of a simulation. This article introduces methods that reduce the cost of computing the electrostatic energy and force of a polarizable model from about 7.5 times the cost of computing those of a nonpolarizable model to less than twice the cost. This is probably sufficient for the routine use of polarizable forces in biomolecular simulations. The reduction in computing time is achieved by an efficient implementation of the particle-mesh Ewald method, an accurate and robust predictor based on least-squares fitting, and non-stationary iterative methods whose fast convergence is accelerated by a simple preconditioner. Furthermore, with these methods, the self-consistent approach with a larger timestep is shown to be faster than the extended Lagrangian approach. The use of dipole moments from previous timesteps to calculate an accurate initial guess for iterative methods leads to an energy drift, which can be made acceptably small. The use of a zero initial guess does not lead to perceptible energy drift if a reasonably strict convergence criterion for the iteration is imposed.
Fast-earth: A global image caching architecture for fast access to remote-sensing data
NASA Astrophysics Data System (ADS)
Talbot, B. G.; Talbot, L. M.
We introduce Fast-Earth, a novel server architecture that enables rapid access to remote sensing data. Fast-Earth subdivides a WGS-84 model of the earth into small 400 × 400 meter regions with fixed locations, called plats. The resulting 3,187,932,913 indexed plats are accessed with a rapid look-up algorithm. Whereas many traditional databases store large original images as a series by collection time, requiring long searches and slow access times for user queries, the Fast-Earth architecture enables rapid access. We have prototyped a system in conjunction with a Fast-Responder mobile app to demonstrate and evaluate the concepts. We found that new data could be indexed rapidly in about 10 minutes/terabyte, high-resolution images could be chipped in less than a second, and 250 kB image chips could be delivered over a 3G network in about 3 seconds. The prototype server implemented on a very small computer could handle 100 users, but the concept is scalable. Fast-Earth enables dramatic advances in rapid dissemination of remote sensing data for mobile platforms as well as desktop enterprises.
Interaction between high harmonic fast waves and fast ions in NSTX/NSTX-U plasmas
NASA Astrophysics Data System (ADS)
Bertelli, N.; Valeo, E. J.; Gorelenkova, M.; Green, D. L.; RF SciDAC Team
2016-10-01
Fast wave (FW) heating in the ion cyclotron range of frequency (ICRF) has been successfully used to sustain and control the fusion plasma performance, and it will likely play an important role in the ITER experiment. As demonstrated in the NSTX and DIII-D experiments the interactions between fast waves and fast ions can be so strong to significantly modify the fast ion population from neutral beam injection. In fact, it has been recently found in NSTX that FWs can modify and, under certain conditions, even suppress the energetic particle driven instabilities, such as toroidal Alfvén eigenmodes and global Alfvén eigenmodes and fishbones. This paper examines such interactions in NSTX/NSTX-U plasmas by using the recent extension of the RF full-wave code TORIC to include non-Maxwellian ions distribution functions. Particular attention is given to the evolution of the fast ions distribution function w/ and w/o RF. Tests on the RF kick-operator implemented in the Monte-Carlo particle code NUBEAM is also discussed in order to move towards a self consistent evaluation of the RF wave-field and the ion distribution functions in the TRANSP code. Work supported by US DOE Contract DE-AC02-09CH11466.
Measuring Fast Ion Losses in a Reversed Field Pinch Plasma
NASA Astrophysics Data System (ADS)
Bonofiglo, P. J.; Anderson, J. K.; Almagri, A. F.; Kim, J.; Clark, J.; Capecchi, W.; Sears, S. H.
2015-11-01
The reversed field pinch (RFP) provides a unique environment to study fast ion confinement and transport. The RFP's weak toroidal field, strong magnetic shear, and ability to enter a 3D state provide a wide range of dynamics to study fast ions. Core-localized, 25 keV fast ions are sourced into MST by a tangentially injected hydrogen/deuterium neutral beam. Neutral particle analysis and measured fusion neutron flux indicate enhanced fast ion transport in the plasma core. Past experiments point to a dynamic loss of fast ions associated with the RFP's transition to a 3D state and with beam-driven, bursting magnetic modes. Consequently, fast ion transport and losses in the RFP have garnered recent attention. Valuable information on fast-ion loss, such as energy and pitch distributions, are sought to provide a better understanding of the transport mechanisms at hand. We have constructed and implemented two fast ion loss detectors (FILDs) for use on MST. The FILDs have two, independent, design concepts: collecting particles as a function of v⊥ or with pitch greater than 0.8. In this work, we present our preliminary findings and results from our FILDs on MST. This research is supported by US DOE.
Mason, R.J.; Tabak, M.
1997-10-01
The Fast Ignitor is an alternate approach to ICF in which short pulse lasers are used to initiate burn at the surface of the compressed DT fuel. The aim is to avoid the need for careful central focusing of final shocks, and possibly to lower substantially the energy requirements for ignition. Ultimately, both goals may prove crucial to Science Based Stockpile Stewardship (SBSS). This will be the case should either emerging energetic needs, or finding difficulties render the presently planned radiative fusion approach to ignition with the NIF impractical. Ignition is a first step towards the achievement of substantial energy and neutron outputs for such Stewardship.
Simplified fast neutron dosimeter
Sohrabi, Mehdi
1979-01-01
Direct fast-neutron-induced recoil and alpha particle tracks in polycarbonate films may be enlarged for direct visual observation and automated counting procedures employing electrochemical etching techniques. Electrochemical etching is, for example, carried out in a 28% KOH solution at room temperature by applying a 2000 V peak-to-peak voltage at 1 kHz frequency. Such recoil particle amplification can be used for the detection of wide neutron dose ranges from 1 mrad. to 1000 rads. or higher, if desired.
DeLuca, P.M. Jr.; Pearson, D.W.
1992-01-01
This progress report concentrates on two major areas of dosimetry research: measurement of fast neutron kerma factors for several elements for monochromatic and white spectrum neutron fields and determination of the response of thermoluminescent phosphors to various ultra-soft X-ray energies and beta-rays. Dr. Zhixin Zhou from the Shanghai Institute of Radiation Medicine, People's Republic of China brought with him special expertise in the fabrication and use of ultra-thin TLD materials. Such materials are not available in the USA. The rather unique properties of these materials were investigated during this grant period.
Snell, A.H.
1957-12-01
This patent relates to a reactor and process for carrying out a controlled fast neutron chain reaction. A cubical reactive mass, weighing at least 920 metric tons, of uranium metal containing predominantly U/sup 238/ and having a U/sup 235/ content of at least 7.63% is assembled and the maximum neutron reproduction ratio is limited to not substantially over 1.01 by insertion and removal of a varying amount of boron, the reactive mass being substantially freed of moderator.
Detering, B.A.; Donaldson, A.D.; Fincke, J.R.; Kong, P.C.; Berry, R.A.
1999-08-10
A fast quench reaction includes a reactor chamber having a high temperature heating means such as a plasma torch at its inlet and a means of rapidly expanding a reactant stream, such as a restrictive convergent-divergent nozzle at its outlet end. Metal halide reactants are injected into the reactor chamber. Reducing gas is added at different stages in the process to form a desired end product and prevent back reactions. The resulting heated gaseous stream is then rapidly cooled by expansion of the gaseous stream. 8 figs.
Cabrillat, M. Th.; Lions, N.
1985-01-08
The invention relates to a fast neutron nuclear reactor of the integrated type comprising a cylindrical inner vessel. The inner vessel comprises two concentric ferrules and the connection between the hot collector defined within this vessel and the inlet port of the exchangers is brought about by a hot structure forming a heat baffle and supported by the inner ferrule and by a cold structure surrounding the hot structure, supported by the outer ferrule and sealingly connected to the exchanger. Application to the generation of electric power in nuclear power stations.
Detering, B.A.; Donaldson, A.D.; Fincke, J.R.; Kong, P.C.; Berry, R.A.
1999-08-10
A fast quench reaction includes a reactor chamber having a high temperature heating means such as a plasma torch at its inlet and a means of rapidly expanding a reactant stream, such as a restrictive convergent-divergent nozzle at its outlet end. Metal halide reactants are injected into the reactor chamber. Reducing gas is added at different stages in the process to form a desired end product and prevent back reactions. The resulting heated gaseous stream is then rapidly cooled by expansion of the gaseous stream. 8 figs.
Detering, Brent A.; Donaldson, Alan D.; Fincke, James R.; Kong, Peter C.; Berry, Ray A.
1999-01-01
A fast quench reaction includes a reactor chamber having a high temperature heating means such as a plasma torch at its inlet and a means of rapidly expanding a reactant stream, such as a restrictive convergent-divergent nozzle at its outlet end. Metal halide reactants are injected into the reactor chamber. Reducing gas is added at different stages in the process to form a desired end product and prevent back reactions. The resulting heated gaseous stream is then rapidly cooled by expansion of the gaseous stream.
NASA Technical Reports Server (NTRS)
Birman, Kenneth P.; Schiper, Andre; Stephenson, Pat
1990-01-01
A new protocol is presented that efficiently implements a reliable, causally ordered multicast primitive and is easily extended into a totally ordered one. Intended for use in the ISIS toolkit, it offers a way to bypass the most costly aspects of ISIS while benefiting from virtual synchrony. The facility scales with bounded overhead. Measured speedups of more than an order of magnitude were obtained when the protocol was implemented within ISIS. One conclusion is that systems such as ISIS can achieve performance competitive with the best existing multicast facilities - a finding contradicting the widespread concern that fault-tolerance may be unacceptably costly.
NASA Technical Reports Server (NTRS)
Birman, Kenneth; Schiper, Andre; Stephenson, Pat
1990-01-01
A new protocol is presented that efficiently implements a reliable, causally ordered multicast primitive and is easily extended into a totally ordered one. Intended for use in the ISIS toolkit, it offers a way to bypass the most costly aspects of ISIS while benefiting from virtual synchrony. The facility scales with bounded overhead. Measured speedups of more than an order of magnitude were obtained when the protocol was implemented within ISIS. One conclusion is that systems such as ISIS can achieve performance competitive with the best existing multicast facilities--a finding contradicting the widespread concern that fault-tolerance may be unacceptably costly.
Fasting and sport: an introduction.
Maughan, R J
2010-06-01
Most humans observe an overnight fast on a daily basis, and the human body copes well with short duration fasting. Periodic fasting is widely practised for cultural, religious or health reasons. Fasting may take many different forms. Prolonged restriction of food and fluid is harmful to health and performance, and it is often automatically assumed that intermittent fasting will lead to decrements in exercise performance. Athletes who choose to fast during training or competitions may therefore be at a disadvantage. The available evidence does not entirely support this view, but there is little or no information on the effects on elite athletes competing in challenging environments. Prolonged periods of training in the fasted state may not allow optimum adaptation of muscles and other tissues. Further research on a wide range of athletes with special nutrition needs is urgently required. In events where performance might be affected, other strategies to eliminate or minimise any effects must be sought.
Mason, R.J.; Tabak, M.
1997-10-01
The Fast Ignitor is an alternate approach to ICF in which short pulse lasers are used to initiate burn at the surface of the compressed DT fuel. The aim is to avoid the need for careful central focussing of final shocks, and possibly to lower substantially the energy requirements for ignition. Ultimately, both goals may prove crucial to Stockpile Stewardship. For success with the Fast Ignitor, the laser energy must be efficiently deposited into megavolt electrons, which must, in turn, couple to the background ions within an alpha particle range. To understand this coupling, we have used ANTHEM plasma simulation code to model the transport of hot electrons generated by an intense ({ge} 3 x 10{sup 18} W/cm{sup 2}) short pulse 1.06 {mu}m laser into plasma targets over a broad range of densities (0.35 to 10{sup 4} x n{sub crit}). Ponderomotive effects are included as a force on the cold background and hot emission electrons of the form, F{sub h,c} = -({omega}{sup 2}{sub Ph,c}/2{omega}{sup 2}){del}I, in which I is the laser intensity and {omega}{sub p}{sup 2} = 4{pi}e{sup 2}n/m{sub 0}{gamma} with m{sub 0} the electron rest mass.
NASA Technical Reports Server (NTRS)
Wojciechowski, Bogdan V. (Inventor); Pegg, Robert J. (Inventor)
2003-01-01
A fast-acting valve includes an annular valve seat that defines an annular valve orifice between the edges of the annular valve seat, an annular valve plug sized to cover the valve orifice when the valve is closed, and a valve-plug holder for moving the annular valve plug on and off the annular valve seat. The use of an annular orifice reduces the characteristic distance between the edges of the valve seat. Rather than this distance being equal to the diameter of the orifice, as it is for a conventional circular orifice, the characteristic distance equals the distance between the inner and outer radii (for a circular annulus). The reduced characteristic distance greatly reduces the gap required between the annular valve plug and the annular valve seat for the valve to be fully open, thereby greatly reducing the required stroke and corresponding speed and acceleration of the annular valve plug. The use of a valve-plug holder that is under independent control to move the annular valve plug between its open and closed positions is important for achieving controllable fast operation of the valve.
Nguyen, M.N.; /SLAC
2007-06-18
As part of an improvement project on the linear accelerator at SLAC, it was necessary to replace the original thyratron trigger generator, which consisted of two chassis, two vacuum tubes, and a small thyratron. All solid-state, fast rise, and high voltage thyratron drivers, therefore, have been developed and built for the 244 klystron modulators. The rack mounted, single chassis driver employs a unique way to control and generate pulses through the use of an asymmetric SCR, a PFN, a fast pulse transformer, and a saturable reactor. The resulting output pulse is 2 kV peak into 50 {Omega} load with pulse duration of 1.5 {mu}s FWHM at 180 Hz. The pulse risetime is less than 40 ns with less than 1 ns jitter. Various techniques are used to protect the SCR from being damaged by high voltage and current transients due to thyratron breakdowns. The end-of-line clipper (EOLC) detection circuit is also integrated into this chassis to interrupt the modulator triggering in the event a high percentage of line reflections occurred.
Generalized fast multipole method
NASA Astrophysics Data System (ADS)
Létourneau, Pierre-David; Cecka, Cristopher; Darve, Eric
2010-06-01
The fast multipole method (FMM) is a technique allowing the fast calculation of long-range interactions between N points in O(N) or O(N ln N) steps with some prescribed error tolerance. The FMM has found many applications in the field of integral equations and boundary element methods, in particular by accelerating the solution of dense linear systems arising from such formulations. Original FMMs required analytical expansions of the kernel, for example using spherical harmonics or Taylor expansions. In recent years, the range of applicability and the ease of use of FMMs has been extended by the introduction of black box [1] or kernel independent techniques [2]. In these approaches, the user only provides a subroutine to numerically calculate the interaction kernel. This allows changing the definition of the kernel with minimal change to the computer program. In this talk we will present a novel kernel independent FMM, which leads to diagonal multipole-to-local operators. This results in a significant reduction in the computational cost [1], in particular when high accuracy is needed. The approach is based on Cauchy's integral formula and the Laplace transform. We will present a numerical analysis of the convergence, methods to choose the parameters in the FMM given some tolerance, and the steps required to build a multilevel scheme from the single level formulation. Numerical results are given for benchmark calculations to demonstrate the accuracy as a function of the number of multipole coefficients, and the computational cost of the different steps in the method.
Fast Fourier transform telescope
Tegmark, Max; Zaldarriaga, Matias
2009-04-15
We propose an all-digital telescope for 21 cm tomography, which combines key advantages of both single dishes and interferometers. The electric field is digitized by antennas on a rectangular grid, after which a series of fast Fourier transforms recovers simultaneous multifrequency images of up to half the sky. Thanks to Moore's law, the bandwidth up to which this is feasible has now reached about 1 GHz, and will likely continue doubling every couple of years. The main advantages over a single dish telescope are cost and orders of magnitude larger field-of-view, translating into dramatically better sensitivity for large-area surveys. The key advantages over traditional interferometers are cost (the correlator computational cost for an N-element array scales as Nlog{sub 2}N rather than N{sup 2}) and a compact synthesized beam. We argue that 21 cm tomography could be an ideal first application of a very large fast Fourier transform telescope, which would provide both massive sensitivity improvements per dollar and mitigate the off-beam point source foreground problem with its clean beam. Another potentially interesting application is cosmic microwave background polarization.
Large-Constraint-Length, Fast Viterbi Decoder
NASA Technical Reports Server (NTRS)
Collins, O.; Dolinar, S.; Hsu, In-Shek; Pollara, F.; Olson, E.; Statman, J.; Zimmerman, G.
1990-01-01
Scheme for efficient interconnection makes VLSI design feasible. Concept for fast Viterbi decoder provides for processing of convolutional codes of constraint length K up to 15 and rates of 1/2 to 1/6. Fully parallel (but bit-serial) architecture developed for decoder of K = 7 implemented in single dedicated VLSI circuit chip. Contains six major functional blocks. VLSI circuits perform branch metric computations, add-compare-select operations, and then store decisions in traceback memory. Traceback processor reads appropriate memory locations and puts out decoded bits. Used as building block for decoders of larger K.
Fast Convolution Algorithms and Associated VHSIC Architectures.
1983-05-23
Idenftfy by block number) Finite field, Mersenne prime , Fermat number, primitive element, number- theoretic transform, cyclic convolution, polynomial...elements of order 2 P+p and 2k n in the finite field GF(q 2), where q = 2P-l is a Mersenne prime , p is a prime number, and n is a divisor of 2pl...Abstract - A high-radix f.f.t. algorithm for computing transforms over GF(q2), where q is a Mersenne prime , is developed to implement fast circular
Large-Constraint-Length, Fast Viterbi Decoder
NASA Technical Reports Server (NTRS)
Collins, O.; Dolinar, S.; Hsu, In-Shek; Pollara, F.; Olson, E.; Statman, J.; Zimmerman, G.
1990-01-01
Scheme for efficient interconnection makes VLSI design feasible. Concept for fast Viterbi decoder provides for processing of convolutional codes of constraint length K up to 15 and rates of 1/2 to 1/6. Fully parallel (but bit-serial) architecture developed for decoder of K = 7 implemented in single dedicated VLSI circuit chip. Contains six major functional blocks. VLSI circuits perform branch metric computations, add-compare-select operations, and then store decisions in traceback memory. Traceback processor reads appropriate memory locations and puts out decoded bits. Used as building block for decoders of larger K.
Slow and fast light in semiconductors
NASA Astrophysics Data System (ADS)
Sedgwick, Forrest Grant
Slow and fast light are the propagation of optical signals at group velocities below and above the speed of light in a given medium. There has been great interest in the use of nonlinear optics to engineer slow and fast light dispersion for applications in optical communications and radio-frequency or microwave photonics. Early results in this field were primarily confined to dilute atomic systems. While these results were impressive, they had two major barriers to practical application. First, the wavelengths were not compatible with fiber optic telecommunications. More importantly, the bandwidth obtainable in these experiments was inherently low; 100 kHz or less. Within the last five years slow and fast light effects have been observed and engineered in a much wider variety of systems. In this work, we detail our efforts to realize slow and fast light in semiconductor systems. There are three primary advantages of semiconductor systems: fiber-compatible wavelengths, larger bandwidth, and simplification of integration with other optical components. In this work we will explore three different types of physical mechanisms for implementing slow and fast light. The first is electromagnetically induced transparency (EIT). In transporting this process to semiconductors, we initially turn our attention to quantum dots or "artificial atoms". We present simulations of a quantum dot EIT-based device within the context of an optical communications link and we derive results which are generally applicable to a broad class of slow light devices. We then present experimental results realizing EIT in quantum wells by using long-lived electron spin coherence. The second mechanism we will explore is coherent population oscillations (CPO), also known as carrier density pulsations (CDP). We examine for the first time how both slow and fast light may be achieved in a quantum well semiconductor optical amplifier (SOA) while operating in the gain regime. Again, we simulate the device
Fast Food Jobs. National Study of Fast Food Employment.
ERIC Educational Resources Information Center
Charner, Ivan; Fraser, Bryna Shore
A study examined employment in the fast-food industry. The national survey collected data from employees at 279 fast-food restaurants from seven companies. Female employees outnumbered males by two to one. The ages of those fast-food employees in the survey sample ranged from 14 to 71, with fully 70 percent being in the 16- to 20-year-old age…
Islamic fasting and multiple sclerosis
2014-01-01
Background Month-long daytime Ramadan fasting pose s major challenges to multiple sclerosis (MS) patients in Muslim countries. Physicians should have practical knowledge on the implications of fasting on MS. We present a summary of database searches (Cochrane Database of Systematic Reviews, PubMed) and a mini-symposium on Ramadan fasting and MS. In this symposium, we aimed to review the effect of fasting on MS and suggest practical guidelines on management. Discussion In general, fasting is possible for most stable patients. Appropriate amendment of drug regimens, careful monitoring of symptoms, as well as providing patients with available evidence on fasting and MS are important parts of management. Evidence from experimental studies suggests that calorie restriction before disease induction reduces inflammation and subsequent demyelination and attenuates disease severity. Fasting does not appear to have unfavorable effects on disease course in patients with mild disability (Expanded Disability Status Scale (EDSS) score ≤3). Most experts believed that during fasting (especially in summer), some MS symptoms (fatigue, fatigue perception, dizziness, spasticity, cognitive problems, weakness, vision, balance, gait) might worsen but return to normal levels during feasting. There was a general consensus that fasting is not safe for patients: on high doses of anti-convulsants, anti-spastics, and corticosteroids; with coagulopathy or active disease; during attacks; with EDSS score ≥7. Summary These data suggest that MS patients should have tailored care. Fasting in MS patients is a challenge that is directly associated with the spiritual belief of the patient. PMID:24655543
Fast approximate stochastic tractography.
Iglesias, Juan Eugenio; Thompson, Paul M; Liu, Cheng-Yi; Tu, Zhuowen
2012-01-01
Many different probabilistic tractography methods have been proposed in the literature to overcome the limitations of classical deterministic tractography: (i) lack of quantitative connectivity information; and (ii) robustness to noise, partial volume effects and selection of seed region. However, these methods rely on Monte Carlo sampling techniques that are computationally very demanding. This study presents an approximate stochastic tractography algorithm (FAST) that can be used interactively, as opposed to having to wait several minutes to obtain the output after marking a seed region. In FAST, tractography is formulated as a Markov chain that relies on a transition tensor. The tensor is designed to mimic the features of a well-known probabilistic tractography method based on a random walk model and Monte-Carlo sampling, but can also accommodate other propagation rules. Compared to the baseline algorithm, our method circumvents the sampling process and provides a deterministic solution at the expense of partially sacrificing sub-voxel accuracy. Therefore, the method is strictly speaking not stochastic, but provides a probabilistic output in the spirit of stochastic tractography methods. FAST was compared with the random walk model using real data from 10 patients in two different ways: 1. the probability maps produced by the two methods on five well-known fiber tracts were directly compared using metrics from the image registration literature; and 2. the connectivity measurements between different regions of the brain given by the two methods were compared using the correlation coefficient ρ. The results show that the connectivity measures provided by the two algorithms are well-correlated (ρ = 0.83), and so are the probability maps (normalized cross correlation 0.818 ± 0.081). The maps are also qualitatively (i.e., visually) very similar. The proposed method achieves a 60x speed-up (7 s vs. 7 min) over the Monte Carlo sampling scheme, therefore
NASA Technical Reports Server (NTRS)
Barnard, Stephen T.; Simon, Horst; Lasinski, T. A. (Technical Monitor)
1994-01-01
The design of a parallel implementation of multilevel recursive spectral bisection is described. The goal is to implement a code that is fast enough to enable dynamic repartitioning of adaptive meshes.
Methods for performing fast discrete curvelet transforms of data
Candes, Emmanuel; Donoho, David; Demanet, Laurent
2010-11-23
Fast digital implementations of the second generation curvelet transform for use in data processing are disclosed. One such digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while another is based on the wrapping of specially selected Fourier samples. Both digital transformations return a table of digital curvelet coefficients indexed by a scale parameter, an orientation parameter, and a spatial location parameter. Both implementations are fast in the sense that they run in about O(n.sup.2 log n) flops for n by n Cartesian arrays or about O(N log N) flops for Cartesian arrays of size N=n.sup.3; in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.
Davis, F.J.; Hurst, G.S.; Reinhardt, P.W.
1959-08-18
An improved proton recoil spectrometer for determining the energy spectrum of a fast neutron beam is described. Instead of discriminating against and thereby"throwing away" the many recoil protons other than those traveling parallel to the neutron beam axis as do conventional spectrometers, this device utilizes protons scattered over a very wide solid angle. An ovoidal gas-filled recoil chamber is coated on the inside with a scintillator. The ovoidal shape of the sensitive portion of the wall defining the chamber conforms to the envelope of the range of the proton recoils from the radiator disposed within the chamber. A photomultiplier monitors the output of the scintillator, and a counter counts the pulses caused by protons of energy just sufficient to reach the scintillator.
Bender, M.; Bennett, F.K.; Kuckes, A.F.
1963-09-17
A fast-acting electric switch is described for rapidly opening a circuit carrying large amounts of electrical power. A thin, conducting foil bridges a gap in this circuit and means are provided for producing a magnetic field and eddy currents in the foil, whereby the foil is rapidly broken to open the circuit across the gap. Advantageously the foil has a hole forming two narrow portions in the foil and the means producing the magnetic field and eddy currents comprises an annular coil having its annulus coaxial with the hole in the foil and turns adjacent the narrow portions of the foil. An electrical current flows through the coil to produce the magnetic field and eddy currents in the foil. (AEC)
Nguyen, M.N.; Cassel, R.L.
1991-04-01
A fast solid-state pulse generator used as a thyratron grid driver for kicker pulsers, has been developed and built with power MOSFETs and a transmission line transformer. The MOSFET, pulsed on and off by a pair of P-N channel HEXFETs, switches charged capacitors into the transformer connected in parallel on one end and in series on the other end to step up the voltage. The resulting output pulse parameters are 2 kilovolts peak (into 50 Ohms), 13 nanoseconds risetime (10--90%), 250 nanoseconds duration, and less than 50 picoseconds pulse-to-pulse jitter. Various methods are employed to protect the MOSFETs from thyratron arc back, including the use of TransZorbs and a magnetic diode. 3 refs., 3 figs.
NASA Astrophysics Data System (ADS)
Kaspi, Victoria M.
2017-01-01
Fast Radio Bursts (FRBs) are a recently discovered phenomenon consisting of short (few ms) bursts of radio waves that have dispersion measures that strongly suggest an extragalactic and possibly cosmological origin. Current best estimates for the rate of FRBs is several thousand per sky per day at radio frequencies near 1.4 GHz. Even with so high a rate, to date, fewer than 20 FRBs have been reported, with one source showing repeated bursts. In this talk I will describe known FRB properties including what is known about the lone repeating source, as well as models for the origin of these mysterious events. I will also describe the CHIME radio telescope, currently under construction in Canada. Thanks to its great sensitivity and unprecedented field-of-view, CHIME promises major progress on FRBs.
Batzer, T.H.; Cummings, D.B.; Ryan, J.F.
1962-05-22
A high-current, fast-acting switch is designed for utilization as a crowbar switch in a high-current circuit such as used to generate the magnetic confinement field of a plasma-confining and heat device, e.g., Pyrotron. The device particularly comprises a cylindrical housing containing two stationary, cylindrical contacts between which a movable contact is bridged to close the switch. The movable contact is actuated by a differential-pressure, airdriven piston assembly also within the housing. To absorb the acceleration (and the shock imparted to the device by the rapidly driven, movable contact), an adjustable air buffer assembly is provided, integrally connected to the movable contact and piston assembly. Various safety locks and circuit-synchronizing means are also provided to permit proper cooperation of the invention and the high-current circuit in which it is installed. (AEC)
Cyclic pulse coding for fast BOTDA fiber sensors.
Taki, M; Muanenda, Y; Oton, C J; Nannipieri, T; Signorini, A; Di Pasquale, F
2013-08-01
A cyclic pulse coding technique is proposed and experimentally demonstrated for fast implementation of long-range Brillouin optical time-domain analysis (BOTDA). The proposed technique allows for accurate temperature and strain measurements with meter-scale spatial resolution over kilometers of standard single-mode fiber, with subsecond measurement times.
Adaptive line enhancers for fast acquisition
NASA Technical Reports Server (NTRS)
Yeh, H.-G.; Nguyen, T. M.
1994-01-01
Three adaptive line enhancer (ALE) algorithms and architectures - namely, conventional ALE, ALE with double filtering, and ALE with coherent accumulation - are investigated for fast carrier acquisition in the time domain. The advantages of these algorithms are their simplicity, flexibility, robustness, and applicability to general situations including the Earth-to-space uplink carrier acquisition and tracking of the spacecraft. In the acquisition mode, these algorithms act as bandpass filters; hence, the carrier-to-noise ratio (CNR) is improved for fast acquisition. In the tracking mode, these algorithms simply act as lowpass filters to improve signal-to-noise ratio; hence, better tracking performance is obtained. It is not necessary to have a priori knowledge of the received signal parameters, such as CNR, Doppler, and carrier sweeping rate. The implementation of these algorithms is in the time domain (as opposed to the frequency domain, such as the fast Fourier transform (FFT)). The carrier frequency estimation can be updated in real time at each time sample (as opposed to the batch processing of the FFT). The carrier frequency to be acquired can be time varying, and the noise can be non-Gaussian, nonstationary, and colored.
Calorie Labeling, Fast Food Purchasing and Restaurant Visits
Elbel, Brian; Mijanovich, Tod; Dixon, Beth; Abrams, Courtney; Weitzman, Beth; Kersh, Rogan; Auchincloss, Amy H.; Ogedegbe, Gbenga
2013-01-01
Objective Obesity is a pressing public health problem without proven population-wide solutions. Researchers sought to determine whether a city-mandated policy requiring calorie labeling at fast food restaurants was associated with consumer awareness of labels, calories purchased and fast food restaurant visits. Design and Methods Difference-in-differences design, with data collected from consumers outside fast food restaurants and via a random digit dial telephone survey, before (December 2009) and after (June 2010) labeling in Philadelphia (which implemented mandatory labeling) and Baltimore (matched comparison city). Measures included: self-reported use of calorie information, calories purchased determined via fast food receipts, and self-reported weekly fast-food visits. Results The consumer sample was predominantly Black (71%), and high school educated (62%). Post-labeling, 38% of Philadelphia consumers noticed the calorie labels for a 33 percentage point (p<.001) increase relative to Baltimore. Calories purchased and number of fast food visits did not change in either city over time. Conclusions While some consumer reports noticing and using calorie information, no population level changes were noted in calories purchased or fast food visits. Other controlled studies are needed to examine the longer term impact of labeling as it becomes national law. PMID:24136905
Calorie labeling, fast food purchasing and restaurant visits.
Elbel, Brian; Mijanovich, Tod; Dixon, L Beth; Abrams, Courtney; Weitzman, Beth; Kersh, Rogan; Auchincloss, Amy H; Ogedegbe, Gbenga
2013-11-01
Obesity is a pressing public health problem without proven population-wide solutions. Researchers sought to determine whether a city-mandated policy requiring calorie labeling at fast food restaurants was associated with consumer awareness of labels, calories purchased and fast food restaurant visits. Difference-in-differences design, with data collected from consumers outside fast food restaurants and via a random digit dial telephone survey, before (December 2009) and after (June 2010) labeling in Philadelphia (which implemented mandatory labeling) and Baltimore (matched comparison city). Measures included: self-reported use of calorie information, calories purchased determined via fast food receipts, and self-reported weekly fast-food visits. The consumer sample was predominantly Black (71%), and high school educated (62%). Postlabeling, 38% of Philadelphia consumers noticed the calorie labels for a 33% point (P < 0.001) increase relative to Baltimore. Calories purchased and number of fast food visits did not change in either city over time. While some consumers report noticing and using calorie information, no population level changes were noted in calories purchased or fast food visits. Other controlled studies are needed to examine the longer term impact of labeling as it becomes national law. Copyright © 2013 The Obesity Society.
Fast explicit diffiusion for long-time integration of parabolic problems
NASA Astrophysics Data System (ADS)
Bähr, Martin; Breuß, Michael; Wunderlich, Ralf
2017-07-01
The goal of this paper is to motivate the application of the recent numerical scheme called Fast Explicit Diffusion (FED) to solve long-term parabolic problems. With the purpose of performing long integration times the FED method is a simple and fast explicit solver, which has been introduced in the field of image processing. We show that FED is at least as fast as standard implicit methods, often has comparable or even better accuracy and is much easier to implement.
Flight Research into Simple Adaptive Control on the NASA FAST Aircraft
NASA Technical Reports Server (NTRS)
Hanson, Curtis E.
2011-01-01
A series of simple adaptive controllers with varying levels of complexity were designed, implemented and flight tested on the NASA Full-Scale Advanced Systems Testbed (FAST) aircraft. Lessons learned from the development and flight testing are presented.
A Coprocessor for the Fast Tracker Simulation
NASA Astrophysics Data System (ADS)
Gentsos, Christos; Volpi, Guido; Gkaitatzis, Stamatios; Giannetti, Paola; Citraro, Saverio; Crescioli, Francesco; Kordas, Kostas; Nikolaidis, Spiridon
2017-06-01
The Fast Tracker (FTK) executes real-time tracking for online event selection in the ATLAS experiment. Data processing speed is achieved by exploiting pipelining and parallel processing. Track reconstruction is executed in two stages. The first stage, implemented on custom application-specific integrated circuit (ASICs) called associative memory (AM) chips, performs pattern matching (PM) to identify track candidates in low resolution. The second stage, implemented on field programmable gate arrays (FPGAs), builds on the PM results, performing track fitting in full resolution. The use of such a parallelized architecture for real-time event selection opens up a new, huge computing problem related to the analysis of the acquired samples. Millions of events have to be simulated to determine the efficiency and the properties of the reconstructed tracks with a small statistical error. The AM chip emulation is a computationally intensive task when implemented in software running on commercial resources. This paper proposes the use of a hardware coprocessor to solve this problem efficiently. We report on the implementation and performance of all the functions requiring massive computing power in a modern, compact embedded system for track reconstruction. That system is the miniaturization of the complex FTK processing unit, which is also well suited for powering applications outside the realm of high energy physics.
FPGA design of the fast decoder for burst errors correction
NASA Astrophysics Data System (ADS)
Mytsko, E. A.; Malchukov, A. N.; Zoev, I. V.; E Ryzhova, S.; Kim, V. L.
2017-01-01
The paper is about FPGA design of the fast single stage decoder for correcting burst errors during data transmission. The decoder allows correcting burst errors with 3 bits for a 15 bit codeword and a 7 bit check unit. The description of a generator polynomial search algorithm for building error-correcting codes was represented. The module structure of the decoder was designed for FPGA implementation. There are modules, such as remainder, check_pattern, decoder2, implemented by asynchronous combinational circuits without memory elements, and they process each codeword shift in parallel. Proposed implementation allows getting high performance about ∼20 ns.
Fast word reading in pure alexia: "fast, yet serial".
Bormann, Tobias; Wolfer, Sascha; Hachmann, Wibke; Neubauer, Claudia; Konieczny, Lars
2015-01-01
Pure alexia is a severe impairment of word reading in which individuals process letters serially with a pronounced length effect. Yet, there is considerable variation in the performance of alexic readers with generally very slow, but also occasionally fast responses, an observation addressed rarely in previous reports. It has been suggested that "fast" responses in pure alexia reflect residual parallel letter processing or that they may even be subserved by an independent reading system. Four experiments assessed fast and slow reading in a participant (DN) with pure alexia. Two behavioral experiments investigated frequency, neighborhood, and length effects in forced fast reading. Two further experiments measured eye movements when DN was forced to read quickly, or could respond faster because words were easier to process. Taken together, there was little support for the proposal that "qualitatively different" mechanisms or reading strategies underlie both types of responses in DN. Instead, fast responses are argued to be generated by the same serial-reading strategy.
A new fast algorithm for computing a complex number: Theoretic transforms
NASA Technical Reports Server (NTRS)
Reed, I. S.; Liu, K. Y.; Truong, T. K.
1977-01-01
A high-radix fast Fourier transformation (FFT) algorithm for computing transforms over GF(sq q), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.
A new fast algorithm for computing a complex number: Theoretic transforms
NASA Technical Reports Server (NTRS)
Reed, I. S.; Liu, K. Y.; Truong, T. K.
1977-01-01
A high-radix fast Fourier transformation (FFT) algorithm for computing transforms over GF(sq q), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.
Meyers, M C; Brown, B R; Bloom, J A
2001-01-01
The popularity of fast pitch softball in the US and throughout the world is well documented. Along with this popularity, there has been a concomitant increase in the number of injuries. Nearly 52% of cases qualify as major disabling injuries requiring 3 weeks or more of treatment and 2% require surgery. Interestingly, 75% of injuries occur during away games and approximately 31% of traumas occur during nonpositional and conditioning drills. Injuries range from contusions and tendinitis to ligamentous disorders and fractures. Although head and neck traumas account for 4 to 12% of cases, upper extremity traumas account for 23 to 47% of all injuries and up to 19% of cases involve the knee. Approximately 34 to 42% of injuries occur when the athlete collides with another individual or object. Other factors involved include the quality of playing surface, athlete's age and experience level, and the excessive physical demands associated with the sport. Nearly 24% of injuries involve base running and are due to poor judgement, sliding technique, current stationary base design, unorthodox joint and extremity position during ground impact and catching of cleats. The increasing prevalence of overtraining syndrome among athletes has been attributed to an unclear definition of an optimal training zone, poor communication between player and coach, and the limited ability of bone and connective tissue to quickly respond to match the demands of the sport. This has led routinely to arm, shoulder and lumbar instability, chronic nonsteroidal anti-inflammatory drug (NSAID) use and time loss injuries in 45% of pitching staff during a single season. Specific attention to a safer playing environment, coaching and player education, and sport-specific training and conditioning would reduce the risk, rate and severity of fast pitch traumas. Padding of walls, backstops, rails and dugout areas, as well as minimising use of indoor facilities, is suggested to decrease the number of collision
NASA Astrophysics Data System (ADS)
Jägers, Aswin P. L.; Sliepen, Guus; Bettonvil, Felix C. M.; Hammerschlag, Robert H.
2008-07-01
In the near future ELTs (Extreme Large Telescopes) will be built. Preferably these telescopes should operate without obstructions in the near surrounding to reach optimal seeing conditions and avoid large turbulences with wind-gust accelerations around large obstacles. This applies also to future large solar telescopes. At present two foldable dome prototypes have been built on the Canary Islands: the Dutch Open Telescope (DOT, La Palma) and the GREGOR Telescope (Tenerife), having a diameter of 7 and 9 meter, respectively. The domes are usually fully retracted during observations. The research consists of measurements on the two domes. New camera systems are developed and placed inside the domes for precise dome deformation measurements within 0.1 mm over the whole dome size. Simultaneously, a variety of wind-speed and -direction sensors measure the wind field around the dome. In addition, fast sensitive air-pressure sensors placed on the supporting bows measure the wind pressure. The aim is to predict accurately the expected forces and deformations on up-scaled, fully retractable domes to make their construction more economically. The dimensions of 7 and 9 meter are large enough for realistic on-site tests in gusty wind and will give much more information than wind tunnel experiments.
NASA Astrophysics Data System (ADS)
Carrion, Philip M.
1990-09-01
This paper can be considered as a continuation of the work by Carrion and Carneiro (1989), where a generalized approach to linearized inversion of geophysical data was developed. Their method allows one to incorporate virtually any constraints in the inversion and reformulate the problem in the dual space of Langrangian multipliers (see also Carrion, 1989a). The constrained tomography makes traveltime inversion robust: it automatically rejects “bad data” which correspond to solutions beyond the chosen constraints and allows one to start inversion with an arbitrary chosen initial model.In this paper, I will derive basic formulas for constrained tomographic imaging that can be used in such areas of geophysics as global mapping of the earth interior, exploration geophysics, etc. The method is fast: an example that will be shown in the paper took only 6 min. of VAX CPU time. Had the conventional least-squares matrix inversion been used it would have taken more than 10 hours of the CPU time to solve the same problem.
Fast Fuzzy Arithmetic Operations
NASA Technical Reports Server (NTRS)
Hampton, Michael; Kosheleva, Olga
1997-01-01
In engineering applications of fuzzy logic, the main goal is not to simulate the way the experts really think, but to come up with a good engineering solution that would (ideally) be better than the expert's control, In such applications, it makes perfect sense to restrict ourselves to simplified approximate expressions for membership functions. If we need to perform arithmetic operations with the resulting fuzzy numbers, then we can use simple and fast algorithms that are known for operations with simple membership functions. In other applications, especially the ones that are related to humanities, simulating experts is one of the main goals. In such applications, we must use membership functions that capture every nuance of the expert's opinion; these functions are therefore complicated, and fuzzy arithmetic operations with the corresponding fuzzy numbers become a computational problem. In this paper, we design a new algorithm for performing such operations. This algorithm is applicable in the case when negative logarithms - log(u(x)) of membership functions u(x) are convex, and reduces computation time from O(n(exp 2))to O(n log(n)) (where n is the number of points x at which we know the membership functions u(x)).
Glycemic management during Jain fasts
Julka, Sandeep; Sachan, Alok; Bajaj, Sarita; Sahay, Rakesh; Chawla, Rajeev; Agrawal, Navneet; Saboo, Banshi; Unnikrishnan, A. G.; Baruah, Manash P.; Parmar, Girish; Kalra, Sanjay
2017-01-01
This review describes the various fasts observed by adherents of the Jain religion. It attempts to classify them according to their suitability for people with diabetes and suggests appropriate regime and dose modification for those observing these fasts. The review is an endeavor to encourage rational and evidence-based management in this field of diabetology. PMID:28217525
Fast and Adaptive Lossless Onboard Hyperspectral Data Compression System
NASA Technical Reports Server (NTRS)
Aranki, Nazeeh I.; Keymeulen, Didier; Kimesh, Matthew A.
2012-01-01
Modern hyperspectral imaging systems are able to acquire far more data than can be downlinked from a spacecraft. Onboard data compression helps to alleviate this problem, but requires a system capable of power efficiency and high throughput. Software solutions have limited throughput performance and are power-hungry. Dedicated hardware solutions can provide both high throughput and power efficiency, while taking the load off of the main processor. Thus a hardware compression system was developed. The implementation uses a field-programmable gate array (FPGA). The implementation is based on the fast lossless (FL) compression algorithm reported in Fast Lossless Compression of Multispectral-Image Data (NPO-42517), NASA Tech Briefs, Vol. 30, No. 8 (August 2006), page 26, which achieves excellent compression performance and has low complexity. This algorithm performs predictive compression using an adaptive filtering method, and uses adaptive Golomb coding. The implementation also packetizes the coded data. The FL algorithm is well suited for implementation in hardware. In the FPGA implementation, one sample is compressed every clock cycle, which makes for a fast and practical realtime solution for space applications. Benefits of this implementation are: 1) The underlying algorithm achieves a combination of low complexity and compression effectiveness that exceeds that of techniques currently in use. 2) The algorithm requires no training data or other specific information about the nature of the spectral bands for a fixed instrument dynamic range. 3) Hardware acceleration provides a throughput improvement of 10 to 100 times vs. the software implementation. A prototype of the compressor is available in software, but it runs at a speed that does not meet spacecraft requirements. The hardware implementation targets the Xilinx Virtex IV FPGAs, and makes the use of this compressor practical for Earth satellites as well as beyond-Earth missions with hyperspectral instruments.
Verification of New Floating Capabilities in FAST v8: Preprint
Wendt, F.; Robertson, A.; Jonkman, J.; Hayman, G.
2015-01-01
In the latest release of NREL's wind turbine aero-hydro-servo-elastic simulation software, FAST v8, several new capabilities and major changes were introduced. FAST has been significantly altered to improve the simulator's modularity and to include new functionalities in the form of modules in the FAST v8 framework. This paper is focused on the improvements made for the modeling of floating offshore wind systems. The most significant change was to the hydrodynamic load calculation algorithms, which are embedded in the HydroDyn module. HydroDyn is now capable of applying strip-theory (via an extension of Morison's equation) at the member level for user-defined geometries. Users may now use a strip-theory-only approach for applying the hydrodynamic loads, as well as the previous potential-flow (radiation/diffraction) approach and a hybrid combination of both methods (radiation/diffraction and the drag component of Morison's equation). Second-order hydrodynamic implementations in both the wave kinematics used by the strip-theory solution and the wave-excitation loads in the potential-flow solution were also added to HydroDyn. The new floating capabilities were verified through a direct code-to-code comparison. We conducted a series of simulations of the International Energy Agency Wind Task 30 Offshore Code Comparison Collaboration Continuation (OC4) floating semisubmersible model and compared the wind turbine response predicted by FAST v8, the corresponding FAST v7 results, and results from other participants in the OC4 project. We found good agreement between FAST v7 and FAST v8 when using the linear radiation/diffraction modeling approach. The strip-theory-based approach inherently differs from the radiation/diffraction approach used in FAST v7 and we identified and characterized the differences. Enabling the second-order effects significantly improved the agreement between FAST v8 and the other OC4 participants.
Implementers' Perspectives on Fidelity of Implementation.
Cutbush, Stacey; Gibbs, Deborah; Krieger, Kathleen; Clinton-Sherrod, Monique; Miller, Shari
2017-03-01
Fidelity of implementation is an essential factor in realizing outcomes of evidence-based interventions. Yet perspectives vary on the degree to which fidelity is necessary or desirable, implementers may receive limited guidance on fidelity, and research on implementers' understanding and operationalization of fidelity is lacking. We conducted key informant interviews with 20 individuals who implemented an evidence-based teen dating violence prevention curriculum in seven sites. Interviews addressed how implementers defined fidelity and the adaptations they made in implementing the curriculum. Although all implementers reported delivering the curriculum with fidelity, their definitions of fidelity varied. Most defined fidelity in terms of adherence to the published curriculum, although definitions sometimes allowed modifications of pedagogy or adding or subtracting materials. A smaller group of implementers defined fidelity in terms of their perceptions of the curriculum's core messages. All implementers described variations from the published curriculum, which were frequently inconsistent with their own definitions of fidelity. Implementers committed to the value of implementation with fidelity may need support in its definition and application. Developers can support implementers by communicating program theory in terms that implementers will understand, clarifying expectations for fidelity and allowable adaptations, and codifying lessons learned from previous implementation.
Fast food: unfriendly and unhealthy.
Stender, S; Dyerberg, J; Astrup, A
2007-06-01
Although nutrition experts might be able to navigate the menus of fast-food restaurant chains, and based on the nutritional information, compose apparently 'healthy' meals, there are still many reasons why frequent fast-food consumption at most chains is unhealthy and contributes to weight gain, obesity, type 2 diabetes and coronary artery disease. Fast food generally has a high-energy density, which, together with large portion sizes, induces over consumption of calories. In addition, we have found it to be a myth that the typical fast-food meal is the same worldwide. Chemical analyses of 74 samples of fast-food menus consisting of French fries and fried chicken (nuggets/hot wings) bought in McDonalds and KFC outlets in 35 countries in 2005-2006 showed that the total fat content of the same menu varies from 41 to 65 g at McDonalds and from 42 to 74 g at KFC. In addition, fast food from major chains in most countries still contains unacceptably high levels of industrially produced trans-fatty acids (IP-TFA). IP-TFA have powerful biological effects and may contribute to increased weight gain, abdominal obesity, type 2 diabetes and coronary artery disease. The food quality and portion size need to be improved before it is safe to eat frequently at most fast-food chains.
Fast Brillouin Optical Time Domain Analysis for dynamic sensing.
Peled, Yair; Motil, Avi; Tur, Moshe
2012-04-09
A new technique for the fast implementation of Brillouin Optical Time Domain Analysis (BOTDA) is proposed and demonstrated, carrying the classical BOTDA method to the dynamic sensing domain. By using a digital signal generator which enables fast switching among 100 scanning frequencies, we demonstrate a truly distributed and dynamic measurement of a 100 m long fiber with a sampling rate of ~10 kHz, limited only by the fiber length and the frequency granularity. With 10 averages the standard deviation of the measured strain was ~5 µε.
[Principles of fast track surgery. Multimodal perioperative therapy programme].
Kehlet, H
2009-08-01
Recent evidence has documented that a combination of single-modality evidence-based care principles into a multimodal effort to enhance postoperative recovery (the fast track methodology) has led to enhanced recovery with reduced medical morbidity, need for hospitalisation and convalescence. Nevertheless, general implementation of fast track surgery has been relatively slow despite concomitant economic benefits. Further improvement in postoperative outcome may be obtained by developments within each care principle with a specific focus on minimally invasive surgery, effective multimodal, non-opioid analgesia and pharmacological stress reduction.
Orthogonal fast spherical Bessel transform on uniform grid
NASA Astrophysics Data System (ADS)
Serov, Vladislav V.
2017-07-01
We propose an algorithm for the orthogonal fast discrete spherical Bessel transform on a uniform grid. Our approach is based upon the spherical Bessel transform factorization into the two subsequent orthogonal transforms, namely the fast Fourier transform and the orthogonal transform founded on the derivatives of the discrete Legendre orthogonal polynomials. The method utility is illustrated by its implementation for the problem of a two-atomic molecule in a time-dependent external field simulating the one utilized in the attosecond streaking technique.
FastID: Extremely Fast Forensic DNA Comparisons
2017-05-19
FastID: Extremely Fast Forensic DNA Comparisons Darrell O. Ricke, PhD Bioengineering Systems & Technologies Massachusetts Institute of...Technology Lincoln Laboratory Lexington, MA USA Darrell.Ricke@ll.mit.edu Abstract—Rapid analysis of DNA forensic samples can have a critical impact on...time sensitive investigations. Analysis of forensic DNA samples by massively parallel sequencing is creating the next gold standard for DNA
Improving the Numerical Stability of Fast Matrix Multiplication
Ballard, Grey; Benson, Austin R.; Druinsky, Alex; Lipshitz, Benjamin; Schwartz, Oded
2016-10-04
Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen's original algorithm, few fast algorithms have been efficiently implemented or used in practical applications. However, there exist many practical alternatives to Strassen's algorithm with varying performance and numerical properties. Fast algorithms are known to be numerically stable, but because their error bounds are slightly weaker than the classical algorithm, they are not used even in cases where they provide a performance benefit. We argue in this study that the numerical sacrifice of fast algorithms, particularly for the typical use cases of practical algorithms, is not prohibitive, and we explore ways to improve the accuracy both theoretically and empirically. The numerical accuracy of fast matrix multiplication depends on properties of the algorithm and of the input matrices, and we consider both contributions independently. We generalize and tighten previous error analyses of fast algorithms and compare their properties. We discuss algorithmic techniques for improving the error guarantees from two perspectives: manipulating the algorithms, and reducing input anomalies by various forms of diagonal scaling. In conclusion, we benchmark performance and demonstrate our improved numerical accuracy.
[Fast food promotes weight gain].
Stender, Steen; Dyerberg, Jørn; Astrup, Arne V
2007-05-07
The total amounts of fat in a fast food menu consisting of French fries and fried Chicken Nuggets from McDonald's and KFC, respectively, bought in 35 different countries vary from 41 to 71 gram. In most countries the menu contained unacceptably high amounts of industrially-produced trans fat which contributes to an increased risk of ischaemic heart disease, weight gain, abdominal fat accumulation and type 2 diabetes. The quality of the ingredients in fast food ought to be better and the size of the portions smaller and less energy-dense so that frequent fast food meals do not increase the risk of obesity and diseases among customers.
1993-05-31
AD-A271 614 r, FINAL REPORT w to I OFFICE OF NAVAL RESEARCH [I on * LONG RANGE FAST TOOL SERVO I ONR CONTRACT NO. N00014-92-J-4082-PII Covering the...n I I 1 INTRODUCTION The PEC’s MAC 100 Fast Tool Servo (FTS) System has demonstrated the efficacy of fabricating off-axis parabolic segments on axis...by utilizing a fast tool motion to machine non-rotationally symmetric surfaces [1]. The key to this technique was a servo for the tool motion that had
Fast box-counting algorithm on GPU.
Jiménez, J; Ruiz de Miras, J
2012-12-01
The box-counting algorithm is one of the most widely used methods for calculating the fractal dimension (FD). The FD has many image analysis applications in the biomedical field, where it has been used extensively to characterize a wide range of medical signals. However, computing the FD for large images, especially in 3D, is a time consuming process. In this paper we present a fast parallel version of the box-counting algorithm, which has been coded in CUDA for execution on the Graphic Processing Unit (GPU). The optimized GPU implementation achieved an average speedup of 28 times (28×) compared to a mono-threaded CPU implementation, and an average speedup of 7 times (7×) compared to a multi-threaded CPU implementation. The performance of our improved box-counting algorithm has been tested with 3D models with different complexity, features and sizes. The validity and accuracy of the algorithm has been confirmed using models with well-known FD values. As a case study, a 3D FD analysis of several brain tissues has been performed using our GPU box-counting algorithm.
The fast debris evolution model
NASA Astrophysics Data System (ADS)
Lewis, H. G.; Swinerd, G. G.; Newland, R. J.; Saunders, A.
2009-09-01
The 'particles-in-a-box' (PIB) model introduced by Talent [Talent, D.L. Analytic model for orbital debris environmental management. J. Spacecraft Rocket, 29 (4), 508-513, 1992.] removed the need for computer-intensive Monte Carlo simulation to predict the gross characteristics of an evolving debris environment. The PIB model was described using a differential equation that allows the stability of the low Earth orbit (LEO) environment to be tested by a straightforward analysis of the equation's coefficients. As part of an ongoing research effort to investigate more efficient approaches to evolutionary modelling and to develop a suite of educational tools, a new PIB model has been developed. The model, entitled Fast Debris Evolution (FADE), employs a first-order differential equation to describe the rate at which new objects ⩾10 cm are added and removed from the environment. Whilst Talent [Talent, D.L. Analytic model for orbital debris environmental management. J. Spacecraft Rocket, 29 (4), 508-513, 1992.] based the collision theory for the PIB approach on collisions between gas particles and adopted specific values for the parameters of the model from a number of references, the form and coefficients of the FADE model equations can be inferred from the outputs of future projections produced by high-fidelity models, such as the DAMAGE model. The FADE model has been implemented as a client-side, web-based service using JavaScript embedded within a HTML document. Due to the simple nature of the algorithm, FADE can deliver the results of future projections immediately in a graphical format, with complete user-control over key simulation parameters. Historical and future projections for the ⩾10 cm LEO debris environment under a variety of different scenarios are possible, including business as usual, no future launches, post-mission disposal and remediation. A selection of results is presented with comparisons with predictions made using the DAMAGE environment model
The Fast Debris Evolution Model
NASA Astrophysics Data System (ADS)
Lewis, Hugh G.; Swinerd, Graham; Newland, Rebecca; Saunders, Arrun
The ‘Particles-in-a-box' (PIB) model introduced by Talent (1992) removed the need for computerintensive Monte Carlo simulation to predict the gross characteristics of an evolving debris environment. The PIB model was described using a differential equation that allows the stability of the low Earth orbit (LEO) environment to be tested by a straightforward analysis of the equation's coefficients. As part of an ongoing research effort to investigate more efficient approaches to evolutionary modelling and to develop a suite of educational tools, a new PIB model has been developed. The model, entitled Fast Debris Evolution (FaDE), employs a first-order differential equation to describe the rate at which new objects (˜ 10 cm) are added and removed from the environment. Whilst Talent (1992) based the collision theory for the PIB approach on collisions between gas particles and adopted specific values for the parameters of the model from a number of references, the form and coefficients of the FaDE model equations can be inferred from the outputs of future projections produced by high-fidelity models, such as the DAMAGE model. The FaDE model has been implemented as a client-side, web-based service using Javascript embedded within a HTML document. Due to the simple nature of the algorithm, FaDE can deliver the results of future projections immediately in a graphical format, with complete user-control over key simulation parameters. Historical and future projections for the ˜ 10 cm low Earth orbit (LEO) debris environment under a variety of different scenarios are possible, including business as usual, no future launches, post-mission disposal and remediation. A selection of results is presented with comparisons with predictions made using the DAMAGE environment model. The results demonstrate that the FaDE model is able to capture comparable time-series of collisions and number of objects as predicted by DAMAGE in several scenarios. Further, and perhaps more importantly
Discrete implementations of scale transform
NASA Astrophysics Data System (ADS)
Djurdjanovic, Dragan; Williams, William J.; Koh, Christopher K.
1999-11-01
Scale as a physical quantity is a recently developed concept. The scale transform can be viewed as a special case of the more general Mellin transform and its mathematical properties are very applicable in the analysis and interpretation of the signals subject to scale changes. A number of single-dimensional applications of scale concept have been made in speech analysis, processing of biological signals, machine vibration analysis and other areas. Recently, the scale transform was also applied in multi-dimensional signal processing and used for image filtering and denoising. Discrete implementation of the scale transform can be carried out using logarithmic sampling and the well-known fast Fourier transform. Nevertheless, in the case of the uniformly sampled signals, this implementation involves resampling. An algorithm not involving resampling of the uniformly sampled signals has been derived too. In this paper, a modification of the later algorithm for discrete implementation of the direct scale transform is presented. In addition, similar concept was used to improve a recently introduced discrete implementation of the inverse scale transform. Estimation of the absolute discretization errors showed that the modified algorithms have a desirable property of yielding a smaller region of possible error magnitudes. Experimental results are obtained using artificial signals as well as signals evoked from the temporomandibular joint. In addition, discrete implementations for the separable two-dimensional direct and inverse scale transforms are derived. Experiments with image restoration and scaling through two-dimensional scale domain using the novel implementation of the separable two-dimensional scale transform pair are presented.
FAST-PT: a novel algorithm to calculate convolution integrals in cosmological perturbation theory
NASA Astrophysics Data System (ADS)
McEwen, Joseph E.; Fang, Xiao; Hirata, Christopher M.; Blazek, Jonathan A.
2016-09-01
We present a novel algorithm, FAST-PT, for performing convolution or mode-coupling integrals that appear in nonlinear cosmological perturbation theory. The algorithm uses several properties of gravitational structure formation—the locality of the dark matter equations and the scale invariance of the problem—as well as Fast Fourier Transforms to describe the input power spectrum as a superposition of power laws. This yields extremely fast performance, enabling mode-coupling integral computations fast enough to embed in Monte Carlo Markov Chain parameter estimation. We describe the algorithm and demonstrate its application to calculating nonlinear corrections to the matter power spectrum, including one-loop standard perturbation theory and the renormalization group approach. We also describe our public code (in Python) to implement this algorithm. The code, along with a user manual and example implementations, is available at https://github.com/JoeMcEwen/FAST-PT.
vysmaw: Fast visibility stream muncher
NASA Astrophysics Data System (ADS)
Pokorny, Martin; Law, Casey J.
2017-10-01
The vysmaw client library facilitates the development of code for processes to tap into the fast visibility stream on the National Radio Astronomy Observatory's Very Large Array correlator back-end InfiniBand network.
Fast Access Data Acquisition System
Dr. Vladimir Katsman
1998-03-17
Our goal in this program is to develop Fast Access Data Acquisition System (FADAS) by combining the flexibility of Multilink's GaAs and InP electronics and electro-optics with an extremely high data rate for the efficient handling and transfer of collider experimental data. This novel solution is based on Multilink's and Los Alamos National Laboratory's (LANL) unique components and technologies for extremely fast data transfer, storage, and processing.
Fast Spectrometer Construction and Testing
NASA Astrophysics Data System (ADS)
Menke, John
2012-05-01
This paper describes the construction and operation of a medium resolution spectrometer used in the visual wavelength range. It is homebuilt, but has built in guiding and calibration, is fully remote operable, and operates at a resolution R=3000. It features a fast f3.5 system, which allows it to be used with a fast telescope (18 inch f3.5) with no Barlow or other optical matching devices.
Quantifying Cricket Fast Bowling Skill.
Feros, Simon A; Young, Warren B; O'Brien, Brendan J
2017-09-27
To evaluate the current evidence regarding the quantification of cricket fast bowling skill. Studies that assessed fast bowling skill (bowling speed and accuracy) were identified from searches in SPORTDiscus (EBSCO) in June 2017. The reference lists of identified papers were also examined for relevant investigations. Sixteen papers matched the inclusion criteria, and discrepancies in assessment procedures were evident. Differences in: test environment, pitch and cricket ball characteristics, the warm-up prior to test, test familiarisation procedures, permitted run-up lengths, bowling spell length, delivery sequence, test instructions, collection of bowling speed data, collection and reportage of bowling accuracy data were apparent throughout the literature. The reliability and sensitivity of fast bowling skill measures has rarely been reported across the literature. Only one study has attempted to assess the construct validity of their skill measures. There are several discrepancies in how fast bowling skill has been assessed and subsequently quantified in the literature to date. This is a problem, as comparisons between studies are often difficult. Therefore, a strong rationale exists for the creation of match-specific standardised fast bowling assessments that offer greater ecological validity while maintaining acceptable reliability and sensitivity of the skill measures. If prospective research can act on the proposed recommendations from this review, then coaches will be able to make more informed decisions surrounding player selection, talent identification, return to skill following injury, and the efficacy of short- and long-term training interventions for fast bowlers.
Fast-Tracking Colostomy Closures.
Nanavati, Aditya J; Prabhakar, Subramaniam
2015-12-01
There have been very few studies on applying fast-track principles to colostomy closures. We believe that outcome may be significantly improved with multimodal interventions in the peri-operative care of patients undergoing this procedure. A retrospective study was carried out comparing patients who had undergone colostomy closures by the fast-track and traditional care protocols at our centre. We intended to analyse peri-operative period and recovery in colostomy closures to confirm that fast-track surgery principles improved outcomes. Twenty-six patients in the fast-track arm and 24 patients in the traditional care arm had undergone colostomy closures. Both groups were comparable in terms of their baseline parameters. Patients in the fast-track group were ambulatory and accepted oral feeding earlier. There was a significant reduction in the duration of stay (4.73 ± 1.43 days vs. 7.21 ± 1.38 days, p = 0.0000). We did not observe a rise in complications or 30-day re-admissions. Fast-track surgery can safely be applied to colostomy closures. It shows earlier ambulation and reduction in length of hospital stay.
FastML: a web server for probabilistic reconstruction of ancestral sequences
Ashkenazy, Haim; Penn, Osnat; Doron-Faigenboim, Adi; Cohen, Ofir; Cannarozzi, Gina; Zomer, Oren; Pupko, Tal
2012-01-01
Ancestral sequence reconstruction is essential to a variety of evolutionary studies. Here, we present the FastML web server, a user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences. The utility of FastML is demonstrated by reconstructing ancestral sequences of the Env protein from various HIV-1 subtypes. FastML is freely available for all academic users and is available online at http://fastml.tau.ac.il/. PMID:22661579
MATLAB tensor classes for fast algorithm prototyping.
Bader, Brett William; Kolda, Tamara Gibson
2004-10-01
Tensors (also known as mutidimensional arrays or N-way arrays) are used in a variety of applications ranging from chemometrics to psychometrics. We describe four MATLAB classes for tensor manipulations that can be used for fast algorithm prototyping. The tensor class extends the functionality of MATLAB's multidimensional arrays by supporting additional operations such as tensor multiplication. The tensor as matrix class supports the 'matricization' of a tensor, i.e., the conversion of a tensor to a matrix (and vice versa), a commonly used operation in many algorithms. Two additional classes represent tensors stored in decomposed formats: cp tensor and tucker tensor. We descibe all of these classes and then demonstrate their use by showing how to implement several tensor algorithms that have appeared in the literature.
fastGapFill: efficient gap filling in metabolic networks
Thiele, Ines; Vlassis, Nikos; Fleming, Ronan M. T.
2014-01-01
Motivation: Genome-scale metabolic reconstructions summarize current knowledge about a target organism in a structured manner and as such highlight missing information. Such gaps can be filled algorithmically. Scalability limitations of available algorithms for gap filling hinder their application to compartmentalized reconstructions. Results: We present fastGapFill, a computationally efficient tractable extension to the COBRA toolbox that permits the identification of candidate missing knowledge from a universal biochemical reaction database (e.g. Kyoto Encyclopedia of Genes and Genomes) for a given (compartmentalized) metabolic reconstruction. The stoichiometric consistency of the universal reaction database and of the metabolic reconstruction can be tested for permitting the computation of biologically more relevant solutions. We demonstrate the efficiency and scalability of fastGapFill on a range of metabolic reconstructions. Availability and implementation: fastGapFill is freely available from http://thielelab.eu. Contact: ines.thiele@uni.lu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:24812336
CS-based fast ultrasound imaging with improved FISTA algorithm
NASA Astrophysics Data System (ADS)
Lin, Jie; He, Yugao; Shi, Guangming; Han, Tingyu
2015-08-01
In ultrasound imaging system, the wave emission and data acquisition is time consuming, which can be solved by adopting the plane wave as the transmitted signal, and the compressed sensing (CS) theory for data acquisition and image reconstruction. To overcome the very high computation complexity caused by introducing CS into ultrasound imaging, in this paper, we propose an improvement of the fast iterative shrinkage-thresholding algorithm (FISTA) to achieve the fast reconstruction of the ultrasound imaging, in which a modified setting is done with the parameter of step size for each iteration. Further, the GPU strategy is designed for the proposed algorithm, to guarantee the real time implementation of imaging. The simulation results show that the GPU-based image reconstruction algorithm can achieve the fast ultrasound imaging without damaging the quality of image.
TMDL Implementation: Lessons Learned
Virginia Tech Center for TMDL and Watershed Studies provided state TMDL implementation information and reviewed ongoing TMDL implementation efforts across the country to identify factors that contribute to successful implementation.
Fast-track surgery: Toward comprehensive peri-operative care
Nanavati, Aditya J.; Prabhakar, S.
2014-01-01
Fast-track surgery is a multimodal approach to patient care using a combination of several evidence-based peri-operative interventions to expedite recovery after surgery. It is an extension of the critical pathway that integrates modalities in surgery, anesthesia, and nutrition, enforces early mobilization and feeding, and emphasizes reduction of the surgical stress response. It entails a great partnership between a surgeon and an anesthesiologist with several other specialists to form a multi-disciplinary team, which may then engage in patient care. The practice of fast-track surgery has yielded excellent results and there has been a significant reduction in hospital stay without a rise in complications or re-admissions. The effective implementation begins with the formulation of a protocol, carrying out each intervention and gathering outcome data. The care of a patient is divided into three phases: Before, during, and after surgery. Each stage needs active participation of few or all the members of the multi-disciplinary team. Other than surgical technique, anesthetic drugs, and techniques form the cornerstone in the ability of the surgeon to carry out a fast-track surgery safely. It is also the role of this team to keep abreast with the latest development in fast-track methodology and make appropriate changes to policy. In the Indian healthcare system, there is a huge benefit that may be achieved by the successful implementation of a fast-track surgery program at an institutional level. The lack of awareness regarding this concept, fear and apprehension regarding its implementation are the main barriers that need to be overcome. PMID:25886214
Fast Poisson, Fast Helmholtz and fast linear elastostatic solvers on rectangular parallelepipeds
Wiegmann, A.
1999-06-01
FFT-based fast Poisson and fast Helmholtz solvers on rectangular parallelepipeds for periodic boundary conditions in one-, two and three space dimensions can also be used to solve Dirichlet and Neumann boundary value problems. For non-zero boundary conditions, this is the special, grid-aligned case of jump corrections used in the Explicit Jump Immersed Interface method. Fast elastostatic solvers for periodic boundary conditions in two and three dimensions can also be based on the FFT. From the periodic solvers we derive fast solvers for the new 'normal' boundary conditions and essential boundary conditions on rectangular parallelepipeds. The periodic case allows a simple proof of existence and uniqueness of the solutions to the discretization of normal boundary conditions. Numerical examples demonstrate the efficiency of the fast elastostatic solvers for non-periodic boundary conditions. More importantly, the fast solvers on rectangular parallelepipeds can be used together with the Immersed Interface Method to solve problems on non-rectangular domains with general boundary conditions. Details of this are reported in the preprint The Explicit Jump Immersed Interface Method for 2D Linear Elastostatics by the author.
Accelerating the nonequispaced fast Fourier transform on commodity graphics hardware.
Sorensen, T S; Schaeffter, T; Noe, K O; Hansen, M S
2008-04-01
We present a fast parallel algorithm to compute the nonequispaced fast Fourier transform on commodity graphics hardware (the GPU). We focus particularly on a novel implementation of the convolution step in the transform as it was previously its most time consuming part. We describe the performance for two common sample distributions in medical imaging (radial and spiral trajectories), and for different convolution kernels as these parameters all influence the speed of the algorithm. The GPU-accelerated convolution is up to 85 times faster as our reference, the open source NFFT library on a state-of-the-art 64 bit CPU. The accuracy of the proposed GPU implementation was quantitatively evaluated at the various settings. To illustrate the applicability of the transform in medical imaging, in which it is also known as gridding, we look specifically at non-Cartesian magnetic resonance imaging and reconstruct both a numerical phantom and an in vivo cardiac image.
Nursing role on rapid recovery programmes fast-track.
Sevillano-Jiménez, Alfonso; Romero-Saldaña, Manuel; Molina-Recio, Guillermo
2017-07-27
Rapid recovery (RR) or fast-track programmes are aimed at reducing surgical stress, leading to a reduction in nurse workload, costs and hospital stay, greater patient empowerment, early post-surgical recovery and reduced morbidity and mortality. These new protocols require the coordinated participation of a multidisciplinary team. Based on an integrative review of the literature, this paper aims to define the concept of a RR or fast track programme and show the existing evidence on the implementation of these programmes in nursing. The benefits and low incidence of damage of RR programmes in nursing justify their implementation. The programmes require greater support and diffusion in order to develop, as well as more research to increase the evidence on the effectiveness and efficiency of the protocols. Copyright © 2017 Elsevier España, S.L.U. All rights reserved.
Fast swept-volume distance for robust collision detection
Xavier, P.G.
1997-04-01
The need for collision detection arises in several robotics areas, including motion-planning, online collision avoidance, and simulation. At the heart of most current methods are algorithms for interference detection and/or distance computation. A few recent algorithms and implementations are very fast, but to use them for accurate collision detection, very small step sizes can be necessary, reducing their effective efficiency. We present a fast, implemented technique for doing exact distance computation and interference detection for translationally-swept bodies. For rotationally swept bodies, we adapt this technique to improve accuracy, for any given step size, in distance computation and interference detection. We present preliminary experiments that show that the combination of basic and swept-body calculations holds much promise for faster accurate collision detection.
Fast Pattern Classification of Ventricular Arrhythmias Using Graphics Processing Units
NASA Astrophysics Data System (ADS)
Lopes, Noel; Ribeiro, Bernardete
Graphics Processing Units (GPUs) can provide remarkable performance gains when compared to CPUs for computationally-intensive applications. In the biomedical area, most of the previous studies are focused on using Neural Networks (NNs) for pattern recognition of biomedical signals. However, the long training times prevent them to be used in real-time. This is critical for the fast detection of Ventricular Arrhythmias (VAs) which may cause cardiac arrest and sudden death. In this paper, we present a parallel implementation of the Back-Propagation (BP) and the Multiple Back-Propagation (MBP) algorithm which allowed significant training speedups. In our proposal, we explicitly specify data parallel computations by defining special functions (kernels); therefore, we can use a fast evaluation strategy for reducing the computational cost without wasting memory resources. The performance of the pattern classification implementation is compared against other reported algorithms.
Fast molecular shocks. II - Emission from fast dissociative shocks
NASA Technical Reports Server (NTRS)
Neufeld, David A.; Dalgarno, A.
1989-01-01
The line radiations emitted in the cooling gas behind a fast dissociative shock are studied. The intensities emitted in high rotational transitions of the neutral molecules CO, SiO, HCN, CN, NO, and SO are estimated, as well as in rovibrational transitions of the molecular ions HeH(+) and OH(+) in radio recombination lines of atomic hydrogen and in fine-structure transitions of C, C(+), O, and Si(+). The predictions are compared with the observed intensities of line emission from the Orion-KL region. For Orion-KL the observations do not exclude, but probably do not require, the presence of a fast dissociative shock. Emission from SiO in high-J rotational states and from vibrationally excited OH(+), HeH(+), HeH(+), and SO(+) may be detectable from dissociative shocks under suitable conditions of preshock density and shock velocity; such emission may prove to be a useful diagnostic probe of fast shock activity.
[Diabetic patients in the Yom Kippur fast--who can fast and how to treat the fasting patients].
Katz, Yisrael; Zangen, David; Leibowitz, Gil; Szalalt, Auryan
2009-09-01
Jews all over the world fast on Yom Kippur, a fast lasting 25 hours. For diabetic patients and their physicians the fast is a significant challenge. The Jewish law exempts patients from fasting if the fast endangers the patient's health. In order to know if they can fast safely, many diabetic patients consult their physicians. In this review, the authors summarize the potential risk for fasting in diabetic patients and propose treatment protocols for patients who intend to fast. The principle recommendations are based on data related to fasting diabetic patients during the Ramadan fast, which is shorter than Yom Kippur. Furthermore, practical suggestions are based on a recent Israeli study on type 1 diabetic patients fasting for 25 hours, taking into account the Jewish law. Every diabetic patient who intends to fast should consult his physician for assurance that fasting is safe. The physician should pay special attention to patients on intensive insulin treatment or on sulfonylureas. Some, but not all these patients, should avoid fasting. In case these patients decide to fast, intensive monitoring of blood glucose is required during the fast to prevent severe hypoglycemia.
Lingos, finite state machines, and fast similarity searching.
Grant, J Andrew; Haigh, James A; Pickup, Barry T; Nicholls, Anthony; Sayle, Roger A
2006-01-01
We apply a recently published method of text-based molecular similarity searching (LINGO) to standard data sets for the purpose of quantifying the accuracy of the approach. Our implementation is based on a pattern-matching finite state machine (FSM) which results in fast search times. The accuracy of LINGO is demonstrated to be comparable to that of a path-based fingerprint and offers a simple yet effective method for similarity searching.
Audit on preoperative fasting of elective surgical patients in an African academic medical center.
Gebremedhn, Endale Gebreegziabher; Nagaratnam, Vidhya Bates
2014-09-01
Preoperative fasting is a requisite before anesthesia. The main reason for preoperative fasting is to reduce gastric volume and acidity and thus decrease the risk of pulmonary aspiration. However, preoperative fasting is usually prolonged beyond the recommended time for various reasons. Despite the many adverse effects of prolonged fasting, patients sometimes fasted for a prolonged time when surgery was delayed for different reasons at the University of Gondar Hospital. The aim of this study was to assess the duration of preoperative fasting for elective surgery. A cross-sectional study was conducted from March 10 to April 10, 2013. Patients were interviewed 24 h after surgery. All 43 patients who were under anesthesia while operated on during the study period were included. Of the 43 patients included in the study, 35 were adults and 8 were children. The minimum, maximum, and mean fasting hours for food were 5, 96, and 19.60, respectively, and more than 50 % of the patients fasted from food twice as long as recommended. The minimum, maximum, and mean fasting hours for fluid were 5, 19, and 12.72, respectively. More than 95 % of the patients fasted from fluid longer than recommended. Most patients fasted from both food (92 %) and fluid (95 %) longer than the fasting time recommended by the AAGBI, ASA, RCOA, and RCN fasting guidelines. Anesthetists, surgeons, and nurses need to revise operation lists every day in the operating theatres and resuscitate the patients when surgery is delayed for various reasons. A preoperative fasting guideline should be developed and implemented in the University of Gondar Hospital.
Implementing a Corporate Weblog for SAP
NASA Astrophysics Data System (ADS)
Broß, Justus; Quasthoff, Matthias; MacNiven, Sean; Zimmermann, Jürgen; Meinel, Christoph
After web 2.0 technologies experienced a phenomenal expansion and high acceptance among private users, considerations are now intensified to assess whether they can be equally applicable, beneficially employed and meaningfully implemented in an entrepreneurial context. The fast-paced rise of social software like weblogs or wikis and the resulting new form of communication via the Internet is however observed ambiguously in the corporate environment. This is why the particular choice of the platform or technology to be implemented in this field is strongly dependent on its future business case and field of deployment and should therefore be carefully considered beforehand, as this paper strongly suggests.
Notes on implementation of sparsely distributed memory
NASA Technical Reports Server (NTRS)
Keeler, J. D.; Denning, P. J.
1986-01-01
The Sparsely Distributed Memory (SDM) developed by Kanerva is an unconventional memory design with very interesting and desirable properties. The memory works in a manner that is closely related to modern theories of human memory. The SDM model is discussed in terms of its implementation in hardware. Two appendices discuss the unconventional approaches of the SDM: Appendix A treats a resistive circuit for fast, parallel address decoding; and Appendix B treats a systolic array for high throughput read and write operations.
Improving the Numerical Stability of Fast Matrix Multiplication
Ballard, Grey; Benson, Austin R.; Druinsky, Alex; ...
2016-10-04
Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen's original algorithm, few fast algorithms have been efficiently implemented or used in practical applications. However, there exist many practical alternatives to Strassen's algorithm with varying performance and numerical properties. Fast algorithms are known to be numerically stable, but because their error bounds are slightly weaker than the classical algorithm, they are not used even in cases where they provide a performance benefit. We argue in this study that the numerical sacrifice of fastmore » algorithms, particularly for the typical use cases of practical algorithms, is not prohibitive, and we explore ways to improve the accuracy both theoretically and empirically. The numerical accuracy of fast matrix multiplication depends on properties of the algorithm and of the input matrices, and we consider both contributions independently. We generalize and tighten previous error analyses of fast algorithms and compare their properties. We discuss algorithmic techniques for improving the error guarantees from two perspectives: manipulating the algorithms, and reducing input anomalies by various forms of diagonal scaling. In conclusion, we benchmark performance and demonstrate our improved numerical accuracy.« less
Automated measurement of fast mitochondrial transport in neurons.
Miller, Kyle E; Liu, Xin-An; Puthanveettil, Sathyanarayanan V
2015-01-01
There is growing recognition that fast mitochondrial transport in neurons is disrupted in multiple neurological diseases and psychiatric disorders. However, a major constraint in identifying novel therapeutics based on mitochondrial transport is that the large-scale analysis of fast transport is time consuming. Here we describe methodologies for the automated analysis of fast mitochondrial transport from data acquired using a robotic microscope. We focused on addressing questions of measurement precision, speed, reliably, workflow ease, statistical processing, and presentation. We used optical flow and particle tracking algorithms, implemented in ImageJ, to measure mitochondrial movement in primary cultured cortical and hippocampal neurons. With it, we are able to generate complete descriptions of movement profiles in an automated fashion of hundreds of thousands of mitochondria with a processing time of approximately one hour. We describe the calibration of the parameters of the tracking algorithms and demonstrate that they are capable of measuring the fast transport of a single mitochondrion. We then show that the methods are capable of reliably measuring the inhibition of fast mitochondria transport induced by the disruption of microtubules with the drug nocodazole in both hippocampal and cortical neurons. This work lays the foundation for future large-scale screens designed to identify compounds that modulate mitochondrial motility.
Fast reactors and nuclear nonproliferation
Avrorin, E.N.; Rachkov, V.I.; Chebeskov, A.N.
2013-07-01
Problems are discussed with regard to nuclear fuel cycle resistance in fast reactors to nuclear proliferation risk due to the potential for use in military programs of the knowledge, technologies and materials gained from peaceful nuclear power applications. Advantages are addressed for fast reactors in the creation of a more reliable mode of nonproliferation in the closed nuclear fuel cycle in comparison with the existing fully open and partially closed fuel cycles of thermal reactors. Advantages and shortcomings are also discussed from the point of view of nonproliferation from the start with fast reactors using plutonium of thermal reactor spent fuel and enriched uranium fuel to the gradual transition using their own plutonium as fuel. (authors)
Future Assets, Student Talent (FAST)
NASA Technical Reports Server (NTRS)
1992-01-01
Future Assets, Student Talent (FAST) motivates and prepares talented students with disabilities to further their education and achieve High Tech and professional employment. The FAST program is managed by local professionals, business, and industry leaders; it is modeled after High School High Tech project TAKE CHARGE started in Los Angeles in 1983. Through cooperative efforts of Alabama Department of Education, Vocational Rehabilitation, Adult and Children Services, and the President's Committee on Employment of People with Disabilities, north central Alabama was chosen as the second site for a High School High Tech project. In 1986 local business, industry, education, government agencies, and rehabilitation representatives started FAST. The program objectives and goals, results and accomplishments, and survey results are included.
HI Intensity Mapping with FAST
NASA Astrophysics Data System (ADS)
Bigot-Sazy, M.-A.; Ma, Y.-Z.; Battye, R. A.; Browne, I. W. A.; Chen, T.; Dickinson, C.; Harper, S.; Maffei, B.; Olivari, L. C.; Wilkinsondagger, P. N.
2016-02-01
We discuss the detectability of large-scale HI intensity fluctuations using the FAST telescope. We present forecasts for the accuracy of measuring the Baryonic Acoustic Oscillations and constraining the properties of dark energy. The FAST 19-beam L-band receivers (1.05-1.45 GHz) can provide constraints on the matter power spectrum and dark energy equation of state parameters (w0,wa) that are comparable to the BINGO and CHIME experiments. For one year of integration time we find that the optimal survey area is 6000 deg2. However, observing with larger frequency coverage at higher redshift (0.95-1.35 GHz) improves the projected errorbars on the HI power spectrum by more than 2 σ confidence level. The combined constraints from FAST, CHIME, BINGO and Planck CMB observations can provide reliable, stringent constraints on the dark energy equation of state.
Fast computation of recurrences in long time series
NASA Astrophysics Data System (ADS)
Rawald, Tobias; Sips, Mike; Marwan, Norbert; Dransch, Doris
2014-05-01
The quadratic time complexity of calculating basic RQA measures, doubling the size of the input time series leads to a quadrupling in operations, impairs the fast computation of RQA in many application scenarios. As an example, we analyze the Potsdamer Reihe, an ongoing non-interrupted hourly temperature profile since 1893, consisting of 1,043,112 data points. Using an optimized single-threaded CPU implementation this analysis requires about six hours. Our approach conducts RQA for the Potsdamer Reihe in five minutes. We automatically split a long time series into smaller chunks (Divide) and distribute the computation of RQA measures across multiple GPU devices. To guarantee valid RQA results, we employ carryover buffers that allow sharing information between pairs of chunks (Recombine). We demonstrate the capabilities of our Divide and Recombine approach to process long time series by comparing the runtime of our implementation to existing RQA tools. We support a variety of platforms by employing the computing framework OpenCL. Our current implementation supports the computation of standard RQA measures (recurrence rate, determinism, laminarity, ratio, average diagonal line length, trapping time, longest diagonal line, longest vertical line, divergence, entropy, trend) and also calculates recurrence times. To utilize the potential of our approach for a number of applications, we plan to release our implementation under an Open Source software license. It will be available at http://www.gfz-potsdam.de/fast-rqa/. Since our approach allows to compute RQA measures for a long time series fast, we plan to extend our implementation to support multi-scale RQA.
The Fast-Casual Conundrum: Fast-Casual Restaurant Entrées Are Higher in Calories than Fast Food.
Schoffman, Danielle E; Davidson, Charis R; Hales, Sarah B; Crimarco, Anthony E; Dahl, Alicia A; Turner-McGrievy, Gabrielle M
2016-10-01
Frequently eating fast food has been associated with consuming a diet high in calories, and there is a public perception that fast-casual restaurants (eg, Chipotle) are healthier than traditional fast food (eg, McDonald's). However, research has not examined whether fast-food entrées and fast-casual entrées differ in calorie content. The purpose of this study was to determine whether the caloric content of entrées at fast-food restaurants differed from that found at fast-casual restaurants. This study was a cross-sectional analysis of secondary data. Calorie information from 2014 for lunch and dinner entrées for fast-food and fast-casual restaurants was downloaded from the MenuStat database. Mean calories per entrée between fast-food restaurants and fast-casual restaurants and the proportion of restaurant entrées that fell into different calorie ranges were assessed. A t test was conducted to test the hypothesis that there was no difference between the average calories per entrée at fast-food and fast-casual restaurants. To examine the difference in distribution of entrées in different calorie ranges between fast-food and fast-casual restaurants, χ(2) tests were used. There were 34 fast-food and 28 fast-casual restaurants included in the analysis (n=3,193 entrées). Fast-casual entrées had significantly more calories per entrée (760±301 kcal) than fast-food entrées (561±268; P<0.0001). A greater proportion of fast-casual entrées compared with fast-food entrées exceeded the median of 640 kcal per entrée (P<0.0001). Although fast-casual entrées contained more calories than fast-food entrées in the study sample, future studies should compare actual purchasing patterns from these restaurants to determine whether the energy content or nutrient density of full meals (ie, entrées with sides and drinks) differs between fast-casual restaurants and fast-food restaurants. Calorie-conscious consumers should consider the calorie content of entrée items
Fast Atom Bombardment Mass Spectrometry.
ERIC Educational Resources Information Center
Rinehart, Kenneth L., Jr.
1982-01-01
Discusses reactions and characteristics of fast atom bombardment (FAB) mass spectroscopy in which samples are ionized in a condensed state by bombardment with xenon or argon atoms, yielding positive/negative secondary ions. Includes applications of FAB to structural problems and considers future developments using the technique. (Author/JN)
Fast Atom Bombardment Mass Spectrometry.
ERIC Educational Resources Information Center
Rinehart, Kenneth L., Jr.
1982-01-01
Discusses reactions and characteristics of fast atom bombardment (FAB) mass spectroscopy in which samples are ionized in a condensed state by bombardment with xenon or argon atoms, yielding positive/negative secondary ions. Includes applications of FAB to structural problems and considers future developments using the technique. (Author/JN)
Fast, Massively Parallel Data Processors
NASA Technical Reports Server (NTRS)
Heaton, Robert A.; Blevins, Donald W.; Davis, ED
1994-01-01
Proposed fast, massively parallel data processor contains 8x16 array of processing elements with efficient interconnection scheme and options for flexible local control. Processing elements communicate with each other on "X" interconnection grid with external memory via high-capacity input/output bus. This approach to conditional operation nearly doubles speed of various arithmetic operations.
Fast Detector Simulation Using Lelaps
Langeveld, W
2004-08-20
Lelaps is a fast detector simulation program which reads StdHep generator files and produces SIO or LCIO output files. It swims particles through detectors taking into account magnetic fields, multiple scattering and dE/dx energy loss. It simulates parameterized showers in EM and hadronic calorimeters and supports gamma conversions and decays.
Fast positive breakdown in lightning
NASA Astrophysics Data System (ADS)
Stock, M. G.; Krehbiel, P. R.; Lapierre, J.; Wu, T.; Stanley, M. A.; Edens, H. E.
2017-08-01
VHF radiation sources produced by positive breakdown during lightning discharges are generally considered to be both weak and slowly propagating. However, as VHF lightning mapping systems have become more sensitive, even this weak radiation can be mapped. In addition to being a faint process, positive breakdown often produces bursts of energetic activity. During the bursts, the VHF emission is extremely bright, and the breakdown propagates at much higher speeds. Here we present VHF interferometric and time-of-arrival measurements of such fast positive breakdown events produced during three example flashes. Electric field change measurements show that the fast breakdown process carries positive charge. The extent and velocity of the breakdown is estimated by converting the angular source locations provided by the interferometer into Cartesian coordinates using three-dimensional lightning mapping observations of the flash as a guide. Fast positive breakdown events are found to extend 100-2400 m into virgin air beyond the tip of the preceding positive leader, at speeds of 0.9-9 ×107 m s-1. The observations expand upon earlier observations of such breakdown and are similar to recently reported results that fast positive breakdown is the cause of high-power narrow bipolar events.
NASA Technical Reports Server (NTRS)
Patel, Umesh D.; DellaTorre, Edward; Day, John H. (Technical Monitor)
2001-01-01
A fast differential equation approach for the DOK model has been extented to the CMH model. Also, a cobweb technique for calculating the CMH model is also presented. The two techniques are contrasted from the point of view of flexibility and computation time.
NASA Technical Reports Server (NTRS)
Fogal, G. L.
1977-01-01
Wall structure keeps chambers at constant, uniform temperature, yet allows them to be cooled rapidly if necessary. Wall structure, used in fast-response cloud chamber, has surface heater and coolant shell separated by foam insulation. It is lightweight and requires relatively little power.
Fast excitation variable period wiggler
van Steenbergen, A.; Gallardo, J.; Romano, T.; Woodle, M.
1991-01-01
The design of an easily stackable, variable period length, fast excitation driven wiggler, making use of geometrically alternating substacks of Vanadium Permandur ferromagnetic laminations, interspaced with conductive, non magnetic, laminations which act as eddy current induced field reflectors,'' is discussed and experimental results obtained with short wiggler models are presented.
Fast excitation variable period wiggler
van Steenbergen, A.; Gallardo, J.; Romano, T.; Woodle, M.
1991-12-31
The design of an easily stackable, variable period length, fast excitation driven wiggler, making use of geometrically alternating substacks of Vanadium Permandur ferromagnetic laminations, interspaced with conductive, non magnetic, laminations which act as eddy current induced ``field reflectors,`` is discussed and experimental results obtained with short wiggler models are presented.
ERIC Educational Resources Information Center
Wisniewski, Jeff
2008-01-01
This article presents fast, easy and helpful hints for making web sites that people will want to use over and over again. These tips include: (1) Making sure that the website's copyright statement is up-to-date; (2) Adding "last updated" code to each webpage at the site; (3) Adding photos to the site's contact information; (4) Turning boring old…
Fast semivariogram computation using FPGA architectures
NASA Astrophysics Data System (ADS)
Lagadapati, Yamuna; Shirvaikar, Mukul; Dong, Xuanliang
2015-02-01
The semivariogram is a statistical measure of the spatial distribution of data and is based on Markov Random Fields (MRFs). Semivariogram analysis is a computationally intensive algorithm that has typically seen applications in the geosciences and remote sensing areas. Recently, applications in the area of medical imaging have been investigated, resulting in the need for efficient real time implementation of the algorithm. The semivariogram is a plot of semivariances for different lag distances between pixels. A semi-variance, γ(h), is defined as the half of the expected squared differences of pixel values between any two data locations with a lag distance of h. Due to the need to examine each pair of pixels in the image or sub-image being processed, the base algorithm complexity for an image window with n pixels is O(n2). Field Programmable Gate Arrays (FPGAs) are an attractive solution for such demanding applications due to their parallel processing capability. FPGAs also tend to operate at relatively modest clock rates measured in a few hundreds of megahertz, but they can perform tens of thousands of calculations per clock cycle while operating in the low range of power. This paper presents a technique for the fast computation of the semivariogram using two custom FPGA architectures. The design consists of several modules dedicated to the constituent computational tasks. A modular architecture approach is chosen to allow for replication of processing units. This allows for high throughput due to concurrent processing of pixel pairs. The current implementation is focused on isotropic semivariogram computations only. Anisotropic semivariogram implementation is anticipated to be an extension of the current architecture, ostensibly based on refinements to the current modules. The algorithm is benchmarked using VHDL on a Xilinx XUPV5-LX110T development Kit, which utilizes the Virtex5 FPGA. Medical image data from MRI scans are utilized for the experiments
Wang, Lu; Zhang, Chunxi; Gao, Shuang; Wang, Tao; Lin, Tie; Li, Xianmu
2016-01-01
The stability of a fiber optic gyroscope (FOG) in measurement while drilling (MWD) could vary with time because of changing temperature, high vibration, and sudden power failure. The dynamic Allan variance (DAVAR) is a sliding version of the Allan variance. It is a practical tool that could represent the non-stationary behavior of the gyroscope signal. Since the normal DAVAR takes too long to deal with long time series, a fast DAVAR algorithm has been developed to accelerate the computation speed. However, both the normal DAVAR algorithm and the fast algorithm become invalid for discontinuous time series. What is worse, the FOG-based MWD underground often keeps working for several days; the gyro data collected aboveground is not only very time-consuming, but also sometimes discontinuous in the timeline. In this article, on the basis of the fast algorithm for DAVAR, we make a further advance in the fast algorithm (improved fast DAVAR) to extend the fast DAVAR to discontinuous time series. The improved fast DAVAR and the normal DAVAR are used to responsively characterize two sets of simulation data. The simulation results show that when the length of the time series is short, the improved fast DAVAR saves 78.93% of calculation time. When the length of the time series is long (6×105 samples), the improved fast DAVAR reduces calculation time by 97.09%. Another set of simulation data with missing data is characterized by the improved fast DAVAR. Its simulation results prove that the improved fast DAVAR could successfully deal with discontinuous data. In the end, a vibration experiment with FOGs-based MWD has been implemented to validate the good performance of the improved fast DAVAR. The results of the experience testify that the improved fast DAVAR not only shortens computation time, but could also analyze discontinuous time series. PMID:27941600
Wang, Lu; Zhang, Chunxi; Gao, Shuang; Wang, Tao; Lin, Tie; Li, Xianmu
2016-12-07
The stability of a fiber optic gyroscope (FOG) in measurement while drilling (MWD) could vary with time because of changing temperature, high vibration, and sudden power failure. The dynamic Allan variance (DAVAR) is a sliding version of the Allan variance. It is a practical tool that could represent the non-stationary behavior of the gyroscope signal. Since the normal DAVAR takes too long to deal with long time series, a fast DAVAR algorithm has been developed to accelerate the computation speed. However, both the normal DAVAR algorithm and the fast algorithm become invalid for discontinuous time series. What is worse, the FOG-based MWD underground often keeps working for several days; the gyro data collected aboveground is not only very time-consuming, but also sometimes discontinuous in the timeline. In this article, on the basis of the fast algorithm for DAVAR, we make a further advance in the fast algorithm (improved fast DAVAR) to extend the fast DAVAR to discontinuous time series. The improved fast DAVAR and the normal DAVAR are used to responsively characterize two sets of simulation data. The simulation results show that when the length of the time series is short, the improved fast DAVAR saves 78.93% of calculation time. When the length of the time series is long ( 6 × 10 5 samples), the improved fast DAVAR reduces calculation time by 97.09%. Another set of simulation data with missing data is characterized by the improved fast DAVAR. Its simulation results prove that the improved fast DAVAR could successfully deal with discontinuous data. In the end, a vibration experiment with FOGs-based MWD has been implemented to validate the good performance of the improved fast DAVAR. The results of the experience testify that the improved fast DAVAR not only shortens computation time, but could also analyze discontinuous time series.
Fast Neutron Sensitivity with HPGe
Seifert, Allen; Hensley, Walter K.; Siciliano, Edward R.; Pitts, W. K.
2008-01-22
In addition to being excellent gamma-ray detectors, germanium detectors are also sensitive to fast neutrons. Incident neutrons undergo inelastic scattering {Ge(n,n')Ge*} off germanium nuclei and the resulting excited states emit gamma rays or conversion electrons. The response of a standard 140% high-purity germanium (HPGe) detector with a bismuth germanate (BGO) anti-coincidence shield was measured for several neutron sources to characterize the ability of the HPGe detector to detect fast neutrons. For a sensitivity calculation performed using the characteristic fast neutron response peak that occurs at 692 keV, the 140% germanium detector system exhibited a sensitivity of ~175 counts / kg of WGPu_{metal} in 1000 seconds at a source-detector distance of 1 meter with 4 in. of lead shielding between source and detector. Theoretical work also indicates that it might be possible to use the shape of the fast-neutron inelastic scattering signatures (specifically, the end-point energy of the long high energy tail of the resulting asymmetric peak) to gain additional information about the energy distribution of the incident neutron spectrum. However, the experimentally observed end-point energies appear to be almost identical for each of the fast neutron sources counted. Detailed MCNP calculations show that the neutron energy distributions impingent on the detector for these sources are very similar in this experimental configuration, due to neutron scattering in a lead shield (placed between the neutron source and HPGe detector to reduce the gamma ray flux), the BGO anti-coincidence detector, and the concrete floor.
A pragmatic cluster randomised trial evaluating three implementation interventions
2012-01-01
Background Implementation research is concerned with bridging the gap between evidence and practice through the study of methods to promote the uptake of research into routine practice. Good quality evidence has been summarised into guideline recommendations to show that peri-operative fasting times could be considerably shorter than patients currently experience. The objective of this trial was to evaluate the effectiveness of three strategies for the implementation of recommendations about peri-operative fasting. Methods A pragmatic cluster randomised trial underpinned by the PARIHS framework was conducted during 2006 to 2009 with a national sample of UK hospitals using time series with mixed methods process evaluation and cost analysis. Hospitals were randomised to one of three interventions: standard dissemination (SD) of a guideline package, SD plus a web-based resource championed by an opinion leader, and SD plus plan-do-study-act (PDSA). The primary outcome was duration of fluid fast prior to induction of anaesthesia. Secondary outcomes included duration of food fast, patients’ experiences, and stakeholders’ experiences of implementation, including influences. ANOVA was used to test differences over time and interventions. Results Nineteen acute NHS hospitals participated. Across timepoints, 3,505 duration of fasting observations were recorded. No significant effect of the interventions was observed for either fluid or food fasting times. The effect size was 0.33 for the web-based intervention compared to SD alone for the change in fluid fasting and was 0.12 for PDSA compared to SD alone. The process evaluation showed different types of impact, including changes to practices, policies, and attitudes. A rich picture of the implementation challenges emerged, including inter-professional tensions and a lack of clarity for decision-making authority and responsibility. Conclusions This was a large, complex study and one of the first national randomised
Subspace Detectors: Efficient Implementation
Harris, D B; Paik, T
2006-07-26
computed efficiently for continuous multichannel seismic data. The speed of the calculation is significant as it may become desirable to deploy subspace detectors numbering in the thousands. One application contemplated for these detectors is as screens against signals from repeating sources such as mines or aftershocks of large earthquakes. With many tens of stations and potentially hundreds of sources to screen, efficient implementations are desirable. Speed, of course, can be achieved by procuring faster computers or special-purpose hardware. The approach we examine here is the development of two efficient algorithms that can make the calculations run faster on any machine. In the first section, we describe the subspace detector as we use it for the detection of repeating seismic events, defining terms and the parameterization used in succeeding sections. This section also reviews how the correlation computations central to the matched filter and subspace detectors can be implemented as a collection of convolution operations. Convolution algorithms using fast Fourier transforms, such as the overlap-add and overlap-save methods, have long been known as efficient implementations of discrete-time finite-impulse-response filters [e.g. Oppenheim and Schafer, 1975]. These may be extended in a straightforward manner to implement multichannel correlation detectors. In the second section, we describe how multichannel data can be multiplexed to compute the required convolutions with a single pair of FFT operations instead of a pair for each channel. This approach increases speed approximately twofold. Seismic data, almost invariably, are oversampled. This characteristic provides an opportunity for increased efficiency by decimating the data prior to performing the correlation calculations. In the third section, we describe a bandpass transformation of the data that allows a more aggressive decimation of the data without significant loss of fidelity in the correlation calculation
Fast Nonparametric Machine Learning Algorithms for High-Dimensional Massive Data and Applications
2006-03-01
Mapreduce : Simplified data processing on large clusters . In Symposium on Operating System Design and Implementation, 2004. 6.3.2 S. C. Deerwester, S. T...Fast Nonparametric Machine Learning Algorithms for High-dimensional Massive Data and Applications Ting Liu CMU-CS-06-124 March 2006 School of...4. TITLE AND SUBTITLE Fast Nonparametric Machine Learning Algorithms for High-dimensional Massive Data and Applications 5a. CONTRACT NUMBER 5b
[CUDA-based fast dose calculation in radiotherapy].
Wang, Xianliang; Liu, Cao; Hou, Qing
2011-10-01
Dose calculation plays a key role in treatment planning of radiotherapy. Algorithms for dose calculation require high accuracy and computational efficiency. Finite size pencil beam (FSPB) algorithm is a method commonly adopted in the treatment planning system for radiotherapy. However, improvement on its computational efficiency is still desirable for such purpose as real time treatment planning. In this paper, we present an implementation of the FSPB, by which the most time-consuming parts in the algorithm are parallelized and ported on graphic processing unit (GPU). Compared with the FSPB completely running on central processing unit (CPU), the GPU-implemented FSPB can speed up the dose calculation for 25-35 times on a low price GPU (Geforce GT320) and for 55-100 times on a Tesla C1060, indicating that the GPU-implemented FSPB can provide fast enough dose calculations for real-time treatment planning.
Implementing Student Information Systems
ERIC Educational Resources Information Center
Sullivan, Laurie; Porter, Rebecca
2006-01-01
Implementing an enterprise resource planning system is a complex undertaking. Careful planning, management, communication, and staffing can make the difference between a successful and unsuccessful implementation. (Contains 3 tables.)
Implementing Student Information Systems
ERIC Educational Resources Information Center
Sullivan, Laurie; Porter, Rebecca
2006-01-01
Implementing an enterprise resource planning system is a complex undertaking. Careful planning, management, communication, and staffing can make the difference between a successful and unsuccessful implementation. (Contains 3 tables.)
Why are idioms recognized fast?
Tabossi, Patrizia; Fanari, Rachele; Wolf, Kinou
2009-06-01
It is an established fact that idiomatic expressions are fast to process. However, the explanation of the phenomenon is controversial. Using a semantic judgment paradigm, where people decide whether a string is meaningful or not, the present experiment tested the predictions deriving from the three main theories of idiom recognition-the lexical representation hypothesis, the idiom decomposition hypothesis, and the configuration hypothesis. Participants were faster at judging decomposable idioms, nondecomposable idioms, and clichés than at judging their matched controls. The effect was comparable for all conventional expressions. The results were interpreted as suggesting that, as posited by the configuration hypothesis, the fact that they are known expressions, rather than idiomaticity, explains their fast recognition.
A fast meteor detection algorithm
NASA Astrophysics Data System (ADS)
Gural, P.
2016-01-01
A low latency meteor detection algorithm for use with fast steering mirrors had been previously developed to track and telescopically follow meteors in real-time (Gural, 2007). It has been rewritten as a generic clustering and tracking software module for meteor detection that meets both the demanding throughput requirements of a Raspberry Pi while also maintaining a high probability of detection. The software interface is generalized to work with various forms of front-end video pre-processing approaches and provides a rich product set of parameterized line detection metrics. Discussion will include the Maximum Temporal Pixel (MTP) compression technique as a fast thresholding option for feeding the detection module, the detection algorithm trade for maximum processing throughput, details on the clustering and tracking methodology, processing products, performance metrics, and a general interface description.
[Preoperative fasting guidelines: an update].
López Muñoz, A C; Busto Aguirreurreta, N; Tomás Braulio, J
2015-03-01
Anesthesiology societies have issued various guidelines on preoperative fasting since 1990, not only to decrease the incidence of lung aspiration and anesthetic morbidity, but also to increase patient comfort prior to anesthesia. Some of these societies have been updating their guidelines, as such that, since 2010, we now have 2 evidence-based preoperative fasting guidelines available. In this article, an attempt is made to review these updated guidelines, as well as the current instructions for more controversial patients such as infants, the obese, and a particular type of ophthalmic surgery. Copyright © 2014 Sociedad Española de Anestesiología, Reanimación y Terapéutica del Dolor. Publicado por Elsevier España, S.L.U. All rights reserved.
NASA Technical Reports Server (NTRS)
Feynman, Joan; Ruzmaikin, Alexander
2006-01-01
We study CMEs observed by LASCO to have plane of the sky velocities exceeding 1500 km/sec. We find that these extremely fast CMEs are typically associated with flares accompanied by erupting prominences. Our results are consistent with a single CME initiation process that consists of three stages. The initial stage is brought about by the emergence of new magnetic flux, which interacts with the pre-existing magnetic configuration and results in a slow rise of the magnetic structure. The second stage is a fast reconnection phase with flaring, filament eruption and a sudden increase of the rise velocity of the magnetic structure (CME). The third stage consists of propagation in the corona. We discuss the sources of these CMEs and the need for improved understanding of the first and third stages.
Fast Moreau envelope computation I
NASA Astrophysics Data System (ADS)
Lucet, Yves
2006-11-01
The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansive Proximal mapping. Numerical comparisons between the NEP and two existing algorithms: The Linear-time Legendre Transform (LLT) and the Parabolic Envelope (PE) algorithms are performed. Worst-case time complexity, convergence results, and examples are included. The fast Moreau envelope algorithms first factor the Moreau envelope as several one-dimensional transforms and then reduce the brute force quadratic worst-case time complexity to linear time by using either the equivalence with Fast Legendre Transform algorithms, the computation of a lower envelope of parabolas, or, in the convex case, the non expansiveness of the proximal mapping.
Techniques for Fast Stereoscopic MRI
Guttman, Michael A.; McVeigh, Elliot R.
2007-01-01
Stereoscopic MRI can impart 3D perception with only two image acquisitions. This economy over standard multiplanar 3D volume renderings allows faster frame rates, which are needed for real-time imaging applications. Real-time 3D perception may enhance the appreciation of complex anatomical structures, and may improve hand-eye coordination while manipulating a medical device during an image-guided interventional procedure. To this goal, a system is being developed to acquire and display stereoscopic MR images in real-time. A clinically used, fast gradient-recalled echo-train sequence has been modified to produce stereo image pairs. Features have been added for depth cueing, view sharing, and bulk signal suppression. A workstation was attached to a clinical MR scanner for fast data extraction, image reconstruction and stereoscopic image display. PMID:11477636
Implementation of global energy sustainability
Grob, G.R.
1998-02-01
The term energy sustainability emerged from the UN Conference on Environment and Development in Rio 1992, when Agenda 21 was formulated and the Global Energy Charter proclaimed. Emission reductions, total energy costing, improved energy efficiency, and sustainable energy systems are the four fundamental principles of the charter. These principles can be implemented in the proposed financial, legal, technical, and education framework. Much has been done in many countries toward the implementation of the Global Energy Charter, but progress has not been fast enough to ease the disastrous effects of the too many ill-conceived energy systems on the environment, climate, and health. Global warming is accelerating, and pollution is worsening, especially in developing countries with their hunger for energy to meet the needs of economic development. Asian cities are now beating all pollution records, and greenhouse gases are visibly changing the climate with rising sea levels, retracting glaciers, and record weather disasters. This article presents why and how energy investments and research money have to be rechanneled into sustainable energy, rather than into the business-as-usual of depleting, unsustainable energy concepts exceeding one trillion dollars per year. This largest of all investment sectors needs much more attention.
Implementation of polyatomic MCTDHF capability
NASA Astrophysics Data System (ADS)
Haxton, Daniel; Jones, Jeremiah; Rescigno, Thomas; McCurdy, C. William; Ibrahim, Khaled; Williams, Sam; Vecharynski, Eugene; Rouet, Francois-Henry; Li, Xiaoye; Yang, Chao
2015-05-01
The implementation of the Multiconfiguration Time-Dependent Hartree-Fock method for poly- atomic molecules using a cartesian product grid of sinc basis functions will be discussed. The focus will be on two key components of the method: first, the use of a resolution-of-the-identity approximation; sec- ond, the use of established techniques for triple Toeplitz matrix algebra using fast Fourier transform over distributed memory architectures (MPI 3D FFT). The scaling of two-electron matrix element transformations is converted from O(N4) to O(N log N) by including these components. Here N = n3, with n the number of points on a side. We test the prelim- inary implementation by calculating absorption spectra of small hydro- carbons, using approximately 16-512 points on a side. This work is supported by the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences, under the Early Career program, and by the offices of BES and Advanced Scientific Computing Research, under the SciDAC program.
Fast quench reactor and method
Detering, Brent A.; Donaldson, Alan D.; Fincke, James R.; Kong, Peter C.
2002-01-01
A fast quench reaction includes a reactor chamber having a high temperature heating means such as a plasma torch at its inlet and a restrictive convergent-divergent nozzle at its outlet end. Reactants are injected into the reactor chamber. The resulting heated gaseous stream is then rapidly cooled by passage through the nozzle. This "freezes" the desired end product(s) in the heated equilibrium reaction stage.
Fast Setting Cement - Literature Survey
1973-01-01
DACA -39-70-C-0022 Miscellaneous Paper C-73-1b. PROJECT NO. TISSA 02/07 TISA 02/07 . Sb. OTNER REPORT NO(S) (An , ether nu aLbL thel Mirn be...G. M. Hart ib letter of 13 May 1970, subject: Literature Survey Re Air Mobility Fast Setting Cement - Contract No. DACA -39-70-C- 0022. WES personnel
Gricius, Robert F; Wong, Douglas
2016-01-01
Hospitals that are newly qualified for the 340B Drug Pricing Program may have an opportunity for fast-track approval to participate in the program. Three steps are required to seize this opportunity: Use data analytics to assess current and future percentages of Medicaid utilization and eligibility for federal SSI cash benefits. Determine the feasibility of early cost report filing. Prepare appropriate documentation and undertake the initial enrollment process.
Fast quench reactor and method
Detering, Brent A.; Donaldson, Alan D.; Fincke, James R.; Kong, Peter C.
1998-01-01
A fast quench reaction includes a reactor chamber having a high temperature heating means such as a plasma torch at its inlet and a restrictive convergent-divergent nozzle at its outlet end. Reactants are injected into the reactor chamber. The resulting heated gaseous stream is then rapidly cooled by passage through the nozzle. This "freezes" the desired end product(s) in the heated equilibrium reaction stage.
Fast quench reactor and method
Detering, Brent A.; Donaldson, Alan D.; Fincke, James R.; Kong, Peter C.
2002-09-24
A fast quench reaction includes a reactor chamber having a high temperature heating means such as a plasma torch at its inlet and a restrictive convergent-divergent nozzle at its outlet end. Reactants are injected into the reactor chamber. The resulting heated gaseous stream is then rapidly cooled by passage through the nozzle. This "freezes" the desired end product(s) in the heated equilibrium reaction stage.
Fast Anomaly Discovery Given Duplicates
2012-12-01
skipping the computations for duplicate points in SN(ui) that have ci larger than k, the runtime complexity is enhanced significantly. That is, in...Fast anomaly discovery given duplicates Jay-Yoon Lee, U Kang, Danai Koutra, Christos Faloutsos Dec 2012 CMU-CS-12-146 School of Computer Science...ES) Carnegie Mellon University,School of Computer Science,Pittsburgh,PA,15213 8. PERFORMING ORGANIZATION REPORT NUMBER 9. SPONSORING/MONITORING
Fast quench reactor and method
Detering, B.A.; Donaldson, A.D.; Fincke, J.R.; Kong, P.C.
1998-05-12
A fast quench reactor includes a reactor chamber having a high temperature heating means such as a plasma torch at its inlet and a restrictive convergent-divergent nozzle at its outlet end. Reactants are injected into the reactor chamber. The resulting heated gaseous stream is then rapidly cooled by passage through the nozzle. This ``freezes`` the desired end product(s) in the heated equilibrium reaction stage. 7 figs.
A fast chopper for intensity adjustment of heavy-ion beams.
Novikov-Borodin, A. V.; Kutuzov, V. A.; Ostroumov, P. N.; Physics; INR RAS
2005-01-01
Several heavy-ion accelerators are being developed worldwide. It is desirable to provide simultaneous beam delivery to multiple users that can be efficiently implemented using a combination of rf-sweepers and DC magnets. A fast chopper can be used to modulate cw beam intensity by chopping away individual bunches at low beam energy. The major issue of fast choppers is the excessive power requirements from the voltage pulsers. By providing high wave impedance, {approx} 200 Ohm, of a traveling wave structure one can reduce the power requirements for the fast voltage pulser. Several design options of high-impedance structures are discussed.
A fast algorithm for identifying friends-of-friends halos
NASA Astrophysics Data System (ADS)
Feng, Y.; Modi, C.
2017-07-01
We describe a simple and fast algorithm for identifying friends-of-friends features and prove its correctness. The algorithm avoids unnecessary expensive neighbor queries, uses minimal memory overhead, and rejects slowdown in high over-density regions. We define our algorithm formally based on pair enumeration, a problem that has been heavily studied in fast 2-point correlation codes and our reference implementation employs a dual KD-tree correlation function code. We construct features in a hierarchical tree structure, and use a splay operation to reduce the average cost of identifying the root of a feature from O [ log L ] to O [ 1 ] (L is the size of a feature) without additional memory costs. This reduces the overall time complexity of merging trees from O [ L log L ] to O [ L ] , reducing the number of operations per splay by orders of magnitude. We next introduce a pruning operation that skips merge operations between two fully self-connected KD-tree nodes. This improves the robustness of the algorithm, reducing the number of merge operations in high density peaks from O [δ2 ] to O [ δ ] . We show that for cosmological data set the algorithm eliminates more than half of merge operations for typically used linking lengths b ∼ 0 . 2 (relative to mean separation). Furthermore, our algorithm is extremely simple and easy to implement on top of an existing pair enumeration code, reusing the optimization effort that has been invested in fast correlation function codes.
Application of Fast Multipole Methods to the NASA Fast Scattering Code
NASA Technical Reports Server (NTRS)
Dunn, Mark H.; Tinetti, Ana F.
2008-01-01
The NASA Fast Scattering Code (FSC) is a versatile noise prediction program designed to conduct aeroacoustic noise reduction studies. The equivalent source method is used to solve an exterior Helmholtz boundary value problem with an impedance type boundary condition. The solution process in FSC v2.0 requires direct manipulation of a large, dense system of linear equations, limiting the applicability of the code to small scales and/or moderate excitation frequencies. Recent advances in the use of Fast Multipole Methods (FMM) for solving scattering problems, coupled with sparse linear algebra techniques, suggest that a substantial reduction in computer resource utilization over conventional solution approaches can be obtained. Implementation of the single level FMM (SLFMM) and a variant of the Conjugate Gradient Method (CGM) into the FSC is discussed in this paper. The culmination of this effort, FSC v3.0, was used to generate solutions for three configurations of interest. Benchmarking against previously obtained simulations indicate that a twenty-fold reduction in computational memory and up to a four-fold reduction in computer time have been achieved on a single processor.
Implementing electronic documentation.
Noah, Patty
2011-01-01
Implementing health information technology is a major strategic objective. Health care organizations must meet "meaningful use" through the implementation of a certified electronic medical record. It is the imperative to secure leadership support in the project. Communication, accountability, and clinical champions are vital elements for successful implementation.
Fast superconducting magnetic field switch
Goren, Y.; Mahale, N.K.
1996-08-06
The superconducting magnetic switch or fast kicker magnet is employed with electron stream or a bunch of electrons to rapidly change the direction of flow of the electron stream or bunch of electrons. The apparatus employs a beam tube which is coated with a film of superconducting material. The tube is cooled to a temperature below the superconducting transition temperature and is subjected to a constant magnetic field which is produced by an external dc magnet. The magnetic field produced by the dc magnet is less than the critical field for the superconducting material, thus, creating a Meissner Effect condition. A controllable fast electromagnet is used to provide a magnetic field which supplements that of the dc magnet so that when the fast magnet is energized the combined magnetic field is now greater that the critical field and the superconducting material returns to its normal state allowing the magnetic field to penetrate the tube. This produces an internal field which effects the direction of motion and of the electron stream or electron bunch. The switch can also operate as a switching mechanism for charged particles. 6 figs.
Spitler, L G; Scholz, P; Hessels, J W T; Bogdanov, S; Brazier, A; Camilo, F; Chatterjee, S; Cordes, J M; Crawford, F; Deneva, J; Ferdman, R D; Freire, P C C; Kaspi, V M; Lazarus, P; Lynch, R; Madsen, E C; McLaughlin, M A; Patel, C; Ransom, S M; Seymour, A; Stairs, I H; Stappers, B W; van Leeuwen, J; Zhu, W W
2016-03-10
Fast radio bursts are millisecond-duration astronomical radio pulses of unknown physical origin that appear to come from extragalactic distances. Previous follow-up observations have failed to find additional bursts at the same dispersion measure (that is, the integrated column density of free electrons between source and telescope) and sky position as the original detections. The apparent non-repeating nature of these bursts has led to the suggestion that they originate in cataclysmic events. Here we report observations of ten additional bursts from the direction of the fast radio burst FRB 121102. These bursts have dispersion measures and sky positions consistent with the original burst. This unambiguously identifies FRB 121102 as repeating and demonstrates that its source survives the energetic events that cause the bursts. Additionally, the bursts from FRB 121102 show a wide range of spectral shapes that appear to be predominantly intrinsic to the source and which vary on timescales of minutes or less. Although there may be multiple physical origins for the population of fast radio bursts, these repeat bursts with high dispersion measure and variable spectra specifically seen from the direction of FRB 121102 support an origin in a young, highly magnetized, extragalactic neutron star.
Diagnostics for Fast Ignition Science
MacPhee, A; Akli, K; Beg, F; Chen, C; Chen, H; Clarke, R; Hey, D; Freeman, R; Kemp, A; Key, M; King, J; LePape, S; Link, A; Ma, T; Nakamura, N; Offermann, D; Ovchinnikov, V; Patel, P; Phillips, T; Stephens, R; Town, R; Wei, M; VanWoerkom, L; Mackinnon, A
2008-05-06
The concept for Electron Fast Ignition Inertial Confinement Fusion demands sufficient laser energy be transferred from the ignitor pulse to the assembled fuel core via {approx}MeV electrons. We have assembled a suite of diagnostics to characterize such transfer. Recent experiments have simultaneously fielded absolutely calibrated extreme ultraviolet multilayer imagers at 68 and 256eV; spherically bent crystal imagers at 4 and 8keV; multi-keV crystal spectrometers; MeV x-ray bremmstrahlung and electron and proton spectrometers (along the same line of sight); nuclear activation samples and a picosecond optical probe based interferometer. These diagnostics allow careful measurement of energy transport and deposition during and following laser-plasma interactions at extremely high intensities in both planar and conical targets. Augmented with accurate on-shot laser focal spot and pre-pulse characterization, these measurements are yielding new insight into energy coupling and are providing critical data for validating numerical PIC and hybrid PIC simulation codes in an area that is crucial for many applications, particularly fast ignition. Novel aspects of these diagnostics and how they are combined to extract quantitative data on ultra high intensity laser plasma interactions are discussed, together with implications for full-scale fast ignition experiments.
[Fasting and physical endurance capacity].
Schürch, P M
1993-03-01
Fasting, or zero calorie diets are used not only by overweight people as a means of losing weight, but by athletes too. Their use is then explained on philosophical grounds, with the aim of even enhancing sports performance. The purpose of this investigation consisted of quantifying the effects of a 10-day fast on maximum performance capacity and endurance (as measured on a bicycle ergometer) of 12 female students of physical education of normal weight. The measurements included resting and exercise metabolism determinants, as well as weight and lean body mass. The main results show that after the diet period the maximum ergometric performance was lower in absolute terms as well as in relation to weight or lean body mass. Performance capacity for submaximal exercise was also reduced. Fat combustion was enhanced both at rest and during exercise. The reduction of maximum performance and endurance capacity may be explained by an enhanced muscle breakdown, an efficiency drop of muscular work, and an inadequate glycogen content of the acting muscles. Shorter fasting periods of 24-36 hours also lead to a lower performance level for exercise bouts extending from several minutes to 1-3 hours. An enhancement of fat combustion was always conspicuous. One may conclude that optimal physical performance is dependent on full hepatic and muscle glycogen stores. Glycogen concentration in the liver decreases sharply as a matter of fact after merely one day of carbohydrate shortage. Zero calorie or low carbohydrate diets are thus at variance with an optimal physical work capacity.
Fast superconducting magnetic field switch
Goren, Yehuda; Mahale, Narayan K.
1996-01-01
The superconducting magnetic switch or fast kicker magnet is employed with electron stream or a bunch of electrons to rapidly change the direction of flow of the electron stream or bunch of electrons. The apparatus employs a beam tube which is coated with a film of superconducting material. The tube is cooled to a temperature below the superconducting transition temperature and is subjected to a constant magnetic field which is produced by an external dc magnet. The magnetic field produced by the dc magnet is less than the critical field for the superconducting material, thus, creating a Meissner Effect condition. A controllable fast electromagnet is used to provide a magnetic field which supplements that of the dc magnet so that when the fast magnet is energized the combined magnetic field is now greater that the critical field and the superconducting material returns to its normal state allowing the magnetic field to penetrate the tube. This produces an internal field which effects the direction of motion and of the electron stream or electron bunch. The switch can also operate as a switching mechanism for charged particles.
NASA Astrophysics Data System (ADS)
Spitler, L. G.; Scholz, P.; Hessels, J. W. T.; Bogdanov, S.; Brazier, A.; Camilo, F.; Chatterjee, S.; Cordes, J. M.; Crawford, F.; Deneva, J.; Ferdman, R. D.; Freire, P. C. C.; Kaspi, V. M.; Lazarus, P.; Lynch, R.; Madsen, E. C.; McLaughlin, M. A.; Patel, C.; Ransom, S. M.; Seymour, A.; Stairs, I. H.; Stappers, B. W.; van Leeuwen, J.; Zhu, W. W.
2016-03-01
Fast radio bursts are millisecond-duration astronomical radio pulses of unknown physical origin that appear to come from extragalactic distances. Previous follow-up observations have failed to find additional bursts at the same dispersion measure (that is, the integrated column density of free electrons between source and telescope) and sky position as the original detections. The apparent non-repeating nature of these bursts has led to the suggestion that they originate in cataclysmic events. Here we report observations of ten additional bursts from the direction of the fast radio burst FRB 121102. These bursts have dispersion measures and sky positions consistent with the original burst. This unambiguously identifies FRB 121102 as repeating and demonstrates that its source survives the energetic events that cause the bursts. Additionally, the bursts from FRB 121102 show a wide range of spectral shapes that appear to be predominantly intrinsic to the source and which vary on timescales of minutes or less. Although there may be multiple physical origins for the population of fast radio bursts, these repeat bursts with high dispersion measure and variable spectra specifically seen from the direction of FRB 121102 support an origin in a young, highly magnetized, extragalactic neutron star.
Heterogeneous Transmutation Sodium Fast Reactor
S. E. Bays
2007-09-01
The threshold-fission (fertile) nature of Am-241 is used to destroy this minor actinide by capitalizing upon neutron capture instead of fission within a sodium fast reactor. This neutron-capture and its subsequent decay chain leads to the breeding of even neutron number plutonium isotopes. A slightly moderated target design is proposed for breeding plutonium in an axial blanket located above the active “fast reactor” driver fuel region. A parametric study on the core height and fuel pin diameter-to-pitch ratio is used to explore the reactor and fuel cycle aspects of this design. This study resulted in both non-flattened and flattened core geometries. Both of these designs demonstrated a high capacity for removing americium from the fuel cycle. A reactivity coefficient analysis revealed that this heterogeneous design will have comparable safety aspects to a homogeneous reactor of comparable size. A mass balance analysis revealed that the heterogeneous design may reduce the number of fast reactors needed to close the current once-through light water reactor fuel cycle.
fast_protein_cluster: parallel and optimized clustering of large-scale protein modeling data
Hung, Ling-Hong; Samudrala, Ram
2014-01-01
Motivation: fast_protein_cluster is a fast, parallel and memory efficient package used to cluster 60 000 sets of protein models (with up to 550 000 models per set) generated by the Nutritious Rice for the World project. Results: fast_protein_cluster is an optimized and extensible toolkit that supports Root Mean Square Deviation after optimal superposition (RMSD) and Template Modeling score (TM-score) as metrics. RMSD calculations using a laptop CPU are 60× faster than qcprot and 3× faster than current graphics processing unit (GPU) implementations. New GPU code further increases the speed of RMSD and TM-score calculations. fast_protein_cluster provides novel k-means and hierarchical clustering methods that are up to 250× and 2000× faster, respectively, than Clusco, and identify significantly more accurate models than Spicker and Clusco. Availability and implementation: fast_protein_cluster is written in C++ using OpenMP for multi-threading support. Custom streaming Single Instruction Multiple Data (SIMD) extensions and advanced vector extension intrinsics code accelerate CPU calculations, and OpenCL kernels support AMD and Nvidia GPUs. fast_protein_cluster is available under the M.I.T. license. (http://software.compbio.washington.edu/fast_protein_cluster) Contact: lhhung@compbio.washington.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:24532722
NASA Technical Reports Server (NTRS)
Hauschildt, P. H.
1992-01-01
A fast method for the solution of the radiative transfer equation in rapidly moving spherical media, based on an approximate Lambda-operator iteration, is described. The method uses the short characteristic method and a tridiagonal approximate Lambda-operator to achieve fast convergence. The convergence properties and the CPU time requirements of the method are discussed for the test problem of a two-level atom with background continuum absorption and Thomson scattering. Details of the actual implementation for fast vector and parallel computers are given. The method is accurate and fast enough to be incorporated in radiation-hydrodynamic calculations.
Fast neutron imaging device and method
Popov, Vladimir; Degtiarenko, Pavel; Musatov, Igor V.
2014-02-11
A fast neutron imaging apparatus and method of constructing fast neutron radiography images, the apparatus including a neutron source and a detector that provides event-by-event acquisition of position and energy deposition, and optionally timing and pulse shape for each individual neutron event detected by the detector. The method for constructing fast neutron radiography images utilizes the apparatus of the invention.
Fast Foods, Organic Foods, Fad Diets
USDA-ARS?s Scientific Manuscript database
There is no standard definition of fast food. Generally, fast food is eaten without cutlery, and fast-food restaurants have no wait staff. Failure to have a standardized definition makes it difficult to compare studies. Foods available outside the home tend to be high in energy and fat compared w...
Fast assessment of bioaccessible metallic contamination in marine sediments.
Terán-Baamonde, J; Carlosena, A; Soto-Ferreiro, R M; Andrade, J M; Prada, D
2017-09-07
A fast (16min) procedure to assess the bioaccessible metallic fraction of Cd, Cr, Cu, Ni, Pb and Zn simultaneously extracted (SEM) from marine sediments plus an indirect approach to determine acid volatile sulfides (AVS) are presented. For the extraction process magnetic agitation was compared with ultrasonic stirring (using a bath and a probe), and several stirring times were assayed. The proposed SEM procedure uses an ultrasonic probe and 1mL of HCl. It dramatically minimizes the turnaround time and the residues. AVS were evaluated as the difference between the amounts of sulphur in the solid residue after the extraction and total sulphur in the original sample. These procedures are fast, easy to implement and cost-effective to assess the potential risk posed by metals in marine sediments. They were tested using several CRMs and applied to sediments from two Galician Rias (NW Spain); their SEM-AVS differences indicated no biological risk. Copyright © 2017. Published by Elsevier Ltd.
Measurement scheme and simulation for the main reflector of FAST
NASA Astrophysics Data System (ADS)
Hu, Jinwen; Nan, Rendong; Zhu, Lichun; Li, Xinyi
2013-09-01
FAST (five-hundred-meter aperture spherical radio telescope) is a radio telescope being built in a karst depression in Guizhou Province of China, which will be the largest single dish radio telescope in the world [1]. The reflector of the telescope is composed of over 4000 panels, and each panel could adjust its position according to observation requirements. During observations, panels in the illuminated area could form a paraboloid to correct spherical aberration [2]. Therefore, accurate measurement of the positions of panels is crucial for the operation of the telescope. In this paper, we introduce the measurement scheme for the reflector of FAST, and simulate its accuracy using direct linear transform, Gauss-Newton algorithm, Levenberg-Marquardt algorithm and an algorithm referred to as multi-point algorithm. Advantages and disadvantages of using these four methods are compared for analysis at different locations of the panels on the reflector, and suggestions are given in choosing algorithms in implementation.
Interplay between fast ions and turbulence in magnetic fusion plasmas
NASA Astrophysics Data System (ADS)
Dumont, R. J.; Zarzoso, D.; Sarazin, Y.; Garbet, X.; Strugarek, A.; Abiteboul, J.; Cartier-Michaud, T.; Dif-Pradalier, G.; Ghendrih, Ph; Girardo, J.-B.; Grandgirard, V.; Latu, G.; Passeron, C.; Thomine, O.
2013-12-01
Evidence for the impact of energetic particles (EPs) on turbulence is given in this paper. Firstly, the excitation of electrostatic instabilities in linear gyrokinetic simulations performed with the global GYSELA code by introducing distribution functions typical of fast ions in tokamak plasmas is presented. The obtained mode is unambiguously characterized as an EGAM, i.e. a geodesic acoustic mode (GAM) excited by EPs. The influence of EGAMs on turbulence and associated transport is then analyzed by implementing a source adapted to the inclusion of fast particle populations in non-linear simulations. This source successfully excites EGAMs in the presence of turbulence, which leads to a drastic reduction of the turbulent transport. However, this reduction is only transient; it is followed by an increase of the turbulent activity, characterized by a complex interaction between the EGAMs and the turbulence. In the subsequent steady-state regime, turbulent transport appears to be modulated at the EGAM frequency.
Fast wavelet estimation of weak biosignals.
Causevic, Elvir; Morley, Robert E; Wickerhauser, M Victor; Jacquin, Arnaud E
2005-06-01
Wavelet-based signal processing has become commonplace in the signal processing community over the past decade and wavelet-based software tools and integrated circuits are now commercially available. One of the most important applications of wavelets is in removal of noise from signals, called denoising, accomplished by thresholding wavelet coefficients in order to separate signal from noise. Substantial work in this area was summarized by Donoho and colleagues at Stanford University, who developed a variety of algorithms for conventional denoising. However, conventional denoising fails for signals with low signal-to-noise ratio (SNR). Electrical signals acquired from the human body, called biosignals, commonly have below 0 dB SNR. Synchronous linear averaging of a large number of acquired data frames is universally used to increase the SNR of weak biosignals. A novel wavelet-based estimator is presented for fast estimation of such signals. The new estimation algorithm provides a faster rate of convergence to the underlying signal than linear averaging. The algorithm is implemented for processing of auditory brainstem response (ABR) and of auditory middle latency response (AMLR) signals. Experimental results with both simulated data and human subjects demonstrate that the novel wavelet estimator achieves superior performance to that of linear averaging.
Fast Image Texture Classification Using Decision Trees
NASA Technical Reports Server (NTRS)
Thompson, David R.
2011-01-01
Texture analysis would permit improved autonomous, onboard science data interpretation for adaptive navigation, sampling, and downlink decisions. These analyses would assist with terrain analysis and instrument placement in both macroscopic and microscopic image data products. Unfortunately, most state-of-the-art texture analysis demands computationally expensive convolutions of filters involving many floating-point operations. This makes them infeasible for radiation- hardened computers and spaceflight hardware. A new method approximates traditional texture classification of each image pixel with a fast decision-tree classifier. The classifier uses image features derived from simple filtering operations involving integer arithmetic. The texture analysis method is therefore amenable to implementation on FPGA (field-programmable gate array) hardware. Image features based on the "integral image" transform produce descriptive and efficient texture descriptors. Training the decision tree on a set of training data yields a classification scheme that produces reasonable approximations of optimal "texton" analysis at a fraction of the computational cost. A decision-tree learning algorithm employing the traditional k-means criterion of inter-cluster variance is used to learn tree structure from training data. The result is an efficient and accurate summary of surface morphology in images. This work is an evolutionary advance that unites several previous algorithms (k-means clustering, integral images, decision trees) and applies them to a new problem domain (morphology analysis for autonomous science during remote exploration). Advantages include order-of-magnitude improvements in runtime, feasibility for FPGA hardware, and significant improvements in texture classification accuracy.
Fast approximate surface evolution in arbitrary dimension
Malcolm, James; Rathi, Yogesh; Yezzi, Anthony; Tannenbaum, Allen
2013-01-01
The level set method is a popular technique used in medical image segmentation; however, the numerics involved make its use cumbersome. This paper proposes an approximate level set scheme that removes much of the computational burden while maintaining accuracy. Abandoning a floating point representation for the signed distance function, we use integral values to represent the signed distance function. For the cases of 2D and 3D, we detail rules governing the evolution and maintenance of these three regions. Arbitrary energies can be implemented in the framework. This scheme has several desirable properties: computations are only performed along the zero level set; the approximate distance function requires only a few simple integer comparisons for maintenance; smoothness regularization involves only a few integer calculations and may be handled apart from the energy itself; the zero level set is represented exactly removing the need for interpolation off the interface; and evolutions proceed on the order of milliseconds per iteration on conventional uniprocessor workstations. To highlight its accuracy, flexibility and speed, we demonstrate the technique on intensity-based segmentations under various statistical metrics. Results for 3D imagery show the technique is fast even for image volumes. PMID:24392194
Sequential algorithm for fast clique percolation.
Kumpula, Jussi M; Kivelä, Mikko; Kaski, Kimmo; Saramäki, Jari
2008-08-01
In complex network research clique percolation, introduced by Palla, Derényi, and Vicsek [Nature (London) 435, 814 (2005)], is a deterministic community detection method which allows for overlapping communities and is purely based on local topological properties of a network. Here we present a sequential clique percolation algorithm (SCP) to do fast community detection in weighted and unweighted networks, for cliques of a chosen size. This method is based on sequentially inserting the constituent links to the network and simultaneously keeping track of the emerging community structure. Unlike existing algorithms, the SCP method allows for detecting k -clique communities at multiple weight thresholds in a single run, and can simultaneously produce a dendrogram representation of hierarchical community structure. In sparse weighted networks, the SCP algorithm can also be used for implementing the weighted clique percolation method recently introduced by Farkas [New J. Phys. 9, 180 (2007)]. The computational time of the SCP algorithm scales linearly with the number of k -cliques in the network. As an example, the method is applied to a product association network, revealing its nested community structure.
Fast flexible electronics with strained silicon nanomembranes.
Zhou, Han; Seo, Jung-Hun; Paskiewicz, Deborah M; Zhu, Ye; Celler, George K; Voyles, Paul M; Zhou, Weidong; Lagally, Max G; Ma, Zhenqiang
2013-01-01
Fast flexible electronics operating at radio frequencies (>1 GHz) are more attractive than traditional flexible electronics because of their versatile capabilities, dramatic power savings when operating at reduced speed and broader spectrum of applications. Transferrable single-crystalline Si nanomembranes (SiNMs) are preferred to other materials for flexible electronics owing to their unique advantages. Further improvement of Si-based device speed implies significant technical and economic advantages. While the mobility of bulk Si can be enhanced using strain techniques, implementing these techniques into transferrable single-crystalline SiNMs has been challenging and not demonstrated. The past approach presents severe challenges to achieve effective doping and desired material topology. Here we demonstrate the combination of strained- NM-compatible doping techniques with self-sustained-strain sharing by applying a strain-sharing scheme between Si and SiGe multiple epitaxial layers, to create strained print-transferrable SiNMs. We demonstrate a new speed record of Si-based flexible electronics without using aggressively scaled critical device dimensions.
Fast flexible electronics with strained silicon nanomembranes
Zhou, Han; Seo, Jung-Hun; Paskiewicz, Deborah M.; Zhu, Ye; Celler, George K.; Voyles, Paul M.; Zhou, Weidong; Lagally, Max G.; Ma, Zhenqiang
2013-01-01
Fast flexible electronics operating at radio frequencies (>1 GHz) are more attractive than traditional flexible electronics because of their versatile capabilities, dramatic power savings when operating at reduced speed and broader spectrum of applications. Transferrable single-crystalline Si nanomembranes (SiNMs) are preferred to other materials for flexible electronics owing to their unique advantages. Further improvement of Si-based device speed implies significant technical and economic advantages. While the mobility of bulk Si can be enhanced using strain techniques, implementing these techniques into transferrable single-crystalline SiNMs has been challenging and not demonstrated. The past approach presents severe challenges to achieve effective doping and desired material topology. Here we demonstrate the combination of strained- NM-compatible doping techniques with self-sustained-strain sharing by applying a strain-sharing scheme between Si and SiGe multiple epitaxial layers, to create strained print-transferrable SiNMs. We demonstrate a new speed record of Si-based flexible electronics without using aggressively scaled critical device dimensions. PMID:23416347
Fast Chemistry Mechanisms for Climate Applications
NASA Astrophysics Data System (ADS)
Cameron-Smith, P. J.; Connell, P. S.; Bergmann, D. J.; Chuang, C. C.; Prather, M. J.; Lamarque, J.; Hess, P.; Vitt, F.
2008-12-01
When atmospheric chemistry is included in long climate and Earth system simulations, the completeness of the chemical mechanism must be balanced with the computational cost, and the scientific interests of the atmospheric chemist must be tempered by the chemical needs of other components of the climate model (e.g, greenhouse gas concentrations for radiative heating, and deposition rates for biosphere interactions). We have implemented two chemical mechanisms for use in long climate simulations. One uses 28 species to calculate ozone, OH, methane, N2O, and sulfate throughout troposphere and stratosphere. The other uses just 15 species to calculate ozone, OH, and sulfate, with the OH providing the means to back-out the lifetime of methane and other species of interest. We have compared the sensitivity of both mechanisms to emission perturbations against the response of a state-of-the-art full chemistry mechanism that uses 90 species. Both fast mechanisms compare well. Prepared by LLNL under Contract DE-AC52-07NA27344.
Fast Sparse Level Sets on Graphics Hardware.
Jalba, Andrei C; van der Laan, Wladimir J; Roerdink, Jos B T M
2013-01-01
The level-set method is one of the most popular techniques for capturing and tracking deformable interfaces. Although level sets have demonstrated great potential in visualization and computer graphics applications, such as surface editing and physically based modeling, their use for interactive simulations has been limited due to the high computational demands involved. In this paper, we address this computational challenge by leveraging the increased computing power of graphics processors, to achieve fast simulations based on level sets. Our efficient, sparse GPU level-set method is substantially faster than other state-of-the-art, parallel approaches on both CPU and GPU hardware. We further investigate its performance through a method for surface reconstruction, based on GPU level sets. Our novel multiresolution method for surface reconstruction from unorganized point clouds compares favorably with recent, existing techniques and other parallel implementations. Finally, we point out that both level-set computations and rendering of level-set surfaces can be performed at interactive rates, even on large volumetric grids. Therefore, many applications based on level sets can benefit from our sparse level-set method.
Comparison of Fast-Food and Non-Fast-Food Children's Menu Items
ERIC Educational Resources Information Center
Serrano, Elena L.; Jedda, Virginia B.
2009-01-01
Objective: Compare the macronutrient content of children's meals sold by fast-food restaurants (FFR) and non-fast-food restaurants (NFF). Design: All restaurants within the designated city limits were surveyed. Non-fast-food children's meals were purchased, weighed, and analyzed using nutrition software. All fast-food children's meals were…
Comparison of Fast-Food and Non-Fast-Food Children's Menu Items
ERIC Educational Resources Information Center
Serrano, Elena L.; Jedda, Virginia B.
2009-01-01
Objective: Compare the macronutrient content of children's meals sold by fast-food restaurants (FFR) and non-fast-food restaurants (NFF). Design: All restaurants within the designated city limits were surveyed. Non-fast-food children's meals were purchased, weighed, and analyzed using nutrition software. All fast-food children's meals were…
NASA Astrophysics Data System (ADS)
Rasmussen, J.; Nielsen, S. K.; Stejner, M.; Galdon-Quiroga, J.; Garcia-Munoz, M.; Geiger, B.; Jacobsen, A. S.; Jaulmes, F.; Korsholm, S. B.; Lazanyi, N.; Leipold, F.; Ryter, F.; Salewski, M.; Schubert, M.; Stober, J.; Wagner, D.; the ASDEX Upgrade Team; the EUROFusion MST1 Team
2016-11-01
Sawtooth instabilities can modify heating and current-drive profiles and potentially increase fast-ion losses. Understanding how sawteeth redistribute fast ions as a function of sawtooth parameters and of fast-ion energy and pitch is hence a subject of particular interest for future fusion devices. Here we present the first collective Thomson scattering (CTS) measurements of sawtooth-induced redistribution of fast ions at ASDEX Upgrade. These also represent the first localized fast-ion measurements on the high-field side of this device. The results indicate fast-ion losses in the phase-space measurement volume of about 50% across sawtooth crashes, in good agreement with values predicted with the Kadomtsev sawtooth model implemented in TRANSP and with the sawtooth model in the EBdyna_go code. In contrast to the case of sawteeth, we observe no fast-ion redistribution in the presence of fishbone modes. We highlight how CTS measurements can discriminate between different sawtooth models, in particular when aided by multi-diagnostic velocity-space tomography, and briefly discuss our results in light of existing measurements from other fast-ion diagnostics.
3D image registration using a fast noniterative algorithm.
Zhilkin, P; Alexander, M E
2000-11-01
This note describes the implementation of a three-dimensional (3D) registration algorithm, generalizing a previous 2D version [Alexander, Int J Imaging Systems and Technology 1999;10:242-57]. The algorithm solves an integrated form of linearized image matching equation over a set of 3D rectangular sub-volumes ('patches') in the image domain. This integrated form avoids numerical instabilities due to differentiation of a noisy image over a lattice, and in addition renders the algorithm robustness to noise. Registration is implemented by first convolving the unregistered images with a set of computationally fast [O(N)] filters, providing four bandpass images for each input image, and integrating the image matching equation over the given patch. Each filter and each patch together provide an independent set of constraints on the displacement field derived by solving a set of linear regression equations. Furthermore, the filters are implemented at a variety of spatial scales, enabling registration parameters at one scale to be used as an input approximation for deriving refined values of those parameters at a finer scale of resolution. This hierarchical procedure is necessary to avoid false matches occurring. Both downsampled and oversampled (undecimating) filtering is implemented. Although the former is computationally fast, it lacks the translation invariance of the latter. Oversampling is required for accurate interpolation that is used in intermediate stages of the algorithm to reconstruct the partially registered from the unregistered image. However, downsampling is useful, and computationally efficient, for preliminary stages of registration when large mismatches are present. The 3D registration algorithm was implemented using a 12-parameter affine model for the displacement: u(x) = Ax + b. Linear interpolation was used throughout. Accuracy and timing results for registering various multislice images, obtained by scanning a melon and human volunteers in various
Fast feedback for linear colliders
Hendrickson, L.; Adolphsen, C.; Allison, S.; Gromme, T.; Grossberg, P.; Himel, T.; Krauter, K.; MacKenzie, R.; Minty, M.; Sass, R.
1995-05-01
A fast feedback system provides beam stabilization for the SLC. As the SLC is in some sense a prototype for future linear colliders, this system may be a prototype for future feedbacks. The SLC provides a good base of experience for feedback requirements and capabilities as well as a testing ground for performance characteristics. The feedback system controls a wide variety of machine parameters throughout the SLC and associated experiments, including regulation of beam position, angle, energy, intensity and timing parameters. The design and applications of the system are described, in addition to results of recent performance studies.
Isochoric implosions for fast ignition
Clark, D S; Tabak, M
2006-06-05
Fast Ignition (FI) exploits the ignition of a dense, uniform fuel assembly by an external energy source to achieve high gain. In conventional ICF implosions, however, the fuel assembles as a dense shell surrounding a low density, high-pressure hotspot. Such configurations are far from optimal for FI. Here, it is shown that a self-similar spherical implosion of the type originally studied by Guderley [Luftfahrtforschung 19, 302 (1942).] may be employed to implode a dense, quasi-uniform fuel assembly with minimal energy wastage in forming a hotspot. A scheme for realizing these specialized implosions in a practical ICF target is also described.
Searches for Fast Radio Transients
NASA Astrophysics Data System (ADS)
Cordes, J. M.; McLaughlin, M. A.
2003-10-01
We discuss optimal detection of fast radio transients from astrophysical objects while taking into account the effects of propagation through intervening ionized media, including dispersion, scattering, and scintillation. Our analysis applies to the giant-pulse phenomenon exhibited by some pulsars, for which we show examples, and to radio pulses from other astrophysical sources, such as prompt radio emission from gamma-ray burst sources and modulated signals from extraterrestrial civilizations. We estimate scintillation parameters for extragalactic sources that take into account scattering both in the host galaxy and in foreground Galactic plasma.
Fast pulse nonthermal plasma reactor
Rosocha, Louis A.
2005-06-14
A fast pulsed nonthermal plasma reactor includes a discharge cell and a charging assembly electrically connected thereto. The charging assembly provides plural high voltage pulses to the discharge cell. Each pulse has a rise time between one and ten nanoseconds and a duration of three to twenty nanoseconds. The pulses create nonthermal plasma discharge within the discharge cell. Accordingly, the nonthermal plasma discharge can be used to remove pollutants from gases or break the gases into smaller molecules so that they can be more efficiently combusted.
Mechanisms for fast flare reconnection
NASA Technical Reports Server (NTRS)
Vanhoven, G.; Deeds, D.; Tachi, T.
1988-01-01
Normal collisional-resistivity mechanisms of magnetic reconnection have the drawback that they are too slow to explain the fast rise of solar flares. Two methods are examined which are proposed for the speed-up of the magnetic tearing instability: the anomalous enhancement of resistivity by the injection of MHD turbulence and the increase of Coulomb resistivity by radiative cooling. The results are described for nonlinear numerical simulations of these processes which show that the first does not provide the claimed effects, while the second yields impressive rates of reconnection, but low saturated energy outputs.
NASA Astrophysics Data System (ADS)
Sadrozinski, H. F.-W.; Ely, S.; Fadeyev, V.; Galloway, Z.; Ngo, J.; Parker, C.; Petersen, B.; Seiden, A.; Zatserklyaniy, A.; Cartiglia, N.; Marchetto, F.; Bruzzi, M.; Mori, R.; Scaringella, M.; Vinattieri, A.
2013-12-01
We propose to develop a fast, thin silicon sensor with gain capable to concurrently measure with high precision the space (∼10 μm) and time (∼10 ps) coordinates of a particle. This will open up new application of silicon detector systems in many fields. Our analysis of detector properties indicates that it is possible to improve the timing characteristics of silicon-based tracking sensors, which already have sufficient position resolution, to achieve four-dimensional high-precision measurements. The basic sensor characteristics and the expected performance are listed, the wide field of applications are mentioned and the required R&D topics are discussed.
Cho, Nakwon
1980-01-01
A fast-acting valve actuator utilizes a spring driven pneumatically loaded piston to drive a valve gate. Rapid exhaust of pressurized gas from the pneumatically loaded side of the piston facilitates an extremely rapid piston stroke. A flexible selector diaphragm opens and closes an exhaust port in response to pressure differentials created by energizing and de-energizing a solenoid which controls the pneumatic input to the actuator as well as selectively providing a venting action to one side of the selector diaphragm.
Fast Tree: Computing Large Minimum-Evolution Trees with Profiles instead of a Distance Matrix
N. Price, Morgan; S. Dehal, Paramvir; P. Arkin, Adam
2009-07-31
Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement neighbor-joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest-neighbor interchanges to reduce the length of the tree. For an alignment with N sequences, L sites, and a different characters, a distance matrix requires O(N^2) space and O(N^2 L) time, but FastTree requires just O( NLa + N sqrt(N) ) memory and O( N sqrt(N) log(N) L a ) time. To estimate the tree's reliability, FastTree uses local bootstrapping, which gives another 100-fold speedup over a distance matrix. For example, FastTree computed a tree and support values for 158,022 distinct 16S ribosomal RNAs in 17 hours and 2.4 gigabytes of memory. Just computing pairwise Jukes-Cantor distances and storing them, without inferring a tree or bootstrapping, would require 17 hours and 50 gigabytes of memory. In simulations, FastTree was slightly more accurate than neighbor joining, BIONJ, or FastME; on genuine alignments, FastTree's topologies had higher likelihoods. FastTree is available at http://microbesonline.org/fasttree.
Open SHMEM Reference Implementation
Pritchard, Howard; Curtis, Anthony; Welch, Aaron; Fridley, Andrew
2016-05-12
OpenSHMEM is an effort to create a specification for a standardized API for parallel programming in the Partitioned Global Address Space. Along with the specification the project is also creating a reference implementation of the API. This implementation attempts to be portable, to allow it to be deployed in multiple environments, and to be a starting point for implementations targeted to particular hardware platforms. It will also serve as a springboard for future development of the API.
Proximity to Fast Food Outlets and Supermarkets as Predictors of Fast Food Dining Frequency
Duncan, Dustin T.; Elbel, Brian
2015-01-01
Background This study used cross-sectional data to test the independent relationship of (1) proximity to chain fast food outlets and (2) proximity to full-service supermarkets on the frequency of meal-time dining at fast food outlets in two major urban areas, using three approaches to define “access.” Interactions between presence of a supermarket and presence of fast food outlets as predictors of fast food dining were also tested. Methods Residential intersections for respondents in point-of-purchase and random-digit-dial telephone surveys of adults in Philadelphia and Baltimore were geocoded. The count of fast food outlets and supermarkets within quarter-mile, half-mile, and one-mile street network buffers around each respondent’s intersection was calculated, as well as distance to the nearest fast food outlet and supermarket. These variables were regressed on weekly fast-food dining frequency to determine if proximity to fast food and supermarkets had independent and joint effects on fast-food dining. Results The effect of access to supermarkets and chain fast food outlets varied by study population. Among telephone survey respondents, supermarket access was the only significant predictor of fast food dining frequency. Point-of-purchase respondents were generally unaffected by proximity to either supermarkets or fast food outlets. However, ≥1 fast food outlet within a 1-mile buffer was an independent predictor of more fast food meals among point-of-purchase respondents. At ¼-mile distance, ≥1 supermarket was predictive of fewer fast food meals. Conclusions Supermarket access was associated with less fast food dining among telephone respondents while access to fast food outlets were associated with more fast food visits among survey respondents identified at point-of-purchase. This study adds to the existing literature on geographic determinants of fast food dining behavior among urban adults in the general population and those who regularly consume
NASA Astrophysics Data System (ADS)
Olaizola, Bruno; Griffin Collaboration
2016-09-01
The Gamma-Ray Infrastructure For Fundamental Investigations of Nuclei (GRIFFIN) is the new β-decay spectrometer facility at TRIUMF-ISAC. Consists of an array of 16 large-volume HPGe clover detectors with an unparalleled efficiency of 19% at 1.33 MeV. Its strongest advantage is the versatility of the ancillary detectors that can be coupled to the main array to tag on β particles, neutrons or precisely measure conversion electron spectra. An ancillary array of 8 LaBr3(Ce) detectors for γ-rays and a fast plastic scintillator for β-particles has been optimized for fast-timing experiments with GRIFFIN. The 51 mm x 51 mm cylindrical LaBr3(Ce) crystals are coupled to Hamamatsu R2083 photomultipliers. Timing resolutions as good as FWHM 200 ps and time-walks below +/- 30 ps have been obtained for individual crystals using analog electronics. There is also an ongoing project to develop an active BGO shield for the LaBr3(Ce) crystals. The LaBr3(Ce) array commissioning experiment to measure the 145,146Cs decay to 145,146Ba will test its capabilities over a wide range of lifetimes. Preliminary results on the lifetimes of some of the low-laying states will be presented.
Fast generic polar harmonic transforms.
Hoang, Thai V; Tabbone, Salvatore
2014-07-01
Generic polar harmonic transforms have recently been proposed to extract rotation-invariant features from images and their usefulness has been demonstrated in a number of pattern recognition problems. However, direct computation of these transforms from their definition is inefficient and is usually slower than some efficient computation strategies that have been proposed for other methods. This paper presents a number of novel computation strategies to compute these transforms rapidly. The proposed methods are based on the inherent recurrence relations among complex exponential and trigonometric functions used in the definition of the radial and angular kernels of these transforms. The employment of these relations leads to recursive and addition chain-based strategies for fast computation of harmonic function-based kernels. Experimental results show that the proposed method is about 10× faster than direct computation and 5× faster than fast computation of Zernike moments using the q-recursive strategy. Thus, among all existing rotation-invariant feature extraction methods, polar harmonic transforms are the fastest.
The Ignitor Fast Pellet Injector
NASA Astrophysics Data System (ADS)
Frattolillo, A.; Migliori, S.; Bombarda, F.; Milora, S. L.; Baylor, L. R.; Combs, S. K.
2004-11-01
A collaboration between the ENEA Laboratory at Frascati and the Fusion Technology Group of Oak Ridge for the development of a fast pellet injector for the Ignitor ignition experiment has been established. The program aims at the construction of a 4 barrel, double stage gun able to reach speeds up to 4 km/s and thus penetrate to the core of the plasma column. The compact size of the Ignitor machine favors the injection from the low field side, for which very positive results have been obtained on the FTU machine [1], in terms of density profile peaking and good energy confinement. The ongoing activities include the procurement of all the hardware for the criocooler, diagnostics and control electronics, from the ORNL side, and the design and construction of the gun by ENEA. A new fast valve has been developed that considerably reduces the requirements on the expansion volumes necessary to prevent the propulsion gas to reach the plasma chamber. [1] D. Frigione, et al., Nuclear Fusion 41, 1613 (2001).
RCD+: Fast loop modeling server.
López-Blanco, José Ramón; Canosa-Valls, Alejandro Jesús; Li, Yaohang; Chacón, Pablo
2016-07-08
Modeling loops is a critical and challenging step in protein modeling and prediction. We have developed a quick online service (http://rcd.chaconlab.org) for ab initio loop modeling combining a coarse-grained conformational search with a full-atom refinement. Our original Random Coordinate Descent (RCD) loop closure algorithm has been greatly improved to enrich the sampling distribution towards near-native conformations. These improvements include a new workflow optimization, MPI-parallelization and fast backbone angle sampling based on neighbor-dependent Ramachandran probability distributions. The server starts by efficiently searching the vast conformational space from only the loop sequence information and the environment atomic coordinates. The generated closed loop models are subsequently ranked using a fast distance-orientation dependent energy filter. Top ranked loops are refined with the Rosetta energy function to obtain accurate all-atom predictions that can be interactively inspected in an user-friendly web interface. Using standard benchmarks, the average root mean squared deviation (RMSD) is 0.8 and 1.4 Å for 8 and 12 residues loops, respectively, in the challenging modeling scenario in where the side chains of the loop environment are fully remodeled. These results are not only very competitive compared to those obtained with public state of the art methods, but also they are obtained ∼10-fold faster. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.
RCD+: Fast loop modeling server
López-Blanco, José Ramón; Canosa-Valls, Alejandro Jesús; Li, Yaohang; Chacón, Pablo
2016-01-01
Modeling loops is a critical and challenging step in protein modeling and prediction. We have developed a quick online service (http://rcd.chaconlab.org) for ab initio loop modeling combining a coarse-grained conformational search with a full-atom refinement. Our original Random Coordinate Descent (RCD) loop closure algorithm has been greatly improved to enrich the sampling distribution towards near-native conformations. These improvements include a new workflow optimization, MPI-parallelization and fast backbone angle sampling based on neighbor-dependent Ramachandran probability distributions. The server starts by efficiently searching the vast conformational space from only the loop sequence information and the environment atomic coordinates. The generated closed loop models are subsequently ranked using a fast distance-orientation dependent energy filter. Top ranked loops are refined with the Rosetta energy function to obtain accurate all-atom predictions that can be interactively inspected in an user-friendly web interface. Using standard benchmarks, the average root mean squared deviation (RMSD) is 0.8 and 1.4 Å for 8 and 12 residues loops, respectively, in the challenging modeling scenario in where the side chains of the loop environment are fully remodeled. These results are not only very competitive compared to those obtained with public state of the art methods, but also they are obtained ∼10-fold faster. PMID:27151199
Williams, P.F. . Dept. of Electrical Engineering)
1993-02-01
This report describes work accomplished under EPRI contract RP8012-08. The main focus of the research program is a primarily empirical study of the electrical breakdown of long, air-filled gaps. There has been a long history of study of electrical breakdown of gases, and the report starts with a brief review of this work. Then the design and operation of a high-voltage, fast-risetime pulse generator is described. The generator produces pulses of amplitude up to 150 kV, with risetime of 15--20 ns. Using this generator, we have obtained some preliminary high-speed, high-sensitivity streak and shutter photographs of the initial stages of breakdown of N[sub 2] and N[sub 2]O[sub 2]-filled, 12 cm non-uniform field gaps, and these results are presented. We find significantly different behavior in pure N[sub 2] than in mixtures containing a small amount of 0[sub 2]. The report concludes with the results we obtained on fast-pulse flashover of power pole insulators. We find that the voltage required to cause flashover of a wood insulator in 100 ns is about twice that required to induce flashover in 50 [mu]s, a standard'' lightning pulse duration. For the ceramic power distribution insulator (ANSI class 55-4) we studied, we were unable to induce flashover on the 100 ns time scale with the voltages available to us.
Manybeam velocimeter for fast surfaces
Goosman, D.; Avara, G.; Steinmetz, L.; Lai, C.; Perry, S.
1996-09-01
For the past 5 years, we have conceived, built and successfully used a new 10 beam laser velocimeter for monitoring velocity vs time histories of fast moving surfaces, and will have a 20 beam capability soon. We conceived a method to multiplex 5 to 10 beams through a single Fabry-Perot interferometer, without losing any light that our equivalently-performing single beam system could use, and with negligible cross- talk. This saves the cost of 16 interferometers, simplifies operation and takes less space than without multiplexing. We devised special efficient light collecting probes, streak cameras that change sweep speed during the course of the record, and a new double cavity interferometer which is better, cheaper and more flexible than our previous versions. With the 10 recorders, we conceived and employ a method of using both a fast and a slow streak camera on each of 5 beams without reducing the light that is available to either camera separately. Five new galvanometrically-driven triggerable CCD streak cameras will be installed soon.
Cortical Specializations Underlying Fast Computations.
Volgushev, Maxim
2016-04-01
The time course of behaviorally relevant environmental events sets temporal constraints on neuronal processing. How does the mammalian brain make use of the increasingly complex networks of the neocortex, while making decisions and executing behavioral reactions within a reasonable time? The key parameter determining the speed of computations in neuronal networks is a time interval that neuronal ensembles need to process changes at their input and communicate results of this processing to downstream neurons. Theoretical analysis identified basic requirements for fast processing: use of neuronal populations for encoding, background activity, and fast onset dynamics of action potentials in neurons. Experimental evidence shows that populations of neocortical neurons fulfil these requirements. Indeed, they can change firing rate in response to input perturbations very quickly, within 1 to 3 ms, and encode high-frequency components of the input by phase-locking their spiking to frequencies up to 300 to 1000 Hz. This implies that time unit of computations by cortical ensembles is only few, 1 to 3 ms, which is considerably faster than the membrane time constant of individual neurons. The ability of cortical neuronal ensembles to communicate on a millisecond time scale allows for complex, multiple-step processing and precise coordination of neuronal activity in parallel processing streams, while keeping the speed of behavioral reactions within environmentally set temporal constraints.
Real Time Fast Ultrasound Imaging Technology and Possible Applications
NASA Astrophysics Data System (ADS)
Cruza, J. F.; Perez, M.; Moreno, J. M.; Fritsch, C.
In this work, a novel hardware architecture for fast ultrasound imaging based on FPGA devices is proposed. A key difference over other approaches is the unlimited scalability in terms of active channels without performance losses. Acquisition and processing tasks share the same hardware, eliminating communication bottlenecks with smaller size and power losses. These features make this system suitable to implement the most demanding imaging applications, like 3D Phased Array, Total Focusing Method, Vector Doppler, Image Compounding, High Speed Part Scanning and advanced elastographic techniques. A single medium sized FPGA allows beamforming up to 200 scan lines simultaneously, which is enough to perform most of the above mentioned applications in strict real time.
Laser rastering flow cytometry: fast cell counting and identification
NASA Astrophysics Data System (ADS)
Vacca, G.; Junnarkar, M. R.; Goldblatt, N. R.; Yee, M. W.; Van Slyke, B. M.; Briese, T. C.
2009-02-01
We describe the concept of laser rastering flow cytometry, where a rapidly scanning laser beam allows counting and classification of cells at much higher rates than currently possible. Modifications to existing flow cytometers to implement the concept include an acousto-optic deflector, fast analog-to-digital conversion, and a two-step digital-signal-processing scheme that handles the high data rates and provides key assay information. Results are shown that prove the concept, demonstrating the ability to resolve closely spaced cells and to measure cells at rates more than an order of magnitude faster than on conventional flow-cytometer-based hematology analyzers.
Fast Model Generalized Pseudopotential Theory Interatomic Potential Routine
2015-03-18
MGPT is an unclassified source code for the fast evaluation and application of quantum-based MGPT interatomic potentials for mrtals. The present version of MGPT has been developed entirely at LLNL, but is specifically designed for implementation in the open-source molecular0dynamics code LAMMPS maintained by Sandia National Laboratories. Using MGPT in LAMMPS, with separate input potential data, one can perform large-scale atomistic simulations of the structural, thermodynamic, defeat and mechanical properties of transition metals with quantum-mechanical realism.
Fast computational scheme of image compression for 32-bit microprocessors
NASA Technical Reports Server (NTRS)
Kasperovich, Leonid
1994-01-01
This paper presents a new computational scheme of image compression based on the discrete cosine transform (DCT), underlying JPEG and MPEG International Standards. The algorithm for the 2-d DCT computation uses integer operations (register shifts and additions / subtractions only); its computational complexity is about 8 additions per image pixel. As a meaningful example of an on-board image compression application we consider the software implementation of the algorithm for the Mars Rover (Marsokhod, in Russian) imaging system being developed as a part of Mars-96 International Space Project. It's shown that fast software solution for 32-bit microprocessors may compete with the DCT-based image compression hardware.
A method for fast feature extraction in threshold scans
NASA Astrophysics Data System (ADS)
Mertens, Marius C.; Ritman, James
2014-01-01
We present a fast, analytical method to calculate the threshold and noise parameters from a threshold scan. This is usually done by fitting a response function to the data which is computationally very intensive. The runtime can be minimized by a hardware implementation, e.g. using an FPGA, which in turn requires to minimize the mathematical complexity of the algorithm in order to fit into the available resources on the FPGA. The systematic errors of the method are analyzed and reasonable choices of the parameters for use in practice are given.
Giving a nutritional fast hug in the intensive care unit.
Monares Zepeda, Enrique; Galindo Martín, Carlos Alfredo
2015-05-01
Implementing a nutrition support protocol in critical care is a complex and dynamic process that involves the use of evidence, education programs and constant monitoring. To facilitate this task we developed a mnemonic tool called the Nutritional FAST HUG (F: feeding, A: analgesia, S: stools, T: trace elements, H: head of bed, U: ulcers, G: glucose control) with a process also internally developed (both modified from the mnemonic proposed by Jean Louis Vincent) called MIAR (M: measure, I: interpret, A: act, R: reanalysis) showing an easy form to perform medical rounds at the intensive care unit using a systematic process.
Two-Photon Laser Scanning Stereomicroscopy for Fast Volumetric Imaging
Yang, Yanlong; Yao, Baoli; Lei, Ming; Dan, Dan; Li, Runze; Horn, Mark Van; Chen, Xun; Li, Yang; Ye, Tong
2016-01-01
Bessel beams have been successfully used in two-photon laser scanning fluorescence microscopy to extend the depth of field (EDF), which makes it possible to observe fast events volumetrically. However, the depth information is lost due to integration of fluorescence signals along the propagation direction. We describe the design and implementation of two-photon lasers scanning stereomicroscopy, which allows viewing dynamic processes in three-dimensional (3D) space stereoscopically in real-time with shutter glasses at the speed of 1.4 volumes per second. The depth information can be appreciated by human visual system or be recovered with correspondence algorithms for some cases. PMID:27997624
A Study on the RFID Tag Encryption using Fast SEED
NASA Astrophysics Data System (ADS)
Ko, Hoon; Kim, Jiyeon; Jung, Jongjin; Joe, Susan; Lee, Yongjun; Chang, Yoonseok
2007-12-01
We have to solve the problem of SEED to apply the SEED algorithm in RFID Tag. Because it must keep both a fast performance and low electronic, also it has the limitation of the physical character to it. Although the SEED is more safety than other encryption algorithms, it has a physical trouble when they try to apply it in Tag. Therefore, In this paper we proposed the way to reduce into the 8 rounds, and we implemented the 8 rounded SEED algorithm to RFID tag encryption.
Uncertainty Assessment for Fast Reactors Based on Nuclear Data Adjustment
NASA Astrophysics Data System (ADS)
Ivanova, T.; Ivanov, E.; Ecrabet, F.
2014-04-01
The paper presents IRSN's results of the OECD/NEA WPEC Subgroup 33 benchmark exercise which is focused upon combined use of differential and integral data using adjustment technique. The results are generated by BERING code using different sets of input data: integral parameters and sensitivity coefficients for fast benchmark experiments and applications computed by deterministic ERANOS code and Monte Carlo SCALE sequences, COMMARA-2.0 and JENDL-4.0 cross-section-covariance data and integral correlations provided by JAEA. The paper demonstrates results of the adjustment when using different input data and two adjustment algorithms implemented in BERING.
The implementation of POSTGRES
NASA Technical Reports Server (NTRS)
Stonebraker, Michael; Rowe, Lawrence A.; Hirohama, Michael
1990-01-01
The design and implementation decisions made for the three-dimensional data manager POSTGRES are discussed. Attention is restricted to the DBMS backend functions. The POSTGRES data model and query language, the rules system, the storage system, the POSTGRES implementation, and the current status and performance are discussed.
ERIC Educational Resources Information Center
Brooks, D. Christopher
2014-01-01
While the use of analytics to promote student success is gaining in popularity, basic questions about what IPAS is and the issues institutions face during implementation and integration. The "IPAS Implementation Handbook" catalogs the experiences, observations, and practical advice from 19 institutions engaged in IPAS implementation…
The implementation of POSTGRES
NASA Technical Reports Server (NTRS)
Stonebraker, Michael; Rowe, Lawrence A.; Hirohama, Michael
1990-01-01
The design and implementation decisions made for the three-dimensional data manager POSTGRES are discussed. Attention is restricted to the DBMS backend functions. The POSTGRES data model and query language, the rules system, the storage system, the POSTGRES implementation, and the current status and performance are discussed.
ERIC Educational Resources Information Center
Brooks, D. Christopher
2014-01-01
While the use of analytics to promote student success is gaining in popularity, basic questions about what IPAS is and the issues institutions face during implementation and integration. The "IPAS Implementation Handbook" catalogs the experiences, observations, and practical advice from 19 institutions engaged in IPAS implementation…
Teacher Evaluation Policy Implementation.
ERIC Educational Resources Information Center
Burger, John M.
This study investigated the degree of teacher evaluation policy implementation in Alberta, the events that influenced teacher evaluation policy adoption, and the variables that affected the policy implementation process. The first phase of the study was primarily qualitative, using semistructured interviews with selected key decision-makers and…
Environmental protection Implementation Plan
R. C. Holland
1999-12-01
This ``Environmental Protection Implementation Plan'' is intended to ensure that the environmental program objectives of Department of Energy Order 5400.1 are achieved at SNL/California. This document states SNL/California's commitment to conduct its operations in an environmentally safe and responsible manner. The ``Environmental Protection Implementation Plan'' helps management and staff comply with applicable environmental responsibilities.
On the abstracted dataflow complexity of Fast Fourier Transforms
Boehm, A.P.W.; Hiromoto, R.E.; Kelly, K.A.; Ashley, J.M.
1992-05-01
In this paper we develop and analyze the simulated performance of codes for the Fast Fourier Transform written in If and targeted for execution on Motorola`s dataflow machine Monsoon. The FFT application is of interest because of its computational parallelism, its requirement for global communications, and its array element data dependences. We use the parallel profiling simulator Id World to study the dataflow performance of various implementations. Our approach is comparative. We study two approaches, a recursive and an iterative one, and in each version we examine the effect of a variety of implementations. We contend that only through such comparative evaluations can significant insight be gained in understanding the computational and structural details of functional algorithms.
PYTRANSIT: fast and easy exoplanet transit modelling in PYTHON
NASA Astrophysics Data System (ADS)
Parviainen, Hannu
2015-07-01
We present a fast and user friendly exoplanet transit light-curve modelling package PYTRANSIT, implementing optimized versions of the Giménez and Mandel & Agol transit models. The package offers an object-oriented PYTHON interface to access the two models implemented natively in FORTRAN with OpenMP parallelization. A partial OpenCL version of the quadratic Mandel-Agol model is also included for GPU-accelerated computations. The aim of PYTRANSIT is to facilitate the analysis of photometric time series of exoplanet transits consisting of hundreds of thousands of data points, and of multipassband transit light curves from spectrophotometric observations, as a part of a researcher's programming toolkit for building complex, problem-specific analyses.
Fast complex memory polynomial-based adaptive digital predistorter
NASA Astrophysics Data System (ADS)
Singh Sappal, Amandeep; Singh Patterh, Manjeet; Sharma, Sanjay
2011-07-01
Today's 3G wireless systems require both high linearity and high power amplifier (PA) efficiency. The high peak-to-average ratios of the digital modulation schemes used in 3G wireless systems require that the RF PA maintain high linearity over a large range while maintaining this high efficiency; these two requirements are often at odds with each other with many of the traditional amplifier architectures. In this article, a fast and easy-to-implement adaptive digital predistorter has been presented for Wideband Code Division Multiplexed signals using complex memory polynomial work function. The proposed algorithm has been implemented to test a Motorola LDMOSFET PA. The proposed technique also takes care of the memory effects of the PA, which have been ignored in many proposed techniques in the literature. The results show that the new complex memory polynomial-based adaptive digital predistorter has better linearisation performance than conventional predistortion techniques.
Reduced Fast Ion Transport Model For The Tokamak Transport Code TRANSP
Podesta,, Mario; Gorelenkova, Marina; White, Roscoe
2014-02-28
Fast ion transport models presently implemented in the tokamak transport code TRANSP [R. J. Hawryluk, in Physics of Plasmas Close to Thermonuclear Conditions, CEC Brussels, 1 , 19 (1980)] are not capturing important aspects of the physics associated with resonant transport caused by instabilities such as Toroidal Alfv en Eigenmodes (TAEs). This work describes the implementation of a fast ion transport model consistent with the basic mechanisms of resonant mode-particle interaction. The model is formulated in terms of a probability distribution function for the particle's steps in phase space, which is consistent with the MonteCarlo approach used in TRANSP. The proposed model is based on the analysis of fast ion response to TAE modes through the ORBIT code [R. B. White et al., Phys. Fluids 27 , 2455 (1984)], but it can be generalized to higher frequency modes (e.g. Compressional and Global Alfv en Eigenmodes) and to other numerical codes or theories.
Rotor for centrifugal fast analyzers
Lee, N.E.
1984-01-01
The invention is an improved photometric analyzer of the rotary cuvette type, the analyzer incorporating a multicuvette rotor of novel design. The rotor (a) is leaktight, (b) permits operation in the 90/sup 0/ and 180/sup 0/ excitation modes, (c) is compatible with extensively used Centrifugal Fast Analyzers, and (d) can be used thousands of times. The rotor includes an assembly comprising a top plate, a bottom plate, and a central plate, the rim of the central plate being formed with circumferentially spaced indentations. A uv-transmitting ring is sealably affixed to the indented rim to define with the indentations an array of cuvettes. The ring serves both as a sealing means and an end window for the cuvettes.
Fast Steerable Principal Component Analysis.
Zhao, Zhizhen; Shkolnisky, Yoel; Singer, Amit
2016-03-01
Cryo-electron microscopy nowadays often requires the analysis of hundreds of thousands of 2-D images as large as a few hundred pixels in each direction. Here, we introduce an algorithm that efficiently and accurately performs principal component analysis (PCA) for a large set of 2-D images, and, for each image, the set of its uniform rotations in the plane and their reflections. For a dataset consisting of n images of size L × L pixels, the computational complexity of our algorithm is O(nL(3) + L(4)), while existing algorithms take O(nL(4)). The new algorithm computes the expansion coefficients of the images in a Fourier-Bessel basis efficiently using the nonuniform fast Fourier transform. We compare the accuracy and efficiency of the new algorithm with traditional PCA and existing algorithms for steerable PCA.
Fast discovery of simple rules
Domingos, P.
1996-12-31
The recent emergence of data mining as a major application of machine learning has led to increased interest in fast rule induction algorithms. These are able to efficiently process large numbers of examples, under the constraint of still achieving good accuracy. If e is the number of examples, many rule learners have {Theta}(e{sup 4}) asymptotic time complexity in noisy domains, and C4.5RULES has been empirically observed to sometimes require {Theta}(e{sup 4}) time. Recent advances have brought this bound down to {Theta}(e log{sup 2} e), while maintaining accuracy at the level of C4.5RULES`s. Ideally, we would like to have an algorithm capable of inducing accurate rules in time linear in e, without becoming too expensive in other factors. This extended abstract presents such an algorithm.
Rotor for centrifugal fast analyzers
Lee, Norman E.
1985-01-01
The invention is an improved photometric analyzer of the rotary cuvette type, the analyzer incorporating a multicuvette rotor of novel design. The rotor (a) is leaktight, (b) permits operation in the 90.degree. and 180.degree. excitation modes, (c) is compatible with extensively used Centrifugal Fast Analyzers, and (d) can be used thousands of times. The rotor includes an assembly comprising a top plate, a bottom plate, and a central plate, the rim of the central plate being formed with circumferentially spaced indentations. A UV-transmitting ring is sealably affixed to the indented rim to define with the indentations an array of cuvettes. The ring serves both as a sealing means and an end window for the cuvettes.
Fast-Growing Vestibular Schwannoma
Falcioni, Maurizio; Taibah, Abdelkader; De Donato, Giuseppe; Piccirillo, Enrico; Russo, Alessandra; Sanna, Mario
2000-01-01
A case of a Jehovah's witness affected by an intracanalicular vestibular schwannoma with an extremely fast growth rate is presented. Nine months after presentation, the tumor reached 23 mm in the cerebellopontine angle. A partial removal through a retrosigmoid approach was planned. Because of the presence of a dominant high jugular bulb masquering the internal auditory canal, the intracanalicular portion of the tumor was left in place. The residual tumor grew 12 mm in 2 months. Even after a gross total removal through a middle cranial fossa approach, the tumor recurred, reaching the size of 30 mm in 17 months. A modified transcochlear approach was then performed, and the patient was free of disease at the last radiologic follow-up, 8 months after the surgery. We illustrate our strategy in treating this aggressive benign lesion with unusual behavior. ImagesFigure 1Figure 2Figure 3Figure 4Figure 5Figure 6Figure 7Figure 8Figure 9Figure 10 PMID:17171109
Integral fast reactor safety features
Cahalan, J.E.; Kramer, J.M.; Marchaterre, J.F.; Mueller, C.J.; Pedersen, D.R.; Sevy, R.H.; Wade, D.C.; Wei, T.Y.C.
1988-01-01
The Integral Fast Reactor (IFR) is an advanced liquid-metal-cooled reactor concept being developed at Argonne National Laboratory. The two major goals of the IFR development effort are improved economics and enhanced safety. In addition to liquid metal cooling, the principal design features that distinguish the IFR are: (1) a pool-type primary system, (2) an advanced ternary alloy metallic fuel, and (3) an integral fuel cycle with on-site fuel reprocessing and fabrication. This paper focuses on the technical aspects of the improved safety margins available in the IFR concept. This increased level of safety is made possible by (1) the liquid metal (sodium) coolant and pool-type primary system layout, which together facilitate passive decay heat removal, and (2) a sodium-bonded metallic fuel pin design with thermal and neutronic properties that provide passive core responses which control and mitigate the consequences of reactor accidents.
Fast breeder reactor protection system
van Erp, J.B.
1973-10-01
Reactor protection is provided for a liquid-metal-fast breeder reactor core by measuring the coolant outflow temperature from each of the subassemblies of the core. The outputs of the temperature sensors from a subassembly region of the core containing a plurality of subassemblies are combined in a logic circuit which develops a scram alarm if a predetermined number of the sensors indicate an over temperature condition. The coolant outflow from a single subassembly can be mixed with the coolant outflow from adjacent subassemblies prior to the temperature sensing to increase the sensitivity of the protection system to a single subassembly failure. Coherence between the sensors can be required to discriminate against noise signals. (Official Gazette)
Fast Steerable Principal Component Analysis
Zhao, Zhizhen; Shkolnisky, Yoel; Singer, Amit
2016-01-01
Cryo-electron microscopy nowadays often requires the analysis of hundreds of thousands of 2-D images as large as a few hundred pixels in each direction. Here, we introduce an algorithm that efficiently and accurately performs principal component analysis (PCA) for a large set of 2-D images, and, for each image, the set of its uniform rotations in the plane and their reflections. For a dataset consisting of n images of size L × L pixels, the computational complexity of our algorithm is O(nL3 + L4), while existing algorithms take O(nL4). The new algorithm computes the expansion coefficients of the images in a Fourier–Bessel basis efficiently using the nonuniform fast Fourier transform. We compare the accuracy and efficiency of the new algorithm with traditional PCA and existing algorithms for steerable PCA. PMID:27570801
Development of out-of-core fast Fourier transform software for the connection machine. Final report
Sweet, R.; Wilson, J.
1995-10-01
This report describes the algorithm and implementation of an out-of-core Fast Fourier Transform routine for the Thinking Machines Corp. CM-5 parallel computer. The software has the capability of transforming multi-dimensional arrays that are both real and complex.
We have performed a series of experiments to determine the tradeoff in detection sensitivity for implementing design features for an Open-Path Fourier Transform Infrared (OP-FTIR) chemical analyzer that would be quick to deploy under emergency response conditions. The fast-deplo...
We have performed a series of experiments to determine the tradeoff in detection sensitivity for implementing design features for an Open-Path Fourier Transform Infrared (OP-FTIR) chemical analyzer that would be quick to deploy under emergency response conditions. The fast-deplo...
Implementation of Adaptive Digital Controllers on Programmable Logic Devices
NASA Technical Reports Server (NTRS)
Gwaltney, David A.; King, Kenneth D.; Smith, Keary J.; Ormsby, John (Technical Monitor)
2002-01-01
Much has been made of the capabilities of FPGA's (Field Programmable Gate Arrays) in the hardware implementation of fast digital signal processing (DSP) functions. Such capability also makes and FPGA a suitable platform for the digital implementation of closed loop controllers. There are myriad advantages to utilizing an FPGA for discrete-time control functions which include the capability for reconfiguration when SRAM- based FPGA's are employed, fast parallel implementation of multiple control loops and implementations that can meet space level radiation tolerance in a compact form-factor. Other researchers have presented the notion that a second order digital filter with proportional-integral-derivative (PID) control functionality can be implemented in an FPGA. At Marshall Space Flight Center, the Control Electronics Group has been studying adaptive discrete-time control of motor driven actuator systems using digital signal processor (DSF) devices. Our goal is to create a fully digital, flight ready controller design that utilizes an FPGA for implementation of signal conditioning for control feedback signals, generation of commands to the controlled system, and hardware insertion of adaptive control algorithm approaches. While small form factor, commercial DSP devices are now available with event capture, data conversion, pulse width modulated outputs and communication peripherals, these devices are not currently available in designs and packages which meet space level radiation requirements. Meeting our goals requires alternative compact implementation of such functionality to withstand the harsh environment encountered on spacecraft. Radiation tolerant FPGA's are a feasible option for reaching these goals.
Implementation of Adaptive Digital Controllers on Programmable Logic Devices
NASA Technical Reports Server (NTRS)
Gwaltney, David A.; King, Kenneth D.; Smith, Keary J.; Ormsby, John (Technical Monitor)
2002-01-01
Much has been made of the capabilities of FPGA's (Field Programmable Gate Arrays) in the hardware implementation of fast digital signal processing (DSP) functions. Such capability also makes and FPGA a suitable platform for the digital implementation of closed loop controllers. There are myriad advantages to utilizing an FPGA for discrete-time control functions which include the capability for reconfiguration when SRAM- based FPGA's are employed, fast parallel implementation of multiple control loops and implementations that can meet space level radiation tolerance in a compact form-factor. Other researchers have presented the notion that a second order digital filter with proportional-integral-derivative (PID) control functionality can be implemented in an FPGA. At Marshall Space Flight Center, the Control Electronics Group has been studying adaptive discrete-time control of motor driven actuator systems using digital signal processor (DSF) devices. Our goal is to create a fully digital, flight ready controller design that utilizes an FPGA for implementation of signal conditioning for control feedback signals, generation of commands to the controlled system, and hardware insertion of adaptive control algorithm approaches. While small form factor, commercial DSP devices are now available with event capture, data conversion, pulse width modulated outputs and communication peripherals, these devices are not currently available in designs and packages which meet space level radiation requirements. Meeting our goals requires alternative compact implementation of such functionality to withstand the harsh environment encountered on spacecraft. Radiation tolerant FPGA's are a feasible option for reaching these goals.
Sleep during Ramadan intermittent fasting.
Roky, R; Chapotot, F; Hakkou, F; Benchekroun, M T; Buguet, A
2001-12-01
During the month of Ramadan intermittent fasting, Muslims eat exclusively between sunset and sunrise, which may affect nocturnal sleep. The effects of Ramadan on sleep and rectal temperature (Tre) were examined in eight healthy young male subjects who reported at the laboratory on four occasions: (i) baseline 15 days before Ramadan (BL); (ii) on the eleventh day of Ramadan (beginning of Ramadan, BR); (iii) on the twenty-fifth day of Ramadan (end of Ramadan, ER); and (iv) 2 weeks after Ramadan (AR). Although each session was preceded by an adaptation night, data from the first night were discarded. Polysomnography was taken on ambulatory 8-channel Oxford Medilog MR-9000 II recorders. Standard electroencephalogram (EEG), electro-oculogram (EOG) and electromyogram (EMG) recordings were scored visually with the PhiTools ERA. The main finding of the study was that during Ramadan sleep latency is increased and sleep architecture modified. Sleep period time and total sleep time decreased in BR and ER. The proportion of non-rapid eye movement (NREM) sleep increased during Ramadan and its structure changed, with an increase in stage 2 proportion and a decrease in slow wave sleep (SWS) duration. Rapid eye movement (REM) sleep duration and proportion decreased during Ramadan. These changes in sleep parameters were associated with a delay in the occurrence of the acrophase of Tre and an increase in nocturnal Tre during Ramadan. However, the 24-h mean value (mesor) of Tre did not vary. The nocturnal elevation of Tre was related to a 2-3-h delay in the acrophase of the circadian rhythm. The amplitude of the circadian rhythm of Tre was decreased during Ramadan. The effects of Ramadan fasting on nocturnal sleep, with an increase in sleep latency and a decrease in SWS and REM sleep, and changes in Tre, were attributed to the inversion of drinking and meal schedule, rather than to an altered energy intake which was preserved in this study.
Heterogeneous Recycling in Fast Reactors
Forget, Benoit; Pope, Michael; Piet, Steven J.; Driscoll, Michael
2012-07-30
Current sodium fast reactor (SFR) designs have avoided the use of depleted uranium blankets over concerns of creating weapons grade plutonium. While reducing proliferation risks, this restrains the reactor design space considerably. This project will analyze various blanket and transmutation target configurations that could broaden the design space while still addressing the non-proliferation issues. The blanket designs will be assessed based on the transmutation efficiency of key minor actinide (MA) isotopes and also on mitigation of associated proliferation risks. This study will also evaluate SFR core performance under different scenarios in which depleted uranium blankets are modified to include minor actinides with or without moderators (e.g. BeO, MgO, B4C, and hydrides). This will be done in an effort to increase the sustainability of the reactor and increase its power density while still offering a proliferation resistant design with the capability of burning MA waste produced from light water reactors (LWRs). Researchers will also analyze the use of recycled (as opposed to depleted) uranium in the blankets. The various designs will compare MA transmutation efficiency, plutonium breeding characteristics, proliferation risk, shutdown margins and reactivity coefficients with a current reference sodium fast reactor design employing homogeneous recycling. The team will also evaluate the out-of-core accumulation and/or burn-down rates of MAs and plutonium isotopes on a cycle-by-cycle basis. This cycle-by-cycle information will be produced in a format readily usable by the fuel cycle systems analysis code, VISION, for assessment of the sustainability of the deployment scenarios.
The time course of cognitive control implementation.
Janssens, Clio; De Loof, Esther; Pourtois, Gilles; Verguts, Tom
2016-08-01
Optimally recruiting cognitive control is a key factor in efficient task performance. In line with influential cognitive control theories, earlier work assumed that control is relatively slow. We challenge this notion and test whether control also can be implemented more rapidly by investigating the time course of cognitive control. In two experiments, a visual discrimination paradigm was applied. A reward cue was presented with variable intervals to target onset. The results showed that reward cues can rapidly improve performance. Importantly, the reward manipulation was orthogonal to the response, ensuring that the reward effect was due to fast cognitive control implementation rather than to automatic activation of rewarded S-R associations. We also empirically specify the temporal limits of cognitive control, because the reward cue had no effect when it was presented shortly after target onset, during task execution.
Fast Adaptive Maneuvering Experiment (Fame)
1992-03-29
Interface ................................................. 14 3.1. MC68HC II Communications ..................................... 14 3.2. Workstation/MC63HC1...I Message Formats ........................... 15 3.3. Workstation (PC) Communications ............................... I 3.4. Coordinate Conversion...interface to thc system as simple as possible, a Motorola MC68HCIl microcontroller unit (MCU) has been cmrpioý•c,_ to implement the RS-232 communications
HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets usingFast Bitmap Indices
Gosink, Luke; Shalf, John; Stockinger, Kurt; Wu, Kesheng; Bethel,Wes
2006-03-30
Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user community since they provide multi-dimensional storage and retrieval. However, one of the drawbacks of these storage formats is that they do not support semantic indexing which is important for interactive data analysis where scientists look for features of interests such as ''Find all supernova explosions where energy > 10{sup 5} and temperature > 10{sup 6}''. In this paper we present a novel approach called HDF5-FastQuery to accelerate the data access of large HDF5 files by introducing multi-dimensional semantic indexing. Our implementation leverages an efficient indexing technology called bitmap indexing that has been widely used in the database community. Bitmap indices are especially well suited for interactive exploration of large-scale read only data. Storing the bitmap indices into the HDF5 file has the following advantages: (a) Significant performance speedup of accessing subsets of multi-dimensional data and (b) portability of the indices across multiple computer platforms. We will present an API that simplifies the execution of queries on HDF5 files for general scientific applications and data analysis. The design is flexible enough to accommodate the use of arbitrary indexing technology for semantic range queries. We will also provide a detailed performance analysis of HDF5-FastQuery for both synthetic and scientific data. The results demonstrate that our proposed approach for multi-dimensional queries is up to a factor of 2 faster than HDF5.
HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets UsingFast Bitmap Indices
Gosink, Luke; Shalf, John; Stockinger, Kurt; Wu, Kesheng; Bethel,Wes
2005-12-07
Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user community since they provide multi-dimensional storage and retrieval. However, one of the drawbacks of these storage formats is that they do not support semantic indexing which is important for interactive data analysis where scientists look for features of interests such as ''Find all supernova explosions where energy >105 and temperature >106''. In this paper we present a novel approach called HDF5-FastQuery to accelerate the data access of large HDF5 files by introducing multi-dimensional semantic indexing. Our implementation leverages an efficient indexing technology called ''bitmapindexing'' that has been widely used in the database community. Bitmapindices are especially well suited for interactive exploration of large-scale read-only data. Storing the bitmap indices into the HDF5 file has the following advantages: (a) Significant performance speedup of accessing subsets of multi-dimensional data and (b) portability of the indices across multiple computer platforms. We will present an API that simplifies the execution of queries on HDF5 files for general scientific applications and data analysis. The design is flexible enough to accommodate the use of arbitrary indexing technology for semantic range queries. We will also provide a detailed performance analysis of HDF5-FastQuery for both synthetic and scientific data. The results demonstrate that our proposed approach for multi-dimensional queries is up to a factor of 2 faster than HDF5.
Nutritional and behavioral effects of gorge and fast feeding in captive lions.
Altman, Joanne D; Gross, Kathy L; Lowry, Stephen R
2005-01-01
Nonhuman animals in captivity manifest behaviors and physiological conditions that are not common in the wild. Lions in captivity face problems of obesity, inactivity, and stereotypy. To mediate common problems of captive lions, this study implemented a gorge and fast feeding schedule that better models naturalistic patterns: African lions (Panthera leo) gradually adapted from a conventional feeding program to a random gorge and fast feeding schedule. Digestibility increased significantly and food intake and metabolizable energy intake correspondingly decreased. Lions also showed an increase in appetitive active behaviors, no increase in agonistic behavior, and paced half as frequently on fast days as on feeding days. Thus, switching captive lions to a gorge and fast feeding schedule resulted in improved nutritional status and increased activity.
The progress in the neutron diagnostics in the Fast Ignition experiment with GEKKO XII and LFEX
NASA Astrophysics Data System (ADS)
Arikawa, Yasunobu; Nagai, Takahiro; Abe, Yuki; Kojima, Sadaoki; Sakata, Shohei; Inoue, Hiroaki; Fujioka, Shinsuke; Sarukura, Nobuhiko; Nakai, Mitsuo; Shiraga, Hiroyuki; Azechi, Hiroshi
2012-10-01
In the fast ignitor experiment the neutron diagnostics is very challenging due to too large backgrounds originated from hard X ray. In the Fast Ignition integrated experimental campaign held in 2010 in GEKKO XII and LFEX facility in Institute of Laser Engineering Osaka (ILE), the Xylen based new liquid scintillator coupled with the gated photomultiplier tube has successfully recorded neutron signal with heating the energy of up to 400 J. However there was significant large background in the signal originated from neutrons via (γ,n) reaction from the target chamber wall. The neutron collimator was developed and implemented to suppress these neutron backgrounds. We succeeded to record a very clear neutron signals in every shot in the fast ignitor experimental campaign held in July 2012 with the heating laser energy of around 1000 J with the pulse width of 2.2 ps. The details of the detector and the result of the fast ignition experiment will be presented.
Storage and retrieval of light pulses in a fast-light medium via active Raman gain
NASA Astrophysics Data System (ADS)
Xu, Datang; Bai, Zhengyang; Huang, Guoxiang
2016-12-01
We propose a scheme to realize the storage and retrieval of light pulses in a fast-light medium via a mechanism of active Raman gain (ARG). The system under consideration is a four-level atomic gas interacting with three (pump, signal, and control) laser fields. We show that a stable propagation of signal light pulses with superluminal velocity (i.e., fast-light pulses) is possible in such a system through the ARG contributed by the pump field and the quantum interference effect induced by the control field. We further show that a robust storage and retrieval of light pulses in such a fast-light medium can be implemented by switching on and off the pump and the control fields simultaneously. The results reported here may have potential applications for light information processing and transmission using fast-light media.
Fast Transient Behavior of Thyristor Switches.
1985-02-01
FAST TRANSIENT BEHAVIOR OF THYRISTOR SWITCHES(U) TEXAS i/tl TECH UNIV LUBBOCK DEPT OF ELECTRICAL ENGINEERING PROTNOV FEB 85 RADC-TR-85-20...8217 , " , - ." .- ., .-, ..., .., . ., , ." ’ ’ , ’ , ., " " , ’ ., ., .., ..’ ..’ , .’ .. ., [ ." -.-.-, . ’ .J ,Z . ’ .’ , , . ,. C ; RADC-TR85-20 4 Final Technical Report February 1965 Lf) FAST TRANSIENT BEHAVIOR OF 4 ~THYRISTOR SWITCHES Texas Tech...Ctawaficaitonp FAST TRANSIENT BEHAVIOR OF THYRISTOR SWITCHES 12. PERSONAL AUTHOR(S)
Symmetric Fast Marching Schemes for Better Numerical Isotropy.
Appia, Vikram; Yezzi, Anthony
2013-03-06
Existing Fast Marching methods solve the Eikonal equation using a continuous (first order) model to estimate the accumulated cost, but a discontinuous (zero order) model for the traveling cost at each grid point. As a result the estimate of the accumulated cost (calculated numerically) at a given point will vary based on the direction of the arriving front, introducing an anisotropy into the discrete algorithm even though the continuous PDE is itself isotropic. To remove this anisotropy, we propose two very different schemes. In the first model we utilize a continuous interpolation of the traveling cost, which is not biased by the direction of the propagating front. In the second model we upsample the traveling cost on a higher resolution grid to overcome the directional bias. We show the significance of removing the directional bias in the computation of the cost in some applications of fast marching method, demonstrating that both methods make the discrete implementation more isotropic in accordance with the underlying continuous PDE. We also compare the accuracy and computation time of our proposed methods with the existing state of the art fast marching techniques to demonstrate the superiority of our method.
CMB quadrupole suppression. II. The early fast roll stage
NASA Astrophysics Data System (ADS)
Boyanovsky, D.; de Vega, H. J.; Sanchez, N. G.
2006-12-01
Within the effective field theory of inflation, an initialization of the classical dynamics of the inflaton with approximate equipartition between the kinetic and potential energy of the inflaton leads to a brief fast roll stage that precedes the slow roll regime. The fast roll stage leads to an attractive potential in the wave equations for the mode functions of curvature and tensor perturbations. The evolution of the inflationary perturbations is equivalent to the scattering by this potential and a useful dictionary between the scattering data and observables is established. Implementing methods from scattering theory we prove that this attractive potential leads to a suppression of the quadrupole moment for CMB and B-mode angular power spectra. The scale of the potential is determined by the Hubble parameter during slow roll. Within the effective field theory of inflation at the grand unification (GUT) energy scale we find that if inflation lasts a total number of e-folds Ntot˜59, there is a 10% 20% suppression of the CMB quadrupole and about 2% 4% suppression of the tensor quadrupole. The suppression of higher multipoles is smaller, falling off as 1/l2. The suppression is much smaller for Ntot>59, therefore if the observable suppression originates in the fast roll stage, there is the upper bound Ntot˜59.
Fast global image smoothing based on weighted least squares.
Min, Dongbo; Choi, Sunghwan; Lu, Jiangbo; Ham, Bumsub; Sohn, Kwanghoon; Do, Minh N
2014-12-01
This paper presents an efficient technique for performing a spatially inhomogeneous edge-preserving image smoothing, called fast global smoother. Focusing on sparse Laplacian matrices consisting of a data term and a prior term (typically defined using four or eight neighbors for 2D image), our approach efficiently solves such global objective functions. In particular, we approximate the solution of the memory-and computation-intensive large linear system, defined over a d-dimensional spatial domain, by solving a sequence of 1D subsystems. Our separable implementation enables applying a linear-time tridiagonal matrix algorithm to solve d three-point Laplacian matrices iteratively. Our approach combines the best of two paradigms, i.e., efficient edge-preserving filters and optimization-based smoothing. Our method has a comparable runtime to the fast edge-preserving filters, but its global optimization formulation overcomes many limitations of the local filtering approaches. Our method also achieves high-quality results as the state-of-the-art optimization-based techniques, but runs ∼10-30 times faster. Besides, considering the flexibility in defining an objective function, we further propose generalized fast algorithms that perform Lγ norm smoothing (0 < γ < 2) and support an aggregated (robust) data term for handling imprecise data constraints. We demonstrate the effectiveness and efficiency of our techniques in a range of image processing and computer graphics applications.
Active vision system integrating fast and slow processes
NASA Astrophysics Data System (ADS)
Castrillon-Santana, Modesto; Guerra-Artal, C.; Hernandez-Sosa, J.; Dominguez-Brito, A.; Isern-Gonzalez, J.; Cabrera-Gamez, Jorge; Hernandez-Tejera, F. M.
1998-10-01
This paper describes an Active Vision System whose design assumes a distinction between fast or reactive and slow or background processes. Fast processes need to operate in cycles with critical timeouts that may affect system stability. While slow processes, though necessary, do not compromise system stability if its execution is delayed. Based on this simple taxonomy, a control architecture has been proposed and a prototype implemented that is able to track people in real-time with a robotic head while trying to identify the target. In this system, the tracking mobile is considered as the reactive part of the system while person identification is considered a background task. This demonstrator has been developed using a new generation DSP (TMS320C80) as a specialized coprocessor to deal with fast processes, and a commercial robotic head with a dedicated DSP-based motor controller. These subsystems are hosted by a standard Pentium-Pro PC running Windows NT where slow processes are executed. The flexibility achieved in the design phase and the preliminary results obtained so far seem to validate the approach followed to integrate time- critical and slow tasks on a heterogeneous hardware platform.
Research on Fast-Doppler-Broadening of neutron cross sections
Li, S.; Wang, K.; Yu, G.
2012-07-01
A Fast-Doppler-Broadening method is developed in this work to broaden Continuous Energy neutron cross-sections for Monte Carlo calculations. Gauss integration algorithm and parallel computing are implemented in this method, which is unprecedented in the history of cross section processing. Compared to the traditional code (NJOY, SIGMA1, etc.), the new Fast-Doppler-Broadening method shows a remarkable speedup with keeping accuracy. The purpose of using Gauss integration is to avoid complex derivation of traditional broadening formula and heavy load of computing complementary error function that slows down the Doppler broadening process. The OpenMP environment is utilized in parallel computing which can take full advantage of modern multi-processor computers. Combination of the two can reduce processing time of main actinides (such as {sup 238}U, {sup 235}U) to an order of magnitude of 1{approx}2 seconds. This new method is fast enough to be applied to Online Doppler broadening. It can be combined or coupled with Monte Carlo transport code to solve temperature dependent problems and neutronics-thermal hydraulics coupled scheme which is a big challenge for the conventional NJOY-MCNP system. Examples are shown to determine the efficiency and relative errors compared with the NJOY results. A Godiva Benchmark is also used in order to test the ACE libraries produced by the new method. (authors)
CMB quadrupole suppression. II. The early fast roll stage
Boyanovsky, D.; Vega, H. J. de; Sanchez, N. G.
2006-12-15
Within the effective field theory of inflation, an initialization of the classical dynamics of the inflaton with approximate equipartition between the kinetic and potential energy of the inflaton leads to a brief fast roll stage that precedes the slow roll regime. The fast roll stage leads to an attractive potential in the wave equations for the mode functions of curvature and tensor perturbations. The evolution of the inflationary perturbations is equivalent to the scattering by this potential and a useful dictionary between the scattering data and observables is established. Implementing methods from scattering theory we prove that this attractive potential leads to a suppression of the quadrupole moment for CMB and B-mode angular power spectra. The scale of the potential is determined by the Hubble parameter during slow roll. Within the effective field theory of inflation at the grand unification (GUT) energy scale we find that if inflation lasts a total number of e-folds N{sub tot}{approx}59, there is a 10%-20% suppression of the CMB quadrupole and about 2%-4% suppression of the tensor quadrupole. The suppression of higher multipoles is smaller, falling off as 1/l{sup 2}. The suppression is much smaller for N{sub tot}>59, therefore if the observable suppression originates in the fast roll stage, there is the upper bound N{sub tot}{approx}59.
Fast readout of GEM detectors for medical imaging
NASA Astrophysics Data System (ADS)
Bucciantonio, M.; Amaldi, U.; Kieffer, R.; Malakhov, N.; Sauli, F.; Watts, D.
2013-08-01
We describe the design and implementation of a fast data acquisition (DAQ) system for Gas Electron Multiplier (GEM) trackers applied to imaging and dosimetry in hadrontherapy. Within the AQUA project of the TERA foundation a prototype of Proton Range Radiography of 30×30 cm2 active area has been designed and built to provide in-beam integrated density images of the patient before treatment. It makes use of a pair of GEMs to record position and direction of protons emerging from the target. A fast data acquisition rate close to 1 MHz will allow obtaining a good resolution in-beam proton radiography in a few seconds. A dedicated fast front-end circuit for GEM detectors (GEMROC by AGH-Crakow University) is read by the FPGA based DAQ card (GR_DAQ), developed by the AQUA group. The same system is under evaluation (within the ENVISION European project) to realize the in-vivo dosimetry, based on detecting secondary light particles during the treatment of the patient.
Correlation between macrosomia body indices and maternal fasting blood glucose.
Song, Y; Zhang, S; Song, W
2014-05-01
To explore the significance of neonatal body indices in identifying pathological macrosomia, we implemented a retrospective study of 254 neonates, including: 100 macrosomia of diabetic pregnancies, 77 macrosomia of healthy pregnancies and 77 normal neonates of healthy pregnancies, using their birth weight, body length, head circumference and chest circumference, to calculate neonatal body indices, multiple regression analysis of the correlation between newborn body indices and maternal fasting blood glucose. The Quetelet Index and Kaup Index of diabetic macrosomia is higher than that of non-diabetic macrosomia; HC:CC (ratio between head circumference and chest circumference) is reversed (p < 0.05). The multiple regression equation of neonatal body indices to maternal fasting blood glucose is BG = 6.959 + 0.031 QI -4.482 × HC:CC. Quetelet index and HC:CC have linear relationship with maternal fasting blood glucose (p < 0.05). Compared with birth weight, Quetelet Index and HC:CC could better reflect the effect of maternal metabolism on the fetus and be of great significance in the prediction of fetal macrosomia.
The fast escaping set for quasiregular mappings
NASA Astrophysics Data System (ADS)
Bergweiler, Walter; Drasin, David; Fletcher, Alastair
2014-06-01
The fast escaping set of a transcendental entire function is the set of all points which tend to infinity under iteration as fast as possible compatible with the growth of the function. We study the analogous set for quasiregular mappings in higher dimensions and show, among other things, that various equivalent definitions of the fast escaping set for transcendental entire functions in the plane also coincide for quasiregular mappings. We also exhibit a class of quasiregular mappings for which the fast escaping set has the structure of a spider's web.
Fasting: Molecular Mechanisms and Clinical Applications
Longo, Valter D.; Mattson, Mark P.
2014-01-01
Fasting has been practiced for millennia, but only recently studies have shed light on its role in adaptive cellular responses that reduce oxidative damage and inflammation, optimize energy metabolism and bolster cellular protection. In lower eukaryotes, chronic fasting extends longevity in part by reprogramming metabolic and stress resistance pathways. In rodents intermittent or periodic fasting protects against diabetes, cancers, heart disease and neurodegeneration, while in humans it helps reduce obesity, hypertension, asthma and rheumatoid arthritis. Thus, fasting has the potential to delay aging and help prevent and treat diseases while minimizing the side effects caused by chronic dietary interventions. PMID:24440038
Impact of intermittent fasting on glucose homeostasis.
Varady, Krista A
2016-07-01
This article provides an overview of the most recent human trials that have examined the impact of intermittent fasting on glucose homeostasis. Our literature search retrieved one human trial of alternate day fasting, and three trials of Ramadan fasting published in the past 12 months. Current evidence suggests that 8 weeks of alternate day fasting that produces mild weight loss (4% from baseline) has no effect on glucose homeostasis. As for Ramadan fasting, decreases in fasting glucose, insulin, and insulin resistance have been noted after 4 weeks in healthy normal weight individuals with mild weight loss (1-2% from baseline). However, Ramadan fasting may have little impact on glucoregulatory parameters in women with polycystic ovarian syndrome who failed to observe weight loss. Whether intermittent fasting is an effective means of regulating glucose homeostasis remains unclear because of the scarcity of studies in this area. Large-scale, longer-term randomized controlled trials will be required before the use of fasting can be recommended for the prevention and treatment of metabolic diseases.
Fast decoding algorithms for coded aperture systems
NASA Astrophysics Data System (ADS)
Byard, Kevin
2014-08-01
Fast decoding algorithms are described for a number of established coded aperture systems. The fast decoding algorithms for all these systems offer significant reductions in the number of calculations required when reconstructing images formed by a coded aperture system and hence require less computation time to produce the images. The algorithms may therefore be of use in applications that require fast image reconstruction, such as near real-time nuclear medicine and location of hazardous radioactive spillage. Experimental tests confirm the efficacy of the fast decoding techniques.
Safer staining method for acid fast bacilli.
Ellis, R C; Zabrowarny, L A
1993-06-01
To develop a method for staining acid fast bacilli which excluded highly toxic phenol from the staining solution. A lipophilic agent, a liquid organic detergent, LOC High Studs, distributed by Amway, was substituted. The acid fast bacilli stained red; nuclei, cytoplasm, and cytoplasmic elements stained blue on a clear background. These results compare very favourably with acid fast bacilli stained by the traditional method. Detergents are efficient lipophilic agents and safer to handle than phenol. The method described here stains acid fast bacilli as efficiently as traditional carbol fuchsin methods. LOC High Suds is considerably cheaper than phenol.
Safer staining method for acid fast bacilli.
Ellis, R C; Zabrowarny, L A
1993-01-01
To develop a method for staining acid fast bacilli which excluded highly toxic phenol from the staining solution. A lipophilic agent, a liquid organic detergent, LOC High Studs, distributed by Amway, was substituted. The acid fast bacilli stained red; nuclei, cytoplasm, and cytoplasmic elements stained blue on a clear background. These results compare very favourably with acid fast bacilli stained by the traditional method. Detergents are efficient lipophilic agents and safer to handle than phenol. The method described here stains acid fast bacilli as efficiently as traditional carbol fuchsin methods. LOC High Suds is considerably cheaper than phenol. Images PMID:7687254
Practical management of diabetes during Ramadan fasting.
Fariduddin, M; Mahtab, H; Latif, Z A; Siddiqui, N I
2011-07-01
Diabetes mellitus is a global epidemic including Bangladesh. It is a chronic, costly and deadly disease. Recent advancement gives us the opportunity to control diabetes and offer the patient to have a normal or near normal life. Fasting during Ramadan is one of the five pillars of Islam. Recent studies show that most of the type-2 diabetic patients can fast during the holy month of Ramadan safely. But they need pre-Ramadan counseling for assessment, education, motivation, dietary and drug adjustment. Ramadan is beneficial for health. Fasting improves metabolic control, reduces weight and helps to control hypertension. Fasting also associated with some risks like-hypoglycemia, diabetic ketoacidosis, hyper osmolar non ketotic coma and dehydration. All of these risks can be significantly reduced by pre-Ramadan counseling. Those who are at very high risks of hypoglycemia and acute diabetic or other complications they should not fast. After recovery they should complete their fast with the consultation of Islamic scholars. If there is hypoglycemia while fasting, fast must be broken. Islam allows us to have a regular blood sugar test during fast. Patient should follow a highly individualized management plan. Close monitoring is essential to prevent complications for safe Ramadan.
fast_protein_cluster: parallel and optimized clustering of large-scale protein modeling data.
Hung, Ling-Hong; Samudrala, Ram
2014-06-15
fast_protein_cluster is a fast, parallel and memory efficient package used to cluster 60 000 sets of protein models (with up to 550 000 models per set) generated by the Nutritious Rice for the World project. fast_protein_cluster is an optimized and extensible toolkit that supports Root Mean Square Deviation after optimal superposition (RMSD) and Template Modeling score (TM-score) as metrics. RMSD calculations using a laptop CPU are 60× faster than qcprot and 3× faster than current graphics processing unit (GPU) implementations. New GPU code further increases the speed of RMSD and TM-score calculations. fast_protein_cluster provides novel k-means and hierarchical clustering methods that are up to 250× and 2000× faster, respectively, than Clusco, and identify significantly more accurate models than Spicker and Clusco. fast_protein_cluster is written in C++ using OpenMP for multi-threading support. Custom streaming Single Instruction Multiple Data (SIMD) extensions and advanced vector extension intrinsics code accelerate CPU calculations, and OpenCL kernels support AMD and Nvidia GPUs. fast_protein_cluster is available under the M.I.T. license. (http://software.compbio.washington.edu/fast_protein_cluster) © The Author 2014. Published by Oxford University Press.
SOLACOS: system implementation
NASA Astrophysics Data System (ADS)
Pribil, Klaus; Fleming, A.
1995-04-01
This paper describes the design and the current implementation state of the SOLACOS breadboard. SOLACOS is the German national program to develop a high data rate inter- satellite communication system. The breadboard comprises two communication terminals and experimental ground infrastructure. Each terminal basically consists of the `Optical Head', which is close to a flight system implementation and the remote `Electronics Rack' with the lasers and electronics. The optical assemblies are connected via fibers. The experimental ground infrastructure will implement a test setup for the verification of the pointing acquisition and tracking subsystem performance.
Fast Charging Electric Vehicle Research & Development Project
Heny, Michael
2014-03-31
The research and development project supported the engineering, design and implementation of on-road Electric Vehicle (“EV”) charging technologies. It included development of potential solutions for DC fast chargers (“DCFC”) capable of converting high voltage AC power to the DC power required by EVs. Additional development evaluated solutions related to the packaging of power electronic components and enclosure design, as well as for the design and evaluation of EV charging stations. Research compared different charging technologies to identify optimum applications in a municipal fleet. This project collected EV usage data and generated a report demonstrating that EVs, when supported by adequate charging infrastructure, are capable of replacing traditional internal combustion vehicles in many municipal applications. The project’s period of performance has demonstrated various methods of incorporating EVs into a municipal environment, and has identified three general categories for EV applications: Short Commute: Defined as EVs performing in limited duration, routine commutes. - Long Commute: Defined as tasks that require EVs to operate in longer daily mileage patterns. - Critical Needs: Defined as the need for EVs to be ready at every moment for indefinite periods. Together, the City of Charlottesville, VA (the “City”) and Aker Wade Power Technologies, LLC (“Aker Wade”) concluded that the EV has a viable position in many municipal fleets but with limited recommendation for use in Critical Needs applications such as Police fleets. The report also documented that, compared to internal combustion vehicles, BEVs have lower vehicle-related greenhouse gas (“GHG”) emissions and contribute to a reduction of air pollution in urban areas. The enhanced integration of EVs in a municipal fleet can result in reduced demand for imported oil and reduced municipal operating costs. The conclusions indicated in the project’s Engineering Report (see Attachment
Relationship of attitudes toward fast food and frequency of fast-food intake in adults.
Dave, Jayna M; An, Lawrence C; Jeffery, Robert W; Ahluwalia, Jasjit S
2009-06-01
The purpose of the study was to examine the association between attitudes toward fast food and the frequency of fast-food intake in adults. This study is a cross-sectional evaluation of random digit-dial telephone surveys to identify patterns of eating away from home and attitudes toward it. Participants included 530 adults (94% white, 65% women, 70% married, 42% with college educated). Attitudes toward fast food was measured using an 11-item, 4-dimensional scale: perceived convenience of fast food (alpha=0.56); fast food is fun and social (alpha=0.55); fast food perceived as unhealthful (alpha=0.45); and dislike toward cooking (alpha=0.52). Frequency of fast-food intake was found to be significantly associated with age (odds ratios (OR)=0.981, P=0.001), gender (men>women), and marital status of the participants (single>married/partnered and divorced/separated/widowed). Additionally, frequency of fast-food intake was also found to be significantly associated with perceived convenience of fast food (OR=1.162, P<0.001) and dislike toward cooking (OR=1.119, P<0.001) but not with perceived unhealthfulness of fast food (OR=0.692, P=0.207). These findings suggest public education regarding the unhealthfulness of fast food may not influence fast food consumption. Interventions targeting the issue of convenience and quick or efficient preparation of nutritious alternatives to fast food could be more promising.
The passage of fast electrons through matter
NASA Astrophysics Data System (ADS)
Sorini, Adam P.
This work regards the passage of fast electrons through matter, and in particular how electrons scatter and lose energy within a solid. The basic quantum theory of these scattering processes was first considered in the early- to mid-20th century by Bohr, Bethe, Fermi, and others. This work extends our understanding of how a relativistic electron scatters off, and loses energy to, a complex many-body system. The main idea of this work is that it is now possible to calculate, from first-principles, the inelastic losses of relativistic electrons in condensed matter. We present ab initio calculations based on a real-space Green's function approach, implemented in the FEFF8 computer program[1]. Our work focuses on three topics: Relativistic stopping power and associated loss parameters, electron energy loss spectroscopy in high energy transmission electron microscopes, and the inelastic electron scattering mixed dynamic form factor. We calculate, for the first time, ab initio stopping powers and inelastic mean free paths in real materials. The stopping powers are calculated over a broad energy range, from ten eV to above ten MeV. We also present the first ab initio calculations of the "mean excitation energy". We develop a relativistic theory of inelastic electron scattering, based on ab initio calculations of dielectric response, and the generalized Lorenz gauge. Using our relativistic dielectric theory, we calculate the EELS magic angle ratio for boron nitride and for graphite. In these anisotropic materials we find large relativistic corrections to the magic angle for high energy electron microscopes. We also predict and calculate large deviations in the EELS magic angle from the relativistic vacuum predictions in the low energy-loss regime. Finally, we present calculations of mixed dynamic form factor.
NASA Astrophysics Data System (ADS)
Gilleron, Franck; Piron, Robin
2015-12-01
We present Dédale, a fast code implementing a simplified non-local-thermodynamic-equilibrium (NLTE) plasma model. In this approach, the stationary collisional-radiative rates equations are solved for a set of well-chosen Layzer complexes in order to determine the ion state populations. The electronic structure is approximated using the screened hydrogenic model (SHM) of More with relativistic corrections. The radiative and collisional cross-sections are based on Kramers and Van Regemorter formula, respectively, which are extrapolated to derive analytical expressions for all the rates. The latter are improved thereafter using Gaunt factors or more accurate tabulated data. Special care is taken for dielectronic rates which are compared and rescaled with quantum calculations from the Averroès code. The emissivity and opacity spectra are calculated under the same assumptions as for the radiative rates, either in a detailed manner by summing the transitions between each pair of complexes, or in a coarser statistical way by summing the one-electron transitions averaged over the complexes. Optionally, nℓ-splitting can be accounted for using a WKB approach in an approximate potential reconstructed analytically from the screened charges. It is also possible to improve the spectra by replacing some transition arrays with more accurate data tabulated using the SCO-RCG or FAC codes. This latter option is particularly useful for K-shell emission spectroscopy. The Dédale code was used to submit neon and tungsten cases in the last NLTE-8 workshop (Santa Fe, November 4-8, 2013). Some of these results are presented, as well as comparisons with Averroès calculations.
Fast transfer of crossmodal time interval training.
Chen, Lihan; Zhou, Xiaolin
2014-06-01
Sub-second time perception is essential for many important sensory and perceptual tasks including speech perception, motion perception, motor coordination, and crossmodal interaction. This study investigates to what extent the ability to discriminate sub-second time intervals acquired in one sensory modality can be transferred to another modality. To this end, we used perceptual classification of visual Ternus display (Ternus in Psychol Forsch 7:81-136, 1926) to implicitly measure participants' interval perception in pre- and posttests and implemented an intra- or crossmodal sub-second interval discrimination training protocol in between the tests. The Ternus display elicited either an "element motion" or a "group motion" percept, depending on the inter-stimulus interval between the two visual frames. The training protocol required participants to explicitly compare the interval length between a pair of visual, auditory, or tactile stimuli with a standard interval or to implicitly perceive the length of visual, auditory, or tactile intervals by completing a non-temporal task (discrimination of auditory pitch or tactile intensity). Results showed that after fast explicit training of interval discrimination (about 15 min), participants improved their ability to categorize the visual apparent motion in Ternus displays, although the training benefits were mild for visual timing training. However, the benefits were absent for implicit interval training protocols. This finding suggests that the timing ability in one modality can be rapidly acquired and used to improve timing-related performance in another modality and that there may exist a central clock for sub-second temporal processing, although modality-specific perceptual properties may constrain the functioning of this clock.
Fast Plasma Instrument for MMS: Simulation Results
NASA Technical Reports Server (NTRS)
Figueroa-Vinas, Adolfo; Adrian, Mark L.; Lobell, James V.; Simpson, David G.; Barrie, Alex; Winkert, George E.; Yeh, Pen-Shu; Moore, Thomas E.
2008-01-01
Magnetospheric Multiscale (MMS) mission will study small-scale reconnection structures and their rapid motions from closely spaced platforms using instruments capable of high angular, energy, and time resolution measurements. The Dual Electron Spectrometer (DES) of the Fast Plasma Instrument (FPI) for MMS meets these demanding requirements by acquiring the electron velocity distribution functions (VDFs) for the full sky with high-resolution angular measurements every 30 ms. This will provide unprecedented access to electron scale dynamics within the reconnection diffusion region. The DES consists of eight half-top-hat energy analyzers. Each analyzer has a 6 deg. x 11.25 deg. Full-sky coverage is achieved by electrostatically stepping the FOV of each of the eight sensors through four discrete deflection look directions. Data compression and burst memory management will provide approximately 30 minutes of high time resolution data during each orbit of the four MMS spacecraft. Each spacecraft will intelligently downlink the data sequences that contain the greatest amount of temporal structure. Here we present the results of a simulation of the DES analyzer measurements, data compression and decompression, as well as ground-based analysis using as a seed re-processed Cluster/PEACE electron measurements. The Cluster/PEACE electron measurements have been reprocessed through virtual DES analyzers with their proper geometrical, energy, and timing scale factors and re-mapped via interpolation to the DES angular and energy phase-space sampling measurements. The results of the simulated DES measurements are analyzed and the full moments of the simulated VDFs are compared with those obtained from the Cluster/PEACE spectrometer using a standard quadrature moment, a newly implemented spectral spherical harmonic method, and a singular value decomposition method. Our preliminary moment calculations show a remarkable agreement within the uncertainties of the measurements, with the
Fast probabilistic file fingerprinting for big data.
Tretyakov, Konstantin; Laur, Sven; Smant, Geert; Vilo, Jaak; Prins, Pjotr
2013-01-01
Biological data acquisition is raising new challenges, both in data analysis and handling. Not only is it proving hard to analyze the data at the rate it is generated today, but simply reading and transferring data files can be prohibitively slow due to their size. This primarily concerns logistics within and between data centers, but is also important for workstation users in the analysis phase. Common usage patterns, such as comparing and transferring files, are proving computationally expensive and are tying down shared resources. We present an efficient method for calculating file uniqueness for large scientific data files, that takes less computational effort than existing techniques. This method, called Probabilistic Fast File Fingerprinting (PFFF), exploits the variation present in biological data and computes file fingerprints by sampling randomly from the file instead of reading it in full. Consequently, it has a flat performance characteristic, correlated with data variation rather than file size. We demonstrate that probabilistic fingerprinting can be as reliable as existing hashing techniques, with provably negligible risk of collisions. We measure the performance of the algorithm on a number of data storage and access technologies, identifying its strengths as well as limitations. Probabilistic fingerprinting may significantly reduce the use of computational resources when comparing very large files. Utilisation of probabilistic fingerprinting techniques can increase the speed of common file-related workflows, both in the data center and for workbench analysis. The implementation of the algorithm is available as an open-source tool named pfff, as a command-line tool as well as a C library. The tool can be downloaded from http://biit.cs.ut.ee/pfff.
Fast Translation Invariant Multiscale Image Denoising.
Li, Meng; Ghosal, Subhashis
2015-12-01
Translation invariant (TI) cycle spinning is an effective method for removing artifacts from images. However, for a method using O(n) time, the exact TI cycle spinning by averaging all possible circulant shifts requires O(n(2)) time where n is the number of pixels, and therefore is not feasible in practice. Existing literature has investigated efficient algorithms to calculate TI version of some denoising approaches such as Haar wavelet. Multiscale methods, especially those based on likelihood decomposition, such as penalized likelihood estimator and Bayesian methods, have become popular in image processing because of their effectiveness in denoising images. As far as we know, there is no systematic investigation of the TI calculation corresponding to general multiscale approaches. In this paper, we propose a fast TI (FTI) algorithm and a more general k-TI (k-TI) algorithm allowing TI for the last k scales of the image, which are applicable to general d-dimensional images (d = 2, 3, …) with either Gaussian or Poisson noise. The proposed FTI leads to the exact TI estimation but only requires O(n log2 n) time. The proposed k-TI can achieve almost the same performance as the exact TI estimation, but requires even less time. We achieve this by exploiting the regularity present in the multiscale structure, which is justified theoretically. The proposed FTI and k-TI are generic in that they are applicable on any smoothing techniques based on the multiscale structure. We demonstrate the FTI and k-TI algorithms on some recently proposed state-of-the-art methods for both Poisson and Gaussian noised images. Both simulations and real data application confirm the appealing performance of the proposed algorithms. MATLAB toolboxes are online accessible to reproduce the results and be implemented for general multiscale denoising approaches provided by the users.
Fast Plasma Instrument for MMS: Simulation Results
NASA Technical Reports Server (NTRS)
Figueroa-Vinas, Adolfo; Adrian, Mark L.; Lobell, James V.; Simpson, David G.; Barrie, Alex; Winkert, George E.; Yeh, Pen-Shu; Moore, Thomas E.
2008-01-01
Magnetospheric Multiscale (MMS) mission will study small-scale reconnection structures and their rapid motions from closely spaced platforms using instruments capable of high angular, energy, and time resolution measurements. The Dual Electron Spectrometer (DES) of the Fast Plasma Instrument (FPI) for MMS meets these demanding requirements by acquiring the electron velocity distribution functions (VDFs) for the full sky with high-resolution angular measurements every 30 ms. This will provide unprecedented access to electron scale dynamics within the reconnection diffusion region. The DES consists of eight half-top-hat energy analyzers. Each analyzer has a 6 deg. x 11.25 deg. Full-sky coverage is achieved by electrostatically stepping the FOV of each of the eight sensors through four discrete deflection look directions. Data compression and burst memory management will provide approximately 30 minutes of high time resolution data during each orbit of the four MMS spacecraft. Each spacecraft will intelligently downlink the data sequences that contain the greatest amount of temporal structure. Here we present the results of a simulation of the DES analyzer measurements, data compression and decompression, as well as ground-based analysis using as a seed re-processed Cluster/PEACE electron measurements. The Cluster/PEACE electron measurements have been reprocessed through virtual DES analyzers with their proper geometrical, energy, and timing scale factors and re-mapped via interpolation to the DES angular and energy phase-space sampling measurements. The results of the simulated DES measurements are analyzed and the full moments of the simulated VDFs are compared with those obtained from the Cluster/PEACE spectrometer using a standard quadrature moment, a newly implemented spectral spherical harmonic method, and a singular value decomposition method. Our preliminary moment calculations show a remarkable agreement within the uncertainties of the measurements, with the
mrsFAST-Ultra: a compact, SNP-aware mapper for high performance sequencing applications.
Hach, Faraz; Sarrafi, Iman; Hormozdiari, Farhad; Alkan, Can; Eichler, Evan E; Sahinalp, S Cenk
2014-07-01
High throughput sequencing (HTS) platforms generate unprecedented amounts of data that introduce challenges for processing and downstream analysis. While tools that report the 'best' mapping location of each read provide a fast way to process HTS data, they are not suitable for many types of downstream analysis such as structural variation detection, where it is important to report multiple mapping loci for each read. For this purpose we introduce mrsFAST-Ultra, a fast, cache oblivious, SNP-aware aligner that can handle the multi-mapping of HTS reads very efficiently. mrsFAST-Ultra improves mrsFAST, our first cache oblivious read aligner capable of handling multi-mapping reads, through new and compact index structures that reduce not only the overall memory usage but also the number of CPU operations per alignment. In fact the size of the index generated by mrsFAST-Ultra is 10 times smaller than that of mrsFAST. As importantly, mrsFAST-Ultra introduces new features such as being able to (i) obtain the best mapping loci for each read, and (ii) return all reads that have at most n mapping loci (within an error threshold), together with these loci, for any user specified n. Furthermore, mrsFAST-Ultra is SNP-aware, i.e. it can map reads to reference genome while discounting the mismatches that occur at common SNP locations provided by db-SNP; this significantly increases the number of reads that can be mapped to the reference genome. Notice that all of the above features are implemented within the index structure and are not simple post-processing steps and thus are performed highly efficiently. Finally, mrsFAST-Ultra utilizes multiple available cores and processors and can be tuned for various memory settings. Our results show that mrsFAST-Ultra is roughly five times faster than its predecessor mrsFAST. In comparison to newly enhanced popular tools such as Bowtie2, it is more sensitive (it can report 10 times or more mappings per read) and much faster (six times or
A small and fast piezo-actuated legged robot
NASA Astrophysics Data System (ADS)
Yumaryanto, Abdul A.; An, Jaebum; Lee, Sangyoon
2007-04-01
In this paper we present the development of a small and fast LIPCA-actuated mobile robot. LIPCA (Lightweight Piezoceramic Composite curved Actuator) is a piezo-composite actuator that uses a PZT layer sandwiched between composite materials of carbon/epoxy and glass/epoxy layers to amplify the displacement. Three versions of LIPCA robots have been developed thus far to implement a small and autonomous robot. The design of the first prototype was inspired by a six-legged insect like a cockroach. Its maximum speed is 173 mm/sec with the voltage input of 400 Vpp at 40 Hz frequency. As the result of a slight modification in the design, a faster LIPCA robot was developed. However their structures are not strong enough to carry a load heavier than 20 gram, which can be a major obstacle to implementing autonomous robots. By several changes in the mechanism, the LIPCA-actuated robot has been improved such that it is able to carry a weight as much as 60 gram. For all the prototypes we used two LIPCA strips that are placed oppositely in the middle of the robot body. The LIPCA strips are driven by a square signal function of high AC voltage with the phase difference of 180°. All the experimental results show a possibility of a small and fast walking robot actuated by LIPCA without using any conventional electromagnetic actuator.
X-33 Environmental Impact Statement: A Fast Track Approach
NASA Technical Reports Server (NTRS)
McCaleb, Rebecca C.; Holland, Donna L.
1998-01-01
NASA is required by the National Environmental Policy Act (NEPA) to prepare an appropriate level environmental analysis for its major projects. Development of the X-33 Technology Demonstrator and its associated flight test program required an environmental impact statement (EIS) under the NEPA. The EIS process is consists of four parts: the "Notice of Intent" to prepare an EIS and scoping; the draft EIS which is distributed for review and comment; the final ETS; and the "Record of Decision." Completion of this process normally takes from 2 - 3 years, depending on the complexity of the proposed action. Many of the agency's newest fast track, technology demonstration programs require NEPA documentation, but cannot sustain the lengthy time requirement between program concept development to implementation. Marshall Space Flight Center, in cooperation with Kennedy Space Center, accomplished the NEPA process for the X-33 Program in 13 months from Notice of Intent to Record of Decision. In addition, the environmental team implemented an extensive public involvement process, conducting a total of 23 public meetings for scoping and draft EIS comment along with numerous informal meetings with public officials, civic organizations, and Native American Indians. This paper will discuss the fast track approach used to successfully accomplish the NEPA process for X-33 on time.
Fast animation of lightning using an adaptive mesh.
Kim, Theodore; Lin, Ming C
2007-01-01
We present a fast method for simulating, animating, and rendering lightning using adaptive grids. The "dielectric breakdown model" is an elegant algorithm for electrical pattern formation that we extend to enable animation of lightning. The simulation can be slow, particularly in 3D, because it involves solving a large Poisson problem. Losasso et al. recently proposed an octree data structure for simulating water and smoke, and we show that this discretization can be applied to the problem of lightning simulation as well. However, implementing the incomplete Cholesky conjugate gradient (ICCG) solver for this problem can be daunting, so we provide an extensive discussion of implementation issues. ICCG solvers can usually be accelerated using "Eisenstat's trick," but the trick cannot be directly applied to the adaptive case. Fortunately, we show that an "almost incomplete Cholesky" factorization can be computed so that Eisenstat's trick can still be used. We then present a fast rendering method based on convolution that is competitive with Monte Carlo ray tracing but orders of magnitude faster, and we also show how to further improve the visual results using jittering.
Fast convolution-superposition dose calculation on graphics hardware.
Hissoiny, Sami; Ozell, Benoît; Després, Philippe
2009-06-01
The numerical calculation of dose is central to treatment planning in radiation therapy and is at the core of optimization strategies for modern delivery techniques. In a clinical environment, dose calculation algorithms are required to be accurate and fast. The accuracy is typically achieved through the integration of patient-specific data and extensive beam modeling, which generally results in slower algorithms. In order to alleviate execution speed problems, the authors have implemented a modern dose calculation algorithm on a massively parallel hardware architecture. More specifically, they have implemented a convolution-superposition photon beam dose calculation algorithm on a commodity graphics processing unit (GPU). They have investigated a simple porting scenario as well as slightly more complex GPU optimization strategies. They have achieved speed improvement factors ranging from 10 to 20 times with GPU implementations compared to central processing unit (CPU) implementations, with higher values corresponding to larger kernel and calculation grid sizes. In all cases, they preserved the numerical accuracy of the GPU calculations with respect to the CPU calculations. These results show that streaming architectures such as GPUs can significantly accelerate dose calculation algorithms and let envision benefits for numerically intensive processes such as optimizing strategies, in particular, for complex delivery techniques such as IMRT and are therapy.
Quantum Bayesian implementation
NASA Astrophysics Data System (ADS)
Wu, Haoyang
2013-02-01
Mechanism design is a reverse problem of game theory. Nash implementation and Bayesian implementation are two important parts of mechanism design theory. The former one corresponds to a setting with complete information, whereas the latter one corresponds to a setting with incomplete information. A recent work Wu (Int J Quantum Inf 9:615-623, 2011) shows that when an additional condition is satisfied, the traditional sufficient conditions for Nash implementation will fail in a quantum domain. Inspired by this work, in this paper we will propose that the traditional sufficient conditions for Bayesian implementation will also fail if agents use quantum strategies to send messages to the designer through channels (e.g., Internet, cable etc) and two additional conditions are satisfied.
Vehicle Technologies Program Implementation
none,
2009-06-19
The Vehicle Technologies Program takes a systematic approach to Program implementation. Elements of this approach include the evaluation of new technologies, competitive selection of projects and partners, review of Program and project improvement, project tracking, and portfolio management and adjustment.
Ozone Implementation Regulatory Actions
Training courses, presentations, and other resources to help state and local air professionals learn more about NAAQS implementation, air pollution control and emissions reduction, SIP development, and public participation.
Microprocessor implementation of an FFT for ionospheric VLF observations
NASA Technical Reports Server (NTRS)
Elvidge, J.; Kintner, P.; Holzworth, R.
1984-01-01
A fast Fourier transform algorithm is implemented on a CMOS microprocessor for application to very low-frequency electric fields (less than 10 kHz) sensed on high-altitude scientific balloons. Two FFT's are calculated simultaneously by associating them with conjugate symmetric and conjugate antisymmetric results. One goal of the system was to detect spectral signatures associated with fast time variations present in natural signals such as whistlers and chorus. Although a full evaluation of the system was not possible for operational reasons, a measure of the system's success has been defined and evaluated.
Massively Parallel Processing for Fast and Accurate Stamping Simulations
NASA Astrophysics Data System (ADS)
Gress, Jeffrey J.; Xu, Siguang; Joshi, Ramesh; Wang, Chuan-tao; Paul, Sabu
2005-08-01
The competitive automotive market drives automotive manufacturers to speed up the vehicle development cycles and reduce the lead-time. Fast tooling development is one of the key areas to support fast and short vehicle development programs (VDP). In the past ten years, the stamping simulation has become the most effective validation tool in predicting and resolving all potential formability and quality problems before the dies are physically made. The stamping simulation and formability analysis has become an critical business segment in GM math-based die engineering process. As the simulation becomes as one of the major production tools in engineering factory, the simulation speed and accuracy are the two of the most important measures for stamping simulation technology. The speed and time-in-system of forming analysis becomes an even more critical to support the fast VDP and tooling readiness. Since 1997, General Motors Die Center has been working jointly with our software vendor to develop and implement a parallel version of simulation software for mass production analysis applications. By 2001, this technology was matured in the form of distributed memory processing (DMP) of draw die simulations in a networked distributed memory computing environment. In 2004, this technology was refined to massively parallel processing (MPP) and extended to line die forming analysis (draw, trim, flange, and associated spring-back) running on a dedicated computing environment. The evolution of this technology and the insight gained through the implementation of DM0P/MPP technology as well as performance benchmarks are discussed in this publication.
Wishart Deep Stacking Network for Fast POLSAR Image Classification.
Jiao, Licheng; Liu, Fang
2016-05-11
Inspired by the popular deep learning architecture - Deep Stacking Network (DSN), a specific deep model for polarimetric synthetic aperture radar (POLSAR) image classification is proposed in this paper, which is named as Wishart Deep Stacking Network (W-DSN). First of all, a fast implementation of Wishart distance is achieved by a special linear transformation, which speeds up the classification of POLSAR image and makes it possible to use this polarimetric information in the following Neural Network (NN). Then a single-hidden-layer neural network based on the fast Wishart distance is defined for POLSAR image classification, which is named as Wishart Network (WN) and improves the classification accuracy. Finally, a multi-layer neural network is formed by stacking WNs, which is in fact the proposed deep learning architecture W-DSN for POLSAR image classification and improves the classification accuracy further. In addition, the structure of WN can be expanded in a straightforward way by adding hidden units if necessary, as well as the structure of the W-DSN. As a preliminary exploration on formulating specific deep learning architecture for POLSAR image classification, the proposed methods may establish a simple but clever connection between POLSAR image interpretation and deep learning. The experiment results tested on real POLSAR image show that the fast implementation of Wishart distance is very efficient (a POLSAR image with 768000 pixels can be classified in 0.53s), and both the single-hidden-layer architecture WN and the deep learning architecture W-DSN for POLSAR image classification perform well and work efficiently.
Wishart Deep Stacking Network for Fast POLSAR Image Classification.
Jiao, Licheng; Liu, Fang
2016-05-11
Inspired by the popular deep learning architecture - Deep Stacking Network (DSN), a specific deep model for polarimetric synthetic aperture radar (POLSAR) image classification is proposed in this paper, which is named as Wishart Deep Stacking Network (W-DSN). First of all, a fast implementation of Wishart distance is achieved by a special linear transformation, which speeds up the classification of POLSAR image and makes it possible to use this polarimetric information in the following Neural Network (NN). Then a single-hidden-layer neural network based on the fast Wishart distance is defined for POLSAR image classification, which is named as Wishart Network (WN) and improves the classification accuracy. Finally, a multi-layer neural network is formed by stacking WNs, which is in fact the proposed deep learning architecture W-DSN for POLSAR image classification and improves the classification accuracy further. In addition, the structure of WN can be expanded in a straightforward way by adding hidden units if necessary, as well as the structure of the W-DSN. As a preliminary exploration on formulating specific deep learning architecture for POLSAR image classification, the proposed methods may establish a simple but clever connection between POLSAR image interpretation and deep learning. The experiment results tested on real POLSAR image show that the fast implementation of Wishart distance is very efficient (a POLSAR image with 768000 pixels can be classified in 0.53s), and both the single-hidden-layer architecture WN and the deep learning architecture W-DSN for POLSAR image classification perform well and work efficiently.
ELN implementation challenges.
Drake, David J
2007-08-01
Electronic Laboratory Notebooks are becoming foundation platforms within many pharmaceutical companies because of the benefits that they offer to both the business and the scientists alike. Implementing an ELN within an established organisation presents challenges for the project team, both in terms of managing the impact on the scientists and the technical requirements for integration and data management. Implementation of a commercial ELN is not exempt from such challenges, and working with a third party supplier offers both advantages and additional challenges.
Secret Key Crypto Implementations
NASA Astrophysics Data System (ADS)
Bertoni, Guido Marco; Melzani, Filippo
This chapter presents the algorithm selected in 2001 as the Advanced Encryption Standard. This algorithm is the base for implementing security and privacy based on symmetric key solutions in almost all new applications. Secret key algorithms are used in combination with modes of operation to provide different security properties. The most used modes of operation are presented in this chapter. Finally an overview of the different techniques of software and hardware implementations is given.
Implementing spiritual care interventions.
Ílvia Caldeira, S; Timmins, Fiona
2017-04-19
This article, the third and final in a series of three, discusses the implementation of spiritual care interventions by nurses. It describes how nurses can use clinical reasoning and the nursing process to implement appropriate spiritual care for patients, and outlines the competencies necessary to identify spiritual distress and meet the spiritual needs of patients. Spiritual care interventions are discussed as part of a multidisciplinary team approach to the provision of holistic care.
Experimental and numerical investigation of the Fast-SAGD process
NASA Astrophysics Data System (ADS)
Shin, Hyundon
The SAGD process has been tested in the field, and is now in a commercial stage in Western Canadian oil sands areas. The Fast-SAGD method can partly solve the drilling difficulty and reduce costs in a SAGD operation requiring paired parallel wells one above the other. This method also enhances the thermal efficiency in the reservoir. In this research, the reservoir parameters and operating conditions for the SAGD and Fast-SAGD processes are investigated by numerical simulation in the three Alberta oil sands areas. Scaled physical model experiments, which are operated by an automated process control system, are conducted under high temperature and high pressure conditions. The results of the study indicate that the shallow Athabasca-type reservoir, which is thick with high permeability (high kxh), is a good candidate for SAGD application, whereas Cold Lake- and Peace River-type reservoirs, which are thin with low permeability, are not as good candidates for conventional SAGD implementation. The simulation results indicate improved energy efficiency and productivity in most cases for the Fast-SAGD process; in those cases, the project economics were enhanced compared to the SAGD process. Both Cold Lake- and Peace River-type reservoirs are good candidates for a Fast-SAGD application rather than a conventional SAGD application. This new process demonstrates improved efficiency and lower costs for extracting heavy oil from these important reservoirs. A new economic indicator, called simple thermal efficiency parameter (STEP), was developed and validated to evaluate the performance of a SAGD project. STEP is based on cumulative steam-oil ratio (CSOR), calendar day oil rate (CDOR) and recovery factor (RF) for the time prior to the steam-oil ratio (SOR) attaining 4. STEP can be used as a financial metric quantitatively as well as qualitatively for this type of thermal project. An automated process control system was set-up and validated, and has the capability of
Multitasking domain decomposition fast Poisson solvers on the Cray Y-MP
NASA Technical Reports Server (NTRS)
Chan, Tony F.; Fatoohi, Rod A.
1990-01-01
The results of multitasking implementation of a domain decomposition fast Poisson solver on eight processors of the Cray Y-MP are presented. The object of this research is to study the performance of domain decomposition methods on a Cray supercomputer and to analyze the performance of different multitasking techniques using highly parallel algorithms. Two implementations of multitasking are considered: macrotasking (parallelism at the subroutine level) and microtasking (parallelism at the do-loop level). A conventional FFT-based fast Poisson solver is also multitasked. The results of different implementations are compared and analyzed. A speedup of over 7.4 on the Cray Y-MP running in a dedicated environment is achieved for all cases.
Multitasking domain decomposition fast Poisson solvers on the Cray Y-MP
NASA Technical Reports Server (NTRS)
Chan, Tony F.; Fatoohi, Rod A.
1990-01-01
The results of multitasking implementation of a domain decomposition fast Poisson solver on eight processors of the Cray Y-MP are presented. The object of this research is to study the performance of domain decomposition methods on a Cray supercomputer and to analyze the performance of different multitasking techniques using highly parallel algorithms. Two implementations of multitasking are considered: macrotasking (parallelism at the subroutine level) and microtasking (parallelism at the do-loop level). A conventional FFT-based fast Poisson solver is also multitasked. The results of different implementations are compared and analyzed. A speedup of over 7.4 on the Cray Y-MP running in a dedicated environment is achieved for all cases.
Impulsively generated fast coronal pulsations
NASA Technical Reports Server (NTRS)
Edwin, P. M.; Roberts, B.
1986-01-01
Rapid oscillations in the corona are discussed from a theoretical standpoint, developing some previous work on ducted, fast magnetoacoustic waves in an inhomogeneous medium. In the theory, impulsively (e.g., flare) generated mhd (magnetohydrodynamic) waves are ducted by regions of low Alfven speed (high density) such as coronal loops. Wave propagation in such ducts is strongly dispersive and closely akin to the behavior of Love waves in seismology, Pekeris waves in oceanography and guided waves in fiber optics. Such flare-generated magnetoacoustic waves possess distinctive temporal signatures consisting of periodic, quasi-periodic and decay phases. The quasi-periodic phase possesses the strongest amplitudes and the shortest time scales. Time scales are typically of the order of a second for inhomogeneities (coronal loop width) of 1000 km and Alfven speeds of 1000/kms, and pulse duration times are of tens of seconds. Quasi-periodic signatures have been observed in radio wavelengths for over a decade and more recently by SMM. It is hoped that the theoretical ideas outlined may be successfully related to these observations and thus aid the interpretation of oscillatory signatures recorded by SMM. Such signatures may also provide a diagnostic of coronal conditions. New aspects of the ducted mhd waves, for example their behavior in smoothly varying as opposed to tube-like inhomogeneities, are currently under investigation. The theory is not restricted to loops but applied equally to open field regions.