SEARCH · Engineering Papers

Results for “Arithmetic”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 595 records · Page 33

All sources NASA NTRS DOE OSTI

NASA NTRS2003

Design and Application of Strategies/Tactics in Higher Order Logics

This Proceedings includes both a paper from the implementors of PVS providing guidance for PVS strategy writers and a tutorial on PVS strategy writing distilled from the experience of three PVS users who have written extensive sets of PVS user strategies. Following these are three full papers from the higher-order logic theorem proving community that discuss PVS strategies to enhance arithmetic and other interactive reasoning in PVS; implementing first-order tactics in higher-order provers; and a proposed technique for specifying small step semantics that can be used in multiple higher order logic theorem provers, with illustrations from both Coq and PVS. The Proceedings concludes with three position papers for a panel session that discuss three settings in which development of PVS strategies is worth while.

Archer, Myla↗

NASA NTRS2003

Rapid Prototyping in PVS

PVSio is a conservative extension to the PVS prelude library that provides basic input/output capabilities to the PVS ground evaluator. It supports rapid prototyping in PVS by enhancing the specification language with built-in constructs for string manipulation, floating point arithmetic, and input/output operations.

Munoz, Cesar A.↗

NASA NTRS2002

Vestibulosympathetic reflex during mental stress

Increases in sympathetic neural activity occur independently with either vestibular or mental stimulation, but it is unknown whether sympathetic activation is additive or inhibitive when both stressors are combined. The purpose of the present study was to investigate the combined effects of vestibular and mental stimulation on sympathetic neural activation and arterial pressure in humans. Muscle sympathetic nerve activity (MSNA), arterial pressure, and heart rate were recorded in 10 healthy volunteers in the prone position during 1) head-down rotation (HDR), 2) mental stress (MS; using arithmetic), and 3) combined HDR and MS. HDR significantly (P < 0.05) increased MSNA (9 +/- 2 to 13 +/- 2 bursts/min). MS significantly increased MSNA (8 +/- 2 to 13 +/- 2 bursts/min) and mean arterial pressure (87 +/- 2 to 101 +/- 2 mmHg). Combined HDR and MS significantly increased MSNA (9 +/- 1 to 16 +/- 2 bursts/min) and mean arterial pressure (89 +/- 2 to 100 +/- 3 mmHg). Increases in MSNA (7 +/- 1 bursts/min) during the combination trial were not different from the algebraic sum of each trial performed alone (8 +/- 2 bursts/min). We conclude that the interaction for MSNA and arterial pressure is additive during combined vestibular and mental stimulation. Therefore, vestibular- and stress-mediated increases of MSNA appear to occur independently in humans.

Non-NASA Center↗

NASA NTRS1989

VLSI processors for signal detection in SETI

The objective of the Search for Extraterrestrial Intelligence (SETI) is to locate an artificially created signal coming from a distant star. This is done in two steps: (1) spectral analysis of an incoming radio frequency band, and (2) pattern detection for narrow-band signals. Both steps are computationally expensive and require the development of specially designed computer architectures. To reduce the size and cost of the SETI signal detection machine, two custom VLSI chips are under development. The first chip, the SETI DSP Engine, is used in the spectrum analyzer and is specially designed to compute Discrete Fourier Transforms (DFTs). It is a high-speed arithmetic processor that has two adders, one multiplier-accumulator, and three four-port memories. The second chip is a new type of Content-Addressable Memory. It is the heart of an associative processor that is used for pattern detection. Both chips incorporate many innovative circuits and architectural features.

NASA Program Exobiology↗

NASA NTRS1996

Verification of IEEE Compliant Subtractive Division Algorithms

A parameterized definition of subtractive floating point division algorithms is presented and verified using PVS. The general algorithm is proven to satisfy a formal definition of an IEEE standard for floating point arithmetic. The utility of the general specification is illustrated using a number of different instances of the general algorithm.

Miner, Paul S.↗

NASA NTRS2000

Analysis of cell mechanics in single vinculin-deficient cells using a magnetic tweezer

