Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “MATHEMATICAL LOGIC”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Investigating Formal Methods Tools and their Applicability for Hardware Vulnerability Remediation

Formal methods use mathematical logic and equations to prove that a system or code is secure. In this poster, I examine existing formal methods tools and their application for projects working to remediate vulnerabilities in hardware and hardware description language. This poster is focused on the tools ReWire and AutoGenILA and I hope to evaluate their benefits and weaknesses with the intention of creating an internal report on the application and weaknesses of existing formal methods tools and identifying gaps for future formal methods tool creation.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Properties of Existentially Closed Companions

Necessary and sufficient conditions are stated for an arbitrary theory to be an elementary theory for a class of its existentially closed models. Conditions are given under which some existentially closed model simultaneously realizes one maximal existential type and omits another. We also prove a theorem on a prime existentially closed model over a maximal existential type. Considerable complexity of existentially closed structures and their theories was noted by A. Macintyre. Therefore, the examples of existentially closed companions having any finite or countable number of pairwise non elementarily equivalent existentially closed models constructed here are of interest.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Continuous solutions to a class of first-order fuzzy differential equations with discontinuous coefficients

In this paper, we study the continuity of solution functions to a class of fuzzy differential equations (FDEs) in the form y{sup ′}(t)=((φ(t))/((t−α){sup p}))⊙y(t)+ψ(t), where the coefficient function ((φ(t))/((t−α){sup p})) is a discontinuous function at the point t=α and α is an inner point of the interval under study. At first, the continuity of solutions for the crisp case of the problem is investigated and those results are extended to the fuzzy case of the problem from the view point of strongly generalized differentiability (G-differentiability). Next, we obtain explicit formulas of solutions and the conditions of their existence for a special class of these problems. Finally, the results are illustrated by solving some examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

TOPSIS method based on the connection number of set pair analysis under interval-valued intuitionistic fuzzy set environment

The objective of this paper is to focus on multi-attribute decision-making for interval-valued intuitionistic fuzzy set environment based on set pair analysis (SPA). For it, the major component of the SPA known as connection number has been constructed based on the set pairs between two preference values consists of every attribute and ideal pairs of it. Based on these connection numbers, an extension of technique for order of preference by similarity to ideal solution method is developed by combining the proposed connection number for IVIFSs and hence finding the best alternative(s) using relative degree of closeness coefficient. An illustrative example has been given for demonstrating the approach and compares their performance with some existing measures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Runge–Kutta method for solving fuzzy differential equations under generalized differentiability

In this paper, we interpret a fuzzy differential equation by using the strongly generalized differentiability concept. Utilizing the Generalized Characterization Theorem, we investigate the problem of finding a numerical approximation of solutions. The Runge–Kutta approximation method is implemented and its error analysis, which guarantees pointwise convergence, is given. The method applicability is illustrated by solving a linear first-order fuzzy differential equation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

TOPSIS with similarity measure for MADM applied to network selection

In this article, a new method is introduced to handle fuzzy multi-attribute decision-making problems. The method preserves fuzziness in the preference technique to avoid the drawbacks of defuzzification. The study modifies the technique of order preference by similarity to an ideal solution (TOPSIS) for interval-valued fuzzy numbers. The traditional TOPSIS uses the relative degree of closeness to rank the alternatives. Instead, a similarity measure based on map distance is used for preference. The degree of similarity between each attribute of an alternative and the ideal solution is computed, and a similarity matrix is formed. Then, the total degree of similarity for all the attributes of an alternative is used for ranking. The alternative corresponding to the one norm of the similarity matrix is the best alternative. Thus, the comparison is done on a fuzzy basis to avoid the loss of information due to converting the elements of the weighted normalized decision matrix to crisp values by defuzzification. An illustrative example is given to demonstrate the approach. A practical example in network selection to optimize vertical hand offs is solved where both user preferences and network parameters are treated as interval-valued fuzzy numbers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Designing Secure and Resilient Cyber-Physical Systems Using Formal Models

This work-in-progress paper proposes a design methodology that addresses the complexity and heterogeneity of cyber-physical systems (CPS) while simultaneously proving resilient control logic and security properties. The design methodology involves a formal methods-based approach by translating the complex control logic and security properties of a water flow CPS into timed automata. Timed automata are a formal model that describes system behaviors and properties using mathematics-based logic languages with precision. Due to the semantics that are used in developing the formal models, verification techniques, such as theorem proving and model checking, are used to mathematically prove the specifications and security properties of the CPS. This work-in-progress paper aims to highlight the need for formalizing plant models by creating a timed automata of the physical portions of the water flow CPS. Extending the time automata with control logic, network security, and privacy control processes is investigated. The final model will be formally verified to prove the design specifications of the water flow CPS to ensure efficacy and security.

42 ENGINEERING↗
DOE OSTI2018

On the Depth of k-Valued Logic Functions Over Arbitrary Bases

