wanyu/IteraTeR_v2 huggingface dataset:
Original:  Formulating a regional mechanistic model of SARS-CoV-2 transmission dynamics and frequently estimating parameters of this model using streaming surveillance data offers one way to accomplish data-driven decision making.
Revised:  Formulating a regional mechanistic model of SARS-CoV-2 transmission dynamics and frequently estimating model parameters using streaming surveillance data offers one way to accomplish data-driven decision making.
Edit intent: clarity
Original:  To overcome this obstacle, at least partially, we propose a Bayesian modeling framework that integrates multiple surveillance data streams.
Revised:  To overcome this obstacle, we propose a Bayesian modeling framework that integrates multiple surveillance data streams.
Edit intent: clarity
Original:  In order to show that ULE can be implemented in practice, we present the design and evaluation of MicrOlonys , an end-to-end long-term database archival system that can be used to archive databases using visual analog media like film, microform, and archival paper.
Revised:  In order to show that ULE can be implemented in practice, we present the design and evaluation of Micr'Olonys , an end-to-end long-term database archival system that can be used to archive databases using visual analog media like film, microform, and archival paper.
Edit intent: fluency
Original:  This class of algebras were introduced by Haeberer and Veloso in the early 90's aiming at enriching relation algebra, an already successful language for program specification, with the capability of expressing some form of parallel computation.
Revised:  This class of algebras was introduced by Haeberer and Veloso in the early 90's aiming at enriching relation algebra, an already successful language for program specification, with the capability of expressing some form of parallel computation.
Edit intent: fluency
Original:  The further study of this class of algebras lead to many meaningful results linked to interesting properties of relation algebras such as representability and finite axiomatizability, among others.
Revised:  The further study of this class of algebras led to many meaningful results linked to interesting properties of relation algebras such as representability and finite axiomatizability, among others.
Edit intent: fluency
Original:  Also in the 90's, Veloso introduced a subclass of relation algebras that are expansible to fork algebras, admitting a large amount of non-isomorphic expansions, referred to as explosive relation algebras.
Revised:  Also in the 90's, Veloso introduced a subclass of relation algebras that are expansible to fork algebras, admitting a large number of non-isomorphic expansions, referred to as explosive relation algebras.
Edit intent: fluency
Original: Future integrated terrestrial-aerial-satellite networks will have to exhibit some unprecedented characteristics for the provision of both communications and computation services, and security for a tremendous number of devices with very broad and demanding requirements in an almost-ubiquitous manner .
Revised: Future integrated terrestrial-aerial-satellite networks will have to exhibit some unprecedented characteristics for the provision of both communications and computation services, and security for a tremendous number of devices with very broad and demanding requirements across multiple networks, operators, and ecosystems .
Edit intent: clarity
Original:  We introduce the novel concept of  self-evolving networks (SENs)  framework, which utilizes artificial intelligence, enabled by machine learning (ML) algorithms, to make future integrated networks fully intelligent and automated with respect to the provision, adaptation, optimization, and management aspects of networking, communications, and computation .
Revised:  We introduce the novel concept of " self-evolving networks (SENs) framework, which utilizes artificial intelligence, enabled by machine learning (ML) algorithms, to make future integrated networks fully intelligent and automated with respect to the provision, adaptation, optimization, and management aspects of networking, communications, and computation .
Edit intent: fluency
Original:  We introduce the novel concept of  self-evolving networks (SENs)  framework, which utilizes artificial intelligence, enabled by machine learning (ML) algorithms, to make future integrated networks fully intelligent and automated with respect to the provision, adaptation, optimization, and management aspects of networking, communications, and computation .
Revised:  We introduce the novel concept of self-evolving networks (SENs) " framework, which utilizes artificial intelligence, enabled by machine learning (ML) algorithms, to make future integrated networks fully intelligent and automated with respect to the provision, adaptation, optimization, and management aspects of networking, communications, and computation .
Edit intent: fluency
Original:  The paper discusses five prominent communications and computation scenarios where SEN plays the main role in providing automated network management.
Revised:  The paper discusses five prominent scenarios where SEN plays the main role in providing automated network management.
Edit intent: clarity
Original:  This paper presents an overview of the first international evaluation on sound event localization and detection, organized as a task of  DCASE 2019 Challenge.
Revised:  This paper presents an overview of the first international evaluation on sound event localization and detection, organized as a task of the DCASE 2019 Challenge.
Edit intent: fluency
Original:  \%Additionally, a competent baseline was provided to the participants.
Edit intent: coherence
Original:  Since ranking in the challenge was based on individually evaluating localization and event classification performance, part of the overview focuses on presenting metrics for the joint measurement of the two, together with a re-evaluation of submissions using these new metrics.
Revised:  Since ranking in the challenge was based on individually evaluating localization and event classification performance, part of the overview focuses on presenting metrics for the joint measurement of the two, together with a reevaluation of submissions using these new metrics.
Edit intent: fluency
Original:  The  analysis reveals submissions with balanced performance on classifying sounds correctly close to their original location , and systems being strong on one or both of the two tasks, but not jointly  .
Revised:  The analysis reveals submissions with balanced performance on classifying sounds correctly close to their original location , but not jointly .
Edit intent: clarity
Original: The temporal amplitude envelope of a signal is essential for its complete characterization, being the primary information-carrying medium in spoken voice and telecommunications, for example.
Edit intent: coherence
Original:  Envelope detection techniques have applications in areas like health , sound classification and synthesis, seismology and speech recognition.
Revised:  Envelope detection techniques have applications in areas like medicine , sound classification and synthesis, seismology and speech recognition.
Edit intent: clarity
Original:  Nevertheless, a general method to digital envelope detection of signals with rich spectral content doesn't exist, as most methods involve manual intervention, in the form of filter design, smoothing, as well as other specific design choices, based on a priori knowledge about the nature of the specific waves under investigation.
Revised:  Nevertheless, a general approach to digital envelope detection of signals with rich spectral content doesn't exist, as most methods involve manual intervention, in the form of filter design, smoothing, as well as other specific design choices, based on a priori knowledge about the nature of the specific waves under investigation.
Edit intent: clarity
Original:  Nevertheless, a general method to digital envelope detection of signals with rich spectral content doesn't exist, as most methods involve manual intervention, in the form of filter design, smoothing, as well as other specific design choices, based on a priori knowledge about the nature of the specific waves under investigation.
Revised:  Nevertheless, a general method to digital envelope detection of signals with rich spectral content doesn't exist, as most methods involve manual intervention, in the form of filter design, smoothing, and other specific design choices, based on a priori knowledge about the nature of the specific waves under investigation.
Edit intent: coherence
Original:  Nevertheless, a general method to digital envelope detection of signals with rich spectral content doesn't exist, as most methods involve manual intervention, in the form of filter design, smoothing, as well as other specific design choices, based on a priori knowledge about the nature of the specific waves under investigation.
Revised:  Nevertheless, a general method to digital envelope detection of signals with rich spectral content doesn't exist, as most methods involve manual intervention, in the form of filter design, smoothing, as well as other specific design choices, based on prior knowledge of the signals under investigation.
Edit intent: clarity
Original:  To address this problem, we propose a framework that uses intrinsic characteristics of a signal to estimate its envelope, completely eliminating the necessity of parameter tuning.
Revised:  To address this problem, we propose an algorithm that uses intrinsic characteristics of a signal to estimate its envelope, completely eliminating the necessity of parameter tuning.
Edit intent: clarity
Original:  To address this problem, we propose a framework that uses intrinsic characteristics of a signal to estimate its envelope, completely eliminating the necessity of parameter tuning.
Revised:  To address this problem, we propose a framework that uses intrinsic characteristics of a signal to estimate its envelope, eliminating the necessity of parameter tuning.
Edit intent: coherence
Original:  The approach here described draws inspiration from geometric concepts to isolate the frontiers and thus estimate the temporal envelope of an arbitrary signal;
Revised:  The approach here described draws inspiration from geometric concepts to estimate the temporal envelope of an arbitrary signal;
Edit intent: clarity
Original:  Specifically, a new measure of discrete curvature is used to obtain the average radius of curvature of a discrete wave, serving as a threshold to identify the wave's frontier points.
Revised:  Specifically, a new measure of discrete curvature is used to obtain the average radius of curvature of a discrete wave, that will serve as a threshold to identify the wave's frontier points.
Edit intent: clarity
Original:  The algorithm also compares favourably with classic envelope detection techniques based on  filtering and the Hilbert Transform  .
Revised:  The algorithm compares favourably with classic envelope detection techniques based on filtering and the Hilbert Transform .
Edit intent: clarity
Original: Social media play a pivotal role in shaping citizens  political opinion.
Revised: Social media play a key role in shaping citizens political opinion.
Edit intent: clarity
Original: Social media play a pivotal role in shaping citizens  political opinion.
Revised: Social media play a pivotal role in shaping citizens ' political opinion.
Edit intent: fluency
Original:  In this context, where attention has gone predominantly towards the study of online relations between users , semantic aspects have remained under-explored.
Revised:  In this context, attention has been predominantly directed towards the study of online relations between users , semantic aspects have remained under-explored.
Edit intent: clarity
Original:  In this context, where attention has gone predominantly towards the study of online relations between users , semantic aspects have remained under-explored.
Revised:  In this context, where attention has gone predominantly towards the study of online relations between users while semantic aspects have remained under-explored.
Edit intent: clarity
Original:  The entwinement between social media and the unfolding of political dynamics has motivated the interest of researchers for the analysis of users online behavior - with particular emphasis on group polarization during debates and echo-chambers formation.
Revised:  The entwinement between social media and the unfolding of political dynamics has motivated the interest of researchers for the analysis of users online behavior - with particular emphasis on group polarization during debates and echo-chambers formation.
Edit intent: fluency
Original:  Methods: Lower case-fatality ratio ( CFR, the proportion of deaths among all detected COVID-19 cases ) corresponds to higher detectability of the SARS-COV-2 infection .
Revised:  Methods: Lower case-fatality ratio ( i.e. the proportion of deaths among all detected COVID-19 cases ) corresponds to higher detectability of the SARS-COV-2 infection .
Edit intent: clarity
Original:  Methods: Lower case-fatality ratio ( CFR, the proportion of deaths among all detected COVID-19 cases ) corresponds to higher detectability of the SARS-COV-2 infection .
Revised:  Methods: Lower case-fatality ratio ( CFR, the proportion of detected COVID-19 cases ) corresponds to higher detectability of the SARS-COV-2 infection .
Edit intent: clarity
Original:  Methods: Lower case-fatality ratio ( CFR, the proportion of deaths among all detected COVID-19 cases ) corresponds to higher detectability of the SARS-COV-2 infection .
Revised:  Methods: Lower case-fatality ratio ( CFR, the proportion of deaths among all detected COVID-19 cases among all cases of SARS-CoV-2 infection in the population) .
Edit intent: clarity
Original:  The region with both the highest COVID-19 mortality rate per 100, 000 and the highest CFR (lowest detectability of SARS-CoV-2 infection) is the city of St.
Revised:  For several regions of the Russian Federation, particularly the city of St.
Edit intent: clarity
Original:  ought to increase testing for  SARS-CoV-2  in order to mitigate the spread of  SARS-CoV-2  and diminish the related mortality.
Revised:  ought to increase testing for the SARS-CoV-2 in order to mitigate the spread of SARS-CoV-2 and diminish the related mortality.
Edit intent: fluency
Original:  ought to increase testing for  SARS-CoV-2  in order to mitigate the spread of  SARS-CoV-2  and diminish the related mortality.
Revised:  ought to increase testing for SARS-CoV-2 in order to mitigate the spread of the SARS-CoV-2 and diminish the related mortality.
Edit intent: clarity
Original:  ought to increase testing for  SARS-CoV-2  in order to mitigate the spread of  SARS-CoV-2  and diminish the related mortality.
Revised:  ought to increase testing for SARS-CoV-2 in order to mitigate the spread of SARS-CoV-2 infection and diminish the related mortality.
Edit intent: clarity
Original:  Moreover, not all cases of the SARS-CoV-2 infection in the population are detected (laboratory diagnosed) .
Revised:  Practices for testing for SARS-CoV-2 infection in the population are detected (laboratory diagnosed) .
Edit intent: clarity
Original:  Additionally, we demonstrate that our method is robust against a range of local changes and denoising attacks.
Revised:  Additionally, we demonstrate that our method is robust against a range of attacks.
Edit intent: clarity
Original:  This result and the technique behind it---the Boolean Hidden Hypermatching communication problem---has since been used extensively for proving streaming lower bounds for various problems.
Revised:  This result and the technique behind it -- the Boolean Hidden Hypermatching communication problem---has since been used extensively for proving streaming lower bounds for various problems.
Edit intent: fluency
Original:  This result and the technique behind it---the Boolean Hidden Hypermatching communication problem---has since been used extensively for proving streaming lower bounds for various problems.
Revised:  This result and the technique behind it---the Boolean Hidden Hypermatching communication problem -- has since been used extensively for proving streaming lower bounds for various problems.
Edit intent: fluency
Original:  We prove the first multi-pass lower bound for the gap cycle counting problem: Any p-pass streaming algorithm that can distinguish between disjoint union of k-cycles vs 2k-cycles---or even k-cycles vs one Hamiltonian cycle---requires n^{1-1{k^{\Omega(1/p)}}} space.
Revised:  We prove the first multi-pass lower bound for the gap cycle counting problem: Any p-pass streaming algorithm that can distinguish between disjoint union of k-cycles vs 2k-cycles -- or even k-cycles vs one Hamiltonian cycle---requires n^{1-1{k^{\Omega(1/p)}}} space.
Edit intent: fluency
Original:  We prove the first multi-pass lower bound for the gap cycle counting problem: Any p-pass streaming algorithm that can distinguish between disjoint union of k-cycles vs 2k-cycles---or even k-cycles vs one Hamiltonian cycle---requires n^{1-1{k^{\Omega(1/p)}}} space.
Revised:  We prove the first multi-pass lower bound for the gap cycle counting problem: Any p-pass streaming algorithm that can distinguish between disjoint union of k-cycles vs 2k-cycles---or even k-cycles vs one Hamiltonian cycle -- requires n^{1-1{k^{\Omega(1/p)}}} space.
Edit intent: fluency
Original:  We then introduce a novel adaptive sampling scheme that breaks the `` additive error barrier '' of uniform sampling, guaranteeing multiplicative approximations instead of just additive ones.
Revised:  We then introduce a novel adaptive sampling scheme that breaks the " additive error barrier '' of uniform sampling, guaranteeing multiplicative approximations instead of just additive ones.
Edit intent: fluency
Original:  We then introduce a novel adaptive sampling scheme that breaks the `` additive error barrier '' of uniform sampling, guaranteeing multiplicative approximations instead of just additive ones.
Revised:  We then introduce a novel adaptive sampling scheme that breaks the `` additive error barrier " of uniform sampling, guaranteeing multiplicative approximations instead of just additive ones.
Edit intent: fluency
Original: A general quantum circuit can be simulated  in exponential time on a classical computer .
Revised: A general quantum circuit can be simulated classically in exponential time on a classical computer .
Edit intent: coherence
Original: A general quantum circuit can be simulated  in exponential time on a classical computer .
Revised: A general quantum circuit can be simulated in exponential time .
Edit intent: clarity
Original:  A key ingredient is a mapping which, given a tree decomposition of some graph G, produces a Clifford circuit with a structure that mirrors the tree decomposition and which emulates measurement of the quantum graph statecorresponding to G . We provide a classical simulation of this circuit with the runtime stated above for planar graphs and otherwise n t ^{\omega-1} where t is the width of the tree decomposition.
Revised:  A key ingredient is a mapping which, given a tree decomposition of some graph G, produces a Clifford circuit with a structure that mirrors the tree decomposition and which emulates measurement of the corresponding graph state . We provide a classical simulation of this circuit with the runtime stated above for planar graphs and otherwise n t ^{\omega-1} where t is the width of the tree decomposition.
Edit intent: clarity
Original:  A key ingredient is a mapping which, given a tree decomposition of some graph G, produces a Clifford circuit with a structure that mirrors the tree decomposition and which emulates measurement of the quantum graph statecorresponding to G . We provide a classical simulation of this circuit with the runtime stated above for planar graphs and otherwise n t ^{\omega-1} where t is the width of the tree decomposition.
Revised:  A key ingredient is a mapping which, given a tree decomposition of some graph G, produces a Clifford circuit with a structure that mirrors the tree decomposition and which emulates measurement of the quantum graph statecorresponding to G . We provide a classical simulation of this circuit with the runtime stated above for planar graphs and otherwise nt ^{\omega-1} where t is the width of the tree decomposition.
Edit intent: fluency
Original:  However, on every one of the 57 tasks, the best models still need substantial improvements before they can reach human-level accuracy.
Revised:  However, on every one of the 57 tasks, the best models still need substantial improvements before they can reach expert-level accuracy.
Edit intent: clarity
Original:  Complex analyses are realized in the Conquery frontend by dragging tree nodes into the query editor .
Revised:  Complex analyses can be realized in a web-frontend without necessitating deep knowledge of the underlying data and structure .
Edit intent: clarity
Original:  Queries are evaluated by a bespoke distributed query-engine for medical records in a column-oriented fashion .
Revised:  Queries are evaluated by a bespoke distributed query-engine for medical records .
Edit intent: clarity
Original:  We present a custom compression scheme to facilitate low response times that uses online calculated as well as precomputed metadata and data statistics.
Revised:  We present a custom compression scheme to facilitate low response times that uses online calculated as well as precomputed metadata and statistics.
Edit intent: fluency
Original:  Conclusions: Conquery is an efficient and intuitive open source software for performant and secure data analysis and aims at supporting decision-making processes in the healthcare sector  .
Revised:  Conclusions: Conquery enables users fast queries and analysis of large datasets without requiring technical expertise. This reduces the technical burden in the decision-making processes in the healthcare sector .
Edit intent: clarity
Original: We study optimal dynamic portfolio choice of a long-horizon investor who uses deep learning methods to predict equity returns when forming optimal portfolios.
Revised: We study dynamic portfolio choice of a long-horizon investor who uses deep learning methods to predict equity returns when forming optimal portfolios.
Edit intent: clarity
Original:  The results show statistically and economically significant out-of-sample portfolio benefits of deep learning as measured by high certainty equivalent returns and Sharpe ratios.
Revised:  Our results show statistically and economically significant out-of-sample portfolio benefits of deep learning as measured by high certainty equivalent returns and Sharpe ratios.
Edit intent: fluency
Original:  The results show statistically and economically significant out-of-sample portfolio benefits of deep learning as measured by high certainty equivalent returns and Sharpe ratios.
Revised:  The results show statistically and economically significant benefits from using deep learning to form optimal portfolios through certainty equivalent returns and Sharpe ratios.
Edit intent: clarity
Original:  Return predictability via deep learning  generates substantially improved portfolio performance across different subsamples, particularly the recession periods.
Revised:  Return predictability via deep learning also generates substantially improved portfolio performance across different subsamples, particularly the recession periods.
Edit intent: clarity
Original:  Return predictability via deep learning  generates substantially improved portfolio performance across different subsamples, particularly the recession periods.
Revised:  Return predictability via deep learning generates substantially improved portfolio performance across different subsamples, particularly during recessionary periods.
Edit intent: clarity
Original:   Return predictability via deep learning also generates substantially improved portfolio performance across different subsamples, particularly during recessionary periods.
Revised:  Return predictability via deep learning generates substantially improved portfolio performance across different subsamples, particularly during recessionary periods.
Edit intent: clarity