Results 121 to 130 of about 2,786,322 (296)

Plateaued rotation symmetric boolean functions on odd number of variables [Elektronisk resurs]

, 2005
The class of Rotation Symmetric Boolean Functions (RSBFs) has received serious attention in searching functions of cryptographic significance. These functions are invariant under circular translation of indices.
Hell, Martin,, Maximov, Alexander,, Maitra, Subhamoy, Lund University.   +3 more
core  

A Generalizable Framework for Building Executable Domain‐Specific Large Language Models Under Data Scarcity: Demonstration on Semiconductor Technology Computer‐Aided Design Simulation

Advanced Intelligent Systems, EarlyView.
A schema‐first alignment framework builds compact, executable domain‐specific language models under data scarcity. Large‐scale synthetic question‐answer generation instills domain knowledge, and a code‐centric IR‐to‐DPO pipeline aligns generation with tool‐executable syntax.
Di Wang, Zhenhua Wu, Yu Liu, Kai Chang, Shaohua Wu   +4 more
wiley   +1 more source

Preponderance of generalized chain functions in reconstructed Boolean models of biological networks

Scientific Reports
Boolean networks (BNs) have been extensively used to model gene regulatory networks (GRNs). The dynamics of BNs depend on the network architecture and regulatory logic rules (Boolean functions (BFs)) associated with nodes.
Suchetana Mitra, Priyotosh Sil, Ajay Subbaroyan, Olivier C. Martin, Areejit Samal   +4 more
doaj   +1 more source

Optimized Homomorphic Evaluation of Boolean Functions

Transactions on Cryptographic Hardware and Embedded Systems
We propose a new framework to homomorphically evaluate Boolean functions using the Torus Fully Homomorphic Encryption (TFHE) scheme. Compared to previous approaches focusing on Boolean gates, our technique can evaluate more complex Boolean functions ...
Nicolas Bon, David Pointcheval, Matthieu Rivain   +2 more
doaj   +1 more source

Miniaturized Multifunctional Valves for Intelligent Pneumatic Systems in Soft Robotics

Advanced Intelligent Systems, EarlyView.
Miniaturized multifunctional pneumatic valves in normally closed (NC) and normally open (NO) configurations enable reconfigurable and programmable fluidic logic—including AND, OR, NAND, and NOR gates—with/without physical replumbing. These valves integrate sensing, logic, and actuation within a unified architecture, demonstrated through an electronics ...
J. Xu, X. Z. Niu, J. Andersson, D./G. Broo, K. Hjort   +4 more
wiley   +1 more source

Algorithms for extracting subsystems from a multilevel representation of a system of Boolean functions for joint minimization

Informatika
Objectives. The purpose of experimental research is to determine the effectiveness of new algorithms for extracting the so-called connected subsystems from formula descriptions of the original system of Boolean functions.
P. N. Bibilo, N. A. Kirienko, V. I. Romanov   +2 more
doaj   +1 more source

Interbody Wire for Reconfigurable Robots: Bridging Integrated Morphological Reconfiguration and Distributed Wire‐Mediated Cooperation

Advanced Intelligent Systems, EarlyView.
TwinX shows how a single interbody wire connecting two robots can support both integrated morphological reconfiguration and distributed wire‐mediated cooperation. When the robots dock, they reconfigure into different forms for locomotion and manipulation.
Shintaro Inoue, Kento Kawaharazuka, Keita Yoneda, Sota Yuzaki, Temma Suzuki, Kei Okada   +5 more
wiley   +1 more source

Recursive weights for some Boolean functions

Journal of Mathematical Cryptology, 2012
This paper studies degree 3 Boolean functions in n variables which are rotation symmetric, that is, invariant under any cyclic shift of the indices of the variables.
Brown Alyssa, Cusick Thomas W.
doaj   +1 more source

On the Decomposition of Boolean Functions via Boolean Equations

J. Univers. Comput. Sci., 2004
JUCS - Journal of Universal Computer Science Volume Nr.
openaire   +2 more sources

Counting aggregate classifiers. [PDF]

There are many methods to design classifiers for the supervised classification problem. In this paper, we study the problem of aggregating classifiers. We construct an algorithm to count the number of distinct aggregate classifiers.
Gochet, Willy, Adem, Jan, Spieksma, Frederik   +2 more
core