Log in

Relevant bibliographies by topics / Boolean operation / Journal articles

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

Journal articles on the topic 'Boolean operation'

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 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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 subsemi

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

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

Sezgin, Aslihan, Murat Sarialioglu, and Emin Aygün. "A New Type of Extended Soft Set Operation: Complementary Extended Intersection Operation." Jurnal Matematika 14, no. 1 (2024): 75. http://dx.doi.org/10.24843/jmat.2024.v14.i01.p173.

Full text

Abstract:

Soft set theory is seen as an effective mathematical tool in solving problems involving uncertainty, and has been applied in many theoretical and practical areas since its introduction. The basic concept of the theory is soft set operations. In this context, in this paper, a new kind of soft set operations called complementary extended soft set operation is defined in order to contribute to the theory. The properties of the operation are examined in detail together with its distributions over other soft set operations in order to obtain the relationship between complementary extended intersect

APA, Harvard, Vancouver, ISO, and other styles

5

Zhou, Meijun, Jiayu Qin, Gang Mei, and John C. Tipper. "Simple and Robust Boolean Operations for Triangulated Surfaces." Mathematics 11, no. 12 (2023): 2713. http://dx.doi.org/10.3390/math11122713.

Full text

Abstract:

Boolean operations on geometric models are important in numerical simulation and serve as essential tools in the fields of computer-aided design and computer graphics. The accuracy of these operations is heavily influenced by finite precision arithmetic, a commonly employed technique in geometric calculations, which introduces numerical approximations. To ensure robustness in Boolean operations, numerical methods relying on rational numbers or geometric predicates have been developed. These methods circumvent the accumulation of rounding errors during computation, thus preserving accuracy. Non

APA, Harvard, Vancouver, ISO, and other styles

6

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

APA, Harvard, Vancouver, ISO, and other styles

7

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

APA, Harvard, Vancouver, ISO, and other styles

8

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

9

Lopes, Diogo Chambel, Helena Mendes, Ricardo Portal, Rui de Klerk, Isabel Nogueira, and Daniel Simões Lopes. "A Usability Study on Widget Design for Selecting Boolean Operations." Multimodal Technologies and Interaction 6, no. 8 (2022): 70. http://dx.doi.org/10.3390/mti6080070.

Full text

Abstract:

Applying the correct set of Boolean operations is a fundamental task in constructive solid geometry (CSG), which is a staple in automated manufacturing systems. Although textual buttons and icons are the most common interfaces to apply such operations, these require an unnecessary cognitive load that hampers the solid modeling process. This study presents VennPad, a novel CSG widget that gathers all Boolean operations under the same user interface control element and is represented as a two-set Venn diagram. Contrary to conventional CSG widgets, VennPad supports a graphical interface that give

APA, Harvard, Vancouver, ISO, and other styles

10

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 st

APA, Harvard, Vancouver, ISO, and other styles

11

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

APA, Harvard, Vancouver, ISO, and other styles

12

SEZGİN, Aslıhan, Ahmet Mücahit Demirci, and Emin Aygün. "New Type of Extended Soft Set Operation: Complementary Extended Union Operation." Suan Sunandha Science and Technology Journal 11, no. 2 (2024): 80–105. http://dx.doi.org/10.53848/ssstj.v11i2.837.

Full text

Abstract:

Soft set theory was proposed by Molodtsov in 1999 to model some problems involving uncertainty. It has a wide range of theoretical and practical applications. Soft set operations constitute the basic building blocks of soft set theory. Many kinds of soft set operations have been described and applied in various ways since the inception of the theory. In this paper, to contribute to the theory, a new soft set operation, called complementary extended union operation, is defined, its properties are discussed in detail to obtain the relationship of each operation with other soft set operations, an

APA, Harvard, Vancouver, ISO, and other styles

13

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 ope

APA, Harvard, Vancouver, ISO, and other styles

14

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

15

