Search NASA⌕ Search

SEARCH · Search NASA

Results for “ENFORCEMENT”

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,711 records · Page 95

A Refined Zigzag Beam Theory for Composite and Sandwich Beams

A new refined theory for laminated composite and sandwich beams that contains the kinematics of the Timoshenko Beam Theory as a proper baseline subset is presented. This variationally consistent theory is derived from the virtual work principle and employs a novel piecewise linear zigzag function that provides a more realistic representation of the deformation states of transverse-shear flexible beams than other similar theories. This new zigzag function is unique in that it vanishes at the top and bottom bounding surfaces of a beam. The formulation does not enforce continuity of the transverse shear stress across the beam s cross-section, yet is robust. Two major shortcomings that are inherent in the previous zigzag theories, shear-force inconsistency and difficulties in simulating clamped boundary conditions, and that have greatly limited the utility of these previous theories are discussed in detail. An approach that has successfully resolved these shortcomings is presented herein. Exact solutions for simply supported and cantilevered beams subjected to static loads are derived and the improved modelling capability of the new zigzag beam theory is demonstrated. In particular, extensive results for thick beams with highly heterogeneous material lay-ups are discussed and compared with corresponding results obtained from elasticity solutions, two other zigzag theories, and high-fidelity finite element analyses. Comparisons with the baseline Timoshenko Beam Theory are also presented. The comparisons clearly show the improved accuracy of the new, refined zigzag theory presented herein over similar existing theories. This new theory can be readily extended to plate and shell structures, and should be useful for obtaining relatively low-cost, accurate estimates of structural response needed to design an important class of high-performance aerospace structures.

Tessler, Alexander↗

Pattern-Recognition System for Approaching a Known Target

A closed-loop pattern-recognition system is designed to provide guidance for maneuvering a small exploratory robotic vehicle (rover) on Mars to return to a landed spacecraft to deliver soil and rock samples that the spacecraft would subsequently bring back to Earth. The system could be adapted to terrestrial use in guiding mobile robots to approach known structures that humans could not approach safely, for such purposes as reconnaissance in military or law-enforcement applications, terrestrial scientific exploration, and removal of explosive or other hazardous items. The system has been demonstrated in experiments in which the Field Integrated Design and Operations (FIDO) rover (a prototype Mars rover equipped with a video camera for guidance) is made to return to a mockup of Mars-lander spacecraft. The FIDO rover camera autonomously acquires an image of the lander from a distance of 125 m in an outdoor environment. Then under guidance by an algorithm that performs fusion of multiple line and texture features in digitized images acquired by the camera, the rover traverses the intervening terrain, using features derived from images of the lander truss structure. Then by use of precise pattern matching for determining the position and orientation of the rover relative to the lander, the rover aligns itself with the bottom of ramps extending from the lander, in preparation for climbing the ramps to deliver samples to the lander. The most innovative aspect of the system is a set of pattern-recognition algorithms that govern a three-phase visual-guidance sequence for approaching the lander. During the first phase, a multifeature fusion algorithm integrates the outputs of a horizontal-line-detection algorithm and a wavelet-transform-based visual-area-of-interest algorithm for detecting the lander from a significant distance. The horizontal-line-detection algorithm is used to determine candidate lander locations based on detection of a horizontal deck that is part of the lander.

Huntsberger, Terrance↗

Auto-Generated Semantic Processing Services

Auto-Generated Semantic Processing (AGSP) Services is a suite of software tools for automated generation of other computer programs, denoted cross-platform semantic adapters, that support interoperability of computer-based communication systems that utilize a variety of both new and legacy communication software running in a variety of operating- system/computer-hardware combinations. AGSP has numerous potential uses in military, space-exploration, and other government applications as well as in commercial telecommunications. The cross-platform semantic adapters take advantage of common features of computer- based communication systems to enforce semantics, messaging protocols, and standards of processing of streams of binary data to ensure integrity of data and consistency of meaning among interoperating systems. The auto-generation aspect of AGSP Services reduces development time and effort by emphasizing specification and minimizing implementation: In effect, the design, building, and debugging of software for effecting conversions among complex communication protocols, custom device mappings, and unique data-manipulation algorithms is replaced with metadata specifications that map to an abstract platform-independent communications model. AGSP Services is modular and has been shown to be easily integrable into new and legacy NASA flight and ground communication systems.

