wanyu/IteraTeR_v2 huggingface dataset:
Original:  To further increase the achievable efficiency, the article points up the more promising optimizations to be applied in future research.
Revised:  To further increase the achievable efficiency, the article points up the more promising optimizations that could be applied in future research.
Edit intent: clarity
Original:  Additionally, this article observes that high performance has been targeted by many implementations while flexibility was still less attempted .
Revised:  Additionally, this article observes that high performance has been targeted by many implementations , while flexibility has, as yet, been attempted less often .
Edit intent: clarity
Original:  Thus, the article provides some guidelines for RNNs hardware designers to support flexibility in a better manner.
Revised:  Thus, the article provides some guidelines for RNN hardware designers to support flexibility in a better manner.
Edit intent: fluency
Original: We develop a mathematical theory for the linear stability of stationary states  in large dynamical systems modelled by a set of randomly coupled differential equations on a locally tree-like network.
Revised: We present a linear stability analysis of stationary states in large dynamical systems modelled by a set of randomly coupled differential equations on a locally tree-like network.
Edit intent: clarity
Original:  In addition, we also characterize the unstable mode of the system of interest by deriving analytical expressions for the statistics of the components of the right and left eigenvectors associated with the leading eigenvalue.
Revised:  In addition, in the unstable regime we characterize the components of the right and left eigenvectors associated with the leading eigenvalue.
Edit intent: clarity
Original:  Finally, we briefly discuss how this approach can be extended to models with diagonal disorder and non-oriented couplings .
Revised:  Finally, we briefly discuss how this approach can be extended to graphs with diagonal disorder and non-oriented couplings .
Edit intent: clarity
Original:  The gain of plain RQMC declines as the dimension d increases, as predicted by the established theoretical error rate.
Revised:  The gain of plain RQMC deteriorates as the dimension d increases, as predicted by the established theoretical error rate.
Edit intent: clarity
Original: In this paper we present another proof for the well-known {\em small model property of two-variable logic.
Revised: We present another proof for the well-known {\em small model property of two-variable logic.
Edit intent: coherence
Original:  In contrast, ours is combinatorial in nature and uses only a very simple counting argument, which we find  intuitive and elegant .
Revised:  In contrast, ours is purely combinatorial and uses only a very simple counting argument, which we find intuitive and elegant .
Edit intent: clarity
Original:  In contrast, ours is combinatorial in nature and uses only a very simple counting argument, which we find  intuitive and elegant .
Revised:  In contrast, ours is combinatorial in nature and uses only a very simple counting argument, which we find rather intuitive and elegant .
Edit intent: coherence
Original:  Our 3D gadgets are downward compatible with the conventional pyramid-supported gadgets developed by Calros Natan as a generalization of the cube gadget, in the sense that in most cases we can replace the conventional gadgets with the new ones with the same outgoing pleats while the converse is not always possible.
Revised:  Our 3D gadgets are downward compatible with the conventional pyramid-supported gadgets developed by Calros Natan as a generalization of the cube gadget, in the sense that in many cases we can replace the conventional gadgets with the new ones with the same outgoing pleats while the converse is not always possible.
Edit intent: fluency
Original: Using molecular dynamics (MD) to simulate drug binding unbinding is a challenge .
Revised: Simulating drug binding and unbinding is a challenge .
Edit intent: clarity
Original:  Because it requires sampling rugged energy landscapes that separate bound and unbound states , it has a high cost and consumes significant computational resources.
Revised:  Because it requires sampling rugged energy landscapes that separate bound and unbound states require extensive sampling that consumes significant computational resources.
Edit intent: clarity
Original:  Here, we describe the use of interactive molecular dynamics in virtual reality (iMD-VR) as a low-cost strategy for generating reversible protein-ligand binding and unbinding pathways .
Revised:  Here, we describe the use of interactive molecular dynamics in virtual reality (iMD-VR) as an accurate low-cost strategy for generating reversible protein-ligand binding and unbinding pathways .
Edit intent: clarity
Original:  Here, we describe the use of interactive molecular dynamics in virtual reality (iMD-VR) as a low-cost strategy for generating reversible protein-ligand binding and unbinding pathways .
Revised:  Here, we describe the use of interactive molecular dynamics in virtual reality (iMD-VR) as a low-cost strategy for flexible protein-ligand binding and unbinding pathways .
Edit intent: clarity
Original:  Here, we describe the use of interactive molecular dynamics in virtual reality (iMD-VR) as a low-cost strategy for generating reversible protein-ligand binding and unbinding pathways .
Revised:  Here, we describe the use of interactive molecular dynamics in virtual reality (iMD-VR) as a low-cost strategy for generating reversible protein-ligand docking .
Edit intent: clarity
Original:  Detailed test carried out to evaluate the use of iMD-VR by novices showed that (following a brief training phase ) they were similarly able to generate unbinding and rebinding pathways which recovered binding poses on similar timescales as the experts .
Revised:  Following a brief training phase ) they were similarly able to generate unbinding and rebinding pathways which recovered binding poses on similar timescales as the experts .
Edit intent: coherence
Original: Query by Humming (QBH) is an system to provide a user with the song(s) which the user hums to the system.
Revised: Query by Humming (QBH) is a system to provide a user with the song(s) which the user hums to the system.
Edit intent: fluency
Original:  Hence G^ is Eulerian, and an Eulerian tour can be followed to print all edges in a continuous fashion without stops .
Revised:  Hence G^ is Eulerian, and a Eulerian tour can be followed to print all edges in a continuous fashion without stops .
Edit intent: fluency
Original:  Hence G^ is Eulerian, and an Eulerian tour can be followed to print all edges in a continuous fashion without stops .
Revised:  Hence G^ is Eulerian, and an Eulerian tour can be followed to print all edges in a continuous fashion .
Edit intent: clarity
Original:  First we compute its Euler transformation K^.
Revised:  We compute its Euler transformation K^.
Edit intent: coherence
Original:  In the slicing step, we clip K^ at each layer i using its polygon to obtain K^_i .
Revised:  In the slicing step, we clip K^ at each layer using its polygon to obtain K^_i .
Edit intent: fluency
Original:  We print extra support edges in place of any segments left out to ensure there are no edges without support in the next layer above .
Revised:  We print extra support edges in place of any segments left out to ensure there are no edges without support in the next layer .
Edit intent: clarity
Original: The chapter reviews recent developments in revealed preference theory.
Revised: This survey reviews recent developments in revealed preference theory.
Edit intent: clarity
Original: Synchronous reactive languages were introduced for designing and implementing real-time control software .
Revised: Synchronous modeling is at the heart of programming languages like Lustre, Esterel, or Scade used routinely for implementing safety critical control software, e.g., fly-by-wire and engine control in planes .
Edit intent: clarity
Original:  These domain-specific languages allow for writing a modular and mathematically precise specification of the system, enabling a user to simulate, test, verify, and , finally, compile the system into executable code.
Edit intent: coherence
Original:  However, to date these languages have had limited modern support for modeling uncertainty -- probabilistic aspects of the software's environment or behavior -- even though modeling uncertainty is a primary activity when designing a control system.
Revised:  However, to date these languages have had limited modern support for modeling uncertainty -- probabilistic aspects of software's environment or behavior -- even though modeling uncertainty is a primary activity when designing a control system.
Edit intent: fluency
Original:  In this paper we extend Z\'elus, a synchronous programming language, to deliver ProbZ\'elus, the first synchronous probabilistic programming language.
Revised:  In this paper we present ProbZelus the first synchronous probabilistic programming language.
Edit intent: clarity
Original:  ProbZ\'elus is a probabilistic programming language in that it provides facilities for probabilistic models and inference: inferring latent model parameters from data .
Revised:  ProbZelus conservatively provides the facilities of a synchronous language to write control software, with probabilistic constructs to model uncertainties and perform inference-in-the-loop .
Edit intent: clarity
Original:  We then demonstrate a semantics-preserving compilation strategy to a first-order functional core calculus that lends itself to a simple semantic presentation of ProbZ\'elus's inference algorithms .
Revised:  We then demonstrate a semantics-preserving compilation into a first-order functional core calculus that lends itself to a simple semantic presentation of ProbZ\'elus's inference algorithms .
Edit intent: clarity
Original:  We then demonstrate a semantics-preserving compilation strategy to a first-order functional core calculus that lends itself to a simple semantic presentation of ProbZ\'elus's inference algorithms .
Revised:  We then demonstrate a semantics-preserving compilation strategy to a first-order functional language that lends itself to a simple semantic presentation of ProbZ\'elus's inference algorithms .
Edit intent: clarity
Original:  We then demonstrate a semantics-preserving compilation strategy to a first-order functional core calculus that lends itself to a simple semantic presentation of ProbZ\'elus's inference algorithms .
Revised:  We then demonstrate a semantics-preserving compilation strategy to a first-order functional core calculus that lends itself to a simple presentation of inference algorithms for streaming models .
Edit intent: clarity
Original:  We also redesign the delayed sampling inference algorithm to provide bounded and streaming delayed sampling inferencefor ProbZ\'elus models .
Revised:  We also redesign the delayed sampling inference algorithm to provide efficient streaming inference .
Edit intent: clarity
Original:  Together with our evaluation on several reactive programs , our results demonstrate that ProbZ\'elus provides efficient, bounded memory probabilistic inference.
Revised:  Together with an evaluation on several reactive programs , our results demonstrate that ProbZ\'elus provides efficient, bounded memory probabilistic inference.
Edit intent: fluency
Original:  Together with our evaluation on several reactive programs , our results demonstrate that ProbZ\'elus provides efficient, bounded memory probabilistic inference.
Revised:  Together with our evaluation on several reactive applications , our results demonstrate that ProbZ\'elus provides efficient, bounded memory probabilistic inference.
Edit intent: clarity
Original:  Together with our evaluation on several reactive programs , our results demonstrate that ProbZ\'elus provides efficient, bounded memory probabilistic inference.
Revised:  Together with our evaluation on several reactive programs , our results demonstrate that ProbZ\'elus provides efficient, bounded memory inference.
Edit intent: clarity
Original: The rise in the availability of bacterial genomes defines a need for synthesis: abstracting from individual taxa, to see the larger patterns of bacterial lifestyles across microbial systems.
Revised: The rise in the availability of bacterial genomes defines a need for synthesis: abstracting from individual taxa, to see larger patterns of bacterial lifestyles across microbial systems.
Edit intent: fluency
Original:  A niche is a set of capabilities that enables a population's persistence , and defines its impact on the environment.
Revised:  A niche is a set of capabilities that enables a population's persistence and defines its impact on the environment.
Edit intent: fluency
Original:  The set of possible niches is the niche space, a conceptual space delineating the ways in which persistence in an ecosystem is possible.
Revised:  The set of possible niches forms the niche space, a conceptual space delineating the ways in which persistence in an ecosystem is possible.
Edit intent: clarity
Original:  The set of possible niches is the niche space, a conceptual space delineating the ways in which persistence in an ecosystem is possible.
Revised:  The set of possible niches is the niche space, a conceptual space delineating ways in which persistence in an ecosystem is possible.
Edit intent: fluency
Original:  The set of possible niches is the niche space, a conceptual space delineating the ways in which persistence in an ecosystem is possible.
Revised:  The set of possible niches is the niche space, a conceptual space delineating the ways in which persistence in a system is possible.
Edit intent: clarity
Original:  Understanding the structure of the niche space is perhaps the central question in ecology.
Edit intent: coherence
Original:  Here we use data analysis to map the space of metabolic networks describing thousands of bacterial genera.
Revised:  Here we use manifold learning to map the space of metabolic networks describing thousands of bacterial genera.
Edit intent: clarity
Original:  Here we use data analysis to map the space of metabolic networks describing thousands of bacterial genera.
Revised:  Here we use data analysis to map the space of metabolic networks representing thousands of bacterial genera.
Edit intent: fluency
Original:  Robust and efficient intelligent systems demand low-latency and high fidelity in resource constrained hardware platforms such as mobile devices, robots, and automobiles.
Revised:  Robust and efficient intelligent systems demand low-latency and high fidelity in resource-constrained hardware platforms such as mobile devices, robots, and automobiles.
Edit intent: fluency
Original:  Current tools do not address the exploratory and interactive nature of these analysesand in many cases consult the raw data to compute query results .
Revised:  To that end, they highly rely on spatial aggregation queries that extract summarized information from point data (e.g., Uber rides) contained in a given region (e.g., a city neighborhood). To support such queries, current analysis tools either allow only predefined aggregates on predefined regions and are thus unsuitable for exploratory analyses, or access the raw data to compute query results .
Edit intent: coherence
Original:  We introduce GeoBlocks, a  pre-aggregating , query-driven storage layout for geospatial point data that can provide approximate, yet precision-bounded aggregation results over arbitrary query polygons.
Revised:  We introduce GeoBlocks, a pre-aggregating data structure that supports spatial aggregation over arbitrary polygons.
Edit intent: clarity
Original:  GeoBlocks adapt to the skew naturally present in query workloads to improve query performance over time.
Revised:  GeoBlocks adapt to the skew naturally present in query workloads and improving performance over time.
Edit intent: coherence
Original:  In summary, GeoBlocks outperform on-the-fly aggregation by up to several orders of magnitude, providing the sub-second query latencies required for interactive  analytics.
Revised:  In summary, GeoBlocks outperform on-the-fly aggregation by up to several orders of magnitude, achieving the sub-second query latencies required for interactive analytics.
Edit intent: clarity
Original: Previously we found mechanical factors involving diffusion and fluid shear promote evolution of social behavior in microbial populations (Uppal and Vural 2018).
Edit intent: coherence
Original:  Here, we extend this model to study the evolution of specialization using realistic physical simulations of bacteria that secrete two public goods in a dynamic fluid.
Revised:  Here, we study the evolution of specialization using realistic physical simulations of bacteria that secrete two public goods in a dynamic fluid.
Edit intent: clarity
Original:  This is a well-studied property, in particular, it gives a sufficient condition for the convergence of the classical tatonnement dynamics.
Revised:  This is a well-studied property, in particular, it gives a sufficient condition for the convergence of the classical t\^atonnement dynamics.
Edit intent: fluency
Original:  As an application of our result , we obtain an efficient algorithm to find an approximate spending-restricted market equilibrium for WGS demands, a model that has been recently introduced as a continuous relaxation of the Nash Social Welfare problem .
Revised:  As an application of our technique , we obtain an efficient algorithm to find an approximate spending-restricted market equilibrium for WGS demands, a model that has been recently introduced as a continuous relaxation of the Nash Social Welfare problem .
Edit intent: clarity
Original:  We considered optimal control analysis of SIR and SEIR models for the deadly Ebola virus infection using vaccination, treatment and educational campaign as time-dependent controls functions.
Revised:  We considered optimal control analysis of SIR and SEIR models for the deadly Ebola infection using vaccination, treatment and educational campaign as time-dependent controls functions.
Edit intent: clarity
Original:  These methods in optimal control are based on Hamiltonian function and the Pontryagin  maximum principle to construct adjoint equations and optimality systems.
Revised:  These methods in optimal control are based on Hamiltonian function and the Pontryagin 's maximum principle to construct adjoint equations and optimality systems.
Edit intent: fluency
Original:  The forward-backward sweep numerical scheme with fourth-order Runge-Kutta method is used to solve the optimality system for the various optimal control strategies.
Revised:  The forward-backward sweep numerical scheme with fourth-order Runge-Kutta method is used to solve the optimality system for the various control strategies.
Edit intent: clarity
Original:  OBL is a relatively new machine learning concept  , which consists of simultaneously calculating an original solution and its opposite to accelerate the convergence of soft computing algorithms.
Revised:  OBL is a machine learning concept , which consists of simultaneously calculating an original solution and its opposite to accelerate the convergence of soft computing algorithms.
Edit intent: clarity
Original:  OBL is a relatively new machine learning concept  , which consists of simultaneously calculating an original solution and its opposite to accelerate the convergence of soft computing algorithms.
Revised:  OBL is a relatively new machine learning concept to accelerate the convergence of soft computing algorithms , which consists of simultaneously calculating an original solution and its opposite to accelerate the convergence of soft computing algorithms.
Edit intent: fluency
Original:  Recentlya new opposition-based differential evolution (ODE) variant called BetaCODE was proposed as a combination of differential evolution and a new stochastic OBL variant called BetaCOBL . BetaCOBL is capable of flexibly adjusting the probability density functions used to calculate opposite solutions, generating more diverse opposite solutions, and preventing the waste of fitness evaluations.
Revised:  Recentlya new opposition-based differential evolution (ODE) variant called BetaCODE was proposed as a combination of differential evolution and a new stochastic OBL variant called BetaCOBL was proposed, which is capable of flexibly adjusting the probability density functions used to calculate opposite solutions, generating more diverse opposite solutions, and preventing the waste of fitness evaluations.
Edit intent: coherence
Original:  Recentlya new opposition-based differential evolution (ODE) variant called BetaCODE was proposed as a combination of differential evolution and a new stochastic OBL variant called BetaCOBL . BetaCOBL is capable of flexibly adjusting the probability density functions used to calculate opposite solutions, generating more diverse opposite solutions, and preventing the waste of fitness evaluations.
Revised:  Recentlya new opposition-based differential evolution (ODE) variant called BetaCODE was proposed as a combination of differential evolution and a new stochastic OBL variant called BetaCOBL . BetaCOBL is capable of controlling the degree of opposite solutions, generating more diverse opposite solutions, and preventing the waste of fitness evaluations.
Edit intent: clarity
Original:  While it has shown outstanding performance compared to several state-of-the-art OBL variants, BetaCOBL is challenging with more complex problems because of its high computational cost .
Revised:  While it has shown outstanding performance compared to several state-of-the-art OBL variants, the high computational cost .
Edit intent: coherence
Original:  Besides , as it assumes that the decision variables  are independent, there is a limitation in the search for decent opposite solutions on inseparable problems.
Revised:  Besides , as it assumes that the decision variables of a given problem are independent, there is a limitation in the search for decent opposite solutions on inseparable problems.
Edit intent: clarity
Original:  In this paper, we propose an improved stochastic OBL variant that mitigates all the limitations of BetaCOBL .
Revised:  In this paper, we propose an improved BetaCOBL that mitigates all the limitations of BetaCOBL .
Edit intent: clarity
Original:  In this paper, we propose an improved stochastic OBL variant that mitigates all the limitations of BetaCOBL .
Revised:  In this paper, we propose an improved stochastic OBL variant that mitigates all the limitations .
Edit intent: clarity
Original:  The proposed algorithm called iBetaCOBL reduces the computational cost from O(NP^{2} \cdot D) to O(NP \cdot D) (NP and D stand for population size and  dimension, respectively) using a linear time diversity measure.
Revised:  The proposed algorithm called iBetaCOBL reduces the computational cost from O(NP^{2} \cdot D) to O(NP \cdot D) (NP and D stand for population size and a dimension, respectively) using a linear time diversity measure.
Edit intent: fluency
Original:  In addition, iBetaCOBL preserves the strongly dependent decision variables that are adjacent to each other using the multiple exponential crossover.
Revised:  Also, the proposed algorithm preserves strongly dependent variables that are adjacent to each other using the multiple exponential crossover.
Edit intent: clarity
Original:  In addition, iBetaCOBL preserves the strongly dependent decision variables that are adjacent to each other using the multiple exponential crossover.
Revised:  In addition, iBetaCOBL preserves the strongly dependent decision variables that are adjacent to each other using multiple exponential crossover.
Edit intent: fluency
Original: Among various optimization algorithms, ADAM can achieve outstanding performance and has been widely used in model learning.
Revised: For various optimization methods, gradient descent-based algorithms can achieve outstanding performance and has been widely used in model learning.
Edit intent: clarity