Li, Bai Chun, Xue Wei Zhang, Lei Geng, Tian Biao Yu, and Wan Shan Wang. "Boolean Operations for the Simulation of Machining Processes Based on the CSG Modeling Technique." Advanced Materials Research 538-541 (June 2012): 951–54. http://dx.doi.org/10.4028/www.scientific.net/amr.538-541.951.

Full text

Abstract:

The simulation of computer numerically control (CNC) machining process is an important component of CAM, it can check errors and enhance the automation of machining process. In order to realize the material removal simulation of machining process through VC++ and OpenGL, this paper does the research on the Boolean operations based on the Constructive Solid Geometry (CSG) modeling technique. Firstly, this paper introduces the CSG technique, especially the creating complex object from simple primitives by the operations of Boolean algebra and the frame buffer. Then this paper achieves the solid

APA, Harvard, Vancouver, ISO, and other styles

16

Stankovic, Milena, Claudio Moraga, and Radomir Stankovic. "An improved spectral classification of Boolean functions based on an extended set of invariant operations." Facta universitatis - series: Electronics and Energetics 31, no. 2 (2018): 189–205. http://dx.doi.org/10.2298/fuee1802189s.

Full text

Abstract:

Boolean functions expressing some particular properties often appear in engineering practice. Therefore, a lot of research efforts are put into exploring different approaches towards classification of Boolean functions with respect to various criteria that are typically selected to serve some specific needs of the intended applications. A classification is considered to be strong if there is a reasonably small number of different classes for a given number of variables n and it it desir able that classification rules are simple. A classification with respect to Walsh spectral coefficients, int

APA, Harvard, Vancouver, ISO, and other styles

17

Dougherty, Randall. "Sequential discreteness and clopen-I-Boolean classes." Journal of Symbolic Logic 52, no. 1 (1987): 232–42. http://dx.doi.org/10.2307/2273880.

Full text

Abstract:

Kantorovich and Livenson [6] initiated the study of infinitary Boolean operations applied to the subsets of the Baire space and related spaces. It turns out that a number of interesting collections of subsets of the Baire space, such as the collection of Borel sets of a given type (e.g. the Fσ sets) or the collection of analytic sets, can be expressed as the range of an ω-ary Boolean operation applied to all possible ω-sequences of clopen sets. (Such collections are called clopen-ω-Boolean.) More recently, the ranges of I-ary Boolean operations for uncountable I have been considered; specific

APA, Harvard, Vancouver, ISO, and other styles

18

Ghomi-Avili, Ali, Moslem Akbarinia, Seyed Mohsen Hosseini, Mohammad-Hasan Talebian, and Hannes Dieter Knapp. "Fuzzy and Boolean operation based modelling for evaluation of ecological capability in the Hyrcanian Forests." Journal of Forest Science 66, No. 4 (2020): 170–84. http://dx.doi.org/10.17221/130/2019-jfs.

Full text

Abstract:

Over the past four decades, management plan based on the Boolean Ecological Capability model has caused major problems in the management of the Hyrcanian Forests. The aim of this study is to evaluate ecological capability of five proposed sites including Golestan National Park, Afra Takhteh Yew Forest, Kojoor Forest, Cypress Woodland of Hassanabad-e Chalous, Lomer forest along the Hyrcanian region from east to west, using both Boolean and fuzzy logic and to compare these two models. A total of 10 important factors including slope, aspect, elevation, soil types, soil erosion, soil transformatio

APA, Harvard, Vancouver, ISO, and other styles

19

Sun, W., and X. Hu. "Reasoning Boolean operation based modeling for heterogeneous objects." Computer-Aided Design 34, no. 6 (2002): 481–88. http://dx.doi.org/10.1016/s0010-4485(01)00131-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

