Log in

Relevant bibliographies by topics / Boolean / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Boolean.

Dissertations / Theses on the topic 'Boolean'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Boolean.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

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.<br>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 theor

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:

<p>A Boolean partition algebra is a pair (<i>B</i>, <i>F </i>) where <i>B</i> is a Boolean algebra and <i>F</i> is a filter on the semilattice of partitions of <i>B</i> where [special characters omitted] <i>F</i> = <i>B</i> \ {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

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 alg

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.<br>Includes bibliographical references (p. 145-149).<br>by Amelia Huimin Shen.<br>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 prove

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:

<p>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 tw

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

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 a

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

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 s

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.<br>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 criteri

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.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 203-207).<br>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 cla

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.<br>Includes bibliographical references (p. 71-72).<br>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

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 introduc

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 thre

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

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

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

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<br>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

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 appro

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 ar

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 mechanis

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.<br>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.<br>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

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

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.<br>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,

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.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 61).<br>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 al

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!