wanyu/IteraTeR_v2 huggingface dataset:
Original:  Re-entry was initiated and low energy shocks  applied with the same period as the re-entry, using feedback to maintain resonance.
Revised:  Re-entry was initiated and low energy shocks were applied with the same period as the re-entry, using feedback to maintain resonance.
Edit intent: fluency
Original:  Success depends on a number of details which these numerical simulations have uncovered   .
Revised:  Success depends on a number of details which these numerical simulations have uncovered . .
Edit intent: fluency
Original:  The paper considers alternating automata on data trees that can move downward and rightward, and have one register for storing data.
Revised:  The article considers alternating automata on data trees that can move downward and rightward, and have one register for storing data.
Edit intent: fluency
Original:  Allowing upward moves, leftward moves, or two registers, each cause undecidability.
Revised:  Allowing upward moves, leftward moves, or two registers, each causes undecidability.
Edit intent: fluency
Original: In this work we show that:  i) the roughly hierarchical structure of complex networks is congruent with negatively curved geometries hidden beneath the observed topologies;
Revised: We show that: i) the roughly hierarchical structure of complex networks is congruent with negatively curved geometries hidden beneath the observed topologies;
Edit intent: clarity
Original: In this work we show that:  i) the roughly hierarchical structure of complex networks is congruent with negatively curved geometries hidden beneath the observed topologies;
Revised: In this work we show that: ( i) the roughly hierarchical structure of complex networks is congruent with negatively curved geometries hidden beneath the observed topologies;
Edit intent: fluency
Original:   ii) the most straightforward mapping of nodes to spaces of negative curvature naturally leads to the emergence of scale-free topologies;
Revised:  ( ii) the most straightforward mapping of nodes to spaces of negative curvature naturally leads to the emergence of scale-free topologies;
Edit intent: fluency
Original:  and  iii) greedy routing on this embedding is efficient for these topologies, achieving both 100\% reachability and optimal path lengths, even under dynamic network conditions .
Revised:  and ( iii) greedy routing on this embedding is efficient for these topologies, achieving both 100\% reachability and optimal path lengths, even under dynamic network conditions .
Edit intent: fluency
Original:  AND-EXOR based circuits are of interest in the design of very low power circuits where energy loss implied by high frequency switching is  of much consideration.
Revised:  AND-EXOR based circuits are of interest in the design of very low power circuits where energy loss implied by high frequency switching is not of much consideration.
Edit intent: clarity
Original:  Former type of ILAs is known as Constant-Testable ( C-Testable ) .
Revised:  Former type of ILAs is known as Constant-Testable , i.e. C-Testable ) .
Edit intent: clarity
Original:  Former type of ILAs is known as Constant-Testable ( C-Testable ) .
Revised:  Former type of ILAs is known as Constant-Testable ( C-Testable .
Edit intent: fluency
Original:  By careful analysis of these cycles an efficient test generation technique that can be easily converted to an ATPG program has been presented for both 1D and 2D ILAs.
Revised:  By careful analysis of these cycles an efficient test generation technique that can be easily converted to an ATPG program has been presented for both 1-D and 2D ILAs.
Edit intent: fluency
Original:  It is well known that the interevent statistics observed in these contexts differs from the Poissonian profile  being long-tailed distributed with resting and active periods interwoven.
Revised:  It is well known that the interevent statistics observed in these contexts differs from the Poissonian profile by being long-tailed distributed with resting and active periods interwoven.
Edit intent: clarity
Original:  Understanding mechanisms generating consistent statistics have  become a central issue.
Revised:  Understanding mechanisms generating consistent statistics have therefore become a central issue.
Edit intent: coherence
Original:  The approach we present is taken from the Continuous Time Random Walk formalism and represents an analytical alternative to mechanisms of non-trivial priority that have been recently proposed.
Revised:  The approach we present is taken from the Continuous Time Random Walk formalism and represents an analytical alternative to models of non-trivial priority that have been recently proposed.
Edit intent: clarity
Original:  We observe that empirics describes a subtle multifractal behavior.
Revised:  We observe that empirical data describes a subtle multifractal behavior.
Edit intent: clarity
Original: Razborov and Rudich famously showed that so-called "natural proofs" are not useful for separating P from NP unless hard pseudorandom number generators do not exist.
Revised: Razborov and Rudich have shown that so-called "natural proofs" are not useful for separating P from NP unless hard pseudorandom number generators do not exist.
Edit intent: clarity
Original:  Their result is widely regarded as a serious barrier to proving strong lower bounds in circuit complexity theory.
Revised:  This famous result is widely regarded as a serious barrier to proving strong lower bounds in circuit complexity theory.
Edit intent: clarity
Original:  We show unconditionally that if the largeness condition is weakened slightly, then not only does the Razborov-Rudich proof break down, but such " almost natural " (and useful) properties provably exist.
Revised:  Our main result is that if the largeness condition is weakened slightly, then not only does the Razborov-Rudich proof break down, but such " almost natural " (and useful) properties provably exist.
Edit intent: clarity
Original:  We show unconditionally that if the largeness condition is weakened slightly, then not only does the Razborov-Rudich proof break down, but such " almost natural " (and useful) properties provably exist.
Revised:  We show unconditionally that if the largeness condition is weakened slightly, then not only does the Razborov-Rudich proof break down, but such " almost-natural " (and useful) properties provably exist.
Edit intent: fluency
Original:  Moreover, if we assume that hard pseudorandom number generators exist, then a simple, explicit property that we call discrimination suffices to separate P from NP . For those who hope to separate P from NP using " random function properties " in some sense, discrimination is interesting, because it  may be thought of as a "minor alteration " of a property of a random function  .
Revised:  Moreover, if we assume that hard pseudorandom number generators exist, then a simple, explicit property that we call "discrimination" suffices to separate P from NP . For those who hope to separate P from NP using " random function properties " in some sense, discrimination is interesting, because it may be thought of as a "minor alteration " of a property of a random function .
Edit intent: fluency
Original:  Moreover, if we assume that hard pseudorandom number generators exist, then a simple, explicit property that we call discrimination suffices to separate P from NP . For those who hope to separate P from NP using " random function properties " in some sense, discrimination is interesting, because it  may be thought of as a "minor alteration " of a property of a random function  .
Revised:  Moreover, if we assume that hard pseudorandom number generators exist, then a simple, explicit property that we call discrimination suffices to separate P from NP . For those who hope to separate P from NP using random function properties " in some sense, discrimination is interesting, because it may be thought of as a "minor alteration " of a property of a random function .
Edit intent: fluency
Original:  Moreover, if we assume that hard pseudorandom number generators exist, then a simple, explicit property that we call discrimination suffices to separate P from NP . For those who hope to separate P from NP using " random function properties " in some sense, discrimination is interesting, because it  may be thought of as a "minor alteration " of a property of a random function  .
Revised:  Moreover, if we assume that hard pseudorandom number generators exist, then a simple, explicit property that we call discrimination suffices to separate P from NP . For those who hope to separate P from NP using " random function properties in some sense, discrimination is interesting, because it may be thought of as a "minor alteration " of a property of a random function .
Edit intent: fluency
Original:  Moreover, if we assume that hard pseudorandom number generators exist, then a simple, explicit property that we call discrimination suffices to separate P from NP . For those who hope to separate P from NP using " random function properties " in some sense, discrimination is interesting, because it  may be thought of as a "minor alteration " of a property of a random function  .
Revised:  Moreover, if we assume that hard pseudorandom number generators exist, then a simple, explicit property that we call discrimination suffices to separate P from NP . For those who hope to separate P from NP using " random function properties " in some sense, discrimination is interesting, because it is constructive, yet may be thought of as a "minor alteration " of a property of a random function .
Edit intent: coherence
Original:  Moreover, if we assume that hard pseudorandom number generators exist, then a simple, explicit property that we call discrimination suffices to separate P from NP . For those who hope to separate P from NP using " random function properties " in some sense, discrimination is interesting, because it  may be thought of as a "minor alteration " of a property of a random function  .
Revised:  Moreover, if we assume that hard pseudorandom number generators exist, then a simple, explicit property that we call discrimination suffices to separate P from NP . For those who hope to separate P from NP using " random function properties " in some sense, discrimination is interesting, because it may be thought of as a minor alteration of a property of a random function .
Edit intent: fluency
Original:  discrimination is nearly linear-time computable and almost large, having density 2^{-q(n)} where q grows slightly faster than a quasi-polynomial function.
Revised:  discrimination is nearly linear-time computable and almost large, having density 2^{-q(n)} where q is a quasi-polynomial function.
Edit intent: clarity
Original: Deduction modulois a paradigm which consists in applying the inference rules of a deductive system (such as for instance natural deduction) modulo a rewrite system over terms and propositions.
Revised: Deduction modulois a paradigm which consists in applying the inference rules of standard deductive systems---such as for instance natural deduction) modulo a rewrite system over terms and propositions.
Edit intent: clarity
Original:  Then, a proof in higher-order  arithmetic can be linearly translated into a proof in first-order arithmetic modulo this system.
Revised:  Then, a proof in higher-order arithmetic can be linearly translated into first-order arithmetic modulo this system.
Edit intent: fluency
Original:  We show that even very simple rewrite systems lead to arbitrary proof-length speed-ups in deduction modulo  compared to using axioms.
Revised:  We show that even very simple rewrite systems lead to arbitrary proof-length speed-ups in deduction modulo , compared to using axioms.
Edit intent: fluency
Original: We study the electrical current and flow (number of parallel paths) between two sets of n sources and n sinks in complex networks.
Revised: We investigate the electrical current and flow (number of parallel paths) between two sets of n sources and n sinks in complex networks.
Edit intent: clarity
Original:  We derive analytical formulas for the change in current and flow as a function of n.
Revised:  We derive analytical formulas for the average current and flow as a function of n.
Edit intent: clarity
Original:  Finally we show that for the common case where the transport takes place between specific pairs of sources and sinks , a percolation approach can be applied to calculate the total flow and predict the number of sources/sinks above which the network saturates and can carry no more flow .
Revised:  Finally we show that for the common case where the transport takes place between specific pairs of sources and sinks .
Edit intent: coherence
Original: Due to the complicated coupling and non-convexity introduced by interference, optimal joint SINR allocation and power control is difficult to achieve in wireless networks.
Revised: Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks.
Edit intent: clarity
Original:  Unfortunately, the important problem of weighted throughput maximization (WTM) cannot be convexified using the existing approaches, and thus achieving its optimal performance has been an open problem .
Revised:  In the general SINR regime, however, the approximation and transformation approach does not work .
Edit intent: coherence
Original:  This paper proposed a centralized algorithm, MAPEL, which is guaranteed to globally converge to a global optimal solution of the weighted throughput optimization problem .
Revised:  This paper proposes an algorithm, MAPEL, which is guaranteed to globally converge to a global optimal solution of the weighted throughput optimization problem .
Edit intent: clarity
Original:  This paper proposed a centralized algorithm, MAPEL, which is guaranteed to globally converge to a global optimal solution of the weighted throughput optimization problem .
Revised:  This paper proposed a centralized algorithm, MAPEL, which globally converges to a global optimal solution of the weighted throughput optimization problem .
Edit intent: clarity
Original:  The success of MAPEL algorithm is  based on three key observations of the WTM problem: (1) the monotonicity of the objective function in terms of signal to interference-plus-noise ratio (SINR) , (2) the objective function can be transformed into a product of exponentiated linear fraction functions, and (3) the feasible SINR region is always normal although not necessarily convex.
Revised:  The success of MAPEL algorithm is designed based on three key observations of the WTM problem: (1) the monotonicity of the objective function in terms of signal to interference-plus-noise ratio (SINR) , (2) the objective function can be transformed into a product of exponentiated linear fraction functions, and (3) the feasible SINR region is always normal although not necessarily convex.
Edit intent: clarity
Original:  The success of MAPEL algorithm is  based on three key observations of the WTM problem: (1) the monotonicity of the objective function in terms of signal to interference-plus-noise ratio (SINR) , (2) the objective function can be transformed into a product of exponentiated linear fraction functions, and (3) the feasible SINR region is always normal although not necessarily convex.
Revised:  The success of MAPEL algorithm is based on three key observations of the WTM problem: (1) the objective function is monotonically increasing in SINR , (2) the objective function can be transformed into a product of exponentiated linear fraction functions, and (3) the feasible SINR region is always normal although not necessarily convex.
Edit intent: clarity
Original: We prove that a generic network of three or more inhibitory neurons have periodic or quasi-periodic behavior with a finite number of limit cycles that persist under small perturbations of the set of parameter values.
Revised: We prove that a generic network of three or more inhibitory neurons have periodic behavior with a finite number of limit cycles that persist under small perturbations of the set of parameter values.
Edit intent: clarity
Original: In this paper , we circumscribe available steganographic techniques that can be used for creating covert channels for VoIP (Voice over Internet Protocol) streams.
Revised: The paper concerns available steganographic techniques that can be used for creating covert channels for VoIP (Voice over Internet Protocol) streams.
Edit intent: clarity
Original:  First one is network steganography solution and exploits free/unused fields of the RTCP (Real-Time Control Protocol) and RTP (Real-Time Transport Protocol) protocols .
Revised:  The first one is network steganography solution and exploits free/unused fields of the RTCP (Real-Time Control Protocol) and RTP (Real-Time Transport Protocol) protocols .
Edit intent: coherence
Original:  First one is network steganography solution and exploits free/unused fields of the RTCP (Real-Time Control Protocol) and RTP (Real-Time Transport Protocol) protocols .
Revised:  First one is network steganography solution which exploits free/unused fields of the RTCP (Real-Time Control Protocol) and RTP (Real-Time Transport Protocol) protocols .
Edit intent: fluency
Original:  First one is network steganography solution and exploits free/unused fields of the RTCP (Real-Time Control Protocol) and RTP (Real-Time Transport Protocol) protocols .
Revised:  First one is network steganography solution and exploits free/unused fields of the RTCP (Real-Time Transport Protocol) and RTP (Real-Time Transport Protocol) protocols .
Edit intent: clarity
Original:  First one is network steganography solution and exploits free/unused fields of the RTCP (Real-Time Control Protocol) and RTP (Real-Time Transport Protocol) protocols .
Revised:  First one is network steganography solution and exploits free/unused fields of the RTCP (Real-Time Control Protocol) and RTCP (Real-Time Transport Protocol) protocols .
Edit intent: fluency
Original:  The results of the experiment, that was performed , regardless of steganalysis, to estimate a total amount of data that can be covertly transferred in VoIP RTP stream during the typical call, are also included in this article .
Revised:  The results of the experiment, that was performed to estimate a total amount of data that can be covertly transferred in VoIP RTP stream during the typical call, are also included in this article .
Edit intent: clarity
Original:  The results of the experiment, that was performed , regardless of steganalysis, to estimate a total amount of data that can be covertly transferred in VoIP RTP stream during the typical call, are also included in this article .
Revised:  The results of the experiment, that was performed , regardless of steganalysis, to estimate a total amount of data that can be covertly transferred during typical VoIP conversation phase, regardless of steganalysis, are also included in this article .
Edit intent: clarity
Original:  The results of the experiment, that was performed , regardless of steganalysis, to estimate a total amount of data that can be covertly transferred in VoIP RTP stream during the typical call, are also included in this article .
Revised:  The results of the experiment, that was performed , regardless of steganalysis, to estimate a total amount of data that can be covertly transferred in VoIP RTP stream during the typical call, are also included in this paper .
Edit intent: fluency
Original:  The mechanistic role of TnI in opening is unresolved: TnI may forcibly induce opening or merely stabilize the open conformation after opening has occurred.
Edit intent: coherence
Original:  To resolve the mechanistic role of TnI , we performed stopped-flow FRET measurements of activation following rapid addition of a lacking component (Ca or TnI) and deactivation following rapid chelation of Ca.
Revised:  To resolve the mechanistic role of TnI in activation we performed stopped-flow FRET measurements of activation following rapid addition of a lacking component (Ca or TnI) and deactivation following rapid chelation of Ca.
Edit intent: clarity
Original:  The analysis provided a microscopic parameterization of distance changes, free energy changes, and transition rates among the accessible coarse-grained states of the system.
Revised:  The analysis provided a mesoscopic parameterization of distance changes, free energy changes, and transition rates among the accessible coarse-grained states of the system.
Edit intent: clarity
Original:   <Abstract truncated >
Revised:  <Abstract Truncated >
Edit intent: fluency
Original:  This paper proposes a new coupled loading-rate hypothesis for the traumatic brain injury (TBI), which states that the main cause of the TBI is an external Euclidean jolt, or SE(3)-jolt, an impulsive loading that strikes the head in several coupled degrees-of-freedom  .
Revised:  This paper proposes a new coupled loading-rate hypothesis for the traumatic brain injury (TBI), which states that the main cause of the TBI is an external Euclidean jolt, or SE(3)-jolt, an impulsive loading that strikes the head in several coupled degrees-of-freedom simultaneously .
Edit intent: clarity
Original: This paper presents the scientific body of knowledge behind the Human Biodynamics Engine (HBE), a world-class human motion simulator , formulated in the fashion of nonlinear humanoid robotics at Defence Science & Technology Organisation, Australia.
Revised: This paper presents the scientific body of knowledge behind the Human Biodynamics Engine (HBE), a sophisticated human motion simulator , formulated in the fashion of nonlinear humanoid robotics at Defence Science & Technology Organisation, Australia.
Edit intent: clarity
Original: This paper presents the scientific body of knowledge behind the Human Biodynamics Engine (HBE), a sophisticated human motion simulator developed on the concept of Euclidean motion group SE(3), with 270 active degrees of freedom, force-velocity-time muscular mechanics and two-level neural control -- formulated in the fashion of nonlinear humanoid robotics at Defence Science Technology Organisation, Australia .
Revised: This paper presents the scientific body of knowledge behind the Human Biodynamics Engine (HBE), a human motion simulator developed on the concept of Euclidean motion group SE(3), with 270 active degrees of freedom, force-velocity-time muscular mechanics and two-level neural control -- formulated in the fashion of nonlinear humanoid robotics at Defence Science Technology Organisation, Australia .
Edit intent: clarity
Original: This paper presents the scientific body of knowledge behind the Human Biodynamics Engine (HBE), a sophisticated human motion simulator developed on the concept of Euclidean motion group SE(3), with 270 active degrees of freedom, force-velocity-time muscular mechanics and two-level neural control -- formulated in the fashion of nonlinear humanoid robotics at Defence Science Technology Organisation, Australia .
Revised: This paper presents the scientific body of knowledge behind the Human Biodynamics Engine (HBE), a sophisticated human motion simulator developed on the concept of Euclidean motion group SE(3), with 270 active degrees of freedom, force-velocity-time muscular mechanics and two-level neural control - formulated in the fashion of nonlinear humanoid robotics at Defence Science Technology Organisation, Australia .
Edit intent: fluency
Original: This paper presents the scientific body of knowledge behind the Human Biodynamics Engine (HBE), a sophisticated human motion simulator developed on the concept of Euclidean motion group SE(3), with 270 active degrees of freedom, force-velocity-time muscular mechanics and two-level neural control -- formulated in the fashion of nonlinear humanoid robotics at Defence Science Technology Organisation, Australia .
Revised: This paper presents the scientific body of knowledge behind the Human Biodynamics Engine (HBE), a sophisticated human motion simulator developed on the concept of Euclidean motion group SE(3), with 270 active degrees of freedom, force-velocity-time muscular mechanics and two-level neural control -- formulated in the fashion of nonlinear humanoid robotics Technology Organisation, Australia .
Edit intent: clarity