Results 11 to 20 of about 13,872 (307)
On the distributivity of the lattice of radical submodules [PDF]
Journal of Mahani Mathematical Research, 2023 Let $R$ be a commutative ring with identity and $\mathcal{R}(_{R}M)$ denotes the bounded lattice of radical submodules of an $R$-module $M$. We say that $M$ is a radical distributive module, if $\mathcal{R}(_{R}M)$ is a distributive lattice.
Hossein Fazaeli Moghimi +1 more
doaj +1 more source
Algorithm of minimum test case set generation using matrix recursion
Dianzi Jishu Yingyong, 2020 The algorithm of minimum test case set conforming to MC/DC criterion has important practical value.Firstly,the Boolean expression is transformed into a syntax binary tree,and then the matrix combinational logic operation is used to recurse layer by layer
Huang Xiaolun, Wang Dong
doaj +1 more source
Arbitrary Polygons Boolean Operation Based on GPU Rasterization [PDF]
Jisuanji gongcheng, 2018 The Boolean operation of arbitrary polygons is mostly based on the CPU grid method,because of the serialization of CPU,the raster process takes a long time.In order to solve the above problem,an algorithm for polygon Boolean operations based on the ...
GAO Yi,LUO Jianxin,QIU Hangping,WU Bo
doaj +1 more source
Simple and Robust Boolean Operations for Triangulated Surfaces
Mathematics, 2023 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,
Meijun Zhou +3 more
doaj +1 more source
A Usability Study on Widget Design for Selecting Boolean Operations
Multimodal Technologies and Interaction, 2022 Applying the correct set of Boolean operations is a fundamental task in constructive solid geometry (CSG), which is a staple in automated manufacturing systems.
Diogo Chambel Lopes +5 more
doaj +1 more source
Discernibility Matrix and Its Application in Logical Optimization
Jisuanji kexue yu tansuo, 2021 The simplification of truth table is of great significance to the analysis and design of logic circuits. In this paper, the simplification of truth table is studied, and a method of GDM (granular discernibility matrix) that uses discernibility matrix is ...
YAN Xinyi, WEN Xin, CHEN Zehua
doaj +1 more source
Rough operations on Boolean algebras [PDF]
Information Sciences, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guilin Qi, Weiru Liu
openaire +1 more source
ACM Transactions on Graphics, 2022 We port Boolean set operations between 2D shapes to surfaces of any genus, with any number of open boundaries. We combine shapes bounded by sets of freely intersecting loops, consisting of geodesic lines and cubic Bézier splines lying on a surface. We compute the arrangement of shapes directly on the surface and assign integer labels to the cells of ...
Riso M. +5 more
openaire +1 more source
Significant Secret Image Sharing Scheme Based on Boolean Operation
Cybernetics and Information Technologies, 2017 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.
Verma Monu, Rani Rajneesh
doaj +1 more source
A heuristic method for bi-decomposition of partial Boolean functions
Informatika, 2020 The problem of decomposition of a Boolean function is to represent a given Boolean function in the form of a superposition of some Boolean functions whose number of arguments are less than the number of given function.
Yu. V. Pottosin
doaj +1 more source