Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 22 for “"Boolean expressions."”.

  1. Mining Connected Frequent Boolean Expressions

    In this paper, we are finding Connected Frequent Boolean Expressions from cancer dataset [14] and protein protein interaction network [14] to discover group of dysregulated genes. Frequent Itemset Mining is a process of finding different sets of items that occur together frequently in a set of …

    ndsu Repository record for Mining Connected Frequent Boolean Expressions (opens in a new tab)

  2. General Boolean expressions in publish-subscribe systems

    … and advertisements as pure conjunctive expressions. Therefore, subscriptions or advertisements using operators other than conjunction need to be canonically converted to disjunctive normal form by these systems. Each conjunctive component is then treated as individual subscription or …

    waikato-masters Repository record for General Boolean expressions in publish-subscribe systems (opens in a new tab) Download file for General Boolean expressions in publish-subscribe systems (opens in a new tab)

  3. Mining Multinode Constraints and Complex Boolean Expressions for Sequential Equivalence Checking

    … approach is to mine powerful and generalized Boolean relationships among flip-flops and internal signals in a sequential circuit using a data mining algorithm. In contrast to traditional learning methods, our mining algorithms can extract illegal state cubes and inductive invariants. These …

    vt Repository record for Mining Multinode Constraints and Complex Boolean Expressions for Sequential Equivalence Checking (opens in a new tab)

  4. Digital logic testing and verification using ordered binary decision diagrams

    … of digital circuits. Since CAD systems use Boolean expressions extensively for testing and verifying digital circuits, it is necessary to find an efficient data structure algorithms for the representation and manipulation of Boolean expressions. This paper investigates Ordered Binary …

    ttu Repository record for Digital logic testing and verification using ordered binary decision diagrams (opens in a new tab)

  5. Evaluation of Modified Condition/Decision Coverage in Testing a Web Server

    … behavior, typically implemented with complex Boolean expressions. MC/DC was developed to provide the benefits of exhaustive testing of the Boolean expressions, without the overhead. Web servers are also state-based systems, and the purpose of this research is to determine whether the benefits …

    maynooth Download PDF for Evaluation of Modified Condition/Decision Coverage in Testing a Web Server (opens in a new tab)

  6. Computer Implemented Synthesis of Multiple Level Combinational Networks

    … to implement the algorithms can minimize Boolean expressions with as many as seven variables. Theoretically, there is no limit to the number of variables per expression that can be minimized by these algorithms. But when an expression has more than seven variables, the processing time …

    ut-knoxville Repository record for Computer Implemented Synthesis of Multiple Level Combinational Networks (opens in a new tab)

  7. Toward Using Games to Teach Fundamental Computer Science Concepts

    … teach two fundamental computer science concepts: boolean expressions and recursion. The games are intended to teach the concepts and not how to implement them in a programming language. For this investigation, two computer games were created. One is designed to teach basic boolean expressions and …

    denver Repository record for Toward Using Games to Teach Fundamental Computer Science Concepts (opens in a new tab)

  8. An Enhancement of Distributed Graph Queries in an Agent-Based Graph Database

    … with an abstract syntax tree (AST) for parsing Boolean expressions. On top of this, we developed two evaluation methods designed to handle constraints efficiently. These extensions improve both the flexibility and performance of read operations, while retaining the system's agent-based execution …

    washington Repository record for An Enhancement of Distributed Graph Queries in an Agent-Based Graph Database (opens in a new tab)

  9. Ensuring the Observability of Structural Test Obligations

    … extension to coverage criteria based on Boolean expressions that combines the obligations of a host criterion with an additional path condition that increases the likelihood that a fault encountered will propagate to a monitored variable. Our study, conducted over five industrial systems …

    south-carolina Repository record for Ensuring the Observability of Structural Test Obligations (opens in a new tab)

  10. Algebraic Approaches to Stochastic Optimization

    … the Quine-McCluskey method for simplification of Boolean expressions in order to simplify polynomials used in our work.

    clemson Repository record for Algebraic Approaches to Stochastic Optimization (opens in a new tab)

  11. An approach to incorporating uncertainty in network security analysis

    … extension describes each edge probability as a Boolean expression of independent indicator random variables. This thesis (i) shows that this formalism is maximally descriptive in the sense that it can describe any joint probability distribution function of edge existence, (ii) shows that when …

    uiuc Repository record for An approach to incorporating uncertainty in network security analysis (opens in a new tab)

  12. ST to FL translation for hardware design verification

    … for Ordered Binary Decision Diagrams (OBDDs), Boolean expressions can be easily and efficiently manipulated by FL programs. My research is mostly concentrated on safety property verification. Such properties assert that bad things don’t happen to the hardware designs. By using the weakest …

    ubc Repository record for ST to FL translation for hardware design verification (opens in a new tab) Download PDF for ST to FL translation for hardware design verification (opens in a new tab)

  13. Boolean Techniques in Discrete Optimization and Expert Systems

    <p>This thesis is devoted to applying Boolean methods to investigate more efficient methodologies for discrete optimization and expert systems; both are based on "binary decision".</p> <p>An efficient nonlinear 0-1 programming algorithm is proposed, which relies mainly on logic analysis applied to …

    mcmaster Repository record for Boolean Techniques in Discrete Optimization and Expert Systems (opens in a new tab)

  14. Bytecode-based Multiple Condition Coverage: An Initial Investigation

    … condition from influencing the output of a Boolean expression. Logic-based adequacy criteria such as Multiple Condition Coverage (MCC) are designed to overcome masking at the within-expression level, but can offer no guarantees about masking in subsequent expressions. As a result, a Boolean …

    south-carolina Repository record for Bytecode-based Multiple Condition Coverage: An Initial Investigation (opens in a new tab)

  15. Visual Recognition From Structured Supervision

    … More specifically, we classify objects from boolean expressions of object attributes and infer activities from regular expressions of atomic actions. The proposed models can predict unseen, subcategories and specific instances of complex visual concepts without any additional annotation …

    anu Repository record for Visual Recognition From Structured Supervision (opens in a new tab)

  16. Relating the structure and dynamics of gene regulatory networks

    … method is developed, which encodes IGs by Boolean expressions, and then uses Boolean function minimisation to obtain a compact representation. The same logical analysis method can also be applied to the logical parameters. In the last part of the thesis, the discrete modelling workflows are …

    fu-berlin Repository record for Relating the structure and dynamics of gene regulatory networks (opens in a new tab)

  17. Generalisation and optimisation in neural networks

    … architectures and Disjunctive Normal Form (DNF) boolean expressions. This yields an interpretable complexity measure, <em>K<sub>DNF</sub></em>(<em>f</em>) (shortest DNF length), which maps to the network's minimum weight norm. We show the prior over functions, <em>P</em>(<em>f</em>), …

    oxford Repository record for Generalisation and optimisation in neural networks (opens in a new tab)

  18. Design Patterns: Supporting Design Process by Automatically Detecting Design Patterns and Giving Some Feedback

    … are modelled using matrices, decision trees, boolean expressions, Prolog clauses and 4-tuples. Dong describes a method, by which the various types of relationship can be denoted in one matrix. In his article, however, there is no description of the algorithm by which a design pattern can be …

    openu Repository record for Design Patterns: Supporting Design Process by Automatically Detecting Design Patterns and Giving Some Feedback (opens in a new tab)

  19. Reuse of Model Transformations for Propagating Variability Annotations in Annotative Software Product Lines

    … of the product line. These annotations are Boolean expressions over the common and distinguishing features of the product line. A filter mechanism will remove elements from the platform if their annotations are not satisfied by the configuration. Since multiple artifacts, such as models, …

    bayreuth Repository record for Reuse of Model Transformations for Propagating Variability Annotations in Annotative Software Product Lines (opens in a new tab)

Page 1 of 2