Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed computation”

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 1,801 records · Page 100

Distributed control architecture for real-time telerobotic operation

The emerging field of telerobotics places new demands on control system architecture to allow both autonomous operations and natural human-machine interfacing. The feasibility of multiprocessor systems performing parallel control computations is realizable. A practical distribution of control processors is presented and the issues involved in the realization of this architecture are discussed. A prototype dual axis controller based on the NOVIX computer is described, and results of its implementation are discussed. Application of this type of control system to a replicated, redundant manipulator system is also described.

Martin, H. L.↗

Supporting large scale applications on networks of workstations

Distributed applications on networks of workstations are an increasingly common way to satisfy computing needs. However, existing mechanisms for distributed programming exhibit poor performance and reliability as application size increases. Extension of the ISIS distributed programming system to support large scale distributed applications by providing hierarchical process groups is discussed. Incorporation of hierarchy in the program structure and exploitation of this to limit the communication and storage required in any one component of the distributed system is examined.

Cooper, Robert↗

Modified equilibrium distributions for Cooper-Frye particlization

We introduce a positive-definite single-particle distribution that is suitable for describing the transition from a macroscopic hydrodynamic to a microscopic kinetic description during the late stages of heavy-ion collisions in the presence of moderately large viscous corrections. The modified equilibrium distribution function can be constructed with hydrodynamic input from either relativistic viscous fluid dynamics or anisotropic fluid dynamics. We test the modified equilibrium distribution's hydrodynamic output for a stationary hadron resonance gas subject to either shear stress, bulk pressure, or baryon diffusion current at a given freeze-out temperature and baryon chemical potential. While it does not reproduce all components of the net baryon current and energy-momentum tensor exactly, it significantly improves upon the customary linearized approximations for the nonequilibrium correction δf n which typically lead to unphysical negative distribution functions at large particle momenta. A comparison of particle spectra and p T –differential elliptic flow coefficients from the Cooper–Frye formula computed with the modified equilibrium distribution and with linearized δf n corrections is presented, for two different (2 + 1)–dimensional hypersurfaces corresponding to central and noncentral Pb + Pb collisions at the Large Hadron Collider (LHC).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Distribution of SLS Integrated Load Uncertainty to Surface Pressures and Sectional Loads

Aerodynamic loads that are important to launch vehicle programs such as NASA’s Space Launch System (SLS) include both integrated loads such as the force & moment on the entire vehicle and distributed loads. In this work two examples of distributed loads are considered: the pressure field on the surface of the vehicle and sectional loads, which are one-dimensional distributions along the axis of the launch vehicle. In some modern flight programs, the integrated loads, such as lift and drag, used to design the guidance and control laws for the vehicle come from wind tunnel testing, while distributed loads are produced using Computational Fluid Dynamics(CFD). The first task that is addressed in this paper, then, is to provide a formal method to adjust the distributed loads so that integrating them matches the prescribed integrated load. In addition, the integrated loads in a launch vehicle typically include an uncertainty estimate. The second task is to distribute this prescribed integrated uncertainty to each point in a distributed load. Both tasks are addressed using the same technique, which is to create distributed load profiles that isolate adjustments to one integrated load while leaving the others unaffected. These adjustments are informed by Proper Orthogonal Decomposition (POD) of the entire CFD-based distributed load database. Once applied, the adjusted distributed loads can be used to evaluate any scalar quantity of interest that might be needed by downstream users such as structural analysis or trajectory modelers.

SLS↗

Diaspora: Resilience-enabling services for science from HPC to edge

Scientific applications of interest to DOE must increasingly engage distributed resources (e.g., instruments, remote computers, data stores, edge devices) and deliver more stringent levels of service (e.g., uninterrupted processing of experiment data streams). In such systems, state is distributed and components can fail in many ways, often silently, making application resilience a major concern. Addressing the resilience needs of such applications requires methods for gaining knowledge of resources and applications and for translating that knowledge into action. We are working on addressing these needs in the context of multi-messenger astronomy, where detecting and responding to unusual transient events in multiple cosmic messengers (gravitational wave, electromagnetic, high- energy particles) from different instruments leads to a federated learning problem.

