wanyu/IteraTeR_v2 huggingface dataset:
Original:  We also \eps show that our data structure could give an alternative treatment of the approximate subtrajectory range counting (\textsc{ASRC ) problem studied by de Berg et al.
Revised:  We also \eps show that our data structure could give an alternative treatment of the approximate subtrajectory range \textsc{ASRC ) problem studied by de Berg et al.
Edit intent: clarity
Original:  We also \eps show that our data structure could give an alternative treatment of the approximate subtrajectory range counting (\textsc{ASRC ) problem studied by de Berg et al.
Revised:  We also \eps show that our data structure could give an alternative treatment of the approximate subtrajectory range counting (\textsc{ ) problem studied by de Berg et al.
Edit intent: clarity
Original:  We also \eps show that our data structure could give an alternative treatment of the approximate subtrajectory range counting (\textsc{ASRC ) problem studied by de Berg et al.
Revised:  We also \eps show that our data structure could give an alternative treatment of the approximate subtrajectory range counting (\textsc{ASRC searching problem studied by de Berg et al.
Edit intent: fluency
Original:  This paper takes a combinatorial-topological approach to abstract the blockchains and their transactions into simplicial complexes and shows that CBTs cannot complete in either a committed or an aborted status by a t-resilient message-passing protocol alone .
Revised:  This paper takes a combinatorial-topological approach to abstract the blockchains and their transactions into simplicial complexes and shows that CBTs cannot complete in either a committed or an aborted status by a t-resilient message-passing protocol .
Edit intent: clarity
Original:  Thus, linear logics and graphical calculi for *-autonomous categories can also be applied to closed symmetric monoidal categories.
Revised:  Thus, linear logics and graphical calculi for \ast-autonomous categories can also be applied to closed symmetric monoidal categories.
Edit intent: fluency
Original:  It also applies to other fragments of *-autonomous structure, such as linear distributivity , and can be combined with a form of double gluing to prove full completeness results .
Revised:  It also applies to other fragments of \ast-autonomous structure, such as linear distributivity , and can be combined with a form of double gluing to prove full completeness results .
Edit intent: fluency
Original:  It also applies to other fragments of *-autonomous structure, such as linear distributivity , and can be combined with a form of double gluing to prove full completeness results .
Revised:  It also applies to other fragments of *-autonomous structure, such as linear distributivity . It can also be enhanced to preserve any desired family of nonempty limits and colimits .
Edit intent: coherence
Original: This paper is concerned with examining the relationship between users' page view (PV) history and their item-choice behavior on an e-commerce website.
Revised: This paper examines the relationship between users' page view (PV) history and their item-choice behavior on an e-commerce website.
Edit intent: clarity
Original: This paper is concerned with examining the relationship between users' page view (PV) history and their item-choice behavior on an e-commerce website.
Revised: This paper is concerned with examining the relationship between user pageview (PV) history and their item-choice behavior on an e-commerce website.
Edit intent: fluency
Original: This paper is concerned with examining the relationship between users' page view (PV) history and their item-choice behavior on an e-commerce website.
Revised: This paper is concerned with examining the relationship between users' page view (PV) histories and their item-choice behavior on an e-commerce website.
Edit intent: fluency
Original:  We focus particularly on the PV sequence, which represents a time series of the number of PVs for each user--item pair.
Revised:  We focus on PV sequences, which represent time series of the number of PVs for each user--item pair.
Edit intent: clarity
Original:  We propose a shape-restricted optimization model to accurately estimate item-choice probabilities for all possible PV sequences.
Revised:  We propose a shape-restricted optimization model that accurately estimates item-choice probabilities for all possible PV sequences.
Edit intent: fluency
Original:  In this model , we impose monotonicity constraints on item-choice probabilities by exploiting partial orders specialized for the PV sequencesbased on the recency and frequency of each user's previous PVs.
Revised:  This model imposes monotonicity constraints on item-choice probabilities by exploiting partial orders specialized for the PV sequencesbased on the recency and frequency of each user's previous PVs.
Edit intent: fluency
Original:  In this model , we impose monotonicity constraints on item-choice probabilities by exploiting partial orders specialized for the PV sequencesbased on the recency and frequency of each user's previous PVs.
Revised:  In this model , we impose monotonicity constraints on item-choice probabilities by exploiting partial orders for PV sequences, according to the recency and frequency of each user's previous PVs.
Edit intent: clarity
Original:  In this model , we impose monotonicity constraints on item-choice probabilities by exploiting partial orders specialized for the PV sequencesbased on the recency and frequency of each user's previous PVs.
Revised:  In this model , we impose monotonicity constraints on item-choice probabilities by exploiting partial orders specialized for the PV sequencesbased on the recency and frequency of a user's previous PVs.
Edit intent: clarity
Original:  Experimental results using real-world clickstream data demonstrate that  higher prediction performance is achieved with our method than with the state-of-the-art optimization model and common machine learning methods.
Revised:  Experimental results using real-world clickstream data demonstrate that higher prediction performance than that of a state-of-the-art optimization model and common machine learning methods.
Edit intent: clarity
Original: We model the spread of an epidemic through physically proximate human contacts using an Erdos-Renyi random graph representing a city, and simulate outcomes for two kinds of agents , poor and non-poor.
Revised: We model the spread of an epidemic through physically proximate human contacts using an Erdos-Renyi random graph representing a city, and simulate outcomes for two kinds of agents - poor and non-poor.
Edit intent: fluency
Original:  When we introduce different forms of social distancing interventions , peak caseloads are reduced, but infection rates of the poor are systematically higher  than for non-poor  across all scenarios.
Revised:  When we introduce different forms of social distancing interventions , peak caseloads are reduced, but infection rates of the poor are systematically higher for the poor than for non-poor across all scenarios.
Edit intent: fluency
Original:  When we introduce different forms of social distancing interventions , peak caseloads are reduced, but infection rates of the poor are systematically higher  than for non-poor  across all scenarios.
Revised:  When we introduce different forms of social distancing interventions , peak caseloads are reduced, but infection rates of the poor are systematically higher than for non-poor , across all scenarios.
Edit intent: fluency
Original:  Larger populations, higher fractions of poor, and greater intensity of interventions are found to progressively worsen outcomes for the poor , vis-a-vis the non-poor.
Revised:  Larger populations, higher fractions of poor, and longer durations of intervention are found to progressively worsen outcomes for the poor , vis-a-vis the non-poor.
Edit intent: clarity
Original:  and these are of particular concern for poor populations in cities of the developing world.
Revised:  and these are of particular concern for economically vulnerable populations in cities of the developing world.
Edit intent: clarity
Original: We extend the doubly degenerate Cahn-Hilliard (DDCH) models for isotropic surface diffusion arXiv:1909.04458 , which yield more accurate approximations than classical degenerate Cahn-Hilliard (DCH) models, to the anisotropic case.
Revised: We extend the doubly degenerate Cahn-Hilliard (DDCH) models for isotropic surface diffusion , which yield more accurate approximations than classical degenerate Cahn-Hilliard (DCH) models, to the anisotropic case.
Edit intent: coherence
Original:  We apply these developments to seismic wave propagation scenarios on Mars as a sample application.
Revised:  We apply these developments to seismic wave propagation scenarios on Mars as an example application.
Edit intent: clarity
Original:  Moreover, we demonstrate that scalability of I/O and topological interpolation goes beyond 12'000 cores, and memory imposed limits on maximum mesh size vanish.
Revised:  Moreover, we demonstrate that scalability of I/O and topological interpolation goes beyond 12'000 cores, and memory-imposed limits on mesh size vanish.
Edit intent: clarity
Original:  As a byproduct, the associations between certain finger-tapping attributes (  Number of taps and SD of inter-tapping interval ) and MMSE score are discovered with copula entropy, which may be interpreted as the biological relationship between cognitive ability and motor ability and therefore makes the predictive models explainable.
Revised:  As a byproduct, the associations between certain finger-tapping attributes ( ' Number of taps and SD of inter-tapping interval ) and MMSE score are discovered with copula entropy, which may be interpreted as the biological relationship between cognitive ability and motor ability and therefore makes the predictive models explainable.
Edit intent: fluency
Original:  Here we show the problem of bounding the oriented (2-edge-coloured) chromatic number of the family of planar graphs can be restricted to boundng this parameter for the family of planar complete-convex oriented (2-edge-coloured) graphs.
Revised:  Here we show the problem of bounding the oriented (2-edge-coloured) chromatic number of the family of planar graphs can be restricted to bounding this parameter for the family of planar complete-convex oriented (2-edge-coloured) graphs.
Edit intent: fluency
Original:  This problem remains NP-complete when restricted to graphs with tree-width 4.
Revised:  This problem remains NP-complete when restricted to inputs with tree-width 4.
Edit intent: clarity
Original:  We fully classify complete-convex oriented and 2-edge-coloured graphs with tree-width 2.
Revised:  We fully classify those oriented graphs with tree-width 2.
Edit intent: clarity
Original: Recent advances in the Internet of Things (IoT) technology have led to a surge on the deployment of sensors everywhere .
Revised: Recent advances in the Internet of Things (IoT) technology have led to a surge on the popularity of sensing applications .
Edit intent: clarity
Original:  As a result,  information obtained from sensors has become an important source for decision making in our daily life.
Revised:  As a result, information obtained from sensors to make decisions in their daily life.
Edit intent: clarity
Original:  Unfortunately, in most sensing applications, sensors are known to be error-prone due to various reasons and the measurements from sensors can also become unreliable at any unexpected time.
Revised:  Unfortunately, in most sensing applications, sensors are known to be error-prone and their measurements can become misleading at any unexpected time.
Edit intent: clarity
Original:  Therefore,  apart from the states of physical processes under measurement , we believe it is  highly important to monitor the reliability of sensors as well .
Revised:  Therefore, apart from the physical phenomena/processes of interest , we believe it is highly important to monitor the reliability of sensors as well .
Edit intent: clarity
Original:  Therefore,  apart from the states of physical processes under measurement , we believe it is  highly important to monitor the reliability of sensors as well .
Revised:  Therefore, apart from the states of physical processes under measurement , we believe it is also highly important to monitor the reliability of sensors as well .
Edit intent: coherence
Original:  In this work, we propose RelSen : an optimization-based framework for simultaneous sensor reliability monitoring and process state estimation.
Revised:  In this work, we propose RelSen , a novel optimization-based framework for simultaneous sensor reliability monitoring and process state estimation.
Edit intent: clarity
Original:  Furthermore , we apply RelSen for sensor reliability monitoring and process state estimation in an outdoor air pollution monitoring system and the condition monitoring system for a cement rotary kiln.
Revised:  Furthermore , we apply RelSen on an outdoor air pollution monitoring system and the condition monitoring system for a cement rotary kiln.
Edit intent: coherence
Original:  Furthermore , we apply RelSen for sensor reliability monitoring and process state estimation in an outdoor air pollution monitoring system and the condition monitoring system for a cement rotary kiln.
Revised:  Furthermore , we apply RelSen for sensor reliability monitoring and process state estimation in an outdoor air pollution monitoring system and a condition monitoring system for a cement rotary kiln.
Edit intent: fluency
Original:  Experimental results show that our framework can timely identify unreliable sensors and achieve higher accuracy than several baseline methods in process state estimation under three types of  commonly observed sensor faults.
Revised:  Experimental results show that our framework can timely identify unreliable sensors and remove sensor measurement errors caused by three types of commonly observed sensor faults.
Edit intent: clarity
Original:  Experimental results show that our framework can timely identify unreliable sensors and achieve higher accuracy than several baseline methods in process state estimation under three types of  commonly observed sensor faults.
Revised:  Experimental results show that our framework can timely identify unreliable sensors and achieve higher accuracy than several baseline methods in process state estimation under three types of most commonly observed sensor faults.
Edit intent: clarity
Original:  The key idea is to mutate operators of same type in SMT formulas to generate type-correct mutant formulas.
Revised:  The key idea is to mutate operators of conforming types within the seed formulas to generate type-correct mutant formulas.
Edit intent: clarity
Original:  The key idea is to mutate operators of same type in SMT formulas to generate type-correct mutant formulas.
Revised:  The key idea is to mutate operators of same type in SMT formulas to generate well-typed mutant formulas.
Edit intent: clarity
Original:  We realized the type-aware mutations within a tool calledOpFuzz and stress-tested two state-of-the-art SMT solvers Z3 and CVC4 . Type-aware  mutations are unusually effective: In six months of extensive testing with OpFuzz , we reported 743 bugs in Z3 and CVC4, out of which 521 bugs were confirmed and 457 of the confirmed bugs were fixed by the developers.
Revised:  We realized the type-aware OpFuzz and stress-tested two state-of-the-art SMT solvers Z3 and CVC4 . Type-aware mutations are unusually effective: In six months of extensive testing with OpFuzz , we reported 743 bugs in Z3 and CVC4, out of which 521 bugs were confirmed and 457 of the confirmed bugs were fixed by the developers.
Edit intent: clarity
Original:  We realized the type-aware mutations within a tool calledOpFuzz and stress-tested two state-of-the-art SMT solvers Z3 and CVC4 . Type-aware  mutations are unusually effective: In six months of extensive testing with OpFuzz , we reported 743 bugs in Z3 and CVC4, out of which 521 bugs were confirmed and 457 of the confirmed bugs were fixed by the developers.
Revised:  We realized the type-aware mutations within a tool called and stress-tested two state-of-the-art SMT solvers Z3 and CVC4 . Type-aware mutations are unusually effective: In six months of extensive testing with OpFuzz , we reported 743 bugs in Z3 and CVC4, out of which 521 bugs were confirmed and 457 of the confirmed bugs were fixed by the developers.
Edit intent: fluency
Original:  We realized the type-aware mutations within a tool calledOpFuzz and stress-tested two state-of-the-art SMT solvers Z3 and CVC4 . Type-aware  mutations are unusually effective: In six months of extensive testing with OpFuzz , we reported 743 bugs in Z3 and CVC4, out of which 521 bugs were confirmed and 457 of the confirmed bugs were fixed by the developers.
Revised:  We realized the type-aware mutations within a tool calledOpFuzz and stress-tested two state-of-the-art SMT solvers . Type-aware mutations are unusually effective: In six months of extensive testing with OpFuzz , we reported 743 bugs in Z3 and CVC4, out of which 521 bugs were confirmed and 457 of the confirmed bugs were fixed by the developers.
Edit intent: fluency
Original:  We realized the type-aware mutations within a tool calledOpFuzz and stress-tested two state-of-the-art SMT solvers Z3 and CVC4 . Type-aware  mutations are unusually effective: In six months of extensive testing with OpFuzz , we reported 743 bugs in Z3 and CVC4, out of which 521 bugs were confirmed and 457 of the confirmed bugs were fixed by the developers.
Revised:  We realized the type-aware mutations within a tool calledOpFuzz and stress-tested two state-of-the-art SMT solvers Z3 and CVC4 . Type-aware mutations are unusually effective: In six months of extensive testing with OpFuzz , we reported 743 bugs in Z3 and CVC4, out of which 521 bugs were confirmed and 457 of the confirmed bugs were fixed by the developers.
Edit intent: fluency
Original:  Our bug findings are highly diverse : We found bugs of many different types (soundness bugs, invalid model bugs, crashes, etc  ), logics and solver configurations.
Revised:  The detected bugs are highly diverse : We found bugs of many different types (soundness bugs, invalid model bugs, crashes, etc ), logics and solver configurations.
Edit intent: clarity
Original:  Our bug findings are highly diverse : We found bugs of many different types (soundness bugs, invalid model bugs, crashes, etc  ), logics and solver configurations.
Revised:  Our bug findings are highly diverse -- we found bugs of many different types (soundness bugs, invalid model bugs, crashes, etc ), logics and solver configurations.
Edit intent: fluency
Original:  Our bug findings are highly diverse : We found bugs of many different types (soundness bugs, invalid model bugs, crashes, etc  ), logics and solver configurations.
Revised:  Our bug findings are highly diverse : We found bugs of many different types (soundness bugs, invalid model bugs, crashes, etc . ), logics and solver configurations.
Edit intent: fluency
Original:  Type-aware operator mutations are unusually effective: During nine months of extensive testing with OpFuzz, we reported 909 bugs in Z3  and CVC4  , out of which 632 bugs were confirmed and 531 of the confirmed bugs were fixed by the developers.
Revised:  Type-aware operator mutations are unusually effective: During nine months of extensive testing with OpFuzz, we reported 909 bugs in Z3 's and CVC4 , out of which 632 bugs were confirmed and 531 of the confirmed bugs were fixed by the developers.
Edit intent: fluency
Original:  We have further conducted an in-depth study on the bugs found by OpFuzz.
Revised:  We have further conducted an in-depth study of the bugs found by OpFuzz.
Edit intent: fluency
Original: We construct a zig-zag process targeting posterior distributions arising in genetics from the Kingman coalescent and several popular models of mutation.
Revised: We construct zig-zag process targeting posterior distributions arising in genetics from the Kingman coalescent and several popular models of mutation.
Edit intent: fluency
Original: We construct a zig-zag process targeting posterior distributions arising in genetics from the Kingman coalescent and several popular models of mutation.
Revised: We construct a zig-zag processes targeting posterior distributions arising in genetics from the Kingman coalescent and several popular models of mutation.
Edit intent: fluency
Original: We construct a zig-zag process targeting posterior distributions arising in genetics from the Kingman coalescent and several popular models of mutation.
Revised: We construct a zig-zag process targeting posterior distributions arising in genetics from the Kingman coalescent and two popular models of mutation.
Edit intent: clarity
Original:  Our construction is based on embedding discrete variables into  continuous space;
Revised:  Our construction is based on embedding discrete variables into a continuous space;
Edit intent: fluency
Original:  a technique previously exploited in the construction of Hamiltonian Monte Carlo algorithms , where it can lead to implementationally and analytically complex boundary crossings.
Revised:  a technique previously exploited in the construction of Hamiltonian Monte Carlo algorithms which suffer from implementationally and analytically complex boundary crossings.
Edit intent: clarity
Original:  We demonstrate that the continuous-time zig-zag process can largely avoid these complications.
Revised:  We demonstrate that the continuous-time zig-zag process avoids similar complications.
Edit intent: clarity
Original: We construct  zig-zag processes targeting posterior distributions arising in genetics from the Kingman coalescent and two popular models of mutation.
Revised: We construct a zig-zag processes targeting posterior distributions arising in genetics from the Kingman coalescent and two popular models of mutation.
Edit intent: fluency
Original:  We demonstrate that the continuous-time zig-zag process avoids similar complications.
Revised:  We demonstrate that the continuous-time zig-zag process avoids these complications.
Edit intent: clarity
Original:  Exponentially growing dynamics are intrinsically unpredictable.
Revised:  Epidemic spread is characterized by exponentially growing dynamics, which are intrinsically unpredictable.
Edit intent: clarity
Original:  A Bayesian fit to the on-going COVID-19 pandemic in Spain shows that we can infer neither its peaking time nor whether there is a peak at all.
Revised:  A Bayesian fit to the COVID-19 pandemic in Spain shows that we can infer neither its peaking time nor whether there is a peak at all.
Edit intent: clarity
Original:  We demonstrated DeepPurpose using case studies, including  repurposing for COVID-19 where promising candidates under trials are ranked high in our results .
Revised:  We demonstrated DeepPurpose using case studies, including repurposing for COVID-19 where promising candidates under trials are ranked high in DeepPurpose predictions .
Edit intent: clarity
Original:  Despite their superior performance, these research models are difficult to use in real drug discovery practice due to the complexity of deploying the research code as well as the restricted data formatting, model capacity, and evaluation setting .
Revised:  Despite their superior performance, these research models are difficult to use for both computer scientists entering the biomedical field and bioinformaticians with limited DL experience .
Edit intent: clarity
Original:  Further, computer scientists can use DeepPurpose to train customized DTI prediction models with 15 drug and target encodings and 50 + novel DL architectures.
Revised:  Further, computer scientists can use DeepPurpose to train customized DTI prediction models by implementing 15 drug and target encodings and 50 + novel DL architectures.
Edit intent: clarity
Original:  Further, computer scientists can use DeepPurpose to train customized DTI prediction models with 15 drug and target encodings and 50 + novel DL architectures.
Revised:  Further, computer scientists can use DeepPurpose to train customized DTI prediction models with 15 compound and protein encoders and over 50 + novel DL architectures.
Edit intent: clarity