Search NASA⌕ Search

SEARCH · Search NASA

Results for “joint network”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

thermal-grid-jba v1.0.0

This is a software repository that contains models for a feasibility study of a thermal energy network for Joint Base Andrews. The work has been conducted under the ESTCP program in the project https://serdp-estcp.mil/projects/details/0694868a-3d58-4a14-a587-b8f638bfcd5c The repository contains models for energy system selection and for verification of design. The DoD management intends to give access to this code for future feasibility studies at Joint Base Andrews and possibly other bases.

Wetter, Michael [Lawrence Berkeley National Labora↗

Fallon FORGE: Distinct Element Reservoir Modeling

Archive containing input/output data for distinct element reservoir modeling for Fallon FORGE. Models created using 3DEC, InSite, and in-house Python algorithms (ITASCA). List of archived files follows; please see 'Modeling Metadata.pdf' (included as a resource below) for additional file descriptions. Data sources include regional geochemical model, well positions and geometry, principal stress field, capability for hydraulic fractures, capability for hydro-shearing, reservoir geomechanical model-stimulation into multiple zones, modeled thermal behavior during circulation, and microseismicity.

15 GEOTHERMAL ENERGY↗

Local-Distance Seismic Event Relocation and Relative Magnitude Estimation, Applications to Mining Related Seismicity in the Powder River Basin, Wyoming

Recent efforts to characterize small ( M w < 3 ) seismic events at local distances have become more important because of the increased observation of human-triggered and induced seismicity and the need to advance nuclear explosion monitoring capabilities. The signals generated by low-magnitude seismic sources necessitate the use of nearby short-period observations, which are sensitive to local geological heterogeneity. Local to near-regional distance ( < 300 km ) surface and shear waves can dominate short-period observations from small, shallow seismic sources. In this work, we utilize these observations to estimate precise, relative locations and magnitudes of ~ 700 industrial mining events in Wyoming, using nearly 360,000 observations. The precise, relative location estimates (with formal location uncertainty estimates of less than 1 km) collapse a diffuse collection of mining events into discrete clusters associated with individual blasting operations. We also invert the cross-correlation amplitudes to estimate precise, relative moment magnitude estimates, which help validate and identify disparities in the event sizes reported by regional network catalogs. Joint use of multiple phases allows for the inclusion of more seismic events due to the increase in the number of observations. In some cases, using a single phase allowed us to relocate only 50% of the original reported seismic events within a cluster. Combining shear- and surface-wave phases increased the number of events to above 90% of the original events, allowing us to characterize a broader range of event sizes, source to station distances, and event distributions. This analysis takes a step toward making a fuller characterization of small industrial seismic events observed at local distances.

58 GEOSCIENCES↗

Cross-Feature Transfer Learning for Efficient Tensor Program Generation

Tuning tensor program generation involves navigating a vast search space to find optimal program transformations and measurements for a program on the target hardware. The complexity of this process is further amplified by the exponential combinations of transformations, especially in heterogeneous environments. This research addresses these challenges by introducing a novel approach that learns the joint neural network and hardware features space, facilitating knowledge transfer to new, unseen target hardware. A comprehensive analysis is conducted on the existing state-of-the-art dataset, TenSet, including a thorough examination of test split strategies and the proposal of methodologies for dataset pruning. Leveraging an attention-inspired technique, we tailor the tuning of tensor programs to embed both neural network and hardware-specific features. Notably, our approach substantially reduces the dataset size by up to 53% compared to the baseline without compromising Pairwise Comparison Accuracy (PCA). Furthermore, our proposed methodology demonstrates competitive or improved mean inference times with only 25–40% of the baseline tuning time across various networks and target hardware. The attention-based tuner can effectively utilize schedules learned from previous hardware program measurements to optimize tensor program tuning on previously unseen hardware, achieving a top-5 accuracy exceeding 90%. This research introduces a significant advancement in autotuning tensor program generation, addressing the complexities associated with heterogeneous environments and showcasing promising results regarding efficiency and accuracy.

97 MATHEMATICS AND COMPUTING↗

Proceedings of the Second Joint Technology Workshop on Neural Networks and Fuzzy Logic, volume 2

Documented here are papers presented at the Neural Networks and Fuzzy Logic Workshop sponsored by NASA and the University of Texas, Houston. Topics addressed included adaptive systems, learning algorithms, network architectures, vision, robotics, neurobiological connections, speech recognition and synthesis, fuzzy set theory and application, control and dynamics processing, space applications, fuzzy logic and neural network computers, approximate reasoning, and multiobject decision making.

Lea, Robert N.↗

Proceedings of the Second Joint Technology Workshop on Neural Networks and Fuzzy Logic, volume 1

Documented here are papers presented at the Neural Networks and Fuzzy Logic Workshop sponsored by NASA and the University of Houston, Clear Lake. The workshop was held April 11 to 13 at the Johnson Space Flight Center. Technical topics addressed included adaptive systems, learning algorithms, network architectures, vision, robotics, neurobiological connections, speech recognition and synthesis, fuzzy set theory and application, control and dynamics processing, space applications, fuzzy logic and neural network computers, approximate reasoning, and multiobject decision making.

Lea, Robert N.↗

Study and simulation of low rate video coding schemes

The semiannual report is included. Topics covered include communication, information science, data compression, remote sensing, color mapped images, robust coding scheme for packet video, recursively indexed differential pulse code modulation, image compression technique for use on token ring networks, and joint source/channel coder design.

Sayood, Khalid↗

Ultra Low Power, Radiation Tolerant UHF Radio Technologies for In Situ Communication Applications

For future deep space missions, significant reductions in the mass and power requirements for short-range telecommunication systems will be critical in enabling a wide variety of new mission concepts. These possibilities include penetrators, gliders, miniature rovers, and sensor networks. Under joint funding from NASA's Cross Enterprise and JPL's Telecommunications and Mission technology programs, recent development activity has focused on the design of ultralow mass and power transceiver systems and subsystems suitable for operation in a flight environment. For these efforts, the functionality of the transceiver has been targeted towards a specific Mars communications scenario. However, the overall architecture is well suited to any short or medium range application where a remote probe will aperiodically communicate with a base station, possibly an orbiter, for the eventual purpose of relaying science information back to Earth. In 2001, these sponsors have been augmented with collaborative expertise and funding from JPL's Center for Integrated Space Microsystems in order to migrate existing concepts and designs to a System on a Chip (SOAC) solution. Additional information is contained in the original extended abstract.

Lay, N. E.↗

Architectural Design for the Global Legal Information Network

In this report, we provide a summary of our activities regarding the goals, requirements analysis, design, and prototype implementation for the Global Legal Information Network, a joint effort between the Law Library of Congress and NASA.

Kalpakis, Konstantinos↗

GRACE Collaboration in the Swift Era

I will describe the structure and major discoveries of the Gamma-Ray Afterglow Collaboration at ESO, formed by several European Countries to perform GRB follow up observations using the European Southern Observatory (ESO) ground-based facilities in Chile. I represent the USA-UK node of GRACE. I will also describe a newly funded effort through the Swift GO program aiming at forming a Joint Afterglow NETwork (JANET) using members of the American Association of Variable Star Observers (AAVSO).

Kouveliotou, C.↗

Control and Optimization of Energy Storage System in Power Distribution System

The widespread adoption of electric vehicles (EVs) and transportation electrification is encumbered by two chief barriers: i) the limited driving range of EVs in the market today and ii) inadequate fast-charging infrastructure for long-distance trips. Extreme fast charging (XFC) technology can recharge EVs in less than 10 minutes for 200 miles range. Firstly, a novel robust optimization-based mixed integer linear programming model is proposed to size a battery energy storage system (BESS) and PV system in an XFCS. In this part, it is assumed that the sizing and location of the XFCS are known. Secondly, the aforesaid assumption is relaxed, and a strategic multi-period coordinated planning model is proposed to optimally site and size BESS-assisted charging stations in a highway transportation network and PV systems in a power distribution network by considering the coupling between both networks. Optimal operation and control of BESS-assisted EV charging stations are vital to alleviate the adverse impact of extreme fast charging of EVs on the host power network. A joint solution is proposed to mitigate the steady state and transient impact of extremefast charging of EVs and ensure grid-friendly integration of XFCSs with the host grid. Lastly, to make the operation of the XFCS cost-effective, a multi-layered energy management framework is proposed for the XFCS by considering forecast uncertainties, monthly demand charges reduction, and BESS degradation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Constructing and sampling graphs with a given joint degree distribution.

