Search results for "Natural language"
showing 10 items of 650 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 …
Eye movements when reading sentences with handwritten words.
2016
The examination of how we read handwritten words (i.e., the original form of writing) has typically been disregarded in the literature on reading. Previous research using word recognition tasks has shown that lexical effects (e.g., the word-frequency effect) are magnified when reading difficult handwritten words. To examine this issue in a more ecological scenario, we registered the participants’ eye movements when reading handwritten sentences that varied in the degree of legibility (i.e., sentences composed of words in easy vs. difficult handwritten style). For comparison purposes, we included a condition with printed sentences. Results showed a larger reading cost for sentences with dif…
Overview of the Evalita 2014 SENTIment POLarity Classification Task
2014
International audience; English. The SENTIment POLarity Classification Task (SENTIPOLC), a new shared task in the Evalita evaluation campaign , focused on sentiment classification at the message level on Italian tweets. It included three subtasks: subjectivity classification, polarity classification, and irony detection. SENTIPOLC was the most participated Evalita task with a total of 35 submitted runs from 11 different teams. We present the datasets and the evaluation methodology, and discuss results and participating systems. Italiano. Descriviamo modalit a e risultati della campagna di valutazione di sistemi di sentiment analysis (SENTIment POLarity Classification Task), proposta per la …
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.
Spoken conversational context improves query auto-completion in web search
2021
Web searches often originate from conversations in which people engage before they perform a search. Therefore, conversations can be a valuable source of context with which to support the search process. We investigate whether spoken input from conversations can be used as a context to improve query auto-completion. We model the temporal dynamics of the spoken conversational context preceding queries and use these models to re-rank the query auto-completion suggestions. Data were collected from a controlled experiment and comprised conversations among 12 participant pairs conversing about movies or traveling. Search query logs during the conversations were recorded and temporally associated…