wanyu/IteraTeR_full_sent huggingface dataset:
Original:  An example is sales, whereby retailers compete through offering consumption bundles to customers with hidden tastes, whereas a manufacturer with a potentially different goal than retailers' is limited to regulating the sold goods but not the charged prices by legal barriers.
Revised:  An example is sales, whereby retailers compete through offering consumption bundles to customers with hidden tastes, whereas a manufacturer with a potentially different goal than retailers' is limited to regulating the sold goods but not retail prices by legal barriers.
Edit intent: fluency
Original: The rank invariant is of great interest in studying both one-dimensional and multidimensional persistence modules. Based on a category theoretical point of view, we generalize the rank invariant to zigzag modules. We prove that the rank invariant of a zigzag module recovers its interval decomposition. This proves that the rank invariant is a complete invariant for zigzag modules. The degree of difference between the rank invariants of any two zigzag modules can be measured via the erosion distance proposed by A.~Patel. We show that this erosion distance is bounded from above by the interleaving distance between the zigzag modules up to a multiplicative constant. Our construction allows us to extend the notion of   \rightarrow C from a category theory perspective.
Revised: When a category \mathcal{C notion of \rightarrow C from a category theory perspective.
Edit intent: meaning-changed
Original:  Generalizing this idea allows freedom of choosing the indexing poset P of F: P \rightarrow C in defining Patel's } generalized persistence diagram by A. ~Patel to zigzag modules valued in a symmetric monoidal bicomplete category .
Revised:  Generalizing this idea allows freedom of choosing the indexing poset P of F: P \rightarrow C in defining Patel's } generalized persistence diagram of F. By specializing our idea to zigzag persistence modules, we also show that the barcode of a Reeb graph can be obtained in a purely set-theoretic setting without passing to the category of vector spaces. This leads to a promotion of Patel's semicontinuity theorem about type \mathcal{A .
Edit intent: meaning-changed
Original:  While walking like a molecular motor along a DNA track in a step-by-step manner, a RNAP simultaneously synthesizes a RNA chain , in each forward step it elongates the nascent RNA molecule by one unit, using the DNA track also as the template.
Revised:  While walking like a molecular motor along a DNA track in a step-by-step manner, a RNAP simultaneously synthesizes a RNA chain ; in each forward step it elongates the nascent RNA molecule by one unit, using the DNA track also as the template.
Edit intent: fluency
Original:  Recent efforts  have identified several constraints in the design of exascale software that include massive concurrency, resilience management, exploiting the high performance of heterogeneous systems, energy efficiency, and utilizing the deeper and more complex memory hierarchy expected at exascale.
Revised:  Recent efforts (Dongarra et al. 2011) have identified several constraints in the design of exascale software that include massive concurrency, resilience management, exploiting the high performance of heterogeneous systems, energy efficiency, and utilizing the deeper and more complex memory hierarchy expected at exascale.
Edit intent: meaning-changed
Original:  Recent efforts  have identified several constraints in the design of exascale software that include massive concurrency, resilience management, exploiting the high performance of heterogeneous systems, energy efficiency, and utilizing the deeper and more complex memory hierarchy expected at exascale.
Revised:  Recent efforts have identified several constraints in the design of exascale software that includes massive concurrency, resilience management, exploiting the high performance of heterogeneous systems, energy efficiency, and utilizing the deeper and more complex memory hierarchy expected at exascale.
Edit intent: fluency
Original:  However, a major challenge is to reduce the complexity of layered GCNs and make them parallelizable and scalable on very large graphs --- state-of the art techniques are unable to achieve scalability without losing accuracy and efficiency.
Revised:  However, a major challenge is to reduce the complexity of layered GCNs and make them parallelizable and scalable on very large graphs -- state-of the art techniques are unable to achieve scalability without losing accuracy and efficiency.
Edit intent: fluency
Original: We study how shocks to the forward-looking expectations of investors buying call and put options transmit across the financial system. We introduce a new contagion measure, called asymmetric fear connectedness (AFC), which captures the information related to "fear" on the two sides of the options market and can be used as a forward-looking systemic risk monitoring tool. The decomposed connectedness measures provide timely predictive information for near-future macroeconomic conditions and uncertainty indicators, and they contain additional valuable information that is not included in the aggregate connectedness measure.
Revised: We study how shocks to the forward-looking measures of the network connectedness of fears in the financial system, arising due to the good and bad beliefs of market participants about uncertainty that spreads unequally across a network of banks. We argue that this asymmetric network structure extracted from call and put traded option prices of the main U.S. banks contains valuable information for predicting macroeconomic conditions and uncertainty indicators, and they contain additional valuable information that is not included in the aggregate connectedness measure.
Edit intent: clarity
Original:  The decomposed connectedness measures provide timely predictive information for near-future macroeconomic conditions and uncertainty indicators, and they contain additional valuable information that is not included in the aggregate connectedness measure. The role of a positive/negative "fear" transmitter/receiver emerges clearly when we focus more closely on idiosyncratic events for financial institutions. We identify banks that are predominantly positive/negative receivers of "fear", as well as banks that positively/negatively transmit "fear" in the financial system .
Revised:  The decomposed connectedness measures provide timely predictive information for near-future macroeconomic conditions and economic uncertainty, and it can serve as a tool for forward-looking systemic risk monitoring .
Edit intent: clarity
Original:  First, given a selection of CPU-GPU configurations, we show that for a specific DL framework, different configurations of its hyper-parameters may have  significant impact on both performance and accuracy of DL applications.
Revised:  First, given a selection of CPU-GPU configurations, we show that for a specific DL framework, different configurations of its hyper-parameters may have a significant impact on both performance and accuracy of DL applications.
Edit intent: fluency
Original:  Second, the optimal configuration of hyper-parameters for one DL framework (e.g., TensorFlow) often does not work well for another DL framework (e.g., Caffe or Torch) under the same CPU-GPU runtime environment .
Revised:  Second, to the best of our knowledge, this study is the first to identify the opportunities for improving the training time performance and the accuracy of DL frameworks by configuring parallel computing libraries and tuning individual and multiple hyper-parameters for one DL framework (e.g., TensorFlow) often does not work well for another DL framework (e.g., Caffe or Torch) under the same CPU-GPU runtime environment .
Edit intent: meaning-changed
Original:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Revised:  In response , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Edit intent: clarity
Original:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Revised:  In response to this problem , researchers have proposed using compilers and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Edit intent: clarity
Original:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Revised:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing high-level APIs such as NumPy and TensorFlow . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Edit intent: meaning-changed
Original:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Revised:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these techniques generally do not require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Edit intent: clarity
Original:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Revised:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user applications , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Edit intent: clarity
Original:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Revised:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, library developers must rewrite each function using a new IR or virtual machine .
Edit intent: clarity
Original:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR or virtual machine .
Revised:  In response to this problem , researchers have proposed new runtimes and intermediate representations (IRs) that apply optimizations such as loop fusion under existing library APIs . Even though these runtimes generally do no require changes to user code , they require intrusive changes to the library itself: often, all the library functions need to be rewritten for a new IR .
Edit intent: clarity
Original:  Without modifying any library function, on workloads using NumPy and Pandas in Python and Intel MKL in C, Mozart provides performance competitive with intrusive solutions that require rewriting libraries in many cases, can sometimes improve performance over past systems by up to 2x , and accelerates workloads by up to 30x .
Revised:  We show that Mozart can accelerate workloads in libraries such as Intel MKL and Pandas by up to 15x, with no library modifications. Mozart also provides performance gains competitive with solutions that require rewriting libraries in many cases, can sometimes improve performance over past systems by up to 2x , and accelerates workloads by up to 30x .
Edit intent: meaning-changed
Original:  Without modifying any library function, on workloads using NumPy and Pandas in Python and Intel MKL in C, Mozart provides performance competitive with intrusive solutions that require rewriting libraries in many cases, can sometimes improve performance over past systems by up to 2x , and accelerates workloads by up to 30x .
Revised:  Without modifying any library function, on workloads using NumPy and Pandas in Python and Intel MKL in C, Mozart provides performance competitive with intrusive solutions that require rewriting libraries , and can sometimes outperform these systems by up to 2x , and accelerates workloads by up to 30x .
Edit intent: clarity
Original:  Without modifying any library function, on workloads using NumPy and Pandas in Python and Intel MKL in C, Mozart provides performance competitive with intrusive solutions that require rewriting libraries in many cases, can sometimes improve performance over past systems by up to 2x , and accelerates workloads by up to 30x .
Revised:  Without modifying any library function, on workloads using NumPy and Pandas in Python and Intel MKL in C, Mozart provides performance competitive with intrusive solutions that require rewriting libraries in many cases, can sometimes improve performance over past systems by up to 2x by leveraging existing hand-optimized code .
Edit intent: meaning-changed
Original: It is well established that not only vision but also other sensory modalities affect drivers' control of their vehicles, and that drivers adapt over time to persistent changes in sensory cues , for example in driving simulators  , but the mechanisms underlying these behavioural phenomena are poorly understood.
Revised: It is well established that not only vision but also other sensory modalities affect drivers' control of their vehicles, and that drivers adapt over time to persistent changes in sensory cues ( for example in driving simulators , but the mechanisms underlying these behavioural phenomena are poorly understood.
Edit intent: fluency
Original: It is well established that not only vision but also other sensory modalities affect drivers' control of their vehicles, and that drivers adapt over time to persistent changes in sensory cues , for example in driving simulators  , but the mechanisms underlying these behavioural phenomena are poorly understood.
Revised: It is well established that not only vision but also other sensory modalities affect drivers' control of their vehicles, and that drivers adapt over time to persistent changes in sensory cues , for example in driving simulators ) , but the mechanisms underlying these behavioural phenomena are poorly understood.
Edit intent: fluency
Original:  Here, we consider the existing literature on how driver steering in slalom tasks is affected by  down-scaling of vestibular cues, and propose a driver model that can explain the empirically observed effects : Initially decreased task performance and increased steering effort , and partial reversal of these effects with prolonged task exposure . Unexpectedly, the model also reproduced another empirical finding: A local optimum for motion down-scaling, where path-tracking is better than with one-to-one motion cues  .
Revised:  Here, we consider the existing literature on how driver steering in slalom tasks is affected by down-scaling of vestibular cues, and propose a driver model that can explain the empirically observed effects , namely: decreased task performance and increased steering effort , and partial reversal of these effects with prolonged task exposure . Unexpectedly, the model also reproduced another empirical finding: A local optimum for motion down-scaling, where path-tracking is better than with one-to-one motion cues .
Edit intent: coherence
Original:  Initially decreased task performance and increased steering effort , and partial reversal of these effects with prolonged task exposure . Unexpectedly, the model also reproduced another empirical finding: A local optimum for motion down-scaling, where path-tracking is better than with one-to-one motion cues  .
Revised:  Initially decreased task performance and increased steering effort during initial exposure, followed by a partial reversal of these effects with prolonged task exposure . Unexpectedly, the model also reproduced another empirical finding: A local optimum for motion down-scaling, where path-tracking is better than with one-to-one motion cues .
Edit intent: clarity
Original:  Initially decreased task performance and increased steering effort , and partial reversal of these effects with prolonged task exposure . Unexpectedly, the model also reproduced another empirical finding: A local optimum for motion down-scaling, where path-tracking is better than with one-to-one motion cues  .
Revised:  Initially decreased task performance and increased steering effort , and partial reversal of these effects as task exposure is prolonged . Unexpectedly, the model also reproduced another empirical finding: A local optimum for motion down-scaling, where path-tracking is better than with one-to-one motion cues .
Edit intent: clarity
Original:  Initially decreased task performance and increased steering effort , and partial reversal of these effects with prolonged task exposure . Unexpectedly, the model also reproduced another empirical finding: A local optimum for motion down-scaling, where path-tracking is better than with one-to-one motion cues  .
Revised:  Initially decreased task performance and increased steering effort , and partial reversal of these effects with prolonged task exposure . Unexpectedly, the model also reproduced another empirical finding: a local optimum for motion down-scaling, where path-tracking is better than with one-to-one motion cues .
Edit intent: fluency
Original:  Initially decreased task performance and increased steering effort , and partial reversal of these effects with prolonged task exposure . Unexpectedly, the model also reproduced another empirical finding: A local optimum for motion down-scaling, where path-tracking is better than with one-to-one motion cues  .
Revised:  Initially decreased task performance and increased steering effort , and partial reversal of these effects with prolonged task exposure . Unexpectedly, the model also reproduced another empirical finding: A local optimum for motion down-scaling, where path-tracking is better than when one-to-one motion cues .
Edit intent: clarity
Original:  Initially decreased task performance and increased steering effort , and partial reversal of these effects with prolonged task exposure . Unexpectedly, the model also reproduced another empirical finding: A local optimum for motion down-scaling, where path-tracking is better than with one-to-one motion cues  .
Revised:  Initially decreased task performance and increased steering effort , and partial reversal of these effects with prolonged task exposure . Unexpectedly, the model also reproduced another empirical finding: A local optimum for motion down-scaling, where path-tracking is better than with one-to-one motion cues are available .
Edit intent: clarity
Original:  Overall, the results imply that: (1) Drivers make direct use of vestibular information as part of determining appropriate steering, and (2) motion down-scaling causes a yaw rate underestimation phenomenon, where drivers behave as if they perceive the simulated vehicle to rotate more slowly than it is.
Revised:  Overall, the results imply that: (1) drivers make direct use of vestibular information as part of determining appropriate steering, and (2) motion down-scaling causes a yaw rate underestimation phenomenon, where drivers behave as if they perceive the simulated vehicle to rotate more slowly than it is.
Edit intent: fluency
Original:  Overall, the results imply that: (1) Drivers make direct use of vestibular information as part of determining appropriate steering, and (2) motion down-scaling causes a yaw rate underestimation phenomenon, where drivers behave as if they perceive the simulated vehicle to rotate more slowly than it is.
Revised:  Overall, the results imply that: (1) Drivers make direct use of vestibular information as part of determining appropriate steering, and (2) motion down-scaling causes a yaw rate underestimation phenomenon, where drivers behave as if the simulated vehicle to rotate more slowly than it is.
Edit intent: clarity
Original:  Overall, the results imply that: (1) Drivers make direct use of vestibular information as part of determining appropriate steering, and (2) motion down-scaling causes a yaw rate underestimation phenomenon, where drivers behave as if they perceive the simulated vehicle to rotate more slowly than it is.
Revised:  Overall, the results imply that: (1) Drivers make direct use of vestibular information as part of determining appropriate steering, and (2) motion down-scaling causes a yaw rate underestimation phenomenon, where drivers behave as if they perceive the simulated vehicle is rotating more slowly than it is.
Edit intent: fluency
Original:  Furthermore, (4) behavioural adaptation, as empirically observed in slalom tasks, may occur due to (a) down-weighting of vestibular cues, and/or (b) increased sensitivity to control errors, in determining when to adjust steering and by how much, but (c) seemingly not in the form of a full compensatory rescaling of the down-scaled vestibular input.
Revised:  Furthermore, (4) behavioural adaptation, as empirically observed in slalom tasks, may occur due to (a) down-weighting of vestibular cues, and/or (b) increased sensitivity to control errors, in determining when to adjust steering and by how much, but (c) seemingly not in the form of a full compensatory rescaling of the received vestibular input.
Edit intent: clarity