Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithms.”

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 937 records · Page 52

Solar-Tracker Diffuse-Response Algorithm for Balancing Energy Gain and Mechanical Wear in Photovoltaic Systems

Single-axis solar tracking maximizes photovoltaic energy production under clear-sky conditions; however, its effectiveness decreases under cloudy and overcast skies, where diffuse irradiance dominates and the optimal module orientation changes. Conventional tracking algorithms either neglect sky conditions or rely on simplified diffuse-response strategies that may trigger frequent tracker repositioning under variable cloud cover, leading to increased mechanical wear with marginal energy gains. This work proposes an enhanced diffuse-response tracking algorithm that explicitly accounts for both the intensity and temporal persistence of cloudiness. By requiring overcast conditions to persist for a minimum duration before reorienting the tracker to a diffuse-stow position, the proposed approach reduces unnecessary movements while preserving the benefits of diffuse-response operation. The algorithm is evaluated through numerical simulations based on historical meteorological data and validated using field measurements on monofacial and bifacial photovoltaic strings. The results show that the proposed strategy reduces excess tracker movement from 114% to 0.16% while maintaining nearly the same energy yield. Compared to a conventional diffuse-response algorithm, the associated energy reduction is minimal (≈0.17%) relative to the ≈0.37% yield gain observed at the studied location. These findings demonstrate that incorporating cloudiness duration enables a practical compromise between energy performance and tracker durability, particularly for monofacial photovoltaic systems.

14 SOLAR ENERGY↗

Per-Phase and 3-Phase Optimal Coordination of Directional Overcurrent Relays Using Genetic Algorithm

Penetration of the power grid by renewable energy sources, distributed storage, and distributed generators is becoming increasingly common. Increased utilization of these distributed energy resources (DERs) has given rise to additional protection coordination concerns, particularly where they are utilized in an unbalanced manner or where loading among phases is unbalanced. Digital relays such as the SEL-751 (produced by Schweitzer Engineering Laboratories, Pullman, WA, USA) series have the capability of being set on a per-phase basis. This capability is underutilized in common practice. Additionally, in optimization algorithms for determining relay settings, the time-overcurrent characteristics (TOCs) of relays are generally not treated as variables and are assigned before running the optimization algorithm. In this paper, TOC options themselves are treated as discrete variables to be considered in the optimization algorithm. A mixed integer nonlinear programming problem (MINLP) is set up where the goal is to minimize relay operating times. A genetic algorithm (GA) approach is implemented in MATLAB where two cases are considered. In the first case, the TOC and Time dial setting (TDS) of each relay is set on a three-phase basis. In the second case, per-phase settings are considered. Relay TDSs and TOCs are both considered as simultaneous discrete control variables. Despite the stochastic nature of using per-phase settings for unbalanced systems is found to generally allow for shorter operating times. However, for relatively balanced systems, it is best to use three-phase settings if computation time is of importance.

Matthews, Ronald C.↗

An Empirical Assessment of the MODIS Land Cover Dynamics and TIMESAT Land Surface Phenology Algorithms

Observations of vegetation phenology at regional-to-global scales provide important information regarding seasonal variation in the fluxes of energy, carbon, and water between the biosphere and the atmosphere. Numerous algorithms have been developed to estimate phenological transition dates using time series of remotely sensed spectral vegetation indices. A key challenge, however, is that different algorithms provide inconsistent results. This study provides a comprehensive comparison of start of season (SOS) and end of season (EOS) phenological transition dates estimated from 500 m MODIS data based on two widely used sources of such data: the TIMESAT program and the MODIS Global Land Cover Dynamics (MLCD) product. Specifically, we evaluate the impact of land cover class, criteria used to identify SOS and EOS, and fitting algorithm (local versus global) on the transition dates estimated from time series of MODIS enhanced vegetation index (EVI). Satellite-derived transition dates from each source are compared against each other and against SOS and EOS dates estimated from PhenoCams distributed across the Northeastern United States and Canada. Our results show that TIMESAT and MLCD SOS transition dates are generally highly correlated (r = 0.51-0.97), except in Central Canada where correlation coefficients are as low as 0.25. Relative to SOS, EOS comparison shows lower agreement and higher magnitude of deviations. SOS and EOS dates are impacted by noise arising from snow and cloud contamination, and there is low agreement among results from TIMESAT, the MLCD product, and PhenoCams in vegetation types with low seasonal EVI amplitude or with irregular EVI time series. In deciduous forests, SOS dates from the MLCD product and TIMESAT agree closely with SOS dates from PhenoCams, with correlations as high as 0.76. Overall, our results suggest that TIMESAT is well-suited for local-to-regional scale studies because of its ability to tune algorithm parameters, which makes it more flexible than the MLCD product. At large spatial scales, where local tuning is not feasible, the MLCD product provides a readily available data set based on a globally consistent approach that provides SOS and EOS dates that are comparable to results from TIMESAT.

