Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed algorithm”

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,027 records · Page 57
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Blockchain based Communication Architectures with Applications to Private Security Networks

Existing communication protocols in high consequence security networks are highly centralized. While this naively makes the controls easier to physically secure, external actors require fewer resources to disrupt the system because there are fewer points in the system can be destroyed or interrupted without the entire system failing. We present a solution to this problem using a proof-of-work-based blockchain implementation built on MultiChain. We construct a test-bed network containing two types of data input: visual imagers and microwave sensor information. These data types are ubiquitous in perimeter intrusion detection security systems and allow a realistic representation of a real-world network architecture. The cameras in this system use an object detection algorithm to nd important targets in the scene. The raw data from the camera and the outputs from the detection algorithm are then placed in a transaction on the distributed ledger. Similarly, microwave data is used to detect relevant events and are placed in a transaction. These transactions are then bundled into blocks and broadcast to the rest of the network using the Bitcoin-based MultiChain protocol. We develop five tests to examine the security metrics of our network. We performed the five security metric test using different sized networks from 7 to 39 nodes to determine how the metrics scale with respect to size. We nd that when compared to a centralized architecture our implementation provides a resiliency increase that is expected from a blockchain-based protocol without slowing the system so much that a human operator would notice. Furthermore, our approach is able to detect tampering in real time. Based on these results, we theorize that security networks in general could use a blockchain-based approach in a meaningful way.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Introduction to Special Section: Machine Learning for Image-based Geologic Interpretation

Image-based geological interpretation has been a labor-intensive and time-consuming process because it requires well-trained geoscientists to identify geological structures, features, and textures from various types of images. These images include scanning electron microscopic images, optical microscopic images, optical photos, resistivity images, seismic volumes, remote-sensing images, etc. With fast-evolving machine learning (ML) technology and computing power in recent decades, computers can achieve nearhuman-level to super-human-level performance with scalable high efficiency in the computer vision field. These technological revolutions facilitated image-based geological interpretation in petroleum exploration and production. For example, a fault picking method applied to 3-D seismic volume data using deep learning can achieve superior performance in comparison to conventional auto-picking methods. In addition, under the new normal of low oil prices, the petroleum industry seeks cost-effective strategies such as automating traditionally labor-intensive processes. Nevertheless, the potential of applying ML to geological image interpretation is still facing a few key challenges including data scarcity, data distribution, poor data and/or label quality, data leakage, learning algorithms, model architecture, training methodologies, testing and evaluation metrics, hyper-parameters optimization, model drift, production deployment, and the like.

58 GEOSCIENCES↗
DOE OSTI2023

Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the global maximum likelihood estimator from local minima. Simultaneously, a recent trend in theoretical computer science and numerical linear algebra leverages randomization to solve very large, hard problems. The typical approach is to use randomization for a fast approximation and determinism for refinement to yield effective algorithms with theoretical guarantees. Two popular algorithms for Poisson CPD reflect that emergent dichotomy: CP Alternating Poisson Regression is a deterministic algorithm and Generalized Canonical Polyadic decomposition makes use of stochastic algorithms in several variants. This work extends recent work to develop two new methods that leverage randomized and deterministic algorithms for improved accuracy and performance.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1972

Application of finite-element method in the computation of temperature with emphasis on radiative exchanges.

Analyses pertaining to the solution of heat transfer problems in combined modes based on the finite-element method are presented. Two elements - a triangular element employing two spatial variables and a multi-faceted bar element employing one spatial variable - with nonlinear radiation on the boundaries are detailed. The radiative effects considered on the diffuse-gray surface elements include: (1) directional radiant fluxes from distant sources, (2) radiative exchanges including surfaces of prescribed temperatures, and (3) radiative exchanges including elements whose temperatures are not known a priori. The nonlinear part of the boundary condition is treated in two different ways: (1) a consistent linearization method, and (2) a direct energy distribution method. Applications of these elements together with solution algorithms to three sample problems exhibit solution capability and obtainable accuracy.

Lee, H.-P.↗
NASA NTRS1975

Digital image centering. I

