Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,387 records · Page 77

Morphological Analysis of Zirconium Nuclear Fuel Retaining Rods Braided with SiC: Quality Assurance and Defect Identification

In the after-Fukushima world, the stability of materials under extreme conditions is an important issue for the safety of nuclear reactors. Among the methods explored currently to improve zircaloys’ thermal stability in off-normal conditions, using a protective coat of the SiC filaments is considered because silicon carbide is well known for its remarkable chemical inertness at high temperatures. A typical SiC fiber contains ~50,000 individual filaments of 5 – 10 µm in diameter. In this paper, an effort was made to develop and apply mathematical morphology to the process of automatic defect identification in Zircaloy-4 rods braided with the protective layer of the silicon carbide filament. However, the issues of the braiding quality have to be addressed to ensure its full protective potential. We present the original mathematical morphology algorithms that allow solving this problem of quality assurance successfully. In nuclear industry, such algorithms are used for the first time, and could be easily generalized to the case of automated continuous monitoring for defect identification in the future.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Machine learning for disruption warnings on Alcator C-Mod, DIII-D, and EAST

In this paper, we report on disruption prediction using a shallow machinelearning method known as Random Forests, trained on large databases containingonly plasma parameters that are available in real-time on Alcator C-Mod, DIII-D, and EAST. The database for each tokamak contains parameters sampled ~10 6 times throughout ~10 4 discharges (disruptive and non-disruptive) over the last 4years of operation. It is found that a number of parameters (e.g.P rad /P input ,l i ,n/n G ,B n=1 /B 0 ) exhibit changes in aggregate as a disruption is approached on one ormore of these tokamaks. However, for each machine, the most useful parameters,as well as the details of their precursor behaviors, are markedly different. When the prediction problem is framed using a binary classification scheme to discriminate between time slices "close to disruption" and "far from disruption," it is found that the prediction algorithms differ substantially in performance among the three machines ona time slice-by-time slice basis, but have similar disruption detection rates (~80-90%) on a shot-by-shot basis after appropriate optimisation. This could have important implications for disruption prediction and avoidance on ITER, for which developmentof a training database of disruptions may be infeasible. The algorithm's output is interpretable using a method that identifies the most strongly contributing inputsignals, which may have implications for avoiding disruptive scenarios. Lastly, to further support its real-time capability, successful applications in inter-shot and real-time environments on EAST and DIII-D are also discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

SU-E-U-02: The Development of a Practical Ultrasonic System for Cross-Sectional Imaging of Small Animals

Purpose: To test the feasibility of developing a practical medium frequency ultrasound tomography method for small animal imaging. The ability to produce cross-sectional or full body images of a live small animal using a low-cost tabletop ultrasound scanner without any special license would be very beneficial to long term biological studies, where repeated scanning is often required over an extended period of time. Methods: The cross sectional images were produced by compounding multiple B-scans of a laboratory phantom or an animal acquired at different projection angles. Two imaging systems were used to test the concept. The first system included a programmable 64-channel phased array controller driving a 128-channel, 5–10 MHz linear probe to produce 143 B-Mode projections of the spinning object. The second system designed and manufactured in house, produced 64 or 128 B-Mode projections with a single unfocused 8 MHz transducer scanning with a 0.116 mm step size. Results: The phased array system provided good penetration through the phantoms/mice (with the exception of the lungs) and allowed to acquire data in a very short time. The cross-sectional images have enough resolution and dynamic range to detect both high- and low-contrast organs. The single transducer system takes longer to scan, and the data require more sophisticated processing. To date, our images allow seeing details as small as 1–2 mm in the phantoms and in small animals, with the contrast mostly due to highly reflecting bones and air inclusions. Conclusion: The work indicates that very detailed and anatomically correct images can be created by relatively simple and inexpensive means. With more advanced algorithms and improved system design, scan time can be reduced considerably, enabling high-resolution full 3D imaging. This will allow for quick and easy scans that can help monitor tumor growth and/or regression without contributing any dose to the animal. The authors would like to acknowledge the financial and engineering support from Tessonics.

60 APPLIED LIFE SCIENCES↗

An accelerated threshold-based back-projection algorithm for Compton camera image reconstruction

