Zobrazeno 1 - 10
of 273
pro vyhledávání: '"Boolean operations in computer-aided design"'
Autor:
Kim-Kwang Raymond Choo, Jianfeng Ma, Ximeng Liu, Yinbin Miao, Feng Li, Liu Zhiquan, Robert H. Deng
Publikováno v:
IEEE Transactions on Cloud Computing. 11:839-853
Symmetric Searchable Encryption (SSE) schemes facilitate searching over encrypted data, and have been extensively explored to improve function, efficiency or security. There are, however, additional functions that we need to consider in a real-world
Autor:
David Lopez Cornelio
Publikováno v:
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Vol XLIII-B3-2021, Pp 837-842 (2021)
Shifting cultivation is a common agricultural practice in the Pacific Islands rarely sustainable today since fallow periods are ever shorter due to the demographic growth, farms fragmentation, uncertain land tenure, and pressures from the market econ
Publikováno v:
IEEE Transactions on Instrumentation and Measurement. 70:1-11
This article presents a supershape augmented shape reconstruction algorithm for electrical impedance tomography, aiming at high-quality reconstructions with respect to multiphase conductivity distributions. Within the proposed algorithm, the reconstr
Publikováno v:
ChemistrySelect. 5:13135-13143
Autor:
Mark A. Cappelli, Shanhui Fan, Jesse A. Rodriguez, Beicheng Lou, Ahmed I. Abdalla, Benjamin Wang
Publikováno v:
Physical Review Applied. 16
We apply inverse design methods to produce two-dimensional plasma metamaterial (PMM) devices. Backpropagated finite difference frequency domain (FDFD) simulations are used to design waveguides and demultiplexers operating under both transverse electr
Publikováno v:
Theoretical Computer Science. 800:15-30
We exhaustively investigate possible combinations of a Boolean operation together with a catenation. In many cases we prove and improve some conjectures by Brzozowski. For each family of operations, we endeavour to provide a common witness with a sma
Autor:
Benjamin Marussig, Elaine Cohen, Thomas J. R. Hughes, Benjamin Y. Urick, Richard H. Crawford, Richard F. Riesenfeld
Publikováno v:
Computer-Aided Design. 115:147-160
Boolean operations are fundamental for geometric modeling, but the resulting objects, defined by trimmed surfaces, are often difficult to edit directly, possess robustness issues, and lead to problems of watertightness for downstream users. We propos
Autor:
Marek Szykuła, Robert Ferens
Publikováno v:
Theoretical Computer Science. 787:14-27
We study descriptive complexity properties of the class of regular bifix-free languages, which is the intersection of prefix-free and suffix-free regular languages. We show that there exist universal bifix-free languages that meet all the bounds for
Autor:
Saeideh Kabirirad, Ziba Eslami
Publikováno v:
Journal of Information Security and Applications. 47:16-27
In a (n, n)-secret image sharing scheme, a secret image is distributed among n parties in such a way that cooperation of all the shares is needed for reconstruction of the original secret image. Moreover, in these schemes, we have the security requir
Publikováno v:
The VLDB Journal. 28:549-574
How can we analyze tensors that are composed of 0’s and 1’s? How can we efficiently analyze such Boolean tensors with millions or even billions of entries? Boolean tensors often represent relationship, membership, or occurrences of events such as