Search NASA⌕ Search

SEARCH · Search NASA

Results for “Domain Distributed Framework”

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

Structural Analysis and Electrochemical Properties of Bimetallic Palladium-Platinum Aerogels Prepared by a Two-Step Gelation Process

Multimetallic aerogels have emerged as promising unsupported and high-surface-area metal materials for different applications in heterogeneous catalysis and electrochemistry, which are fabricated using a gelation process characterized by the controlled aggregation of metallic nanoparticles to form a macroscopic network structure in aqueous solution. However, the achievement of the structural homogeneity of the multimetallic aerogels in terms of the diameter of the nanochains and the chemical composition at the nano- and the macro-scale is still a great challenge. In this paper, we investigated two Pd-Pt aerogels prepared by the two-step gelation method. The structural homogeneity and chemical distribution of both metals inside the aerogels were analyzed by using high-resolution (scanning) transmission microscopy, energy-dispersive X-ray spectroscopy, extended X-ray absorption fine structure spectroscopy and cyclic voltammetry. The Pd-Pt aerogels show the presence of Pd/Pt-rich domains inside the long-range framework. It is evident that the initial monometallic features dominate over alloying during the gelation process. Although the same synthetic approach for Pd-Pt aerogels with different atomic ratios was used, we observed that the sizes of these monometallic domains varied strongly between the Pd-rich and Pt-rich aerogels. The presence of such metal clusters influenced the electrochemical robustness of the Pd-Pt aerogels dramatically. Further, electrochemical durability investigations revealed that the aerogels with a high content of Pd are less stable because of the gradual dissolution of the less noble metal particularly inside the Pd-rich domains. A chemical and structural homogeneity might improve the lifetime of the Pd-Pt aerogels under electrochemical conditions. In this work, we provide a better understanding of the structure and chemical distribution of the bimetallic aerogel framework prepared by the two-step gelation process.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

BAYESIAN NOISE ESTIMATION FOR NON-IDEAL COSMIC MICROWAVE BACKGROUND EXPERIMENTS

We describe a Bayesian framework for estimating the time-domain noise covariance of cosmic microwave background (CMB) observations, typically parameterized in terms of a 1/f frequency profile. This framework is based on the Gibbs sampling algorithm, which allows for exact marginalization over nuisance parameters through conditional probability distributions. In this paper, we implement support for gaps in the data streams and marginalization over fixed time-domain templates, and also outline how to marginalize over confusion from CMB fluctuations, which may be important for high signal-to-noise experiments. As a by-product of the method, we obtain proper constrained realizations, which themselves can be useful for map making. To validate the algorithm, we demonstrate that the reconstructed noise parameters and corresponding uncertainties are unbiased using simulated data. The CPU time required to process a single data stream of 100,000 samples with 1000 samples removed by gaps is 3 s if only the maximum posterior parameters are required, and 21 s if one also wants to obtain the corresponding uncertainties by Gibbs sampling.

79 ASTRONOMY AND ASTROPHYSICS↗

Hexagonal Distributed Embedded Energy Converters (HexDEECs)

