Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONNECT algorithm”

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 415 records · Page 23

Delineation of endorheic drainage basins in the MERIT-Plus dataset for 5 and 15 minute upscaled river networks

Abstract The MERIT-Hydro networks re-gridded by the Iterative Hydrography Upscaling (IHU) algorithm do not retain exo- or endorheic basin attributes from the original data. Here we developed methods to assign such attributes to those and any other digital river networks. The motivation is that endorheic inland drainage basins are essential for hydrologic modelling of global and regional water balances, land surface water storage, gravity anomalies, sea level rise, etc. First, we create basin attributes that explicitly label endorheic and exorheic catchments by the criteria of direct or hidden connectivity to the ocean without changing their flow direction grid. In the second step we alter the delineation of endorheic basins by the merging algorithm that eliminates small inland watersheds to the adjacent host basins. The resulting datasets have a significantly reduced number of endorheic basins while preserving the total land portion and topology of the inland basins. The data was validated using the Water Balance Model by comparing volume of endorheic inland depressions with modelled water accumulation in their inland lakes.

58 GEOSCIENCES↗

Optimal Operation of PV Sources in DC Grids for Improving Technical, Economical, and Environmental Conditions by Using Vortex Search Algorithm and a Matrix Hourly Power Flow

This document presents a master–slave methodology for solving the problem of optimal operation of photovoltaic (PV) distributed generators (DGs) in direct current (DC) networks. This problem was modeled using a nonlinear programming model (NLP) that considers the minimization of three different objective functions in a daily operation of the system. The first one corresponds to the minimization of the total operational cost of the system, including the energy purchasing cost to the conventional generators and maintenance costs of the PV sources; the second objective function corresponds to the reduction of the energy losses associated with the transport of energy in the network, and the third objective function is related to the minimization of the total emissions of CO2 by the conventional generators installed on the DC grid. The minimization of these objective functions is achieved by using a master–slave optimization approach through the application of the Vortex Search algorithm combined with a matrix hourly power flow. To evaluate the effectiveness and robustness of the proposed approach, two test scenarios were used, which correspond to a grid-connected and a standalone network located in two different regions of Colombia. The grid-connected system emulates the behavior of the solar resource and power demand of the city of Medellín-Antioquia, and the standalone network corresponds to an adaptation of the generation and demand curves for the municipality of Capurganá-Choco. A numerical comparison was performed with four optimization methodologies reported in the literature: particle swarm optimization, multiverse optimizer, crow search algorithm, and salp swarm algorithm. The results obtained demonstrate that the proposed optimization approach achieved excellent solutions in terms of response quality, repeatability, and processing times.

14 SOLAR ENERGY↗

Validation Assessment for the Soil Moisture Active Passive (SMAP) Level 4 Carbon (L4_C) Data Product Version 5

