Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “RULE”

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

Parallel inferencing method and apparatus for rule-based expert systems

The invention analyzes areas of conditions with an expert knowledge base of rules using plural separate nodes which fire respective rules of said knowledge base, each of said rules upon being fired altering certain of said conditions predicated upon the existence of other said conditions. The invention operates by constructing a P representation of all pairs of said rules which are input dependent or output dependent; constructing a C representation of all pairs of said rules which are communication dependent or input dependent; determining which of the rules are ready to fire by matching the predicate conditions of each rule with the conditions of said set; enabling said node means to simultaneously fire those of the rules ready to fire which are defined by said P representation as being free of input and output dependencies; and communicating from each node enabled by said enabling step the alteration of conditions by the corresponding rule to other nodes whose rules are defined by said C matrix means as being input or communication dependent upon the rule of said enabled node.

Schwuttke, Ursula M.↗

Rule groupings: An approach towards verification of expert systems

Knowledge-based expert systems are playing an increasingly important role in NASA space and aircraft systems. However, many of NASA's software applications are life- or mission-critical and knowledge-based systems do not lend themselves to the traditional verification and validation techniques for highly reliable software. Rule-based systems lack the control abstractions found in procedural languages. Hence, it is difficult to verify or maintain such systems. Our goal is to automatically structure a rule-based system into a set of rule-groups having a well-defined interface to other rule-groups. Once a rule base is decomposed into such 'firewalled' units, studying the interactions between rules would become more tractable. Verification-aid tools can then be developed to test the behavior of each such rule-group. Furthermore, the interactions between rule-groups can be studied in a manner similar to integration testing. Such efforts will go a long way towards increasing our confidence in the expert-system software. Our research efforts address the feasibility of automating the identification of rule groups, in order to decompose the rule base into a number of meaningful units.

Mehrotra, Mala↗

Curating a comprehensive set of enzymatic reaction rules for efficient novel biosynthetic pathway design

Enzyme substrate promiscuity has significant implications for metabolic engineering. The ability to predict the space of possible enzymatic side reactions is crucial for elucidating underground metabolic networks in microorganisms, as well as harnessing novel biosynthetic capabilities of enzymes to produce desired chemicals. Reaction rule-based cheminformatics platforms have been implemented to computationally enumerate possible promiscuous reactions, relying on existing knowledge of enzymatic transformations to inform novel reactions. However, past versions of curated reaction rules have been limited by a lack of comprehensiveness in representing all possible transformations, as well as the need to prune rules to enhance computational efficiency in pathway expansion. To this end, we curated a set of 1224 most generalized reaction rules, automatically abstracted from atom-mapped MetaCyc reactions and verified to uniquely cover all common enzymatic transformations. Additionally, we developed a framework to systematically identify and correct redundancies and errors in the curation process, resulting in a minimal, yet comprehensive, rule set. These reaction rules were capable of reproducing more than 85% of all reactions in the KEGG and BRENDA databases, for which a large fraction of reactions is not present in MetaCyc. Our rules exceed all previously published rule sets for which reproduction was possible in this coverage analysis, which allows for the exploration of a larger space of known enzymatic transformations. By leveraging the entire knowledge of possible metabolic reactions through generalized enzymatic reaction rules, we are able to better utilize underground metabolic pathways and accelerate novel biosynthetic pathway design to enable bioproduction towards a wider range of new molecules.

59 BASIC BIOLOGICAL SCIENCES↗

CRCNS22 Learning Rules in the Hippocampus and their Mapping to Neuromorphic Systems (Final Technical Report)

Large scale biologically-realistic computational models are key to investigating the interplay between structure and function in nervous systems, thus paving the way to new clinical methods and neuro-inspired computing solutions. This project focuses on the hippocampus, in particular the CA3-CA1 regions, due to their role in associative learning and memory, pattern separation and completion, and spatial navigation. Investigations into the neuronal organization and learning rule(s) of this circuit can shed light into how declarative memories are formed, stored, recalled and forgotten and inform computational, experimental and clinical neuroscience work. Our project aims at developing a novel data-driven methodology supported by a broad heterogeneous base of neuroscience experimental knowledge and inspired from advances in computer science and engineering. Specifically, this work will benchmark existing and new learning rules within a full-scale spiking neural network simulation of the CA3-CA1 region. The model will be based on an open-source repository, called the Hippocampome, which contains neuronal morphologies, firing patterns, synapse probabilities, and most other required parameters for all known neuron types in the rodent hippocampal formation. The model will be first trained in a supervised fashion for associative memory tasks using backpropagation through time traditionally used in computer science, enhanced with a new technique called the surrogate gradient method. This optimization method will be used to obtain a global loss minimization, but it is not biologically inspired as it assumes the use of data not locally available to the synapses. However, we propose its use as a benchmarking tool, to compare the training performance of local biologically plausible and hardware-mappable learning rules at scale. New rules or combinations will be proposed and tested as needed, based on the obtained results. Progress in this area will also drive the development of novel hardware-mappable algorithms for continual lifelong learning and categorization of new events from few presented examples. This project goes beyond the existing state-of-the-art by looking at large scale realistic neuronal circuits as networks trainable via global optimization methods such as surrogate gradient descent. The objective function of the brain that supports learning is largely unknown, but it is likely that it operates through local learning rules. Studying network trajectories around local minima as proposed in this work represents a useful strategy for understanding whether a network is training by using a specific (set of) learning rule(s). Starting from a completely untrained network is a challenging test since it is difficult to determine how the learning rule affects the trajectory of the network. This interdisciplinary project will help understand what rule governs learning in these regions or if multiple learning rules are involved. The work will develop a robust methodology to measure if the network is converging to the target solution, oscillating around it, or diverging away.

59 BASIC BIOLOGICAL SCIENCES↗

Equations for Scoring Rules When Data Are Missing

A document presents equations for scoring rules in a diagnostic and/or prognostic artificial-intelligence software system of the rule-based inference-engine type. The equations define a set of metrics that characterize the evaluation of a rule when data required for the antecedence clause(s) of the rule are missing. The metrics include a primary measure denoted the rule completeness metric (RCM) plus a number of subsidiary measures that contribute to the RCM. The RCM is derived from an analysis of a rule with respect to its truth and a measure of the completeness of its input data. The derivation is such that the truth value of an antecedent is independent of the measure of its completeness. The RCM can be used to compare the degree of completeness of two or more rules with respect to a given set of data. Hence, the RCM can be used as a guide to choosing among rules during the rule-selection phase of operation of the artificial-intelligence system..

James, Mark↗

Feedback-Directed Random Sequence Generation for Verifying Spacecraft Flight Rule Violations

The Psyche: Journey to a Metal World mission will be launched in 2022 to study the largest metal asteroid in the main asteroid belt, (16) Psyche. The spacecraft will perform a Mars Flyby in 2023 and enter (16) Psyche’s orbit in 2026. Throughout the mission, safely operating the spacecraft will require abiding by a set of flight rules that can be defined at any point in the mission lifecycle. These flight rules ensure that the spacecraft is operating within allowed regimes and a discrete event simulation tool, SEQGEN, will be used to model all command sequences prior to uplink. One of SEQGEN’s responsibilities is to determine if a command sequence violates any flight rules. For each flight rule, the necessary logic to determine if a violation has occurred is implemented in the SEQGEN adaptation, which is maintained by the mission. This adaptation must be tested thoroughly to ensure that the flight rule logic was interpreted and implemented correctly. This work describes a tool, RandSEQ, that autogenerates a suite of flight rule violating test sequences for each flight rule implemented in SEQGEN, and can be used by any mission using SEQGEN. The Psyche SEQGEN adaptation is still being developed, but so far, RandSEQ has been used to generate 532 test cases, that can be reviewed by various stakeholders, for 40 flight rules. The ability to autogenerate these test cases has significantly reduced the amount of time required to implement and test each flight rule.

Su, Laura↗

Checking Flight Rules with TraceContract: Application of a Scala DSL for Trace Analysis

Typically during the design and development of a NASA space mission, rules and constraints are identified to help reduce reasons for failure during operations. These flight rules are usually captured in a set of indexed tables, containing rule descriptions, rationales for the rules, and other information. Flight rules can be part of manual operations procedures carried out by humans. However, they can also be automated, and either implemented as on-board monitors, or as ground based monitors that are part of a ground data system. In the case of automated flight rules, one considerable expense to be addressed for any mission is the extensive process by which system engineers express flight rules in prose, software developers translate these requirements into code, and then both experts verify that the resulting application is correct. This paper explores the potential benefits of using an internal Scala DSL for general trace analysis, named TRACECONTRACT, to write executable specifications of flight rules. TRACECONTRACT can generally be applied to analysis of for example log files or for monitoring executing systems online.

temporal logic↗

Evaluation of the grand-canonical partition function using expanded Wang-Landau simulations. III. Impact of combining rules on mixtures properties

Combining rules, such as the Lorentz-Berthelot rules, are routinely used to calculate the thermodynamic properties of mixtures using molecular simulations. Here we extend the expanded Wang-Landau simulation approach to determine the impact of the combining rules on the value of the partition function of binary systems, and, in turn, on the phase coexistence and thermodynamics of these mixtures. We study various types of mixtures, ranging from systems of rare gases to biologically and technologically relevant mixtures, such as water-urea and water-carbon dioxide. Comparing the simulation results to the experimental data on mixtures of rare gases allows us to rank the performance of combining rules. We find that the widely used Lorentz-Berthelot rules exhibit the largest deviations from the experimental data, both for the bulk and at coexistence, while the Kong and Waldman-Hagler provide much better alternatives. In particular, in the case of aqueous solutions of urea, we show that the use of the Lorentz-Berthelot rules has a strong impact on the Gibbs free energy of the solute, overshooting the value predicted by the Waldman-Hagler rules by 7%. This result emphasizes the importance of the combining rule for the determination of hydration free energies using molecular simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Suppression-based STDP Rule Resilient to Jitter Noise in Spike Patterns for Neuromorphic Computing

Multi-spike models of synaptic plasticity, such as the triplet and suppression spike-timing-dependent plasticity (STDP) rules, exhibit better alignment with neurophysiological data in the brain compared to the pair-based STDP rule. Previous studies have empirically shown that the pair-based STDP rule can detect spatiotemporal spike patterns hidden in equally dense distractor spike trains in an unsupervised manner. However, it fails to detect spike patterns influenced by jitter noise. Given that spiking neural networks (SNNs) exhibit variability in generated spike trains in response to the same inputs, it becomes imperative to have learning rules capable of detecting spike patterns even in the presence of jitter noise. In this study, we introduce a simplified suppression-based STDP rule that demonstrates significantly enhanced tolerance to jitter in spike patterns compared to the pair-based STDP rule. Unlike the ideal suppression STDP rule, characterized by an exponential learning window and requiring high-resolution synapses, the simplified rule limits the synaptic efficacy update to a single bit at any given instant. Moreover, it employs 4-bit fixed-point synapses, facilitating straightforward implementation in neuromorphic hardware.

Gautam, Ashish [ORNL]↗

Comprehensive Margin Assessment of the ASME Section III, Division 5, Class A Primary Load Design Rules

This report provides a comprehensive margin assessment of the ASME Section III, Division 5, Subsection HB, Subpart B rules for the design of high temperature reactor components against load controlled stress limits. These rules, often called the Code primary load design rules, provide protection against creep rupture and plastic collapse under steady conditions. The method adopted here is to compare the deterministic ASME design life, according to the primary load design rules, against the expected, statistical service life of the component, considering creep rupture as the relevant failure mode. The report provides the design margin of the ASME rules in terms of the probability of premature failure -- the probability that the component fails in service before reaching the ASME design life. To complete this assessment, the report describes the development of a statistical creep life assessment procedure accounting for variations in the component loading, material creep rate, and the material rupture time. This includes a novel method for correlating creep rupture data using a Gaussian process accounting for heat-to-heat variation in the Larson-Miller time-temperature parameter. The report applies the complete margin assessment process to quantify the design margin inherent in the ASME primary load design rules as a function of temperature for relevant component geometries and materials. The overall conclusion is that the ASME rules are conservative, providing designs with very small probability of premature failure, but some optimization of the Code design rules is possible to provide a more uniform design margin.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Guide to Updating Interconnection Rules and Incorporating IEEE Standard 1547

The intent of this paper is to support local authorities in adopting the most current technical requirements for interconnecting distributed energy resources (DERs) to the electric distribution system as specified in the Institute of Electrical and Electronics Engineers Standard for Interconnection and Interoperability of Distributed Energy Resources with Associated Electric Power Systems Interfaces (IEEE Std 1547-2018). To create interconnection rules that successfully address policy goals, market trends, and technical requirements, state regulators need to be well informed of DER integration considerations. Interconnection processes and technical issues often overlap; the two are not easily segregated, and they are often considered and evaluated concurrently within the context of interconnection rulemaking. Accordingly, this paper addresses both the technical issues and related process considerations. A lack of uniform and transparent procedures for addressing interconnection rule changes can result in implementation issues or inefficiencies, such as unclear, lengthy, and complicated interconnection rules that can increase distributed generation "soft costs" (i.e., non-hardware costs). This can further delay the deployment of DERs and jeopardize time-constrained national and state policy goals, such as renewable energy targets, or limit participation in emerging techno-economic trends. Additionally, misconstructed interconnection rules are at risk of becoming mired in stakeholder conflicts. This guide addresses the concerns of electric service regulators from both the process and technical standpoints by presenting a structured, step-by-step approach to developing and updating existing interconnection rules. In this document, the process of developing and updating interconnection rules is subdivided into three steps: (1) determining the context (stakeholders and major drivers); (2) developing the rule, including updating technical requirements; and (3) maintaining and revising the rule over time.

14 SOLAR ENERGY↗

Global rules for translating land-use change (LUH2) to land-cover change for CMIP6 using GLM2

Anthropogenic land-use and land-cover change activities play a critical role in Earth system dynamics through significant alterations to biogeophysical and biogeochemical properties at local to global scales. To quantify the magnitude of these impacts, climate models need consistent land-cover change time series at a global scale, based on land-use information from observations or dedicated land-use change models. However, a specific land-use change cannot be unambiguously mapped to a specific land-cover change. Here, nine translation rules are evaluated based on assumptions about the way land-use change could potentially impact land cover. Utilizing the Global Land-use Model 2 (GLM2), the model underlying the latest Land-Use Harmonization dataset (LUH2), the land-cover dynamics resulting from land-use change were simulated based on multiple alternative translation rules from 850 to 2015 globally. For each rule, the resulting forest cover, carbon density and carbon emissions were compared with independent estimates from remote sensing observations, U.N. Food and Agricultural Organization reports, and other studies. The translation rule previously suggested by the authors of the HYDE 3.2 dataset, that underlies LUH2, is consistent with the results of our examinations at global, country and grid scales. This rule recommends that for CMIP6 simulations, models should (1) completely clear vegetation in land-use changes from primary and secondary land (including both forested and non-forested) to cropland, urban land and managed pasture; (2) completely clear vegetation in land-use changes from primary forest and/or secondary forest to rangeland; (3) keep vegetation inland-use changes from primary non-forest and/or secondary non-forest to rangeland. Our analysis shows that this rule is one of three (out of nine)rules that produce comparable estimates of forest cover, vegetation carbon and emissions to independent estimates and also mitigate the anomalously high carbon emissions from land-use change observed in previous studies in the 1950s. According to the three translation rules, contemporary global forest area is estimated to be 37.42×106 km2, within the range derived from remote sensing products. Likewise, the estimated carbon stock is in close agreement with reference biomass datasets, particularly over regions with more than 50 % forest cover

