Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “large scale network”

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 847 records · Page 47

Wiring Viterbi decoders (splitting deBruijn graphs)

A new Viterbi decoder, capable of decoding convolutional codes with constraint lengths up to 15, is under development for the Deep Space Network (DSN). A key feature of this decoder is a two-level partitioning of the Viterbi state diagram into identical subgraphs. The larger subgraphs correspond to circuit boards, while the smaller subgraphs correspond to Very Large Scale Integration (VLSI) chips. The full decoder is built from identical boards, which in turn are built from identical chips. The resulting system is modular and hierarchical. The decoder is easy to implement, test, and repair because it uses a single VLSI chip design and a single board design. The partitioning is completely general in the sense that an appropriate number of boards or chips may be wired together to implement a Viterbi decoder of any size greater than or equal to the size of the module.

Collins, O.↗

A VLSI decomposition of the deBruijn graph

A new Viterbi decoder for convolutional codes with constraint lengths up to 15, called the Big Viterbi Decoder, is under development for the Deep Space Network. It will be demonstrated by decoding data from the Galileo spacecraft, which has a rate 1/4, constraint-length 15 convolutional encoder on board. Here, the mathematical theory underlying the design of the very-large-scale-integrated (VLSI) chips that are being used to build this decoder is explained. The deBruijn graph B sub n describes the topology of a fully parallel, rate 1/v, constraint length n+2 Viterbi decoder, and it is shown that B sub n can be built by appropriately wiring together (i.e., connecting together with extra edges) many isomorphic copies of a fixed graph called a B sub n building block. The efficiency of such a building block is defined as the fraction of the edges in B sub n that are present in the copies of the building block. It is shown, among other things, that for any alpha less than 1, there exists a graph G which is a B sub n building block of efficiency greater than alpha for all sufficiently large n. These results are illustrated by describing a special hierarchical family of deBruijn building blocks, which has led to the design of the gate-array chips being used in the Big Viterbi Decoder.

Collins, O.↗

Python & Qt, Powerful Tools for Technical Computing

The objective of this presentation is to give a brief overview of Python computer language and Qt for Python which provides an interface to Python for building graphical applications. The Qt language provides a method for rapid programming of Graphical User Interfaces (GUIs) that are highly scalable, robust and platform independent. Both Python and Qt provide a powerful set of tools for Dynamic Analysis which are based on Open-Source software. Many problems and calculations in Structural Dynamics such as Power Spectral Density, Shock Response Spectrum and Vibration Response Spectrum can be easily calculated using these tools. The advantage of using Open-Source software is the ability to create custom graphical user interfaces similar to Matlab without the expense of software licensing and the ability to customize the software to an organization's specific needs. Also, another advantage is the ability to know which algorithms are being used by the GUI, know the numerical limitations and scale to large size data sets. I will end the presentation by demonstrating a Structural Dynamics GUI I created that was designed primarily to interactively analyze Post Flight high speed data provided by the ground station telemetry networks.

Grillo, Vincent↗

Developing a Roadmap for Bio-Derivable and Recyclable Composites: Re-Design and Scale-Up Considerations

Composites, often in the form of fiber reinforced plastics, are used in multiple facets of modern life from snowboards to vehicles, to wind turbines and beyond. Despite their prolific, and often renewable energy related uses, they are currently subject to a linear material economy from emission intensive precursors; thus, there is an opportunity to re-design these materials to be both bio-derivable and recyclable. In the present work, we provide a roadmap of what application considerations must be considered for vacuum assisted resin transfer molding (VARTM) processes for large composites materials at scale (e.g. infusible viscosities, moderate cure times, proper fiber adhesion, low cost, and maximum peak exotherm) when implementing bio-derivable and recyclable materials. We also provide illustrative concepts utilizing polyester covalently adaptable networks, from epoxy-anhydride chemistry, to achieve these goals. We further provide considerations when developing recycling process (e.g. maintenance of fiber sizing and orientation) and demonstrate these practices using low temperature methanolysis. Accompanying technoeconomic and life cycle analysis further illustrate the decarbonization benefits to bio-derivable and recyclable thermosets while informing future research and recycling processes. Finally, we provide a brief introduction to synergistic work within our team exploring how to further decarbonize the manufacturing of these materials.

BIOMASS FUELS,ENERGY CONSERVATION, CONSUMPTION, AN↗

INTEX-NA: Intercontinental Chemical Transport Experiment - North America

