wanyu/IteraTeR_v2 huggingface dataset:
Original:  The first property allows  calculating cell-wise probability distributions over the state set of a stochastic cellular automaton, i.e. mages that show the average state of each cell during the  stochastic cellular automaton evolution .
Revised:  The first property allows calculating cell-wise probability distributions over the state set of a stochastic cellular automaton, i.e. images that show the average state of each cell during the stochastic cellular automaton evolution .
Edit intent: fluency
Original:  The first property allows  calculating cell-wise probability distributions over the state set of a stochastic cellular automaton, i.e. mages that show the average state of each cell during the  stochastic cellular automaton evolution .
Revised:  The first property allows calculating cell-wise probability distributions over the state set of a stochastic cellular automaton, i.e. mages that show the average state of each cell during the evolution of the stochastic cellular automaton evolution .
Edit intent: clarity
Original:  The first property allows  calculating cell-wise probability distributions over the state set of a stochastic cellular automaton, i.e. mages that show the average state of each cell during the  stochastic cellular automaton evolution .
Revised:  The first property allows calculating cell-wise probability distributions over the state set of a stochastic cellular automaton, i.e. mages that show the average state of each cell during the stochastic cellular automaton .
Edit intent: clarity
Original:  By means of this property, any stochastic cellular automaton can be decomposed into a set of deterministic systems , each of which contributes to the behavior of the stochastic system .
Revised:  Based on this property, any stochastic cellular automaton can be decomposed into a set of deterministic systems , each of which contributes to the behavior of the stochastic system .
Edit intent: clarity
Original:  By means of this property, any stochastic cellular automaton can be decomposed into a set of deterministic systems , each of which contributes to the behavior of the stochastic system .
Revised:  By means of this property, any stochastic cellular automaton can be decomposed into a set of deterministic cellular automata , each of which contributes to the behavior of the stochastic system .
Edit intent: clarity
Original:  By means of this property, any stochastic cellular automaton can be decomposed into a set of deterministic systems , each of which contributes to the behavior of the stochastic system .
Revised:  By means of this property, any stochastic cellular automaton can be decomposed into a set of deterministic systems , each of which contributes to the behavior of the stochastic cellular automaton .
Edit intent: fluency
Original: It has been shown recently (Shalygo, 2014) that stationary and dynamic patterns can arise in the proposed one-component model of the analog (continuous state) kinetic automaton, or a kinon for short, defined as a reflexive dynamical system with active transport.
Revised: It has been shown recently (Shalygo, 2014) that stationary and dynamic patterns can arise in the proposed one-component model of the analog (continuous state) kinetic automaton, or kinon for short, defined as a reflexive dynamical system with active transport.
Edit intent: fluency
Original:  This paper presents the extensions of the model, which increase further its complexity and tunability, and shows that the extended kinon model can produce spatio-temporal patterns pertaining not only to pattern formation but also to morphogenesis in real physical and biological systems.
Revised:  This paper presents extensions of the model, which increase further its complexity and tunability, and shows that the extended kinon model can produce spatio-temporal patterns pertaining not only to pattern formation but also to morphogenesis in real physical and biological systems.
Edit intent: fluency
Original:  It indicates the possible applicability of the model to morphogenetic engineering and robotics .
Revised:  The possible applicability of the model to morphogenetic engineering and robotics .
Edit intent: clarity
Original: Predicting the timing of future events is important for efficient planning.
Revised: Predicting future events, and their order, is important for efficient planning.
Edit intent: clarity
Original:  We propose a neural mechanism to non-destructively translate the current state of temporal memory into the future, so as to construct a timeline of future predictions.
Revised:  We propose a neural mechanism to non-destructively translate the current state of memory into the future, so as to construct a timeline of future predictions.
Edit intent: clarity
Original:  We propose a neural mechanism to non-destructively translate the current state of temporal memory into the future, so as to construct a timeline of future predictions.
Revised:  We propose a neural mechanism to non-destructively translate the current state of temporal memory into the future, so as to construct an ordered set of future predictions.
Edit intent: clarity
Original:   In a two-layer memory network that encodes the Laplace transform of the past, time-translation can be accomplished by modulating the connection weights between the layers.
Revised:  In a two-layer memory network that encodes the Laplace transform of the past, time-translation can be accomplished by modulating the weights between the layers.
Edit intent: clarity
Original:  A physical constraint requiring coherence in time-translation across memory nodes results in a Weber-Fechner spacing for the representation of both past (memory) and future (prediction) timelines.
Revised:  A physical constraint requiring coherence in time-translation across memory nodes , the proposition results in Weber-Fechner spacing for the representation of both past (memory) and future (prediction) timelines.
Edit intent: clarity
Original:  But there are also other variations to the game, involving for example move edges weighted by real numbers .
Revised:  But there are also other variations to the game, involving for example real number weights on the moves of the disks .
Edit intent: clarity
Original: Aedes aegypti is known as the responsible vector in transmitting dengue flavivirus.
Revised: Aedes aegypti is known as the responsible vector transmitting dengue flavivirus.
Edit intent: clarity
Original:  Unavailability of medication to cure the transmission in human blood becomes a global health issue in recent decades.
Revised:  Unavailability of medication to cure the transmission of the virus in the human blood becomes a global health issue in recent decades.
Edit intent: clarity
Original:  World epidemiologists are encouraged to focus on inves- tigation toward an effective and inexpensive way to prevent dengue transmission, i.e. mosquito control.
Revised:  World epidemiologists are encouraged to focus on the investigation over the effective and inexpensive way to prevent dengue transmission, i.e. mosquito control.
Edit intent: fluency
Original:  The basic mosquito offspring number is obtained and analysis of equilibria is shown.
Revised:  The basic mosquito offspring number was obtained and analysis of equilibria is shown.
Edit intent: fluency
Original:  The basic mosquito offspring number is obtained and analysis of equilibria is shown.
Revised:  The basic mosquito offspring number is obtained and analysis of equilibria was shown.
Edit intent: fluency
Original:  We bring along a discussion on  application of optimal control model which engineers two simultaneous schemes  .
Revised:  We brought along a discussion on application of optimal control model which engineers two simultaneous schemes .
Edit intent: fluency
Original:  We bring along a discussion on  application of optimal control model which engineers two simultaneous schemes  .
Revised:  We bring along a discussion on the application of optimal control model which engineers two simultaneous schemes .
Edit intent: fluency
Original:  We bring along a discussion on  application of optimal control model which engineers two simultaneous schemes  .
Revised:  We bring along a discussion on application of optimal control to the model in which two simultaneous schemes .
Edit intent: clarity
Original:  The first scheme is done by disseminating chemical like Temephos in spots where eggs and larvae develop, meanwhile the second scheme is done by conducting fumigation through areas where adult mosquitoes prevalently nest, indoor as well as outdoor.
Revised:  The first scheme is done by disseminating chemical like temephos in spots where eggs and larvae develop, meanwhile the second scheme is done by conducting fumigation through areas where adult mosquitoes prevalently nest, indoor as well as outdoor.
Edit intent: fluency
Original:  The first scheme is done by disseminating chemical like Temephos in spots where eggs and larvae develop, meanwhile the second scheme is done by conducting fumigation through areas where adult mosquitoes prevalently nest, indoor as well as outdoor.
Revised:  The first scheme is done by disseminating chemical like Temephos in spots where eggs and larvae develop, meanwhile the second scheme is done by deploying fumigation through areas where adult mosquitoes prevalently nest, indoor as well as outdoor.
Edit intent: clarity
Original:  A version of  gradient-based method is presented to set down a workflow in minimizing the objective functional with respect to control variable .
Revised:  A version of the gradient-based method is presented to set down a workflow in minimizing the objective functional with respect to control variable .
Edit intent: fluency
Original:  A version of  gradient-based method is presented to set down a workflow in minimizing the objective functional with respect to control variable .
Revised:  A version of gradient-based method was presented to set down a workflow in minimizing the objective functional with respect to control variable .
Edit intent: fluency
Original:  A version of  gradient-based method is presented to set down a workflow in minimizing the objective functional with respect to control variable .
Revised:  A version of gradient-based method is presented to set up a workflow in minimizing the objective functional with respect to control variable .
Edit intent: fluency
Original:  A version of  gradient-based method is presented to set down a workflow in minimizing the objective functional with respect to control variable .
Revised:  A version of gradient-based method is presented to set down a workflow in minimizing the objective functional with respect to some control variables .
Edit intent: clarity
Original:  Numerical results from  analysis of the basic mosquito offspring number with constant control and from optimal control suggest that one has to enhance the usage of fumigation rather than Temephos.
Revised:  Numerical results from the analysis of the basic mosquito offspring number with constant control and from optimal control suggest that one has to enhance the usage of fumigation rather than Temephos.
Edit intent: fluency
Original:  It is also suggested that applying both control schemes simultaneously gives the most significant reduction to the population.
Revised:  It is also suggested that applying both control schemes simultaneously gives the most significant reduction in the population.
Edit intent: clarity
Original: A complex-valued convolutional network (convnet) implements the repeated application of the following composition of three operations, recursively applying the composition to an input vector of nonnegative real numbers: (1) convolution with several complex-valued vectors followed by (2) taking the absolute value of every entry of the resulting vectors followed by (3) local averaging.
Revised: A complex-valued convolutional network (convnet) implements the repeated application of the following composition of three operations, recursively applying the composition to an input vector of nonnegative real numbers: (1) convolution with complex-valued vectors followed by (2) taking the absolute value of every entry of the resulting vectors followed by (3) local averaging.
Edit intent: clarity
Original:  An improved form of the implicit return-mapping scheme for nonsmooth plastic potentials is proposed that systematically builds on a subdifferential formulation of the flow rule.
Revised:  An improved form of the implicit return-mapping scheme for nonsmooth yield surfaces is proposed that systematically builds on a subdifferential formulation of the flow rule.
Edit intent: clarity
Original:  Command logging on the other hand increases the cost of recovery, because all the transactions in the log after the last checkpoint must be completely redone when there is a failure.
Revised:  Command logging on the other hand increases the cost of recovery, because all the transactions in the log after the last checkpoint must be completely redone in case of a failure.
Edit intent: clarity
Original:  For distributed database systems with many processing nodes, failures cannot be assumed as exceptions, and as such, the long recovery time incurred by command logging may compromise the objective of providing efficient support for OLTP.
Edit intent: coherence
Original:  In this paper, we first extend the command logging  to a distributed system , where all the nodes can perform their recovery in parallel.
Revised:  In this paper, we first extend the command logging technique to a distributed system , where all the nodes can perform their recovery in parallel.
Edit intent: clarity
Original:  In this paper, we first extend the command logging  to a distributed system , where all the nodes can perform their recovery in parallel.
Revised:  In this paper, we first extend the command logging to a distributed environment , where all the nodes can perform their recovery in parallel.
Edit intent: clarity
Original:  In this paper, we first extend the command logging  to a distributed system , where all the nodes can perform their recovery in parallel.
Revised:  In this paper, we first extend the command logging to a distributed system , where all the nodes can perform recovery in parallel.
Edit intent: clarity
Original:  Showing that the synchronisation cost caused by dependency is the bottleneck for command logging in a distributed system, We consequently propose an adaptive logging approach by combining data logging and command logging.
Revised:  We then propose an adaptive logging approach by combining data logging and command logging.
Edit intent: coherence
Original:  Our experimental study compares the performance of our proposed adaptive logging, ARIES style data logging and command logging on top of H-Store.
Revised:  Our experimental study compares the performance of our proposed adaptive logging, ARIES-style data logging and command logging on top of H-Store.
Edit intent: fluency
Original: For every simple, undirected graph G = (V, E), a one-to-one relation exists between the decompositions and the multicuts of G. A decomposition of G is a partition \Pi of V such that, for every U \in \Pi, the subgraph (U, E \cap U%DIFDELCMD < \choose %%% 2 ) of G is connected.
Revised: For every simple, undirected graph G = (V, E), a one-to-one relation exists between the decompositions and the multicuts of G. A decomposition of G is a partition \Pi of V such that, for every U \in \Pi, the subgraph (U, E \cap %DIFDELCMD < \choose %%% 2 ) of G is connected.
Edit intent: clarity
Original:  A multicut of G is a subset of edges, M \subseteq E , such that, for every (chordless) cycle C \subseteq E of G, |M \cap C| \neq 1.
Revised:  A multicut of G is an M \subseteq E , such that, for every (chordless) cycle C \subseteq E of G, |M \cap C| \neq 1.
Edit intent: clarity
Original:  A multicut of G is a subset of edges, M \subseteq E , such that, for every (chordless) cycle C \subseteq E of G, |M \cap C| \neq 1.
Revised:  A multicut of G is a subset of edges, M \subseteq E such that, for every (chordless) cycle C \subseteq E of G, |M \cap C| \neq 1.
Edit intent: fluency
Original:  The  characteristic function x \in \{0, 1\}^E of a multicut M = x^{-1}(1) of G makes explicit, for every  \{v,w\} \in E  , whether v and w are in distinct components.
Revised:  The characteristic function x \in \{0, 1\}^E of a multicut M = x^{-1}(1) of G makes explicit, for every pair \{v,w\} \in E , whether v and w are in distinct components.
Edit intent: clarity
Original:  We show that, if G is connected, the convex hull , in \mathbb{R of the characteristic functions of those multicuts of G' that are lifted from G is a full, |E'|-dimensional 01-polytope  .
Revised:  We show that, if G is connected, the convex hull , in \mathbb{R of the characteristic functions of those multicuts of G' that are lifted from G is an |E'|-dimensional 01-polytope .
Edit intent: clarity
Original:  We show that, if G is connected, the convex hull of the characteristic functions of those multicuts of G' that are lifted from G is an |E'|-dimensional 01-polytope in R^{E'}  .
Revised:  We show that, if G is connected, the convex hull of the characteristic functions of those multicuts of G' that are lifted from G is an |E'|-dimensional polytope in R^{E'} .
Edit intent: clarity
Original:  A multicut of G is an M \subseteq E  such that, for every (chordless) cycle C \subseteq E of G, |M \cap C| \neq 1.
Revised:  A multicut of G is a subset M \subseteq E such that, for every (chordless) cycle C \subseteq E of G, |M \cap C| \neq 1.
Edit intent: fluency
Original:  The multicut related to a decomposition is the set of edges that straddle distinct components.
Revised:  The multicut induced by a decomposition is the set of edges that straddle distinct components.
Edit intent: clarity
Original:  We establish  properties of trivial facets of this polytope.
Revised:  We establish some properties of trivial facets of this polytope.
Edit intent: clarity
Original:  We establish some properties of trivial facets of this polytope.
Revised:  We establish some properties of some facets of this polytope.
Edit intent: clarity
Original:  In order to make explicit also for non-neighboring nodes, specifically, for all \{v,w\} \in E' with E \subseteq E' \subseteq }%DIFDELCMD < {%%% V%DIFDELCMD < \choose %%% 2 , whether v and w are in distinct components, we define a lifting of the multicuts of G to multicuts of G' = (V, E').
Revised:  In order to make explicit also for non-neighboring nodes, specifically, for all \{v,w\} \in E' with E \subseteq E' \subseteq }%DIFDELCMD < {%%% %DIFDELCMD < \choose %%% 2 , whether v and w are in distinct components, we define a lifting of the multicuts of G to multicuts of G' = (V, E').
Edit intent: fluency
Original: Evolution , in its course , has found many different solutions to the same problem.
Revised: Evolution in its course , has found many different solutions to the same problem.
Edit intent: fluency
Original: Evolution , in its course , has found many different solutions to the same problem.
Revised: Evolution , in its course found a variety of solutions to the same problem.
Edit intent: clarity
Original:  Computation of normal forms, the membership problem, the conjugacy problem, and computation of presentations for subgroups are solved using only logarithmic space and , simultaneously, in quasilinear time.
Revised:  Computation of normal forms, the membership problem, the conjugacy problem, and computation of presentations for subgroups are solved using only logarithmic space and quasilinear time.
Edit intent: coherence
Original:  Compressed-word versions of these  problems, in which each input word is provided as a straight-line program, are solved in polynomial time.
Revised:  Compressed-word versions of these algorithms are provided. Compressed-word versions of the same problems, in which each input word is provided as a straight-line program, are solved in polynomial time.
Edit intent: clarity
Original:  Our model predicts that \sim90\\% of mRNAs are segregated to the poles , and reveals a "circulation" of ribosomes driven by the non-equilibrium mRNA flux , from synthesis in the nucleoid to degradation at the poles.
Revised:  Our model predicts that \sim90\\% of mRNAs are segregated to the poles and reveals a "circulation" of ribosomes driven by the non-equilibrium mRNA flux , from synthesis in the nucleoid to degradation at the poles.
Edit intent: fluency
Original:  Our model predicts that \sim90\\% of mRNAs are segregated to the poles , and reveals a "circulation" of ribosomes driven by the non-equilibrium mRNA flux , from synthesis in the nucleoid to degradation at the poles.
Revised:  Our model predicts that \sim90\\% of mRNAs are segregated to the poles , and reveals a "circulation" of ribosomes driven by the flux of mRNAs , from synthesis in the nucleoid to degradation at the poles.
Edit intent: clarity
Original:  Here we present a novel method using high speed video to evaluate teeth-mounted (mouthguard), soft tissue-mounted (skin patch), and headgear-mounted (skull cap) sensors during 5-10g sagittal soccer head impacts.
Revised:  Here we present an in vivo method using high speed video to evaluate teeth-mounted (mouthguard), soft tissue-mounted (skin patch), and headgear-mounted (skull cap) sensors during 5-10g sagittal soccer head impacts.
Edit intent: clarity
Original:  Skull coupling is quantified by displacement from an ear-canal reference.
Revised:  Sensor coupling to the skull is quantified by displacement from an ear-canal reference.
Edit intent: clarity
Original:  With close skull-coupling, we used the mouthguard  as the reference to assess 6-degree-of-freedom skin patch and skull cap measurements.
Revised:  We used the mouthguard as the reference to assess 6-degree-of-freedom skin patch and skull cap measurements.
Edit intent: clarity
Original:  In-plane acceleration peaks from the skin patch in the anterior-posterior direction correlated well with the mouthguard (m=1.4, r^2=0.93), and could be modeled by an underdamped viscoelastic system.
Revised:  In-plane acceleration peaks from the skin patch in the anterior-posterior direction could be modeled by an underdamped viscoelastic system.
Edit intent: clarity
Original:  In summary, the mouthguard showed tight skull coupling in vivo while the other sensors dislocated .
Revised:  In summary, the mouthguard showed tighter skull coupling in vivo while the other sensors dislocated .
Edit intent: fluency
Original:  In summary, the mouthguard showed tight skull coupling in vivo while the other sensors dislocated .
Revised:  In summary, the mouthguard showed tight skull coupling in vivo than the other sensors dislocated .
Edit intent: clarity
Original:  In summary, the mouthguard showed tight skull coupling in vivo while the other sensors dislocated .
Revised:  In summary, the mouthguard showed tight skull coupling in vivo while the other sensors .
Edit intent: clarity
Original:  Here we present a systematic method to correct this bias and obtain an accurate estimation of the risk in the context of epidemic models informed by high-resolution time-resolved contact data.
Revised:  Here we present a systematic method to alleviate this issue and obtain a better estimation of the risk in the context of epidemic models informed by high-resolution time-resolved contact data.
Edit intent: clarity
Original:  We show that the statistical information contained in the resampled data allows us to build surrogate versions of the unknown contacts and that simulations of epidemic processes using these surrogate data sets yield good estimates of the outcome of simulations performed using the complete data set.
Revised:  We show how the statistical information contained in the resampled data allows us to build surrogate versions of the unknown contacts and that simulations of epidemic processes using these surrogate data sets yield good estimates of the outcome of simulations performed using the complete data set.
Edit intent: clarity