Search NASA⌕ Search

SEARCH · Search NASA

Results for “matched bound”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

Match-bounded String Rewriting Systems

We introduce a new class of automated proof methods for the termination of rewriting systems on strings. The basis of all these methods is to show that rewriting preserves regular languages. To this end, letters are annotated with natural numbers, called match heights. If the minimal height of all positions in a redex is h+1 then every position in the reduct will get height h+1. In a match-bounded system, match heights are globally bounded. Using recent results on deleting systems, we prove that rewriting by a match-bounded system preserves regular languages. Hence it is decidable whether a given rewriting system has a given match bound. We also provide a sufficient criterion for the abence of a match-bound. The problem of existence of a match-bound is still open. Match-boundedness for all strings can be used as an automated criterion for termination, for match-bounded systems are terminating. This criterion can be strengthened by requiring match-boundedness only for a restricted set of strings, for instance the set of right hand sides of forward closures.

Geser, Alfons↗
NASA NTRS2004

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds

Annotating a letter by a number, one can record information about its history during a reduction. A string rewriting system is called match-bounded if there is a global upper bound to these numbers. In earlier papers we established match-boundedness as a strong sufficient criterion for both termination and preservation of regular languages. We show now that the string rewriting system whose inverse (left and right hand sides exchanged) is match-bounded, also have exceptional properties, but slightly different ones. Inverse match-bounded systems effectively preserve context-free languages; their sets of normalized strings and their sets of immortal strings are effectively regular. These sets of strings can be used to decide the normalization, the termination and the uniform termination problems of inverse match-bounded systems. We also show that the termination problem is decidable in linear time, and that a certain strong reachability problem is deciable, thus solving two open problems of McNaughton's.

Butler, Ricky↗
NASA NTRS2005

Deciding Termination for Ancestor Match- Bounded String Rewriting Systems

Termination of a string rewriting system can be characterized by termination on suitable recursively defined languages. This kind of termination criteria has been criticized for its lack of automation. In an earlier paper we have shown how to construct an automated termination criterion if the recursion is aligned with the rewrite relation. We have demonstrated the technique with Dershowitz's forward closure criterion. In this paper we show that a different approach is suitable when the recursion is aligned with the inverse of the rewrite relation. We apply this idea to Kurth's ancestor graphs and obtain ancestor match-bounded string rewriting systems. Termination is shown to be decidable for this class. The resulting method improves upon those based on match-boundedness or inverse match-boundedness.

Geser, Alfons↗
NASA NTRS1988

Fault diagnosis in sparse multiprocessor systems

The problem of fault diagnosis in multiprocessor systems is considered under a uniformly probabilistic model in which processors are faulty with probability p. This work focuses on minimizing the number of tests that must be conducted in order to correctly diagnose the state of every processor in the system with high probability. A diagnosis algorithm that can correctly diagnose the state of every processor with probability approaching one in a class of systems performing slightly greater than a linear number of tests is presented. A nearly matching lower bound on the number of tests required to achieve correct diagnosis in arbitrary systems is also proven. The number of tests required under this probabilistic model is shown to be significantly less than under a bounded-size fault set model. Because the number of tests that must be conducted is a measure of the diagnosis overhead, these results represent a dramatic improvement in the performance of system-level diagnosis technique.

Blough, Douglas M.↗
NASA NTRS1989

Efficient diagnosis of multiprocessor systems under probabilistic models

The problem of fault diagnosis in multiprocessor systems is considered under a probabilistic fault model. The focus is on minimizing the number of tests that must be conducted in order to correctly diagnose the state of every processor in the system with high probability. A diagnosis algorithm that can correctly diagnose the state of every processor with probability approaching one in a class of systems performing slightly greater than a linear number of tests is presented. A nearly matching lower bound on the number of tests required to achieve correct diagnosis in arbitrary systems is also proven. Lower and upper bounds on the number of tests required for regular systems are also presented. A class of regular systems which includes hypercubes is shown to be correctly diagnosable with high probability. In all cases, the number of tests required under this probabilistic model is shown to be significantly less than under a bounded-size fault set model. Because the number of tests that must be conducted is a measure of the diagnosis overhead, these results represent a dramatic improvement in the performance of system-level diagnosis techniques.

Blough, Douglas M.↗
NASA NTRS1992

