Results 61 to 70 of about 1,587 (262)
Tree games with regular objectives [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study tree games developed recently by Matteo Mio as a game interpretation of the probabilistic μ-calculus. With expressive power comes complexity.
Marcin Przybyłko
doaj +1 more source
Advanced Engineering Materials, EarlyView.This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi +4 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.This article presents the design, modeling, and characterization of air‐pressure–actuated programmable vibroacoustic metamaterials (PVAMM). The study focuses on leveraging air pressure to dynamically tune resonance frequencies for effective noise attenuation.
William Kaal +2 more
wiley +1 more source
Expressiveness of Visibly Pushdown Transducers [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of nested words, i.e. words with a call/return structure.
Mathieu Caralp +4 more
doaj +1 more source
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
Advanced Engineering Materials, EarlyView.A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 more
wiley +1 more source
FINITE TREE AUTOMATA ON INFINITE TREES [PDF]
Bulletin of informatics and cybernetics, 1985 For finite automata on infinite words or trees there are several natural ways to define acceptance. Compared to the cases of finite words or trees the situation is further complicated by the fact that nondeterminism properly increases the recognition power of automata. The authors have set out to clarify the relationships between six modes of accepting
Hayashi, Takeshi, Miyano, Satoru
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch +3 more
wiley +1 more source
Theoretical Computer Science, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Multimodal Data‐Driven Microstructure Characterization
Advanced Engineering Materials, EarlyView.A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source
Synthesizing Structured Reactive Programs via Deterministic Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Existing approaches to the synthesis of reactive systems typically involve the construction of transition systems such as Mealy automata. However, in order to obtain a succinct representation of the desired system, structured programs can be a more ...
Benedikt Brütsch
doaj +1 more source