Dissertations / Theses: 'Boolean'

1

Fish, Washiela. "Boolean ultrapowers." Master's thesis, University of Cape Town, 2000. http://hdl.handle.net/11427/13892.

Full text

Abstract:

Bibliography: leaves 121-122.
The Boolean ultrapower construction is a generalisation of the ordinary ultrapower construction in that an arbitrary complete Boolean algebra replaces the customary powerset Boolean algebra. B. Koppelberg and S. Koppelberg [1976] show that the class of ordinary ultrapowers is properly contained in the class of Boolean ultrapowers thereby justifying the development of a theory for Boolean ultrapowers. This thesis is an exploration into the strategies whereby and the conditions under which aspects of the theory of ordinary ultrapowers can be extended to the theory of Boolean ultrapowers. Mansfield [1971] shows that a finitely iterated Boolean ultrapower is isomorphic to a single Boolean ultrapower under certain conditions. Using a different approach and under somewhat different conditions, Ouwehand and Rose [1998] show that the result also holds for K-bounded Boolean ultrapowers. Mansfield [1971] also proves a Boolean version of the Keisler-Shelah theorem. By redefining the notion of a K-good ultrafilter on a Boolean algebra, Benda [1974] obtains a complete generalisation of a theorem of Keisler which states that an ultrapower is K-saturated iff the ultrafilter is K-good. Potthoff [1974] defines the notion of a limit Boolean ultrapower and shows that, as is the case for ordinary ultrapowers, the complete extensions of a model are characterised by its limit Boolean ultrapowers. Upon the discovery by Frayne, Morel and Scott [1962] of an ultrapower of a simple group which is not simple, Burris and Jeffers [1978] investigate necessary and sufficient conditions for a Boolean ultrapower to be simple, or subdirectly irreducible, provided that the language is countable. Finally, Jipsen, Pinus and Rose [2000] extend the notion of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras, and prove that by using this definition, Blass' Characterisation Theorem can be generalised for Boolean ultrapowers.

APA, Harvard, Vancouver, ISO, and other styles

2

Van, Name Joseph. "Boolean Partition Algebras." Thesis, University of South Florida, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3560193.

Full text

Abstract:

A Boolean partition algebra is a pair (B, F ) where B is a Boolean algebra and F is a filter on the semilattice of partitions of B where [special characters omitted] F = B \ {0}. In this dissertation, we shall investigate the algebraic theory of Boolean partition algebras and their connection with uniform spaces. In particular, we shall show that the category of complete non-Archimedean uniform spaces is equivalent to a subcategory of the category of Boolean partition algebras, and notions such as supercompleteness of non-Archimedean uniform spaces can be formulated in terms of Boolean partition algebras.

APA, Harvard, Vancouver, ISO, and other styles

3

Van, Name Joseph Anthony. "Boolean Partition Algebras." Scholar Commons, 2013. http://scholarcommons.usf.edu/etd/4599.

Full text

Abstract:

A Boolean partition algebra is a pair $(B,F)$ where $B$ is a Boolean algebra and $F$ is a filter on the semilattice of partitions of $B$ where $\bigcup F=B\setminus\{0\}$. In this dissertation, we shall investigate the algebraic theory of Boolean partition algebras and their connection with uniform spaces. In particular, we shall show that the category of complete non-Archimedean uniform spaces is equivalent to a subcategory of the category of Boolean partition algebras, and notions such as supercompleteness of non-Archimedean uniform spaces can be formulated in terms of Boolean partition algebras.

APA, Harvard, Vancouver, ISO, and other styles

4

Shen, Amelia H. (Amelia Huimin). "Probabilistic representation and manipulation of Boolean functions using free Boolean diagrams." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/34087.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
Includes bibliographical references (p. 145-149).
by Amelia Huimin Shen.
Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

5

Skelley, Alan. "Relating the PSPACE reasoning power of Boolean Programs and quantified Boolean formulas." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ53391.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Schardijn, Amy. "AN INTRODUCTION TO BOOLEAN ALGEBRAS." CSUSB ScholarWorks, 2016. https://scholarworks.lib.csusb.edu/etd/421.

Full text

Abstract:

This thesis discusses the topic of Boolean algebras. In order to build intuitive understanding of the topic, research began with the investigation of Boolean algebras in the area of Abstract Algebra. The content of this initial research used a particular notation. The ideas of partially ordered sets, lattices, least upper bounds, and greatest lower bounds were used to define the structure of a Boolean algebra. From this fundamental understanding, we were able to study atoms, Boolean algebra isomorphisms, and Stone’s Representation Theorem for finite Boolean algebras. We also verified and proved many properties involving Boolean algebras and related structures. We then expanded our study to more thoroughly developed theory. This comprehensive theory was more abstract and required the use of a different, more universal, notation. We continued examining least upper and greatest lower bounds but extended our knowledge to subalgebras and families of subsets. The notions of cardinality, cellularity, and pairwise disjoint families were investigated, defined, and then used to understand the Erdös-Tarski Theorem. Lastly, this study concluded with the investigation of denseness and incomparability as well as normal forms and the completion of Boolean algebras.

APA, Harvard, Vancouver, ISO, and other styles

7

Karlsson, Fredrik. "Dynamics in Boolean Networks." Thesis, Linköping University, Department of Science and Technology, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2888.

Full text

Abstract:

