Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized 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,477 records · Page 82

Highly Scalable, UDP-Based Network Transport Protocols for Lambda Grids and 10 GE Routed Networks

Summary of Report In work prior to this grant, NCDM developed a high performance data transport protocol called SABUL. During this grant, we refined SABUL’s functionality, and then extended both the capabilities and functionality and incorporated them into a new protocol called UDP-based Data transport Protocol, or UDT. We also began preliminary work on Composable UDT, a version of UDT that allows the user to choose among different congestion control algorithms and implement the algorithm of his choice at the time he compiles the code. Specifically, we: · Investigated the theoretical foundations of protocols similar to SABUL and UDT. · Performed design and development work of UDT, a protocol that uses UDP in both the data and control channels. · Began design and development work of Composable UDT, a protocol that supports the use of different congestion control algorithms by simply including the appropriate library when compiling the code. · Performed experimental studies using UDT and Composable UDT using real world applications such as the Sloan Digital Sky Survey (SDSS) astronomical data sets. · Released several versions of UDT and Composable, the most recent being v3.1.

97 MATHEMATICS AND COMPUTING↗

Model and H{sub {infinity}} Controller for a Distributed Parameter System

This paper presents a mathematical model of inductor electromagnetic and heating processes. There is introduced a controller as well, designed to provide a uniform heating supply. The mathematical model is used for a coupled electromagnetic-thermal analysis, since the electromagnetic analysis calculates the density of the heating source and the thermal analysis, that follows, utilizes the obtained heating source density to calculate a bounded heat transfer problem. The finite element method (FEM or FE method) is applied to reduce the problem to a linear system of ODEs and then, by the use of the control theory and the Glover-Doyle algorithm, it is demonstrated how to design a controller to establish a min temperature gradient change in the radial direction (a uniform heating mode). It is well-known that processes, such as the semi-solid forming and hot casting, require the max achievable uniform heating for a min period of time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Event-sequence time series analysis in ground-based gamma-ray astronomy

The recent, extreme episodes of variability detected from Blazars by the leading atmospheric Cerenkov experiments motivate the development and application of specialized statistical techniques that enable the study of this rich data set to its furthest extent. The identification of the shortest variability timescales supported by the data and the actual variability structure observed in the light curves of these sources are some of the fundamental aspects being studied, that answers can bring new developments on the understanding of the physics of these objects and on the mechanisms of production of VHE gamma-rays in the Universe. Some of our efforts in studying the time variability of VHE sources involve the application of dynamic programming algorithms to the problem of detecting change-points in a Poisson sequence. In this particular paper we concentrate on the more primary issue of the applicability of counting statistics to the analysis of time-series on VHE gamma-ray astronomy.

79 ASTRONOMY AND ASTROPHYSICS↗

Particle image velocimetry analysis with simultaneous uncertainty quantification using Bayesian neural networks

Particle image velocimetry (PIV) is an effective tool in experimental fluid mechanics for extracting flow fields from images. Recently, convolutional neural networks (CNNs) have been used to perform PIV analysis with accuracy on par with classical methods. Here we extend the use of CNNs to analyze PIV data while providing simultaneous uncertainty quantification on the inferred flow field. The method we apply in this paper is a Bayesian convolutional neural network (BCNN) which learns distributions of the CNN weights through variational Bayes. In order to demonstrate the utility of BCNNs for the PIV task, we compare the performance of three distinct BCNN models with simple architectures. The first network estimates flow velocity from image interrogation regions only. Our second model learns to infer velocity from both the image interrogation regions and interrogation region cross-correlation maps. Finally, our best performing network infers velocities from interrogation region cross-correlation maps only. We find that BCNNs using interrogation region cross-correlation maps as inputs perform better than those using interrogation windows only as inputs and discuss reasons why this may be the case. Additionally, we test the best performing BCNN on a full synthetic test image pair and a real image pair from the 1st International PIV Challenge. We show that ~98% of true particle displacements from the full synthetic image pair can be captured within the BCNN's 95% confidence intervals, and that the BCNN's performance on the real image pair is quantitatively similar to that of algorithms tested in the 1st International PIV Challenge. Finally, we show that BCNNs can be generalized to be used with multi-pass PIV algorithms with a moderate loss in accuracy, which may be overcome by future work on finetuning and training schemes. So to our knowledge, this is the first use of Bayesian neural networks to perform PIV.

