Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “processors”

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 829 records · Page 46

CTIR spectrometer for large area assessment of gas emissions

Systems for determining the presence and distribution of gas emissions in an area are provided. For example, a system may include one or more light detectors and one or more reflectors and/or one more retroreflectors disposed around the perimeter, a light source configured to emit light at a plurality of wavelengths towards the one or more light detectors and/or the one or more reflectors and/or one or more retroreflectors, and one or more processors configured to receive information representing light intensity detected by the one or more light detectors, respectively at each of the plurality of wavelengths and determine gases present in each path based on the light intensity detected by the respective detector at each of the plurality of wavelengths and distribution thereof. The path being either light source-respective detector, light source-respective reflector-respective detector or light source-respective retroreflector-respective detector. Other system may not use reflectors and/or retroreflectors.

47 OTHER INSTRUMENTATION↗

Systems and methods for detection of occupancy using radio waves

Systems and methods are disclosed for detecting a presence of a person in an area of coverage using radar. A transmitter can transmit radio signals in a first direction in an area of coverage defined by a wall and a floor. A receiver can receive the transmitted radio signals reflected back from the area of coverage. A signal conditioning circuit can process the received radio signals. One or more hardware processors can be programmed to analyze the processed radio signals and detect a presence of a person in the area of coverage based on the analysis. The analysis of the processed signals can be performed in both time and frequency domain. In addition to radar, an input from an infrared sensor can also be used in conjunction with radar based detection.

42 ENGINEERING↗

Multi-sensor fusion for robust autonomous flight in indoor and outdoor environments with a rotorcraft micro-aerial vehicle (MAV)

The subject matter described herein includes a modular and extensible approach to integrate noisy measurements from multiple heterogeneous sensors that yield either absolute or relative observations at different and varying time intervals, and to provide smooth and globally consistent estimates of position in real time for autonomous flight. We describe the development of the algorithms and software architecture for a new 1.9 kg MAV platform equipped with an IMU, laser scanner, stereo cameras, pressure altimeter, magnetometer, and a GPS receiver, in which the state estimation and control are performed onboard on an Intel NUC 3rd generation i3 processor. We illustrate the robustness of our framework in large-scale, indoor-outdoor autonomous aerial navigation experiments involving traversals of over 440 meters at average speeds of 1.5 m/s with winds around 10 mph while entering and exiting buildings.

42 ENGINEERING↗

Real time numerical computation of corrosion rates from corrosion sensors

A method for determining a corrosion rate includes receiving an input signal including corrosion data from a sensor. A signal-to-noise ratio (SNR) and a type of noise is determined from the input signal. A corrosion rate computation method is selected based on the SNR and the type of noise. The corrosion rate is determined, using a processor, based on a selected corrosion rate computation method.

36 MATERIALS SCIENCE↗

System and method for testing true stress and true strain

A true stress testing system broadly comprising a force input machine, an imaging system, and a computer. The imaging system includes a light source for projecting a light beam at the specimen in a first direction and a camera positioned on an opposite side of the specimen for receiving portions of the light beam not blocked by the specimen such that a shadow image of the specimen is created via the camera. The computer may determine a minimum dimension of the specimen perpendicular to the first direction at a point in time over a plurality of points along the force axis via the shadow image of the specimen such that the processor accounts for changes in position of the minimum dimension along the specimen. A true stress of the specimen may then be determined according to the minimum dimension of the specimen perpendicular to the first direction at the point in time.

42 ENGINEERING↗

Systems and methods for nano-tribological manufacturing of nanostructures

The presently disclosed subject matter provides systems and methods for generating nanostructures from tribological films. A probe tip can be immersed in a liquid mixture comprising a plurality of ink particles suspended in a medium. A substrate on which the tribological film is to be generated can also be immersed in the liquid mixture. A processor controlling movement of the probe tip can be configured to cause the probe tip to slide along the substrate in a shape of a desired pattern of the nanostructure with a contact force to cause one or more ink particles of the plurality of ink particles compressed underneath the probe tip to be transformed into a tribological film onto the substrate in the shape of the desired pattern of the nanostructure.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Computer processing through distance-based quality score method in geospatial-temporal semantic graphs

