wanyu/IteraTeR_v2 huggingface dataset:
Original:  The uncertainty associated with fire outbreaks is modeled using a finite set of fire scenarios.
Revised:  The risk associated with fire outbreaks is modeled using a finite set of fire scenarios.
Edit intent: clarity
Original:  Each scenario \%defines corresponds to a fire outbreak on a single zone (i.e., on a vertex) with the main consequence of modifying evacuation paths in two ways.
Revised:  Each scenario corresponds to a fire outbreak on a single zone (i.e., on a vertex) with the main consequence of modifying evacuation paths in two ways.
Edit intent: clarity
Original:  Second, the fact that \%somebody someone close to the fire may not take rational decisions when selecting a direction to escape is modeled using new kinds of evacuation paths.
Revised:  Second, the fact that someone close to the fire may not take rational decisions when selecting a direction to escape is modeled using new kinds of evacuation paths.
Edit intent: clarity
Original:  In this paper, for a given instance of %DIFDELCMD < {\tt %%% Min PpCP defined by an edge-weighted graph G=(V,E,L) and an integer p, we characterize the set of feasible solutions of %DIFDELCMD < {\tt %%% Min PpCP .
Revised:  In this paper, for a given instance of %DIFDELCMD < {\tt %%% Min PpCP defined by an edge-weighted graph G=(V,E,L) and an integer p, we characterize the set of feasible solutions of %DIFDELCMD < {\tt %%% Min PpCP .
Edit intent: fluency
Original:  We prove that %DIFDELCMD < {\tt %%% Min PpCP cannot be approximated with a ratio less than \frac{56 on subgrids (subgraphs of grids) of degree at most 3.
Revised:  We prove that %DIFDELCMD < {\tt %%% Min PpCP cannot be approximated with a ratio less than \frac{56 on subgrids (subgraphs of grids) of degree at most 3.
Edit intent: fluency
Original:  Then, we propose some approximation results for %DIFDELCMD < {\tt %%% Min PpCP .
Revised:  Then, we propose some approximation results for %DIFDELCMD < {\tt %%% Min PpCP .
Edit intent: fluency
Original:  These results require approximation results for two variants of the (deterministic) %DIFDELCMD < {\tt %%% Min p-Center problem called%DIFDELCMD < {\tt %%%  Min MAC p-Center and%DIFDELCMD < {\tt %%%  Min Partial p-Center .
Revised:  These results require approximation results for two variants of the (deterministic) %DIFDELCMD < {\tt %%% Min p-Center %DIFDELCMD < {\tt %%% Min MAC p-Center and%DIFDELCMD < {\tt %%% Min Partial p-Center .
Edit intent: clarity
Original:  These results require approximation results for two variants of the (deterministic) %DIFDELCMD < {\tt %%% Min p-Center problem called%DIFDELCMD < {\tt %%%  Min MAC p-Center and%DIFDELCMD < {\tt %%%  Min Partial p-Center .
Revised:  These results require approximation results for two variants of the (deterministic) %DIFDELCMD < {\tt %%% Min p-Center problem called%DIFDELCMD < {\tt %%% problem called Min MAC p-Center and%DIFDELCMD < {\tt %%% Min Partial p-Center .
Edit intent: fluency
Original:  These results require approximation results for two variants of the (deterministic) %DIFDELCMD < {\tt %%% Min p-Center problem called%DIFDELCMD < {\tt %%%  Min MAC p-Center and%DIFDELCMD < {\tt %%%  Min Partial p-Center .
Revised:  These results require approximation results for two variants of the (deterministic) %DIFDELCMD < {\tt %%% Min p-Center problem called%DIFDELCMD < {\tt %%% Min MAC p-Center %DIFDELCMD < {\tt %%% Min Partial p-Center .
Edit intent: coherence
Original:  These results require approximation results for two variants of the (deterministic) %DIFDELCMD < {\tt %%% Min p-Center problem called%DIFDELCMD < {\tt %%%  Min MAC p-Center and%DIFDELCMD < {\tt %%%  Min Partial p-Center .
Revised:  These results require approximation results for two variants of the (deterministic) %DIFDELCMD < {\tt %%% Min p-Center problem called%DIFDELCMD < {\tt %%% Min MAC p-Center and%DIFDELCMD < {\tt %%% and Min Partial p-Center .
Edit intent: fluency
Original:  To address this issue, in this work based on wearable sensing and machine learning techniques, we developed an automated system that can predict the assessment score in an objective and continues manner.
Revised:  To address this issue, in this work based on wearable sensing and machine learning techniques, we developed an automated system that can predict the assessment score in an objective manner.
Edit intent: coherence
Original: Computer models of cardiac electro-mechanics (EM) have the potential to enhance our understanding of underlying mechanisms in the analysis of normal and dysfunctional hearts and show promise as a guidance in designing anddeveloping new treatment.
Revised: Computer models of cardiac electro-mechanics (EM) have the potential to enhance our understanding of underlying mechanisms in the analysis of normal and dysfunctional hearts and show promise as an effective means for the quantitative analysis of clinical data and, potentially, provide capabilities to predict the response to therapies. To realize such modeling applications methodological key challenges must be addressed. To endow models with predictive capabilities they must comprehensively encapsulate relevant cardiovascular mechanism, achieve computational efficiency and robustness to enable simulations of prolonged observation periods under a broad range of conditions, and, thus, facilitate model personalization within tractable time frames.
Edit intent: coherence
Original:  In this study, we present the coupling of a 3D  bi-ventricular EM model to the sophisticated 0D  closed-loop model CircAdapt .
Revised:  In this study, we present the coupling of a 3D model of bi-ventricular EM model to the sophisticated 0D closed-loop model CircAdapt .
Edit intent: clarity
Original:  In this study, we present the coupling of a 3D  bi-ventricular EM model to the sophisticated 0D  closed-loop model CircAdapt .
Revised:  In this study, we present the coupling of a 3D bi-ventricular EM to the 0D closed-loop model CircAdapt .
Edit intent: clarity
Original: Computer models of cardiac electro-mechanics (EM) and cardiovascular hemodynamics show promise as an effective means for the quantitative analysis of clinical data and, potentially, provide capabilities to predict the response to therapies.
Revised: Computer models of cardiac electro-mechanics (EM) show promise as an effective means for the quantitative analysis of clinical data and, potentially, provide capabilities to predict the response to therapies.
Edit intent: clarity
Original: Computer models of cardiac electro-mechanics (EM) and cardiovascular hemodynamics show promise as an effective means for the quantitative analysis of clinical data and, potentially, provide capabilities to predict the response to therapies.
Revised: Computer models of cardiac electro-mechanics (EM) and cardiovascular hemodynamics show promise as an effective means for quantitative analysis of clinical data and, potentially, provide capabilities to predict the response to therapies.
Edit intent: fluency
Original:  To endow models with predictive capabilities they must comprehensively encapsulate relevant cardiovascular mechanism, achieve computational efficiency and robustness to enable simulations of prolonged observation periods under a broad range of conditions, and , thus, facilitate model personalization within tractable time frames .
Revised:  Enhanced computational efficiency and robustness to enable simulations of prolonged observation periods under a broad range of conditions, and , thus, facilitate model personalization within tractable time frames .
Edit intent: coherence
Original:  To endow models with predictive capabilities they must comprehensively encapsulate relevant cardiovascular mechanism, achieve computational efficiency and robustness to enable simulations of prolonged observation periods under a broad range of conditions, and , thus, facilitate model personalization within tractable time frames .
Revised:  To endow models with predictive capabilities they must comprehensively encapsulate relevant cardiovascular mechanism, achieve computational efficiency and robustness is crucial to facilitate, within tractable time frames, model personalization, the simulation of prolonged observation periods under a broad range of conditions, and , thus, facilitate model personalization within tractable time frames .
Edit intent: coherence
Original:  Here, these challenges are addressed by introducing a flexible method for coupling a 3D model of bi-ventricular EM to the  0D CircAdapt model representing atrial EM and closed-loop circulation.
Revised:  Here, these challenges are addressed by introducing a flexible method for coupling a 3D model of bi-ventricular EM to the 0D CircAdapt model representing atrial mechanics and closed-loop circulation.
Edit intent: clarity
Original:  A detailed mathematical description is given and efficiency, robustness  and accuracy of numerical scheme and solver implementation are evaluated.
Revised:  A detailed mathematical description is given and efficiency, robustness , and accuracy of numerical scheme and solver implementation are evaluated.
Edit intent: fluency
Original:  After parameterization and stabilization  to a limit cycle under baseline conditions, the model is shown to replicate physiological behaviors  by simulating the transient response to alterations in loading conditions and contractility, induced by protocols for assessing of systolic and diastolic ventricular properties  .
Revised:  After parameterization and stabilization to a limit cycle under baseline conditions, the model 's ability to replicate physiological behaviors by simulating the transient response to alterations in loading conditions and contractility, induced by protocols for assessing of systolic and diastolic ventricular properties .
Edit intent: clarity
Original:  After parameterization and stabilization  to a limit cycle under baseline conditions, the model is shown to replicate physiological behaviors  by simulating the transient response to alterations in loading conditions and contractility, induced by protocols for assessing of systolic and diastolic ventricular properties  .
Revised:  After parameterization and stabilization to a limit cycle under baseline conditions, the model is shown to replicate physiological behaviors is demonstrated, by simulating the transient response to alterations in loading conditions and contractility, induced by protocols for assessing of systolic and diastolic ventricular properties .
Edit intent: clarity
Original:  After parameterization and stabilization  to a limit cycle under baseline conditions, the model is shown to replicate physiological behaviors  by simulating the transient response to alterations in loading conditions and contractility, induced by protocols for assessing of systolic and diastolic ventricular properties  .
Revised:  After parameterization and stabilization to a limit cycle under baseline conditions, the model is shown to replicate physiological behaviors by simulating the transient response to alterations in loading conditions and contractility, as induced by experimental protocols used for assessing systolic and diastolic ventricular properties .
Edit intent: clarity
Original:  Many combinatorial properties can be seen as monotone properties , and the problem of finding a minimum subset of U satisfying \Pi is a central problem in combinatorial optimization.
Revised:  Many combinatorial properties can be seen as monotone properties . The problem of finding a minimum subset of U satisfying \Pi is a central problem in combinatorial optimization.
Edit intent: coherence
Original:  Using wavelets in time and standard finite elements in space, we solve the resulting system in optimal linear complexity on a single processor, and in optimal logarithmic complexity when parallelized in both space and time.
Revised:  Using wavelets in time and standard finite elements in space, we solve the resulting system in linear complexity on a single processor, and in optimal logarithmic complexity when parallelized in both space and time.
Edit intent: fluency
Original:  Using wavelets in time and standard finite elements in space, we solve the resulting system in optimal linear complexity on a single processor, and in optimal logarithmic complexity when parallelized in both space and time.
Revised:  Using wavelets in time and standard finite elements in space, we solve the resulting system in optimal linear complexity on a single processor, and in polylogarithmic complexity when parallelized in both space and time.
Edit intent: clarity
Original:  We here show for an analytically solvable network model that the effective action in statistical field theory is identical to the rate function in large deviation theory;
Revised:  We here show for an analytically solvable network model that the effective action is identical to the rate function in large deviation theory;
Edit intent: clarity
Original:  It takes the form of a Kullback-Leibler divergence and enables data-driven inference of model parameters and Bayesian prediction of time series  .
Revised:  It takes the form of a Kullback-Leibler divergence which enables data-driven inference of model parameters and Bayesian prediction of time series .
Edit intent: coherence
Original:  It takes the form of a Kullback-Leibler divergence and enables data-driven inference of model parameters and Bayesian prediction of time series  .
Revised:  It takes the form of a Kullback-Leibler divergence and enables data-driven inference of model parameters , Bayesian prediction of time series .
Edit intent: coherence
Original: We here unify the field theoretical approach to neuronal networks with large deviation theory.
Revised: We here unify the field theoretical approach to neuronal networks with large deviations theory.
Edit intent: fluency
Original:  This rate function takes the form of a Kullback-Leibler divergence which enables data-driven inference of model parameters , Bayesian prediction of time series, and calculation of fluctuations beyond mean--field theory.
Revised:  This rate function takes the form of a Kullback-Leibler divergence which enables data-driven inference of model parameters and calculation of fluctuations beyond mean--field theory.
Edit intent: clarity
Original:  This rate function takes the form of a Kullback-Leibler divergence which enables data-driven inference of model parameters , Bayesian prediction of time series, and calculation of fluctuations beyond mean--field theory.
Revised:  This rate function takes the form of a Kullback-Leibler divergence which enables data-driven inference of model parameters , Bayesian prediction of time series, and calculation of fluctuations beyond mean-field theory.
Edit intent: fluency
Original:  Lastly, we expose a regime with fluctuation--induced transitions between mean--field solutions.
Revised:  Lastly, we expose a regime with fluctuation-induced transitions between mean-field solutions.
Edit intent: fluency
Original:  This paper introduces the first bounded model checking (BMC) algorithm for hyperproperties expressed in HyperLTL  . Just as the classic BMC technique for LTL primarily aiming at finding bugs, our approach also targets identifying counterexamples.
Revised:  This paper introduces a bounded model checking (BMC) algorithm for hyperproperties expressed in HyperLTL . Just as the classic BMC technique for LTL primarily aiming at finding bugs, our approach also targets identifying counterexamples.
Edit intent: clarity
Original:  This paper introduces the first bounded model checking (BMC) algorithm for hyperproperties expressed in HyperLTL  . Just as the classic BMC technique for LTL primarily aiming at finding bugs, our approach also targets identifying counterexamples.
Revised:  This paper introduces the first bounded model checking (BMC) algorithm for hyperproperties expressed in HyperLTL . Just as the classic BMC technique for LTL primarily aims at finding bugs, our approach also targets identifying counterexamples.
Edit intent: fluency
Original:  LTL describes the property of individual traces and BMC for LTL is reduced to SAT solving  .
Revised:  BMC for LTL is reduced to SAT solving .
Edit intent: coherence
Original:  LTL describes the property of individual traces and BMC for LTL is reduced to SAT solving  .
Revised:  LTL describes the property of individual traces and BMC for LTL is reduced to SAT solving , because LTL describes a property via inspecting individual traces .
Edit intent: clarity
Original:  HyperLTL allows explicit and simultaneous quantification over traces and describes the property of multiple traces and, hence, our BMC approach naturally reduces to QBF solving.
Revised:  HyperLTL allows explicit and simultaneous quantification over traces and describes properties that involves multiple traces and, hence, our BMC approach naturally reduces to QBF solving.
Edit intent: clarity
Original:  We report on successful and efficient model checking  of a rich set of experiments on a variety of case studies, including security /privacy , concurrent data structures, and path planning in robotics applications .
Revised:  We report on successful and efficient model checking of a rich set of experiments on a variety of case studies, including security , concurrent data structures, and path planning in robotics applications .
Edit intent: clarity
Original: In the era of big scholarly data, researchers frequently encounter the following problems when writing scientific articles:  1) it's challenging to select appropriate references to support the research idea , and 2)  literature review is not conducted extensively, which leads to working on a research problem that has been well addressedby others.
Revised: Purpose: Researchers frequently encounter the following problems when writing scientific articles: 1) it's challenging to select appropriate references to support the research idea , and 2) literature review is not conducted extensively, which leads to working on a research problem that has been well addressedby others.
Edit intent: clarity
Original: In the era of big scholarly data, researchers frequently encounter the following problems when writing scientific articles:  1) it's challenging to select appropriate references to support the research idea , and 2)  literature review is not conducted extensively, which leads to working on a research problem that has been well addressedby others.
Revised: In the era of big scholarly data, researchers frequently encounter the following problems when writing scientific articles: ( 1) it's challenging to select appropriate references to support the research idea , and 2) literature review is not conducted extensively, which leads to working on a research problem that has been well addressedby others.
Edit intent: fluency
Original: In the era of big scholarly data, researchers frequently encounter the following problems when writing scientific articles:  1) it's challenging to select appropriate references to support the research idea , and 2)  literature review is not conducted extensively, which leads to working on a research problem that has been well addressedby others.
Revised: In the era of big scholarly data, researchers frequently encounter the following problems when writing scientific articles: 1) Selecting appropriate citations to support the research idea , and 2) literature review is not conducted extensively, which leads to working on a research problem that has been well addressedby others.
Edit intent: clarity
Original: In the era of big scholarly data, researchers frequently encounter the following problems when writing scientific articles:  1) it's challenging to select appropriate references to support the research idea , and 2)  literature review is not conducted extensively, which leads to working on a research problem that has been well addressedby others.
Revised: In the era of big scholarly data, researchers frequently encounter the following problems when writing scientific articles: 1) it's challenging to select appropriate references to support the research idea , and 2) The literature review is not conducted extensively, which leads to working on a research problem that has been well addressedby others.
Edit intent: coherence
Original:  We present 9 term functions as identified from the literatureand annotated 531 research papers in 3 areas to evaluate our approach.
Revised:  We present 9 term functions as identified from the literatureand annotated 531 research papers in three topics to evaluate our approach.
Edit intent: clarity
Original: In this paper, several Collaborative Filtering (CF) approaches with latent variable methods were studied using user-item interactions to capture important hidden variations of the sparse customer purchasing behaviors .
Revised: In this paper, several Collaborative Filtering (CF) approaches with latent variable methods were studied using user-item interactions to capture important hidden variations of the sparse customer purchasing behaviours .
Edit intent: fluency
Original: We propose a novel method---based on local moment matching---to approximate the value function of a Markov Decision Process .
Revised: We introduce a framework to approximate a Markov Decision Process .
Edit intent: clarity
Original:  Solving the PDE is not required by our method.
Revised:  Solving the PDE is not required by our method.
Edit intent: fluency
Original:  Instead  we construct a "sister"  Markov chain whose two local transition moments are (approximately ) identical with those of the focal chain.
Revised:  Instead , we construct a "sister" Markov chain whose two local transition moments are (approximately ) identical with those of the focal chain.
Edit intent: fluency
Original:  Instead  we construct a "sister"  Markov chain whose two local transition moments are (approximately ) identical with those of the focal chain.
Revised:  Instead we construct a "sister" Markov chain whose two local transition moments are approximately identical with those of the focal chain.
Edit intent: fluency
Original:  Because they share these moments\textit{ , the original chain and its "sister" are coupled through the PDE, a coupling that facilitates optimality guarantees.
Revised:  Because of this\textit{ , the original chain and its "sister" are coupled through the PDE, a coupling that facilitates optimality guarantees.
Edit intent: clarity
Original:  We show how this view can be embedded into the existing aggregation framework of ADP, providing a disciplined mechanism to tune the aggregation and disaggregation probabilities .
Revised:  Embedded into standard soft aggregation algorithms, moment matching provided a disciplined mechanism to tune the aggregation and disaggregation probabilities .
Edit intent: clarity
Original: Simulating online recommender system performance is notoriously difficult and the discrepancy between the online and offline behaviors is typically not accounted for in offline evaluations.
Edit intent: coherence
Original:  We first demonstrate how omitting temporal context when evaluating recommender system performance leads to false confidence.
Revised:  In this paper, we first demonstrate how omitting temporal context when evaluating recommender system performance leads to false confidence.
Edit intent: clarity
Original:  To overcome this, we propose an offline evaluation protocol modeling the real-life use-case that simultaneously accounts for temporal context.
Revised:  To overcome this, we postulate that offline evaluation protocols can only model real-life use-case that simultaneously accounts for temporal context.
Edit intent: clarity
Original:  To overcome this, we propose an offline evaluation protocol modeling the real-life use-case that simultaneously accounts for temporal context.
Revised:  To overcome this, we propose an offline evaluation protocol modeling the real-life use-cases if they account for temporal context.
Edit intent: clarity