Relevant bibliographies by topics / Boolean operation

Contents

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

Academic literature on the topic 'Boolean operation'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 June 2025

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 operation.'

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 operation"

1

Butkote, R., and K. Denecke. "SEMIGROUP PROPERTIES OF BOOLEAN OPERATIONS." Asian-European Journal of Mathematics 01, no. 02 (2008): 157–75. http://dx.doi.org/10.1142/s1793557108000163.

Full text
Abstract:
A clone is a set of operations defined on a base set A which is closed under composition and contains all the projection operations. There are several ways to regard a clone as an algebraic structure (see e.g. [3]). If f, g1, … , gn : An → A are n-ary operations defined on A, then by [Formula: see text] for all a1, … , an ∈ A an n + 1-ary operation on the set On(A) of all n-ary operations can be defined. From this operation one can derive a binary operation + by [Formula: see text] and obtains a semigroup (On(A); +). In this paper we study semigroup properties of this semigroup and its subsemigroups.
APA, Harvard, Vancouver, ISO, and other styles
2

Dasgupta, Abhijit. "Boolean operations, Borel sets, and Hausdorff's question." Journal of Symbolic Logic 61, no. 4 (1996): 1287–304. http://dx.doi.org/10.2307/2275817.

Full text
Abstract:
The study of infinitary Boolean operations was undertaken by the early researchers of descriptive set theory soon after Suslin's discovery of the important operation. The first attempt to lay down their theory in a systematic fashion was the work of Kantorovich and Livenson [5], where they call these the analytical operations. Earlier, Hausdorff had introduced the δs operations — essentially same as the monotoneω-ary Boolean operations, and Kolmogorov, independently of Hausdorff, had discovered the same objects, which were used in his study of the R operator.The ω-ary Boolean operations turned out to be closely related to most of the classical hierarchies over a fixed Polish space X, including, e. g., the Borel hierarchy (), the difference hierarchies of Hausdorff (Dη()), the C-hierarchy (Cξ) of Selivanovski, and the projective hierarchy (): for each of these hierarchies, every level can be expressed as the range of an ω-ary Boolean operation applied to all possible sequences of open subsets of X. In the terminology of Dougherty [3], every level is “open-ω-Boolean” (if and are collections of subsets of X and I is any set, is said to be -I-Boolean if there exists an I-ary Boolean operation Φ such that = Φ, i. e. is the range of Φ restricted to all possible I-sequences of sets from ). If in addition, the space X has a basis consisting of clopen sets, then the levels of the above hierarchies are also “clopen-ω-Boolean.”
APA, Harvard, Vancouver, ISO, and other styles
3

Zhou, Zhili, Ching-Nung Yang, Song-Ruei Cai, and Dao-Shun Wang. "Boolean Operation Based Visual Cryptography." IEEE Access 7 (2019): 165496–508. http://dx.doi.org/10.1109/access.2019.2951722.

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

Dong, Zhekang, Donglian Qi, Yufei He, Zhao Xu, Xiaofang Hu, and Shukai Duan. "Easily Cascaded Memristor-CMOS Hybrid Circuit for High-Efficiency Boolean Logic Implementation." International Journal of Bifurcation and Chaos 28, no. 12 (2018): 1850149. http://dx.doi.org/10.1142/s0218127418501493.

Full text
Abstract:
Memristor is a novel passive electronic element with resistance-switching dynamics. Due to the threshold property and the variable conductivity of the memristive element, its composite circuits are promising for the implementation of logic operations. In this paper, a flexible logic circuit based on the threshold-type memristor and the mature complementary metal-oxide-semiconductor (CMOS) technology is designed for the realization of Boolean logic operations. Specifically, the proposed method is able to perform the NAND, AND, OR, and NOR gate operations through two phases, i.e. the writing operation and the reading operation. In such implementation, the total delay is very small especially for time-sequence inputs. Furthermore, for existing memristor-based logic implementation, a contrastive analysis with relevant computer simulations is carried out. The experimental results indicate that the proposed method is capable of realizing all basic Boolean logic operations, and some more complicated cascaded logic operations with more compact circuit structures, higher efficiency, and lower operating cost.
APA, Harvard, Vancouver, ISO, and other styles
5

