Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bounded”

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 631 records · Page 35

Inflectional instabilities in the wall region of bounded turbulent shear flows

The primary thrust of this research was to identify one or more mechanisms responsible for strong turbulence production events in the wall region of bounded turbulent shear flows. Based upon previous work in a transitional boundary layer, it seemed highly probable that the production events were preceded by an inflectional velocity profile which formed on the interface between the low-speed streak and the surrounding fluid. In bounded transitional flows, this unstable profile developed velocity fluctuations in the streamwise direction and in the direction perpendicular to the sheared surface. The rapid growth of these instabilities leads to a breakdown and production of turbulence. Since bounded turbulent flows have many of the same characteristics, they may also experience a similar type of breakdown and turbulence production mechanism.

Swearingen, Jerry D.↗

Search for bound states of the eta-meson in light nuclei

A search for nuclear-bound states of the eta meson was carried out. Targets of lithium, carbon, oxygen, and aluminum were placed in a pion(+) beam at 800 MeV/c. A predicted eta bound state in O-15* (E sub x approx. = 540 MeV) with a width of approx. 9 MeV was not observed. A bound state of a size 1/3 of the predicted cross section would have been seen in this experiment at a confidence level of 3sigma (P is greater than 0.9987).

Chrien, R. E.↗

Mean-square-error bounds for reduced-order linear state estimators

The mean-square error of reduced-order linear state estimators for continuous-time linear systems is investigated. Lower and upper bounds on the minimal mean-square error are presented. The bounds are readily computable at each time-point and at steady state from the solutions to the Ricatti and the Liapunov equations. The usefulness of the error bounds for the analysis and design of reduced-order estimators is illustrated by a practical numerical example.

Baram, Y.↗

Bounds on dark matter in solar orbit

The possibility is considered that a spherical distribution of dark matter (DM), matter not visible with current instruments, is trapped in the sun's gravitational field. Bounds are placed from the motion of Uranus and Neptune, on the amount of DM that could be so trapped within the radius of those planets' orbits, as follows: from the Voyager 2, Uranus-flyby data new, more accurate ephemeris values are generated. Trapped DM mass is bounded by noting that such a distribution would increase the effective mass of the sun as seen by the outer planets and by using the new ephemeris values to bound such an increase.

Anderson, John D.↗

Performance bounds on parallel self-initiating discrete-event

The use is considered of massively parallel architectures to execute discrete-event simulations of what is termed self-initiating models. A logical process in a self-initiating model schedules its own state re-evaluation times, independently of any other logical process, and sends its new state to other logical processes following the re-evaluation. The interest is in the effects of that communication on synchronization. The performance is considered of various synchronization protocols by deriving upper and lower bounds on optimal performance, upper bounds on Time Warp's performance, and lower bounds on the performance of a new conservative protocol. The analysis of Time Warp includes the overhead costs of state-saving and rollback. The analysis points out sufficient conditions for the conservative protocol to outperform Time Warp. The analysis also quantifies the sensitivity of performance to message fan-out, lookahead ability, and the probability distributions underlying the simulation.

Nicol, David M.↗

General upper bound on single-event upset rate

A technique of predicting an upper bound on the rate at which single-event upsets due to ionizing radiation occur in semiconducting memory cells is described. The upper bound on the upset rate, which depends on the high-energy particle environment in earth orbit and accelerator cross-section data, is given by the product of an upper-bound linear energy-transfer spectrum and the mean cross section of the memory cell. Plots of the spectrum are given for low-inclination and polar orbits. An alternative expression for the exact upset rate is also presented. Both methods rely only on experimentally obtained cross-section data and are valid for sensitive bit regions having arbitrary shape.

Chlouber, Dean↗

Flight control application of new stability robustness bounds for linear uncertain systems

This paper addresses the issue of obtaining bounds on the real parameter perturbations of a linear state-space model for robust stability. Based on Kronecker algebra, new, easily computable sufficient bounds are derived that are much less conservative than the existing bounds since the technique is meant for only real parameter perturbations (in contrast to specializing complex variation case to real parameter case). The proposed theory is illustrated with application to several flight control examples.

Yedavalli, Rama K.↗

The wave function and minimum uncertainty function of the bound quadratic Hamiltonian system

The bound quadratic Hamiltonian system is analyzed explicitly on the basis of quantum mechanics. We have derived the invariant quantity with an auxiliary equation as the classical equation of motion. With the use of this invariant it can be determined whether or not the system is bound. In bound system we have evaluated the exact eigenfunction and minimum uncertainty function through unitary transformation.

