wanyu/IteraTeR_v2 huggingface dataset:
Original:  We adapt a standard statistical technique, expectation maximization (EM) , in a form previously developed for pandemic influenzas to correct for time- and severity- dependent reporting in the estimated CFR of COVID-19 . Code is available at URL . Findings: We find that the na\"{ive estimator of CFR is asymptotically biased for the true CFR.
Revised:  We adapt a standard statistical technique, expectation maximization (EM) , in a form previously developed for pandemic influenzas to correct for time- and severity- dependent reporting in the estimated CFR of COVID-19 ve estimator of CFR is asymptotically biased for the true CFR.
Edit intent: coherence
Original: The relative CFRs between groups and countries are key ratios that guide policy decisions regarding scarce medical resource allocation  .
Revised: The relative CFRs between groups and countries are key measures of relative risk that guide policy decisions regarding scarce medical resource allocation .
Edit intent: clarity
Original:   Our analysis is supplemented by numerical results and an open-source implementation URL . This should enable epidemiologists and other analysts to fit likelihood-based models similar to the ones we propose as remedies for the biased nature of naive CFR estimates, permitting more accurate planning of medical resource distribution .
Revised:  Our analysis is supplemented by numerical results and an open-source codebase at URL .
Edit intent: clarity
Original: The relative case fatality ratios (CFRs) between groups and countries are key measures of relative risk that guide policy decisions regarding scarce medical resource allocation during the ongoing COVID-19 pandemic.
Revised: The relative case fatality rates (CFRs) between groups and countries are key measures of relative risk that guide policy decisions regarding scarce medical resource allocation during the ongoing COVID-19 pandemic.
Edit intent: clarity
Original:  In the middle of an active outbreak when surveillance data is the primary source of information, estimating these quantities involves compensating for competing biases in time series of deaths, cases  and recoveries.
Revised:  In the middle of an active outbreak when surveillance data is the primary source of information, estimating these quantities involves compensating for competing biases in time series of deaths, cases , and recoveries.
Edit intent: fluency
Original:  These include time- and severity- dependent reporting of cases as well as time-lags in observed patient outcomes.
Revised:  These include time- and severity- dependent reporting of cases as well as time lags in observed patient outcomes.
Edit intent: fluency
Original:  We detail such biases and their signifcance in the context of COVID-19 CFR estimation .
Revised:  In the context of COVID-19 CFR estimation .
Edit intent: clarity
Original: We consider adaptive scattered data fitting schemes with truncated hierarchical B-splines (THB-splines) based on two-stage methods for the adaptive reconstruction of industrial models.
Revised: We consider two-stage scattered data fitting schemes with truncated hierarchical B-splines (THB-splines) based on two-stage methods for the adaptive reconstruction of industrial models.
Edit intent: fluency
Original: We consider adaptive scattered data fitting schemes with truncated hierarchical B-splines (THB-splines) based on two-stage methods for the adaptive reconstruction of industrial models.
Revised: We consider adaptive scattered data fitting with truncated hierarchical B-splines (THB-splines) based on two-stage methods for the adaptive reconstruction of industrial models.
Edit intent: clarity
Original: We consider adaptive scattered data fitting schemes with truncated hierarchical B-splines (THB-splines) based on two-stage methods for the adaptive reconstruction of industrial models.
Revised: We consider adaptive scattered data fitting schemes with truncated hierarchical B-splines (THB-splines) for the adaptive reconstruction of industrial models.
Edit intent: clarity
Original:  A simple fairness functional is suitably exploited to handle data distributions with a  varying density of points locally available .
Revised:  A simple fairness functional to handle data distributions with a varying density of points locally available .
Edit intent: clarity
Original:  A simple fairness functional is suitably exploited to handle data distributions with a  varying density of points locally available .
Revised:  A simple fairness functional is suitably exploited to handle data distributions with a varying density of points .
Edit intent: clarity
Original:  Hierarchical spline quasi-interpolation based on THB-splines is considered in the second stage of the method to construct the adaptive spline surface approximating the  scattered data set  .
Revised:  Hierarchical spline quasi-interpolation based on THB-splines is considered in the second stage of the method to construct the adaptive spline surface approximating the whole scattered data set .
Edit intent: clarity
Original:  A selection of examples on geometric models representing components of aircraft turbine blades highlights the performance of the scheme.
Revised:  A selection of examples on geometric models representing components of aircraft turbine blades highlights the performances of the scheme.
Edit intent: fluency
Original:  Herein, we propose a convolutional neural network (CNN) - based patent image retrieval method.
Revised:  Herein, we propose a convolutional neural network (CNN) -based patent image retrieval method.
Edit intent: fluency
Original:  The core of this approach is a novel neural network architecture named Dual-VGG that is aimed to accomplish two tasks: visual material type prediction and International Patent Classification (IPC) class label prediction.
Revised:  The core of this approach is a novel neural network architecture named Dual-VGG that is aimed to accomplish two tasks: visual material type prediction and international patent classification (IPC) class label prediction.
Edit intent: fluency
Original:  We validate our method with simulated data and demonstrate that the method reliably detects the presence or absence of long-range cell-cell interactions.
Revised:  We validate our method with simulated data , demonstrating that it reliably detects the presence or absence of long-range cell-cell interactions.
Edit intent: clarity
Original:  We validate our method with simulated data and demonstrate that the method reliably detects the presence or absence of long-range cell-cell interactions.
Revised:  We validate our method with simulated data and demonstrate that the method reliably detects the presence or absence of remote cell-cell interactions.
Edit intent: clarity
Original:   We provide a freely available Python implementation of the p-value method that may serve as a general tool for extracting the interaction rules in collective systems of self-driven agents.
Revised:  We provide a freely available Python implementation of our p-value method that may serve as a general tool for extracting the interaction rules in collective systems of self-driven agents.
Edit intent: clarity
Original:   We provide a freely available Python implementation of the p-value method that may serve as a general tool for extracting the interaction rules in collective systems of self-driven agents.
Revised:  We provide a freely available Python implementation of the p-value method that can serve as a general tool for extracting the interaction rules in collective systems of self-driven agents.
Edit intent: clarity
Original:   We provide a freely available Python implementation of the p-value method that may serve as a general tool for extracting the interaction rules in collective systems of self-driven agents.
Revised:  We provide a freely available Python implementation of the p-value method that may serve as a general tool for detecting long-range interactions in collective systems of self-driven agents.
Edit intent: clarity
Original:  Specifically, we consider that message lengths are kept unchanged when they traverse from node to node in a network, This scenario breaks Kleinrock's independence assumption but corresponds to actual scenarios.
Revised:  Specifically, we consider that message lengths are kept unchanged when they traverse from node to node in a network, which is an Alternative to Kleinrock's independence assumption but corresponds to actual scenarios.
Edit intent: clarity
Original:  early on even if it seems disproportionate at the time , to forego the likely need for future drastic measures .
Revised:  early on even if it seems disproportionate at the time of the implementation of this containment strategy .
Edit intent: clarity
Original: A pandemic creates a challenging situation where governing authorities are faced with the complex decision of what the appropriate measures are given the existing information.
Edit intent: coherence
Original:  Our proposed strategy involves partitioning the population into smaller isolated sub-populations within which, while social distancing is practised as much as possible to reduce the contact rate, a relatively normal lifestyle is maintained.
Revised:  Our proposed strategy involves partitioning the population into smaller isolated sub-populations within which, while social distancing is practiced as much as possible to reduce the contact rate, a relatively normal lifestyle is maintained.
Edit intent: fluency
Original:  We generalize this approach to guarantee local entropy inequalities for finitely many convex functionals (entropies) and apply the resulting methods to the compressible Euler and Navier-Stokes equations.
Revised:  Here, we generalize this approach to guarantee local entropy inequalities for finitely many convex functionals (entropies) and apply the resulting methods to the compressible Euler and Navier-Stokes equations.
Edit intent: coherence
Original:  It consists of a system of nonlinear parabolic equations, where the unknowns are the average density of cells (or organisms), which is a conserved variable, and the average density of chemioattranct .
Revised:  It consists of a system of nonlinear parabolic equations, where the unknowns are the average density of cells (or organisms), which is a conserved variable, and the average density of chemoattractant .
Edit intent: fluency
Original:  The approximate solutions keep lower bounds -- positivity for the cell density and nonnegativity for the chemioattranct density --, are mass conservative , satisfy a discrete energy law, and have \emph{ a priori} energy estimates.
Revised:  The approximate solutions keep lower bounds -- positivity for the cell density and nonnegativity for the chemoattractant density --, are mass conservative , satisfy a discrete energy law, and have \emph{ a priori} energy estimates.
Edit intent: fluency
Original: First-order methods (FOMs) have been widely used for  large-scale problems.
Revised: First-order methods (FOMs) have been widely used for solving large-scale problems.
Edit intent: clarity
Original:  It is a straightforward generalization of that by Rockafellar'73, MathProg%DIFDELCMD < ]%%% , which studied problems with only inequality constraints.
Revised:  It is a straightforward generalization of that by %DIFDELCMD < ]%%% , which studied problems with only inequality constraints.
Edit intent: coherence
Original:  On approximately solving PP subproblems, it mixes the  inexact AL method (iALM) and the quadratic penalty method, while the latter is always fed with estimated multipliers by the iALM.
Revised:  On approximately solving PP subproblems, it mixes the usage of the inexact AL method (iALM) and the quadratic penalty method, while the latter is always fed with estimated multipliers by the iALM.
Edit intent: clarity
Original:  Numerical experiments are conducted on convex quadratically constrained quadratic programs and nonconvex linearly constrained quadratic programs  .
Revised:  Numerical experiments are conducted on nonconvex linearly constrained quadratic programs .
Edit intent: coherence
Original: In a recent paper, Beniamini and Nisan \mbox{ Beniamini2020bipartite gave a closed-form formula for the unique multilinear polynomial for the Boolean function determining whether a given bipartite graph G \subseteq K_{n,n} has a perfect matching, together with an efficient algorithm for computing its terms .
Revised: In a recent paper, Beniamini and Nisan gave a closed-form formula for the unique multilinear polynomial for the Boolean function determining whether a given bipartite graph G \subseteq K_{n,n} has a perfect matching, together with an efficient algorithm for computing its terms .
Edit intent: clarity
Original: In a recent paper, Beniamini and Nisan \mbox{ Beniamini2020bipartite gave a closed-form formula for the unique multilinear polynomial for the Boolean function determining whether a given bipartite graph G \subseteq K_{n,n} has a perfect matching, together with an efficient algorithm for computing its terms .
Revised: In a recent paper, Beniamini and Nisan \mbox{ Beniamini2020bipartite gave a closed-form formula for the unique multilinear polynomial for the Boolean function determining whether a given bipartite graph G \subseteq K_{n,n} has a perfect matching, together with an efficient algorithm for computing the coefficients of the monomials of this polynomial .
Edit intent: clarity
Original:  This allows our algorithm to depend on the \ell _\infty norm as opposed to the \ell_4 norm when bounding the amount of weight perturbation needed .
Revised:  This allows our algorithm to avoid dependencies on the \ell _\infty norm as opposed to the \ell_4 norm when bounding the amount of weight perturbation needed .
Edit intent: clarity
Original: Minimizing  Gaussian curvature of meshes is fundamentally important for obtaining smooth and developable surfaces .
Revised: Minimizing the Gaussian curvature of meshes is fundamentally important for obtaining smooth and developable surfaces .
Edit intent: fluency
Original: Minimizing  Gaussian curvature of meshes is fundamentally important for obtaining smooth and developable surfaces .
Revised: Minimizing Gaussian curvature of meshes can play a fundamental role in 3D mesh processing .
Edit intent: clarity
Original:  We first present the mathematical foundation of our method , which states that for any point on a developable surface there must be another point that lives on its tangent plane .
Revised:  We first present the mathematical foundation of our method .
Edit intent: coherence
Original:  Then, based on this theoretical insight, we introduce a simple and robust implicit Gaussian curvature optimization method named Gaussian Curvature Filter (GCF).
Revised:  Then, we introduce a simple and robust implicit Gaussian curvature optimization method named Gaussian Curvature Filter (GCF).
Edit intent: clarity
Original:  We present extensive experiments to demonstrate that GCF significantly outperforms state-of-the-art methods in minimizing Gaussian curvature,  geometric feature preserving smoothing and mesh noise removal.
Revised:  We present extensive experiments to demonstrate that GCF significantly outperforms state-of-the-art methods in minimizing Gaussian curvature, and geometric feature preserving smoothing and mesh noise removal.
Edit intent: fluency
Original: We analyze the convergence of the one-level overlapping domain decomposition preconditioner SORAS (Symmetrized Optimized Restricted Additive Schwarz) applied to a general linear system whose matrix is not necessarily symmetric/self-adjoint nor positive definite.
Revised: We analyze the convergence of the one-level overlapping domain decomposition preconditioner SORAS (Symmetrized Optimized Restricted Additive Schwarz) applied to a generic linear system whose matrix is not necessarily symmetric/self-adjoint nor positive definite.
Edit intent: clarity
Original: Single file diffusion is a paradigm for strongly correlated classical stochastic many-body dynamics and has widespread applications in soft condensed matter and biophysics.
Revised: Single-file diffusion is a paradigm for strongly correlated classical stochastic many-body dynamics and has widespread applications in soft condensed matter and biophysics.
Edit intent: fluency
Original:  However, exact results for single file systems are sparse and limited to the simplest scenarios.
Revised:  However, exact results for single-file systems are sparse and limited to the simplest scenarios.
Edit intent: fluency
Original:  We present an algorithm for computing the non-Markovian time-dependent conditional probability density function of a tagged particle in a single file { of N particles diffusing in a confining external potential.
Revised:  We present an algorithm for computing the non-Markovian time-dependent conditional probability density function of a tagged particle in a single file in a{ of N particles diffusing in a confining external potential.
Edit intent: fluency
Original:  The algorithm implements an eigenexpansion of the full interacting many-body problem obtained by means of the Coordinate Bethe Ansatz .
Revised:  The algorithm implements an eigenexpansion of the full interacting many-body problem obtained by means of the coordinate Bethe ansatz .
Edit intent: fluency
Original:  Here we exploit the underlying symmetries of the system { and show that it is possible to reduce the complexity of the algorithm from the worst case scenario O(N!) to up to O(N).
Revised:  Here we exploit the underlying exchange { and show that it is possible to reduce the complexity of the algorithm from the worst case scenario O(N!) to up to O(N).
Edit intent: clarity
Original: Acoustic Scene Classification (ASC) is a problem related to the field of machine listening whose objective is to classify/tag an audio clip in a predefined label describing a scene location .
Revised: Acoustic scene classification (ASC) is a problem related to the field of machine listening whose objective is to classify/tag an audio clip in a predefined label describing a scene location .
Edit intent: fluency
Original:  Although the main line of research in the state-of-the-art usually implements these methods , considerable improvements and state-of-the-art results can also be achieved only by modifying the architecture of convolutional neural networks (CNNs).
Revised:  Although the main line of research in the state-of-the-art usually implements these methods , considerable improvements can also be achieved only by modifying the architecture of convolutional neural networks (CNNs).
Edit intent: clarity
Original:  In this work we propose two novel squeeze-excitation blocks to improve the accuracy of an ASC framework by modifying the architecture of the residual block in a CNN together with an analysis of several state-of-the-art blocks .
Revised:  In this work we propose two novel squeeze-excitation blocks to improve the accuracy of a CNN-based ASC framework based on residual learning .
Edit intent: clarity
Original:  This is done by some global grouping operators, linear operators and a final calibration between the input of the block and the relationships obtained by that block .
Revised:  This is usually achieved by some global grouping operators, linear operators and a final calibration between the input of the block and the relationships obtained by that block .
Edit intent: clarity
Original:  This is done by some global grouping operators, linear operators and a final calibration between the input of the block and the relationships obtained by that block .
Revised:  This is done by some global grouping operators, linear operators and a final calibration between the input of the block and its obtained relationships .
Edit intent: clarity
Original:  The behavior of the block that implements these operators and, therefore, the entire neural network  can be modified depending on the input to the block, the  residual configurations and the  non-linear activations , that is, at what point of the block they are performed .
Revised:  The behavior of the block that implements such operators and, therefore, the entire neural network can be modified depending on the input to the block, the residual configurations and the non-linear activations , that is, at what point of the block they are performed .
Edit intent: clarity
Original:  The behavior of the block that implements these operators and, therefore, the entire neural network  can be modified depending on the input to the block, the  residual configurations and the  non-linear activations , that is, at what point of the block they are performed .
Revised:  The behavior of the block that implements these operators and, therefore, the entire neural network , can be modified depending on the input to the block, the residual configurations and the non-linear activations , that is, at what point of the block they are performed .
Edit intent: fluency
Original:  The behavior of the block that implements these operators and, therefore, the entire neural network  can be modified depending on the input to the block, the  residual configurations and the  non-linear activations , that is, at what point of the block they are performed .
Revised:  The behavior of the block that implements these operators and, therefore, the entire neural network can be modified depending on the input to the block, the residual configurations and the selected non-linear activations , that is, at what point of the block they are performed .
Edit intent: clarity
Original:  The behavior of the block that implements these operators and, therefore, the entire neural network  can be modified depending on the input to the block, the  residual configurations and the  non-linear activations , that is, at what point of the block they are performed .
Revised:  The behavior of the block that implements these operators and, therefore, the entire neural network can be modified depending on the input to the block, the residual configurations and the non-linear activations .
Edit intent: coherence
Original:  The analysis has been carried out using  TAU Urban Acoustic Scenes 2019 dataset presented in DCASE 2019 edition  .
Revised:  The analysis has been carried out using the TAU Urban Acoustic Scenes 2019 dataset presented in DCASE 2019 edition .
Edit intent: fluency
Original:  All configurations discussed in this document exceed  baseline proposed by  DCASE organization by 13 \% percentage points.
Revised:  All configurations discussed in this document exceed the performance of the baseline proposed by DCASE organization by 13 \% percentage points.
Edit intent: clarity
Original:  All configurations discussed in this document exceed  baseline proposed by  DCASE organization by 13 \% percentage points.
Revised:  All configurations discussed in this document exceed baseline proposed by the DCASE organization by 13 \% percentage points.
Edit intent: fluency
Original:  All configurations discussed in this document exceed  baseline proposed by  DCASE organization by 13 \% percentage points.
Revised:  All configurations discussed in this document exceed baseline proposed by DCASE organization by 13 
Edit intent: clarity
Original:  In turn, the novel configurations proposed in this paper exceed the residual configuration proposed in previous works.
Revised:  In turn, the novel configurations proposed in this paper outperform the residual configurations proposed in previous works.
Edit intent: clarity
Original: We address the generalized Nash equilibrium (GNE) problem in a partial-decision information scenario, where each agent can only observe the actions of some neighbors, while its cost function possibly depends on the strategies of other agents.
Revised: We address the generalized Nash equilibrium seeking problem in a partial-decision information scenario, where each agent can only observe the actions of some neighbors, while its cost function possibly depends on the strategies of other agents.
Edit intent: clarity