wanyu/IteraTeR_v2 huggingface dataset:
Original: The importance of emotions in service and  product design is well known.
Revised: The importance of emotions in service and in product design is well known.
Edit intent: fluency
Original:  Despite this, however, it is still not very well understood how users' emotions can be incorporated in a product or service lifecycle.
Revised:  However, it is still not very well understood how users' emotions can be incorporated in a product or service lifecycle.
Edit intent: coherence
Original:  In this paper, we argue that this gap is due to a lack of a methodological framework for an effective investigation of the emotional response of persons when using products and services.
Revised:  We argue that this gap is due to a lack of a methodological framework for an effective investigation of the emotional response of persons when using products and services.
Edit intent: coherence
Original:  This information is used to dynamically change the content of the VR environment (VE) , until the desired affective state is solicited.
Revised:  This information is used to dynamically change the content of the VR environment , until the desired affective state is solicited.
Edit intent: clarity
Original:  We employ a macroscopic train operation sub-model developed by Seo et al . (2017a,b) to express the interaction between  dynamics of passengers and trains in a simplified manner while maintaining their essential physical relations.
Revised:  We use a macroscopic train operation sub-model developed by Seo et al . (2017a,b) to express the interaction between dynamics of passengers and trains in a simplified manner while maintaining their essential physical relations.
Edit intent: fluency
Original:  We employ a macroscopic train operation sub-model developed by Seo et al . (2017a,b) to express the interaction between  dynamics of passengers and trains in a simplified manner while maintaining their essential physical relations.
Revised:  We employ a macroscopic train operation sub-model developed by Seo et al (2017a,b) to express the interaction between dynamics of passengers and trains in a simplified manner while maintaining their essential physical relations.
Edit intent: fluency
Original:  We employ a macroscopic train operation sub-model developed by Seo et al . (2017a,b) to express the interaction between  dynamics of passengers and trains in a simplified manner while maintaining their essential physical relations.
Revised:  We employ a macroscopic train operation sub-model developed by Seo et al . (2017a,b) to express the interaction between the dynamics of passengers and trains in a simplified manner while maintaining their essential physical relations.
Edit intent: fluency
Original:  We derive the equilibrium conditions of the proposed model and discuss the existence of equilibrium .
Revised:  The equilibrium conditions of the proposed model and discuss the existence of equilibrium .
Edit intent: clarity
Original:  We derive the equilibrium conditions of the proposed model and discuss the existence of equilibrium .
Revised:  We derive the equilibrium conditions of the proposed model are derived and a solution method is provided .
Edit intent: clarity
Original:  The characteristics of the equilibrium are then examined through numerical examples under different passenger demand settings .
Revised:  The characteristics of the equilibrium are then examined through analytical discussion and numerical examples .
Edit intent: clarity
Original:  As an application of the proposed model, we finally analyze a simple time-dependent timetable optimization problem with equilibrium constraints and show that there exists a "capacity increasing paradox" in which a higher dispatch frequency can increase the equilibrium cost.
Revised:  As an application of the proposed model, we analyze a simple time-dependent timetable optimization problem with equilibrium constraints and show that there exists a "capacity increasing paradox" in which a higher dispatch frequency can increase the equilibrium cost.
Edit intent: coherence
Original:  As an application of the proposed model, we finally analyze a simple time-dependent timetable optimization problem with equilibrium constraints and show that there exists a "capacity increasing paradox" in which a higher dispatch frequency can increase the equilibrium cost.
Revised:  As an application of the proposed model, we finally analyze a simple time-dependent timetable optimization problem with equilibrium constraints and reveal that a "capacity increasing paradox" in which a higher dispatch frequency can increase the equilibrium cost.
Edit intent: clarity
Original:  As an application of the proposed model, we finally analyze a simple time-dependent timetable optimization problem with equilibrium constraints and show that there exists a "capacity increasing paradox" in which a higher dispatch frequency can increase the equilibrium cost.
Revised:  As an application of the proposed model, we finally analyze a simple time-dependent timetable optimization problem with equilibrium constraints and show that there exists a "capacity increasing paradox" exists such that a higher dispatch frequency can increase the equilibrium cost.
Edit intent: clarity
Original:  Further insights into the design of the timetable and its influence on passengers' equilibrium travel costs are also obtained .
Revised:  Furthermore, insights into the design of the timetable and its influence on passengers' equilibrium travel costs are also obtained .
Edit intent: coherence
Original:  Further insights into the design of the timetable and its influence on passengers' equilibrium travel costs are also obtained .
Revised:  Further insights into the design of the timetable are obtained and the timetable influence on passengers' equilibrium travel costs are also obtained .
Edit intent: coherence
Original:  Further insights into the design of the timetable and its influence on passengers' equilibrium travel costs are also obtained .
Revised:  Further insights into the design of the timetable and its influence on passengers' equilibrium travel costs are evaluated .
Edit intent: clarity
Original: We study the problem of online peak minimization under inventory constraints.
Revised: We study the problem of online peak-demand minimization under energy storage constraints.
Edit intent: clarity
Original:  It is motivated by the emerging scenario where large-load customers utilize energy storage to reduce the peak procurement from the grid, which accounts for up to 90 \% of their electric bills.
Revised:  It is motivated by an increasingly popular scenario where large-load customers utilize energy storage to reduce the peak procurement from the grid, which accounts for up to 90 \% of their electric bills.
Edit intent: clarity
Original:  In this paper, we develop an optimal online algorithm for the problem that attains the best possible competitive ratio (CR) among all deterministic and randomized algorithms.
Revised:  In this paper, we develop an optimal online algorithm for the problem , attaining the best possible competitive ratio (CR) among all deterministic and randomized algorithms.
Edit intent: fluency
Original:  We also generalize our approach to develop an anytime-optimal online algorithm that achieves the best possible CR at any epoch, given the inputs and online decisions so far.
Revised:  More importantly, we generalize our approach to develop an anytime-optimal online algorithm that achieves the best possible CR at any epoch, given the inputs and online decisions so far.
Edit intent: clarity
Original:  We also generalize our approach to develop an anytime-optimal online algorithm that achieves the best possible CR at any epoch, given the inputs and online decisions so far.
Revised:  We also generalize our approach to develop an anytime-optimal online algorithm that achieves the best possible CR at any epoch, given the inputs and online decisions so far.
Edit intent: fluency
Original:  Simulation results based on real-world traces show that  our algorithms improve peak reduction by more than 19 \% as \\%DIF > as compared to baseline alternatives.
Revised:  Simulation results based on real-world traces show that our algorithms improve peak reduction by over 19 \% as \\%DIF > as compared to baseline alternatives.
Edit intent: fluency
Original:  Simulation results based on real-world traces show that  our algorithms improve peak reduction by more than 19 \% as \\%DIF > as compared to baseline alternatives.
Revised:  Simulation results based on real-world traces show that our algorithms improve peak reduction by more than 19 \\%DIF > as compared to baseline alternatives.
Edit intent: fluency
Original:  BPF allows users to write code in high-level languages  like C or Rust and attach them to specific points in the kernel, such as the network device driver.
Revised:  BPF allows users to write code in high-level languages ( like C or Rust and attach them to specific points in the kernel, such as the network device driver.
Edit intent: fluency
Original:  BPF allows users to write code in high-level languages  like C or Rust and attach them to specific points in the kernel, such as the network device driver.
Revised:  BPF allows users to write code in high-level languages like C or Rust ) and execute them at specific hooks in the kernel, such as the network device driver.
Edit intent: clarity
Original:  To ensure safe execution of a user-developed BPF program in kernel context, Linux employs an in-kernel static checker , that only accepts the program if it can be shown to be crash-free and isolated from the rest of kernel memory.
Revised:  To ensure safe execution of a user-developed BPF program in kernel context, Linux uses an in-kernel static checker , that only accepts the program if it can be shown to be crash-free and isolated from the rest of kernel memory.
Edit intent: clarity
Original:  To ensure safe execution of a user-developed BPF program in kernel context, Linux employs an in-kernel static checker , that only accepts the program if it can be shown to be crash-free and isolated from the rest of kernel memory.
Revised:  To ensure safe execution of a user-developed BPF program in kernel context, Linux employs an in-kernel static checker . The checker allows a program to execute only if it can be shown to be crash-free and isolated from the rest of kernel memory.
Edit intent: clarity
Original:  To ensure safe execution of a user-developed BPF program in kernel context, Linux employs an in-kernel static checker , that only accepts the program if it can be shown to be crash-free and isolated from the rest of kernel memory.
Revised:  To ensure safe execution of a user-developed BPF program in kernel context, Linux employs an in-kernel static checker , that only accepts the program if it can prove that the program is crash-free and isolated from the rest of kernel memory.
Edit intent: clarity
Original:  One, even modest-size BPF programs can be rejected by the kernel checker as they are construed to be too large to analyze  .
Revised:  One, even modest-sized BPF programs are deemed too large to analyze .
Edit intent: clarity
Original:  Two, the in-kernel static checker may incorrectly determine that an eBPF program exhibits unsafe behaviors.
Revised:  Two, the kernel checker may incorrectly determine that an eBPF program exhibits unsafe behaviors.
Edit intent: clarity
Original:  Two, the in-kernel static checker may incorrectly determine that an eBPF program exhibits unsafe behaviors.
Revised:  Two, the in-kernel static checker may incorrectly determine that a BPF program exhibits unsafe behaviors.
Edit intent: clarity
Original:  Optimizing compilers for BPF are severely hampered because the kernel checker's safety considerations are incompatible with rule-based optimizations used in traditional compilers .
Revised:  Traditional optimizing compilers for BPF are severely hampered because the kernel checker's safety considerations are incompatible with rule-based optimizations used in traditional compilers .
Edit intent: clarity
Original:  Optimizing compilers for BPF are severely hampered because the kernel checker's safety considerations are incompatible with rule-based optimizations used in traditional compilers .
Revised:  Optimizing compilers for BPF are often inadequate since the kernel checker's safety considerations are incompatible with rule-based optimizations used in traditional compilers .
Edit intent: clarity
Original:  Optimizing compilers for BPF are severely hampered because the kernel checker's safety considerations are incompatible with rule-based optimizations used in traditional compilers .
Revised:  Optimizing compilers for BPF are severely hampered because the kernel checker's safety constraints are incompatible with rule-based optimizations used in traditional compilers .
Edit intent: clarity
Original:  Optimizing compilers for BPF are severely hampered because the kernel checker's safety considerations are incompatible with rule-based optimizations used in traditional compilers .
Revised:  Optimizing compilers for BPF are severely hampered because the kernel checker's safety considerations are incompatible with rule-based optimizations .
Edit intent: clarity
Original:  K2 produces code with 6-26 \% reduced size, reduces average latency by 13-85%DIFDELCMD < \mus %%% in our setup, and improves the number of packets per second processed per coreby 5\% relative to clang -O3, across programs drawn from production systems at Cilium and the Linux kernel.
Revised:  K2 produces code with 6--26 \% reduced size, reduces average latency by 13-85%DIFDELCMD < \mus %%% in our setup, and improves the number of packets per second processed per coreby 5\% relative to clang -O3, across programs drawn from production systems at Cilium and the Linux kernel.
Edit intent: fluency
Original:  K2 produces code with 6-26 \% reduced size, reduces average latency by 13-85%DIFDELCMD < \mus %%% in our setup, and improves the number of packets per second processed per coreby 5\% relative to clang -O3, across programs drawn from production systems at Cilium and the Linux kernel.
Revised:  K2 produces code with 6-26 \% reduced size, %DIFDELCMD < \mus %%% in our setup, and improves the number of packets per second processed per coreby 5\% relative to clang -O3, across programs drawn from production systems at Cilium and the Linux kernel.
Edit intent: coherence
Original:  BPF programs produced by K2 can pass the kernel checker .
Revised:  K2 can pass the kernel checker .
Edit intent: clarity
Original:  The same technique can be applied to arbitrary polynomial bases, although there typically is no set of closed form equations that can be used to construct the corresponding LTI systems .
Revised:  This technique can be applied to arbitrary polynomial bases, although there typically is no set of closed form equations that can be used to construct the corresponding LTI systems .
Edit intent: clarity
Original:  The same technique can be applied to arbitrary polynomial bases, although there typically is no set of closed form equations that can be used to construct the corresponding LTI systems .
Revised:  The same technique can be applied to arbitrary polynomial bases, although there typically is no closed-form equation that describes the state-transition matrix .
Edit intent: clarity
Original: How can society understand and hold accountable complex human and algorithmic decision-making systems whose systematic errors are opaque to the outside ?
Revised: How can society understand and hold accountable complex human and algorithmic decision-making systems whose systematic errors are opaque to the public ?
Edit intent: clarity
Original:  In this paper, we provide various structural characterizations of the existence of oscillatory behavior in neural networks using a classical neural mass model of mesoscale brain activity called the linear-threshold model . Exploiting the switched-affine nature of linear-threshold dynamics, we obtain various necessary and/or sufficient conditions  for the existence of oscillations in (i)
Revised:  In this paper, we provide various structural characterizations of the existence of oscillatory behavior in neural networks using a classical neural mass model of mesoscale brain activity called linear-threshold model . Exploiting the switched-affine nature of linear-threshold dynamics, we obtain various necessary and/or sufficient conditions for the existence of oscillations in (i)
Edit intent: fluency
Original:  In this paper, we provide various structural characterizations of the existence of oscillatory behavior in neural networks using a classical neural mass model of mesoscale brain activity called the linear-threshold model . Exploiting the switched-affine nature of linear-threshold dynamics, we obtain various necessary and/or sufficient conditions  for the existence of oscillations in (i)
Revised:  In this paper, we provide various structural characterizations of the existence of oscillatory behavior in neural networks using a classical neural mass model of mesoscale brain activity called the linear-threshold dynamics . Exploiting the switched-affine nature of linear-threshold dynamics, we obtain various necessary and/or sufficient conditions for the existence of oscillations in (i)
Edit intent: fluency
Original:  In this paper, we provide various structural characterizations of the existence of oscillatory behavior in neural networks using a classical neural mass model of mesoscale brain activity called the linear-threshold model . Exploiting the switched-affine nature of linear-threshold dynamics, we obtain various necessary and/or sufficient conditions  for the existence of oscillations in (i)
Revised:  In this paper, we provide various structural characterizations of the existence of oscillatory behavior in neural networks using a classical neural mass model of mesoscale brain activity called the linear-threshold model . Exploiting the switched-affine nature of this dynamics, we obtain various necessary and/or sufficient conditions for the existence of oscillations in (i)
Edit intent: coherence
Original:  In this paper, we provide various structural characterizations of the existence of oscillatory behavior in neural networks using a classical neural mass model of mesoscale brain activity called the linear-threshold model . Exploiting the switched-affine nature of linear-threshold dynamics, we obtain various necessary and/or sufficient conditions  for the existence of oscillations in (i)
Revised:  In this paper, we provide various structural characterizations of the existence of oscillatory behavior in neural networks using a classical neural mass model of mesoscale brain activity called the linear-threshold model . Exploiting the switched-affine nature of linear-threshold dynamics, we obtain various necessary and/or sufficient conditions on the network structure and its external input for the existence of oscillations in (i)
Edit intent: clarity
Original: We provide an algorithm for determining whether two rational surfaces of translation are affinely equivalent .
Revised: We introduce a characterization for affine equivalence of two surfaces of translation are affinely equivalent .
Edit intent: clarity
Original:  For example, to reduce costs, the number of sensors is minimized or parts of the system are not connected.
Edit intent: coherence
Original: We are recently witnessing an increased adoption of microservice architectures by the industry for achieving scalability by functional decomposition, fault-tolerance by deployment of small and independent services , and polyglot persistence by the adoption of different database technologies specific to the needs of each service.
Revised: Microservices have become a popular architectural style for data-driven applications, given their ability to functionally decompose an application into small and autonomous services to achieve scalability, strong isolation, and specialization of database systems to the workloads and data formats of each service.
Edit intent: clarity
Original:  Despite the accelerating industrial adoption and the extensive research on microservices, there is a lack of thorough investigation on the state of the practice and the major challenges faced by practitioners with regard to data management .
Revised:  Despite the accelerating industrial adoption and the extensive research on microservices, there is a lack of thorough investigation on the state of the practice and challenges practitioners face regarding data management in microservices is lacking .
Edit intent: clarity
Original:  Our exploratory study is based on the following methodology: we conducted a systematic literature review of  articles reporting the adoption of microservices in industry, where more than 300 articles were filtered down to 11 representative studies;
Revised:  Our exploratory study is based on the following methodology: we conducted a systematic literature review of representative articles reporting the adoption of microservices in industry, where more than 300 articles were filtered down to 11 representative studies;
Edit intent: fluency
Original:  Our exploratory study is based on the following methodology: we conducted a systematic literature review of  articles reporting the adoption of microservices in industry, where more than 300 articles were filtered down to 11 representative studies;
Revised:  Our exploratory study is based on the following methodology: we conducted a systematic literature review of articles reporting the adoption of microservices ,
Edit intent: coherence
Original:  furthermore, to strengthen our evidence, we conducted an online survey that we then used to cross-validate the findings of the previous steps with the perceptions and experiences of over 120  practitioners and researchers.
Revised:  furthermore, to strengthen our evidence, we conducted an online survey to cross-validate the findings of the previous steps with the perceptions and experiences of over 120 practitioners and researchers.
Edit intent: coherence
Original:  furthermore, to strengthen our evidence, we conducted an online survey that we then used to cross-validate the findings of the previous steps with the perceptions and experiences of over 120  practitioners and researchers.
Revised:  furthermore, to strengthen our evidence, we conducted an online survey that we then used to cross-validate the findings of the previous steps with the perceptions and experiences of over 120 experienced practitioners and researchers.
Edit intent: clarity
Original:  Through this process, we were able to categorize the state of practice and reveal several principled challenges that cannot be solved by software engineering practices  , but rather need system-level support to alleviate the burden of practitioners.
Revised:  Through this process, we were able to categorize the state of practice and reveal several principled challenges that cannot be solved by software engineering practices alone , but rather need system-level support to alleviate the burden of practitioners.
Edit intent: clarity
Original:  Through this process, we were able to categorize the state of practice and reveal several principled challenges that cannot be solved by software engineering practices  , but rather need system-level support to alleviate the burden of practitioners.
Revised:  Through this process, we were able to categorize the state of practice and reveal several principled challenges that cannot be solved by software engineering practices , but rather require system-level support to alleviate the burden of practitioners.
Edit intent: fluency
Original:  If the exact power and heat demands are given, it is known that graph-theory based algorithms can be used to give a quick optimal solution to the economic dispatch problem.
Revised:  If the exact power and heat demands are given, existing algorithms can be used to give a quick optimal solution to the economic dispatch problem.
Edit intent: clarity