wanyu/IteraTeR_v2 huggingface dataset:
Original:  A key technical ingredient in our paper is a new `valuation tracking' subroutine, which tracks the possible values for the optimum, and follows the most  inventory-conservative  control which maintains the desired competitive ratio  .
Revised:  A key technical ingredient in our paper is a new `valuation tracking' subroutine, which tracks the possible values for the optimum, and follows the most " inventory-conservative control which maintains the desired competitive ratio .
Edit intent: fluency
Original:  A key technical ingredient in our paper is a new `valuation tracking' subroutine, which tracks the possible values for the optimum, and follows the most  inventory-conservative  control which maintains the desired competitive ratio  .
Revised:  A key technical ingredient in our paper is a new `valuation tracking' subroutine, which tracks the possible values for the optimum, and follows the most inventory-conservative " control which maintains the desired competitive ratio .
Edit intent: fluency
Original: We introduce rook visibility, which is a new model of visibility for the art gallery problem when the gallery is a polyomino, the union of square tiles from a square grid  .
Revised: How many chess rooks or queens does it take to guard all the squares of a given polyomino, the union of square tiles from a square grid .
Edit intent: clarity
Original: This paper tackles the problem of learning brain-visual representations for understanding and neural processes behind human visual perception , with a view towards replicating these processes into machines.
Revised: This work presents a novel method of exploring human brain-visual representations for understanding and neural processes behind human visual perception , with a view towards replicating these processes into machines.
Edit intent: clarity
Original: This paper tackles the problem of learning brain-visual representations for understanding and neural processes behind human visual perception , with a view towards replicating these processes into machines.
Revised: This paper tackles the problem of learning brain-visual representations , with a view towards replicating these processes into machines.
Edit intent: coherence
Original: This paper tackles the problem of learning brain-visual representations for understanding and neural processes behind human visual perception , with a view towards replicating these processes into machines.
Revised: This paper tackles the problem of learning brain-visual representations for understanding and neural processes behind human visual perception , with a view towards replicating these processes in machines.
Edit intent: fluency
Original:  Performance analysis shows that neural signals can be used to effectively supervise the training of deep learning models, as demonstrated by the achieved performance in both image classification and saliency detection .
Revised:  Performance analysis shows that neural signals can be used to effectively supervise the training of deep learning models, as demonstrated by the high performance of image classification and saliency detection .
Edit intent: clarity
Original:  Furthermore, the learned brain-visual manifold is consistent with cognitive neuroscience literature about visual perception and , most importantly, highlights new associations between brain areas, image patches and computational kernels.
Revised:  Furthermore, the learned brain-visual manifold is consistent with cognitive neuroscience work related to visual perception and , most importantly, highlights new associations between brain areas, image patches and computational kernels.
Edit intent: clarity
Original:  By expanding the S_N transport operator in the mean free path \varepsilon and employing a rigorous).
Revised:  DSA preconditioners address the need to accelerate solving SN transport when the mean free path \varepsilon and employing a rigorous).
Edit intent: clarity
Original:  By expanding the SN transport operator in \varepsilon and employing a } singular matrix perturbation analysis, we derive a DSA matrix that reduces to the symmetric interior penalty (SIP) DG discretization of the continuum diffusion equation when the mesh is first-order and the total opacity is constant.
Revised:  By expanding the SN transport operator in \varepsilon and employing a } singular matrix perturbation analysis, we derive a DSA matrix that reduces to the symmetric interior penalty (SIP) DG discretization of diffusion when the mesh is first-order and the total opacity is constant.
Edit intent: clarity
Original:  We prove that preconditioning the HO DG S_N transport equation with the SIP DSA matrix results in an \mathcal{O}%DIFDELCMD < \left( %%% \varepsilon%DIFDELCMD < \right) %DIFDELCMD < %%%  perturbation of the identity, and fixed-point iteration therefore converges rapidly for optically thick problems.
Revised:  We prove that preconditioning HO DG SN transport with the SIP DSA matrix results in an \mathcal{O}%DIFDELCMD < \left( %%% \varepsilon%DIFDELCMD < \right) %DIFDELCMD < %%% perturbation of the identity, and fixed-point iteration therefore converges rapidly for optically thick problems.
Edit intent: clarity
Original:  The analysis is extended to the case of HO (curved) meshes, where so-called mesh cycles can result from elements both being upwind of each other (for a given discrete photon direction) .
Revised:  The analysis is extended to the case of HO (curved) meshes, where so-called mesh cycles can result from elements both being upwind of each other .
Edit intent: clarity
Original:  The theoretical results are validated by numerical experiments on a HO, highly curved "triple-point" mesh, generated from an arbitrary Lagrangian-Eulerian hydrodynamics code .
Revised:  Theoretical results are validated by numerical experiments on a HO, highly curved "triple-point" mesh, generated from an arbitrary Lagrangian-Eulerian hydrodynamics code .
Edit intent: fluency
Original:  The theoretical results are validated by numerical experiments on a HO, highly curved "triple-point" mesh, generated from an arbitrary Lagrangian-Eulerian hydrodynamics code .
Revised:  The theoretical results are validated by numerical experiments on HO, highly curved "triple-point" mesh, generated from an arbitrary Lagrangian-Eulerian hydrodynamics code .
Edit intent: fluency
Original:  The theoretical results are validated by numerical experiments on a HO, highly curved "triple-point" mesh, generated from an arbitrary Lagrangian-Eulerian hydrodynamics code .
Revised:  The theoretical results are validated by numerical experiments on a HO, highly curved meshes generated from an arbitrary Lagrangian-Eulerian hydrodynamics code .
Edit intent: clarity
Original: We explore a collaborative multi-agent reinforcement learning setting where a team of agents attempts to solve cooperative tasks in partially-observable environments.
Revised: We propose a targeted communication architecture for multi-agent reinforcement learning setting where a team of agents attempts to solve cooperative tasks in partially-observable environments.
Edit intent: clarity
Original:  Additionally, we introduce a multi-stage communication approach where the agents co-ordinate via multiple rounds of communication before taking actions in the environment.
Revised:  We additionally augment this with a multi-round communication approach where the agents co-ordinate via multiple rounds of communication before taking actions in the environment.
Edit intent: clarity
Original:  Additionally, we introduce a multi-stage communication approach where the agents co-ordinate via multiple rounds of communication before taking actions in the environment.
Revised:  Additionally, we introduce a multi-stage communication approach where agents coordinate via multiple rounds of communication before taking actions in the environment.
Edit intent: coherence
Original:  We evaluate our approach on a diverse set of cooperative multi-agent tasks, of varying difficulties, with varying number of agents, in a variety of environments ranging from 2D grid layouts of shapes and simulated traffic junctions to complex 3D indoor environments .
Revised:  We evaluate our approach on a diverse set of cooperative multi-agent tasks, of varying difficulties, with varying number of agents, in a variety of environments ranging from 2D grid layouts of shapes and simulated traffic junctions to 3D indoor environments .
Edit intent: clarity
Original:  We demonstrate the benefits of targeted as well as multi-stage communication.
Revised:  We demonstrate the benefits of targeted and multi-round communication.
Edit intent: clarity
Original:  Moreover, we show that the targeted communication strategies learned by agents are both interpretable and intuitive  .
Revised:  Moreover, we show that the targeted communication strategies learned by agents are interpretable and intuitive .
Edit intent: clarity
Original: The endangered Amur tiger (Panthera tigris altaica) is confined primarily to a narrow area along the border with Russia in Northeast China.
Revised: The endangered Amur tiger is confined primarily to a narrow area along the border with Russia in Northeast China.
Edit intent: clarity
Original:  at this location, the prey base and land use patterns are distinctly different from those in the larger , Sikhote-Alin population . Using dietary analysis of scats and camera-trapping data from Hunchun Nature Reserve, we assessed spatiotemporal overlap by tigers and their prey and identified prey selection patterns to enhance understanding of the ecological requirements of tigers in Northeast China.
Revised:  at this location, the prey base and land use patterns are distinctly different from those in the larger , Sikhote-Alin population . Using dietary analysis of scats and camera-trapping data from Hunchun Nature Reserve, we assessed spatiotemporal overlap of tigers and their prey and identified prey selection patterns to enhance understanding of the ecological requirements of tigers in Northeast China.
Edit intent: fluency
Original:  Two species, wild boar (Sus scrofa) and sika deer (Cervus nippon) , collectively represented 82.1 \% of the biomass consumed by tigers.
Revised:  Two species, wild boar and sika deer (Cervus nippon) , collectively represented 82.1 \% of the biomass consumed by tigers.
Edit intent: clarity
Original:  Two species, wild boar (Sus scrofa) and sika deer (Cervus nippon) , collectively represented 82.1 \% of the biomass consumed by tigers.
Revised:  Two species, wild boar (Sus scrofa) and sika deer , collectively represented 82.1 \% of the biomass consumed by tigers.
Edit intent: clarity
Original:  Two species, wild boar (Sus scrofa) and sika deer (Cervus nippon) , collectively represented 82.1 \% of the biomass consumed by tigers.
Revised:  Two species, wild boar (Sus scrofa) and sika deer (Cervus nippon) , collectively represented 83 \% of the biomass consumed by tigers.
Edit intent: clarity
Original:  Tigers exhibit significant spatial overlap with sika deer, likely favoring a high level of tiger predation on this additional large-sized ungulate.
Revised:  Tigers exhibit significant spatial overlap with sika deer, likely favoring a high level of tiger predation on this large-sized ungulate.
Edit intent: clarity
Original:  For the fixed topologies of data and energy, we formulate the optimization problem when the data flow remains constant on all data links and each sensor node harvests energy only once at a time slot.
Revised:  For the fixed topologies of data and energy, we formulate the optimization problem when the data flow remains constant on all data links and each sensor node harvests energy only once in a time slot.
Edit intent: clarity
Original:  HYPE improves partitioning quality by up to 95\% and reduces runtime by up to 39\% compared to the state of the art .
Revised:  HYPE improves partitioning quality by up to 95\% and reduces runtime by up to 39\% compared to streaming partitioning .
Edit intent: clarity
Original:  To overcome these limitations, \mbox{ szekely2007measuring proposed distance covariance as a weighted L_2 distance between the joint characteristic function and the product of marginal distributions.
Revised:  To overcome these limitations, Szekely et al.(2007) proposed distance covariance as a weighted L_2 distance between the joint characteristic function and the product of marginal distributions.
Edit intent: clarity
Original:  and (2) prove a  strong soundness theorem of these proof rules showing that partial correctness is well maintained at each step of transitions in the operational semantics of a  parallel quantum program  .
Revised:  (2) prove a strong soundness theorem of these proof rules showing that partial correctness is well maintained at each step of transitions in the operational semantics of a parallel quantum program .
Edit intent: coherence
Original:  and (2) prove a  strong soundness theorem of these proof rules showing that partial correctness is well maintained at each step of transitions in the operational semantics of a  parallel quantum program  .
Revised:  and (2) prove a strong soundness theorem of the proof rules showing that partial correctness is well maintained at each step of transitions in the operational semantics of a parallel quantum program .
Edit intent: fluency
Original: We ] ] ] define the concepts of negative representation, in which a shift in electorate opinions produces a shift in the election outcome in the opposite direction, and electoral instability, in which an arbitrarily small change in opinion causes a large change in election outcome.
Revised: We ] ] ]. Here, we define the concepts of negative representation, in which a shift in electorate opinions produces a shift in the election outcome in the opposite direction, and electoral instability, in which an arbitrarily small change in opinion causes a large change in election outcome.
Edit intent: coherence
Original:  Recent work has also demonstrated how techniques from type-directed program synthesis can be used to efficiently synthesize a very simple class of lenses --- so-called bijective lenses over string data --- given a pair of types (regular expressions) and a small number of examples.
Revised:  Recent work has demonstrated how techniques from type-directed program synthesis can be used to efficiently synthesize a very simple class of lenses --- so-called bijective lenses over string data --- given a pair of types (regular expressions) and a small number of examples.
Edit intent: clarity
Original:  Recent work has also demonstrated how techniques from type-directed program synthesis can be used to efficiently synthesize a very simple class of lenses --- so-called bijective lenses over string data --- given a pair of types (regular expressions) and a small number of examples.
Revised:  Recent work has also demonstrated how techniques from type-directed program synthesis can be used to efficiently synthesize a simple class of lenses --- so-called bijective lenses over string data --- given a pair of types (regular expressions) and a small number of examples.
Edit intent: clarity
Original:  Recent work has also demonstrated how techniques from type-directed program synthesis can be used to efficiently synthesize a very simple class of lenses --- so-called bijective lenses over string data --- given a pair of types (regular expressions) and a small number of examples.
Revised:  Recent work has also demonstrated how techniques from type-directed program synthesis can be used to efficiently synthesize a very simple class of lenses---bijective lenses over string data---given a pair of types (regular expressions) and a small number of examples.
Edit intent: clarity
Original:  Recent work has also demonstrated how techniques from type-directed program synthesis can be used to efficiently synthesize a very simple class of lenses --- so-called bijective lenses over string data --- given a pair of types (regular expressions) and a small number of examples.
Revised:  Recent work has also demonstrated how techniques from type-directed program synthesis can be used to efficiently synthesize a very simple class of lenses --- so-called bijective lenses over string data --- given a pair of types (regular expressions) and examples.
Edit intent: clarity
Original:  We show how to extend this synthesis algorithm to a much wider class of lenses, which we call simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, as well as a rich subset of the full-blown "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not rely on persistent internal state.
Revised:  We extend this synthesis algorithm to a much wider class of lenses, which we call simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, as well as a rich subset of the full-blown "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not rely on persistent internal state.
Edit intent: coherence
Original:  We show how to extend this synthesis algorithm to a much wider class of lenses, which we call simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, as well as a rich subset of the full-blown "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not rely on persistent internal state.
Revised:  We show how to extend this synthesis algorithm to a broader class of lenses, which we call simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, as well as a rich subset of the full-blown "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not rely on persistent internal state.
Edit intent: clarity
Original:  We show how to extend this synthesis algorithm to a much wider class of lenses, which we call simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, as well as a rich subset of the full-blown "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not rely on persistent internal state.
Revised:  We show how to extend this synthesis algorithm to a much wider class of lenses, called simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, as well as a rich subset of the full-blown "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not rely on persistent internal state.
Edit intent: coherence
Original:  We show how to extend this synthesis algorithm to a much wider class of lenses, which we call simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, as well as a rich subset of the full-blown "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not rely on persistent internal state.
Revised:  We show how to extend this synthesis algorithm to a much wider class of lenses, which we call simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, and a subset of the full-blown "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not rely on persistent internal state.
Edit intent: clarity
Original:  We show how to extend this synthesis algorithm to a much wider class of lenses, which we call simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, as well as a rich subset of the full-blown "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not rely on persistent internal state.
Revised:  We show how to extend this synthesis algorithm to a much wider class of lenses, which we call simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, as well as a rich subset of the "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not rely on persistent internal state.
Edit intent: coherence
Original:  We show how to extend this synthesis algorithm to a much wider class of lenses, which we call simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, as well as a rich subset of the full-blown "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not rely on persistent internal state.
Revised:  We show how to extend this synthesis algorithm to a much wider class of lenses, which we call simple symmetric lenses, including both bijective lensesand the more widely used "asymmetric" lenses, as well as a rich subset of the full-blown "symmetric lenses" . Simple symmetric lenses are of independent theoretical interest, being the largest class of symmetric lenses that do not use persistent internal state.
Edit intent: clarity
Original:  Synthesizing simple symmetric lenses is substantially more challenging that synthesizing bijective lenses: Since some of the information on each side can be "disconnected" from the other side, there will in general be many lenses that agree with a given example.
Revised:  Synthesizing simple symmetric lenses is more challenging than synthesizing bijective lenses: Since some of the information on each side can be "disconnected" from the other side, there will in general be many lenses that agree with a given example.
Edit intent: clarity
Original:  Synthesizing simple symmetric lenses is substantially more challenging that synthesizing bijective lenses: Since some of the information on each side can be "disconnected" from the other side, there will in general be many lenses that agree with a given example.
Revised:  Synthesizing simple symmetric lenses is substantially more challenging that synthesizing bijective lenses: Since some of the information on each side can be "disconnected" from the other side, there will typically be many lenses that agree with a given example.
Edit intent: clarity
Original:  To guide the search process, we use stochastic regular expressions and ideas from information theory to estimate the amount of information propagated by a candidate lens  .
Revised:  To guide the search process, we use stochastic regular expressions and information theory to estimate the amount of information propagated by a candidate lens .
Edit intent: clarity
Original:  We evaluate its performance on 48 benchmark examples drawn from Flash Fill, Augeus, the bidirectional programming literature , and electronic file format synchronization tasks.
Revised:  We evaluate its performance on 48 benchmark examples drawn from Flash Fill, Augeas, and the bidirectional programming literature , and electronic file format synchronization tasks.
Edit intent: clarity
Original:  After modest tuning, which is encouraged by the interactive nature of the tool, our implementation can synthesize all these lenses in under 30 seconds.
Revised:  After modest tuning, which is encouraged by the interactive nature of the tool, our implementation can synthesize each of these lenses in under 30 seconds.
Edit intent: clarity
Original:  In this model a discrete lattice repesents a DNA strand while each of the particles that hop on it unidirectionally, from site to site, represents a RNA polymerase (RNAP).
Revised:  In this model a discrete lattice represents a DNA strand while each of the particles that hop on it unidirectionally, from site to site, represents a RNA polymerase (RNAP).
Edit intent: fluency
Original: A good convergence metric must satisfy two requirements: feasible in calculation and rigorous in analysis.
Edit intent: coherence