wanyu/IteraTeR_v2 huggingface dataset:
Original:  We implement the scheme for problems involving a single spatial dimension (i.e., two-dimensional, axisymmetric or spherically-symmetric three-dimensional currents) on a uniform but staggered grid.
Revised:  We implement the scheme for problems involving a single spatial dimension (i.e., two-dimensional, axisymmetric or spherically-symmetric three-dimensional currents) on an equispaced but staggered grid.
Edit intent: clarity
Original:  We benchmark the scheme against analytical solutions and highlight its strong numerical stability by specifically considering the spreading of non-Newtonian power-law fluids in a variable-width confined channel-like geometry (a ` Hele-Shaw cell ' ) subject to a given mass conservation/balance constraint.
Revised:  We benchmark the scheme against analytical solutions and highlight its strong numerical stability by specifically considering the spreading of non-Newtonian power-law fluids in a variable-width confined channel-like geometry (a " Hele-Shaw cell ' ) subject to a given mass conservation/balance constraint.
Edit intent: fluency
Original:  We benchmark the scheme against analytical solutions and highlight its strong numerical stability by specifically considering the spreading of non-Newtonian power-law fluids in a variable-width confined channel-like geometry (a ` Hele-Shaw cell ' ) subject to a given mass conservation/balance constraint.
Revised:  We benchmark the scheme against analytical solutions and highlight its strong numerical stability by specifically considering the spreading of non-Newtonian power-law fluids in a variable-width confined channel-like geometry (a ` Hele-Shaw cell " ) subject to a given mass conservation/balance constraint.
Edit intent: fluency
Original:  Furthermore, we also highlight through numerical simulations how the proposed scheme respects, with high accuracy, the mass conservation/balance constraint.
Revised:  We also highlight through numerical simulations how the proposed scheme respects, with high accuracy, the mass conservation/balance constraint.
Edit intent: coherence
Original:  Furthermore, we also highlight through numerical simulations how the proposed scheme respects, with high accuracy, the mass conservation/balance constraint.
Revised:  Furthermore, we also highlight through numerical simulations how the proposed scheme accurately respects the mass conservation/balance constraint.
Edit intent: clarity
Original:  This is motivated by the need to expedite the assembly of the associated stiffness matrices as indeed the solution of the resulting linear systems at the many-query context , where the numerical solution is sought for many different parameters .
Revised:  This is motivated by the need to expedite the assembly of the associated system of equations typically at the many-query context , where the numerical solution is sought for many different parameters .
Edit intent: clarity
Original:  This is motivated by the need to expedite the assembly of the associated stiffness matrices as indeed the solution of the resulting linear systems at the many-query context , where the numerical solution is sought for many different parameters .
Revised:  This is motivated by the need to expedite the assembly of the associated stiffness matrices as indeed the solution of the resulting linear systems at the many-query context .
Edit intent: coherence
Original:  Our approach involves converting the  symmetric positive definite FEM system into an over-determined least squares problem, and then projecting the solution onto a low-dimensional subspace.
Revised:  Our approach involves converting the symmetric positive definite FEM system into an over-determined least squares problem, whose solution is then projected onto a low-dimensional subspace.
Edit intent: clarity
Original:  The  low-dimensional system can be  sketched as a product of two high-dimensional matrices , using some parameter-dependent non-uniform sampling distributions.
Revised:  The resulting low-dimensional system can be sketched as a product of two high-dimensional matrices , using some parameter-dependent non-uniform sampling distributions.
Edit intent: clarity
Original:  The  low-dimensional system can be  sketched as a product of two high-dimensional matrices , using some parameter-dependent non-uniform sampling distributions.
Revised:  The low-dimensional system can be sketched as a product of two high-dimensional matrices using a parameter-dependent non-uniform sampling distributions.
Edit intent: clarity
Original:  Our algorithm is tested on numerical simulations for the elliptic diffusion boundary value problem with Dirichlet and Neumann conditions.
Revised:  Our algorithm is tested on simulations on the Dirichlet and Neumann conditions.
Edit intent: clarity
Original:  Our results show that the randomised FEM approach has on average a ten-fold improvement on the computational times compared to the classical deterministic framework at the expense of a moderately small  error.
Revised:  Our results show that our approach has on average a ten-fold improvement on the computational times compared to the classical deterministic framework at the expense of a moderately small error.
Edit intent: clarity
Original:  Our results show that the randomised FEM approach has on average a ten-fold improvement on the computational times compared to the classical deterministic framework at the expense of a moderately small  error.
Revised:  Our results show that the randomised FEM approach has on average a tenfold improvement on the computational times compared to the classical deterministic framework at the expense of a moderately small error.
Edit intent: fluency
Original: This research analyzes the effects of U.S. science and technology policy on  a global strategic alliance network for research and development . During the mid-1980s the U.S. high-technology sector appeared to be collapsing.
Revised: This research analyzes the effects of U.S. science and technology policy on a global strategic alliance network . During the mid-1980s the U.S. high-technology sector appeared to be collapsing.
Edit intent: clarity
Original:  This study combines network analysis and longitudinal regression techniques to test the effects of policy on firm network position and technological performance in an unbalanced panel of semiconductor firms between 1986 and 2001.
Revised:  This study combines network analysis and longitudinal regression techniques to test the effects of public policy on organizational network position and technological performance in an unbalanced panel of semiconductor firms between 1986 and 2001.
Edit intent: clarity
Original: We consider the design of randomized mechanisms for one-sided matching markets, where each agent is matched to one item and there are no monetary transfers.
Revised: We revisit the well-studied problem of designing mechanisms for one-sided matching markets, where each agent is matched to one item and there are no monetary transfers.
Edit intent: clarity
Original: Then, leveraging random sampling and invoking the partial allocation mechanism of Cole et al. (2013), RPI seeks to improve the agents' utility, while possibly, to disincentivize    non-truthful reporting, leaving some of them with their initial endowment .
Revised: Then, leveraging random sampling and invoking the partial allocation mechanism of Cole et al. (2013), RPI seeks to improve the agents' utility, while possibly, to disincentivize non-truthful ones) .
Edit intent: clarity
Original:  However, it has the downside of increasing the length of time that elapses before a sensor is polled again.
Revised:  However, it increases the length of time that elapses before a sensor is polled again.
Edit intent: coherence
Original:  For such policies , we show that when sensor transmission times to the monitor are independent and identically distributed (iid), for independent but possibly non-identical transmission times to the monitor, it is optimal to poll a sensor with the maximum age at the gateway first.
Revised:  For any s , we show that when sensor transmission times to the monitor are independent and identically distributed (iid), for independent but possibly non-identical transmission times to the monitor, it is optimal to poll a sensor with the maximum age at the gateway first.
Edit intent: clarity
Original:  For such policies , we show that when sensor transmission times to the monitor are independent and identically distributed (iid), for independent but possibly non-identical transmission times to the monitor, it is optimal to poll a sensor with the maximum age at the gateway first.
Revised:  For such policies , we show that when sensor transmission times to the gateway are independent and identically distributed (iid), for independent but possibly non-identical transmission times to the monitor, it is optimal to poll a sensor with the maximum age at the gateway first.
Edit intent: fluency
Original:   For non-identical sensor transmission times, we consider a slight variant that polls a sensor such that the resulting average change in age is minimized.
Revised:  For non-identical sensor transmission times, we consider a policy that polls a sensor such that the resulting average change in age is minimized.
Edit intent: clarity
Original:  We compare our  proposals with other policies that pick the frequency of transmission to the monitor and choose sensors to poll differently .
Revised:  We compare our policy proposals with other policies that pick the frequency of transmission to the monitor and choose sensors to poll differently .
Edit intent: fluency
Original:  We compare our  proposals with other policies that pick the frequency of transmission to the monitor and choose sensors to poll differently .
Revised:  We compare our proposals with other policies , over a wide selection of transmission time distributions .
Edit intent: clarity
Original: The data-driven models allow one to dene the model struc-ture in cases when a priori information is not sucient to build othertypes of models.
Revised: The data-driven models allow one to define the model structure in cases when a priori information is not sucient to build othertypes of models.
Edit intent: fluency
Original: The data-driven models allow one to dene the model struc-ture in cases when a priori information is not sucient to build othertypes of models.
Revised: The data-driven models allow one to dene the model struc-ture in cases when a priori information is not sufficient to build other types of models.
Edit intent: fluency
Original:  The existingmethods of PDE (partial derivative equations) discovery are bound with the sparse regression.
Revised:  The existing methods of PDE (partial derivative equations) discovery are bound with the sparse regression.
Edit intent: fluency
Original:  However, sparse regression is restricting the result-ing model form, since the terms for PDE are defined before regression.
Revised:  However, sparse regression is restricting the resulting model form, since the terms for PDE are defined before regression.
Edit intent: fluency
Original:  The evolutionary approach described in the article has a symbolic regression as the background instead and thus has fewer restrictions onthe PDE form.
Revised:  The evolutionary approach described in the article has a symbolic regression as the background instead and thus has fewer restrictions on the PDE form.
Edit intent: fluency
Original:  The question of robust-ness is examined on a noised data example.
Revised:  The question of robustness is examined on a noised data example.
Edit intent: fluency
Original:  ExplainIt! then ranks these hypotheses and summarises causal dependencies between hundreds of thousands of variables for human understanding.
Revised:  ExplainIt! then ranks these hypotheses , reducing the number of causal dependencies from hundreds of thousands of variables for human understanding.
Edit intent: clarity
Original: On the January 22th 2019, Airbus launched a quantum computing challenge to solve a set of problems relevant for the aircraft life cycle URL The challenge consists of a set of 5 problems that ranges from design to deployment of aircraft.
Revised: On the January 22nd 2019, Airbus launched a quantum computing challenge to solve a set of problems relevant for the aircraft life cycle URL The challenge consists of a set of 5 problems that ranges from design to deployment of aircraft.
Edit intent: fluency
Original:  It is discussed how to use current MemComputing software MemCPU to solve efficiently the proposed problem and assess scaling properties, which turns out to be polynomial for meaningful solutions of the problem at hand.
Revised:  It is discussed how to use MemCPU^{\text{TM to solve efficiently the proposed problem and assess scaling properties, which turns out to be polynomial for meaningful solutions of the problem at hand.
Edit intent: clarity
Original:  In particular, we describe a semantic termination checker based on \textit{CoV pattern matching and an extension to definitional equality for constructors that supports zero-cost reuse for datatypes, giving detailed examples of both.
Revised:  In particular, we describe a semantic termination checker based on \textit{CoV pattern matching and an extension to definitional equality for constructors that supports zero-cost reuse for datatypes, giving detailed examples of both.
Edit intent: fluency
Original:  However, experience shows programmers and type theorists prefer the convenience of built-in support for declaring datatypes and  defining functions over them by case analysis and fixpoint-style recursion .
Revised:  However, experience shows programmers and type theorists prefer the convenience of built-in support for declaring datatypes and for defining functions over them by case analysis and fixpoint-style recursion .
Edit intent: fluency
Original:  Additionally, we demonstrate that this does not require extending Cedille's core theory by showing how datatypes and functions over them elaborate to CDLE  and proving that this elaboration is sound.
Revised:  Additionally, we demonstrate that this does not require extending CDLE by showing how datatypes and functions over them elaborate to CDLE and proving that this elaboration is sound.
Edit intent: clarity
Original:  Both the datatype subsystem and its elaborator are implemented for Cedille, to be officially released in version 1.1.0 }
Revised:  Both the datatype subsystem and elaborator are implemented for Cedille, to be officially released in version 1.1.0 }
Edit intent: clarity
Original:  Assembly of matrices and vectors in the finite element method, which is characterized by iterating a local assembly kernel over unstructured meshes, poses challenges to effective vectorization.
Revised:  Assembly of matrices and vectors in the finite element method, which is characterized by iterating a local assembly kernel over unstructured meshes, poses difficulties to effective vectorization.
Edit intent: clarity
Original:  Our experiments show that our approaches for cross-element vectorization achieve 30 \% of theoretical peak performance for \\%DIF > of theoretical peak performance for many examples of practical significance, and exceed 50 \% for cases with high \\%DIF > for cases with high arithmetic intensities, with consistent speed-up over (intra-element) vectorization restricted to the local assembly kernels.
Revised:  Our experiments show that our approaches for cross-element vectorization achieve 30 \\%DIF > of theoretical peak performance for many examples of practical significance, and exceed 50 \% for cases with high \\%DIF > for cases with high arithmetic intensities, with consistent speed-up over (intra-element) vectorization restricted to the local assembly kernels.
Edit intent: clarity
Original:  Our experiments show that our approaches for cross-element vectorization achieve 30 \% of theoretical peak performance for \\%DIF > of theoretical peak performance for many examples of practical significance, and exceed 50 \% for cases with high \\%DIF > for cases with high arithmetic intensities, with consistent speed-up over (intra-element) vectorization restricted to the local assembly kernels.
Revised:  Our experiments show that our approaches for cross-element vectorization achieve 30 \% of theoretical peak performance for \\%DIF > of theoretical peak performance for many examples of practical significance, and exceed 50 \\%DIF > for cases with high arithmetic intensities, with consistent speed-up over (intra-element) vectorization restricted to the local assembly kernels.
Edit intent: fluency
Original: The Web provides many data in user-friendly tabular formatsthat are encoded using HTML. Information extractors are intended to extract those data as datasets that can feed business applications.
Revised: Tables are a common means to display data in human-friendly formats. Many authors have worked on proposals to extract those data as datasets that can feed business applications.
Edit intent: clarity
Original: The cluster of a crossing in a graph drawing on the plane is the set of the four end-vertices of its two crossed edges.
Revised: The cluster of a crossing in a graph drawing in the plane is the set of the four end-vertices of its two crossed edges.
Edit intent: fluency
Original:  It is known for set functions that the class of {\rm M}^{\natural} -concave is a proper subclass of submodular .
Revised:  It is known for set functions that the class of {\rm M}^{\natural} -concavity is a proper subclass of submodular .
Edit intent: fluency
Original:  It is known for set functions that the class of {\rm M}^{\natural} -concave is a proper subclass of submodular .
Revised:  It is known for set functions that the class of {\rm M}^{\natural} -concave is a proper subclass of submodularity .
Edit intent: fluency
Original:  We provide a detailed analysis of the theoretical features of these problems for the extended Eisenberg-Noe and Rogers-Veraart models.
Revised:  We provide a detailed analysis of the theoretical features of these problems under the extended Eisenberg-Noe and Rogers-Veraart models.
Edit intent: clarity
Original:  Numerical results for the 1D x 1D and 2D x 2D Vlasov-Poisson system illustrate the effectiveness of this approach.
Revised:  Numerical results for the 1Dx1D and 2Dx2D Vlasov-Poisson system illustrate the effectiveness of this approach.
Edit intent: fluency
Original: The visual complexity of a plane graph drawing is defined to be the number of basic geometric objects needed to represent all its edges.
Revised: The visual complexity of a graph drawing can be measured by the number of basic geometric objects needed to represent all its edges.
Edit intent: clarity
Original: We prove a convergence guarantee on the unadjusted Langevin algorithm for sampling assuming only that the target distribution e^{-f on R^n.
Revised: We study the Unadjusted Langevin Algorithm (ULA) for sampling from a probability distribution \nu = e^{-f on R^n.
Edit intent: clarity
Original: This paper solves the consumption-investment problem with Epstein-Zin utility on a random horizon.
Revised: This paper solves the consumption-investment problem under Epstein-Zin utility on a random horizon.
Edit intent: clarity
Original:  The main results are obtained through developing new techniques for BSDEs with superlinear growth on an unbounded random horizon .
Revised:  The main results are obtained through the development of new techniques for BSDEs with superlinear growth on an unbounded random horizon .
Edit intent: fluency
Original:  The main results are obtained through developing new techniques for BSDEs with superlinear growth on an unbounded random horizon .
Revised:  The main results are obtained through developing new techniques for BSDEs with superlinear growth on unbounded random horizons .
Edit intent: fluency
Original:  Compared with classical results on a fixed horizon, our characterization involves an additional stochastic process to account for the uncertainty of the horizon.
Revised:  Compared with classical results on a fixed horizon, our characterization involves an additional stochastic process that serves to capture the randomness of the horizon.
Edit intent: clarity
Original: With the rapid growth of graph datasets over the past decade, a new kind of dynamic algorithm, supporting the ability to ingest batches of updates and exploit parallelism is needed in order to efficiently process large streams of updates.
Edit intent: coherence
Original:  In this paper, we study batch and parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in  sequential setting.
Revised:  In this paper, we study batch parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in sequential setting.
Edit intent: clarity
Original:  In this paper, we study batch and parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in  sequential setting.
Revised:  In this paper, we study batch and parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in the sequential setting.
Edit intent: fluency
Original:  Perhaps the best known sequential algorithm  is the elegant level-set algorithm of Holm, de Lichtenberg and Thorup (HDT), which achieves O(\log^2 n) amortized time per edge insertion or deletion, and O(\log n  ) time per query.
Revised:  The most well known sequential algorithm is the elegant level-set algorithm of Holm, de Lichtenberg and Thorup (HDT), which achieves O(\log^2 n) amortized time per edge insertion or deletion, and O(\log n ) time per query.
Edit intent: clarity
Original:  In this paper, we design a parallel batch-dynamic connectivity algorithm that is work-efficient with respect to the HDT algorithm for small batch sizes, and is asymptotically faster when the average batch size is sufficiently large.
Revised:  We design a parallel batch-dynamic connectivity algorithm that is work-efficient with respect to the HDT algorithm for small batch sizes, and is asymptotically faster when the average batch size is sufficiently large.
Edit intent: coherence
Original:  To mitigate/confine ongoing cascading failures, we propose two network adaptations mechanisms: intentional failure and resource re-adjustment, based on which we propose an algorithm to mitigate an ongoing cascading failure while reinforcing the survived network with a high robustness to avoid further failures.
Revised:  To mitigate/confine ongoing cascading failures, we propose two network adaptations mechanisms: intentional failure and resource re-adjustment, based on which we propose an algorithm to mitigate an ongoing cascading failure while reinforcing the surviving network with a high robustness to avoid further failures.
Edit intent: fluency
Original:  This component hasa hard predictable behaviour because its state depends of the execution history of the systems.
Revised:  This component hasa hard predictable behavior because its state depends of the execution history of the systems.
Edit intent: fluency
Original:  This component hasa hard predictable behaviour because its state depends of the execution history of the systems.
Revised:  This component hasa hard predictable behaviour because its state depends of theexecution history of the systems.
Edit intent: fluency
Original: To increase predictability of COTS component we use cache Colouring , a technique widelyused to partition cache memory.
Revised: To increase predictability of COTS component we use cache coloring , a technique widelyused to partition cache memory.
Edit intent: fluency
Original: To increase predictability of COTS component we use cache Colouring , a technique widelyused to partition cache memory.
Revised: To increase predictability of COTS component we use cache Colouring , a technique widely usedto partition cache memory.
Edit intent: fluency
Original:  Our main contribution is a WCET aware heuristic which par-tition task according to the needs of each task.
Revised:  Our main contribution is a WCET aware heuristic which parti-tion task according to the needs of each task.
Edit intent: fluency