47 OTHER INSTRUMENTATION↗

Using Machine Learning Algorithm to Detect Blowing Snow and Fog in Antarctica Based on Ceilometer and Surface Meteorology Systems

Blowing snow is a common weather phenomenon in Antarctica and plays an important role in the water vapor cycle and ice sheet mass balance. Although it has a significant impact on the climate of Antarctica, people do not know much about this process. Fog events are difficult to distinguish from blowing snow events using existing detection algorithms by a ceilometer. In this study, based on ceilometer, the meteorological parameters observed by surface meteorology systems are further combined to detect blowing snow and fog using the AdaBoost algorithm. The weather phenomena recorded by human observers are ‘true’. The dataset is collected from 1 January 2016 to 31 December 2016 at the AWARE site. Among them, three-quarters of the data are used as the training set and the rest of the data as the testing set. The classification accuracy of the proposed algorithm for the testing set is about 94%. Compared with the Loeb method, the proposed algorithm can detect 89.12% of blowing snow events and 76.10% of fog events, while the Loeb method can only identify 64.29% of blowing snow events and 31.87% of fog events.

54 ENVIRONMENTAL SCIENCES↗

Efficient Application of the Factorized form of the Unitary Coupled-Cluster Ansatz for the Variational Quantum Eigensolver Algorithm by Using Linear Combination of Unitaries

The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons with relatively low-depth circuits, which are otherwise difficult to solve on classical computers. The variational eigenstate is constructed from a number of factorized unitary coupled-cluster terms applied onto an initial (single-reference) state. Current algorithms for applying one of these operators to a quantum state require a number of operations that scale exponentially with the rank of the operator. We exploit a hidden SU(2) symmetry to allow us to employ the linear combination of unitaries approach, Our Prepare subroutine uses n+2 ancilla qubits for a rank-n operator. Our Select (U) scheme uses O(n) Cnot gates. This results in a full algorithm that scales like the cube of the rank of the operator n 3 , a significant reduction in complexity for rank five or higher operators. This approach, when combined with other algorithms for lower-rank operators (when compared to the standard implementation), will make the factorized form of the unitary coupled-cluster approach much more efficient to implement on all types of quantum computers.

97 MATHEMATICS AND COMPUTING↗

Finding Fast Transients in Real Time Using a Novel Light-curve Analysis Algorithm

The current data acquisition rate of astronomical transient surveys and the promise for significantly higher rates in the next decade necessitate the development of novel approaches to analyze astronomical data sets and promptly detect objects of interest. The Deeper, Wider, Faster (DWF) program is a survey focused on the identification of fast-evolving transients, such as fast radio bursts, gamma-ray bursts, and supernova shock breakouts. It employs multifrequency simultaneous coverage of the same part of the sky over several orders of magnitude. Using the Dark Energy Camera mounted on the 4 m Blanco telescope, DWF captures a 20 s g -band exposure every minute, at a typical seeing of ~1'' and an air mass of ~1.5. These optical data are collected simultaneously with observations conducted over the entire electromagnetic spectrum—from radio to γ -rays—as well as cosmic-ray observations. In this paper, we present a novel real-time light-curve analysis algorithm, designed to detect transients in the DWF optical data; this algorithm functions independently from, or in conjunction with, image subtraction. We present a sample of fast transients detected by our algorithm, as well as a false-positive analysis. Our algorithm is customizable and can be tuned to be sensitive to transients evolving over different timescales and flux ranges.

