Search NASA⌕ Search

SEARCH · Search NASA

Results for “High Performance Networking”

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,441 records · Page 80

Fed-DeepONet: Stochastic Gradient-Based Federated Training of Deep Operator Networks

The Deep Operator Network (DeepONet) framework is a different class of neural network architecture that one trains to learn nonlinear operators, i.e., mappings between infinite-dimensional spaces. Traditionally, DeepONets are trained using a centralized strategy that requires transferring the training data to a centralized location. Such a strategy, however, limits our ability to secure data privacy or use high-performance distributed/parallel computing platforms. To alleviate such limitations, in this paper, we study the federated training of DeepONets for the first time. That is, we develop a framework, which we refer to as Fed-DeepONet, that allows multiple clients to train DeepONets collaboratively under the coordination of a centralized server. To achieve Fed-DeepONets, we propose an efficient stochastic gradient-based algorithm that enables the distributed optimization of the DeepONet parameters by averaging first-order estimates of the DeepONet loss gradient. Then, to accelerate the training convergence of Fed-DeepONets, we propose a moment-enhanced (i.e., adaptive) stochastic gradient-based strategy. Finally, we verify the performance of Fed-DeepONet by learning, for different configurations of the number of clients and fractions of available clients, (i) the solution operator of a gravity pendulum and (ii) the dynamic response of a parametric library of pendulums.

Moya, Christian↗

Network support for system initiated checkpoints

A system, method and computer program product for supporting system initiated checkpoints in parallel computing systems. The system and method generates selective control signals to perform checkpointing of system related data in presence of messaging activity associated with a user application running at the node. The checkpointing is initiated by the system such that checkpoint data of a plurality of network nodes may be obtained even in the presence of user applications running on highly parallel computers that include ongoing user messaging activity.

97 MATHEMATICS AND COMPUTING↗

Network support for system initiated checkpoints

A system, method and computer program product for supporting system initiated checkpoints in parallel computing systems. The system and method generates selective control signals to perform checkpointing of system related data in presence of messaging activity associated with a user application running at the node. The checkpointing is initiated by the system such that checkpoint data of a plurality of network nodes may be obtained even in the presence of user applications running on highly parallel computers that include ongoing user messaging activity.

Chen, Dong↗

Alignment of the 12 Gev CEBAF Accelerator

Alignment of the 12 Gev CEBAF Accelerator Jefferson lab has just completed an upgrade to its CEBAF accelerator which allows for an increase in the energy of delivered beam from 6Gev to 12 Gev. The enhancements to the accelerator have included the addition of 10 new high performance cryomodules, and the removal, upgrade and refurbishment of almost 300 existing transport magnets. Outside of the main accelerator, a new experimental hall has been constructed, and the three existing halls are currently being upgraded to take advantage of the higher energies. For this project, a new survey network has been measured and almost every element in the accelerator has been re-aligned. Commissioning of the accelerator took place at the beginning of this year, during the course of which, it became apparent that there was a significant difference between the expected and the actual path length in the machine. This paper describes the measurements taken and analysis used to try and understand this situation.

Curtis, Christopher↗

Evaluating Safety with Automated Vehicles at Signalized Intersections: Application of Adaptive Cruise Control in Mixed Traffic

Automated Vehicles (AV) can potentially improve the performance of transportation system by reducing human errors and enhancing mobility and safety. In lower levels of automation, humans are still controlling the vehicle and receiving some advisory information regarding their surrounding environment. This paper investigates the safety impact of low and high levels of AVs, and their interaction with conventional human-driven vehicles at intersections. In order to enhance our understanding of the future interactions between conventional vehicles with AVs, we developed a framework to simulate the mixed traffic environment. Different market penetration scenarios are simulated using VENTOS (VEhicular NeTwork Open Simulator) software. A modified Wiedemann car-following model was calibrated to represent the behavior of human drivers of both conventional and low-level AVs, while an Adaptive Cruise Control model was used to represent high-level AVs. Notably, this study investigates purely the automation improvement in the system. We modified the acceleration and deceleration regimes of the Wiedemann model and tuned it by harnessing real-world connected vehicle data. Next, the simulation was calibrated utilizing two measures of driving volatility to ensure it closely represents the volatility measures of the real-world data. To evaluate the safety performance of a representative intersection under different scenarios, the number of longitudinal conflicts and driving volatility are used as surrogate safety indicators. The results reveal that increase in market penetration rate of LAVs and HAVs substantially improves intersection safety performance by reducing the number of conflicts and driving volatility.

