wanyu/IteraTeR_v2 huggingface dataset:
Original:  In order to illustrate the potential application of our effective interface conditions, we employ the limiting transmission problem to mathematically describe cancer cell invasion through the basement membrane and , in particular, to model the metastatic spread of ovarian carcinoma.
Revised:  In order to illustrate the potential application of our effective interface conditions, we employ the limiting transmission problem to mathematically describe cancer cell invasion through the basement membrane and the metastatic spread of ovarian carcinoma.
Edit intent: clarity
Original: Despite improved digital access to scientific publications in the last decades, the fundamental principles of scholarly communication remain unchanged and continue to be largely document-based.
Revised: Despite improved findability of and access to scientific publications in the last decades, the fundamental principles of scholarly communication remain unchanged and continue to be largely document-based.
Edit intent: clarity
Original: Despite improved digital access to scientific publications in the last decades, the fundamental principles of scholarly communication remain unchanged and continue to be largely document-based.
Revised: Despite improved digital access to scientific knowledge in recent decades, scholarly communication continues to be document-based.
Edit intent: clarity
Original:  The document-oriented workflows in science publication have reached the limits of adequacy as highlighted by recent discussions on the increasing proliferation of scientific literature, the deficiency of peer-review and the reproducibility crisis .
Revised:  Scientific knowledge remains locked in representations that are inadequate for machine processing .
Edit intent: clarity
Original:  We report on the results of a first experimental evaluation of the concept and its implementations with the participants of an international conference .
Revised:  We report on the results of a first experimental evaluation of the concept and its implementation with the participants of an international conference .
Edit intent: fluency
Original: Despite improved findability of and access to scientific knowledge in recent decades, scholarly communication continues to be document-based.
Revised: Despite improved digital access to scholarly knowledge in recent decades, scholarly communication continues to be document-based.
Edit intent: clarity
Original: Despite improved findability of and access to scientific knowledge in recent decades, scholarly communication continues to be document-based.
Revised: Despite improved findability of and access to scientific knowledge in recent decades, scholarly communication remains exclusively document-based.
Edit intent: clarity
Original:  Scientific knowledge remains locked in representations that are inadequate for machine processing .
Revised:  In this form, scholarly knowledge is hard to process automatically .
Edit intent: clarity
Original:  In this article , we present initial steps towards next generation digital libraries and infrastructures that acquire, curate, publish and process scholarly knowledge semantically, in machine readable form leveraging knowledge graphs .
Revised:  In this paper , we present initial steps towards next generation digital libraries and infrastructures that acquire, curate, publish and process scholarly knowledge semantically, in machine readable form leveraging knowledge graphs .
Edit intent: fluency
Original:  In this article , we present initial steps towards next generation digital libraries and infrastructures that acquire, curate, publish and process scholarly knowledge semantically, in machine readable form leveraging knowledge graphs .
Revised:  In this article , we present the first steps towards a knowledge graph based infrastructure that acquires scholarly knowledge in machine actionable form thus enabling new possibilities for scholarly knowledge curation, publication and processing .
Edit intent: clarity
Original:  The primary contribution of this work is to present and discuss early developments of a system designed to crowdsource machine readable descriptions of research contributions published in scholarly articles and a knowledge graph infrastructure for description storage and access.
Revised:  The primary contribution is to present and discuss early developments of a system designed to crowdsource machine readable descriptions of research contributions published in scholarly articles and a knowledge graph infrastructure for description storage and access.
Edit intent: clarity
Original:  We report on the results of a first experimental evaluation of the concept and its implementation with the participants of a recent international conference.
Revised:  We report on the results of a first experimental evaluation of the infrastructure with the participants of a recent international conference.
Edit intent: clarity
Original:  The results suggest that users find such a system useful, and the possibilities it could enable intriguing .
Revised:  Results suggest that users find such a system useful, and the possibilities it could enable intriguing .
Edit intent: clarity
Original:  The results suggest that users find such a system useful, and the possibilities it could enable intriguing .
Revised:  The results suggest that users were intrigued by the novelty of the proposed infrastructure and by the possibilities for innovative scholarly knowledge processing it could enable intriguing .
Edit intent: clarity
Original:  The results suggest that users find such a system useful, and the possibilities it could enable intriguing .
Revised:  The results suggest that users find such a system useful, and the possibilities it could enable .
Edit intent: clarity
Original:  The efficacy of our proposed method is demonstrated using numerical experiments conducted on real data.
Revised:  The efficacy of our proposed method is demonstrated using numerical experiments conducted on simulated and experimental data.
Edit intent: clarity
Original:  Our coupled mean-field approximation  still preserves the community structure and it is able to capture the main results of the Monte Carlo simulations: continuous and discontinuous order-disorder transitions as well as nonmonotonic ordering for an intermediate community strength.
Revised:  Our coupled mean-field approximation that still preserves the community structure and it is able to capture the main results of the Monte Carlo simulations: continuous and discontinuous order-disorder transitions as well as nonmonotonic ordering for an intermediate community strength.
Edit intent: fluency
Original:  The same phenomena recur when multiplying by repeated addition ( "Egyptian multiplication " ).
Revised:  The same phenomena recur when multiplying by repeated addition ( "Egyptian " ).
Edit intent: clarity
Original: We study a risk-sharing equilibrium where heterogenous agents trade subject to quadratic transaction costs.
Revised: We study risk-sharing equilibrium where heterogenous agents trade subject to quadratic transaction costs.
Edit intent: fluency
Original: We study a risk-sharing equilibrium where heterogenous agents trade subject to quadratic transaction costs.
Revised: We study a risk-sharing economies where heterogenous agents trade subject to quadratic transaction costs.
Edit intent: clarity
Original: Objective: Recent advances in electron microscopy have, for the first time, enabled imaging of single cells in 3D at a nanometer length scale resolution.
Revised:  Recent advances in electron microscopy have, for the first time, enabled imaging of single cells in 3D at a nanometer length scale resolution.
Edit intent: coherence
Original:  However, this will require a system for going from EM images to 3D volume meshes which can be used in finite element simulations .
Revised:  Enabling such simulations will require a system for going from EM images to 3D volume meshes which can be used in finite element simulations .
Edit intent: clarity
Original:  However, this will require a system for going from EM images to 3D volume meshes which can be used in finite element simulations .
Revised:  However, this will require a system for going from electron micrographs to 3D volume meshes which can be used in finite element simulations .
Edit intent: clarity
Original:  Results: We apply this pipeline to a series of electron micrographs of  dendrite morphology explored at three different length scales and show that the resultant meshes are suitable for finite element simulations.
Revised:  We apply this pipeline to a series of electron micrographs of dendrite morphology explored at three different length scales and show that the resultant meshes are suitable for finite element simulations.
Edit intent: coherence
Original:  Results: We apply this pipeline to a series of electron micrographs of  dendrite morphology explored at three different length scales and show that the resultant meshes are suitable for finite element simulations.
Revised:  Results: We apply this pipeline to a series of electron micrographs of dendrite morphology explored at three different length scales and demonstrate that the resultant meshes are suitable for finite element simulations.
Edit intent: fluency
Original:  Conclusion: Our pipeline, which consists of free and open-source community driven tools, is a step towards routine physical simulations of biological processes in realistic geometries.
Revised:  Our pipeline, which consists of free and open-source community driven tools, is a step towards routine physical simulations of biological processes in realistic geometries.
Edit intent: coherence
Original:  Significance: We posit that a new frontier at the intersection of computational technologies and single cell biology is now open.
Revised:  We posit that a new frontier at the intersection of computational technologies and single cell biology is now open.
Edit intent: coherence
Original: Recent advances in electron microscopy have , for the first time, enabled imaging of single cells in 3D at a nanometer length scale resolution .
Revised: Recent advances in electron microscopy have enabled the imaging of single cells in 3D at a nanometer length scale resolution .
Edit intent: clarity
Original: Recent advances in electron microscopy have , for the first time, enabled imaging of single cells in 3D at a nanometer length scale resolution .
Revised: Recent advances in electron microscopy have , for the first time, enabled imaging of single cells in 3D at nanometer length scale resolution .
Edit intent: fluency
Original: Recent advances in electron microscopy have , for the first time, enabled imaging of single cells in 3D at a nanometer length scale resolution .
Revised: Recent advances in electron microscopy have , for the first time, enabled imaging of single cells in 3D at a nanometer length scale resolutions .
Edit intent: fluency
Original:  We apply this pipeline to  a series of electron micrographs of neuronal dendrite morphology explored at three different length scales and demonstrate that the resultant meshes are suitable for finite element simulations.
Revised:  We apply this pipeline to a series of electron micrographs of neuronal dendrite morphology explored at three different length scales and show that the resulting meshes are suitable for finite element simulations.
Edit intent: fluency
Original:  Our pipeline, which consists of free and open-source community driven tools, is a step towards routine physical simulations of biological processes in realistic geometries .
Revised:  This work is an important step towards making physical simulations of biological processes in realistic geometries .
Edit intent: clarity
Original:  However, CAD tools that target general architectures must use large constraint systems to fully describe an architecture's flexibility, resulting in lengthy run-times.
Revised:  However, tools that target general architectures must use large constraint systems to fully describe an architecture's flexibility, resulting in lengthy run-times.
Edit intent: clarity
Original:  In this paper, we propose deriving certain properties from an otherwise generic device model, and using these properties to create a simpler ILP that retains most of the exactness of a fully-generic ILP .
Revised:  In this paper, we propose to derive connectivity information from an otherwise generic device model, and using these properties to create a simpler ILP that retains most of the exactness of a fully-generic ILP .
Edit intent: clarity
Original:  This was measured using the set of benchmarks used to originally evaluate the fully-generic approach , and several more benchmarks representing computation tasks, over three different CGRA architectures.
Revised:  This was measured using the set of benchmarks used to originally evaluate the fully-generic approach and several more benchmarks representing computation tasks, over three different CGRA architectures.
Edit intent: fluency
Original:  The system contains three main components  : out-of-distribution detection, disease prediction, and prediction explanation.
Revised:  This paper discusses the three main components : out-of-distribution detection, disease prediction, and prediction explanation.
Edit intent: clarity
Original: The Multi-agent Path Finding (MAPF) problem consists of all agents having to move to their own destinations while avoiding collisions.
Revised: The Multi-agent Path Finding (MAPF) problem consists in all agents having to move to their own destinations while avoiding collisions.
Edit intent: fluency
Original:  In practical applications of the problem, such as for navigation in an automated warehouse, MAPF must be solved iteratively.
Revised:  In practical applications to the problem, such as for navigation in an automated warehouse, MAPF must be solved iteratively.
Edit intent: clarity
Original:  We present  a novel approach for iterative MAPF, that we call Priority Inheritance with Backtracking (PIBT).
Revised:  We present here a novel approach for iterative MAPF, that we call Priority Inheritance with Backtracking (PIBT).
Edit intent: clarity
Original:  We present  a novel approach for iterative MAPF, that we call Priority Inheritance with Backtracking (PIBT).
Revised:  We present a novel approach to iterative MAPF, that we call Priority Inheritance with Backtracking (PIBT).
Edit intent: fluency
Original:  In our method, a unique priority is assigned to each agent every timestep, so that  movements are prioritized.
Revised:  In our method, a unique priority to each agent every timestep, so that movements are prioritized.
Edit intent: clarity
Original:  In our method, a unique priority is assigned to each agent every timestep, so that  movements are prioritized.
Revised:  In our method, a unique priority is assigned to each agent every timestep, so that all movements are prioritized.
Edit intent: clarity
Original:  Priority inheritance aims to deal effectively with priority inversion in path adjustment in a small time window .
Revised:  Priority inheritance , which aims at dealing effectively with priority inversion in path adjustment in a small time window .
Edit intent: coherence
Original:  Priority inheritance aims to deal effectively with priority inversion in path adjustment in a small time window .
Revised:  Priority inheritance aims to deal effectively with priority inversion in path adjustment within a small time window .
Edit intent: fluency
Original:  When a low-priority agent X impedes the movement of a higher-priority agent Y, agent X inherits the higher-priority of agent Y. Priority inheritance can be applied iteratively and the backtracking protocol prevents the presence of a stuckagent.
Revised:  When a low-priority agent X impedes the movement of a higher-priority agent Y, agent X inherits the higher-priority of agent Y. Priority inheritance can be applied iteratively and a backtracking protocol prevents the presence of a stuckagent.
Edit intent: fluency
Original:  We proved that, regardless of the numberof agents , all agents are guaranteed to reach their own destinations within a finite timeafter the destinations are given, as long as the environment is a biconnected graph .
Revised:  We proved that, regardless of their number , all agents are guaranteed to reach their own destinations within a finite timeafter the destinations are given, as long as the environment is a biconnected graph .
Edit intent: fluency
Original:  We proved that, regardless of the numberof agents , all agents are guaranteed to reach their own destinations within a finite timeafter the destinations are given, as long as the environment is a biconnected graph .
Revised:  We proved that, regardless of the numberof agents , all agents are guaranteed to reach their destination within finite time, when the environment is a biconnected graph .
Edit intent: clarity
Original:  Our implementation of PIBT can be fully decentralized in the sense that it has no single point of control and does not rely on global communication(all communication is local within 2-hops) . Experimental results over various domains demonstrate that the practicality of the proposed algorithm which is shown to produce sophisticated coordination .
Revised:  Our implementation of PIBT can be fully decentralized without global communication . Experimental results over various domains demonstrate that the practicality of the proposed algorithm which is shown to produce sophisticated coordination .
Edit intent: clarity
Original:  Experimental results over various scenarios demonstrate that PIBT is competitive with the state of the art MAPF solvers, and has high potential in practical situations .
Revised:  Experimental results over various scenarios confirm that PIBT is competitive with the state of the art MAPF solvers, and has high potential in practical situations .
Edit intent: clarity
Original:  Experimental results over various scenarios demonstrate that PIBT is competitive with the state of the art MAPF solvers, and has high potential in practical situations .
Revised:  Experimental results over various scenarios demonstrate that PIBT is adequate both for finding paths in large environments with many agents, as well as for conveying packages in an automated warehouse .
Edit intent: clarity
Original: The Multi-agent Path Finding (MAPF) problem consists in all agents having to move to their own destinations while avoiding collisions.
Revised: In the Multi-Agent Path Finding (MAPF) problem consists in all agents having to move to their own destinations while avoiding collisions.
Edit intent: fluency
Original: The Multi-agent Path Finding (MAPF) problem consists in all agents having to move to their own destinations while avoiding collisions.
Revised: The Multi-agent Path Finding (MAPF) problem , a set of agents moving on a graph must reach their own respective destinations without inter-agent collisions.
Edit intent: clarity
Original:  Priority inheritance, which aims at dealing effectively with priority inversion in path adjustment within a small time window, can be applied iteratively and a backtracking protocol prevents agents from being stuck .
Revised:  Priority inheritance, which aims at dealing effectively with priority inversion in path adjustment within a small time window, can be applied to several domains .
Edit intent: clarity
Original:  We prove that, regardless of their number, all agents are guaranteed to reach their destination within finite time, when the environment is a graph such that all pairs of adjacent nodes belong to a simple cycle of length 3 or more (e.g., biconnected).
Revised:  We prove that, regardless of their number, all agents are guaranteed to reach their destination within a finite time when the environment is a graph such that all pairs of adjacent nodes belong to a simple cycle of length 3 or more (e.g., biconnected).
Edit intent: fluency
Original:  We prove that, regardless of their number, all agents are guaranteed to reach their destination within finite time, when the environment is a graph such that all pairs of adjacent nodes belong to a simple cycle of length 3 or more (e.g., biconnected).
Revised:  We prove that, regardless of their number, all agents are guaranteed to reach their destination within finite time, when the environment is a graph such that all pairs of adjacent nodes belong to a simple cycle (e.g., biconnected).
Edit intent: clarity
Original: Modeling taxation in GMWB Variable Annuities has been frequently neglected but accounting for it can significantly improve the explanation of the withdrawal dynamics and lead to a better modeling of the financial cost of these insurance products.
Revised: Modeling taxation of Variable Annuities has been frequently neglected but accounting for it can significantly improve the explanation of the withdrawal dynamics and lead to a better modeling of the financial cost of these insurance products.
Edit intent: clarity
Original:  The importance of including a model of taxation has first been observed by Moenig and Bauer while considering the Black-Scholes model to describe the underlying security.
Revised:  The importance of including a model for taxation has first been observed by Moenig and Bauer while considering the Black-Scholes model to describe the underlying security.
Edit intent: fluency
Original:  The importance of including a model of taxation has first been observed by Moenig and Bauer while considering the Black-Scholes model to describe the underlying security.
Revised:  The importance of including a model of taxation has first been observed by Moenig and Bauer while considering the Black-Scholes dynamics to describe the underlying security.
Edit intent: clarity
Original:  To this aim  we develop a numerical framework which allows one to efficiently compute the fair fee value of a contract.
Revised:  To this aim , we develop a numerical framework which allows one to efficiently compute the fair fee value of a contract.
Edit intent: fluency
Original:  To this aim  we develop a numerical framework which allows one to efficiently compute the fair fee value of a contract.
Revised:  To this aim we develop a numerical framework which allows one to efficiently compute the fair value of a contract.
Edit intent: clarity
Original:  Results show that accounting for both taxation and stochastic interest rate has determinant effects on the behavior of the policy holder and on the cost of GMWB contracts  .
Revised:  Results show that accounting for both taxation and stochastic interest rate has a determinant impact on the withdrawal strategy and on the cost of GMWB contracts .
Edit intent: clarity
Original: Polylingual Text Classification ( PLC ) consists of automatically classifying, according to a common set C of classes, documents each written in one of a set of languages L, and doing so more accurately than when naively classifying each document via its corresponding language-specific classifier.
Revised: Polylingual Text Classification ( CLC ) consists of automatically classifying, according to a common set C of classes, documents each written in one of a set of languages L, and doing so more accurately than when naively classifying each document via its corresponding language-specific classifier.
Edit intent: clarity
Original:  We present substantial experiments, run on publicly available polylingual text collections, in which funnelling is shown to significantly outperform a number of state-of-the-art baselines.
Revised:  We present substantial experiments, run on publicly available multilingual text collections, in which funnelling is shown to significantly outperform a number of state-of-the-art baselines.
Edit intent: fluency
Original: Uncertainty quantification techniques based on generalized polynomial chaos have been used in many application domains.
Revised: Uncertainty quantification based on generalized polynomial chaos have been used in many application domains.
Edit intent: clarity
Original: Uncertainty quantification techniques based on generalized polynomial chaos have been used in many application domains.
Revised: Uncertainty quantification techniques based on generalized polynomial chaos has been used in many application domains.
Edit intent: fluency