Results 121 to 130 of about 17,450 (322)
Commuting quantum circuits and complexity of Ising partition functions
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal.
Keisuke Fujii, Tomoyuki Morimae
doaj +1 more source
A Dislocation Perspective on Strength and Toughness in Ceramics
Dislocations in ceramics enjoy a long but yet under‐appreciated history. The three research waves for dislocations in ceramics highlight the topic evolution over the last 90 years. This review focuses on the impact of dislocation on strength and toughness in ceramics.
Xufei Fang
wiley +1 more source
This work shows that the mechanical performance of multimaterial digital light processing (DLP) printed thermoset composites is governed by resin compatibility and interfacial design rather than spatial patterning alone. Brittle and ductile resin combinations produced premature interfacial failure, while graded interfaces and mechanically compatible ...
Ahmed M. H. Ibrahim +3 more
wiley +1 more source
Determining the Multiplicative Complexity of Boolean Functions using SAT [PDF]
We present a constructive SAT-based algorithm to determine the multiplicative complexity of a Boolean function, i.e., the smallest number of AND gates in any logic network that consists of 2-input AND gates, 2-input XOR gates, and inverters.
Mathias Soeken
core
Automated and precise segmentation of breast lesions can facilitate early diagnosis of breast cancer. Recent research studies employ deep learning for automatic segmentation of breast lesions using ultrasound imaging.
Manali Saini +4 more
doaj +1 more source
An all‐in‐one analog AI accelerator is presented, enabling on‐chip training, weight retention, and long‐term inference acceleration. It leverages a BEOL‐integrated CMO/HfOx ReRAM array with low‐voltage operation (<1.5 V), multi‐bit capability over 32 states, low programming noise (10 nS), and near‐ideal weight transfer.
Donato Francesco Falcone +11 more
wiley +1 more source
Boolean Functions with Multiplicative Complexity 3 and 4 [PDF]
Multiplicative complexity (MC) is defined as the minimum number of AND gates required to implement a function with a circuit over the basis (AND, XOR, NOT). Boolean functions with MC 1 and 2 have been characterized in Fischer and Peralta ( 2002) and Find
Meltem Sonmez Turan +2 more
core
Shellac, a centuries‐old natural resin, is reimagined as a green material for flexible electronics. When combined with silver nanowires, shellac films deliver transparency, conductivity, and stability against humidity. These results position shellac as a sustainable alternative to synthetic polymers for transparent conductors in next‐generation ...
Rahaf Nafez Hussein +4 more
wiley +1 more source
Counterion Dependent Side‐Chain Relaxation Stiffens a Chemically Doped Thienothiophene Copolymer
Oxidation of a thienothiophene copolymer, p(g3TT‐T2), via different doping strategies and dopant molecules resulted in materials with similar oxidation levels and a high electrical conductivity of ≈100 S cm−1. However, mechanical properties varied significantly, with sub‐glass transition temperatures and elastic moduli spanning from –44°C to –3°C and ...
Mariavittoria Craighero +12 more
wiley +1 more source
Expediting Homomorphic Computation via Multiplicative Complexity-aware Multiplicative Depth Minimization [PDF]
Fully homomorphic encryption (FHE) enables secure data processing without compromising data access, but its computational cost and slower execution compared to plaintext operations pose challenges.
Giovanni De Micheli, Mingfei Yu
core