47 OTHER INSTRUMENTATION↗

Kanerva's sparse distributed memory: An associative memory algorithm well-suited to the Connection Machine

The advent of the Connection Machine profoundly changes the world of supercomputers. The highly nontraditional architecture makes possible the exploration of algorithms that were impractical for standard Von Neumann architectures. Sparse distributed memory (SDM) is an example of such an algorithm. Sparse distributed memory is a particularly simple and elegant formulation for an associative memory. The foundations for sparse distributed memory are described, and some simple examples of using the memory are presented. The relationship of sparse distributed memory to three important computational systems is shown: random-access memory, neural networks, and the cerebellum of the brain. Finally, the implementation of the algorithm for sparse distributed memory on the Connection Machine is discussed.

Rogers, David↗

Electrical Charging of Aerosols and Conductivity of Titan's Atmosphere

We have used recent data on graphitic cloud particles in the atmosphere of Titan to compute the electrical charging of the particles (radii ranging from 0.01 microns to 0.26 microns). The charging on the nightside was rather similar to that obtained earlier except that charge distributions on the particles are now computed and recently obtained cloud particle sizes and density distributions were employed. The negative charge on particles of 0.26 microns peaked at 9 at 150 km altitude. The computations were repeated for the dayside with the addition of photoelectron emission by the particles as a result of the absorption of solar UV radiation. Particles (except the very smallest) now became positively charged with particles of radius 0.26 microns being charged up to +47. Next, very small particles (radii approx. 3 x 10 (sup -4) microns) of polycyclic aromatic hydrocarbons (PAHs) were introduced and treated as sources of negative ions since they could be either neutral or carry one negative charge. Moreover, they are mobile so that they had to be treated like molecular size negative ions although much more massive. They had the effect of substantially reducing the electron densities in the altitude range 190 to 310 km to values less than the negative PAH densities and increasing the peak electron charge on the larger particles. Particles of radius 0.26 microns bore peak charges of approx. +47 at altitudes of approx. 250 km. The simulated effect of PAHs on the nightside proved to be much less pronounced; at the peak negative PAH density, it was less than the electron density. The physics governing these results will be discussed.

Borucki, W. J.↗

Quantum Key Distribution for Critical Infrastructures: Towards Cyber-Physical Security for Hydropower and Dams

Hydropower facilities are often remotely monitored or controlled from a centralized remote control room. Additionally, major component manufacturers monitor the performance of installed components, increasingly via public communication infrastructures. While these communications enable efficiencies and increased reliability, they also expand the cyber-attack surface. Communications may use the internet to remote control a facility’s control systems, or it may involve sending control commands over a network from a control room to a machine. The content could be encrypted and decrypted using a public key to protect the communicated information. These cryptographic encoding and decoding schemes become vulnerable as more advances are made in computer technologies, such as quantum computing. In contrast, quantum key distribution (QKD) and other quantum cryptographic protocols are not based upon a computational problem, and offer an alternative to symmetric cryptography in some scenarios. Although the underlying mechanism of quantum cryptogrpahic protocols such as QKD ensure that any attempt by an adversary to observe the quantum part of the protocol will result in a detectable signature as an increased error rate, potentially even preventing key generation, it serves as a warning for further investigation. In QKD, when the error rate is low enough and enough photons have been detected, a shared private key can be generated known only to the sender and receiver. We describe how this novel technology and its several modalities could benefit the critical infrastructures of dams or hydropower facilities. The presented discussions may be viewed as a precursor to a quantum cybersecurity roadmap for the identification of relevant threats and mitigation.

97 MATHEMATICS AND COMPUTING↗

Densities and vibrational distribution of H(3+) in the Jovian auroral ionosphere