Yeon, Kyu Hwang↗

An aspect ration bound for triangulating a d-grid cut by a hyperplane

We consider the problem of triangulating a d-dimensional uniform grid of d-cubes that is cut by a k-dimensional affine subspace. The goal is to obtain a triangulation with bounded aspect ratio. To achieve this goal, we allow some of the box faces near the affine subspace to be displaced. This problem has applications to finite element mesh generation. For general d and k, the bound on aspect ratio that we attain is double-exponential in d. For the important special case of d = 3, the aspect ratio bound is small enough that the technique is useful in practice.

Mitchell, Scott A.↗

Pattern Search Algorithms for Bound Constrained Minimization

We present a convergence theory for pattern search methods for solving bound constrained nonlinear programs. The analysis relies on the abstract structure of pattern search methods and an understanding of how the pattern interacts with the bound constraints. This analysis makes it possible to develop pattern search methods for bound constrained problems while only slightly restricting the flexibility present in pattern search methods for unconstrained problems. We prove global convergence despite the fact that pattern search methods do not have explicit information concerning the gradient and its projection onto the feasible region and consequently are unable to enforce explicitly a notion of sufficient feasible decrease.

Lewis, Robert Michael↗

Graph Embedding Techniques for Bounding Condition Numbers of Incomplete Factor Preconditioning

We extend graph embedding techniques for bounding the spectral condition number of preconditioned systems involving symmetric, irreducibly diagonally dominant M-matrices to systems where the preconditioner is not diagonally dominant. In particular, this allows us to bound the spectral condition number when the preconditioner is based on an incomplete factorization. We provide a review of previous techniques, describe our extension, and give examples both of a bound for a model problem, and of ways in which our techniques give intuitive way of looking at incomplete factor preconditioners.

Guattery, Stephen↗

A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds

We give a pattern search adaptation of an augmented Lagrangian method due to Conn, Gould, and Toint. The algorithm proceeds by successive bound constrained minimization of an augmented Lagrangian. In the pattern search adaptation we solve this subproblem approximately using a bound constrained pattern search method. The stopping criterion proposed by Conn, Gould, and Toint for the solution of this subproblem requires explicit knowledge of derivatives. Such information is presumed absent in pattern search methods; however, we show how we can replace this with a stopping criterion based on the pattern size in a way that preserves the convergence properties of the original algorithm. In this way we proceed by successive, inexact, bound constrained minimization without knowing exactly how inexact the minimization is. So far as we know, this is the first provably convergent direct search method for general nonlinear programming.

Lewis, Robert Michael↗

Bounding the Resource Availability of Partially Ordered Events with Constant Resource Impact

We compare existing techniques to bound the resource availability of partially ordered events. We first show that, contrary to intuition, two existing techniques, one due to Laborie and one due to Muscettola, are not strictly comparable in terms of the size of the search trees generated under chronological search with a fixed heuristic. We describe a generalization of these techniques called the Flow Balance Constraint to tightly bound the amount of available resource for a set of partially ordered events with piecewise constant resource impact We prove that the new technique generates smaller proof trees under chronological search with a fixed heuristic, at little increase in computational expense. We then show how to construct tighter resource bounds but at increased computational cost.

Frank, Jeremy↗

Finding Bounded Rational Equilibria: Iterative Focusing - Part 1

A long-running difficulty with conventional game theory has been how to modify it to accommodate the bounded rationality characterizing all real-world players. A recurring issue in statistical physics is how best to approximate joint probability distributions with decoupled (and therefore far more tractable) distributions. It has recently been shown that the same information theoretic mathematical structure, known as Probability Collectives (PC) underlies both issues. This relationship between statistical physics and game theory allows techniques and insights from the one field to be applied to the other. In particular, PC provides a formal model-independent definition of the degree of rationality of a player and of bounded rationality equilibria. This pair of papers extends previous work on PC by introducing new computational approaches to effectively find bounded rationality equilibria of common-interest (team) games.

Wolpert, David H.↗

Finding Bounded Rational Equilibria: Alternative Lagrangians and Uncountable Move Spaces - Part 2

