Search NASA⌕ Search

SEARCH · Search NASA

Results for “graph problems”

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.

352 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Anonymization of Network Traces Data through Condensation-based Differential Privacy

Network traces are considered a primary source of information to researchers, who use them to investigate research problems such as identifying user behavior, analyzing network hierarchy, maintaining network security, classifying packet flows, and much more. However, most organizations are reluctant to share their data with a third party or the public due to privacy concerns. Therefore, data anonymization prior to sharing becomes a convenient solution to both organizations and researchers. Although several anonymization algorithms are available, few of them allow sufficient privacy (organization need), acceptable data utility (researcher need), and efficient data analysis at the same time. This article introduces a condensation-based differential privacy anonymization approach that achieves an improved tradeoff between privacy and utility compared to existing techniques and produces anonymized network trace data that can be shared publicly without lowering its utility value. Our solution also does not incur extra computation overhead for the data analyzer. A prototype system has been implemented, and experiments have shown that the proposed approach preserves privacy and allows data analysis without revealing the original data even when injection attacks are launched against it. When anonymized datasets are given as input to graph-based intrusion detection techniques, they yield almost identical intrusion detection rates as the original datasets with only a negligible impact.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Time Series Foundation Models and Deep Learning Architectures for Earthquake Temporal and Spatial Nowcasting

Advancing the capabilities of earthquake nowcasting, the real-time forecasting of seismic activities, remains crucial for reducing casualties. This multifaceted challenge has recently gained attention within the deep learning domain, facilitated by the availability of extensive earthquake datasets. Despite significant advancements, the existing literature on earthquake nowcasting lacks comprehensive evaluations of pre-trained foundation models and modern deep learning architectures; each focuses on a different aspect of data, such as spatial relationships, temporal patterns, and multi-scale dependencies. This paper addresses the mentioned gap by analyzing different architectures and introducing two innovative approaches called Multi Foundation Quake and GNNCoder. We formulate earthquake nowcasting as a time series forecasting problem for the next 14 days within 0.1-degree spatial bins in Southern California. Earthquake time series are generated using the logarithm energy released by quakes, spanning 1986 to 2024. Our comprehensive evaluations demonstrate that our introduced models outperform other custom architectures by effectively capturing temporal-spatial relationships inherent in seismic data. The performance of existing foundation models varies significantly based on the pre-training datasets, emphasizing the need for careful dataset selection. However, we introduce a novel method, Multi Foundation Quake, that achieves the best overall performance by combining a bespoke pattern with Foundation model results handled as auxiliary streams.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Flexible visualization of a 3rd party Intrusion Prevention (Security) tool: A use case with the ELK stack

A difficult aspect of cyber security is the ability to achieve automated real time intrusion prevention across various sets of systems. To this extent, several companies are offering comprehensive solutions that leverage an "accuracy of scale" and moving much of the intelligence and detection on the Cloud, relying on an ever-growing set of data and analytics to increase decision accuracy. Often, they provide tools to visualize the decision workflows in attack prevention (as well as tune the algorithm) but those solutions are not always practical as companies see the problem as "global" that is, from a unified Cyber-security standpoint. However, a key to a successful Cyber-security program is transparency and trust: from an experimental team viewpoint, this specifically means having the ability to immediately see what and from where, who has been blocked and being able to inform the community in case of a revoked access without the need for filing a "ticket" (that may eventually be answered) – in other words, rapid response to their user-base is essential but solutions targeting "sub-groups" in an organization are not often available. We have come up with a versatile solution leveraging the ELK stack (Elasticsearch, Logstash, & Kibana) and an IPS (Intrusion Prevention System) based WAF (Web Application Firewall) from Signal Sciences. Signal Science allows the streaming of detailed logs in a Logstash format suitable for custom solutions for visualization. By combining these two tools, we have strengthened our security posture and enabled individual experiments to monitor their own traffic. Specifically, the IPS WAF provides unique data such as country of origin, protocol, response code, source IP, and paths accessed. In this contribution, we will show how we engineered a visualization solution so experiment groups could access a dashboard with predefined graphs but also, where they can create individual customizable dashboards used to display blocked traffic and troubleshoot latency issues. We will discuss the details and procedures for developing and configuring these tools and how it benefits cyber security postures across our scientific based environment.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Retaining Systems Engineering Model Meaning Through Transformation: Demo 2