A computer-implemented method of improving processing of overhead image data by a processor using a distance-based quality score in a geospatial-temporal semantic graph. An allowable range for each attribute in the subgraph search template is defined. For each match in a comparison, attribute values of each match element are compared against the preferred range and the allowable range to compute a corresponding distance of each match attribute from the subgraph search template. A corresponding overall match quality score is determined for each match from the subgraph search template, wherein determining the corresponding overall match qualities is performed using a corresponding required quality score and a corresponding optional quality score. All corresponding overall match quality scores are sorted into an ordered list and then displayed.

97 MATHEMATICS AND COMPUTING↗

An Adaptive-Mesh-Refinement Based Computational Tool for Simulating Catalysis at Mesoscale

In this work, we present a computational tool for mesoscale applications using open-source exascale- computing compatible adaptive-mesh-refinement (AMR) library, AMReX [2]. AMReX is software library that enables development of application solvers with block-structured Cartesian AMR. Our tool has capabilities to include realistic geometry representation, chemical species transport, reactions and thermodynamics that are critical for capturing mesoscale physics. A significant achievement is the ability of our solver to automatically import electron microscopy data in the form of a stereolithography (STL) or pixelated file format (mrc, tiff) without undergoing the tedious task of unstructured mesh generation. This feature allows for rapid simulation of catalyst particles with complex morphologies using an immersed-boundary formulation. The use of AMR allows for higher resolutions at catalyst surface interfaces, which in turn provides an accurate description of surface reactions and transport. Our solver uses a hybrid distributed and shared memory parallelism (OpenMP/GPU-based) with which strong scaling up to 10,000 processors for realistic catalyst particle simulations have been demonstrated.

BIOMASS FUELS,MATHEMATICS AND COMPUTING↗

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗

TriC: Distributed-memory Triangle Counting by Exploiting the Graph Structure

Graph analytics has emerged as an important tool in the analysis of large scale data from diverse application domains such as social networks, cyber security and bioinformatics. Counting the number of triangles in a graph is a fundamental kernel with several applications such as detecting the community structure of a graph or in identifying important vertices in a graph. The ubiquity of massive datasets is driving the need to scale graph analytics on parallel systems. However, numerous challenges exist in efficiently parallelizing graph algorithms, especially on distributed-memory systems. Irregular memory accesses and communication patterns, low computation to communication ratios, and the need for frequent synchronization are some of the leading challenges. In this paper, we present TriC, our distributed-memory implementation of triangle counting in graphs using the Message Passing Interface (MPI), as a submission to the 2020 GraphChallenge competition. Using a set of synthetic and real-world inputs from the challenge, we demonstrate a speedup of up to 90x relative to previous work on 32 processor-cores of a NERSC Cori node. We also provide details from distributed runs with up to8192 processes along with strong scaling results. The observations presented in this work provide an understanding of the system-level bottlenecks at scale that specifically impact sparse-irregular workloads and will therefore benefit other efforts to parallelize graph algorithms.

Halappanavar, Mahantesh↗

Method and apparatus for maintaining data coherence in a non-uniform compute device

A data processing apparatus includes one or more host processors with first processing units, one or more caches with second processing unit, a non-cache memory having a third processing unit and a reorder buffer operable to maintain data order during execution of a program of instructions. An instruction scheduler routes instructions to the processing units. Data coherence is maintained by control logic that blocks access to data locations in use by a selected processing unit other than the selected processing unit until data associated with the data locations are released from the reorder buffer. Data stored in the cache is written to the memory if it is already in a modified state, otherwise the state is set to the modified state. A memory controller may be used to restrict access to memory locations to be operated on.

97 MATHEMATICS AND COMPUTING↗

Mesoporous metal doped cerium oxide catalyst

A mesoporous metal doped cerium oxide catalyst is provided. The catalyst can contain nanotextured cerium oxide (CeO2) which can be utilized for hydrogen production or reformate gas purification in a water gas shift reaction. The catalyst may be advantageously used to remove CO from a gas containing CO. The catalyst may also be incorporated into a fuel processor.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Reduced number of counters for reliable messaging

