Results 51 to 60 of about 26,341 (261)

Shape Memory Polymer‐Based Flexible Pressure Sensor for Real‐Time Venous Thrombosis Monitoring

open access: yesAdvanced Materials Interfaces, EarlyView.
A shape‐memory tubular flexible pressure sensor with a 100‐mesh microstructured SMP‐PLA/MWCNTs sensing layer was developed for PICC‐mounted monitoring of thrombosis‐related pressure changes. The sensor combines high sensitivity (204 kPa−1), a fast response time (28 ms), and conformal catheter fixation and was validated by hydrostatic and ex vivo ...
Yi Chen   +7 more
wiley   +1 more source

De Morgan Functions and Free De Morgan Algebras

open access: yesDemonstratio Mathematica, 2014
It is commonly known that the free Boolean algebra on n free generators is isomorphic to the Boolean algebra of Boolean functions of n variables. The free bounded distributive lattice on n free generators is isomorphic to the bounded lattice of monotone ...
Movsisyan Yu. M.   +2 more
doaj   +1 more source

An Imaging‐Guided, Patient‐Specific Guiding Aid (RWNGuide) for Safe and Reproducible Inner Ear Drug Delivery

open access: yesAdvanced Materials Technologies, EarlyView.
A patient‐specific, imaging‐guided aid enables precise and reproducible drug delivery to the inner ear. By guiding therapeutic agents directly to the round window niche, this approach reduces variability in drug localization, improves delivery safety, and addresses a critical bottleneck in inner ear therapy, offering a scalable strategy for precision ...
Yanjing Luo   +4 more
wiley   +1 more source

Quantum boolean functions

open access: yesChic. J. Theor. Comput. Sci., 2008
In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f^2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including quantum property testing; a quantum version of the Goldreich-Levin algorithm for finding the large Fourier ...
Ashley Montanaro, Tobias Osborne
openaire   +3 more sources

Scalable Task Planning via Large Language Models and Structured World Representations

open access: yesAdvanced Robotics Research, EarlyView.
This work efficiently combines graph‐based world representations with the commonsense knowledge in Large Language Models to enhance planning techniques for the large‐scale environments that modern robots will need to face. Planning methods often struggle with computational intractability when solving task‐level problems in large‐scale environments ...
Rodrigo Pérez‐Dattari   +4 more
wiley   +1 more source

Multimodal Human–Robot Interaction Using Human Pose Estimation and Local Large Language Models

open access: yesAdvanced 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

open access: yesBulletin 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

On Quadratization of Pseudo-Boolean Functions [PDF]

open access: yesCoRR, 2014
11 ...
Endre Boros, Aritanan Gruber
openaire   +2 more sources

DRIVE‐SAFE: Data‐Driven Robustness and Informed Validation for Evolving Specifications via Formal Evaluation

open access: yesAdvanced 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

Complexity Lower Bound for Boolean Functions in the Class of Extended Operator Forms

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2019
Starting with the fundamental work of D.E.Muller in 1954, the polynomial representations of Boolean functions are widely investigated in connection with the theory of coding and for the synthesis of circuits of digital devices.
A.S. Baliuk
doaj   +1 more source

Home - About - Disclaimer - Privacy