The assumption that H(3+) is in LTE in the region of the Jovian ionosphere from which the emissions originate is tested by calculating the vibrational distribution of H(3+) over the altitude range of 350 to 1500 km above the methane cloud tops. A model of the Jovian auroral ionosphere is constructed in which the neutral temperatures are enhanced over those of the midlatitude ionosphere, as suggested by observations and models of the auroral region. The energy and energy flux were found to be less than those involved in the production of the UV aurora. A computation of the densities and vibrational distribution shows that the distribution of the six lowest states of H(3+) can be determined fairly well in spite of uncertainties in the atomic and molecular data. The computed altitude profiles and vibrational distributions of H(3+) and H2 are consistent with the observations of IR emission in the 2- and 4-micron regions.

Kim, Y. H.↗

Using Parameter Sweep in WaterTAP to Analyze New Water Treatment Technologies

We describe a powerful and generalized parameter sweep tool in this report that was originally developed to analyze the performance of existing and novel water treatment models being developed in WaterTAP. Since WaterTAP is built upon IDAES and Pyomo, the parameter sweep tool can be used to systematically explore and debug the behavior of most Pyomo and IDAES numerical models. In order to enable meaningful analyses, the parameter sweep tool has been designed with the following features: 1) Model flexibility: The parameter sweep tool does not enforce any restrictions on the types of models that can be used with it. As long as a Pyomo model can be solved and the parameter is active and mutable, the tool only needs functions that describe how to run the model, the sweep parameters, and the output quantities of interest. 2) Flexible sampling: The parameter sweep tool has inbuilt functions to generate samples from a random distribution or a multidimensional Euclidean space. Furthermore, the users have to ability to supply samples generated from a tool of their choice. 3) Multiple sweep types: A user can choose from one of 3 types of parameter sweeps depending on their needs. 4) Detailed outputs: Outputs generated by the parameter sweep tool can be stored in detailed H5 file or user-friendly CSV files for post processing. 5) Parallel computing: The parameter sweep supports shared and distributed memory parallel computing to enable the use of high performance computers (HPC) for large-scale analyses. 6) Modular: The parameter sweep tool is self-contained and can easily be integrated within an outer-loop analysis or as desired by the user. 7) Ease of use: The tool is well documented and a simple sweep can be easily executed by following the online documentation in a few lines of code. We demonstrate the use of the parameter sweep tool on a simple water treatment system from the WaterTAP repository and show its parallel scaling performance on an Apple laptop and NREL's Eagle HPC. The parameter sweep tool is actively being used with models currently being developed within WaterTAP and we expect its use to grow beyond it to other IDAES and Pyomo models.

97 MATHEMATICS AND COMPUTING↗

The effects of Reynolds number, rotor incidence angle, and surface roughness on the heat transfer distribution in a large-scale turbine rotor passage

A combined experimental and computational program was conducted to examine the heat transfer distribution in a turbine rotor passage geometrically similiar to the Space Shuttle Main Engine (SSME) High Pressure Fuel Turbopump (HPFTP). Heat transfer was measured and computed for both the full-span suction and pressure surfaces of the rotor airfoil as well as for the hub endwall surface. The primary objective of the program was to provide a benchmark-quality data base for the assessment of rotor passage heat transfer computational procedures. The experimental portion of the study was conducted in a large-scale, ambient temperature, rotating turbine model. Heat transfer data were obtained using thermocouple and liquid-crystal techniques to measure temperature distributions on the thin, electrically-heated skin of the rotor passage model. Test data were obtained for various combinations of Reynolds number, rotor incidence angle and model surface roughness. The data are reported in the form of contour maps of Stanton number. These heat distribution maps revealed numerous local effects produced by the three-dimensional flows within the rotor passage. Of particular importance were regions of local enhancement produced on the airfoil suction surface by the main-passage and tip-leakage vortices and on the hub endwall by the leading-edge horseshoe vortex system. The computational portion consisted of the application of a well-posed parabolized Navier-Stokes analysis to the calculation of the three-dimensional viscous flow through ducts simulating the a gas turbine passage. These cases include a 90 deg turning duct, a gas turbine cascade simulating a stator passage, and a gas turbine rotor passage including Coriolis forces. The calculated results were evaluated using experimental data of the three-dimensional velocity fields, wall static pressures, and wall heat transfer on the suction surface of the turbine airfoil and on the end wall. Particular attention was paid to an accurate modeling of the passage vortex and to the development of the wall boundary layers including crossflow.

