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,171 records · Page 65

Robust High-Throughput Phenotyping with Deep Segmentation Enabled by a Web-Based Annotator

The abilities of plant biologists and breeders to characterize the genetic basis of physiological traits are limited by their abilities to obtain quantitative data representing precise details of trait variation, and particularly to collect this data at a high-throughput scale with low cost. Although deep learning methods have demonstrated unprecedented potential to automate plant phenotyping, these methods commonly rely on large training sets that can be time-consuming to generate. Intelligent algorithms have therefore been proposed to enhance the productivity of these annotations and reduce human efforts. We propose a high-throughput phenotyping system which features a Graphical User Interface (GUI) and a novel interactive segmentation algorithm: Semantic-Guided Interactive Object Segmentation (SGIOS). By providing a user-friendly interface and intelligent assistance with annotation, this system offers potential to streamline and accelerate the generation of training sets, reducing the effort required by the user. Our evaluation shows that our proposed SGIOS model requires fewer user inputs compared to the state-of-art models for interactive segmentation. As a case study of the use of the GUI applied for genetic discovery in plants, we present an example of results from a preliminary genome-wide association study (GWAS) of in planta regeneration in Populus trichocarpa (poplar). We further demonstrate that the inclusion of a semantic prior map with SGIOS can accelerate the training process for future GWAS, using a sample of a dataset extracted from a poplar GWAS of in vitro regeneration. The capabilities of our phenotyping system surpass those of unassisted humans to rapidly and precisely phenotype our traits of interest. The scalability of this system enables large-scale phenomic screens that would otherwise be time-prohibitive, thereby providing increased power for GWAS, mutant screens, and other studies relying on large sample sizes to characterize the genetic basis of trait variation. Our user-friendly system can be used by researchers lacking a computational background, thus helping to democratize the use of deep segmentation as a tool for plant phenotyping.

54 ENVIRONMENTAL SCIENCES↗

WE-AB-303-08: Direct Lung Tumor Tracking Using Short Imaging Arcs

Purpose: Most current tumor tracking technologies rely on implanted markers, which suffer from potential toxicity of marker placement and mis-targeting due to marker migration. Several markerless tracking methods have been proposed: these are either indirect methods or have difficulties tracking lung tumors in most clinical cases due to overlapping anatomies in 2D projection images. We propose a direct lung tumor tracking algorithm robust to overlapping anatomies using short imaging arcs. Methods: The proposed algorithm tracks the tumor based on kV projections acquired within the latest six-degree imaging arc. To account for respiratory motion, an external motion surrogate is used to select projections of the same phase within the latest arc. For each arc, the pre-treatment 4D cone-beam CT (CBCT) with tumor contours are used to estimate and remove the contribution to the integral attenuation from surrounding anatomies. The position of the tumor model extracted from 4D CBCT of the same phase is then optimized to match the processed projections using the conjugate gradient method. The algorithm was retrospectively validated on two kV scans of a lung cancer patient with implanted fiducial markers. This patient was selected as the tumor is attached to the mediastinum, representing a challenging case for markerless tracking methods. The tracking results were converted to expected marker positions and compared with marker trajectories obtained via direct marker segmentation (ground truth). Results: The root-mean-squared-errors of tracking were 0.8 mm and 0.9 mm in the superior-inferior direction for the two scans. Tracking error was found to be below 2 and 3 mm for 90% and 98% of the time, respectively. Conclusions: A direct lung tumor tracking algorithm robust to overlapping anatomies was proposed and validated on two scans of a lung cancer patient. Sub-millimeter tracking accuracy was observed, indicating the potential of this algorithm for real-time guidance applications.

60 APPLIED LIFE SCIENCES↗

Reducing Urban Traffic Congestion Using Deep Learning and Model Predictive Control