Davis, Rodney↗

Reactive, Safe Navigation for Lunar and Planetary Robots

When humans return to the moon, Astronauts will be accompanied by robotic helpers. Enabling robots to safely operate near astronauts on the lunar surface has the potential to significantly improve the efficiency of crew surface operations. Safely operating robots in close proximity to astronauts on the lunar surface requires reactive obstacle avoidance capabilities not available on existing planetary robots. In this paper we present work on safe, reactive navigation using a stereo based high-speed terrain analysis and obstacle avoidance system. Advances in the design of the algorithms allow it to run terrain analysis and obstacle avoidance algorithms at full frame rate (30Hz) on off the shelf hardware. The results of this analysis are fed into a fast, reactive path selection module, enforcing the safety of the chosen actions. The key components of the system are discussed and test results are presented.

Utz, Hans↗

Improving the Global Precipitation Record: GPCP Version 2.1

The GPCP has developed Version 2.1 of its long-term (1979-present) global Satellite-Gauge (SG) data sets to take advantage of the improved GPCC gauge analysis, which is one key input. As well, the OPI estimates used in the pre-SSM/I era have been rescaled to 20 years of the SSM/I-era SG. The monthly, pentad, and daily GPCP products have been entirely reprocessed, continuing to enforce consistency of the submonthly estimates to the monthly. Version 2.1 is close to Version 2, with the global ocean, land, and total values about 0%, 6%, and 2% higher, respectively. The revised long-term global precipitation rate is 2.68 mm/d. The corresponding tropical (25 N-S) increases are 0%, 7%, and 3%. Long-term linear changes in the data tend to be smaller in Version 2.1, but the statistics are sensitive to the threshold for land/ocean separation and use of the pre-SSM/I part of the record.

Huffman, George J.↗

MSLICE Science Activity Planner for the Mars Science Laboratory Mission

MSLICE (Mars Science Laboratory InterfaCE) is the tool used by scientists and engineers on the Mars Science Laboratory rover mission to visualize the data returned by the rover and collaboratively plan its activities. It enables users to efficiently and effectively search all mission data to find applicable products (e.g., images, targets, activity plans, sequences, etc.), view and plan the traverse of the rover in HiRISE (High Resolution Imaging Science Experiment) images, visualize data acquired by the rover, and develop, model, and validate the activities the rover will perform. MSLICE enables users to securely contribute to the mission s activity planning process from their home institutions using off-the-shelf laptop computers. This software has made use of several plug-ins (software components) developed for previous missions [e.g., Mars Exploration Rover (MER), Phoenix Mars Lander (PHX)] and other technology tasks. It has a simple, intuitive, and powerful search capability. For any given mission, there is a huge amount of data and associated metadata that is generated. To help users sort through this information, MSLICE s search interface is provided in a similar fashion as major Internet search engines. With regard to the HiRISE visualization of the rover s traverse, this view is a map of the mission that allows scientists to easily gauge where the rover has been and where it is likely to go. The map also provides the ability to correct or adjust the known position of the rover through the overlaying of images acquired from the rover on top of the HiRISE image. A user can then correct the rover s position by collocating the visible features in the overlays with the same features in the underlying HiRISE image. MSLICE users can also rapidly search all mission data for images that contain a point specified by the user in another image or panoramic mosaic. MSLICE allows the creation of targets, which provides a way for scientists to collaboratively name features on the surface of Mars. These targets can also be used to convey instrument-pointing information to the activity plan. The software allows users to develop a plan of what they would like the rover to accomplish for a given time period. When developing the plan, the user can input constraints between activities or groups of activities. MSLICE will enforce said constraints and ensure that all mission flight rules are satisfied.

Powell, Mark W.↗

GIS Methodology for Planning Planetary-Rover Operations

