wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper, we investigate the right-sizing problem with heterogeneous data centers including various operational cost and switching cost to find the optimal number of active servers in a online setting .
Revised:  In this paper, we investigate the right-sizing problem with heterogeneous data centers with various operational cost and switching cost to find the optimal number of active servers in a online setting .
Edit intent: coherence
Original:  In this paper, we investigate the right-sizing problem with heterogeneous data centers including various operational cost and switching cost to find the optimal number of active servers in a online setting .
Revised:  In this paper, we investigate the right-sizing problem with heterogeneous data centers including various operational cost and switching cost .
Edit intent: coherence
Original:  We propose an online regularization algorithm which always achieves a better competitive ratio compared to the greedy algorithm in \mbox{ lin2012online .
Revised:  We propose a new online algorithm based on a regularization technique, which achieves a better competitive ratio compared to the greedy algorithm in \mbox{ lin2012online .
Edit intent: clarity
Original:  We propose an online regularization algorithm which always achieves a better competitive ratio compared to the greedy algorithm in \mbox{ lin2012online .
Revised:  We propose an online regularization algorithm which always achieves a better competitive ratio compared to the state-of-the-art greedy algorithm .
Edit intent: clarity
Original:  We further extend the model by introducing the switching cost offset and propose another online regularization algorithm with performance guarantee . Simulations based on real world traces show that our algorithms both outperform the greedy algorithm  .
Revised:  We further introduce a switching cost offset and propose another online regularization algorithm with performance guarantee . Simulations based on real world traces show that our algorithms both outperform the greedy algorithm .
Edit intent: clarity
Original:  We further extend the model by introducing the switching cost offset and propose another online regularization algorithm with performance guarantee . Simulations based on real world traces show that our algorithms both outperform the greedy algorithm  .
Revised:  We further extend the model by introducing the switching cost offset and propose another online regularization algorithm with performance guarantee . Simulations based on real world traces show that our algorithms outperform the greedy algorithm .
Edit intent: clarity
Original:  Audio Video Bridging (AVB) standards and IEEE 802.1 Time Sensitive Networking (TSN) standards and related research studies have sought to provide network support for ULL applications .
Revised:  The IEEE 802.1 Time Sensitive Networking (TSN) standards and related research studies have sought to provide network support for ULL applications .
Edit intent: coherence
Original:  Audio Video Bridging (AVB) standards and IEEE 802.1 Time Sensitive Networking (TSN) standards and related research studies have sought to provide network support for ULL applications .
Revised:  Audio Video Bridging (AVB) standards and IEEE 802.1 Time Sensitive Networking (TSN) standard and related research studies have sought to provide network support for ULL applications .
Edit intent: fluency
Original:  This survey can then serve as a basis for the development of TSN enhancements to address scenarios and problems that TSN currently cannot address in an adequate manner .
Revised:  This survey can thus serve as a basis for the development of TSN enhancements to address scenarios and problems that TSN currently cannot address in an adequate manner .
Edit intent: coherence
Original:  Our algorithm runs in O(kn^2), where k depends on \epsilon and the ratio of the duration of  trajectory to the maximum amount of gap time.
Revised:  Our algorithm runs in O(kn^2), where k depends on \epsilon and the ratio of the duration of the trajectory to the maximum amount of gap time.
Edit intent: fluency
Original:  Our algorithm runs in O(kn^2), where k depends on \epsilon and the ratio of the duration of  trajectory to the maximum amount of gap time.
Revised:  Our algorithm runs in O(kn^2), where k depends on \epsilon and the ratio of the duration of trajectory to the allowed gap time.
Edit intent: clarity
Original:  Among the existing approaches, reservoir computing (RC) techniques, which implement a fixed and high-dimensional recurrent network to process sequential data, are computationally efficient tools to generate a vectorial, fixed-size representation of the MTS , which can be further processed by standard classifiers.
Revised:  Among the existing approaches, reservoir computing (RC) techniques, which implement a fixed and high-dimensional recurrent network to process sequential data, are computationally efficient tools to generate a vectorial, fixed-size representation of the MTS that can be further processed by standard classifiers.
Edit intent: fluency
Original:  Our main contribution is a new method to encode the MTS within the parameters of a linear model , trained to predict a low-dimensional embedding of the reservoir dynamics.
Revised:  Our main contribution is a new method to encode the MTS within the parameters of a linear model trained to predict a low-dimensional embedding of the reservoir dynamics.
Edit intent: fluency
Original:  We compare with state-of-the-art recurrent networks, standard RC approaches andtime series kernels on multiple classification tasks, showing that the proposed algorithms can achieve superior classification accuracy , while being vastly more efficient to train .
Revised:  Results obtained on benchmark and real-world MTS datasets show that RC classifiers are dramatically faster and, when implemented using our proposed representation, also achieve superior classification accuracy , while being vastly more efficient to train .
Edit intent: clarity
Original:  We compare with state-of-the-art recurrent networks, standard RC approaches andtime series kernels on multiple classification tasks, showing that the proposed algorithms can achieve superior classification accuracy , while being vastly more efficient to train .
Revised:  We compare with state-of-the-art recurrent networks, standard RC approaches andtime series kernels on multiple classification tasks, showing that the proposed algorithms can achieve superior classification accuracy .
Edit intent: coherence
Original:  Among the existing approaches, reservoir computing (RC) techniques, which implement a fixed and high-dimensional recurrent network to process sequential data, are computationally efficient tools to generate a vectorial, fixed-size representation of the MTS that can be further processed by standard classifiers.
Revised:  Reservoir Computing (RC) techniques, which implement a fixed and high-dimensional recurrent network to process sequential data, are computationally efficient tools to generate a vectorial, fixed-size representation of the MTS that can be further processed by standard classifiers.
Edit intent: clarity
Original:  Among the existing approaches, reservoir computing (RC) techniques, which implement a fixed and high-dimensional recurrent network to process sequential data, are computationally efficient tools to generate a vectorial, fixed-size representation of the MTS that can be further processed by standard classifiers.
Revised:  Among the existing approaches, reservoir computing (RC) provides efficient tools to generate a vectorial, fixed-size representation of the MTS that can be further processed by standard classifiers.
Edit intent: clarity
Original:  Despite their unrivaled training speed, MTS classifiers based on a standard RC architecture fail to achieve the same accuracy of other classifiers, such as those exploiting fully trainable recurrent networks.
Revised:  Despite their unrivaled training speed, MTS classifiers based on a standard RC architecture fail to achieve the same accuracy of fully trainable neural networks.
Edit intent: clarity
Original:  In this paper we introduce the reservoir model space, an RC approach to learn vectorial representations of MTS in an unsupervised fashion . Each MTS is encoded within the parameters of a linear model trained to predict a low-dimensional embedding of the reservoir dynamics.
Revised:  In this paper we introduce the reservoir model space, an unsupervised approach based on RC to learn vectorial representations of MTS in an unsupervised fashion . Each MTS is encoded within the parameters of a linear model trained to predict a low-dimensional embedding of the reservoir dynamics.
Edit intent: clarity
Original:  In this paper we introduce the reservoir model space, an RC approach to learn vectorial representations of MTS in an unsupervised fashion . Each MTS is encoded within the parameters of a linear model trained to predict a low-dimensional embedding of the reservoir dynamics.
Revised:  In this paper we introduce the reservoir model space, an RC approach to learn vectorial representations of MTS . Each MTS is encoded within the parameters of a linear model trained to predict a low-dimensional embedding of the reservoir dynamics.
Edit intent: clarity
Original:  Our model space yields a powerful representation of the MTS and , thanks to an intermediate dimensionality reduction procedure , attains computational performance comparable to other RC methods .
Revised:  Compared to other RC methods, our model space yields a powerful representation of the MTS and , thanks to an intermediate dimensionality reduction procedure , attains computational performance comparable to other RC methods .
Edit intent: coherence
Original:  Our model space yields a powerful representation of the MTS and , thanks to an intermediate dimensionality reduction procedure , attains computational performance comparable to other RC methods .
Revised:  Our model space yields better representations and attains comparable computational performance , thanks to an intermediate dimensionality reduction procedure , attains computational performance comparable to other RC methods .
Edit intent: clarity
Original:  Our model space yields a powerful representation of the MTS and , thanks to an intermediate dimensionality reduction procedure , attains computational performance comparable to other RC methods .
Revised:  Our model space yields a powerful representation of the MTS and , thanks to an intermediate dimensionality reduction procedure .
Edit intent: clarity
Original:  As a second contribution we propose a modular RC framework for MTS classification, with an associated open source Python library.
Revised:  As a second contribution we propose a modular RC framework for MTS classification, with an associated open-source Python library.
Edit intent: fluency
Original:  By combining the different modules it is possible to seamlessly implement advanced RC architectures , including our proposed unsupervised representation, bidirectional reservoirs, and non-linear readouts, such as deep neural networks with both fixed and flexible activation functions . Results obtained on benchmark and real-world MTS datasets show that RC classifiers are dramatically faster and, when implemented using our proposed representation, also achieve superior classification accuracy.
Revised:  The framework provides different modules to seamlessly implement advanced RC architectures , including our proposed unsupervised representation, bidirectional reservoirs, and non-linear readouts, such as deep neural networks with both fixed and flexible activation functions . Results obtained on benchmark and real-world MTS datasets show that RC classifiers are dramatically faster and, when implemented using our proposed representation, also achieve superior classification accuracy.
Edit intent: clarity
Original:  Understanding these patterns and integrating their impacts in modeling diffusion dynamics of infectious diseases are important for epidemiological studies.
Revised:  Understanding these patterns and integrating their impact in modeling diffusion dynamics of infectious diseases are important for epidemiological studies.
Edit intent: fluency
Original:  Current network-based diffusion models assume that diseases transmit through the interactions where both infected and susceptible individuals are co-located at the same time.
Revised:  Current network-based diffusion models assume that diseases transmit through interactions where both infected and susceptible individuals are co-located at the same time.
Edit intent: fluency
Original:  Recently,  a diffusion model called same place different time (SPDT) transmission was introduced to capture the indirect transmissions that happen when an infected individual leave before a susceptible individual's arrival  .
Revised:  Recently, we introduced a diffusion model called same place different time (SPDT) transmission was introduced to capture the indirect transmissions that happen when an infected individual leave before a susceptible individual's arrival .
Edit intent: coherence
Original:  Recently,  a diffusion model called same place different time (SPDT) transmission was introduced to capture the indirect transmissions that happen when an infected individual leave before a susceptible individual's arrival  .
Revised:  Recently, a diffusion model called same place different time (SPDT) transmission to capture the indirect transmissions that happen when an infected individual leave before a susceptible individual's arrival .
Edit intent: clarity
Original:  Recently,  a diffusion model called same place different time (SPDT) transmission was introduced to capture the indirect transmissions that happen when an infected individual leave before a susceptible individual's arrival  .
Revised:  Recently, a diffusion model called same place different time (SPDT) transmission was introduced to capture the indirect transmissions that happen when an infected individual leaves before a susceptible individual's arrival .
Edit intent: fluency
Original:  In this paper, we demonstrate how these indirect transmission paths significantly enhance the emergence of infectious diseases which are not accounted in the current approach of disease modeling .
Revised:  In this paper, we demonstrate how these indirect transmission links significantly enhance the emergence of infectious diseases which are not accounted in the current approach of disease modeling .
Edit intent: clarity
Original: Overwhelming empirical evidence has shown that online social dynamics mirrors real-world events.
Revised: The advent of the digital era provided a fertile ground for the development of virtual societies, complex systems influencing real-world events.
Edit intent: clarity
Original:  They exploit bots for enhancing both their visibility and influence, generating deep information cascades  to the same extent of news media and other broadcasters . Augmented humans uniformly infiltrate across the full range of identified clusters of accounts, the latter reflecting political parties and their electoral ranks .
Revised:  They exploit bots for enhancing both their visibility and influence, generating deep information cascades , to the same extent of news media and other broadcasters . Augmented humans uniformly infiltrate across the full range of identified clusters of accounts, the latter reflecting political parties and their electoral ranks .
Edit intent: fluency
Original:  They exploit bots for enhancing both their visibility and influence, generating deep information cascades  to the same extent of news media and other broadcasters . Augmented humans uniformly infiltrate across the full range of identified clusters of accounts, the latter reflecting political parties and their electoral ranks .
Revised:  They exploit bots for enhancing both their visibility and influence, generating deep information cascades to the same extent of news media and other broadcasters , while they uniformly infiltrate across the full range of identified clusters of accounts, the latter reflecting political parties and their electoral ranks .
Edit intent: clarity
Original:  They exploit bots for enhancing both their visibility and influence, generating deep information cascades  to the same extent of news media and other broadcasters . Augmented humans uniformly infiltrate across the full range of identified clusters of accounts, the latter reflecting political parties and their electoral ranks .
Revised:  They exploit bots for enhancing both their visibility and influence, generating deep information cascades to the same extent of news media and other broadcasters . Augmented humans uniformly infiltrate across the full range of identified groups. Digital augmentation represents the cyber-physical counterpart of the human desire to acquire power within social systems .
Edit intent: clarity
Original: In applications like medical imaging, error correction, and sensor networks, one needs to solve large-scale linear systems that may be corrupted by a small number of , but arbitrarily large , corruptions.
Revised: In applications like medical imaging, error correction, and sensor networks, one needs to solve large-scale linear systems that may be corrupted by a small number of arbitrarily large corruptions.
Edit intent: coherence
Original:  We prove that CRT_S(4) =3{2} (this confirms_{\mathrm{S}}(5)=}\tfrac{4}{3} a conjecture of Gorbunova and leaves only the value of CRT_S(5) unknown ), and that CRT_I(3)_{\mathrm{I}}(3)} = CRT_W(3)_{\mathrm{W}}(3)} = RT(3) =\tfrac{7}{4}.
Revised:  We prove that \mathrm{CRT =3{2} (this confirms_{\mathrm{S}}(5)=}\tfrac{4}{3} a conjecture of Gorbunova and leaves only the value of CRT_S(5) unknown ), and that CRT_I(3)_{\mathrm{I}}(3)} = CRT_W(3)_{\mathrm{W}}(3)} = RT(3) =\tfrac{7}{4}.
Edit intent: clarity
Original:  We prove that CRT_S(4) =3{2} (this confirms_{\mathrm{S}}(5)=}\tfrac{4}{3} a conjecture of Gorbunova and leaves only the value of CRT_S(5) unknown ), and that CRT_I(3)_{\mathrm{I}}(3)} = CRT_W(3)_{\mathrm{W}}(3)} = RT(3) =\tfrac{7}{4}.
Revised:  We prove that CRT_S(4) =3{2} and \mathrm{CRT_{\mathrm{S}}(5)=}\tfrac{4}{3} a conjecture of Gorbunova and leaves only the value of CRT_S(5) unknown ), and that CRT_I(3)_{\mathrm{I}}(3)} = CRT_W(3)_{\mathrm{W}}(3)} = RT(3) =\tfrac{7}{4}.
Edit intent: coherence
Original:  We prove that CRT_S(4) =3{2} (this confirms_{\mathrm{S}}(5)=}\tfrac{4}{3} a conjecture of Gorbunova and leaves only the value of CRT_S(5) unknown ), and that CRT_I(3)_{\mathrm{I}}(3)} = CRT_W(3)_{\mathrm{W}}(3)} = RT(3) =\tfrac{7}{4}.
Revised:  We prove that CRT_S(4) =3{2} (this confirms_{\mathrm{S}}(5)=}\tfrac{4}{3}, confirming a conjecture of Gorbunova and leaves only the value of CRT_S(5) unknown ), and that CRT_I(3)_{\mathrm{I}}(3)} = CRT_W(3)_{\mathrm{W}}(3)} = RT(3) =\tfrac{7}{4}.
Edit intent: fluency
Original:  We prove that CRT_S(4) =3{2} (this confirms_{\mathrm{S}}(5)=}\tfrac{4}{3} a conjecture of Gorbunova and leaves only the value of CRT_S(5) unknown ), and that CRT_I(3)_{\mathrm{I}}(3)} = CRT_W(3)_{\mathrm{W}}(3)} = RT(3) =\tfrac{7}{4}.
Revised:  We prove that CRT_S(4) =3{2} (this confirms_{\mathrm{S}}(5)=}\tfrac{4}{3} a conjecture of Gorbunova and leaves only the value of CRT_S(5) unknown ), and that CRT_I(3)_{\mathrm{I}}(3)} = CRT_W(3)_{\mathrm{W}}(3)} = \mathrm{RT =\tfrac{7}{4}.
Edit intent: fluency
Original: Cryo-electron microscopy (cryoEM) is fast becoming the preferred method for protein structure determination.
Revised: Cryo-electron microscopy (cryoEM) is an increasingly popular method for protein structure determination.
Edit intent: clarity
Original:  To address this  , we develop a novel objective function, GE-binomial, for learning model parameters in this context.
Revised:  To address this shortcoming , we develop a novel objective function, GE-binomial, for learning model parameters in this context.
Edit intent: clarity
Original:  These viruses have their genomes segmented into two or more parts  encapsidated in separate particles that  propagate independently.
Revised:  Their genome is segmented into two or more parts encapsidated in separate particles that propagate independently.
Edit intent: clarity
Original:  These viruses have their genomes segmented into two or more parts  encapsidated in separate particles that  propagate independently.
Revised:  These viruses have their genomes segmented into two or more parts , and encapsidated in separate particles that propagate independently.
Edit intent: coherence
Original:  These viruses have their genomes segmented into two or more parts  encapsidated in separate particles that  propagate independently.
Revised:  These viruses have their genomes segmented into two or more parts encapsidated in separate particles that appear to propagate independently.
Edit intent: clarity
Original:  The requirement of host co-infection to complete the viral cycle represents a major drawback of this adaptive strategy , while its advantages remain unclear.
Revised:  Completing the replication cycle, however, requires the full genome, so that a persistent infection of a host requires the concurrent presence of several particles. This represents an apparent evolutionary drawback of multipartitism , while its advantages remain unclear.
Edit intent: clarity
Original:  This is also in line with the observed rising of multipartitism concomitantly with the agricultural expansion .
Revised:  This is also in line with the observed rising of multipartitism concomitantly with the expansion of agricultural practices .
Edit intent: clarity
Original:  Completing the replication cycle, however, requires the full genome, so that a persistent infection of a host requires the concurrent presence of several particles.
Revised:  Completing the replication cycle, however, requires the full genome, so that a systemic infection of a host requires the concurrent presence of several particles.
Edit intent: clarity
Original:  However, it is unknown how the putative advantages that multipartitism might enjoy  affect its epidemiology, or if an explicit advantage is needed to explain its ecological persistence.
Revised:  However, it is unknown how the putative advantages that multipartitism might enjoy affect its epidemiology, or if an explicit advantange is needed to explain its ecological persistence.
Edit intent: fluency
Original:  To disentangle which mechanisms might contribute to the rise and fixation of multipartitism, we here investigate the interaction between viral spreading dynamics and host population structure.
Revised:  To disentangle which mechanisms might contribute to the rise and fixation of multipartitism, we investigate the interaction between viral spreading dynamics and host population structure.
Edit intent: coherence
Original:  Furthermore, we find out that multipartitism might rise to fixation even in the absence of explicit microscopic advantages.
Revised:  We find that multipartitism might rise to fixation even in the absence of explicit microscopic advantages.
Edit intent: coherence
Original:  Multipartitism allows the virus to colonize environments that could not be invaded by the monopartite form, while homogeneous contacts between hostsfacilitate its spread .
Revised:  Multipartitism allows the virus to colonize environments that could not be invaded by the monopartite form, facilitated by homogeneous contacts among hosts .
Edit intent: clarity
Original:  We conjecture that there might have been an increase in the diversity and prevalence of multipartite viral forms concomitantly with the expansion of agricultural practices.
Revised:  We conjecture that these features might have led to an increase in the diversity and prevalence of multipartite viral forms concomitantly with the expansion of agricultural practices.
Edit intent: clarity