Purpose: Compton camera imaging (CCI) systems are currently under investigation for radiotherapy dose reconstruction and verification. The ability of such a system to provide real-time images during dose delivery will be limited by the computational speed of the image reconstruction algorithm. In this work, the authors present a fast and simple method by which to generate an initial back-projected image from acquired CCI data, suitable for use in a filtered back-projection algorithm or as a starting point for iterative reconstruction algorithms, and compare its performance to the current state of the art. Methods: Each detector event in a CCI system describes a conical surface that includes the true point of origin of the detected photon. Numerical image reconstruction algorithms require, as a first step, the back-projection of each of these conical surfaces into an image space. The algorithm presented here first generates a solution matrix for each slice of the image space by solving the intersection of the conical surface with the image plane. Each element of the solution matrix is proportional to the distance of the corresponding voxel from the true intersection curve. A threshold function was developed to extract those pixels sufficiently close to the true intersection to generate a binary intersection curve. This process is repeated for each image plane for each CCI detector event, resulting in a three-dimensional back-projection image. The performance of this algorithm was tested against a marching algorithm known for speed and accuracy. Results: The threshold-based algorithm was found to be approximately four times faster than the current state of the art with minimal deficit to image quality, arising from the fact that a generically applicable threshold function cannot provide perfect results in all situations. The algorithm fails to extract a complete intersection curve in image slices near the detector surface for detector event cones having axes nearly parallel to the image plane. This effect decreases the sum of the image, thereby also affecting the mean, standard deviation, and SNR of the image. All back-projected events associated with a simulated point source intersected the voxel containing the source and the FWHM of the back-projected image was similar to that obtained from the marching method. Conclusions: The slight deficit to image quality observed with the threshold-based back-projection algorithm described here is outweighed by the 75% reduction in computation time. The implementation of this method requires the development of an optimum threshold function, which determines the overall accuracy of the method. This makes the algorithm well-suited to applications involving the reconstruction of many large images, where the time invested in threshold development is offset by the decreased image reconstruction time. Implemented in a parallel-computing environment, the threshold-based algorithm has the potential to provide real-time dose verification for radiation therapy.

60 APPLIED LIFE SCIENCES↗

Internal respiratory surrogate in multislice 4D CT using a combination of Fourier transform and anatomical features

Purpose: The purpose of this study was to develop a novel algorithm to create a robust internal respiratory signal (IRS) for retrospective sorting of four-dimensional (4D) computed tomography (CT) images. Methods: The proposed algorithm combines information from the Fourier transform of the CT images and from internal anatomical features to form the IRS. The algorithm first extracts potential respiratory signals from low-frequency components in the Fourier space and selected anatomical features in the image space. A clustering algorithm then constructs groups of potential respiratory signals with similar temporal oscillation patterns. The clustered group with the largest number of similar signals is chosen to form the final IRS. To evaluate the performance of the proposed algorithm, the IRS was computed and compared with the external respiratory signal from the real-time position management (RPM) system on 80 patients. Results: In 72 (90%) of the 4D CT data sets tested, the IRS computed by the authors’ proposed algorithm matched with the RPM signal based on their normalized cross correlation. For these data sets with matching respiratory signals, the average difference between the end inspiration times (Δt{sub ins}) in the IRS and RPM signal was 0.11 s, and only 2.1% of Δt{sub ins} were more than 0.5 s apart. In the eight (10%) 4D CT data sets in which the IRS and the RPM signal did not match, the average Δt{sub ins} was 0.73 s in the nonmatching couch positions, and 35.4% of them had a Δt{sub ins} greater than 0.5 s. At couch positions in which IRS did not match the RPM signal, a correlation-based metric indicated poorer matching of neighboring couch positions in the RPM-sorted images. This implied that, when IRS did not match the RPM signal, the images sorted using the IRS showed fewer artifacts than the clinical images sorted using the RPM signal. Conclusions: The authors’ proposed algorithm can generate robust IRSs that can be used for retrospective sorting of 4D CT data. The algorithm is completely automatic and requires very little processing time. The algorithm is cost efficient and can be easily adopted for everyday clinical use.

60 APPLIED LIFE SCIENCES↗

Finite difference numerical method for the superlattice Boltzmann transport equation and case comparison of CPU(C) and GPU(CUDA) implementations