A series of parallax plates have been measured on a PDS microdensitometer to assess the possibility of using the PDS for precision relative astrometry and to investigate centering algorithms that might be used to analyze digital images obtained with the Large Space Telescope. The basic repeatability of the PDS is found to be plus or minus 0.6 micron, with the potential for reaching plus or minus 0.2 micron. A very efficient centering algorithm has been developed which fits the marginal density distributions of the image with a Gaussian profile and a sloping background. The accuracy is comparable with the best results obtained with a photoelectric image bisector.

Van Altena, W. F.↗
NASA NTRS1977

Routh's algorithm - A centennial survey

One hundred years have passed since the publication of Routh's fundamental work on determining the stability of constant linear systems. The paper presents an outline of the algorithm and considers such aspects of it as the distribution of zeros and applications of it that relate to the greatest common divisor, the abscissa of stability, continued fractions, canonical forms, the nonnegativity of polynomials and polynomial matrices, the absolute stability, optimality and passivity of dynamic systems, and the stability of two-dimensional circuits.

Barnett, S.↗
NASA NTRS1990

Balancing Loads Among Parallel Data Processors

Heuristic algorithm minimizes amount of memory used by multiprocessor system. Distributes load of many identical, short computations among multiple parallel digital data processors, each of which has its own (local) memory. Each processor operates on distinct and independent set of data in larger shared memory. As integral part of load-balancing scheme, total amount of space used in shared memory minimized. Possible applications include artificial neural networks or image processors for which "pipeline" and vector methods of load balancing inappropriate.

Baffes, Paul Thomas↗
NASA NTRS1990

Inverse dynamics of adaptive structures used as space cranes

As a precursor to the real-time control of fast moving adaptive structures used as space cranes, a formulation is given for the flexibility induced motion relative to the nominal motion (i.e., the motion that assumes no flexibility) and for obtaining the open loop time varying driving forces. An algorithm is proposed for the computation of the relative motion and driving forces. The governing equations are given in matrix form with explicit functional dependencies. A simulator is developed to implement the algorithm on a digital computer. In the formulations, the distributed mass of the crane is lumped by two schemes, vz., 'trapezoidal' lumping and 'Simpson's rule' lumping. The effects of the mass lumping schemes are shown by simulator runs.

Das, S. K.↗
NASA NTRS1991

Tomographic separation of composite spectra - The components of the O-star spectroscopic binary AO Cassiopeiae

The UV photospheric lines of the short-period, double-lined O-star spectroscopic binary AO Cas are analyzed. Archival data from IUE (16 spectra uniformly distributed in orbital phase) were analyzed with a tomography algorithm to produce the separate spectra of the two stars in six spectral regions. The spectral classifications of the primary and secondary, O9.5 III and O8 V, respectively, were estimated through a comparison of UV line ratios with those in spectral standard stars. An intensity ratio of 0.5-0.7 (primary brighter) at 1600 A is compatible with the data.

Bagnuolo, William G., Jr.↗
NASA NTRS1994

Current research activities at the NASA-sponsored Illinois Computing Laboratory of Aerospace Systems and Software

The Illinois Computing Laboratory of Aerospace Systems and Software (ICLASS) was established to: (1) pursue research in the areas of aerospace computing systems, software and applications of critical importance to NASA, and (2) to develop and maintain close contacts between researchers at ICLASS and at various NASA centers to stimulate interaction and cooperation, and facilitate technology transfer. Current ICLASS activities are in the areas of parallel architectures and algorithms, reliable and fault tolerant computing, real time systems, distributed systems, software engineering and artificial intelligence.

Smith, Kathryn A.↗
NASA NTRS1992

An efficient solution procedure for the thermoelastic analysis of truss space structures

A solution procedure is proposed for the thermal and thermoelastic analysis of truss space structures in periodic motion. In this method, the spatial domain is first descretized using a consistent finite element formulation. Then the resulting semi-discrete equations in time are solved analytically by using Fourier decomposition. Geometrical symmetry is taken advantage of completely. An algorithm is presented for the calculation of heat flux distribution. The method is demonstrated via a numerical example of a cylindrically shaped space structure.

