Search NASA⌕ Search

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.

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

At least 55 records · Page 3

Design by analysis rules for ASME Section III, Division 5, Class B components

The current rules for elevated temperature ASME Section III, Division 5, Class B components, other than piping, were basically adapted from the Design-by-Rule approach for Section VIII, Division 1 vessels. A goal of the proposed new rules is to explicitly account for the design life and cyclic service while recognizing the less-rigorous requirements commensurate with lesser safety consideration. Further goals are to maximize the use of modern computational technology, for example finite element analysis in conjunction with reference stress concepts, and to avoid the need for stress classification. This paper summarizes the work done to address these issues. A summary of the design-by-analysis for primary loads, strain limit evaluation, and creep-fatigue damage assessment is presented. The proposed design-by-analysis creep-fatigue damage calculation approach uses a new elastic follow-up-based Isochronous Stress Strain Curve stress relaxation procedure. A set of sample problems are selected to validate the proposed design-by-analysis rules for creep-fatigue damage assessment. The proposed Class B rules are evaluated against the Class A elastic design rules and the experimental data obtained from a family of a simplified model test-based key-feature test results. The proposed Class B creep-fatigue damage assessment methodology yields conservative design cycles estimates compared to the experimental results.

36 MATERIALS SCIENCE↗

The Study on the Shock Wave Propagation Rule of a Gas Explosion in a Gas Compartment

Combined with the k-ε turbulence model of general application, a refined finite element model of a utility tunnel’s gas compartment filled with the methane/air mixture is developed. A series of analyses are made by using the powerful industry-leading computational fluid dynamics (CFD) software flame acceleration simulator (FLACS) to study the shock wave propagation rule in the gas compartment. The longitudinal and transversal distribution laws of the explosion shock wave are gained taking into consideration the spatial characteristics of the gas compartment. The influences of a few parameters, such as initial conditions and section size of the gas compartment, on the shock wave propagation rule are further discussed. The basic procedure for predicting the peak pressure of the blast wave is provided by considering the initial conditions and the gas compartment, and the corresponding injury effect of the explosion wave on the living beings is assessed. The investigation demonstrates that the peak pressure by the coupled effect between the initial conditions is significantly influenced, especially at the upper and lower gas explosion limits. The peak pressure increases gradually as the width or height increases, and both basically meet the linear relation. The proposed method can forecast the peak pressure of the explosion shock wave in the gas compartment accurately. According to the peak pressure longitudinal and transversal distributions of the blast wave, the peak pressure is far greater than the killing pressure threshold in the underground and closed space; consequently, it is not safe for the living beings in the gas compartment.

Lin, Shu-Chao↗

The Katydid system for compiling KEE applications to Ada

Components of a system known as Katydid are developed in an effort to compile knowledge-based systems developed in a multimechanism integrated environment (KEE) to Ada. The Katydid core is an Ada library supporting KEE object functionality, and the other elements include a rule compiler, a LISP-to-Ada translator, and a knowledge-base dumper. Katydid employs translation mechanisms that convert LISP knowledge structures and rules to Ada and utilizes basic prototypes of a run-time KEE object-structure library module for Ada. Preliminary results include the semiautomatic compilation of portions of a simple expert system to run in an Ada environment with the described algorithms. It is suggested that Ada can be employed for AI programming and implementation, and the Katydid system is being developed to include concurrency and synchronization mechanisms.

Filman, Robert E.↗

GIS Data Based Automatic High-Fidelity 3D Road Network Modeling

3D road models are widely used in many computer applications such as racing games and driving simulations_ However, almost all high-fidelity 3D road models were generated manually by professional artists at the expense of intensive labor. There are very few existing methods for automatically generating 3D high-fidelity road networks, especially those existing in the real world. This paper presents a novel approach thai can automatically produce 3D high-fidelity road network models from real 2D road GIS data that mainly contain road. centerline in formation. The proposed method first builds parametric representations of the road centerlines through segmentation and fitting . A basic set of civil engineering rules (e.g., cross slope, superelevation, grade) for road design are then selected in order to generate realistic road surfaces in compliance with these rules. While the proposed method applies to any types of roads, this paper mainly addresses automatic generation of complex traffic interchanges and intersections which are the most sophisticated elements in the road networks

Wang, Jie↗

Fuzzy Logic Engine