In this thesis several random Boolean networks are simulated. Both completely computer generated network and models for biological networks are simulated. Several different tools are used to gain knowledge about the robustness. These tools are Derrida plots, noise analysis and mean probability for canalizing rules. Some simulations on how entropy works as an indicator on if a network is robust are also included. The noise analysis works by measuring the hamming distance between the state of the network when noise is applied and when no noise is applied. For many of the simulated networks two types of rules are applied: nested canalizing and flat distributed rules. The computer generated networks consists of two types of networks: scale-free and ER-networks. One of the conclusions in this report is that nested canalizing rules are often more robust than flat distributed rules. Another conclusion is that the mean probability for canalizing rules has, for flat distributed rules, a very dominating effect on if the network is robust or not. Yet another conclusion is that the probability distribution for indegrees, for flat distributed rules, has a strong effect on if a network is robust due to the connection between the probability distribution for indegrees and the mean probability for canalizing rules.

APA, Harvard, Vancouver, ISO, and other styles

8

Ghanbarnejad, Fakhteh. "Perturbations in Boolean Networks." Doctoral thesis, Universitätsbibliothek Leipzig, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-96825.

Full text

Abstract:

Boolean networks are coarse-grained models of the regulatory dynamics that controls the survival and proliferation of a living cell. The dynamics is time- and state-discrete. This Boolean abstraction assumes that small differences in concentration levels are irrelevant; and the binary distinction of a low or a high concentration of each biomolecule is sufficient to capture the dynamics. In this work, we briefly introduce the gene regulatory models, where with the advent of system-specific Boolean models, new conceptual questions and analytical and numerical challenges arise. In particular, the response of the system to external intervention presents a novel area of research. Thus first we investigate how to quantify a node\\\'s individual impact on dynamics in a more detailed manner than an averaging against all eligible perturbations. Since each node now represents a specific biochemical entity, it is the subject of our interest. The prediction of nodes\\\' dynamical impacts from the model may be compared to the empirical data from biological experiments. Then we develop a hybrid model that incorporates both continuous and discrete random Boolean networks to compare the reaction of the dynamics against small as well as flip perturbations in different regimes. We show that the chaotic behaviour disappears in high sensitive Boolean ensembles with respect to continuous small fluctuations in contrast to the flipping. Finally, we discuss the role of distributing delays in stabilizing of the Boolean dynamics against noise. These studies are expected to trigger additional experiments and lead to improvement of models in gene regulatory dynamics.

APA, Harvard, Vancouver, ISO, and other styles

9

Schimanski, Nichole Louise. "Orthomorphisms of Boolean Groups." PDXScholar, 2016. http://pdxscholar.library.pdx.edu/open_access_etds/3100.

Full text

Abstract:

An orthomorphism, π, of a group, (G, +), is a permutation of G with the property that the map x → -x + π(x) is also a permutation. In this paper, we consider orthomorphisms of the additive group of binary n-tuples, Zn2. We use known orthomorphism preserving functions to prove a uniformity in the cycle types of orthomorphisms that extend certain partial orthomorphisms, and prove that extensions of particular sizes of partial orthomorphisms exist. Further, in studying the action of conjugating orthomorphisms by automorphisms, we find several symmetries within the orbits and stabilizers of this action, and other orthomorphism-preserving functions. In addition, we prove a lower bound on the number of orthomorphisms of Zn2 using the equivalence of orthomorphisms to transversals in Latin squares. Lastly, we present a Monte Carlo method for generating orthomorphisms and discuss the results of the implementation.

APA, Harvard, Vancouver, ISO, and other styles

10

Boris, Šobot. "Games on Boolean algebras." Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 2009. http://dx.doi.org/10.2298/NS20090907SOBOT.

Full text

Abstract:

The method of forcing is widely used in set theory to obtain various consistency proofs. Complete Boolean algebras play the main role in applications of forcing. Therefore it is useful to define games on Boolean algebras that characterize their properties important for the method. The most investigated game is Jech’s distributivity game, such that the first player has the winning strategy iff the algebra is not (ω, 2)-distributive. We define another game characterizing the collapsing of the continuum to ω, prove several sufficient conditions for the second player to have a winning strategy, and obtain a Boolean algebra on which the game is undetermined.
Forsing je metod široko korišćen u teoriji skupova za dokaze konsistentnosti. Kompletne Bulove algebre igraju glavnu ulogu u primenama forsinga. Stoga je korisno definisati igre na Bulovim algebrama koje karakterišu njihove osobine od značaja za taj metod. Najbolje proučena je Jehova igra, koja ima osobinu da prvi igrač ima pobedničku strategiju akko algebra nije (ω, 2)-distributivna. U tezi definišemo još jednu igru, koja karakteriše kolaps kontinuuma na ω, dokazujemo nekoliko dovoljnih uslova da bi drugi igraš imao pobedničku strategiju, i konstruišemo Bulovu algebru na kojoj je igra neodređena.

APA, Harvard, Vancouver, ISO, and other styles

11

Biswas, Ayan K. "Hybrid straintronics-spintronics: Energy-efficient non-volatile devices for Boolean and non-Boolean computation." VCU Scholars Compass, 2016. http://scholarscompass.vcu.edu/etd/4263.

Full text

Abstract:

