wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper we discuss the use of a convolutional auto-encoder devoted to learning an end-to-end map from an input image of a fixed size to its selectional output, in which activations indicate whether the pixel must be classified as foreground or background.
Revised:  In this paper we discuss the use of a convolutional auto-encoder devoted to learning an end-to-end map from an input image to its selectional output, in which activations indicate whether the pixel must be classified as foreground or background.
Edit intent: clarity
Original:  In this paper we discuss the use of a convolutional auto-encoder devoted to learning an end-to-end map from an input image of a fixed size to its selectional output, in which activations indicate whether the pixel must be classified as foreground or background.
Revised:  In this paper we discuss the use of a convolutional auto-encoder devoted to learning an end-to-end map from an input image of a fixed size to its selectional output, in which activations indicate the likelihood of pixels to be either foreground or background.
Edit intent: clarity
Original:  Our approach has proven to outperform state-of-the-art techniques in the well-known DIBCO dataset (edition 2016) .
Revised:  This approach has proven to outperform state-of-the-art techniques in the well-known DIBCO dataset (edition 2016) .
Edit intent: fluency
Original:  Our approach has proven to outperform state-of-the-art techniques in the well-known DIBCO dataset (edition 2016) .
Revised:  Our approach has proven to outperform existing binarization strategies in a number of document domains .
Edit intent: clarity
Original:  The approach is illustrated using a simple model of a biomolecular cycle representing a membrane transporter  .
Revised:  The approach is illustrated using a model of a biomolecular cycle representing a membrane transporter .
Edit intent: clarity
Original: In this paper, convergence of a characteristics-based hybrid method recently introduced in Daripa  Dutta (J. Comput.
Revised: In this article, the convergence of a characteristics-based hybrid method recently introduced in Daripa Dutta (J. Comput.
Edit intent: fluency
Original:  Phys., 335:249-282, 2017) has been proved .
Revised:  Phys., 335:249-282, 2017) has been established .
Edit intent: clarity
Original:  This method which combines a discontinuous finite element method and a modified method of characteristics (MMOC)  has been successfully applied to solve a coupled , nonlinear system of elliptic and transport equations that arise in multicomponent two-phase porous media flows.
Revised:  This method integrates a discontinuous finite element method and a modified method of characteristics (MMOC) has been successfully applied to solve a coupled , nonlinear system of elliptic and transport equations that arise in multicomponent two-phase porous media flows.
Edit intent: clarity
Original:  This method which combines a discontinuous finite element method and a modified method of characteristics (MMOC)  has been successfully applied to solve a coupled , nonlinear system of elliptic and transport equations that arise in multicomponent two-phase porous media flows.
Revised:  This method which combines a discontinuous finite element method with a modified method of characteristics (MMOC) has been successfully applied to solve a coupled , nonlinear system of elliptic and transport equations that arise in multicomponent two-phase porous media flows.
Edit intent: fluency
Original:  This method which combines a discontinuous finite element method and a modified method of characteristics (MMOC)  has been successfully applied to solve a coupled , nonlinear system of elliptic and transport equations that arise in multicomponent two-phase porous media flows.
Revised:  This method which combines a discontinuous finite element method and a modified method of characteristics (MMOC) has been successfully applied to solve a coupled system of nonlinear equations that arises in multicomponent two-phase porous media flows.
Edit intent: clarity
Original:  Error estimates have been obtained and these estimates have also been validated by realistic numerical simulations of flows arising in enhanced oil recovery processes.
Revised:  Error estimates have been obtained and these estimates have also been shown to be consistent with realistic numerical simulations of flows arising in enhanced oil recovery processes.
Edit intent: clarity
Original:  This article, however, conjectures that at a statistical level, sex ratio effects are likely to produce sharper numerical variations among avian species .
Revised:  This article, however, conjectures that at the statistical level, sex ratio effects are likely to produce sharper numerical variations among avian species .
Edit intent: fluency
Original:  This article, however, conjectures that at a statistical level, sex ratio effects are likely to produce sharper numerical variations among avian species .
Revised:  This article, however, conjectures that at a statistical level, sex ratio effects are likely to produce sharper numerical variations among birds than among mammals .
Edit intent: clarity
Original:  We explain , moreover, that this greater statistical variation could have major implications for improving the efficiency of world-wide poultry egg and possibly also meat production.
Revised:  We explain this greater statistical variation could have major implications for improving the efficiency of world-wide poultry egg and possibly also meat production.
Edit intent: coherence
Original:  We explain , moreover, that this greater statistical variation could have major implications for improving the efficiency of world-wide poultry egg and possibly also meat production.
Revised:  We explain , moreover, that this greater statistical variation should likely have beneficial implications for increasing the efficiency of world-wide poultry egg and possibly also meat production.
Edit intent: clarity
Original:  We explain , moreover, that this greater statistical variation could have major implications for improving the efficiency of world-wide poultry egg and possibly also meat production.
Revised:  We explain , moreover, that this greater statistical variation could have major implications for improving the efficiency of world-wide poultry egg (and perhaps also meat) production.
Edit intent: coherence
Original:  Modern fMRI scanners allow for resolving functional brain data in high resolution, enabling the study of large-scale networks that relate to cognitive processes.
Revised:  Modern fMRI scanners allow to resolve functional brain data in high resolution, enabling the study of large-scale networks that relate to cognitive processes.
Edit intent: fluency
Original:  Modern fMRI scanners allow for resolving functional brain data in high resolution, enabling the study of large-scale networks that relate to cognitive processes.
Revised:  Modern fMRI scanners allow for resolving functional brain data in high resolutions, allowing to study large-scale networks that relate to cognitive processes.
Edit intent: fluency
Original:  Due to the immense size and complexity of the underlying data sets, efficient evaluation and visualization pose challenges for data analysis.
Revised:  Due to the immense size and complexity of the underlying data sets, efficient evaluation and visualization remain a challenge for data analysis.
Edit intent: clarity
Original:  We use task-related edge densities [Lohmann et al., 2016] for constructing networks whose nodes represent voxels in the fMRI data and whose edges represent the task-related changes in synchronization between them .
Revised:  We use task-related edge densities [Lohmann et al., 2016] for constructing networks of task-related changes in synchronization between them .
Edit intent: clarity
Original:  We use task-related edge densities [Lohmann et al., 2016] for constructing networks whose nodes represent voxels in the fMRI data and whose edges represent the task-related changes in synchronization between them .
Revised:  We use task-related edge densities [Lohmann et al., 2016] for constructing networks whose nodes represent voxels in the fMRI data and whose edges represent the task-related changes in synchronization .
Edit intent: clarity
Original:  This construction captures the dynamic formation of patterns of neuronal activity and therefore efficiently represents the connectivity structure between brain regions.
Revised:  This construction captures the dynamic formation of patterns of neuronal activity and therefore represents efficiently the connectivity structure between brain regions.
Edit intent: fluency
Original:  Our results identify important structural network features including long-range connections of high curvature acting as bridges between major network components.
Edit intent: coherence
Original:  The geometric features link curvature to higher order network organization that could aid in understanding the connectivity and interplay of brain regions in cognitive processes.
Revised:  The geometric features could aid in understanding the connectivity and interplay of brain regions in cognitive processes.
Edit intent: clarity
Original:  Experiments with comparisons on two large-scale datasets are carried out, and the system robustness with respect to  regularizing factor used in NCL is given.
Revised:  Experiments with comparisons on two large-scale datasets are carried out, and the system robustness with respect to the regularizing factor used in NCL is given.
Edit intent: fluency
Original:  To this end we introduced , in a 2012 conference paper, the notion of shrub-depth of a graph class which is related to the established notion of clique-width in a similar way as tree-depth is related to tree-width.
Revised:  To this end , in a 2012 conference paper, the notion of shrub-depth of a graph class which is related to the established notion of clique-width in a similar way as tree-depth is related to tree-width.
Edit intent: coherence
Original:  To this end we introduced , in a 2012 conference paper, the notion of shrub-depth of a graph class which is related to the established notion of clique-width in a similar way as tree-depth is related to tree-width.
Revised:  To this end we introduced , in a 2012 conference paper, a new notion of shrub-depth of a graph class which is related to the established notion of clique-width in a similar way as tree-depth is related to tree-width.
Edit intent: clarity
Original: When analyzing the statistical and topological characteristics of complex networks, an effective and convenient way is to compute the centralities for recognizing influential and significant nodes or structures . Centralities for nodes are widely researched to depict the networks from a certain perspective and perform great efficiency , yet most of them are restricted to local environment or some specific configurations and hard to be generalized to structural patterns of networks .
Revised: When analyzing the statistical and topological characteristics of complex networks, an effective and convenient way is to compute the centralities for recognizing influential and significant nodes or structures , yet most of them are restricted to local environment or some specific configurations and hard to be generalized to structural patterns of networks .
Edit intent: coherence
Original: When analyzing the statistical and topological characteristics of complex networks, an effective and convenient way is to compute the centralities for recognizing influential and significant nodes or structures . Centralities for nodes are widely researched to depict the networks from a certain perspective and perform great efficiency , yet most of them are restricted to local environment or some specific configurations and hard to be generalized to structural patterns of networks .
Revised: When analyzing the statistical and topological characteristics of complex networks, an effective and convenient way is to compute the centralities for recognizing influential and significant nodes or structures . Centralities for nodes are widely researched to depict the networks from a certain perspective and perform great efficiency , yet most of them are restricted to local environment or some specific configurations .
Edit intent: coherence
Original:  In this paper we propose a new centrality for nodes and motifs by the von Neumann entropy, which allows us to investigate the importance of nodes or structural patterns in the view of structural complexity.
Revised:  In this paper we propose a new centrality for nodes based on the von Neumann entropy, which allows us to investigate the importance of nodes or structural patterns in the view of structural complexity.
Edit intent: clarity
Original:  In this paper we propose a new centrality for nodes and motifs by the von Neumann entropy, which allows us to investigate the importance of nodes or structural patterns in the view of structural complexity.
Revised:  In this paper we propose a new centrality for nodes and motifs by the von Neumann entropy, which allows us to investigate the importance of nodes in the view of structural complexity.
Edit intent: clarity
Original:  By calculating and comparing similarities of this centrality with classical ones , it is shown that the von Neumann entropy node centrality is an all-round index for selecting crucial nodes , and able to evaluate and summarize the performance of other centralities .
Revised:  By calculating and comparing similarities of this centrality with classical ones , it is shown that the von Neumann entropy node centrality is an excellent index for selecting crucial nodes , and able to evaluate and summarize the performance of other centralities .
Edit intent: clarity
Original:  This new methodology reveals the influence of various structural patterns on the regularity and complexity of networks , which provides us a fresh perspective to study networks and performs great potentials to discover essential structural features in networks.
Revised:  This new methodology reveals the influence of various structural patterns on the regularity and complexity of networks , which provides a new insight into networks research and performs great potentials to discover essential structural features in networks.
Edit intent: clarity
Original:  We show that such an integer program can be solved in time m^{O(m) \cdot \Delta ^{O(m) , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A and b . This improves upon the longstanding best bound of Papadimitriou (1981) of m^{O(m^2) \cdot }%DIFDELCMD < {%%% \Delta ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Revised:  We show that such an integer program can be solved in time (m \Delta)^{O(m) \cdot \Delta ^{O(m) , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A and b . This improves upon the longstanding best bound of Papadimitriou (1981) of m^{O(m^2) \cdot }%DIFDELCMD < {%%% \Delta ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Edit intent: clarity
Original:  We show that such an integer program can be solved in time m^{O(m) \cdot \Delta ^{O(m) , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A and b . This improves upon the longstanding best bound of Papadimitriou (1981) of m^{O(m^2) \cdot }%DIFDELCMD < {%%% \Delta ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Revised:  We show that such an integer program can be solved in time m^{O(m) \cdot ^{O(m) , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A and b . This improves upon the longstanding best bound of Papadimitriou (1981) of m^{O(m^2) \cdot }%DIFDELCMD < {%%% \Delta ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Edit intent: fluency
Original:  We show that such an integer program can be solved in time m^{O(m) \cdot \Delta ^{O(m) , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A and b . This improves upon the longstanding best bound of Papadimitriou (1981) of m^{O(m^2) \cdot }%DIFDELCMD < {%%% \Delta ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Revised:  We show that such an integer program can be solved in time m^{O(m) \cdot \Delta , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A and b . This improves upon the longstanding best bound of Papadimitriou (1981) of m^{O(m^2) \cdot }%DIFDELCMD < {%%% \Delta ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Edit intent: fluency
Original:  We show that such an integer program can be solved in time m^{O(m) \cdot \Delta ^{O(m) , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A and b . This improves upon the longstanding best bound of Papadimitriou (1981) of m^{O(m^2) \cdot }%DIFDELCMD < {%%% \Delta ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Revised:  We show that such an integer program can be solved in time m^{O(m) \cdot \Delta ^{O(m) , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A . This improves upon the longstanding best bound of Papadimitriou (1981) of m^{O(m^2) \cdot }%DIFDELCMD < {%%% \Delta ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Edit intent: clarity
Original:  We show that such an integer program can be solved in time m^{O(m) \cdot \Delta ^{O(m) , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A and b . This improves upon the longstanding best bound of Papadimitriou (1981) of m^{O(m^2) \cdot }%DIFDELCMD < {%%% \Delta ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Revised:  We show that such an integer program can be solved in time m^{O(m) \cdot \Delta ^{O(m) , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A and b . This improves upon the longstanding best bound of Papadimitriou (1981) of \cdot }%DIFDELCMD < {%%% \Delta ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Edit intent: fluency
Original:  We show that such an integer program can be solved in time m^{O(m) \cdot \Delta ^{O(m) , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A and b . This improves upon the longstanding best bound of Papadimitriou (1981) of m^{O(m^2) \cdot }%DIFDELCMD < {%%% \Delta ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Revised:  We show that such an integer program can be solved in time m^{O(m) \cdot \Delta ^{O(m) , where }%DIFDELCMD < {%%% \Delta is an upper bound on each absolute value of an entry in A and b . This improves upon the longstanding best bound of Papadimitriou (1981) of m^{O(m^2) \cdot }%DIFDELCMD < {%%% ^{O(m^2), where in addition, the absolute values of the entries of b also need to be bounded by \Delta} .
Edit intent: fluency
Original:  We also use the Steinitz lemma to show that the \ell_1-distance of an optimal integer and fractional solution of the integer program , also under the presence of upper bounds on the variables, is bounded by m \cdot (2 \cdot m \cdot \Delta%DIFDELCMD < }%%% _A +1)^m.
Revised:  We also use the Steinitz lemma to show that the \ell_1-distance of an optimal integer and fractional solution , also under the presence of upper bounds on the variables, is bounded by m \cdot (2 \cdot m \cdot \Delta%DIFDELCMD < }%%% _A +1)^m.
Edit intent: clarity
Original:  Here \Delta _A is an upper bound on the absolute values of the entries of A only .
Revised:  Here \Delta _A is an upper bound on the absolute values of the entries of A .
Edit intent: clarity
Original: Recent empirical studies suggest that the volatilities associated with financial time series exhibit short range correlations.
Revised: Recent empirical studies suggest that the volatilities associated with financial time series exhibit short-range correlations.
Edit intent: fluency
Original:  Another classic stylistic feature often assumed for the volatility is that it is "mean reverting" .
Revised:  Another classic stylistic feature often assumed for the volatility is that it is mean reverting .
Edit intent: fluency
Original:  In this paper it is shown that the price impact of a fast mean reverting rough volatility model coincides with that associated with fast mean reverting Markov stochastic volatility models.
Revised:  In this paper it is shown that the price impact of a rapidly mean reverting rough volatility model coincides with that associated with fast mean reverting Markov stochastic volatility models.
Edit intent: fluency
Original:  This then reconciles the empirical observation of rough volatility paths with the good fit of the implied volatility surface to models of fast mean reverting Markov volatilities.
Revised:  This reconciles the empirical observation of rough volatility paths with the good fit of the implied volatility surface to models of fast mean reverting Markov volatilities.
Edit intent: clarity
Original:  Combining recurrent neural network (RNN) and variational inference (VI) , this model has both deterministic hidden states and stochastic latent variables while previous RNN methods only consider deterministic states . Based on comprehensive experiments, we show that the proposed methods significantly improves the state-of-art performance of chaotic time series benchmark and  has better performance on real-worl data.
Revised:  Combining recurrent neural network (RNN) and variational inference (VI) , this model has both deterministic hidden states and stochastic latent variables while previous RNN methods only consider deterministic states . Based on comprehensive experiments, we show that the proposed methods significantly improves the state-of-art performance on chaotic time series benchmark and has better performance on real-worl data.
Edit intent: fluency
Original:  Combining recurrent neural network (RNN) and variational inference (VI) , this model has both deterministic hidden states and stochastic latent variables while previous RNN methods only consider deterministic states . Based on comprehensive experiments, we show that the proposed methods significantly improves the state-of-art performance of chaotic time series benchmark and  has better performance on real-worl data.
Revised:  Combining recurrent neural network (RNN) and variational inference (VI) , this model has both deterministic hidden states and stochastic latent variables while previous RNN methods only consider deterministic states . Based on comprehensive experiments, we show that the proposed methods significantly improves the state-of-art performance of chaotic time series benchmark and also has better performance on real-worl data.
Edit intent: coherence
Original:  Combining recurrent neural network (RNN) and variational inference (VI) , this model has both deterministic hidden states and stochastic latent variables while previous RNN methods only consider deterministic states . Based on comprehensive experiments, we show that the proposed methods significantly improves the state-of-art performance of chaotic time series benchmark and  has better performance on real-worl data.
Revised:  Combining recurrent neural network (RNN) and variational inference (VI) , this model has both deterministic hidden states and stochastic latent variables while previous RNN methods only consider deterministic states . Based on comprehensive experiments, we show that the proposed methods significantly improves the state-of-art performance of chaotic time series benchmark and has better performance on real-world data.
Edit intent: fluency