This article proposes a deep learning (DL)-based control algorithm—DL velocity-based model predictive control (VMPC)—for reducing traffic congestion with slowly time-varying traffic signal controls. This control algorithm consists of system identification using DL and traffic signal control using VMPC. For the training process of DL, we established a modeling error entropy loss as the criteria inspired by the theory of stochastic distribution control (SDC) originated by the fourth author. Herein, simulation results show that the proposed algorithm can reduce traffic congestion with a slowly varying traffic signal control input. Results of an ablation study demonstrate that this algorithm compares favorably to other model-based controllers in terms of prediction error, signal varying speed, and control effectiveness.

97 MATHEMATICS AND COMPUTING↗

Theoretical Analysis of the EPR Spectrum Saturation Effect with Account for Spectral Diffusion in a System with a Gaussian Distribution of Spin Resonance Frequencies

We have analyzed the effect of saturation of the EPR spectrum for the model situation when a set of resonance frequencies of spin packets is described by a Gaussian distribution and spectral diffusion, which is a random process without correlation, exists. We have obtained the form of the spectrum for arbitrary values of magnetic–resonant parameters: relaxation times for the longitudinal and transverse components of the magnetization vector of the system, the spectral diffusion rate, the dispersion of the Gaussian distribution of resonance frequency, and the magnetic induction of the microwave field. We have derived an analytic expression for the saturation curve of the EPR spectrum. Detailed analysis of the dependence of the spectrum saturation curve on the spin system parameters is performed for the optimal case when the microwave field frequency coincides with the average frequency of the Gaussian distribution for resonance frequencies. The value of the microwave field induction at which the peak of the saturation curve is attained has been determined for arbitrary values of the paramagnetic relaxation time, spectral diffusion rate, and dispersion of the Gaussian spin frequency distribution. We have formulated the algorithm for determining the spin–lattice relaxation time using the experimentally determined microwave field induction for which the saturation curve passes through the peak. It should be noted that numerical calculations have been performed for parameters typical of EPR spectroscopy. The general analytic expression derived for the shape of the spectrum in the saturation conditions and qualitative conclusions concerning the effect of spectral diffusion on the saturation of stationary spectra obtained in this study can also be used in other fields of spectroscopy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Path integral molecular dynamics within the grand canonical-like adaptive resolution technique: Simulation of liquid water

Quantum effects due to the spatial delocalization of light atoms are treated in molecular simulation via the path integral technique. Among several methods, Path Integral (PI) Molecular Dynamics (MD) is nowadays a powerful tool to investigate properties induced by spatial delocalization of atoms; however, computationally this technique is very demanding. The above mentioned limitation implies the restriction of PIMD applications to relatively small systems and short time scales. One of the possible solutions to overcome size and time limitation is to introduce PIMD algorithms into the Adaptive Resolution Simulation Scheme (AdResS). AdResS requires a relatively small region treated at path integral level and embeds it into a large molecular reservoir consisting of generic spherical coarse grained molecules. It was previously shown that the realization of the idea above, at a simple level, produced reasonable results for toy systems or simple/test systems like liquid parahydrogen. Encouraged by previous results, in this paper, we show the simulation of liquid water at room conditions where AdResS, in its latest and more accurate Grand-Canonical-like version (GC-AdResS), is merged with two of the most relevant PIMD techniques available in the literature. The comparison of our results with those reported in the literature and/or with those obtained from full PIMD simulations shows a highly satisfactory agreement.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Flexible Reservation Algorithm for Advance Network Provisioning

Many scientific applications need support from a communication infrastructure that provides predictable performance, which requires effective algorithms for bandwidth reservations. Network reservation systems such as ESnet's OSCARS, establish guaranteed bandwidth of secure virtual circuits for a certain bandwidth and length of time. However, users currently cannot inquire about bandwidth availability, nor have alternative suggestions when reservation requests fail. In general, the number of reservation options is exponential with the number of nodes n, and current reservation commitments. We present a novel approach for path finding in time-dependent networks taking advantage of user-provided parameters of total volume and time constraints, which produces options for earliest completion and shortest duration. The theoretical complexity is only O(n2r2) in the worst-case, where r is the number of reservations in the desired time interval. We have implemented our algorithm and developed efficient methodologies for incorporation into network reservation frameworks. Performance measurements confirm the theoretical predictions.