Jin, Wen Yu, Yuan Yao, Wei Deng Chen, and Qing Xi Hu. "Boolean Operations Algorithm on Triangle Meshes for Modeling Bone Scaffold." Advanced Materials Research 421 (December 2011): 118–22. http://dx.doi.org/10.4028/www.scientific.net/amr.421.118.

Full text
Abstract:
Boolean operation is the key technology for modeling the bone scaffold. This paper proposes a Boolean operation algorithm based on triangle mesh model. It firstly voxelizes the mesh models based on project vector and octree, and classifies the vertices into inside, outside and surface type according to the position relationship between the vertex and the other mesh model’s voxel. Then the triangles can be easily classified based on the vertices class. Finally the Boolean model can be composed by the corresponding triangles of the Boolean operation. In order to obtain the intersection features well, it detects the intersection lines and gets the intersection polygons further, and then triangulates the polygon using the ear clipping method. This Boolean operation algorithm has been applied to the bone scaffold modeling and got good performance．
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Yi Qing, Zhi Jin Guan, Can Gang Lu, and Jin Feng He. "Iterative Construct of Reversible Network Based on Cascade Operation." Advanced Materials Research 798-799 (September 2013): 419–22. http://dx.doi.org/10.4028/www.scientific.net/amr.798-799.419.

Full text
Abstract:
Reversible logic synthesis has become a fast developing area. In order to construct reversible logic gate network, this paper presents an algorithm of iterative construct reversible network by cascade operation. The cascade operation was implemented with Boolean permutation. We proposed two important decision condition of Boolean permutation, and changed to choose balance function of suffice Boolean permutation condition for the problem of construct reversible network. The result of algorithm analysis show that it is can be implemented fleetly.
APA, Harvard, Vancouver, ISO, and other styles
7

OKHOTIN, ALEXANDER. "GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS." International Journal of Foundations of Computer Science 17, no. 03 (2006): 629–64. http://dx.doi.org/10.1142/s0129054106004029.

Full text
Abstract:
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical connectives added to the formalism of rules. In addition to the standard LR operations, Shift and Reduce, the new algorithm uses a third operation called Invalidate, which reverses a previously made reduction. This operation makes the mathematical justification of the algorithm significantly different from its prototype. On the other hand, the changes in the implementation are not very substantial, and the algorithm still works in time O(n4).
APA, Harvard, Vancouver, ISO, and other styles
8

KRISHNAN, S., D. MANOCHA, M. GOPI, T. CULVER, and J. KEYSER. "BOOLE: A BOUNDARY EVALUATION SYSTEM FOR BOOLEAN COMBINATIONS OF SCULPTURED SOLIDS." International Journal of Computational Geometry & Applications 11, no. 01 (2001): 105–44. http://dx.doi.org/10.1142/s0218195901000419.

Full text
Abstract:
In this paper we describe a system, BOOLE, that generates the boundary representations (B-reps) of solids given as a CSG expression in the form of trimmed Bézier patches. The system makes use of techniques from computational geometry, numerical linear algebra and symbolic computation to generate the B-reps. Given two solids, the system first computes the intersection curve between the two solids using our surface intersection algorithm. Using the topological information of each solid, it computes various components within each solid generated by the intersection curve and their connectivity. The component classification step is performed by ray-shooting. Depending on the Boolean operation performed, appropriate components are put together to obtain the final solid. We also present techniques to parallelize this system on shared memory multiprocessor machines. The system has been successfully used to generate B-reps for a number of large industrial models including parts of a notional submarine storage and handling room (courtesy - Electric Boat Inc.) and Bradley fighting vehicle (courtesy - Army Research Labs). Each of these models is composed of over 8000 Boolean operations and is represented using over 50,000 trimmed Bézier patches. Our exact representation of the intersection curve and use of stable numerical algorithms facilitate an accurate boundary evaluation at every Boolean set operation and generation of topologically consistent solids.
APA, Harvard, Vancouver, ISO, and other styles
9