Research in future generation computing is focused on reducing energy dissipation while maintaining the switching speed in a binary operation to continue the current trend of increasing transistor-density according to Moore’s law. Unlike charge-based CMOS technology, spin-based nanomagnetic technology, based on switching bistable magnetization of single domain shape-anisotropic nanomagnets, has the potential to achieve ultralow energy dissipation due to the fact that no charge motion is directly involved in switching. However, switching of magnetization has not been any less dissipative than switching transistors because most magnet switching schemes involve generating a current to produce a magnetic field, or spin transfer torque or domain wall motion to switch magnetization. Current-induced switching invariably dissipates an exorbitant amount of energy in the switching circuit that nullifies any energy advantage that a magnet may have over a transistor. Magnetoelastic switching (switching the magnetization of a magnetostrictive magnet with voltage generated stress) is an unusual switching paradigm where the dissipation turns out to be merely few hundred kT per switching event – several orders of magnitude less than that encountered in current-based switching. A fundamental obstacle, though, is to deterministically switch the magnetization of a nanomagnet between two stable states that are mutually anti-parallel with stress alone. In this work, I have investigated ways to mitigate this problem. One popular approach to flip the magnetizations of a nanomagnet is to pass a spin polarized current through it that transfers spin angular moment from the current to the electrons in the magnet, thereby switching their spins and ultimately the magnet’s magnetization. This approach – known as spin transfer torque (STT) – is very dissipative because of the enormous current densities needed to switch magnets, We, therefore, devised a mixed mode technique to switch magnetization with a combination of STT and stress to gain both energy efficiency from stress and deterministic 180o switching from STT. This approach reduces the total energy dissipation by roughly one order of magnitude. We then extended this idea to find a way to deterministically flip magnetization with stress alone. Sequentially applying stresses along two skewed axes, a complete 180o switching can be achieved. These results have been verified with stochastic Landau-Lifshitz-Gilbert simulation in the presence of thermal noise. The 180o switching makes it possible to develop a genre of magneto-elastic memory where bits are written entirely with voltage generated stress with no current flow. They are extremely energy-efficient. In addition to memory devices, a universal NAND logic device has been proposed which satisfies all the essential characteristics of a Boolean logic gate. It is non-volatile unlike transistor based logic gates in the sense that that gate can process binary inputs and store the output (result) in the magnetization states of magnets, thereby doubling as both logic and memory. Such dual role elements can spawn non-traditional non-von-Neumann architectures without the processor and memory partition that reduces energy efficiency and introduces additional errors. A bit comparator is also designed, which happens to be all straintronic, yet reconfigurable. Moreover, a straintronic spin neuron is designed for neural computing architecture that dissipates orders of magnitude less energy than its CMOS based counterparts. Finally, an experiment has been performed to demonstrate a complete 180o switching of magnetization in a shape anisotropic magnetostrictive Co nanomagnet using voltage generated stress. The device is synthesized with nano-fabrication techniques namely electron beam lithography, electron beam evaporation, and lift off. The experimental results vindicate our proposal of applying sequential stress along two skewed axes to reverse magnetization with stress and therefore, provide a firm footing to magneto-elastic memory technology.

APA, Harvard, Vancouver, ISO, and other styles

12

Draper, Thomas Gordon. "Nonlinear complexity of Boolean permutations." College Park, Md.: University of Maryland, 2009. http://hdl.handle.net/1903/9449.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2009.
Thesis research directed by: Dept. of Mathematics. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

13

Sagdicoglu, Serhat. "Cryptological Viewpoint Of Boolean Functions." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/1082403/index.pdf.

Full text

Abstract:

Boolean functions are the main building blocks of most cipher systems. Various aspects of their cryptological characteristics are examined and investigated by many researchers from different fields. This thesis has no claim to obtain original results but consists in an attempt at giving a unified survey of the main results of the subject. In this thesis, the theory of boolean functions is presented in details, emphasizing some important cryptological properties such as balance, nonlinearity, strict avalanche criterion and propagation criterion. After presenting many results about these criteria with detailed proofs, two upper bounds and two lower bounds on the nonlinearity of a boolean function due to Zhang and Zheng are proved. Because of their importance in the theory of boolean functions, construction of Sylvester-Hadamard matrices are shown and most of their properties used in cryptography are proved. The Walsh transform is investigated in detail by proving many properties. By using a property of Sylvester-Hadamard matrices, the fast Walsh transform is presented and its application in finding the nonlinearity of a boolean function is demonstrated. One of the most important classes of boolean functions, so called bent functions, are presented with many properties and by giving several examples, from the paper of Rothaus. By using bent functions, relations between balance, nonlinearity and propagation criterion are presented and it is shown that not all these criteria can be simultaneously satisfied completely. For this reason, several constructions of functions optimizing these criteria which are due to Seberry, Zhang and Zheng are presented.

APA, Harvard, Vancouver, ISO, and other styles

14

Matulef, Kevin Michael. "Testing and learning Boolean functions." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/54663.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 203-207).
Given a function f on n inputs, we consider the problem of testing whether f belongs to a concept class C, or is far from every member of C. An algorithm that achieves this goal for a particular C is called a property testing algorithm, and can be viewed as relaxation of a proper learning algorithm, which must also return an approximation to f if it is in C. We give property testing algorithms for many different classes C, with a focus on those that are fundamental to machine learning, such as halfspaces, decision trees, DNF formulas, and sparse polynomials. In almost all cases, the property testing algorithm has query complexity independent of n, better than the best possible learning algorithm.
by Kevin Michael Matulef.
Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

15

