Results 61 to 70 of about 133,463 (288)

Light‐Programmable Interfaces: From Molecular Photoswitching to Adaptive Membrane Separations

open access: yesAdvanced Materials Interfaces, EarlyView.
This review advances an interface‐centered framework for light‐responsive membranes, linking molecular photoswitches (azobenzene (AZO), spiropyran (SP), diarylethene (DAE), donor–acceptor Stenhouse adducts (DASA), photoacid) to integration strategies in polymeric, porous, self‐assembled, and mixed‐matrix systems.
Liangliang Zhang   +6 more
wiley   +1 more source

A Framework for Fine-Grained Nonlinearity Optimization of Boolean and Vectorial Boolean Functions

open access: yesIEEE Access, 2021
Boolean functions and vectorial Boolean functions (S-boxes) are widely used cryptographic primitives for achieving cryptanalytic resistance of modern block or stream ciphers.
Miroslav M. Dimitrov
doaj   +1 more source

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

Fuzzy Maximum Satisfiability

open access: yes, 2016
In this paper, we extend the Maximum Satisfiability (MaxSAT) problem to {\L}ukasiewicz logic. The MaxSAT problem for a set of formulae {\Phi} is the problem of finding an assignment to the variables in {\Phi} that satisfies the maximum number of formulae.
Abdalla, Areeg, Halaby, Mohamed El
core   +1 more source

Representations of Monotone Boolean Functions by Linear Programs [PDF]

open access: yesACM Transactions on Computation Theory, 2019
We introduce the notion of monotone linear programming circuits (MLP circuits), a model of computation for partial Boolean functions. Using this model, we prove the following results. 1 (1) MLP circuits are superpolynomially stronger than monotone Boolean circuits.
Mateus De Oliveira Oliveira   +1 more
openaire   +5 more sources

Stable Imitation of Multigait and Bipedal Motions for Quadrupedal Robots Over Uneven Terrains

open access: yesAdvanced Robotics Research, EarlyView.
How are quadrupedal robots empowered to execute complex navigation tasks, including multigait and bipedal motions? Challenges in stability and real‐world adaptation persist, especially with uneven terrains and disturbances. This article presents an imitation learning framework that enhances adaptability and robustness by incorporating long short‐term ...
Erdong Xiao   +3 more
wiley   +1 more source

A Novel Minimization Method for Sensor Deployment Via Heuristic 2-Sat Solution

open access: yesSir Syed University Research Journal of Engineering and Technology, 2018
The tasks of guard placement or sensor deployment in an art gallery, a museum or in the corridors of public and security buildings pose the same problem, which requires placing the guards or sensors so as to cover a specified set of nodes with a minimum
Waleed Ahmed, Ali Muhammad Ali Rushdi
doaj  

SuperBall: A New Approach for MILP Modelings of Boolean Functions

open access: yesIACR Transactions on Symmetric Cryptology, 2022
Mixed Integer Linear Programming (MILP) solver has become one of the most powerful tools of searching for cryptographic characteristics. It has great significance to study the influencing factors of the efficiency of MILP models.
Ting Li, Yao Sun
doaj   +1 more source

UML-F: A Modeling Language for Object-Oriented Frameworks [PDF]

open access: yes, 2014
The paper presents the essential features of a new member of the UML language family that supports working with object-oriented frameworks. This UML extension, called UML-F, allows the explicit representation of framework variation points.
Fontoura, Marcus   +2 more
core   +1 more source

Verification of Boolean programs with unbounded thread creation

open access: yesTheoretical Computer Science, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cook, B, Kroening, D, Sharygina, N
openaire   +2 more sources

Home - About - Disclaimer - Privacy