We present a finite difference numerical algorithm for solving two dimensional spatially homogeneous Boltzmann transport equation which describes electron transport in a semiconductor superlattice subject to crossed time dependent electric and constant magnetic fields. The algorithm is implemented both in C language targeted to CPU and in CUDA C language targeted to commodity NVidia GPU. We compare performances and merits of one implementation versus another and discuss various software optimisation techniques.

97 MATHEMATICS AND COMPUTING↗

A novel vibration-based fault diagnostic algorithm for gearboxes under speed fluctuations without rotational speed measurement

The localized failures of gears introduce cyclic-transient impulses in the measured gearbox vibration signals. These impulses are usually identified from the sidebands around gear-mesh harmonics through the spectral analysis of cyclo-stationary signals. However, in practice, several high-powered applications of gearboxes like wind turbines are intrinsically characterized by nonstationary processes that blur the measured vibration spectra of a gearbox and deteriorate the efficacy of spectral diagnostic methods. Although order-tracking techniques have been proposed to improve the performance of spectral diagnosis for nonstationary signals measured in such applications, the required hardware for the measurement of rotational speed of these machines is often unavailable in industrial settings. Moreover, existing tacho-less order-tracking approaches are usually limited by the high time-frequency resolution requirement, which is a prerequisite for the precise estimation of the instantaneous frequency. To address such issues, a novel fault-signature enhancement algorithm is proposed that can alleviate the spectral smearing without the need of rotational speed measurement. This proposed tacho-less diagnostic technique resamples the measured acceleration signal of the gearbox based on the optimal warping path evaluated from the fast dynamic time-warping algorithm, which aligns a filtered shaft rotational harmonic signal with respect to a reference signal assuming a constant shaft rotational speed estimated from the approximation of operational speed. The effectiveness of this method is validated using both simulated signals from a fixed-axis gear pair under nonstationary conditions and experimental measurements from a 750-kW planetary wind turbine gearbox on a dynamometer test rig. Lastly, the results demonstrate that the proposed algorithm can identify fault information from typical gearbox vibration measurements carried out in a resource-constrained industrial environment.

17 WIND ENERGY↗

Synthesis of single-qutrit circuits from Clifford+𝑅 gates

Here, we present two deterministic compilation algorithms for single-qutrit unitaries with O ( log 1 / ɛ ) gate depth. Each algorithm selects a nearby approximation to the target unitary and then exactly synthesizes the approximation over the Clifford + R basis. The first algorithm exhaustively searches over the group; while the second algorithm searches only for Householder reflections. The exhaustive search algorithm yields an average R count of 2.193 ( 11 ) + 8.621 ( 7 ) log 10 ( 1 / ɛ ) , albeit with a time complexity of O ( ɛ − 4.4 ) . The Householder search algorithm results in a larger average R count of 3.20 ( 13 ) + 10.77 ( 3 ) log 10 ( 1 / ɛ ) at a reduced time complexity of O ( ɛ − 0.42 ) , greatly extending the reach in ɛ . These costs correspond asymptotically to 35% and 69% more non-Clifford gates compared with synthesizing the same unitary with two qubits. Such initial results are encouraging for using the R gate as the nontransversal gate for qutrit-based computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Recent Developments In Fast Neutron Detection And Multiplicity Counting With Verification With Liquid Scintillator

For many years at LLNL, we have been developing time-correlated neutron detection techniques and algorithms for applications such as Arms Control, Threat Detection and Nuclear Material Assay. Many of our techniques have been developed specifically for the relatively low efficiency (a few percent) attainable by detector systems limited to man-portability. Historically, we used thermal neutron detectors (mainly {sup 3}He), taking advantage of the high thermal neutron interaction cross-sections. More recently, we have been investigating the use of fast neutron detection with liquid scintillators, inorganic crystals, and in the near future, pulse-shape discriminating plastics which respond over 1000 times faster (nanoseconds versus tens of microseconds) than thermal neutron detectors. Fast neutron detection offers considerable advantages, since the inherent nanosecond production time-scales of spontaneous fission and neutron-induced fission are preserved and measured instead of being lost by thermalization required for thermal neutron detectors. We are now applying fast neutron technology to the safeguards regime in the form of fast portable digital electronics as well as faster and less hazardous scintillator formulations. Faster detector response times and sensitivity to neutron momentum show promise for measuring, differentiating, and assaying samples that have modest to very high count rates, as well as mixed fission sources like Cm and Pu. We report on measured results with our existing liquid scintillator array, and progress on the design of a nuclear material assay system that incorporates fast neutron detection, including the surprising result that fast liquid scintillator detectors become competitive and even surpass the precision of {sup 3}He-based counters measuring correlated pairs in modest (kg) samples of plutonium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A real-time machine learning-based disruption predictor in DIII-D