47 OTHER INSTRUMENTATION↗

Radiological Anomaly Detection And Identification (RADAI) v1.0

The Radiological Anomaly Detection and Identification (RADAI) software package is a python library for implementing, training, and storing algorithms that detect and identify anomalies in gamma-ray spectra. The library defines a general framework for implementing detection (binary) and identification (classification) algorithms, objects to encapsulate the results of analyses, a variety of temporal filtering tools that can be used in constructing algorithms, and conceptual design that allows easy reading and writing of algorithms (and their time dependent state). In addition to this framework, the library includes implementations of a variety of algorithms from the scientific literature including: gross-counts k-sigma, SPRT, N-SCRAD, Region of Interest, and Censored Energy Window. The implementation of these algorithms within the RADAI package was done to facilitate user-initiated training and configuration to by applied to different gamma-ray detector types. Finally, benchmarked and synthetic datasets will be made available for standardized algorithm characterization with corresponding utilities in the RADAI package for data access and processing.

Joshi, Tenzing↗

COYOTE : a finite element computer program for nonlinear heat conduction problems. Part I, theoretical background.

The need for the engineering analysis of systems in which the transport of thermal energy occurs primarily through a conduction process is a common situation. For all but the simplest geometries and boundary conditions, analytic solutions to heat conduction problems are unavailable, thus forcing the analyst to call upon some type of approximate numerical procedure. A wide variety of numerical packages currently exist for such applications, ranging in sophistication from the large, general purpose, commercial codes, such as COMSOL, COSMOSWorks, ABAQUS and TSS to codes written by individuals for specific problem applications. The original purpose for developing the finite element code described here, COYOTE, was to bridge the gap between the complex commercial codes and the more simplistic, individual application programs. COYOTE was designed to treat most of the standard conduction problems of interest with a user-oriented input structure and format that was easily learned and remembered. Because of its architecture, the code has also proved useful for research in numerical algorithms and development of thermal analysis capabilities. This general philosophy has been retained in the current version of the program, COYOTE, Version 5.0, though the capabilities of the code have been significantly expanded. A major change in the code is its availability on parallel computer architectures and the increase in problem complexity and size that this implies. The present document describes the theoretical and numerical background for the COYOTE program. This volume is intended as a background document for the user's manual. Potential users of COYOTE are encouraged to become familiar with the present report and the simple example analyses reported in before using the program. The theoretical and numerical background for the finite element computer program, COYOTE, is presented in detail. COYOTE is designed for the multi-dimensional analysis of nonlinear heat conduction problems. A general description of the boundary value problems treated by the program is presented. The finite element formulation and the associated numerical methods used in COYOTE are also outlined. Instructions for use of the code are documented in SAND2010-0714.

99 GENERAL AND MISCELLANEOUS↗

Trusted Computing Technologies, Intel Trusted Execution Technology.

We describe the current state-of-the-art in Trusted Computing Technologies - focusing mainly on Intel's Trusted Execution Technology (TXT). This document is based on existing documentation and tests of two existing TXT-based systems: Intel's Trusted Boot and Invisible Things Lab's Qubes OS. We describe what features are lacking in current implementations, describe what a mature system could provide, and present a list of developments to watch. Critical systems perform operation-critical computations on high importance data. In such systems, the inputs, computation steps, and outputs may be highly sensitive. Sensitive components must be protected from both unauthorized release, and unauthorized alteration: Unauthorized users should not access the sensitive input and sensitive output data, nor be able to alter them; the computation contains intermediate data with the same requirements, and executes algorithms that the unauthorized should not be able to know or alter. Due to various system requirements, such critical systems are frequently built from commercial hardware, employ commercial software, and require network access. These hardware, software, and network system components increase the risk that sensitive input data, computation, and output data may be compromised.

99 GENERAL AND MISCELLANEOUS↗