Daitch, Samuel Isaac. "Translating alloy using Boolean circuits." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/33129.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 71-72).
Alloy is a automatically analyzable modelling language based on first-order logic. An Alloy model can be translated into a Boolean formula whose satisfying assignments correspond to instances in the model. Currently, the translation procedure mechanically converts each piece of the Alloy model individually into its most straightforward Boolean representation. This thesis proposes a more efficient approach to translating Alloy models. The key is to take advantage of the fact that an Alloy model contains patterns that are used repeatedly. This makes it natural to give a model a more structured Boolean representation, namely a Boolean circuit. Reusable pieces in the model correspond to circuit components. By identifying the most frequently used components and optimizing their corresponding Boolean formulas, the size of the overall formula for the model would be reduced without significant additional work. A smaller formula would potentially decrease the time required to determine satisfiability, resulting in faster analysis overall.
by Samuel Isaac Daitch.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

16

Cashmore, Michael. "Planning as quantified Boolean formulae." Thesis, University of Strathclyde, 2013. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=22387.

Full text

Abstract:

This work explores the idea of classical Planning as Quantified Boolean Formulae. Planning as Satisfiability (SAT) is a popular approach to Planning and has been explored in detail producing many compact and efficient encodings, Planning-specific solver implementations and innovative new constraints. However, Planning as Quantified Boolean Formulae (QBF) has been relegated to conformant Planning approaches, with the exception of one encoding that has not yet been investigated in detail. QBF is a promising setting for Planning given that the problems have the same complexity. This work introduces two approaches for translating bounded propositional reachability problems into QBF. Both exploit the expressivity of the binarytree structure of the QBF problem to produce encodings that are as small as logarithmic in the size of the instance and thus exponentially smaller than the corresponding SAT encoding with the same bound. The first approach builds on the iterative squaring formu lation of Rintanen; the intuition behind the idea is to recursively fold the plan around the midpoint, reducing the number of time-steps that need to be described from n to log2n. The second approach exploits domain-level lifting to achieve significant improvements in efficiency. Experimentation was performed to compare our formulation of the first approach with the previous formulation, and to compare both approaches with comparative and state-of-the-art SAT approaches. Results presented in this work show that our formulation of the first approach is an improvement over the previous, and that both approaches produce encodings that are indeed much smaller than corresponding SAT encodings, in both terms of encoding size and memory used during solving. Evidence is also provided to show that the first approach is feasible, if not yet competitive with the state-of-the-art, and that the second approach produces superior encodings to the SAT encodings when the domain is suited to domain-level lifting.

APA, Harvard, Vancouver, ISO, and other styles

17

Armstrong, James R. "Boolean weightless neural network architectures." Thesis, University of Central Lancashire, 2011. http://clok.uclan.ac.uk/5325/.

Full text

Abstract:

A collection of hardware weightless Boolean elements has been developed. These form fundamental building blocks which have particular pertinence to the field of weightless neural networks. They have also been shown to have merit in their own right for the design of robust architectures. A major element of this is a collection of weightless Boolean sum and threshold techniques. These are fundamental building blocks which can be used in weightless architectures particularly within the field of weightless neural networks. Included in these is the implementation of L-max also known as N point thresholding. These elements have been applied to design a Boolean weightless hardware version of Austin’s ADAM neural network. ADAM is further enhanced by the addition of a new learning paradigm, that of non-Hebbian Learning. This new method concentrates on the association of ‘dis-similarity’, believing this is as important as areas of similarity. Image processing using hardware weightless neural networks is investigated through simulation of digital filters using a Type 1 Neuroram neuro-filter. Simulations have been performed using MATLAB to compare the results to a conventional median filter. Type 1 Neuroram has been tested on an extended collection of noise types. The importance of the threshold has been examined and the effect of cascading both types of filters was examined. This research has led to the development of several novel weightless hardware elements that can be applied to image processing. These patented elements include a weightless thermocoder and two weightless median filters. These novel robust high speed weightless filters have been compared with conventional median filters. The robustness of these architectures has been investigated when subjected to accelerated ground based generated neutron radiation simulating the atmospheric radiation spectrum experienced at commercial avionic altitudes. A trial investigating the resilience of weightless hardware Boolean elements in comparison to standard weighted arithmetic logic is detailed, examining the effects on the operation of the function when implemented on hardware experiencing high energy neutron bombardment induced single event effects. Further weightless Boolean elements are detailed which contribute to the development of a weightless implementation of the traditionally weighted self ordered map.

APA, Harvard, Vancouver, ISO, and other styles

18

Tarnoff, David. "Episode 4.10 – More Boolean Simplifications." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/37.

Full text

Abstract:

Because many students have trouble when trying to simplify Boolean expressions, we’re going to dedicate another episode to examples of simplification. We’re also going to show how sometimes, there’s more than one way to crack an egg.

APA, Harvard, Vancouver, ISO, and other styles

19

Aleksandar, Pavlović. "Sequential Topologies on Boolean Algebras." Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 2009. http://dx.doi.org/10.2298/NS20090113PAVLOVIC.

Full text

Abstract:

