wanyu/IteraTeR_v2 huggingface dataset:
Original:  We generated a range of short term forecasts for Guinea, Liberia, and Sierra Leone, which we then validated using subsequent data.
Revised:  We generated a range of short-term forecasts for Guinea, Liberia, and Sierra Leone, which we then validated using subsequent data.
Edit intent: fluency
Original:  However, by including the correction factor term for fraction of the population at risk and reporting fraction, the best-fit models correctly forecasted EVD activity for all three countries, both individually and for all countries combined.
Revised:  However, by including the correction factor term the best-fit models correctly forecasted EVD activity for all three countries, both individually and for all countries combined.
Edit intent: clarity
Original:  In particular, the models correctly forecasted the slow-down and stabilization in Liberiabut continued exponential growth in Sierra Leone through November 2014.
Revised:  In particular, the model correctly forecasted the slow-down and stabilization in Liberiabut continued exponential growth in Sierra Leone through November 2014.
Edit intent: fluency
Original:  In particular, the models correctly forecasted the slow-down and stabilization in Liberiabut continued exponential growth in Sierra Leone through November 2014.
Revised:  In particular, the models correctly forecasted the slow-down in Liberia, as well as the continued exponential growth in Sierra Leone through November 2014.
Edit intent: clarity
Original:  However, these forecasting results illustrate how, even with only limited data,  it is still possible to accurately capture and predict the epidemic dynamics by using a simplified correction term which approximately accounts for the complex underlying factors driving disease spread.
Revised:  Even with these limited data, it is still possible to accurately capture and predict the epidemic dynamics by using a simplified correction term which approximately accounts for the complex underlying factors driving disease spread.
Edit intent: clarity
Original:  However, these forecasting results illustrate how, even with only limited data,  it is still possible to accurately capture and predict the epidemic dynamics by using a simplified correction term which approximately accounts for the complex underlying factors driving disease spread.
Revised:  However, these forecasting results illustrate how, even with only limited data, it is still possible to accurately capture and predict the epidemic dynamics by using a simplified correction term that approximately accounts for the complex underlying factors driving disease spread.
Edit intent: fluency
Original:  Alternatively, one can develop dedicated dynamic procedures, so that multiple snapshots are simultaneously taken into account while detecting communities, which allows  to keep memory of the flow.
Revised:  Alternatively, one can develop dedicated dynamic procedures, so that multiple snapshots are simultaneously taken into account while detecting communities, which allows us to keep memory of the flow.
Edit intent: coherence
Original:  Knape and Korner-Nievergelt (2015) criticized single-visit methods as statistically non-identifiable leading to biased population estimates.
Revised:  Knape and Korner-Nievergelt (2015) criticized single-visit methods are statistically non-identifiable leading to biased population estimates.
Edit intent: fluency
Original:  (3) We extend  single-visit methodology for Binomial-Binomial-Poisson .
Revised:  (3) We extend the single-visit methodology for Binomial-Binomial-Poisson .
Edit intent: fluency
Original: (1) Models accounting for imperfect detection are increasingly important.
Revised:  Models accounting for imperfect detection are increasingly important.
Edit intent: clarity
Original: (1) Models accounting for imperfect detection are increasingly important.
Revised: (1) Models accounting for imperfect detection are important.
Edit intent: clarity
Original:  Knape and Korner-Nievergelt (2015) correctly showed that under certain models of probability of detection single-visit methods are statistically non-identifiable leading to biased population estimates.
Revised:  Knape and Korner-Nievergelt (2015) showed that under certain models of probability of detection single-visit methods are statistically non-identifiable leading to biased population estimates.
Edit intent: coherence
Original:  To address this problem we develop an approach to correct CTF parameters measured from distorted  images.
Revised:  To address this problem we develop an approach to adjust CTF parameters measured from distorted images.
Edit intent: clarity
Original:  Rotation of 2-D images is usually done with the assumption that the magnification of the electron microscope is the same in all directions.
Revised:  Rotation of 2D images is usually done with the assumption that the magnification of the electron microscope is the same in all directions.
Edit intent: fluency
Original:  Correction of images by linear interpolation in real space has allowed high-resolution structures to be calculated from cryo-EM images for symmetric particles (Grant and Grigorieff, in preparation) .
Revised:  Correction of images by linear interpolation in real space has allowed high-resolution structures to be calculated from cryo-EM images for symmetric particles .
Edit intent: coherence
Original:  Here we describe and compare a simple real space method  and a somewhat more sophisticated Fourier space method to correct images for a measured anisotropy in magnification.
Revised:  Here we describe and compare a simple real space method , a simple Fourier space method, and a somewhat more sophisticated Fourier space method to correct images for a measured anisotropy in magnification.
Edit intent: fluency
Original:  The deduction of the effective connectivity between neurons, whose experimental spike trains are observed, is of crucial importance in neuroscience: first for the correct interpretation of the electrophysiological activity of the involved neurons and neural networks, and, for correctly relating the electrophysiological activity to the functional tasks accomplished by the network.
Revised:  The deduction of the effective connectivity between neurons, whose experimental spike trains are observed, is of crucial importance in neuroscience: first for the correct interpretation of the electro-physiological activity of the involved neurons and neural networks, and, for correctly relating the electrophysiological activity to the functional tasks accomplished by the network.
Edit intent: fluency
Original:  Our approach is based on the assumptions that the network has a topology with sparse connection .
Revised:  Our approach is based on the assumption that the network has a topology with sparse connection .
Edit intent: fluency
Original:  Our approach is based on the assumptions that the network has a topology with sparse connection .
Revised:  Our approach is based on the assumptions that the network has a topology with sparse connections .
Edit intent: fluency
Original:  This paper takes the first step in characterising these languages by showing that an important subclass of ! -graphs---those whose repeated structures only overlap trivially---can be encoded using a (context-free) vertex replacement grammar.
Revised:  This paper takes the first step in characterising these languages by showing that an important subclass of ! -graphs--those whose repeated structures only overlap trivially---can be encoded using a (context-free) vertex replacement grammar.
Edit intent: fluency
Original:  This paper takes the first step in characterising these languages by showing that an important subclass of ! -graphs---those whose repeated structures only overlap trivially---can be encoded using a (context-free) vertex replacement grammar.
Revised:  This paper takes the first step in characterising these languages by showing that an important subclass of ! -graphs---those whose repeated structures only overlap trivially--can be encoded using a (context-free) vertex replacement grammar.
Edit intent: fluency
Original:  Our results confirm the "spectral redemption conjecture "  that community detection can be made on the basis of the leading eigenvectors above the feasibility threshold.
Revised:  Our results confirm the "spectral redemption " that community detection can be made on the basis of the leading eigenvectors above the feasibility threshold.
Edit intent: clarity
Original: Locating the sources that trigger a dynamical process is a fundamental but challenging problem in complex networks, ranging from epidemic spreading in society and on the Internet to cancer metastasis in the human body.
Revised: Locating the source that triggers a dynamical process is a fundamental but challenging problem in complex networks, ranging from epidemic spreading in society and on the Internet to cancer metastasis in the human body.
Edit intent: fluency
Original:  An accurate localization of the source is inherently limited by our ability to simultaneously access the information of all nodes in a large-scale complex network , such as the time at which each individual is infected in a large population .
Revised:  An accurate localization of the source is inherently limited by our ability to simultaneously access the information of all nodes in a large-scale complex network .
Edit intent: clarity
Original:  This thus raises two critical questions: how do we locate the source from incomplete information and can we achieve full localization of sources at any possible location from a given set of observers .
Revised:  This thus raises two critical questions: how do we locate the source from incomplete information and can we achieve full localization of sources at any possible location from a given set of observable nodes .
Edit intent: clarity
Original:  Here we develop an efficient algorithm to locate the source of a diffusion-like process  and propose a general locatability condition.
Revised:  Here we develop an efficient algorithm to locate the source of a diffusion-like process efficiently and propose a general locatability condition.
Edit intent: clarity
Original:  Moreover  they have implications for controlling a variety of dynamical processes taking place on complex networks, such as inhibiting epidemics, slowing the spread of rumors, and eliminating cancer seed cells in the human body .
Revised:  Moreover , they have implications for controlling a variety of dynamical processes taking place on complex networks, such as inhibiting epidemics, slowing the spread of rumors, and eliminating cancer seed cells in the human body .
Edit intent: fluency
Original: The stability region of the two-user broadcast channel is characterized in this paper.
Revised: In this paper, we characterize the stability region of the two-user broadcast channel is characterized in this paper.
Edit intent: clarity
Original:  Furthermore , we consider the particular case where each receiver treats the interfering signal as noise, as well as the case where the transmitter sends the packets using superposition coding and successive decoding is employed at the strong receiver.
Revised:  Furthermore , we consider the particular case where each receiver treats the interfering signal as noise, as well as the case in which the packets are transmitted using superposition coding and successive decoding is employed at the strong receiver.
Edit intent: clarity
Original:  This evaluation is reduced to the identification of the zero-points of entropy (complexity) , which is defined for submatrices that are composed of columns selected from a given measurement matrix.
Revised:  This evaluation is reduced to the identification of the zero-points of entropy , which is defined for submatrices that are composed of columns selected from a given measurement matrix.
Edit intent: clarity
Original: We present an analysis on data citation practices based on the Data Citation Index from Thomson Reuters.
Revised: We present an analysis of data citation practices based on the Data Citation Index from Thomson Reuters.
Edit intent: fluency
Original:  This database launched in 2012 aims to link data sets and data studies with citations received from the rest of their citation indexes.
Revised:  This database launched in 2012 aims to link data sets and data studies with citations received from the other citation indexes.
Edit intent: clarity
Original:  Funding bodies and research organizations are increasingly demanding the need of researchers to make their scientific data available in a reusable and reproducible manner, aiming to maximize the allocation of funding while providing transparency on the scientific process.
Edit intent: coherence
Original:   88.1 percent of the records have received no citations , but some repositories show very low uncitedness rates.
Revised:  A total of 88.1 percent of the records have received no citations , but some repositories show very low uncitedness rates.
Edit intent: clarity
Original:   88.1 percent of the records have received no citations , but some repositories show very low uncitedness rates.
Revised:  88.1 percent of the records have received no citation , but some repositories show very low uncitedness rates.
Edit intent: style
Original:  While data citation practices are rare in most fields, they have expanded in disciplines such as Crystallography or Genomics .
Revised:  Although data citation practices are rare in most fields, they have expanded in disciplines such as Crystallography or Genomics .
Edit intent: fluency
Original:  While data citation practices are rare in most fields, they have expanded in disciplines such as Crystallography or Genomics .
Revised:  While data citation practices are rare in most fields, they have expanded in disciplines such as crystallography and genomics .
Edit intent: fluency
Original:  We conclude by emphasizing the role that the DCI could play in encouraging the consistent, standardized citation of research data - a role that would enhance its value as a means of following the research process from data collection to publication.
Revised:  We conclude by emphasizing the role that the DCI could play in encouraging the consistent, standardized citation of research data ; a role that would enhance its value as a means of following the research process from data collection to publication.
Edit intent: fluency
Original:  We conclude by emphasizing the role that the DCI could play in encouraging the consistent, standardized citation of research data - a role that would enhance its value as a means of following the research process from data collection to publication.
Revised:  We conclude by emphasizing the role that the DCI could play in encouraging the consistent, standardized citation of research data - a role that would enhance their value as a means of following the research process from data collection to publication.
Edit intent: clarity
Original: This paper investigates a variant of the Hamiltonian Cycle (HC) problem, named the Parity Hamiltonian Cycle (PHC) problem: The problem is to find a closed walk visiting each vertex odd number of times, instead of exactly once.
Revised: This paper investigates a variant of the Hamiltonian Cycle (HC) problem, named the Parity Hamiltonian Cycle (PHC) problem: The problem is to find a closed walk which visits every vertex an odd number of times, instead of exactly once.
Edit intent: clarity
Original:  We show that the PHC problem is in P even when a closed walk is allowed to use an edge at most z  = 4 times , by considering a T-join,which is a generalization of matching.
Revised:  We show that the PHC problem is in P even when a closed walk is allowed to use each edge at most z = 4 times , by considering a T-join,which is a generalization of matching.
Edit intent: clarity
Original:  Thus , we are concerned with the hard case in detail, and give a simple necessary and sufficient condition that a two-edge connected C> =5-free ( or P6-free ) graph has a PHC . Note that the HC problem is known to be NP-complete for those graph classes .
Revised:  Thus , we are concerned with the hard case in detail, and give a simple necessary and sufficient condition that a two-edge connected C> =5-free or P6-free ) graph has a PHC . Note that the HC problem is known to be NP-complete for those graph classes .
Edit intent: fluency
Original:  Thus , we are concerned with the hard case in detail, and give a simple necessary and sufficient condition that a two-edge connected C> =5-free ( or P6-free ) graph has a PHC . Note that the HC problem is known to be NP-complete for those graph classes .
Revised:  Thus , we are concerned with the hard case in detail, and give a simple necessary and sufficient condition that a two-edge connected C> =5-free ( or P6-free graphs . Note that the HC problem is known to be NP-complete for those graph classes .
Edit intent: clarity
Original: Cross-correlation is a popular signal processing technique used in numerous localization and tracking systems for obtaining reliable range information.
Revised: Cross-correlation is a popular signal processing technique used in numerous location tracking systems for obtaining reliable range information.
Edit intent: clarity
Original:  However, a practical efficient implementation has not yet been achieved on resource constrained wireless sensor network platforms .
Revised:  However, its efficient design and practical implementation has not yet been achieved on resource constrained wireless sensor network platforms .
Edit intent: clarity
Original:  However, a practical efficient implementation has not yet been achieved on resource constrained wireless sensor network platforms .
Revised:  However, a practical efficient implementation has not yet been achieved on resource constrained wireless sensor network due to resource constrains .
Edit intent: clarity
Original:  Compared to  standard cross-correlation, SparseXcorr uses only 30-40\% measurements to obtain precise range estimates with an additional bias of only 2-6 cm for applications with high accuracy requirement;
Revised:  Compared to standard cross-correlation, it is able to obtain range estimates with an additional bias of only 2-6 cm for applications with high accuracy requirement;
Edit intent: clarity
Original:  It is known that every first order convergent sequence of graphs with bounded tree-depth has an analytic limit object called a limit modeling.
Revised:  It is known that every first order convergent sequence of graphs with bounded tree-depth can be represented by an analytic limit object called a limit modeling.
Edit intent: clarity
Original:  We also compare results with respect to robust optimization methods that consider cardinality constrained uncertainty sets.
Edit intent: coherence
Original:  Numerical results on an illustrative example, the IEEE-24 and IEEE 118-bus test systems demonstrate that the algorithm is comparable in terms of computational performance with respect to existing robust methods with the additional advantage that the correlation structure of the uncertain variables involved can be incorporated straightforwardly .
Revised:  Numerical results from several case studies demonstrate that the algorithm is comparable in terms of computational performance with respect to existing robust methods with the additional advantage that the correlation structure of the uncertain variables involved can be incorporated straightforwardly .
Edit intent: clarity
Original:  Numerical results on an illustrative example, the IEEE-24 and IEEE 118-bus test systems demonstrate that the algorithm is comparable in terms of computational performance with respect to existing robust methods with the additional advantage that the correlation structure of the uncertain variables involved can be incorporated straightforwardly .
Revised:  Numerical results on an illustrative example, the IEEE-24 and IEEE 118-bus test systems demonstrate that the effect of correlated uncertainty can be captured by the proposed robust approach .
Edit intent: clarity
Original: Numerical continuation methods apply predictor-corrector algorithms to track a solution path defined by a family of systems, the so-called homotopy.
Revised: Numerical continuation methods track a solution path defined by a family of systems, the so-called homotopy.
Edit intent: clarity
Original: Numerical continuation methods apply predictor-corrector algorithms to track a solution path defined by a family of systems, the so-called homotopy.
Revised: Numerical continuation methods apply predictor-corrector algorithms to track a solution path defined by a homotopy.
Edit intent: clarity
Original: This paper describes maxDNN, a computationally efficient convolution kernel for deep learning with the NVIDIA Maxwell GPU. maxDNN reaches 96.3\% computational efficiency on typical deep learning network architectures using a single kernel .
Revised: This paper describes maxDNN, a computationally efficient convolution kernel for deep learning with the NVIDIA Maxwell GPU. maxDNN reaches 96.3\% computational efficiency on typical deep learning network architectures .
Edit intent: clarity
Original:  Simulations are often parameter dependent and fall short of providing a complete understanding of the full range of  system responses.
Revised:  Simulations are often parameter dependent and may not be able to provide an understanding of the full range of system responses.
Edit intent: clarity
Original:  Simulations are often parameter dependent and fall short of providing a complete understanding of the full range of  system responses.
Revised:  Simulations are often parameter dependent and fall short of providing a complete understanding of the full range of the system responses.
Edit intent: fluency
Original: This work explores the edge agreement problem of the second-order nonlinear multi-agent system under quantized measurements.
Revised: This work explores the edge agreement problem of second-order nonlinear multi-agent system under quantized measurements.
Edit intent: fluency
Original:  Meanwhile, the edge agreement problem of second-order nonlinear multi-agent system under quantized effects is studied, in which both uniform and logarithmic quantizers are considered.
Revised:  The quantized edge agreement problem of second-order nonlinear multi-agent system under quantized effects is studied, in which both uniform and logarithmic quantizers are considered.
Edit intent: clarity
Original:  Meanwhile, the edge agreement problem of second-order nonlinear multi-agent system under quantized effects is studied, in which both uniform and logarithmic quantizers are considered.
Revised:  Meanwhile, the edge agreement problem of second-order nonlinear multi-agent system is studied, in which both uniform and logarithmic quantizers are considered.
Edit intent: clarity
Original:   Particularly, for the uniform quantizers, we provide the upper bound of the radius of the agreement neighborhood , which indicates that the radius increases with the quantization interval.
Revised:  Particularly, for uniform quantizers, we provide the upper bound of the radius of the agreement neighborhood , which indicates that the radius increases with the quantization interval.
Edit intent: fluency
Original:   Particularly, for the uniform quantizers, we provide the upper bound of the radius of the agreement neighborhood , which indicates that the radius increases with the quantization interval.
Revised:  Particularly, for the uniform quantizers, we provide the upper bound of the radius of the agreement neighborhood and indicate that the radius increases with the quantization interval.
Edit intent: clarity
Original:  While for the logarithmic quantizers, the agents converge exponentially to the desired agreement equilibrium.
Revised:  While for logarithmic quantizers, the agents converge exponentially to the desired agreement equilibrium.
Edit intent: fluency
Original:  Additionally, we also provide the estimates of the convergence rate as well as indicate that the coarser the quantizer is, the slower the convergence speed .
Revised:  Additionally, we also provide the estimates of the convergence rate .
Edit intent: clarity