Arvin, Ramin↗

Evaluating Automated Face Identity-Masking Methods with Human Perception and a Deep Convolutional Neural Network

Face de-identification (or “masking”) algorithms have been developed in response to the prevalent use of video recordings in public places. Here, we evaluated the success of face identity masking for human perceivers and a deep convolutional neural network (DCNN). Eight de-identification algorithms were applied to videos of drivers’ faces, while they actively operated a motor vehicle. These masks were pre-selected to be applicable to low-quality video and to maintain coarse information about facial actions. Humans studied high-resolution images to learn driver identities and were tested on their recognition of active drivers in low-resolution videos. Faces in the videos were either unmasked or were masked by one of the eight algorithms. When participants were tested immediately after learning (Experiment 1), all masks reduced identification, with six of eight masks reducing identification to extremely poor performance. In a second experiment, two of the most effective masks were tested after a delay of 7 or 28 days. The delay did not further reduce identification of the masked faces. In all masked conditions, participants maintained stringent decision criteria, with low confidence in recognition, further indicating the effectiveness of the masks. Next, the DCNN performed an identity-matching task between high-resolution images and masked videos—a task analogous to that done by humans. The pattern of accuracy for the DCNN mirrored some, but not all, aspects of human performance, highlighting the need to test the effectiveness of identity masking for both humans and machines. The DCNN was also tested on its ability to match identity between masked and unmasked versions of the same video, based only on the face. DCNN performance for the eight masks offers insight into the nature of the information in faces that is coded in these networks.

97 MATHEMATICS AND COMPUTING↗

Exploring Physics of Ferroelectric Domain Walls in Real Time: Deep Learning Enabled Scanning Probe Microscopy

The functionality of ferroelastic domain walls in ferroelectric materials is explored in real-time via the in situ implementation of computer vision algorithms in scanning probe microscopy (SPM) experiment. The robust deep convolutional neural network (DCNN) is implemented based on a deep residual learning framework (Res) and holistically nested edge detection (Hed), and ensembled to minimize the out-of-distribution drift effects. The DCNN is implemented for real-time operations on SPM, converting the data stream into the semantically segmented image of domain walls and the corresponding uncertainty. Further the pre-defined experimental workflows perform piezoresponse spectroscopy measurement on thus discovered domain walls, and alternating high- and low-polarization dynamic (out-of-plane) ferroelastic domain walls in a PbTiO 3 (PTO) thin film and high polarization dynamic (out-of-plane) at short ferroelastic walls (compared with long ferroelastic walls) in a lead zirconate titanate (PZT) thin film is reported. This work establishes the framework for real-time DCNN analysis of data streams in scanning probe and other microscopies and highlights the role of out-of-distribution effects and strategies to ameliorate them in real time analytics.

36 MATERIALS SCIENCE↗

Can artificial intelligence and data-driven machine learning models match or even replace process-driven hydrologic models for streamflow simulation?: A case study of four watersheds with different hydro-climatic regions across the CONUS

With recent developments in computational techniques, Data-driven Machine Learning Models (DMLs) have shown great potential in simulating streamflow and capturing the rainfall-runoff relationship in given watersheds, which are traditionally fulfilled by Process-based Hydrologic Models (PHMs). There are debates on whether the DMLs can outperform and possibly replace the classical PHMs for streamflow simulation and river forecasting, but no clear conclusions have been made. This study aims to investigate whether the newer DMLs have any potential in further improving the simulation accuracy of classical PHMs, and vice versa. To do this, we compared a few popular PHMs and DMLs over four watersheds across the Continental US (CONUS) that are associated with different input, climate, and regional conditions. A total of five hydrologic models were chosen, including (1) two classical lumped models, i.e., the Sacramento Soil Moisture Accounting (SAC-SMA) and Xinanjiang (XAJ); (2) one modern distributed model, termed Coupled Routing and Excess Storage (CREST); (3) and two DMLs including an Artificial Neural Networks (ANN) and a deep learning model, termed Long Short Term Memory (LSTM). Our results demonstrated that the DMLs still significantly biased when using the baseline input scenario with the PHMs. However, the DMLs fed with delayed input scenarios had great potential and can reach high simulation accuracy. The DMLs, especially the ANN, outperformed other employed models under the rainfall-runoff relationship in which rainfall dominantly drives. Furthermore, the DMLs also showed better performance in the high-flow regime, while the PHMs had a better performance for the low-flow regime, implying both PHMs and DMLs have their own merits and are worthy of joint development. In general, our study indicated a great potential of using DMLs to simulate streamflow, but further studies are still needed to verify the transferability and scalability of DMLs in large-scale experiments, such as the Distributed Model Intercomparison Projects 1&2 conducted by National Weather Services but to compare modern DMLs and PHMs.