A disruption prediction algorithm, named DPRF (Disruption Prediction using Random Forests), has run in real-time in the DIII-D plasma control system (PCS) over more than 900 discharges. DPRF naturally provides a probability mapping associated to its predictions, i.e. the disruptivity signal, now incorporated in the DIII-D PCS. Here, we report on disruption prediction accomplishments in terms of shot-by-shot performances, by simulating alarms on each discharge as in the PCS framework. Due to the optimised performance metric chosen to evaluate DPRF, we find that almost all disruptive discharges are detected in average with few hundred of milliseconds of warning time, but this comes at a high cost of false alarms produced. Performances are not satisfying ITER requirements, where the success rate has to be higher than 95%, but this is not completely unexpected. DPRF is trained on many years of major disruptions occurring during the flattop phase of the plasma current on DIII-D, but without any differentiation by cause. Furthermore, we find that DPRF is affected by a relatively high fraction of false alarms occurring during the first 500 milliseconds from the flattop onset. This subtle effect, more evident on the discharges where DPRF ran in real-time, can be marginalized by taking specific precautions on the validity range of the predictions, and performances do improve. Even if presently burdened by some limitations, DPRF provides an incredible and novel advantage. Thanks to the feature contribution analysis (e.g., the identification of which signals contributed to triggering an alarm), it is possible to interpret and explain DPRF predictions. It is the first time that such interpretability features is exploited by a disruption predictor: by uncovering the disruption events' causes, a better understanding of disruption dynamics is achieved, and a clear path toward the design of disruption avoidance strategies can be provided.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Monte Carlo simulation methods in moment-based scale-bridging algorithms for thermal radiative-transfer problems

We present a moment-based acceleration algorithm applied to Monte Carlo simulation of thermal radiative-transfer problems. Our acceleration algorithm employs a continuum system of moments to accelerate convergence of stiff absorption–emission physics. The combination of energy-conserving tallies and the use of an asymptotic approximation in optically thick regions remedy the difficulties of local energy conservation and mitigation of statistical noise in such regions. We demonstrate the efficiency and accuracy of the developed method. We also compare directly to the standard linearization-based method of Fleck and Cummings [1]. A factor of 40 reduction in total computational time is achieved with the new algorithm for an equivalent (or more accurate) solution as compared with the Fleck–Cummings algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation

We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm that is both insensitive to the rapid changes of the time-dependent Hamiltonian and exhibits commutator scaling. Our method can be used for efficient Hamiltonian simulation in the interaction picture. In particular, we demonstrate that for the simulation of the Schrödinger equation, our method exhibits superconvergence and achieves a surprising second order convergence rate, of which the proof rests on a careful application of pseudo-differential calculus. Numerical results verify the effectiveness and the superconvergence property of our method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of a Annual Air Handling Unit Fault Dataset for FDD Tools: Lessons Learned and Considerations for FDD Developers

As energy management and information systems (e.g., automated fault detection and diagnostics [AFDD] tools) become more prevalent in the commercial building stock, it is important to determine the effectiveness of these technologies by benchmarking their performance. The authors have been working to develop the largest publicly available dataset of HVAC fault data for performance benchmarking applications, covering the most common HVAC systems and designs including chiller plants, rooftop packaged units, dual duct air handling units and single duct air handling units. This study covers the development, modeling, and validation of a synthetic fault dataset for a single duct air handling unit (AHU), one of the most common HVAC configurations found in the commercial building stock. Despite this being a common system, real-world time series data are scarce and usually do not span a wide range of weather conditions. Due to this limitation, a detailed AHU model was employed to carry out annual simulations of numerous common sensor and mechanical faults, which were then validated by comparing their effects on system performance to expected symptoms. We summarize the nature of each fault and their impacts under different weather and operation conditions. Finally, we highlight considerations for FDD developers that may want to use this dataset to assess their algorithms’ performance and their improvement over time.

Casillas, Armando↗

