SEARCH · Search NASA
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.
Panel code PMARC (Panel Method Ames Research Center) numerically simulates flow field around complex three-dimensional bodies, such as complete aircraft models. Based on potential-flow theory. Written in FORTRAN 77, with exception of namelist extension used for input. Structure facilitates addition of new features to code and tailoring of code to specific problems and computer hardware constraints.
The next generation of was turbine combustors for aerospace applications will be required to meet increasingly stringent constraints on fuel efficiency, noise abatement, and emissions. The power plants being designed to meet these constraints will operate at extreme conditions of temperature and pressure, thereby generating unique challenges to the previously employed diagnostic methodologies. Current efforts at NASA Glenn Research Center (GRC) utilize optically accessible, high pressure flametubes and sector combustor rigs to probe, via advanced nonintrusive laser techniques, the complex flowfields encountered in advanced combustor designs. The fuel-air mixing process is of particular concern for lowering NO(x) emissions generated in lean, premixed engine concepts. Using planar laser-induced fluorescence (PLIF) we have obtained real-time, detailed imaging of the fuel spray distribution for a number of fuel injector over a wide range of operational conditions that closely match those expected in the proposed propulsion systems. Using a novel combination of planar imaging, of fuel fluorescence and computational analysis that allows an examination of the flowfield from any perspective, we have produced spatially and temporally resolved fuel-air distribution maps. These maps provide detailed insight into the fuel injection at actual conditions never before possible, thereby greatly enhancing the evaluation of fuel injector performance and combustion phenomena.
The complexity of Venus’ upper atmospheric circulation is still being investigated. Simulations of Venus’ upper atmosphere largely depend on the utility of Rayleigh Friction (RF) as a driver and necessary process to reproduce observations (i.e. temperature, density, nightglow emission). Currently, there are additional observations which provide more constraints to help characterize the driver(s) of the circulation. This work will largely focus on the impact parameterized gravity waves have on Venus’ upper atmosphere circulation within a three dimensional hydrodynamic model (Venus Thermospheric General Circulation Model).
The Rodent Research program at NASAs Ames Research Center (ARC) has pioneered a new research capability on the International Space Station in less than four years and has progressed toward translating research to the ISS utilizing commercial rockets, collaborating with academia and science industry, and training crew for research purposes on-orbit. Animal models are the foundation of pre-clinical research to understand human diseases and evaluate new therapeutics. Advancement in alleviating ground diseases such as muscle atrophy and osteoporosis can come from the study of similar conditions that are known to occur as a result of exposure to the spaceflight environment. During the completion of the flight phase of two missions, our practices, hardware and operations evolved from tested to developed standards, which successfully translated the studies from ground to space. Results from these studies contribute to the science community via both the primary investigation and banked samples that are shared in publicly available data repository such as GeneLab. Every completed mission sets a foundation to build and design greater complexity into future research and answer questions about common human diseases on ground and in space. Here, we present methods developed for the translation of a rodent experiment to the ISS including a description of hardware and kits available for investigators and a discussion of operational constraints.
The most massive stars are thought to lose a significant fraction of their mass in a steady wind during the main-sequence and blue supergiant phases. This in turn sets the stage for their further evolution and eventual supernova, and preconditions the surrounding medium for all following events, with consequences for ISM energization, chemical enrichment, and dust formation. Understanding these processes requires accurate observational constraints on the mass-loss rates of the most luminous stars, which can also be used to test theories of stellar wind driving. In the past, mass-loss rates have been characterized via collisional emission processes such as optical Hα and free-free radio emission, but these so-called “density squared” diagnostics require correction in the presence of widespread clumping. Recent observational and theoretical evidence points to the likelihood of a ubiquitously high level of such clumping in hot-star winds, but quantifying its effects requires a deeper understanding of the complex dynamics of radiatively driven winds and their stochastic instabilities. Furthermore, large-scale structures initiating in surface anisotropies and propagating throughout the wind can also affect wind driving and alter mass-loss diagnostics. Time series spectroscopy of high resonance-line opacity in the UV, capable of high resolution and high signal-to-noise, are required to better understand these complex dynamics, and more accurately determine mass-loss rates. The proposed Polstar mission (Scowen et al. 2022, this volume) provides the necessary resolution at the Sobolev (∼10 km s −1 ) or sound-speed (∼20 km s −1 ) scale, for over three dozen bright galactic massive stars with signal-to noise an order of magnitude above that of the celebrated MEGA campaign (Massa et al. 1995) of the International Ultraviolet Explorer (IUE), via continuous observations that track propagating structures through the winds in real time. Supporting geometric constraints are provided by the polarimetric capabilities present in all the datasets of such a mission.
The experiments planned for the International Space Station promise to be complex, lengthy and diverse. The scarcity of the space station resources will cause significant competition for resources between experiments. The scheduling job facing the Space Station mission planning software requires a concise and comprehensive description of the experiments' requirements (to ensure a valid schedule) and a good description of the experiments' flexibility (to effectively utilize available resources). In addition, the continuous operation of the station, the wide geographic dispersion of station users, and the budgetary pressure to reduce operations manpower make a low-cost solution mandatory. A graphical representation of the scheduling requirements for station payloads implemented via an Internet-based application promises to be an elegant solution that addresses all of these issues. The graphical representation of experiment requirements permits a station user to describe his experiment by defining "activities" and "sequences of activities". Activities define the resource requirements (with alternatives) and other quantitative constraints of tasks to be performed. Activities definitions use an "outline" graphics paradigm. Sequences define the time relationships between activities. Sequences may also define time relationships with activities of other payloads or space station systems. Sequences of activities are described by a "network" graphics paradigm. The bulk of this paper will describe the graphical approach to representing requirements and provide examples that show the ease and clarity with which complex requirements can be represented. A Java applet, to run in a web browser, is being developed to support the graphical representation of payload scheduling requirements. Implementing the entry and editing of requirements via the web solves the problems introduced by the geographic dispersion of users. Reducing manpower is accomplished by developing a concise representation which eliminates the misunderstanding possible with verbose representations and which captures the complete requirements and flexibility of the experiments.
Plant responses to water stress is a major uncertainty to predicting terrestrial ecosystem sensitivity to drought. Different approaches have been developed to represent plant water stress. Empirical approaches (the empirical soil water stress (or Beta) function and the supply-demand balance scheme) have been widely used for many decades; more mechanistic based approaches, that is, plant hydraulic models (PHMs), were increasingly adopted in the past decade. However, the relationships between them—and their underlying connections to physical processes—are not sufficiently understood. This limited understanding hinders informed decisions on the necessary complexities needed for different applications, with empirical approaches being mechanistically insufficient, and PHMs often being too complex to constrain. Here we introduce a unified framework for modeling transpiration responses to water stress, within which we demonstrate that empirical approaches are special cases of the full PHM, when the plant hydraulic parameters satisfy certain conditions. We further evaluate their response differences and identify the associated physical processes. Finally, we propose a methodology for assessing the necessity of added complexities of the PHM under various climatic conditions and ecosystem types, with case studies in three typical ecosystems: a humid Midwestern cropland, a semi-arid evergreen needleleaf forest, and an arid grassland. Notably, Beta function overestimates transpiration when VPD is high due to its lack of constraints from hydraulic transport and is therefore insufficient in high VPD environments. With the unified framework, we envision researchers can better understand the mechanistic bases of and the relationships between different approaches and make more informed choices.
The applicability of integrated parametric models for the budgeting and management of complex projects is investigated. Methods for building a very flexible, interactive prototype for a project planning system, and software resources available for this purpose, are discussed and evaluated. The prototype is required to be sensitive to changing objectives, changing target dates, changing costs relationships, and changing budget constraints. To achieve the integration of costs and project and task durations, parametric cost functions are defined by a process of trapezoidal segmentation, where the total cost for the project is the sum of the various project cost segments, and each project cost segment is the integral of a linearly segmented cost loading function over a specific interval. The cost can thus be expressed algebraically. The prototype was designed using Lotus-123 as the primary software tool. This prototype implements a methodology for interactive project scheduling that provides a model of a system that meets most of the goals for the first phase of the study and some of the goals for the second phase.
A method and apparatus to control a robot or manipulator configuration over the entire motion based on augmentation of the manipulator forward kinematics is disclosed. A set of kinematic functions is defined in Cartesian or joint space to reflect the desirable configuration that will be achieved in addition to the specified end-effector motion. The user-defined kinematic functions and the end-effector Cartesian coordinates are combined to form a set of task-related configuration variables as generalized coordinates for the manipulator. A task-based adaptive scheme is then utilized to directly control the configuration variables so as to achieve tracking of some desired reference trajectories throughout the robot motion. This accomplishes the basic task of desired end-effector motion, while utilizing the redundancy to achieve any additional task through the desired time variation of the kinematic functions. The present invention can also be used for optimization of any kinematic objective function, or for satisfaction of a set of kinematic inequality constraints, as in an obstacle avoidance problem. In contrast to pseudoinverse-based methods, the configuration control scheme ensures cyclic motion of the manipulator, which is an essential requirement for repetitive operations. The control law is simple and computationally very fast, and does not require either the complex manipulator dynamic model or the complicated inverse kinematic transformation. The configuration control scheme can alternatively be implemented in joint space.
VLSI technology has made possible the integration of massive number of components (processors, memory, etc.) into a single chip. In VLSI design, memory and processing power are relatively cheap and the main emphasis of the design is on reducing the overall interconnection complexity since data routing costs dominate the power, time, and area required to implement a computation. Communication is costly because wires occupy the most space on a circuit and it can also degrade clock time. In fact, much of the complexity (and hence the cost) of VLSI design results from minimization of data routing. The main difficulty in VLSI routing is due to the fact that crossing of the lines carrying data, instruction, control, etc. is not possible in a plane. Thus, in order to meet this constraint, the VLSI design aims at keeping the architecture highly regular with local and short interconnection. As a result, while the high level of integration has opened the way for massively parallel computation, practical and full exploitation of such a capability in many applications of interest has been hindered by the constraints on interconnection pattern. More precisely. the use of only localized communication significantly simplifies the design of interconnection architecture but at the expense of somewhat restricted class of applications. For example, there are currently commercially available products integrating; hundreds of simple processor elements within a single chip. However, the lack of adequate interconnection pattern among these processing elements make them inefficient for exploiting a large degree of parallelism in many applications.
This work is an expanded study of one previously published onretrievals of aerosol microphysical properties from space-borne multiwavelengthlidarmeasurements. The earlier studiesand this one weredone in the framework of the NASA Aerosol-Clouds-Ecosystems (now the Aerosol Clouds Convection and Precipitation) NASA mission. The focus here is on the capabilities of a simulated spacebornemultiwavelengthlidar system for retrieving aerosol complex refractive index (m = mr+ imi) and spectral single scattering albedo (SSA(λ)), although other bulk parameters such as effective (reff) radius and particle volume (V) and surface (S) concentrations are also studied. The novelty presented here is the use of recently published, case dependent optimized-constraints on the microphysical retrievals using three backscattering coefficients (β) at 355, 532 and 1064 nm and two extinction coefficients (α) at 355 and 532 nm, typically known as the stand-alone 3β+2α lidar inversion. Case-dependent optimized-constraints (CDOC) limit the ranges of refractive index, both real (mr) and imaginary (mi) parts, and of radii that are permitted in the retrievals. Such constraints are selected directly from the 3β+2α41measurements through an analysis of the relationship between spectral dependence of aerosol extinction-to-backscatter ratios (LR) and the Ångström exponent of extinction. The analyses presented here for different sets ofsize distributions and refractive indices reveal that the direct determination of CDOCareonly feasible for cases where the uncertaintiesin the input optical data areless than 15 %.Forthe same simulated spacebornesystem and yield than in Whiteman et al., (2018), we demonstrated that the use of CDOC as essential for the retrievals of refractive index and also largely improved retrieval of bulk parameters. A discussion of the global representativeness of CDOC is presented using simulated lidar data from a 24-hour satellite track using GEOS model output to initialize the lidar simulator.We found that CDOCare representative of many aerosol mixtures in spite of some outliers (e.g. highly hydrated particles) associatedwith the assumptions of bimodal size distributions and of the same refractive index for fine and coarse modes. Moreover, sensitivity tests performed using synthetic data reveal that retrievals of imaginary refractive index (mi) and SSA are extremely sensitive to β(355).
An enduring question in planetary science is the nature of volatile degassing from rocky planets during their evolution. The reactive nature of planetary volatiles (e.g. H2O, CO2, N, H) make them difficult to directly track through time. Noble gases, like argon, can act as passive tracers of planetary processes, with isotopic ratios providing clues on planetary volatile inventories and fluxes. Previous studies [e.g. 1, 2] use Earth’s argon degassing history to constrain the growth of continental crust. However, that record is limited to the modern 40Ar/36Ar ratio of 298.56 [3] and three time slices recorded in hydrothermal quartz of the Archean Dresser formation [1]: from ~143 (3.5 Ga) to ~212 (2.7 Ga). Due to the paucity of data, partly a result of using nominally K-free minerals, the temporal evolution of atmospheric 40Ar/36Ar remains poorly constrained. K-bearing phases from igneous rocks, forming at high temperature and upper mantle or crustal conditions, are rarely considered viable for recording ancient atmospheric 40Ar/36Ar values. We show that this possible and a potential path to more precise records of ancient atmosphere by leveraging the radiogenic endmember of isotope correlation diagrams. An isochron of coeval biotite grains from the Bushveld Complex [4], with little indication of alteration or excess 40Ar, yield an initial 40Ar/36Ar value that matches the atmospheric 40Ar/36Ar value of ~228 at 2055 Ma in the model of [2]. In addition, new multi-mineral data from the Palisade Sill also match the modelled 40Ar/36Ar value of ~293 at 202 Ma, providing another tie point in the late Triassic. Combined, the Bushveld and Palisades samples provide two new constraints on the ancient atmosphere and help define the history of planetary degassing. These results demonstrate the possibility of accurately and precisely obtaining atmospheric information from igneous rocks, not exclusively K-free phases, thus providing a surplus of ways to reconstruct planetary atmospheres and processes. A robust atmospheric 40Ar/36Ar history also has practical uses and we explore the systematic offsets that arise from using a modern 40Ar/36Ar value in 40Ar/39Ar age calculations of old samples.
General problems associated with on-board trajectory optimization, propulsion system cycle selection, and with the synthesis of guidance laws were addressed for an ascent to low-earth-orbit of an air-breathing single-stage-to-orbit vehicle. The NASA Generic Hypersonic Aerodynamic Model Example and the Langley Accelerator aerodynamic sets were acquired and implemented. Work related to the development of purely analytic aerodynamic models was also performed at a low level. A generic model of a multi-mode propulsion system was developed that includes turbojet, ramjet, scramjet, and rocket engine cycles. Provisions were made in the dynamic model for a component of thrust normal to the flight path. Computational results, which characterize the nonlinear sensitivity of scramjet performance to changes in vehicle angle of attack, were obtained and incorporated into the engine model. Additional trajectory constraints were introduced: maximum dynamic pressure; maximum aerodynamic heating rate per unit area; angle of attack and lift limits; and limits on acceleration both along and normal to the flight path. The remainder of the effort focused on required modifications to a previously derived algorithm when the model complexity cited above was added. In particular, analytic switching conditions were derived which, under appropriate assumptions, govern optimal transition from one propulsion mode to another for two cases: the case in which engine cycle operations can overlap, and the case in which engine cycle operations are mutually exclusive. The resulting guidance algorithm was implemented in software and exercised extensively. It was found that the approximations associated with the assumed time scale separation employed in this work are reasonable except over the Mach range from roughly 5 to 8. This phenomenon is due to the very large thrust capability of scramjets in this Mach regime when sized to meet the requirement for ascent to orbit. By accounting for flight path angle and flight path angle rate in construction of the flight path over this Mach range, the resulting algorithm provides the means for rapid near-optimal trajectory generation and propulsion cycle selection over the entire Mach range from take-off to orbit.
Simulated annealing is used to solve a minimum fuel trajectory problem in the space station environment. The environment is unique because the space station will define the first true multivehicle environment in space. The optimization yields surfaces which are potentially complex, with multiple local minima. Because of the likelihood of these local minima, descent techniques are unable to offer robust solutions. Other deterministic optimization techniques were explored without success. The simulated annealing optimization is capable of identifying a minimum-fuel, two-burn trajectory subject to four constraints. Furthermore, the computational efforts involved in the optimization are such that missions could be planned on board the space station. Potential applications could include the on-site planning of rendezvous with a target craft of the emergency rescue of an astronaut. Future research will include multiwaypoint maneuvers, using a knowledge base to guide the optimization.
We study a routing problem that arises on SIMD parallel architectures whose communication network forms a toroidal mesh. We assume there exists a set of k message descriptors (xi, yi), where (xi, yi) indicates that the ith message's recipient is offset from its sender by xi hops in one mesh dimension, and yi hops in the other. Every processor has k messages to send, and all processors use the same set of message routing descriptors. The SIMD constraint implies that at any routing step, every processor is actively routing messages with the same descriptors as any other processor. We call this isomorphic routing. Our objective is to find the isomorphic routing schedule with least makespan. We consider a number of variations on the problem, yielding complexity results from O(k) to NP-complete. Most of our results follow after we transform the problem into a scheduling problem, where it is related to other well-known scheduling problems.
The session "chondrites: An Awesome Assortment" included the following reports:Nucleation of the Widmanstatten Pattern in Iron Meteorites; Compositions of the Group IVB Iron Meteorites; Sm-Nd Age and Initial 87Sr/86Sr for Yamato 980318: An Old Cumulate Eucrite; Petrology of New Stannern-trend Eucrites and Eucrite Genesis; The Dichotomous HED Meteorite Suite; Early Thermal Evolution of HED Parent Body; Thermal History of the Lodranite Yamato 74357: Constraints from Compositional Zoning and Fe-Mg Ordering; Late Thermal Evolution of Acapulcoites-Lodranites Parent Body: Evidence from Sm-Nd Isotopes and Trace Elements of the LEW 86220 Acapulcoite; Partial Melting Under Reducing Conditions: How are Primitive Achondrites Formed?; Evolution of the Ureilite Parent Body; Complex, Contrasting Behavior of Chromium During Late-Stage Processes in Ureilites; Sahara 99555 and D Orbigny: Possible Pristine Parent Magma of Quenched Angrites; and Devolatilized-Allende Partial Melts as an Analog for Primitive Angrite Magmas.
This paper has presented an approach to dealing with the complexity of explanation-based learning plans in complex domains. This approach uses a simplified algorithm to construct plans, and employs later refinements to repair bugs in constructed plans. This algorithm has the theoretical properties of completeness and convergence upon soundness. This incremental reasoning planning and learning algorithm has been implemented using a partial-order constraint posting planner and empirically compared to a conventional exhaustive reasoning partial-order constraint-posting planner and learning algorithm. This comparison showed that 1) incremental reasoning significantly reduced learning costs compared to exhaustive reasoning, 2) Explanation-based Learning (EBL) reduced failures from incremental reasoning, 3) EBL with incremental reasoning required less search to solve problems than EBL with exhaustive reasoning.
The DSN Scheduling Engine (DSE) has been developed to increase the level of automated scheduling support available to users of NASA s Deep Space Network (DSN). We have adopted a request-driven approach to DSN scheduling, in contrast to the activity-oriented approach used up to now. Scheduling requests allow users to declaratively specify patterns and conditions on their DSN service allocations, including timing, resource requirements, gaps, overlaps, time linkages among services, repetition, priorities, and a wide range of additional factors and preferences. The DSE incorporates a model of the key constraints and preferences of the DSN scheduling domain, along with algorithms to expand scheduling requests into valid resource allocations, to resolve schedule conflicts, and to repair unsatisfied requests. We use time-bounded systematic search with constraint relaxation to return nearby solutions if exact ones cannot be found, where the relaxation options and order are under user control. To explore the usability aspects of our approach we have developed a graphical user interface incorporating some crucial features to make it easier to work with complex scheduling requests. Among these are: progressive revelation of relevant detail, immediate propagation and visual feedback from a user s decisions, and a meeting calendar metaphor for repeated patterns of requests. Even as a prototype, the DSE has been deployed and adopted as the initial step in building the operational DSN schedule, thus representing an important initial validation of our overall approach. The DSE is a core element of the DSN Service Scheduling Software (S(sup 3)), a web-based collaborative scheduling system now under development for deployment to all DSN users.