58 GEOSCIENCES↗

Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks

Physics-Informed Neural Networks (PINNs) have revolutionized the computation of PDE solutions by integrating partial differential equations (PDEs) into the neural network’s training process as soft constraints, becoming an important component of the scientific machine learning (SciML) ecosystem. More recently, physics-informed Kolmogorv-Arnold networks (PIKANs) have also shown to be effective and comparable in accuracy with PINNs. In their current implementation, both PINNs and PIKANs are mainly optimized using first-order methods like Adam, as well as quasi-Newton methods such as BFGS and its low-memory variant, L-BFGS. However, these optimizers often struggle with highly nonlinear and non-convex loss landscapes, leading to challenges such as slow convergence, local minima entrapment, and (non)degenerate saddle points. In this study, we investigate the performance of Self- Scaled BFGS (SSBFGS), Self-Scaled Broyden (SSBroyden) methods and other advanced quasi-Newton schemes, including BFGS and L-BFGS with different line search strategies. These methods dynamically rescale updates based on historical gradient information, thus enhancing training efficiency and accuracy. We systematically compare these optimizers – using both PINNs and PIKANs – on key challenging PDEs, including the Burgers, Allen-Cahn, Kuramoto-Sivashinsky, Ginzburg-Landau, and Stokes equations. Additionally, we evaluate the performance of SSBFGS and SSBroyden for Deep Operator Network (DeepONet) architectures, demonstrating their effectiveness for data-driven operator learning. Our findings provide state-of-the-art results with orders-of-magnitude accuracy improvements without the use of adaptive weights or any other enhancements typically employed in PINNs. More broadly, our work reveal insights into the effectiveness of quasi-Newton optimization strategies in significantly improving the convergence and accurate generalization of PINNs and PIKANs.

97 MATHEMATICS AND COMPUTING↗

CMS Computing Resources: Meeting the demands of the high-luminosity LHC physics program

The high-luminosity program has seen numerous extrapolations of its needed computing resources that each indicate the need for substantial changes if the desired HL-LHC physics program is to be supported within the current level of computing resource budgets. Drivers include large increases in event complexity (leading to increased processing time and analysis data size) and trigger rates needed (5-10 fold increases) for the HL-LHC program. The CMS experiment has recently undertaken an effort to merge the ideas behind short-term and long-term resource models in order to make easier and more reliable extrapolations to future needs. Near term computing resource estimation requirements depend on numerous parameters: LHC uptime and beam intensities; detector and online trigger performance; software performance; analysis data requirements; data access, management, and retention policies; site characteristics; and network performance. Longer term modeling is affected by the same characteristics, but with much larger uncertainties that must be considered to understand the most interesting handles for increasing the "physics per computing dollar" of the HL-LHC. In this presentation, we discuss the current status of long term modeling of the CMS computing resource needs for HL-LHC with emphasis on techniques for extrapolations, uncertainty quantification, and model results. We illustrate potential ways that high-luminosity CMS could accomplish its desired physics program within today's computing budgets.

97 MATHEMATICS AND COMPUTING↗

Automated Segmentation of Twin Boundaries in TRISO Silicon Carbide Using Deep Neural Networks