INTEX-NA is an integrated atmospheric chemistry field experiment to be performed over North America using the NASA DC-8 and P-3B aircraft as its primary platforms. It seeks to understand the exchange of chemicals and aerosols between continents and the global troposphere. The constituents of interest are ozone and its precursors (hydrocarbons, NOX and HOX), aerosols, and the major greenhouse gases (CO2, CH4, N2O). INTEX-NA will provide the observational database needed to quantify inflow, outflow, and transformations of chemicals over North America. INTEX-NA is to be performed in two phases. Phase A will take place during the period of May-August 2004 and Phase B during March-June 2006. Phase A is in summer when photochemistry is most intense and climatic issues involving aerosols and carbon cycle are most pressing, and Phase B is in spring when Asian transport to North America is at its peak. INTEX-NA will coordinate its activities with concurrent measurement programs including satellites (e. g. Terra, Aura, Envisat), field activities undertaken by the North American Carbon Program (NACP), and other U.S. and international partners. However, it is being designed as a 'stand alone' mission such that its successful execution is not contingent on other programs. Synthesis of the ensemble of observation from surface, airborne, and space platforms, with the help of global/regional models is an important It is anticipated that approximately 175 flight hours for each of the aircraft (DC-8 and P-3B) will be required for each Phase. Principal operational sites are tentatively selected to be Bangor, ME; Wallops Island, VA; Seattle, WA; Rhinelander, WI; Lancaster, CA; and New Orleans, LA. These coastal and continental sites can support large missions and are suitable for INTEX-NA objectives. The experiment will be supported by forecasts from meteorological and chemical models, satellite observations, surface networks, and enhanced O3,-sonde releases. In addition to characterizing Atlantic-outflow and Pacific-inflow, INTEX-NA will characterize air masses transported between the U.S., Canada, and Mexico. INTEX-NA will be the first continental scale inflow, outflow, and transformation experiment to be performed over North America. It will provide the most comprehensive observational data set to date to understand the O3/NOX/HOX/aerosol photochemical system and the carbon cycle. One of the critical needs of the carbon cycle research is to obtain large-scale vertical and horizontal concentration gradients of CO2, throughout the troposphere over continental source/sink regions. INTEX-NA is ideally suited to perform this role. Coastal and continental operational sites will allow us to develop a curtain profile of greenhouse gases (e. g. CO2,) and other key pollutants across North America. Such information is central to our quantitative understanding of chemical budgets on the continental scale. We expect to provide a number of satellite under-flights over land and water to test and validate observations from the appropriate satellite platform (e. g. Aura). We plan to develop strong collaborations with other national and international observational programs. Results from INTEX-NA should directly benefit the development of environmental policy for air quality and climate change.

Singh, Hanwant B.↗

A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems

Here we present a decomposition approach for obtaining good feasible solutions for the security-constrained, alternating-current, optimal power flow (SC-AC-OPF) problem at an industrial scale and under real-world time and computational limits. The approach was designed while preparing and participating in ARPA-E’s Grid Optimization Competition (GOC) Challenge 1. The challenge focused on a near-real-time version of the SC-AC-OPF problem, where a base operating point is optimized, taking into account possible single-element contingencies, after which the system adapts its operating point following the response of automatic frequency droop controllers and voltage regulators. Our solution approach for this problem relies on state-of-the-art nonlinear programming algorithms, and it employs nonconvex relaxations for complementarity constraints, a specialized two-stage decomposition technique with sparse approximations of recourse terms and contingency ranking and prescreening. The paper describes and justifies our approach and outlines the features of its implementation, including functions and derivatives evaluation, warm-starting strategies, and asynchronous parallelism. We discuss the results of the independent benchmark of our approach by ARPA-E’s GOC team in Challenge 1, where it was found to consistently produce high-quality solutions across a wide range of network sizes and difficulty, and conclude by outlining future extensions of the approach.

97 MATHEMATICS AND COMPUTING↗

The 1982 control network of Mars

Attention is given to a planet-wide control network of Mars that was computed in September 1982 using a large single-block analytical triangulation with 47,524 measurements of 6853 control points on 1054 Mariner 9 and 757 Viking pictures. In all, 19,139 normal equations were solved, with a resulting standard error of measurement of 18.06 microns. The control points identified by name and letter designation are given, as are the aerographic coordinates of the control points. In addition, the coordinates of the Viking I lander site are given: latitude, 22.480 deg; longitude, 47.962 deg (radius, 3389.32 km). This study expands and updates the previously published network (1978). It is noted that the computation differs in many respects from standard aerial mapping photogrammetric practice. In comparison with aerial mapping photography, the television formats are small and the focal lengths are long; stereo coverage is rare, the scale of the pictures varies greatly, and the residual camera distortions are large.

