wanyu/IteraTeR_v2 huggingface dataset:
Original:  In addition, we parallelize %DIFDELCMD < {\tt %%% rchol based on the nested dissection ordering for shared-memory machines.
Revised:  In addition, we parallelize %DIFDELCMD < {\tt %%% RCHOL based on the nested dissection ordering for shared-memory machines.
Edit intent: fluency
Original:  Numerical experiments demonstrated the robustness and the scalability of %DIFDELCMD < {\tt %%% rchol .
Revised:  Numerical experiments demonstrated the robustness and the scalability of %DIFDELCMD < {\tt %%% RCHOL .
Edit intent: fluency
Original:  For example, our parallel code scaled up to 64 threads on a single node for solving the 3D Poisson equation, discretized with the 7-point stencil on a 1024\times 1024 \times 1024 grid, or one billion unknowns.
Revised:  For example, our parallel code scaled up to 64 threads on a single node for solving the 3D Poisson equation, discretized with the 7-point stencil on a 1024\times 1024 \times 1024 grid, or one billion unknowns.
Edit intent: fluency
Original:  The exact Cholesky factorization for the matrix introduces a clique in the associated graph after eliminating every row/column.
Revised:  The exact Cholesky factorization introduces a clique in the associated graph after eliminating every row/column.
Edit intent: clarity
Original:  The exact Cholesky factorization for the matrix introduces a clique in the associated graph after eliminating every row/column.
Revised:  The exact Cholesky factorization for the matrix introduces a clique in the underlying graph after eliminating every row/column.
Edit intent: clarity
Original:  The exact Cholesky factorization for the matrix introduces a clique in the associated graph after eliminating every row/column.
Revised:  The exact Cholesky factorization for the matrix introduces a clique in the associated graph after eliminating a row/column.
Edit intent: clarity
Original:  By randomization, RCHOL keeps a sparse subset of the edges in the clique using a random sampling developed by Spielman and Kyng.
Revised:  By randomization, RCHOL only retains a sparse subset of the edges in the clique using a random sampling developed by Spielman and Kyng.
Edit intent: clarity
Original:  We prove RCHOL is breakdown free and apply it to solving large sparse linear systems with symmetric diagonally-dominant matrices.
Revised:  We prove RCHOL is breakdown-free and apply it to solving large sparse linear systems with symmetric diagonally-dominant matrices.
Edit intent: fluency
Original:  We prove RCHOL is breakdown free and apply it to solving large sparse linear systems with symmetric diagonally-dominant matrices.
Revised:  We prove RCHOL is breakdown free and apply it to solving large sparse linear systems with symmetric diagonally dominant matrices.
Edit intent: fluency
Original:  At first we point out that in any game the format of each agent's strategy is either an informational message or a real action.
Revised:  We point out that in any game the format of each agent's strategy is either an informational message or a real action.
Edit intent: coherence
Original:  For any given social choice function, if the mechanism which implements it in Bayesian Nash equilibrium has action-format strategies, then ``honest and obedient'' will not be a Bayesian Nash equilibrium of the corresponding direct mechanism.
Revised:  For any given social choice function, if the mechanism which implements it has action-format strategies, then ``honest and obedient'' will not be a Bayesian Nash equilibrium of the corresponding direct mechanism.
Edit intent: clarity
Original:  For any given social choice function, if the mechanism which implements it in Bayesian Nash equilibrium has action-format strategies, then ``honest and obedient'' will not be a Bayesian Nash equilibrium of the corresponding direct mechanism.
Revised:  For any given social choice function, if the mechanism which implements it in Bayesian Nash equilibrium has action-format strategies, then " will not be a Bayesian Nash equilibrium of the corresponding direct mechanism.
Edit intent: clarity
Original:  For any given social choice function, if the mechanism which implements it in Bayesian Nash equilibrium has action-format strategies, then ``honest and obedient'' will not be a Bayesian Nash equilibrium of the corresponding direct mechanism.
Revised:  For any given social choice function, if the mechanism which implements it in Bayesian Nash equilibrium has action-format strategies, then ``honest and obedient''" will not be a Bayesian Nash equilibrium of the corresponding direct mechanism.
Edit intent: fluency
Original:  For any given social choice function, if the mechanism which implements it in Bayesian Nash equilibrium has action-format strategies, then ``honest and obedient'' will not be a Bayesian Nash equilibrium of the corresponding direct mechanism.
Revised:  For any given social choice function, if the mechanism which implements it in Bayesian Nash equilibrium has action-format strategies, then ``honest and obedient'' will not be the equilibrium of the corresponding direct mechanism.
Edit intent: clarity
Original:  Here we present a dataset 2 of scholarly publications reported by the projects funded by the European Union under the 7th Framework Programme.
Revised:  Here we present a dataset of scholarly publications reported by the projects funded by the European Union under the 7th Framework Programme.
Edit intent: fluency
Original:  The initial dataset had 299.000 records linked to one or more projects out of which 68 \% had a digital object identify (doi).
Revised:  The initial dataset had 299.000 records linked to one or more projects out of which 69 \% had a digital object identify (doi).
Edit intent: style
Original:  Although the cover time of multiple walks has been investigated for many natural networks, the problem of finding a general characterisation of multiple cover times for worst-case start vertices (posed by Alon, Avin, Kouck\'y, Kozma, Lotker, and Tuttle in 2008) remains an open problem.
Revised:  Although the cover time of multiple walks has been investigated for many natural networks, the problem of finding a general characterisation of multiple cover times for worst-case start vertices (posed by Alon, Avin, Kouck\'y, Kozma, Lotker, and Tuttle in 2008) remains an open problem.
Edit intent: fluency
Original:  First, we improve and tighten various bounds on the stationary cover time when k random walks start from vertices sampled from the stationary distribution.
Revised:  First, we improve and tighten various bounds on the stationary cover time when k random walks start from vertices sampled from the stationary distribution.
Edit intent: fluency
Original:  Secondly, we establish the stationary cover times of multiple walks on several fundamental networks up to constant factors.
Revised:  Secondly, we establish the stationary cover times of multiple walks on several fundamental networks up to constant factors.
Edit intent: fluency
Original:  Thirdly, we present a framework characterising worst-case cover times in terms of stationary cover times and a novel, relaxed notion of mixing time for multiple walks called partial mixing time . Roughly speaking, the partial mixing time only requires a specific portion of all random walks to be mixed.
Revised:  Thirdly, we present a framework characterising worst-case cover times in terms of stationary cover times and a novel, relaxed notion of mixing time for multiple walks called partial mixing time . Roughly speaking, the partial mixing time only requires a specific portion of all random walks to be mixed.
Edit intent: fluency
Original:  Thirdly, we present a framework characterising worst-case cover times in terms of stationary cover times and a novel, relaxed notion of mixing time for multiple walks called partial mixing time . Roughly speaking, the partial mixing time only requires a specific portion of all random walks to be mixed.
Revised:  Thirdly, we present a framework characterising worst-case cover times in terms of stationary cover times and a novel, relaxed notion of mixing time for multiple walks called the . Roughly speaking, the partial mixing time only requires a specific portion of all random walks to be mixed.
Edit intent: clarity
Original:  Thirdly, we present a framework characterising worst-case cover times in terms of stationary cover times and a novel, relaxed notion of mixing time for multiple walks called partial mixing time . Roughly speaking, the partial mixing time only requires a specific portion of all random walks to be mixed.
Revised:  Thirdly, we present a framework characterising worst-case cover times in terms of stationary cover times and a novel, relaxed notion of mixing time for multiple walks called partial mixing timepartial mixing time . Roughly speaking, the partial mixing time only requires a specific portion of all random walks to be mixed.
Edit intent: clarity
Original:  Using these new concepts, we can establish (or recover) the worst-case cover times for many networks including expanders, preferential attachment graphs, grids, binary trees and hypercubes.
Revised:  Using these new concepts, we can establish (or recover) the worst-case cover times for many networks including expanders, preferential attachment graphs, grids, binary trees and hypercubes.
Edit intent: fluency
Original:  We present an implementation of the mesh generator and demonstrate the resulting meshes via several examples.
Revised:  We present an implementation of the mesh generator and demonstrate the resulting meshes via examples.
Edit intent: clarity
Original:  Neural networks have successfully advanced in the task of information extraction from structured documents .
Revised: The automation of document processing is gaining recent attention due to the great potential to reduce manual work through improved methods and hardware. Neural networks have successfully advanced in the task of information extraction from structured documents .
Edit intent: clarity
Original:  In this paper we will design and examine various fully trainable approaches to use siamese networks, concepts of similarity, one-shot learning and context/memory awareness.
Revised:  In this paper we will design and examine various approaches to using siamese networks, concepts of similarity, one-shot learning and context/memory awareness.
Edit intent: clarity
Original:  The aim is to improve micro F_{1 of per-word classification on a testing split of an existing real world document dataset.
Revised:  The aim is to improve micro F1 of per-word classification on a testing split of an existing real world document dataset.
Edit intent: fluency
Original:  The aim is to improve micro F_{1 of per-word classification on a testing split of an existing real world document dataset.
Revised:  The aim is to improve micro F_{1 of per-word classification on the huge real-world document dataset.
Edit intent: clarity
Original:  The results verify the hypothesis , that access to a similar (yet still different) page with it's target information improves the information extraction.
Revised:  The results verify the hypothesis that trainable access to a similar (yet still different) page with it's target information improves the information extraction.
Edit intent: clarity
Original:  Furthermore the added contributions (in addition to siamese networks) of employing a class information, query-answer attention module and skip connections to the similar page are all required to beat the previous results.
Revised:  Furthermore , the experiments confirm that all proposed architecture parts are all required to beat the previous results.
Edit intent: clarity
Original:  Our best model improves previous state-of-art results by 0.0825 gain in F1 score.
Revised:  The best model improves previous state-of-art results by 0.0825 gain in F1 score.
Edit intent: fluency
Original:  All the techniques used are not problem-specific and should be generalizable to help in other tasks and contexts .
Revised:  All the techniques used are not problem-specific and can be generalized for other tasks and contexts .
Edit intent: clarity
Original:  and enables a variety of instrumen-tations , providing deep insights about the essence of French income tax computation.
Revised:  and enables a variety of instrumentations , providing deep insights about the essence of French income tax computation.
Edit intent: fluency
Original:  The DGFiP is now officially transi-tioning to Mlang for their production system.
Revised:  The DGFiP is now officially transitioning to Mlang for their production system.
Edit intent: fluency
Original: Computational load imbalance due to direct integration of chemical kinetics is a well-known performance issue in parallel reacting flow simulations  .
Revised: Computational load imbalance is a well-known performance issue in parallel reacting flow simulations .
Edit intent: clarity
Original: Computational load imbalance due to direct integration of chemical kinetics is a well-known performance issue in parallel reacting flow simulations  .
Revised: Computational load imbalance due to direct integration of chemical kinetics is a well-known performance issue in multiprocessor reacting flow simulations .
Edit intent: clarity
Original: Computational load imbalance due to direct integration of chemical kinetics is a well-known performance issue in parallel reacting flow simulations  .
Revised: Computational load imbalance due to direct integration of chemical kinetics is a well-known performance issue in parallel reacting flow simulations utilizing directly integrated chemical kinetics .
Edit intent: clarity
Original:  We introduce an open-source dynamic load balancing model  to address this problem within OpenFOAM, an open-source C++ library for Computational Fluid Dynamics (CFD).
Revised:  We introduce an open-source dynamic load balancing model to address this issue within OpenFOAM, an open-source C++ library for Computational Fluid Dynamics (CFD).
Edit intent: clarity
Original:  However, the independent nature of chemistry ODE systems leads to a problem that can be parallelized easily ( also termed embarrassingly parallel in the literature) during the flow solution.
Revised:  However, the independent nature of chemistry ODE systems leads to a problem that can be parallelized easily ( called an embarrassingly parallel problem in the literature) during the flow solution.
Edit intent: clarity
Original:  When the load balancing is utilized together with a reference mapping model also introduced in this paper , a speed-up by a factor of 10 is reported for practical reactive flow simulations .
Revised:  Additionally, a reference mapping model also introduced in this paper , a speed-up by a factor of 10 is reported for practical reactive flow simulations .
Edit intent: coherence
Original:  When the load balancing is utilized together with a reference mapping model also introduced in this paper , a speed-up by a factor of 10 is reported for practical reactive flow simulations .
Revised:  When the load balancing is utilized together with a reference mapping model also introduced in this paper , a speed-up by a factor of 10 is reported for reactive flow benchmark cases .
Edit intent: clarity
Original: We introduce an asymmetric noisy voter model to study the joint effect of immigration and a competition-dispersal tradeoff ? in the dynamics of two species competing for space on a one-dimensional lattice .
Revised: We introduce an asymmetric noisy voter model to study the joint effect of immigration and a competition-dispersal tradeoff in the dynamics of two species competing for space on a one-dimensional lattice .
Edit intent: fluency
Original: This paper develops a stochastic Multi-Agent Reinforcement Learning (MARL) method to learn control policies that can handle an arbitrary number of external agents;
Revised: We develop a Multi-Agent Reinforcement Learning (MARL) method to learn control policies that can handle an arbitrary number of external agents;
Edit intent: clarity
Original:  our policies can be executed for tasks consisting of 1000 pursuers and 1000 evaders.
Revised:  our policies can be executed for tasks consisting up to 1000 pursuers and 1000 evaders.
Edit intent: clarity
Original:  our policies can be executed for tasks consisting of 1000 pursuers and 1000 evaders.
Revised:  our policies can be executed for tasks consisting of 1000 pursuers tracking 1000 evaders.
Edit intent: clarity
Original:  An attention mechanism is used to build a permutation and input-size invariant embedding of the observations for learning a stochastic policy and value function using techniques in entropy-regularized off-policy methods.
Revised:  An attention mechanism is used to parameterize the value function of the agents; this mechanism allows us to handle an arbitrary number of targets. Entropy-regularized off-policy methods.
Edit intent: clarity
Original:  However, when companies transitioned employees to work from home due to the pandemic, there was little time to no time to develop new onboarding procedures.
Revised:  However, when companies transitioned employees to work from home due to the pandemic, there was little to no time to develop new onboarding procedures.
Edit intent: fluency
Original:  Deep learning tries to achieve this by mimicking the learning of a human brain.
Edit intent: coherence
Original:  Similar to the basic structure of a brain, which consists of (billions of) neurons and connections between them, a deep learning algorithm consists of an artificial neural network, which resembles the biological brain structure.
Revised:  Similar to the basic structure of a brain, a deep learning algorithm consists of an artificial neural network, which resembles the biological brain structure.
Edit intent: coherence
Original:  This growth resulted in way over 10  000 publications per year in the last years.
Revised:  This growth resulted in way over 10 , 000 publications per year in the last years.
Edit intent: fluency
Original:  For example, the search engine PubMed alone, which covers only a sub-set of all publications in the medical field, provides  over 11  000 results  for the search term 'deep learning' in Q3 2020, and ~ 90\% of these results are from the last three years.
Revised:  For example, the search engine PubMed alone, which covers only a sub-set of all publications in the medical field, provides already over 11 000 results for the search term 'deep learning' in Q3 2020, and ~ 90\% of these results are from the last three years.
Edit intent: coherence
Original:  For example, the search engine PubMed alone, which covers only a sub-set of all publications in the medical field, provides  over 11  000 results  for the search term 'deep learning' in Q3 2020, and ~ 90\% of these results are from the last three years.
Revised:  For example, the search engine PubMed alone, which covers only a sub-set of all publications in the medical field, provides over 11 , 000 results for the search term 'deep learning' in Q3 2020, and ~ 90\% of these results are from the last three years.
Edit intent: fluency
Original:  For example, the search engine PubMed alone, which covers only a sub-set of all publications in the medical field, provides  over 11  000 results  for the search term 'deep learning' in Q3 2020, and ~ 90\% of these results are from the last three years.
Revised:  For example, the search engine PubMed alone, which covers only a sub-set of all publications in the medical field, provides over 11 000 results for the search term 'deep learning' , and around 90\% of these results are from the last three years.
Edit intent: clarity
Original:  With these surveys as a foundation, the aim of this contribution is to provide a first high-level, categorized meta-analysis of selected reviews on deep learning across different scientific disciplines and outline the research impact that they already have during a short period of time .
Revised:  With these surveys as a foundation, the aim of this contribution is to provide a first high-level, categorized meta-survey of selected reviews on deep learning across different scientific disciplines and outline the research impact that they already have during a short period of time .
Edit intent: clarity
Original:  Extensive evaluation on 210 datasets, 13 clustering algorithms, and 10 clustering measures demonstrates the effectiveness of our approach and its dominance in terms of predictive and generalization performance over state-of-the-art clustering meta-learning approaches.
Revised:  Extensive evaluation on 210 datasets, 13 clustering algorithms, and 10 clustering measures demonstrates the effectiveness of our approach and its superiority in terms of predictive and generalization performance over state-of-the-art clustering meta-learning approaches.
Edit intent: clarity
Original:  Among all, Bezier and Catmull-Rom splines are of the most used in the subfields of engineering.
Revised:  Among all, B\'ezier and Catmull-Rom splines are of the most used in the subfields of engineering.
Edit intent: fluency
Original:  Among all, Bezier and Catmull-Rom splines are of the most used in the subfields of engineering.
Revised:  Among all, Bezier and Catmull-Rom splines are the most common in the sub-fields of engineering.
Edit intent: clarity
Original:  For comparison, we included a control model that sent intervention messages at random times.
Revised:  For comparison, we included a control model\/ that sent intervention messages at random times.
Edit intent: clarity
Original:  We observed that the machine-learning models led up to a 40 \% improvement in \\%DIF > improvement in receptivity as compared to the control model.
Revised:  We observed that the machine-learning models led up to a 40 \\%DIF > improvement in receptivity as compared to the control model.
Edit intent: fluency
Original:  Further, we evaluated the temporal dynamics of the different models and observed that receptivity to messages from the adaptive 
Revised:  Further, we evaluated the temporal dynamics of the different models and observed that receptivity to messages from the adaptive model increased over the course of the study.
Edit intent: clarity
Original: We give simple iterative methods for computing approximately optimal primal and dual solutions for the problem of maximizing a linear functional over a convex set K given by a separation oracle.
Revised: We give a simple and natural method for computing approximately optimal primal and dual solutions for the problem of maximizing a linear functional over a convex set K given by a separation oracle.
Edit intent: clarity
Original: We give simple iterative methods for computing approximately optimal primal and dual solutions for the problem of maximizing a linear functional over a convex set K given by a separation oracle.
Revised: We give simple iterative methods for computing approximately optimal solutions for minimizing a convex function f over a convex set K given by a separation oracle.
Edit intent: clarity
Original:  Specifically, multi-layered hierarchical networks, i.e., the orchestration among different aerial/space platforms, including Unmanned Aerial Vehicles (UAVs), High Altitude Platforms (  HAPs), and satellites co-operating at different altitudes, currently represents one the most attractive technological options to solve coverage and latency constraints associated with the NTN paradigm.
Revised:  Specifically, multi-layered hierarchical networks, i.e., the orchestration among different aerial/space platforms, including Unmanned Aerial Vehicles (UAVs), High Altitude Platforms ( LAPs and HAPs), and satellites co-operating at different altitudes, currently represents one the most attractive technological options to solve coverage and latency constraints associated with the NTN paradigm.
Edit intent: clarity