Feldman, Norman. "Cylindric algebras with terms." Journal of Symbolic Logic 55, no. 2 (1990): 854–66. http://dx.doi.org/10.2307/2274669.

Full text
Abstract:
In this paper we discuss cylindric algebras with terms. The setting is two—sorted algebras—one sort for terms and one for Boolean elements. As with cylindric algebras, a cylindric algebra with terms has its roots in first order predicate logic [HMT1].Let Σ be a set of sentences in a first order language with terms, equality and variables u0,u1,u2, …, Define a relation ≡Σ on Fm, the set of formulas, by φ ≡Σθ if and only if Σ ⊢ φ ↔ θ, and on Tm, the set of terms, by τ ≡Σσ if and only if Σ ⊢ τ ≈ σ. The operations +, ·, cκ, 0, 1 are defined as usual on equivalence classes. Define , where is σ with τ substituted for all occurrences of uκ. That the operation *κ, for κ < α, is well defined follows from the first order axioms of equality. Let vκ = [uκ]. To establish the link between terms and Booleans, define operations oκ as follows: , where φ' is a variant of φ such that uκ is free for τ in φ′ and is φ′ with τ substituted for all free occurrences of uκ in φ′. From the first order axioms it follows that oκ, for κ < α, is well defined. Finally, instead of diagonal elements, we define a Boolean-valued operation on terms as follows: [τ] e [σ] = [τ ≈ σ].
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Ming, Xiao Yu Chen, Kai Tang, and Matthew M. F. Yuen. "Efficient Boolean Operation on Manifold Mesh Surfaces." Computer-Aided Design and Applications 7, no. 3 (2010): 405–15. http://dx.doi.org/10.3722/cadaps.2010.405-415.

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

Dissertations / Theses on the topic "Boolean operation"

1

Lai, Shuhua. "Subdivision Surface based One-Piece Representation." UKnowledge, 2006. http://uknowledge.uky.edu/gradschool_diss/330.

Full text
Abstract:
Subdivision surfaces are capable of modeling and representing complex shapes of arbi-trary topology. However, methods on how to build the control mesh of a complex surfaceare not studied much. Currently, most meshes of complicated objects come from trian-gulation and simplification of raster scanned data points, like the Stanford 3D ScanningRepository. This approach is costly and leads to very dense meshes.Subdivision surface based one-piece representation means to represent the final objectin a design process with only one subdivision surface, no matter how complicated theobject's topology or shape. Hence the number of parts in the final representation isalways one.In this dissertation we present necessary mathematical theories and geometric algo-rithms to support subdivision surface based one-piece representation. First, an explicitparametrization method is presented for exact evaluation of Catmull-Clark subdivisionsurfaces. Based on it, two approaches are proposed for constructing the one-piece rep-resentation of a given object with arbitrary topology. One approach is to construct theone-piece representation by using the interpolation technique. Interpolation is a naturalway to build models, but the fairness of the interpolating surface is a big concern inprevious methods. With similarity based interpolation technique, we can obtain bet-ter modeling results with less undesired artifacts and undulations. Another approachis through performing Boolean operations. Up to this point, accurate Boolean oper-ations over subdivision surfaces are not approached yet in the literature. We presenta robust and error controllable Boolean operation method which results in a one-piecerepresentation. Because one-piece representations resulting from the above two methodsare usually dense, error controllable simplification of one-piece representations is needed.Two methods are presented for this purpose: adaptive tessellation and multiresolutionanalysis. Both methods can significantly reduce the complexity of a one-piece represen-tation and while having accurate error estimation.A system that performs subdivision surface based one-piece representation was im-plemented and a lot of examples have been tested. All the examples show that our ap-proaches can obtain very good subdivision based one-piece representation results. Eventhough our methods are based on Catmull-Clark subdivision scheme, we believe they canbe adapted to other subdivision schemes as well with small modifications.
APA, Harvard, Vancouver, ISO, and other styles
2

Koshta, Prashant Kumar, and Shailendra Singh Thakur. "A Novel Authenticity of an Image Using Visual Cryptography." IJCSN, 2012. http://hdl.handle.net/10150/219514.

