wanyu/IteraTeR_v2 huggingface dataset:
Original: In this paper, we prove that a constant fraction of boolean functions, f :  -1,1 ^n%DIFDELCMD < \to {%%%  -1,1 . They are in fact able to prove the conjecture for the family of d-part symmetric functions for constant d, the size of whose is 2^{O(n^d)}.
Revised: In this paper, we prove that a constant fraction of boolean functions, f : -1,1 %DIFDELCMD < \to {%%% -1,1 . They are in fact able to prove the conjecture for the family of d-part symmetric functions for constant d, the size of whose is 2^{O(n^d)}.
Edit intent: coherence
Original:  In particular, we show that sampling O(n\log n) elements according to probabilities derived from effective stiffnesses yields an high quality preconditioner that can be used to solve the linear system in a small number of iterations.
Revised:  In particular, we show that sampling O(n\log n) elements according to probabilities derived from effective stiffnesses yields a high quality preconditioner that can be used to solve the linear system in a small number of iterations.
Edit intent: fluency
Original:  Unlike SDD systems, which are relatively easy to precondition , there has been limited success in designing fast solvers for finite element systems, and previous algorithms usually target discretization of limited class of PDEs like scalar elliptic or 2D trusses.
Revised:  Unlike SDD systems, which are relatively easy to solve , there has been limited success in designing fast solvers for finite element systems, and previous algorithms usually target discretization of limited class of PDEs like scalar elliptic or 2D trusses.
Edit intent: clarity
Original: Let G be a graph cellularly embedded in a surface G . Given two closed walks c and d in G, we take advantage of the RAM model to describe linear time algorithms to decide if c and d are homotopic in S, either freely or with fixed basepoint.
Revised: Let G be a graph cellularly embedded in a surface S . Given two closed walks c and d in G, we take advantage of the RAM model to describe linear time algorithms to decide if c and d are homotopic in S, either freely or with fixed basepoint.
Edit intent: fluency
Original:  Those conditions which amount to the means of the summary statistics to asymptotically differ under both models are then usable in ABC settings to determine which summary statistics are appropriate, most generally via a standard  Monte Carlo validation.
Revised:  Those conditions which amount to the means of the summary statistics to asymptotically differ under both models are then usable in ABC settings to determine which summary statistics are appropriate, most generally via a standard and quick Monte Carlo validation.
Edit intent: clarity
Original: The choice of the summary statistics  in Bayesian inference and in particular in ABC algorithms is paramount to produce a valid outcome.
Revised: The choice of the summary statistics used in Bayesian inference and in particular in ABC algorithms is paramount to produce a valid outcome.
Edit intent: clarity
Original: The choice of the summary statistics  in Bayesian inference and in particular in ABC algorithms is paramount to produce a valid outcome.
Revised: The choice of the summary statistics in Bayesian inference and in particular in ABC algorithms has bearings on the validation of the resulting inference. Those statistics are nonetheless customarily used in ABC algorithms without consistency checks.
Edit intent: coherence
Original:  We derive necessary and sufficient conditions on those statistics for the corresponding Bayes factor to be convergent, namely to asymptotically select the true model.
Revised:  We derive necessary and sufficient conditions on summary statistics for the corresponding Bayes factor to be convergent, namely to asymptotically select the true model.
Edit intent: clarity
Original:  Those conditions  which amount to the means of the summary statistics to asymptotically differ under both models are then usable in ABC settings to determine which summary statistics are appropriate, most generally via a standard and quick Monte Carlo validation.
Revised:  Those conditions , which amount to the means of the summary statistics to asymptotically differ under both models are then usable in ABC settings to determine which summary statistics are appropriate, most generally via a standard and quick Monte Carlo validation.
Edit intent: fluency
Original:  Those conditions  which amount to the means of the summary statistics to asymptotically differ under both models are then usable in ABC settings to determine which summary statistics are appropriate, most generally via a standard and quick Monte Carlo validation.
Revised:  Those conditions which amount to the expectations of the summary statistics to asymptotically differ under both models are then usable in ABC settings to determine which summary statistics are appropriate, most generally via a standard and quick Monte Carlo validation.
Edit intent: clarity
Original:  Those conditions  which amount to the means of the summary statistics to asymptotically differ under both models are then usable in ABC settings to determine which summary statistics are appropriate, most generally via a standard and quick Monte Carlo validation.
Revised:  Those conditions which amount to the means of the summary statistics to asymptotically differ under both models , can be exploited in ABC settings to determine which summary statistics are appropriate, most generally via a standard and quick Monte Carlo validation.
Edit intent: clarity
Original:  Those conditions  which amount to the means of the summary statistics to asymptotically differ under both models are then usable in ABC settings to determine which summary statistics are appropriate, most generally via a standard and quick Monte Carlo validation.
Revised:  Those conditions which amount to the means of the summary statistics to asymptotically differ under both models are then usable in ABC settings to infer whether or not a choice of summary statistics is appropriate, via a Monte Carlo validation.
Edit intent: clarity
Original: We study the problem of wireless sensor network design by deploying a minimum number of additional relay nodes (to minimize network cost) at a subset of given potential relay locations, in order to convey the data from already existing sensor nodes (hereafter called source nodes) to a Base Station, while meeting a certain specified hop count bound (the hop count bound is chosen to ensure a pre-determined probability of the data being delivered to the BS within a given maximum delay).
Revised: We study the problem of wireless sensor network design by deploying a minimum number of additional relay nodes (to minimize network cost) at a subset of given potential relay locations, in order to convey the data from already existing sensor nodes (hereafter called source nodes) to a Base Station, while meeting a certain specified hop count bound (the hop count bound is chosen to ensure a pre-determined probability of the data being delivered to the BS within a given maximum delay).
Edit intent: fluency
Original:  Even beyond uniqueness  our interpolation provides useful explicit bounds on phi.
Revised:  Even beyond uniqueness regimes our interpolation provides useful explicit bounds on phi.
Edit intent: clarity
Original:  In the regimes in which we establish existence of the limit, we show that it coincides with the Bethe free energy functional evaluated at a suitable fixed point of the belief propagation  recursions on T.
Revised:  In the regimes in which we establish existence of the limit, we show that it coincides with the Bethe free energy functional evaluated at a suitable fixed point of the belief propagation (Bethe) recursions on T.
Edit intent: clarity
Original:  By way of example we compute phi for the independent set (or hard-core) model at low fugacity, for the ferromagnetic Ising model at all parameter values, and for the ferromagnetic Potts model with both weak enough and strong enough interactions.
Revised:  By way of example we compute \phi for the independent set (or hard-core) model at low fugacity, for the ferromagnetic Ising model at all parameter values, and for the ferromagnetic Potts model with both weak enough and strong enough interactions.
Edit intent: fluency
Original:  In the special case that T has a Galton-Watson law, this formula coincides with the non-rigorous "Bethe prediction" obtained by statistical physicists using the "replica" or "cavity" methods.
Revised:  In the special case that T has a Galton-Watson law, this formula coincides with the nonrigorous "Bethe prediction" obtained by statistical physicists using the "replica" or "cavity" methods.
Edit intent: fluency
Original: We construct a Prolog program using the Logic + Control principle of Kowalski.
Revised: We present a Prolog program using the Logic + Control principle of Kowalski.
Edit intent: clarity
Original: We present a Prolog program  (the SAT solver of Howe and King)  as a logic program with added control.
Revised: We present a Prolog program (the SAT solver of Howe and King) . The program is treated as a logic program with added control.
Edit intent: clarity
Original:  Keywords: logic programming, program correctness , program completeness, specification, declarative programming, declarative diagnosis.
Revised:  Keywords: logic programming, declarative programming , program completeness, specification, declarative programming, declarative diagnosis.
Edit intent: clarity
Original:  Keywords: logic programming, program correctness , program completeness, specification, declarative programming, declarative diagnosis.
Revised:  Keywords: logic programming, program correctness , program completeness, program correctness, specification, program transformation
Edit intent: clarity
Original:  Most of  reasoning about correctness and completeness can be done at the "logic" level, abstracting from any operational semantics.
Revised:  Most of the reasoning about correctness and completeness can be done at the "logic" level, abstracting from any operational semantics.
Edit intent: fluency
Original:  The example employs approximate specifications , they are crucial in simplifying reasoning about logic programs.
Revised:  The example employs approximate specifications ; they are crucial in simplifying reasoning about logic programs.
Edit intent: fluency
Original:  It also shows that the paradigm of semantics preserving program transformations may be not sufficient.
Revised:  It also shows that the paradigm of semantics-preserving program transformations may be not sufficient.
Edit intent: fluency
Original:  The proofs are declarative -- they do not refer to any operational semantics.
Revised:  The proofs are declarative - they do not refer to any operational semantics.
Edit intent: fluency
Original:  Most of the reasoning about correctness and completeness can be done at the "logic" level, abstracting from any operational semantics.
Revised:  Most of the proofs can be done at the "logic" level, abstracting from any operational semantics.
Edit intent: clarity
Original:  Keywords: logic programming, declarative programming, program completeness, program correctness, specification, program transformation, floundering, occur-check
Edit intent: clarity
Original:  Additionally, we prove termination, occur-check freeness and non-floundering.
Revised:  Additionally, we prove termination, occur-check freedom and non-floundering.
Edit intent: fluency
Original:  One of the key results of deterministic network calculus is that the end-to-end performance measures determined using a network service envelope is bounded by%DIFDELCMD < {\cal %%% O (H) , where H is the number of nodes traversed by a flow.
Revised:  %DIFDELCMD < {\cal %%% O (H) , where H is the number of nodes traversed by a flow.
Edit intent: coherence
Original:  One of the key results of deterministic network calculus is that the end-to-end performance measures determined using a network service envelope is bounded by%DIFDELCMD < {\cal %%% O (H) , where H is the number of nodes traversed by a flow.
Revised:  One of the key results of deterministic network calculus is that the end-to-end performance measures determined using a network service envelope is bounded by%DIFDELCMD < {\cal %%% (H) , where H is the number of nodes traversed by a flow.
Edit intent: clarity
Original:  The main contribution of this paper is to establish an end-to-end stochastic network calculus with the notion of effective bandwidth and effective capacity from large deviations theory which provides end-to-end delay and backlog bounds that grows linearly in the number of nodes (H) traversed by the arrival traffic, under relatively general assumptions .
Revised:  The main contribution of this paper is to establish an end-to-end stochastic network calculus with the notions of effective bandwidth and effective capacity from large deviations theory which provides end-to-end delay and backlog bounds that grows linearly in the number of nodes (H) traversed by the arrival traffic, under relatively general assumptions .
Edit intent: fluency
Original:  The main contribution of this paper is to establish an end-to-end stochastic network calculus with the notion of effective bandwidth and effective capacity from large deviations theory which provides end-to-end delay and backlog bounds that grows linearly in the number of nodes (H) traversed by the arrival traffic, under relatively general assumptions .
Revised:  The main contribution of this paper is to establish an end-to-end stochastic network calculus with the notion of effective bandwidth and effective capacity which provides efficient end-to-end delay and backlog bounds that grows linearly in the number of nodes (H) traversed by the arrival traffic, under relatively general assumptions .
Edit intent: clarity
Original:  The main contribution of this paper is to establish an end-to-end stochastic network calculus with the notion of effective bandwidth and effective capacity from large deviations theory which provides end-to-end delay and backlog bounds that grows linearly in the number of nodes (H) traversed by the arrival traffic, under relatively general assumptions .
Revised:  The main contribution of this paper is to establish an end-to-end stochastic network calculus with the notion of effective bandwidth and effective capacity from large deviations theory which provides end-to-end delay and backlog bounds that grows linearly in the number of nodes (H) traversed by the arrival traffic, under the assumption of independence .
Edit intent: clarity
Original: To lower the sampling rate in a spread spectrum communication system using Direct Sequence Spread Spectrum (DSSS), we show that compressive signal processing can be applied to demodulate the received signal.
Revised: We show that to lower the sampling rate in a spread spectrum communication system using Direct Sequence Spread Spectrum (DSSS), we show that compressive signal processing can be applied to demodulate the received signal.
Edit intent: fluency
Original: To lower the sampling rate in a spread spectrum communication system using Direct Sequence Spread Spectrum (DSSS), we show that compressive signal processing can be applied to demodulate the received signal.
Revised: To lower the sampling rate in a spread spectrum communication system using Direct Sequence Spread Spectrum (DSSS), compressive signal processing can be applied to demodulate the received signal.
Edit intent: coherence
Original:  Our theoretical work is exemplified with a numerical experiment using the IEEE 802.15.4 standard and the 2.4 GHz band specification.
Revised:  Our theoretical work is exemplified with a numerical experiment using the IEEE 802.15.4 standard 's 2.4 GHz band specification.
Edit intent: clarity
Original: Find the maximum clique is a know NP-Complete problem and it is also hard to approximate.
Revised: Finding the maximum clique is a know NP-Complete problem and it is also hard to approximate.
Edit intent: fluency
Original: Find the maximum clique is a know NP-Complete problem and it is also hard to approximate.
Revised: Find the maximum clique is a known NP-Complete problem and it is also hard to approximate.
Edit intent: fluency
Original:  This work propose an efficient algorithm to obtain it.
Revised:  This work proposes an efficient algorithm to obtain it.
Edit intent: fluency
Original:  If the presented theorem holds, this algorithm run in polynomial time in terms of the size of the graph.
Revised:  If the presented theorem holds, this algorithm runs in polynomial time in terms of the size of the graph.
Edit intent: fluency
Original:  Due to the complexity of adaptive networks dynamics we suggest to investigate each effect separately by developing simple models.
Revised:  Due to the complexity of adaptive networks dynamics we suggest to investigate each effect separately by developing models.
Edit intent: clarity
Original:  Thereby, our study not only opens up new directions for optimality in SOC but also applies to a much wider class of dynamical systems.
Revised:  Thereby, our study not only opens up new directions for optimality in SOC but also applies to a very wide class of dynamical systems.
Edit intent: clarity
Original: Recent studies have shown that adaptive networks driven by simple local rules can organize into "critical" global steady states, thereby providing another framework for self-organized criticality (SOC).
Revised: Recent studies have shown that adaptive networks driven by simple local rules can organize into "critical" global steady states, providing another framework for self-organized criticality (SOC).
Edit intent: coherence
Original:  We focus on the important convergence to criticality and demonstrate that noise and time-scale optimality are reached at finite values.
Revised:  We focus on the important convergence to criticality and show that noise and time-scale optimality are reached at finite values.
Edit intent: clarity
Original:  As a novel paradigm for adaptive networks SOC, we suggest to investigate each of the three new effects separately by developing models.
Revised:  We also investigate each of the three new effects separately by developing models.
Edit intent: clarity
Original:  Under these circumstances, the chemical inhibits the invasion of a moving front for the second species .
Revised:  It is shown asymptotically and numerically how the chemical inhibits the invasion of a moving front for the second species .
Edit intent: coherence
Original:  Experimental data have been collected for fifteen days from the popular torrent-discovery site - thepiratebay.org (more than 30  000 torrent were captured and analysed ).
Revised:  Experimental data have been collected for fifteen days from the popular torrent-discovery site thepiratebay.org (more than 30 000 torrent were captured and analysed ).
Edit intent: fluency
Original:  Experimental data have been collected for fifteen days from the popular torrent-discovery site - thepiratebay.org (more than 30  000 torrent were captured and analysed ).
Revised:  Experimental data have been collected for fifteen days from the popular torrent-discovery site - thepiratebay.org (more than 30 , 000 torrent were captured and analysed ).
Edit intent: fluency
Original:  Experimental data have been collected for fifteen days from the popular torrent-discovery site - thepiratebay.org (more than 30  000 torrent were captured and analysed ).
Revised:  Experimental data have been collected for fifteen days from the popular torrent-discovery site - thepiratebay.org (more than 30 000 torrents were captured and analysed ).
Edit intent: fluency
Original:  Experimental data have been collected for fifteen days from the popular torrent-discovery site - thepiratebay.org (more than 30  000 torrent were captured and analysed ).
Revised:  Experimental data have been collected for fifteen days from the popular torrent-discovery site - thepiratebay.org (more than 30 000 torrent were captured and analyzed ).
Edit intent: fluency
Original:  During this period the activity and logs of  unmodified version of %DIFDELCMD < \muTorrent %%%   client downloading sessions have been also captured.
Revised:  During this period the activity and logs of an unmodified version of %DIFDELCMD < \muTorrent %%% client downloading sessions have been also captured.
Edit intent: fluency
Original:  During this period the activity and logs of  unmodified version of %DIFDELCMD < \muTorrent %%%   client downloading sessions have been also captured.
Revised:  During this period the activity and logs of unmodified version of %DIFDELCMD < \muTorrent %%% client downloading sessions have also been captured.
Edit intent: fluency
Original:  The obtained experimental results are swarm-oriented (not tracker-oriented as it has been usually researched)and allow to look at BitTorrent and its users from the exchanged resources perspective.
Revised:  The obtained experimental results are swarm-oriented (not tracker-oriented as has been previously researched), which has allowed us to look at BitTorrent and its users from the exchanged resources perspective.
Edit intent: coherence
Original:  The obtained experimental results are swarm-oriented (not tracker-oriented as it has been usually researched)and allow to look at BitTorrent and its users from the exchanged resources perspective.
Revised:  The obtained experimental results are swarm-oriented (not tracker-oriented as it has been usually researched)and allow to look at BitTorrent and its users from an exchanged resources perspective.
Edit intent: fluency
Original:  To  authors' best knowledge, none of the previous studies have addressed these issues.
Revised:  To the authors' best knowledge, none of the previous studies have addressed these issues.
Edit intent: fluency
Original:  During this period the activity and logs of an unmodified version of {\mu}Torrent client downloading sessions have also been captured.
Revised:  During this period the activity and logs of an unmodified version of {\mu}Torrent client downloading sessions have been also captured.
Edit intent: fluency
Original: Backdoor sets, a notion introduced by Williams et al. in 2003, are certain sets of "key " variables of a CNF formula F that make it easy to solve the formula;
Revised: Backdoor sets, a notion introduced by Williams et al. in 2003, are certain sets of key variables of a CNF formula F that make it easy to solve the formula;
Edit intent: fluency
Original:  Result 1 is the the first positive one for base classes that do not have a characterization with obstructions of bounded size.
Revised:  Result 1 is the the first positive one for a base class that does not have a characterization with obstructions of bounded size.
Edit intent: fluency
Original: The near-perfect phylogeny over binary set of characters has been proposed as an extension of the too restrictive model of the perfect phylogeny in order to model biological events such as homoplasy.
Revised: The binary perfect phylogeny model is too restrictive to model biological events such as homoplasy.
Edit intent: clarity
Original:  In this paper we consider the problem of reconstructing a near-perfect phylogeny where only a type of homoplasy is allowed in the tree: we consider back mutations according to notion of%DIFDELCMD < {\em %%% persistency , that is characters can be gained and lost at most once.
Revised:  In this paper we consider the problem of reconstructing a %DIFDELCMD < {\em %%% persistency , that is characters can be gained and lost at most once.
Edit intent: coherence
Original:  In this paper we consider the problem of reconstructing a near-perfect phylogeny where only a type of homoplasy is allowed in the tree: we consider back mutations according to notion of%DIFDELCMD < {\em %%% persistency , that is characters can be gained and lost at most once.
Revised:  In this paper we consider the problem of reconstructing a near-perfect phylogeny where only a type of homoplasy is allowed in the tree: we consider back mutations according to notion of%DIFDELCMD < {\em %%% , that is characters can be gained and lost at most once.
Edit intent: clarity