wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our results  shows that, when the probability of adoption of a given mutation by a node of the evolutionary graph depends super-linearly on the frequency of the mutation in the neighborhood of the node , and the underlying evolutionary graph has a clustered structure, there is a non-negligible probability for species differentiation to occur.
Revised:  Our results shows that, when the probability of adoption of a given mutation by a node of the evolutionary graph depends super-linearly on the frequency of the mutation in the neighborhood of the node , and the underlying evolutionary graph exhibits a community structure, there is a non-negligible probability for species differentiation to occur.
Edit intent: clarity
Original:  Our results  shows that, when the probability of adoption of a given mutation by a node of the evolutionary graph depends super-linearly on the frequency of the mutation in the neighborhood of the node , and the underlying evolutionary graph has a clustered structure, there is a non-negligible probability for species differentiation to occur.
Revised:  Our results shows that, when the probability of adoption of a given mutation by a node of the evolutionary graph depends super-linearly on the frequency of the mutation in the neighborhood of the node , and the underlying evolutionary graph has a clustered structure, there is a non-negligible probability for to occur.
Edit intent: clarity
Original: A downlink single-input single-output (SISO) non-orthogonal multiple access (NOMA) system is considered where a base station (BS) is communicating with two legitimate users in the presence of an external eavesdropper.
Revised: A downlink single-input single-output non-orthogonal multiple access (NOMA) system is considered where a base station (BS) is communicating with two legitimate users in the presence of an external eavesdropper.
Edit intent: clarity
Original: A downlink single-input single-output (SISO) non-orthogonal multiple access (NOMA) system is considered where a base station (BS) is communicating with two legitimate users in the presence of an external eavesdropper.
Revised: A downlink single-input single-output (SISO) non-orthogonal multiple access system is considered where a base station (BS) is communicating with two legitimate users in the presence of an external eavesdropper.
Edit intent: clarity
Original: A downlink single-input single-output (SISO) non-orthogonal multiple access (NOMA) system is considered where a base station (BS) is communicating with two legitimate users in the presence of an external eavesdropper.
Revised: A downlink single-input single-output (SISO) non-orthogonal multiple access (NOMA) system is considered in which a base station (BS) is communicating with two legitimate users in the presence of an external eavesdropper.
Edit intent: clarity
Original:  A number of trusted cooperative half-duplex relay nodes, that are powered by the BS, are introduced to assist the BS's transmission.
Revised:  A group of trusted cooperative half-duplex relay nodes, that are powered by the BS, are introduced to assist the BS's transmission.
Edit intent: clarity
Original:  A number of trusted cooperative half-duplex relay nodes, that are powered by the BS, are introduced to assist the BS's transmission.
Revised:  A number of trusted cooperative half-duplex relay nodes, powered by the BS, are introduced to assist the BS's transmission.
Edit intent: coherence
Original:  A number of trusted cooperative half-duplex relay nodes, that are powered by the BS, are introduced to assist the BS's transmission.
Revised:  A number of trusted cooperative half-duplex relay nodes, that are powered by the BS, is employed to assist the BS's transmission.
Edit intent: clarity
Original:  Depending on the scheme, we carefully design a transmit beamforming signal at the relay nodes that either diminishes the eavesdropper's rate without affecting that of the legitimate users, or increases the legitimate users' rates without increasing that of the eavesdropper.
Revised:  Depending on the scheme, secure beamforming signals are carefully designed for the relay nodes that either diminishes the eavesdropper's rate without affecting that of the legitimate users, or increases the legitimate users' rates without increasing that of the eavesdropper.
Edit intent: clarity
Original:  Depending on the scheme, we carefully design a transmit beamforming signal at the relay nodes that either diminishes the eavesdropper's rate without affecting that of the legitimate users, or increases the legitimate users' rates without increasing that of the eavesdropper.
Revised:  Depending on the scheme, we carefully design a transmit beamforming signal at the relay nodes that either diminish the eavesdropper's rate without affecting that of the legitimate users, or increases the legitimate users' rates without increasing that of the eavesdropper.
Edit intent: fluency
Original:  Depending on the scheme, we carefully design a transmit beamforming signal at the relay nodes that either diminishes the eavesdropper's rate without affecting that of the legitimate users, or increases the legitimate users' rates without increasing that of the eavesdropper.
Revised:  Depending on the scheme, we carefully design a transmit beamforming signal at the relay nodes that either diminishes the eavesdropper's rate without affecting that of the legitimate users, or increase the legitimate users' rates without increasing that of the eavesdropper.
Edit intent: fluency
Original:  They also show that the relatively simple cooperative jamming scheme outperforms other schemes when the relays are far away from the BS and/or close to the eavesdropper.
Revised:  They also show that the relatively simple cooperative jamming scheme outperforms other schemes when the relays are far from the BS and/or close to the eavesdropper.
Edit intent: fluency
Original:  Our experimentsrevealed that the method is capable of drastically reducing the depth of deep learning CNNs , albeit at the cost of mild performance deterioration  .
Revised:  Our experimentsrevealed that the method is capable of drastically reducing the depth of deep learning neural networks , albeit at the cost of mild performance deterioration .
Edit intent: clarity
Original: The Euclidean k-center problem is a classical problem that has been extensively studied in many areas of computer science.
Revised: The Euclidean k-center problem is a classical problem that has been extensively studied in computer science.
Edit intent: clarity
Original:   We show that  there is no polynomial-time (\frac{3{2}-\varepsilon)-approximation algorithm for any \varepsilon~>~0 }  unless P=NP.
Revised:  We show that there is no polynomial-time (\frac{3{2}-\varepsilon)-approximation algorithm for any \varepsilon~>~0 } approximation scheme unless P=NP.
Edit intent: clarity
Original:  This bound even holds for one-dimensional curves under the continuous Fr\'echet distance , and is further improved to (3\sin(\pi{3)-\varepsilon) if the curves may lie in the plane and if the }  discrete Fr\'echet distance is used.
Revised:  This bound even holds for one-dimensional curves under the continuous Fr\'echet distance )-\varepsilon) if the curves may lie in the plane and if the } discrete Fr\'echet distance is used.
Edit intent: coherence
Original:  This bound even holds for one-dimensional curves under the continuous Fr\'echet distance , and is further improved to (3\sin(\pi{3)-\varepsilon) if the curves may lie in the plane and if the }  discrete Fr\'echet distance is used.
Revised:  This bound even holds for one-dimensional curves under the continuous Fr\'echet distance , and is further improved to (3\sin(\pi{3)-\varepsilon) if the curves may lie in the plane and if the } . In the case of the discrete Fr\'echet distance is used.
Edit intent: coherence
Original: The question of continuous-versus-discrete information representation in the brain is a fundamental yet unresolved physiological question.
Revised: The question of continuous-versus-discrete information representation in the brain is a fundamental yet unresolved question.
Edit intent: clarity
Original:  Historically, most analyses assume a continuous representation without considering the alternative possibility of a discrete representation .
Revised:  Historically, most analyses assume a continuous representation without considering the discrete alternative .
Edit intent: clarity
Original:  Our work explores the plausibility of both representations, and answers the question from a communications  engineering perspective.
Revised:  Our work explores the plausibility of both , answering the question from a communications engineering perspective.
Edit intent: clarity
Original:  Drawing on the well-established Shannon's communications theory, we posit that information in the brain is represented in a discrete form.
Revised:  Using Shannon's communications theory, we posit that information in the brain is represented in a discrete form.
Edit intent: clarity
Original:  Drawing on the well-established Shannon's communications theory, we posit that information in the brain is represented in a discrete form.
Revised:  Drawing on the well-established Shannon's communications theory, we posit that information in the brain is represented in discrete form.
Edit intent: fluency
Original:  Using a computer simulation, we show that information cannot be communicated reliably between neurons using a continuous representation , due to the presence of noise;
Revised:  Using a computer simulation, we show that information cannot be communicated and represented reliably in the brain using a continuous representation , due to the presence of noise;
Edit intent: clarity
Original:  Our system is based on GAP8, a novel parallel ultra-low-power computing platform, and deployed on a 27 g commercial, open-source CrazyFlie 2.0 nano-quadrotor.
Revised:  Our system is based on GAP8, a novel parallel ultra-low-power computing platform, and a 27 g commercial, open-source CrazyFlie 2.0 nano-quadrotor.
Edit intent: clarity
Original:  We discuss a methodology and software mapping tools that enable the SoA CNN presented in [1] to be fully executed on-board within a strict 12 fps real-time constraint with no compromise in terms of flight results, while all processing is done with only 94 mW on average - 1 \% of the power envelope of the deployed nano-aircraft.
Revised:  As part of our general methodology we discuss the software mapping techniques that enable the SoA CNN presented in [1] to be fully executed on-board within a strict 12 fps real-time constraint with no compromise in terms of flight results, while all processing is done with only 94 mW on average - 1 \% of the power envelope of the deployed nano-aircraft.
Edit intent: clarity
Original:  Our analysis is based on the assumption that the inverse mapping satisfies the Holder stability estimate locally.
Revised:  The basis of our analysis is based on the assumption that the inverse mapping satisfies the Holder stability estimate locally.
Edit intent: clarity
Original:  Our analysis is based on the assumption that the inverse mapping satisfies the Holder stability estimate locally.
Revised:  Our analysis is based on the assumption that the inverse mapping satisfies the H\"older stability estimate locally.
Edit intent: fluency
Original:  We obtain the convergence of the  iterates to the exact solution as well as two different convergence rates under different assumptions .
Revised:  Under certain assumptions, we show the convergence of the iterates to the exact solution as well as two different convergence rates under different assumptions .
Edit intent: clarity
Original:  We obtain the convergence of the  iterates to the exact solution as well as two different convergence rates under different assumptions .
Revised:  We obtain the convergence of the iterates to the exact solution . As a by-product, under two different conditions, two different convergence rates are obtained .
Edit intent: coherence
Original: In this paper, we discuss the local convergence of Iteratively regularized Landweber iteration method  for solving non-linear inverse problems in Banach spaces.
Revised: In this paper, the local convergence of Iteratively regularized Landweber iteration method for solving non-linear inverse problems in Banach spaces.
Edit intent: clarity
Original:  The basis of our analysis is based on the assumption that the inverse mapping satisfies the H\"older stability estimate locally.
Revised:  Our analysis mainly relies on the assumption that the inverse mapping satisfies the H\"older stability estimate locally.
Edit intent: clarity
Original:  The basis of our analysis is based on the assumption that the inverse mapping satisfies the H\"older stability estimate locally.
Revised:  The basis of our analysis is based on the assumption that the inverse mapping satisfies the Holder stability estimate locally.
Edit intent: fluency
Original:  Under certain assumptions, we show the convergence of the Iterative Landweber iterates to the exact solution  .
Revised:  The convergence of the Iterative Landweber iterates to the exact solution .
Edit intent: clarity
Original:  As a by-product, under two different conditions, two different convergence rates are obtained.
Revised:  As a by-product, under different conditions, two different convergence rates are obtained.
Edit intent: fluency
Original:  Our analysis mainly relies on the assumption that the inverse mapping satisfies the Holder stability estimate locally.
Revised:  Our analysis mainly relies on the assumption that the inverse mapping satisfies the H\"older stability estimate locally.
Edit intent: fluency
Original:  For this neural application,  sources providing incoherent pulses with 10,000 photons produced with efficiency of 10^{-3} operating at 20\,MHz at 4.2\,K are sufficient to enable a massively scalable neural computing platform with connectivity comparable to the brain and thirty thousand times higher speed.
Revised:  For this neural application, optical sources providing incoherent pulses with 10,000 photons produced with efficiency of 10^{-3} operating at 20\,MHz at 4.2\,K are sufficient to enable a massively scalable neural computing platform with connectivity comparable to the brain and thirty thousand times higher speed.
Edit intent: clarity
Original: As a kind of meta-data feature, annotations have been formally introduced into Java since Java 5. Since the introduction , annotations have been widely used by the Java community for different purposes, such as compiler guidance and runtime processing.
Revised: Annotations have been formally introduced into Java since Java 5. Since the introduction , annotations have been widely used by the Java community for different purposes, such as compiler guidance and runtime processing.
Edit intent: coherence
Original: As a kind of meta-data feature, annotations have been formally introduced into Java since Java 5. Since the introduction , annotations have been widely used by the Java community for different purposes, such as compiler guidance and runtime processing.
Revised: As a kind of meta-data feature, annotations have been formally introduced into Java since Java 5. Since then , annotations have been widely used by the Java community for different purposes, such as compiler guidance and runtime processing.
Edit intent: coherence
Original:  Despite the ever-growing use, there is still limited empirical evidence about how developers use annotations in practice and the impact of annotation use on software quality.
Revised:  Despite the ever-growing use, there is still limited empirical knowledge about the actual usage of annotations in practice and the impact of annotation use on software quality.
Edit intent: clarity
Original:  To fill this gap, we perform the first large-scale empirical study about Java annotation uses on 1,094  open-source projects hosted on GitHub.
Revised:  To fill this gap, we perform the first large-scale empirical study about Java annotations on 1,094 open-source projects hosted on GitHub.
Edit intent: clarity
Original: We present a new perspective on the analysis of stochastic local search algorithms , via linear algebra , and use it to establish a new criterion for their convergence.
Revised: We present a new perspective on the analysis of stochastic local search algorithms via linear algebra , and use it to establish a new criterion for their convergence.
Edit intent: fluency
Original:  Armed with this viewpoint we give a unified analysis of allentropy compression applications, connecting backtracking algorithms to the LLL in the same fashion that existing analyses connect resampling algorithmsto the LLL . We then give a new convergence condition that seamlessly handles resampling algorithms that can detect, and back away from , unfavorable parts of the state space .
Revised:  Armed with this viewpoint we give a unified analysis of all applications, connecting backtracking algorithms to the LLL in the same fashion that existing analyses connect resampling algorithmsto the LLL . We then give a new convergence condition that seamlessly handles resampling algorithms that can detect, and back away from , unfavorable parts of the state space .
Edit intent: clarity
Original:  Armed with this viewpoint we give a unified analysis of allentropy compression applications, connecting backtracking algorithms to the LLL in the same fashion that existing analyses connect resampling algorithmsto the LLL . We then give a new convergence condition that seamlessly handles resampling algorithms that can detect, and back away from , unfavorable parts of the state space .
Revised:  Armed with this viewpoint we give a unified analysis of allentropy compression applications, connecting backtracking algorithms to the LLL in the same fashion that existing analyses connect resampling algorithmsto the LLL . We then give a new convergence condition that seamlessly handles resampling , backtracking, and hybrid algorithms , unfavorable parts of the state space .
Edit intent: clarity
Original:  We give several applications of this condition, notably a new vertex coloring algorithm for arbitrary graphs that uses a number of colors that matches the algorithmic barrier for random graphs . Finally, we introduce a generalization of Kolmogorov's notion ofcommutative algorithms, cast as matrix commutativity, which affords much simpler proofs both of the original results and of recent extensions .
Revised:  We give several applications of this condition, notably a new vertex coloring algorithm commutative algorithms, cast as matrix commutativity, which affords much simpler proofs both of the original results and of recent extensions .
Edit intent: coherence
Original:  We give several applications of this condition, notably a new vertex coloring algorithm for arbitrary graphs that uses a number of colors that matches the algorithmic barrier for random graphs . Finally, we introduce a generalization of Kolmogorov's notion ofcommutative algorithms, cast as matrix commutativity, which affords much simpler proofs both of the original results and of recent extensions .
Revised:  We give several applications of this condition, notably a new vertex coloring algorithm for arbitrary graphs that uses a number of colors that matches the algorithmic barrier for random graphs . Finally, we introduce a generalization of Kolmogorov's notion of algorithms, cast as matrix commutativity, which affords much simpler proofs both of the original results and of recent extensions .
Edit intent: clarity
Original:  What is the minimum number of bridges (i.e. edges between nodes belonging to different social networks ) or central nodes (those who are endpoints to a bridge) required so that every two nodes are connected by a path of length at most k?
Revised:  What is the minimum number of bridges (i.e. edges between nodes belonging to different components ) or central nodes (those who are endpoints to a bridge) required so that every two nodes are connected by a path of length at most k?
Edit intent: clarity
Original:  What is the minimum number of bridges (i.e. edges between nodes belonging to different social networks ) or central nodes (those who are endpoints to a bridge) required so that every two nodes are connected by a path of length at most k?
Revised:  What is the minimum number of bridges (i.e. edges between nodes belonging to different social networks ) or central nodes (those which are endpoints to a bridge) required so that every two nodes are connected by a path of length at most k?
Edit intent: fluency
Original:  What is the minimum number of bridges (i.e. edges between nodes belonging to different social networks ) or central nodes (those who are endpoints to a bridge) required so that every two nodes are connected by a path of length at most k?
Revised:  What is the minimum number of bridges (i.e. edges between nodes belonging to different social networks ) or central nodes (those who are endpoints to a bridge) required to ensure k-integration.
Edit intent: clarity
Original:  The answer depends only linearly on the size of the social networks for k=2, and does not depend on the size of each social network for k \geq 3.
Revised:  The answer depends only linearly on the size of the social networks for k=2, and does not depend on the size of each component for k \geq 3.
Edit intent: clarity
Original:  Our findings provide an equality of opportunity measure for social networks which is easy to compute and verify, and which can be used to compare the degree of integration of a variety of real-life social networks.
Revised:  Our findings provide a simple and intuitive way to compare the degree of integration of a variety of real-life social networks.
Edit intent: clarity
Original:  Our findings provide an equality of opportunity measure for social networks which is easy to compute and verify, and which can be used to compare the degree of integration of a variety of real-life social networks.
Revised:  Our findings provide an equality of opportunity measure for social networks which is easy to compute and verify, and which can be used to compare the equality of opportunity of real-life social networks.
Edit intent: clarity
Original:  We obtain these improvements based on linear-size shallow cuttings , which are a standard technique to deal with the k nearest neighbor problem for point sites in the Euclidean metric.
Revised:  We obtain these improvements based on linear-size shallow cuttings , which are a standard technique to deal with the k nearest neighbors problem for point sites in the Euclidean metric.
Edit intent: fluency
Original:  Kaplan et al. has generalized shallow cuttings to general distance functions, but the size of their version has an extra double logarithmic factor.
Revised:  Kaplan et al. has generalized shallow cuttings to general distance functions, but the size of their shallow cuttings has an extra double logarithmic factor.
Edit intent: clarity
Original: We study the complexity of counting the (induced) occurrences of a k-node pattern graph  in an n-node graph  , parameterized by the degeneracy d of the latter.
Revised: We study the complexity of counting the copies of a k-node pattern graph in an n-node graph , parameterized by the degeneracy d of the latter.
Edit intent: clarity
Original:  These two notions capture the parameterized complexity of counting H: we give a dynamic programming algorithm based on the piece decomposition that counts the occurrences of H in time f(d,k) \cdot O(n^{ \,p (H)}) , and prove that unless the Exponential Time Hypothesis fails, no algorithm exists with running time f(d,k) \cdot n^{o(p(H)/p(H)) (H) we obtain novel complexity bounds.
Revised:  These two notions capture the parameterized complexity of counting H: we give a dynamic programming algorithm based on the piece decomposition that counts the occurrences of H in time f(d,k) \cdot O(n^{ s (H)}) , and prove that unless the Exponential Time Hypothesis fails, no algorithm exists with running time f(d,k) \cdot n^{o(p(H)/p(H)) (H) we obtain novel complexity bounds.
Edit intent: clarity