Digital engineering strategies typically assume that digital engineering models interoperate seamlessly across the multiple different engineering modeling software applications involved, such as model- based systems engineering (MBSE), mechanical computer-aided design (MCAD), electrical computer-aided design (ECAD), and other engineering modeling applications. The presumption is that the data schema in these modeling software applications are structured in the familiar flat- tabular schema like any other software application. Engineering domain-specific applications (e.g., systems, mechanical, electrical, simulation) are typically designed to solve domain-specific problems, necessarily excluding explicit representations of non-domain information to help the engineer focus on the domain problems (system definition, design, simulation). Such exclusions become problematic in inter-domain information exchange. The obvious assumptions of one domain might not be so obvious to experts in another domain. Ambiguity in domain-specific language can erode the ability to enable different domain modeling applications to interoperate, unless the underlying language is understood and used as the basis for translation from one application to another. The engineering modeling software application industry has struggled for decades to enable these applications to interoperate. Industry standards have been developed, but they have not unified the industry. Why is this? The authors assert that the industry has relied on traditional database integration methods. The basic issue prohibiting successful application integration then is that traditional database-driven integration does not consider the distinct languages of each domain. An engineering models meaning is expressed through the underlying language of that engineering domain. In essence, traditional integration methods do not retain the semantic context (meaning) of the model. The basis of this research stems from the widely held assumption that systems engineering models are (or can be) structured according to the underlying semantic ontology of the model. This assumption can be imagined from two thoughts. 1) Digital systems engineering models are often represented using graph theory (the graph of a complex systems model can contain millions of nodes and edges). When examining the nodes one at a time and following the outbound edges of each node one by one, one can end up with rudimentary statements about the model (i.e., node A relates to node B), as in a semantic graph. 2) Likewise, from the study of natural languages, a sentence can be structured into unambiguous triples of subject-predicate-object within formal and highly expressive semantic ontologies. The rudimentary statements about a systems model discerned with graph theory closely mimic the triples used in the ontologies that try to structure natural languages. In other words, a systems models semantic graph can be (or is) structured into an ontology. Additionally, it is well established in industry that through natural language processing (NLP), which provides the means to create language structures, that computers can interpret ontological graphs. Therefore, the authors hypothesized that if the integrity of the underlying semantic structure of a systems model is retained, the contextual meaning of the model is retained. By structuring system models into the triples of the underlying ontology during the transformation from one MBSE application to another, the authors have provided a proof of the concept that the meaning of a system model can be retained during transformation. The authors assert that this is the missing ingredient in effective systems model-to-model interoperability. ACKNOWLEDGEMENTS The authors would like to thank the FY19 Model Interoperability team members who provided a solid foundation for the FY20 team to leverage: John McCloud, for the work he did to guide us toward the right use of technology that will appropriately discover and manipulate ontologies. Carlos Tafoya, for the work he did to develop an application programming interface (API)/Adapter that would export ontology-based data from GENESYS. Peter Chandler, for the work he did to architect our overall integration solution, with an eye toward the future that would influence a large-scale federated production-level systems engineering digital model ecosystem.

42 ENGINEERING↗
DOE OSTI2024

Non-Electricity Based Renewable Fuels: Theory and Computation for Solar Thermochemical Hydrogen

