wanyu/IteraTeR_v2 huggingface dataset:
Original:  Heuristics are decision strategies that use part of the available information ( and ignore the rest ).
Revised:  Heuristics are decision strategies that use part of the available information and ignore the rest ).
Edit intent: fluency
Original:  In so doing , they can aid to make accurate, fast, effortless, and cost-efficient decisions without that trade-offs are incurred (e. g., effort versus accuracy).
Revised:  In so doing , they can aid to make accurate, fast, effortless, and cost-efficient decisions without that trade-offs are incurred .
Edit intent: coherence
Original:  Because of their simple structure , heuristics are easy to understand and communicate and can enhance the transparency of decision-making processes.
Revised:  Because of their simplicity , heuristics are easy to understand and communicate and can enhance the transparency of decision-making processes.
Edit intent: clarity
Original:  Because of their simple structure , heuristics are easy to understand and communicate and can enhance the transparency of decision-making processes.
Revised:  Because of their simple structure , heuristics are easy to understand and communicate , enhancing the transparency of decision-making processes.
Edit intent: coherence
Original:  We introduce three bibliometrics-based heuristics and discuss how these heuristics can be employed in the evaluative practice (using the evaluation of applicants for funding programs as example) .
Revised:  We introduce three bibliometrics-based heuristics and discuss how such heuristics can be employed in the evaluative practice (using the evaluation of applicants for funding programs as example) .
Edit intent: clarity
Original:  We introduce three bibliometrics-based heuristics and discuss how these heuristics can be employed in the evaluative practice (using the evaluation of applicants for funding programs as example) .
Revised:  We introduce three bibliometrics-based heuristics and discuss how these heuristics can be employed in practice (using the evaluation of applicants for funding programs as example) .
Edit intent: clarity
Original:  In contrast to previous work, this novel perspective is particularly well-suited to make use of fine-grained data about disease outbreaks , and it lets us overcome the shortcomings of current control strategies.
Revised:  In contrast to previous work, this novel perspective is particularly well-suited to make use of fine-grained data about disease outbreaks and lets us overcome the shortcomings of current control strategies.
Edit intent: coherence
Original:  Our control strategy resorts to treatment intensities to determine who to treat and when to do so , to minimize the amount of infected individuals over time.
Revised:  Our control strategy resorts to treatment intensities to determine who to treat and when to do so to minimize the amount of infected individuals over time.
Edit intent: fluency
Original: We demonstrate the feasibility of reservoir computing based on dipole coupled nanomagnets array through macrospin simulations.
Revised: The feasibility of reservoir computing based on dipole coupled nanomagnets array through macrospin simulations.
Edit intent: clarity
Original: We demonstrate the feasibility of reservoir computing based on dipole coupled nanomagnets array through macrospin simulations.
Revised: We demonstrate the feasibility of reservoir computing based on dipole-coupled nanomagnets is demonstrated using micro-magnetic simulations.
Edit intent: clarity
Original:  We use the static magnetization directions of the nanomagnets  as reservoir states.
Revised:  We use the static magnetization directions of the nanomagnets are used as reservoir states.
Edit intent: clarity
Original:  To update the reservoir states, we change the uniaxial anisotropy along the symmetrical axis of the disk-shaped nanomagnets using a voltage induced magnetic anisotropy change . Binary tasks with AND, OR and XOR functions were performed to evaluate the performance of the nanomagnets array reservoir.
Revised:  To update these states, we change the uniaxial anisotropy along the symmetrical axis of the disk-shaped nanomagnets using a voltage induced magnetic anisotropy change . Binary tasks with AND, OR and XOR functions were performed to evaluate the performance of the nanomagnets array reservoir.
Edit intent: clarity
Original:  To update the reservoir states, we change the uniaxial anisotropy along the symmetrical axis of the disk-shaped nanomagnets using a voltage induced magnetic anisotropy change . Binary tasks with AND, OR and XOR functions were performed to evaluate the performance of the nanomagnets array reservoir.
Revised:  To update the reservoir states, we change the uniaxial anisotropy along the symmetrical axis of the disk-shaped nanomagnets using a voltage induced magnetic anisotropy change . Binary tasks with AND, OR , and XOR operations were performed to evaluate the performance of the nanomagnets array reservoir.
Edit intent: clarity
Original:  As a result, the output matrix of the reservoir computing can be trained to perform AND, OR and XOR functions with an input delay of up to three steps .
Revised:  As a result, the output matrix of the reservoir computing can be trained to perform AND, OR , and XOR operations with an input delay of up to three steps .
Edit intent: clarity
Original:  As a result, the output matrix of the reservoir computing can be trained to perform AND, OR and XOR functions with an input delay of up to three steps .
Revised:  As a result, the output matrix of the reservoir computing can be trained to perform AND, OR and XOR functions with an input delay of up to three bits .
Edit intent: clarity
Original: Feature representation of different modalities is the main focus of current cross-modal information retrieval research . Existing models typically project texts and images into the same embedding space.
Revised: Feature modeling of different modalities is the main focus of current cross-modal information retrieval research . Existing models typically project texts and images into the same embedding space.
Edit intent: clarity
Original: Feature representation of different modalities is the main focus of current cross-modal information retrieval research . Existing models typically project texts and images into the same embedding space.
Revised: Feature representation of different modalities is a basic problem in current research of cross-modal information retrieval research . Existing models typically project texts and images into the same embedding space.
Edit intent: clarity
Original: Feature representation of different modalities is the main focus of current cross-modal information retrieval research . Existing models typically project texts and images into the same embedding space.
Revised: Feature representation of different modalities is the main focus of current cross-modal information retrieval . Existing models typically project texts and images into the same embedding space.
Edit intent: clarity
Original:  Specifically, texts are represented by a graph generated using various textural relationships including semantic relations, statistical co-occurrence, and predefined knowledge base.
Revised:  Specifically, texts are represented by a graph generated using various textural relationships including semantic relations, statistical co-occurrence, and prior relations in the knowledge base.
Edit intent: clarity
Original:  A joint neural model is proposed to learn feature representation individually in each modality .
Revised:  A dual-path neural network is adopted to learn multi-modal representations of information and cross-modal similarity measure jointly .
Edit intent: clarity
Original:  We use  Graph Convolutional Network (GCN) to capture relation-aware representations of texts and Convolutional Neural Network (CNN) to learn image representations.
Revised:  We use a Graph Convolutional Network (GCN) to capture relation-aware representations of texts and Convolutional Neural Network (CNN) to learn image representations.
Edit intent: fluency
Original:  We use  Graph Convolutional Network (GCN) to capture relation-aware representations of texts and Convolutional Neural Network (CNN) to learn image representations.
Revised:  We use Graph Convolutional Network (GCN) for generating relation-aware representations of texts and Convolutional Neural Network (CNN) to learn image representations.
Edit intent: clarity
Original:  We use  Graph Convolutional Network (GCN) to capture relation-aware representations of texts and Convolutional Neural Network (CNN) to learn image representations.
Revised:  We use Graph Convolutional Network (GCN) to capture relation-aware text representations, and use a Convolutional Neural Network (CNN) to learn image representations.
Edit intent: coherence
Original:  The results show that our model outperforms the state-of-the-art models significantly by 6.3\% on the CMPlaces data and 3.4\% on English Wikipedia, respectively .
Revised:  The results show that our model outperforms the state-of-the-art models by 3.4\% and 6.3\% on accuracy on two benchmark datasets .
Edit intent: clarity
Original: We consider an asexually reproducing population on a finite trait space whose evolution is driven by exponential birth, death and competition rates, as well as the possibility of mutation at a birth event.
Revised: We consider an asexually reproducing population on a finite type space whose evolution is driven by exponential birth, death and competition rates, as well as the possibility of mutation at a birth event.
Edit intent: clarity
Original:  On the individual-based level this population can be modeled as a measure-valued Markov process.
Revised:  On the individual-based level this population can be modelled as a measure-valued Markov process.
Edit intent: fluency
Original:  We consider the deterministic system, resulting from the large population limit, and  let the mutation probability tend to zero.
Revised:  We consider the deterministic system, resulting from the large population limit, and then let the mutation probability tend to zero.
Edit intent: coherence
Original:  This corresponds to a much higher frequency of mutations, where multiple subcritical traits are present at the same time.
Revised:  This corresponds to a much higher frequency of mutations, where multiple microscopic types are present at the same time.
Edit intent: clarity
Original:  The limiting process is a deterministic adaptive walk that jumps between different equilibria of coexisting traits .
Revised:  The limiting process is a deterministic adaptive walk that jumps between different equilibria of coexisting types .
Edit intent: clarity
Original:  The graph structure on the trait space, determined by the possibilities to mutate, plays an important role in defining the adaptive walk .
Revised:  The graph structure on the type space, determined by the possibilities to mutate, plays an important role in defining the adaptive walk .
Edit intent: clarity
Original:  The graph structure on the trait space, determined by the possibilities to mutate, plays an important role in defining the adaptive walk .
Revised:  The graph structure on the trait space, determined by the possibilities to mutate, plays an important role in defining this jump process .
Edit intent: clarity
Original: We consider the exact channel synthesis problem , which is the problem of determining how much information is required to create exact correlation remotely when there is a certain amount of randomness shared by two terminals.
Revised: We consider the exact channel synthesis problem . This problem concerns the determination of the minimum amount of information required to create exact correlation remotely when there is a certain amount of randomness shared by two terminals.
Edit intent: clarity
Original: We consider the exact channel synthesis problem , which is the problem of determining how much information is required to create exact correlation remotely when there is a certain amount of randomness shared by two terminals.
Revised: We consider the exact channel synthesis problem , which is the problem of determining how much information is required to create exact correlation remotely when there is a certain rate of randomness shared by two terminals.
Edit intent: clarity
Original:  This problem generalizes an existing approximate version, in which the generated joint distribution is restricted to be close to a target distribution under the total variation (TV) distance measure , instead being exactly equal to the target distribution .
Revised:  This problem generalizes an existing approximate version, in which the generated joint distribution is required to be close to a target distribution under the total variation (TV) distance measure , instead being exactly equal to the target distribution .
Edit intent: clarity
Original:  This problem generalizes an existing approximate version, in which the generated joint distribution is restricted to be close to a target distribution under the total variation (TV) distance measure , instead being exactly equal to the target distribution .
Revised:  This problem generalizes an existing approximate version, in which the generated joint distribution is restricted to be close to a target distribution under the total variation (TV) distance measure ( instead being exactly equal to the target distribution .
Edit intent: fluency
Original:  Furthermore, our bounds coincide for doubly symmetric binary sources (or binary symmetric channels), which implies that for such sources, the admissible rate region is completely characterized .
Revised:  Furthermore, our bounds coincide for doubly symmetric binary sources .
Edit intent: clarity
Original:  We observe that for such sources, the admissible rate region for exact channel synthesis is strictly larger than that for TV-approximate version.
Revised:  We observe that for such sources, the admissible rate region for exact channel synthesis is strictly included in that for the TV-approximate version.
Edit intent: clarity
Original: We introduce the multivariate decomposition finite element method (MDFEM) for solving elliptic PDEs with uniform random diffusion coefficients.
Revised: We introduce the multivariate decomposition finite element method (MDFEM) for solving elliptic PDEs with uniform random diffusion coefficients.
Edit intent: fluency
Original:  As a first contribution we adjust the analysis of the multivariate decomposition method to incorporate the log-factor which may or may not appear in error bounds for multivariate quadrature, i.e., cubature, methods;
Revised:  Our first result adjusts the analysis of the multivariate decomposition method to incorporate the log-factor which may or may not appear in error bounds for multivariate quadrature, i.e., cubature, methods;
Edit intent: clarity
Original:  As a first contribution we adjust the analysis of the multivariate decomposition method to incorporate the log-factor which may or may not appear in error bounds for multivariate quadrature, i.e., cubature, methods;
Revised:  As a first contribution we adjust the analysis of the multivariate decomposition method to incorporate the log-factor which typically appears in error bounds for multivariate quadrature, i.e., cubature, methods;
Edit intent: clarity
Original:  as this is needed for our analysis .
Revised:  and we take care of the fact that the number of points n needs to come, e.g., in powers of 2 for higher order approximations .
Edit intent: coherence
Original:  The second and main contribution then presents a bound on the error of the MDFEM and shows higher-order convergence w.r.t. \ the total computational cost in case of the higher-order polynomial lattice rules in combination with a higher-order finite element method.
Revised:  The second and main contribution then presents a bound on the error of the MDFEM and shows higher-order convergence w.r.t. the total computational cost in case of the higher-order polynomial lattice rules in combination with a higher-order finite element method.
Edit intent: clarity
Original: We study the resolvent for non-trapping obstacles on manifolds with Euclidean ends.
Revised: We study the resolvent for nontrapping obstacles on manifolds with Euclidean ends.
Edit intent: fluency
Original:  Although there are many tools for program comprehension through debugging or slicing, few (if any) scale to a complicated model such as the Community Earth System Model (CESM ^{TM enable developers to trace a problem detected in the model output to its source , we devise a series of techniques to reduce the search space  to a tractable size .
Revised:  Although there are many tools for program comprehension through debugging or slicing, few (if any) scale to a model as large as the Community Earth System Model (CESM ^{TM enable developers to trace a problem detected in the model output to its source , we devise a series of techniques to reduce the search space to a tractable size .
Edit intent: clarity
Original:  Although there are many tools for program comprehension through debugging or slicing, few (if any) scale to a complicated model such as the Community Earth System Model (CESM ^{TM enable developers to trace a problem detected in the model output to its source , we devise a series of techniques to reduce the search space  to a tractable size .
Revised:  Although there are many tools for program comprehension through debugging or slicing, few (if any) scale to a complicated model such as the Community Earth System Model (CESM ^{TM enable developers to trace a problem detected through the CESM output to its source , we devise a series of techniques to reduce the search space to a tractable size .
Edit intent: clarity
Original:  Although there are many tools for program comprehension through debugging or slicing, few (if any) scale to a complicated model such as the Community Earth System Model (CESM ^{TM enable developers to trace a problem detected in the model output to its source , we devise a series of techniques to reduce the search space  to a tractable size .
Revised:  Although there are many tools for program comprehension through debugging or slicing, few (if any) scale to a complicated model such as the Community Earth System Model (CESM ^{TM enable developers to trace a problem detected in the model output to its source . To this end, our strategy is to reduce the search space to a tractable size .
Edit intent: clarity
Original:  The traditional diagnostic marker of osteoporosis, bone mineral density (BMD), has been shown in  experiments to correlate poorly with fracture resistance when considered on its own, while structural features in conjunction with BMD can explain more of the variation in trabecular bone strength.
Revised:  The traditional diagnostic marker of osteoporosis, bone mineral density (BMD), has been shown in ex vivo experiments to correlate poorly with fracture resistance when considered on its own, while structural features in conjunction with BMD can explain more of the variation in trabecular bone strength.
Edit intent: clarity
Original:  At the VOI scale, we find significant correlations between the stiffness of VOIs and ten different structural metrics.
Revised:  At the VOI scale, we find significant correlations between the stiffness of VOIs and 10 different structural metrics.
Edit intent: fluency
Original:  In a linear fit, we find that  weighted node degree, Z-orientation, weighted Z-orientation  , and the number of links are the structural metrics that are most significant (p < 0.05) in capturing the variation of stiffness in trabecular networks.
Revised:  In a linear fit, we find that node degree, weighted node degree, Z-orientation, weighted Z-orientation , and the number of links are the structural metrics that are most significant (p < 0.05) in capturing the variation of stiffness in trabecular networks.
Edit intent: fluency
Original: \%!TEX root = main.tex We study the problem of completely automatically verifying uninterpreted programs---programs that work over arbitrary data models that provide an interpretation for the constants, functions and relations the program uses.
Revised:  We study the problem of completely automatically verifying uninterpreted programs---programs that work over arbitrary data models that provide an interpretation for the constants, functions and relations the program uses.
Edit intent: coherence
Original:  The main contribution of this paper is a subclass of programs, called \emph{coherent programs that admits decidable verification, and can be decided in %DIFDELCMD < {\sc %DIFDELCMD < %%% Pspace .
Revised:  The main contribution of this paper is a subclass of programs, called \emph{coherent programs that admits decidable verification, and can be decided in %DIFDELCMD < {\sc %DIFDELCMD < %%% Pspace .
Edit intent: fluency
Original:  The main contribution of this paper is a subclass of programs, called \emph{coherent programs that admits decidable verification, and can be decided in %DIFDELCMD < {\sc %DIFDELCMD < %%% Pspace .
Revised:  The main contribution of this paper is a subclass of programs, called \emph{coherent programs that admits decidable verification, and can be decided in %DIFDELCMD < {\sc %DIFDELCMD < %%% PSPACE .
Edit intent: fluency
Original:  These algorithms are evidence that their corresponding problems do not yield exponential quantum speedups .
Revised:  These algorithms indicate that their corresponding problems do not yield exponential quantum speedups .
Edit intent: clarity
Original:  We introduce a classical algorithm modelthat assumes we ] can efficiently perform \ell^2-norm samples of input data, a natural analogue to quantum algorithms assuming efficient state preparation  .
Revised:  We introduce a classical algorithm modelthat assumes we ] can efficiently perform \ell^2-norm samples of input data, a natural analogue to quantum algorithms that assume efficient state preparation .
Edit intent: fluency
Original:  We consider two types of pheromone fields: one emanating from the nest, and other actively produced by ants in their nest bound journey after finding a food source.
Revised:  We consider two types of pheromone fields: one emanating from the nest, and other actively produced by ants in their nest-bound journey after finding a food source.
Edit intent: fluency
Original:  The model yields, under certain assumptions on the parameters, that ants can successfully recruit others to food sources, and that a trail network pattern will emerge .
Revised:  The model yields, under certain assumptions on the parameters, that ants can successfully recruit others to food sources, and colony-wide trail networks .
Edit intent: clarity
Original:  Inspired by TileBars, a classic term distribution visualization method, in this paper, we propose a novel Neu-IR model that models query-to-document matching at the subtopic and higher levels.
Revised:  Inspired by TileBars, a classical term distribution visualization method, in this paper, we propose a novel Neu-IR model that models query-to-document matching at the subtopic and higher levels.
Edit intent: fluency
Original:  Inspired by TileBars, a classic term distribution visualization method, in this paper, we propose a novel Neu-IR model that models query-to-document matching at the subtopic and higher levels.
Revised:  Inspired by TileBars, a classic term distribution visualization method, in this paper, we propose a novel Neu-IR model that handles query-to-document matching at the subtopic and higher levels.
Edit intent: clarity
Original:  Our system first splits the documents into topical segments, "visualizes" the matching between the query and the segments, and then feeds the interaction matrix into a Neu-IR model, DeepTileBars, to obtain the final ranking score .
Revised:  Our system first splits the documents into topical segments, "visualizes" the matchings between the query and the segments, and then feeds the interaction matrix into a Neu-IR model, DeepTileBars, to obtain the final ranking score .
Edit intent: fluency