wanyu/IteraTeR_v2 huggingface dataset:
Original:  However, it is well-known that socioeconomic and environmental constraints might change considerably during the network lifetime , such as planned increments of wind-power generation capacities, variations of environmental conditions due to climate change or growing trends on consumption patterns, and these changes might also affect the optimal capacity expansion planning.
Revised:  However, it is well-known that socioeconomic and environmental constraints might change considerably during the network life , such as planned increments of wind-power generation capacities, variations of environmental conditions due to climate change or growing trends on consumption patterns, and these changes might also affect the optimal capacity expansion planning.
Edit intent: fluency
Original:  However, it is well-known that socioeconomic and environmental constraints might change considerably during the network lifetime , such as planned increments of wind-power generation capacities, variations of environmental conditions due to climate change or growing trends on consumption patterns, and these changes might also affect the optimal capacity expansion planning.
Revised:  However, it is well-known that socioeconomic and environmental constraints might change considerably during the network lifetime , such as planned increases in wind-power generation capacities, variations of environmental conditions due to climate change or growing trends on consumption patterns, and these changes might also affect the optimal capacity expansion planning.
Edit intent: clarity
Original:  However, it is well-known that socioeconomic and environmental constraints might change considerably during the network lifetime , such as planned increments of wind-power generation capacities, variations of environmental conditions due to climate change or growing trends on consumption patterns, and these changes might also affect the optimal capacity expansion planning.
Revised:  However, it is well-known that socioeconomic and environmental constraints might change considerably during the network lifetime , such as planned increments of wind-power generation capacities, variations of environmental conditions due to climate change , or changing trends in consumption patterns, and these changes might also affect the optimal capacity expansion planning.
Edit intent: clarity
Original:  However, it is well-known that socioeconomic and environmental constraints might change considerably during the network lifetime , such as planned increments of wind-power generation capacities, variations of environmental conditions due to climate change or growing trends on consumption patterns, and these changes might also affect the optimal capacity expansion planning.
Revised:  However, it is well-known that socioeconomic and environmental constraints might change considerably during the network lifetime , such as planned increments of wind-power generation capacities, variations of environmental conditions due to climate change or growing trends on consumption patterns, and these changes might also affect optimal capacity expansion planning.
Edit intent: fluency
Original:  This paper drops the classical stationarity assumption and extends an existing adaptive robust transmission expansion planning formulation for non-stationary situations .
Revised:  In this paper the classical stationarity assumption and extends an existing adaptive robust transmission expansion planning formulation for non-stationary situations .
Edit intent: clarity
Original:  This paper drops the classical stationarity assumption and extends an existing adaptive robust transmission expansion planning formulation for non-stationary situations .
Revised:  This paper drops the classical stationarity assumption is dispensed with and the existing adaptive robust transmission expansion planning formulation for non-stationary situations .
Edit intent: clarity
Original:  This paper drops the classical stationarity assumption and extends an existing adaptive robust transmission expansion planning formulation for non-stationary situations .
Revised:  This paper drops the classical stationarity assumption and extends an existing adaptive robust transmission expansion planning formulation for non-stationary approaches is expanded .
Edit intent: clarity
Original:  The solution of this problem provides information not only about what additional lines must be installed but the construction timing during the study horizon as well.
Revised:  The solution for this problem provides information not only about what additional lines must be installed but the construction timing during the study horizon as well.
Edit intent: clarity
Original:  In this paper the classical stationarity assumption is dispensed with and the existing adaptive robust transmission  expansion planning formulation for non-stationary approaches is expanded.
Revised:  In this paper an adaptive robust transmission expansion planning formulation for non-stationary approaches is expanded.
Edit intent: clarity
Original:  In this paper the classical stationarity assumption is dispensed with and the existing adaptive robust transmission  expansion planning formulation for non-stationary approaches is expanded.
Revised:  In this paper the classical stationarity assumption is dispensed with and the existing adaptive robust transmission network expansion planning formulation for non-stationary approaches is expanded.
Edit intent: clarity
Original:  In this paper, we consider a general spatial crowdsourcing problem, namely multi-skill spatial crowdsourcing (MS-SC), in which spatial tasks (such as holding a barbecue party , decorating a room, and performing entertainment shows for a ceremony) are time-constrained and featured with sets of required skills under the specified budget constraints, and workers have different skillsand expertise, constrained by maximum traveling distances.
Revised:  In this paper, we consider a spatial tasks (such as holding a barbecue party , decorating a room, and performing entertainment shows for a ceremony) are time-constrained and featured with sets of required skills under the specified budget constraints, and workers have different skillsand expertise, constrained by maximum traveling distances.
Edit intent: coherence
Original:  In this paper, we consider a general spatial crowdsourcing problem, namely multi-skill spatial crowdsourcing (MS-SC), in which spatial tasks (such as holding a barbecue party , decorating a room, and performing entertainment shows for a ceremony) are time-constrained and featured with sets of required skills under the specified budget constraints, and workers have different skillsand expertise, constrained by maximum traveling distances.
Revised:  In this paper, we consider a general spatial crowdsourcing problem, namely multi-skill spatial crowdsourcing (MS-SC), in which spatial tasks (such as holding a barbecue party , decorating a room, and performing entertainment shows for a ceremony) is time-constrained and featured with sets of required skills under the specified budget constraints, and workers have different skillsand expertise, constrained by maximum traveling distances.
Edit intent: fluency
Original:  Therefore, we propose three effective heuristic approaches, including greedy, g-divide-and-conquer , and cost-model-based adaptive algorithms  .
Revised:  Therefore, we propose three effective heuristic approaches, including greedy, g-divide-and-conquer and cost-model-based adaptive algorithms .
Edit intent: fluency
Original: We consider the  problem of fairly dividing a two-dimensional heterogeneous good , such as land or ad space in print and electronic media, among several agents with different utilities . Classic cake-cutting procedures either allocate each agent a collection of disconnected pieces, or assume that the cake is a one-dimensional interval.
Revised: We consider the classic problem of fairly dividing a two-dimensional heterogeneous good , such as land or ad space in print and electronic media, among several agents with different utilities . Classic cake-cutting procedures either allocate each agent a collection of disconnected pieces, or assume that the cake is a one-dimensional interval.
Edit intent: fluency
Original: We consider the  problem of fairly dividing a two-dimensional heterogeneous good , such as land or ad space in print and electronic media, among several agents with different utilities . Classic cake-cutting procedures either allocate each agent a collection of disconnected pieces, or assume that the cake is a one-dimensional interval.
Revised: We consider the problem of fairly dividing a heterogeneous good ("cake") among several agents with different utilities . Classic cake-cutting procedures either allocate each agent a collection of disconnected pieces, or assume that the cake is a one-dimensional interval.
Edit intent: clarity
Original: We consider the  problem of fairly dividing a two-dimensional heterogeneous good , such as land or ad space in print and electronic media, among several agents with different utilities . Classic cake-cutting procedures either allocate each agent a collection of disconnected pieces, or assume that the cake is a one-dimensional interval.
Revised: We consider the problem of fairly dividing a two-dimensional heterogeneous good , such as land or ad space in print and electronic media, among several agents with different valuations . Classic cake-cutting procedures either allocate each agent a collection of disconnected pieces, or assume that the cake is a one-dimensional interval.
Edit intent: clarity
Original:  In practice, however, the two-dimensional shape of the allotted pieces may be of crucial importance .
Revised:  In practice, however, the two-dimensional shape of the allotted pieces is important .
Edit intent: clarity
Original:  Indeed, even the most elementary fairness criterion - proportionality - can no longer be guaranteed.
Revised:  Indeed, even the most elementary fairness criterion --- proportionality --- can no longer be guaranteed.
Edit intent: fluency
Original: In lens cataract, the clouding change in the lens leads to a decline of transparency of a part of the lens.
Revised: In lens cataract, the clouding change in lens leads to a decline of transparency of a part of the lens.
Edit intent: fluency
Original: In lens cataract, the clouding change in the lens leads to a decline of transparency of a part of the lens.
Revised: In lens cataract, the clouding change in the lens leads to a decline of transparency of part of the lens.
Edit intent: fluency
Original:  The pathology of a clouding change in cortical cataract is characterized by disruption of some lens fibers, swelling of some other fibers, and deposition of water between fibers.
Revised:  The pathology of clouding change in cortical cataract is characterized by disruption of some lens fibers, swelling of some other fibers, and deposition of water between fibers.
Edit intent: fluency
Original:  I. Cortical cataract is triggered by the disruption of a cortical lens fiber as a result of an injury.
Revised:  I. Cortical cataract is triggered by disruption of a cortical lens fiber as a result of an injury.
Edit intent: fluency
Original:  I. Cortical cataract is triggered by the disruption of a cortical lens fiber as a result of an injury.
Revised:  I. Cortical cataract is triggered by the disruption of a cortical lens fiber as a result of injury.
Edit intent: fluency
Original:  II. The neighbor fibers can absorb this water due to the high intracellular osmotic pressure (IOP) and become swollen.
Revised:  II. Neighbor fibers can absorb this water due to the high intracellular osmotic pressure (IOP) and become swollen.
Edit intent: coherence
Original:  II. The neighbor fibers can absorb this water due to the high intracellular osmotic pressure (IOP) and become swollen.
Revised:  II. The neighbor fibers can absorb this water due to high intracellular osmotic pressure (IOP) and become swollen.
Edit intent: fluency
Original:  Swelling makes a fiber be stiff and have increased risk to disrupt when it is curved during the accommodations of the lens.
Revised:  Swelling makes a fiber be stiff and have increased risk to disrupt when it is curved during the accommodation of the lens.
Edit intent: fluency
Original:  III. The successive swellings and disruptions of local fibers result in the enlargement of a clouding change in lens.
Revised:  III. The successive swellings and disruptions of local fibers result in enlargement of a clouding change in lens.
Edit intent: fluency
Original:  Conclusion: in our view , the progressive development of senile cortical cataract is a result of successive swellings and disruptions of local lens fibers, which is driven by the high IOP in lens fibers .
Revised:  In conclusion , the progressive development of senile cortical cataract is a result of successive swellings and disruptions of local lens fibers, which is driven by the high IOP in lens fibers .
Edit intent: clarity
Original:  Conclusion: in our view , the progressive development of senile cortical cataract is a result of successive swellings and disruptions of local lens fibers, which is driven by the high IOP in lens fibers .
Revised:  Conclusion: in our view , the progressive development of senile cortical cataract is a result of successive swellings and disruptions of local lens fibers, and this is driven by the high IOP in lens fibers .
Edit intent: coherence
Original:  Conclusion: in our view , the progressive development of senile cortical cataract is a result of successive swellings and disruptions of local lens fibers, which is driven by the high IOP in lens fibers .
Revised:  Conclusion: in our view , the progressive development of senile cortical cataract is a result of successive swellings and disruptions of local lens fibers, which is driven by the high IOP in a lens fiber .
Edit intent: fluency
Original:  In the case of a finite jump measure with a bounded intensity, one can also handle a state-dependent intensity process, which is quite relevant for many practical applications  .
Revised:  In the case of a finite jump measure with a bounded intensity, the method can also handle a state-dependent intensity process, which is quite relevant for many practical applications .
Edit intent: clarity
Original:  A semi-analytic solution technique , which only requires a system of ODEs (one is non-linear and the others are linear) to be solved, as well as its error estimate are provided .
Revised:  A semi-analytic solution technique as well as its error estimate are provided .
Edit intent: coherence
Original: This paper is showing the solution for two open problems about  decidability of the vector reachability problem in a finitely generated semigroup of matrices from SL(2,Z) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are form SL(2,Z).
Revised: This paper is showing the solution for two open problems about the decidability of the vector reachability problem in a finitely generated semigroup of matrices from SL(2,Z) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are form SL(2,Z).
Edit intent: fluency
Original: This paper is showing the solution for two open problems about  decidability of the vector reachability problem in a finitely generated semigroup of matrices from SL(2,Z) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are form SL(2,Z).
Revised: This paper is showing the solution for two open problems about decidability of the vector reachability problem over a finitely generated semigroup of matrices from SL(2,Z) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are form SL(2,Z).
Edit intent: clarity
Original: This paper is showing the solution for two open problems about  decidability of the vector reachability problem in a finitely generated semigroup of matrices from SL(2,Z) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are form SL(2,Z).
Revised: This paper is showing the solution for two open problems about decidability of the vector reachability problem in a finitely generated semigroup of matrices from SL(2,Z) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are from SL(2,Z).
Edit intent: fluency
Original:  The approach of solving reachability problems is based on analysis of reachability paths between points following the translation of numerical reachability problems into computational and combinatorial problems on words and formal languages  .
Revised:  The approach to solving reachability problems is based on analysis of reachability paths between points following the translation of numerical reachability problems into computational and combinatorial problems on words and formal languages .
Edit intent: fluency
Original:  The approach of solving reachability problems is based on analysis of reachability paths between points following the translation of numerical reachability problems into computational and combinatorial problems on words and formal languages  .
Revised:  The approach of solving reachability problems is based on the characterization of reachability paths between points following the translation of numerical reachability problems into computational and combinatorial problems on words and formal languages .
Edit intent: clarity
Original:  The approach of solving reachability problems is based on analysis of reachability paths between points following the translation of numerical reachability problems into computational and combinatorial problems on words and formal languages  .
Revised:  The approach of solving reachability problems is based on analysis of reachability paths between points which is followed by the translation of numerical reachability problems into computational and combinatorial problems on words and formal languages .
Edit intent: clarity
Original: In a great many of the contexts in which groups of cilia or flagella are found they exhibit synchronized behavior .
Revised: Cilia and flagella often exhibit synchronized behavior .
Edit intent: clarity
Original:  This includes phase-locking , as seen in Chlamydomonas flagella {\it  , and metachronal wave formation in the ciliary arrays of Paramecium or in the respiratory cilia of higher organisms.
Revised:  This includes phase-locking , as seen in {\it , and metachronal wave formation in the ciliary arrays of Paramecium or in the respiratory cilia of higher organisms.
Edit intent: clarity
Original:  This includes phase-locking , as seen in Chlamydomonas flagella {\it  , and metachronal wave formation in the ciliary arrays of Paramecium or in the respiratory cilia of higher organisms.
Revised:  This includes phase-locking , as seen in Chlamydomonas flagella {\it , and metachronal wave formation in the respiratory cilia of higher organisms.
Edit intent: clarity
Original:  Recent work on the dynamics of physically separated pairs of flagella isolated from the multicellular alga Volvox {\it  has shown that hydrodynamic coupling alone is sufficient to produce synchrony.
Revised:  Recent work on the dynamics of physically separated pairs of flagella isolated from the multicellular alga {\it has shown that hydrodynamic coupling alone is sufficient to produce synchrony.
Edit intent: clarity
Original:  This indicates{\it   that a mechanism, internal to the cell, provides an additional flagellar coupling.
Revised:  This indicates{\it that a mechanism, internal to the cell, must provide an additional flagellar coupling.
Edit intent: clarity
Original: Choreographic Programming is a methodology for the development of concurrent software based on a correctness-by-construction approach which, given a global description of a system (a choreography) , automatically generates deadlock-free communicating programs via an EndPoint Projection (EPP).
Revised: Choreographic Programming is a correct-by-construction paradigm for distributed programming, where global declarative descriptions of communications (choreographies) are used to synthesise deadlock-free communicating programs via an EndPoint Projection (EPP).
Edit intent: clarity
Original:  Previous works use target-languages for EPP that, like their source choreography languages, model communications using channel names ( e.g., variants of CCSand \pi -calculus) .
Revised:  Previous works use target-languages for EPP that, like their source choreography languages, model communications using channel names ( \pi -calculus) .
Edit intent: clarity
Original:  We bridge this gap by developing Applied Choreographies (AC) , a new model for choreographic programming.
Revised:  As a solution, we propose the framework of Applied Choreographies (AC) , a new model for choreographic programming.
Edit intent: clarity
Original:  This is the first result of such correct- ness property in the case of a real-world implemented language .
Revised:  This is the first result of such correct- ness property in the case of a real-world " communication mechanism .
Edit intent: clarity
Original:  Choreographies are global descriptions of communications in concurrent systems, which have been used in different methodologies for the verification or synthesis of programs.
Revised:  Choreographies are global descriptions of communications , called choreographies. Previous work used choreographies for the synthesis of programs.
Edit intent: clarity
Original:  However , there is no formalisation that provides a chain of correctness from choreographies to their implementations.
Revised:  Alas , there is no formalisation that provides a chain of correctness from choreographies to their implementations.
Edit intent: fluency
Original:  This problem originates from the gap between previous theoretical models, which abstract communications using channel names (\`a la CCS/ \pi -calculus), and their implementations, which use low-level mechanisms for message routing.
Revised:  This problem originates from the gap between existing theoretical models, which abstract communications using channel names (\`a la CCS/ \pi -calculus), and their implementations, which use low-level mechanisms for message routing.
Edit intent: clarity
Original:  This problem originates from the gap between previous theoretical models, which abstract communications using channel names (\`a la CCS/ \pi -calculus), and their implementations, which use low-level mechanisms for message routing.
Revised:  This problem originates from the gap between previous theoretical models, which abstract communications using channel names (\`a la CCS/ \pi -calculus), and their implementations, which use low-level mechanisms for message routing.
Edit intent: fluency
Original:  Then, choreographies are compiled to a real-world execution model for Service-Oriented Computing (SOC).
Revised:  Then, they use a compilation procedure to transform a choreography into a low-level, implementation-adherent calculus of Service-Oriented Computing (SOC).
Edit intent: clarity
Original:  With the location uncertainty , the FRK proves to reduce the computational complexity of the spatial interpolation while keeping an acceptable prediction error .
Revised:  With the location uncertainty proves to enhance the prediction accuracy while keeping a reasonable computational complexity .
Edit intent: clarity
Original:  We thus conduct an empirical sensitivity analysis of one-layer CNNs to explore the effect of each part of the architecture on the performance;
Revised:  We thus conduct a sensitivity analysis of one-layer CNNs to explore the effect of each part of the architecture on the performance;
Edit intent: clarity
Original:  We thus conduct an empirical sensitivity analysis of one-layer CNNs to explore the effect of each part of the architecture on the performance;
Revised:  We thus conduct an empirical sensitivity analysis of one-layer CNNs to explore the effect of architecture components on model performance;
Edit intent: clarity