wanyu/IteraTeR_v2 huggingface dataset:
Original:  Even when Kaczmarz's method is supplied with an oracle that provides the exact error--and is thereby able to stop at the best possible iterate-- our methods have a lower two-norm error in almost 90%DIFDELCMD < \\%%% %DIF < of  our test cases.
Revised:  Even when Kaczmarz's method is supplied with an oracle that provides the exact error--and is thereby able to stop at the best possible iterate-- our methods have a lower two-norm error in almost 90%DIFDELCMD < \\%%% %DIF < of the vast majority of our test cases.
Edit intent: clarity
Original:  Even when Kaczmarz's method is supplied with an oracle that provides the exact error--and is thereby able to stop at the best possible iterate-- our methods have a lower two-norm error in the vast majority of our test cases.
Revised:  Even when Kaczmarz's method is supplied with an oracle that provides the exact error -- and is thereby able to stop at the best possible iterate-- our methods have a lower two-norm error in the vast majority of our test cases.
Edit intent: fluency
Original:  Even when Kaczmarz's method is supplied with an oracle that provides the exact error--and is thereby able to stop at the best possible iterate-- our methods have a lower two-norm error in the vast majority of our test cases.
Revised:  Even when Kaczmarz's method is supplied with an oracle that provides the exact error--and is thereby able to stop at the best possible iterate -- our methods have a lower two-norm error in the vast majority of our test cases.
Edit intent: fluency
Original: Multifractal Detrended Cross-Correlation methodology is applied to the foreign exchange (Forex) market .
Revised: Multifractal detrended cross-correlation methodology is described and applied to Foreign exchange (Forex) market .
Edit intent: clarity
Original:  High frequency fluctuations of exchange rates of eight major world currencies over the period 2010--2018 are used to study cross-correlations.
Revised:  High frequency fluctuations of exchange rates of eight major world currencies over 2010-2018 period are used to study cross-correlations.
Edit intent: fluency
Original:  Hierarchical organization of ties between the exchange rates, formulated in terms of the dendrograms, are however more pronounced on the level of larger fluctuations.
Revised:  Hierarchical organization of ties expressed in terms of the dendrograms, are however more pronounced on the level of larger fluctuations.
Edit intent: clarity
Original: This in particular applies to those exchange rates that involve the Australian and New Zealand dollars and reflects their economic relations.
Revised: This in particular applies to those exchange rates that involve Australian and New Zealand dollars and reflects their economic relations.
Edit intent: clarity
Original:  In the years 2010--2018 such instances took place in connection with the Swiss National Bank intervention and the weakening of British pound sterling accompanying the initiation of Brexit procedure  .
Revised:  In 2010--2018 such instances took place in connection with the Swiss National Bank intervention and the weakening of British pound sterling accompanying the initiation of Brexit procedure .
Edit intent: clarity
Original:  This technology, allowing more accessible, dynamic and intelligent form of Shared Mobility, is expected to revolutionize urban transportation.
Revised:  This technology, allowing more accessible, dynamic and intelligent form of Shared Mobility, are expected to revolutionize urban transportation.
Edit intent: fluency
Original:  One of the conceivable mobility services based on driverless cars are shared autonomous vehicles (SAVs).
Revised:  One of the conceivable mobility services based on driverless cars is shared autonomous vehicles (SAVs).
Edit intent: fluency
Original:  This service could merge taxis, carsharing and ridesharing systems into a singular transportation mode.
Revised:  This service could merge cabs, carsharing, and ridesharing systems into a singular transportation mode.
Edit intent: fluency
Original:  However, the success and competitiveness of future SAV services depend on its operational models, which are linked intrinsically to the service configuration and fleet specification.
Revised:  However, the success and competitiveness of future SAV services depend on their operational models, which are linked intrinsically to the service configuration and fleet specification.
Edit intent: fluency
Original:  On the other hand , any change on operational models will result in a different demand.
Revised:  In addition , any change on operational models will result in a different demand.
Edit intent: coherence
Original:  On the other hand , any change on operational models will result in a different demand.
Revised:  On the other hand , any change in operational models will result in a different demand.
Edit intent: fluency
Original:  The impact of ridesharing and rebalancing strategies on service performance is furthermore investigated.
Revised:  Also, the impact of ridesharing and rebalancing strategies on service performance is furthermore investigated.
Edit intent: coherence
Original:  The impact of ridesharing and rebalancing strategies on service performance is furthermore investigated.
Revised:  The impact of ridesharing and rebalancing strategies on service performance is investigated.
Edit intent: coherence
Original: Research results suggest that the performance of SAV is strongly correlated to the fleet size and the strategy of individual or shared rides.
Revised: Research results suggest that the performance of SAV is strongly correlated with the fleet size and the strategy of individual or shared rides.
Edit intent: fluency
Original:  The results underline also that enabling vehicle-rebalancing strategies may have an important effect on both user and service related metrics.
Revised:  The results also underline that enabling vehicle-rebalancing strategies may have an important effect on both user and service related metrics.
Edit intent: fluency
Original:  The results underline also that enabling vehicle-rebalancing strategies may have an important effect on both user and service related metrics.
Revised:  The results underline also that enabling vehicle-rebalancing strategies may have an important effect on both user and service-related metrics.
Edit intent: fluency
Original:  The present report describes an algorithm that remedies this problem, using per-target adaptive sampling of the source geometry.
Revised:  This paper describes an algorithm that remedies this problem, using per-target adaptive sampling of the source geometry.
Edit intent: clarity
Original:  The combinatorics of the problem space is explored  and a novel method is described that allows users to count the number of possible equations in a defined problem space.
Revised:  The combinatorics of the problem space is explored , and a novel method is described that allows users to count the number of possible equations in a defined problem space.
Edit intent: fluency
Original:  We provide a methodology to do uniform random sampling from this large but finite set of equations.
Revised:  We provide a methodology to do uniform random sampling from the set of all permitted equations.
Edit intent: clarity
Original:  Of the cases that were not tied, genetic programming was best in 65.6\% of experiments (99\% CI, 60.7\%, 69.2\%%DIFDELCMD < ]%%% ).
Revised:  Of the cases that were not tied, genetic programming was best in 65.6\% of experiments (99\% CI, %DIFDELCMD < ]%%% ).
Edit intent: coherence
Original: A comprehensive and up-to-date analysis of Computer Science literature ( 2.87 million papers through 2018 ) reveals that, if current trends continue, parity between the number of male and female authors will not be reached in this century.
Revised: A large-scale, up-to-date analysis of Computer Science literature ( 2.87 million papers through 2018 ) reveals that, if current trends continue, parity between the number of male and female authors will not be reached in this century.
Edit intent: clarity
Original:  Under our most optimistic projection models, gender parity is forecast to be reached by 2100, and significantly later under more realistic assumptions.
Edit intent: coherence
Original:  Finally, our analysis of collaboration trends in Computer Science reveals decreasing rates of collaboration between authors of different genders .
Revised:  Finally, our analysis of collaboration trends in Computer Science reveals shifts in the size of the collaboration gap between authors of different genders .
Edit intent: clarity
Original: In this study, we investigate the extent to that patent citations to papers can serve as early signs for predicting delayed recognition using a comparative study with a control group, i.e., instant recognition papers.
Revised: In this study, we investigate the extent to which patent citations to papers can serve as early signs for predicting delayed recognition using a comparative study with a control group, i.e., instant recognition papers.
Edit intent: fluency
Original:  We provide indication that in the more recent years papers with delayed recognition are awakened more often and more earlier by a patent rather than by a scientific paper (also called "prince").
Revised:  We provide indication that in the more recent years papers with delayed recognition are awakened more often and earlier by a patent rather than by a scientific paper (also called "prince").
Edit intent: clarity
Original:  In contrast to the two focus fields (biology and chemistry) for instant recognition papers, delayed recognition papers are rather evenly distributed in biology, chemistry, psychology, geology, materials science, and physics.
Revised:  In contrast to the two focused fields (biology and chemistry) for instant recognition papers, delayed recognition papers are rather evenly distributed in biology, chemistry, psychology, geology, materials science, and physics.
Edit intent: fluency
Original:  We discovered several pairs of "science sleeping"-"technology inducing", such as biology-biotechnology/pharmaceuticals, chemistry-chemical engineering, psychology-computer/control technology, and physics-computer technology .
Revised:  We discovered several pairs of "science sleeping"-"technology ... .
Edit intent: coherence
Original:  There are different techniques for implementing the surface code, and lattice surgeryis considered the most resource efficient method  .
Revised:  There are different techniques for implementing the surface code, and lattice surgeryis considered the most resource efficient method to implement surface code computations .
Edit intent: clarity
Original:  Resource efficiency refers to the number of physical qubits an the time necessary for executing a quantum computation.
Revised:  Resource efficiency refers to the number of physical qubits and the time necessary for executing a quantum computation.
Edit intent: fluency
Original:  It is a first step towards techniques that aid quantum algorithm design informed by the realities of the hardware architectures.
Revised:  It is a first step towards methods that aid quantum algorithm design informed by the realities of the hardware architectures.
Edit intent: clarity
Original:  OpenSurgery can  lay out arbitrary quantum circuits,  estimate the quantum resources used for their execution, and it includes an interactive 3D visualisation of the resulting topological assemblies.
Revised:  OpenSurgery can lay out arbitrary quantum circuits, estimate the quantum resources used for their execution, 3) visualise the resulting 3D visualisation of the resulting topological assemblies.
Edit intent: clarity
Original:  OpenSurgery can  lay out arbitrary quantum circuits,  estimate the quantum resources used for their execution, and it includes an interactive 3D visualisation of the resulting topological assemblies.
Revised:  OpenSurgery can lay out arbitrary quantum circuits, estimate the quantum resources used for their execution, and it includes an interactive 3D topological assemblies.
Edit intent: clarity
Original:  We investigate a model based on the network of the seven discrete chemo-mechanical states of a ribosome using a graph-theoretic approach to derive the exact solution of the corresponding master equations.
Revised:  We investigate a model formulated in terms of the network of the seven discrete chemo-mechanical states of a ribosome using a graph-theoretic approach to derive the exact solution of the corresponding master equations.
Edit intent: clarity
Original:  We investigate a model based on the network of the seven discrete chemo-mechanical states of a ribosome using a graph-theoretic approach to derive the exact solution of the corresponding master equations.
Revised:  We investigate a model based on the network of discrete chemo-mechanical states of a ribosome using a graph-theoretic approach to derive the exact solution of the corresponding master equations.
Edit intent: clarity
Original:  We investigate a model based on the network of the seven discrete chemo-mechanical states of a ribosome using a graph-theoretic approach to derive the exact solution of the corresponding master equations.
Revised:  We investigate a model based on the network of the seven discrete chemo-mechanical states of a ribosome using a graph-theoretic approach . We derive the exact solution of the corresponding master equations.
Edit intent: fluency
Original:  We also discuss the stochastic thermodynamics of a ribosome by computing entropy production as functions of the rates of the interstate transitions  .
Revised:  We also compute entropy production as functions of the rates of the interstate transitions .
Edit intent: coherence
Original:  To that end, we propose  a 2-step consensus protocol that uses an outlier detection algorithm for a blockchain-based IoT network implemented on hyperledger fabric platform.
Revised:  To that end, we propose a 2-step consensus protocol that uses an outlier detection algorithm for consensus in an IoT network implemented on hyperledger fabric platform.
Edit intent: clarity
Original:  The outlier-aware consensus protocol first detects anomaly activities via a learned detector  .
Revised:  The outlier-aware consensus protocol first detects anomaly activities via a learned detector in the first step .
Edit intent: clarity
Original:  Results reveal that our implemented  2-step consensus protocol  improves hyperledger fabric performance in terms of fault tolerance by marginally compromising the delay performance.
Revised:  Results reveal that our implemented 2-step consensus protocol ) improves hyperledger fabric performance in terms of fault tolerance by marginally compromising the delay performance.
Edit intent: fluency
Original: The contributions of this paper are two-fold.
Revised: Two central concepts from topological data analysis are persistence and the Mapper construction. Persistence employs a sequence of objects built on data called a filtration. A Mapper produces insightful summaries of data, and has found widespread applications in diverse areas.
Edit intent: coherence
Original:  We then develop a language and theory for stable paths within this filtration , inspired by ideas of persistent homology .
Revised:  We then develop a theory for stable paths within this filtration , inspired by ideas of persistent homology .
Edit intent: clarity
Original:  We demonstrate how the filtration and paths can be applied to a variety of applications in which defining a metric is not obvious but a cover is readily available.
Revised:  We demonstrate how our framework can be employed in a variety of applications in which defining a metric is not obvious but a cover is readily available.
Edit intent: clarity
Original:  We demonstrate how the filtration and paths can be applied to a variety of applications in which defining a metric is not obvious but a cover is readily available.
Revised:  We demonstrate how the filtration and paths can be applied to a variety of applications where a metric is not obvious but a cover is readily available.
Edit intent: clarity
Original:  For an explicit example, we look at a movies data set and we find the stable paths identified in our framework represent a sequence of movies constituting a gentle transition and ordering from one genre to another.
Revised:  For an explicit example, stable paths identified on a movies data set and we find the stable paths identified in our framework represent a sequence of movies constituting a gentle transition and ordering from one genre to another.
Edit intent: clarity
Original:  For an explicit example, we look at a movies data set and we find the stable paths identified in our framework represent a sequence of movies constituting a gentle transition and ordering from one genre to another.
Revised:  For an explicit example, we look at a movies data set represent sequences of movies constituting a gentle transition and ordering from one genre to another.
Edit intent: coherence
Original:  For an explicit example, we look at a movies data set and we find the stable paths identified in our framework represent a sequence of movies constituting a gentle transition and ordering from one genre to another.
Revised:  For an explicit example, we look at a movies data set and we find the stable paths identified in our framework represent a sequence of movies constituting gentle transitions from one genre to another.
Edit intent: clarity
Original:  In many real-world settings , votes come in sequentially, and the briber may have a use-it-or-lose-it moment to decide whether to bribe/ alter a given vote, and at the time of making that decision , the briber may not know what votes remaining voters are planning on casting.
Revised:  In many real-world settings votes come in sequentially, and the briber may have a use-it-or-lose-it moment to decide whether to bribe/ alter a given vote, and at the time of making that decision , the briber may not know what votes remaining voters are planning on casting.
Edit intent: fluency
Original:  In many real-world settings , votes come in sequentially, and the briber may have a use-it-or-lose-it moment to decide whether to bribe/ alter a given vote, and at the time of making that decision , the briber may not know what votes remaining voters are planning on casting.
Revised:  In many real-world settings , votes come in sequentially, and the briber may have a use-it-or-lose-it moment to decide whether to alter a given vote, and at the time of making that decision , the briber may not know what votes remaining voters are planning on casting.
Edit intent: clarity
Original:  In many real-world settings , votes come in sequentially, and the briber may have a use-it-or-lose-it moment to decide whether to bribe/ alter a given vote, and at the time of making that decision , the briber may not know what votes remaining voters are planning on casting.
Revised:  In many real-world settings , votes come in sequentially, and the briber may have a use-it-or-lose-it moment to decide whether to bribe/ alter a given vote, and when making that decision , the briber may not know what votes remaining voters are planning on casting.
Edit intent: clarity
Original:  In many real-world settings , votes come in sequentially, and the briber may have a use-it-or-lose-it moment to decide whether to bribe/ alter a given vote, and at the time of making that decision , the briber may not know what votes remaining voters are planning on casting.
Revised:  In many real-world settings , votes come in sequentially, and the briber may have a use-it-or-lose-it moment to decide whether to bribe/ alter a given vote, and at the time of making that decision the briber may not know what votes remaining voters are planning on casting.
Edit intent: fluency
Original:  We show that even for election systems whose winner-determination problem is polynomial-time computable, an online, sequential setting may vastly increase the complexity of bribery, in fact jumping the problem up to completeness for high levels of the polynomial hierarchy or even PSPACE.
Revised:  We show that even for election systems whose winner-determination problem is polynomial-time computable, an online, sequential setting may vastly increase the complexity of bribery, jumping the problem up to completeness for high levels of the polynomial hierarchy or even PSPACE.
Edit intent: coherence
Original:  On the other hand, we show that for some natural, important election systems, such a dramatic complexity increase does not occur, and we pinpoint the complexity of their bribery problems in the online, sequential setting .
Revised:  But we also show that for some natural, important election systems, such a dramatic complexity increase does not occur, and we pinpoint the complexity of their bribery problems in the online, sequential setting .
Edit intent: coherence
Original:  On the other hand, we show that for some natural, important election systems, such a dramatic complexity increase does not occur, and we pinpoint the complexity of their bribery problems in the online, sequential setting .
Revised:  On the other hand, we show that for some natural, important election systems, such a dramatic complexity increase does not occur, and we pinpoint the complexity of their bribery problems .
Edit intent: clarity
Original:  Current practical protocols for secure aggregation work in an " honest but curious " setting where a curious adversary observing all communication to and from the server cannot learn any private information assuming the server is honest and follows the protocol.
Revised:  Current practical protocols for secure aggregation work in an `` honest but curious " setting where a curious adversary observing all communication to and from the server cannot learn any private information assuming the server is honest and follows the protocol.
Edit intent: fluency
Original:  Current practical protocols for secure aggregation work in an " honest but curious " setting where a curious adversary observing all communication to and from the server cannot learn any private information assuming the server is honest and follows the protocol.
Revised:  Current practical protocols for secure aggregation work in an " honest but curious '' setting where a curious adversary observing all communication to and from the server cannot learn any private information assuming the server is honest and follows the protocol.
Edit intent: fluency
Original:  Recent papers by Cheu et al.  and Balle et al. have formalized the "shuffled model" and suggested protocols for secure aggregation that achieve differential privacy guarantees  .
Revised:  Recent papers by Cheu et al. , and Balle et al. have formalized the "shuffled model" and suggested protocols for secure aggregation that achieve differential privacy guarantees .
Edit intent: fluency
Original:  Recent papers by Cheu et al.  and Balle et al. have formalized the "shuffled model" and suggested protocols for secure aggregation that achieve differential privacy guarantees  .
Revised:  Recent papers by Cheu et al. and Balle et al. have given protocols for secure aggregation that achieve differential privacy guarantees .
Edit intent: clarity
Original:  Our new technique is a conceptual "invisibility cloak" that makes users' data almost indistinguishable from random noise while introducing zero distortion on the sum.
Revised:  Our new technique is a conceptual ``invisibility cloak'' that makes users' data almost indistinguishable from random noise while introducing zero distortion on the sum.
Edit intent: fluency
Original:  Current practical protocols for secure aggregation work in an `` honest but curious '' setting where a curious adversary observing all communication to and from the server cannot learn any private information assuming the server is honest and follows the protocol.
Revised:  Current practical protocols for secure aggregation work in an " honest but curious '' setting where a curious adversary observing all communication to and from the server cannot learn any private information assuming the server is honest and follows the protocol.
Edit intent: fluency