Search results for "automatic"
showing 10 items of 730 documents
Attention-based Model for Evaluating the Complexity of Sentences in English Language
2020
The automation of text complexity evaluation (ATCE) is an emerging problem which has been tackled by means of different methodologies. We present an effective deep learning- based solution which leverages both Recurrent Neural and the Attention mechanism. The developed system is capable of classifying sentences written in the English language by analysing their syntactical and lexical complexity. An accurate test phase has been carried out, and the system has been compared with a baseline tool based on the Support Vector Machine. This paper represents an extension of a previous deep learning model, which allows showing the suitability of Neural Networks to evaluate sentence complexity in tw…
Multi-class Text Complexity Evaluation via Deep Neural Networks
2019
Automatic Text Complexity Evaluation (ATE) is a natural language processing task which aims to assess texts difficulty taking into account many facets related to complexity. A large number of papers tackle the problem of ATE by means of machine learning algorithms in order to classify texts into complex or simple classes. In this paper, we try to go beyond the methodologies presented so far by introducing a preliminary system based on a deep neural network model whose objective is to classify sentences into more of two classes. Experiments have been carried out on a manually annotated corpus which has been preprocessed in order to make it suitable for the scope of the paper. The results sho…
Impact of decision horizon on post-prognostics maintenance and missions scheduling: a railways case study
2021
International audience; In this paper, we propose a study of the decision horizon duration for rolling stock mission assignment and maintenance planning in a prognostics and health management (PHM) context. The aim is to determine the best decision horizon duration that allows the con- struction of a suitable schedule that assigns railway vehicles to missions and integrates required maintenance operations accord- ing to the current and future health of the vehicles. A genetic algorithm is used to minimize the overall cost of the joint schedule as a function of the decision horizon. The results are compared to three proposed heuristics to study the influence of the resolution method on the d…
A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem
2016
The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an arc routing problem with some interesting real-life applications, such as routing for meter reading. In this article we introduce two new formulations for this problem as well as various families of new valid inequalities that are used to design and implement a branch-and-cut algorithm. The computational results obtained on test bed instances from the literature show that this algorithm outperforms the existing exact methods
A dual process model to predict adolescents’ screen time and physical activity
2021
OBJECTIVE: Many adolescents report a lack of physical activity (PA) and excess screen time (ST). Psychological theories aiming to understand these behaviours typically focus on predictors of only one behaviour. Yet, behaviour enactment is often a choice between options. This study sought to examine predictors of PA and ST in a single model. Variables were drawn from dual process models, which portray behaviour as the outcome of deliberative and automatic processes. DESIGN: 411 Finnish vocational school students (age 17-19) completed a survey, comprising variables from the Reasoned Action Approach (RAA) and automaticity pertaining to PA and ST, and self-reported PA and ST four weeks later. M…
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
2017
[EN] The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods. If the vehicle gets closer than a certain distance to a meter, the receiver is able to record the gas, water, or electricity consumption. Therefore, the vehicle does not need to traverse every street, but only a few, to get close enough to each meter. We study an extension of this problem in which a fleet of vehicles is available. Given the characteristics of the mentioned application, the vehicles have no capacities but there is a maximum distan…
Adaptive synchronization of master-slave systems with mixed neutral and discrete time-delays and nonlinear perturbations
2011
This paper investigates the delay-dependent adaptive synchronization problem of the master and slave structure of linear systems with both constant neutral and time-varying discrete time-delays and nonlinear perturbations based on the Barbalat lemma and matching conditions. An adaption law which includes the master-slave parameters is obtained by using the Lyapunov functional method and inequality techniques to synchronize the master-slave systems without the knowledge of upper bounds of perturbation terms. Particularly, it is shown that the synchronization speed can be controlled by adjusting the update gain of the synchronization signal. A numerical example has been given to show the effe…
Transverse momentum spectra and nuclear modification factors of charged particles in pp, p-Pb and Pb-Pb collisions at the LHC
2018
We report the measured transverse momentum ($p_{\rm T}$) spectra of primary charged particles from pp, p-Pb and Pb-Pb collisions at a center-of-mass energy $\sqrt{s_{\rm NN}} = 5.02$ TeV in the kinematic range of $0.15<p_{\rm T}<50$ GeV/$c$ and $|\eta|< 0.8$. A significant improvement of systematic uncertainties motivated the reanalysis of data in pp and Pb-Pb collisions at $\sqrt{s_{\rm NN}} = 2.76$ TeV, as well as in p-Pb collisions at $\sqrt{s_{\rm NN}} = 5.02$ TeV, which is also presented. Spectra from Pb-Pb collisions are presented in nine centrality intervals and are compared to a reference spectrum from pp collisions scaled by the number of binary nucleon-nucleon collisions. For cent…
The Bi sulfates from the Alfenza Mine, Crodo, Italy: An automatic electron diffraction tomography (ADT) study
2014
We report about three bismuth sulfates from mineralized quartz dikes from Alfenza (Crodo, Italy), two new phases and a rare mineral, cannonite, all growing on bismuthinite. The first new phase occurs as white, "hortensia-like" aggregates of pseudo-hexagonal platelets, with perfect basal cleavage, similar to 20 mu m wide and few micrometers thick. The approximate composition is Bi2O2(SO4), and cell parameters and symmetry, as determined by automatic diffraction tomography, are a = 22.0(4), b = 16.7(3), c = 15.9(3) angstrom, beta = 102.9(5)degrees, space group Pc or P2/c. A major stacking disorder is detected by HR-SEM images and electron diffraction data.The second new phase was detected onl…
Utility-based resource allocations in multi-hop wireless networks
2011
It is well known that CSMA (Carrier Sense Multiple Access) protocols exhibit very poor performance in case of multi-hop transmissions, because of inter-link interference due to imperfect carrier sensing. Since ad-hoc networks based on multihop packet deliveries are becoming more and more common in different application and networking scenarios, different medium access control extensions are currently considered for improving the channel utilization efficiency. In this paper, we propose a simple approach based on preallocating temporal slots in which different sets of nodes are allowed to contend for the channel access, which can significantly improve CSMA performance with limited signaling …