wanyu/IteraTeR_v2 huggingface dataset:
Original:  In recent years they have been exploited to design efficient strategies to explore a network, for instance by constructing maximally mixing trajectories or by sampling homogeneously the nodes.
Revised:  In recent years they have been exploited to design efficient strategies to explore a network, for instance by constructing maximally mixing trajectories or by allowing an almost uniform sampling of the nodes.
Edit intent: clarity
Original:  In multiplex networks,  the nodes are related through different types of links (layersor communication channels), and the presence of connections at different layers multiplies the number of possible paths in the graph.
Revised:  In multiplex networks, graphs where the nodes are related through different types of links (layersor communication channels), and the presence of connections at different layers multiplies the number of possible paths in the graph.
Edit intent: clarity
Original:  We focus on degree-biased  walks and distinguish between two subclasses of random walks: extensive biased walks consider the properties of each node separately at each layer, intensive biased walks deal instead with intrinsically multiplex variables.
Revised:  We focus on degree-biased random walks and distinguish between two subclasses of random walks: extensive biased walks consider the properties of each node separately at each layer, intensive biased walks deal instead with intrinsically multiplex variables.
Edit intent: fluency
Original:  In this paper (Part I) , we present a family of architectures for hardware polar decoders using a reduced-complexity successive-cancellation decoding algorithm  .
Revised:  In this paper (Part I) , we present a family of architectures for polar decoders using a reduced-complexity successive-cancellation decoding algorithm .
Edit intent: clarity
Original:  Prominent examples of such networks include online encyclopedias such as Wikipedia or (Semantic) MediaWikis, Question and Answering portals such as StackOverflow, and many others.
Revised:  Prominent examples include online encyclopedias such as Wikipedia or (Semantic) MediaWikis, Question and Answering portals such as StackOverflow, and many others.
Edit intent: clarity
Original:  Prominent examples of such networks include online encyclopedias such as Wikipedia or (Semantic) MediaWikis, Question and Answering portals such as StackOverflow, and many others.
Revised:  Prominent examples of such networks include online encyclopedias such as (Semantic) MediaWikis, Question and Answering portals such as StackOverflow, and many others.
Edit intent: coherence
Original:  Only a small fraction of these systems manage to reach self-sustainable activity, a level of activity that prevents the system from reverting to a non-active state.
Revised:  Only a small fraction of these systems manage to reach self-sustaining activity, a level of activity that prevents the system from reverting to a non-active state.
Edit intent: fluency
Original:  We then provide illustrative examples of empirical datasets and characterize the barrier that has to be breached for a system before it can become self-sustaining in terms of critical mass and activity dynamics.
Revised:  We then provide illustrative examples of empirical datasets and characterize the barrier that has to be breached by a system before it can become self-sustaining in terms of critical mass and activity dynamics.
Edit intent: clarity
Original:  Additionally, we expand on this empirical illustration and introduce a new metric p---the Activity Momentum---to assess the activity robustness of a collaboration network .
Revised:  Additionally, we expand on this empirical illustration and introduce a new metric p---the Activity Momentum---to assess the activity robustness of collaboration networks .
Edit intent: fluency
Original:  It is shown that the approximation to a convex function by its Lupas (p,q)-Bernstein polynomials is one sided.
Edit intent: coherence
Original:  In Comparison to q-Bezier curves and surfaces based on Phillips q-Bernstein polynomials, our generalizations show more exibility in choosing the value of p, q and superiority in shape control of curves and surfaces.
Revised:  In Comparison to q-Bezier curves and surfaces based on Phillips q-Bernstein polynomials, our generalizations show more flexibility in choosing the value of p, q and superiority in shape control of curves and surfaces.
Edit intent: clarity
Original:  We get q-B?ezier curve when we set the parameter p to the value 1: We also introduce a de Casteljau algorithm for Lupas type (p,q)-Bernstein Bezier curves.
Revised:  We get q-Bezier curve when we set the parameter p to the value 1: We also introduce a de Casteljau algorithm for Lupas type (p,q)-Bernstein Bezier curves.
Edit intent: fluency
Original:  We study the nature of degree elevation and degree reduction for Lupas (p,q) -Bezier  Bernstein functions.
Revised:  We study the nature of degree elevation and degree reduction for Lupa\c{s (p,q) -Bezier Bernstein functions.
Edit intent: fluency
Original:  We study the nature of degree elevation and degree reduction for Lupas (p,q) -Bezier  Bernstein functions.
Revised:  We study the nature of degree elevation and degree reduction for Lupas (p,q) -B Bernstein functions.
Edit intent: clarity
Original:  We get q-Bezier curve when we set the parameter p to the value 1: We also introduce a de Casteljau algorithm for Lupas type (p,q)-Bernstein Bezier\acute{e} curves.
Revised:  We get q-Bezier curve when we set the parameter p to the value 1: We also introduce a de Casteljau algorithm for Lupa\c{s type (p,q)-Bernstein Bezier\acute{e} curves.
Edit intent: fluency
Original:  We get q-Bezier curve when we set the parameter p to the value 1: We also introduce a de Casteljau algorithm for Lupas type (p,q)-Bernstein Bezier\acute{e} curves.
Revised:  We get q-Bezier curve when we set the parameter p to the value 1: We also introduce a de Casteljau algorithm for Lupas type (p,q)-Bernstein B\acute{e} curves.
Edit intent: clarity
Original:  We get q-Bezier curve when we set the parameter p to the value 1: We also introduce a de Casteljau algorithm for Lupas type (p,q)-Bernstein Bezier\acute{e} curves.
Revised:  We get q-Bezier curve when we set the parameter p to the value 1: We also introduce a de Casteljau algorithm for Lupas type (p,q)-Bernstein Bezier\acute{e}zier curves.
Edit intent: clarity
Original:  Furthermore, some fundamental properties for Lupas type (p,q)-Bernstein Bezier curves\acute{e} are discussed.
Revised:  Furthermore, some fundamental properties for Lupa\c{s type (p,q)-Bernstein Bezier curves\acute{e} are discussed.
Edit intent: clarity
Original:  We get q-Bezier curves and\acute{e} surfaces for (u, v) \in [0, 1] \times [0, 1] when we set the parameter p1 = p2 =1.
Revised:  We get q-B\acute{e} surfaces for (u, v) \in [0, 1] \times [0, 1] when we set the parameter p1 = p2 =1.
Edit intent: clarity
Original:  We get q-Bezier curves and\acute{e} surfaces for (u, v) \in [0, 1] \times [0, 1] when we set the parameter p1 = p2 =1.
Revised:  We get q-Bezier curves and\acute{e} surfaces for (u, v) \in [0, 1] \times [0, 1] when we set the parameter p_1 = p2 =1.
Edit intent: clarity
Original:  We get q-Bezier curves and\acute{e} surfaces for (u, v) \in [0, 1] \times [0, 1] when we set the parameter p1 = p2 =1.
Revised:  We get q-Bezier curves and\acute{e} surfaces for (u, v) \in [0, 1] \times [0, 1] when we set the parameter p1 = p_2 =1.
Edit intent: clarity
Original:  In Comparison to q-Bezier\acute{e} curves and surfaces based on Phillips q-Bernstein polynomials, our generalizations show more flexibility in choosing the value of p1;
Revised:  In comparison to q-B\acute{e} curves and surfaces based on Phillips q-Bernstein polynomials, our generalizations show more flexibility in choosing the value of p1;
Edit intent: clarity
Original:  In Comparison to q-Bezier\acute{e} curves and surfaces based on Phillips q-Bernstein polynomials, our generalizations show more flexibility in choosing the value of p1;
Revised:  In Comparison to q-Bezier\acute{e} curves and surfaces based on Phillips q-Bernstein polynomials, our generalization gives us more flexibility in choosing the value of p1;
Edit intent: clarity
Original:  Furthermore, some fundamental properties for Lupas type (p,q)-Bernstein B zier curves and surfaces are discussed.
Revised:  zier curves and surfaces are discussed.
Edit intent: coherence
Original:  Furthermore, some fundamental properties for Lupas type (p,q)-Bernstein B zier curves and surfaces are discussed.
Revised:  Furthermore, some fundamental properties for Lupas type (p,q)-Bernstein B 
Edit intent: coherence
Original:  On the other hand, for any p>} \leq1 \limits q_n=1, \lim}\limits p_n=1 and \lim}\limitsp_n^n=a, \lim}\limitsq_n^n=b with 0<a,b}\leq1 0 fixed and p \neq 1, the sequence L^{n}_{p,q}(f,x) converges uniformly to f(x)~ \in C[0,1] if and only if f(x)=ax+b for some a, b \in \mathbb{R}.
Revised:  On the other hand, for any p>} _n<p_n\leq1 \limits q_n=1, \lim}\limits p_n=1 and \lim}\limitsp_n^n=a, \lim}\limitsq_n^n=b with 0<a,b}\leq1 0 fixed and p \neq 1, the sequence L^{n}_{p,q}(f,x) converges uniformly to f(x)~ \in C[0,1] if and only if f(x)=ax+b for some a, b \in \mathbb{R}.
Edit intent: clarity
Original:  On the other hand, for any p>} \leq1 \limits q_n=1, \lim}\limits p_n=1 and \lim}\limitsp_n^n=a, \lim}\limitsq_n^n=b with 0<a,b}\leq1 0 fixed and p \neq 1, the sequence L^{n}_{p,q}(f,x) converges uniformly to f(x)~ \in C[0,1] if and only if f(x)=ax+b for some a, b \in \mathbb{R}.
Revised:  On the other hand, for any p>} \leq1 such that \lim\limits q_n=1, \lim}\limits p_n=1 and \lim}\limitsp_n^n=a, \lim}\limitsq_n^n=b with 0<a,b}\leq1 0 fixed and p \neq 1, the sequence L^{n}_{p,q}(f,x) converges uniformly to f(x)~ \in C[0,1] if and only if f(x)=ax+b for some a, b \in \mathbb{R}.
Edit intent: clarity
Original:  On the other hand, for any p>} \leq1 \limits q_n=1, \lim}\limits p_n=1 and \lim}\limitsp_n^n=a, \lim}\limitsq_n^n=b with 0<a,b}\leq1 0 fixed and p \neq 1, the sequence L^{n}_{p,q}(f,x) converges uniformly to f(x)~ \in C[0,1] if and only if f(x)=ax+b for some a, b \in \mathbb{R}.
Revised:  On the other hand, for any p>} \leq1 \limits q_n=1, \lim}\limits p_n=1 and \lim}\limitsp_n^n=a, \lim}\limitsq_n^n=b with 0<a,b}\leq1. On the other hand, for any p> 0 fixed and p \neq 1, the sequence L^{n}_{p,q}(f,x) converges uniformly to f(x)~ \in C[0,1] if and only if f(x)=ax+b for some a, b \in \mathbb{R}.
Edit intent: fluency
Original:  For model checking we prove a PSPACE-completeness result for the synchronous case, and show P-completeness for the asynchronous case.
Revised:  For model checking we prove a PSPACE-completeness for the synchronous case, and show P-completeness for the asynchronous case.
Edit intent: clarity
Original:  For n_r%DIFDELCMD < \gt12%%% \lt \lt  , superior TPR makes edgeR the leading tool tested.
Revised:  For %DIFDELCMD < \gt12%%% \lt \lt , superior TPR makes edgeR the leading tool tested.
Edit intent: clarity
Original: Taylor's power law (TPL) is one of the few empirical patterns in ecology discovered in the 20th century.
Revised: Taylor's power law is one of the few empirical patterns in ecology discovered in the 20th century.
Edit intent: clarity
Original:  TPL earned its name after Lionel Roy Taylor's work "Aggregation, variance and the mean" published in the March 4, 1961 issue of Nature . During the past half-century, TPL was confirmed for thousands of biological species and even for non-biological quantities.
Revised:  Taylor's work "Aggregation, variance and the mean" published in the March 4, 1961 issue of Nature . During the past half-century, TPL was confirmed for thousands of biological species and even for non-biological quantities.
Edit intent: coherence
Original:  Numerous theories and models have been proposed to explain the mechanisms of TPL . However an understanding of the historical origin of TPL is lacking.
Revised:  Numerous theories and models have been proposed to explain the mechanisms of TPL . However an understanding of the historical origin of this ubiquitous scaling pattern is lacking.
Edit intent: clarity
Original:  This work reviews two research aspects that are fundamental to the discovery of TPL and provides an outlook of the future studieson TPL .
Revised:  This work reviews two research aspects that are fundamental to the discovery of TPL and provides an outlook of its future studies .
Edit intent: clarity
Original:  The stochastic geometry analysis shows that the double association, in which an uplink transmission is broadcasted to a macro Base Station (BS) and small BS, significantly improves the probability of successful transmission .
Revised:  The stochastic geometry analysis shows that the double association, in which an uplink transmission is transmitted to a macro Base Station (BS) and small BS, significantly improves the probability of successful transmission .
Edit intent: clarity
Original: FPGA technology can offer significantly higher performance at much lower power  than is available from CPUs and GPUs in many computational problems.
Revised: FPGA technology can offer significantly hi\-gher performance at much lower power than is available from CPUs and GPUs in many computational problems.
Edit intent: fluency
Original: FPGA technology can offer significantly higher performance at much lower power  than is available from CPUs and GPUs in many computational problems.
Revised: FPGA technology can offer significantly higher performance at much lower power consumption than is available from CPUs and GPUs in many computational problems.
Edit intent: clarity
Original:  Unfortunately, programming for FPGA (using hardware description languages, HDL) is a difficult and not-trivial task and is not intuitive for C/C++/Java programmers.
Revised:  Unfortunately, programming for FPGA (using ha\-rdware description languages, HDL) is a difficult and not-trivial task and is not intuitive for C/C++/Java programmers.
Edit intent: fluency
Original:  To bring the gap between programming effectiveness and difficulty the High Level Synthesis (HLS) approach is promoting by many FPGA vendors.
Revised:  To bring the gap between programming effectiveness and difficulty the High Level Synthesis (HLS) approach is promoting by main FPGA vendors.
Edit intent: clarity
Original:  In the paper we implement a selected numerical algorithm (bandwidth selection for kernel density estimators, KDE) using HLS and show techniques which were used to optimise the final FPGA implementation  .
Revised:  In the paper we implement a bandwidth selection algorithm for kernel density estimators, KDE) using HLS and show techniques which were used to optimise the final FPGA implementation .
Edit intent: clarity
Original:  In the paper we implement a selected numerical algorithm (bandwidth selection for kernel density estimators, KDE) using HLS and show techniques which were used to optimise the final FPGA implementation  .
Revised:  In the paper we implement a selected numerical algorithm (bandwidth selection for kernel density estimation ( KDE) using HLS and show techniques which were used to optimise the final FPGA implementation .
Edit intent: fluency
Original:  In the paper we implement a selected numerical algorithm (bandwidth selection for kernel density estimators, KDE) using HLS and show techniques which were used to optimise the final FPGA implementation  .
Revised:  In the paper we implement a selected numerical algorithm (bandwidth selection for kernel density estimators, KDE) using HLS and show techniques which were used to optimize the final FPGA implementation .
Edit intent: fluency
Original:  Using a combination of new design techniques and new memory technologies, we present a new architecture that detects a wide variety of hardware Trojans during IC testing and also during system operation in the field.
Revised:  Using a combination of new design techniques and new memory technologies, we present a new approach that detects a wide variety of hardware Trojans during IC testing and also during system operation in the field.
Edit intent: clarity
Original:  Our technique can also prevent a wide variety of attacks during synthesis, place-and-route, and fabrication of ICs.
Revised:  Our approach can also prevent a wide variety of attacks during synthesis, place-and-route, and fabrication of ICs.
Edit intent: clarity
Original:  In this paper, we demonstrate its applicability for both ASICs and FPGAs.
Revised:  We demonstrate its applicability for both ASICs and FPGAs.
Edit intent: coherence
Original:  Using two fabricated test chips with Trojan emulation capabilities and also using simulation results , we demonstrate: 1.
Revised:  Using fabricated test chips with Trojan emulation capabilities and also using simulation results , we demonstrate: 1.
Edit intent: clarity
Original:  Using two fabricated test chips with Trojan emulation capabilities and also using simulation results , we demonstrate: 1.
Revised:  Using two fabricated test chips with Trojan emulation capabilities and also using simulations , we demonstrate: 1.
Edit intent: clarity
Original:  2. The speed impact can be made 0\% by pipelining the additional circuitry ;
Revised:  2. The speed impact can be made 0\% ) ;
Edit intent: clarity
Original:  3. Detection of 99.998\% of Trojans (emulated using test chips) that do not require detailed knowledge of the design being attacked;
Revised:  3. Our approach can detect 99.998\% of Trojans (emulated using test chips) that do not require detailed knowledge of the design being attacked;
Edit intent: clarity
Original:  4. Prevention of 99.98\% of specific attacks (simulated) that utilize detailed knowledge of the design being attacked (e.g., through reverse-engineering).
Revised:  4. Our approach can prevent 99.98\% of specific attacks (simulated) that utilize detailed knowledge of the design being attacked (e.g., through reverse-engineering).
Edit intent: clarity
Original:  Our technique never produces any false positives ;
Revised:  5. Our approach never produces any false positives ;
Edit intent: clarity
Original:  Our technique never produces any false positives ;
Revised:  Our technique never produces any false positives ,
Edit intent: fluency
Original:  This can be accomplished by computing a measure of dependence on all possible variable pairs and examining the highest-scoring pairs, provided the measure of dependence used assigns similar scores to equally noisy relationships of different types.
Revised:  This can be accomplished by computing a measure of dependence on all variable pairs and examining the highest-scoring pairs, provided the measure of dependence used assigns similar scores to equally noisy relationships of different types.
Edit intent: clarity
Original: We present Alias Refinement Types ( Art ), a new approach to the verification of correctness properties of linked data structures.
Revised: We present Alias Refinement Types ( ART ), a new approach to the verification of correctness properties of linked data structures.
Edit intent: fluency
Original:  We prove Art sound by translating types into separation logic assertions, thus translating typ- ing derivations in Art into separation logic proofs.
Revised:  We prove ART sound by translating types into separation logic assertions, thus translating typ- ing derivations in Art into separation logic proofs.
Edit intent: fluency
Original:  We prove Art sound by translating types into separation logic assertions, thus translating typ- ing derivations in Art into separation logic proofs.
Revised:  We prove Art sound by translating types into separation logic assertions, thus translating typing derivations in ART into separation logic proofs.
Edit intent: fluency
Original:  We evaluate Art by implementing a tool that performs type inference for an imperative language .
Revised:  We evaluate ART by implementing a tool that performs type inference for an imperative language .
Edit intent: fluency
Original:  Our experiments demonstrate that Art requires only 21\% of the annotation required by other techniques to verify intermediate functions in these benchmarks .
Revised:  Our experiments demonstrate that Art requires only 21\% of the annotations needed by other state-of-the-art verification techniques .
Edit intent: clarity
Original: We propose a complexity-theoretic approach to studying biological networks .
Revised: A complexity-theoretic approach to studying biological networks .
Edit intent: coherence
Original:  We use a simple graph representation of biological networks capturing objects (molecules : DNA, RNA, proteins and chemicals) as nodes, and relations between them as directed and signed (promotional (+) or inhibitory (-)) edges.
Revised:  We use a simple graph representation is used where molecules ( DNA, RNA, proteins and chemicals) as nodes, and relations between them as directed and signed (promotional (+) or inhibitory (-)) edges.
Edit intent: clarity
Original:  Based on this model, we formally define the problem of network evolution (NE) and subsequently prove it to be fundamentally hard  by means of reduction from the Knapsack problem (KP).
Revised:  Based on this model, the problem of network evolution (NE) and subsequently prove it to be fundamentally hard by means of reduction from the Knapsack problem (KP).
Edit intent: clarity
Original:  An NE instance is created using a given real or random network.
Revised:  An NE instance is created using a given real or synthetic (random) network.
Edit intent: clarity
Original:  This reveals how computational intractability has shaped the evolution of biological networks into their current topology .
Revised:  The results shed light on how computational intractability has shaped the evolution of biological networks into their current topology .
Edit intent: clarity
Original:  We prove upper asymptotic bounds for the Shannon gate complexity function L(n,q) and the depth function D(n,q) in case of q > 0: L(n,q_0) \lesssim 2^n if q_0 \sim n 2^{ n- (n / \log_2 n )} and D(n,q_1) \lesssim 2n if q_1 \sim 3 \cdot 2 ^{n-1 .
Revised:  We prove upper asymptotic bounds for the Shannon gate complexity function L(n,q) and the depth function D(n,q) in case of q > 0: L(n,q_0) \lesssim 2^n if q_0 \sim n 2^{ n-o (n / \log_2 n )} and D(n,q_1) \lesssim 2n if q_1 \sim 3 \cdot 2 ^{n-1 .
Edit intent: clarity
Original:  We prove upper asymptotic bounds for the Shannon gate complexity function L(n,q) and the depth function D(n,q) in case of q > 0: L(n,q_0) \lesssim 2^n if q_0 \sim n 2^{ n- (n / \log_2 n )} and D(n,q_1) \lesssim 2n if q_1 \sim 3 \cdot 2 ^{n-1 .
Revised:  We prove upper asymptotic bounds for the Shannon gate complexity function L(n,q) and the depth function D(n,q) in case of q > 0: L(n,q_0) \lesssim 2^n if q_0 \sim n 2^{ n- (n / \log_2 n )} and D(n,q_1) \lesssim 3n if q_1 \sim 3 \cdot 2 ^{n-1 .
Edit intent: clarity
Original:  We prove upper asymptotic bounds for the Shannon gate complexity function L(n,q) and the depth function D(n,q) in case of q > 0: L(n,q_0) \lesssim 2^n if q_0 \sim n 2^{ n- (n / \log_2 n )} and D(n,q_1) \lesssim 2n if q_1 \sim 3 \cdot 2 ^{n-1 .
Revised:  We prove upper asymptotic bounds for the Shannon gate complexity function L(n,q) and the depth function D(n,q) in case of q > 0: L(n,q_0) \lesssim 2^n if q_0 \sim n 2^{ n- (n / \log_2 n )} and D(n,q_1) \lesssim 2n if q_1 \sim 3 \cdot 2 ^n .
Edit intent: clarity
Original: Reversible logic can be used in various research areas, e.g. quantum computation, cryptography and signal processing.
Revised: The reversible logic can be used in various research areas, e.g. quantum computation, cryptography and signal processing.
Edit intent: coherence
Original:  In this paper we study reversible logic circuits with additional inputs, consisting of NOT, CNOT and 2-CNOT gates.
Revised:  In the paper we study reversible logic circuits with additional inputs, consisting of NOT, CNOT and 2-CNOT gates.
Edit intent: style
Original:  In this paper we study reversible logic circuits with additional inputs, consisting of NOT, CNOT and 2-CNOT gates.
Revised:  In this paper we study reversible logic circuits with additional inputs, which consist of NOT, CNOT and 2-CNOT gates.
Edit intent: coherence