Search results for "Speech processing"
showing 10 items of 210 documents
ElectronicgFactor of Hydrogenlike OxygenO7+16
2004
We present an experimental value for the $g$ factor of the electron bound in hydrogenlike oxygen, which is found to be ${g}_{\mathrm{e}\mathrm{x}\mathrm{p}\mathrm{t}}=2.000\text{ }047\text{ }025\text{ }4\text{ }(15)(44)$. The experiment was performed on a single $^{16}\mathrm{O}^{7+}$ ion stored in a Penning trap. For the first time, the expected line shape of the $g$-factor resonance is calculated which is essential for minimizing the systematic uncertainties. The measurement agrees within $1.1\text{ }\ensuremath{\sigma}$ with the predicted theoretical value ${g}_{\mathrm{t}\mathrm{h}\mathrm{e}\mathrm{o}\mathrm{r}\mathrm{y}}=2.000\text{ }047\text{ }020\text{ }2\text{ }(6)$. It represents a…
Anomalous behavior of the second magnetization peak inLa1.81Sr0.19CuO4single crystals: Possible influence of two-band superconductivity
2008
We report an anomalous temperature $T$ variation of the field ${H}_{\text{on}}$ for the onset of the second magnetization peak in ${\text{La}}_{1.81}{\text{Sr}}_{0.19}{\text{CuO}}_{4}$ single crystals with the external magnetic field $H$ oriented parallel to the $c$ axis. While the peak field ${H}_{p}$ has a continuous decrease with increasing $T$, ${H}_{\text{on}}$ exhibits a sudden decrease for $T\ensuremath{\sim}11--15\text{ }\text{K}$. This behavior appears to be related to the particular $T$ dependence of the superfluid density in the case of two-band superconductivity affecting the $T$ variation of the elastic energy of the vortex system at low $H$.
Elementary excitations in superfluidH3e-H4emixtures
2010
We have studied the dynamic structure function of superfluid $^{3}\text{H}\text{e-}^{4}\text{H}\text{e}$ mixtures at zero temperature as a function of pressure and $^{3}\text{H}\text{e}$ concentration. Results obtained in the full random-phase approximation (RPA) plus density-functional theory and in a generalized Landau-Pomeranchuk approach are presented and compared with experiment. Analytic expressions for several sum rules of the dynamic structure functions have been determined, and have been used to obtain average energies of the collective excitations. In the RPA approach, the dispersion relation of the collective modes shows typical features of level repulsion between zero-soundlike …
Minimal Absent Words in Rooted and Unrooted Trees
2019
We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet \(\varSigma \) of cardinality \(\sigma \). We show that the set \(\text {MAW}(T)\) of minimal absent words of a rooted (resp. unrooted) tree T with n nodes has cardinality \(O(n\sigma )\) (resp. \(O(n^{2}\sigma )\)), and we show that these bounds are realized. Then, we exhibit algorithms to compute all minimal absent words in a rooted (resp. unrooted) tree in output-sensitive time \(O(n+|\text {MAW}(T)|)\) (resp. \(O(n^{2}+|\text {MAW}(T)|)\) assuming an integer alphabet of size polynomial in n.
On the Size Complexity of Deterministic Frequency Automata
2013
Austinat, Diekert, Hertrampf, and Petersen [2] proved that every language L that is (m,n)-recognizable by a deterministic frequency automaton such that m > n/2 can be recognized by a deterministic finite automaton as well. First, the size of deterministic frequency automata and of deterministic finite automata recognizing the same language is compared. Then approximations of a language are considered, where a language L′ is called an approximation of a language L if L′ differs from L in only a finite number of strings. We prove that if a deterministic frequency automaton has k states and (m,n)-recognizes a language L, where m > n/2, then there is a language L′ approximating L such that L′ c…
Recent results on syntactic groups of prefix codes
2012
International audience; We give a simplified presentation of groups in transformation monoids. We use this presentation to describe two recent results on syntactic groups of prefix codes. The first one uses Sturmian words to build finite bifix codes with a given permutation group as syntactic group. The second one describes a class of prefix codes such that all their syntactic groups are cyclic.
Some Decision Results on Nonrepetitive Words
1985
The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.
Virtual and arrow Temperley–Lieb algebras, Markov traces, and virtual link invariants
2021
Let [Formula: see text] be the algebra of Laurent polynomials in the variable [Formula: see text] and let [Formula: see text] be the algebra of Laurent polynomials in the variable [Formula: see text] and standard polynomials in the variables [Formula: see text] For [Formula: see text] we denote by [Formula: see text] the virtual braid group on [Formula: see text] strands. We define two towers of algebras [Formula: see text] and [Formula: see text] in terms of diagrams. For each [Formula: see text] we determine presentations for both, [Formula: see text] and [Formula: see text]. We determine sequences of homomorphisms [Formula: see text] and [Formula: see text], we determine Markov traces […
Positive linear maps on normal matrices
2018
For a positive linear map [Formula: see text] and a normal matrix [Formula: see text], we show that [Formula: see text] is bounded by some simple linear combinations in the unitary orbit of [Formula: see text]. Several elegant sharp inequalities are derived, for instance for the Schur product of two normal matrices [Formula: see text], [Formula: see text] for some unitary [Formula: see text], where the constant [Formula: see text] is optimal.
𝔸1-contractibility of affine modifications
2019
We introduce Koras–Russell fiber bundles over algebraically closed fields of characteristic zero. After a single suspension, this exhibits an infinite family of smooth affine [Formula: see text]-contractible [Formula: see text]-folds. Moreover, we give examples of stably [Formula: see text]-contractible smooth affine [Formula: see text]-folds containing a Brieskorn–Pham surface, and a family of smooth affine [Formula: see text]-folds with a higher-dimensional [Formula: see text]-contractible total space.