wanyu/IteraTeR_v2 huggingface dataset:
Original:  Numerically, we find that the  performance of the optimum over the restricted class is very close to that over the unrestricted class .
Revised:  Numerically, we find that the performance of our local forwarding-solution .
Edit intent: clarity
Original:  Our focus is on 4G cellular systems that conform to the 3GPP LTE standard and its enhancements, which are{\em   expected to be the predominant 4G cellular systems.
Revised:  The 3GPP LTE standard and its enhancements, which are{\em expected to be the predominant 4G cellular systems.
Edit intent: coherence
Original:  Our focus is on 4G cellular systems that conform to the 3GPP LTE standard and its enhancements, which are{\em   expected to be the predominant 4G cellular systems.
Revised:  Our focus is on 4G cellular systems that conform to the 3GPP LTE standard and its enhancements, which are{\em true expected to be the predominant 4G cellular systems.
Edit intent: fluency
Original:  In order to cater to an ever-increasing user traffic, the 4G uplink allows for precoded multi-stream (precoded MIMO) transmission from each scheduled user and also allows  multi-user (MU) scheduling wherein multiple users can be assigned the same time-frequency resource.
Revised:  In order to cater to an ever-increasing user traffic, the 4G uplink allows for precoded multi-stream (precoded MIMO) transmission from each scheduled user and also allows flexible multi-user (MU) scheduling wherein multiple users can be assigned the same time-frequency resource.
Edit intent: clarity
Original:  However, several practical constraints that seek to balance the need for scheduling flexibility with the need to maintain a low signaling overhead , are also imposed .
Revised:  However, exploiting these features is made challenging by certain practical constraints that seek to balance the need for scheduling flexibility with the need to maintain a low signaling overhead , are also imposed .
Edit intent: clarity
Original:  However, several practical constraints that seek to balance the need for scheduling flexibility with the need to maintain a low signaling overhead , are also imposed .
Revised:  However, several practical constraints that have been imposed in order to maintain a low signaling overhead , are also imposed .
Edit intent: coherence
Original:  However, several practical constraints that seek to balance the need for scheduling flexibility with the need to maintain a low signaling overhead , are also imposed .
Revised:  However, several practical constraints that seek to balance the need for scheduling flexibility with the need to maintain a low signaling overhead .
Edit intent: coherence
Original: In this paper, we consider Multi-User MIMO (MU-MIMO) scheduling in the 3GPP LTE-Advanced (3GPP LTE-A) cellular uplink.
Revised: We consider Multi-User MIMO (MU-MIMO) scheduling in the 3GPP LTE-Advanced (3GPP LTE-A) cellular uplink.
Edit intent: clarity
Original:  The 3GPP LTE-A cellular network is one of the two%DIFDELCMD < {\em %%% true fourth generation (4G) cellular networks as per the international telecommunications union and is expected to be the most widely deployed 4G cellular network.
Revised:  The 3GPP LTE-A %DIFDELCMD < {\em %%% true fourth generation (4G) cellular networks as per the international telecommunications union and is expected to be the most widely deployed 4G cellular network.
Edit intent: clarity
Original:  The 3GPP LTE-A cellular network is one of the two%DIFDELCMD < {\em %%% true fourth generation (4G) cellular networks as per the international telecommunications union and is expected to be the most widely deployed 4G cellular network.
Revised:  The 3GPP LTE-A cellular network is one of the two%DIFDELCMD < {\em %%% fourth generation (4G) cellular networks as per the international telecommunications union and is expected to be the most widely deployed 4G cellular network.
Edit intent: clarity
Original: Known approaches to determine the gene structure, due to alternative splicing (AS) , rely on some forms of spliced alignment of the transcripts against the genomic sequence of the gene producing the transcripts.
Revised: Next-generation sequencing (NGS) technologies allow new methodologies for alternative splicing (AS) , rely on some forms of spliced alignment of the transcripts against the genomic sequence of the gene producing the transcripts.
Edit intent: clarity
Original:  We formalize the underlying computational problem , proving the soundness of our approach from both a theoretical and experimental point of view .
Revised:  We formalize the underlying computational problem , proving the soundness of our approach from both a theoretical and an experimental analysis .
Edit intent: clarity
Original:  In this paper we  show how a weak approximation for the absorbtion time of a one-dimensional diffusion can be constructed, using the Euler-Maruyama numerical solver.
Revised:  In this paper we show how a weak approximation for the absorption time can be constructed, using the Euler-Maruyama numerical solver.
Edit intent: clarity
Original: A ~ 62 My periodicity in fossil biodiversity has been observed in independent studies of paleobiology databases going back 542 My . The period and phase of this biodiversity cycle coincides with the motion of our solar system in the galactic disk that oscillates perpendicular to the galactic plane with an amplitude of about 70 parsecs and a period of 63.6 My. Our Galaxy is falling toward the Virgo cluster due to its gravitational pull ,
Revised: A ~ 62 My periodicity in fossil biodiversity has been observed in independent studies of paleobiology databases going back 542 My . The period and phase of this biodiversity cycle coincides with the oscillation of our solar system in the galactic disk that oscillates perpendicular to the galactic plane with an amplitude of about 70 parsecs and a period of 63.6 My. Our Galaxy is falling toward the Virgo cluster due to its gravitational pull ,
Edit intent: clarity
Original: A ~ 62 My periodicity in fossil biodiversity has been observed in independent studies of paleobiology databases going back 542 My . The period and phase of this biodiversity cycle coincides with the motion of our solar system in the galactic disk that oscillates perpendicular to the galactic plane with an amplitude of about 70 parsecs and a period of 63.6 My. Our Galaxy is falling toward the Virgo cluster due to its gravitational pull ,
Revised: A ~ 62 My periodicity in fossil biodiversity has been observed in independent studies of paleobiology databases going back 542 My . The period and phase of this biodiversity cycle coincides with the motion of our solar system in the galactic disk that oscillates perpendicular to the galactic disk with an amplitude of about 70 parsecs and a period of 63.6 My. Our Galaxy is falling toward the Virgo cluster due to its gravitational pull ,
Edit intent: clarity
Original: A ~ 62 My periodicity in fossil biodiversity has been observed in independent studies of paleobiology databases going back 542 My . The period and phase of this biodiversity cycle coincides with the motion of our solar system in the galactic disk that oscillates perpendicular to the galactic plane with an amplitude of about 70 parsecs and a period of 63.6 My. Our Galaxy is falling toward the Virgo cluster due to its gravitational pull ,
Revised: A ~ 62 My periodicity in fossil biodiversity has been observed in independent studies of paleobiology databases going back 542 My . The period and phase of this biodiversity cycle coincides with the motion of our solar system in the galactic disk that oscillates perpendicular to the galactic plane with an amplitude ~ 70 parsecs and a period of 63.6 My. Our Galaxy is falling toward the Virgo cluster due to its gravitational pull ,
Edit intent: clarity
Original: A ~ 62 My periodicity in fossil biodiversity has been observed in independent studies of paleobiology databases going back 542 My . The period and phase of this biodiversity cycle coincides with the motion of our solar system in the galactic disk that oscillates perpendicular to the galactic plane with an amplitude of about 70 parsecs and a period of 63.6 My. Our Galaxy is falling toward the Virgo cluster due to its gravitational pull ,
Revised: A ~ 62 My periodicity in fossil biodiversity has been observed in independent studies of paleobiology databases going back 542 My . The period and phase of this biodiversity cycle coincides with the motion of our solar system in the galactic disk that oscillates perpendicular to the galactic plane with an amplitude of about 70 parsecs and a period of 63.6 My. Our Galaxy is falling toward the Virgo cluster ,
Edit intent: clarity
Original:  Secondary particles such as muons produced as a result of nuclear interactions are able to reach the ground , enhancing the biological radiation dose , causing DNA damage and increasing mutation rates, which can have serious biological implications . Using a Monte Carlo simulation package CORSIKA, we quantify these effects resulting from enhanced muon exposure from cosmic rays and discuss their implications for terrestrial biodiversity variations.
Revised:  Secondary particles such as muons produced as a result of nuclear interactions are able to reach the ground and enhance the biological radiation dose , causing DNA damage and increasing mutation rates, which can have serious biological implications . Using a Monte Carlo simulation package CORSIKA, we quantify these effects resulting from enhanced muon exposure from cosmic rays and discuss their implications for terrestrial biodiversity variations.
Edit intent: fluency
Original:  Secondary particles such as muons produced as a result of nuclear interactions are able to reach the ground , enhancing the biological radiation dose , causing DNA damage and increasing mutation rates, which can have serious biological implications . Using a Monte Carlo simulation package CORSIKA, we quantify these effects resulting from enhanced muon exposure from cosmic rays and discuss their implications for terrestrial biodiversity variations.
Revised:  Secondary particles such as muons produced as a result of nuclear interactions are able to reach the ground , enhancing the biological radiation dose . Using a Monte Carlo simulation package CORSIKA, we quantify these effects resulting from enhanced muon exposure from cosmic rays and discuss their implications for terrestrial biodiversity variations.
Edit intent: coherence
Original:  Secondary particles such as muons produced as a result of nuclear interactions are able to reach the ground , enhancing the biological radiation dose , causing DNA damage and increasing mutation rates, which can have serious biological implications . Using a Monte Carlo simulation package CORSIKA, we quantify these effects resulting from enhanced muon exposure from cosmic rays and discuss their implications for terrestrial biodiversity variations.
Revised:  Secondary particles such as muons produced as a result of nuclear interactions are able to reach the ground , enhancing the biological radiation dose , causing DNA damage and increasing mutation rates, which can have serious biological implications . Using a Monte Carlo simulation package CORSIKA, we compute the biological dose resulting from enhanced muon exposure from cosmic rays and discuss their implications for terrestrial biodiversity variations.
Edit intent: clarity
Original:  k-satisfiability problem is a well-known task in computational complexity theory.
Revised: The k-satisfiability problem is a well-known task in computational complexity theory.
Edit intent: clarity
Original: Specifying and implementing flexible human-computer dialogs, such as those used in ATMs, airport and train kiosks , and apps for smart phones and similar devices , is challenging because of the numerous and varied directions in which each user might steer a dialog , all of which must be captured in a specification and implementation of it.
Revised: Specifying and implementing flexible human-computer dialogs, such as those used in kiosks and smart phone apps , is challenging because of the numerous and varied directions in which each user might steer a dialog , all of which must be captured in a specification and implementation of it.
Edit intent: clarity
Original:  To do so we enriched a notation based on concepts from programming languages, including currying and partial evaluation, for specifying a variety of unsolicited reporting, mixed-initiative dialogs in a concise representation which serves as a plan for implementing the dialog .
Revised:  To do so we enriched a notation based on concepts from programming languages, especially partial evaluation, for specifying a variety of unsolicited reporting, mixed-initiative dialogs in a concise representation which serves as a plan for implementing the dialog .
Edit intent: clarity
Original:  To do so we enriched a notation based on concepts from programming languages, including currying and partial evaluation, for specifying a variety of unsolicited reporting, mixed-initiative dialogs in a concise representation which serves as a plan for implementing the dialog .
Revised:  To do so we enriched a notation based on concepts from programming languages, including currying and partial evaluation, for specifying a variety of unsolicited reporting, mixed-initiative dialogs in a concise representation that serves as a plan for implementing the dialog .
Edit intent: fluency
Original:  To do so we enriched a notation based on concepts from programming languages, including currying and partial evaluation, for specifying a variety of unsolicited reporting, mixed-initiative dialogs in a concise representation which serves as a plan for implementing the dialog .
Revised:  To do so we enriched a notation based on concepts from programming languages, including currying and partial evaluation, for specifying a variety of unsolicited reporting, mixed-initiative dialogs in a concise representation which serves as a design for dialog implementation .
Edit intent: clarity
Original:  We also built a dialog mining system which extracts specifications in this notation from dialog requirements.
Revised:  We also built a dialog mining system that extracts a specification in this notation from dialog requirements.
Edit intent: fluency
Original:  We also built a dialog mining system which extracts specifications in this notation from dialog requirements.
Revised:  We also built a dialog mining system which extracts specifications in this notation from requirements.
Edit intent: fluency
Original:  To demonstrate that the structure of a dialog specification in this notation provides a design for its implementation, we built a system which automatically generates an implementation ( called a stager ) for itgiven its representation in this notation.
Revised:  To demonstrate that such a specification provides a design for its implementation, we built a system which automatically generates an implementation ( called a stager ) for itgiven its representation in this notation.
Edit intent: clarity
Original:  To demonstrate that the structure of a dialog specification in this notation provides a design for its implementation, we built a system which automatically generates an implementation ( called a stager ) for itgiven its representation in this notation.
Revised:  To demonstrate that the structure of a dialog specification in this notation provides a design for dialog implementation, we built a system which automatically generates an implementation ( called a stager ) for itgiven its representation in this notation.
Edit intent: fluency
Original:  To demonstrate that the structure of a dialog specification in this notation provides a design for its implementation, we built a system which automatically generates an implementation ( called a stager ) for itgiven its representation in this notation.
Revised:  To demonstrate that the structure of a dialog specification in this notation provides a design for its implementation, we built a system that automatically generates an implementation ( called a stager ) for itgiven its representation in this notation.
Edit intent: fluency
Original:  To demonstrate that the structure of a dialog specification in this notation provides a design for its implementation, we built a system which automatically generates an implementation ( called a stager ) for itgiven its representation in this notation.
Revised:  To demonstrate that the structure of a dialog specification in this notation provides a design for its implementation, we built a system which automatically generates an implementation of the dialog, called a stager ) for itgiven its representation in this notation.
Edit intent: clarity
Original:  This resulted in a dialog modeling toolkit which automates the process of specifying and implementing dialogs .
Revised:  This resulted in a dialog modeling toolkit that automates dialog specification and implementation .
Edit intent: clarity
Original:  These results provide a proof of concept and demonstrate the promise of studying dialog specification and implementation from a programming languages perspective.
Revised:  These results provide a proof of concept and demonstrate the study of dialog specification and implementation from a programming languages perspective.
Edit intent: clarity
Original:  The ubiquity of dialogs in domains such as banking and travel, education, and health care , combined with the increased use of smart phones as personal computing devices and the proliferation of apps for them, provide a fertile landscape for the application of these results.
Revised:  The ubiquity of dialogs in domains such as travel, education, and health care , combined with the increased use of smart phones as personal computing devices and the proliferation of apps for them, provide a fertile landscape for the application of these results.
Edit intent: clarity
Original:  The ubiquity of dialogs in domains such as banking and travel, education, and health care , combined with the increased use of smart phones as personal computing devices and the proliferation of apps for them, provide a fertile landscape for the application of these results.
Revised:  The ubiquity of dialogs in domains such as banking and travel, education, and health care combined with the increased use of smart phones as personal computing devices and the proliferation of apps for them, provide a fertile landscape for the application of these results.
Edit intent: fluency
Original:  The ubiquity of dialogs in domains such as banking and travel, education, and health care , combined with the increased use of smart phones as personal computing devices and the proliferation of apps for them, provide a fertile landscape for the application of these results.
Revised:  The ubiquity of dialogs in domains such as banking and travel, education, and health care , combined with the demand for smart phone apps provide a landscape for further investigation of these results.
Edit intent: clarity
Original:  We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each of logarithmic-size (denoted QMA_log(poly)) , is exactly MQA  , the class of problems which can be efficiently verified via a classical proof and a quantum verifier.
Revised:  We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each of logarithmic-size , is exactly MQA , the class of problems which can be efficiently verified via a classical proof and a quantum verifier.
Edit intent: clarity
Original:  We show that if the number of outcomes per nonadaptive measurement is a polynomially-bounded function, then the expressive power of the proof system is exactly QMA. Finally, we study a class equivalent to QMA(m), denoted SepQMA(m), where the verifier's measurement operator corresponding to outcome accept is a fully separable operator across the m quantum proofs.
Revised:  We show that if the number of outcomes per nonadaptive measurement is a polynomially-bounded function, then the expressive power of the proof system is exactly QMA. Finally, we study a class equivalent to QMA(m), denoted SepQMA(m), where the verifier's measurement operator corresponding to outcome "accept" is a fully separable operator across the m quantum proofs.
Edit intent: clarity
Original:  Using cone programming duality, we give an alternate proof of a result of Harrow and Montanaro [FOCS, p . 633--642 (2010)] that shows a perfect parallel repetition theorem for SepQMA(m) for any m.
Revised:  Using cone programming duality, we give an alternate proof of a result of Harrow and Montanaro [FOCS, pp . 633--642 (2010)] that shows a perfect parallel repetition theorem for SepQMA(m) for any m.
Edit intent: fluency
Original:  In particular, the martingale prices and the second moment of the hedging error can vary significantly and take extreme values, for some extreme choices of the  martingale measures.
Revised:  In particular, the martingale prices and the hedging error can vary significantly and take extreme values, for some extreme choices of the martingale measures.
Edit intent: clarity
Original:  The paper suggests ad discusses some choices of the martingale measures .
Revised:  Some rational choices of the martingale measures .
Edit intent: clarity
Original: For stable electrical supply, voltage frequency of power plants should be synchronized .
Revised: Functions of some networks, such as power grids and large-scale brain networks, rely on not only frequency synchronization, but also phase synchronization .
Edit intent: clarity
Original:  By approximating a power grid with the Kuramoto model, we demonstrate that the cost is minimized in a snowflake-type network topology , which comprises the densely-connected center nodes and peripheral nodes connecting with the center module.
Revised:  By using the Kuramoto model, we demonstrate that the cost is minimized in a snowflake-type network topology , which comprises the densely-connected center nodes and peripheral nodes connecting with the center module.
Edit intent: clarity
Original:  Furthermore, we provide analytical explanation on why the bimodal degree distribution is related to the small amount of synchronization cost.
Revised:  Furthermore, we provide analytical interpretation on why the bimodal degree distribution is related to the small amount of synchronization cost.
Edit intent: clarity
Original:  In this paper , we present the first  approximate nearest-neighbor (ANN) algorithms , which run in polylog( n) time for Bregman divergences of fixed dimension.
Revised:  In this paper we present the first approximate nearest-neighbor (ANN) algorithms , which run in polylog( n) time for Bregman divergences of fixed dimension.
Edit intent: fluency
Original:  In this paper , we present the first  approximate nearest-neighbor (ANN) algorithms , which run in polylog( n) time for Bregman divergences of fixed dimension.
Revised:  In this paper , we present the first provably approximate nearest-neighbor (ANN) algorithms , which run in polylog( n) time for Bregman divergences of fixed dimension.
Edit intent: clarity
Original:  The resulting algorithm resolves a query for a d-dimensional (1+ eps)-ANN in O( (log (n) /eps)^{O(d) O(n log^{d-1 .
Revised:  The resulting algorithm resolves a query for a d-dimensional (1+ eps)-ANN in O( log n) time using O(n log^{d-1 .
Edit intent: clarity
Original: In this paper we present the first provably approximate nearest-neighbor (ANN) algorithms for Bregman divergences.
Revised: In this paper we present the first provable approximate nearest-neighbor (ANN) algorithms for Bregman divergences.
Edit intent: fluency
Original:  In contrast to previous work, thisoutcome allows DANCE to be applied to  large-scale networks .
Revised:  In contrast to previous work, thisoutcome allows DANCE to be applied to the analysis of large-scale networks .
Edit intent: clarity