El Mouatasim, Abdelkrim. "Boolean Integer Nonlinear Programming for Water Multireservoir Operation." Journal of Water Resources Planning and Management 138, no. 2 (2012): 176–81. http://dx.doi.org/10.1061/(asce)wr.1943-5452.0000160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Qin, Yaguang, Zhouquan Luo, Lei Wen, et al. "Research and application of Boolean operation for triangular mesh model of underground space engineering—Boolean operation for triangular mesh model." Energy Science & Engineering 7, no. 4 (2019): 1154–65. http://dx.doi.org/10.1002/ese3.335.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Li, Hong Yan, and Fei Gao. "Research on Optimization Algorithm of Reconfigurable Logical Operation Resource Configuration." Advanced Materials Research 756-759 (September 2013): 1968–72. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.1968.

Full text

Abstract:

In reconfigurable systems, how to take full advantage of the limited reusable resource through configuration information to achieve better system function is difficult. In this article, an optimization algorithm of resource allocation for reconfigurable Boolean function logic computation resource based on cupidity arithmetic ideas is proposed, which is used in reconfigurable design for stream cipher algorithm. The algorithm selects a series of configurations from several different configurations of Boolean functions in order to get the best result overall in achieving optimal utilization of re

APA, Harvard, Vancouver, ISO, and other styles

23

Solomko, Mykhailo, Petro Tadeyev, Liudmyla Zubyk, Stepaniia Babych, Yuliia Mala, and Oksana Voitovych. "Implementation of the method of figurative transformations to minimizing symmetric Boolean functions." Eastern-European Journal of Enterprise Technologies 4, no. 4(112) (2021): 23–39. http://dx.doi.org/10.15587/1729-4061.2021.239149.

Full text

Abstract:

This paper reports a study that has established the possibility of improving the effectiveness of the method of figurative transformations in order to minimize symmetrical Boolean functions in the main and polynomial bases. Prospective reserves in the analytical method were identified, such as simplification of polynomial function conjuncterms using the created equivalent transformations based on the method of inserting the same conjuncterms followed by the operation of super-gluing the variables. The method of figurative transformations was extended to the process of minimizing the symmetrica

APA, Harvard, Vancouver, ISO, and other styles

24

Mykhailo, Solomko, Tadeyev Petro, Zubyk Liudmyla, Babych Stepaniia, Mala Yuliia, and Voitovych Oksana. "Implementation of the method of figurative transformations to minimizing symmetric Boolean functions." Eastern-European Journal of Enterprise Technologies 4, no. 4 (112) (2021): 23–39. https://doi.org/10.15587/1729-4061.2021.239149.

Full text

Abstract:

This paper reports a study that has established the possibility of improving the effectiveness of the method of figurative transformations in order to minimize symmetrical Boolean functions in the main and polynomial bases. Prospective reserves in the analytical method were identified, such as simplification of polynomial function conjuncterms using the created equivalent transformations based on the method of inserting the same conjuncterms followed by the operation of super-gluing the variables. The method of figurative transformations was extended to the process of minimizing the symmetrica

APA, Harvard, Vancouver, ISO, and other styles

25

Solomko, Mykhailo. "Developing an algorithm to minimize boolean functions for the visual-matrix form of the analytical method." Eastern-European Journal of Enterprise Technologies 1, no. 4 (109) (2021): 6–21. http://dx.doi.org/10.15587/1729-4061.2021.225325.

Full text

Abstract:

This research has established the possibility of improving the effectiveness of the visual-matrix form of the analytical Boolean function minimization method by identifying reserves in a more complex algorithm for the operations of logical absorption and super-gluing the variables in terms of logical functions. An improvement in the efficiency of the Boolean function minimization procedure was also established, due to selecting, according to the predefined criteria, the optimal stack of logical operations for the first and second binary matrices of Boolean functions. When combining a sequence

APA, Harvard, Vancouver, ISO, and other styles

26

Mykhailo, Solomko. "Developing an algorithm to minimize boolean functions for the visual-matrix form of the analytical method." Eastern-European Journal of Enterprise Technologies 1, no. 4(109) (2021): 6–21. https://doi.org/10.15587/1729-4061.2021.225325.

Full text

Abstract:

