Results 71 to 80 of about 27,251 (199)
Dermatophagoides farinae (DFA), the most prevalent aeroallergen in allergic asthma, releases extracellular vesicles (EVs) containing dfa-miR-276-3p, which plays an important role in DFA sensitization.
Xiao Zang +6 more
doaj +1 more source
A criterion for the determination of optimal scaling ranges in DFA and MF-DFA
Abstract We develop a criterion based on a brute-force algorithm to systematically determine optimal fitting regions for fluctuation functions in Detrended Fluctuation Analysis (DFA) and Multifractal Detrended Fluctuation Analysis (MF-DFA). We analyze and compare results with several artificially generated time series with known parameters as ...
Gulich, Maximiliano Damián +1 more
openaire +2 more sources
Cancer remains one of the leading causes of global mortality due to the uncontrolled proliferation of malignant cells. Although conventional treatments such as chemotherapy and immunotherapy have advanced, their associated adverse effects may compromise ...
Leandro de Oliveira Porfírio +6 more
doaj +1 more source
The assembly is often a weak link in the production process. It is an enterprise activity which is responsible for a substantial part of the production costs and the throughput time. Robot assembly systems in addition offer legitimate possibilities to rationalize the assembly activities, because of the increasing product diversity, and the more severe ...
openaire +2 more sources
The state complexity of random DFAs
The state complexity of a Deterministic Finite-state automaton (DFA) is the number of states in its minimal equivalent DFA. We study the state complexity of random $n$-state DFAs over a $k$-symbol alphabet, drawn uniformly from the set $[n]^{[n]\times[k]}\times2^{[n]}$ of all such automata. We show that, with high probability, the latter is $α_k n + O(\
Daniel Berend, Aryeh Kontorovich
openaire +5 more sources
Prefix Sorting DFAs: a Recursive Algorithm
In the past thirty years, numerous algorithms for building the suffix array of a string have been proposed. In 2021, the notion of suffix array was extended from strings to DFAs, and it was shown that the resulting data structure can be built in $ O(m^2 + n^{5/2}) $ time, where $ n $ is the number of states and $ m $ is the number of edges [SODA 2021].
openaire +5 more sources
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is hard.
Rajesh Parekh, Vasant Honavar
core
Introduction: The specific diagnosis of influenza A infection makes. it possible to control its spread, decreases the unnecessary use of antibiotics, clinical procedures and laboratory test, and allows early recognition of outbreaks.
Wilhelm, Jan +6 more
core +1 more source
Nondeterministic Automata and JSL-dfas
We introduce the category of dependency automata. A dependency automaton consists of two nondeterministic finite automata, with a relation between their states satisfying conditions. This category is equivalent to deterministic finite automata interpreted in join-semilattices i.e. JSL-dfas.
openaire +2 more sources
(A) The putative reactive pocket and active site residues of AaDFA IIIase based on superimposition of AaDFA IIIase model (gray) and crystal structure of Bacillus sp. IFTase (pink).
Timo Stressler (435024) +6 more
core +1 more source

