Results 61 to 70 of about 2,300,412 (294)
Boolean random networks: phase transition and connectivity [PDF]
openIn this thesis I introduce some random network models, with a particular focus on boolean random networks. After having provided the necessary theoretical background, several results related to two topics concerning boolean networks are discussed ...
SPISSO, GIOVANNI
core
Multimodal Human–Robot Interaction Using Human Pose Estimation and Local Large Language Models
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
Perfect contrast visual cryptography scheme
A perfect contrast visual cryptography scheme with the best contrast based on both the perfect black visual cryptography scheme(PBVCS) and the non-perfect black visual cryptography scheme(NPBVCS) was proposed.The proposed scheme applied simple Boolean ...
HAN Yan-yan1, HE Wen-cai1, HU Yu-pu1
doaj +2 more sources
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
NEW EXPANSIONS OF BOOLEAN FUNCTIONS ON EXCLUSIVE OR OPERATION IN LOGICAL SYSTEMS DESIGN
The Boolean function expansions and representation forms which are based on exclusive or operation are a key facility for design, test and diagnosis of digital systems and computer programs.
A. A. Prihozhy
doaj
A Construction Method of (2, 3) Visual Cryptography Scheme
Visual cryptography scheme (VCS) shares a binary secret image into multiple shadows, stacking qualified set of shadows will decode the secret image without computer resources.
Peng Li +3 more
doaj +1 more source
General Boolean Expressions in Publish-Subscribe Systems [PDF]
The increasing amount of electronically available information in society today is undeniable. Examples include the numbers of general web pages, scientific publications, and items in online auctions.
Bittner, Sven
core
Ferroelectric Devices for In‐Memory and In‐Sensor Computing
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
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quartet Consistency (MQC) problem consists of computing a global phylogeny that
Morgado, Antonio Jose +1 more
core +2 more sources
The expressibility of functions on the Boolean domain, with applications to Counting CSPs [PDF]
An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a particular set of base relations. Post'
Bulatov, AA +6 more
core +1 more source

