Results 71 to 80 of about 51,980 (308)
On canalizing Boolean functions [PDF]
, 2014 Boolean networks are an important model of gene regulatory networks in systems and computational biology. Such networks have been widely studied with respect to their stability and error tolerance. It has turned out that canalizing Boolean functions and their subclass, the nested canalizing functions, appear frequently in such networks.
openaire +1 more source
Multimodal Human–Robot Interaction Using Human Pose Estimation and Local Large Language Models
Advanced Robotics Research, EarlyView.A multimodal human–robot interaction framework integrates human pose estimation (HPE) and a large language model (LLM) for gesture‐ and voice‐based robot control. Speech‐to‐text (STT) enables voice command interpretation, while a safety‐aware arbitration mechanism prioritizes gesture input for rapid intervention.
Nasiru Aboki +2 more
wiley +1 more source
On Circuit Functionality in Boolean Networks
Bulletin of Mathematical Biology, 2013 It has been proved, for several classes of continuous and discrete dynamical systems, that the presence of a positive (resp. negative) circuit in the interaction graph of a system is a necessary condition for the presence of multiple stable states (resp. a cyclic attractor). A positive (resp.
Comet, Jean-Paul +9 more
openaire +10 more sources
Advanced Robotics Research, EarlyView.DRIVE‐SAFE evaluates learning‐based, black‐box autonomous driving policies against evolving temporal safety requirements using Signal Temporal Logic robustness metrics. It aggregates distributional robustness measures with domain‐informed weights to guide iterative retraining.
Kristy Sakano +3 more
wiley +1 more source
Method of restoring multivariable Boolean function from its derivative
Advanced Engineering Research, 2017 Introduction. Boolean functions of several variables are of paramount importance in the coding theory and cryptography. The compositions of these functions are used in a set of the symmetric cryptosystems; therewith, some error-control codes, such as ...
Alexander V. Mazurenko +1 more
doaj +1 more source
Transformations of Boolean Functions.
, 2019 Boolean functions are characterized by the unique structure of their solution space. Some properties of the solution space, such as the possible existence of a solution, are well sought after but difficult to obtain. To better reason about such properties, we define transformations as functions that change one Boolean function to another while ...
Jeffrey M. Dudek, Dror Fried
openaire +3 more sources
Analysis of Boolean Functions [PDF]
, 2014 Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathematical social choice. The field of analysis of Boolean functions seeks to understand them via their Fourier transform and other analytic methods.
openaire +2 more sources
Linear approximation of a vectorial Boolean function using quantum computing
, 2020 A vectorial Boolean function takes multi-bit input and produces a multi-bit output. According to the input parameters, a vectorial Boolean function can be linear or non-linear.
A. K. Malviya, N. Tiwari
core +1 more source
Boolean Function Analysis on High-Dimensional Expanders [PDF]
, 2018 We initiate the study of Boolean function analysis on high-dimensional expanders. We describe an analog of the Fourier expansion and of the Fourier levels on simplicial complexes, and generalize the FKN theorem to high-dimensional expanders.
Dikstein, Yotam +3 more
core +1 more source
Ferroelectric Devices for In‐Memory and In‐Sensor Computing
Advanced Science, EarlyView.Inspired by biological systems, in‐memory and in‐sensor computing overcome von Neumann bottlenecks. Ferroelectric devices can mimic synaptic functions and sense stimuli like light or force, therefore are ideal for these paradigms. This review introduces the ferroelectric devices applied for in‐memory and in‐sensor computing, covering their structures ...
Hong Fang +5 more
wiley +1 more source