The Fuzzy Logic Engine is a software package that enables users to embed fuzzy-logic modules into their application programs. Fuzzy logic is useful as a means of formulating human expert knowledge and translating it into software to solve problems. Fuzzy logic provides flexibility for modeling relationships between input and output information and is distinguished by its robustness with respect to noise and variations in system parameters. In addition, linguistic fuzzy sets and conditional statements allow systems to make decisions based on imprecise and incomplete information. The user of the Fuzzy Logic Engine need not be an expert in fuzzy logic: it suffices to have a basic understanding of how linguistic rules can be applied to the user's problem. The Fuzzy Logic Engine is divided into two modules: (1) a graphical-interface software tool for creating linguistic fuzzy sets and conditional statements and (2) a fuzzy-logic software library for embedding fuzzy processing capability into current application programs. The graphical- interface tool was developed using the Tcl/Tk programming language. The fuzzy-logic software library was written in the C programming language.

Howard, Ayanna↗

Deriving Laws from Ordering Relations

It took much effort in the early days of non-Euclidean geometry to break away from the mindset that all spaces are flat and that two distinct parallel lines do not cross. Up to that point, all that was known was Euclidean geometry, and it was difficult to imagine anything else. We have suffered a similar handicap brought on by the enormous relevance of Boolean algebra to the problems of our age-logic and set theory. Previously, I demonstrated that the algebra of questions is not Boolean, but rather is described by the free distributive algebra. To get to this stage took much effort, as many obstacles-most self-placed-had to be overcome. As Boolean algebras were all I had ever known, it was almost impossible for me to imagine working with an algebra where elements do not have complements. With this realization, it became very clear that the sum and product rules of probability theory at the most basic level had absolutely nothing to do with the Boolean algebra of logical statements. Instead, a measure of degree of inclusion can be invented for many different partially ordered sets, and the sum and product rules fall out of the associativity and distributivity of the algebra. To reinforce this very important idea, this paper will go over how these constructions are made, while focusing on the underlying assumptions. I will derive the sum and product rules for a distributive lattice in general and demonstrate how this leads to probability theory on the Boolean lattice and is related to the calculus of quantum mechanical amplitudes on the partially ordered set of experimental setups. I will also discuss the rules that can be derived from modular lattices and their relevance to the cross-ratio of projective geometry.

Knuth, Kevin H.↗

Incorporating Active Runway Crossings in Airport Departure Scheduling

A mixed integer linear program is presented for deterministically scheduling departure and ar rival aircraft at airport runways. This method addresses different schemes of managing the departure queuing area by treating it as first-in-first-out queues or as a simple par king area where any available aircraft can take-off ir respective of its relative sequence with others. In addition, this method explicitly considers separation criteria between successive aircraft and also incorporates an optional prioritization scheme using time windows. Multiple objectives pertaining to throughput and system delay are used independently. Results indicate improvement over a basic first-come-first-serve rule in both system delay and throughput. Minimizing system delay results in small deviations from optimal throughput, whereas minimizing throughput results in large deviations in system delay. Enhancements for computational efficiency are also presented in the form of reformulating certain constraints and defining additional inequalities for better bounds.

Gupta, Gautam↗

Rates of ubiquitin conjugation increase when muscles atrophy, largely through activation of the N-end rule pathway

The rapid loss of muscle mass that accompanies many disease states, such as cancer or sepsis, is primarily a result of increased protein breakdown in muscle, and several observations have suggested an activation of the ubiquitin-proteasome system. Accordingly, in extracts of atrophying muscles from tumor-bearing or septic rats, rates of 125I-ubiquitin conjugation to endogenous proteins were found to be higher than in control extracts. On the other hand, in extracts of muscles from hypothyroid rats, where overall proteolysis is reduced below normal, the conjugation of 125I-ubiquitin to soluble proteins decreased by 50%, and treatment with triiodothyronine (T3) restored ubiquitination to control levels. Surprisingly, the N-end rule pathway, which selectively degrades proteins with basic or large hydrophobic N-terminal residues, was found to be responsible for most of these changes in ubiquitin conjugation. Competitive inhibitors of this pathway that specifically block the ubiquitin ligase, E3alpha, suppressed most of the increased ubiquitin conjugation in the muscle extracts from tumor-bearing and septic rats. These inhibitors also suppressed ubiquitination in normal extracts toward levels in hypothyroid extracts, which showed little E3alpha-dependent ubiquitination. Thus, the inhibitors eliminated most of the differences in ubiquitination under these different pathological conditions. Moreover, 125I-lysozyme, a model N-end rule substrate, was ubiquitinated more rapidly in extracts from tumor-bearing and septic rats, and more slowly in those from hypothyroid rats, than in controls. Thus, the rate of ubiquitin conjugation increases in atrophying muscles, and these hormone- and cytokine-dependent responses are in large part due to activation of the N-end rule pathway.