79 ASTRONOMY AND ASTROPHYSICS↗

Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm

We study the problem of decomposing a volume with a smooth boundary into a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay meshing, a principled solution to this problem for generic smooth surfaces remained elusive. VoroCrust leverages ideas from weighted α-shapes and the power crust algorithm to produce unweighted Voronoi cells conforming to the surface, yielding the first provably-correct algorithm for this problem. Given a κ-sparse ε-sample, we work with the balls of radius δ times the local feature size centered at each sample. The corners of the union of these balls on both sides of the surface are the Voronoi sites and the interface of their cells is a watertight surface reconstruction embedded in the dual shape of the union of balls. With the surface protected, the enclosed volume can be further decomposed by generating more sites inside it. Compared to clipping-based algorithms, VoroCrust cells are full Voronoi cells, with convexity and fatness guarantees. Compared to the power crust algorithm, VoroCrust cells are not filtered, are unweighted, and offer greater flexibility in meshing the enclosed volume by either structured or randomly genenerated samples.

97 MATHEMATICS AND COMPUTING↗

Performance Analysis of an Optimization Algorithm for Metamaterial Design on the Integrated High-Performance Computing and Quantum Systems

Optimizing metamaterials with complex geometries is a big challenge. Although an active learning algorithm, combining machine learning (ML), quantum computing, and optical simulation, has emerged as an efficient optimization tool, it still faces difficulties in optimizing complex structures that have potentially high performance. In this work, we comprehensively analyze the performance of an optimization algorithm for metamaterial design on the integrated HPC and quantum systems. We demonstrate significant time advantages through message-passing interface (MPI) parallelization on the high-performance computing (HPC) system showing approximately 54% faster ML tasks and 67 times faster optical simulation against serial workloads. Furthermore, we analyze the performance of a quantum algorithm designed for optimization, which runs with various quantum simulators on a local computer or HPC-quantum system. Results showcase ~24 times speedup when executing the optimization algorithm on the HPC-quantum hybrid system. This study paves a way to optimize complex metamaterials using the integrated HPC-quantum system.

Kim, Seongmin↗

A space-time tracking algorithm for high occupancy events at future colliders

We propose to explore the potential advantages of a newclass of tracking algorithms loosely inspired by the Hough transformconcept and where we include the time of arrival of each hit as anadditional coordinate to be treated in the same way as a spatialcoordinate. A remarkable property of this algorithm is that theexecution time is proportional to the total number of hits to beprocessed, making it particularly attractive for high occupancysituations expected at future colliders. The particular structureof the algorithm also lends itself naturally to parallel hardwareimplementations which, combined to its intrinsic flexibility, shouldprovide a powerful tool for triggering at future colliders. To probethe effectiveness of the algorithm, we apply it to a quasi-realisticsimulated environment of a possible future muon collider experimentand report the performance.

Casarsa, Massimo [INFN, Trieste; Royal Inst. Tech.↗

A remote sensing algorithm for vertically resolved cloud condensation nuclei number concentrations from airborne and spaceborne lidar observations

Cloud condensation nuclei (CCN) are mediators of aerosol–cloud interactions (ACIs), contributing to the largest uncertainties in the understandings of global climate change. We present a novel remote-sensing-based algorithm that quantifies the vertically resolved CCN number concentrations (N CCN ) using aerosol optical properties measured by a multiwavelength lidar. The algorithm considers five distinct aerosol subtypes with bimodal size distributions. The inversion used the lookup tables developed in this study, based on the observations from the Aerosol Robotic Network, to efficiently retrieve optimal particle size distributions from lidar measurements. The method derives dry aerosol optical properties by implementing hygroscopic enhancement factors in lidar measurements. The retrieved optically equivalent particle size distributions and aerosol-type-dependent particle composition are utilized to calculate critical diameters using κ-Köhler theory and N CCN at six supersaturations ranging from 0.07 % to 1.0 %. Sensitivity analyses indicate that uncertainties in extinction coefficients and relative humidity greatly influence the retrieval error in N CCN . The potential of this algorithm is further evaluated by retrieving N CCN using airborne lidar from the NASA ObseRvations of Aerosols above CLouds and their intEractionS (ORACLES) campaign and is validated against simultaneous measurements from the CCN counter. The independent validation with robust correlation demonstrates promising results. Furthermore, the N CCN has been retrieved for the first time using a proposed algorithm from spaceborne lidar – Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) – measurements. The application of this new capability demonstrates the potential for constructing a 3D CCN climatology at a global scale, which helps to better quantify ACI effects and thus reduce the uncertainty in aerosol climate forcing.

