wanyu/IteraTeR_v2 huggingface dataset:
Original:  Here we analyze GAA's cracking scheme and show that in the cable loss free case it serves less eavesdropping information than the old mean-square based attack , while in the loss-dominated case ] it offers no information  .
Revised:  Here we analyze GAA's cracking scheme and show that in the cable loss free case it serves less eavesdropping information than the old mean-square based attack , while in the loss-dominated case ], while it offers no information .
Edit intent: coherence
Original:  We also investigate GAA's experimental claim to be  capable of distinguishing , with a poor statistics over a few correlation times , the distributions of two Gaussian noises with a relative variance difference of less than 10^-8.
Revised:  We also investigate GAA's claim to be capable of distinguishing , with a poor statistics over a few correlation times , the distributions of two Gaussian noises with a relative variance difference of less than 10^-8.
Edit intent: clarity
Original:  We also investigate GAA's experimental claim to be  capable of distinguishing , with a poor statistics over a few correlation times , the distributions of two Gaussian noises with a relative variance difference of less than 10^-8.
Revised:  We also investigate GAA's experimental claim to be capable of distinguishing - using statistics over a few correlation times , the distributions of two Gaussian noises with a relative variance difference of less than 10^-8.
Edit intent: clarity
Original:  We identify several experimental artifacts due to poor design that can lead to GAA's assertions ;
Revised:  We identify several experimental artifacts due to poor design that can lead to GAA's assertions :
Edit intent: fluency
Original:  deterministic currents due to spurious harmonic components ground loop , DC offset ;
Revised:  deterministic currents due to spurious harmonic components caused by ground loops , DC offset ;
Edit intent: clarity
Original:  aliasing; non-Gaussian features including non-linearities and other non-idealities in the generators;
Revised:  aliasing; non-Gaussian features including non-linearities and other non-idealities in generators,
Edit intent: fluency
Original:  and the time-derivative nature of their scheme enhancing all these aspects .
Revised:  and the time-derivative nature of GAA's scheme which tends to enhance all of these artifacts .
Edit intent: clarity
Original: In order to gain an understanding of the effectiveness of phylogenetic Markov chain Monte Carlo (MCMC), it is important to understand how quickly the empirical distribution of the MCMC converges to the true posterior distribution.
Revised: In order to gain an understanding of the effectiveness of phylogenetic Markov chain Monte Carlo (MCMC), it is important to understand how quickly the empirical distribution of the MCMC converges to the posterior distribution.
Edit intent: clarity
Original:  In this paper we investigate this problem on phylogenetic tree topologies with a metric that is especially well suited to the task: the subtree-prune-regraft (SPR) metric.
Revised:  In this paper we investigate this problem on phylogenetic tree topologies with a metric that is especially well suited to the task: the subtree prune-and-regraft (SPR) metric.
Edit intent: fluency
Original:  We use a novel graph-based approach to analyze tree space and find that the SPR metric is much more informative than simpler metrics that are unrelated to MCMC moves.
Revised:  We develop a novel graph-based approach to analyze tree space and find that the SPR metric is much more informative than simpler metrics that are unrelated to MCMC moves.
Edit intent: clarity
Original:  In doing so we show conclusively that topological peaks do occur in real Bayesian phylogenetic posteriors  with standard MCMC moves , investigate the efficiency of Metropolis-coupled MCMC (MCMCMC) in traversing the valleys between peaks, and show that conditional clade probability (CCP ) can have systematic problems when there are multiple peaks.
Revised:  In doing so we show conclusively that topological peaks do occur in Bayesian phylogenetic posteriors with standard MCMC moves , investigate the efficiency of Metropolis-coupled MCMC (MCMCMC) in traversing the valleys between peaks, and show that conditional clade probability (CCP ) can have systematic problems when there are multiple peaks.
Edit intent: clarity
Original:  In doing so we show conclusively that topological peaks do occur in real Bayesian phylogenetic posteriors  with standard MCMC moves , investigate the efficiency of Metropolis-coupled MCMC (MCMCMC) in traversing the valleys between peaks, and show that conditional clade probability (CCP ) can have systematic problems when there are multiple peaks.
Revised:  In doing so we show conclusively that topological peaks do occur in real Bayesian phylogenetic posteriors with standard MCMC approaches , investigate the efficiency of Metropolis-coupled MCMC (MCMCMC) in traversing the valleys between peaks, and show that conditional clade probability (CCP ) can have systematic problems when there are multiple peaks.
Edit intent: clarity
Original:  In order to reduce the chaotic behaviour and to attain stability in the gene regulatory network, nested canalizing functions (NCFs) are best suited.
Revised:  In order to reduce the chaotic behaviour and to attain stability in the gene regulatory network, nested Canalizing Functions (NCFs) are best suited.
Edit intent: fluency
Original:  In this paper, on using Karnaugh Map this problem is solved and also it has been shown that when the canalizing functions on n variable is given, all the canalizing functions of n+1 variable could be generated by the method of concatenation.
Revised:  In this paper, by using Karnaugh Map this problem is solved and also it has been shown that when the canalizing functions on n variable is given, all the canalizing functions of n+1 variable could be generated by the method of concatenation.
Edit intent: coherence
Original:  In this paper, on using Karnaugh Map this problem is solved and also it has been shown that when the canalizing functions on n variable is given, all the canalizing functions of n+1 variable could be generated by the method of concatenation.
Revised:  In this paper, on using Karnaugh Map this problem is solved and also it has been shown that when the canalizing functions of variable is given, all the canalizing functions of n+1 variable could be generated by the method of concatenation.
Edit intent: clarity
Original:  In this paper, on using Karnaugh Map this problem is solved and also it has been shown that when the canalizing functions on n variable is given, all the canalizing functions of n+1 variable could be generated by the method of concatenation.
Revised:  In this paper, on using Karnaugh Map this problem is solved and also it has been shown that when the canalizing functions on n variable is given, all the canalizing functions of variable could be generated by the method of concatenation.
Edit intent: clarity
Original:  In this paper we have uniquely identified the number of NCFs having a particular Hamming distance (H.D) generated by each variable x_{i as starting canalizing input.
Revised:  In this paper we have uniquely identified the number of NCFs having a particular Hamming Distance (H.D) generated by each variable x_{i as starting canalizing input.
Edit intent: fluency
Original:  In this paper we have uniquely identified the number of NCFs having a particular Hamming distance (H.D) generated by each variable x_{i as starting canalizing input.
Revised:  In this paper we have uniquely identified the number of NCFs having a particular Hamming distance (H.D) generated by each variable as starting canalizing input.
Edit intent: clarity
Original:  Partially NCFs of 4 variable has also been studied in this paper.
Revised:  Partially NCFs of 4 variables has also been studied in this paper.
Edit intent: fluency
Original: Any organism is embedded in an environment (specifying for example the concentrations of basic nutrients) that changes over time.
Revised: Any organism is embedded in an environment that changes over time.
Edit intent: coherence
Original:  The timescale for and statistics of environmental change, the precision with which the organism can detect its environment, and the costs and benefits of particular protein expression levels all will affect the suitability of different strategies (such as constitutive expression or graded response) for regulating protein levels in response to environmental inputs.
Revised:  The timescale for and statistics of environmental change, the precision with which the organism can detect its environment, and the costs and benefits of particular protein expression levels all will affect the suitability of different strategies-such as constitutive expression or graded response) for regulating protein levels in response to environmental inputs.
Edit intent: fluency
Original:  The timescale for and statistics of environmental change, the precision with which the organism can detect its environment, and the costs and benefits of particular protein expression levels all will affect the suitability of different strategies (such as constitutive expression or graded response) for regulating protein levels in response to environmental inputs.
Revised:  The timescale for and statistics of environmental change, the precision with which the organism can detect its environment, and the costs and benefits of particular protein expression levels all will affect the suitability of different strategies (such as constitutive expression or graded response-for regulating protein levels in response to environmental inputs.
Edit intent: fluency
Original:  (ii) when there is a fitness advantage to implementing Bayesian inference ;
Revised:  (ii) when there is a fitness advantage to implementing a Bayesian decision rule ;
Edit intent: clarity
Original:  (ii) intermediate levels of measurement uncertainty call for sophisticated Bayesian inference ;
Revised:  (ii) intermediate levels of measurement uncertainty call for a sophisticated Bayesian decision rule ;
Edit intent: clarity
Original:  and (iii) in dynamical contexts, intermediate levels of uncertainty call for retaining memory of the past.
Revised:  and (iii) in dynamic contexts, intermediate levels of uncertainty call for retaining memory of the past.
Edit intent: fluency
Original:  Further, the distribution of triangles over nodes of the system evolved from mixed connections show negative correlation with its degree providing insight into origin of this trend observed in realistic interaction patterns .
Revised:  Further, the distribution of triads over nodes of the system evolved from mixed connections show negative correlation with its degree providing insight into origin of this trend observed in realistic interaction patterns .
Edit intent: fluency
Original:  Further, the distribution of triangles over nodes of the system evolved from mixed connections show negative correlation with its degree providing insight into origin of this trend observed in realistic interaction patterns .
Revised:  Further, the distribution of triangles over nodes of the network evolved from mixed connections show negative correlation with its degree providing insight into origin of this trend observed in realistic interaction patterns .
Edit intent: clarity
Original:  Further, the distribution of triangles over nodes of the system evolved from mixed connections show negative correlation with its degree providing insight into origin of this trend observed in realistic interaction patterns .
Revised:  Further, the distribution of triangles over nodes of the system evolved from mixed connections exhibits a negative correlation with its degree providing insight into origin of this trend observed in realistic interaction patterns .
Edit intent: fluency
Original:  Further, the distribution of triangles over nodes of the system evolved from mixed connections show negative correlation with its degree providing insight into origin of this trend observed in realistic interaction patterns .
Revised:  Further, the distribution of triangles over nodes of the system evolved from mixed connections show negative correlation with its degree providing insight into origin of this trend observed in real networks .
Edit intent: clarity
Original:  In these problems, one asks to distinguish all vertices of a graph using a subset of the vertices and either the neighborhood within the solution set or the distances to the solution vertices.
Revised:  In these problems, one asks to distinguish all vertices of a graph by a subset of the vertices and either the neighborhood within the solution set or the distances to the solution vertices.
Edit intent: fluency
Original:  In these problems, one asks to distinguish all vertices of a graph using a subset of the vertices and either the neighborhood within the solution set or the distances to the solution vertices.
Revised:  In these problems, one asks to distinguish all vertices of a graph using a subset of the vertices , using either the neighbourhood within the solution set or the distances to the solution vertices.
Edit intent: coherence
Original:  Using a general reduction for this class of problems, we prove that the decision problems associated to these four notions are NP-complete, even for graphs that are at the same time interval graphs and permutation graphs and have diameter ~ 2. On the other hand, we describe linear-time algorithms for cographs.
Revised:  Using a general reduction for this class of problems, we prove that the decision problems associated to these four notions are NP-complete, even for graphs that are at the same time interval graphs and permutation graphs and have diameter 2. On the other hand, we describe linear-time algorithms for cographs.
Edit intent: clarity
Original:  Using a general reduction for this class of problems, we prove that the decision problems associated to these four notions are NP-complete, even for graphs that are at the same time interval graphs and permutation graphs and have diameter 2.
Revised:  Using a general reduction for this class of problems, we prove that the decision problems associated to these four notions are NP-complete, even for interval graphs of diameter 2 and permutation graphs and have diameter 2.
Edit intent: clarity
Original:  Using a general reduction for this class of problems, we prove that the decision problems associated to these four notions are NP-complete, even for graphs that are at the same time interval graphs and permutation graphs and have diameter 2.
Revised:  Using a general reduction for this class of problems, we prove that the decision problems associated to these four notions are NP-complete, even for graphs that are at the same time interval graphs and permutation graphs of diameter 2.
Edit intent: clarity
Original: A  graph problem Q is a vertex-subset problem if feasible solutions for Q consist of subsets of the vertices of a graph G . The reconfiguration version of a vertex subset problem Q asks whether it is possible to transform one feasible solution for Q into another in exactly \ell steps,
Revised: A vertex-subset graph problem Q is a vertex-subset problem if feasible solutions for Q consist of subsets of the vertices of a graph G . The reconfiguration version of a vertex subset problem Q asks whether it is possible to transform one feasible solution for Q into another in exactly \ell steps,
Edit intent: fluency
Original: A  graph problem Q is a vertex-subset problem if feasible solutions for Q consist of subsets of the vertices of a graph G . The reconfiguration version of a vertex subset problem Q asks whether it is possible to transform one feasible solution for Q into another in exactly \ell steps,
Revised: A graph problem Q is a vertex-subset problem if feasible solutions for Q consist of subsets of the vertices of a graph G . The reconfiguration version of a vertex-subset problem Q asks whether it is possible to transform one feasible solution for Q into another in exactly \ell steps,
Edit intent: fluency
Original: A  graph problem Q is a vertex-subset problem if feasible solutions for Q consist of subsets of the vertices of a graph G . The reconfiguration version of a vertex subset problem Q asks whether it is possible to transform one feasible solution for Q into another in exactly \ell steps,
Revised: A graph problem Q is a vertex-subset problem if feasible solutions for Q consist of subsets of the vertices of a graph G . The reconfiguration version of a vertex subset problem Q asks whether it is possible to transform one feasible solution for Q into another in at most \ell steps,
Edit intent: clarity
Original:  where each feasible solution is a subset of vertices of size bounded by k, each step is a vertex addition or deletion, and each intermediate set is also a feasible solution for Q  . Motivated by recent results establishing W[1]-hardness of the reconfiguration versions of most vertex-subset problems parameterized by \ell, we investigate the complexity of such problems restricted to \mathscr{C .
Revised:  where each step is a vertex addition or deletion, and each intermediate set is also a feasible solution for Q . Motivated by recent results establishing W[1]-hardness of the reconfiguration versions of most vertex-subset problems parameterized by \ell, we investigate the complexity of such problems restricted to \mathscr{C .
Edit intent: clarity
Original:  where each feasible solution is a subset of vertices of size bounded by k, each step is a vertex addition or deletion, and each intermediate set is also a feasible solution for Q  . Motivated by recent results establishing W[1]-hardness of the reconfiguration versions of most vertex-subset problems parameterized by \ell, we investigate the complexity of such problems restricted to \mathscr{C .
Revised:  where each feasible solution is a subset of vertices of size bounded by k, each step is a vertex addition or deletion, and each intermediate set is also a feasible solution for Q of size bounded by k . Motivated by recent results establishing W[1]-hardness of the reconfiguration versions of most vertex-subset problems parameterized by \ell, we investigate the complexity of such problems restricted to \mathscr{C .
Edit intent: clarity
Original:  To prove the latter result, we introduce a useful technique which allows us to circumvent cardinality constraints and define reconfiguration problems in monadic second order logic .
Revised:  To prove the latter result, we introduce a technique which allows us to circumvent cardinality constraints and define reconfiguration problems in monadic second order logic .
Edit intent: clarity
Original: We apply classical quartet techniques to the problem of phylogenetic decisiveness and find a value k such that all compatible quartet systems with at least k quartets are decisive.
Revised: We apply classical quartet techniques to the problem of phylogenetic decisiveness and find a value k such that all collections of at least k quartets are decisive.
Edit intent: clarity
Original:  Moreover, we prove that this bound is optimal and give a lower-bound on the probability that a compatible collection of quartets is decisive.
Revised:  Moreover, we prove that this bound is optimal and give a lower-bound on the probability that a collection of quartets is decisive.
Edit intent: clarity
Original: To appear in Theory and Practice of Logic Programming (TPLP)  Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions.
Revised: To appear in Theory and Practice of Logic Programming (TPLP) . Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions.
Edit intent: fluency
Original: Content-Centric Networking (CCN) is a communications paradigm that emphasizes content distribution.
Revised: Content-Centric Networking (CCN) is a communication paradigm that emphasizes content distribution.
Edit intent: fluency
Original:  NDN supports human-readable content naming and router-based content caching which lends itself to efficient, secure  and scalable content distribution.
Revised:  NDN supports human-readable content naming and router-based content caching which lends itself to efficient, secure , and scalable content distribution.
Edit intent: fluency
Original:  The alternative of hop-by-hop reassembly is problematic due to the substantial incurred delay .
Revised:  The alternative is to perform hop-by-hop reassembly is problematic due to the substantial incurred delay .
Edit intent: clarity
Original:  The alternative of hop-by-hop reassembly is problematic due to the substantial incurred delay .
Revised:  The alternative of hop-by-hop reassembly, which incurs prohibitive delays .
Edit intent: clarity
Original:  In this paper, we show that secure and efficient content fragmentation is both possible and even advantageous in NDN and similar information-centric architectures that involve signed content.
Revised:  In this paper, we show that secure and efficient content fragmentation is both possible and even advantageous in NDN and similar content-centric network architectures that involve signed content.
Edit intent: clarity
Original:  Multicell cooperation techniques, such as coordinated multipoint (CoMP) transmission, have been proposed as a promising solution to mitigate the impact of the cross-tier interference in multi-tier networks.
Revised:  Multicell cooperation techniques, such as coordinated multipoint (CoMP) transmission, have been proposed as a promising solution to mitigate the impact of the cross-tier interference in multi-tier networks.
Edit intent: fluency
Original:  In this paper, we propose a novel scheme for L ocation-A wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Revised:  In this paper, we propose a novel scheme for ocation-A wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Edit intent: fluency
Original:  In this paper, we propose a novel scheme for L ocation-A wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Revised:  In this paper, we propose a novel scheme for L A wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Edit intent: fluency
Original:  In this paper, we propose a novel scheme for L ocation-A wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Revised:  In this paper, we propose a novel scheme for L ocation- wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Edit intent: fluency
Original:  In this paper, we propose a novel scheme for L ocation-A wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Revised:  In this paper, we propose a novel scheme for L ocation-A C ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Edit intent: fluency
Original:  In this paper, we propose a novel scheme for L ocation-A wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Revised:  In this paper, we propose a novel scheme for L ocation-A ware ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Edit intent: fluency
Original:  In this paper, we propose a novel scheme for L ocation-A wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Revised:  In this paper, we propose a novel scheme for L ocation-A wareC T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Edit intent: fluency