Results 101 to 110 of about 11,224 (163)

Development of Micro-CT-Based Anatomically Accurate Tooth Model for Finite Element Analysis of Composite Restorations. [PDF]

Dent J (Basel)
Tarjányi T, Szabó B, Vásárhelyi L, Nagy T, Farkas F, Nagy A.   +5 more
europepmc   +1 more source

Myelin-Proteinoids Interactions in Neural Signaling. [PDF]

Langmuir
Mougkogiannis P, Adamatzky A.
europepmc   +1 more source

BioLogical: a universal analysis framework for biosystem logical dynamics. [PDF]

Comput Struct Biotechnol J
Yao Y, Liu D, Zhang Z, Zhao C, Pei D.
europepmc   +1 more source

Protocell Computing on Aragonite Substrates. [PDF]

ACS Omega
Mougkogiannis P, Adamatzky A.
europepmc   +1 more source

Enabling global-scale nucleic acid repositories through versatile, scalable biochemical selection from room-temperature archives. [PDF]

Nat Commun
Berleant JD, Banal JL, Rao DK, Bathe M.
europepmc   +1 more source

Availability of drone mission with binary decision diagram based on uncertain data. [PDF]

Sci Rep
Zaitseva E, Rabcan J, Levashenko V, Mukhamediev RI, Brinzei N.   +4 more
europepmc   +1 more source

NFBC: an efficient FPGA based NFSR-oriented lightweight block cipher suitable for embedded system. [PDF]

Sci Rep
Chatterjee R, Chakraborty R.
europepmc   +1 more source

Rough operations on Boolean algebras [PDF]

Information Sciences, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weiru Liu, Guilin Qi
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Boolean Operations on Conic Polygons

Journal of Computer Science and Technology, 2009
An algorithm for Boolean operations on conic polygons is proposed. Conic polygons are polygons consisting of conic segments or bounded conics with directions. Preliminaries of Boolean operations on general polygons are presented. In our algorithm, the intersection points and the topological relationships between two conic polygons are computed ...
Yong-Xi Gong, Yu Liu 0003, Lun Wu, Yu-Bo Xie   +3 more
openaire   +1 more source

Complexity of Linear Boolean Operators

Foundations and Trends® in Theoretical Computer Science, 2013
How to compute a linear Boolean operator by a small circuit using only unbounded fanin addition gates? Because this question is about one of the simplest and most basic circuit models, it has been considered by many authors since the early 1950s. This has led to a variety of upper and lower bound arguments—ranging from algebraic (determinant and matrix
Stasys Jukna, Igor Sergeev
openaire   +1 more source