Dominated by photovoltaics and wind, current renewable energy sources generate mostly electricity, but 80% of the global final energy consumption occurs in form of fuels. Therefore, direct solar fuel generation would be a major breakthrough for the energy transition. Solar thermochemical hydrogen (STCH) is one of the very few potential routes towards scalable renewable fuels, but currently suffers from lack of an oxide working material that could optimally perform energy conversion within the thermodynamic boundary conditions. Theory and computation can contribute in two distinct ways, through materials search and discovery, but also by providing detailed mechanistic models for specific systems so to advance our understanding of possible design strategies. To enable high-throughput materials screening, we developed a defect graph neural network (dGNN) machine learning approach,[1] which accelerates the prediction of defect formation energies by replacing the tedious density functional theory (DFT) supercell calculations for all possible defect sites. This approach enables high-throughput database screening of oxides, which was integrated with thermodynamic modeling to extract the reduction entropies as additional selection criterion for STCH. Once potential candidate materials are identified, detailed models can guide materials design by predicting performance characteristics. One challenge is to quantitatively predict thermochemical equilibria at high concentrations when the redox active defects start to interact with each other, thereby impeding the formation of additional defects. Introducing a model for the free energy of defect interaction, parametrized on the basis of DFT data, we simulated the complete STCH redox cycle for (Sr,Ce)MnO3 alloys, achieving near-quantitative agreement with experimental data.[2] The analysis of these simulations reveals how defect interactions diminish the reduction entropy and H2 yield, suggesting to include these interactions in design considerations. Finally, we revisit the popular van't Hoff method for analyzing reduction enthalpies and entropies. This method is not ideal, as it involves a temperature-dependent convolution of gas-phase and solid-state entropies, causing uncertainties in the same order of magnitude as the physical quantities of interest. To avoid this problem, we suggest a simple alternative approach which can be applied to experimental and simulated data alike.

first-principles calculations↗
DOE OSTI2024

Active learning of ternary alloy structures and energies

Abstract Machine learning models with uncertainty quantification have recently emerged as attractive tools to accelerate the navigation of catalyst design spaces in a data-efficient manner. Here, we combine active learning with a dropout graph convolutional network (dGCN) as a surrogate model to explore the complex materials space of high-entropy alloys (HEAs). We train the dGCN on the formation energies of disordered binary alloy structures in the Pd-Pt-Sn ternary alloy system and improve predictions on ternary structures by performing reduced optimization of the formation free energy, the target property that determines HEA stability, over ensembles of ternary structures constructed based on two coordinate systems: (a) a physics-informed ternary composition space, and (b) data-driven coordinates discovered by the Diffusion Maps manifold learning scheme. Both reduced optimization techniques improve predictions of the formation free energy in the ternary alloy space with a significantly reduced number of DFT calculations compared to a high-fidelity model. The physics-based scheme converges to the target property in a manner akin to a depth-first strategy, whereas the data-driven scheme appears more akin to a breadth-first approach. Both sampling schemes, coupled with our acquisition function, successfully exploit a database of DFT-calculated binary alloy structures and energies, augmented with a relatively small number of ternary alloy calculations, to identify stable ternary HEA compositions and structures. This generalized framework can be extended to incorporate more complex bulk and surface structural motifs, and the results demonstrate that significant dimensionality reduction is possible in thermodynamic sampling problems when suitable active learning schemes are employed.

Chemistry↗
DOE OSTI2024

Solid State Quantum Refrigeration Superconducting, Absorption and Measurement Based (Final Technical Report)