This research has established the possibility of improving the effectiveness of the visual-matrix form of the analytical Boolean function minimization method by identifying reserves in a more complex algorithm for the operations of logical absorption and super-gluing the variables in terms of logical functions. An improvement in the efficiency of the Boolean function minimization procedure was also established, due to selecting, according to the predefined criteria, the optimal stack of logical operations for the first and second binary matrices of Boolean functions. When combining a sequence

APA, Harvard, Vancouver, ISO, and other styles

27

Sidorova, E. A., A. V. Dolgova, and S. P. Zheleznyak. "Automated System of Competencies Indicators’ Formation Control during the Basic Boolean Algebra Studying." Vestnik NSU. Series: Information Technologies 20, no. 3 (2023): 51–64. http://dx.doi.org/10.25205/1818-7900-2022-20-3-51-64.

Full text

Abstract:

The eﬀective study of Computer Science is impossible without the widespread use of information technology. Boolean algebra is one of the most fundamental sections of computer science. There is a list of disadvantages of this testing method for the evaluation of the master’s degree students’ knowledge of this topic. This results in development of other interactive tools. This article is devoted to the development and operation features of the automated system “Boolean algebra”, which was designed to control the formation of the competencies’ achievement indicators obtained during studying Boole

APA, Harvard, Vancouver, ISO, and other styles

28

OZAWA, MASANAO. "ORTHOMODULAR-VALUED MODELS FOR QUANTUM SET THEORY." Review of Symbolic Logic 10, no. 4 (2017): 782–807. http://dx.doi.org/10.1017/s1755020317000120.

Full text

Abstract:

AbstractIn 1981, Takeuti introduced quantum set theory by constructing a model of set theory based on quantum logic represented by the lattice of closed linear subspaces of a Hilbert space in a manner analogous to Boolean-valued models of set theory, and showed that appropriate counterparts of the axioms of Zermelo–Fraenkel set theory with the axiom of choice (ZFC) hold in the model. In this paper, we aim at unifying Takeuti’s model with Boolean-valued models by constructing models based on general complete orthomodular lattices, and generalizing the transfer principle in Boolean-valued models

APA, Harvard, Vancouver, ISO, and other styles

29

Behrisch, Mike, and Edith Vargas-García. "Centralising Monoids with Low-Arity Witnesses on a Four-Element Set." Symmetry 13, no. 8 (2021): 1471. http://dx.doi.org/10.3390/sym13081471.

Full text

Abstract:

As part of a project to identify all maximal centralising monoids on a four-element set, we determine all centralising monoids witnessed by unary or by idempotent binary operations on a four-element set. Moreover, we show that every centralising monoid on a set with at least four elements witnessed by the Mal’cev operation of a Boolean group operation is always a maximal centralising monoid, i.e., a co-atom below the full transformation monoid. On the other hand, we also prove that centralising monoids witnessed by certain types of permutations or retractive operations can never be maximal.

APA, Harvard, Vancouver, ISO, and other styles

30

Chajda, Ivan, Helmut Länger, and Ranganathan Padmanabhan. "Single identities forcing lattices to be Boolean." Mathematica Slovaca 68, no. 4 (2018): 713–16. http://dx.doi.org/10.1515/ms-2017-0138.

Full text

Abstract:

Abstract In this note we characterize Boolean algebras among lattices of type (2, 2, 1) with join, meet and an additional unary operation by means of single two-variable respectively three-variable identities. In particular, any uniquely complemented lattice satisfying any one of these equational constraints is distributive and hence a Boolean algebra.

APA, Harvard, Vancouver, ISO, and other styles

31

Fatelo, Jorge P., and Nelson Martins-Ferreira. "Reconstructing Classical Algebras via Ternary Operations." Mathematics 13, no. 9 (2025): 1407. https://doi.org/10.3390/math13091407.

Full text

Abstract:

Although algebraic structures are frequently analyzed using unary and binary operations, they can also be effectively defined and unified using ternary operations. In this context, we introduce structures that contain two constants and a ternary operation. We demonstrate that these structures are isomorphic to various significant algebraic systems, including Boolean algebras, de Morgan algebras, MV-algebras, and (near-)rings of characteristic two. Our work highlights the versatility of ternary operations in describing and connecting diverse algebraic structures.

APA, Harvard, Vancouver, ISO, and other styles

32

FUJIWARA, AKIHIRO, KEN'ICHI MATSUMOTO, and WEI CHEN. "PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES." International Journal of Foundations of Computer Science 15, no. 03 (2004): 461–74. http://dx.doi.org/10.1142/s0129054104002546.

Full text

Abstract:

In this paper, we consider procedures for logic and arithmetic operations with DNA molecules. We first show a DNA representation of n binary numbers of m bits, and propose a procedure to assign the same values for the representation. The representation enables addressing feature, and the procedure is applicable to n binary numbers of m bits in O(1) steps in parallel. Next, we propose a procedure for logic operations. The procedure enables any boolean operation whose input and output are defined by a truth table, and executes different kinds of boolean operations simultaneously for any pair of

APA, Harvard, Vancouver, ISO, and other styles

33

Shanley, Matthew. "Stable Ships for Smooth Servicing of Offshore Wind Farms." Boolean: Snapshots of Doctoral Research at University College Cork, no. 2014 (January 1, 2014): 179–83. http://dx.doi.org/10.33178/boolean.2014.36.

Full text

Abstract:

There is a rapid increase in the number of offshore wind farms in European waters to help meet renewable energy targets. Wind turbines are being installed in progressively more exposed areas of the North Sea and the Irish Sea, with the eventual aim of placing them in the Atlantic Ocean. As offshore wind farms require regular maintenance, being able to access the wind turbines during rough sea conditions is a key issue for profitable operation. The operation involves transferring personnel from the service ship to the wind turbine. The current wave height limit for this is 1.5 m, slightly less

APA, Harvard, Vancouver, ISO, and other styles

34

Demey, Lorenz, and Atahan Erbas. "Boolean Subtypes of the U4 Hexagon of Opposition." Axioms 13, no. 2 (2024): 76. http://dx.doi.org/10.3390/axioms13020076.

Full text

Abstract:

