Results 41 to 50 of about 3,110 (267)
Optimizing photoexcitation conditions for time‐resolved X‐ray solution scattering experiments
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering (TR‐XSS) is a powerful technique to visualize how proteins change their structure in real time after light activation. Selecting the right laser photoexcitation conditions—fluence, excitation geometry, and sample refresh rate—is critical to maximize the experimental signal while avoiding unwanted side effects ...
Matteo Levantino
wiley +1 more source
A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata [PDF]
Maejo International Journal of Science and Technology, 2013 Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata.
Ajay Kumar, Anil Kumar Verma
doaj +1 more source
dynoGP: Deep Gaussian Processes for Dynamic System Identification
International Journal of Adaptive Control and Signal Processing, EarlyView.This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli +3 more
wiley +1 more source
ON THE PROBLEM OF LOGIC-AUTOMATIC FORMULAS PERFORMABILITY
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2020 Background. In the theory of finite automata, there are a number of ways to define finite automata (finitely automatic functions). There are systems of canonical equations among them, Moore diagrams, information trees, schemes of automatic elements ...
S. S. Marchenkov
doaj +1 more source
Can Nondeterminism Help Complementation? [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature.
Yang Cai, Ting Zhang
doaj +1 more source
Cellular automata and finite groups [PDF]
Natural Computing, 2017 For a finite group $G$ and a finite set $A$, we study various algebraic aspects of cellular automata over the configuration space $A^G$. In this situation, the set $\text{CA}(G;A)$ of all cellular automata over $A^G$ is a finite monoid whose basic algebraic properties had remained unknown.
Alonso Castillo-Ramirez +1 more
openaire +3 more sources
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
Weighted DAG Automata for Semantic Graphs [PDF]
Computational Linguistics, 2018 Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, and using models involving graphs that parallels the ...
David Chiang +4 more
doaj +2 more sources
Modular Critical Element Recycling Platform Using a Nanoporous Additively Manufactured Gyroid
Advanced Engineering Materials, EarlyView.A modular recycling platform integrates 3D‐printed nanoporous gyroid structures to enable efficient critical element recovery. This system utilizes a hierarchical architecture, combining macroscopic channels with polymerization‐induced nanoscale porosity. By systematically tuning structural wall thickness and resin formulation, the platform achieves an
Xiangyu Gao +6 more
wiley +1 more source
Theoretical Computer Science, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources