Search NASA⌕ Search

SEARCH · Search NASA

Results for “Complex Network Data”

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 973 records · Page 54

Experiments on neural network architectures for fuzzy logic

The use of fuzzy logic to model and manage uncertainty in a rule-based system places high computational demands on an inference engine. In an earlier paper, the authors introduced a trainable neural network structure for fuzzy logic. These networks can learn and extrapolate complex relationships between possibility distributions for the antecedents and consequents in the rules. Here, the power of these networks is further explored. The insensitivity of the output to noisy input distributions (which are likely if the clauses are generated from real data) is demonstrated as well as the ability of the networks to internalize multiple conjunctive clause and disjunctive clause rules. Since different rules with the same variables can be encoded in a single network, this approach to fuzzy logic inference provides a natural mechanism for rule conflict resolution.

Keller, James M.↗

Techniques and resources for storm-scale numerical weather prediction

The topics discussed include the following: multiscale application of the 5th-generation PSU/NCAR mesoscale model, the coupling of nonhydrostatic atmospheric and hydrostatic ocean models for air-sea interaction studies; a numerical simulation of cloud formation over complex topography; adaptive grid simulations of convection; an unstructured grid, nonhydrostatic meso/cloud scale model; efficient mesoscale modeling for multiple scales using variable resolution; initialization of cloud-scale models with Doppler radar data; and making effective use of future computing architectures, networks, and visualization software.

Droegemeier, Kelvin↗

Satellite-Based Investigations of the Transition from an Oceanic to Continental Transform Margin

Detailed characterization of neotectonics evolution of the Valle de San Felipe and Arroyo Grande regions in northern Baja California. Reoccupied GEOMEX GPS sites, and occupied a regional GPS (Global Positioning System) network. The Baja California peninsula in Mexico offers a unique setting for studying the kinematic evolution of a complex, active strike-slip/rift plate boundary. We are currently conducting remote sensing, geologic, and geodetic studies of this boundary. The combined data sets will yield instantaneous and time integrated views of its evolution. This proposal solicits renewed funding from NASA to support remote sensing and geologic studies. During the late Cenozoic, Baja California has been the locus of changing fault geometry that has accommodated components of the relative motion between the North America and Pacific plates. Contemporary slip between the two plates occurs in a broad zone that encompasses much of southern California and the Baja California Peninsula. The transfer of slip across this zone in southern California is relatively well understood. South of the border, the geometry and role of specific faults and structural provinces in transferring plate margin deformation across the peninsula is enigmatic. Results We use Landsat Thematic Mapper imagery of the Baja California Peninsula to identify recent and active faults, and then conduct field studies that characterize the temporal and spatial structural evolution of the plate margin. These data address questions concerning the neotectonic development of the Gulf of California, the Baja California Peninsula, and their role in evolution of the post-Miocene Pacific - North American plate boundary. Moreover, these studies provide constraints on the geometry of active faults, allowing more exact understanding of the results of ongoing NASA-supported geodetic experiments. In addition, anticipated publication of the TM scenes will provide a widely available geological data base for relatively little-known peninsula California. Achievements include development of an ArcInfo data base of Landsat and SPOT imagery, detailed field studies of Neogene structures in northeastern Baja California, and new constraint on Pacific - North America plate motion at Baja California latitudes. These results are reported in maps, manuscripts and data products which are published or near completion.

Miller, M. Meghan↗

DCS-Neural-Network Program for Aircraft Control and Testing

A computer program implements a dynamic-cell-structure (DCS) artificial neural network that can perform such tasks as learning selected aerodynamic characteristics of an airplane from wind-tunnel test data and computing real-time stability and control derivatives of the airplane for use in feedback linearized control. A DCS neural network is one of several types of neural networks that can incorporate additional nodes in order to rapidly learn increasingly complex relationships between inputs and outputs. In the DCS neural network implemented by the present program, the insertion of nodes is based on accumulated error. A competitive Hebbian learning rule (a supervised-learning rule in which connection weights are adjusted to minimize differences between actual and desired outputs for training examples) is used. A Kohonen-style learning rule (derived from a relatively simple training algorithm, implements a Delaunay triangulation layout of neurons) is used to adjust node positions during training. Neighborhood topology determines which nodes are used to estimate new values. The network learns, starting with two nodes, and adds new nodes sequentially in locations chosen to maximize reductions in global error. At any given time during learning, the error becomes homogeneously distributed over all nodes.

