wanyu/IteraTeR_v2 huggingface dataset:
Original: Using the referencing patterns in articles in Cognitive Science during three decades, we analyze the knowledge base of this literature in terms of its changing disciplinary composition.
Revised: Using the referencing patterns in articles in Cognitive Science over three decades, we analyze the knowledge base of this literature in terms of its changing disciplinary composition.
Edit intent: clarity
Original:  Three periods are distinguished: (1) construction of the interdisciplinary space during the 1980s;
Revised:  Three periods are distinguished: (1) construction of the interdisciplinary space in the 1980s;
Edit intent: clarity
Original:  (2) development of the interdisciplinary orientation during the 1990s;
Revised:  (2) development of an interdisciplinary orientation in the 1990s;
Edit intent: clarity
Original:  (3) reintegration into "cognitive psychology" during the 2000s.
Revised:  (3) reintegration into "cognitive psychology" in the 2000s.
Edit intent: clarity
Original:  "Interdisciplinarity" should differently be defined at the level of journals and  specialties.
Revised:  "Interdisciplinarity" should be defined differently at the level of journals and specialties.
Edit intent: fluency
Original:  "Interdisciplinarity" should differently be defined at the level of journals and  specialties.
Revised:  "Interdisciplinarity" should differently be defined at the level of journals and of specialties.
Edit intent: fluency
Original: We introduce two efficient algorithms for finding the k shortest paths of a weighted pushdown automaton (WPDA) with bounded stack .
Revised: We introduce efficient algorithms for finding the k shortest paths of a weighted pushdown automaton (WPDA) with bounded stack .
Edit intent: clarity
Original:  Both of our algorithms are derived from the same weighted deductive logic description of  a WPDA using different search strategies  .
Revised:  Both of our algorithms are derived from the same weighted deductive logic description of the execution of a WPDA using different search strategies .
Edit intent: clarity
Original:  However, an important assumption needed for formulating this result is  that the ambient normed space is uniformly convex.
Revised:  However, this result is that the ambient normed space is uniformly convex.
Edit intent: clarity
Original:  However, an important assumption needed for formulating this result is  that the ambient normed space is uniformly convex.
Revised:  However, an important assumption needed for formulating this result is based on the assumption that the ambient normed space is uniformly convex.
Edit intent: clarity
Original:  Unfortunately, simple counterexamples show that if the uniform convexity is removed, then instability can occur.
Revised:  Unfortunately, simple counterexamples show that if uniform convexity is removed, then instability can occur.
Edit intent: clarity
Original:  This paper shows that this is indeed the case assuming the unit sphere of the space has a certain (non-exotic) structure and the sites satisfy a certain "general position" condition related to  the unit sphere  .
Revised:  This paper shows that this is indeed the case assuming the unit sphere of the space has a certain (non-exotic) structure and the sites satisfy a certain "general position" condition related to it. The condition on the unit sphere .
Edit intent: clarity
Original: Although many algorithms for computing Euclidean Voronoi diagrams of point sites have been published , most of them are sequential in nature and hence cast inherent difficulties on the possibility to compute the diagrams in parallel.
Revised: Although many algorithms for computing Euclidean Voronoi diagrams of point sites have been published , most of the known algorithms are sequential in nature and hence cast inherent difficulties on the possibility to compute the diagrams in parallel.
Edit intent: clarity
Original: Although many algorithms for computing Euclidean Voronoi diagrams of point sites have been published , most of them are sequential in nature and hence cast inherent difficulties on the possibility to compute the diagrams in parallel.
Revised: Although many algorithms for computing Euclidean Voronoi diagrams of point sites have been published , most of them are sequential in nature and hence cast inherent difficulties on the possibility to compute the diagram in parallel.
Edit intent: fluency
Original:  The algorithm is significantly different from previous ones and some of the involved concepts in it are in the spirit of convex analysis and optics.
Revised:  The algorithm is significantly different from previous ones and some of the involved concepts in it are in the spirit of linear programming and optics.
Edit intent: clarity
Original:  A new combinatorial structure for representing the cells  is described along the way and the computation of the induced Delaunay graph follows as a simple consequence .
Revised:  A new combinatorial structure for representing the cells is described along the way and the computation of the induced Delaunay graph is obtained almost automatically .
Edit intent: clarity
Original: The Voronoi diagram is a widely used geometric data structure  .
Revised: The Voronoi diagram is a certain geometric data structure .
Edit intent: clarity
Original:  However, this theory has been quite steady during the last few decades in the sense that  new algorithms have not entered the game.
Revised:  However, this theory has been quite steady during the last few decades in the sense that new algorithms have entered the game.
Edit intent: clarity
Original:  In addition, most of the known algorithms are sequential in nature and hence cast inherent difficulties on the possibility to compute the diagram in parallel.
Revised:  In addition, most of the known algorithms are serial in nature and hence cast inherent difficulties on the possibility to compute the diagram in parallel.
Edit intent: fluency
Original:  We correct some inaccuracies in the BPLS original approximations and and the calcium uniporter rate J_{\rm uni}.
Revised:  We identify some inaccuracies in the BPLS original approximations and and the calcium uniporter rate J_{\rm uni}.
Edit intent: clarity
Original:  We infer  from exhaustive numerical explorations  that the enhanced BPLS equations have a unique attractor fixed point for physiologically acceptable ranges of mitochondrial variables and respiration inputs  .
Revised:  We infer , from exhaustive numerical explorations that the enhanced BPLS equations have a unique attractor fixed point for physiologically acceptable ranges of mitochondrial variables and respiration inputs .
Edit intent: fluency
Original:  We infer  from exhaustive numerical explorations  that the enhanced BPLS equations have a unique attractor fixed point for physiologically acceptable ranges of mitochondrial variables and respiration inputs  .
Revised:  We infer from exhaustive numerical explorations , that the enhanced BPLS equations have a unique attractor fixed point for physiologically acceptable ranges of mitochondrial variables and respiration inputs .
Edit intent: fluency
Original:  The same effect of calcium saturation reported for the original BPLS model is observed here.
Revised:  The same effect of calcium saturation reported for the original BPLS model are observed here.
Edit intent: fluency
Original:  We find out, however, an interesting non-stationary effect : the inertia of the model tends to increase considerably for high concentrations of calcium {\rm   .
Revised:  We find out, however, a novel non-stationary effect : the inertia of the model tends to increase considerably for high concentrations of calcium {\rm .
Edit intent: clarity
Original:  We find out, however, an interesting non-stationary effect : the inertia of the model tends to increase considerably for high concentrations of calcium {\rm   .
Revised:  We find out, however, an interesting non-stationary effect : the inertia of the model tend to increase considerably for high concentrations of calcium {\rm .
Edit intent: fluency
Original:  The proposed framework is validated by comparison with  simulation results and  provides a very powerful tool to accurately account for the boundary effects in finite wireless sensor networks.
Revised:  The proposed framework is validated by comparison with the simulation results and provides a very powerful tool to accurately account for the boundary effects in finite wireless sensor networks.
Edit intent: fluency
Original:  The proposed framework is validated by comparison with  simulation results and  provides a very powerful tool to accurately account for the boundary effects in finite wireless sensor networks.
Revised:  The proposed framework is validated by comparison with simulation results and provides a very useful tool to accurately account for the boundary effects in finite wireless sensor networks.
Edit intent: clarity
Original:  The proposed framework is validated by comparison with  simulation results and  provides a very powerful tool to accurately account for the boundary effects in finite wireless sensor networks.
Revised:  The proposed framework is validated by comparison with simulation results and provides a very powerful tool to accurately account for the boundary effects in the design of finite wireless networks.
Edit intent: clarity
Original:  Here we give a new treatment that reduces the crushing process to a sequential combination of three atomic operations on a cell decomposition, all of which are simple to analyse.
Revised:  Here we give a new treatment that reduces the crushing process to a sequential combination of three "atomic" operations on a cell decomposition, all of which are simple to analyse.
Edit intent: clarity
Original:  We also uncover a connection between the Partial Allocation mechanism and VCG-based mechanism design , which introduces a way to implement interesting truthful mechanisms in settings where monetary payments are not an option.
Revised:  In addition to this, we uncover a connection between the Partial Allocation mechanism and VCG-based mechanism design , which introduces a way to implement interesting truthful mechanisms in settings where monetary payments are not an option.
Edit intent: coherence
Original:  For a multi-dimensional domain with an arbitrary number of agents and items, and for the very large class of homogeneous valuation functions, we prove that our mechanism provides every agent{\em  with at least a 1/e\approx 0.368 fraction of her Proportionally Fair valuation.
Revised:  For a multi-dimensional domain with an arbitrary number of agents and items, and for the very large class of homogeneous valuations, we design a truthful mechanism that provides{\em with at least a 1/e\approx 0.368 fraction of her Proportionally Fair valuation.
Edit intent: clarity
Original:  To complement this result, we show that no truthful mechanism can guarantee more than  0.5 approximation , even for the restricted class of additive linear valuations.
Revised:  To complement this result, we show that no truthful mechanism can guarantee more than a 0.5 approximation , even for the restricted class of additive linear valuations.
Edit intent: fluency
Original:  To complement this result, we show that no truthful mechanism can guarantee more than  0.5 approximation , even for the restricted class of additive linear valuations.
Revised:  To complement this result, we show that no truthful mechanism can guarantee more than 0.5 fraction , even for the restricted class of additive linear valuations.
Edit intent: clarity
Original:  We propose a layer-wise training procedure which admits, under the right conditions, a global optimality guarantee .
Revised:  We propose a layer-wise training procedure admitting a performance guarantee compared to the global optimum .
Edit intent: clarity
Original:  We test the new learning procedure against the state of the art  (stacked RBMs), and find it to improve performance.
Revised:  We test the new learning procedure against a state of the art (stacked RBMs), and find it to improve performance.
Edit intent: fluency
Original:  We test the new learning procedure against the state of the art  (stacked RBMs), and find it to improve performance.
Revised:  We test the new learning procedure against the state of the art method (stacked RBMs), and find it to improve performance.
Edit intent: clarity
Original:  Thus, we present an algorithm, which approximates, for a given input parameter \delta, an optimal solution for the MinEx problem\MinEx\MaxIn up to an additive approximation error \delta times the length of the input curves.
Revised:  Thus, we present an algorithm, which approximates, for a given input parameter \delta, optimal solutions for the\MinEx\MaxIn up to an additive approximation error \delta times the length of the input curves.
Edit intent: clarity
Original:  Thus, we present an algorithm, which approximates, for a given input parameter \delta, an optimal solution for the MinEx problem\MinEx\MaxIn up to an additive approximation error \delta times the length of the input curves.
Revised:  Thus, we present an algorithm, which approximates, for a given input parameter \delta, an optimal solution for the MinEx problem\MinEx\MaxIn\ problems up to an additive approximation error \delta times the length of the input curves.
Edit intent: clarity
Original:  The resulting running time is upper bounded by O (\frac{n^3{\delta} \log (n{\delta} ))} \left({\delta} \log }\left({\delta} }\right)\right) , where n is the maximum complexity of the input polygonal curves .
Revised:  The resulting running time is upper bounded by O (\frac{n^3{\delta} \log (n{\delta} ))} \left({\delta} \log }\left({\delta} }\right)\right) , where n is the complexity of the input polygonal curves .
Edit intent: clarity
Original:  Our goal is to design efficient scheduling policies that can achieve provably good performance in terms of both throughput and delay, at a low complexity.
Revised:  Our goal is to design practical scheduling policies that can achieve provably good performance in terms of both throughput and delay, at a low complexity.
Edit intent: clarity
Original:  The simulation results show that our proposed greedy policies not only guarantee a near-optimal rate-function, but also empirically are virtually indistinguishable from the delay-optimal policy DWM .
Revised:  The simulation results show that our proposed greedy policies not only guarantee a near-optimal rate-function, but also empirically is virtually indistinguishable from the delay-optimal policy DWM .
Edit intent: fluency
Original:  The simulation results show that our proposed greedy policies not only guarantee a near-optimal rate-function, but also empirically are virtually indistinguishable from the delay-optimal policy DWM .
Revised:  The simulation results show that our proposed greedy policies not only guarantee a near-optimal rate-function, but also empirically are virtually indistinguishable from delay-optimal policy DWM .
Edit intent: fluency
Original:  We study the relationship between dynamics and computational capability in Random Boolean Networks ( RBNs ) for Reservoir Computing .
Revised:  We study the relationship between dynamics and computational capability in Random Boolean Networks ( RBN ) for Reservoir Computing .
Edit intent: clarity
Original: Reservoir Computing (RC)  is a computational paradigm in which a trained readout layer interprets the dynamics of an excitable component  called the reservoir , which is perturbed by external input.
Revised: Reservoir Computing (RC) . RC is a computational paradigm in which a trained readout layer interprets the dynamics of an excitable component called the reservoir , which is perturbed by external input.
Edit intent: fluency
Original: Reservoir Computing (RC)  is a computational paradigm in which a trained readout layer interprets the dynamics of an excitable component  called the reservoir , which is perturbed by external input.
Revised: Reservoir Computing (RC) is a computational paradigm in which a trained readout layer interprets the dynamics of an excitable component ( called the reservoir , which is perturbed by external input.
Edit intent: fluency
Original: Reservoir Computing (RC)  is a computational paradigm in which a trained readout layer interprets the dynamics of an excitable component  called the reservoir , which is perturbed by external input.
Revised: Reservoir Computing (RC) is a computational paradigm in which a trained readout layer interprets the dynamics of an excitable component called the reservoir ) that is perturbed by external input.
Edit intent: fluency
Original:  RBNs are a generic and heterogeneous dynamical system and here we use them as the reservoir.
Revised:  Random Boolean networks are generic and heterogeneous dynamical system and here we use them as the reservoir.
Edit intent: clarity
Original:  RBNs are a generic and heterogeneous dynamical system and here we use them as the reservoir.
Revised:  RBNs are a generic and heterogeneous dynamical systems and here we use them as the reservoir.
Edit intent: fluency
Original:  We measure an extended separation property and the fading memory of externally perturbed RBNs and show that the optimal balance of these measures are maximized at critical dynamics.
Revised:  We measure an extended separation property and the fading memory of inputs. We find the balance of these measures are maximized at critical dynamics.
Edit intent: clarity
Original:  These results are relevant to the construction of devices which exploit the intrinsic dynamics of complex , heterogeneous systems, such as biomolecular networks.
Revised:  These results are relevant to the construction of devices which exploit the intrinsic dynamics of complex heterogeneous systems, such as biomolecular networks.
Edit intent: fluency
Original: It is well-known (cf. K. -Pudlak ( 1989) ) that a polynomial time algorithm finding tautologies hard for a propositional proof system P exists iff P is not optimal.
Revised: It is well-known (cf. K. -Pudl\'ak 1989) ) that a polynomial time algorithm finding tautologies hard for a propositional proof system P exists iff P is not optimal.
Edit intent: coherence
Original: It is well-known (cf. K. -Pudlak ( 1989) ) that a polynomial time algorithm finding tautologies hard for a propositional proof system P exists iff P is not optimal.
Revised: It is well-known (cf. K. -Pudlak ( 1989) that a polynomial time algorithm finding tautologies hard for a propositional proof system P exists iff P is not optimal.
Edit intent: fluency
Original: The monotone duality problem is defined as follows: Given two monotone formulas f and g in nonredundant DNF, decide whether f and g are dual.
Revised: The monotone duality problem is defined as follows: Given two monotone formulas f and g in iredundant DNF, decide whether f and g are dual.
Edit intent: clarity
Original:  For example, it follows from our results that whenever for a Boolean-valued relation (whose attributes represent items), a number of maximal frequent item sets and a number of minimal infrequent item sets are known, then it can be decided in quadratic logspace whether there exist additional frequent or infrequent set .
Revised:  For example, it follows from our results that whenever for a Boolean-valued relation (whose attributes represent items), a number of maximal frequent itemsets and a number of minimal infrequent item sets are known, then it can be decided in quadratic logspace whether there exist additional frequent or infrequent set .
Edit intent: fluency
Original:  For example, it follows from our results that whenever for a Boolean-valued relation (whose attributes represent items), a number of maximal frequent item sets and a number of minimal infrequent item sets are known, then it can be decided in quadratic logspace whether there exist additional frequent or infrequent set .
Revised:  For example, it follows from our results that whenever for a Boolean-valued relation (whose attributes represent items), a number of maximal frequent item sets and a number of minimal infrequent itemsets are known, then it can be decided in quadratic logspace whether there exist additional frequent or infrequent set .
Edit intent: fluency
Original:  For example, it follows from our results that whenever for a Boolean-valued relation (whose attributes represent items), a number of maximal frequent item sets and a number of minimal infrequent item sets are known, then it can be decided in quadratic logspace whether there exist additional frequent or infrequent set .
Revised:  For example, it follows from our results that whenever for a Boolean-valued relation (whose attributes represent items), a number of maximal frequent item sets and a number of minimal infrequent item sets are known, then it can be decided in quadratic logspace whether there exist additional frequent or infrequent itemsets .
Edit intent: fluency
Original: We study connections between Natural Proofs, derandomization, and the problem of proving weak circuit lower bounds such as 'NEXPis not contained in TC^0' which are still wide open {\sf } \not{\sf  . Natural Proofs have three properties: they are constructive (an efficient algorithm ALG is embedded in them), have largeness ( ALG accepts a large fraction of strings), and are useful ( ALG rejects all strings which are truth tables of small circuits).
Revised: We study connections between Natural Proofs, derandomization, and the problem of proving ``weak'' circuit lower bounds such as 'NEXPis not contained in TC^0' which are still wide open {\sf } \not{\sf . Natural Proofs have three properties: they are constructive (an efficient algorithm ALG is embedded in them), have largeness ( ALG accepts a large fraction of strings), and are useful ( ALG rejects all strings which are truth tables of small circuits).
Edit intent: fluency
Original: We study connections between Natural Proofs, derandomization, and the problem of proving weak circuit lower bounds such as 'NEXPis not contained in TC^0' which are still wide open {\sf } \not{\sf  . Natural Proofs have three properties: they are constructive (an efficient algorithm ALG is embedded in them), have largeness ( ALG accepts a large fraction of strings), and are useful ( ALG rejects all strings which are truth tables of small circuits).
Revised: We study connections between Natural Proofs, derandomization, and the problem of proving weak circuit lower bounds such as {\sf } \not{\sf . Natural Proofs have three properties: they are constructive (an efficient algorithm ALG is embedded in them), have largeness ( ALG accepts a large fraction of strings), and are useful ( ALG rejects all strings which are truth tables of small circuits).
Edit intent: coherence
Original: We study connections between Natural Proofs, derandomization, and the problem of proving weak circuit lower bounds such as 'NEXPis not contained in TC^0' which are still wide open {\sf } \not{\sf  . Natural Proofs have three properties: they are constructive (an efficient algorithm ALG is embedded in them), have largeness ( ALG accepts a large fraction of strings), and are useful ( ALG rejects all strings which are truth tables of small circuits).
Revised: We study connections between Natural Proofs, derandomization, and the problem of proving weak circuit lower bounds such as 'NEXPis not contained in TC^0' which are still wide open {\sf NEXP} \not{\sf . Natural Proofs have three properties: they are constructive (an efficient algorithm ALG is embedded in them), have largeness ( ALG accepts a large fraction of strings), and are useful ( ALG rejects all strings which are truth tables of small circuits).
Edit intent: clarity