Fault-tolerant wait-free shared objects

A concurrent system consists of processes communicating via shared objects, such as shared variables, queues, etc. The concept of wait-freedom was introduced to cope with process failures: each process that accesses a wait-free object is guaranteed to get a response even if all the other processes crash. However, if a wait-free object 'crashes,' all the processes that access that object are prevented from making progress. In this paper, we introduce the concept of fault-tolerant wait-free objects, and study the problem of implementing them. We give a universal method to construct fault-tolerant wait-free objects, for all types of 'responsive' failures (including one in which faulty objects may 'lie'). In sharp contrast, we prove that many common and interesting types (such as queues, sets, and test&set) have no fault-tolerant wait-free implementations even under the most benign of the 'non-responsive' types of failure. We also introduce several concepts and techniques that are central to the design of fault-tolerant concurrent systems: the concepts of self-implementation and graceful degradation, and techniques to automatically increase the fault-tolerance of implementations. We prove matching lower bounds on the resource complexity of most of our algorithms.

Jayanti, Prasad↗
NASA NTRS1992

Fault-tolerant wait-free shared objects

A concurrent system consists of processes and shared objects. Previous research focused on the problem of tolerating process failure. We study the complementary problem of tolerating failures. We divide object failures into two broad classes: responsive and non-responsive. With responsive failures, a faulty object responds to every invocation, but responses may be incorrect. With non-responsive failures, a faulty object may also 'hang' without responding. For each class, we consider crash, and arbitrary types of failures. For each type of failure, we are seeking a universal implementation for fault-tolerant wait-free shared objects. We present (deterministic) implementations for all types of responsive failures, including arbitrary failures. In contrast, we show that even the most benign type of non-responsive failures requires the use of randomization. Of special interest is the problem of implementing fault-tolerant objects using only objects of the same type. We present such fault-tolerant self-implementations for many common object types. Graceful degradation is a desirable property of fault-tolerant implementations: the implemented object never fails more severely than the base objects it is derived from, even if all the base objects fail. For several failure models, we show whether this property can be achieved, and, if so, how. In addition to the above possibility/impossibility results, we also consider the resources complexity of fault-tolerant implementations. In many cases, we present lower bounds and give matching algorithms.

Jayanti, Prasad↗
NASA NTRS1987

Geophysical constraints on lunar bulk composition and structure - A reassessment

Theoretical lunar mantle seismic velocity and density profiles were calculated for a series of specific bulk composition models, thermal models, and evolutionary models. It was found that most of the calculated seismic profiles are in qualitative agreement with the Nakamura (1983) observational mantle seismic velocity model. With respect to the density modeling results, the most interesting finding is that none of the considered models yield mantle density increases that are sufficient to match the adapted upper bound on the lunar moment-of-inertia factor (0.3928). The results suggest that the moon possesses a dense metallic core with a mass in the range of 1 to 4 percent of the lunar mass and that the alumina-rich models of Morgan et al. (1978) and Taylor (1982) are best able to match the middle mantle velocity increase that characterizes the Nakamura model.

Hood, L. L.↗
NASA NTRS2017

Fracture-Based Mesh Size Requirements for Matrix Cracks in Continuum Damage Mechanics Models

This paper evaluates the ability of progressive damage analysis (PDA) finite element (FE) models to predict transverse matrix cracks in unidirectional composites. The results of the analyses are compared to closed-form linear elastic fracture mechanics (LEFM) solutions. Matrix cracks in fiber-reinforced composite materials subjected to mode I and mode II loading are studied using continuum damage mechanics and zero-thickness cohesive zone modeling approaches. The FE models used in this study are built parametrically so as to investigate several model input variables and the limits associated with matching the upper-bound LEFM solutions. Specifically, the sensitivity of the PDA FE model results to changes in strength and element size are investigated.

Leone, Frank A.↗
NASA NTRS1987

Solving very large, sparse linear systems on mesh-connected parallel computers

The implementation of Pan and Reif's Parallel Nested Dissection (PND) algorithm on mesh connected parallel computers is described. This is the first known algorithm that allows very large, sparse linear systems of equations to be solved efficiently in polylog time using a small number of processors. How the processor bound of PND can be matched to the number of processors available on a given parallel computer by slowing down the algorithm by constant factors is described. Also, for the important class of problems where G(A) is a grid graph, a unique memory mapping that reduces the inter-processor communication requirements of PND to those that can be executed on mesh connected parallel machines is detailed. A description of an implementation on the Goodyear Massively Parallel Processor (MPP), located at Goddard is given. Also, a detailed discussion of data mappings and performance issues is given.