The HexDEEC is a small, characteristic length approximating a centimeter, energy transducer that converts the dynamic deformations of its elastomer housing into electricity through a variable capacitance charging-discharging cycle. This device is a type of Distributed Embedded Energy Converter Technology (DEEC-Tec), a new domain for marine renewable energy research that utilizes a conglomeration of small distributed embedded energy converters (DEECs) that, in aggregate, form larger metamaterial frameworks. These resulting DEEC-Tec metamaterials can then, in turn, be used to construct flexible ocean wave energy converters called flexWECs, which can utilize a broad band of ocean wave frequencies and lack highly loaded rigid bodies. These systems also provide new avenues of wave energy harvesting such as actively transforming topologies (e.g., shape and form) and morphologies (e.g., stiffness and damping throughout its entire structure) in real time. Presented, is one specific type of DEEC: the HexDEEC, which is currently being developed by the United States National Renewable Energy Laboratory. This transducer shows promise in aiding the adoption and further development of the DEEC-Tec domain. The following presentation focuses on the promise of this technology and current work being done to analyze the performance of an individual HexDEEC design. The HexDEEC is composed of a hyperelastic hexagonal housing, nominally silicon rubber, with six electrodes on its inner faces. The upper three electrodes share the same charge while the lower three electrodes oppose the upper electrode charges. Externally, the HexDEEC has two arms extending away from the middle vertices of the hexagon. Via principles governing the relationship between electrical capacitance and electrical potential (voltage and charge), electricity is generated when the HexDEEC's arms are dynamically pulled or released under tensile loading, as doing so causes the distance between the upper and lower sets of electrodes to change - varying the energy converter's overall capacitance. Analytical and numerical modeling is being used to evaluate the mechanics and electrical energy generated by the HexDEEC. Equations to describe the capacitance and electrostatic forces acting on this unique system have been developed and implemented into the numerical modeling software STAR-CCM+, along with models to describe its hyperelastic material, such as the Mooney-Rivlin 3-parameter model. So far, an initial design has been analyzed and we plan to further optimize it to increase power production. Individual HexDEECs have been fabricated by drawing uncured liquid silicon rubber into molds via vacuum pressure. To simplify manufacturing, HexDEEC sub-components - e.g., electrodes, wires - can be placed within those molds such that they are directly embedded into the hexagonal housing during the curing process. Furthermore, DEEC-Tec metamaterials can be created by interweaving or sequentially layering multiple HexDEEC strands together. The HexDEEC based metamaterial could then generate electricity through its gross deformations. Ultimately, HexDEECs represent a specific type of energy transducer that can be leveraged, by the DEEC-Tec domain, to create metamaterials used to construct novel flexWECs.

DEEC-Tec↗

An Experimental Framework for Executing Applications in Dynamic Grid Environments

The Grid opens up opportunities for resource-starved scientists and engineers to harness highly distributed computing resources. A number of Grid middleware projects are currently available to support the simultaneous exploitation of heterogeneous resources distributed in different administrative domains. However, efficient job submission and management continue being far from accessible to ordinary scientists and engineers due to the dynamic and complex nature of the Grid. This report describes a new Globus framework that allows an easier and more efficient execution of jobs in a 'submit and forget' fashion. Adaptation to dynamic Grid conditions is achieved by supporting automatic application migration following performance degradation, 'better' resource discovery, requirement change, owner decision or remote resource failure. The report also includes experimental results of the behavior of our framework on the TRGP testbed.

Huedo, Eduardo↗

Application of Framework for Estimating Performance and Associated Uncertainty for Modified Aircraft Configurations Using NASA's X-57 Maxwell

A framework to estimate the performance and associated uncertainty of modified configurations of certified aircraft is applied to the X-57 Maxwell aircraft. In previous theoretical studies, the framework was shown to predict performance and uncertainty bounds accurately. The X-57 Maxwell is an experimental aircraft designed to demonstrate the benefits of distributed electric propulsion through a series of four incremental modifications to a Tecnam P2006T aircraft. The available models and data are first shown to be within the application domain of the framework. We then apply the framework to two X-57 Maxwell modifications. We compare the estimated performance and associated uncertainties against the airworthiness criteria. The results indicate that the framework is a promising tool for the certification by analysis workflow. We expect the framework to reduce and supplement the flight testing required to show compliance to airworthiness certification criteria for a modified configuration.

Uncertainty Quantification↗

Application of Framework for Estimating Performance and Associated Uncertainty for Modified Aircraft Configurations Using NASA's X-57 Maxwell

A framework to estimate the performance and associated uncertainty of modified configurations of certified aircraft is applied to the X-57 Maxwell aircraft. In previous theoretical studies, the framework was shown to predict performance and uncertainty bounds accurately. The X-57 Maxwell is an experimental aircraft designed to demonstrate the benefits of distributed electric propulsion through a series of four incremental modifications to a Tecnam P2006T aircraft. The available models and data are first shown to be within the application domain of the framework. We then apply the framework to two X-57 Maxwell modifications. We compare the estimated performance and associated uncertainties against the airworthiness criteria. The results indicate that the framework is a promising tool for the certification by analysis workflow. We expect the framework to reduce and supplement the flight testing required to show compliance to airworthiness certification criteria for a modified configuration.

Uncertainty Quantification↗

