SEARCH · Search NASA

Results for “Basic Rules”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

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

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

NASA NTRS1998

Second International Workshop on Software Engineering and Code Design in Parallel Meteorological and Oceanographic Applications

This report contains the abstracts and technical papers from the Second International Workshop on Software Engineering and Code Design in Parallel Meteorological and Oceanographic Applications, held June 15-18, 1998, in Scottsdale, Arizona. The purpose of the workshop is to bring together software developers in meteorology and oceanography to discuss software engineering and code design issues for parallel architectures, including Massively Parallel Processors (MPP's), Parallel Vector Processors (PVP's), Symmetric Multi-Processors (SMP's), Distributed Shared Memory (DSM) multi-processors, and clusters. Issues to be discussed include: (1) code architectures for current parallel models, including basic data structures, storage allocation, variable naming conventions, coding rules and styles, i/o and pre/post-processing of data; (2) designing modular code; (3) load balancing and domain decomposition; (4) techniques that exploit parallelism efficiently yet hide the machine-related details from the programmer; (5) tools for making the programmer more productive; and (6) the proliferation of programming models (F--, OpenMP, MPI, and HPF).

OKeefe, Matthew↗

NASA NTRS1975

Strainrange Partitioning - A tool for characterizing high-temperature low-cycle fatigue

The basic concepts of Strainrange Partitioning are reviewed, with particular reference to the areas requiring expanded verification. A cooperative program is proposed for achieving this broader verification through the additional experience provided by the participants in this program. The suggested program includes verification of the four basic life relationships (for PP, CC, PC, and CP type inelastic strainranges) for a variety of materials chosen by the participating organizations. The four relationships are then used in conjunction with the Interaction Damage Rule to predict the cyclic lives of tests involving various combinations of the basic strainrange components. The testing program also includes evaluation of the degree of insensitivity of these relationships to temperature as well as their utility in representing bounds on life.

Hirschberg, M. H.↗

NASA NTRS1984

Satellite servicing: A business opportunity?

The possibilities of satellite servicing as a business opportunity are examined. The service rate which a user must be charged to yield a reasonable return is derived and then compared against the market's willingness to pay that rate. Steps taken to provide the basis from which the service rate could be derived include: (1) constructing a hypothetical on orbit servicing business offering both on orbit and associated ground services; (2) estimating the total on orbit service business potential by analyzing mission models to the year 2000; and (3) setting up ground rules to bound the conduct of the business. Using this basic information service demand (business volume) cost to set up the business, costs for operation and maintenance tax rates and desired rate of return are estimated to determine the user charge. Sensitivity of the service rate to various parameters are also assessed. The time span for the business venture runs from 1986 through 2000 with service to 1991 provided via the orbiter and by a space station beyond 1991. This point analysis shows about five years of negative cash flow, with steady profits thereafter.

Wong, R. E.↗

NASA NTRS1991

Rule-based simulation models

Procedural modeling systems, rule based modeling systems, and a method for converting a procedural model to a rule based model are described. Simulation models are used to represent real time engineering systems. A real time system can be represented by a set of equations or functions connected so that they perform in the same manner as the actual system. Most modeling system languages are based on FORTRAN or some other procedural language. Therefore, they must be enhanced with a reaction capability. Rule based systems are reactive by definition. Once the engineering system has been decomposed into a set of calculations using only basic algebraic unary operations, a knowledge network of calculations and functions can be constructed. The knowledge network required by a rule based system can be generated by a knowledge acquisition tool or a source level compiler. The compiler would take an existing model source file, a syntax template, and a symbol table and generate the knowledge network. Thus, existing procedural models can be translated and executed by a rule based system. Neural models can be provide the high capacity data manipulation required by the most complex real time models.

Nieten, Joseph L.↗

NASA NTRS1966

A Supersonic/Hypersonic Aerodynamic Investigation of the Saturn 1B/Apollo Upper Stage

The static stability and axial force characteristics of an upper stage Saturn 1B/Apollo model were investigated in a series of wind tunnel tests at Mach numbers between 1. 93 and 8. 05. This report presents and analyzes the results of these small-scale studies. Test procedures and models are described, and consideration of boundary layer characteristics and violated modeling rules yields an assessment of the validity of the data. Four basic models provided evaluation of the basic launch vehicle characteristics, as well as the effects of two modes of mission abort and jettison of the launch escape system. The launch configuration experienced sudden, strong changes in stability derivatives and axial force coefficients near Mach 5. No similar changes were observed on the other configurations. Effects of Reynolds number, Mach number and boundary layer trips were obtained for each shape. The faired curves are believed to be valid for full-scale flight of the Saturn 1B/Apollo upper stage.

Source record↗

NASA NTRS1976

Calculation of the three-dimension, supersonic, inviscid, steady flow past an arrow-winged airframe, part 1

A detailed description of the procedure used to compute three dimensional, supersonic, inviscid, steady flows past airframes is given. No limitations are imposed on the geometry of the airplane. Suitable computational grids are generated by automatic conformal mappings. The equations of motion, with pressure, entropy, and velocity direction as basic unknowns, are written and discretized in the computational space. Special rules to approximate derivatives are given. Boundary points are treated by a modified method of characteristics.

Moretti, G.↗

NASA NTRS1976

The cost of noise reduction for departure and arrival operations of commercial tilt rotor aircraft

The relationship between direct operating cost (DOC) and noise annoyance due to a departure and an arrival operation was developed for commercial tilt rotor aircraft. This was accomplished by generating a series of tilt rotor aircraft designs to meet various noise goals at minimum DOC. These vehicles ranged across the spectrum of possible noise levels from completely unconstrained to the quietest vehicles that could be designed within the study ground rules. Optimization parameters were varied to find the minimum DOC. This basic variation was then extended to different aircraft sizes and technology time frames.

Faulkner, H. B.↗

NASA NTRS2004

Reconfigurability in MDO Problem Synthesis

Integrating autonomous disciplines into a problem amenable to solution presents a major challenge in realistic multidisciplinary design optimization (MDO). We propose a linguistic approach to MDO problem description, formulation, and solution we call reconfigurable multidisciplinary synthesis (REMS). With assistance from computer science techniques, REMS comprises an abstract language and a collection of processes that provide a means for dynamic reasoning about MDO problems in a range of contexts. The approach may be summarized as follows. Description of disciplinary data according to the rules of a grammar, followed by lexical analysis and compilation, yields basic computational components that can be assembled into various MDO problem formulations and solution algorithms, including hybrid strategies, with relative ease. The ability to re-use the computational components is due to the special structure of the MDO problem. The range of contexts for reasoning about MDO spans tasks from error checking and derivative computation to formulation and reformulation of optimization problem statements. In highly structured contexts, reconfigurability can mean a straightforward transformation among problem formulations with a single operation. We hope that REMS will enable experimentation with a variety of problem formulations in research environments, assist in the assembly of MDO test problems, and serve as a pre-processor in computational frameworks in production environments. This paper, Part 1 of two companion papers, discusses the fundamentals of REMS. Part 2 illustrates the methodology in more detail.

Alexandrov, Natalia M.↗

NASA NTRS2004

Reconfigurability in MDO Problem Synthesis

Integrating autonomous disciplines into a problem amenable to solution presents a major challenge in realistic multidisciplinary design optimization (MDO). We propose a linguistic approach to MDO problem description, formulation, and solution we call reconfigurable multidisciplinary synthesis (REMS). With assistance from computer science techniques, REMS comprises an abstract language and a collection of processes that provide a means for dynamic reasoning about MDO problems in a range of contexts. The approach may be summarized as follows. Description of disciplinary data according to the rules of a grammar, followed by lexical analysis and compilation, yields basic computational components that can be assembled into various MDO problem formulations and solution algorithms, including hybrid strategies, with relative ease. The ability to re-use the computational components is due to the special structure of the MDO problem. The range of contexts for reasoning about MDO spans tasks from error checking and derivative computation to formulation and reformulation of optimization problem statements. In highly structured contexts, reconfigurability can mean a straightforward transformation among problem formulations with a single operation. We hope that REMS will enable experimentation with a variety of problem formulations in research environments, assist in the assembly of MDO test problems, and serve as a pre-processor in computational frameworks in production environments. Part 1 of two companion papers, discusses the fundamentals of REMS. This paper, Part 2 illustrates the methodology in more detail.

Alexandrov, Natalia M.↗

DOE OSTI2021

The Utility of Macroecological Rules for Microbial Biogeography

Macroecological rules have been developed for plants and animals that describe large-scale distributional patterns and attempt to explain the underlying physiological and ecological processes behind them. Similarly, microorganisms exhibit patterns in relative abundance, distribution, diversity, and traits across space and time, yet it remains unclear the extent to which microorganisms follow macroecological rules initially developed for macroorganisms. Additionally, the usefulness of these rules as a null hypothesis when surveying microorganisms has yet to be fully evaluated. With rapid advancements in sequencing technology, we have seen a recent increase in microbial studies that utilize macroecological frameworks. Here, we review and synthesize these macroecological microbial studies with two main objectives: (1) to determine to what extent macroecological rules explain the distribution of host-associated and free-living microorganisms, and (2) to understand which environmental factors and stochastic processes may explain these patterns among microbial clades (archaea, bacteria, fungi, and protists) and habitats (host-associated and free living; terrestrial and aquatic). Overall, 78% of microbial macroecology studies focused on free living, aquatic organisms. In addition, most studies examined macroecological rules at the community level with only 35% of studies surveying organismal patterns across space. At the community level microorganisms often tracked patterns of macroorganisms for island biogeography (74% confirm) but rarely followed Latitudinal Diversity Gradients (LDGs) of macroorganisms (only 32% confirm). However, when microorganisms and macroorganisms shared the same macroecological patterns, underlying environmental drivers (e.g., temperature) were the same. Because we found a lack of studies for many microbial groups and habitats, we conclude our review by outlining several outstanding questions and creating recommendations for future studies in microbial ecology.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2021

Can you sign a quantum state?

Cryptography with quantum states exhibits a number of surprising and counterintuitive features. In a 2002 work, Barnum et al. argue that these features imply that digital signatures for quantum states are impossible (Barnum et al., FOCS 2002). In this work, we ask: can all forms of signing quantum data, even in a possibly weak sense, be completely ruled out? We give two results which shed significant light on this basic question. First, we prove an impossibility result for digital signatures for quantum data, which extends the result of Barnum et al. Specifically, we show that no nontrivial combination of correctness and security requirements can be fulfilled, beyond what is achievable simply by measuring the quantum message and then signing the outcome. In other words, only classical signature schemes exist. We then show a positive result: a quantum state can be signed with the same security guarantees as classically, provided that it is also encrypted with the public key of the intended recipient. Following classical nomenclature, we call this notion quantum signcryption. Classically, signcryption is only interesting if it provides superior performance to encrypt-then-sign. Quantumly, it is far more interesting: it is the only signing method available. We develop "as-strong-as-classical" security definitions for quantum signcryption and give secure constructions based on post-quantum public-key primitives. Along the way, we show that a natural hybrid method of combining classical and quantum schemes can be used to "upgrade" a secure classical scheme to the fully-quantum setting, in a wide range of cryptographic settings including signcryption, authenticated encryption, and CCA security.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1974

Simulation verification techniques study: Simulation self test hardware design and techniques report

The final results are presented of the hardware verification task. The basic objectives of the various subtasks are reviewed along with the ground rules under which the overall task was conducted and which impacted the approach taken in deriving techniques for hardware self test. The results of the first subtask and the definition of simulation hardware are presented. The hardware definition is based primarily on a brief review of the simulator configurations anticipated for the shuttle training program. The results of the survey of current self test techniques are presented. The data sources that were considered in the search for current techniques are reviewed, and results of the survey are presented in terms of the specific types of tests that are of interest for training simulator applications. Specifically, these types of tests are readiness tests, fault isolation tests and incipient fault detection techniques. The most applicable techniques were structured into software flows that are then referenced in discussions of techniques for specific subsystems.

Source record↗

NASA NTRS1980

Satellite communication performance evaluation: Computational techniques based on moments

Computational techniques that efficiently compute bit error probabilities when only moments of the various interference random variables are available are presented. The approach taken is a generalization of the well known Gauss-Quadrature rules used for numerically evaluating single or multiple integrals. In what follows, basic algorithms are developed. Some of its properties and generalizations are shown and its many potential applications are described. Some typical interference scenarios for which the results are particularly applicable include: intentional jamming, adjacent and cochannel interferences; radar pulses (RFI); multipath; and intersymbol interference. While the examples presented stress evaluation of bit error probilities in uncoded digital communication systems, the moment techniques can also be applied to the evaluation of other parameters, such as computational cutoff rate under both normal and mismatched receiver cases in coded systems. Another important application is the determination of the probability distributions of the output of a discrete time dynamical system. This type of model occurs widely in control systems, queueing systems, and synchronization systems (e.g., discrete phase locked loops).

Omura, J. K.↗

NASA NTRS1988

Spacecraft mass estimation, relationships and engine data: Task 1.1 of the lunar base systems study

A collection of scaling equations, weight statements, scaling factors, etc., useful for doing conceptual designs of spacecraft are given. Rules of thumb and methods of calculating quantities of interest are provided. Basic relationships for conventional, and several non-conventional, propulsion systems (nuclear, solar electric and solar thermal) are included. The equations and other data were taken from a number of sources and are not at all consistent with each other in level of detail or method, but provide useful references for early estimation purposes.

Source record↗

NASA NTRS1998

The N-end rule pathway catalyzes a major fraction of the protein degradation in skeletal muscle

In skeletal muscle, overall protein degradation involves the ubiquitin-proteasome system. One property of a protein that leads to rapid ubiquitin-dependent degradation is the presence of a basic, acidic, or bulky hydrophobic residue at its N terminus. However, in normal cells, substrates for this N-end rule pathway, which involves ubiquitin carrier protein (E2) E214k and ubiquitin-protein ligase (E3) E3alpha, have remained unclear. Surprisingly, in soluble extracts of rabbit muscle, we found that competitive inhibitors of E3alpha markedly inhibited the 125I-ubiquitin conjugation and ATP-dependent degradation of endogenous proteins. These inhibitors appear to selectively inhibit E3alpha, since they blocked degradation of 125I-lysozyme, a model N-end rule substrate, but did not affect the degradation of proteins whose ubiquitination involved other E3s. The addition of several E2s or E3alpha to the muscle extracts stimulated overall proteolysis and ubiquitination, but only the stimulation by E3alpha or E214k was sensitive to these inhibitors. A similar general inhibition of ubiquitin conjugation to endogenous proteins was observed with a dominant negative inhibitor of E214k. Certain substrates of the N-end rule pathway are degraded after their tRNA-dependent arginylation. We found that adding RNase A to muscle extracts reduced the ATP-dependent proteolysis of endogenous proteins, and supplying tRNA partially restored this process. Finally, although in muscle extracts the N-end rule pathway catalyzes most ubiquitin conjugation, it makes only a minor contribution to overall protein ubiquitination in HeLa cell extracts.

Non-NASA Center↗

NASA NTRS1991

Extracting fuzzy rules under uncertainty and measuring definability using rough sets

Although computers have come a long way since their invention, they are basically able to handle only crisp values at the hardware level. Unfortunately, the world we live in consists of problems which fail to fall into this category, i.e., uncertainty is all too common. A problem is looked at which involves uncertainty. To be specific, attributes are dealt with which are fuzzy sets. Under this condition, knowledge is acquired by looking at examples. In each example, a condition as well as a decision is made available. Based on the examples given, two sets of rules are extracted, certain and possible. Furthermore, measures are constructed of how much these rules are believed in, and finally, the decisions are defined as a function of the terms used in the conditions.

Culas, Donald E.↗

NASA NTRS1982

Electron lithography STAR design guidelines. Part 2: The design of a STAR for space applications

The STAR design system developed by NASA enables any user with a logic diagram to design a semicustom digital MOS integrated circuit. The system is comprised of a library of standard logic cells and computr programs to place, route, and display designs implemented with cells from the library. Also described is the development of a radiation-hard array designed for the STAR system. The design is based on the CMOS silicon gate technology developed by SANDIA National Laboratories. The design rules used are given as well as the model parameters developed for the basic array element. Library cells of the CMOS metal gate and CMOS silicon gate technologies were simulated using SPICE, and the results are shown and compared.

Trotter, J. D.↗

NASA NTRS1990

30 years of adaptive neural networks - Perceptron, Madaline, and backpropagation

Fundamental developments in feedforward artificial neural networks from the past thirty years are reviewed. The history, origination, operating characteristics, and basic theory of several supervised neural-network training algorithms (including the perceptron rule, the least-mean-square algorithm, three Madaline rules, and the backpropagation technique) are described. The concept underlying these iterative adaptation algorithms is the minimal disturbance principle, which suggests that during training it is advisable to inject new information into a network in a manner that disturbs stored information to the smallest extent possible. The two principal kinds of online rules that have developed for altering the weights of a network are examined for both single-threshold elements and multielement networks. They are error-correction rules, which alter the weights of a network to correct error in the output response to the present input pattern, and gradient rules, which alter the weights of a network during each pattern presentation by gradient descent with the objective of reducing mean-square error (averaged over all training patterns).

Widrow, Bernard↗