Coated particle fuels, such as the tristructural isotropic (TRISO) fuel particle, are essential for high-temperature gas reactor (HTGR) applications due to their efficiency and stability under normal and off-normal conditions. However, widespread commercialization and deployment of this technology for next-generation nuclear applications require robust quality assurance and quality control (QA/QC) methods linking fabrication, properties, and performance. Of the many important metrics for TRISO QA/QC, quantification of the silicon carbide (SiC) microstructure is critical because it correlates with fission product retention during irradiation. Previous work has shown extensive twinning of the SiC microstructure, which strongly affects microstructural metrics; however, twin grain boundaries are not expected play a significant role in fission product diffusion. This report summarizes the initial development, training, and testing of a machine learning image processing algorithm to detect twin grain boundaries in a backscattered electron image, which can be removed so that microstructural metrics can be recalculated for legacy data. Further development and deployment of this model will provide automated, scalable improvement of potential QA/QC methods for the SiC layer of TRISO particles.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Reinforced double-threaded slide-ring networks for accelerated hydrogel discovery and 3D printing

Traditionally, slide-ring gels are stretchable but soft as a result of an elasticity-stretchability trade-off. Herein, we introduce a new approach to breaking this trade-off and creating reinforced slide-ring networks with mobile crosslinkers. Our approach involves the construction of a polyethylene glycol double-threaded γ-cyclodextrin-based pro-slide-ring crosslinker that serves as a modular component for 3D printing and copolymerization. The resulting crystalline-domain-reinforced slide-ring hydrogels, or CrysDoS-gels, exhibit both high elasticity and high stretchability. The modular synthesis allows for high-throughput synthesis of CrysDoS-gels, generating a large amount of data for structure-property analysis. Here, by employing data science techniques, such as machine learning and linear regression, not only were we able to identify which chemical components influence the mechanical properties of CrysDoS-gels, but this analysis also aided in the discovery of better-performing CrysDoS-gels. Finally, we demonstrate the potential application of the newly discovered CrysDoS-gels as sensing devices by 3D printing them as stress sensors with high sensitivity and a broad detection range.

3D-printing↗

ThunderSecure: deploying real-time intrusion detection for 100G research networks by leveraging stream-based features and one-class classification network

Nowadays, data generated by large-scale scientific experiments are on the scale of petabytes per month. These data are transferred through dedicated high-bandwidth networks (40/100G) across distributed sites for processing, storage, and analysis. Like general purpose networks, research networks experience intrusions. However, monitoring anomalies in such high-speed network traffics is challenging given current cyber-infrastructure. Moreover, traditional network intrusion detection systems (NIDS) are signature based. However, anomaly patterns are difficult to define and that rulesets are often not updated frequently enough to reflect the changes of attack behaviors. We present ThunderSecure, a high-throughput, unsupervised learning-based intrusions detection system for 100G research networks. ThunderSecure implements an efficient packet processing and detection pipeline using multi-cores and GPUs. It extracts statistical and temporal features from real-time network data streams and feeds them to a one-class anomaly detection network. A baseline of normal distribution will be created based on the training observation. Testing traffic deviated from the learned profile will be marked as anomalies. We trained ThunderSecure on hundreds of billions of science data packets mirrored from two 100G network connections at Fermi National Accelerator Laboratory. The detection performance was evaluated on traffic captured from the same research network days and weeks after the training with different types of attack flows injected. Results show that ThunderSecure can recognize science data traffic captured long after the training and made nearly certain detection on the segment of the streams where anomalous flows were injected.

100G research network↗

Microseismic Monitoring of Laboratory Hydraulic Fracturing Experiments in Granitic Rocks for Different Fracture Propagation Regimes

While hydraulic fracturing (HF) is a widely employed process, the underlying fracturing processes are still heavily contested. The attributes of the HF generated fracture network can exhibit substantial variation when dealing with specific HF propagation regimes encountered in the field. In this study, HF experiments were performed on true-triaxially loaded Barre granite cubes, with microseismic monitoring, to identify and characterize the fracturing mechanisms associated with different viscosity injection fluids. Utilizing fluids with high (oil/1450 cP) and low (water/1 cP) viscosity represented two key HF propagation regimes: viscosity- and toughness-dominated. The experiments conducted with oil involved higher breakdown pressures, larger fluid volumes, and slower fracture propagation speeds. Furthermore, the frequency–magnitude distribution (b value) for all experiments (1.9–2.3) was similar to those encountered for large-scale operations. Slightly larger b values were encountered during the initiation phase (2.4–2.7) relative to the fracture propagation and post-fracturing phases (1.9–2.2). Techniques such as polarity and moment-tensor inversion were utilized to characterize the source mechanisms. For the HF experiments with oil, tensile fractures were most dominant (92%) in the initiation phase compared to fracture propagation and post-fracturing phases (70–75%). Similar tensile fracturing dominancy was not observed with water, attributable to fluid permeation and leak-off. Regardless of the injection fluid or classification criteria employed, tensile fractures were the dominant type consistently, with fewer occurring in water experiments but the specific ratio of crack types varied with different source mechanism criteria employed.