97 MATHEMATICS AND COMPUTING↗

An Optimized Autoregressive Forecast Error Generator for Wind and Load Uncertainty Study

This paper presents a first-order autoregressive algorithm to generate real-time (RT), hour-ahead (HA), and day-ahead (DA) wind and load forecast errors. The methodology aims at producing random wind and load forecast time series reflecting the autocorrelation and cross-correlation of historical forecast data sets. Five statistical characteristics are considered: the means, standard deviations, autocorrelations, and cross-correlations. A stochastic optimization routine is developed to minimize the differences between the statistical characteristics of the generated time series and the targeted ones. An optimal set of parameters are obtained and used to produce the RT, HA, and DA forecasts in due order of succession. This method, although implemented as the first-order regressive random forecast error generator, can be extended to higher-order. Results show that the methodology produces random series with desired statistics derived from real data sets provided by the California Independent System Operator (CAISO). The wind and load forecast error generator is currently used in wind integration studies to generate wind and load inputs for stochastic planning processes. Our future studies will focus on reflecting the diurnal and seasonal differences of the wind and load statistics and implementing them in the random forecast generator.

17 WIND ENERGY↗

LaRIS: Targeting Portability and Productivity for LAPACK Codes on Extreme Heterogeneous Systems by Using IRIS

In keeping with the trend of heterogeneity in high-performance computing, hardware manufacturers and vendors are developing new architectures and associated software stacks (e.g., libraries) to harness the best possible performance from commonly used kernels (e.g., linear algebra kernels). However, kernels tuned for one architecture are not portable to others. Moreover, the coexistence of different architectures in a single node makes orchestration difficult. To address these challenges, we introduce LaRIS, a portable framework for LAPACK functionalities. LaRIS ensures a separation between linear algebra algorithms and vendor-library kernels by using the IRIS run time and IRIS-BLAS library. Such abstraction at the algorithm level makes the implementation completely agnostic to the vendor library and architecture. LaRIS uses the IRIS run time to dynamically select the vendor-library kernel and suitable processor architecture at run time. Through LU factorization, we demonstrate that LaRIS can fully utilize different heterogeneous systems by launching and orchestrating different vendor-library kernels without any change in the source code.

Monil, M. A. H.↗

Synchronization Algorithms for Co-Simulation of Power Grid and Communication Networks

The ongoing modernization of power grids consists of integrating them with communication networks in order to achieve robust and resilient control of grid operations. To understand the operation of the new smart grid, one approach is to use simulation software. Unfortunately, current power grid simulators at best utilize inadequate approximations to simulate communication networks, if at all. Cooperative simulation of specialized power grid and communication network simulators promises to more accurately reproduce the interactions of real smart grid deployments. However, co-simulation is a challenging problem. A co-simulation must manage the exchange of informa- tion, including the synchronization of simulator clocks, between all simulators while maintaining adequate computational perfor- mance. This paper describes two new conservative algorithms for reducing the overhead of time synchronization, namely Active Set Conservative and Reactive Conservative. We provide a detailed analysis of their performance characteristics with respect to the current state of the art including both conservative and optimistic synchronization algorithms. In addition, we provide guidelines for selecting the appropriate synchronization algorithm based on the requirements of the co-simulation. The newly proposed algorithms are shown to achieve as much as 14% and 63% im- provement, respectively, over the existing conservative algorithm.

co-simulation↗

WIDE-FIELD WIDE-BAND INTERFEROMETRIC IMAGING: THE WB A-PROJECTION AND HYBRID ALGORITHMS

