Results 41 to 50 of about 101,625 (182)

On factorisation forests [PDF]

open access: yes, 2007
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond.
Colcombet, Thomas
core   +2 more sources

Smart and Sustainable Sizing: Investigating the Sensing Behavior of Glass Fabrics Coated With Waterborne Polyurethane/Graphene Dispersions

open access: yesAdvanced Materials Technologies, EarlyView.
Waterborne polyurethane/graphene formulations are developed as piezoresistive coatings on glass fabric to enable flexible strain sensing. The graphene‐enabled conductive network provides a stable electromechanical response under cyclic compression. The coating demonstrates reliable pressure‐dependent resistance changes, highlighting its potential for ...
Vishnu Vijayan Pillai   +8 more
wiley   +1 more source

Dysfunctions of highly parallel real-time machines as 'developmental disorders': Security concerns and a Caveat Emptor [PDF]

open access: yes, 2009
A cognitive paradigm for gene expression in developmental biology that is based on rigorous application of the asymptotic limit theorems of information theory can be adapted to highly parallel real-time computing.
Wallace, Rodrick
core  

Transducers Across Scales and Frequencies: A System‐Level Framework for Multiphysics Integration and Co‐Design

open access: yesAdvanced Materials Technologies, EarlyView.
Transducers convert physical signals into electrical and optical representations, yet each mechanism is bounded by intrinsic trade‐offs across bandwidth, sensitivity, speed, and energy. This review maps transduction mechanisms across physical scale and frequency, showing how heterogeneous integration and multiphysics co‐design transform isolated ...
Aolei Xu   +8 more
wiley   +1 more source

In the Maze of Data Languages [PDF]

open access: yes, 2012
In data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. Extensions of automata and logics over finite alphabets have been defined to recognize data languages, both in the ...
D'Antoni, Loris
core  

Two‐Photon Polymerized Microvascular Environments for Multicellular Modeling of the Blood–Brain Tumor Barrier

open access: yesAdvanced Materials Technologies, EarlyView.
Modeling the blood–brain tumor barrier is challenging due to complex interactions between brain microvasculature and glioma cells. We present two‐photon polymerized 3D micro‐porous capillary‐like structures that support endothelial alignment, cytoskeletal organization, and pericyte‐endothelial‐glioma tri‐cultures.
Nastaran Barin   +9 more
wiley   +1 more source

Grounding Large Language Models for Robot Task Planning Using Closed‐Loop State Feedback

open access: yesAdvanced Robotics Research, EarlyView.
BrainBody‐Large Language Model (LLM) introduces a hierarchical, feedback‐driven planning framework where two LLMs coordinate high‐level reasoning and low‐level control for robotic tasks. By grounding decisions in real‐time state feedback, it reduces hallucinations and improves task reliability.
Vineet Bhat   +4 more
wiley   +1 more source

Root-Weighted Tree Automata and their Applications to Tree Kernels

open access: yes, 2015
In this paper, we define a new kind of weighted tree automata where the weights are only supported by final states. We show that these automata are sequentializable and we study their closures under classical regular and algebraic operations. We then use
Mignot, Ludovic   +2 more
core  

Optimizing for confidence - Costs and opportunities at the frontier between abstraction and reality [PDF]

open access: yes, 2013
Is there a relationship between computing costs and the confidence people place in the behavior of computing systems? What are the tuning knobs one can use to optimize systems for human confidence instead of correctness in purely abstract models?
Poss, Raphael 'kena'
core  

Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties

open access: yes, 2018
We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: (1) The deterministic version has a decidable membership problem but has an undecidable emptiness problem.
Ibarra, Oscar H., McQuillan, Ian
core   +1 more source

Home - About - Disclaimer - Privacy