wanyu/IteraTeR_v2 huggingface dataset:
Original:  We derive expressions for the gaps between the true and (recursively ) computed variables that are used to update the search directions in the different CG variants  .
Revised:  We derive expressions for the gaps between the true and recursively computed variables that are used to update the search directions in the different CG variants .
Edit intent: fluency
Original:  We derive expressions for the gaps between the true and (recursively ) computed variables that are used to update the search directions in the different CG variants  .
Revised:  We derive expressions for the gaps between the true and (recursively ) computed variables that are used to update the search directions in the different CG variants are derived .
Edit intent: clarity
Original:  Furthermore, we show how these results can be used to analyze and correct the effect of local rounding error propagation on the maximal attainable accuracy of pipelined CG methods.
Revised:  Furthermore, it is shown how these results can be used to analyze and correct the effect of local rounding error propagation on the maximal attainable accuracy of pipelined CG methods.
Edit intent: clarity
Original:  The analysis in this work is supplemented by various numerical experiments that demonstrate the numerical stability of the pipelined CG methods.
Revised:  The analysis in this work is supplemented by numerical experiments that demonstrate the numerical stability of the pipelined CG methods.
Edit intent: clarity
Original:  The analysis in this work is supplemented by various numerical experiments that demonstrate the numerical stability of the pipelined CG methods.
Revised:  The analysis in this work is supplemented by various numerical experiments that demonstrate the numerical behavior of the pipelined CG methods.
Edit intent: clarity
Original:  This method involves introducing two types of parameters, i.e  , scalar and tensor parameters.
Revised:  This method involves introducing two types of parameters, i.e . , scalar and tensor parameters.
Edit intent: fluency
Original:  As an ordinary function, when a tensor parameter obtains a tensor as an argument, the function treats the tensor argument as a whole.
Revised:  When a tensor parameter obtains a tensor as an argument, the function treats the tensor argument as a whole.
Edit intent: clarity
Original:  This paper shows that introducing these two types of parametersenables us to apply arbitrary functions to tensor arguments using index notation without requiring an additional descriptionto enable each function to handle tensors .
Revised:  On a language with scalar and tensor parameters, we can design a set of index reduction rules that allows users to use tensor index notation for arbitrary user-defined functions without requiring additional description .
Edit intent: clarity
Original:  It is achieved by providing users the method for controlling the completion of omitted indices .
Revised:  In our proposal, all these tensor operators are user-defined functions and can be passed as arguments of high-order functions .
Edit intent: clarity
Original:  To cope with the diversity of abstraction levels and types of paintings, we introduce a technique to adjust the p arameters of the transfer depending on the painting.
Revised:  To cope with the diversity of abstraction levels and types of paintings, we introduce a technique to adjust the parameters of the transfer depending on the painting.
Edit intent: fluency
Original:  The boxicity of a graph G is the minimum integer d such that G is the intersection graph of d-dimensional axis-aligned boxes.
Revised:  The "boxicity" of a graph G is the minimum integer d such that G is the intersection graph of d-dimensional axis-aligned boxes.
Edit intent: clarity
Original:  In this paper, we simulate data-rich and data-poor fishery and survey data scenarios for a complex of Dover Sole stocksstocks was used to compare estimation errorsfor single-stock and hierarchical multi-stock versions of a Schaefer production model.
Revised:  In this paper, we simulate data-rich and data-poor fishery and survey data scenarios for a complex of Dover Sole stocksstocks was used to compare estimation performance for single-stock and hierarchical multi-stock versions of a Schaefer production model.
Edit intent: clarity
Original:  The single-stock and best performing multi-stock models were then used in stock assessments for the real Dover Sole data.
Revised:  The single-stock and best performing multi-stock models were then used in stock assessments for the real dover sole data.
Edit intent: fluency
Original:  Productivity and relative biomass parameters were most reliably estimated by multi-stock assessment model configurations , but attempting to account for shared process error terms in the assessment model increased bias in absolute biomass and catchability estimates.
Revised:  Productivity and relative biomass parameters were lower for multi-stock assessment model configurations , but attempting to account for shared process error terms in the assessment model increased bias in absolute biomass and catchability estimates.
Edit intent: clarity
Original:  We conclude that applying hierarchical assessment models to multi-stock complexes is useful for data-limited stocks and  provide a more flexible alternative to data-pooling and catch only methods;
Revised:  We conclude that hierarchical multi-stock assessment models are useful for data-limited stocks and provide a more flexible alternative to data-pooling and catch only methods;
Edit intent: clarity
Original:  We conclude that applying hierarchical assessment models to multi-stock complexes is useful for data-limited stocks and  provide a more flexible alternative to data-pooling and catch only methods;
Revised:  We conclude that applying hierarchical assessment models to multi-stock complexes is useful for data-limited stocks and could provide a more flexible alternative to data-pooling and catch only methods;
Edit intent: clarity
Original:  however, because of the non-linear side-effects of parameter shrinkage  , we recommend testing hierarchical multi-stock models in closed-loop simulations before application to real fishery management systems.
Revised:  however, these models are subject to non-linear side-effects of parameter shrinkage , we recommend testing hierarchical multi-stock models in closed-loop simulations before application to real fishery management systems.
Edit intent: clarity
Original:  however, because of the non-linear side-effects of parameter shrinkage  , we recommend testing hierarchical multi-stock models in closed-loop simulations before application to real fishery management systems.
Revised:  however, because of the non-linear side-effects of parameter shrinkage . Therefore , we recommend testing hierarchical multi-stock models in closed-loop simulations before application to real fishery management systems.
Edit intent: coherence
Original:  We have thoroughly explored the scheme of two thermally coupled VO_2 oscillatorsand found its effect of high order synchronization (HOS), which may be used to increase SNN classification capacity N_s. Phase-locking estimation method has been developed to determine values of subharmonic ratio SHR and synchronization effectiveness \eta .
Revised:  We have thoroughly explored the scheme of two thermally coupled VO2 oscillators, we studied a higher order synchronization effect, which can be used in object classification techniques to increase the number of possible synchronous states of the oscillator system. We developed the phase-locking estimation method to increase SNN classification capacity N_s. Phase-locking estimation method has been developed to determine values of subharmonic ratio SHR and synchronization effectiveness \eta .
Edit intent: clarity
Original:  We have thoroughly explored the scheme of two thermally coupled VO_2 oscillatorsand found its effect of high order synchronization (HOS), which may be used to increase SNN classification capacity N_s. Phase-locking estimation method has been developed to determine values of subharmonic ratio SHR and synchronization effectiveness \eta .
Revised:  We have thoroughly explored the scheme of two thermally coupled VO_2 oscillatorsand found its effect of high order synchronization (HOS), which may be used to determine the values of subharmonic ratio SHR and synchronization effectiveness \eta .
Edit intent: coherence
Original:  We have thoroughly explored the scheme of two thermally coupled VO_2 oscillatorsand found its effect of high order synchronization (HOS), which may be used to increase SNN classification capacity N_s. Phase-locking estimation method has been developed to determine values of subharmonic ratio SHR and synchronization effectiveness \eta .
Revised:  We have thoroughly explored the scheme of two thermally coupled VO_2 oscillatorsand found its effect of high order synchronization (HOS), which may be used to increase SNN classification capacity N_s. Phase-locking estimation method has been developed to determine values of subharmonic ratio and synchronization effectiveness \eta .
Edit intent: clarity
Original:  We have thoroughly explored the scheme of two thermally coupled VO_2 oscillatorsand found its effect of high order synchronization (HOS), which may be used to increase SNN classification capacity N_s. Phase-locking estimation method has been developed to determine values of subharmonic ratio SHR and synchronization effectiveness \eta .
Revised:  We have thoroughly explored the scheme of two thermally coupled VO_2 oscillatorsand found its effect of high order synchronization (HOS), which may be used to increase SNN classification capacity N_s. Phase-locking estimation method has been developed to determine values of subharmonic ratio SHR and synchronization effectiveness .
Edit intent: coherence
Original:  In a modelN_s may reach maximum of N_s> 150 at certain levels of coupling strength and noise.
Revised:  In the model, the number of states may reach the maximum value of 150 at certain levels of coupling strength and noise.
Edit intent: clarity
Original:  We demonstrate the long-range synchronization effect in a one-dimensional chain of oscillators and the phenomenon of synchronization transfer even at low values of \eta for intermediate links.
Revised:  The long-range synchronization effect in a one-dimensional chain of oscillators and the phenomenon of synchronization transfer even at low values of \eta for intermediate links.
Edit intent: clarity
Original:  We demonstrate the long-range synchronization effect in a one-dimensional chain of oscillators and the phenomenon of synchronization transfer even at low values of \eta for intermediate links.
Revised:  We demonstrate the long-range synchronization effect in a one-dimensional chain of oscillators occurs even at low values of \eta for intermediate links.
Edit intent: clarity
Original:  We demonstrate the long-range synchronization effect in a one-dimensional chain of oscillators and the phenomenon of synchronization transfer even at low values of \eta for intermediate links.
Revised:  We demonstrate the long-range synchronization effect in a one-dimensional chain of oscillators and the phenomenon of synchronization transfer even at low values of synchronization effectiveness for intermediate links.
Edit intent: clarity
Original:  The described effects increasing classification capacity of oscillator schemes and calculation principles based on the universal physical effect - HOS may be applied for any spiking type oscillators with any coupling type therefore enhancing practical value of the presented results to expand SNN capabilities.
Revised:  The described effects increasing classification capacity of oscillator schemes and calculation principles based on the universal physical effect - HOS may be applied for any spiking type oscillators with any coupling type , enhancing the practical value of the presented results to expand SNN capabilities.
Edit intent: coherence
Original:  The described effects increasing classification capacity of oscillator schemes and calculation principles based on the universal physical effect - HOS may be applied for any spiking type oscillators with any coupling type therefore enhancing practical value of the presented results to expand SNN capabilities.
Revised:  The described effects increasing classification capacity of oscillator schemes and calculation principles based on the universal physical effect - HOS may be applied for any spiking type oscillators with any coupling type therefore enhancing practical value of the presented results to expand spike neural network capabilities.
Edit intent: clarity
Original:  We refer to the proposed network as \textit{region-separative generative adversarial network (RSGAN).
Revised:  We refer to the proposed network as \textit{region-separative generative adversarial network (RSGAN).
Edit intent: fluency
Original:  In this paper, we make a step in this direction by providing a taxonomy of the Web's false information ecosystem, comprising various types of false information, actors, and their motives.
Revised:  In this paper, we make a step in this direction by providing a typology of the Web's false information ecosystem, comprising various types of false information, actors, and their motives.
Edit intent: clarity
Original: Hamiltonian Monte Carlo (HMC) is  the dominant statistical inference algorithm used in most popular  first-order differentiable probabilistic programming languages.
Revised: Hamiltonian Monte Carlo (HMC) is the dominant statistical inference algorithm used in most popular " first-order differentiable probabilistic programming languages.
Edit intent: fluency
Original:  In this paper  we show how to use DHMC for inference in probabilistic programs  .
Revised:  In this paper , we show how to use DHMC for inference in probabilistic programs .
Edit intent: fluency
Original:  In this paper  we show how to use DHMC for inference in probabilistic programs  .
Revised:  In this paper we show how to use extensions to HMC to perform inference in probabilistic programs .
Edit intent: clarity
Original:  To do this we introduce a sufficient set of language restrictions , a corresponding mathematical formalism that ensures that any joint density denoted in such a language has a suitably low measure of discontinuous points, and a recipe for how to apply DHMC in the more general probabilistic-programming context.
Revised:  To do this we introduce a sufficient set of language restrictions , a corresponding mathematical formalism that ensures any joint density denoted in such a language has a suitably low measure of discontinuous points, and a recipe for how to apply DHMC in the more general probabilistic-programming context.
Edit intent: fluency
Original: Social media is becoming an increasingly important data source for learning about and tracking breaking news .
Revised: Social media is becoming an increasingly important data source for learning about breaking news and for following the latest developments of ongoing news .
Edit intent: clarity
Original:  This is  possible thanks to mobile devices connected to the Internet, which allow anyone to post updates from anywhere, leading in turn to a growing presence of citizen journalism.
Revised:  This is in part possible thanks to mobile devices connected to the Internet, which allow anyone to post updates from anywhere, leading in turn to a growing presence of citizen journalism.
Edit intent: clarity
Original:  This is  possible thanks to mobile devices connected to the Internet, which allow anyone to post updates from anywhere, leading in turn to a growing presence of citizen journalism.
Revised:  This is possible thanks to the existence of mobile devices, which allows anyone with access to the Internet to post updates from anywhere, leading in turn to a growing presence of citizen journalism.
Edit intent: clarity
Original:  Consequently, social media has become a go-to resource for journalists during  newsgathering.
Revised:  Consequently, social media has become a go-to resource for journalists during the process of newsgathering.
Edit intent: clarity
Original:  We discuss seven different tasks that researchers have worked on to mitigate the challenges inherent to social media newsgathering: event detection, summarisation, newsrecommenders, content verification , finding information sources, development of newsgathering dashboards and other tasks.
Revised:  We discuss seven different tasks that researchers have worked on to mitigate the challenges inherent to social media newsgathering: news discovery, curation of news, validation and verification of content, newsgathering dashboards, and other tasks.
Edit intent: clarity
Original:  This survey paper is relevant to computer scientists researching news in social media as well as for interdisciplinary researchers interested in the intersection of computer science and journalism.
Revised:  This review is relevant to computer scientists researching news in social media as well as for interdisciplinary researchers interested in the intersection of computer science and journalism.
Edit intent: clarity
Original: As quantum computers have become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classic computer programs for most of their career .
Revised: As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classic computer programs for most of their career .
Edit intent: fluency
Original: As quantum computers have become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classic computer programs for most of their career .
Revised: As quantum computers have become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their career .
Edit intent: fluency
Original: As quantum computers have become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classic computer programs for most of their career .
Revised: As quantum computers have become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classic computer programs for most of their careers .
Edit intent: fluency
Original:  While currently available quantum computers have less than 100 qubits, quantum computer hardware is widely expected to grow in terms of qubit counts , quality, and connectivity.
Revised:  While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit counts , quality, and connectivity.
Edit intent: fluency
Original:  While currently available quantum computers have less than 100 qubits, quantum computer hardware is widely expected to grow in terms of qubit counts , quality, and connectivity.
Revised:  While currently available quantum computers have less than 100 qubits, quantum computer hardware is widely expected to grow in terms of qubit count , quality, and connectivity.
Edit intent: fluency
Original:  Our article aims to explain the principles of quantum programming, which are quite different from classical programming, with straight-forward algebra that makes understanding the underlying quantum mechanics optional(but still fascinating) .
Revised:  This review aims to explain the principles of quantum programming, which are quite different from classical programming, with straight-forward algebra that makes understanding the underlying quantum mechanics optional(but still fascinating) .
Edit intent: clarity
Original:  Our article aims to explain the principles of quantum programming, which are quite different from classical programming, with straight-forward algebra that makes understanding the underlying quantum mechanics optional(but still fascinating) .
Revised:  Our article aims to explain the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding the underlying quantum mechanics optional(but still fascinating) .
Edit intent: fluency
Original:  Our article aims to explain the principles of quantum programming, which are quite different from classical programming, with straight-forward algebra that makes understanding the underlying quantum mechanics optional(but still fascinating) .
Revised:  Our article aims to explain the principles of quantum programming, which are quite different from classical programming, with straight-forward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional .
Edit intent: clarity
Original:  We survey 20 different quantum algorithms, attempting to describe each in a succintc and self-contained fashion ;
Revised:  We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion ;
Edit intent: fluency
Original:  we show how they are implemented on IBM's quantum computer ;
Revised:  we show how they are implemented on IBM's quantum computer ,
Edit intent: fluency
Original:  and in each case  we discuss the results of the implementation with respect to differences of the simulator and the actual hardware runs.
Revised:  and in each case , we discuss the results of the implementation with respect to differences of the simulator and the actual hardware runs.
Edit intent: fluency
Original:  and in each case  we discuss the results of the implementation with respect to differences of the simulator and the actual hardware runs.
Revised:  and in each case we discuss the results of the implementation with respect to differences between the simulator and the actual hardware runs.
Edit intent: fluency
Original:  To understand, predict and control their behavior  a crucial step is to extract reduced descriptions of such networks.
Revised:  To understand, predict and control their behavior , a crucial step is to extract reduced descriptions of such networks.
Edit intent: fluency
Original:  Inspired by notions from Control Theory, here we propose a time-dependent dynamical similarity measure between nodes, which quantifies the effect that a node input has on the network over time .
Revised:  Inspired by notions from Control Theory, we propose a time-dependent dynamical similarity measure between nodes, which quantifies the effect that a node input has on the network over time .
Edit intent: coherence
Original:  Inspired by notions from Control Theory, here we propose a time-dependent dynamical similarity measure between nodes, which quantifies the effect that a node input has on the network over time .
Revised:  Inspired by notions from Control Theory, here we propose a time-dependent dynamical similarity measure between nodes, which quantifies the effect a node-input has on the network over time .
Edit intent: clarity
Original:  Inspired by notions from Control Theory, here we propose a time-dependent dynamical similarity measure between nodes, which quantifies the effect that a node input has on the network over time .
Revised:  Inspired by notions from Control Theory, here we propose a time-dependent dynamical similarity measure between nodes, which quantifies the effect that a node input has on the network .
Edit intent: clarity
Original:  Here we focus on (i)  dimensionality reduction, by projecting nodes onto a low dimensional space capturing dynamic similarity at different time scales, and (ii)  how to exploit our embeddings to uncover functional modules.
Revised:  Here we focus on (i) ~ dimensionality reduction, by projecting nodes onto a low dimensional space capturing dynamic similarity at different time scales, and (ii) how to exploit our embeddings to uncover functional modules.
Edit intent: fluency