A document describes a methodology for utilizing image data downlinked from cameras aboard a robotic ground vehicle (rover) on a remote planet for analyzing and planning operations of the vehicle and of any associated spacecraft. Traditionally, the cataloging and presentation of large numbers of downlinked planetary-exploration images have been done by use of two organizational methods: temporal organization and correlation between activity plans and images. In contrast, the present methodology involves spatial indexing of image data by use of the computational discipline of geographic information systems (GIS), which has been maturing in terrestrial applications for decades, but, until now, has not been widely used in support of exploration of remote planets. The use of GIS to catalog data products for analysis is intended to increase efficiency and effectiveness in planning rover operations, just as GIS has proven to be a source of powerful computational tools in such terrestrial endeavors as law enforcement, military strategic planning, surveying, political science, and epidemiology. The use of GIS also satisfies the need for a map-based user interface that is intuitive to rover-activity planners, many of whom are deeply familiar with maps and know how to use them effectively in field geology.

Powell, Mark↗

Applications for Subvocal Speech

A research and development effort now underway is directed toward the use of subvocal speech for communication in settings in which (1) acoustic noise could interfere excessively with ordinary vocal communication and/or (2) acoustic silence or secrecy of communication is required. By "subvocal speech" is meant sub-audible electromyographic (EMG) signals, associated with speech, that are acquired from the surface of the larynx and lingual areas of the throat. Topics addressed in this effort include recognition of the sub-vocal EMG signals that represent specific original words or phrases; transformation (including encoding and/or enciphering) of the signals into forms that are less vulnerable to distortion, degradation, and/or interception; and reconstruction of the original words or phrases at the receiving end of a communication link. Potential applications include ordinary verbal communications among hazardous- material-cleanup workers in protective suits, workers in noisy environments, divers, and firefighters, and secret communications among law-enforcement officers and military personnel in combat and other confrontational situations.

Jorgensen, Charles↗

Very-Long-Distance Remote Hearing and Vibrometry

A proposed development of laser-based instrumentation systems would extend the art of laser Doppler vibrometry beyond the prior limits of laser-assisted remote hearing and industrial vibrometry for detecting defects in operating mechanisms. A system according to the proposal could covertly measure vibrations of objects at distances as large as thousands of kilometers and could process the measurement data to enable recognition of vibrations characteristic of specific objects of interest, thereby enabling recognition of the objects themselves. A typical system as envisioned would be placed in orbit around the Earth for use as a means of determining whether certain objects on or under the ground are of interest as potential military targets. Terrestrial versions of these instruments designed for airborne or land- or sea-based operation could be similarly useful for military or law-enforcement purposes. Prior laser-based remote-hearing systems are not capable of either covert operation or detecting signals beyond modest distances when operated at realistic laser power levels. The performances of prior systems for recognition of objects by remote vibrometry are limited by low signal-to-noise ratios and lack of filtering of optical signals returned from targets. The proposed development would overcome these limitations. A system as proposed would include a narrow-band laser as its target illuminator, a lock-in-detection receiver subsystem, and a laser-power-control subsystem that would utilize feedback of the intensity of background illumination of the target to adjust the laser power. The laser power would be set at a level high enough to enable the desired measurements but below the threshold of detectability by an imaginary typical modern photodetector located at the target and there exposed to the background illumination. The laser beam would be focused tightly on the distant target, such that the receiving optics would be exposed to only one speckle. The return signal would be extremely-narrow-band filtered (to sub-kilohertz bandwidth) in the optical domain by a whispering-gallery- mode filter so as to remove most of the background illumination. The filtered optical signal would be optically amplified. This combination of optical filtering and optical amplification would provide an optical signal that would be strong enough to be detectable but not so strong as to saturate the detector in the lock-in detection subsystem.

Maleki, Lute↗

Measuring a Fiber-Optic Delay Line Using a Mode-Locked Laser