One of the most influential recent results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous generative models that match this property. However, more recent work has shown that while these generative models do have the right degree distribution, they are not good models for real life networks due to their differences on other important metrics like conductance. We believe this is, in part, because many of these real-world networks have very different joint degree distributions, i.e. the probability that a randomly selected edge will be between nodes of degree k and l. Assortativity is a sufficient statistic of the joint degree distribution, and it has been previously noted that social networks tend to be assortative, while biological and technological networks tend to be disassortative. We suggest understanding the relationship between network structure and the joint degree distribution of graphs is an interesting avenue of further research. An important tool for such studies are algorithms that can generate random instances of graphs with the same joint degree distribution. This is the main topic of this paper and we study the problem from both a theoretical and practical perspective. We provide an algorithm for constructing simple graphs from a given joint degree distribution, and a Monte Carlo Markov Chain method for sampling them. We also show that the state space of simple graphs with a fixed degree distribution is connected via end point switches. We empirically evaluate the mixing time of this Markov Chain by using experiments based on the autocorrelation of each edge. These experiments show that our Markov Chain mixes quickly on real graphs, allowing for utilization of our techniques in practice.

99 GENERAL AND MISCELLANEOUS↗

Sampling graphs with a prescribed joint degree distribution using Markov Chains.

One of the most influential results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous generative models that match this property. However, more recent work has shown that while these generative models do have the right degree distribution, they are not good models for real life networks due to their differences on other important metrics like conductance. We believe this is, in part, because many of these real-world networks have very different joint degree distributions, i.e. the probability that a randomly selected edge will be between nodes of degree k and l. Assortativity is a sufficient statistic of the joint degree distribution, and it has been previously noted that social networks tend to be assortative, while biological and technological networks tend to be disassortative. We suggest that the joint degree distribution of graphs is an interesting avenue of study for further research into network structure. We provide a simple greedy algorithm for constructing simple graphs from a given joint degree distribution, and a Monte Carlo Markov Chain method for sampling them. We also show that the state space of simple graphs with a fixed degree distribution is connected via endpoint switches. We empirically evaluate the mixing time of this Markov Chain by using experiments based on the autocorrelation of each edge.