A priori limit operator>. maps sequence of a set X into a subset of X.There exists maximal topology on X such that for each sequence x there holds>.(x) C limx. The space obtained in such way is always sequential.If a priori limit operator each sequence x which satisfy lim sup x = lim inf xmaps into {lim sup x}, then we obtain the sequential topology Ts. If a priori 'limitoperator maps each sequence x into {lim sup x}, we obtain topology denoted byaT. Properties of these topologies, in general, on class of Boolean algebras withcondition (Ii) and on class of weakly-distributive b-cc algebras are investigated.Also, the relations between these classes and other classes of Boolean algebras areconsidered.
A priori limit operator A svakom nizu elemenata skupa X dodeljuje nekipodskup skupa X. Tada na skupu X postoji maksimalna topologija takva da zasvaki niz x vazi A(X) c lim x. Tako dobijen prostor je uvek sekvencijalan.Ako a priori limit operator svakom nizu x koji zadovoljava uslov lim sup x =liminfx dodeljuje skup {limsupx} onda se, na gore opisan nacin, dobija tzv.sekvencijalna topologija Ts. Ako a priori limit operator svakom nizu x dodeljuje{lim sup x}, dobija se topologija oznacena sa OT. Ispitivane su osobine ovihtopologija, generalno, na klasi Bulovih algebri koje zadovoljavaju uslov (Ii) inaklasi slabo-distributivnih i b-cc algebri, kao i odnosi ovih klasa prema drugimklasama Bulovih algebri.

APA, Harvard, Vancouver, ISO, and other styles

20

Cherupally, Sai Kiran. "Hierarchical Random Boolean Network Reservoirs." PDXScholar, 2018. https://pdxscholar.library.pdx.edu/open_access_etds/4345.

Full text

Abstract:

Reservoir Computing (RC) is an emerging Machine Learning (ML) paradigm. RC systems contain randomly assembled computing devices and can be trained to solve complex temporal tasks. These systems are computationally cheaper to train than other ML paradigms such as recurrent neural networks, and they can also be trained to solve multiple tasks simultaneously. Further, hierarchical RC systems with fixed topologies, were shown to outperform monolithic RC systems by up to 40% when solving temporal tasks. Although the performance of monolithic RC networks was shown to improve with increasing network size, building large monolithic networks may be challenging, for example because of signal attenuation. In this research, larger hierarchical RC systems were built using a network generation algorithm. The benefits of these systems are presented by evaluating their accuracy in solving three temporal problems: pattern detection, food foraging, and memory recall. This work also demonstrates the functionality of random Boolean networks being used as reservoirs. Networks with up to 5,000 neurons were used to 200 sequences from memory and to identify X or O patterns temporally. Also, a Genetic Algorithm (GA) was used to train different types of hierarchical RC networks, to find optimal solutions for food-foraging tasks. This research shows that about 80% of the possible different hierarchical configurations of RC systems can outperform monolithic RC systems by up to 60% while solving complex temporal tasks. These results suggest that hierarchical random Boolean network RC systems can be used to solve temporal tasks, instead of building large monolithic RC systems.

APA, Harvard, Vancouver, ISO, and other styles

21