This paper investigates the so-called ‘unconnectedness-4 (U4) hexagons of opposition’, which have various applications across the broad field of philosophical logic. We first study the oldest known U4 hexagon, the conversion closure of the square of opposition for categorical statements. In particular, we show that this U4 hexagon has a Boolean complexity of 5, and discuss its connection with the so-called ‘Gergonne relations’. Next, we study a simple U4 hexagon of Boolean complexity 4, in the context of propositional logic. We then return to the categorical square and show that another (quite

APA, Harvard, Vancouver, ISO, and other styles

35

Malik, Raghav, Vedant Paranjape, and Milind Kulkarni. "Circuit Optimization using Arithmetic Table Lookups." Proceedings of the ACM on Programming Languages 9, PLDI (2025): 301–23. https://doi.org/10.1145/3729258.

Full text

Abstract:

Fully Homomorphic Encryption (FHE) is a cryptographic technique that enables privacy-preserving computation. State-of-the-art Boolean FHE implementations provide a very low-level interface, usually exposing a limited set of Boolean gates that programmers must use to write their FHE applications. This programming model is unnecessarily restrictive: many Boolean FHE schemes support programmable bootstrapping , an operation that allows evaluation of an arbitrary fixed-size lookup table. However, most modern FHE compilers are only capable of reasoning about traditional Boolean circuits, and theref

APA, Harvard, Vancouver, ISO, and other styles

36

Nag, Amitava, Sushanta Biswas, Debasree Sarkar, and Partha Pratim Sarka. "Secret Image Sharing Scheme Based on a Boolean Operation." Cybernetics and Information Technologies 14, no. 2 (2014): 98–113. http://dx.doi.org/10.2478/cait-2014-0023.

Full text

Abstract:

Abstract Traditionally extensive researches have been done on secret image sharing which support the fault tolerance property. But their reconstruction complexity is high. Some research papers on secret image sharing are also available with smaller reconstruction complexity, due to the use of a Boolean operation. But these research works lack the fault tolerance property which is the heart of secret sharing. This paper deals with a general (k, n) secret image sharing scheme for gray scale images with both low reconstruction complexity and preservation of the fault tolerance property. Moreover,

APA, Harvard, Vancouver, ISO, and other styles

37

CHEN, Xue-gong, Jin-jin MA, Hua QIU, Jin-hua FU, and Ke-yan XIAO. "Steady algorithm for Boolean operation of 3D mesh model." Journal of Computer Applications 31, no. 5 (2011): 1198–201. http://dx.doi.org/10.3724/sp.j.1087.2011.01198.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

CHEN, Xue-gong, Lan YANG, Wei HUANG, and Xing JI. "Method of Boolean operation based on 3D grid model." Journal of Computer Applications 31, no. 6 (2012): 1543–45. http://dx.doi.org/10.3724/sp.j.1087.2011.01543.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Verma, Monu, and Rajneesh Rani. "Significant Secret Image Sharing Scheme Based on Boolean Operation." Cybernetics and Information Technologies 17, no. 2 (2017): 134–50. http://dx.doi.org/10.1515/cait-2017-0022.

Full text

Abstract:

Abstract Traditionally, (k, n) secret image sharing is an approach of breaking down a secret image into n number of shadow images to assign them to n number of users, so that any k or more then k users can bring back the secret image. But in case of less than k, users cannot reveal any partial information about the original image. We have proposed a significant secret image sharing technique based on XOR with arithmetic operations that upgrade the performance of traditional secret image sharing approaches by serving importance to shadow images according to user’s significance. This scheme also

APA, Harvard, Vancouver, ISO, and other styles

40

Väliaho, H. "The Boolean pivot operation M-matrices, and reducible matrices." Linear Algebra and its Applications 185 (May 1993): 143–63. http://dx.doi.org/10.1016/0024-3795(93)90210-f.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Oner, Tahsin, and Ibrahim Senturk. "The Sheffer stroke operation reducts of basic algebras." Open Mathematics 15, no. 1 (2017): 926–35. http://dx.doi.org/10.1515/math-2017-0075.

Full text

Abstract:

Abstract In this study, a term operation Sheffer stroke is presented in a given basic algebra 𝒜 and the properties of the Sheffer stroke reduct of 𝒜 are examined. In addition, we qualify such Sheffer stroke basic algebras. Finally, we construct a bridge between Sheffer stroke basic algebras and Boolean algebras.

APA, Harvard, Vancouver, ISO, and other styles

42

Hwang, Myeong-Eun, та Sungoh Kwon. "A 0.94 μW 611 KHz In-Situ Logic Operation in Embedded DRAM Memory Arrays in 90 nm CMOS". Electronics 8, № 8 (2019): 865. http://dx.doi.org/10.3390/electronics8080865.

Full text

Abstract:

Conventional computers based on the Von Neumann architecture conduct computation with repeated data movements between their separate processing and memory units, where each movement takes time and energy. Unlike this approach, we experimentally study memory that can perform computation as well as store data within a generic memory array in a non-Von Neumann architecture way. Memory array can innately perform NOR operation that is functionally complete and thus realize any Boolean functions like inversion (NOT), disjunction (OR) and conjunction (AND) operations. With theoretical exploration of

APA, Harvard, Vancouver, ISO, and other styles

43

SÁNCHEZ TERRAF, PEDRO. "BOOLEAN FACTOR CONGRUENCES AND PROPERTY (*)." International Journal of Algebra and Computation 21, no. 06 (2011): 931–50. http://dx.doi.org/10.1142/s021819671100656x.

Full text

Abstract:

A variety [Formula: see text] has Boolean factor congruences (BFC) if the set of factor congruences of any algebra in [Formula: see text] is a distributive sublattice of its congruence lattice; this property holds in rings with unit and in every variety which has a semilattice operation. BFC has a prominent role in the study of uniqueness of direct product representations of algebras, since it is a strengthening of the refinement property. We provide an explicit Mal'cev condition for BFC. With the aid of this condition, it is shown that BFC is equivalent to a variant of the definability proper

APA, Harvard, Vancouver, ISO, and other styles

44

Chajda, Ivan, and Helmut Länger. "Left residuated lattices induced by lattices with a unary operation." Soft Computing 24, no. 2 (2019): 723–29. http://dx.doi.org/10.1007/s00500-019-04461-x.

Full text

Abstract:

Abstract In a previous paper, the authors defined two binary term operations in orthomodular lattices such that an orthomodular lattice can be organized by means of them into a left residuated lattice. It is a natural question if these operations serve in this way also for more general lattices than the orthomodular ones. In our present paper, we involve two conditions formulated as simple identities in two variables under which this is really the case. Hence, we obtain a variety of lattices with a unary operation which contains exactly those lattices with a unary operation which can be conver

APA, Harvard, Vancouver, ISO, and other styles

45

Canjar, R. Michael. "Complete Boolean ultraproducts." Journal of Symbolic Logic 52, no. 2 (1987): 530–42. http://dx.doi.org/10.2307/2274400.

Full text

Abstract:

Throughout this paper, B will always be a Boolean algebra and Γ an ultrafilter on B. We use + and Σ for the Boolean join operation and · and Π for the Boolean meet.κ is always a regular cardinal. C(κ) is the full structure of κ, the structure with universe κ and whose functions and relations consist of all unitary functions and relations on κ. κB is the collection of all B-valued names for elements of κ. We use symbols f, g, h for members of κB. Formally an element f ∈ κB is a mapping κ → B with the properties that Σα∈κf(α) = 1B and that f(α) · f(β) = 0B whenever α ≠ β. We view f(α) as the Boo

APA, Harvard, Vancouver, ISO, and other styles

46

Wei, Ran, Futing Bao, Yang Liu, and Weihua Hui. "Combined Acceleration Methods for Solid Rocket Motor Grain Burnback Simulation Based on the Level Set Method." International Journal of Aerospace Engineering 2018 (2018): 1–12. http://dx.doi.org/10.1155/2018/4827810.

Full text

Abstract:

A detailed study of a set of combined acceleration methods is presented with the objective of accelerating the solid rocket motor grain burnback simulation based on the level set method. Relevant methods were improved by making use of unique characteristics of the grains, and graphical processing unit (GPU) parallelization is utilized to perform the computationally intensive operations. The presented flow traced the expansion of burning surfaces, and then Boolean operations were applied on the resulting surfaces to extract various geometric metrics. The initial signed distance field was built

APA, Harvard, Vancouver, ISO, and other styles

47

Chen, Shouxin, Ming Chen, and Shenglian Lu. "A Real Time Visual Boolean Operation on Triangular Mesh Models." Computer-Aided Design and Applications 19, no. 3 (2021): 470–80. http://dx.doi.org/10.14733/cadaps.2022.470-480.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Hung, Jui-Pin, and Yuan-Lung Lai. "Boolean-based operation on overlapping CL paths for 3D models." International Journal of Production Research 50, no. 2 (2012): 379–92. http://dx.doi.org/10.1080/00207543.2010.537705.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Park, Ji Suk, and Jung-Min Yang. "Static Control of Boolean Networks Using Semi-Tensor Product Operation." Transactions of The Korean Institute of Electrical Engineers 66, no. 1 (2017): 137–43. http://dx.doi.org/10.5370/kiee.2017.66.1.137.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Deshmukh, Maroti, Neeta Nain, and Mushtaq Ahmed. "Secret sharing scheme based on binary trees and Boolean operation." Knowledge and Information Systems 60, no. 3 (2018): 1377–96. http://dx.doi.org/10.1007/s10115-018-1268-9.

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!