54 ENVIRONMENTAL SCIENCES↗

Improved retrievals of carbon dioxide from Orbiting Carbon Observatory-2 with the version 8 ACOS algorithm

Since September 2014, NASA's Orbiting Carbon Observatory-2 (OCO-2) satellite has been taking measurements of reflected solar spectra and using them to infer atmospheric carbon dioxide levels. This work provides details of the OCO-2 retrieval algorithm, versions 7 and 8, used to derive the column-averaged dry air mole fraction of atmospheric CO 2 ( X CO 2 ) for the roughly 100 000 cloud-free measurements recorded by OCO-2 each day. The algorithm is based on the Atmospheric Carbon Observations from Space (ACOS) algorithm which has been applied to observations from the Greenhouse Gases Observing SATellite (GOSAT) since 2009, with modifications necessary for OCO-2. Because high accuracy,better than 0.25 %, is required in order to accurately infer carbon sources and sinks from X CO 2 , significant errors and regional-scale biases in the measurements must be minimized. We discuss efforts to filter out poor-quality measurements, and correct the remaining good-quality measurements to minimize regional-scale biases. Updates to the radiance calibration and retrieval forward model in version 8 have improved many aspects of the retrieved data products. The version 8 data appear to have reduced regional-scale biases overall, and demonstrate a clear improvement over the version 7 data. In particular, error variance with respect to TCCON was reduced by 20 % over land and 40 % over ocean between versions 7 and 8, and nadir and glint observations over land are now more consistent. While this paper documents the significant improvements in the ACOS algorithm, it will continue to evolve and improve as the CO 2 data record continues to expand.

54 ENVIRONMENTAL SCIENCES↗

Version 4 CALIPSO Imaging Infrared Radiometer ice and liquid water cloud microphysical properties – Part I: The retrieval algorithms

Following the release of the version 4 Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) data products from the Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO) mission, a new version (version 4; V4) of the CALIPSO Imaging Infrared Radiometer (IIR) Level 2 data products has been developed. The IIR Level 2 data products include cloud effective emissivities and cloud microphysical properties such as effective diameter and ice or liquid water path estimates. Dedicated retrievals for water clouds were added in V4, taking advantage of the high sensitivity of the IIR retrieval technique to small particle sizes. This paper (Part I) describes the improvements in the V4 algorithms compared to those used in the version 3 (V3) release, while results will be presented in a companion (Part II) paper. The IIR Level 2 algorithm has been modified in the V4 data release to improve the accuracy of the retrievals in clouds of very small (close to 0) and very large (close to 1) effective emissivities. To reduce biases at very small emissivities that were made evident in V3, the radiative transfer model used to compute clear-sky brightness temperatures over oceans has been updated and tuned for the simulations using Modern-Era Retrospective analysis for Research and Applications version 2 (MERRA-2) data to match IIR observations in clear-sky conditions. Furthermore, the clear-sky mask has been refined compared to V3 by taking advantage of additional information now available in the V4 CALIOP 5 km layer products used as an input to the IIR algorithm. After sea surface emissivity adjustments, observed and computed brightness temperatures differ by less than ±0.2 K at night for the three IIR channels centered at 08.65, 10.6, and 12.05 µm, and inter-channel biases are reduced from several tens of Kelvin in V3 to less than 0.1 K in V4. We have also improved retrievals in ice clouds having large emissivity by refining the determination of the radiative temperature needed for emissivity computation. The initial V3 estimate, namely the cloud centroid temperature derived from CALIOP, is corrected using a parameterized function of temperature difference between cloud base and top altitudes, cloud absorption optical depth, and CALIOP multiple scattering correction factor. As shown in Part II, this improvement reduces the low biases at large optical depths that were seen in V3 and increases the number of retrievals. As in V3, the IIR microphysical retrievals use the concept of microphysical indices applied to the pairs of IIR channels at 12.05 and 10.6 µm and at 12.05 and 08.65 µm. The V4 algorithm uses ice look-up tables (LUTs) built using two ice habit models from the recent “TAMUice2016” database, namely the single-hexagonal-column model and the eight-element column aggregate model, from which bulk properties are synthesized using a gamma size distribution. Four sets of effective diameters derived from a second approach are also reported in V4. Here, the LUTs are analytical functions relating microphysical index applied to IIR channels 12.05 and 10.6 µm and effective diameter as derived from in situ measurements at tropical and midlatitudes during the Tropical Composition, Cloud, and Climate Coupling (TC4) and Small Particles in Cirrus Science and Operations Plan (SPARTICUS) field experiments.

54 ENVIRONMENTAL SCIENCES↗

The WACMOS-ET project – Part 1: Tower-scale evaluation of four remote-sensing-based evapotranspiration algorithms

The WAter Cycle Multi-mission Observation Strategy – EvapoTranspiration (WACMOS-ET) project has compiled a forcing data set covering the period 2005–2007 that aims to maximize the exploitation of European Earth Observations data sets for evapotranspiration (ET) estimation. The data set was used to run four established ET algorithms: the Priestley–Taylor Jet Propulsion Laboratory model (PT-JPL), the Penman–Monteith algorithm from the MODerate resolution Imaging Spectroradiometer (MODIS) evaporation product (PM-MOD), the Surface Energy Balance System (SEBS) and the Global Land Evaporation Amsterdam Model (GLEAM). In addition, in situ meteorological data from 24 FLUXNET towers were used to force the models, with results from both forcing sets compared to tower-based flux observations. Model performance was assessed on several timescales using both sub-daily and daily forcings. The PT-JPL model and GLEAM provide the best performance for both satellite- and tower-based forcing as well as for the considered temporal resolutions. Simulations using the PM-MOD were mostly underestimated, while the SEBS performance was characterized by a systematic overestimation. In general, all four algorithms produce the best results in wet and moderately wet climate regimes. In dry regimes, the correlation and the absolute agreement with the reference tower ET observations were consistently lower. While ET derived with in situ forcing data agrees best with the tower measurements ( R 2 = 0.67), the agreement of the satellite-based ET estimates is only marginally lower ( R 2 = 0.58). Results also show similar model performance at daily and sub-daily (3-hourly) resolutions. Overall, our validation experiments against in situ measurements indicate that there is no single best-performing algorithm across all biome and forcing types. In conclusion, an extension of the evaluation to a larger selection of 85 towers (model inputs resampled to a common grid to facilitate global estimates) confirmed the original findings.

54 ENVIRONMENTAL SCIENCES↗

Using OpenMP for HEP Framework Algorithm Scheduling [Slides]

The OpenMP standard is the primary mechanism used at high performance computing facilities to allow intra-process parallelization. In contrast, many HEP specific software (such as CMSSW, GaudiHive, and ROOT) make use of Intel's Threading Building Blocks (TBB) library to accomplish the same goal. In this talk we will discuss our work to compare TBB and OpenMP when used for scheduling algorithms to be run by a HEP style data processing framework (i.e. running hundreds of interdependent algorithms at most once for each event read from the detector). This includes both scheduling of different algorithms to be run concurrently as well as scheduling concurrent work within one algorithm. As part of the discussion we present an overview of the OpenMP threading model. We also explain how we used OpenMP when creating a simplified HEP-like processing framework. Using that simplified framework, and a similar one written using TBB, we will present performance comparisons between TBB and different compiler versions of OpenMP.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Scaling Up Coordinate Descent Algorithms for Large ℓ1 Regularization Problems

