Results 11 to 20 of about 1,844 (139)
Approach to positional logic algebra
Sistemnì Doslìdženâ ta Informacìjnì Tehnologìï, 2023 The method of Boolean function representation in terms of positional logic algebra in compact operator form is offered. Compared with the known method, it uses position operators with a complexity of no more than two and only one type of equivalent ...
Mykola Kovalov
doaj +1 more source
2D physically unclonable functions of the arbiter type
Informatika, 2023 Objectives. The problem of constructing a new class of physically unclonable functions of the arbiter type (APUF) is being solved, based on the difference in delay times for the inputs of numerous modifications of the base element, due to both an ...
V. N. Yarmolik, A. A. Ivaniuk
doaj +1 more source
Reinforcement Learning in the Problem of Synthesis of Majority Schemes
Современные информационные технологии и IT-образование, 2021 The article presents an approach to the synthesis of combinational-logic circuits using artificial neural networks (ANNs). The presented method is focused on the use of a perspective basis using the majority function (a Boolean function of three ...
Sergey Gurov +2 more
doaj +1 more source
Physically unclonable functions with controlled propagation delay
Informatika, 2022 O b j e c t i v e s. The problem of constructing a new class of physically uncloneable functions (PUF) based on controlling the signal propagation delay through the elements lying on the path of its propagation is being solved.
V. N. Yarmolik +2 more
doaj +1 more source
Approximate Quantifier Elimination for Propositional Boolean Formulae [PDF]
, 2011 This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining over-approximations of a given formula.
Lijun Zhang +9 more
core +1 more source
, 2013 Using Vaggione’s concept of central element in a double pointed algebra, we introduce the notion of Boolean like variety as a generalization of Boolean algebras to an arbitrary similarity type. Appropriately relaxing the requirement that every element be
A. Ledda +8 more
core +1 more source
The Boolean algebra of Galois algebras [PDF]
, 2003 Let B be a Galois algebra with Galois group G, Jg={b∈B|bx=g(x)b for all x∈B} for each g∈G, and BJg=Beg for a central idempotent eg, Ba the Boolean algebra generated by {0,eg|g∈G}, e a nonzero element in Ba, and He={g∈G|eeg=e}.
Lianyong Xue, George Szeto
core +1 more source
, 2002 Over the past 25 years, I have been immersed in research in Algebra and more particularly in ring theory. I embarked on writing this book on Smarandache rings (Srings) specially to motivate both ring theorists and Smarandache algebraists to develop and ...
Vasantha, Kandasamy
core +1 more source
On the maximal subgroup of the sandwich semigroup of generalized circulant Boolean matrices [PDF]
, 1984 summary:Let $n$ be a positive integer, and $C_{n} (r)$ the set of all $n\times n$ $r$-circulant matrices over the Boolean algebra $B=\lbrace 0,1\rbrace $, $G_{n}=\bigcup _{r=0}^{n-1}C_{n}(r)$. For any fixed $r$-circulant matrix $C$ ($C\ne 0$) in $G_{n}
Tan, Yijia +3 more
core +1 more source
On the convergence of the combination technique [PDF]
, 2013 Sparse tensor product spaces provide an efficient tool todiscretize higher dimensional operator equations. The direct Galerkin method in such ansatz spaces may employ hierarchical bases, interpolets, wavelets or multilevel frames. Besides, an alternative
Griebel, Michael +3 more
core +1 more source