The figure schematically depicts a laboratory setup for determining the optical length of a fiber-optic delay line at a precision greater than that obtainable by use of optical time-domain reflectometry or of mechanical measurement of length during the delay-line-winding process. In this setup, the delay line becomes part of the resonant optical cavity that governs the frequency of oscillation of a mode-locked laser. The length can then be determined from frequency-domain measurements, as described below. The laboratory setup is basically an all-fiber ring laser in which the delay line constitutes part of the ring. Another part of the ring - the laser gain medium - is an erbium-doped fiber amplifier pumped by a diode laser at a wavelength of 980 nm. The loop also includes an optical isolator, two polarization controllers, and a polarizing beam splitter. The optical isolator enforces unidirectional lasing. The polarization beam splitter allows light in only one polarization mode to pass through the ring; light in the orthogonal polarization mode is rejected from the ring and utilized as a diagnostic output, which is fed to an optical spectrum analyzer and a photodetector. The photodetector output is fed to a radio-frequency spectrum analyzer and an oscilloscope. The fiber ring laser can generate continuous-wave radiation in non-mode-locked operation or ultrashort optical pulses in mode-locked operation. The mode-locked operation exhibited by this ring is said to be passive in the sense that no electro-optical modulator or other active optical component is used to achieve it. Passive mode locking is achieved by exploiting optical nonlinearity of passive components in such a manner as to obtain ultra-short optical pulses. In this setup, the particular nonlinear optical property exploited to achieve passive mode locking is nonlinear polarization rotation. This or any ring laser can support oscillation in multiple modes as long as sufficient gain is present to overcome losses in the ring. When mode locking is achieved, oscillation occurs in all the modes having the same phase and same polarization. The frequency interval between modes, often denoted the free spectral range (FSR), is given by c/nL, where c is the speed of light in vacuum, n is the effective index of refraction of the fiber, and L is the total length of optical path around the ring. Therefore, the length of the fiber-optic delay line, as part of the length around the ring, can be calculated from the FSRs measured with and without the delay line incorporated into the ring. For this purpose, the FSR measurements are made by use of the optical and radio-frequency spectrum analyzers. In experimentation on a 10-km-long fiber-optic delay line, it was found that this setup made it possible to measure the length to within a fractional error of about 3 10(exp -6), corresponding to a length error of 3 cm. In contrast, measurements by optical time-domain reflectometry and mechanical measurement were found to be much less precise: For optical time-domain reflectometry, the fractional error was found no less than 10(exp -4) (corresponding to a length error of 1 m) and for mechanical measurement, the fractional error was found to be about 10(exp -2) (corresponding to a length error of 100 m).

Tu, Meirong↗

Algorithm That Synthesizes Other Algorithms for Hashing

An algorithm that includes a collection of several subalgorithms has been devised as a means of synthesizing still other algorithms (which could include computer code) that utilize hashing to determine whether an element (typically, a number or other datum) is a member of a set (typically, a list of numbers). Each subalgorithm synthesizes an algorithm (e.g., a block of code) that maps a static set of key hashes to a somewhat linear monotonically increasing sequence of integers. The goal in formulating this mapping is to cause the length of the sequence thus generated to be as close as practicable to the original length of the set and thus to minimize gaps between the elements. The advantage of the approach embodied in this algorithm is that it completely avoids the traditional approach of hash-key look-ups that involve either secondary hash generation and look-up or further searching of a hash table for a desired key in the event of collisions. This algorithm guarantees that it will never be necessary to perform a search or to generate a secondary key in order to determine whether an element is a member of a set. This algorithm further guarantees that any algorithm that it synthesizes can be executed in constant time. To enforce these guarantees, the subalgorithms are formulated to employ a set of techniques, each of which works very effectively covering a certain class of hash-key values. These subalgorithms are of two types, summarized as follows: Given a list of numbers, try to find one or more solutions in which, if each number is shifted to the right by a constant number of bits and then masked with a rotating mask that isolates a set of bits, a unique number is thereby generated. In a variant of the foregoing procedure, omit the masking. Try various combinations of shifting, masking, and/or offsets until the solutions are found. From the set of solutions, select the one that provides the greatest compression for the representation and is executable in the minimum amount of time. Given a list of numbers, try to find one or more solutions in which, if each number is compressed by use of the modulo function by some value, then a unique value is generated.

James, Mark↗

Support for Systematic Code Reviews with the SCRUB Tool