The post-launch Cal/Val phase of the SMAP mission is guided by two primary objectives for each science product team: 1) to calibrate, verify, and improve the performance of the science algorithms, and 2) validate accuracies of the science data products as specified in the SMAP Level-1 mission science requirements. Algorithm science and product maintenance activities during the SMAP extended mission phase have also involved periodic algorithm calibration and product refinements to maintain or enhance product consistency and performance as well as science utility. This report provides an assessment of the latest (Version 5) SMAP Level 4 Carbon (L4_C) product. The L4_C Version 5 (v5) global record now spans more than six years (March 2015 – present) of SMAP operations and has benefited from five major reprocessing updates to the operational product. These reprocessing events and L4_C product release updates have incorporated various algorithm refinements and calibration adjustments to account for similar refinements to the upstream GEOS land model assimilation system, SMAP brightness temperatures, and MODIS vegetation inputs used for L4_C processing. The SMAP L4_C algorithms utilize a terrestrial carbon flux model informed by daily surface and root zone soil moisture information contributed from the SMAP Level 4 Soil Moisture (L4_SM) product along with optical remote sensing-based (e.g. MODIS-based) land cover and canopy fractional photosynthetic active radiation (fPAR), and other ancillary biophysical data. The carbon flux model estimates global daily net ecosystem CO2 exchange (NEE) and the component carbon fluxes, namely, vegetation gross primary production (GPP) and soil heterotrophic respiration (Rh). Other L4_C product elements include surface (~0-5 cm depth) soil organic carbon (SOC) stocks and associated environmental constraints to these processes, including soil moisture-related controls on GPP and ecosystem respiration (Kimball et al. 2014, Jones et al. 2017). The L4_C product addresses SMAP carbon cycle science objectives by: 1) providing a direct link between terrestrial carbon fluxes and underlying freeze/thaw and soil moisture-related constraints to these processes, 2) documenting primary connections between terrestrial water, energy and carbon cycles, and 3) improving understanding of terrestrial carbon sink activity. The SMAP L4_C algorithms and operational product are mature and at a CEOS Validation Stage 4 level (Jackson et al. 2012) based on extensive validation of the multi-year record against a diverse array of independent benchmarks, well characterized global performance, and systematic refinements gained from five major reprocessing events. There are no Level-1 mission science requirements for the L4_C product; however, self-imposed requirements have been established focusing on NEE as the primary product field for validation, and on demonstrating L4_C accuracy and success in meeting product science requirements (Jackson et al. 2012). The other L4_C product fields also have strong utility for carbon science applications (e.g., Liu et al. 2019, Endsley et al. 2020); however, analysis of these other fields is considered secondary relative to primary validation activities focusing on NEE. The L4_C targeted accuracy requirements are to meet or exceed a mean unbiased root-mean-square error (ubRMSE, or standard deviation of the error) for NEE of 1.6 g C m-2 d-1 and 30 g C m-2 yr-1, emphasizing northern (≥45°N) boreal and arctic ecosystems; this accuracy is similar to that of tower eddy covariance measurement-based observations (Baldocchi 2008). Methods used for the latest v5 L4_C product performance and validation assessment have been established from the SMAP Cal/Val plan and previous studies (Jackson et al. 2012, Jones et al. 2017) and include: 1) consistency evaluations of the product fields against earlier product releases (version 4 or earlier); 2) comparisons of daily carbon flux estimates with independent tower eddy 4covariance measurement-based daily carbon (CO2) flux observations from core tower validation sites (CVS); and 3) consistency checks against other global carbon products, including soil carbon inventory records, global GPP records derived from tower observation upscaling methods, and satellite-based observations of canopy solar induced chlorophyll fluorescence (SIF) as a surrogate for GPP. Metrics used to evaluate relative agreement between L4_C product fields and observational benchmarks include correlation (r-value), RMSE differences, bias and model sensitivity diagnostics. Following these validation criteria, the present report provides a validation assessment of the latest L4_C product release (v5). Detailed descriptions of the L4_C algorithm and additional global product accuracy and performance results are given elsewhere (Jones et al. 2017, Endsley et al. 2020). The v5 L4_C product replaces earlier product versions and continues to show: (i) accuracy and performance levels meeting or exceeding SMAP L4_C science requirements; (ii) improvement over the previous product version (version 4); and (iii) suitability for a diversity of science applications. Example L4_C applications from the recent literature include clarifying environmental trends and controls on the northern terrestrial carbon sink (Liu et al. 2019), diagnosing drought-related impacts on ecosystem productivity (Li et al. 2020), and regional monitoring of cropland conditions for projecting annual yields (Wurster et al. 2020). 2EXPECTED L4_C ALGORITHM AND PRODUCTPERFORMANCE The L4_C algorithm performance, including variance and uncertainty estimates of model outputs, was determined during the mission pre-launch phase through spatially explicit model sensitivity studies using available model inputs similar to those currently being used for operational production and evaluating the resulting model simulations over the observed range of northern (≥45 °N) and global conditions (Kimball et al. 2012, Entekhabi et al. 2014). The L4_C algorithm options were also evaluated during the mission prelaunch phase, including deriving canopy fPAR from lower order NDVI (Normalized Difference Vegetation Index) inputs in lieu of using MODIS (MOD15) fPAR; and including an explicit model representation of boreal fire disturbance recovery impacts. These results indicated that the L4_C accuracy requirements (i.e., NEE ubRMSE ≤ 30 g C m-2 yr-1or ≤ 1.6 g C m-2 d-1) could be met from the baseline algorithms over more than 82% and 89% of global and northern vegetated land areas, respectively (Yi et al. 2013, Kimball et al. 2014). The global L4_C algorithm error budget for NEE derived during the mission prelaunch phase indicated that the estimated NEE ubRMSE uncertainty is proportional to GPP and is therefore larger in higher biomass productivity areas, including forests and croplands (Kimball et al. 2014). Likewise, NEE ubRMSE uncertainty is expected to be lower in less-productive areas, including grasslands and shrublands. Expected model NEE ubRMSE levels were also generally within targeted accuracy levels for characteristically less-productive boreal and Arctic biomes, even though relative model error as a proportion of total productivity (NEE RMSE / GPP) may be large in these areas. The estimated NEE uncertainty was lower than expected in some warmer tropical high biomass productivity areas (e.g. Amazon rainforest) because of reduced low temperature and moisture constraints to the L4_C respiration calculations so that the bulk of model uncertainty is contributed by GPP in these areas. Model NEE uncertainty in the African Congo was estimated to

