wanyu/IteraTeR_v2 huggingface dataset:
Original:  This paper provides a tutorial on a recently-developed full-stack mmWave module integrated into the widely-used open-source ns--3 simulator.
Revised:  This paper provides a tutorial on a recently developed full-stack mmWave module integrated into the widely-used open-source ns--3 simulator.
Edit intent: fluency
Original:  This paper provides a tutorial on a recently-developed full-stack mmWave module integrated into the widely-used open-source ns--3 simulator.
Revised:  This paper provides a tutorial on a recently-developed full-stack mmWave module integrated into the widely used open-source ns--3 simulator.
Edit intent: fluency
Original:  The problem can be seen as the set-partitioning problem, reminding us of its integer programming ~ (IP) formulation.
Revised:  The problem can be seen as the set-partitioning problem, reminding us of its integer programming (IP) formulation.
Edit intent: fluency
Original:  Above all, we formulate the column generation subproblem to be solved repeatedly as a simple mixed integer linear programming ~ (MILP) problem.
Revised:  Above all, we formulate the column generation subproblem to be solved repeatedly as a simple mixed integer linear programming (MILP) problem.
Edit intent: fluency
Original: This paper presents an exact algorithm for the maximization of modularity density, a more complicated criterion to overcome drawbacks of the well-known modularity for clustering of an undirected graph .
Revised: For clustering of an undirected graph, this paper presents an exact algorithm for the maximization of modularity density, a more complicated criterion to overcome drawbacks of the well-known modularity for clustering of an undirected graph .
Edit intent: fluency
Original: This paper presents an exact algorithm for the maximization of modularity density, a more complicated criterion to overcome drawbacks of the well-known modularity for clustering of an undirected graph .
Revised: This paper presents an exact algorithm for the maximization of modularity density, a more complicated criterion to overcome drawbacks of the well-known modularity .
Edit intent: coherence
Original:  The problem can be seen as the set-partitioning problem, reminding us of its integer programming (IP ) formulation.
Revised:  The problem can be interpreted as the set-partitioning problem, reminding us of its integer programming (IP ) formulation.
Edit intent: clarity
Original:  The problem can be seen as the set-partitioning problem, reminding us of its integer programming (IP ) formulation.
Revised:  The problem can be seen as the set-partitioning problem, which reminds us of its integer programming (IP ) formulation.
Edit intent: coherence
Original:  We provide a branch-and-price framework for solving this IP , or column generation combined with branch-and-bound.
Revised:  We provide a branch-and-price framework for solving this ILP , or column generation combined with branch-and-bound.
Edit intent: clarity
Original:  Above all, we formulate the column generation subproblem to be solved repeatedly as a simple mixed integer linear programming (MILP) problem.
Revised:  Above all, we formulate the column generation subproblem to be solved repeatedly as a simpler mixed integer linear programming (MILP) problem.
Edit intent: fluency
Original:  We also incorporate several acceleration techniques , including ones called the set-packing relaxation and the multiple-cutting-planes-at-a-time .
Revised:  Acceleration techniques called the set-packing relaxation and the multiple-cutting-planes-at-a-time .
Edit intent: clarity
Original:  Several famous test instances are solved to optimality, one of which has over 100 vertices and is done within nine minutes by a PC.
Revised:  Several famous test instances including ones with over 100 vertices and is done within nine minutes by a PC.
Edit intent: clarity
Original:  Naturally different sets of amenities may have a different ``gains'' (monetary or otherwise) for a host.
Revised:  Naturally different sets of amenities may have a different "gains" for a host.
Edit intent: clarity
Original:  The cycles are generated by an LFSR with a chosen period e whose irreducible characteristic polynomial can be derived from any primitive polynomial of degree n satisfying e = 2^n-1{t that determining Zech's logarithms is equivalent to identifying conjugate pairs shared by any pair of cycles.
Revised:  The cycles are generated by an LFSR with a chosen period . We prove that determining Zech's logarithms is equivalent to identifying conjugate pairs shared by any pair of cycles.
Edit intent: coherence
Original:  When the characteristic polynomial f(x) is a product of distinct irreducible polynomials, we combine the approach via Zech's logarithms and a recently proposed method to determine the conjugate pairs.
Revised:  When the characteristic polynomial f(x) is a product of distinct irreducible polynomials, the approach via Zech's logarithms and a recently proposed method to determine the conjugate pairs.
Edit intent: coherence
Original:  This work shows how to combine Zech's logarithms and each of the two techniques to efficiently construct binary de Bruijn sequences of large orders . A basic implementation is supplied as a proof-of-concept.
Revised:  This work shows how to combine Zech's logarithms and each of the two techniques to efficiently construct binary de Bruijn sequences of any order . A basic implementation is supplied as a proof-of-concept.
Edit intent: clarity
Original:  In the cycle joining method, the cycles are generated by an LFSR with a chosen period .
Revised:  The cycles, in the cycle joining method, the cycles are generated by an LFSR with a chosen period .
Edit intent: fluency
Original:  In the cycle joining method, the cycles are generated by an LFSR with a chosen period .
Revised:  In the cycle joining method, are typically generated by a linear feedback shift register .
Edit intent: clarity
Original:   The characterization of conjugate pairs via Zech's logarithms  as positional markings  is then adapted into identifying cross-join pairs in a de Bruijn sequence.
Revised:  The characterization of conjugate pairs via Zech's logarithms , as positional markings is then adapted into identifying cross-join pairs in a de Bruijn sequence.
Edit intent: fluency
Original:   The characterization of conjugate pairs via Zech's logarithms  as positional markings  is then adapted into identifying cross-join pairs in a de Bruijn sequence.
Revised:  The characterization of conjugate pairs via Zech's logarithms as positional markings , is then adapted into identifying cross-join pairs in a de Bruijn sequence.
Edit intent: fluency
Original:   The characterization of conjugate pairs via Zech's logarithms  as positional markings  is then adapted into identifying cross-join pairs in a de Bruijn sequence.
Revised:  The characterization of conjugate pairs via Zech's logarithms as positional markings is then adapted to identify cross-join pairs in a de Bruijn sequence.
Edit intent: fluency
Original:  We start from any de Bruijn sequence, although typically a modified m-sequence  for ease of generation , and demonstrate how to use Zech's logarithms to identify all cross-join pairs in that sequence .
Revised:  We start from any de Bruijn sequence, although typically a modified m-sequence for ease of generation .
Edit intent: coherence
Original:  The swept time-space decomposition rule reduces communication between subdomains by exhausting the domain of influence before communicating boundary values.
Revised:  The swept time-space decomposition rule reduces communication between sub-domains by exhausting the domain of influence before communicating boundary values.
Edit intent: fluency
Original:  It shows significant improvement in the execution time of  one-dimensional  , finite-difference PDE solvers for scalar equations, producing speedups of 2-9x for a range of problem sizes, respectively, compared with simple GPU versions and 7-300x compared with parallel CPU versions.
Revised:  It shows significant improvement in the execution time of finite-difference solvers for one-dimensional , finite-difference PDE solvers for scalar equations, producing speedups of 2-9x for a range of problem sizes, respectively, compared with simple GPU versions and 7-300x compared with parallel CPU versions.
Edit intent: fluency
Original:  It shows significant improvement in the execution time of  one-dimensional  , finite-difference PDE solvers for scalar equations, producing speedups of 2-9x for a range of problem sizes, respectively, compared with simple GPU versions and 7-300x compared with parallel CPU versions.
Revised:  It shows significant improvement in the execution time of one-dimensional , producing speedups of 2-9x for a range of problem sizes, respectively, compared with simple GPU versions and 7-300x compared with parallel CPU versions.
Edit intent: clarity
Original:  It shows significant improvement in the execution time of  one-dimensional  , finite-difference PDE solvers for scalar equations, producing speedups of 2-9x for a range of problem sizes, respectively, compared with simple GPU versions and 7-300x compared with parallel CPU versions.
Revised:  It shows significant improvement in the execution time of one-dimensional , finite-difference PDE solvers for scalar equations, producing speedups of 2-9x for a range of problem sizes, respectively, compared with simple GPU versions and 7--300\times compared with parallel CPU versions.
Edit intent: clarity
Original:  However, for a more sophisticated one-dimensional system of equations discretized with a second-order finite-volume scheme, the swept rule performs 1.2 -1.9x worse than a basic implementation for all problem sizes.
Revised:  However, for a more sophisticated one-dimensional system of equations discretized with a second-order finite-volume scheme, the swept rule performs 1.2 -1.9x worse than a standard implementation for all problem sizes.
Edit intent: clarity
Original: We measure the social media activity of 27 broad scientific disciplines indexed in Scopus database by using Altmetric.com big datacollected during July 2011 till December 31, 2015.
Revised: This paper measures social media activity of 27 broad scientific disciplines indexed in Scopus database by using Altmetric.com big datacollected during July 2011 till December 31, 2015.
Edit intent: clarity
Original: We measure the social media activity of 27 broad scientific disciplines indexed in Scopus database by using Altmetric.com big datacollected during July 2011 till December 31, 2015.
Revised: We measure the social media activity of 27 broad scientific disciplines indexed in Scopus database using Altmetric.com big datacollected during July 2011 till December 31, 2015.
Edit intent: coherence
Original:  Lastly, we comprehensively evaluate the effectiveness of altmetric indices to identify publications with high citation impact by deploying area under the curve AUC - an application of receiver operating characteristic.
Revised:  Lastly, we comprehensively evaluate the effectiveness of altmetric indices to identify publications with high citation impact is comprehensively evaluated by deploying Area Under the Curve (AUC) - an application of receiver operating characteristic.
Edit intent: clarity
Original:  Our results indicate a rapid increase in the presence of Altmetric.com data in SCOPUS database with 20.46 percent in 2015 from 10.19 percent in 2011.
Revised:  Results indicate a rapid increase in the presence of Altmetric.com data in SCOPUS database with 20.46 percent in 2015 from 10.19 percent in 2011.
Edit intent: clarity
Original:  Our results indicate a rapid increase in the presence of Altmetric.com data in SCOPUS database with 20.46 percent in 2015 from 10.19 percent in 2011.
Revised:  Our results indicate a rapid increase in the presence of Altmetric.com data in Scopus database from 10.19 percent in 2011.
Edit intent: coherence
Original:  While we find a positive weak correlation between bibliometric and altmetric indices, our results show that altmetric indices can be a good indicator to discriminate highly cited publications, with an encouragingly AUC as 0.725 between highly cited publications and total altmetric count.
Revised:  While we find a positive weak correlation between bibliometric and altmetric indices, the results show that altmetric indices can be a good indicator to discriminate highly cited publications, with an encouragingly AUC as 0.725 between highly cited publications and total altmetric count.
Edit intent: fluency
Original:  While we find a positive weak correlation between bibliometric and altmetric indices, our results show that altmetric indices can be a good indicator to discriminate highly cited publications, with an encouragingly AUC as 0.725 between highly cited publications and total altmetric count.
Revised:  While we find a positive weak correlation between bibliometric and altmetric indices, our results show that altmetric indices can be a good indicator to discriminate highly cited publications, with an encouragingly AUC = 0.725 between highly cited publications and total altmetric count.
Edit intent: clarity
Original:  Overall, our findings suggest that altmetrics could better distinguish highly cited publications , however, more research is recommended to reveal the semantic understanding of altmetric indices for research evaluation .
Revised:  Overall, findings suggest that altmetrics could better distinguish highly cited publications , however, more research is recommended to reveal the semantic understanding of altmetric indices for research evaluation .
Edit intent: coherence
Original:  Overall, our findings suggest that altmetrics could better distinguish highly cited publications , however, more research is recommended to reveal the semantic understanding of altmetric indices for research evaluation .
Revised:  Overall, our findings suggest that altmetrics could better distinguish highly cited publications .
Edit intent: clarity
Original: Mental decline and reduced motor control are two of the most striking features associated with aging and disease.
Revised: Reduced motor control is one of the most striking features associated with aging and disease.
Edit intent: clarity
Original: Mental decline and reduced motor control are two of the most striking features associated with aging and disease.
Revised: Mental decline and reduced motor control are two of the most frequent features associated with aging and disease.
Edit intent: clarity
Original:  Similar findings have not been established for less complex organisms , though.
Revised:  Similar findings have not been established for any of the model organisms typically studied by biologists , though.
Edit intent: clarity
Original:  If the physiology of a simpler model organism displayed the same characteristics, that would open a new research window on the control mechanisms that organisms use to regulate physiological processes during aging and stress.
Revised:  If the physiology of a simpler model organism displays the same characteristics, that would open a new research window on the control mechanisms that organisms use to regulate physiological processes during aging and stress.
Edit intent: fluency
Original:  If the physiology of a simpler model organism displayed the same characteristics, that would open a new research window on the control mechanisms that organisms use to regulate physiological processes during aging and stress.
Revised:  If the physiology of a simpler model organism displayed the same characteristics, this fact would open a new research window on the control mechanisms that organisms use to regulate physiological processes during aging and stress.
Edit intent: coherence
Original: Deep neural networks have become invaluable tools for supervised machine learning, e.g., in classification of text or images.
Revised: Deep neural networks have become invaluable tools for supervised machine learning, e.g., classification of text or images.
Edit intent: clarity
Original:  While offering superior flexibility to find and express complicated patterns in data, deep architectures are known to be challenging to design and train so that they generalize well to new data.
Revised:  While often offering superior results over traditional techniques and successfully expressing complicated patterns in data, deep architectures are known to be challenging to design and train so that they generalize well to new data.
Edit intent: clarity
Original:  While offering superior flexibility to find and express complicated patterns in data, deep architectures are known to be challenging to design and train so that they generalize well to new data.
Revised:  While offering superior flexibility to find and express complicated patterns in data, deep architectures are known to be challenging to design and train such that they generalize well to new data.
Edit intent: clarity
Original:  The backbone of our approach is interpreting deep learning as a parameter estimation problem of a nonlinear dynamical system . Given this formulation  we analyze stability and well-posedness of deep learning and motivated by our findings develop new architectures.
Revised:  The backbone of our approach is our interpretation of deep learning as a parameter estimation problem of a nonlinear dynamical system . Given this formulation we analyze stability and well-posedness of deep learning and motivated by our findings develop new architectures.
Edit intent: fluency
Original:  The backbone of our approach is interpreting deep learning as a parameter estimation problem of a nonlinear dynamical system . Given this formulation  we analyze stability and well-posedness of deep learning and motivated by our findings develop new architectures.
Revised:  The backbone of our approach is interpreting deep learning as a parameter estimation problem of nonlinear dynamical systems . Given this formulation we analyze stability and well-posedness of deep learning and motivated by our findings develop new architectures.
Edit intent: fluency
Original:  The backbone of our approach is interpreting deep learning as a parameter estimation problem of a nonlinear dynamical system . Given this formulation  we analyze stability and well-posedness of deep learning and motivated by our findings develop new architectures.
Revised:  The backbone of our approach is interpreting deep learning as a parameter estimation problem of a nonlinear dynamical system . Given this formulation , we analyze stability and well-posedness of deep learning and motivated by our findings develop new architectures.
Edit intent: fluency
Original:  The backbone of our approach is interpreting deep learning as a parameter estimation problem of a nonlinear dynamical system . Given this formulation  we analyze stability and well-posedness of deep learning and motivated by our findings develop new architectures.
Revised:  The backbone of our approach is interpreting deep learning as a parameter estimation problem of a nonlinear dynamical system . Given this formulation we analyze stability and well-posedness of deep learning and use this new understanding to develop new network architectures.
Edit intent: clarity
Original:  While our new architectures restrict the solution space, several numerical experiments show their competitiveness to state-of-the-art networks.
Revised:  While our new architectures restrict the solution space, several numerical experiments show their competitiveness with state-of-the-art networks.
Edit intent: fluency
Original:  These multi-modal images are commonly combined pairwise (using e.g. simple ratio images) to mitigate intensity inhomogeneities or to reveal specific tissue properties such as gray matter myelination.
Revised:  These images are commonly combined pairwise (using e.g. simple ratio images) to mitigate intensity inhomogeneities or to reveal specific tissue properties such as gray matter myelination.
Edit intent: clarity
Original:  To this end, brain images of a living human with three different contrasts (T1w, PD, T2*w) were acquired  at ultra high field (7 Tesla) MRI scanner and Aitchison metrics were used to create virtual MR contrasts similar to conventional ratio images.
Revised:  To this end, brain images with three different contrasts (T1w, PD, T2*w) were acquired at ultra high field (7 Tesla) MRI scanner and Aitchison metrics were used to create virtual MR contrasts similar to conventional ratio images.
Edit intent: clarity
Original:  To this end, brain images of a living human with three different contrasts (T1w, PD, T2*w) were acquired  at ultra high field (7 Tesla) MRI scanner and Aitchison metrics were used to create virtual MR contrasts similar to conventional ratio images.
Revised:  To this end, brain images of a living human with three different contrasts (T1w, PD, T2*w) were acquired in-vivo at ultra high field (7 Tesla) MRI scanner and Aitchison metrics were used to create virtual MR contrasts similar to conventional ratio images.
Edit intent: clarity
Original:  To this end, brain images of a living human with three different contrasts (T1w, PD, T2*w) were acquired  at ultra high field (7 Tesla) MRI scanner and Aitchison metrics were used to create virtual MR contrasts similar to conventional ratio images.
Revised:  To this end, brain images of a living human with three different contrasts (T1w, PD, T2*w) were acquired at ultra high field (7 Tesla) MRI scanner and compositional data analysis methods were used to create virtual MR contrasts similar to conventional ratio images.
Edit intent: clarity
Original:  This paper develops a shape analysis for reasoning about relational properties of data structures , such as balancedness of trees or lengths of lists .
Revised:  This paper develops a shape analysis for reasoning about relational properties of data structures .
Edit intent: clarity
Original:  The analysis is based on user-defined indexed graph grammars to guide concretization and abstraction.
Revised:  The analysis is parameterized by user-supplied indexed graph grammars to guide concretization and abstraction.
Edit intent: clarity
Original:  This novel extension of context-free graph grammars is powerful enough to model complex data structures , such as balanced binary trees with parent pointers, while preserving most desirable properties of context-free graph grammars.
Revised:  This novel extension of context-free graph grammars is powerful enough to model complex data structures such as balanced binary trees with parent pointers, while preserving most desirable properties of context-free graph grammars.
Edit intent: fluency
Original:  In this paper, a novel game-theoretic framework for smart routing of EVs within the smart grid is proposed.
Revised:  In this paper, a novel gametheoretic framework for smart routing of EVs within the smart grid is proposed.
Edit intent: fluency
Original:  The goals of this framework are three-fold: 1) reducing the traffic congestion, 2) reducing the waiting time at charging stations , and 3) balancing the electricity load across the grid .
Revised:  The goal of this framework are three-fold: 1) reducing the traffic congestion, 2) reducing the waiting time at charging stations , and 3) balancing the electricity load across the grid .
Edit intent: fluency
Original:  The goals of this framework are three-fold: 1) reducing the traffic congestion, 2) reducing the waiting time at charging stations , and 3) balancing the electricity load across the grid .
Revised:  The goals of this framework is to balance the electricity load across the grid while taking into account the traffic congestion and the waiting time at charging stations , and 3) balancing the electricity load across the grid .
Edit intent: clarity
Original:  The goals of this framework are three-fold: 1) reducing the traffic congestion, 2) reducing the waiting time at charging stations , and 3) balancing the electricity load across the grid .
Revised:  The goals of this framework are three-fold: 1) reducing the traffic congestion, 2) reducing the waiting time at charging stations .
Edit intent: coherence