Blair, Michael F.↗

Electron capture in carbon dwarf supernovae

The rates of electron capture on heavier elements under the extreme conditions predicted for dwarf star supernovae have been computed, incorporating modifications that seem to be indicated by present experimental results. An estimate of the maximum possible value of such rates is also given. The distribution of nuclei in nuclear statistical equilibrium has been calculated for the range of expected supernovae conditions, including the effects of the temperature dependence of nuclear partition functions. These nuclide abundance distributions are then used to compute nuclear equilibrium thermodynamic properties. The effects of the electron capture on such equilibrium matter are discussed. In the context of the 'carbon detonation' supernova model, the dwarf central density required to ensure core collapse to a neutron star configuration is found to be slightly higher than that obtained by Bruenn (1972) with the electron capture rates of Hansen (1966).-

Mazurek, T. J.↗

Inverse dynamics: Simultaneous trajectory tracking and vibration reduction with distributed actuators

This paper addresses the problem of inverse dynamics for articulated flexible structures with both lumped and distributed actuators. This problem arises, for example, in the combined vibration minimization and trajectory control of space robots and structures. A new inverse dynamics scheme for computing the nominal lumped and distributed inputs for tracking a prescribed trajectory is given.

Devasia, Santosh↗

An explicit form of the Mie phase matrix for multiple scattering calculations in the I, Q, U, and V representation

An explicit expression is obtained for the phase matrix in the I, Q, U, and V Stokes vector representation for a system containing a polydispersion of spherical particles. All of the symmetry relations derived by Hovenier using general arguments are established explicitly. Convenient algorithms are given for the computation of the phase matrix for a spherical polydispersion. Since this theory is so vitally important in radiative transfer, many researchers will need to compute these functions for realistic aerosols distributions. Therefore, results are presented for a haze L distribution so that other researchers will have a way of checking their programs which compute these quantities.

Kattawar, G. W.↗

The inversion of VLF-LF sounder data to obtain D-region electron-density distributions

The direct problem is to compute reflection coefficients for an assumed electron-density profile, using a full-wave solution. The inverse problem is treated numerically, using derivatives of the reflection matrix with respect to model parameters. A technique for the rapid computation of the derivatives is described. An algorithm for determining resolution in the profile is discussed.

Shellman, C. H.↗

Econ's optimal decision model of wheat production and distribution-documentation

The report documents the computer programs written to implement the ECON optical decision model. The programs were written in APL, an extremely compact and powerful language particularly well suited to this model, which makes extensive use of matrix manipulations. The algorithms used are presented and listings of and descriptive information on the APL programs used are given. Possible changes in input data are also given.

Source record↗

Understanding the Scalability of Bayesian Network Inference using Clique Tree Growth Curves

Bayesian networks (BNs) are used to represent and efficiently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to perform computation in BNs is clique tree clustering and propagation. In this approach, BN computation consists of propagation in a clique tree compiled from a Bayesian network. There is a lack of understanding of how clique tree computation time, and BN computation time in more general, depends on variations in BN size and structure. On the one hand, complexity results tell us that many interesting BN queries are NP-hard or worse to answer, and it is not hard to find application BNs where the clique tree approach in practice cannot be used. On the other hand, it is well-known that tree-structured BNs can be used to answer probabilistic queries in polynomial time. In this article, we develop an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN's non-root nodes to the number of root nodes, or (ii) the expected number of moral edges in their moral graphs. Our approach is based on combining analytical and experimental results. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for each set. For the special case of bipartite BNs, we consequently have two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, we systematically increase the degree of the root nodes in bipartite Bayesian networks, and find that root clique growth is well-approximated by Gompertz growth curves. It is believed that this research improves the understanding of the scaling behavior of clique tree clustering, provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms, and presents an aid for analytical trade-off studies of clique tree clustering using growth curves.

Mengshoel, Ole Jakob↗

Refine your search to explore more results.