A Confidence-Guided Technique for Tracking Time-Varying Features

Application scientists often employ feature tracking algorithms to capture the temporal evolution of various features in their simulation data. However, as the complexity of the scientific features is increasing with the advanced simulation modeling techniques, quantification of reliability of the feature tracking algorithms is becoming important. One of the desired requirements for any robust feature tracking algorithm is to estimate its confidence during each tracking step so that the results obtained can be interpreted without any ambiguity. To address this, we develop a confidence-guided feature tracking algorithm that allows reliable tracking of user-selected features and presents the tracking dynamics using a graph-based visualization along with the spatial visualization of the tracked feature. Here, the efficacy of the proposed method is demonstrated by applying it to two scientific datasets containing different types of time-varying features.

97 MATHEMATICS AND COMPUTING↗

Seismology in the Cloud: A New Streaming Workflow

Data-intensive research in seismology is experiencing a recent boom, driven in part by large volumes of available data and advances in the growing field of data science. However, there are significant barriers to processing large data volumes, such as long retrieval times from data repositories, complex data management, and limited computational resources. New tools and platforms have reduced the barriers to entry for scientific cluster computing, including the maturation of the commercial cloud as an accessible instrument for research. Here, we build a customized research cluster in the cloud to test a new workflow for large-scale seismic analysis, in which data are processed as a stream (retrieved on-the-fly and acted upon without storing), with data from the Incorporated Research Institutions for Seismology Data Management Center. We use this workflow to deploy a spectral peak detection algorithm over 5.6 TB of compressed continuous seismic data from 2074 stations of the USArray Transportable Array EarthScope network. Using a 50-node cluster in the cloud, we completed the noise survey in 80 hr, with an average data throughput of 1.7 GB per minute. By varying cluster sizes, we find the scaling of our analysis to be sublinear, due to a combination of algorithmic limitations and data center response times. The cloud-based streaming workflow represents an order-of-magnitude increase in acquisition and processing speed compared to a traditional download-store-process workflow, and offers the additional benefits of employing a flexible, accessible, and widely used computing architecture. It is limited, however, due to its reliance on Internet transfer speeds and data center service capacity, and may not work well for repeated analyses or those for which even higher data throughputs are needed. These research applications will require a new class of cloud-native approaches in which both data and analysis are in the cloud.

58 GEOSCIENCES↗

Machine learning control for disruption and tearing mode avoidance

In this work, real-time feedback control based on machine learning algorithms (MLA) was successfully developed and tested on DIII-D plasmas to avoid tearing modes and disruptions while maximizing the plasma performance, which is measured by normalized plasma beta. Control uses MLAs that were trained with ensemble learning methods using only the data available to the real-time Plasma Control System (PCS) from several thousand DIII-D discharges. A `tearability' metric that quantifies the likelihood of the onset of 2/1 tearing modes (TM) in a given time window, and a 'disruptivity' metric that quantifies the likelihood of the onset of plasma disruptions were first tested o -line then implemented on the PCS. A real-time control system based on these MLAs was successfully tested on DIII-D discharges, using feedback algorithms to maximize β Ν while avoiding tearing modes and to dynamically adjust ramp down to avoid high-current disruptions in ramp down.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Software for precise tracking of cell proliferation

Highlights: Black-Right-Pointing-Pointer We developed software for analyzing cultured cells that divide as well as migrate. Black-Right-Pointing-Pointer The active contour model (Snakes) was used as the core algorithm. Black-Right-Pointing-Pointer The time backward analysis was also used for efficient detection of cell division. Black-Right-Pointing-Pointer With user-interactive correction functions, the software enables precise tracking. Black-Right-Pointing-Pointer The software was successfully applied to cells with fluorescently-labeled nuclei. -- Abstract: We have developed a multi-target cell tracking program TADOR, which we applied to a series of fluorescence images. TADOR is based on an active contour model that is modified in order to be free of the problem of locally optimal solutions, and thus is resistant to signal fluctuation and morphological changes. Due to adoption of backward tracing and addition of user-interactive correction functions, TADOR is used in an off-line and semi-automated mode, but enables precise tracking of cell division. By applying TADOR to the analysis of cultured cells whose nuclei had been fluorescently labeled, we tracked cell division and cell-cycle progression on coverslips over an extended period of time.

60 APPLIED LIFE SCIENCES↗