Non-NASA Center↗

Strategies for adding adaptive learning mechanisms to rule-based diagnostic expert systems

Rule-based diagnostic expert systems can be used to perform many of the diagnostic chores necessary in today's complex space systems. These expert systems typically take a set of symptoms as input and produce diagnostic advice as output. The primary objective of such expert systems is to provide accurate and comprehensive advice which can be used to help return the space system in question to nominal operation. The development and maintenance of diagnostic expert systems is time and labor intensive since the services of both knowledge engineer(s) and domain expert(s) are required. The use of adaptive learning mechanisms to increment evaluate and refine rules promises to reduce both time and labor costs associated with such systems. This paper describes the basic adaptive learning mechanisms of strengthening, weakening, generalization, discrimination, and discovery. Next basic strategies are discussed for adding these learning mechanisms to rule-based diagnostic expert systems. These strategies support the incremental evaluation and refinement of rules in the knowledge base by comparing the set of advice given by the expert system (A) with the correct diagnosis (C). Techniques are described for selecting those rules in the in the knowledge base which should participate in adaptive learning. The strategies presented may be used with a wide variety of learning algorithms. Further, these strategies are applicable to a large number of rule-based diagnostic expert systems. They may be used to provide either immediate or deferred updating of the knowledge base.

Stclair, D. C.↗

Comparison between the performance of two classes of fuzzy controllers

This paper presents an application comparison between two classes of fuzzy controllers: the Clearness Transformation Fuzzy Controller (CTFC) and the CRI-based Fuzzy Controller. The comparison is performed by studying the application of the controllers to simulation examples of nonlinear systems. The CTFC is a new approach for the organization of fuzzy controllers based on a cognitive model of parameter driven control, the notion of fuzzy patterns to represent fuzzy knowledge and the Clearness Transformation Rule of Inference (CTRI) for approximate reasoning. The approach facilitates the implementation of the basic modules of the controller: the fuzzifier, defuzzifier, and the control protocol in a rule-based architecture. The CTRI scheme for approximate reasoning does not require the formation of fuzzy relation matrices yielding improved performance in comparison with the traditional organization of fuzzy controllers.

Janabi, T. H.↗

Systems biology markup language (SBML) level 3 package: multistate, multicomponent and multicompartment species, version 1, release 2

Rule-based modeling is an approach that permits constructing reaction networks based on the specification of rules for molecular interactions and transformations. These rules can encompass details such as the interacting sub-molecular domains and the states and binding status of the involved components. Conceptually, fine-grained spatial information such as locations can also be provided. Through “wildcards” representing component states, entire families of molecule complexes sharing certain properties can be specified as patterns. This can significantly simplify the definition of models involving species with multiple components, multiple states, and multiple compartments. The systems biology markup language (SBML) Level 3 Multi Package Version 1 extends the SBML Level 3 Version 1 core with the “type” concept in the Species and Compartment classes. Therefore, reaction rules may contain species that can be patterns and exist in multiple locations. Multiple software tools such as Simmune and BioNetGen support this standard that thus also becomes a medium for exchanging rule-based models. This document provides the specification for Release 2 of Version 1 of the SBML Level 3 Multi package. No design changes have been made to the description of models between Release 1 and Release 2; changes are restricted to the correction of errata and the addition of clarifications.

59 BASIC BIOLOGICAL SCIENCES↗

On a class of selection rules without group actions in field theory and string theory

We discuss a class of selection rules which i) do not come from group actions on fields, ii) are exact at tree level in perturbation theory, iii) are increasingly violated as the loop order is raised, and iv) eventually reduce to selection rules associated with an ordinary group symmetry. We start from basic field-theoretical examples in which fields are labeled by conjugacy classes rather than representations of a group, and discuss generalizations using fusion algebras or hypergroups. We also discuss how such selection rules arise naturally in string theory, such as for non-Abelian orbifolds or other cases with non-invertible worldsheet symmetries.

Kaidi, Justin (ORCID:0000000161440729)↗

Soft and hard aspects of QCD dynamics in hadronic form factors