Jorgensen, Charles C.↗

Systems and methods for rapid processing and storage of data

Systems and methods of building massively parallel computing systems using low power computing complexes in accordance with embodiments of the invention are disclosed. A massively parallel computing system in accordance with one embodiment of the invention includes at least one Solid State Blade configured to communicate via a high performance network fabric. In addition, each Solid State Blade includes a processor configured to communicate with a plurality of low power computing complexes interconnected by a router, and each low power computing complex includes at least one general processing core, an accelerator, an I/O interface, and cache memory and is configured to communicate with non-volatile solid state memory.

97 MATHEMATICS AND COMPUTING↗

Systems and methods for rapid processing and storage of data

Systems and methods of building massively parallel computing systems using low power computing complexes in accordance with embodiments of the invention are disclosed. A massively parallel computing system in accordance with one embodiment of the invention includes at least one Solid State Blade configured to communicate via a high performance network fabric. In addition, each Solid State Blade includes a processor configured to communicate with a plurality of low power computing complexes interconnected by a router, and each low power computing complex includes at least one general processing core, an accelerator, an I/O interface, and cache memory and is configured to communicate with non-volatile solid state memory.

Stalzer, Mark A.↗

Systems and methods for rapid processing and storage of data

Systems and methods of building massively parallel computing systems using low power computing complexes in accordance with embodiments of the invention are disclosed. A massively parallel computing system in accordance with one embodiment of the invention includes at least one Solid State Blade configured to communicate via a high performance network fabric. In addition, each Solid State Blade includes a processor configured to communicate with a plurality of low power computing complexes interconnected by a router, and each low power computing complex includes at least one general processing core, an accelerator, an I/O interface, and cache memory and is configured to communicate with non-volatile solid state memory.

Stalzer, Mark A.↗

From Simulation to Reality With Random Noise

The challenging environment of autonomous vehicle (AV) navigation necessitates certain functions be performed by deep neural networks. Optimizing these models involves collecting vast quantities of domain-specific training data and ensuring that the dataset is representative of expected conditions. High-fidelity simulation plays a vital role in making this process feasible, allowing a wide range of scenarios to be explored at low cost. However, learning from simulation introduces subtle biases into models, which can degrade real-world performance in unpredictable ways. This effect can be mitigated with learning schemes specialized to bridge distributional shifts (transfer learning). Given the complex nature of these methods, the underlying models, and their environments, meaningfully evaluating performance is notstraight forward. Many unrelated factors can effect an improvement in generalization accuracy, but a full ablation analysis is often difficult. To tease out signal from noise, it is necessary to understand how transfer learning performance is affected by noise itself. The goals of this paper are (i) to establish a domain randomization baseline for a simple classification transfer learning task and (ii) to validate the RRAV testbed as a platform for further research in sim-to-real learning. We generate imagery from a simulation of NASA Ames Research Center and train a small convolutional neural network (ConvNet) to classify position relative to a centerline. Further models are trained with different types of noise progressively added to the data. The models are deployed aboard the on-site test vehicle to test real-world performance. In our experiments, we find that such naive domain randomization raises sim-to-real accuracy from 64% to 79%, while training directly on real data yields an 89% accuracy ceiling. These results suggest that the isolated mechanism of domain randomization can significantly improve generalization.

simulation↗

Temperature Field Reconstruction of Surfaces Heated Through Radiative Heat Transfer Using Convolutional Neural Networks

Microreactors could play a crucial role in decarbonizing our energy portfolio. However, their development and implementation come with specific challenges, particularly regarding cost. Due to their compact size and the harsh operational environment, collecting real-time data on reactor operation can be challenging. Many probe designs are unable to withstand extreme conditions (e.g., temperature, radiation) in the reactor. In this context, using convolutional neural networks (CNNs) can pave the way for developing a nonintrusive approach that relies solely on ex-core sensors. A well-trained physics-informed CNN can reconstruct the distribution of a given physical quantity over a domain using only a few sensors, allowing us to reconstruct the desired field distribution even in a limited space or complex geometries where a large array of sensors is impractical. In this work, we present the initial steps toward developing a real-time tool for monitoring the thermal behavior of nuclear reactor pressure vessels. Based on an experimental setup, a computational model using the Multiphysics Object-Oriented Simulation Environment (moose) framework was built, where the Ray Tracing and Heat Conduction modules were used to evaluate the temperature distribution over a convex metal surface heated through radiative heat transfer. This metal surface represents a section of a heated nuclear reactor vessel wall. The model also accounts for solid mechanics physics through the moose Solid Mechanics module. In situ experimental data, acquired from a Texas A&M facility, were used to validate the computational model. Part of the data generated by the moose model was used to train the convolutional neural network to reconstruct the vessel wall's outer surface temperature. The CNN generalization was then compared against the experimental and computational data.