Givoli, D.↗
NASA NTRS1995

Parallel adaptive mesh refinement within the PUMAA3D Project

To enable the solution of large-scale applications on distributed memory architectures, we are designing and implementing parallel algorithms for the fundamental tasks of unstructured mesh computation. In this paper, we discuss efficient algorithms developed for two of these tasks: parallel adaptive mesh refinement and mesh partitioning. The algorithms are discussed in the context of two-dimensional finite element solution on triangular meshes, but are suitable for use with a variety of element types and with h- or p-refinement. Results demonstrating the scalability and efficiency of the refinement algorithm and the quality of the mesh partitioning are presented for several test problems on the Intel DELTA.

Freitag, Lori↗
NASA NTRS2006

Modeling Scramjet Flows with Variable Turbulent Prandtl and Schmidt Numbers

A complete turbulence model, where the turbulent Prandtl and Schmidt numbers are calculated as part of the solution and where averages involving chemical source terms are modeled, is presented. The ability of avoiding the use of assumed or evolution Probability Distribution Functions (PDF's) results in a highly efficient algorithm for reacting flows. The predictions of the model are compared with two sets of experiments involving supersonic mixing and one involving supersonic combustion. The results demonstrate the need for consideration of turbulence/chemistry interactions in supersonic combustion. In general, good agreement with experiment is indicated.

Xiao, X.↗
NASA NTRS2009

Development and Evaluation of Sensor Concepts for Ageless Aerospace Vehicles: Report 5 - Phase 2 Implementation of the Concept Demonstrator

This report describes the second phase of the implementation of the Concept Demonstrator experimental test-bed system containing sensors and processing hardware distributed throughout the structure, which uses multi-agent algorithms to characterize impacts and determine a suitable response to these impacts. This report expands and adds to the report of the first phase implementation. The current status of the system hardware is that all 192 physical cells (32 on each of the 6 hexagonal prism faces) have been constructed, although only four of these presently contain data-acquisition sub-modules to allow them to acquire sensor data. Impact detection.. location and severity have been successfully demonstrated. The software modules for simulating cells and controlling the test-bed are fully operational. although additional functionality will be added over time. The visualization workstation displays additional diagnostic information about the array of cells (both real and simulated) and additional damage information. Local agent algorithms have been developed that demonstrate emergent behavior of the complex multi-agent system, through the formation of impact damage boundaries and impact networks. The system has been shown to operate well for multiple impacts. and to demonstrate robust reconfiguration in the presence of damage to numbers of cells.

Batten, Adam↗
NASA NTRS2010

Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol

We use the UPPAAL model checker for Timed Automata to verify the Timing-Sync time-synchronization protocol for sensor networks (TPSN). The TPSN protocol seeks to provide network-wide synchronization of the distributed clocks in a sensor network. Clock-synchronization algorithms for sensor networks such as TPSN must be able to perform arithmetic on clock values to calculate clock drift and network propagation delays. They must be able to read the value of a local clock and assign it to another local clock. Such operations are not directly supported by the theory of Timed Automata. To overcome this formal-modeling obstacle, we augment the UPPAAL specification language with the integer clock derived type. Integer clocks, which are essentially integer variables that are periodically incremented by a global pulse generator, greatly facilitate the encoding of the operations required to synchronize clocks as in the TPSN protocol. With this integer-clock-based model of TPSN in hand, we use UPPAAL to verify that the protocol achieves network-wide time synchronization and is devoid of deadlock. We also use the UPPAAL Tracer tool to illustrate how integer clocks can be used to capture clock drift and resynchronization during protocol execution

Huang, Xiaowan↗
NASA NTRS2012

High Resolution Observations of Drop Size Distribution for GPM Ground Validation

During the Mid-latitude Convective Cloud Experiment (MC3E), NASA's GPM GV Disdrometer and Radar Observations of Precipitation (DROP) Facility deployed an array of disdrometers and rain gauges in northern Oklahoma to sample, with high resolution, the drop size distribution (DSD) for use in development of precipitation retrieval algorithms for the GPM core satellite. The DROP Facility instruments deployed during MC3E consisted of 16 autonomous Parsivel units, 5 two-dimensional video disdrometers (2DVD), a vertical pointing K-band radar and 32 tipping bucket rain gauges. There were several rainfall events during MC3E in which rain drops exceeding 5 mm in diameter were recorded. During a convective rainfall event one of the 2DVDs measured a large rain drop of 8 mm in diameter falling from a convective cell under which several other disdrometers revealed a broad DSD spectrum across this cell and median drop diameter of 3.1 mm. The NPOL radar, which was scanning over the disdrometer array in high resolution RHI mode (every 40 sec), during a stratiform rainfall event revealed a 1 km thick bright band with locally thicker segments that produced rainfall rates of 6-10 mm/hr and indications of DSD modulations as enhanced concentrations of mid-sized rain drops (1.5-3.0 mm) descended below cloud base. These observations are key in characterizing the DSD variability within the 4 km footprint of the GPM Dual-wavelength Precipitation Radar that will provide a global map of precipitation as well as DSD.

Gatlin, Patrick N.↗
NASA NTRS2017

Evidence for Reduced Species Star Formation Rates in the Centers of Massive Galaxies at zeta = 4

We perform the first spatially-resolved stellar population study of galaxies in the early universe z equals 3.5 -6.5, utilizing the Hubble Space Telescope Cosmic Assembly Near-infrared Deep Extragalactic Legacy Survey (CANDELS) imaging dataset over the GOODS-S field. We select a sample of 418 bright and extended galaxies at z less than or approximately equal to 3.5-6.5 from a parent sample of approximately 8000 photometric-redshift selected galaxies from Finkelstein et al. We first examine galaxies at 3.5 less than or equal to z less than or approximately equal to 4.0 using additional deep K-band survey data from the HAWK-I UDS and GOODS Survey (HUGS) which covers the 4000 Angstrom break at these redshifts. We measure the stellar mass, star formation rate, and dust extinction for galaxy inner and outer regions via spatially-resolved spectral energy distribution fitting based on a Markov Chain Monte Carlo algorithm. By comparing specific star formation rates (sSFRs) between inner and outer parts of the galaxies we find that the majority of galaxies with the high central mass densities show evidence for a preferentially lower sSFR in their centers than in their outer regions, indicative of reduced sSFRs in their central regions. We also study galaxies at z approximately equal to 5 and 6 (here limited to high spatial resolution in the rest-frame ultraviolet only), finding that they show sSFRs which are generally independent of radial distance from the center of the galaxies. This indicates that stars are formed uniformly at all radii in massive galaxies at z approximately equal to 5-6, contrary tomassive galaxies at z. less than approximately equal to 4.

early universe – galaxies: bulges – galaxies: ↗
NASA NTRS2019

Quantum Technologies for UAS (QTech)

Recent advances in small Unmanned Aerial System (sUAS) technologies lower the barriers for use by both private and commercial entities. However, these advances are also likely to lead to greater vehicle densities, a more heterogenous mix of vehicles and equipment and greater levels of vehicle autonomy, which can increase the chance for communications disruptions. For the safe and secure operation of these vehicles, it is essential to have a robust communications network. This work is focused on harnessing the power of quantum technologies to enable this robust communications network by: (1) utilizing quantum optimization algorithms to design robust network with routing redundancy that can respond adaptively to dynamically changing real-time environment and disruptions, (2) utilize quantum optimization algorithms resource allocation for detection, localization, and tracking of mobile communication disruption agents and (3) utilize quantum key distribution (QKD) to execute secure key sharing in anti-jamming protocols for secure radio frequency (RF) communication. Efforts to map these quantum optimization algorithms to commercially available quantum annealers and soon to be available general-purpose gate-model quantum hardware architectures will be reviewed, and plans for testing the solutions to these algorithms through indoor sUAS flight tests will be discussed. Lastly, efforts to miniaturize and practically deploy Quantum Key Distribution (QKD) hardware, which could ultimately be used to securely exchange encryption keys, in sUAS networks will be reviewed.

Quantum Computing↗