58 GEOSCIENCES↗

Rule groupings: A software engineering approach towards verification of expert systems

Currently, most expert system shells do not address software engineering issues for developing or maintaining expert systems. As a result, large expert systems tend to be incomprehensible, difficult to debug or modify and almost impossible to verify or validate. Partitioning rule based systems into rule groups which reflect the underlying subdomains of the problem should enhance the comprehensibility, maintainability, and reliability of expert system software. Attempts were made to semiautomatically structure a CLIPS rule base into groups of related rules that carry the same type of information. Different distance metrics that capture relevant information from the rules for grouping are discussed. Two clustering algorithms that partition the rule base into groups of related rules are given. Two independent evaluation criteria are developed to measure the effectiveness of the grouping strategies. Results of the experiment with three sample rule bases are presented.

Mehrotra, Mala↗

Inference in fuzzy rule bases with conflicting evidence

Inference based on fuzzy 'If ... then' rules has played a very important role since when Zadeh proposed the Compositional Rule of Inference and, especially, since the first successful application presented by Mamdani. From the mid-1980's when the 'fuzzy boom' started in Japan, numerous industrial applications appeared, all using simplified techniques because of the high levels of computational complexity. Another feature is that antecedents in the rules are distributed densely in the input space, so the conclusion can be calculated by some weighted combination of the consequents of the matching (fired) rules. The CRI works in the following way: If R is a rule and A* is an observation, the conclusion is computed by B* = R o A* (o stands for the max-min composition). Algorithms implementing this idea directly have an exponential time complexity (maybe the problem is NP-hard) as the rules are relations in X x Y, a k1 x k2 dimensional space, if X is k1, Y is k2 dimensional. The simplified techniques usually decompose the relation into k1 projections in X(sub i) and measure in some way the degree of similarity between observation and antecedent by some parameter of the overlapping. These parameters are aggregated to a single value in (0,1) which is applied as a resulting weight for the given rule. The projections of rules in dimensions Y(sub i) are weighted by these aggregated values and then they are combined in order to obtain a resulting conclusion separately in every dimension. This method is unapplicable with sparse bases as there is no guarantee that an arbitrary observation matches with any of the antecedents. Then, the degree of similarity is 0 and all consequents are weighted by 0. Some considerations for such a situation are summarized in the next sections.

Koczy, Laszlo T.↗

Statistical inference of static analysis rules

Various apparatus and methods are disclosed for identifying errors in program code. Respective numbers of observances of at least one correctness rule by different code instances that relate to the at least one correctness rule are counted in the program code. Each code instance has an associated counted number of observances of the correctness rule by the code instance. Also counted are respective numbers of violations of the correctness rule by different code instances that relate to the correctness rule. Each code instance has an associated counted number of violations of the correctness rule by the code instance. A respective likelihood of the validity is determined for each code instance as a function of the counted number of observances and counted number of violations. The likelihood of validity indicates a relative likelihood that a related code instance is required to observe the correctness rule. The violations may be output in order of the likelihood of validity of a violated correctness rule.

Engler, Dawson Richards↗

Bayesian Rules of Thumb: Robust Uncertainty Quantification in Early Project Cost Estimation

