wanyu/IteraTeR_v2 huggingface dataset:
Original:  The algorithm ( modified in an obvious way to work with the complex numbers ) from the present paper can be used to evaluate complex Riemann zeta function \zeta(s) for s=\sigma+it, \sigma > \ne 1 , in polynomial time and linear space in n wherein 2^{-n} is a precision of the computation (but the modified algorithm will be exponential in time and space in \lceil \log_2(t)\rceil )\lceil \rceil .
Revised:  The algorithm ( modified in an obvious way to work with the complex numbers can be used to evaluate complex Riemann zeta function \zeta(s) for s=\sigma+it, \sigma > \ne 1 , in polynomial time and linear space in n wherein 2^{-n} is a precision of the computation (but the modified algorithm will be exponential in time and space in \lceil \log_2(t)\rceil )\lceil \rceil .
Edit intent: clarity
Original:  The algorithm ( modified in an obvious way to work with the complex numbers ) from the present paper can be used to evaluate complex Riemann zeta function \zeta(s) for s=\sigma+it, \sigma > \ne 1 , in polynomial time and linear space in n wherein 2^{-n} is a precision of the computation (but the modified algorithm will be exponential in time and space in \lceil \log_2(t)\rceil )\lceil \rceil .
Revised:  The algorithm ( modified in an obvious way to work with the complex numbers ) from the present paper can be used to evaluate complex Riemann zeta function \zeta(s) for s=\sigma+it, \sigma \ne 1 , in polynomial time and linear space in n wherein 2^{-n} is a precision of the computation (but the modified algorithm will be exponential in time and space in \lceil \log_2(t)\rceil )\lceil \rceil .
Edit intent: clarity
Original:  The algorithm ( modified in an obvious way to work with the complex numbers ) from the present paper can be used to evaluate complex Riemann zeta function \zeta(s) for s=\sigma+it, \sigma > \ne 1 , in polynomial time and linear space in n wherein 2^{-n} is a precision of the computation (but the modified algorithm will be exponential in time and space in \lceil \log_2(t)\rceil )\lceil \rceil .
Revised:  The algorithm ( modified in an obvious way to work with the complex numbers ) from the present paper can be used to evaluate complex Riemann zeta function \zeta(s) for s=\sigma+it, \sigma > \ne 1 , in polynomial time and linear space in n wherein 2^{-n} is a precision of the computation ; the modified algorithm will be exponential in time and space in \lceil \log_2(t)\rceil )\lceil \rceil .
Edit intent: coherence
Original:  The algorithm ( modified in an obvious way to work with the complex numbers ) from the present paper can be used to evaluate complex Riemann zeta function \zeta(s) for s=\sigma+it, \sigma > \ne 1 , in polynomial time and linear space in n wherein 2^{-n} is a precision of the computation (but the modified algorithm will be exponential in time and space in \lceil \log_2(t)\rceil )\lceil \rceil .
Revised:  The algorithm ( modified in an obvious way to work with the complex numbers ) from the present paper can be used to evaluate complex Riemann zeta function \zeta(s) for s=\sigma+it, \sigma > \ne 1 , in polynomial time and linear space in n wherein 2^{-n} is a precision of the computation (but the modified algorithm will be also polynomial time and linear space in \lceil \log_2(t)\rceil )\lceil \rceil .
Edit intent: clarity
Original:  The algorithm ( modified in an obvious way to work with the complex numbers ) from the present paper can be used to evaluate complex Riemann zeta function \zeta(s) for s=\sigma+it, \sigma > \ne 1 , in polynomial time and linear space in n wherein 2^{-n} is a precision of the computation (but the modified algorithm will be exponential in time and space in \lceil \log_2(t)\rceil )\lceil \rceil .
Revised:  The algorithm ( modified in an obvious way to work with the complex numbers ) from the present paper can be used to evaluate complex Riemann zeta function \zeta(s) for s=\sigma+it, \sigma > \ne 1 , in polynomial time and linear space in n wherein 2^{-n} is a precision of the computation (but the modified algorithm will be exponential in time and space in \lceil \log_2(t)\rceil and exponential time and exponential space in\lceil \rceil .
Edit intent: coherence
Original: In recent years the research community has accumulated overwhelming evidence for the emergence of complex and heterogeneous connectivity patterns in a wide range of biological and socio-technical systems.
Revised: In recent years the research community has accumulated overwhelming evidence for the emergence of complex and heterogeneous connectivity patterns in a wide range of biological and sociotechnical systems.
Edit intent: fluency
Original:  The complex properties of real world networks have a profound impact on the behavior of equilibrium and non-equilibrium phenomena occurring in various systems, and the study of epidemic spreading is central to our understanding of the unfolding of dynamical processes in complex networks.
Revised:  The complex properties of real-world networks have a profound impact on the behavior of equilibrium and non-equilibrium phenomena occurring in various systems, and the study of epidemic spreading is central to our understanding of the unfolding of dynamical processes in complex networks.
Edit intent: fluency
Original:  The complex properties of real world networks have a profound impact on the behavior of equilibrium and non-equilibrium phenomena occurring in various systems, and the study of epidemic spreading is central to our understanding of the unfolding of dynamical processes in complex networks.
Revised:  The complex properties of real world networks have a profound impact on the behavior of equilibrium and nonequilibrium phenomena occurring in various systems, and the study of epidemic spreading is central to our understanding of the unfolding of dynamical processes in complex networks.
Edit intent: clarity
Original:  Here we present a coherent and comprehensive review of the vast research activity concerning epidemic processes  , detailing the successful theoretical approaches as well as making their limits and assumptions clear.
Revised:  A coherent and comprehensive review of the vast research activity concerning epidemic processes , detailing the successful theoretical approaches as well as making their limits and assumptions clear.
Edit intent: coherence
Original:  Here we present a coherent and comprehensive review of the vast research activity concerning epidemic processes  , detailing the successful theoretical approaches as well as making their limits and assumptions clear.
Revised:  Here we present a coherent and comprehensive review of the vast research activity concerning epidemic processes is presented , detailing the successful theoretical approaches as well as making their limits and assumptions clear.
Edit intent: clarity
Original:  Physicists,  epidemiologists, computer  and social scientists share a common interest in studying epidemic spreading and rely on very similar models for the description of the diffusion of pathogens, knowledge, and innovation.
Revised:  Physicists, epidemiologists, computer , and social scientists share a common interest in studying epidemic spreading and rely on very similar models for the description of the diffusion of pathogens, knowledge, and innovation.
Edit intent: fluency
Original:  Physicists,  epidemiologists, computer  and social scientists share a common interest in studying epidemic spreading and rely on very similar models for the description of the diffusion of pathogens, knowledge, and innovation.
Revised:  Physicists, epidemiologists, computer and social scientists share a common interest in studying epidemic spreading and rely on similar models for the description of the diffusion of pathogens, knowledge, and innovation.
Edit intent: coherence
Original:  For this reason, while we focus on the main results and the paradigmatic models in infectious disease modeling, we also present the major results concerning generalized social contagion processes . Finally we outline the research activity at the forefront in the study of epidemic spreading in co-evolving and time-varying networks  .
Revised:  For this reason, while focusing on the main results and the paradigmatic models in infectious disease modeling, we also present the major results concerning generalized social contagion processes . Finally we outline the research activity at the forefront in the study of epidemic spreading in co-evolving and time-varying networks .
Edit intent: fluency
Original:  For this reason, while we focus on the main results and the paradigmatic models in infectious disease modeling, we also present the major results concerning generalized social contagion processes . Finally we outline the research activity at the forefront in the study of epidemic spreading in co-evolving and time-varying networks  .
Revised:  For this reason, while we focus on the main results and the paradigmatic models in infectious disease modeling, the major results concerning generalized social contagion processes . Finally we outline the research activity at the forefront in the study of epidemic spreading in co-evolving and time-varying networks .
Edit intent: clarity
Original:  For this reason, while we focus on the main results and the paradigmatic models in infectious disease modeling, we also present the major results concerning generalized social contagion processes . Finally we outline the research activity at the forefront in the study of epidemic spreading in co-evolving and time-varying networks  .
Revised:  For this reason, while we focus on the main results and the paradigmatic models in infectious disease modeling, we also present the major results concerning generalized social contagion processes are also presented. Finally, the research activity at the forefront in the study of epidemic spreading in co-evolving and time-varying networks .
Edit intent: clarity
Original:  For this reason, while we focus on the main results and the paradigmatic models in infectious disease modeling, we also present the major results concerning generalized social contagion processes . Finally we outline the research activity at the forefront in the study of epidemic spreading in co-evolving and time-varying networks  .
Revised:  For this reason, while we focus on the main results and the paradigmatic models in infectious disease modeling, we also present the major results concerning generalized social contagion processes . Finally we outline the research activity at the forefront in the study of epidemic spreading in coevolving, coupled, and time-varying networks .
Edit intent: clarity
Original:  For this reason, while we focus on the main results and the paradigmatic models in infectious disease modeling, we also present the major results concerning generalized social contagion processes . Finally we outline the research activity at the forefront in the study of epidemic spreading in co-evolving and time-varying networks  .
Revised:  For this reason, while we focus on the main results and the paradigmatic models in infectious disease modeling, we also present the major results concerning generalized social contagion processes . Finally we outline the research activity at the forefront in the study of epidemic spreading in co-evolving and time-varying networks is reported .
Edit intent: coherence
Original: The evolution of web and service technologies has led to a wide landscape of protocols and standards for interaction between loosely-coupled software components.
Revised: The evolution of web and service technologies has led to a wide landscape of standards and protocols for interaction between loosely-coupled software components.
Edit intent: fluency
Original:  Cloud computing is in a sense the industrialization of service provision and delivery, where the web and enterprise services are converging on a technological level.
Revised:  Cloud computing is the industrialization of service provision and delivery, where the web and enterprise services are converging on a technological level.
Edit intent: coherence
Original:  Cloud computing is in a sense the industrialization of service provision and delivery, where the web and enterprise services are converging on a technological level.
Revised:  Cloud computing is in a sense the industrialization of service provision and delivery, where web and enterprise services are converging on a technological level.
Edit intent: clarity
Original:  The survey focuses on the communication aspect of interaction by analyzing languages, protocols, and architectures that drive today's standards and software implementations applicable in clouds.
Revised:  The survey focuses on the communication aspect of interaction by reviewing languages, protocols, and architectures that drive today's standards and software implementations applicable in clouds.
Edit intent: clarity
Original:  In particular, there is a trend towards multiplexing, multihoming, and encryption in upcoming transport mechanisms, especially for architectures, where a client simultaneously sends a large number of requests to some service.
Revised:  There is a trend towards multiplexing, multihoming, and encryption in upcoming transport mechanisms, especially for architectures, where a client simultaneously sends a large number of requests to some service.
Edit intent: coherence
Original:  Furthermore, there is a trend towards client-to-client communication capabilities in web clients that has the potential to establish a foundation for novel web-based messaging architectures.
Revised:  Furthermore, there are emerging client-to-client communication capabilities in web clients that has the potential to establish a foundation for novel web-based messaging architectures.
Edit intent: clarity
Original:  Furthermore, there is a trend towards client-to-client communication capabilities in web clients that has the potential to establish a foundation for novel web-based messaging architectures.
Revised:  Furthermore, there is a trend towards client-to-client communication capabilities in web clients that could establish a foundation for novel web-based messaging architectures.
Edit intent: clarity
Original:  Furthermore, there is a trend towards client-to-client communication capabilities in web clients that has the potential to establish a foundation for novel web-based messaging architectures.
Revised:  Furthermore, there is a trend towards client-to-client communication capabilities in web clients that has the potential to establish a foundation for upcoming web-based messaging architectures.
Edit intent: clarity
Original: The evolution of web and service technologies has led to a wide landscape of standards and protocols for interaction between loosely-coupled software components.
Revised: The evolution of Web and service technologies has led to a wide landscape of standards and protocols for interaction between loosely-coupled software components.
Edit intent: fluency
Original: The evolution of web and service technologies has led to a wide landscape of standards and protocols for interaction between loosely-coupled software components.
Revised: The evolution of web and service technologies has led to a wide landscape of standards and protocols for interaction between loosely coupled software components.
Edit intent: fluency
Original:  Examples range from web applications, mashups, apps, and mobile devices to enterprise-grade services.
Revised:  Examples range from Web applications, mashups, apps, and mobile devices to enterprise-grade services.
Edit intent: fluency
Original:  Cloud computing is the industrialization of service provision and delivery, where web and enterprise services are converging on a technological level.
Revised:  Cloud computing is the industrialization of service provision and delivery, where Web and enterprise services are converging on a technological level.
Edit intent: fluency
Original:  Technological advances will affect both the client- and service-side .
Revised:  Technological advances will affect both client side and service side .
Edit intent: fluency
Original:  There is a trend towards multiplexing, multihoming, and encryption in upcoming transport mechanisms, especially for architectures, where a client simultaneously sends a large number of requests to some service.
Revised:  There is a trend toward multiplexing, multihoming, and encryption in upcoming transport mechanisms, especially for architectures, where a client simultaneously sends a large number of requests to some service.
Edit intent: fluency
Original:  Furthermore, there are emerging client-to-client communication capabilities in web clients that could establish a foundation for upcoming web-based messaging architectures.
Revised:  Furthermore, there are emerging client-to-client communication capabilities in Web clients that could establish a foundation for upcoming web-based messaging architectures.
Edit intent: fluency
Original:  Furthermore, there are emerging client-to-client communication capabilities in web clients that could establish a foundation for upcoming web-based messaging architectures.
Revised:  Furthermore, there are emerging client-to-client communication capabilities in web clients that could establish a foundation for upcoming Web-based messaging architectures.
Edit intent: fluency
Original:  Structured networks by using Distributed Hash Tables (DHT) can forward request search queries more efficiency .
Revised:  Structured networks by using Distributed Hash Tables (DHT) can forward request search queries more efficiently .
Edit intent: fluency
Original: This paper proposes an Hadoop library, named M_3, for performing dense and sparse matrix multiplication in MapReduce.
Revised: A common approach in the design of MapReduce algorithms is to minimize the number of rounds. Indeed, there are many examples in the literature of monolithic MapReduce algorithms, which are algorithms requiring just one or two rounds. However, we claim that the design of monolithic algorithms may not be the best approach in cloud systems. Indeed, multi-round algorithms may exploit some features of cloud platforms by suitably setting the round number according to the execution context. In this paper we carry out an experimental study of multi-round MapReduce algorithms aiming at investigating the performance of the multi-round approach. We use matrix multiplication as a case study. We first propose a scalable Hadoop library, named M_3, for performing dense and sparse matrix multiplication in MapReduce.
Edit intent: coherence
Original: This paper proposes an Hadoop library, named M_3, for performing dense and sparse matrix multiplication in MapReduce.
Revised: This paper proposes an Hadoop library, named M_3, for matrix multiplication in MapReduce.
Edit intent: clarity
Original:  We perform an extensive experimental evaluation of the M_3 library on an in-house cluster and on a cloud provider, aiming at assessing the performance of the library and at comparing the multi-round and monolithic approaches .
Revised:  We perform an extensive experimental evaluation of the M_3 library on an in-house cluster and on Amazon Web Services aiming at showing its performance and at comparing the multi-round and monolithic approaches .
Edit intent: clarity
Original: Many problems in geophysical modelling require the efficient solution of highly anisotropic elliptic partial differential equations (PDEs) in "flat" domains.
Revised: Many problems in fluid modelling require the efficient solution of highly anisotropic elliptic partial differential equations (PDEs) in "flat" domains.
Edit intent: clarity
Original: It is a known fact that  given two rooted binary phylogenetic trees  the concept of maximum acyclic agreement forests is sufficient to compute hybridization networks with minimum hybridization number.
Revised: It is a known fact that , given two rooted binary phylogenetic trees the concept of maximum acyclic agreement forests is sufficient to compute hybridization networks with minimum hybridization number.
Edit intent: fluency
Original: It is a known fact that  given two rooted binary phylogenetic trees  the concept of maximum acyclic agreement forests is sufficient to compute hybridization networks with minimum hybridization number.
Revised: It is a known fact that given two rooted binary phylogenetic trees , the concept of maximum acyclic agreement forests is sufficient to compute hybridization networks with minimum hybridization number.
Edit intent: fluency
Original:  In this work  we demonstrate by , first , presenting an algorithm and , second, showing its correctness  that this concept is also sufficient in the case of multiple input trees.
Revised:  In this work , we demonstrate by , first , presenting an algorithm and , second, showing its correctness that this concept is also sufficient in the case of multiple input trees.
Edit intent: fluency
Original:  In this work  we demonstrate by , first , presenting an algorithm and , second, showing its correctness  that this concept is also sufficient in the case of multiple input trees.
Revised:  In this work we demonstrate by first presenting an algorithm and , second, showing its correctness that this concept is also sufficient in the case of multiple input trees.
Edit intent: fluency
Original:  In this work  we demonstrate by , first , presenting an algorithm and , second, showing its correctness  that this concept is also sufficient in the case of multiple input trees.
Revised:  In this work we demonstrate by , first , presenting an algorithm and then showing its correctness that this concept is also sufficient in the case of multiple input trees.
Edit intent: coherence
Original:  In this work  we demonstrate by , first , presenting an algorithm and , second, showing its correctness  that this concept is also sufficient in the case of multiple input trees.
Revised:  In this work we demonstrate by , first , presenting an algorithm and , second, showing its correctness , that this concept is also sufficient in the case of multiple input trees.
Edit intent: fluency
Original:  In detail , we show that for computing hybridization networks with minimum hybridization number for multiple rooted binary phylogenetic trees , it is sufficient to consider only maximum acyclic agreement forests instead of acyclic agreement forests of arbitrary size .
Revised:  More precisely , we show that for computing hybridization networks with minimum hybridization number for multiple rooted binary phylogenetic trees , it is sufficient to consider only maximum acyclic agreement forests instead of acyclic agreement forests of arbitrary size .
Edit intent: coherence
Original:  In detail , we show that for computing hybridization networks with minimum hybridization number for multiple rooted binary phylogenetic trees , it is sufficient to consider only maximum acyclic agreement forests instead of acyclic agreement forests of arbitrary size .
Revised:  In detail , we show that for computing minimum hybridization networks for multiple rooted binary phylogenetic trees , it is sufficient to consider only maximum acyclic agreement forests instead of acyclic agreement forests of arbitrary size .
Edit intent: clarity
Original:  In detail , we show that for computing hybridization networks with minimum hybridization number for multiple rooted binary phylogenetic trees , it is sufficient to consider only maximum acyclic agreement forests instead of acyclic agreement forests of arbitrary size .
Revised:  In detail , we show that for computing hybridization networks with minimum hybridization number for multiple rooted binary phylogenetic trees on the same set of taxa it suffices to take only maximum acyclic agreement forests instead of acyclic agreement forests of arbitrary size .
Edit intent: clarity
Original: Ion channels are of major interest and form an area of intensive research in the fields of biophysics and medicine , since they control many vital physiological functions.
Revised: Ion channels are of major interest and form an area of intensive research in the fields of biophysics and medicine since they control many vital physiological functions.
Edit intent: fluency