wanyu/IteraTeR_full_sent huggingface dataset:
Original:  A theoretical analysis of the phase boundaries shows that the critical force for rupture scales as \left(\log C_{\textrm{m}}\right)^{\alpha} with \alpha=1\,(0.5) for \textrm{ U-I ( \textrm{  \textrm{ I-F } \textrm{ ) transition.
Revised:  A theoretical analysis of the phase boundaries shows that the critical force for rupture scales as \left(\log C_{\textrm{m}}\right)^{\alpha} with \alpha=1\,(0.5) for \textrm{ U-I ( \textrm{ ( \textrm{ I-F } \textrm{ ) transition.
Edit intent: fluency
Original:  A theoretical analysis of the phase boundaries shows that the critical force for rupture scales as \left(\log C_{\textrm{m}}\right)^{\alpha} with \alpha=1\,(0.5) for \textrm{ U-I ( \textrm{  \textrm{ I-F } \textrm{ ) transition.
Revised:  A theoretical analysis of the phase boundaries shows that the critical force for rupture scales as \left(\log C_{\textrm{m}}\right)^{\alpha} with \alpha=1\,(0.5) for \textrm{ U-I ( \textrm{ \textrm{ I } \textrm{ ) transition.
Edit intent: meaning-changed
Original:  A theoretical analysis of the phase boundaries shows that the critical force for rupture scales as \left(\log C_{\textrm{m}}\right)^{\alpha} with \alpha=1\,(0.5) for \textrm{ U-I ( \textrm{  \textrm{ I-F } \textrm{ ) transition.
Revised:  A theoretical analysis of the phase boundaries shows that the critical force for rupture scales as \left(\log C_{\textrm{m}}\right)^{\alpha} with \alpha=1\,(0.5) for \textrm{ U-I ( \textrm{ \textrm{ I-F } \rightleftharpoons\textrm{ ) transition.
Edit intent: meaning-changed
Original:  A theoretical analysis of the phase boundaries shows that the critical force for rupture scales as \left(\log C_{\textrm{m}}\right)^{\alpha} with \alpha=1\,(0.5) for \textrm{ U-I ( \textrm{  \textrm{ I-F } \textrm{ ) transition.
Revised:  A theoretical analysis of the phase boundaries shows that the critical force for rupture scales as \left(\log C_{\textrm{m}}\right)^{\alpha} with \alpha=1\,(0.5) for \textrm{ U-I ( \textrm{ \textrm{ I-F } \textrm{F ) transition.
Edit intent: fluency
Original:  This relation is used to obtain the ion-preferential coefficients, which shows that ion-RNA interactions can be quantitatively measured in single molecule experiments . Our simulations predict a plausible link between the stability of the 5^{\prime} hairpin and efficiency of PRF .
Revised:  This relation is used to obtain the ion-preferential coefficients, which shows that ion-RNA interactions can be quantitatively measured in single molecule experiments , as done previously for DNA hairpins. A by product of our work is the suggestion that the frameshift efficiency is likely determined by the stability of the 5^{\prime} hairpin and efficiency of PRF .
Edit intent: meaning-changed
Original:  However, it is not known how exploration can lead to new phenotypes within the lifetime of a single cell . Here, we address this question by developing a network model of exploration in gene regulation.
Revised:  However, it is not known how exploration can lead to new phenotypes within the lifetime of a cell is not well understood. Here we demonstrate the feasibility of exploratory adaptation in a high-dimensional network model of exploration in gene regulation.
Edit intent: meaning-changed
Original:  Successful convergence depends crucially on network topology and is most efficient for scale-free connectivity. Convergence to an adapted phenotype in this class of networks is achieved without fine tuning of initial conditions or other model parameters, thus making it plausible for biological implementation . Experimental results have indeed shown that gene regulatory networks are characterized by this type of topology, suggesting a structural basis for exploratory adaptation .
Revised:  We find that successful convergence (adaptation) in high dimensions requires outgoing network hubs and is enhanced by their auto-regulation. The ability of these empirically-validated features of gene regulatory networks to support exploratory adaptation without fine-tuning, makes it plausible for biological implementation . Experimental results have indeed shown that gene regulatory networks are characterized by this type of topology, suggesting a structural basis for exploratory adaptation .
Edit intent: meaning-changed
Original:  Convergence to an adapted phenotype in this class of networks is achieved without fine tuning of initial conditions or other model parameters, thus making it plausible for biological implementation . Experimental results have indeed shown that gene regulatory networks are characterized by this type of topology, suggesting a structural basis for exploratory adaptation .
Revised:  Convergence to an adapted phenotype in this class of networks is achieved without fine tuning of initial conditions or other model parameters, thus making it plausible for biological implementation .
Edit intent: clarity
Original:  One of the most important issues encountered when modeling bipartite networks is devising a way to obtain a (monopartite) projection on the layer of interest, which preserves  the information encoded into the original bipartite structure as much as possible .
Revised:  One of the most important issues encountered when modeling bipartite networks is devising a way to obtain a (monopartite) projection on the layer of interest, which preserves as much as possible the information encoded into the original bipartite structure as much as possible .
Edit intent: fluency
Original:  One of the most important issues encountered when modeling bipartite networks is devising a way to obtain a (monopartite) projection on the layer of interest, which preserves  the information encoded into the original bipartite structure as much as possible .
Revised:  One of the most important issues encountered when modeling bipartite networks is devising a way to obtain a (monopartite) projection on the layer of interest, which preserves the information encoded into the original bipartite structure .
Edit intent: clarity
Original:  In the present paper we propose an algorithm to obtain statistically-validated projections of bipartite networks, which implements a simple rule: in order for any two nodes to be linked, the number of shared neighbors must be statistically significant.
Revised:  In the present paper we propose an algorithm to obtain statistically-validated projections of bipartite networks, according to which any two nodes to be linked, the number of shared neighbors must be statistically significant.
Edit intent: clarity
Original:  In the present paper we propose an algorithm to obtain statistically-validated projections of bipartite networks, which implements a simple rule: in order for any two nodes to be linked, the number of shared neighbors must be statistically significant. Naturally, assessing the statistical significance of nodes similarity requires the definition of a proper statistical benchmark : here we consider a set of four null models, defined within the Exponential Random Graph framework.
Revised:  In the present paper we propose an algorithm to obtain statistically-validated projections of bipartite networks, which implements a simple rule: in order for any two nodes sharing a statistically-significant number of neighbors are linked. Since assessing the statistical significance of nodes similarity requires the definition of a proper statistical benchmark : here we consider a set of four null models, defined within the Exponential Random Graph framework.
Edit intent: coherence
Original:  Finally, in order to test our method , we analyze an economic network (i.e. the countries-products World Trade Web representation) and a social network (i.e. the MovieLensdataset , collecting the users' ratings of a list of movies).
Revised:  Finally, we test our method , we analyze an economic network (i.e. the countries-products World Trade Web representation) and a social network (i.e. the MovieLensdataset , collecting the users' ratings of a list of movies).
Edit intent: coherence
Original:  Finally, in order to test our method , we analyze an economic network (i.e. the countries-products World Trade Web representation) and a social network (i.e. the MovieLensdataset , collecting the users' ratings of a list of movies).
Revised:  Finally, in order to test our method on an economic network (i.e. the countries-products World Trade Web representation) and a social network (i.e. the MovieLensdataset , collecting the users' ratings of a list of movies).
Edit intent: clarity
Original:  Finally, in order to test our method , we analyze an economic network (i.e. the countries-products World Trade Web representation) and a social network (i.e. the MovieLensdataset , collecting the users' ratings of a list of movies).
Revised:  Finally, in order to test our method , we analyze an economic network (i.e. the countries-products World Trade Web representation) and a social network (i.e. MovieLens , collecting the users' ratings of a list of movies).
Edit intent: clarity
Original:  In both cases non-trivial communities are detected . In the first case, while projecting the World Trade Web on the countries layer reveals modules of similarly-industrialized nations, projecting it on the products layer allows communities characterized by an increasing level of complexity to be detected;
Revised:  In both cases non-trivial communities are detected : while projecting the World Trade Web on the countries layer reveals modules of similarly-industrialized nations, projecting it on the products layer allows communities characterized by an increasing level of complexity to be detected;
Edit intent: coherence
Original:  With OMAS, we performed the first comprehensive study of real-world ORM framework-based applications, where we analyzed the performance and programming patterns across 26 open-source  applications, covering domains such as forum , e-commerce, project management, blogging , etc.
Revised:  We used CADO to analyze the performance problems of 27 real-world ORM framework-based applications, where we analyzed the performance and programming patterns across 26 open-source applications, covering domains such as forum , e-commerce, project management, blogging , etc.
Edit intent: meaning-changed
Original:  With OMAS, we performed the first comprehensive study of real-world ORM framework-based applications, where we analyzed the performance and programming patterns across 26 open-source  applications, covering domains such as forum , e-commerce, project management, blogging , etc.
Revised:  With OMAS, we performed the first comprehensive study of real-world open-source applications, covering domains such as forum , e-commerce, project management, blogging , etc.
Edit intent: clarity
Original:  With OMAS, we performed the first comprehensive study of real-world ORM framework-based applications, where we analyzed the performance and programming patterns across 26 open-source  applications, covering domains such as forum , e-commerce, project management, blogging , etc.
Revised:  With OMAS, we performed the first comprehensive study of real-world ORM framework-based applications, where we analyzed the performance and programming patterns across 26 open-source Rails applications, covering domains such as forum , e-commerce, project management, blogging , etc.
Edit intent: meaning-changed
Original:  With OMAS, we performed the first comprehensive study of real-world ORM framework-based applications, where we analyzed the performance and programming patterns across 26 open-source  applications, covering domains such as forum , e-commerce, project management, blogging , etc.
Revised:  With OMAS, we performed the first comprehensive study of real-world ORM framework-based applications, where we analyzed the performance and programming patterns across 26 open-source applications, covering domains such as online forums , e-commerce, project management, blogging , etc.
Edit intent: clarity
Original:  With OMAS, we performed the first comprehensive study of real-world ORM framework-based applications, where we analyzed the performance and programming patterns across 26 open-source  applications, covering domains such as forum , e-commerce, project management, blogging , etc.
Revised:  With OMAS, we performed the first comprehensive study of real-world ORM framework-based applications, where we analyzed the performance and programming patterns across 26 open-source applications, covering domains such as forum , e-commerce, project management, blogs , etc.
Edit intent: fluency
Original:  Based on our study, we make a number of observations and analyze their implications on the designof ORM frameworks and databases. Furthermore, we discuss new research topics in data management and software engineering that our study raises, and how OMAS can help in implementing them.
Revised:  Based on our study, we make a number of issues that lead to sub-optimal application performance, ranging from issuing queries, how result sets are used, and physical design. We suggest possible remedies for each issue, and highlight new research opportunities that arise from them.
Edit intent: clarity
Original:  Public reports indicate that internet service users are sensitive to the service or job-level response time outliers, so we propose a very simple but powerful metric-outlier proportion to characterize the system behaviors.The outlier proportion is defined as follows: for N completed requests or jobs, if M jobs or requests' latencies exceed the outlier limit t, e.g. 10 milliseconds, the outlier proportion is M/N. 10-millisecond computing raises many challenges for both software and hardware stacks.
Revised:  10-millisecond computing raises many challenges for both software and hardware stacks.
Edit intent: coherence
Original:  In this paper, as a case study we investigate the challenges raised for conventional operating systems. For typical latency-critical services running with Linux on a 40-core server - a main-stream server hardware system in near future  , we found, when the outlier limit decreases, the outlier proportion of a single server will significantly deteriorate.
Revised:  In this paper, using a typical workload-memcached on a 40-core server - a main-stream server hardware system in near future , we found, when the outlier limit decreases, the outlier proportion of a single server will significantly deteriorate.
Edit intent: meaning-changed
Original:  For typical latency-critical services running with Linux on a 40-core server - a main-stream server hardware system in near future  , we found, when the outlier limit decreases, the outlier proportion of a single server will significantly deteriorate.
Revised:  For typical latency-critical services running with Linux on a 40-core server ( a main-stream server hardware system in near future , we found, when the outlier limit decreases, the outlier proportion of a single server will significantly deteriorate.
Edit intent: fluency
Original:  For typical latency-critical services running with Linux on a 40-core server - a main-stream server hardware system in near future  , we found, when the outlier limit decreases, the outlier proportion of a single server will significantly deteriorate.
Revised:  For typical latency-critical services running with Linux on a 40-core server - a main-stream server in near future , we found, when the outlier limit decreases, the outlier proportion of a single server will significantly deteriorate.
Edit intent: clarity
Original:  For typical latency-critical services running with Linux on a 40-core server - a main-stream server hardware system in near future  , we found, when the outlier limit decreases, the outlier proportion of a single server will significantly deteriorate.
Revised:  For typical latency-critical services running with Linux on a 40-core server - a main-stream server hardware system in near future ), we quantitatively measure 10-ms computing's challenges to conventional operating systems. For better communication, we propose a simple metric-outlier proportion to measure quality of service: for N completed requests or jobs, if M jobs or requests' latencies exceed the outlier threshold t , we found, when the outlier limit decreases, the outlier proportion of a single server will significantly deteriorate.
Edit intent: meaning-changed
Original:  For typical latency-critical services running with Linux on a 40-core server - a main-stream server hardware system in near future  , we found, when the outlier limit decreases, the outlier proportion of a single server will significantly deteriorate.
Revised:  For typical latency-critical services running with Linux on a 40-core server - a main-stream server hardware system in near future , the outlier proportion of a single server will significantly deteriorate.
Edit intent: coherence
Original:  For typical latency-critical services running with Linux on a 40-core server - a main-stream server hardware system in near future  , we found, when the outlier limit decreases, the outlier proportion of a single server will significantly deteriorate. Meanwhile, the outlier proportion is further amplified by the system scale, including the system core number .
Revised:  For typical latency-critical services running with Linux on a 40-core server - a main-stream server hardware system in near future , we found, when the outlier limit decreases, the outlier proportion is further amplified by the system scale, including the system core number .
Edit intent: clarity
Original:  For a 1K-scale system , we surprisingly find that to reduce the service or job-level outlier proportion to 10\%, running Linux (version 2.6.32) or LXC (version 0.7.5) or XEN (version 4.0.0), respectively, the outlier proportion of a single server needs to be reduced by 871X, 2372X, 2372X accordingly.
Revised:  For a 1K-scale system running Linux (version 2.6.32) or LXC (version 0.7.5) or XEN (version 4.0.0), respectively, the outlier proportion of a single server needs to be reduced by 871X, 2372X, 2372X accordingly.
Edit intent: coherence
Original:  For a 1K-scale system , we surprisingly find that to reduce the service or job-level outlier proportion to 10\%, running Linux (version 2.6.32) or LXC (version 0.7.5) or XEN (version 4.0.0), respectively, the outlier proportion of a single server needs to be reduced by 871X, 2372X, 2372X accordingly.
Revised:  For a 1K-scale system , we surprisingly find that to reduce the service or job-level outlier proportion to 10\%, running Linux (version 2.6.32) , LXC (version 0.7.5) or XEN (version 4.0.0), respectively, the outlier proportion of a single server needs to be reduced by 871X, 2372X, 2372X accordingly.
Edit intent: fluency
Original:  For a 1K-scale system , we surprisingly find that to reduce the service or job-level outlier proportion to 10\%, running Linux (version 2.6.32) or LXC (version 0.7.5) or XEN (version 4.0.0), respectively, the outlier proportion of a single server needs to be reduced by 871X, 2372X, 2372X accordingly.
Revised:  For a 1K-scale system , we surprisingly find that to reduce the service or job-level outlier proportion to 10\%, running Linux (version 2.6.32) or LXC (version 0.7.5) or XEN (version 4.0.0), respectively, we surprisingly find that so as to reduce the service outlier proportion to 10\% (10\% users will feel QoS degradation), the outlier proportion of a single server needs to be reduced by 871X, 2372X, 2372X accordingly.
Edit intent: meaning-changed
Original:  For a 1K-scale system , we surprisingly find that to reduce the service or job-level outlier proportion to 10\%, running Linux (version 2.6.32) or LXC (version 0.7.5) or XEN (version 4.0.0), respectively, the outlier proportion of a single server needs to be reduced by 871X, 2372X, 2372X accordingly.
Revised:  For a 1K-scale system , we surprisingly find that to reduce the service or job-level outlier proportion to 10\%, running Linux (version 2.6.32) or LXC (version 0.7.5) or XEN (version 4.0.0), respectively, the outlier proportion of a single server has to be reduced by 871X, 2372X, 2372X accordingly.
Edit intent: fluency
Original:  We also conducted a list of experiments to reveal the current Linux systems still suffer from poor outlier performance, including Linux kernel version 3.17.4, Linux kernel version 2.6.35M, a modified version of 2.6.35 integrated with sloppy counters and two representative real time schedulers .
Revised:  Also, we discuss the possible design spaces of 10-ms computing systems from perspectives of datacenter architectures, networking, OS and scheduling, and benchmarking .
Edit intent: meaning-changed
Original: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Revised: In this paper we study the exponential functionals of the processes X with independent increments , namely I_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Edit intent: fluency
Original: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Revised: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int _0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Edit intent: fluency
Original: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Revised: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X _s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Edit intent: fluency
Original: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Revised: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, _, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Edit intent: fluency
Original: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Revised: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Edit intent: coherence
Original: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Revised: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ also I_{\infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Edit intent: meaning-changed
Original: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Revised: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int _0 ^{\infty}\exp(-X \_s )ds.
Edit intent: fluency
Original: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X \_s )ds.
Revised: In this paper we study the exponential functionals of the processes X with independent increments , namelyI\_t = \int \_0 ^t\exp(-X \_s )ds, \_, \,\, t\geq 0, and alsoI\_ \infty = \int \_0 ^{\infty}\exp(-X _s )ds.
Edit intent: fluency