FY08 LDRD Final Report LOCAL: Locality-Optimizing Caching Algorithms and Layouts

This project investigated layout and compression techniques for large, unstructured simulation data to reduce bandwidth requirements and latency in simulation I/O and subsequent post-processing, e.g. data analysis and visualization. The main goal was to eliminate the data-transfer bottleneck - for example, from disk to memory and from central processing unit to graphics processing unit - through coherent data access and by trading underutilized compute power for effective bandwidth and storage. This was accomplished by (1) designing algorithms that both enforce and exploit compactness and locality in unstructured data, and (2) adapting offline computations to a novel stream processing framework that supports pipelining and low-latency sequential access to compressed data. This report summarizes the techniques developed and results achieved, and includes references to publications that elaborate on the technical details of these methods.

99 GENERAL AND MISCELLANEOUS↗

Harmonia: A Globally Coordinated Garbage Collector for Arrays of Solid-state Drives

Solid-State Drives (SSDs) offer significant performance improvements over hard disk drives (HDD) on a number of workloads. The frequency of garbage collection (GC) activity is directly correlated with the pattern, frequency, and volume of write requests, and scheduling of GC is controlled by logic internal to the SSD. SSDs can exhibit significant performance degradations when garbage collection (GC) conflicts with an ongoing I/O request stream. When using SSDs in a RAID array, the lack of coordination of the local GC processes amplifies these performance degradations. No RAID controller or SSD available today has the technology to overcome this limitation. This paper presents Harmonia, a Global Garbage Collection (GGC) mechanism to improve response times and reduce performance variability for a RAID array of SSDs. Our proposal includes a high-level design of SSD-aware RAID controller and GGC-capable SSD devices, as well as algorithms to coordinate the global GC cycles. Our simulations show that this design improves response time and reduces performance variability for a wide variety of enterprise workloads. For bursty, write dominant workloads response time was improved by 69% while performance variability was reduced by 71%.

99 GENERAL AND MISCELLANEOUS↗

Evaluating the role of reentrant output-to-input feedback in simultaneous pattern processing

Simultaneous Pattern Processing (SPP) is defined as the ability to identify simultaneous-intermixed patterns without isolating them individually (e.g. without separating each pattern in space and processing it individually). Enhanced SPP ability is beneficial for many real-life applications such as scene understanding, separating simultaneous voices, and identifying odorant or taste mixes. The first part of this work identifies how SPP scenarios are problematic to models which train synaptic connections or implement lateral inhibition and quantifies how subtle difficulties lead to complex combinatorial issues. The second part of this work proposes and tests an algorithm motivated by Ubiquitous re-entrant 'output to input' connections found throughout sensory processing regions of the brain. Through these connections the model proposes a dynamic gain mechanism that can provide functionality normally achieved through variable synaptic connections. The re-entrant structure combined with enhanced perfonnance suggests the brain may utilize this configuration for SPP flexibility.

99 GENERAL AND MISCELLANEOUS↗

Rapid Cellular Identification by Dynamic Electromechanical Response

Coupling between electrical and mechanical phenomena is ubiquitous in living systems. Here, we demonstrate rapid identification of cellular organisms using difference in electromechanical activity in a broad frequency range. Principal component analysis of the dynamic electromechanical response spectra bundled with neural network based recognition provides a robust identification algorithm based on their electromechanical signature, and allows unambiguous differentiation of model Micrococcus Lysodeikticus and Pseudomonas Fluorescens system. This methodology provides a universal pathway for biological identification obviating the need for well-defined analytical models of Scanning Probe Microscopy response.

60 APPLIED LIFE SCIENCES↗

New exact anisotropic static spherically symmetric stellar models satisfying the Eiesland condition

In a very recent work (Murad, 2018) one of the present authors represents an algorithm for constructing all the static spherically symmetric exact anisotropic solutions of Einstein’s field equations of embedding class 1 based on a single generating function. In this work we apply the same algorithm to construct stellar models by generalizing some previous and offering some new forms of the generating function. The resulting equation of state and energy density, radial and tangential pressures, pressure anisotropy for a compact star having mass and radius similar to PSR J1614-2230 have been analyzed and the numerical values are found quite in agreement with the authors’ previous works.

