SEARCH · Search NASA
Results for “network solutions”
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.
Pressure-dependent thermodynamics of cubic Lu-H-N solid solutions by Monte Carlo simulations based on graph neural networks
Explore the source record for details and available documents.
Probing Alkylpolyglycoside Hydrogen Bonding and Its Destabilization by Sulfonate Hydrotropes with X‑ray and Vibrational Spectroscopy
It has been proposed that intersurfactant H-bonding networks can produce highly stable foams, specifically those generated from solutions containing alkylpolyglycoside surfactants. In this work, we aim to characterize the presence and destabilization of these networks by introducing a hydrotrope (sodium p-toluene sulfate) at various concentrations into an alkylpolyglycoside (Glucopon 225 DK) surfactant containing solution. Solution surface properties are probed by using aerosol velocity map imaging X-ray photoelectron spectroscopy (A-VMI-XPS) and tensiometer measurements. Bulk properties below the surface are probed using Fourier transform infrared spectroscopy (FTIR) and C-edge near-edge X-ray fine structure spectroscopy (NEXAFS). The surface measurements provide the framework to describe the destabilization of the solution H-bonding network, while the bulk solution measurements provide hints about the disruption of the hydrogen bonding network upon hydrotrope addition. The collected data support the hypothesis that the destabilization of the intersurfactant H-bonding network frees surfactant molecules from the bulk, increasing surfactant population at the air/water interface. This was quantified through an increase in peak area and width in XPS measurements as well as a decrease in surfactant critical micelle concentration. Three regimes with increasing amounts of hydrotrope addition are suggested, described as (1) a hydrotrope affecting only surfactant surface properties, (2) a hydrotrope affecting surfactant surface and bulk properties, and (3) hydrotrope-dominated surface and bulk properties. Future studies will characterize foam stability across the hydrotrope concentration regimes to better define correlations between intersurfactant H-bonding networks and foam stability.
One-shot learning for solution operators of partial differential equations
Learning and solving governing equations of a physical system, represented by partial differential equations (PDEs), from data is a central challenge in many areas of science and engineering. Traditional numerical methods can be computationally expensive for complex systems and require complete governing equations. Existing data-driven machine learning methods require large datasets to learn a surrogate solution operator, which could be impractical. Here, we propose a solution operator learning method that requires only one PDE solution, i.e., one-shot learning, along with suitable initial and boundary conditions. Leveraging the locality of derivatives, we define a local solution operator in small local domains, train it using a neural network, and use it to predict solutions of new input functions via mesh-based fixed-point iteration or meshfree neural-network based approaches. We test our method on various PDEs, complex geometries, and a practical spatial infection spread application, demonstrating its effectiveness and generalization capabilities.
T-Type Modular DC Circuit Breaker (T-Breaker) for Future DC Networks
The developed T-Type Modular DC Circuit Breaker (T-Breaker) technology offers an all-in-one solution to challenges in DC networks. This includes swift fault detection and protection, power transient stability, and power quality improvement, achieved through the utilization of wide bandgap (WBG) power semiconductors and energy storage devices. The T-Breaker not only facilitates rapid fault current detection and interruption but also implements fault current limiting through active insertion of storage devices or by operating WBG devices in the saturation region. Additionally, with the assistance of energy storage devices, potential overvoltage issues on power devices induced by control signal misalignment can be mitigated. The T-Breaker can be regulated to perform shunt current injection/absorption using the vertical arm and series voltage insertion via the horizontal arm, thereby enhancing DC system stability during voltage or load power fluctuation transients. The OSU team and Raytheon team actively worked together on designing, fabricating, assembling, and testing of two T-Breaker prototypes. The first prototype is rated at 1 kV, 500 A with half-bridge (unipolar) structure to validate the T-Breaker concept. The second prototype is rated at 20 kV, 50 A with full-bridge (bipolar) topology which can reach an efficiency of 99.977%, realize a power density of 60.2 MW/m3, and eliminate the 500-A fault current with a fault response time of around 20 µs. The prototypes show great feasibility of adopting this technology in multiple applications including electrified aircraft, super charging stations, data centers, etc.
Gross-fragmentation of meteoroids and bulk density of Geminids from photographic fireball records
The explicit solution of the drag and ablation equations of a single nonfragmenting meteoroid moving in any actual atmosphere was published several years ago. The solution yields the theoretical relation of l, the distance flown by the meteoroid in its trajectory, as a function of time, t, assuming that the height, h, is a known function of l. The photographic records of meteors and fireballs are coded by time marks, using a rotating shutter or a similar device to break the moving image. Time is, thus, the independent variable and for each time mark on a meteoroid trajector, the observed distance along the trajectory, l sub obs, as well as the double- or multiple- station photographs of the same meteoroid. Applying this solution to all available Prairie Network (PN) fireball-records, we recognized that the majority of them gave good solutions with standard deviations somewhat bigger than the intrinsic geometrical precision of the data. We also noticed that, on an average, previous methods of evaluation of the meteoroid velocities (interpolation polynomials, numerical differenciation of the observed l sub obs) used up to only several tens of percent of the intrinsic precision of the PN observational data. When residuals of these solutions, i.e. l sub obs - l sub com, were represented as a function of time for about 75 percent of solutions. The remaining 25 percent of residuals showed systematic changes with time exceeding one standard deviation. We tried to explain these systematic time course of residuals by using different meteoroids first computed theoretically and then analyzed by the same model as the natural PN fireballs were. The conclusion of these model computations is that systematic time changes of residuals in the nonfragmenting model exceeding one standard of deviation are caused by sudden gross fragmentation at one or more trajectory points. Thus, we generalized the explicit solution of the drag and ablation equations of a single nonfragmenting meteoroid by allowing for one or more points, where sudden gross fragmentation can occur. Using this generalized solution, the distances along the meteoroid trajectory can be computed for any choice of input parameters and compared with the observed distances flown by the meteoroid. For the most precise and long fireball trajectories, the least-squares solution can, thus, yield the initial velocities, the ablation coefficients, the dynamical masses, the positions of gross-fragmentation points, and the terminal mass. At a gross-fragmentation point, the ratio of the main mass to all the remaining fragments can be compared with the dynamic mass determined from our gross-fragmentation model and, thus, the meteoroid bulk density can be evaluated. We applied the gross-fragmentation model to sever PN fireballs showing time changes of residuals, and we recognized that, in all these cases, the new computed bulk densities of meteoroids resulted higher in comparison with the meteoroid densities determined with the non-gross-fragmentation model. Other aspects of the study are discussed.
Real-time sensor data validation
This report describes the status of an on-going effort to develop software capable of detecting sensor failures on rocket engines in real time. This software could be used in a rocket engine controller to prevent the erroneous shutdown of an engine due to sensor failures which would otherwise be interpreted as engine failures by the control software. The approach taken combines analytical redundancy with Bayesian belief networks to provide a solution which has well defined real-time characteristics and well-defined error rates. Analytical redundancy is a technique in which a sensor's value is predicted by using values from other sensors and known or empirically derived mathematical relations. A set of sensors and a set of relations among them form a network of cross-checks which can be used to periodically validate all of the sensors in the network. Bayesian belief networks provide a method of determining if each of the sensors in the network is valid, given the results of the cross-checks. This approach has been successfully demonstrated on the Technology Test Bed Engine at the NASA Marshall Space Flight Center. Current efforts are focused on extending the system to provide a validation capability for 100 sensors on the Space Shuttle Main Engine.
Efficient Anomaly Detection Driven By Different Machine Learning Architectures And Models
The rapid growth and ubiquitous adoption of the internet and cyber-physical systems (CPS) have fundamentally transformed modern communication, work, and human-system interactions. While networks now form the backbone of critical digital ecosystems, enabling seamless data transmission across diverse, interconnected systems, this increased connectivity also expands the attack surface, making real-time detection of network intrusions and anomalies a pressing challenge. Detecting unusual activities within network infrastructure requires advanced data traffic analysis to differentiate between legitimate and malicious interactions. Traditional approaches to network anomaly detectionâ??such as rule-based and signature-based systemsâ??often depend on predefined patterns to identify known anomalies, limiting their effectiveness against emerging, stealthy, or previously unseen threats. These conventional methods suffer from high false alarm rates and fail to adapt to the ever-evolving nature of network traffic, particularly in large-scale, decentralized environments where data volume, velocity, and variety are constantly increasing. This dissertation presents artificial intelligence (AI)-driven approaches to anomaly detection that leverage graphics processing unit (GPU)-enabled high-performance computing (HPC) platforms for processing massive network traffic data and monitoring the components of cyber-physical systems (CPS) for potentially hazardous conditions. The research advances several key contributions: (1) Designing efficient machine learning techniques for CPS condition monitoring and anomaly detection; (2) enabling federated learning (FL) frameworks that enable distributed detection while preserving data privacy and system resilience; (3) exploring graph-based methodologies combining graph neural networks (GNN) and graph machine learning (ML) approaches for the Internet of Things (IoT) and automotive network security, and (4) performing distributed edge computing optimizations that integrate FL with scalable technologies for reduced communication overhead. Through extensive experiments, these methodologies demonstrate that complex anomaly detection and condition monitoring tasks can be achieved while balancing computational efficiency and detection accuracy through fine-grained network information processing. The frameworks developed in this research establish a robust foundation for network anomaly detection, providing scalable, adaptive, and privacy-preserving solutions for safeguarding CPS and IoT networks in an increasingly interconnected digital landscape. The practical implications of these research findings are significant, as they can inform the development of next-generation network security systems and contribute to the protection of critical infrastructure against sophisticated cyber attacks.
Open solutions to distributed control in ground tracking stations
The advent of high speed local area networks has made it possible to interconnect small, powerful computers to function together as a single large computer. Today, distributed computer systems are the new paradigm for large scale computing systems. However, the communications provided by the local area network is only one part of the solution. The services and protocols used by the application programs to communicate across the network are as indispensable as the local area network. And the selection of services and protocols that do not match the system requirements will limit the capabilities, performance, and expansion of the system. Proprietary solutions are available but are usually limited to a select set of equipment. However, there are two solutions based on 'open' standards. The question that must be answered is 'which one is the best one for my job?' This paper examines a model for tracking stations and their requirements for interprocessor communications in the next century. The model and requirements are matched with the model and services provided by the five different software architectures and supporting protocol solutions. Several key services are examined in detail to determine which services and protocols most closely match the requirements for the tracking station environment. The study reveals that the protocols are tailored to the problem domains for which they were originally designed. Further, the study reveals that the process control model is the closest match to the tracking station model.
QUANT-NET Control Plane Framework (QNCP) v1.0.0
The QUANT-NET Control Plane (QNCP) provides a software framework for expressing and managing quantum network resources. It may be used to orchestrate a physical quantum testbed with real device driver implementations, or it may be used as a proving ground when developing new protocols and management functions. In practice, both approaches may be useful when undertaking research and development in emerging quantum testbeds. While a number of control systems have been developed for specific quantum platform demonstrations, an openly available and general solution for operating quantum networks has not emerged. QNCP is designed to fill this gap. The framework has been designed to provide extensible, modular capabilities that include scheduling, routing, monitoring, and pluggable protocols. A number of reference implementations in each module category have been included in the installable packages; however, the intent is that each of these modules may be extended or re-implemented to meet the needs of the particular deployment or research need. The software is currently being used in the QUANT-NET testbed project, which spans resources between LBNL and UC Berkeley Physics.
Unified Approach to Modeling and Simulation of Space Communication Networks and Systems
Network simulator software tools are often used to model the behaviors and interactions of applications, protocols, packets, and data links in terrestrial communication networks. Other software tools that model the physics, orbital dynamics, and RF characteristics of space systems have matured to allow for rapid, detailed analysis of space communication links. However, the absence of a unified toolset that integrates the two modeling approaches has encumbered the systems engineers tasked with the design, architecture, and analysis of complex space communication networks and systems. This paper presents the unified approach and describes the motivation, challenges, and our solution - the customization of the network simulator to integrate with astronautical analysis software tools for high-fidelity end-to-end simulation. Keywords space; communication; systems; networking; simulation; modeling; QualNet; STK; integration; space networks
Deciphering the Solvation Structure of Aqueous ZnCl 2 Solutions from X-ray Absorption Spectra Using the Interpretable Graph Neural Network
Machine learning (ML) provides powerful pathways for predicting spectroscopic observables from atomic structures, but its broader impact depends on making model predictions interpretable in terms of physical and chemical principles. Here, we introduce a physics-guided graph neural network (GNN) model that predicts Zn K-edge X-ray spectroscopy (XAS) spectra of aqueous ZnCl 2 solutions. Training data are generated from ab initio XAS calculations on molecular dynamics snapshots obtained using a machine learning interatomic potential. The GNN reproduces experimental spectra across concentrations from dilute (<0.1 m) to highly concentrated (30 m, “water-in-salt”) regimes and scales efficiently to large, disordered liquid systems beyond the reach of conventional ab initio approaches. Gradient-based attribution analysis reveals that the model learns physically meaningful structure-spectrum relationships. Ligand-specific attributions reflect orbital hybridization patterns and the origin of the excitations derived from the density functional theory. Bond-length attributions recover spectral shifts consistent with multiple-scattering theory. Finally, this work bridges data-driven prediction with electronic-structure theory, establishing a general paradigm for interpretable ML that links atomic structure, electronic structure, and spectroscopic observables.
The Ground Flash Fraction Retrieval Algorithm Employing Differential Evolution: Simulations and Applications
The ability to estimate the fraction of ground flashes in a set of flashes observed by a satellite lightning imager, such as the future GOES-R Geostationary Lightning Mapper (GLM), would likely improve operational and scientific applications (e.g., severe weather warnings, lightning nitrogen oxides studies, and global electric circuit analyses). A Bayesian inversion method, called the Ground Flash Fraction Retrieval Algorithm (GoFFRA), was recently developed for estimating the ground flash fraction. The method uses a constrained mixed exponential distribution model to describe a particular lightning optical measurement called the Maximum Group Area (MGA). To obtain the optimum model parameters (one of which is the desired ground flash fraction), a scalar function must be minimized. This minimization is difficult because of two problems: (1) Label Switching (LS), and (2) Parameter Identity Theft (PIT). The LS problem is well known in the literature on mixed exponential distributions, and the PIT problem was discovered in this study. Each problem occurs when one allows the numerical minimizer to freely roam through the parameter search space; this allows certain solution parameters to interchange roles which leads to fundamental ambiguities, and solution error. A major accomplishment of this study is that we have employed a state-of-the-art genetic-based global optimization algorithm called Differential Evolution (DE) that constrains the parameter search in such a way as to remove both the LS and PIT problems. To test the performance of the GoFFRA when DE is employed, we applied it to analyze simulated MGA datasets that we generated from known mixed exponential distributions. Moreover, we evaluated the GoFFRA/DE method by applying it to analyze actual MGAs derived from low-Earth orbiting lightning imaging sensor data; the actual MGA data were classified as either ground or cloud flash MGAs using National Lightning Detection Network[TM] (NLDN) data. Solution error plots are provided for both the simulations and actual data analyses.
The BBC network radio time and frequency standard and its role in the provision of the Greenwich time signal
The British Broadcasting Corporation (BBC) has broadcast the Greenwich Time Signal (GTS) on its networks since 1924. Up to February 1990 this signal was generated by the Royal Greenwich Observatory (RGO) in England. The BBC was informed that the RGO was moving its location to Cambridge and might not be able to continue to provide the Greenwich Time Service. The BBC in its role of a public service broadcaster believed that a long tradition of providing a time signal to its listeners should be upheld, and as such decided to seek alternative methods of provision. In parallel with this activity, an in-house requirement arose to re-engineer time switch equipment and provide new facilities for digital audio projects. As both requirements have a common engineering core, a decision was taken to design and procure a Time and Frequency Standard that could generate the Greenwich Time Signal to the same specification adhered to by the RGO, and provide additional time and frequency facilities. The concept of time and time/frequency dissemination as used in a broadcast network is discussed, as well as the details of an engineering solution to the requirements of BBC Network Radio.
At-Least Version of the Generalized Minimum Spanning Tree Problem: Optimization Through Ant Colony System and Genetic Algorithms
The At-Least version of the Generalized Minimum Spanning Tree Problem (L-GMST) is a problem in which the optimal solution connects all defined clusters of nodes in a given network at a minimum cost. The L-GMST is NPHard; therefore, metaheuristic algorithms have been used to find reasonable solutions to the problem as opposed to computationally feasible exact algorithms, which many believe do not exist for such a problem. One such metaheuristic uses a swarm-intelligent Ant Colony System (ACS) algorithm, in which agents converge on a solution through the weighing of local heuristics, such as the shortest available path and the number of agents that recently used a given path. However, in a network using a solution derived from the ACS algorithm, some nodes may move around to different clusters and cause small changes in the network makeup. Rerunning the algorithm from the start would be somewhat inefficient due to the significance of the changes, so a genetic algorithm based on the top few solutions found in the ACS algorithm is proposed to quickly and efficiently adapt the network to these small changes.
Access Control of Web- and Java-Based Applications
Cybersecurity has become a great concern as threats of service interruption, unauthorized access, stealing and altering of information, and spreading of viruses have become more prevalent and serious. Application layer access control of applications is a critical component in the overall security solution that also includes encryption, firewalls, virtual private networks, antivirus, and intrusion detection. An access control solution, based on an open-source access manager augmented with custom software components, was developed to provide protection to both Web-based and Javabased client and server applications. The DISA Security Service (DISA-SS) provides common access control capabilities for AMMOS software applications through a set of application programming interfaces (APIs) and network- accessible security services for authentication, single sign-on, authorization checking, and authorization policy management. The OpenAM access management technology designed for Web applications can be extended to meet the needs of Java thick clients and stand alone servers that are commonly used in the JPL AMMOS environment. The DISA-SS reusable components have greatly reduced the effort for each AMMOS subsystem to develop its own access control strategy. The novelty of this work is that it leverages an open-source access management product that was designed for Webbased applications to provide access control for Java thick clients and Java standalone servers. Thick clients and standalone servers are still commonly used in businesses and government, especially for applications that require rich graphical user interfaces and high-performance visualization that cannot be met by thin clients running on Web browsers
Physics-constrained machine learning for electrodynamics without gauge ambiguity based on Fourier transformed Maxwell’s equations
We utilize a Fourier transformation-based representation of Maxwell’s equations to develop physics-constrained neural networks for electrodynamics without gauge ambiguity, which we label the Fourier–Helmholtz–Maxwell neural operator method. In this approach, both of Gauss’s laws and Faraday’s law are built in as hard constraints, as well as the longitudinal component of Ampère–Maxwell in Fourier space, assuming the continuity equation. An encoder–decoder network acts as a solution operator for the transverse components of the Fourier transformed vector potential, $\hat{A}_⟂(k,t)$, whose two degrees of freedom are used to predict the electromagnetic fields. This method was tested on two electron beam simulations. Among the models investigated, it was found that a U-Net architecture exhibited the best performance as it trained quicker, was more accurate and generalized better than the other architectures examined. We demonstrate that our approach is useful for solving Maxwell’s equations for the electromagnetic fields generated by intense relativistic charged particle beams and that it generalizes well to unseen test data, while being orders of magnitude quicker than conventional simulations. We show that the model can be re-trained to make highly accurate predictions in as few as 20 epochs on a previously unseen data set.
High speed all-optical networks
An inherent problem of conventional point-to-point WAN architectures is that they cannot translate optical transmission bandwidth into comparable user available throughput due to the limiting electronic processing speed of the switching nodes. This report presents the first solution to WDM based WAN networks that overcomes this limitation. The proposed Lightnet architecture takes into account the idiosyncrasies of WDM switching/transmission leading to an efficient and pragmatic solution. The Lightnet architecture trades the ample WDM bandwidth for a reduction in the number of processing stages and a simplification of each switching stage, leading to drastically increased effective network throughputs.