Opsahl, Torstein↗
NASA NTRS1984

More than you may want to know about maximum likelihood estimation

A discussion is undertaken concerning the maximum likelihood estimator and the aircraft equations of motion it employs, with attention to the application of the concepts of minimization and estimation to a simple computed aircraft example. Graphic representations are given for the cost functions to help illustrate the minimization process. The basic concepts are then generalized, and estimations obtained from flight data are evaluated. The example considered shows the advantage of low measurement noise, multiple estimates at a given condition, the Cramer-Rao bounds, and the quality of the match between measured and computed data.

Iliff, K. W.↗
NASA NTRS2012

On the Nature and Extent of Optically Thin Marine low Clouds

Macrophysical properties of optically thin marine low clouds over the nonpolar oceans (60 deg S-60 deg N) are measured using 2 years of full-resolution nighttime data from the Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP). Optically thin clouds, defined as the subset of marine low clouds that do not fully attenuate the lidar signal, comprise almost half of the low clouds over the marine domain. Regionally, the fraction of low clouds that are optically thin (f(sub thin,cld)) exhibits a strong inverse relationship with the low-cloud cover, with maxima in the tropical trades (f(sub thin,cld) greater than 0.8) and minima in regions of persistent marine stratocumulus and in midlatitudes (f(sub thin,cld) less than 0.3). Domain-wide, a power law fit describes the cloud length distribution, with exponent beta = 2.03 +/- 0.06 (+/-95% confidence interval). On average, the fraction of a cloud that is optically thin decreases from approximately 1 for clouds smaller than 2 km to less than 0.3 for clouds larger than 30 km. This relationship is found to be independent of region, so that geographical variations in the cloud length distribution explain three quarters of the variance in f(sub thin,cld). Comparing collocated trade cumulus observations from CALIOP and the airborne High Spectral Resolution Lidar reveals that clouds with lengths smaller than are resolvable with CALIOP contribute approximately half of the low clouds in the region sampled. A bounded cascade model is constructed to match the observations from the trades. The model shows that the observed optically thin cloud behavior is consistent with a power law scaling of cloud optical depth and suggests that most optically thin clouds only partially fill the CALIOP footprint.

Leahy, L. V.↗
NASA NTRS1986

Cramer-Rao bounds for signal-to-noise ratio and combiner weight estimation

Cramer-Rao lower bounds on estimator variance are calculated for arbitrary unbiased estimates of signal-to-noise ratio and combiner weight parameters. Estimates are assumed to be based on a discrete set of observables obtained by matched filtering of a biphase modulated signal. The bounds are developed first for a problem model based on one observable per channel symbol period, and then extended to a more general problem in which subperiod observables are also available.

Dolinar, S. J.↗
NASA NTRS1995

Determination of stability and control derivatives from the NASA F/A-18 HARV from flight data using the maximum likelihood method

This report is a compilation of PID (Proportional Integral Derivative) results for both longitudinal and lateral directional analysis that was completed during Fall 1994. It had earlier established that the maneuvers available for PID containing independent control surface inputs from OBES were not well suited for extracting the cross-coupling static (i.e., C(sub N beta)) or dynamic (i.e., C(sub Npf)) derivatives. This was due to the fact that these maneuvers were designed with the goal of minimizing any lateral directional motion during longitudinal maneuvers and vice-versa. This allows for greater simplification in the aerodynamic model as far as coupling between longitudinal and lateral directions is concerned. As a result, efforts were made to reanalyze this data and extract static and dynamic derivatives for the F/A-18 HARV (High Angle of Attack Research Vehicle) without the inclusion of the cross-coupling terms such that more accurate estimates of classical model terms could be acquired. Four longitudinal flights containing static PID maneuvers were examined. The classical state equations already available in pEst for alphadot, qdot and thetadot were used. Three lateral directional flights of PID static maneuvers were also examined. The classical state equations already available in pEst for betadot, p dot, rdot and phi dot were used. Enclosed with this document are the full set of longitudinal and lateral directional parameter estimate plots showing coefficient estimates along with Cramer-Rao bounds. In addition, a representative time history match for each type of meneuver tested at each angle of attack is also enclosed.

