wanyu/IteraTeR_v2 huggingface dataset:
Original:  We show how Domino enables several data-plane algorithms written in C syntax to run at hardware line rates .
Revised:  We show with many examples that Domino provides a convenient and natural way to express sophisticated data-plane algorithms written in C syntax to run at hardware line rates .
Edit intent: clarity
Original:  We first introduce the complexity classes for these machines , make a connection with dynamical systems theory , and propose a practical scheme to solve the above  problems based on the novel concept of self-organizable logic gates and circuits  .
Revised:  We first introduce the complexity classes for these machines . We then make a connection with dynamical systems theory , and propose a practical scheme to solve the above problems based on the novel concept of self-organizable logic gates and circuits .
Edit intent: coherence
Original:  We first introduce the complexity classes for these machines , make a connection with dynamical systems theory , and propose a practical scheme to solve the above  problems based on the novel concept of self-organizable logic gates and circuits  .
Revised:  We first introduce the complexity classes for these machines , make a connection with dynamical systems theory , and propose a practical scheme to solve the above class of problems based on the novel concept of self-organizable logic gates and circuits .
Edit intent: fluency
Original:  We first introduce the complexity classes for these machines , make a connection with dynamical systems theory , and propose a practical scheme to solve the above  problems based on the novel concept of self-organizable logic gates and circuits  .
Revised:  We first introduce the complexity classes for these machines , make a connection with dynamical systems theory , and propose a practical scheme to solve the above problems based on the novel concept of self-organizing logic gates and circuits .
Edit intent: fluency
Original:  Using tools of functional analysis, we prove that these machines have a global attractor and the only equilibrium points are the solution(s) of the above problems .
Revised:  Using tools of functional analysis, we prove that these machines have a global attractor ; ii) their only equilibrium points are the solution(s) of the above problems .
Edit intent: coherence
Original:  In addition, any initial condition converges exponentially fast to the solution(s) , and the equilibrium convergence rate scales at most polynomially with input size.
Revised:  In addition, any initial condition converges exponentially fast to the solutions; iv) the equilibrium convergence rate scales at most polynomially with input size.
Edit intent: coherence
Original:  Therefore, they are a realistic alternative to Turing machines to efficiently solve very complex problems.
Edit intent: coherence
Original: This paper examined the size difference of avalanches among industrial sectors triggered by demand by using the production-inventory model and the observed data.
Revised: This study examine the difference in the size of avalanches among industrial sectors triggered by demand by using the production-inventory model and the observed data.
Edit intent: clarity
Original: This paper examined the size difference of avalanches among industrial sectors triggered by demand by using the production-inventory model and the observed data.
Revised: This paper examined the size difference of avalanches among industries triggered by demand by using the production-inventory model and the observed data.
Edit intent: clarity
Original: This paper examined the size difference of avalanches among industrial sectors triggered by demand by using the production-inventory model and the observed data.
Revised: This paper examined the size difference of avalanches among industrial sectors triggered by demand by using the production-inventory model and observed data.
Edit intent: fluency
Original:  Industrial Revolution did not boost the economic growth in Asia .
Revised:  The alleged dramatic takeoff around 1900 or around any other time did not happen .
Edit intent: coherence
Original:  Unique geological and geophysical characteristics of the Molnieboi Spur made it an attractive target for complex botanical studies including botanical, soil, geological, geochemical, geophysical, radiation, and  gas surveys and analyses.
Revised:  Unique geological and geophysical characteristics of the Molnieboi Spur made it an attractive target for complex botanical studies including botanical, soil, geological, geochemical, geophysical, radiation, and soil gas surveys and analyses.
Edit intent: fluency
Original:  A digital elevation model for the study area was derived from a 1: 25,000-scale topographic map.
Revised:  A digital elevation model for the study area was derived from a detailed topographic map.
Edit intent: clarity
Original:  Model complexes have fundamental group isomorphic with the group presented .
Revised:  Model complexes have fundamental group isomorphic with the group defined by the presentation .
Edit intent: clarity
Original:  We show that there are model complexes of size in the order of  bit-complexity of the presentation that can be realized linearly in \mathbb{R .
Revised:  We show that there are model complexes of size in the order of the bit-complexity of the presentation that can be realized linearly in \mathbb{R .
Edit intent: fluency
Original:  We further derive some applications of this result regarding embeddability problems in the euclidean 4-space , and complexity of computing integral homology groups .
Revised:  We further derive some applications of this result regarding embeddability problems in the euclidean 4-space .
Edit intent: coherence
Original: We introduce Visibly Linear Dynamic Logic (VLDL), which is an extension of Linear Dynamic Logic (LDL) with temporal operators that are guarded by nondeterministic visibly pushdown automata.
Revised: We introduce Visibly Linear Dynamic Logic (VLDL), which extends Linear Temporal Logic (LTL) by temporal operators that are guarded by nondeterministic visibly pushdown automata.
Edit intent: clarity
Original:  We prove that VLDL describes exactly the visibly pushdown languagesover infinite words, which makes it strictly more powerful than LTL and LDL and able to express properties of recursive programs .
Revised:  We prove that VLDL describes exactly the visibly pushdown languagesover infinite words, which makes it strictly more powerful than LTL and able to express properties of recursive programs .
Edit intent: coherence
Original:  The main technical contribution of this work is a translation of VLDL formulas into nondeterministic visibly pushdown automata with B\"uchi acceptance of exponential size via one-way alternating jumping automata.
Revised:  The main technical contribution of this work is a translation of VLDL into \omega-visibly pushdown automata of exponential size via one-way alternating jumping automata.
Edit intent: clarity
Original:  This translation yields exponential-time algorithms for satisfiability, validity  and model checking.
Revised:  This translation yields exponential-time algorithms for satisfiability, validity , and model checking.
Edit intent: fluency
Original:  We show all of these problems to be complete for their respective complexity classes .
Revised:  We prove all these problems to be complete for their respective complexity classes .
Edit intent: clarity
Original:  Over the years many algorithmic problems have been shown to be reducible from the 3SUM problem or its variants, including the more generalized forms of the problem, such as k-SUM and k-variate linear degeneracy testing  .
Revised:  Over the years many algorithmic problems have been shown to be reducible from the 3SUM problem or its variants, including the more generalized forms of the problem, such as k-SUM and k-variate linear degeneracy testing (k-LDT) .
Edit intent: clarity
Original:  Thus, a better understanding of the complexity of the 3SUM problem and its variants, might shed more light on the complexity of a wide class of problems in P.
Edit intent: coherence
Original:  2. The randomized decision tree complexity of 3SUM is O(n^{3/2}) . 3. The randomized decision tree complexity of k-variate linear degeneracy testing ( k-LDT ) is O(n^{k/2}), for any odd k\ge 3.
Revised:  2. The randomized decision tree complexity of 3SUM is O(n^{3/2}) . 3. The randomized decision tree complexity of k-variate linear degeneracy testing ( k-LDT is O(n^{k/2}), for any odd k\ge 3.
Edit intent: fluency
Original: Quartet trees which are displayed by larger phylogenetic trees have long been used as inputs for species tree and supertree reconstruction.
Revised: Quartet trees displayed by larger phylogenetic trees have long been used as inputs for species tree and supertree reconstruction.
Edit intent: clarity
Original:  Computational constraints prevent the use of all displayed quartets when the number of genes or number of taxais large .
Revised:  Computational constraints prevent the use of all displayed quartets when the number of taxa .
Edit intent: clarity
Original:  We introduce the  Efficient Quartet System (EQS) to represent a phylogenetic tree with a subset of the quartets displayed by the tree.
Revised:  We introduce the notion of an Efficient Quartet System (EQS) to represent a phylogenetic tree with a subset of the quartets displayed by the tree.
Edit intent: clarity
Original:  We show mathematically that the set of quartets obtained from a tree via  EQS contains all of the combinatorial information of the tree itself.
Revised:  We show mathematically that the set of quartets obtained from a tree via an EQS contains all of the combinatorial information of the tree itself.
Edit intent: fluency
Original:  We also demonstrate via performance tests on some simulated datasetsthat the use of EQS to reduce the number of quartets input to quartet-based species tree methods (including summary methods ) and supertree methods only corresponds to small reductions in accuracy.
Revised:  Using performance tests on some simulated datasetsthat the use of EQS to reduce the number of quartets input to quartet-based species tree methods (including summary methods ) and supertree methods only corresponds to small reductions in accuracy.
Edit intent: coherence
Original:  We also demonstrate via performance tests on some simulated datasetsthat the use of EQS to reduce the number of quartets input to quartet-based species tree methods (including summary methods ) and supertree methods only corresponds to small reductions in accuracy.
Revised:  We also demonstrate via performance tests on simulated datasets, we also demonstrate that using an EQS to reduce the number of quartets input to quartet-based species tree methods (including summary methods ) and supertree methods only corresponds to small reductions in accuracy.
Edit intent: clarity
Original:  We also demonstrate via performance tests on some simulated datasetsthat the use of EQS to reduce the number of quartets input to quartet-based species tree methods (including summary methods ) and supertree methods only corresponds to small reductions in accuracy.
Revised:  We also demonstrate via performance tests on some simulated datasetsthat the use of EQS to reduce the number of quartets in pipelines for summary methods of species tree inference and supertree inference results in only small reductions in accuracy.
Edit intent: clarity
Original: We consider the problem of predicting the time evolution of influence, the expected number of activated nodes, given a set of initiative nodes on a propagation network.
Revised: We consider the problem of predicting the time evolution of influence, the expected number of activated nodes, given a set of initially active nodes on a propagation network.
Edit intent: clarity
Original:  To address the significant computational challenges of this problem on large-scale  networks, we propose to aggregate the activation states of the network adaptively and establish a system of differential equations governing the dynamics of density functions on the resulting graph , which can be considered as an analogue to the Fokker-Planck equation in continuous space  .
Revised:  To address the significant computational challenges of this problem on large-scale networks, we establish a system of differential equations governing the dynamics of density functions on the resulting graph , which can be considered as an analogue to the Fokker-Planck equation in continuous space .
Edit intent: coherence
Original: We ] develop a fully stochastic theory for age-structured populations via Doi-Peliti quantum field theoretical methods.
Revised: We ]. Here we develop a fully stochastic theory for age-structured populations via Doi-Peliti quantum field theoretical methods.
Edit intent: coherence
Original:  This formalism allows us to efficiently recapitulate the results in [1,2], exemplifying the compact utility of Doi-Peliti methods.
Revised:  This formalism allows us to efficiently recapitulate the results in [1,2], exemplifying the utility of Doi-Peliti methods.
Edit intent: clarity
Original:  These methods are highlighted with a binary fission model of cell division.
Revised:  These methods are then generalized with a binary fission model of cell division.
Edit intent: clarity
Original:  Based on many known properties of cortical neurons, a recent study proposed hierarchical temporal memory (HTM) sequence memory  as a theoretical framework for sequence learning in the cortex.
Revised:  Based on many known properties of cortical neurons, hierarchical temporal memory (HTM) sequence memory as a theoretical framework for sequence learning in the cortex.
Edit intent: clarity
Original:  In this paper, we analyze properties of HTM sequence memory and apply it to various sequence learning and prediction problems  .
Revised:  In this paper, we analyze properties of HTM sequence memory and apply it to sequence learning and prediction problems .
Edit intent: clarity
Original:  We compare the HTM sequence memory and other sequence learning algorithms, including the autoregressive integrated moving average (ARIMA) model and long short-term memory (LSTM)  , on sequence prediction problems with both artificial and real-world data.
Revised:  We compare the HTM sequence memory with other sequence learning algorithms, including the autoregressive integrated moving average (ARIMA) model and long short-term memory (LSTM) , on sequence prediction problems with both artificial and real-world data.
Edit intent: fluency
Original:  The HTM model not only achieves comparable or better accuracy than state-of-the-art algorithms , but also exhibits a set of properties that is critical for sequence learning .
Revised:  The HTM model achieves comparable accuracy to other state-of-the-art algorithms , but also exhibits a set of properties that is critical for sequence learning .
Edit intent: clarity
Original:  The HTM model not only achieves comparable or better accuracy than state-of-the-art algorithms , but also exhibits a set of properties that is critical for sequence learning .
Revised:  The HTM model not only achieves comparable or better accuracy than state-of-the-art algorithms . The model also exhibits properties that are critical for sequence learning .
Edit intent: clarity
Original:  These properties include continuous online learning, the ability to handle multiple predictions and branching sequences  , robustness to sensor noise and fault tolerance, and good performance without task-specific hyper-parameters tuning.
Revised:  These properties include continuous online learning, the ability to handle multiple predictions and branching sequences , robustness to sensor noise and fault tolerance, and good performance without task-specific hyper- parameters tuning.
Edit intent: fluency
Original:  The g-dependent shape of this hole tracks the g=0 contours of constant localization length.
Revised:  The bias dependent shape of this hole tracks the g=0 contours of constant localization length.
Edit intent: clarity
Original:  Visually presenting conflicting cues and targets we hypothesize that it's feasible  measure the allocated effort when responding to confusing stimuli.
Revised:  Visually presenting conflicting cues and targets we hypothesize that it's feasible to measure the allocated effort when responding to confusing stimuli.
Edit intent: fluency
Original:  Although such experiments are normally carried out in a lab, we are able to differentiate between sustained alertness and complex decision making even with low cost eye tracking  in the wild  .
Revised:  Although such experiments are normally carried out in a lab, we are able to differentiate between sustained alertness and complex decision making even with low cost eye tracking " in the wild .
Edit intent: fluency
Original:  Although such experiments are normally carried out in a lab, we are able to differentiate between sustained alertness and complex decision making even with low cost eye tracking  in the wild  .
Revised:  Although such experiments are normally carried out in a lab, we are able to differentiate between sustained alertness and complex decision making even with low cost eye tracking in the wild " .
Edit intent: fluency
Original:  From a quantified self perspective  , the correlations between the pupil size and the task dependent reaction time and error rates provide further insight into individual users' strategies for coping with tasks prompting different levels of attention.
Revised:  From a quantified self perspective , the correlations between the pupil size and the task dependent reaction time and error rates may longer term provide a foundation for modifying smartphone content and interaction to the users perceived level of attention.
Edit intent: clarity
Original:  However, there is still much uncertainty about the existence of a well-defined reference mechanical state at which bone structure is adapted and stable.
Revised:  However, there is still much uncertainty about how to define the reference mechanical state at which bone structure is adapted and stable.
Edit intent: clarity
Original:  The dynamic nature of bone tissues and wide range of timescales at which mechanical adaptation is observed clinically and experimentally make it difficult to define such a reference state .
Revised:  The dynamic nature of bone tissues and wide range of timescales .
Edit intent: clarity
Original:  We propose here a mechanostat theory that takes into account the cellular origin of bone's mechanosensitivity .
Revised:  We propose here a mechanostat theory that links various timescales of structural adaptation with various dynamic features of the osteocyte network in bone .
Edit intent: clarity
Original:  and (iii) the replacement of the mechanosensing cells during bone remodelling, which resets the cell-specific reference state.
Revised:  and (iii) the replacement of osteocytes during bone remodelling, which resets the cell-specific reference state.
Edit intent: clarity
Original:  Our proposed cell-based mechanostat theory gives a cellular interpretation of the different phenomena and timescales occurring during the mechanical adaptation of bone tissues .
Revised:  Our proposed cell-based mechanostat theory gives a cellular interpretation of the different phenomena and timescales observed during the mechanical adaptation of bone tissues .
Edit intent: clarity
Original:  It has an underlying graph in which vertices correspond to individuals .
Revised:  The algorithm runs on an underlying graph in which vertices correspond to individuals .
Edit intent: clarity
Original:  It has an underlying graph in which vertices correspond to individuals .
Revised:  It has an underlying graph where individuals correspond to vertices .
Edit intent: clarity
Original:  Initially, one individual (chosen uniformly at random ) possesses a mutation, with fitness r>1.
Revised:  Initially, one vertex (chosen u.a.r. ) possesses a mutation, with fitness r>1.
Edit intent: clarity
Original:  At each step of the discrete-time process , an individual is chosen with probability proportional to its fitness, and its state (mutant or non-mutant) is passed on to an out-neighbour  chosen u.a.r.
Revised:  During each step of the discrete-time process , an individual is chosen with probability proportional to its fitness, and its state (mutant or non-mutant) is passed on to an out-neighbour chosen u.a.r.
Edit intent: fluency
Original:  At each step of the discrete-time process , an individual is chosen with probability proportional to its fitness, and its state (mutant or non-mutant) is passed on to an out-neighbour  chosen u.a.r.
Revised:  At each step of the algorithm , an individual is chosen with probability proportional to its fitness, and its state (mutant or non-mutant) is passed on to an out-neighbour chosen u.a.r.
Edit intent: clarity
Original:  At each step of the discrete-time process , an individual is chosen with probability proportional to its fitness, and its state (mutant or non-mutant) is passed on to an out-neighbour  chosen u.a.r.
Revised:  At each step of the discrete-time process , an individual is chosen with probability proportional to its fitness, and its state (mutant or non-mutant) is passed on to an out-neighbour which is chosen u.a.r.
Edit intent: clarity
Original:  If the underlying graph is strongly connected , the process will eventually reach fixation ( all individuals are mutants ) or extinction( no individuals are mutants ).
Revised:  If the underlying graph is strongly connected then the algorithm will eventually reach fixation ( all individuals are mutants ) or extinction( no individuals are mutants ).
Edit intent: clarity
Original:  If the underlying graph is strongly connected , the process will eventually reach fixation ( all individuals are mutants ) or extinction( no individuals are mutants ).
Revised:  If the underlying graph is strongly connected , the process will eventually reach fixation , in which all individuals are mutants ) or extinction( no individuals are mutants ).
Edit intent: clarity
Original:  If the underlying graph is strongly connected , the process will eventually reach fixation ( all individuals are mutants ) or extinction( no individuals are mutants ).
Revised:  If the underlying graph is strongly connected , the process will eventually reach fixation ( all individuals are mutants , or extinction, in which no individuals are mutants ).
Edit intent: clarity
Original:  We define an infinite family of directed graphs  to be strongly amplifying if, for every r>1, the extinction probability tends to 0 as the number n of vertices increases.
Revised:  We define an infinite family of directed graphs is said to be strongly amplifying if, for every r>1, the extinction probability tends to 0 as the number n of vertices increases.
Edit intent: clarity
Original:  We define an infinite family of directed graphs  to be strongly amplifying if, for every r>1, the extinction probability tends to 0 as the number n of vertices increases.
Revised:  We define an infinite family of directed graphs to be strongly amplifying if, for every r>1, the extinction probability tends to 0 as the number of vertices increases.
Edit intent: clarity
Original:  Strong amplification is a rather surprising property - the initial mutant only has a fixed selective advantage, independent of n, which is "amplified" to give a fixation probability tending to 1. Strong amplifiers have received quite a bit of attention.
Edit intent: coherence
Original:  Lieberman et al. proposed two potential families of them: superstars and metafunnels.
Revised:  Lieberman et al. proposed two potentially strongly-amplifying families - superstars and metafunnels.
Edit intent: clarity
Original:  It has been argued heuristically that some infinite families of superstars  are strongly amplifying.
Revised:  Heuristic arguments have been published, arguing that there are infinite families of superstars are strongly amplifying.
Edit intent: clarity
Original:  It has been argued heuristically that some infinite families of superstars  are strongly amplifying.
Revised:  It has been argued heuristically that some infinite families of superstars that are strongly amplifying.
Edit intent: clarity