A computationally efficient parallel Levenberg-Marquardt algorithm for highly parameterized inverse model analyses

Inverse modeling seeks model parameters given a set of observations. However, for practical problems because the number of measurements is often large and the model parameters are also numerous, conventional methods for inverse modeling can be computationally expensive. We have developed a new, computationally-efficient parallel Levenberg-Marquardt method for solving inverse modeling problems with a highly parameterized model space. Levenberg-Marquardt methods require the solution of a linear system of equations which can be prohibitively expensive to compute for moderate to large-scale problems. Our novel method projects the original linear problem down to a Krylov subspace, such that the dimensionality of the problem can be significantly reduced. Furthermore, we store the Krylov subspace computed when using the first damping parameter and recycle the subspace for the subsequent damping parameters. The efficiency of our new inverse modeling algorithm is significantly improved using these computational techniques. We apply this new inverse modeling method to invert for random transmissivity fields in 2D and a random hydraulic conductivity field in 3D. Our algorithm is fast enough to solve for the distributed model parameters (transmissivity) in the model domain. The algorithm is coded in Julia and implemented in the MADS computational framework (http://mads.lanl.gov). By comparing with Levenberg-Marquardt methods using standard linear inversion techniques such as QR or SVD methods, our Levenberg-Marquardt method yields a speed-up ratio on the order of ~10 1 to ~10 2 in a multi-core computational environment. Furthermore, our new inverse modeling method is a powerful tool for characterizing subsurface heterogeneity for moderate- to large-scale problems.

97 MATHEMATICS AND COMPUTING↗

Emergence of microbial networks as response to hostile environments

The majority of microorganisms live in complex communities under varying conditions. One pivotal question in evolutionary biology is the emergence of cooperative traits and their sustainment in altered environments or in the presence of free-riders. Co-occurrence patterns in the spatial distribution of biofilms can help define species’ identities, and systems biology tools are revealing networks of interacting microorganisms. However, networks of inter-dependencies involving micro-organisms in the planktonic phase may be just as important, with the added complexity that they are not bounded in space. An integrated approach linking imaging, “Omics” and modeling has the potential to enable new hypothesis and working models. In order to understand how cooperation can emerge and be maintained without abilities like memory or recognition we use evolutionary game theory as the natural framework to model cell-cell interactions arising from evolutive decisions. We consider a finite population distributed in a spatial domain (biofilm), and divided into two interacting classes with different traits. This interaction can be weighted by distance, and produces physical connections between two elements allowing them to exchange finite amounts of energy and matter. Available strategies to each individual of one class in the population are the propensities or “willingness” to connect any individual of the other class. Following evolutionary game theory, we propose a mathematical model which explains the patterns of connections which emerge when individuals are able to find connection strategies that asymptotically optimize their fitness. The process explains the formation of a network for efficiently exchanging energy and matter among individuals and thus ensuring their survival in hostile environments.

59 BASIC BIOLOGICAL SCIENCES↗

Broadening of Modeled Cloud Droplet Spectra Using Bin Microphysics in an Eulerian Spatial Domain

This study investigates droplet size distribution (DSD) characteristics from condensational growth and transport in Eulerian dynamical models with bin microphysics. A hierarchy of modeling frameworks is utilized, including parcel, one-dimensional (1D), and three-dimensional large-eddy simulation (LES). The bin DSDs from the 1D model, which includes only vertical advection and condensational growth, are nearly as broad as those from the LES and in line with observed DSD widths for stratocumulus clouds. These DSDs are much broader than those from Lagrangian microphysical calculations within a parcel framework that serve as a numerical benchmark for the 1D tests. In contrast, the bin-modeled DSDs are similar to the Lagrangian microphysical benchmark for a rising parcel in which Eulerian transport is not considered. These results indicate that numerical diffusion associated with vertical advection is a key contributor to broadening DSDs in the 1D model and LES. This DSD broadening from vertical numerical diffusion is unphysical, in contrast to the physical mixing processes that previous studies have indicated broaden DSDs in real clouds. It is proposed that artificial DSD broadening from vertical numerical diffusion compensates for underrepresented horizontal variability and mixing of different droplet populations in typical LES configurations with bin microphysics, or the neglect of other mechanisms that broaden DSDs such as growth of giant cloud condensation nuclei. These results call into question the ability of Eulerian dynamical models with bin microphysics to investigate the physical mechanisms for DSD broadening, even though they may reasonably simulate overall DSD characteristics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Elemental: a new framework for distributed memory dense matrix computations.

Parallelizing dense matrix computations to distributed memory architectures is a well-studied subject and generally considered to be among the best understood domains of parallel computing. Two packages, developed in the mid 1990s, still enjoy regular use: ScaLAPACK and PLAPACK. With the advent of many-core architectures, which may very well take the shape of distributed memory architectures within a single processor, these packages must be revisited since the traditional MPI-based approaches will likely need to be extended. Thus, this is a good time to review lessons learned since the introduction of these two packages and to propose a simple yet effective alternative. Preliminary performance results show the new solution achieves competitive, if not superior, performance on large clusters.

99 GENERAL AND MISCELLANEOUS↗

DIRAC current, upcoming and planned capabilities and technologies

DIRAC is the interware for building and operating large scale distributed computing systems. It is adopted by multiple collaborations from various scientific domains for implementing their computing models. DIRAC provides a framework and a rich set of ready-to-use services for Workload, Data and Production Management tasks of small, medium and large scientific communities having different computing requirements. The base functionality can be easily extended by custom components supporting community specific workflows. DIRAC is at the same time an aging project, and a new DiracX project is taking shape for replacing DIRAC in the long term. This contribution will highlight DIRAC’s current, upcoming and planned capabilities and technologies, and how the transition to DiracX will take place. Examples include, but are not limited to, adoption of security tokens and interactions with Identity Provider services, integration of Clouds and High Performance Computers, interface with Rucio, improved monitoring and deployment procedures.

97 MATHEMATICS AND COMPUTING↗

MESA: Message-Based System Analysis Using Runtime Verification

In this paper, we present a novel approach and framework for run-time verication of large, safety critical messaging systems. This work was motivated by verifying the System Wide Information Management (SWIM) project of the Federal Aviation Administration (FAA). SWIM provides live air traffic, site and weather data streams for the whole National Airspace System (NAS), which can easily amount to several hundred messages per second. Such safety critical systems cannot be instrumented, therefore, verification and monitoring has to happen using a nonintrusive approach, by connecting to a variety of network interfaces. Due to a large number of potential properties to check, the verification framework needs to support efficient formulation of properties with a suitable Domain Specific Language (DSL). Our approach is to utilize a distributed system that is geared towards connectivity and scalability and interface it at the message queue level to a powerful verification engine. We implemented our approach in the tool called MESA: Message-Based System Analysis, which leverages the open source projects RACE (Runtime for Airspace Concept Evaluation) and TraceContract. RACE is a platform for instantiating and running highly concurrent and distributed systems and enables connectivity to SWIM and scalability. TraceContract is a runtime verication tool that allows for checking traces against properties specified in a powerful DSL. We applied our approach to verify a SWIM service against several requirements.We found errors such as duplicate and out-of-order messages.

Message-based System↗

Predicting CO 2 Plume Migration in Heterogeneous Formations Using Conditional Deep Convolutional Generative Adversarial Network

Numerical simulation of flow and transport in heterogeneous formations has long been studied, especially for uncertainty quantification and risk assessment. The high computational cost associated with running large-scale numerical simulations in a Monte Carlo sense has motivated the development of surrogate models, which aim to capture the important input-output relations of physics-based models but require only a fraction of the cost of full model runs. In this work, we formulate a conditional deep convolutional generative adversarial network (cDC-GAN) surrogate model to learn the dynamic functional mappings in multiphase models. The cDC-GAN belongs to a class of semisupervised learning methods that can be used to learn the data generation processes. Like the original GAN, a main strength of the cDC-GAN is that it includes a self-training scheme for improving the quality of generative modeling in a game theoretic framework, without requiring extensive statistical knowledge and assumptions on input data distributions. In particular, our cDC-GAN model is designed to learn cross-domain mappings between high-dimensional input (e.g., permeability) and output (e.g., phase saturations) pairs, with the ability to incorporate conditioning information (e.g., prediction time). As a use case, we demonstrate the performance of cDC-GAN for predicting the migration of carbon dioxide (CO 2 ) plume in heterogeneous carbon storage reservoirs, which has both numerical and practical significance because of the safe storage requirements now mandated in many countries. Results show that cDC-GAN achieves high accuracy in predicting the spatial and temporal evolution patterns of the injected CO 2 plume, as compared to the original results obtained using a compositional reservoir simulator. The performance of cDC-GAN models, trained using the same number of training samples, stays relatively robust when the level of spatial heterogeneity is increased. Our cDC-GAN is pattern based and is not limited by the underlying physics. Thus, it provides a general framework for developing surrogate models, and for conducting uncertainty analyses for a wide range of physics-based models used in both groundwater and subsurface energy exploration applications.

54 ENVIRONMENTAL SCIENCES↗

A New Perspective for the Calibration of Computational Predictor Models.

This paper presents a framework for calibrating computational models using data from sev- eral and possibly dissimilar validation experiments. The offset between model predictions and observations, which might be caused by measurement noise, model-form uncertainty, and numerical error, drives the process by which uncertainty in the models parameters is characterized. The resulting description of uncertainty along with the computational model constitute a predictor model. Two types of predictor models are studied: Interval Predictor Models (IPMs) and Random Predictor Models (RPMs). IPMs use sets to characterize uncer- tainty, whereas RPMs use random vectors. The propagation of a set through a model makes the response an interval valued function of the state, whereas the propagation of a random vector yields a random process. Optimization-based strategies for calculating both types of predictor models are proposed. Whereas the formulations used to calculate IPMs target solutions leading to the interval value function of minimal spread containing all observations, those for RPMs seek to maximize the models' ability to reproduce the distribution of obser- vations. Regarding RPMs, we choose a structure for the random vector (i.e., the assignment of probability to points in the parameter space) solely dependent on the prediction error. As such, the probabilistic description of uncertainty is not a subjective assignment of belief, nor is it expected to asymptotically converge to a fixed value, but instead it is a description of the model's ability to reproduce the experimental data. This framework enables evaluating the spread and distribution of the predicted response of target applications depending on the same parameters beyond the validation domain (i.e., roll-up and extrapolation).

Crespo, Luis Guillermo↗

Future SDN-HPON Control Plane Architecture and Protocol for On-Demand Terabit End-to-End Extreme-Scale Science Applications

The UC Davis team conducted architecture, algorithm and experimental studies for next generation ultra-high-bandwidth optical networks in support of extreme-scale science applications. In particular, over the course of this 3-year project, the UC Davis team achieved the following main accomplishments: Designed a network architecture for automated multi-domain service provisioning: Designed information exchange schemes between autonomous systems (domains) Designed application programming interfaces to orchestrate resource reservation in data centers, high performance computation facilities, and communication networks belonging to different autonomous systems Experimentally assessed the multi-domain network architecture in a distributed field trial set-up connecting premises in three continents Designed a broker-based orchestrated multi-domain optical networking framework supporting observe-analyze-act cycle based cognitive inter-domain service provisioning: Designed an inter-domain operation mechanism, e.g., topology abstraction, for the broker plane and domain managers to collaboratively accomplish inter-domain service provisioning while respecting the autonomy of each administrative domain Designed an alien wavelength monitoring scheme and an artificial neural network based optical signal-to-noise ratio estimator for quality-of-transmission aware inter-domain service provisioning Developed a deep neural network based multi-domain traffic predictor and a cognitive routing and spectrum assignment algorithm to realize knowledge-based autonomous traffic engineering in multi-domain networks Implemented an optical signal-to-noise ratio estimator and traffic predictor with Google’s Tensor flow and assessed their performance using experimental and synthetic data Demonstrated the benefits of the proposed cognitive schemes with experiments ona two-domain elastic optical network testbed and evaluations on a six-domain simulation framework Built a two-domain software-defined networking control plane testbed using the ONOS platform and demonstrated the workflow of broker and domain manager cooperation, including hierarchical performance monitoring, topology abstraction and cognitive resource allocation. Designed self-learning cognitive service provisioning schemes using advanced machine learning technologies: Designed a self-taught anomaly detection framework for optical networks, including an unsupervised data clustering module for pattern recognition, a supervised data regression and classification module for online anomaly detection, and the system operation principle Experimentally validated the effectiveness of the self-taught anomaly detection framework with various failure/anomaly scenarios. Designed a self-learning autonomic routing, modulation and spectrum assignment (RMSA) provisioning framework for elastic optical networks with deep reinforcement learning. Designed effective modeling and training mechanisms for the self-learning RMSA framework Conducted extensive numerical simulations with various traffic patterns and topologies to verify the advantage of the self-learning RMSA framework.

42 ENGINEERING↗

A New Perspective for the Calibration of Computational Predictor Models

This paper presents a framework for calibrating computational models using data from several and possibly dissimilar validation experiments. The offset between model predictions and observations, which might be caused by measurement noise, model-form uncertainty, and numerical error, drives the process by which uncertainty in the models parameters is characterized. The resulting description of uncertainty along with the computational model constitute a predictor model. Two types of predictor models are studied: Interval Predictor Models (IPMs) and Random Predictor Models (RPMs). IPMs use sets to characterize uncertainty, whereas RPMs use random vectors. The propagation of a set through a model makes the response an interval valued function of the state, whereas the propagation of a random vector yields a random process. Optimization-based strategies for calculating both types of predictor models are proposed. Whereas the formulations used to calculate IPMs target solutions leading to the interval value function of minimal spread containing all observations, those for RPMs seek to maximize the models’ ability to reproduce the distribution of observations. Regarding RPMs, we choose a structure for the random vector (i.e., the assignment of probability to points in the parameter space) solely dependent on the prediction error. As such, the probabilistic description of uncertainty is not a subjective assignment of belief, nor is it expected to asymptotically converge to a fixed value, but instead it is a description of the model’s ability to reproduce the experimental data. This framework enables evaluating the spread and distribution of the predicted response of target applications depending on the same parameters beyond the validation domain (i.e., roll-up and extrapolation).

42 ENGINEERING↗

Framework for Development of Object-Oriented Software

The Real-Time Control (RTC) Application Framework is a high-level software framework written in C++ that supports the rapid design and implementation of object-oriented application programs. This framework provides built-in functionality that solves common software development problems within distributed client-server, multi-threaded, and embedded programming environments. When using the RTC Framework to develop software for a specific domain, designers and implementers can focus entirely on the details of the domain-specific software rather than on creating custom solutions, utilities, and frameworks for the complexities of the programming environment. The RTC Framework was originally developed as part of a Space Shuttle Launch Processing System (LPS) replacement project called Checkout and Launch Control System (CLCS). As a result of the framework s development, CLCS software development time was reduced by 66 percent. The framework is generic enough for developing applications outside of the launch-processing system domain. Other applicable high-level domains include command and control systems and simulation/ training systems.

Perez-Poveda, Gus↗

Calibration of Predictor Models Using Multiple Validation Experiments

This paper presents a framework for calibrating computational models using data from several and possibly dissimilar validation experiments. The offset between model predictions and observations, which might be caused by measurement noise, model-form uncertainty, and numerical error, drives the process by which uncertainty in the models parameters is characterized. The resulting description of uncertainty along with the computational model constitute a predictor model. Two types of predictor models are studied: Interval Predictor Models (IPMs) and Random Predictor Models (RPMs). IPMs use sets to characterize uncertainty, whereas RPMs use random vectors. The propagation of a set through a model makes the response an interval valued function of the state, whereas the propagation of a random vector yields a random process. Optimization-based strategies for calculating both types of predictor models are proposed. Whereas the formulations used to calculate IPMs target solutions leading to the interval value function of minimal spread containing all observations, those for RPMs seek to maximize the models' ability to reproduce the distribution of observations. Regarding RPMs, we choose a structure for the random vector (i.e., the assignment of probability to points in the parameter space) solely dependent on the prediction error. As such, the probabilistic description of uncertainty is not a subjective assignment of belief, nor is it expected to asymptotically converge to a fixed value, but instead it casts the model's ability to reproduce the experimental data. This framework enables evaluating the spread and distribution of the predicted response of target applications depending on the same parameters beyond the validation domain.

Crespo, Luis G.↗