wanyu/IteraTeR_v2 huggingface dataset:
Original:  The proposed spectral covariance sensing (SCS) algorithm exploits  different statistical correlations of the  signal and noise in the frequency domain.
Revised:  The proposed spectral covariance sensing (SCS) algorithm exploits the different statistical correlations of the signal and noise in the frequency domain.
Edit intent: fluency
Original:  The proposed spectral covariance sensing (SCS) algorithm exploits  different statistical correlations of the  signal and noise in the frequency domain.
Revised:  The proposed spectral covariance sensing (SCS) algorithm exploits different statistical correlations of the received signal and noise in the frequency domain.
Edit intent: clarity
Original:  Test statistics are computed from the covariance matrix of  partial spectrogram and compared with decision threshold.
Revised:  Test statistics are computed from the covariance matrix of a partial spectrogram and compared with decision threshold.
Edit intent: fluency
Original:  Detection performance is theoretically analyzed and verified through extensive simulation using actual digital television (DTV) signals captured in the US.
Revised:  Detection performance is theoretically analyzed and verified through extensive simulation using actual digital television signals captured in the US.
Edit intent: clarity
Original:  It is also shown that SCS is very robust to the noise uncertainty, which is one of the critical performance measures of spectrum sensor.
Revised:  It is also shown that SCS is highly robust to noise uncertainty, which is one of the critical performance measures of spectrum sensor.
Edit intent: clarity
Original:  The upper bound of 3^{n-1} obtained by Lyubich et al. (2001) using Bezout's Theorem (1779) is reduced  to 2^n through a change of representation that reduces the third-order polynomials to second order.
Revised:  The upper bound of 3^{n-1} obtained by Lyubich et al. (2001) using Bezout's Theorem (1779) is reduced here to 2^n through a change of representation that reduces the third-order polynomials to second order.
Edit intent: clarity
Original:  A further reduction to 2^n - 1 is obtained by applying the implicit function theorem to Lyubich's (1992) use of the Poincare-Hopf index theorem.
Revised:  A further reduction to 2^n - 1 is obtained by applying the implicit function theorem to Lyubich's (1992) application of the Poincare-Hopf index theorem.
Edit intent: clarity
Original:  An example is constructed of a mutation-selection system that has 2^n - 1 fixed points given any n, which shows that 2^n - 1 is the sharpest possible upper bound that can be found for  general space of selection and transmission coefficients.
Revised:  An example is constructed of a mutation-selection system that has 2^n - 1 fixed points given any n, which shows that 2^n - 1 is the sharpest possible upper bound that can be found for the general space of selection and transmission coefficients.
Edit intent: fluency
Original:  These two objectives are  contradictive in that optimizing one will inevitably deteriorate the other.
Revised:  These two objectives are often contradictive in that optimizing one will inevitably deteriorate the other.
Edit intent: clarity
Original:  These two objectives are  contradictive in that optimizing one will inevitably deteriorate the other.
Revised:  These two objectives are contradictive in that optimizing one objective may deteriorate the other.
Edit intent: clarity
Original:  After a deep investigation of the impact that network topology, node capability scheme and routing algorithm as well as their interplays have on the two objectives, this Letter presents a systematic approach to achieving a cost-effective design by carefully choosing the three designing aspects.
Revised:  After a deep investigation of the impact that network topology, node capability scheme and routing algorithm as well as their interplays have on the two objectives, this letter presents a systematic approach to achieving a cost-effective design by carefully choosing the three designing aspects.
Edit intent: fluency
Original:  After a deep investigation of the impact that network topology, node capability scheme and routing algorithm as well as their interplays have on the two objectives, this Letter presents a systematic approach to achieving a cost-effective design by carefully choosing the three designing aspects.
Revised:  After a deep investigation of the impact that network topology, node capability scheme and routing algorithm as well as their interplays have on the two objectives, this Letter presents a systematic approach to achieve a cost-effective design by carefully choosing the three designing aspects.
Edit intent: fluency
Original:  Only when routing algorithm and node capability scheme are elaborately chosen can BA-like scale-free networks have the potential of achieving good tradeoff between the two objectives.
Revised:  Only when routing algorithm and node capability scheme are elegantly chosen can BA-like scale-free networks have the potential of achieving good tradeoff between the two objectives.
Edit intent: fluency
Original:  Random networks, on the other hand, have the built-in character for a cost-effect design, especially when other aspects cannot be determined beforehand.
Revised:  Random networks, on the other hand, have the built-in character for a cost-effective design, especially when other aspects cannot be determined beforehand.
Edit intent: fluency
Original:  They provide interactive programming environments that are easy to use due to their script languages with matrix data types.
Revised:  They provide interactive programming environments that are easy to use due to their scripting languages with matrix data types.
Edit intent: fluency
Original:  Current implementations of matrix languages do not fully utilize high-performance, special-purpose chip architectures such as the IBM PowerXCell processor (Cell), which is currently used in the fastest computer in the world.
Revised:  Current implementations of matrix languages do not fully utilise high-performance, special-purpose chip architectures such as the IBM PowerXCell processor (Cell), which is currently used in the fastest computer in the world.
Edit intent: fluency
Original:  We present a new framework that extends Octave to harvest the computational power of the Cell.
Revised:  We present a new framework that extends Octave to harness the computational power of the Cell.
Edit intent: fluency
Original:  With this framework the programmer is alleviated of the burden of introducing explicit notions of parallelism.
Revised:  With this framework the programmer is relieved of the burden of introducing explicit notions of parallelism.
Edit intent: fluency
Original: This note deals with the computational complexity of computing the noncommutative determinant.
Revised: In this paper we study the computational complexity of computing the noncommutative determinant.
Edit intent: clarity
Original:  We  consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial , and also the complexity of computing the determinant (as a function) over noncommutative domains.
Revised:  We first consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial , and also the complexity of computing the determinant (as a function) over noncommutative domains.
Edit intent: coherence
Original:  We  consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial , and also the complexity of computing the determinant (as a function) over noncommutative domains.
Revised:  We consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial . Then, more generally, we also examine the complexity of computing the determinant (as a function) over noncommutative domains.
Edit intent: clarity
Original:  Our results are : 1. We show that if the noncommutative determinant polynomial has small noncommutative arithmetic circuits , then so does the noncommutative permanent , and hence the commutative permanent polynomial has small commutative arithmetic circuits.
Revised:  Our results are : 1. We show that if the noncommutative determinant polynomial has small noncommutative arithmetic circuits then so does the noncommutative permanent , and hence the commutative permanent polynomial has small commutative arithmetic circuits.
Edit intent: fluency
Original:  Our results are : 1. We show that if the noncommutative determinant polynomial has small noncommutative arithmetic circuits , then so does the noncommutative permanent , and hence the commutative permanent polynomial has small commutative arithmetic circuits.
Revised:  Our results are : 1. We show that if the noncommutative determinant polynomial has small noncommutative arithmetic circuits , then so does the noncommutative permanent . Consequently, the commutative permanent polynomial has small commutative arithmetic circuits.
Edit intent: coherence
Original:  2. We show that computing the  2n \times 2n determinant over inputs from the matrix algebra M_n(F) (for any field F) is at least as hard as computing the n \times n permanent over F . Our techniques are elementary and use primarily the notion of the Hadamard Product of noncommutative polynomials.
Revised:  2. For any field F we show that computing the 2n \times 2n determinant over inputs from the matrix algebra M_n(F) (for any field F) is at least as hard as computing the n \times n permanent over F . Our techniques are elementary and use primarily the notion of the Hadamard Product of noncommutative polynomials.
Edit intent: fluency
Original:  2. We show that computing the  2n \times 2n determinant over inputs from the matrix algebra M_n(F) (for any field F) is at least as hard as computing the n \times n permanent over F . Our techniques are elementary and use primarily the notion of the Hadamard Product of noncommutative polynomials.
Revised:  2. We show that computing the 2n X 2n determinant over inputs from the matrix algebra M_n(F) (for any field F) is at least as hard as computing the n \times n permanent over F . Our techniques are elementary and use primarily the notion of the Hadamard Product of noncommutative polynomials.
Edit intent: clarity
Original:  A renewed interest in this relationship has been prompted by growing evidence that mutational robustness can play a positive role in the discovery of future adaptive innovations (evolvability) and evidence of an intimate relationship between robustness and complexity in biology.
Revised:  A renewed interest in this relationship has been prompted by evidence that mutational robustness can play a positive role in the discovery of future adaptive innovations (evolvability) and evidence of an intimate relationship between robustness and complexity in biology.
Edit intent: clarity
Original:   second, to underscore the intimate connections between fractals and phase transitions in complex dynamical systems,with a view of considering this relation as potential generator of natural fractals;
Revised:  and second, to underscore the intimate connections between fractals and phase transitions in complex dynamical systems,with a view of considering this relation as potential generator of natural fractals;
Edit intent: fluency
Original:  and third to draw attention to the puzzling and as yet unresolved issues of the functional significance of scalingand self-similarity  .
Revised:  and third to draw attention to the as yet still unresolved issues of the functional significance of scalingand self-similarity .
Edit intent: clarity
Original:  The model therefore takes into account the fact that new additions to the adult fly population , are in actual fact, the descendents of a population which existed one puparial duration ago, furthermore, that this puparial duration is temperature dependent.
Revised:  The model therefore takes into account the fact that new additions to the adult fly population are, in actual fact, the descendents of a population which existed one puparial duration ago, furthermore, that this puparial duration is temperature dependent.
Edit intent: fluency
Original:  The temporary imposition of a 2 \% /day mortality everywhere outside the reserve for a period of 2 years will have no lasting effect on the influence of the reserve on either the Glossina austeni or the G. brevipalpis population , although it certainly will eradicate tsetse from poor habitat, outside the reserve.
Revised:  The temporary imposition of a 2 \% /day mortality everywhere outside the reserve for a period of 2 years will have no lasting effect on the influence of the reserve on either the Glossina austeni or the G. brevipalpis populations , although it certainly will eradicate tsetse from poor habitat, outside the reserve.
Edit intent: fluency
Original:  A 5 km-wide barrier with a minimum mortality of 4 \% /day throughout, will succeed in completely isolating a worst-case, G. austeni population and its associated trypanosomiasis from the surrounding areas.
Revised:  A 5 \mathrm{km barrier with a minimum mortality of 4 \% /day throughout, will succeed in completely isolating a worst-case, G. austeni population and its associated trypanosomiasis from the surrounding areas.
Edit intent: clarity
Original:  A 5 km-wide barrier with a minimum mortality of 4 \% /day throughout, will succeed in completely isolating a worst-case, G. austeni population and its associated trypanosomiasis from the surrounding areas.
Revised:  A 5 km-wide barrier with a minimum mortality of 4 \% \mathrm{day throughout, will succeed in completely isolating a worst-case, G. austeni population and its associated trypanosomiasis from the surrounding areas.
Edit intent: fluency
Original:  A 5 km-wide barrier with a minimum mortality of 4 \% /day throughout, will succeed in completely isolating a worst-case, G. austeni population and its associated trypanosomiasis from the surrounding areas.
Revised:  A 5 km-wide barrier with a minimum mortality of 4 \% /day throughout, will succeed in isolating a worst-case, G. austeni population and its associated trypanosomiasis from the surrounding areas.
Edit intent: clarity
Original:  A more optimistic estimate of its mobility suggests a mortality of 2 \% /day might suffice.
Revised:  A more optimistic estimate of its mobility suggests a mortality of 2 \% \mathrm{day suffice.
Edit intent: clarity
Original: Several classical models of picture grammars based on array rewriting rules can be unified and extended by a tiling based approach .
Revised: Several old and recent classes of picture grammars based on array rewriting rules can be unified and extended by a tiling based approach .
Edit intent: clarity
Original: Several classical models of picture grammars based on array rewriting rules can be unified and extended by a tiling based approach .
Revised: Several classical models of picture grammars based on array rewriting rules can be unified and extended using a tiling based approach .
Edit intent: fluency
Original:  The right part of a rewriting rule is formalized by  a finite set of permitted tiles.
Revised:  The right part of a rule is formalized by a finite set of permitted tiles.
Edit intent: clarity
Original:  The right part of a rewriting rule is formalized by  a finite set of permitted tiles.
Revised:  The right part of a rewriting rule is formalized by means of a finite set of permitted tiles.
Edit intent: fluency
Original:  We focus ona simple type of tiling,named regional, and define the corresponding regional tile grammars.
Revised:  We focus on a simple type of tiling,named regional, and define the corresponding regional tile grammars.
Edit intent: fluency
Original:  They include both Siromoney's (or Matz's) Kolam grammars , and their generalization by Prusa  . Regionally defined pictures can be recognized with polynomial time complexity by an algorithm extending the CKY one for strings.
Revised:  They include both Siromoney's (or Matz's) Kolam grammars and their generalization by Prusa . Regionally defined pictures can be recognized with polynomial time complexity by an algorithm extending the CKY one for strings.
Edit intent: fluency
Original:  They include both Siromoney's (or Matz's) Kolam grammars , and their generalization by Prusa  . Regionally defined pictures can be recognized with polynomial time complexity by an algorithm extending the CKY one for strings.
Revised:  They include both Siromoney's (or Matz's) Kolam grammars , and their generalization by Prusa . Regionally defined pictures can be recognized with polynomial-time complexity by an algorithm extending the CKY one for strings.
Edit intent: fluency
Original:  Regional tile grammars and languages are strictly included into the tile grammars and languages, and are incomparable with Giammarresi-Restivo tiling systems (or Wang 's tilings ).
Revised:  Regional tile grammars and languages are strictly included into the tile grammars and languages, and are incomparable with Giammarresi-Restivo tiling systems (or Wang systems ).
Edit intent: fluency
Original: In the last years, a lot of attention has been paid to the development of solid foundations for the composition and inversion of schema mappings.
Revised: In the recent years, a lot of attention has been paid to the development of solid foundations for the composition and inversion of schema mappings.
Edit intent: clarity
Original: One of the fundamental assumptions in modern microeconomic theory is that choice should be rationalizable via a binary preference relation . \mbox{ Sen71a equivalent to two consistency conditions on choice , namely \alpha (contraction) and \gamma (expansion).
Revised: A common assumption in modern microeconomic theory is that choice should be rationalizable via a binary preference relation . \mbox{ Sen71a equivalent to two consistency conditions on choice , namely \alpha (contraction) and \gamma (expansion).
Edit intent: clarity
Original: One of the fundamental assumptions in modern microeconomic theory is that choice should be rationalizable via a binary preference relation . \mbox{ Sen71a equivalent to two consistency conditions on choice , namely \alpha (contraction) and \gamma (expansion).
Revised: One of the fundamental assumptions in modern microeconomic theory is that choice should be rationalizable via a binary preference relation , which \mbox{ Sen71a equivalent to two consistency conditions on choice , namely \alpha (contraction) and \gamma (expansion).
Edit intent: coherence
Original: One of the fundamental assumptions in modern microeconomic theory is that choice should be rationalizable via a binary preference relation . \mbox{ Sen71a equivalent to two consistency conditions on choice , namely \alpha (contraction) and \gamma (expansion).
Revised: One of the fundamental assumptions in modern microeconomic theory is that choice should be rationalizable via a binary preference relation . \mbox{ Sen71a equivalent to two consistency conditions , namely \alpha (contraction) and \gamma (expansion).
Edit intent: clarity
Original:  Within the context of social choice, however, rationalizability and similar notions of consistency have proved to be highly problematic, as witnessed by a range of impossibility results, among which Arrow's is the most prominent.
Revised:  Within the context of social choice, however, rationalizability and similar notions of consistency have proved to be highly problematic, as witnessed by a range of impossibility results, among which Arrow's is the most prominent.
Edit intent: fluency
Original:  We also introduce two consistency conditions, %DIFDELCMD < \widehat%%% \alpha and%DIFDELCMD < \widehat%%% \hat\hat \gamma, which are defined in analogy to \alpha and \gamma, and find that a choice function is set-rationalizable if and only if it satisfies %DIFDELCMD < \widehat%%% \hat \alpha.
Revised:  We also introduce two consistency conditions, %DIFDELCMD < \widehat%%% %DIFDELCMD < \widehat%%% \hat\hat \gamma, which are defined in analogy to \alpha and \gamma, and find that a choice function is set-rationalizable if and only if it satisfies %DIFDELCMD < \widehat%%% \hat \alpha.
Edit intent: coherence
Original:  We also introduce two consistency conditions, %DIFDELCMD < \widehat%%% \alpha and%DIFDELCMD < \widehat%%% \hat\hat \gamma, which are defined in analogy to \alpha and \gamma, and find that a choice function is set-rationalizable if and only if it satisfies %DIFDELCMD < \widehat%%% \hat \alpha.
Revised:  We also introduce two consistency conditions, %DIFDELCMD < \widehat%%% \alpha and%DIFDELCMD < \widehat%%% \hat\alpha and\hat \gamma, which are defined in analogy to \alpha and \gamma, and find that a choice function is set-rationalizable if and only if it satisfies %DIFDELCMD < \widehat%%% \hat \alpha.
Edit intent: clarity
Original:  Moreover, a choice function satisfies %DIFDELCMD < \widehat%%% \alpha and%DIFDELCMD < \widehat%%% \hat\hat \gamma if and only if it is self-stable, a new concept based on earlier work by Dutt88a.
Revised:  Moreover, a choice function satisfies %DIFDELCMD < \widehat%%% %DIFDELCMD < \widehat%%% \hat\hat \gamma if and only if it is self-stable, a new concept based on earlier work by Dutt88a.
Edit intent: coherence
Original:  Moreover, a choice function satisfies %DIFDELCMD < \widehat%%% \alpha and%DIFDELCMD < \widehat%%% \hat\hat \gamma if and only if it is self-stable, a new concept based on earlier work by Dutt88a.
Revised:  Moreover, a choice function satisfies %DIFDELCMD < \widehat%%% \alpha and%DIFDELCMD < \widehat%%% \hat\alpha and\hat \gamma if and only if it is self-stable, a new concept based on earlier work by Dutt88a.
Edit intent: coherence
Original:  The class of self-stable social choice functions contains a number of appealing Condorcet extensions such as the minimal covering set and the essential set , yet excludes other well-known Condorcet extensions as well as all scoring rules .
Revised:  The class of self-stable social choice functions contains a number of appealing Condorcet extensions such as the minimal covering set and the essential set .
Edit intent: clarity
Original:  Keywords: cellular automata classification, Wolfram's four classes, phase transition detection, program-size complexity, compression-based clustering, non-linear dynamics, Lyapunov characteristic exponents.
Edit intent: coherence
Original:  These models, related to a paradigm duplication-innovation model known as Chinese Restaurant Process, are devised to reproduce the scaling behaviour observed in the genome-wide repertoire of protein domains of all known species.
Revised:  These models, related to a paradigm duplication-innovation model known as Chinese Restaurant Process, are devised to reproduce the scaling behavior observed in the genome-wide repertoire of protein domains of all known species.
Edit intent: fluency
Original:  We analyze our model with five different approaches : cooperative, non-cooperative , repeated interaction, pricing schemes , and enforced full sharing.
Revised:  We analyze our model with five different approaches : cooperative, non-cooperative , repeated interaction, intervention , and enforced full sharing.
Edit intent: clarity
Original:  Using these approaches, we show that ( 1)  peers share all produced content at a cooperative solution whereas they do not share at all at a non-cooperative solution;
Revised:  The results of this paper show that 1) peers share all produced content at a cooperative solution whereas they do not share at all at a non-cooperative solution;
Edit intent: clarity
Original:  Using these approaches, we show that ( 1)  peers share all produced content at a cooperative solution whereas they do not share at all at a non-cooperative solution;
Revised:  Using these approaches, we show that ( 1) cooperative peers share all produced content at a cooperative solution whereas they do not share at all at a non-cooperative solution;
Edit intent: clarity
Original:  Using these approaches, we show that ( 1)  peers share all produced content at a cooperative solution whereas they do not share at all at a non-cooperative solution;
Revised:  Using these approaches, we show that ( 1) peers share all produced content while non-cooperative peers do not share at all at a non-cooperative solution;
Edit intent: clarity