Xiao, Yufei. "Boolean models for genetic regulatory networks." [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-1498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Gnucci, Alessandro. "Online adaptation in Boolean network robots." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20953/.

Full text

Abstract:

Questa tesi si concentra su molteplici processi di adattamento online utilizzati su un robot autonomo, che è controllato da una rete booleana; l’obiettivo è adattare il suo comportamento ad un ambiente e ad un compito specifici. I risultati mostrano che il robot può adattarsi per navigare l’ambiente ed evitare le collisioni, seguendo inoltre un altro robot in movimento; riesce anche a generalizzare, quando posizionato in un’arena diversa rispetto a quella usata in allenamento. Con due dei processi di adattamento testati, il robot può esprimere più fenotipi (comportamenti) dallo stesso genotipo (nodi e connessioni della rete booleana), ottenendo così la plasticità fenotipica. Ciò si ottiene modificando l’accoppiamento tra i sensori o gli attuatori del robot con la rete.

APA, Harvard, Vancouver, ISO, and other styles

23

Rota, Pascal. "Boolean operations on point set surfaces." Zürich : ETH, Swiss Federal Institute of Technology Zurich, Department of Computer Science, Institute of Computational Science, 2008. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=363.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Zhang, Xueqin. "Control of Boolean discrete event systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ28860.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Bell, Steven. "Modular homology in the Boolean algebra." Thesis, University of East Anglia, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368141.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Bisset, D. L. "Untrained Boolean networks as connectionist processors." Thesis, University of Kent, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.380622.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

LEAL, HELOISA REIS. "BOOLEAN OPERATIONS ON POINT-BASED MODELS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2004. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5881@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
Operações booleanas em modelagem 3D são usadas para criar novos modelos ou para modificá-los. Na maioria dos tipos de representação de objetos 3D, estas operações são bastante complexas. Nos últimos anos tem sido muito explorado um novo tipo de modelagem, a modelagem por pontos, que apresenta muitas vantagens em relação às outras representações como maior simplicidade e eficiência. Dois trabalhos exploram as operações booleanas na modelagem por pontos, o trabalho de Adams e Dutré e o trabalho de Pauly et. al. Dada a grande importância deste novo tipo de modelagem e do uso de operações booleanas, esta dissertação apresenta uma introdução à modelagem por pontos, implementa o algoritmo proposto em Adams e Dutré com algumas melhorias e o compara com o método de Pauly et. al.
Boolean operations are used to create or modify models. These operations in the majority of 3D object representations are very complex. In the last years a significant trend in computer graphics has been the shift towards point sampled 3D models due to their advantages over other representations, such as simplicity and efficiency. Two recent works present algorithms to perform interactive boolean operations on point-based models: the work by Adams and Dutré and the work by Pauly et. Al.. Due to great importance of this novel representation and of the use of boolean operations, the present work makes an introduction to point-based representation, implements the algorithm proposed by Adams and Dutré with some improvements, and compares this implementation with the work by Pauly et. al..

APA, Harvard, Vancouver, ISO, and other styles

28

Yan, Catherine Huafei. "The theory of commuting Boolean algebras." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/43462.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Liu, Ming. "Analysis and Synthesis of Boolean Networks." Licentiate thesis, KTH, Elektronik och Inbyggda System, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177138.

Full text

Abstract:

In this thesis, we present techniques and algorithms for analysis and synthesis of synchronous Boolean and multiple-valued networks. Synchronous Boolean and multiple-valued networks are a discrete-space discrete-time model of gene regulatory networks. Their cycle of states, called \emph{attractors}, are believed to give a good indication of the possible functional modes of the system. This motivates research on algorithms for finding attractors. Existing decision diagram-based approaches have limited capacity due to the excessive memory requirements of decision diagrams. Simulation-based approaches can be applied to large networks, however, their results are incomplete. In the first part of this thesis, we present an algorithm, which uses a SAT-based bounded model checking approach to find all attractors in a multiple-valued network. The efficiency of the presented algorithm is evaluated by analysing 30 network models of real biological processes as well as \num{35000} randomly generated 4-valued networks. The results show that our algorithm has a potential to handle an order of magnitude larger models than currently possible. One of the characteristic features of genetic regulatory networks is their inherent robustness, that is, their ability to retain functionality in spite of the introduction of random faults. In the second part of this thesis, we focus on the robustness of a special kind of Boolean networks called \emph{Balanced Boolean Networks} (BBNs). We formalize the notion of robustness and introduce a method to construct \emph{BBNs} for $2$-singleton attractors Boolean networks. The experiment results show that \emph{BBNs} are capable of tolerating single stuck-at faults. Our method improves the robustness of random Boolean networks by at least $13\%$ on average, and in some special case, up to $61\%$. In the third part of this thesis, we focus on a special type of synchronous Boolean networks, namely Feedback Shift Registers (FSRs). FSR-based filter generators are used as a basic building block in many cryptographic systems, e.g. stream ciphers. Filter generators are popular because their well-defined mathematical description enables a detailed formal security analysis. We show how to modify a filter generator into a nonlinear FSR, which is faster, but slightly larger, than the original filter generator. For example, the propagation delay can be reduced 1.54 times at the expense of 1.27\% extra area. The presented method might be important for applications, which require very high data rates, e.g. 5G mobile communication technology. In the fourth part of this thesis, we present a new method for detecting and correcting transient faults in FSRs based on duplication and parity checking. Periodic fault detection of functional circuits is very important for cryptographic systems because a random hardware fault can compromise their security. The presented method is more reliable than Triple Modular Redundancy (TMR) for large FSRs, while the area overhead of the two approaches are comparable. The presented approach might be important for cryptographic systems using large FSRs.

QC 20151120

APA, Harvard, Vancouver, ISO, and other styles

30

Luo, Jamie X. "Functionality and sensing in Boolean networks." Thesis, University of Warwick, 2012. http://wrap.warwick.ac.uk/49634/.

Full text

Abstract:

The main theme of this thesis is investigating how a cell’s biological function relates to the topology of its Gene Regulatory Network (GRN). In this context, the limits a biological function places on evolution are examined and also whether genetic networks can evolve the capacity to sense internal mutations. GRNs are modelled using Threshold Boolean Networks (TBNs), abstracting away details so that certain computational approaches become viable. For instance in Chapter 3, all possible TBNs that attain a specified functional path (of the form {v(t)}T t=0) through the expression state space are exhaustively found from a possible 3N2 TBNs, where N is the number of genes (nodes) in the network. This allows for the detailed examination of the complete neutral evolutionary space of a given functional path. It is demonstrated that the major quantities of interest, such as the connectivity of this neutral space under point mutations, the mutational and noise robustness of the TBNs in this space and even the number of networks all depend strongly on the duration T of the paths. The neutral space is found to disintegrate rapidly into disconnected components as T is increased. The effect of more exotic functional forms is also investigated. Chapter 4 focuses on evolving networks which are sensitive to deletion mutations. It is found that increased sensitivity is readily evolvable in TBNs, with the networks evolving to be more topologically balanced (they possess a similar number of excitatory and inhibitory interactions). Networks are only found to achieve maximal sensitivity through attaining long limit cycles. The study of sensitivity is extended to static populations of TBNs in Chapter 5 and the question is asked about whether a population of cells can develop the capacity to sense the presence of a mutant among them. The multicellular framework is also used to investigate the effect of intercellular connectivity on the dynamics. It is found that the greater the intercellular connectivity the more uniform the expression patterns are between cells. Chapter 6 applies the general Ergodic Set (ES) [Ribeiro and Kauffman, 2007] concept to stem cell differentiation and cancer. An alternative hypothesis to that in [Serra et al., 2010] is proposed about how to model stem cell differentiation using ESs. Coupled with results from Chapter 4, I suggest that under this new hypothesis, pluripotent stem cells will correspond to more sensitive TBNs and that differentiated stem cells will correspond to more robust TBNs.

APA, Harvard, Vancouver, ISO, and other styles

31

Tarnoff, David. "Episode 4.09 - Simplification of Boolean Expressions." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/2.

Full text

Abstract:

In this episode, we take a break from proving identities of Boolean algebra and start applying them. Why? Well, so we can build our Boolean logic circuits with fewer gates. That means they’ll be cheaper, smaller, and faster. That’s why.

APA, Harvard, Vancouver, ISO, and other styles

32

Tarnoff, David. "Episode 4.05 – Introduction to Boolean Algebra." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/33.

Full text

Abstract:

Truth tables and circuit diagrams fall short in many ways including their abilities to evaluate and manipulate combinational logic. By using algebraic methods to represent logic expressions, we can apply properties and identities to improve performance.

APA, Harvard, Vancouver, ISO, and other styles

33

Tarnoff, David. "Episode 4.06 – Properties of Boolean Algebra." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Tarnoff, David. "Episode 4.07 – Identities of Boolean Algebra." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/35.

Full text

Abstract:

We are familiar with algebraic laws such as multiply zero by anything, and we get zero. In this episode, we see how a Boolean expression containing a constant, a duplicated signal, or a signal being combined with its inverse will simplify…always.

APA, Harvard, Vancouver, ISO, and other styles

35

Sohanghpurwala, Ali Asgar Ali Akbar. "Exploits in Concurrency for Boolean Satisfiability." Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/86417.

Full text

Abstract:

Boolean Satisfiability (SAT) is a problem that holds great theoretical significance along with effective formulations that benefit many real-world applications. While the general problem is NP-complete, advanced solver algorithms and heuristics allow for fast solutions to many large industrial problems. In addition to SAT, many applications rely on generalizations of Satisfiability such as MaxSAT, and Satisfiability Modulo Theories (SMT). Much of the advancement in SAT solver performance has been in the realm of improved sequential solvers with advanced conflict resolution, learning mechanisms, and sophisticated heuristics. There have been some successful demonstrations of massively parallel and hardware-accelerated solvers for SAT, but these have failed to find their way into mainstream usage. This document first presents previous work in Hardware Acceleration of Satisfiability followed by an analysis of why these attempts failed to gain widespread acceptance. It then demonstrates an alternative, hardware-centric approach, based on distributed Stochastic Local Search (SLS) that is better suited to efficient hardware implementation. Then a parallel SLS/CDCL hybrid approach is proposed that is suitable for distributed search with minimal communication overhead while maintaining completeness. Finally the efficacy and flexibility of distributed local search is considered with an adaptation to Weighted Partial MaxSAT (WPMS) and a focused case study on converted Probabilistic Inference instances.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

36

Bruns, Corey T. "Variations of independence in boolean algebras." Connect to online resource, 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3303844.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Vigo, Ronaldo. "Mathematical principles of Boolean concept learning." [Bloomington, Ind.] : Indiana University, 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3319897.

Full text

Abstract:

Thesis (Ph.D.)--Indiana University, Dept. of Cognitive Science, 2008.
Title from home page (viewed on May 13, 2009). Source: Dissertation Abstracts International, Volume: 69-08, Section: B, page: 5073. Advisers: Colin Allen; John Kruschke.

APA, Harvard, Vancouver, ISO, and other styles

38

Chakrapani, Lakshmi Narasimhan. "Probabilistic boolean logic, arithmetic and architectures." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26706.

Full text

Abstract:

Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2009.
Committee Chair: Palem, Krishna V.; Committee Member: Lim, Sung Kyu; Committee Member: Loh, Gabriel H.; Committee Member: Mudge, Trevor; Committee Member: Yalamanchili, Sudhakar. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

39

Bailey, Delbert D. "Phase transitions of boolean satisfiability variants /." Diss., Digital Dissertations Database. Restricted to UC campuses, 2004. http://uclibs.org/PID/11984.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Musukwa, Augustine. "Some cryptographic properties of Boolean functions." Doctoral thesis, Università degli studi di Trento, 2019. http://hdl.handle.net/11572/246824.

Full text

Abstract:

We investigate some cryptographic properties of Boolean functions. Some of the properties we are going to consider include weight, balancedness, nonlinearity and resiliency. Mainly, we study how the properties of a Boolean function can be related to the properties of some other functions in a lower dimension. We utilize these relations to construct balanced and resilient functions. Another aspect which we consider is the set of linear structures of Boolean functions. Our interest is in construction of balanced functions which have a trivial set of linear structures. It is well-known that block ciphers may suffer from two main attacks, namely, differential attacks and linear attacks. APN functions are known to provide the best resistance against differential attacks. We look at some properties of APN functions in even dimension. We study the linear structures of their components. We show that there must be at least a component whose set of linear structures is trivial. In particular, we determine the possible size of the set of linear structures for any component of an APN permutation. Based on the sizes of the sets of linear structures for the components, we establish a simple characterization of quadratic APN functions, and this knowledge is useful in proving some results on a general form for the number of bent components. We further consider counting bent components in any quadratic power functions. Based on the behaviour of second order derivatives, we derive some quantities which are used for characterization of quadratic and cubic APN functions. We show that these quantities can also be used to characterize quadratic and cubic Bent functions. Furthermore, we show that these derived quantities can be linked to the size of the set of linear structures for any quadratic and cubic partially-bent functions.

APA, Harvard, Vancouver, ISO, and other styles

41

Musukwa, Augustine. "Some cryptographic properties of Boolean functions." Doctoral thesis, Università degli studi di Trento, 2019. http://hdl.handle.net/11572/246824.

Full text

Abstract:

We investigate some cryptographic properties of Boolean functions. Some of the properties we are going to consider include weight, balancedness, nonlinearity and resiliency. Mainly, we study how the properties of a Boolean function can be related to the properties of some other functions in a lower dimension. We utilize these relations to construct balanced and resilient functions. Another aspect which we consider is the set of linear structures of Boolean functions. Our interest is in construction of balanced functions which have a trivial set of linear structures. It is well-known that block ciphers may suffer from two main attacks, namely, differential attacks and linear attacks. APN functions are known to provide the best resistance against differential attacks. We look at some properties of APN functions in even dimension. We study the linear structures of their components. We show that there must be at least a component whose set of linear structures is trivial. In particular, we determine the possible size of the set of linear structures for any component of an APN permutation. Based on the sizes of the sets of linear structures for the components, we establish a simple characterization of quadratic APN functions, and this knowledge is useful in proving some results on a general form for the number of bent components. We further consider counting bent components in any quadratic power functions. Based on the behaviour of second order derivatives, we derive some quantities which are used for characterization of quadratic and cubic APN functions. We show that these quantities can also be used to characterize quadratic and cubic Bent functions. Furthermore, we show that these derived quantities can be linked to the size of the set of linear structures for any quadratic and cubic partially-bent functions.

APA, Harvard, Vancouver, ISO, and other styles

42

Upadrasta, Bharat. "Boolean factor analysis a review of a novel method of matrix decomposition and neural network Boolean factor analysis /." Diss., Online access via UMI:, 2009.

Find full text

Abstract:

Thesis (M.S.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Systems Science and Industrial Engineering, 2009.
Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

43

Shi, Junhao. "Boolean techniques in testing of digital circuits." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=98361816X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Geschke, Stefan. "On s-filtered [sigma-filtered] Boolean algebras." [S.l. : s.n.], 1999. http://www.diss.fu-berlin.de/2000/70/index.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Klotz, Johannes Georg [Verfasser]. "On canalizing Boolean functions / Johannes Georg Klotz." Ulm : Universität Ulm. Fakultät für Ingenieurwissenschaften und Informatik, 2014. http://d-nb.info/1052935885/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Bittner, Sven. "General Boolean Expressions in Publish-Subscribe Systems." The University of Waikato, 2008. http://hdl.handle.net/10289/2529.

Full text

Abstract:

The increasing amount of electronically available information in society today is undeniable. Examples include the numbers of general web pages, scientific publications, and items in online auctions. From a user's perspective, this trend will lead to information overflow. Moreover, information publishers are compromised by this situation, as users have greater difficulty in identifying useful information. Publish-subscribe systems can be applied to cope with the reality of information overflow. In these systems, users specify their information interests as subscriptions and, subsequently, only matching information (event messages) is delivered; uninteresting information is filtered out before reaching users. In this dissertation, we consider content-based publish-subscribe systems, a sophisticated example of these systems. They perform the information-filtering task based on the content of provided information. In order to deal with high numbers of subscriptions and frequencies of event messages, publish-subscribe systems are realized as distributed systems. Advertisements---publisher specifications of potential future event messages---are optionally applied in these systems to reduce the internal distribution of subscriptions. Existing work on content-based publish-subscribe concepts mainly focuses on subscriptions 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 advertisement. Unfortunately, the size of converted expressions is exponential in the worst case. In this dissertation, we show that the direct support of general Boolean subscriptions and advertisements improves the time and space efficiency of general-purpose content-based publish-subscribe systems. For this purpose, we develop suitable approaches for the filtering and routing of general Boolean expressions in these systems. Our approaches represent solutions to exactly those components of content-based publish-subscribe systems that currently restrict subscriptions and advertisements to conjunctive expressions. On the subscription side, we present an effective generic filtering algorithm, and a novel approach to optimize event routing tables, which we call subscription pruning. To support advertisements, we show how to calculate the overlap between subscriptions and advertisements, and introduce the first designated subscription routing optimization, which we refer to as advertisement pruning. We integrate these approaches into our prototype BoP (BOolean Publish-subscribe) which allows for the full support of general Boolean expressions in its filtering and routing components. In the evaluation part of this dissertation, we empirically analyze our prototypical implementation BoP and compare its algorithms to existing conjunctive solutions. We firstly show that our general-purpose Boolean filtering algorithm is more space- and time-efficient than a general-purpose conjunctive filtering algorithm. Secondly, we illustrate the effectiveness of the subscription pruning routing optimization and compare it to the existing covering optimization approach. Finally, we demonstrate the optimization effect of advertisement pruning while maintaining the existing overlapping relationships in the system.

APA, Harvard, Vancouver, ISO, and other styles

47

Wang, Yuwei. "Supervisory control of Boolean discrete-event systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0020/MQ53446.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Schwerdtfeger, Konrad W. [Verfasser]. "Connectivity of Boolean satisfiability / Konrad W. Schwerdtfeger." Hannover : Technische Informationsbibliothek (TIB), 2016. http://d-nb.info/1116960338/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Saeed, Saif Eldin Osman. "Boundary merging in Boolean and offsetting operations." Thesis, University of Leeds, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270161.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Zhan, Bohua. "Evaluation of boolean formulas with restricted inputs." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/61269.

Full text

Abstract:

Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Physics, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 61).
In this thesis, I will investigate the running time of quantum algorithms for evaluating boolean functions when the input is promised to satisfy certain conditions. The two quantum algorithms considered in this paper are the quantum walk algorithm for NAND trees given by Farhi and Gutmann [2], and an algorithm for more general boolean formulas based on span programs, given by Reichardt and Spalek [6]. I will show that these algorithms can run much faster on a certain set of inputs, and that there is a super-polynomial separation between the quantum algorithm and the classical lower bound on this problem. I will apply this analysis to quantum walks on decision trees, as described in [3], giving a class of decision trees that can be penetrated quickly by quantum walk but may not be efficiently searchable by classical algorithms.
by Bohua Zhan.
S.B.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Boolean'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles