Relevant bibliographies by topics / Boolean compositions

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Boolean compositions'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Boolean compositions.'

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.

Journal articles on the topic "Boolean compositions"

1

Bolognesi, Tommaso. "Integrated Information in Process-Algebraic Compositions." Entropy 21, no. 8 (2019): 805. http://dx.doi.org/10.3390/e21080805.

Full text
Abstract:
Integrated Information Theory (IIT) is most typically applied to Boolean Nets, a state transition model in which system parts cooperate by sharing state variables. By contrast, in Process Algebra, whose semantics can also be formulated in terms of (labeled) state transitions, system parts—“processes”—cooperate by sharing transitions with matching labels, according to interaction patterns expressed by suitable composition operators. Despite this substantial difference, questioning how much additional information is provided by the integration of the interacting partners above and beyond the sum
APA, Harvard, Vancouver, ISO, and other styles
2

O'Brien, Mary G. "Photography: My New Score." Boolean: Snapshots of Doctoral Research at University College Cork, no. 2015 (January 1, 2015): 136–41. http://dx.doi.org/10.33178/boolean.2015.28.

Full text
Abstract:
The aim of this research is to demonstrate how photography is used as a creative tool in my compositional process. Purpose-built pictures are created solely with the goal of acting as musical scores, called graphic scores, from which performers improvise. This paves a way for me, the composer, to communicate my compositional ideas to the performers, resulting in new soundscapes and original artworks, without the restrictive barriers placed upon me, the composer, by convention. As an artist, the objective is to capture unique moments in time, where images are taken naturally or by manipulating
APA, Harvard, Vancouver, ISO, and other styles
3

Lipatova, E. S. "Cryptographic properties of some vectorial boolean functions compositions." Prikladnaya diskretnaya matematika. Prilozhenie, no. 13 (September 1, 2020): 27–29. http://dx.doi.org/10.17223/2226308x/13/6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Huang, Wei, Yan Wang, and David W. Rosen. "Material feature representation and identification with composite surfacelets." Journal of Computational Design and Engineering 3, no. 4 (2016): 370–84. http://dx.doi.org/10.1016/j.jcde.2016.06.005.

Full text
Abstract:
Abstract Computer-aided materials design requires new modeling approaches to characterize and represent fine-grained geometric structures and material compositions at multiple scales. Recently, a dual-Rep approach was developed to model materials microstructures based on a new basis function, called surfacelet. As a combination of implicit surface and wavelets, surfacelets can efficiently identify and represent planar, cylindrical, and ellipsoidal geometries in material microstructures and describe the distribution of compositions and properties. In this paper, these primitive surfacelets are
APA, Harvard, Vancouver, ISO, and other styles
5

Poplavski, V. B. "On Applications of Associativity of Dual Compositions in the Algebra of Boolean Matrices." Journal of Mathematical Sciences 191, no. 5 (2013): 718–25. http://dx.doi.org/10.1007/s10958-013-1355-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vaitheeswaran, Pavan, and Ganesh Subbarayan. "Topological Modifications through Boolean Compositions on Algerbraic Level Sets Constructed from B-rep Models." Computer-Aided Design and Applications 17, no. 6 (2020): 1177–92. http://dx.doi.org/10.14733/cadaps.2020.1177-1192.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Upreti, K., and G. Subbarayan. "Signed algebraic level sets on NURBS surfaces and implicit Boolean compositions for isogeometric CAD–CAE integration." Computer-Aided Design 82 (January 2017): 112–26. http://dx.doi.org/10.1016/j.cad.2016.09.006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jiang, Jing, Lan Shu, and Xinan Tian. "On Generalized Transitive Matrices." Journal of Applied Mathematics 2011 (2011): 1–16. http://dx.doi.org/10.1155/2011/164371.

Full text
Abstract:
Transitivity of generalized fuzzy matrices over a special type of semiring is considered. The semiring is called incline algebra which generalizes Boolean algebra, fuzzy algebra, and distributive lattice. This paper studies the transitive incline matrices in detail. The transitive closure of an incline matrix is studied, and the convergence for powers of transitive incline matrices is considered. Some properties of compositions of incline matrices are also given, and a new transitive incline matrix is constructed from given incline matrices. Finally, the issue of the canonical form of a transi
APA, Harvard, Vancouver, ISO, and other styles
9

Schumann, Andrew. "Towards Context-Based Concurrent Formal Theories." Parallel Processing Letters 25, no. 01 (2015): 1540008. http://dx.doi.org/10.1142/s0129626415400083.

Full text
Abstract:
We define a kind of simple actions of labelled transition systems. These actions cannot be atomic; consequently, their compositions cannot be inductive. Their informal meaning is that in one simple action we can suppose the maximum of its modifications. Such actions are called hybrid. Then we propose two formal theories on hybrid actions (the hybrid actions are defined there as non-well-founded terms and non-well-founded formulas): group theory and Boolean algebra. Both theories possess many unusual properties such as the following one: the same member of this group theory behaves as multiplic
APA, Harvard, Vancouver, ISO, and other styles
10

Liao, Huanyu, Pavan Kumar Vaitheeswaran, Tao Song, and Ganesh Subbarayan. "Algebraic Point Projection for Immersed Boundary Analysis on Low Degree NURBS Curves and Surfaces." Algorithms 13, no. 4 (2020): 82. http://dx.doi.org/10.3390/a13040082.

Full text
Abstract:
Point projection is an important geometric need when boundaries described by parametric curves and surfaces are immersed in domains. In problems where an immersed parametric boundary evolves with time as in solidification or fracture analysis, the projection from a point in the domain to the boundary is necessary to determine the interaction of the moving boundary with the underlying domain approximation. Furthermore, during analysis, since the driving force behind interface evolution depends on locally computed curvatures and normals, it is ideal if the parametric entity is not approximated a
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Boolean compositions"

1

Martins, Mayler Gama Alvarenga. "Funtional composition and applications." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2012. http://hdl.handle.net/10183/164440.

Full text
Abstract:
Este trabalho apresenta a composição funcional (CF) como um novo paradigma para realização da síntese lógica de blocos combinacionais. CF usa uma abordagem ascendente para sintetizar funções Booleanas, sendo capaz de avaliar os custos das funções intermediárias e explorando dessa forma um grande número de combinações diferentes de funções candidatas. Há vantagens interessantes quando comparado à abordagem descendente da decomposição funcional. CF apresenta grande flexibilidade para criar algoritmos com resultados ótimos ou subótimos para diferentes aplicações. A estratégia proposta apresenta b
APA, Harvard, Vancouver, ISO, and other styles
2

(9435722), Pavankumar Vaitheeswaran. "Interface Balance Laws, Growth Conditions and Explicit Interface Modeling Using Algebraic Level Sets for Multiphase Solids with Inhomogeneous Surface Stress." Thesis, 2020.

Find full text
Abstract:
Interface balance laws are derived to describe transport across a phase interface. This is used to derive generalized conditions for phase nucleation and growth, valid even for solids with inhomogeneous surface stress.<div><br></div><div>An explicit interface tracking approach called Enriched Isogeometric Analysis (EIGA) is used to simulate phase evolution. Algebraic level sets are used as a measure of distance and for point projection, both necessary operations in EIGA. Algebraic level sets are observed to often fail for surfaces. Rectification measures are developed to make algebraic level s
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Boolean compositions"

1

Simon, Hans Ulrich. "Boolean Composition of Visual Secret Sharing Schemes." In Computer Science – Theory and Applications. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30642-6_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bolognesi, Tommaso. "LOTOS-Like Composition of Boolean Nets and Causal Set Construction." In ModelEd, TestEd, TrustEd. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68270-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Le Coënt, Adrien, Laurent Fribourg, and Romain Soulat. "Compositional Analysis of Boolean Networks Using Local Fixed-Point Iterations." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45994-3_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

De Santis, Alfredo, Giovanni Di Crescenzo, and Giuseppe Persiano. "On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-28629-5_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Braeken, An, and Igor Semaev. "The ANF of the Composition of Addition and Multiplication mod 2 n with a Boolean Function." In Fast Software Encryption. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11502760_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vuong, Quoc-Trung, Roselyne Chauvin, Sergiu Ivanov, Nicolas Glade, and Laurent Trilling. "A Logical Constraint–based Approach to Infer and Explore Diversity and Composition in Thresholded Boolean Automaton Networks." In Studies in Computational Intelligence. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-72150-7_46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Couceiro, Miguel, Stephan Foldes, and Erkko Lehtonen. "On Compositions of Clones of Boolean Functions." In International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004). CRC Press, 2019. http://dx.doi.org/10.1201/9780429081385-217.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

"Analysis of Defeasible Reasoning." In N-ary Relations for Logical Analysis of Data and Knowledge. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2782-4.ch004.

Full text
Abstract:
This chapter describes implementation of abductive and modified conclusions by means of NTA. The algorithm and rules to form hypotheses for abductive conclusions are proposed. They can be applied not only to NTA objects expressing formulas of propositional calculus, but also to a more general case when attribute domains contain more than two values. Within a specific knowledge system, choosing variables and their values depends on criteria determined by the content of the system. The techniques that we developed simplify generating abductive conclusions for given limitations, for instance, in composition and number of variables. A distinctive feature of the proposed methods is that they are based on the classical foundations of logic, that is, they do not use non-monotonic logic, the logic of defaults, etc., which allowed some violations of laws of Boolean algebra and algebra of sets.
APA, Harvard, Vancouver, ISO, and other styles
9

Schenck, Douglas, and Peter Wilson. "Symbols." In Information Modeling: The EXPRESS Way. Oxford University Press, 1994. http://dx.doi.org/10.1093/oso/9780195087147.003.0026.

Full text
Abstract:
EXPRESS-G has three basic kinds of symbol; defintion, relation, and composition. Definition and relation symbols are used to define the contents and structure of an information model. Composition symbols enable the diagrams to be spread across many physical pages. A definition symbol is a rectangle enclosing the name of the thing being defined. The type of the definition is denoted by the style of the box. Symbols are provided for EXPRESS simple types, defined types, entity types and schemas. The EXPRESS language offers a number of predefined simple types, namely Binary, Boolean, Integer, Logical, Number, Real and String. These are the terminal types of the language. The symbol for them is a solid rectangle with a double vertical line at its right end. The name of the type is enclosed within the box, as shown in Figure 18.1. The EXPRESS Generic pseudotype is not represented in EXPRESS-G as it is only used as a formal parameter to a function or procedure, and EXPRESS-G does not have these. The symbols for the select, enumeration and defined data type are dashed boxes as shown in Figure 18.2. • The symbol for a defined data type is a dashed box enclosing the name of the type. • The symbol for a select type is a dashed box with a double vertical line at the left end, enclosing the name of the select. • The symbol for an enumeration type is a dashed box with a double vertical line at the right end, enclosing the name of the enumeration. Although an enumeration is not a terminal of the EXPRESS language (because its definition includes the enumerated things), it is a terminal of the EXPRESS-G language. Figure 18.3 shows the symbol for an entity, which is a solid rectangle enclosing the name of the entity. The symbol for a schema is shown in Figure 18.3. It is a solid rectangle divided in half by a horizontal line. The name of the schema is written in the upper half of the rectangle. The lower half of the symbol is empty. EXPRESS-G does not support any notation for either function or procedure definitions.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Boolean compositions"

1

Magnini, Bernardo, and Roberto Prevete. "Exploiting lexical expansions and Boolean compositions for web querying." In the ACL-2000 workshop. Association for Computational Linguistics, 2000. http://dx.doi.org/10.3115/1117755.1117758.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vaitheeswaran, Pavan, and Ganesh Subbarayan. "Topological Modifications through Boolean Compositions on Algebraic Level Sets Constructed from B-rep Models." In CAD'19. CAD Solutions LLC, 2019. http://dx.doi.org/10.14733/cadconfp.2019.456-461.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Oparin, G. A., V. G. Bogdanova, and A. A. Pashinin. "Automated tools for the development of microservice compositions for hybrid scientific computations." In The International Workshop on Information, Computation, and Control Systems for Distributed Environments. Crossref, 2020. http://dx.doi.org/10.47350/iccs-de.2020.19.

Full text
Abstract:
In recent years, a significant amount of research is focused on the development of tools for creating composite web-services for solving both business and scientific complex problems. This study discusses tools for building compositions or ensembles of microservices (depending on the method of integration) developed based on the HPCSOMAS framework. These tools are oriented on the application in a package of applied microservices for solving computationally complex problems of structural analysis and parametric synthesis of controlled dynamic systems in a heterogeneous high-performance computin
APA, Harvard, Vancouver, ISO, and other styles
4

Tal, Avishay. "Properties and applications of boolean function composition." In the 4th conference. ACM Press, 2013. http://dx.doi.org/10.1145/2422436.2422485.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Waldhauser, Tam´s. "On Composition-Closed Classes of Boolean Functions." In 2011 IEEE 41st International Symposium on Multiple-Valued Logic (ISMVL). IEEE, 2011. http://dx.doi.org/10.1109/ismvl.2011.35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nam, Wonhong, Hyunyoung Kil, and Dongwon Lee. "Type-Aware Web Service Composition Using Boolean Satisfiability Solver." In 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services. IEEE, 2008. http://dx.doi.org/10.1109/cecandeee.2008.108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bernasconi, Anna, Valentina Ciriani, Luca Frontini, and Gabriella Trucco. "Composition of Switching Lattices and Autosymmetric Boolean Function Synthesis." In 2017 Euromicro Conference on Digital System Design (DSD). IEEE, 2017. http://dx.doi.org/10.1109/dsd.2017.54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gilmer, Justin, Michael Saks, and Srikanth Srinivasan. "Composition Limits and Separating Examples for Some Boolean Function Complexity Measures." In 2013 IEEE Conference on Computational Complexity (CCC). IEEE, 2013. http://dx.doi.org/10.1109/ccc.2013.27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Boolean compositions' for particular source types:
Journal articles
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!

To the bibliography