A magnetic tweezer was constructed to apply controlled tensional forces (10 pN to greater than 1 nN) to transmembrane receptors via bound ligand-coated microbeadswhile optically measuring lateral bead displacements within individual cells. Use of this system with wild-type F9 embryonic carcinoma cells and cells from a vinculin knockout mouse F9 Vin (-/-) revealed much larger differences in the stiffness of the transmembrane integrin linkages to the cytoskeleton than previously reported using related techniques that measured average mechanical properties of large cell populations. The mechanical properties measured varied widely among cells, exhibiting an approximately log-normal distribution. The median lateral bead displacement was 2-fold larger in F9 Vin (-/-) cells compared to wild-type cells whereas the arithmetic mean displacement only increased by 37%. We conclude that vinculin serves a greater mechanical role in cells than previously reported and that this magnetic tweezer device may be useful for probing the molecular basis of cell mechanics within single cells. Copyright 2000 Academic Press.

Non-NASA Center↗

NASA NTRS1995

Effect of vergence on the gain of the linear vestibulo-ocular reflex

We measured the linear vestibulo-ocular reflex (LVOR) and vergence, using binocular search coils, in 3 humans. The subjects were accelerated sinusoidally at 0.5 Hz and 0.2 g peak acceleration, in complete darkness, while performing three different tasks: i) mental arithmetic; ii) tracking a remembered target at either 0.34 m or 0.14 m distance; and iii) maintaining vergence at either of these distances by means of audio biofeedback based on vergence. Subjects could control vergence using the audio feedback; there was greater convergence with the near audio target. However, there was no significant difference in vergence between the near and far remembered target conditions. With audio feedback, the amplitude of smooth tracking was not consistently different for the near and the far conditions. However, the amplitude of tracking (saccades and smooth component) in the remembered target conditions was greater for near than for far targets. These results suggest that linear VOR amplitude is not determined by vergence alone.

NASA Program Space Physiology and Countermeasures↗

NASA NTRS1994

Use of promethazine to hasten adaptation to provocative motion

In an earlier study, the authors found that severely motion sick individuals could be greatly relieved of their symptoms by intramuscular injections of promethazine (50 mg) or scopolamine (.5 mg). Comparable 50-mg injections of promethazine also have been found effective in alleviating symptoms of space motion sickness. The concern has risen, however, that such drugs may delay or retard the acquisition of adaptation to stressful environments. In the current study, we controlled arousal using a mental arithmetic task and precisely equated the exposure history (number of head movements during rotation) of a placebo, control group and an experimental group who had received promethazine. No differences in total adaptation or in rates of adaptation were present between the two groups. Another experimental group also received promethazine and was allowed to make as many head movements as they could, before reaching nausea, up to 800. This group showed a greater level of adaptation than the placebo group. These results suggest a strategy for dealing with space motion sickness that is described.

Non-NASA Center↗

NASA NTRS2004

Formal Consistency Verification of Deliberative Agents with Respect to Communication Protocols

The aim of this paper is to show a method that is able to detect inconsistencies in the reasoning carried out by a deliberative agent. The agent is supposed to be provided with a hybrid Knowledge Base expressed in a language called CCR-2, based on production rules and hierarchies of frames, which permits the representation of non-monotonic reasoning, uncertain reasoning and arithmetic constraints in the rules. The method can give a specification of the scenarios in which the agent would deduce an inconsistency. We define a scenario to be a description of the initial agent s state (in the agent life cycle), a deductive tree of rule firings, and a partially ordered set of messages and/or stimuli that the agent must receive from other agents and/or the environment. Moreover, the method will make sure that the scenarios will be valid w.r.t. the communication protocols in which the agent is involved.

Ramirez, Jaime↗

NASA NTRS2005

Statistical Considerations of Data Processing in Giovanni Online Tool

The GES DISC Interactive Online Visualization and Analysis Infrastructure (Giovanni) is a web-based interface for the rapid visualization and analysis of gridded data from a number of remote sensing instruments. The GES DISC currently employs several Giovanni instances to analyze various products, such as Ocean-Giovanni for ocean products from SeaWiFS and MODIS-Aqua; TOMS & OM1 Giovanni for atmospheric chemical trace gases from TOMS and OMI, and MOVAS for aerosols from MODIS, etc. (http://giovanni.gsfc.nasa.gov) Foremost among the Giovanni statistical functions is data averaging. Two aspects of this function are addressed here. The first deals with the accuracy of averaging gridded mapped products vs. averaging from the ungridded Level 2 data. Some mapped products contain mean values only; others contain additional statistics, such as number of pixels (NP) for each grid, standard deviation, etc. Since NP varies spatially and temporally, averaging with or without weighting by NP will be different. In this paper, we address differences of various weighting algorithms for some datasets utilized in Giovanni. The second aspect is related to different averaging methods affecting data quality and interpretation for data with non-normal distribution. The present study demonstrates results of different spatial averaging methods using gridded SeaWiFS Level 3 mapped monthly chlorophyll a data. Spatial averages were calculated using three different methods: arithmetic mean (AVG), geometric mean (GEO), and maximum likelihood estimator (MLE). Biogeochemical data, such as chlorophyll a, are usually considered to have a log-normal distribution. The study determined that differences between methods tend to increase with increasing size of a selected coastal area, with no significant differences in most open oceans. The GEO method consistently produces values lower than AVG and MLE. The AVG method produces values larger than MLE in some cases, but smaller in other cases. Further studies indicated that significant differences between AVG and MLE methods occurred in coastal areas where data have large spatial variations and a log-bimodal distribution instead of log-normal distribution.

Suhung, Shen↗

NASA NTRS1996

Optimization of Particle-in-Cell Codes on RISC Processors

General strategies are developed to optimize particle-cell-codes written in Fortran for RISC processors which are commonly used on massively parallel computers. These strategies include data reorganization to improve cache utilization and code reorganization to improve efficiency of arithmetic pipelines.

particle-cell-codes cache utilization code reorgan↗

NASA NTRS2001

A novel bit-wise adaptable entropy coding technique

We present a novel entropy coding technique which is adaptable in that each bit to be encoded may have an associated probability esitmate which depends on previously encoded bits. The technique may have advantages over arithmetic coding. The technique can achieve arbitrarily small redundancy and admits a simple and fast decoder.

data compression entopy coding↗

NASA NTRS2008

A Stable Clock Error Model Using Coupled First and Second Order Gauss-Markov Processes

Long data outages may occur in applications of global navigation satellite system technology to orbit determination for missions that spend significant fractions of their orbits above the navigation satellite constellation(s). Current clock error models based on the random walk idealization may not be suitable in these circumstances, since the covariance of the clock errors may become large enough to overflow flight computer arithmetic. A model that is stable, but which approximates the existing models over short time horizons is desirable. A coupled first- and second-order Gauss-Markov process is such a model.

Carpenter, Russell↗

NASA NTRS2008

Providing Internet Access to High-Resolution Lunar Images

The OnMoon server is a computer program that provides Internet access to high-resolution Lunar images, maps, and elevation data, all suitable for use in geographical information system (GIS) software for generating images, maps, and computational models of the Moon. The OnMoon server implements the Open Geospatial Consortium (OGC) Web Map Service (WMS) server protocol and supports Moon-specific extensions. Unlike other Internet map servers that provide Lunar data using an Earth coordinate system, the OnMoon server supports encoding of data in Moon-specific coordinate systems. The OnMoon server offers access to most of the available high-resolution Lunar image and elevation data. This server can generate image and map files in the tagged image file format (TIFF) or the Joint Photographic Experts Group (JPEG), 8- or 16-bit Portable Network Graphics (PNG), or Keyhole Markup Language (KML) format. Image control is provided by use of the OGC Style Layer Descriptor (SLD) protocol. Full-precision spectral arithmetic processing is also available, by use of a custom SLD extension. This server can dynamically add shaded relief based on the Lunar elevation to any image layer. This server also implements tiled WMS protocol and super-overlay KML for high-performance client application programs.

Plesea, Lucian↗

NASA NTRS2009

Computing Bounds on Resource Levels for Flexible Plans

A new algorithm efficiently computes the tightest exact bound on the levels of resources induced by a flexible activity plan (see figure). Tightness of bounds is extremely important for computations involved in planning because tight bounds can save potentially exponential amounts of search (through early backtracking and detection of solutions), relative to looser bounds. The bound computed by the new algorithm, denoted the resource-level envelope, constitutes the measure of maximum and minimum consumption of resources at any time for all fixed-time schedules in the flexible plan. At each time, the envelope guarantees that there are two fixed-time instantiations one that produces the minimum level and one that produces the maximum level. Therefore, the resource-level envelope is the tightest possible resource-level bound for a flexible plan because any tighter bound would exclude the contribution of at least one fixed-time schedule. If the resource- level envelope can be computed efficiently, one could substitute looser bounds that are currently used in the inner cores of constraint-posting scheduling algorithms, with the potential for great improvements in performance. What is needed to reduce the cost of computation is an algorithm, the measure of complexity of which is no greater than a low-degree polynomial in N (where N is the number of activities). The new algorithm satisfies this need. In this algorithm, the computation of resource-level envelopes is based on a novel combination of (1) the theory of shortest paths in the temporal-constraint network for the flexible plan and (2) the theory of maximum flows for a flow network derived from the temporal and resource constraints. The measure of asymptotic complexity of the algorithm is O(N O(maxflow(N)), where O(x) denotes an amount of computing time or a number of arithmetic operations proportional to a number of the order of x and O(maxflow(N)) is the measure of complexity (and thus of cost) of a maximumflow algorithm applied to an auxiliary flow network of 2N nodes. The algorithm is believed to be efficient in practice; experimental analysis shows the practical cost of maxflow to be as low as O(N1.5). The algorithm could be enhanced following at least two approaches. In the first approach, incremental subalgorithms for the computation of the envelope could be developed. By use of temporal scanning of the events in the temporal network, it may be possible to significantly reduce the size of the networks on which it is necessary to run the maximum-flow subalgorithm, thereby significantly reducing the time required for envelope calculation. In the second approach, the practical effectiveness of resource envelopes in the inner loops of search algorithms could be tested for multi-capacity resource scheduling. This testing would include inner-loop backtracking and termination tests and variable and value-ordering heuristics that exploit the properties of resource envelopes more directly.

Muscvettola, Nicola↗

NASA NTRS2009

Flightspeed Integral Image Analysis Toolkit

The Flightspeed Integral Image Analysis Toolkit (FIIAT) is a C library that provides image analysis functions in a single, portable package. It provides basic low-level filtering, texture analysis, and subwindow descriptor for applications dealing with image interpretation and object recognition. Designed with spaceflight in mind, it addresses: Ease of integration (minimal external dependencies) Fast, real-time operation using integer arithmetic where possible (useful for platforms lacking a dedicated floatingpoint processor) Written entirely in C (easily modified) Mostly static memory allocation 8-bit image data The basic goal of the FIIAT library is to compute meaningful numerical descriptors for images or rectangular image regions. These n-vectors can then be used directly for novelty detection or pattern recognition, or as a feature space for higher-level pattern recognition tasks. The library provides routines for leveraging training data to derive descriptors that are most useful for a specific data set. Its runtime algorithms exploit a structure known as the "integral image." This is a caching method that permits fast summation of values within rectangular regions of an image. This integral frame facilitates a wide range of fast image-processing functions. This toolkit has applicability to a wide range of autonomous image analysis tasks in the space-flight domain, including novelty detection, object and scene classification, target detection for autonomous instrument placement, and science analysis of geomorphology. It makes real-time texture and pattern recognition possible for platforms with severe computational restraints. The software provides an order of magnitude speed increase over alternative software libraries currently in use by the research community. FIIAT can commercially support intelligent video cameras used in intelligent surveillance. It is also useful for object recognition by robots or other autonomous vehicles

Thompson, David R.↗

NASA NTRS2007

Single-Point Access to Data Distributed on Many Processors

A description of the functions and data structures is defined that would be necessary to implement the Chapel concept of distributions, domains, allocation, access, and interfaces to the compiler for transformations from Chapel source to their run-time implementation for these concepts. A complete set of object-oriented operators is defined that enables one to access elements of a distributed array through regular arithmetic index sets, giving the programmer the illusion that all the elements are collocated on a single processor. This means that arbitrary regions of the arrays can be fragmented and distributed across multiple processors with a single point of access. This is important because it can significantly improve programmer productivity by allowing the programmers to concentrate on the high-level details of the algorithm without worrying about the efficiency and communication details of the underlying representation.

James, Mark↗

NASA NTRS2007

Photodetectors on Coronagraph Mask for Pointing Control

It has been proposed to install a symmetrical array of photodetectors about the center of the mask of a coronagraph of the type used to search for planets orbiting remote stars. The purpose of this installation is to utilize the light from a star under observation as a guide in pointing the telescope. Simple arithmetic processing of the outputs of the photodetectors would provide indications of the lateral position of the center of the mask relative to the center of the image of the star. These indications could serve as pointing-control feedback signals for adjusting the telescope aim to center the image of the star on the mask. The widths of central mask areas available for placement of photodetectors differ among coronagraph designs, typically ranging upward from about 100 m. Arrays of photodetectors can readily be placed within areas in this size range. The number of detectors in an array could be as small as 4 or as large as 64. The upper limit on the number of detectors would be determined according to the extent of the occulting pattern and the number of functionalities, in addition to pointing control, to be served by the array.

Balasubramanian, Kunjithapatham↗