Davies, M. E.↗

Towards Geospatial Knowledge Graph Infused Neuro-Symbolic AI for Remote Sensing Scene Understanding

Deep learning has proven its effectiveness in numerous tasks for remote sensing scene understanding. However there is an increasing interest to explore fusion of domain-specific background information to the deep neural network to further improve its performance. Remote sensing researchers are also working towards developing models that generalize and adapt to multiple applications. Generalization challenges coupled with the scarcity of large corpora of high-quality noise-free labelled data, have together fueled an interest for leveraging background information. Knowledge graphs serve as excellent choice to represent domain-specific information in a structured, standardized and extensible manner. Integrating symbolic knowledge representations in the form of Knowledge Graph Embedding (KGE) to perform neuro-symbolic reasoning is an emerging research direction promising significant impacts. This vision paper seeks to position ideas and provoke early thoughts toward advancing neuro-symbolic artificial intelligence in the context of geospatial challenges. Specifically, it conceptualizes and elaborates on an architecture for infusing geospatial knowledge from knowledge graph in a deep neural network pipeline. As guiding case studies - land-use land-cover classification, object detection and instance segmentation can benefit from infusing spatio-contextual information with remote sensing imagery. The discussion further reflects on and articulates the challenges and explainable AI opportunities anticipated when scaling and maintaining large-scale geospatial knowledge graphs.

Potnis, Abhishek↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

An Accurate, Error-Tolerant, and Energy-Efficient Neural Network Inference Engine Based on SONOS Analog Memory

In this work, we demonstrate SONOS (silicon-oxide-nitrideoxide- silicon) analog memory arrays that are optimized for neural network inference. The devices are fabricated in a 40nm process and operated in the subthreshold regime for in-memory matrix multiplication. Subthreshold operation enables low conductances to be implemented with low error, which matches the typical weight distribution of neural networks, which is heavily skewed toward near-zero values. This leads to high accuracy in the presence of programming errors and process variations. We simulate the end-to-end neural network inference accuracy, accounting for the measured programming error, read noise, and retention loss in a fabricated SONOS array. Evaluated on the ImageNet dataset using ResNet50, the accuracy using a SONOS system is within 2.16% of floating-point accuracy without any retraining. The unique error properties and high On/Off ratio of the SONOS device allow scaling to large arrays without bit slicing, and enable an inference architecture that achieves 20 TOPS/W on ResNet50, a >10× gain in energy efficiency over state-of-the-art digital and analog inference accelerators.

97 MATHEMATICS AND COMPUTING↗

Convolutional Neural Networks for the CHIPS Neutrino Detector R&D Project.

The CHerenkov detectors In mine PitS (Chips) neutrino detector R&D project aims to develop novel strategies and technologies for very large yet ‘cheap as chips’ water Cherenkov neutrino detectors. Via deployment in a body of water, use of commercially available components, and instrumentation coverage optimisation for the study of exclusively accelerator beam neutrinos, Chips will enable megaton scale detectors to become a reality at the cost of $200k-$300k per kt of sensitive mass. During the summer of 2019 a prototype Chips detector, Chips-5, was deployed into the Wentworth 2W disused mine pit in northern Minnesota, 7 mrad off the NuMI beam axis. A novel data acquisition system was introduced using cheap single-board computers and open-source software. This work presents a novel approach to water Cherenkov neutrino detector event reconstruction and classification. Three forms of a Convolutional Neural Network, a type of deep learning algorithm, have been trained to reject cosmic muon events, classify beam events, and estimate neutrino energies, all using only the raw detector event as input. When evaluated on the expected distribution of Chips-5 events, this new approach is shown to be robust and explainable as well as providing a significant performance increase over the standard likelihood-based reconstruction and simple neural network classification. Promisingly, the performance presented here is comparable to the more complex (and expensive) neutrino oscillation experiments within the field.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Data Federation Challenges in Remote Near-Real-Time Fusion Experiment Data Processing

Fusion energy experiments and simulations provide critical information needed to plan future fusion reactors. As next-generation devices like ITER move toward long-pulse experiments, analyses, including AI and ML, should be performed in a wide range of time and computing constraints, from near-real-time constraints, between-shot analysis, and to campaign-wide long-term analysis. However, the data volume, velocity, and variety make it extremely challenging for analyses using only local computational resources. Researchers need the ability to compose and execute workflows spanning edge resources to large-scale high-performance computing facilities.We present Delta, a system to address data analysis challenges, including AI/ML, in fusion science, by leveraging the ADIOS I/O library and middleware, to support executing science workflows over the wide area network for near-real-time streaming. We discuss the data federation challenges in performing remote workflows, focusing on on-going research work in (1) managing, reducing, and streaming data to minimize I/O and data movement overheads, (2) decompressing and reorganizing data for analysis, and (3) executing workflows for automated data analysis. We introduce examples for deep-learning based data analysis for the fusion domain and demonstrate how we use Delta to construct end-to-end workflows for a fusion device in Korea, connecting a remote DOE facility in the USA. The capability demonstrated by this project is the basis for improving the state of the art for near-real-time data federation amongst remote facilities.

Choi, Jong Youl↗

A constraint-based framework for exploring the impact of multireaction dependencies on metabolic functions

Abstract Metabolism operates under physico-chemical constraints that result in multireaction dependencies. Understanding how multireaction dependencies affect metabolic phenotypes remains challenging, hindering their biotechnological applications. Here, we propose the concept of a forcedly balanced complex that allows to efficiently determine the effects of specific multireaction dependencies on metabolic network functions in constrained-based models. Using this concept, we found that the fraction of multireaction dependencies induced by forcedly balanced complexes in genome-scale metabolic networks followed power law with exponential cut-off. We identified forcedly balanced complexes that are lethal in cancer but have little effect on growth in healthy tissue models. In addition, these forcedly balanced complexes are largely specific to models of particular cancer types. Therefore, multireaction dependencies resulting from forced balancing of complexes represent an innovative means to control cancers that, we argue, can be implemented via transporter engineering. The presented constraint-based approaches pave the way for using multireaction dependencies in metabolic engineering for diverse biotechnological applications.

Küken, Anika↗

Machine learning enabled discovery of application dependent design principles for two-dimensional materials

Abstract The unique electronic and mechanical properties of two-dimensional (2D) materials make them promising next-generation candidates for a variety of applications. Large-scale searches for high-performing 2D materials are limited to calculating descriptors with computationally demanding first-principles density functional theory. In this work, we alleviate this issue by extending and generalizing crystal graph convolutional neural networks to systems with planar periodicity and train an ensemble of models to predict thermodynamic, mechanical and electronic properties. We carry out a screening of nearly 45,000 structures for two separate applications: mechanical strength and photovoltaics. By collecting statistics of the screened candidates, we investigate structural and compositional design principles that impact the properties of the structures surveyed. Our approach recovers some well-accepted design rules: hybrid organic-inorganic perovskites with lead and tin tend to be good candidates for solar cell applications and titanium based MXenes usually have high stiffness coefficients. Interestingly, other members of the group 4 elements also contribute to increasing the mechanical strength of MXenes. For all-inorganic perovskites, we discover some compositions that have not been deeply studied in the field of photovoltaics and thus open up paths for further investigation. We open-source the code-base to spur further development in this space.

Venturi, Victor (ORCID:0000000156727549)↗

Fundamental effective temperature measurements for eclipsing binary stars – IV. Selection of new benchmark stars and first results for HD 22064

I describe the selection and initial characterization of 20 eclipsing binary stars that are suitable for calibration and testing of stellar models and data analysis algorithms used by the PLATO mission and spectroscopic surveys. The binary stars selected are F-/G-type dwarf stars with M-type dwarf companions that contribute less than 2 per cent of the flux at optical wavelengths. The light curves typically show well-defined total eclipses with very little variability between the eclipses. I have used near-infrared spectra obtained by the APOGEE survey to measure the spectroscopic orbit for both stars in HD 22064. Combined with an analysis of the TESS light curve, I derive the following masses and radii: M 1 = 1.35 ± 0.03M ⊙ , M 2 = 0.58 ± 0.01M ⊙ , R 1 = 1.554 ± 0.014R ⊙ , R 2 = 0.595 ± 0.008R ⊙ . Using R 1 and the parallax from Gaia EDR3, I find that the primary star’s angular diameter is θ = 0.1035 ± 0.0009 mas. The apparent bolometric flux of the primary star is ${\mathcal {F}}_{{\oplus },0} = (7.51\pm 0.09)\times 10^{-9}$ erg cm -2 s -1 . Hence, this F2V star has an effective temperature $T_{\rm eff,1} = 6763{\rm \, K} \pm 39{\rm \, K}$. HD 22064 is an ideal benchmark star that can be used for ‘end-to-end’ tests of the stellar parameters measured by large-scale spectroscopic surveys or stellar parameters derived from asteroseismology with PLATO. The techniques described here for HD 22064 can be applied to the other eclipsing binaries in the sample in order to create an all-sky network of such benchmark stars.