Full text
Abstract:
Information security in the present era is becoming very important in communication and data storage. Data transferred from one party to another over an insecure channel (e.g., Internet) can be protected by cryptography. The encrypting technologies of traditional and modern cryptography are usually used to avoid the message from being disclosed. Public-key cryptography usually uses complex mathematical computations to scramble the message.<br>A digital signature is an important public-key primitive that performs the function of conventional handwritten signatures for entity authentication, data integrity, and non-repudiation, especially within the electronic commerce environment. Currently, most conventional digital signature schemes are based on mathematical hard problems. These mathematical algorithms require computers to perform the heavy and complex computations to generate and verify the keys and signatures. In 1995, Naor and Shamir proposed a visual cryptography (VC) for binary images. VC has high security and requires simple computations. The purpose of this thesis is to provide an alternative to the current digital signature technology. We introduce a new digital signature scheme based on the concept of a non-expansion visual cryptography. A visual digital signature scheme is a method to enable visual verification of the authenticity of an image in an insecure environment without the need to perform any complex computations. We proposed scheme generates visual shares and manipulates them using the simple Boolean operations OR rather than generating and computing large and long random integer values as in the conventional digital signature schemes currently in use.
APA, Harvard, Vancouver, ISO, and other styles
3

Rota, Pascal. "Boolean operations on point set surfaces." Zü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
4

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

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
6

ARRUDA, MARCOS CHATAIGNIER DE. "BOOLEAN OPERATIONS WITH COMPOUND SOLIDS REPRESENTED BY BOUNDARY." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6688@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>TECNOLOGIA EM COMPUTAÇÃO GRÁFICA<br>Num modelador de sólidos, uma das ferramentas mais poderosas para a criação de objetos tridimensionais de qualquer nível de complexidade geométrica é a aplicação das operações booleanas. Elas são formas intuitivas e populares de combinar sólidos, baseadas nas operações aplicadas a conjuntos. Os tipos principais de operações booleanas comumente aplicadas a sólidos são: união, interseção e diferença. Havendo interesse prático, para garantir que os objetos resultantes possuam a mesma dimensão dos objetos originais, sem partes soltas ou pendentes, o processo de regularização é aplicado. Regularizar significa restringir o resultado de tal forma que apenas volumes preenchíveis possam existir. Na prática, a regularização é realizada classificando-se os elementos topológicos e eliminando-se estruturas de dimensão inferior. A proposta deste trabalho é o desenvolvimento de um algoritmo genérico que permita a aplicação do conjunto de operações booleanas em um ambiente de modelagem geométrica aplicada à análise por elementos finitos e que agregue as seguintes funcionalidades: trabalhar com um número indefinido de entidades topológicas (conceito de Grupo), trabalhar com objetos de dimensões diferentes, trabalhar com objetos non-manifold, trabalhar com objetos não necessariamente poliedrais ou planos e garantir a eficiência, robustez e aplicabilidade em qualquer ambiente de modelagem baseado em representação B-Rep. Neste contexto, apresenta-se a implementação do algoritmo num modelador geométrico pré- existente, denominado MG, seguindo o conceito de programação orientada a objetos e mantendo a interface com o usuário simples e eficiente.<br>In a solid modeler, one of the most powerful tools to create threedimensional objects with any level of geometric complexity is the application of the Boolean set operations. They are intuitive and popular ways to combine solids, based on the operations applied to sets. The main types of Boolean operations commonly applied to solids are: union, intersection and difference. If there is practical interest, in order to assure that the resulting objects have the same dimension of the original objects, without loose or dangling parts, the regularization process is applied. To regularize means to restrict the result in a way that only filling volumes are allowed. In practice, the regularization is performed classifying the topological elements and removing the lower dimensional structures. The objective of this work is the development of a generic algorithm that allows the application of the Boolean set operations in a geometric modeling environment applied to finite element analysis, which aggregates the following functionalities: working with an undefined number of topological entities (Group concept), working with objects of different dimensions, working with nonmanifold objects, working with objects not necessarily plane or polyhedrical and assuring the efficiency, robustness and applicability in any modeling environment based on B-Rep representation. In this context, the implementation of the algorithm in a pre-existing geometric modeler named MG is presented, using the concept of object oriented programming and keeping the user interface simple and efficient.
APA, Harvard, Vancouver, ISO, and other styles
7