SMAP↗

Development of Fast Algorithms Using Recursion, Nesting and Iterations for Computational Electromagnetics

In the first phase of our work, we have concentrated on laying the foundation to develop fast algorithms, including the use of recursive structure like the recursive aggregate interaction matrix algorithm (RAIMA), the nested equivalence principle algorithm (NEPAL), the ray-propagation fast multipole algorithm (RPFMA), and the multi-level fast multipole algorithm (MLFMA). We have also investigated the use of curvilinear patches to build a basic method of moments code where these acceleration techniques can be used later. In the second phase, which is mainly reported on here, we have concentrated on implementing three-dimensional NEPAL on a massively parallel machine, the Connection Machine CM-5, and have been able to obtain some 3D scattering results. In order to understand the parallelization of codes on the Connection Machine, we have also studied the parallelization of 3D finite-difference time-domain (FDTD) code with PML material absorbing boundary condition (ABC). We found that simple algorithms like the FDTD with material ABC can be parallelized very well allowing us to solve within a minute a problem of over a million nodes. In addition, we have studied the use of the fast multipole method and the ray-propagation fast multipole algorithm to expedite matrix-vector multiplication in a conjugate-gradient solution to integral equations of scattering. We find that these methods are faster than LU decomposition for one incident angle, but are slower than LU decomposition when many incident angles are needed as in the monostatic RCS calculations.

Chew, W. C.↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

Exploring cryo-electron microscopy with molecular dynamics

Single particle analysis cryo-electron microscopy (EM) and molecular dynamics (MD) have been complimentary methods since cryo-EM was first applied to the field of structural biology. The relationship started by biasing structural models to fit low-resolution cryo-EM maps of large macromolecular complexes not amenable to crystallization. The connection between cryo-EM and MD evolved as cryo-EM maps improved in resolution, allowing advanced sampling algorithms to simultaneously refine backbone and sidechains. Moving beyond a single static snapshot, modern inferencing approaches integrate cryo-EM and MD to generate structural ensembles from cryo-EM map data or directly from the particle images themselves. We summarize the recent history of MD innovations in the area of cryo-EM modeling. The merits for the myriad of MD based cryo-EM modeling methods are discussed, as well as, the discoveries that were made possible by the integration of molecular modeling with cryo-EM. Lastly, current challenges and potential opportunities are reviewed.

Biochemistry & Molecular Biology↗

The Octopus processor for the CMS L1 muon trigger for High Luminosity LHC