79 ASTRONOMY AND ASTROPHYSICS↗

An Axiom System for Sequence-Based Specification

This paper establishes an axiomatic foundation and a representation theorem for the rigorous, constructive process, called sequence-based specification, of deriving precise specifications from ordinary (informal) statements of functional requirements. The representation theorem targets a special class of Mealy state machines, and algorithms are presented for converting from the set of sequences that define the specification to the equivalent Mealy machine, and vice versa. Since its inception, sequence-based specification has been effectively used in a variety of real applications, with gains reported in quality and productivity. This paper establishes the mathematical foundation independently of the process itself.

99 GENERAL AND MISCELLANEOUS↗

Modular Chemical Descriptor Language (MCDL): Stereochemical modules

In our previous papers we introduced the Modular Chemical Descriptor Language (MCDL) for providing a linear representation of chemical information. A subsequent development was the MCDL Java Chemical Structure Editor which is capable of drawing chemical structures from linear representations and generating MCDL descriptors from structures. In this paper we present MCDL modules and accompanying software that incorporate unique representation of molecular stereochemistry based on Cahn-Ingold-Prelog and Fischer ideas in constructing stereoisomer descriptors. The paper also contains additional discussions regarding canonical representation of stereochemical isomers, and brief algorithm descriptions of the open source LINDES, Java applet, and Open Babel MCDL processing module software packages. Testing of the upgraded MCDL Java Chemical Structure Editor on compounds taken from several large and diverse chemical databases demonstrated satisfactory performance for storage and processing of stereochemical information in MCDL format.

99 GENERAL AND MISCELLANEOUS↗

Parallel and Streaming Generation of Ghost Data for Structured Grids

Parallel simulations decompose large domains into many blocks. A fundamental requirement for subsequent parallel analysis and visualization is the presence of ghost data that supplements each block with a layer of adjacent data elements from neighboring blocks. The standard approach for generating ghost data requires all blocks to be in memory at once. This becomes impractical when there are fewer processors - and thus less aggregate memory - available for analysis than for simulation. We describe an algorithm for generating ghost data for structured grids that uses many fewer processors than previously possible. Our algorithm stores as little as one block per processor in memory and can run on as few processors as are available (possibly just one). The key idea is to slightly change the size of the original blocks by declaring parts of them to be ghost data, and by later padding adjacent blocks with this data.

99 GENERAL AND MISCELLANEOUS↗

Digital ratemeter with fast response

Digital ratemeter that operates according to a self-adjusting algorithm, which at low rates automatically switches from a preset count to the preset time method, is proposed. It combines the good properties of both methods concerning the accuracy of the measured average counting rate and the response time to sudden changes of rate.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Advanced control strategies for HVAC&R systems—An overview: Part II: Soft and fusion control

A chronological overview of the advanced control strategies for HVAC&R is presented. The overview focuses on hard-computing or control techniques, such as proportional-integral-derivative, optimal, nonlinear, adaptive, and robust; soft-computing or control techniques, such as neural networks, fuzzy logic, genetic algorithms; and the fusion or hybrid of hard and soft control techniques. Part I focused on hardcontrol strategies; Part II focuses on soft and fusion control and some future directions in HVA&R research. This overview is not intended to be an exhaustive survey on this topic, and any omissions of other works is purely unintentional.

99 GENERAL AND MISCELLANEOUS↗

A Compact Code for Simulations of Quantum Error Correction in Classical Computers

This study considers implementations of error correction in a simulation language on a classical computer. Error correction will be necessarily in quantum computing and quantum information. We will give some examples of the implementations of some error correction codes. These implementations will be made in a more general quantum simulation language on a classical computer in the language Mathematica. The intention of this research is to develop a programming language that is able to make simulations of all quantum algorithms and error corrections in the same framework. The program code implemented on a classical computer will provide a connection between the mathematical formulation of quantum mechanics and computational methods. This gives us a clear uncomplicated language for the implementations of algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