Aldeia Machado, Luiz Carlos↗

Characterization of the Secondary Binding Sites of Maclura pomifera agglutinin by Glycan Array and Crystallographic Analyses

The Maclura pomifera agglutinin (MPA) recognizes the T-antigen disaccharide Gal{beta}1,3GalNAc mainly through interaction of the {alpha}-GalNAc moiety with its primary site, but the interactions of the two flanking subsites A and B with aglycones and substituents other than Gal, respectively, are not well understood. We therefore characterized the specificity of MPA in more detail by glycan microarray analysis and determined the crystal structures of MPA without ligand and in complexes with Gal{beta}1,3GalNAc and p-nitrophenyl {alpha}-GalNAc. In both sugar complexes, pairs of ligands created inter-tetramer hydrogen-bond bridging networks. While subsite A showed increased affinity for hydrophobic aglycones, it also accommodated several sugar substituents. Notably, a GalNAc-O-tripeptide, a Tn-antigen mimic, showed lower affinity than these compounds in surface plasmon resonance (SPR) experiments. The glycan array data that showed subsite B accepted compounds in which the O3 position of the GalNAc was substituted with various sugars other than Gal, but substitutions at O6 led to inactivity. Additions to the Gal moiety of the disaccharide also had only small effects on reactivity. These results are all compatible with the features seen in the crystal structures.

59 BASIC BIOLOGICAL SCIENCES↗

Segmental Refinement: A Multigrid Technique for Data Locality

We investigate a technique - segmental refinement (SR) - proposed by Brandt in the 1970s as a low memory multigrid method. The technique is attractive for modern computer architectures because it provides high data locality, minimizes network communication, is amenable to loop fusion, and is naturally highly parallel and asynchronous. The network communication minimization property was recognized by Brandt and Diskin in 1994; we continue this work by developing a segmental refinement method for a finite volume discretization of the 3D Laplacian on massively parallel computers. An understanding of the asymptotic complexities, required to maintain textbook multigrid efficiency, are explored experimentally with a simple SR method. A two-level memory model is developed to compare the asymptotic communication complexity of a proposed SR method with traditional parallel multigrid. Performance and scalability are evaluated with a Cray XC30 with up to 64K cores. We achieve modest improvement in scalability from traditional parallel multigrid with a simple SR implementation.

3D Laplacian↗

Fault-tolerance techniques for high-speed fiber-optic networks

Four fiber optic network topologies (linear bus, ring, central star, and distributed star) are discussed relative to their application to high data throughput, fault tolerant networks. The topologies are also examined in terms of redundancy and the need to provide for single point, failure free (or better) system operation. Linear bus topology, although traditionally the method of choice for wire systems, presents implementation problems when larger fiber optic systems are considered. Ring topology works well for high speed systems when coupled with a token passing protocol, but it requires a significant increase in protocol complexity to manage system reconfiguration due to ring and node failures. Star topologies offer a natural fault tolerance, without added protocol complexity, while still providing high data throughput capability.

Deruiter, John↗

Lie–Poisson Neural Networks (LPNets): Data-based computing of Hamiltonian systems with symmetries

An accurate data-based prediction of the long-term evolution of Hamiltonian systems requires a network that preserves the appropriate structure under each time step. Every Hamiltonian system contains two essential ingredients: the Poisson bracket and the Hamiltonian. Hamiltonian systems with symmetries, whose paradigm examples are the Lie–Poisson systems, have been shown to describe a broad category of physical phenomena, from satellite motion to underwater vehicles, fluids, geophysical applications, complex fluids, and plasma physics. The Poisson bracket in these systems comes from the symmetries, while the Hamiltonian comes from the underlying physics. We view the symmetry of the system as primary, hence the Lie–Poisson bracket is known exactly, whereas the Hamiltonian is regarded as coming from physics and is considered not known, or known approximately. Using this approach, we develop a network based on transformations that exactly preserve the Poisson bracket and the special functions of the Lie–Poisson systems (Casimirs) to machine precision. We present two flavors of such systems: one, where the parameters of transformations are computed from data using a dense neural network (LPNets), and another, where the composition of transformations is used as building blocks (G-LPNets). We also show how to adapt these methods to a larger class of Poisson brackets. We apply the resulting methods to several examples, such as rigid body (satellite) motion, underwater vehicles, a particle in a magnetic field, and others. The methods developed in this paper are important for the construction of accurate data-based methods for simulating the long-term dynamics of physical systems.