Napolitano, Marcello R.↗
NASA NTRS1979

Theoretical modelling and experimental data matching for active and passive microwave remote sensing of Earth terrain

Two theoretical models were developed to characterize terrain media: a random medium with a variance, a horizontal correlation length; and a homogeneous dielectric containing discrete scatterers. The earth terrain is modelled as layers of such scattering media bounded by air above and half-space below. Matching the theoretical results with experimental data collected from vegetation and snow-ice fields shows that: (1) for observation angles near nadir, rough surface effects are important; (2) for snow-ice field the horizontal correlation length is greater than the vertical correlation length whereas for vegetation field their relative sizes depend on the types of vegetation; (3) the vertically polarized backscattering cross-section is always larger than the horizontally polarized backscattering cross-section for half-space scattering media; (4) for snow field displaying diurnal change, a three-layer model including a thin top layer caused by sunlight illumination must be used; and (5) for a random medium with equal horizontal and vertical correlation lengths, the measured data can also be matched with a corresponding discrete scatterer model.

Kong, J. A.↗
NASA NTRS1997

Efficient algorithms for robust feature matching

One of the basic building blocks in any point-based registration scheme involves matching feature points that are extracted from the sensed image to their counterparts in the reference image. This leads to the fundamental problem of point matching: given two sets of points, find the affine transformation that transforms one point set so that its distance from the other point set is minimized. Because of measurement errors and the presence of outlying data points, it is important that the distance measure between two point sets be robust to these effects. We measure distances using the generalized Hausdorff distance. Point matching can be a computationally intensive task, and there have been a number of algorithms and approaches proposed for solving this problem both theoretical and applied. We present two approaches to the point matching problem, in an attempt to reduce the computational complexity of the problem, while still providing guarantees on the quality of the final match. Our first method is an approximation algorithm, which is loosely based on a branch-and-bound approach due to Huttenlocher and Rucklidge. We show that by varying the approximation error bounds, it is possible to achieve a tradeoff between the quality of the match and the running time of the algorithm. Our second method involves a Monte Carlo method for accelerating the search process used in the first algorithm. With high probability this method succeeds in finding an approximately optimal match. We establish the efficiency of our approaches empirically.

Mount, David M.↗
NASA NTRS1992

Robust stabilization, robust performance, and disturbance attenuation for uncertain linear systems

This paper presents a linear quadratic regulator approach to the robust stabilization, robust performance, and disturbance attenuation of uncertain linear systems. The state-feedback designed systems provide both the robust stability with optimal performance and the disturbance attenuation with H-infinity-norm bounds. The proposed approach can be applied to matched and/or mismatched uncertain linear systems. For a matched uncertain linear system, it is shown that the disturbance attenuation robust-stabilizing controllers with or without optimal performance always exist and can be easily determined without searching; whereas, for a mismatched uncertain linear system, the introduced tuning parameters greatly enhance the flexibility of finding the disturbance-attenuation robust-stabilizing controllers.

Wang, Yeih J.↗
NASA NTRSDate not supplied

Solar Cruiser TRAC Boom Development

The TRAC boom studied is a 30 meter, high-aspect ratio and highly nonlinear structural element planned for the NASA Solar Cruiser spacecraft where it would serve as the solar sail’s skeletal system designed to deploy the packaged reflective sail membrane as well as support operational sail tension loads for flight. Key design drivers for this boom are understanding and characterizing load-deformation behavior and quantifying buckling performance–under flight conditions (zero gravity). Knowing that the full-scale solar sail system cannot be feasibly tested for flight conditions under Earth’s gravity, a building block approach is methodically followed to verify finite element analysis (FEA) predictions and to evolve the finite element model (FEM) accordingly, beginning with the lowest level complexity to match global elastic behavior to the highest level complexity to bound theoretical responses under conservative expected flight conditions. Although the testing campaign for the TRAC boom has not developed yet to produce a full-scale test data point that loads the boom to failure, the fidelity of simulations have evolved with success and warrant further interest and work on this high-aspect ratio, but highly stable, deployable structural boom.

Lee Nguyen↗