79 ASTRONOMY AND ASTROPHYSICS↗

Young but fading radio sources: searching for remnants among compact steep-spectrum radio sources

The incidence of young but fading radio sources provides important information on the life cycle of radio emission in radio-loud active galactic nuclei. Despite its importance for constraining the models of radio source evolution, there are no systematic studies of remnants in complete samples of young radio sources. We report results of the study of 18 compact steep-spectrum (CSS) radio sources, selected from the statistically complete B3-VLA (Very Large Array) CSS sample, characterized by a steep optically thin spectrum (α ≥ 1.0) and no core detection in earlier studies. Our deep multifrequency VLA, pc-scale Very Long Baseline Array, and enhanced Multi Element Remotely Linked Interferometer Network (e-MERLIN) observations allowed us to locate the core component in 10 objects. In three CSS sources, there is no clear evidence of present-time active regions, suggesting that they are likely in a remnant phase. Among sources with core detection, we find three objects that have no clear active regions (hotspots) at the edges of the radio structure, suggesting that the radio emission may have just restarted. Our results support a power-law distribution of the source ages, although the poor statistics prevents us from setting solid constraints on the percentage of remnants and restarted sources in subpopulations of radio sources.

79 ASTRONOMY AND ASTROPHYSICS↗

Simulating lossy Gaussian boson sampling with matrix-product operators

Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful supercomputers today. However, whether the current approach limited by photon loss and noise in such experiments prescribes a scalable path to quantum advantage is an open question. Here, to understand the effect of photon loss on the scalability of Gaussian boson sampling, we analytically derive the asymptotic operator entanglement entropy scaling, which relates to the simulation complexity. As a result, we observe that efficient tensor network simulations are likely possible under the N out ∝ √N scaling of the number of surviving photons N out in the number of input photons N. We numerically verify this result using a tensor network algorithm with U⁡(1) symmetry, and we overcome previous challenges due to the large local Hilbert-space dimensions in Gaussian boson sampling with hardware acceleration. Additionally, we observe that increasing the photon number through larger squeezing does not increase the entanglement entropy significantly. Finally, we numerically find the bond dimension necessary for fixed accuracy simulations, providing more direct evidence for the complexity of tensor networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

HydraGNN v5.0

HydraGNN v5.0 expands the code base into a more portable, scalable, and flexible framework for scientific graph learning, with particular strength in atomistic machine-learning interatomic potentials and large-scale distributed training. The release adds Fully Sharded Data Parallel (FSDP) support alongside existing DDP and DeepSpeed paths, including FSDP-aware checkpointing and optimizer integration, and introduces a configurable multi-precision training workflow supporting FP32, BF16, and FP64 across GPUs and Intel XPUs. For atomistic modeling, HydraGNN v5.0 strengthens its MLIP capabilities through dynamic graph construction at every forward pass, energy-conserving force prediction via automatic differentiation, and per-atom energy loss formulations, while extending EGNN models to properly handle periodic boundary conditions. The release also broadens model expressiveness through graph-level attribute conditioning, adds new multi-task and model-parallel extensions such as MACE support and encoder/decoder branch optimization, and expands application coverage with integrated examples for datasets including OC25, Nabla2-DFT, QCML, Open Polymers 2026, and OPF. In parallel, HydraGNN v5.0 improves production readiness through performance optimizations for large-scale runs, stratified sampling and linear-regression preprocessing utilities, and tested installation scripts for DOE supercomputers including Frontier, Aurora, Perlmutter, and Andes. Overall, the release advances HydraGNN as a robust software platform for scalable graph neural networks across materials science, chemistry, and scientific machine learning workflows

Lupo Pasini, Massimiliano [Oak Ridge National Labo↗