A long-running difficulty with conventional game theory has been how to modify it to accommodate the bounded rationality characterizing all real-world players. A recurring issue in statistical physics is how best to approximate joint probability distributions with decoupled (and therefore far more tractable) distributions. It has recently been shown that the same information theoretic mathematical structure, known as Probability Collectives (PC) underlies both issues. This relationship between statistical physics and game theory allows techniques and insights &om the one field to be applied to the other. In particular, PC provides a formal model-independent definition of the degree of rationality of a player and of bounded rationality equilibria. This pair of papers extends previous work on PC by introducing new computational approaches to effectively find bounded rationality equilibria of common-interest (team) games.

Wolpert, David H.↗

Pickup Ion Mass Spectrometry for Surface Bounded Exospheres and Composition Mapping of Lunar and Planetary Surfaces

Many of the small to medium sized objects in the solar system can be characterized as having surface bounded exospheres, or atmospheres so tenuous that scale lengths for inter-particle collisions are much larger than the dimensions of the objects. The atmospheres of these objects are the product of their surfaces, both the surface composition and the interactions that occur on them and also their interiors when gases escape from there. Thus by studying surface bounded exospheres it is possible to develop insight into the composition and processes that are taking place on the surface and interiors of these objects. The Moon and Mercury are two examples of planetary bodies with surface bounded exospheres that have been studied through spectroscopic observations of sodium, potassium, and, on the moon, mass spectrometric measurements of lunar gases such as argon and helium.

Keller, J. W.↗

Control of Rate-Bounded Hybrid Systems with Liveness Specifications

In the present paper we examine the control problem for a class of composite hybrid machines (CHMs) that consist of concurrent operation (employing synchronous composition) of elementary hybrid machines (EHMs), that allows both signal sharing and event synchronization. A controller can then be coupled with the plant by means of synchronous composition. We confine our attention to controllers that interact with the system only through event synchronization. We present an initial investigation of synthesis of liveness controllers for hybrid machines. To this end we define open hybrid machines as systems that can interact with the environment through event synchronization and can be therefor be "driven" to their marked configuration by user (controller). Liveness specifications must be associated with timing constraints. We may require that for a specified time limit, every run reach a marked configuration within that time limit. Alternatively, a more relaxed specification may be that, for some (unspecified) global time bound, every run of the system reach a marked configuration within that time bound. Finally, the least restrictive liveness requirement is that every run reach a marked configuration within a finite time limit (but we do not insist on the existence of a global time bound for all runs).

Heymann, Michael↗

College Bound with the Office of Educational Programs

The Educational Programs Office at NASA Glenn Research Center hosts a variety of programs that takes on the hard task of getting students of all ages interested in pursuing careers in science, mathematics, and engineering. To help assist students along the way there are many programs to participate in such as: the explorers, shadowing opportunities, and paid internships. The Educational Programs Office not only creates learning opportunities for students, they also host workshops to help educators enhance their knowledge these fields. This summer I assisted Marie Borowski in the Educational Programs Office with the Tennessee State University College Bound Program. The Tennessee state University College Bound Program is an intensive two-week summer academic workshop designed to introduce minority students to the profession of engineering. NASA Glenn Research Center sent forty dedicated students on a bus to Nashville, Tennessee to experience college life as a whole. At the college the students day consisted of a math class, aeronautics, ACT/SAT preparation, writing and research, African American Culture, computer science, and study sessions. The students also went on educational field trips to the Fisk Museum, the Space and Rocket Center, and the Parthenon Museum. On the last day of the program the students competed in an oratorical contest where the students made a Powerpoint presentation on the class that they enjoyed the most. There were many processes that had to be put into action for the college bound program to run smoothly. The process started in early January with the preparation of applications. Once prepared, the applications were then sent to schools and past participants in hopes of receiving a well-qualified pool of applicants. Once the applications were received, a prescreening is done which ensures all of the information is complete. Then, they are reviewed by a panel, using a rubric to evaluate them, and the semifinalists are then selected. Interviews are held with the students and their parents had to be interviewed by a panel of judges and graded on a rubric. The scores were added up and the forty students were selected. My job this summer was getting the students ready to leave for Tennessee. My job consisted of working very closely with my mentor, Marie Borowski, compile the student data to provide it to the chaperones, TSU records, and NASA records. I learned about the vital communication between the NASA and the TSU program managers. After all the planning was done and the program had begun I had a chance to fly to Tennessee for six days to observe the students daily activities. The students had adjusted very well to the intense schedule, and seemed very enthusiastic about the activities to follow. The whole group was very attentive and enthusiastic program be longer. My goals for the summer were all met. I wanted to learn and retain all the information I possibly could on the job I was given. I was very happy with the end result.

Neal, Brittany D.↗