Variations of the antenna primary beam (PB) pattern as a function of time, frequency, and polarization form one of the dominant direction-dependent effects at most radio frequency bands. These gains may also vary from antenna to antenna. The A-Projection algorithm, published earlier, accounts for the effects of the narrow-band antenna PB in full polarization. In this paper, we present the wide-band A-Projection algorithm (WB A-Projection) to include the effects of wide bandwidth in the A-term itself and show that the resulting algorithm simultaneously corrects for the time, frequency, and polarization dependence of the PB. We discuss the combination of the WB A-Projection and the multi-term multi-frequency synthesis (MT-MFS) algorithm for simultaneous mapping of the sky brightness distribution and the spectral index distribution across a wide field of view. We also discuss the use of the narrow-band A-Projection algorithm in hybrid imaging schemes that account for the frequency dependence of the PB in the image domain.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Memory-optimized shift operator alternating direction implicit finite difference time domain method for plasma

Through introducing the alternating direction implicit (ADI) technique and the memory-optimized algorithm to the shift operator (SO) finite difference time domain (FDTD) method, the memory-optimized SO-ADI FDTD for nonmagnetized collisional plasma is proposed and the corresponding formulae of the proposed method for programming are deduced. In order to further the computational efficiency, the iteration method rather than Gauss elimination method is employed to solve the equation set in the derivation of the formulae. Complicated transformations and convolutions are avoided in the proposed method compared with the Z transforms (ZT) ADI FDTD method and the piecewise linear JE recursive convolution (PLJERC) ADI FDTD method. The numerical dispersion of the SO-ADI FDTD method with different plasma frequencies and electron collision frequencies is analyzed and the appropriate ratio of grid size to the minimum wavelength is given. The accuracy of the proposed method is validated by the reflection coefficient test on a nonmagnetized collisional plasma sheet. The testing results show that the proposed method is advantageous for improving computational efficiency and saving computer memory. The reflection coefficient of a perfect electric conductor (PEC) sheet covered by multilayer plasma and the RCS of the objects coated by plasma are calculated by the proposed method and the simulation results are analyzed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving Unit Commitment Problems with Demand Responsive Loads

This work focuses on using variations of the Frank-Wolfe (FW) algorithm for solving unit commitment problems with high volumes of demand responsive loads on the power grid. We present a formulation of the unit commitment problem with demand responsive loads. We then show through reformulation and relaxations of the problem that variations of the Frank-Wolfe algorithm can be used to determine the time series decisions for the demand responsive loads. We show through computational experiments on the IEEE Reliability Test System that the timeseries of demand responsive load decisions obtained through our approach are near optimal and describe how large-scale parallel implementations of our approach can be highly computationally efficient.

demand response↗

Coalescence Prevention Algorithm for Level Set Method

An algorithm to prevent or delay bubble coalescence for the level set (LS) method is presented. This novel algorithm uses the LS method field to detect when bubbles are in close proximity, indicating a potential coalescence event, and applies a repellent force to simulate the unresolved liquid drainage force. The model is introduced by locally modifying the surface tension force near the liquid film drainage area. The algorithm can also simulate the liquid drainage time of the thin film by controlling the length of time the increased surface tension has been applied. Thus, a new method of modeling bubble coalescence has been developed. Several test cases were designed to demonstrate the capabilities of the algorithm. The simulations, including a mesh study, confirmed the abilities to identify and prevent coalescence as well as implement the time tracking portion, with an additional 10–25% computational cost. Ongoing tests aim to verify the algorithm's functionality for simulations with different flow conditions, a ranging number of bubbles, and both structured and unstructured computational mesh types. Specifically, a bubble rising toward a free surface provides a test of performance and demonstrates the ability to consistently prevent coalescence. In addition, a two bubble case and a seven bubble case provide a more complex demonstration of how the algorithm performs for larger simulations. These cases are compared to much more expensive simulations capable of resolving the liquid film drainage (through very high local mesh resolution) to investigate how the algorithm replicates the liquid film drainage process.

