wanyu/IteraTeR_full_sent huggingface dataset:
Original:  The handset model plays a decisive role in CPU requirements of the application. t-tests showed that IMO has a statistical better performance that WhatsApp whatever be the Android at a significance level 1\%, on Galaxy Note 4.
Revised:  The handset model plays a decisive role in CPU usage of the application. t-tests showed that IMO has a statistical better performance that WhatsApp whatever be the Android at a significance level 1\%, on Galaxy Note 4.
Edit intent: clarity
Original:  The handset model plays a decisive role in CPU requirements of the application. t-tests showed that IMO has a statistical better performance that WhatsApp whatever be the Android at a significance level 1\%, on Galaxy Note 4.
Revised:  The handset model plays a decisive role in CPU requirements of the application. t-tests showed that IMO has a better performance that WhatsApp whatever be the Android at a significance level 1\%, on Galaxy Note 4.
Edit intent: clarity
Original: We study a parallel service queueing system with servers of types s_1,\ldots,s_J, customers of types c_1,\ldots,c_I, bipartite compatibility graph \mathcal{G . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates r_{c_i,s_j , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Revised: We study a parallel queueing system with servers of types s_1,\ldots,s_J, customers of types c_1,\ldots,c_I, bipartite compatibility graph \mathcal{G . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates r_{c_i,s_j , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Edit intent: fluency
Original: We study a parallel service queueing system with servers of types s_1,\ldots,s_J, customers of types c_1,\ldots,c_I, bipartite compatibility graph \mathcal{G . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates r_{c_i,s_j , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Revised: We study a parallel service queueing system with multiple types of servers and customers. A bipartite graph describes which pairs of customer-server types are compatible. We consider the service policy that always assigns servers to the first, longest waiting compatible customer, and that always assigns customers to the longest idle compatible server if on arrival, multiple compatible servers are available . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates r_{c_i,s_j , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Edit intent: meaning-changed
Original: We study a parallel service queueing system with servers of types s_1,\ldots,s_J, customers of types c_1,\ldots,c_I, bipartite compatibility graph \mathcal{G . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates r_{c_i,s_j , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Revised: We study a parallel service queueing system with servers of types s_1,\ldots,s_J, customers of types c_1,\ldots,c_I, bipartite compatibility graph \mathcal{G . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated . In particular, the calculation of matching rates r_{c_i,s_j , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Edit intent: fluency
Original: We study a parallel service queueing system with servers of types s_1,\ldots,s_J, customers of types c_1,\ldots,c_I, bipartite compatibility graph \mathcal{G . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates r_{c_i,s_j , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Revised: We study a parallel service queueing system with servers of types s_1,\ldots,s_J, customers of types c_1,\ldots,c_I, bipartite compatibility graph \mathcal{G . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Edit intent: clarity
Original: We study a parallel service queueing system with servers of types s_1,\ldots,s_J, customers of types c_1,\ldots,c_I, bipartite compatibility graph \mathcal{G . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates r_{c_i,s_j , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Revised: We study a parallel service queueing system with servers of types s_1,\ldots,s_J, customers of types c_1,\ldots,c_I, bipartite compatibility graph \mathcal{G . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates r_{c_i,s_j , the fraction of services of customer-server type , is intractable.
Edit intent: clarity
Original: Profiling is a prominent technique for finding the location of performance "bottlenecks" in code. Profiling can be performed by adding code to a program which increments a counter for each line of code each time it is executed. Any lines of code which have a large execution count relative to other lines in the program can be considered a bottleneck. Though code profiling can determine the location of a performance issue or bottleneck, we posit that the code change required to improve performance may not always be found at the same location.
Revised: Performance becomes an issue particularly when execution cost hinders the functionality of a program. Typically a profiler can be used to find program code execution which represents a large portion of the overall execution cost of a program. Pinpointing where a performance issue exists provides a starting point for tracing cause back through a program. While profiling shows where a performance issue or bottleneck, we posit that the code change required to improve performance may not always be found at the same location.
Edit intent: clarity
Original:  Though code profiling can determine the location of a performance issue or bottleneck, we posit that the code change required to improve performance may not always be found at the same location. Developers must frequently trace back through a program to understand what code is contributing to a bottleneck. We seek to highlight code which is likely causing or has the most effect on the overall execution cost of a program .
Revised:  Though code profiling can determine the location of a performance issue manifests, we use mutation analysis to show where a performance improvement is likely to exist. We find that mutation analysis can indicate locations within a program which are highly impactful to the overall execution cost of a program .
Edit intent: clarity
Original: Data describing historical growth of income per capita [Gross Domestic Product per capita (GDP/cap)] for the world economic growth and for the growth in Western Europe, Eastern Europe, Asia, former USSR, Africa and Latin America are analyzed .
Revised: Data describing historical growth of income per capita [Gross Domestic Product per capita (GDP/cap)] for the world economic growth and for the growth in Western Europe, Eastern Europe, Asia, former USSR, Africa and Latin America are analysed .
Edit intent: fluency
Original:  Results of this analysis demonstrate that within the range of mathematically-analyzable data, epoch of Malthusian stagnation did not exist and the dramatic escapes from the Malthusian trap never happened because there was no trap.
Revised:  Results of this analysis demonstrate that income per capita was increasing monotonically. There was no stagnation and there were no transitions from stagnation to growth. The usually postulated dramatic escapes from the Malthusian trap never happened because there was no trap.
Edit intent: meaning-changed
Original:  Data of Maddison open new avenues for the economic and demographic research  .
Revised:  Data of Maddison open new avenues for the economic and demographic research . They show that certain fundamental postulates revolving around the concept of Malthusian stagnation need to be replaced by the evidence-based interpretations. Within the range of analysable data, which for the growth of population extends down to 10,000 BC, growth of human population and economic growth were hyperbolic. There was no Malthusian stagnation and there were no transitions to distinctly faster trajectories. Industrial Revolution had no impact on changing growth trajectories .
Edit intent: meaning-changed
Original:  Based on analysis of extensive molecular dynamics (MD) simulation trajectories of eleven proteins with different sizes and folds, we found that significant spatially long-range backbone torsional pair correlations exist extensively in some proteins and are dominantly executed by loop residues .
Revised:  Based on analysis of molecular dynamics (MD) simulation trajectories of eleven proteins with different sizes and folds, we found that significant spatially long-range backbone torsional pair correlations exist extensively in some proteins and are dominantly executed by loop residues .
Edit intent: clarity
Original:  Based on analysis of extensive molecular dynamics (MD) simulation trajectories of eleven proteins with different sizes and folds, we found that significant spatially long-range backbone torsional pair correlations exist extensively in some proteins and are dominantly executed by loop residues .
Revised:  Based on analysis of extensive molecular dynamics (MD) simulation trajectories for ten proteins with different sizes and folds, we found that significant spatially long-range backbone torsional pair correlations exist extensively in some proteins and are dominantly executed by loop residues .
Edit intent: meaning-changed
Original:  Based on analysis of extensive molecular dynamics (MD) simulation trajectories of eleven proteins with different sizes and folds, we found that significant spatially long-range backbone torsional pair correlations exist extensively in some proteins and are dominantly executed by loop residues .
Revised:  Based on analysis of extensive molecular dynamics (MD) simulation trajectories of eleven proteins with different sizes and folds, we found that nonlinear backbone torsional pair correlations exist extensively in some proteins and are dominantly executed by loop residues .
Edit intent: meaning-changed
Original:  Based on analysis of extensive molecular dynamics (MD) simulation trajectories of eleven proteins with different sizes and folds, we found that significant spatially long-range backbone torsional pair correlations exist extensively in some proteins and are dominantly executed by loop residues .
Revised:  Based on analysis of extensive molecular dynamics (MD) simulation trajectories of eleven proteins with different sizes and folds, we found that significant spatially long-range backbone torsional pair (BTP) correlations, which are spatially more long-ranged and are mainly executed by loop residues .
Edit intent: meaning-changed
Original:  Based on analysis of extensive molecular dynamics (MD) simulation trajectories of eleven proteins with different sizes and folds, we found that significant spatially long-range backbone torsional pair correlations exist extensively in some proteins and are dominantly executed by loop residues . Further examinations suggest that such correlations are inherently non-linear and are associated with aharmonic torsional state transitions . Correspondingly, they occur on widely different and relatively longer time scales.
Revised:  Based on analysis of extensive molecular dynamics (MD) simulation trajectories of eleven proteins with different sizes and folds, we found that significant spatially long-range backbone torsional pair correlations exist extensively in some proteins and are dominantly executed by loop residues , exist extensively in most analyzed proteins. Examination of torsional motion for correlated BTPs suggested that aharmonic torsional state transitions . Correspondingly, they occur on widely different and relatively longer time scales.
Edit intent: clarity
Original:  Further examinations suggest that such correlations are inherently non-linear and are associated with aharmonic torsional state transitions . Correspondingly, they occur on widely different and relatively longer time scales.
Revised:  Further examinations suggest that such correlations are inherently non-linear and are associated with aharmonic torsional state transitions are essential for such non-linear correlations, which correspondingly occur on widely different and relatively longer time scales.
Edit intent: meaning-changed
Original:  In contrast, pair correlations between backbone torsions in stable \alpha helices and \beta strands are dominantly short-ranged, inherently linear, and are associated mainly with harmonic torsional dynamics.
Revised:  In contrast, BTP correlations between backbone torsions in stable \alpha helices and \beta strands are dominantly short-ranged, inherently linear, and are associated mainly with harmonic torsional dynamics.
Edit intent: clarity
Original:  In contrast, pair correlations between backbone torsions in stable \alpha helices and \beta strands are dominantly short-ranged, inherently linear, and are associated mainly with harmonic torsional dynamics.
Revised:  In contrast, pair correlations between backbone torsions in stable \alpha helices and \beta strands are mainly linear and spatially more short-ranged, inherently linear, and are associated mainly with harmonic torsional dynamics.
Edit intent: meaning-changed
Original:  In contrast, pair correlations between backbone torsions in stable \alpha helices and \beta strands are dominantly short-ranged, inherently linear, and are associated mainly with harmonic torsional dynamics.
Revised:  In contrast, pair correlations between backbone torsions in stable \alpha helices and \beta strands are dominantly short-ranged, and are more likely to associate with intra-well torsional dynamics.
Edit intent: meaning-changed
Original:  Challenges and implications inspired by these observations are discussed .
Revised:  Further analysis revealed that the direct cause of non-linear contributions are heterogeneous, and in extreme cases canceling, linear correlations associated with different torsional states of participating torsions. Therefore, torsional state transitions of participating torsions for a correlated BTP are only necessary but not sufficient condition for significant non-linear contributions. These findings implicate a general search strategy for novel allosteric modulation of protein activities. Meanwhile, it was suggested that ensemble averaged correlation calculation and static contact network analysis, while insightful, are not sufficient to elucidate mechanisms underlying allosteric signal transmission in general, dynamical and time scale resolved analysis are essential .
Edit intent: meaning-changed
Original: Guaranteeing accurate worst-case bounds on the end-to-end delay that data flows experience in communication networks is required for a variety of safety-critical systems , for instance in avionics . Deterministic Network Calculus (DNC) is a widely used method to derive such bounds.
Revised: Networks are integral parts of modern safety-critical systems , for instance in avionics . Deterministic Network Calculus (DNC) is a widely used method to derive such bounds.
Edit intent: clarity
Original: Guaranteeing accurate worst-case bounds on the end-to-end delay that data flows experience in communication networks is required for a variety of safety-critical systems , for instance in avionics . Deterministic Network Calculus (DNC) is a widely used method to derive such bounds.
Revised: Guaranteeing accurate worst-case bounds on the end-to-end delay that data flows experience in communication networks is required for a variety of safety-critical systems and certification demands the provision of guarantees for data transmissions . Deterministic Network Calculus (DNC) is a widely used method to derive such bounds.
Edit intent: meaning-changed
Original: Guaranteeing accurate worst-case bounds on the end-to-end delay that data flows experience in communication networks is required for a variety of safety-critical systems , for instance in avionics . Deterministic Network Calculus (DNC) is a widely used method to derive such bounds. The DNC theory has been advanced in recent years to provide ever tighter delay bounds, though this turned out a hard problem in the general feed-forward network case. Currently, the only analysisto achieve tight delay bounds, i. e. , best possible ones, is based on an optimization formulation instead of the usual algebraic DNC analysis. However, it has also been shown to be NP-hard and was accompanied by a similar, yet relaxed optimization that trades tightness against computational effort. In our article, we derive a novel , fast algebraic delay analysis that nevertheless retains a high degree of accuracy .
Revised: Guaranteeing accurate worst-case bounds on the end-to-end delay that data flows experience in communication networks is required for a variety of safety-critical systems , for instance in avionics . Deterministic Network Calculus (DNC) can compute a worst-case bound on a data flow's end-to-end delay. Accuracy of DNC results has been improved steadily, resulting in two DNC branches: the classical algebraic analysis and the more recent optimization-based analysis. The optimization-based branch provides a theoretical solution for tight bounds. Its computational cost grows, however, (possibly super-)exponentially with the network size. Consequently, a heuristic optimization formulation trading accuracy against computational costs was proposed. In this paper, we challenge optimization-based DNC with a new algebraic DNC algorithm. We show that: (i) no current optimization formulation scales well with the network size and (ii) algebraic DNC can be considerably improved in both aspects, accuracy and computational cost. To that end, we contribute a novel DNC algorithm that transfers the optimization's search for best attainable delay bounds to algebraic DNC. It achieves a high degree of accuracy .
Edit intent: clarity
Original:  In our article, we derive a novel , fast algebraic delay analysis that nevertheless retains a high degree of accuracy . We show in extensive numerical experiments that our solution enables the analysis of large-scale networks by reducing the computation time by several orders of magnitude in contrast to the optimization analysis.
Revised:  In our article, we derive a novel , fast algebraic delay analysis that nevertheless retains a high degree of accuracy and our novel efficiency improvements reduce the cost of the analysis dramatically. In extensive numerical experiments that our solution enables the analysis of large-scale networks by reducing the computation time by several orders of magnitude in contrast to the optimization analysis.
Edit intent: meaning-changed
Original:  We show in extensive numerical experiments that our solution enables the analysis of large-scale networks by reducing the computation time by several orders of magnitude in contrast to the optimization analysis. Moreover, in networks where optimization is still feasible, our delay bounds stay within close range, deviating on average by only 1.16\% in our experiments .
Revised:  We show in extensive numerical experiments that our solution enables the analysis of large-scale networks by reducing the computation time by several orders of magnitude .
Edit intent: coherence
Original: The proliferation of connected low-power devices on the Internet of Things will result in a data explosion that will significantly increase data transmission costs with respect to energy consumption and latency.
Revised: The Internet of Things (IoT) refers to a pervasive presence of interconnected and uniquely identifiable physical devices. These devices' goal is to gather data and drive actions in order to improve productivity, and ultimately reduce or eliminate reliance on human intervention for data acquisition, interpretation, and use. The proliferation of these connected low-power devices on the Internet of Things will result in a data explosion that will significantly increase data transmission costs with respect to energy consumption and latency.
Edit intent: coherence
Original:  To tractably represent a wide variety of next-generation IoT applications, we present a broad IoT application classification methodology based on application functions . Using this classification, we model and analyze the microarchitectural characteristics of a wide range of state-of-the-art embedded system microprocessors, and evaluate the microprocessors' applicability to IoT edge computing. Using these analysis as foundation, we discuss the tradeoffs of potential microarchitectural optimizations  that will enable the design of right-provisioned microprocessors that are efficient, configurable, extensible, and scalable for next-generation IoT devices.
Revised:  To tractably represent a wide variety of next-generation IoT applications, we present a broad IoT application classification methodology based on application functions , to enable quicker workload characterizations for IoT microprocessors. We then survey and discuss potential microarchitectural optimizations that will enable the design of right-provisioned microprocessors that are efficient, configurable, extensible, and scalable for next-generation IoT devices.
Edit intent: clarity
Original:  Using these analysis as foundation, we discuss the tradeoffs of potential microarchitectural optimizations  that will enable the design of right-provisioned microprocessors that are efficient, configurable, extensible, and scalable for next-generation IoT devices.
Revised:  Using these analysis as foundation, we discuss the tradeoffs of potential microarchitectural optimizations and computing paradigms that will enable the design of right-provisioned microprocessors that are efficient, configurable, extensible, and scalable for next-generation IoT devices.
Edit intent: meaning-changed
Original:  Using these analysis as foundation, we discuss the tradeoffs of potential microarchitectural optimizations  that will enable the design of right-provisioned microprocessors that are efficient, configurable, extensible, and scalable for next-generation IoT devices. Our work provides insights into the impacts of microarchitectural characteristics on microprocessors' energy consumption, performance, and efficiency for various IoT application execution requirements. Our work also provides a foundation for the analysis and design of a diverse set of microprocessor architectures for edge computing in next-generation IoT devices.
Revised:  Using these analysis as foundation, we discuss the tradeoffs of potential microarchitectural optimizations that will enable the design of right-provisioned microprocessors that are efficient, configurable, extensible, and scalable . This paper provides a foundation for the analysis and design of a diverse set of microprocessor architectures for edge computing in next-generation IoT devices.
Edit intent: coherence