Sheng, James Min. "Efficient geographic information systems : data structures, Boolean operations and concurrency control /." Online version of thesis, 1990. http://hdl.handle.net/1850/10594.

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

Stab, Olivier. "Maillage automatique tridimensionnel par operations booleennes." Paris, ENMP, 1992. http://www.theses.fr/1992ENMP0377.

Full text
Abstract:
Le domaine d'etude est l'algorithmique geometrique applique aux problemes du maillage automatique de geometries tridimensionnelles complexes. L'utilisation de la methode des elements finis pour simuler numeriquement le comportement de phenomenes physiques reste delicate ou fastidieuse a cause de l'etape du maillage qui pose de nombreux problemes en trois dimensions. Dans cette these on propose une nouvelle approche: le maillage par operations booleennes. Elle consiste a calculer un maillage comme une union, une difference ou une intersection entre deux domaines mailles. Deux methodes sont decrites: la premiere methode s'efforce de respecter les noeuds des maillages initiaux, la seconde d'en respecter les elements. La difficulte reside dans l'elaboration d'algorithmes efficaces et robustes. Cette nouvelle approche offre diverses applications: - l'amelioration de maillages par injection de maillages structures; - le maillage automatique d'un domaine decrit par un arbre c. S. G. ; - le maillage parametre necessaire a l'optimisation de forme
APA, Harvard, Vancouver, ISO, and other styles
9

Fratzeskou, Eugenia. "Visualising Boolean set operations : real and virtual boundaries in contemporary site-specific art." Thesis, University of Surrey, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.425040.

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

Gaffney, Christopher T. "The application of the inclusion-exclusion principle in learning monotone boolean functions." abstract and full text PDF (free order & download UNR users only), 2008. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1453632.

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

Books on the topic "Boolean operation"

1

Boole, George. Derivation of the laws of the symbols of logic from the laws of the operations of the human mind: An excerpt from the writings of George Boole. St. Sebastian Press, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vladimirov, D. A. Boolean Algebras in Analysis. Springer Netherlands, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hammer, P. L., S. Rudeanu, and R. Bellmann. Boolean Methods in Operations Research and Related Areas. Springer, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Operator Algebras Generated by Commuting Projections: A Vector Measure Approach (Lecture Notes in Mathematics). Springer, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Anderson, James A. Software. Oxford University Press, 2018. http://dx.doi.org/10.1093/acprof:oso/9780199357789.003.0004.

Full text
Abstract:
Digital computers are “protean” in that they can become almost anything through software. Their basic design elements came from a 19th-century British tradition in logic, exemplified by Boole and Babbage. It seemed natural to have logic realized in hardware. This tradition culminated in the work of Alan Turing who proposed a universal computing machine, now called a Turing machine, based on logic. Although hardware that computes logic functions lies at the core of digital hardware, low-level practical machine operations are grouped together in “words.” Programs are based on hardware operations controlling computation at the word level. This chapter presents a detailed example of what a computer does when it actually “computes.” Because human cognition finds it hard to use such an alien device, there is a brief discussion of how programming became “humanized” with the invention of software tools like assembly language and FORTRAN.
APA, Harvard, Vancouver, ISO, and other styles
6

Introduction to Digital Logic and Boolean Algebra: A Comprehensive Guide to Binary Operations, Logic Gates, Logical Expression Analysis and Number Representations in Digital Technology. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

(Editor), Holger H. Hoos, and David G. Mitchell (Editor), eds. Theory and Applications of Satisfiability Testing: 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers (Lecture Notes in Computer Science). Springer, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Boolean operation"

1

Weik, Martin H. "Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1768.

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

Weik, Martin H. "binary Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1519.

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

Weik, Martin H. "dyadic Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_5719.

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

Weik, Martin H. "Boolean add operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1763.

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

Weik, Martin H. "Boolean operation table." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1769.

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

Weik, Martin H. "Boolean set operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1771.

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

Weik, Martin H. "monadic Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_11772.

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

Weik, Martin H. "regularized Boolean set operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_15907.

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

