wanyu/IteraTeR_v2 huggingface dataset:
Original:  To this end, we consider realizations from the Chung-Lu random graph model as the Chung-Lu random graph model is not only amenable to analysis, but also emulates many of the properties frequently observed in real world networks including the small world phenomenon and degree heterogeneity.
Revised:  To this end, we consider realizations from the Chung-Lu random graph model . Since the Chung-Lu random graph model is not only amenable to analysis, but also emulates many of the properties frequently observed in real world networks including the small world phenomenon and degree heterogeneity.
Edit intent: coherence
Original:  To this end, we consider realizations from the Chung-Lu random graph model as the Chung-Lu random graph model is not only amenable to analysis, but also emulates many of the properties frequently observed in real world networks including the small world phenomenon and degree heterogeneity.
Revised:  To this end, we consider realizations from the Chung-Lu random graph model as the Chung-Lu random graph model captures many properties of real world networks including the small world phenomenon and degree heterogeneity.
Edit intent: clarity
Original:  Finally, we consider a special application of our almost shortest paths algorithm to study internet routing (withdrawals) in the Autonomous System graph  .
Revised:  Finally, we consider a special application of our almost shortest paths algorithm to measure path diversity for internet routing in a snapshot of the Autonomous System graph .
Edit intent: clarity
Original:  Furthermore , we present a simple algorithm for computing all (weakly simple) paths between two nodes bounded by length D in O(m\log m+kL) time for graphs with positive edge weights , where L is an upperbound for the number of nodes in any returned path and k is the number paths computed .
Revised:  Furthermore , we present an easy to implement O(m\log m+kL) time for graphs with positive edge weights , where L is an upperbound for the number of nodes in any returned path and k is the number paths computed .
Edit intent: clarity
Original:  In this paper we describe an approach based on hidden Markov models, which splits foraging trips into segments labeled as "outbound", "search", "forage", and "inbound".
Revised:  In this paper we describe an approach based on hidden Markov models, which splits foraging trips into segments labelled as "outbound", "search", "forage", and "inbound".
Edit intent: fluency
Original:  We show that these two methods achieve competitive performance compared with the other tools, and produce more accurate upper bounds for 25\% of all tested benchmarks .
Revised:  We show that these two methods achieve competitive performance , while computing accurate upper bounds for 25\% of all tested benchmarks .
Edit intent: clarity
Original:  We show that these two methods achieve competitive performance compared with the other tools, and produce more accurate upper bounds for 25\% of all tested benchmarks .
Revised:  We show that these two methods achieve competitive performance compared with the other tools, and produce more accurate upper bounds by comparison with other tools .
Edit intent: clarity
Original: We construct two smooth analogs of an existing piecewise-smooth dynamical system model for freshwater plankton that consists of an adaptively feeding predator and its two prey types .
Revised: We construct two ordinary-differential-equation models of a predator feeding adaptively on two prey types .
Edit intent: clarity
Original:  We smooth out the piecewise-smooth dynamical system in two different ways: (1) by using the hyperbolic tangent function , and (2) by incorporating a parameter that changes abruptly across the discontinuity in a piecewise-smooth system as a system variable that is coupled to the population dynamics.
Revised:  We smooth out the piecewise-smooth dynamical system in two different ways: (1) by using the hyperbolic tangent function ; and (2) by incorporating a parameter that changes abruptly across the discontinuity in a piecewise-smooth system as a system variable that is coupled to the population dynamics.
Edit intent: fluency
Original:  We smooth out the piecewise-smooth dynamical system in two different ways: (1) by using the hyperbolic tangent function , and (2) by incorporating a parameter that changes abruptly across the discontinuity in a piecewise-smooth system as a system variable that is coupled to the population dynamics.
Revised:  We smooth out the piecewise-smooth dynamical system in two different ways: (1) by using the hyperbolic tangent function , and (2) by incorporating a parameter that changes abruptly across the switching boundary as a system variable that is coupled to the population dynamics.
Edit intent: clarity
Original:  We then compare model predictions quantitatively to data for freshwater plankton and show that the two smooth analogs fit the data well when the smooth transition is steep, supporting the simplifying assumption of a discontinuous prey switching behavior in this scenario .
Revised:  We then compare model predictions quantitatively to data for freshwater plankton and show that the two models fit the data well when the smooth transition is steep, supporting the simplifying assumption of a discontinuous prey switching behavior in this scenario .
Edit intent: clarity
Original:  Experimental results are also presented demonstrating the effectiveness of this scheduler under a range of realistic network conditions and actual web page fetches.
Revised:  Experimental results are also presented demonstrating the effectiveness of this scheduler under a range of network conditions and actual web page fetches.
Edit intent: clarity
Original:  Experimental results are also presented demonstrating the effectiveness of this scheduler under a range of realistic network conditions and actual web page fetches.
Revised:  Experimental results are also presented demonstrating the effectiveness of this scheduler under a range of realistic network conditions and real web page fetches.
Edit intent: clarity
Original: Multi-valued partial CFL functions are computed by one-way nondeterministic pushdown automata  equipped with write-only output tapes  .
Revised: Multi-valued partial CFL functions are computed by one-way nondeterministic pushdown automata , equipped with write-only output tapes .
Edit intent: fluency
Original:  Inform. 43 (2007) 395-417], of whether all  multi-valued partial CFL functions can be refined by single-valued partial CFL functions.
Revised:  Inform. 43 (2007) 395-417], of whether all such multi-valued partial CFL functions can be refined by single-valued partial CFL functions.
Edit intent: clarity
Original:  We negatively solve this  question by presenting a special multi-valued partial CFL function as an example function and by proving that no refinement of this particular function becomes a single-valued partial CFL function.
Revised:  We negatively solve this open question by presenting a special multi-valued partial CFL function as an example function and by proving that no refinement of this particular function becomes a single-valued partial CFL function.
Edit intent: clarity
Original:  For the proof  , we first introduce a new concept of colored automata having no output tapes but having "colors," which can simulate pushdown automata  with constant-space output tapes.
Revised:  For the proof of this fact , we first introduce a new concept of colored automata having no output tapes but having "colors," which can simulate pushdown automata with constant-space output tapes.
Edit intent: coherence
Original:  For the proof  , we first introduce a new concept of colored automata having no output tapes but having "colors," which can simulate pushdown automata  with constant-space output tapes.
Revised:  For the proof , we first introduce a new concept of colored automata having no output tapes but having "colors," which can simulate pushdown automata equipped with constant-space output tapes.
Edit intent: clarity
Original:  We then conduct an extensive combinatorial analysis on the behaviors of transition records of stack contents (called stack histories) of  colored automata.
Revised:  We then conduct an extensive combinatorial analysis on the behaviors of transition records of stack contents (called stack histories) of these colored automata.
Edit intent: clarity
Original:  In this paper, we address this problem by performing the first rigorous, language-theoretic analysis of several common protocol idioms , laying a formal foundation for further research on the parsing problem .
Revised:  In this paper, we address this problem by performing the first rigorous, language-theoretic analysis of several common protocol idioms .
Edit intent: clarity
Original:  We then demonstrate the practical value of our findings by automatically generating a modular, robust, and efficient input validator for HTTP from a set of context-free grammars  .
Revised:  We then demonstrate the practical value of our findings by developing a modular, robust, and efficient input validator for HTTP from a set of context-free grammars .
Edit intent: clarity
Original:  We then demonstrate the practical value of our findings by automatically generating a modular, robust, and efficient input validator for HTTP from a set of context-free grammars  .
Revised:  We then demonstrate the practical value of our findings by automatically generating a modular, robust, and efficient input validator for HTTP relying on context-free grammars .
Edit intent: clarity
Original:  We highlight the emergence of structural entrenchment , a new concept we define as the persistence of structural features, such as closed triangles and spillover edges, which are formed under historically different conditions from those currently incentivizing the creation of new social ties or the destruction of existing ties .
Revised:  We highlight the emergence of structural entrenchment : the retention of structural features, such as closed triangles and spillover edges, which are formed under historically different conditions from those currently incentivizing the creation of new social ties or the destruction of existing ties .
Edit intent: clarity
Original:  We highlight the emergence of structural entrenchment , a new concept we define as the persistence of structural features, such as closed triangles and spillover edges, which are formed under historically different conditions from those currently incentivizing the creation of new social ties or the destruction of existing ties .
Revised:  We highlight the emergence of structural entrenchment , a new concept we define as the persistence of structural features, such as closed triangles and spillover edges, which are formed under historically different conditions from those currently driving network evolution .
Edit intent: clarity
Original: With the growing deployment of IPv6 , the question arises whether and to what extent this new protocol is co-deployed with IPv4 on existing hardware or whether new hardware or proxy solutions are deployed.
Revised: Linking the growing IPv6 , the question arises whether and to what extent this new protocol is co-deployed with IPv4 on existing hardware or whether new hardware or proxy solutions are deployed.
Edit intent: clarity
Original: With the growing deployment of IPv6 , the question arises whether and to what extent this new protocol is co-deployed with IPv4 on existing hardware or whether new hardware or proxy solutions are deployed.
Revised: With the growing deployment of IPv6 deployment to existing IPv4 on existing hardware or whether new hardware or proxy solutions are deployed.
Edit intent: clarity
Original:  By conducting several measurement runs and training in cross- validation rounds, we aim to create models that generalize well and do not overfit our training data.
Revised:  By conducting several measurement runs and training in cross-validation rounds, we aim to create models that generalize well and do not overfit our training data.
Edit intent: fluency
Original:  We argue that this methodology, thoroughly cross-validated and likely to generalize well, can aide comparative studies of IPv6 and IPv4 behavior in the Internet.
Revised:  We argue that this methodology, thoroughly cross-validated and likely to generalize well, can aid comparative studies of IPv6 and IPv4 behavior in the Internet.
Edit intent: fluency
Original:  Emergent properties and statistical issues limit the effectivenessof reductionist approaches . A more holistic modelling of aggregates at the whole stand level is a potentially attractive alternative.
Revised:  Emergent properties and statistical issues limit their effectiveness . A more holistic modelling of aggregates at the whole stand level is a potentially attractive alternative.
Edit intent: clarity
Original:  This work explores methodology for developing biologically consistent dynamic mixture models where the state is described by aggregate stand-level variables for species and/or size cohorts.
Revised:  This work explores methodology for developing biologically consistent dynamic mixture models where the state is described by aggregate stand-level variables for species or age/ size cohorts.
Edit intent: clarity
Original:  The methods are demonstrated and tested with a two-cohort model for spruce-aspen mixtures called SAM.
Revised:  The methods are demonstrated and tested with a two-cohort model for spruce-aspen mixtures named SAM.
Edit intent: fluency
Original:  How this information is readout by downstream neurons is unclear.
Revised:  How this information is extracted by downstream neurons is unclear.
Edit intent: clarity
Original:  In this theoretical paper, we investigate to what extent a single cell could detect a given spike pattern and what are the optimal parameters to do so  , in particular the membrane time constant \tau.
Revised:  In this theoretical paper, we investigate to what extent a single cell could detect a given spike pattern and what the optimal parameters to do so , in particular the membrane time constant \tau.
Edit intent: coherence
Original:  In this theoretical paper, we investigate to what extent a single cell could detect a given spike pattern and what are the optimal parameters to do so  , in particular the membrane time constant \tau.
Revised:  In this theoretical paper, we investigate to what extent a single cell could detect a given spike pattern and what are the optimal parameters to do so are , in particular the membrane time constant \tau.
Edit intent: clarity
Original:  Using a leaky integrate-and-fire (LIF) neuron with instantaneous synapses and homogeneous Poisson inputs, we computed this optimum analytically.
Revised:  Using a leaky integrate-and-fire (LIF) neuron with instantaneous synapses and homogeneous Poisson input, we were able to compute this optimum analytically.
Edit intent: clarity
Original:  This is somewhat surprising as the resulting detector ignores most of the pattern, due to its fast memory decay.
Revised:  This is somewhat counter intuitive as the resulting detector ignores most of the pattern, due to its fast memory decay.
Edit intent: clarity
Original:  We simulated a LIF neuron equipped with additive STDP , and repeatedly exposed  to a given input spike pattern.
Revised:  We simulated a LIF neuron equipped with additive STDP , and repeatedly exposed it to a given input spike pattern.
Edit intent: clarity
Original:  This is consistent with the fact that recognition is still possible if a sound sequence is compressed of played backward, or scrambled using 10ms bins.
Revised:  This is consistent with the fact that recognition is still possible if a sound sequence is compressed , played backward, or scrambled using 10ms bins.
Edit intent: fluency
Original:  The algorithm is based on learning a formalism named family of DFAs (FDFAs) recently proposed by Angluin and Fisman ~\mbox{ Angluin2014 .
Revised:  The algorithm is based on learning a formalism named family of DFAs (FDFAs) recently proposed by Angluin and Fisman ~\mbox{ Angluin2014 .
Edit intent: fluency
Original:  The main catch is that we use a classification tree structure instead of the standard \emph{observation table structure.
Revised:  The main catch is that we use a classification tree structure instead of the standard \emph{observation table structure.
Edit intent: fluency
Original: In this paper  we study the Target Set Selection problem , a fundamental problem in computational social choice, from a parameterized complexity perspective.
Revised: In this paper , we study the Target Set Selection problem , a fundamental problem in computational social choice, from a parameterized complexity perspective.
Edit intent: fluency
Original: In this paper  we study the Target Set Selection problem , a fundamental problem in computational social choice, from a parameterized complexity perspective.
Revised: In this paper we study the Target Set Selection problem from a parameterized complexity perspective.
Edit intent: clarity
Original:  Here for a given graph and a threshold for each vertex  the task is to find a set of active vertices that activates whole graph . A vertex  becomes active if the number of  activated vertices in its neighborhood is at least its threshold.
Revised:  Here for a given graph and a threshold for each vertex , the task is to find a set of active vertices that activates whole graph . A vertex becomes active if the number of activated vertices in its neighborhood is at least its threshold.
Edit intent: fluency
Original:  Here for a given graph and a threshold for each vertex  the task is to find a set of active vertices that activates whole graph . A vertex  becomes active if the number of  activated vertices in its neighborhood is at least its threshold.
Revised:  Here for a given graph and a threshold for each vertex the task is to find a set of active vertices that activates whole graph . A vertex becomes active if the number of so far activated vertices in its neighborhood is at least its threshold.
Edit intent: clarity
Original:  We give two parameterized algorithms for a special case where each vertex has  threshold set to  half of its neighbors (the so called Majority Target Set Selection problem) for parameterizations by  neighborhood diversity and  twin cover number of the input graph.
Revised:  We give two parameterized algorithms for a special case where each vertex has the threshold set to half of its neighbors (the so called Majority Target Set Selection problem) for parameterizations by neighborhood diversity and twin cover number of the input graph.
Edit intent: fluency
Original:  We give two parameterized algorithms for a special case where each vertex has  threshold set to  half of its neighbors (the so called Majority Target Set Selection problem) for parameterizations by  neighborhood diversity and  twin cover number of the input graph.
Revised:  We give two parameterized algorithms for a special case where each vertex has threshold set to the half of its neighbors (the so called Majority Target Set Selection problem) for parameterizations by neighborhood diversity and twin cover number of the input graph.
Edit intent: fluency
Original:  We give two parameterized algorithms for a special case where each vertex has  threshold set to  half of its neighbors (the so called Majority Target Set Selection problem) for parameterizations by  neighborhood diversity and  twin cover number of the input graph.
Revised:  We give two parameterized algorithms for a special case where each vertex has threshold set to half of its neighbors (the so-called Majority Target Set Selection problem) for parameterizations by neighborhood diversity and twin cover number of the input graph.
Edit intent: fluency
Original:  We give two parameterized algorithms for a special case where each vertex has  threshold set to  half of its neighbors (the so called Majority Target Set Selection problem) for parameterizations by  neighborhood diversity and  twin cover number of the input graph.
Revised:  We give two parameterized algorithms for a special case where each vertex has threshold set to half of its neighbors (the so called Majority Target Set Selection problem) for parameterizations by the neighborhood diversity and twin cover number of the input graph.
Edit intent: fluency
Original:  We give two parameterized algorithms for a special case where each vertex has  threshold set to  half of its neighbors (the so called Majority Target Set Selection problem) for parameterizations by  neighborhood diversity and  twin cover number of the input graph.
Revised:  We give two parameterized algorithms for a special case where each vertex has threshold set to half of its neighbors (the so called Majority Target Set Selection problem) for parameterizations by neighborhood diversity and the twin cover number of the input graph.
Edit intent: fluency
Original:  From the opposite sidewe give hardness proof for the Majority Target Set Selection problem when parameterized by (  restriction of) the modular-width - a natural generalization of both previous structural parameters.
Revised:  From the opposite sidewe give hardness proof for the Majority Target Set Selection problem when parameterized by ( a restriction of) the modular-width - a natural generalization of both previous structural parameters.
Edit intent: fluency
Original:  Finally, we give hardness proof for the Target Set Selection problem parameterized by the neighborhood diversity  ] when there is no restriction on the thresholds.
Revised:  We also show the Target Set Selection problem parameterized by the neighborhood diversity ] when there is no restriction on the thresholds.
Edit intent: coherence
Original: Despite popularity of Fingerprinting Localization Algorithms (FPS), general theoretical frameworks for their performance studies have rarely been discussed in the literature .
Revised: A general theoretical framework for Fingerprinting Localization Algorithms (FPS), general theoretical frameworks for their performance studies have rarely been discussed in the literature .
Edit intent: clarity
Original: Despite popularity of Fingerprinting Localization Algorithms (FPS), general theoretical frameworks for their performance studies have rarely been discussed in the literature .
Revised: Despite popularity of Fingerprinting Localization Algorithms (FPS), general theoretical frameworks for their performance studies .
Edit intent: clarity
Original:  In this work, after setting up an abstract model for the FPS, it is shown that fingerprinting-based localization problem can be cast as a Hypothesis Testing (HT) problem and therefore various results in the HT literature can be used to provide insights for the general FPS.
Revised:  In this work, after setting up an abstract model for FPS, it is shown that fingerprinting-based localization problem can be cast as a Hypothesis Testing (HT) problem and therefore various results in the HT literature can be used to provide insights for the general FPS.
Edit intent: fluency
Original:  In this work, after setting up an abstract model for the FPS, it is shown that fingerprinting-based localization problem can be cast as a Hypothesis Testing (HT) problem and therefore various results in the HT literature can be used to provide insights for the general FPS.
Revised:  In this work, after setting up an abstract model for the FPS, it is shown that fingerprinting-based localization problem can be cast as a hypothesis testing (HT) problem and therefore various results in the HT literature can be used to provide insights for the general FPS.
Edit intent: fluency
Original:  In this work, after setting up an abstract model for the FPS, it is shown that fingerprinting-based localization problem can be cast as a Hypothesis Testing (HT) problem and therefore various results in the HT literature can be used to provide insights for the general FPS.
Revised:  In this work, after setting up an abstract model for the FPS, it is shown that fingerprinting-based localization problem can be cast as a Hypothesis Testing (HT) problem and therefore various results in HT literature can be used to provide insights for the general FPS.
Edit intent: fluency