Search results for "EXTP"
showing 10 items of 358 documents
Additional file 2 of Low awareness and common misconceptions about schistosomiasis in endemic lowland areas in Western Ethiopia: a mixed-methods study
2021
Additional file 2: Supplementary file 2 Focused Group Discussions (FGD) guide.pdf
Storm
2003
We present Storm, a storage system which unifies the desktop and the public network, making Web links between desktop documents more practical. Storm assigns each document a permanent unique URI when it is created. Using peer-to-peer technology, we can locate documents even though our URIs do not include location information. Links continue to work unchanged when documents are emailed or published on the network. We have extended KDE to understand Storm URIs. Other systems such as GNU Emacs are able to use Storm through an HTTP gateway.
A sentence based system for measuring syntax complexity using a recurrent deep neural network
2018
In this paper we present a deep neural network model capable of inducing the rules that identify the syntax complexity of an Italian sentence. Our system, beyond the ability of choosing if a sentence needs of simplification, gives a score that represent the confidence of the model during the process of decision making which could be representative of the sentence complexity. Experiments have been carried out on one public corpus created specifically for the problem of text-simplification.
A recurrent deep neural network model to measure sentence complexity for the Italian Language
2019
Text simplification (TS) is a natural language processing task devoted to the modification of a text in such a way that the grammar and structure of the phrases is greatly simplified, preserving the underlying meaning and information contents. In this paper we give a contribution to the TS field presenting a deep neural network model able to detect the complexity of italian sentences. In particular, the system gives a score to an input text that identifies the confidence level during the decision making process and that could be interpreted as a measure of the sentence complexity. Experiments have been carried out on one public corpus of Italian texts created specifically for the task of TS…
Extracting Formal Models from Normative Texts
2016
Normative texts are documents based on the deontic notions of obligation, permission, and prohibition. Our goal is model such texts using the C-O Diagram formalism, making them amenable to formal analysis, in particular verifying that a text satisfies properties concerning causality of actions and timing constraints. We present an experimental, semi-automatic aid to bridge the gap between a normative text and its formal representation. Our approach uses dependency trees combined with our own rules and heuristics for extracting the relevant components. The resulting tabular data can then be converted into a C-O Diagram.
GW170817: Implications for the Stochastic Gravitational-Wave Background from Compact Binary Coalescences
2018
The LIGO Scientific and Virgo Collaborations have announced the first detection of gravitational waves from the coalescence of two neutron stars. The merger rate of binary neutron stars estimated from this event suggests that distant, unresolvable binary neutron stars create a significant astrophysical stochastic gravitational-wave background. The binary neutron star background will add to the background from binary black holes, increasing the amplitude of the total astrophysical background relative to previous expectations. In the Advanced LIGO-Virgo frequency band most sensitive to stochastic backgrounds (near 25 Hz), we predict a total astrophysical background with amplitude $\Omega_{\rm…
Activities using blackboard, pens and paper
1998
Dictogloss Language Listening comprehension Level Elementary upwards Age Any This is a well established dictation-based activity which helps to develop conscious listening skills in addition to an awareness of phrase and sentence structures. Procedure Choose a sentence suitable for the level of the class. This might be a sentence from a coursebook, but if so, make sure it is one which is not yet familiar to your students. An example sentence is given below. Tell the class that you will read this sentence to them once only. They should write down the key words as you read. You should not have to repeat the sentence, but with a large class you might like to read it once at the front of the ro…
Measurement of the inelastic proton-proton cross-section at √s = 7 TeV with the ATLAS detector
2011
The dependence of the rate of proton–proton interactions on the centre-of-mass collision energy, √s, is of fundamental importance for both hadron collider physics and particle astrophysics. The dependence cannot yet be calculated from first principles; therefore, experimental measurements are needed. Here we present the first measurement of the inelastic proton–proton interaction cross-section at a centre-of-mass energy, √s, of 7 TeV using the ATLAS detector at the Large Hadron Collider. Events are selected by requiring hits on scintillation counters mounted in the forward region of the detector. An inelastic cross-section of 60.3±2.1 mb is measured for ξ>5×10[superscript −6], where ξ is ca…
Une expérience professionnelle à l'étranger est-elle payante en début de carrière pour les diplômés de l'enseignement supérieur ? (Note de recherche)
2008
09030 - http://remi.revues.org/index4823.html
Regular Varieties of Automata and Coequations
2015
In this paper we use a duality result between equations and coequations for automata, proved by Ballester-Bolinches, Cosme-Ll´opez, and Rutten to characterize nonempty classes of deterministic automata that are closed under products, subautomata, homomorphic images, and sums. One characterization is as classes of automata defined by regular equations and the second one is as classes of automata satisfying sets of coequations called varieties of languages. We show how our results are related to Birkhoff’s theorem for regular varieties.