SCRUB is a code review tool that supports both large, team-based software development efforts (e.g., for mission software) as well as individual tasks. The tool was developed at JPL to support a new, streamlined code review process that combines human-generated review reports with program-generated review reports from a customizable range of state-of-the-art source code analyzers. The leading commercial tools include Codesonar, Coverity, and Klocwork, each of which can achieve a reasonably low rate of false-positives in the warnings that they generate. The time required to analyze code with these tools can vary greatly. In each case, however, the tools produce results that would be difficult to realize with human code inspections alone. There is little overlap in the results produced by the different analyzers, and each analyzer used generally increases the effectiveness of the overall effort. The SCRUB tool allows all reports to be accessed through a single, uniform interface (see figure) that facilitates brows ing code and reports. Improvements over existing software include significant simplification, and leveraging of a range of commercial, static source code analyzers in a single, uniform framework. The tool runs as a small stand-alone application, avoiding the security problems related to tools based on Web browsers. A developer or reviewer, for instance, must have already obtained access rights to a code base before that code can be browsed and reviewed with the SCRUB tool. The tool cannot open any files or folders to which the user does not already have access. This means that the tool does not need to enforce or administer any additional security policies. The analysis results presented through the SCRUB tool s user interface are always computed off-line, given that, especially for larger projects, this computation can take longer than appropriate for interactive tool use. The recommended code review process that is supported by the SCRUB tool consists of three phases: Code Review, Developer Response, and Closeout Resolution. In the Code Review phase, all tool-based analysis reports are generated, and specific comments from expert code reviewers are entered into the SCRUB tool. In the second phase, Developer Response, the developer is asked to respond to each comment and tool-report that was produced, either agreeing or disagreeing to provide a fix that addresses the issue that was raised. In the third phase, Closeout Resolution, all disagreements are discussed in a meeting of all parties involved, and a resolution is made for all disagreements. The first two phases generally take one week each, and the third phase is concluded in a single closeout meeting.

Holzmann, Gerald J.↗

Three Dimensional Sector Design with Optimal Number of Sectors

In the national airspace system, sectors get overloaded due to high traffic demand and inefficient airspace designs. Overloads can be eliminated in some cases by redesigning sector boundaries. This paper extends the Voronoi-based sector design method by automatically selecting the number of sectors, allowing three-dimensional partitions, and enforcing traffic pattern conformance. The method was used to design sectors at Fort-Worth and Indianapolis centers for current traffic scenarios. Results show that new designs can eliminate overloaded sectors, although not in all cases, reduce the number of necessary sectors, and conform to major traffic patterns. Overall, the new methodology produces enhanced and efficient sector designs.

Xue, Min↗

Efficient Web Services Policy Combination

Large-scale Web security systems usually involve cooperation between domains with non-identical policies. The network management and Web communication software used by the different organizations presents a stumbling block. Many of the tools used by the various divisions do not have the ability to communicate network management data with each other. At best, this means that manual human intervention into the communication protocols used at various network routers and endpoints is required. Developing practical, sound, and automated ways to compose policies to bridge these differences is a long-standing problem. One of the key subtleties is the need to deal with inconsistencies and defaults where one organization proposes a rule on a particular feature, and another has a different rule or expresses no rule. A general approach is to assign priorities to rules and observe the rules with the highest priorities when there are conflicts. The present methods have inherent inefficiency, which heavily restrict their practical applications. A new, efficient algorithm combines policies utilized for Web services. The method is based on an algorithm that allows an automatic and scalable composition of security policies between multiple organizations. It is based on defeasible policy composition, a promising approach for finding conflicts and resolving priorities between rules. In the general case, policy negotiation is an intractable problem. A promising method, suggested in the literature, is when policies are represented in defeasible logic, and composition is based on rules for non-monotonic inference. In this system, policy writers construct metapolicies describing both the policy that they wish to enforce and annotations describing their composition preferences. These annotations can indicate whether certain policy assertions are required by the policy writer or, if not, under what circumstances the policy writer is willing to compromise and allow other assertions to take precedence. Meta-policies are specified in defeasible logic, a computationally efficient non-monotonic logic developed to model human reasoning. One drawback of this method is that at one point the algorithm starts an exhaustive search of all subsets of the set of conclusions of a defeasible theory. Although the propositional defeasible logic has linear complexity, the set of conclusions here may be large, especially in real-life practical cases. This phenomenon leads to an inefficient exponential explosion of complexity. The current process of getting a Web security policy from combination of two meta-policies consists of two steps. The first is generating a new meta-policy that is a composition of the input meta-policies, and the second is mapping the meta-policy onto a security policy. The new algorithm avoids the exhaustive search in the current algorithm, and provides a security policy that matches all requirements of the involved metapolicies.