We present a generic framework for parallel coordinate descent (CD) algorithms that has as special cases the original sequential algorithms of Cyclic CD and Stochastic CD, as well as the recent parallel Shotgun algorithm of Bradley et al. We introduce two novel parallel algorithms that are also special cases---Thread-Greedy CD and Coloring-Based CD---and give performance measurements for an OpenMP implementation of these.

Scherrer, Chad↗

Sideband Algorithm for Automatic Wind Turbine Gearbox Fault Detection and Diagnosis: Preprint

Improving the availability of wind turbines (WT) is critical to minimize the cost of wind energy, especially for offshore installations. As gearbox downtime has a significant impact on WT availabilities, the development of reliable and cost-effective gearbox condition monitoring systems (CMS) is of great concern to the wind industry. Timely detection and diagnosis of developing gear defects within a gearbox is an essential part of minimizing unplanned downtime of wind turbines. Monitoring signals from WT gearboxes are highly non-stationary as turbine load and speed vary continuously with time. Time-consuming and costly manual handling of large amounts of monitoring data represent one of the main limitations of most current CMSs, so automated algorithms are required. This paper presents a fault detection algorithm for incorporation into a commercial CMS for automatic gear fault detection and diagnosis. The algorithm allowed the assessment of gear fault severity by tracking progressive tooth gear damage during variable speed and load operating conditions of the test rig. Results show that the proposed technique proves efficient and reliable for detecting gear damage. Once implemented into WT CMSs, this algorithm can automate data interpretation reducing the quantity of information that WT operators must handle.

17 WIND ENERGY↗

Datasets for radiation network algorithm development and testing

Domestic Nuclear Detection Office s (DNDO) Intelligence Radiation Sensors Systems (IRSS) program supported the development of networks of commercial-off-the-shelf (COTS) radiation counters for detecting, localizing, and identifying low-level radiation sources. Under this program, a series of indoor and outdoor tests were conducted with multiple source strengths and types, different background profiles, and various types of source and detector movements. Following the tests, network algorithms were replayed in various re-constructed scenarios using sub-networks. These measurements and algorithm traces together provide a rich collection of highly valuable datasets for testing the current and next generation radiation network algorithms, including the ones (to be) developed by broader R&D communities such as distributed detection, information fusion, and sensor networks. From this multiple TeraByte IRSS database, we distilled out and packaged the first batch of canonical datasets for public release. They include measurements from ten indoor and two outdoor tests which represent increasingly challenging baseline scenarios for robustly testing radiation network algorithms.

Rao, Nageswara S↗

Constructing and proving the ground state of a generalized Ising model by the cluster tree optimization algorithm

Generalized Ising models, also known as cluster expansions, are an important tool in many areas of condensed-matter physics and materials science, as they are often used in the study of lattice thermodynamics, solid-solid phase transitions, magnetic and thermal properties of solids, and fluid mechanics. However, the problem of finding the global ground state of generalized Ising model has remained unresolved, with only a limited number of results for simple systems known. We propose a method to efficiently find the periodic ground state of a generalized Ising model of arbitrary complexity by a new algorithm which we term cluster tree optimization. Importantly, we are able to show that even in the case of an aperiodic ground state, our algorithm produces a sequence of states with energy converging to the true ground state energy, with a provable bound on error. Compared to the current state-of-the-art polytope method, this algorithm eliminates the necessity of introducing an exponential number of variables to counter frustration, and thus significantly improves tractability. We believe that the cluster tree algorithm offers an intuitive and efficient approach to finding and proving ground states of generalized Ising Hamiltonians of arbitrary complexity, which will help validate assumptions regarding local vs. global optimality in lattice models, as well as offer insights into the low-energy behavior of highly frustrated systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