During this DOE grant, DE-SC0017890, in place for the past six years, all proposed research was carried out and published in peer-reviewed papers, as well as other projects that emerged during the research. In that effort the research team accomplished all proposed research, as well as many closely related research projects discovered and conceived of during the grant. These works included “Efficient Quantum Measurement Engines”, a work published in Physical Review Letters, giving a theory of quantum measurement-based engines, which uses quantum measurement as a resource. These engines are designed to efficiently convert energy from the stochastic quantum measurement process into useful work. Further publications include “Experimental Realization of a Quantum Dot Energy Harvester”, a joint theory and experimental work in collaboration with the group of Charles Smith in Cambridge, UK, as well as long time theoretical collaborators, Rafael Sánchez and Björn Sothmann. This work, featured as an Editor’s Suggestion in Physical Review Letters, realized an earlier theoretical proposal of ours, whereby two resonant tunneling quantum dots are connected to a central electronic cavity that is heated by a hot energy source. We also published “Superconducting Quantum Refrigerator: Breaking and Rejoining Cooper Pairs with Magnetic Field Cycles” a work done in collaboration with experimentalist Francesco Giazotto from ENS Pisa, Italy, which also resulted in a patent. This paper, published in Phys. Rev. Applied, advanced the concept of a cyclic fridge based on the normal/superconducting phase transition together with layered materials separated by tunnel junctions. We also completed the proposed research on a heat transistor, publishing “Thermal transistor and thermometer based on Coulomb-coupled conductors”, carried out as a collaboration between my group and theorists Splettstoesser (Lund U., Sweden), Sothmann (U. Duisburg-Essen, Germany), and Sánchez (U. Autónoma de Madrid, Spain). We carried out an analysis of a quantum coupled to a quantum point contact as a sensitive thermometer and heat transistor. We found the optimal statistical estimator for the temperature and compared it with experiments on the same type of devices. We also investigated autonomous quantum absorption refrigerators using quantum dots to cool by using a very hot thermal reservoir to drive heat between two other reservoirs. In the article “Quantifying the quantum heat contribution from a driven superconducting circuit”, we demonstrated that for a driven superconducting circuit, we showed heat flow provided by a hot source to the qubit can be switched on and off by varying external parameters, the frequency and the intensity of the driving. In the work “Stochastic thermodynamic cycles of a mesoscopic thermoelectric engine”, we reconsidered the autonomous thermoelectric heat engine in terms of underlying cycles. Rather than periodic behavior, the cycles were stochastic in nature. Nevertheless, by undertaking a graph theoretical analysis of the elementary transport processed, great quantitative and qualitative insight could be found. We also considered the quantum measurement process and showed that a quantum version of Maxwell’s demon could be related to the work extraction of a quantum system, closely related to arrow-of-time measures for quantum measurement, as described in our article “Thermodynamics of quantum measurement and Maxwell's demon's arrow of time”. This work was selected in Phys. Rev. A as an Editor’s Suggestion. A recent preprint titled “Cyclic Superconducting Quantum Refrigerators Using Guided Fluxon Propagation” accomplished an important piece of this grant: to propose a new kind of quantum refrigerator using the dynamics of fluxons in a type II superconductor. This invention envisioned a race-track type geometry where fluxons are confined. By applying a gradient of magnetic field together with electric current in a Corbino geometry, the circulating fluxons can actively cool a cold reservoir, realizing a new type of cyclic superconducting refrigerator. We also investigated the possibility of thermal control from different points of view. The application of quantum measurement to the system gives a new kind of control on the system of interest – we have pioneered this approach and shown that measurement can boost the thermal power of quantum engines as described in “Continuous measurement boosted adiabatic quantum thermal machines”. The ability to have heat flows on demand is an outstanding challenge, and we have provided new solutions to this problem in Thermal control across a chain of electronic nanocavities” for a chain of electron cavities using gating voltage control. The control methods using qubit/qubit coupling to create absorption fridges at their most fundamental level have also been developed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Local Decomposition of Hexahedral Singular Nodes into Singular Curves

