wanyu/IteraTeR_v2 huggingface dataset:
Original:  Transition and transversion mutations are naturally expressed as basic binary operations, and the severity of the different types is analyzed.
Revised:  Transition and transversion mutations are naturally expressed as basic binary operations, and the severity of the different point mutations can be analyzed.
Edit intent: clarity
Original:  Using a principal component analysis, it is shown that  physicochemical properties of amino acids related to protein folding also correlate with particular bit positions of their respective labels.
Revised:  Using a principal component analysis, it is shown that the physicochemical properties of amino acids related to protein folding also correlate with particular bit positions of their respective labels.
Edit intent: fluency
Original:  Using a principal component analysis, it is shown that  physicochemical properties of amino acids related to protein folding also correlate with particular bit positions of their respective labels.
Revised:  Using a principal component analysis, it is shown that physicochemical properties of amino acids related to protein folding also correlate with certain bit positions of their respective labels.
Edit intent: clarity
Original:  Thus, the likelihood for a particular point mutation to be conservative, and therefore less likely to cause a change in protein functionality, can be estimated.
Revised:  Thus, the likelihood for a point mutation to be conservative, and therefore less likely to cause a change in protein functionality, can be estimated.
Edit intent: clarity
Original:  Thus, the likelihood for a particular point mutation to be conservative, and therefore less likely to cause a change in protein functionality, can be estimated.
Revised:  Thus, the likelihood for a particular point mutation to be conservative, and less likely to cause a change in protein functionality, can be estimated.
Edit intent: coherence
Original:  As the interaction between the entomopathogen and the pest is complex and the production of entomopathogens potentially expensive, it is not surprising that both the efficacy and economic viability of biological pest control are debated.
Revised:  As the interaction between these enemies and the pest is complex and the production of entomopathogens potentially expensive, it is not surprising that both the efficacy and economic viability of biological pest control are debated.
Edit intent: clarity
Original:  As the interaction between the entomopathogen and the pest is complex and the production of entomopathogens potentially expensive, it is not surprising that both the efficacy and economic viability of biological pest control are debated.
Revised:  As the interaction between the entomopathogen and the pest is complex and the production of enemies potentially expensive, it is not surprising that both the efficacy and economic viability of biological pest control are debated.
Edit intent: clarity
Original:  In particular, we show how Pareto-efficient one-off or periodic release strategies, which optimally trade off between efficacy and economic viability, can be devised and used to enable high efficacy for small economic costs.
Revised:  In particular, we show how Pareto-efficient one-off or periodic release strategies, that optimally trade off between efficacy and economic viability, can be devised and used to enable high efficacy for small economic costs.
Edit intent: fluency
Original:  In particular, we show how Pareto-efficient one-off or periodic release strategies, which optimally trade off between efficacy and economic viability, can be devised and used to enable high efficacy for small economic costs.
Revised:  In particular, we show how Pareto-efficient one-off or periodic release strategies, which optimally trade off between efficacy and economic viability, can be devised and used to enable high efficacy at small economic costs.
Edit intent: clarity
Original:  By analyzing this model, we demonstrate that simple Pareto-efficient one-off  release strategies are typically efficacious and simultaneously have average profits that are close to the theoretical maximum obtained by less efficacious and complicated profit-optimizing strategies .
Revised:  By analyzing this model, we demonstrate that simple Pareto-efficient one-off release strategies are efficacious and simultaneously have average profits that are close to the theoretical maximum obtained by less efficacious and complicated profit-optimizing strategies .
Edit intent: clarity
Original:  By analyzing this model, we demonstrate that simple Pareto-efficient one-off  release strategies are typically efficacious and simultaneously have average profits that are close to the theoretical maximum obtained by less efficacious and complicated profit-optimizing strategies .
Revised:  By analyzing this model, we demonstrate that simple Pareto-efficient one-off release strategies are typically efficacious and simultaneously have profits that are close to the theoretical maximum obtained by less efficacious and complicated profit-optimizing strategies .
Edit intent: clarity
Original:  The methods presented here can be extended to more complex scenarios and thus be used to identify promising biological pest control strategies in many circumstances.
Revised:  The methods presented here can be extended to more complex scenarios and be used to identify promising biological pest control strategies in many circumstances.
Edit intent: coherence
Original:  We place particular emphasis on the importance of specifying the appropriate graph labeling---stub-labeled or vertex-labeled---under which to consider a null model, a choice that closely connects the study of random graphs to the study of random contingency tables.
Revised:  We place particular emphasis on the importance of specifying the appropriate graph labeling (stub-labeled or vertex-labeled) under which to consider a null model, a choice that closely connects the study of random graphs to the study of random contingency tables.
Edit intent: fluency
Original:  The importance of these choices is demonstrated through a series of three in-depth vignettes, analyzing three different network datasets under many different configuration models and observing substantial differences in study conclusions under different models.
Revised:  The importance of these choices is demonstrated through a series of three vignettes, analyzing three different network datasets under many different configuration models and observing substantial differences in study conclusions under different models.
Edit intent: clarity
Original:  The importance of these choices is demonstrated through a series of three in-depth vignettes, analyzing three different network datasets under many different configuration models and observing substantial differences in study conclusions under different models.
Revised:  The importance of these choices is demonstrated through a series of three in-depth vignettes, analyzing network datasets under many different configuration models and observing substantial differences in study conclusions under different models.
Edit intent: fluency
Original:  For a large and diverse set of images, we find that SS-DWT significantly im-proves bitrates of non-photographic images.
Revised:  For a large and diverse set of images, we find that SS-DWT significantly improves bitrates of non-photographic images.
Edit intent: fluency
Original:  It provides average bitrate improvement of roughly 5\% for the entire test-set and roughly 14\% for non-photographic images , whereas the overall compression time becomes only 3\% greater than that of the unmodified JPEG 2000.
Revised:  It provides average bitrate improvement of roughly 5\% for the entire test-set , whereas the overall compression time becomes only 3\% greater than that of the unmodified JPEG 2000.
Edit intent: clarity
Original:  In order to accomplish this, we convert the Monge-Amp\`ere equation to an equivalent Hamilton-Jacobi-Bellman (HJB) equation , which is numerically more manageable . Based on the HJB formulation, we apply narrow stencil discretization, which is second order accurate, to the grid points wherever monotonicity holds, and apply  wide stencil discretization elsewhere to ensure monotonicity on the entire computational domain.
Revised:  In order to accomplish this, we convert the Monge-Amp\`ere equation to an equivalent Hamilton-Jacobi-Bellman (HJB) equation . Based on the HJB formulation, we apply narrow stencil discretization, which is second order accurate, to the grid points wherever monotonicity holds, and apply wide stencil discretization elsewhere to ensure monotonicity on the entire computational domain.
Edit intent: coherence
Original:  To solve the discretized system, policy iteration is implemented.
Edit intent: coherence
Original:  By dividing the admissible control set into six regions and optimizing the sub-problem in each region, the computational cost of the optimization problem at each grid point in one policy iteration is reduced from O(M^2) to O( M) , where the control grid is M\times M.
Revised:  By dividing the admissible control set into six regions and optimizing the sub-problem in each region, the computational cost of the optimization problem at each grid point is reduced from O(M^2) to O( M) , where the control grid is M\times M.
Edit intent: clarity
Original:  By dividing the admissible control set into six regions and optimizing the sub-problem in each region, the computational cost of the optimization problem at each grid point in one policy iteration is reduced from O(M^2) to O( M) , where the control grid is M\times M.
Revised:  By dividing the admissible control set into six regions and optimizing the sub-problem in each region, the computational cost of the optimization problem at each grid point in one policy iteration is reduced from O(M^2) to O( M) , where the discretized control set is M\times M.
Edit intent: clarity
Original: Kobayashi introduced a uniform notion of compressibility of infinite binary sequences in terms of relative Turing computations with sub-linear use of the oracle.
Revised: Kobayashi introduced a uniform notion of compressibility of infinite binary sequences in terms of relative Turing computations with sub-identity use of the oracle.
Edit intent: clarity
Original:  Applying results of the first part of the paper we provide first order expansions for certain problems involving a fractional Brownian motion either in the drift or in the volatility.
Revised:  Applying results of the first part of the paper we provide first order expansions for certain problems involving fractional Brownian motion either in the drift or in the volatility.
Edit intent: fluency
Original:  Also we conjecture that apart from K7 \ (E(C3) U E(C4)) , there is no matching integral k-regular graph (k >= 2)   .
Revised:  Also we conjecture that apart from K7 \ (E(C3) U E(C4)) there is no matching integral k-regular graph (k >= 2) .
Edit intent: fluency
Original:  We prove that, assuming P \ne NP, for any \varepsilon > 0  the {\sc Max Sync Set} problem cannot be approximated in polynomial time within a factor of O( k ^{1 - \varepsilon}) for monotonic k-state automata with an alphabet of linear size, within a factor of O( k ^{1{2} - \varepsilon}) for binary k-state automata, and within a factor of O( k ^{1{3} - \varepsilon}) for binary monotonic k-state automata.
Revised:  We prove that, assuming P \ne NP, for any \varepsilon > 0 , the {\sc Max Sync Set} problem cannot be approximated in polynomial time within a factor of O( k ^{1 - \varepsilon}) for monotonic k-state automata with an alphabet of linear size, within a factor of O( k ^{1{2} - \varepsilon}) for binary k-state automata, and within a factor of O( k ^{1{3} - \varepsilon}) for binary monotonic k-state automata.
Edit intent: fluency
Original:  We prove that, assuming P \ne NP, for any \varepsilon > 0  the {\sc Max Sync Set} problem cannot be approximated in polynomial time within a factor of O( k ^{1 - \varepsilon}) for monotonic k-state automata with an alphabet of linear size, within a factor of O( k ^{1{2} - \varepsilon}) for binary k-state automata, and within a factor of O( k ^{1{3} - \varepsilon}) for binary monotonic k-state automata.
Revised:  We prove that, assuming P \ne NP, for any \varepsilon > 0 the {\sc Max Sync Set} problem cannot be approximated in polynomial time within a factor of O( n ^{1 - \varepsilon}) for monotonic k-state automata with an alphabet of linear size, within a factor of O( k ^{1{2} - \varepsilon}) for binary k-state automata, and within a factor of O( k ^{1{3} - \varepsilon}) for binary monotonic k-state automata.
Edit intent: clarity
Original:  We prove that, assuming P \ne NP, for any \varepsilon > 0  the {\sc Max Sync Set} problem cannot be approximated in polynomial time within a factor of O( k ^{1 - \varepsilon}) for monotonic k-state automata with an alphabet of linear size, within a factor of O( k ^{1{2} - \varepsilon}) for binary k-state automata, and within a factor of O( k ^{1{3} - \varepsilon}) for binary monotonic k-state automata.
Revised:  We prove that, assuming P \ne NP, for any \varepsilon > 0 the {\sc Max Sync Set} problem cannot be approximated in polynomial time within a factor of O( k ^{1 - \varepsilon}) for monotonic k-state automata with an alphabet of linear size, within a factor of O( n ^{1{2} - \varepsilon}) for binary k-state automata, and within a factor of O( k ^{1{3} - \varepsilon}) for binary monotonic k-state automata.
Edit intent: clarity
Original:  We prove that, assuming P \ne NP, for any \varepsilon > 0  the {\sc Max Sync Set} problem cannot be approximated in polynomial time within a factor of O( k ^{1 - \varepsilon}) for monotonic k-state automata with an alphabet of linear size, within a factor of O( k ^{1{2} - \varepsilon}) for binary k-state automata, and within a factor of O( k ^{1{3} - \varepsilon}) for binary monotonic k-state automata.
Revised:  We prove that, assuming P \ne NP, for any \varepsilon > 0 the {\sc Max Sync Set} problem cannot be approximated in polynomial time within a factor of O( k ^{1 - \varepsilon}) for monotonic k-state automata with an alphabet of linear size, within a factor of O( k ^{1{2} - \varepsilon}) for binary n-state automata, and within a factor of O( k ^{1{3} - \varepsilon}) for binary monotonic k-state automata.
Edit intent: clarity
Original:  We prove that, assuming P \ne NP, for any \varepsilon > 0  the {\sc Max Sync Set} problem cannot be approximated in polynomial time within a factor of O( k ^{1 - \varepsilon}) for monotonic k-state automata with an alphabet of linear size, within a factor of O( k ^{1{2} - \varepsilon}) for binary k-state automata, and within a factor of O( k ^{1{3} - \varepsilon}) for binary monotonic k-state automata.
Revised:  We prove that, assuming P \ne NP, for any \varepsilon > 0 the {\sc Max Sync Set} problem cannot be approximated in polynomial time within a factor of O( k ^{1 - \varepsilon}) for monotonic k-state automata with an alphabet of linear size, within a factor of O( k ^{1{2} - \varepsilon}) for binary k-state automata, and within a factor of O( n ^{1{3} - \varepsilon}) for binary monotonic k-state automata.
Edit intent: clarity
Original: Law Enforcement Agencies (LEA) are increasingly using social media to identify and reduce crime for well-being and safety of the society.
Revised: First responders are increasingly using social media to identify and reduce crime for well-being and safety of the society.
Edit intent: clarity
Original:  In this paper, we present a comparison between different handcrafted features and a Convolutional Neural Network (CNN) model to retrieve similar images, which outperforms state-of-art hand-crafted features.
Revised:  In this paper, we present a comparison between different hand-crafted features and a Convolutional Neural Network (CNN) model to retrieve similar images, which outperforms state-of-art hand-crafted features.
Edit intent: fluency
Original:  We propose an Open-Source-Intelligent (OSINT) real-time image search system, robust to retrieve modified images that allows LEA to analyze the current spread of images, sentiments floating and details of users propagating such content.
Revised:  We propose an Open-Source-Intelligent (OSINT) real-time image search system, robust to retrieve modified images that allows first responders to analyze the current spread of images, sentiments floating and details of users propagating such content.
Edit intent: clarity
Original:  Using simulation , we explore some of the properties of the split score  including its dependence on sequence length, branch length, size of a split and its ability to detect true splits in the underlying tree.
Revised:  Using simulation we explore the properties of the split score including its dependence on sequence length, branch length, size of a split and its ability to detect true splits in the underlying tree.
Edit intent: clarity
Original:  Using simulation , we explore some of the properties of the split score  including its dependence on sequence length, branch length, size of a split and its ability to detect true splits in the underlying tree.
Revised:  Using simulation , we explore some of the properties of the split score , including its dependence on sequence length, branch length, size of a split and its ability to detect true splits in the underlying tree.
Edit intent: fluency
Original:  Computation of the split score has been implemented in the software package SplitSup.
Edit intent: coherence
Original:  Using a sliding window analysis, split scores are used to detect changes in the evolutionary process in data from primates, mosquitoes, and viruses  .
Revised:  Using a sliding window analysis, we show that split scores can be used to detect changes in the evolutionary process in data from primates, mosquitoes, and viruses .
Edit intent: clarity
Original: A game theoretic model is presented which attempts to simulate, at a very abstract level, power struggles in the social world.
Revised: A theoretical model is presented which attempts to simulate, at a very abstract level, power struggles in the social world.
Edit intent: clarity
Original: A game theoretic model is presented which attempts to simulate, at a very abstract level, power struggles in the social world.
Revised: A game theoretic model is presented which provides a way to simulate, at a very abstract level, power struggles in the social world.
Edit intent: clarity
Original:  Agents use the power they have in order to get more of it, both in an absolute and relative sense.
Revised:  Agents use the power they have to try to get more of it, both in an absolute and relative sense.
Edit intent: clarity
Original:  More research is needed to assess the model 's empirical validity.
Revised:  More research is needed to determine whether the model has any empirical validity.
Edit intent: clarity
Original:  However, existing techniques for estimating a network's modules make it difficult to assess whether detected modulesreflect "true" modular organization or are merely structures that arise due to some other organization principle -- e. g., a drive to reduce wiring cost.
Revised:  However, existing techniques for estimating a network's modules make it difficult to assess the influence of organizational principles such as wiring cost reduction on the detected modules.
Edit intent: clarity
Original:  Here, we present a modification of an existing module detection algorithm that allows us to focus on connections that are unexpected under a strict cost-reduction wiring rule and to identify modules from among these connections.
Revised:  Here, we present a modification of an existing module detection algorithm that allows us to focus on connections that are unexpected under a cost-reduction wiring rule and to identify modules from among these connections.
Edit intent: clarity
Original:  Collectively, these findings support the hypothesis that brain networks are compoed of modules and provide additional insight into the function of those modules.
Revised:  Collectively, these findings support the hypothesis that brain networks are composed of modules and provide additional insight into the function of those modules.
Edit intent: fluency
Original:  Ax|| > }\eps \eps -sparse unit vectors x_1, \ldots, x_p \in R^{m and A \in R^{d \times m} satisfying RIP such that (A x_1, \ldots, A x_p) is "close" to (}  y_1, \ldots,y_p).
Revised:  Ax|| > }\eps \eps -sparse and A \in R^{d \times m} satisfying RIP such that (A x_1, \ldots, A x_p) is "close" to (} y_1, \ldots,y_p).
Edit intent: clarity
Original:  Lov\'asz and Stein (independently) proved that any hypergraph satisfies \tau\leq (1+\ln \Delta)\tau^{\ast}, where \tau is the transversal number, \tau^{\ast} is its fractional version, and \Delta denotes the maximum degree.
Revised:  Lov\'asz and Stein proved independently that any hypergraph satisfies \tau\leq (1+\ln \Delta)\tau^{\ast}, where \tau is the transversal number, \tau^{\ast} is its fractional version, and \Delta denotes the maximum degree.
Edit intent: coherence
Original:  As a geometric application, we obtain a bound on the minimal density of an f-fold covering of the d-dimensional  space by translates of any convex body.
Revised:  As a geometric application, we obtain an upper bound on the minimal density of an f-fold covering of the d-dimensional space by translates of any convex body.
Edit intent: clarity
Original: Sector-wise productivity growths are measured, along with the sectoral elasticity of substitutions, under the multi-factor CES framework, by regressing the growths of factor-wise cost shares against the growths of relative factor prices.
Revised: Sector-wise productivity growths are jointly measured by regressing the growths of factor-wise cost shares against the growths of relative factor prices.
Edit intent: clarity
Original:  We use linked input-output tables for Japan and  Korea as the data source for factor price and cost shares in two timely distant states.
Revised:  We use linked input-output tables for Japan and the Republic of Korea as the data source for factor price and cost shares in two timely distant states.
Edit intent: clarity
Original:  We use linked input-output tables for Japan and  Korea as the data source for factor price and cost shares in two timely distant states.
Revised:  We use linked input-output tables for Japan and Korea as the data source for factor price and cost shares in two temporally distant states.
Edit intent: clarity
Original:  Further, we examine the differences between models based on a priori elasticities such as Leontief and Cobb-Douglas.
Revised:  Further, we examine the differences between models based on a priori elasticity such as Leontief and Cobb-Douglas.
Edit intent: fluency
Original: This paper studies how the communication network  affects the power utilization and fairness in a simplified power system model, composed by three coupled layers: physical , communication and regulatory.
Revised: This work studies how the communication network affects the power utilization and fairness in a simplified power system model, composed by three coupled layers: physical , communication and regulatory.
Edit intent: clarity
Original:  Our results show that  for optimal power utilization and fairness  a global knowledge about the system is needed .
Revised:  Our results show that , for optimal power utilization and fairness a global knowledge about the system is needed .
Edit intent: fluency
Original:  Our results show that  for optimal power utilization and fairness  a global knowledge about the system is needed .
Revised:  Our results show that for optimal power utilization and fairness , a global knowledge about the system is needed .
Edit intent: fluency
Original:  An example of a network of computing devices communicating via message exchange is provided .
Revised:  Illustrative examples include real-time systems, distributed consensus, a Java producer/consumer solution, and digital circuits .
Edit intent: clarity