Results 81 to 90 of about 1,576 (262)
This review summarizes the principles and challenges of nonaqueous lithium‐oxygen batteries and recent advances in cathode catalysts, including carbon‐based materials, metals, oxides, sulfides, nitrides, carbides, and redox mediators. It highlights emerging design strategies and artificial intelligence‐driven approaches, emphasizing data‐assisted ...
Yuqing Yao +8 more
wiley +1 more source
We introduce a computational workflow that combines quantum chemical calculations and machine learning techniques to predict the catalytic performance of a wide range of catalysts in the nitrogen reduction reaction (NRR). The analysis of the trained models provides insights into the complex structure–activity relationship in experimental catalytic ...
Leonardo Di Ciano +5 more
wiley +1 more source
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try to get some quantitative measure of “efficiency” of translators and grammars for the language. The model obtained by doing this is called a probabilistic language.
openaire +1 more source
This review explores advances in wearable and lab‐on‐chip technologies for breast cancer detection. Covering tactile, thermal, ultrasound, microwave, electrical impedance tomography, electrochemical, microelectromechanical, and optical systems, it highlights innovations in flexible electronics, nanomaterials, and machine learning.
Neshika Wijewardhane +4 more
wiley +1 more source
The minimalization of tree automata
A tree automaton is a system (Q, f1, …, fk, F) where Q is a set of states, f1, …, fk are operations on Q of arbitrary finite index, and F ⊆ Q is a set of final states. The input to a tree automaton is a tree structure and thus the behavior of a tree automaton is a set of trees.
openaire +2 more sources
Minimizing Tree Automata for Unranked Trees [PDF]
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. We start with the unranked tree automata (UTAs) that are standard in database theory, assuming bottom-up determinism and that horizontal recursion is represented by deterministic finite automata ...
Martens, Wim, Niehren, Joachim
openaire +3 more sources
Scalable Task Planning via Large Language Models and Structured World Representations
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
Nonlocomotory Robotic Strategies for Dynamic Rotation Control in Terrestrial Robots: A Review
Terrestrial robots increasingly require rapid body rotation to maintain stability and agility in complex environments. This review shows nonlocomotory rotational control strategies that operate without ground contact, including reaction wheels, tails, bars, limbs, and thrusters.
Y. Liang +14 more
wiley +1 more source
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
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures [PDF]
We introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete.
Stephane Demri, Karin Quaas
doaj +1 more source