The upgraded L1 muon trigger system of the CMS experiment in the High Luminosity Large Hadron Collider is based on custom processors featuring large Field Programmable Gate Arrays (FPGAs) connected by large numbers of optical links. These provide the I/O bandwidth and power necessary to process the complex algorithms used during the collection of physics data. The design and performance requirements of these processors creates significant challenges in signal integrity, power delivery, and thermal management. In this paper we describe the Octopus processor, featuring a large Xilinx Virtex Ultrascale+ FPGA and up to 128 links interfaced to optics through high quality twin-ax copper cables. Results on signal integrity at 25 Gb/s and the first demonstration of 50+ Gb/s links with pluggable optics in CMS are also shown, demonstrating bit error rates below 10 –15 at a 95% confidence level. The thermal performance is measured inside an Advanced-TCA crate with acceptable thermal margins up to 200 W of chip power. Future improvements are mentioned, potentially allowing operation at up to 300 W.

Instruments & Instrumentation↗

NeuroCoreX: An Open-Source FPGA-Based Spiking Neural Network Emulator with On-Chip Learning

Spiking Neural Networks (SNNs) are computational models inspired by the event-driven communication and connectivity patterns of biological neural circuits. They enable high energy efficiency and natural support for diverse architectures ranging from layered networks to small-world and graphstructured topologies. In this work, we introduce NeuroCoreX, an open-source, FPGA-based spiking neural network emulator that provides real-time, on-chip learning and flexible network organization. NeuroCoreX supports both feedforward sensory inputs streamed directly from sensors or PCs via UART and recurrent on-chip connectivity, enabling simultaneous processing and learning from external stimuli and internal network dynamics-capabilities rarely available in existing FPGA SNN platforms. The system implements a Leaky Integrate-and-Fire (LIF) neuron model with current-based synapses and supports pair-based STDP learning on both feedforward and recurrent synapses. A lightweight Python interface enables interactive configuration, live monitoring, weight read-back, and experiment control. Importantly, NeuroCoreX is tightly integrated with the SuperNeuroMAT simulator, allowing SNN models to be transferred seamlessly from software to hardware for hardware-in-the-loop development. By combining real-time plasticity, flexible connectivity, and an open-source VHDL implementation, NeuroCoreX provides an extensible and accessible platform for neuromorphic research, algorithm-hardware co-design, and energy-efficient edge intelligence.

Gautam, Ashish [ORNL]↗

Machine-learning-aided cognitive reconfiguration for flexible-bandwidth HPC and data center networks [Invited]

