wanyu/IteraTeR_v2 huggingface dataset:
Original:  The paper concludes with a discussion of how the insights point to opportunities for generalizing recent advances for the domain of linear algebra libraries to the field of multi-linear computation.
Revised:  The paper concludes with a discussion of how the insights point to opportunities for generalizing recent advances in the domain of linear algebra libraries to the field of multi-linear computation.
Edit intent: clarity
Original:  The result is a complete survey on array data storage and processing that should be consulted by anyone interested in this research topic, independent of experience level  .
Revised:  The result is a thorough survey on array data storage and processing that should be consulted by anyone interested in this research topic, independent of experience level .
Edit intent: clarity
Original: Understanding models which represent the invasion of network-based systems by infectious agents can give important insights into many ` real-world ' situations, including the prevention and control of infectious diseases and computer viruses.
Revised: Understanding models which represent the invasion of network-based systems by infectious agents can give important insights into many real-world ' situations, including the prevention and control of infectious diseases and computer viruses.
Edit intent: fluency
Original: Understanding models which represent the invasion of network-based systems by infectious agents can give important insights into many ` real-world ' situations, including the prevention and control of infectious diseases and computer viruses.
Revised: Understanding models which represent the invasion of network-based systems by infectious agents can give important insights into many ` real-world situations, including the prevention and control of infectious diseases and computer viruses.
Edit intent: fluency
Original:  This could be used to inform targeted interventions when there is a threat from an emerging infection .
Revised:  This could be used to inform targeted interventions when there is a threat from an emerging infectious disease .
Edit intent: clarity
Original:  Precisely, choice from an n+1 point set is reducible to choice from a convex set of dimension n, but not reducible to choice from a convex set of dimension n - 1. Furthermore we consider searching for zeros of continuous functions.
Revised:  Precisely, choice from an n+1 point set is reducible to choice from a convex set of dimension n, but not reducible to choice from a convex set of dimension n-1. Furthermore we consider searching for zeros of continuous functions.
Edit intent: fluency
Original:  We provide an algorithm producing 3^n real numbers containing all zeros of a continuous function with up to n local minima.
Revised:  We provide an algorithm producing 3n real numbers containing all zeros of a continuous function with up to n local minima.
Edit intent: clarity
Original:  Further investigation into numerical quadrature rule suitable for approximating spectral projectors are also worthwhile.
Revised:  Further investigations into numerical quadrature rule suitable for approximating spectral projectors are also worthwhile.
Edit intent: fluency
Original:  A new approach to this calculation based on a density matrix has been proposed recently and a software package FEAST has been developed.
Revised:  A new density-matrix-based algorithm has been proposed recently and a software package FEAST has been developed.
Edit intent: clarity
Original:  Nevertheless, theoretical analysis of FEAST has been lagging and that a convergence proof has yet to be established .
Revised:  Nevertheless, theoretical analysis of FEAST has been lagging . For instance, the FEAST algorithm has not been proven to converge .
Edit intent: clarity
Original:  The analysis here suggests that FEAST can be extended to non-Hermitian problems.
Revised:  We also outline a possible extension of FEAST to handle non-Hermitian problems.
Edit intent: clarity
Original:  Further investigations into numerical quadrature rule suitable for approximating spectral projectors are also worthwhile.
Revised:  Further investigations into numerical quadrature rules suitable for approximating spectral projectors are also worthwhile.
Edit intent: fluency
Original:  Nevertheless, theoretical analysis of FEAST has been lagging .
Revised:  Nevertheless, theoretical analysis of FEAST has lagged .
Edit intent: coherence
Original:  We also outline a possible extension of FEAST to handle non-Hermitian problems .
Revised:  Finally, we propose an extension of FEAST to handle non-Hermitian problems .
Edit intent: clarity
Original:  Our method matches the benchmark deblurring performance of the state-of-the-art while being significantly faster and easier to generalize.
Revised:  Our method competes with the benchmark deblurring performance of the state-of-the-art while being significantly faster and easier to generalize.
Edit intent: clarity
Original:   We introduce two methods to correct this bias  , and we demonstrate that the new methods have power to detect selection in practical parameter regimes, such as those encountered in fitness assays of microbial populations .
Revised:  We introduce two methods to correct this bias , and we demonstrate that the new methods have power to detect selection in practical parameter regimes, such as those encountered in microbial evolution experiments .
Edit intent: clarity
Original:  Our analysis is limited to a single diallelic locus, assumed independent of all other loci in a genome , which is again relevant to simple competition assays of laboratory and natural isolates;
Revised:  Our analysis applies to a single diallelic locus, assumed independent of all other loci in a genome , which is again relevant to simple competition assays of laboratory and natural isolates;
Edit intent: clarity
Original:  Our analysis is limited to a single diallelic locus, assumed independent of all other loci in a genome , which is again relevant to simple competition assays of laboratory and natural isolates;
Revised:  Our analysis is limited to a single diallelic locus, assumed independent of all other loci , which is again relevant to simple competition assays of laboratory and natural isolates;
Edit intent: clarity
Original:  other techniques will be required to detect selection in time series of co-segregating , linked loci.
Revised:  other techniques will be required to detect selection in time series of co-segregating linked loci.
Edit intent: fluency
Original:  Both analytical calculation and numerical simulation show that the degree distribution of nodes in generated networks displays a good right-skewed behaviour . Particularly, scale-free networks are obtained as the deactivated vertex is target selected and exponential networks are realized for the random-selected case.
Revised:  Both analytical calculation and numerical simulation show that the degree distribution of nodes in generated networks displays a good right-skewed behavior . Particularly, scale-free networks are obtained as the deactivated vertex is target selected and exponential networks are realized for the random-selected case.
Edit intent: fluency
Original: The Shannon (block) entropy of the clusters generated by intersecting a long-range correlated sequence with its moving average is studied .
Revised: A new approach to estimate the Shannon entropy of a long-range correlated sequence with its moving average is studied .
Edit intent: clarity
Original: The Shannon (block) entropy of the clusters generated by intersecting a long-range correlated sequence with its moving average is studied .
Revised: The Shannon (block) entropy of the clusters generated by intersecting a long-range correlated sequence is proposed .
Edit intent: clarity
Original:  The entropy is given by two terms , respectively increasing logarithmically and linearly (besides a constant term), corresponding to clusters with power-law or exponentially distributed lengths.
Revised:  The entropy is written as the sum of two terms corresponding respectively to power-law or exponentially distributed lengths.
Edit intent: clarity
Original:  Then, the entropy measure is implemented on the 24 human chromosome sequences  .
Revised:  Then, the entropy measure is implementedordered on the 24 human chromosome sequences .
Edit intent: clarity
Original:  Interestingly, it is found that, for the power-law correlated clusters, the nucleotide composition is  , on the average, equal to the nucleotide composition of the whole  sequence, while , for the exponentially correlated clusters , it fluctuatesaround the average value.
Revised:  Interestingly, the nucleotide composition of the , on the average, equal to the nucleotide composition of the whole sequence, while , for the exponentially correlated clusters , it fluctuatesaround the average value.
Edit intent: clarity
Original:  Interestingly, it is found that, for the power-law correlated clusters, the nucleotide composition is  , on the average, equal to the nucleotide composition of the whole  sequence, while , for the exponentially correlated clusters , it fluctuatesaround the average value.
Revised:  Interestingly, it is found that, for the power-law correlated clusters, the nucleotide composition isordered , on the average, equal to the nucleotide composition of the whole sequence, while , for the exponentially correlated clusters , it fluctuatesaround the average value.
Edit intent: fluency
Original:  Interestingly, it is found that, for the power-law correlated clusters, the nucleotide composition is  , on the average, equal to the nucleotide composition of the whole  sequence, while , for the exponentially correlated clusters , it fluctuatesaround the average value.
Revised:  Interestingly, it is found that, for the power-law correlated clusters, the nucleotide composition is , on the average, comparable to the one of the whole sequence, while , for the exponentially correlated clusters , it fluctuatesaround the average value.
Edit intent: clarity
Original:  Interestingly, it is found that, for the power-law correlated clusters, the nucleotide composition is  , on the average, equal to the nucleotide composition of the whole  sequence, while , for the exponentially correlated clusters , it fluctuatesaround the average value.
Revised:  Interestingly, it is found that, for the power-law correlated clusters, the nucleotide composition is , on the average, equal to the nucleotide composition of the whole analyzed sequence, while , for the exponentially correlated clusters , it fluctuatesaround the average value.
Edit intent: clarity
Original:  How these fluctuations correlate to biological properties  such as segmental duplications , gene densityof each chromosome is finally discussed .
Revised:  How these fluctuations correlate to biological properties such as segmental duplications and gene density .
Edit intent: clarity
Original: Most discovery systems for silent failures work in two phases: a continuous monitoring phase that detects presence of failures  and a localization phase that identifies the faulty element(s).
Revised: Most discovery systems for silent failures work in two phases: a continuous monitoring phase that detects presence of failures and a localization phase that pinpoints the faulty element(s).
Edit intent: clarity
Original:  This separation is important because localization requires more significant resources than detection and should be initiated only when a fault is present.
Revised:  This separation is important because localization requires significantly more resources than detection and should be initiated only when a fault is present.
Edit intent: fluency
Original:  We define {\em memoryless schedules} -- a subclass of stochastic schedules which is simple and suitable for distributed deployment.
Revised:  We define {\em Memoryless schedules} -- a subclass of stochastic schedules which is simple and suitable for distributed deployment.
Edit intent: fluency
Original:  We show that optimal memorlyess schedules can be efficiently computed by convex programs (for SUM objectives) or linear programs (for MAX objectives), and surprisingly perhaps, are guaranteed to have expected detection times that are not too far off the (NP hard) stochastic optima.
Revised:  We show that the optimal memorlyess schedulers can be efficiently computed by convex programs (for SUM objectives) or linear programs (for MAX objectives), and surprisingly perhaps, are guaranteed to have expected detection times that are not too far off the (NP hard) stochastic optima.
Edit intent: clarity
Original:  Deterministic schedules {\em  allow us to bound the maximum (rather than expected) cost of undetected faults, but like stochastic schedules, are NP hard to optimize.
Revised:  {\em allow us to bound the maximum (rather than expected) cost of undetected faults, but like stochastic schedules, are NP hard to optimize.
Edit intent: clarity
Original:  Deterministic schedules {\em  allow us to bound the maximum (rather than expected) cost of undetected faults, but like stochastic schedules, are NP hard to optimize.
Revised:  Deterministic schedules {\em Deterministic schedules allow us to bound the maximum (rather than expected) cost of undetected faults, but like stochastic schedules, are NP hard to optimize.
Edit intent: fluency
Original:  We propose novel efficient deterministic schedulers with analytic performance guarantees and simulate them on real networks .
Revised:  We develop novel efficient deterministic schedulers with analytic performance guarantees and simulate them on real networks .
Edit intent: clarity
Original:  We propose novel efficient deterministic schedulers with analytic performance guarantees and simulate them on real networks .
Revised:  We propose novel efficient deterministic schedulers with provable approximation ratios. An extensive simulation study on real networks .
Edit intent: clarity
Original:  In fact, we for the first time provided an explicit and definitive formulation that considered at once: the lattice profile, the users  random geometry, the effect of the far-field phenomenon, the path-loss behavior, and the stochastic impact of channel scatters.
Revised:  In fact, we provided an explicit and definitive formulation that considered at once: the lattice profile, the users random geometry, the effect of the far-field phenomenon, the path-loss behavior, and the stochastic impact of channel scatters.
Edit intent: clarity
Original:  In fact, we for the first time provided an explicit and definitive formulation that considered at once: the lattice profile, the users  random geometry, the effect of the far-field phenomenon, the path-loss behavior, and the stochastic impact of channel scatters.
Revised:  In fact, we for the first time provided an explicit and definitive formulation that considered at once: the lattice profile, the users ' random geometry, the effect of the far-field phenomenon, the path-loss behavior, and the stochastic impact of channel scatters.
Edit intent: fluency
Original:  The veracity and accuracy of the theoretical analysis was confirmed through Monte Carlo simulations.
Revised:  The veracity and accuracy of the theoretical analysis were also confirmed through Monte Carlo simulations.
Edit intent: clarity
Original: In this work , we analyze the learning ability of diffusion-based distributed learners that receive a continuous stream of data arising from the same distribution.
Revised: This work studies the learning ability of diffusion-based distributed learners that receive a continuous stream of data arising from the same distribution.
Edit intent: clarity
Original: In this work , we analyze the learning ability of diffusion-based distributed learners that receive a continuous stream of data arising from the same distribution.
Revised: In this work , we analyze the learning ability of consensus and diffusion distributed learners from continuous streams of data arising from the same distribution.
Edit intent: clarity
Original:  First, we obtain closed-form expressions for the evolution of their excess-risk  for strongly-convex risk functions under a diminishing step-size rule.
Revised:  First, closed-form expressions for the evolution of their excess-risk for strongly-convex risk functions under a diminishing step-size rule.
Edit intent: clarity
Original:  Using the result, we then show that the distributed strategy can improve the asymptotic convergence rate of the excess-risk by a factor of N relative to non-cooperative schemes , where N is the number of learners in the ad-hoc network.
Revised:  Using these results, it is shown that the diffusion strategy improves the asymptotic convergence rate of the excess-risk by a factor of N relative to non-cooperative schemes , where N is the number of learners in the ad-hoc network.
Edit intent: clarity
Original:  Using the result, we then show that the distributed strategy can improve the asymptotic convergence rate of the excess-risk by a factor of N relative to non-cooperative schemes , where N is the number of learners in the ad-hoc network.
Revised:  Using the result, we then show that the distributed strategy can improve the asymptotic convergence rate of the excess-risk relative to non-cooperative schemes , where N is the number of learners in the ad-hoc network.
Edit intent: clarity
Original:  Using these results, it is shown that the diffusion strategy improves the asymptotic convergence rate of the excess-risk relative to non-cooperative schemes.
Revised:  Second, using these results, it is shown that the diffusion strategy improves the asymptotic convergence rate of the excess-risk relative to non-cooperative schemes.
Edit intent: coherence
Original:  It is also shown that when the in-network cooperation rules are designed optimally, the performance of the diffusion implementation can outperform that of naive centralized processing.
Revised:  Third, it is shown that when the in-network cooperation rules are designed optimally, the performance of the diffusion implementation can outperform that of naive centralized processing.
Edit intent: clarity
Original:  The arguments further show that diffusion outperforms consensus strategies by reducing the overshoot during the transient phase of the learning process and asymptotically as well .
Revised:  Finally, the arguments further show that diffusion outperforms consensus strategies by reducing the overshoot during the transient phase of the learning process and asymptotically as well .
Edit intent: coherence
Original: In this paper we introduce Redberry - an open source computer algebra system designed to manipulate with symbolic tensorial expressions.
Revised: In this paper we introduce Redberry --- an open source computer algebra system designed to manipulate with symbolic tensorial expressions.
Edit intent: fluency
Original: In this paper we introduce Redberry - an open source computer algebra system designed to manipulate with symbolic tensorial expressions.
Revised: In this paper we introduce Redberry - an open source computer algebra system with native support of tensorial expressions.
Edit intent: clarity
Original:  It implements basic computer algebra system routines as well as complex tools for real computations in physics.
Revised:  It provides basic computer algebra system routines as well as complex tools for real computations in physics.
Edit intent: clarity
Original:  \LaTeX The high energy physics package includes tools for Feynman diagrams calculation: Dirac and SU(N) traces , Levi-Civita simplifications and tools for one-loop calculations in general field theory.
Revised:  \LaTeX The high energy physics package includes tools for Feynman diagrams calculation: Dirac and SU(N) algebra , Levi-Civita simplifications and tools for one-loop calculations in general field theory.
Edit intent: coherence
Original:  In the present paper we give detailed description of Redberry functionality : from basic manipulations with tensors to real Feynman diagrams calculation, accompanied by many examples.
Revised:  In the paper we give detailed description of Redberry functionality : from basic manipulations with tensors to real Feynman diagrams calculation, accompanied by many examples.
Edit intent: coherence
Original:  In the present paper we give detailed description of Redberry functionality : from basic manipulations with tensors to real Feynman diagrams calculation, accompanied by many examples.
Revised:  In the present paper we give detailed overview of Redberry features : from basic manipulations with tensors to real Feynman diagrams calculation, accompanied by many examples.
Edit intent: clarity
Original:  This is the strategy introduced by Nei (1967) to understand genetic transmission, through the evolutionary theory of modifier genes, whose methods are adopted here.
Revised:  This is the strategy introduced by Nei (1967) to understand genetic transmission, through the evolutionary theory of modifier genes, whose methodology is adopted here.
Edit intent: fluency
Original:  In addition, with the aim of verified computation , more explicit error bounds that are computable have been recently given on the finite interval.
Revised:  In addition, for verified automatic integration , more explicit error bounds that are computable have been recently given on the finite interval.
Edit intent: clarity
Original:  In addition, with the aim of verified computation , more explicit error bounds that are computable have been recently given on the finite interval.
Revised:  In addition, with the aim of verified computation , more explicit error bounds that are computable have been recently given on a finite interval.
Edit intent: fluency
Original:  In this paper, such explicit error bounds are given in the remaining case: on the semi-infinite interval and the infinite interval .
Revised:  In this paper, such explicit error bounds are given in the remaining cases on semi-infinite interval and the infinite interval .
Edit intent: fluency
Original:  In this paper, such explicit error bounds are given in the remaining case: on the semi-infinite interval and the infinite interval .
Revised:  In this paper, such explicit error bounds are given in the remaining case: on the semi-infinite and infinite intervals .
Edit intent: fluency
Original:  One mechanism consists of chemical interactions which governs the overall drift of species amounts in the system;
Revised:  One mechanism consists of chemical interactions which govern the overall drift of species amounts in the system;
Edit intent: fluency
Original:  This book is intended for use by ichthyologists, ecologists, environmental protection andmanagement of natural resources specialists.
Revised:  This book is intended for use by ichthyologists, ecologists, environmental protection and management of natural resources specialists.
Edit intent: fluency
Original: The financial crisis marked a paradigm shift, from traditional studies of individual risk to recent research on the "systemicrisk" generated by whole networks of institutions.
Revised: The financial crisis clearly illustrated the importance of characterizing the level of `systemic' risk associated with an entire credit network, rather than with single institutions.
Edit intent: clarity
Original:  We find that many topological properties, after controlling for overall densityeffects, display an abrupt change in 2008, thus providing a clear but unpredictable signature of the crisis.
Revised:  We find that many topological properties, after controlling for overall densityeffects, display an abrupt change in 2008, providing a clear but unpredictable signature of the crisis.
Edit intent: coherence
Original:  We find that many topological properties, after controlling for overall densityeffects, display an abrupt change in 2008, thus providing a clear but unpredictable signature of the crisis.
Revised:  We find that many topological properties, after controlling for overall densityeffects, display an abrupt change in 2008, thus providing a clear - but unpredictable - signature of the crisis.
Edit intent: fluency