Vatan, Farrokh↗

Ultra-Wideband Angle-of-Arrival Tracking Systems

Systems that measure the angles of arrival of ultra-wideband (UWB) radio signals and perform triangulation by use of those angles in order to locate the sources of those signals are undergoing development. These systems were originally intended for use in tracking UWB-transmitter-equipped astronauts and mobile robots on the surfaces of remote planets during early stages of exploration, before satellite-based navigation systems become operational. On Earth, these systems could be adapted to such uses as tracking UWB-transmitter-equipped firefighters inside buildings or in outdoor wildfire areas obscured by smoke. The same characteristics that have made UWB radio advantageous for fine resolution ranging, covert communication, and ground-penetrating radar applications in military and law-enforcement settings also contribute to its attractiveness for the present tracking applications. In particular, the waveform shape and the short duration of UWB pulses make it possible to attain the high temporal resolution (of the order of picoseconds) needed to measure angles of arrival with sufficient precision, and the low power spectral density of UWB pulses enables UWB radio communication systems to operate in proximity to other radio communication systems with little or no perceptible mutual interference.

Arndt, G. Dickey↗

Tail Rotor Airfoils Stabilize Helicopters, Reduce Noise

Founded by former Ames Research Center engineer Jim Van Horn, Van Horn Aviation of Tempe, Arizona, built upon a Langley Research Center airfoil design to create a high performance aftermarket tail rotor for the popular Bell 206 helicopter. The highly durable rotor has a lifetime twice that of the original equipment manufacturer blade, reduces noise by 40 percent, and displays enhanced performance at high altitudes. These improvements benefit helicopter performance for law enforcement, military training, wildfire and pipeline patrols, and emergency medical services.

Source record↗

Adding Hierarchical Objects to Relational Database General-Purpose XML-Based Information Managements

NETMARK is a flexible, high-throughput software system for managing, storing, and rapid searching of unstructured and semi-structured documents. NETMARK transforms such documents from their original highly complex, constantly changing, heterogeneous data formats into well-structured, common data formats in using Hypertext Markup Language (HTML) and/or Extensible Markup Language (XML). The software implements an object-relational database system that combines the best practices of the relational model utilizing Structured Query Language (SQL) with those of the object-oriented, semantic database model for creating complex data. In particular, NETMARK takes advantage of the Oracle 8i object-relational database model using physical-address data types for very efficient keyword searches of records across both context and content. NETMARK also supports multiple international standards such as WEBDAV for drag-and-drop file management and SOAP for integrated information management using Web services. The document-organization and -searching capabilities afforded by NETMARK are likely to make this software attractive for use in disciplines as diverse as science, auditing, and law enforcement.

Lin, Shu-Chun↗

Automated Assignment of Proposals to Reviewers

A computer program automates the process of selecting unbiased peer reviewers of research proposals submitted to NASA. Heretofore, such selection has been performed by manual searching of two large databases subject to a set of assignment rules. One database lists proposals and proposers; the other database lists potential reviewers. The manual search takes an average of several weeks per proposal. In contrast, the present software can perform the selection in seconds. The program begins by selecting one entry from each database, then applying the assignment rules to this pair of entries. If and only if all the assignment rules are satisfied, the chosen reviewer is assigned to the chosen proposal. The assignment rules enforced by the program are (1) a maximum allowable number of proposals assigned to a single reviewer; (2) a maximum allowable number of reviewers assigned to a single proposal; (3) if the proposing team includes a member affiliated with an industry, then the reviewer must not be affiliated with any industry; and (4) the reviewer must not be a member of the proposing team or affiliated with the same institution as that of a member of the proposing team.

Kantak, Anil↗