58 GEOSCIENCES↗

Physics vs structure: A systematic benchmark of learning strategies for multi-zone building thermal dynamics

Recent advances in physics-informed and data-driven machine learning promise improved thermal models for advanced building control, yet there is limited quantitative evidence on when added physics structure and architectural complexity are beneficial. Here, this work presents a systematic benchmark of five representative system identification methods for modeling multi-zone building thermal dynamics: linear state-space models, multi-layer perceptrons, neural state-space models, neural ordinary differential equations, and physically-consistent neural networks. The methods are evaluated across multiple data regimes and zone coupling strategies. Using a high-fidelity multi-zone commercial building emulator, we examine short-term and long-term prediction accuracy, computational efficiency, and ease of development. Our results reveal critical trade-offs between prediction performance, model complexity, and physical consistency. We demonstrate that decoupled, nonlinear black-box models consistently outperform coupled physics-constrained architectures in both predictive accuracy and out-of-distribution robustness in majority of the test cases for the building type considered in the study. Our findings quantify the cost of complexity in building thermal modeling and provide concrete, actionable, scenario-based guidelines for selecting model classes for control-oriented applications.

Building thermal modeling↗

Performance evaluation of automated data-driven feature extraction and selection methods for practical and scalable building energy consumption prediction models

Here, this study quantifies the impact of automated feature engineering methods (feature extraction and selection) on the quality and accuracy of machine learning models that predict building energy consumption. The case study compares model performance for three main scenarios: baseline (no feature extraction and selection), feature extraction only, and feature extraction combined with feature selection (filter and/or wrapper methods) for fully trained machine learning models for 200 metered/sub-metered energy measurements across 118 real buildings. For consistency, the same machine learning model architecture (a black box deep learning neural network with probabilistic forecast output) was used for all scenarios. Based on results, all feature engineering methods provided noticeable prediction accuracy improvements (e.g., 29%-68% median prediction improvement) compared to baseline scenarios. However, in this application, feature selection methods provide little practical value due to their limited performance gains and high computational cost. Smarter algorithm development supported by better computational environments will be needed before feature selection methods can reliably and efficiently improve predictive model performance.

97 MATHEMATICS AND COMPUTING↗

Search for pair-production of vector-like quarks in pp collision events at s = 13 TeV with at least one leptonically decaying Z boson and a third-generation quark with the ATLAS detector

Herein a search for the pair-production of vector-like quarks optimized for decays into a Z boson and a third-generation Standard Model quark is presented, using the full Run 2 dataset corresponding to 139fb –1 of pp collisions at $\sqrt{s}$ = 13TeV, collected in 2015–2018 with the ATLAS detector at the Large Hadron Collider. The targeted final state is characterized by the presence of a Z boson with high transverse momentum, reconstructed from a pair of same-flavour leptons with opposite-sign charges, as well as by the presence of b-tagged jets and high-transverse-momentum large-radius jets reconstructed from calibrated smaller-radius jets. Events with exactly two or at least three leptons are used, which are further categorized by the presence of boosted W, Z, and Higgs bosons and top quarks. The categorization is performed using a neural-network-based boosted object tagger to enhance the sensitivity to signal relative to the background. No significant excess above the background expectation is observed and exclusion limits at 95% confidence level are set on the masses of the vector-like partners T and B of the top and bottom quarks, respectively. The limits depend on the branching ratio configurations and, in the case of 100% branching ratio for T→Zt and 100% branching ratio for B→Zb, this search sets the most stringent limits to date, allowing m T >1.60TeV and m B >1.42TeV, respectively.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