Weik, Martin H. "n-ary Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_12079.

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

Weik, Martin H. "n-adic Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_12050.

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

Conference papers on the topic "Boolean operation"

1

Lee, Shinhyoung, Seehwan Yoo, Sangsun Byun, and Chuck Yoo. "BO-Multicast: Boolean Operation Multicast." In 2006 Asia-Pacific Conference on Communications. IEEE, 2006. http://dx.doi.org/10.1109/apcc.2006.255950.

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

Shibata, Hiroki, Hiroki Sato, Lieu-Hen Chen, and Yasufumi Takama. "Introduction of Boolean Operation into Context Search Engine." In 2020 International Symposium on Community-centric Systems (CcS). IEEE, 2020. http://dx.doi.org/10.1109/ccs49175.2020.9231408.

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

Verma, Monu, and Rajneesh Rani. "Strong threshold secret image sharing based on boolean operation." In 2016 International Conference on Computing, Communication and Automation (ICCCA). IEEE, 2016. http://dx.doi.org/10.1109/ccaa.2016.7813889.

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

Zhou, Liangchen, Dan Wang, Yehua Sheng, Yongjun Wang, and Pan Li. "Three dimensional Boolean operation based on L-Rep model." In 2010 18th International Conference on Geoinformatics. IEEE, 2010. http://dx.doi.org/10.1109/geoinformatics.2010.5567913.

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

Kapadiya, Vishakha J., Laxmi S. Desai, and Yogesh K. Meghrajani. "Visual Secret Sharing Technique for Meaningful Shares using Boolean Operation." In 2018 International Conference on Advanced Computation and Telecommunication (ICACAT). IEEE, 2018. http://dx.doi.org/10.1109/icacat.2018.8933540.

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

Pu Keming and Xu Yuanyuan. "Real-time Boolean operation for NC machining in virtual simulation." In 2010 International Conference on Computer Application and System Modeling (ICCASM 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccasm.2010.5622597.

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

Chen, Yong. "Robust and Accurate Boolean Operations on Polygonal Models." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-35731.

Full text
Abstract:
We present a new sampling-based method for the efficient and reliable calculation of boundary surface defined by a Boolean operation of given polygonal models. We first construct uniform volumetric cells with sampling points for each geometric element of polygonal models. We then calculate an error-minimizing point in each cell based on a quadratic error function (QEF). Based on a novel adaptive sampling condition, we construct adaptive octree cells such that a QEF point in each cell can capture the shape of all the geometric elements inside the cell. Finally we reconstruct a polygonal model from the volumetric grids and QEF points for approximating the boundary of a solid defined by the Boolean operation. Our method is robust since we can handle different types of topological inconsistency including non-manifold configurations. It is also accurate since we guarantee the boundary approximation has the same topology as the exact surface, and the maximum approximation error from the exact surface is bounded by a user specified tolerance. The efficient hierarchical scheme based on octree enables using sufficient grid resolutions on a commodity PC. We demonstrate our algorithm for a number of test cases and report experimental results.
APA, Harvard, Vancouver, ISO, and other styles
8

Huisheng Gao and Jingyu Zhan. "An improved algorithm of network reliability based on pathset and boolean operation." In Symposium on ICT and Energy Efficiency and Workshop on Information Theory and Security (CIICT 2012). Institution of Engineering and Technology, 2012. http://dx.doi.org/10.1049/cp.2012.1889.

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

He Chaoming, Liu Guangshuai, Xiong Ying, and Lei Huatang. "Arithmetic research about Boolean operation of surfel model based on hierarchical bounding volumes." In International Technology and Innovation Conference 2009 (ITIC 2009). IET, 2009. http://dx.doi.org/10.1049/cp.2009.1480.

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

Gao, Guoyou, Chunsheng Jiang, Tao Chen, and Chun Hui. "Analysis of several Boolean operation based trajectory generation strategies for automotive spray applications." In 6TH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN, MANUFACTURING, MODELING AND SIMULATION (CDMMS 2018). Author(s), 2018. http://dx.doi.org/10.1063/1.5039042.

Full text
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!

To the bibliography