wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our model outperforms on side-by-side labeled data, and is competitive on data labeled by absolute score.
Revised:  Our model outperforms on side-by-side labeled data, and is comparable on data labeled by absolute score.
Edit intent: clarity
Original:  Understanding how a system constitutes itself as an individual, cohesive  entity is a fundamental challenge for the understanding of life.
Revised:  Understanding how a system constitutes itself as an individual, cohesive , self-organized entity is a fundamental challenge for the understanding of life.
Edit intent: clarity
Original:  With the goal of characterizing transitions in integrated information in the thermodynamic limit, we apply this measure to kinetic Ising models of infinite size applying mean field techniques.
Revised:  With the goal of characterizing transitions in integrated information in the thermodynamic limit, we apply this measure to kinetic Ising models of infinite size using mean field techniques.
Edit intent: fluency
Original:  Indeed one cannot directly sample from the target, or even evaluate a non-negative unbiased estimator of it.
Edit intent: coherence
Original:  The extended logic is powerful enough to capture all finitely based pseudovarieties , i.e., pseudovarieties characterized by some finite set of pseudoidentities, and yields decidability of membership in L, in FOLL (polynomial-size Boolean circuits of O(log log n) depth) and in qAC^0 (Boolean circuits of constant depth and quasi-polynomial size) .
Revised:  The extended logic is powerful enough to capture all pseudovarieties characterized by finite sets of omega-identities .
Edit intent: coherence
Original:  In view of lower bounds from circuit complexity, we obtain a new technique to prove that a pseudovariety V is not finitely based : if membership in V is hard for PARITY, it cannot be defined in this extended logic and thus does not admit a finite basis .
Revised:  In view of lower bounds from circuit complexity, we obtain a new technique to prove that a pseudovariety V is not finitely based : if membership in V is hard for PARITY, it cannot be defined in this logic and thus does not admit a finite basis .
Edit intent: clarity
Original:  In view of lower bounds from circuit complexity, we obtain a new technique to prove that a pseudovariety V is not finitely based : if membership in V is hard for PARITY, it cannot be defined in this extended logic and thus does not admit a finite basis .
Revised:  In view of lower bounds from circuit complexity, we obtain a new technique to prove that a pseudovariety V is not finitely based : if membership in V is hard for PARITY, it cannot be defined in this extended logic and thus cannot be described by finitely many omega-identities .
Edit intent: clarity
Original:  The analysis of the benefits people derive from their interactions with nature - also referred to as cultural ecosystem services (CES) - enables a better understanding of these socio-ecological systems.
Revised:  The analysis of the benefits people derive from their interactions with nature -- also referred to as cultural ecosystem services (CES) - enables a better understanding of these socio-ecological systems.
Edit intent: fluency
Original:  The analysis of the benefits people derive from their interactions with nature - also referred to as cultural ecosystem services (CES) - enables a better understanding of these socio-ecological systems.
Revised:  The analysis of the benefits people derive from their interactions with nature - also referred to as cultural ecosystem services (CES) -- enables a better understanding of these socio-ecological systems.
Edit intent: fluency
Original:  Results provide valuable insights for understanding relationship between social demands for CES and the places of their realization, thus allowing for the development of more efficient conservation and planning strategies.
Revised:  Results provide valuable insights for understanding relationships between social demands for CES and the places of their realization, thus allowing for the development of more efficient conservation and planning strategies.
Edit intent: fluency
Original:  Along with its static version, incremental SVD has been used to deal with multiple semi-infinite time series data and to identify patterns of the data.
Revised:  Along with its static version, incremental SVD has been used to deal with multiple semi infinite time series data and to identify patterns of the data.
Edit intent: fluency
Original:  In this paper, we propose TR-SVD (Time Ranged Singular Value Decomposition) , a fast and memory efficient method for finding latent factors of time series data in an arbitrary time range.
Revised:  In this paper, we propose Zoom-SVD , a fast and memory efficient method for finding latent factors of time series data in an arbitrary time range.
Edit intent: coherence
Original:  TR-SVD incrementally compresses multiple time series data block by block to reduce the space cost in storage phase, and efficiently computes singular value decomposition (SVD) for a given time range query in query phase by carefully stitching stored SVD results.
Revised:  Zoom-SVD incrementally compresses multiple time series data block by block to reduce the space cost in storage phase, and efficiently computes singular value decomposition (SVD) for a given time range query in query phase by carefully stitching stored SVD results.
Edit intent: fluency
Original:  Through extensive experiments, we demonstrate that TR-SVD is up to 15 x faster, and requires 15 x less space than existing methods.
Revised:  Through extensive experiments, we demonstrate that TR-SVD is up to 15x faster, and requires 15 x less space than existing methods.
Edit intent: fluency
Original:  Through extensive experiments, we demonstrate that TR-SVD is up to 15 x faster, and requires 15 x less space than existing methods.
Revised:  Through extensive experiments, we demonstrate that TR-SVD is up to 15 x faster, and requires 15x less space than existing methods.
Edit intent: fluency
Original: In this paper we introduce a new mathematical model for the active contraction of the cardiac muscle under different thermo-electric and nonlinear conductivity properties.
Revised: In this paper we introduce a new mathematical model for the active contraction of cardiac muscle with different thermo-electric and nonlinear conductivity properties.
Edit intent: clarity
Original: In this paper we introduce a new mathematical model for the active contraction of cardiac muscle with different thermo-electric and nonlinear conductivity properties.
Revised: In this paper we introduce a new mathematical model for the active contraction of cardiac muscle , featuring different thermo-electric and nonlinear conductivity properties.
Edit intent: clarity
Original:  It turns out that these ingredients have a key role in reproducing pathological rhythms such as ventricular fibrillation , during inflammatory events, for instance.
Revised:  It turns out that these ingredients have a key role in reproducing pathological chaotic dynamics such as ventricular fibrillation , during inflammatory events, for instance.
Edit intent: clarity
Original:  It turns out that these ingredients have a key role in reproducing pathological rhythms such as ventricular fibrillation , during inflammatory events, for instance.
Revised:  It turns out that these ingredients have a key role in reproducing pathological rhythms such as ventricular fibrillation during inflammatory events, for instance.
Edit intent: fluency
Original:  The specific structure of the governing equations (written in terms of Kirchhoff stress, displacements, solid pressure, electric potential, activation generation, and ionic variables ) suggests to cast the problem in mixed-primal form, and we therefore propose a new mixed-primal finite element method for its numerical approximation .
Revised:  The specific structure of the governing equations suggests to cast the problem in mixed-primal form and we write it in terms of Kirchhoff stress, displacements, solid pressure, electric potential, activation generation, and ionic variables ) suggests to cast the problem in mixed-primal form, and we therefore propose a new mixed-primal finite element method for its numerical approximation .
Edit intent: coherence
Original:  The specific structure of the governing equations (written in terms of Kirchhoff stress, displacements, solid pressure, electric potential, activation generation, and ionic variables ) suggests to cast the problem in mixed-primal form, and we therefore propose a new mixed-primal finite element method for its numerical approximation .
Revised:  The specific structure of the governing equations (written in terms of Kirchhoff stress, displacements, solid pressure, electric potential, activation generation, and ionic variables . We also propose a new mixed-primal finite element method for its numerical approximation .
Edit intent: clarity
Original:  We finally explore the properties of the model , together with the importance of coupling variables , by means of a few computational experiments  .
Revised:  We finally explore the properties of the model and to assess the importance of coupling variables , by means of a few computational experiments .
Edit intent: coherence
Original:  We finally explore the properties of the model , together with the importance of coupling variables , by means of a few computational experiments  .
Revised:  We finally explore the properties of the model , together with the importance of coupling terms , by means of a few computational experiments .
Edit intent: clarity
Original:  Finally, we summarize potential solutions to address the challenges including interference detection and mitigation techniques, mobility enhancements, and UAV identification  .
Revised:  We summarize potential solutions to address the challenges including interference detection and mitigation techniques, mobility enhancements, and UAV identification .
Edit intent: coherence
Original:  Although a few studies have investigated the short-term effects of water-supply systems in pre-war Japan, little is known about the benefits associated with these systems.
Revised:  Although some studies have investigated the short-term effects of water-supply systems in pre-war Japan, little is known about the benefits associated with these systems.
Edit intent: fluency
Original:  Although a few studies have investigated the short-term effects of water-supply systems in pre-war Japan, little is known about the benefits associated with these systems.
Revised:  Although a few studies have investigated the instantaneous effects of water-supply systems in pre-war Japan, little is known about the benefits associated with these systems.
Edit intent: clarity
Original:  Although a few studies have investigated the short-term effects of water-supply systems in pre-war Japan, little is known about the benefits associated with these systems.
Revised:  Although a few studies have investigated the short-term effects of water-supply systems in pre-war Japan, little is known about the chain effects of these systems.
Edit intent: clarity
Original:  By analyzing city-level cause-specific mortality data from the years 1922-1940, we found that eliminating typhoid fever infections decreased the risk of deaths due to non-waterborne diseases .
Revised:  By analyzing city-level cause-specific mortality data from 1922-1940, we found that eliminating typhoid fever infections decreased the risk of deaths due to non-waterborne diseases .
Edit intent: clarity
Original:  By analyzing city-level cause-specific mortality data from the years 1922-1940, we found that eliminating typhoid fever infections decreased the risk of deaths due to non-waterborne diseases .
Revised:  By analyzing city-level cause-specific mortality data from the years 1922-1940, we find that eliminating typhoid fever infections decreased the risk of deaths due to non-waterborne diseases .
Edit intent: fluency
Original:  By analyzing city-level cause-specific mortality data from the years 1922-1940, we found that eliminating typhoid fever infections decreased the risk of deaths due to non-waterborne diseases .
Revised:  By analyzing city-level cause-specific mortality data from the years 1922-1940, we found that eliminating typhoid fever infections decreased the risk of death due to non-waterborne diseases .
Edit intent: fluency
Original:  This suggests that the observed Mills-Reincke phenomenon could have resulted from the prevention typhoid fever in a previously-developing Asian country .
Revised:  Our finding suggests that the observed Mills-Reincke phenomenon could have resulted from the prevention typhoid fever in a previously-developing Asian country .
Edit intent: clarity
Original: We present a new framework for computing Z-eigenvectors of general tensors based on numerically integrating a dynamical system that must converge to a Z-eigenvector.
Revised: We present a new framework for computing Z-eigenvectors of general tensors based on numerically integrating a dynamical system that can only converge to a Z-eigenvector.
Edit intent: clarity
Original:  Our motivation comes from our recent research on spacey random walks, where the long-term dynamics of a stochastic process are governed by a dynamical system that must converge to a Z-eigenvectors of a given transition probability tensor.
Revised:  Our motivation comes from our recent research on spacey random walks, where the long-term dynamics of a stochastic process are governed by a dynamical system that must converge to a Z-eigenvectors of a transition probability tensor.
Edit intent: clarity
Original:  Our motivation comes from our recent research on spacey random walks, where the long-term dynamics of a stochastic process are governed by a dynamical system that must converge to a Z-eigenvectors of a transition probability tensor.
Revised:  Our motivation comes from our recent research on spacey random walks, where the long-term dynamics of a stochastic process are governed by a dynamical system that must converge to a Z-eigenvector of a transition probability tensor.
Edit intent: fluency
Original:  Existing graph frameworks and domain specific languages (DSLs) lack flexibility, supporting only a limited set of optimizations.
Revised:  Existing graph frameworks lack flexibility, supporting only a limited set of optimizations.
Edit intent: clarity
Original:  Programmers specify the algorithm using an algorithm language, and performance optimizations are specified using a separate scheduling language.
Revised:  Programmers specify the algorithm using an algorithm language, and performance optimizations are specified using a scheduling language.
Edit intent: clarity
Original:  The algorithm language simplifies the expression of the algorithms, while exposing opportunities for optimizations .
Revised:  The algorithm language simplifies expressing the algorithms .
Edit intent: clarity
Original:  We assemble a preprocessing suite of fast input reduction routines from the odd cycle transversal and vertex cover literature, allowing the slower branching algorithms to be compared on identically-preprocessed data.
Revised:  We assemble a preprocessing suite of fast input reduction routines from the Odd Cycle Transversal (OCT) and Vertex Cover (VC) literature, allowing the slower branching algorithms to be compared on identically-preprocessed data.
Edit intent: clarity
Original:  We assemble a preprocessing suite of fast input reduction routines from the odd cycle transversal and vertex cover literature, allowing the slower branching algorithms to be compared on identically-preprocessed data.
Revised:  We assemble a preprocessing suite of fast input reduction routines from the odd cycle transversal and vertex cover literature, allowing algorithm implementations to be compared on identically-preprocessed data.
Edit intent: clarity
Original:  We find that for heuristic solutions with time constraints under a second, iterative compression routines jump started with a heuristic solution perform best, after which it it worth the cost to use a highly tuned solver like CPLEX . Exact solutions are also dominated by ILP formulations for CPLEX , usually by an order of magnitude.
Revised:  We find that for heuristic solutions with time constraints under a second, iterative compression routines jump-started with a heuristic solution perform best, after which it it worth the cost to use a highly tuned solver like CPLEX . Exact solutions are also dominated by ILP formulations for CPLEX , usually by an order of magnitude.
Edit intent: fluency
Original:  We find that for heuristic solutions with time constraints under a second, iterative compression routines jump started with a heuristic solution perform best, after which it it worth the cost to use a highly tuned solver like CPLEX . Exact solutions are also dominated by ILP formulations for CPLEX , usually by an order of magnitude.
Revised:  We find that for heuristic solutions with time constraints under a second, iterative compression routines jump started with a heuristic solution perform best, after which point using a highly tuned solver like CPLEX . Exact solutions are also dominated by ILP formulations for CPLEX , usually by an order of magnitude.
Edit intent: clarity
Original:  These results are then compared to those on a corpus of synthetic graphs, showing that our results are robust and may generalize to other domain data.
Revised:  These results are then compared to those on a corpus of synthetic graphs, establishing robustness and potential to generalize to other domain data.
Edit intent: clarity
Original:  We assemble a preprocessing suite of fast input reduction routines from the Odd Cycle Transversal (OCT) and Vertex Cover (VC) literature, allowing algorithm implementations to be compared using Quadratic Unconstrained Binary Optimization problems from the quantum literature.
Revised:  We assemble a preprocessing suite of fast input reduction routines from the Odd Cycle Transversal (OCT) and Vertex Cover (VC) literature, and compare algorithm implementations using Quadratic Unconstrained Binary Optimization problems from the quantum literature.
Edit intent: coherence
Original:  These problems represent a wide array of graph properties, leading to harder OCT instances than in previous benchmarks.
Revised:  These problems represent a wide array of graph properties, leading to harder OCT instances than in existing benchmarks.
Edit intent: clarity
Original:  We compare our results to those on a corpus of synthetic graphs, establishing robustness and potential to generalize to other domain data  .
Revised:  We extend our results with a large corpus of synthetic graphs, establishing robustness and potential to generalize to other domain data .
Edit intent: clarity
Original: As video volumes grow, analysts have increasingly turned to deep learning to process visual data .
Revised: Recent advances in neural networks (NNs) have enabled automatic querying of large volumes of video data with high accuracy .
Edit intent: clarity
Original:  To address the computational and usability challenges of video analytics at scale, we introduce BLAZEIT , a system that optimizes queries over video for spatiotemporal information of objects . BLAZEIT accepts queries via FRAMEQL , a declarative language for exploratory video analytics , that enables video-specific query optimization.
Revised:  To address the computational and usability challenges of querying video at scale, we introduce BLAZEIT , a system that optimizes queries over video for spatiotemporal information of objects . BLAZEIT accepts queries via FRAMEQL , a declarative language for exploratory video analytics , that enables video-specific query optimization.
Edit intent: clarity
Original:  To address the computational and usability challenges of video analytics at scale, we introduce BLAZEIT , a system that optimizes queries over video for spatiotemporal information of objects . BLAZEIT accepts queries via FRAMEQL , a declarative language for exploratory video analytics , that enables video-specific query optimization.
Revised:  To address the computational and usability challenges of video analytics at scale, we introduce BlazeIt , a system that optimizes queries over video for spatiotemporal information of objects . BLAZEIT accepts queries via FRAMEQL , a declarative language for exploratory video analytics , that enables video-specific query optimization.
Edit intent: fluency
Original:  To address the computational and usability challenges of video analytics at scale, we introduce BLAZEIT , a system that optimizes queries over video for spatiotemporal information of objects . BLAZEIT accepts queries via FRAMEQL , a declarative language for exploratory video analytics , that enables video-specific query optimization.
Revised:  To address the computational and usability challenges of video analytics at scale, we introduce BLAZEIT , a system that optimizes queries of spatiotemporal information of objects . BLAZEIT accepts queries via FRAMEQL , a declarative language for exploratory video analytics , that enables video-specific query optimization.
Edit intent: clarity
Original:  To address the computational and usability challenges of video analytics at scale, we introduce BLAZEIT , a system that optimizes queries over video for spatiotemporal information of objects . BLAZEIT accepts queries via FRAMEQL , a declarative language for exploratory video analytics , that enables video-specific query optimization.
Revised:  To address the computational and usability challenges of video analytics at scale, we introduce BLAZEIT , a system that optimizes queries over video for spatiotemporal information of objects in video. BlazeIt accepts queries via FRAMEQL , a declarative language for exploratory video analytics , that enables video-specific query optimization.
Edit intent: clarity
Original:  To address the computational and usability challenges of video analytics at scale, we introduce BLAZEIT , a system that optimizes queries over video for spatiotemporal information of objects . BLAZEIT accepts queries via FRAMEQL , a declarative language for exploratory video analytics , that enables video-specific query optimization.
Revised:  To address the computational and usability challenges of video analytics at scale, we introduce BLAZEIT , a system that optimizes queries over video for spatiotemporal information of objects . BLAZEIT accepts queries via FrameQL , a declarative language for exploratory video analytics , that enables video-specific query optimization.
Edit intent: fluency
Original:  To address the computational and usability challenges of video analytics at scale, we introduce BLAZEIT , a system that optimizes queries over video for spatiotemporal information of objects . BLAZEIT accepts queries via FRAMEQL , a declarative language for exploratory video analytics , that enables video-specific query optimization.
Revised:  To address the computational and usability challenges of video analytics at scale, we introduce BLAZEIT , a system that optimizes queries over video for spatiotemporal information of objects . BLAZEIT accepts queries via FRAMEQL , a declarative extension of SQL for video analytics that enables video-specific query optimization.
Edit intent: clarity
Original:  Second, we adapt importance-sampling using specialized NNs for cardinality-limited video search (i.e. scrubbing queries).
Revised:  Second, we present a novel search algorithm for cardinality-limited video search (i.e. scrubbing queries).
Edit intent: clarity
Original: In this paper we consider weighted least squares approximation by orthogonal polynomials with a regularization term on [-1,1] . The models are better than classical least squares even most regularized least squares due to their lead to closed-form solutions.
Revised: We consider polynomial approximation over the interval [-1,1] . The models are better than classical least squares even most regularized least squares due to their lead to closed-form solutions.
Edit intent: clarity