Data-based modeling↗

The NASA/JPL 64-meter-diameter antenna at Goldstone, California: Project report, technical staff, tracking and data acquisition organization

The significant management and technical aspects of the JPL Project to develop and implement a 64-meter-diameter antenna at the Goldstone Deep Space Communications Complex in California, which was the first of the Advanced Antenna Systems of the National Aeronautics and Space Administration/Jet Propulsion Laboratory Deep Space Network are described. The original need foreseen for a large-diameter antenna to accomplish communication and tracking support of NASA's solar system exploration program is reviewed, and the translation of those needs into the technical specification of an appropriate ground station antenna is described. The antenna project is delineated by phases to show the key technical and managerial skills and the technical facility resources involved. There is a brief engineering description of the antenna and its closely related facilities. Some difficult and interesting engineering problems, then at the state-of-the-art level, which were met in the accomplishment of the Project, are described. The key performance characteristics of the antenna, in relation to the original specifications and the methods of their determination, are stated.

Source record↗

Accurate Compression of Tabulated Chemistry Models with Partition of Unity Networks

Tabulated chemistry models are widely used to simulate large-scale turbulent fires in applications including energy generation and fire safety. Tabulation via piecewise Cartesian interpolation suffers from the curse-of-dimensionality, leading to a prohibitive exponential growth in parameters and memory usage as more dimensions are considered. Artificial neural networks (ANNs) have attracted attention for constructing surrogates for chemistry models due to their ability to perform high-dimensional approximation. However, due to well-known pathologies regarding the realization of suboptimal local minima during training, in practice they do not converge and provide unreliable accuracy. Partition of unity networks (POUnets) are a recently introduced family of ANNs which preserve notions of convergence while performing high-dimensional approximation, discovering a mesh-free partition of space which may be used to perform optimal polynomial approximation. In this work, we assess their performance with respect to accuracy and model complexity in reconstructing unstructured flamelet data representative of nonadiabatic pool fire models. Our results show that POUnets can provide the desirable accuracy of classical spline-based interpolants with the low memory footprint of traditional ANNs while converging faster to significantly lower errors than ANNs. For example, we observe POUnets obtaining target accuracies in two dimensions with 40 to 50 times less memory and roughly double the compression in three dimensions. We also address the practical matter of efficiently training accurate POUnets by studying convergence over key hyperparameters, the impact of partition/basis formulation, and the sensitivity to initialization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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.

97 MATHEMATICS AND COMPUTING↗

Machine Learning

The absence of a robust and unified theory of cyber dynamics presents challenges and opportunities for using machine learning based data-driven approaches to further the understanding of the behavior of such complex systems. Analysts can also use machine learning approaches to gain operational insights. In order to be operationally beneficial, cybersecurity machine learning based models need to have the ability to: (1) represent a real-world system, (2) infer system properties, and (3) learn and adapt based on expert knowledge and observations. Probabilistic models and Probabilistic graphical models provide these necessary properties and are further explored in this chapter. Bayesian Networks and Hidden Markov Models are introduced as an example of a widely used data driven classification/modeling strategy.

Anomaly detection↗

Physics-guided neural networks with engineering domain knowledge for hybrid process modeling

As neural networks are more frequently used to solve problems in science and engineering, the methods used to incorporate scientific knowledge into these networks are becoming increasingly complex. Here, this work breaks down these complicated techniques into a set of basic strategies which can easily be applied to diverse situations. Several novel neural networks are built using the categories laid out in this work. These networks are tested on simulated data from a continuous stirred tank reactor (CSTR) model to evaluate the advantages provided by each network. The three points demonstrated in this work are: (1) architectural hybrid models can speed up convergence and reduce the amount of data necessary to train a model; (2) adding a physics-guided loss function can improve model generalization and make models more physically consistent; (3) using physics-guided initialization and transfer learning improves accuracy and speeds up convergence, but can harm generalizability if used incorrectly.

42 ENGINEERING↗