Engineering↗

Development of High-Granularity Dual-Readout Calorimetry with psec Timing

Dual-readout and particle flow algorithm (PFA) are technologies proposed for precise jet energy measurement in future colliders. While PFA requires highly granular calorimeters, dual-readout has mainly been used with fiber-based calorimeters that do not have highly segmented capabilities. It is still non-trivial to combine these two technologies in one calorimeter system because of the use of fibers in most of the dualreadout calorimeters, which is not compatible with the high granularity requirement of PFA technologies. The aim of this study is to develop a novel calorimetry that combines dual-readout and PFA by adopting a highly segmented tile-based configuration. This paper compares the improvement of energy resolution using dual-readout approach across several configurations of highly granular hadron calorimeters through simulation. Results indicate that setups with fine sampling and close placement of scintillators and Cherenkov detectors improve dual-readout performance.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Enumeration reduction algorithm for the characterization of multi-primary LED systems

Multi-primary tunable LED lighting systems can generate a vast number of spectral outputs, with the exact number depending on the resolution of the control signal and number of LED primaries. Computing all combinations to identify optimal spectral power distributions (SPDs) with a specified chromaticity would require a tremendous amount of time and computational power. Here, an enumeration reduction (ER) algorithm is described to reduce the computation time by defining a bounding pyramid in the three-dimensional tristimulus space that maps to the circumscribed square of the target region in the chromaticity diagram. This method enables computing only the necessary amount of tristimulus values (and resulting chromaticity coordinates) for SPDs that fall into a user-defined target chromaticity area, reducing computation time by avoiding the need to generate each combination and calculate its chromaticity coordinates. The results show that the proposed ER algorithm can greatly reduce the time – up to 922 times in a series of tests – to determine a set of metamers compared to a full enumeration computation.

47 OTHER INSTRUMENTATION↗

Accelerated optimization and automated discovery with covariance matrix adaptation for experimental quantum control

Optimization of quantum systems by closed-loop adaptive pulse shaping offers a rich domain for the development and application of specialized evolutionary algorithms. Derandomized evolution strategies (DESs) are presented here as a robust class of optimizers for experimental quantum control. The combination of stochastic and quasi-local search embodied by these algorithms is especially amenable to the inherent topology of quantum control landscapes. Implementation of DES in the laboratory results in efficiency gains of up to {approx}9 times that of the standard genetic algorithm, and thus is a promising tool for optimization of unstable or fragile systems. The statistical learning upon which these algorithms are predicated also provide the means for obtaining a control problem's Hessian matrix with no additional experimental overhead. The forced optimal covariance adaptive learning (FOCAL) method is introduced to enable retrieval of the Hessian matrix, which can reveal information about the landscape's local structure and dynamic mechanism. Exploitation of such algorithms in quantum control experiments should enhance their efficiency and provide additional fundamental insights.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Leakage Reduces Device Coherence Demands for Pulse-Level Molecular Simulations

Quantum simulation on noisy intermediate-scale quantum devices is severely limited by short qubit coherence times. A variational pulse-shaping algorithm known as ctrl-VQE was recently proposed to address this issue by eliminating the need for parameterized quantum circuits, which lead to long state preparation times. Here, in this study, we find the fastest possible pulses that prepare target molecular wave functions for a given device Hamiltonian describing coupled transmon qubits using simulations. We find that the resulting time-optimal pulses develop a bang-bang form consistent with Pontryagin’s maximum principle. We further investigate how the minimal state preparation time is impacted by the number of energy levels active in the transmon simulations. We find that leakage outside the computational subspace (something that is usually considered problematic) speeds up the state preparation, further reducing device coherence-time demands. Our analysis reveals that this speedup is due to both an enlarged solution space of target wave functions and the appearance of additional channels connecting initial and target states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