The behavior of the Shannon function of the depth of k-valued logic functions realized by circuits over an arbitrary complete basis is examined. For all k, k ≥ 3, for an arbitrary basis of k-valued logic functions, the existence of the asymptotic behavior of the Shannon function of the depth is established. The asymptotic behavior is linear for finite bases and it is constant or logarithmic for infinite bases. Thus, the complete picture of asymptotic behavior of the Shannon function of the depth is obtained for all k, k ≥ 2.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Learning Delayed Influences of Biological Systems

Boolean networks are widely used model to represent gene interactions and global dynamical behavior of gene regulatory networks. To understand the memory effect involved in some interactions between biological components, it is necessary to include delayed influences in the model. In this paper, we present a logical method to learn such models from sequences of gene expression data. This method analyzes each sequence one by one to iteratively construct a Boolean network that captures the dynamics of these observations. To illustrate the merits of this approach, we apply it to learning real data from bioinformatic literature. Using data from the yeast cell cycle, we give experimental results and show the scalability of the method. We show empirically that using this method we can handle millions of observations and successfully capture delayed influences of Boolean networks.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Cosmic logic: a computational model

We initiate a formal study of logical inferences in context of the measure problem in cosmology or what we call cosmic logic. We describe a simple computational model of cosmic logic suitable for analysis of, for example, discretized cosmological systems. The construction is based on a particular model of computation, developed by Alan Turing, with cosmic observers (CO), cosmic measures (CM) and cosmic symmetries (CS) described by Turing machines. CO machines always start with a blank tape and CM machines take CO's Turing number (also known as description number or Gödel number) as input and output the corresponding probability. Similarly, CS machines take CO's Turing number as input, but output either one if the CO machines are in the same equivalence class or zero otherwise. We argue that CS machines are more fundamental than CM machines and, thus, should be used as building blocks in constructing CM machines. We prove the non-computability of a CS machine which discriminates between two classes of CO machines: mortal that halts in finite time and immortal that runs forever. In context of eternal inflation this result implies that it is impossible to construct CM machines to compute probabilities on the set of all CO machines using cut-off prescriptions. The cut-off measures can still be used if the set is reduced to include only machines which halt after a finite and predetermined number of steps.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

A note on the logistic equation subject to uncertainties in parameters

This paper discusses the logistic equation subject to uncertainties in the intrinsic growth rate, α, in the initial population density, N{sub 0}, and in the environmental carrying capacity, K. These parameters are treated as independent random variables. The random variable transformation method is applied to compute the first probability density function of the time–population density, N(t), and of its inflection point, t{sup ∗}. Results for the density functions of N(t), for a fixed t>0, and t{sup ∗} are also provided for α, N{sub 0} and K uniformly distributed. Finally, numerical experiments illustrate the proposed theoretical results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

An ANFIS-based on B2C electronic commerce transaction

The purpose of this study is to use an adaptive-network-based fuzzy inference system to model a fuzzy logic-based system (FIS) for supporting decision-making process in B2C electronic commerce transaction. Firstly we introduce FIS in B2C electronic commerce transaction and ANFIS. Then we use ANFIS to model FIS with different membership functions(MF). Lastly we give a conclusion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Security analysis of boolean algebra based on Zhang-Wang digital signature scheme

In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Fuzzy analysis of serviceability limit state of slender steel beam under bending

In the present paper, deformations of a beam under equal end moments solved with influence of lateral buckling are studied. It has been found by numerical studies that the lateral deflection of slender beam under major axis bending can be relatively high.The acceptability of high values of lateral deflections within the framework of serviceability limit state is discussed. In the next part of the paper, the limit value of maximum deflection was introduced as a fuzzy number. The fuzzy analysis of the maximum moment which causes the maximum deflection was carried out. The slendernesses of beams for which the serviceability limit state is the limiting state for design were identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Multinomial logistic regression modelling of obesity and overweight among primary school students in a rural area of Negeri Sembilan

Multinomial logistic regression is widely used to model the outcomes of a polytomous response variable, a categorical dependent variable with more than two categories. The model assumes that the conditional mean of the dependent categorical variables is the logistic function of an affine combination of predictor variables. Its procedure gives a number of logistic regression models that make specific comparisons of the response categories. When there are q categories of the response variable, the model consists of q-1 logit equations which are fitted simultaneously. The model is validated by variable selection procedures, tests of regression coefficients, a significant test of the overall model, goodness-of-fit measures, and validation of predicted probabilities using odds ratio. This study used the multinomial logistic regression model to investigate obesity and overweight among primary school students in a rural area on the basis of their demographic profiles, lifestyles and on the diet and food intake. The results indicated that obesity and overweight of students are related to gender, religion, sleep duration, time spent on electronic games, breakfast intake in a week, with whom meals are taken, protein intake, and also, the interaction between breakfast intake in a week with sleep duration, and the interaction between gender and protein intake.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