I give an overview of (mostly my own) work on aspects of QCD dynamics in hadronic form factors at large momentum transfer. The topics include a discussion of basics of soft and hard mechanisms, QCD sum rule applications, and connection of form factors to generalized parton distributions.

Radyushkin, Anatoly↗

A Correlation by Means of the Transonic Similarity Rules of the Experimentally Determined Characteristics of 22 Rectangular Wings of Symmetrical Profile

The transonic similarity rules have been applied to the correlation of experimental data for a series of 22 rectangular wings having symmetrical NACA 63A-series sections, aspect ratios from 1/2 to 6, and thicknesses from 2 to 10 percent. The data were obtained by use of the transonic bump technique over a Mach number range from 0.40 to 1.10, corresponding to a Reynolds number range from 1.25 to 2.05 million. The results show that it is possible to correlate experimental data throughout the subsonic, transonic, and moderate supersonic regimes by using the transonic similarity parameters in forms which are consistent with the Prandtl-Glauert rule of linearized theory. The multiple families of basic data curves for the various aspect ratios and thickness ratios have been summarized in single presentations involving only one geometric variable - the product of the aspect ratio and the l/3 power of the thickness ratio.

Mcdevitt, John B↗

Associative Flow Rule Used to Include Hydrostatic Stress Effects in Analysis of Strain-Rate-Dependent Deformation of Polymer Matrix Composites

designing reliable composite engine cases that are lighter than the metal cases in current use. The types of polymer matrix composites that are likely to be used in such an application have a deformation response that is nonlinear and that varies with strain rate. The nonlinearity and the strain-rate dependence of the composite response are due primarily to the matrix constituent. Therefore, in developing material models to be used in the design of impact-resistant composite engine cases, the deformation of the polymer matrix must be correctly analyzed. However, unlike in metals, the nonlinear response of polymers depends on the hydrostatic stresses, which must be accounted for within an analytical model. By applying micromechanics techniques along with given fiber properties, one can also determine the effects of the hydrostatic stresses in the polymer on the overall composite deformation response. First efforts to account for the hydrostatic stress effects in the composite deformation applied purely empirical methods that relied on composite-level data. In later efforts, to allow polymer properties to be characterized solely on the basis of polymer data, researchers at the NASA Glenn Research Center developed equations to model the polymers that were based on a non-associative flow rule, and efforts to use these equations to simulate the deformation of representative polymer materials were reasonably successful. However, these equations were found to have difficulty in correctly analyzing the multiaxial stress states found in the polymer matrix constituent of a composite material. To correct these difficulties, and to allow for the accurate simulation of the nonlinear strain-rate-dependent deformation analysis of polymer matrix composites, in the efforts reported here Glenn researchers reformulated the polymer constitutive equations from basic principles using the concept of an associative flow rule. These revised equations were characterized and validated in an experimental program carried out through a university grant with the Ohio State University, wherein tensile and shear deformation data were obtained for a representative polymer for strain rates ranging from quasi-static to high rates of several hundred per second. Tensile deformation data also were obtained over a variety of strain rates and fiber orientation angles for a representative polymer matrix composite composed using the polymer.

Goldberg, Robert K.↗

Software Engineering Laboratory (SEL) relationships, models, and management rules

Over 50 individual Software Engineering Laboratory (SEL) research results, extracted from a review of published SEL documentation, that can be applied directly to managing software development projects are captured. Four basic categories of results are defined and discussed - environment profiles, relationships, models, and management rules. In each category, research results are presented as a single page that summarizes the individual result, lists potential uses of the result by managers, and references the original SEL documentation where the result was found. The document serves as a concise reference summary of applicable research for SEL managers.

Decker, William↗

Syllogistic reasoning in fuzzy logic and its application to usuality and reasoning with dispositions

A fuzzy syllogism in fuzzy logic is defined to be an inference schema in which the major premise, the minor premise and the conclusion are propositions containing fuzzy quantifiers. A basic fuzzy syllogism in fuzzy logic is the intersection/product syllogism. Several other basic syllogisms are developed that may be employed as rules of combination of evidence in expert systems. Among these is the consequent conjunction syllogism. Furthermore, it is shown that syllogistic reasoning in fuzzy logic provides a basis for reasoning with dispositions; that is, with propositions that are preponderantly but not necessarily always true. It is also shown that the concept of dispositionality is closely related to the notion of usuality and serves as a basis for what might be called a theory of usuality - a theory which may eventually provide a computational framework for commonsense reasoning.

Zadeh, L. A.↗