A shared memory maintained by sender processes stores a sequence number counter per destination process. A sender process increments the sequence number counter in the shared memory in sending a message to a destination process. The sender process sends a data packet comprising the message and at least a sequence number specified by the sequence number counter. All of the sender processes share a sequence number counter per destination process, each of the sender processes incrementing the sequence number counter in sending a respective message. Receiver processes run on the hardware processor, each of the receiver processes maintaining a local memory counter on the memory, the local memory counter associated with a sending node. The local memory counter stores a sequence number of a message received from the sending node. The receiver process delivers incoming data packets ordered by sequence numbers of the data packets.

Kumar, Sameer↗

Method and apparatus for evaluating superconducting tunnel junction detector noise versus bias voltage

A technique for characterizing the noise behavior of a superconducting tunnel junction (STJ) detector as a function of its applied bias voltage Vb by stepping the STJ's bias voltage across a predetermined range and, at each applied bias, making multiple measurements of the detector's current, calculating their mean and their standard deviation from their mean, and using this standard deviation as a measure of the STJ detector's noise at that applied bias. Because the method is readily executed under computer control, it is particularly useful when large numbers of STJ detectors require biasing, as in STJ detector arrays In a preferred implementation, the STJ is measured under computer control by attaching it to a digital spectrometer comprising a digital x-ray processor (DXP) coupled to a preamplifier that can set the STJ's bias voltage Vb using a digital-to-analog converter (DAC) controlled by the DXP.

Warburton, William K.↗

Optimizing software-directed instruction replication for GPU error detection

Software-only and software-hardware optimizations to reduce the overhead of intra-thread instruction duplication on a GPU or other instruction processor are disclosed. The optimizations trade off error containment for performance and include ISA extensions with limited hardware changes and area costs.

Hari, Siva↗

Prioritizing local and remote memory access in a non-uniform memory access architecture

A miss in a cache by a thread in a wavefront is detected. The wavefront includes a plurality of threads that are executing a memory access request concurrently on a corresponding plurality of processor cores. A priority is assigned to the thread based on whether the memory access request is addressed to a local memory or a remote memory. The memory access request for the thread is performed based on the priority. In some cases, the cache is selectively bypassed depending on whether the memory access request is addressed to the local or remote memory. A cache block is requested in response to the miss. The cache block is biased towards a least recently used position in response to requesting the cache block from the local memory and towards a most recently used position in response to requesting the cache block from the remote memory.

Boyer, Michael W.↗

Window obscuration sensors for mobile gas and chemical imaging cameras

An infrared (IR) imaging system for determining a concentration of a target species in an object is disclosed. The imaging system can include an optical system including a focal plane array (FPA) unit behind an optical window. The optical system can have components defining at least two optical channels thereof, said at least two optical channels being spatially and spectrally different from one another. Each of the at least two optical channels can be positioned to transfer IR radiation incident on the optical system towards the optical FPA. The system can include a processing unit containing a processor that can be configured to acquire multispectral optical data representing said target species from the IR radiation received at the optical FPA. One or more of the optical channels may be used in detecting objects on or near the optical window, to avoid false detections of said target species.

Mallery, Ryan↗

Detecting faults in wind turbines

A wind turbine generator fault detection method is described. The method includes obtaining a first signal from a generator of a wind turbine and a second signal from a vibration sensor coupled to the wind turbine, the first signal representing an output current of the generator, and the second signal being a time-sampled signal representing vibrations of a bearing in the wind turbine. Determining a shaft rotation frequency signal from the first signal, the shaft rotation frequency signal representing a time-varying rotational speed of a shaft of the wind turbine. Resampling an envelope of the second signal based on the shaft rotation frequency signal to provide a third signal, the third signal being an angular sampled signal. Detecting, by the at least one processor, a fault in the bearing of the wind turbine by identifying a characteristic signature of a bearing fault in the third signal.

Qiao, Wei↗