Results 1 to 10 of about 3,939,918 (112)

Masking of Internal Nodes Faults Based on Applying of Incompletely Specified Boolean Functions [PDF]

open access: yesИзвестия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2020
Combinational circuits (combinational parts of sequential circuits) are considered. Masking of internal nodes faults with applying sub-circuit, inputs of which are connected to the circuit inputs and outputs — to the circuit proper internal nodes, is ...
Matrosova, Angela Yu.   +2 more
doaj   +1 more source

Synthesis of quantum circuits based on incompletely specified functions and if-decision diagrams

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 2021
The problem of synthesis and optimisation of logical reversible and quantum circuits from functional descriptions represented as decision diagrams is considered.
Anatoly A. Prihozhy
doaj   +1 more source

Partially Programmable Circuit Design Oriented to masking Trojan Circuits

open access: yesТруды Института системного программирования РАН, 2018
The enhanced utilization of outsourcing services for a part of VLSIs (Intellectual Property cores, reprogramming components based on FPGA and so on) to cut VLSI cost increases risk of inserting Trojan Circuits (TCs) that may destroy VLSI or provide ...
A. Yu. Matrosova   +2 more
doaj   +1 more source

Topology planning for autonomous MMGs: an ordered binary decision diagram-based approach

open access: yesIET Smart Grid, 2019
This paper finds its motivation from the perspective of utility planners, where the flexibility of choice while reconfiguring a distribution system into Multi-Micrgrids (MMGs) is critical.
Hafiz Anwar Ullah Khan   +3 more
doaj   +1 more source

Degeneralization Algorithm for Generation of Büchi Automata Based on Contented Situation

open access: yesJournal of Applied Mathematics, 2015
We present on-the-fly degeneralization algorithm used to transform generalized Büchi automata (GBA) into Büchi Automata (BA) different from the standard degeneralization algorithm.
Laixiang Shan   +3 more
doaj   +1 more source

Quantum and classical nondeterministic OBDDs

open access: yesУчёные записки Казанского университета: Серия Физико-математические науки
A model of nondeterministic ordered binary decision diagrams (NOBDDs) was analyzed. A method for proving a lower bound on the complexity of quantum NOBDDs was developed.
A. F. Gainutdinova
doaj   +1 more source

Prover - Toward More Efficient Formal Verification of Masking in Probing Model

open access: yesTransactions on Cryptographic Hardware and Embedded Systems
In recent years, formal verification has emerged as a crucial method for assessing security against Side-Channel attacks of masked implementations, owing to its remarkable versatility and high degree of automation.
Feng Zhou, Hua Chen, Limin Fan
doaj   +1 more source

An Algebra for Two-Layer Cloud Filtering: Detecting Redundancy, Shadowing, and Dominance Anomalies Across Stateless Network ACLs and Stateful Security Groups

open access: yesFuture Internet
Traffic inside a cloud Virtual Private Cloud (VPC) is filtered by two layers with fundamentally different semantics: a stateless, ordered, first-match Network ACL (NACL) and a stateful, unordered, allow-only Security Group (SG). Existing analyzers decide
Thawatchai Chomsiri, Suwichai Phunsa
doaj   +1 more source

Complexity of XOR/XNOR boolean functions: a model using binary decision diagrams and back propagation neural networks

open access: yesJournal of Computer Science and Technology, 2007
This paper proposes a model that predicts the complexity of Boolean functions with only XOR/XNOR min-terms using back propagation neural networks (BPNNs) applied to Binary Decision Diagrams (BDDs). The BPNN model (BPNNM) is developed through the training
Ali Assi   +3 more
doaj  

Home - About - Disclaimer - Privacy