Systems engineers often make use of cost Rules ofThumb in order to estimate cost during early phases of projectformulation. These Rules of Thumb typically take the form ofa sequence of percentages over which a total cost is allocatedacross NASA WBS elements. Rules of Thumb can then be usedto extrapolate cost from one or more known WBS elements tothe remaining unknown WBS elements, assisting early projectformulation architecture studies (such as those in JPL’s Team Xand A Team).A number of issues can arise when generating and using costRules of Thumb. For example, many records of project costsconsist of incomplete data. Typical methods of dealing withincomplete cost allocation data include (a) ignoring missionswith incomplete data, or (b) taking averages of the non-zero percentagesacross missions, but both of these methods can result inbiased estimates if the existence of incomplete data correlateswith total mission cost or any particular WBS element. Anothercommon example is cost reported in one or more incorrect WBSelements. This is especially prevalent in smaller missions whereit is more common for engineers to perform tasks that fall underthe purview of multiple WBS elements.Furthermore, a Rule of Thumb estimate is typically reported asa point estimate; there is no reported uncertainty around thepercentages used to generate an allocation. Even in the rarecase in which confidence intervals around mean percentages areprovided, there may be positive or negative correlations betweenWBS elements which can skew estimates.Here we attempt to address these problems by formulatingprobabilistic Rules of Thumb in which a distribution of allocationschemes, rather than a single allocation scheme, is generated.We use a bootstrap imputation method to simultaneouslyaccount for uncertainty in the missing data while using allavailable information contained in the dataset. The imputeddatasets are then input into a multivariate Bayesian modelwhich accounts for correlations between WBS elements andproperly accounts for uncertainty in the final Rule of Thumbpercentages and predictions. We describe the mathematicalmodel and provides snippets of R code utilizing the brms(Bayesian Regression Models using Stan) package. To illustratethis model, we generate a Bayesian Level 2 WBS Cost Rule ofThumb for MIDEX (Medium-Class Explorers) missions withdata extracted from NASA’s CADRe. We then compare thismethod’s performance with the classical Rule of Thumb method.

Hooke, Melissa A↗

High‐order cubature rules for tetrahedra

Summary In this paper, we construct new high‐order numerical integration schemes for tetrahedra, with positive weights and integration points that are in the interior of the domain. The construction of cubature rules is a challenging problem, which requires the solution of strongly nonlinear algebraic (moment) equations with side conditions given by affine inequality constraints. We present a robust algorithm based on a sequence of three modified Newton procedures to solve the constrained minimization problem. In the literature, numerical integration rules for the tetrahedron are available up to order p =15. We obtain integration rules for the tetrahedron from p =2 to p =20, which are computed using multiprecision arithmetic. For p ≤15, our approach provides integration rules that have the same or fewer number of integration points than existing rules; for p =16 to p =20, our rules are new. Numerical tests are presented that verify the polynomial‐precision of the cubature rules. Convergence studies are performed for the integration of exponential, rational, weakly singular and trigonometric test functions over tetrahedra with flat and curved faces. In all tests, improvements in accuracy is realized as p is increased, though in some cases nonmonotonic convergence is observed.

Jaśkowiec, Jan↗

High‐order symmetric cubature rules for tetrahedra and pyramids

Abstract In this article, we present an algorithm to construct high‐order fully symmetric cubature rules for tetrahedral and pyramidal elements, with positive weights and integration points that are in the interior of the domain. Cubature rules are fully symmetric if they are invariant to affine transformations of the domain. We divide the integration points into symmetry orbits where each orbit contains all the points generated by the permutation stars. These relations are represented by equality constraints. The construction of symmetric cubature rules require the solution of nonlinear polynomial equations with both inequality and equality constraints. For higher orders, we use an algorithm that consists of five sequential phases to produce the cubature rules. In the literature, symmetric numerical integration rules are available for the tetrahedron for orders p = 1 – 10, 14 , and for the pyramid up to p = 10 . We have obtained fully symmetric cubature rules for both of these elements up to order p = 20 . Numerical tests are presented that verify the polynomial‐precision of the cubature rules. Convergence studies are performed for the integration of exponential, weakly singular, and trigonometric test functions over both elements with flat and curved faces. With increase in p , improvements in accuracy is realized, though nonmonotonic convergence is observed.

Jaśkowiec, Jan↗