This paper proposes a machine-learning (ML)-aided cognitive approach for effective bandwidth reconfiguration in optically interconnected datacenter/high-performance computing (HPC) systems. The proposed approach relies on a Hyper-X-like architecture augmented with flexible-bandwidth photonic interconnections at large scales using a hierarchical intra/inter-POD photonic switching layout. We first formulate the problem of the connectivity graph and routing scheme optimization as a mixed-integer linear programming model. A two-phase heuristic algorithm and a joint optimization approach are devised to solve the problem with low time complexity. Then, we propose an ML-based end-to-end performance estimator design to assist the network control plane with intelligent decision making for bandwidth reconfiguration. Numerical simulations using traffic distribution profiles extracted from HPC applications traces as well as random traffic matrices verify the accuracy performance of the ML design estimator ( < <#comment/> 9 % <#comment/> error) and demonstrate up to 5 × <#comment/> throughput gain from the proposed approach compared with the baseline Hyper-X network using fixed all-to-all intra/inter-portable data center interconnects.

Chen, Xiaoliang (ORCID:0000000278056237)↗

Automatic Rural Road Centerline Detection and Extraction from Aerial Images for a Forest Fire Decision Support System

To effectively manage the terrestrial firefighting fleet in a forest fire scenario, namely, to optimize its displacement in the field, it is crucial to have a well-structured and accurate mapping of rural roads. The landscape’s complexity, mainly due to severe shadows cast by the wild vegetation and trees, makes it challenging to extract rural roads based on processing aerial or satellite images, leading to heterogeneous results. This article proposes a method to improve the automatic detection of rural roads and the extraction of their centerlines from aerial images. This method has two main stages: (i) the use of a deep learning model (DeepLabV3+) for predicting rural road segments; (ii) an optimization strategy to improve the connections between predicted rural road segments, followed by a morphological approach to extract the rural road centerlines using thinning algorithms, such as those proposed by Zhang–Suen and Guo–Hall. After completing these two stages, the proposed method automatically detected and extracted rural road centerlines from complex rural environments. This is useful for developing real-time mapping applications.

Lourenço, Miguel (ORCID:0000000157673394)↗

On the structure of parallelism in a highly concurrent PDE solver

A parallel multigrid algorithm for solving elliptic partial differential equations is developed and evaluated. A V-cycle multigrid method is altered to increase the degree of parallelism. A numerical analysis of the resulting concurrent-iteration multigrid algorithm is performed; its architectural implications are considered; highly parallel systems without shared memory are examined (including mesh-connected arrays, mesh-shuffle-connected systems, permutation networks, and direct VLSI embeddings); and the results of numerical experiments are presented in tables and graphs.

Gannon, D.↗

Three dimensional mesh generation by triangulation of arbitrary point sets

A method for generating an unstructured mesh is described. The approach is quite general and joins an arbitrary set of points to produce a covering of three dimensional space by tetrahedra. After removing the tetrahedra that connect surface points, a mesh suitable for a finite element based flow solver is obtained. Details of the triangulation algorithm are provided together with an analysis of the algorithm efficiency and validity.

Baker, Timothy J.↗

Computational fluid dynamics on a massively parallel computer

A finite difference code was implemented for the compressible Navier-Stokes equations on the Connection Machine, a massively parallel computer. The code is based on the ARC2D/ARC3D program and uses the implicit factored algorithm of Beam and Warming. The codes uses odd-even elimination to solve linear systems. Timings and computation rates are given for the code, and a comparison is made with a Cray XMP.

Jespersen, Dennis C.↗

Neural-Network-Development Program

NETS, software tool for development and evaluation of neural networks, provides simulation of neural-network algorithms plus computing environment for development of such algorithms. Uses back-propagation learning method for all of networks it creates. Enables user to customize patterns of connections between layers of network. Also provides features for saving, during learning process, values of weights, providing more-precise control over learning process. Written in ANSI standard C language. Machine-independent version (MSC-21588) includes only code for command-line-interface version of NETS 3.0.

Phillips, Todd A.↗

Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations

One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations. These algorithms are now used in the practical engineering design of devices such as cars and airplanes as well as theoretical studies of complex phenomena such as fluid turbulence. In past years, limited computer resources have motivated the development of efficient numerical methods in computational fluid dynamics (CFD) utilizing structured meshes. These meshes are comprised of systematic arrays of quadrilateral or hexahedral cells. The use of structured meshes greatly simplifies the implementation of CFD algorithms on conventional computers. Structured meshes also permit the use of highly efficient solution techniques such as alternating direction implicit (ADI) iteration schemes or multigrid. Following the dramatic improvement in computing speed in recent years, emphasis has shifted towards the design of algorithms capable of treating complex geometries. The automatic generation of structured grids about complex geometries is problematic. Unstructured grids offer one promising alternative technique for treating these general geometries. Unstructured meshes have irregular connectivity and usually contain triangles and/or quadrilaterals in two dimensions and tetrahedra and/or hexahedra in three dimensions. The generation and use of unstructured grids poses new challenges in computational fluid dynamics. This is true for both grid generation as well as for the design of algorithms for flow solution. The purpose of these notes is to present recent developments in the unstructured grid generation and flow solution technology.

Barth, T. J.↗

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A sparse matrix algorithm on the Boolean vector machine

VLSI technology is being used to implement a prototype Boolean Vector Machine (BVM), which is a large network of very small processors with equally small memories that operate in SIMD mode; these use bit-serial arithmetic, and communicate via cube-connected cycles network. The BVM's bit-serial arithmetic and the small memories of individual processors are noted to compromise the system's effectiveness in large numerical problem applications. Attention is presently given to the implementation of a basic matrix-vector iteration algorithm for space matrices of the BVM, in order to generate over 1 billion useful floating-point operations/sec for this iteration algorithm. The algorithm is expressed in a novel language designated 'BVM'.

Wagner, Robert A.↗