Hexahedral (hex) meshing is a long studied topic in geometry processing with many challenging associated problems. Hex meshes vary from structured to unstructured depending on application or domain of interest. Fully structured meshes require that all interior mesh edges be adjacent to four hexes each. Edges failing this criteria are singular and indicate an unstructured hex mesh. Singular edges join together into singular curves that either form closed cycles, end on the mesh boundary, or end at a singular node, a complex junction of more than two singular curves. Hex meshes with more complex singular nodes tend to have more distorted elements and smaller scaled Jacobian values. In this work, we study the topology of singular nodes. We show that all eight of the most common singular nodes are decomposable into just singular curves. We further show that all singular nodes, regardless of edge valence, are locally decomposable. Finally we demonstrate these decompositions on hex meshes, thereby decreasing their distortion and converting all singular nodes into singular curves. In conclusion, with this decomposition, the enigmatic complexity of 3D singular nodes becomes effectively 2D.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Compare linear-system solver and preconditioner stacks with emphasis on GPU performance and propose phase-2 NGP solver development pathway

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind project are Nalu-Wind, which is an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, and OpenFAST, which is a whole-turbine simulation code. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. In this report we evaluated GPU-performance baselines for the linear solvers in the Trilinos and hypre solver stacks using two representative Nalu-Wind simulations: an atmospheric boundary layer precursor simulation on a structured mesh, and a fixed-wing simulation using unstructured overset meshes. Both strong-scaling and weak-scaling experiments were conducted on the OLCF supercomputer Summit and similar proxy clusters. We focused on the performance of multi-threaded Gauss-Seidel and two-stage Gauss-Seidel that are extensions of classical Gauss-Seidel; of one-reduce GMRES, a communication-reducing variant of the Krylov GMRES; and algebraic multigrid methods that incorporate the afore-mentioned methods. The team has established that AMG methods are capable of solving linear systems arising from the fixed-wing overset meshes on CPU, a critical intermediate result for ExaWind FY20 Q3 and Q4 milestones. For the fixed-wing strong-scaling study (model with 3M grid-points), the team identified that Nalu-Wind simulations with the new Trilinos and hypre solvers scale to modest GPU counts, maintaining above 70% efficiency up to 6 GPUs. However, there still remain significant bottlenecks to performance: matrix assembly (hypre), AMG setup (hypre and Trilinos) In the weak-scaling experiments (going from 0.4M to 211M gridpoints), it's shown that the solver apply phases are faster on GPUs, but that Nalu-Wind simulation times grow, primarily due to the multigrid-setup process. Finally, based on the report outcomes, we propose a linear solver path-forward for the remainder of the ExaWind project. Near term, the NREL team will continue their work on GPU-based linear-system assembly. They will also investigate how the use of alternatives to the NVIDIA UVM (unified virtual memory) paradigm affects performance. Longer term, the NREL team will evaluate algorithmic performance on other types of accelerators and merge their improvements back to the main hypre repository branch. Near term, the Trilinos team will address performance bottlenecks identified in this milestone, such as implementing a GPU-based segregated momentum solve and reusing matrix graphs across linear-system assembly phases. Longer term, the Trilinos team will do detailed analysis and optimization of multigrid setup.

17 WIND ENERGY↗
DOE OSTI2021

MCS+: An Efficient Algorithm for Crawling the Community Structure in Multiplex Networks

In this article, we consider the problem of crawling a multiplex network to identify the community structure of a layer-of-interest. A multiplex network is one where there are multiple types of relationships between the nodes. In many multiplex networks, some layers might be easier to explore (in terms of time, money etc.). We propose MCS+, an algorithm that can use the information from the easier to explore layers to help in the exploration of a layer-of-interest that is expensive to explore. We consider the goal of exploration to be generating a sample that is representative of the communities in the complete layer-of-interest. This work has practical applications in areas such as exploration of dark (e.g., criminal) networks, online social networks, biological networks, and so on. For example, in a terrorist network, relationships such as phone records, e-mail records, and so on are easier to collect; in contrast, data on the face-to-face communications are much harder to collect, but also potentially more valuable. We perform extensive experimental evaluations on real-world networks, and we observe that MCS+ consistently outperforms the best baseline—the similarity of the sample that MCS+ generates to the real network is up to three times that of the best baseline in some networks. We also perform theoretical and experimental evaluations on the scalability of MCS+ to network properties, and find that it scales well with the budget, number of layers in the multiplex network, and the average degree in the original network.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