99 GENERAL AND MISCELLANEOUS↗

Accelerated Distributed Energy Management for Microgrids

This paper considers the optimal energy management for a microgrid. The goal of optimal energy management is to minimize the total generation cost while meeting total demand and satisfying individual generator output limits. To achieve this goal, we develop a distributed algorithm based on the consensus theory and gradient estimation technique. Compared to the existing algorithms with diminishing step-sizes, the proposed algorithm enjoys a faster convergence speed due to the fixed step-size, and thus increases the computation speed, and reduces the computation and communication burden. The proposed distributed algorithm is applicable to both fixed and time-varying directed communication networks. We show that the convergence of the proposed distributed algorithm is achieved if the fixed communication network is strongly connected, or if the time-varying communication network is uniformly jointly strongly connected. Numerical simulation results are used to illustrate and demonstrate the effectiveness of the proposed algorithm.

Du, Wen↗

Distributed Energy Resources Coordination over Time-varying Directed Communication Networks

In this paper, we consider an optimal coordination problem for distributed energy resources (DERs) including distributed generators and energy storage devices. We first propose an algorithm based on the push-sum and gradient method to optimally coordinate storage devices and distributed generators in a distributed manner. In the proposed algorithm, each DER only maintains a set of variables and updates them through information exchange with a few neighboring DERs over a time-varying directed communication network. We show that the proposed distributed algorithm with appropriately chosen step-sizes solve the optimal DER coordination problem if the time-varying directed communication network is uniformly jointly strongly connected, which is a mild condition on the connectivity of communication topologies. The proposed distributed algorithm is illustrated and validated by numerical simulations.

Yang, Tao↗

Joint Chance Constraints Reduction Through Learning in Active Distribution Networks

Due to an increase in distributed generation and controllable loads, distribution networks are frequently operating under high levels of uncertainty. Joint chance constraints, which seek to satisfy multiple constraints simultaneously with a prescribed probability, are one way to incorporate uncertainty across sets of constraints for optimization and control of these networks. Due to the complexity of evaluating these constraints directly, sampling approaches or approximations can be used to transform the joint chance constraint into deterministic constraints. However, sampling techniques may be extremely computationally expensive and not suitable for physical networks operating on fast timescales, and conservative approximations may needlessly result in a much higher cost of system operation. The proposed framework aims to provide a scalable, data-driven approach which learns operational trends in a power network, eliminates zero-probability events (e.g., inactive constraints), and uses this additional information to accurately and efficiently approximate the joint chance constraint directly.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Deep structural clustering for single-cell RNA-seq data jointly through autoencoder and graph neural network

Abstract Single-cell RNA sequencing (scRNA-seq) permits researchers to study the complex mechanisms of cell heterogeneity and diversity. Unsupervised clustering is of central importance for the analysis of the scRNA-seq data, as it can be used to identify putative cell types. However, due to noise impacts, high dimensionality and pervasive dropout events, clustering analysis of scRNA-seq data remains a computational challenge. Here, we propose a new deep structural clustering method for scRNA-seq data, named scDSC, which integrate the structural information into deep clustering of single cells. The proposed scDSC consists of a Zero-Inflated Negative Binomial (ZINB) model-based autoencoder, a graph neural network (GNN) module and a mutual-supervised module. To learn the data representation from the sparse and zero-inflated scRNA-seq data, we add a ZINB model to the basic autoencoder. The GNN module is introduced to capture the structural information among cells. By joining the ZINB-based autoencoder with the GNN module, the model transfers the data representation learned by autoencoder to the corresponding GNN layer. Furthermore, we adopt a mutual supervised strategy to unify these two different deep neural architectures and to guide the clustering task. Extensive experimental results on six real scRNA-seq datasets demonstrate that scDSC outperforms state-of-the-art methods in terms of clustering accuracy and scalability. Our method scDSC is implemented in Python using the Pytorch machine-learning library, and it is freely available at https://github.com/DHUDBlab/scDSC.

Gan, Yanglan↗