wanyu/IteraTeR_v2 huggingface dataset:
Original:  For a specific data set, we achieved speed-up up to a factor 100.
Edit intent: coherence
Original: This paper studies optimal market making for large--tick assets in the presence of latency.
Revised: This paper studies optimal market making for large-tick assets in the presence of latency.
Edit intent: fluency
Original:  We give analytic formulae for the special cases of three, four, and five nodes and show , using data on U.S. airline networks, that they have very fast runtime performance  .
Revised:  We give analytic formulae for the special cases of three, four, and five nodes and show that they have very fast runtime performance .
Edit intent: clarity
Original:  We discuss  theoretical properties and limitations of the new measure, and use it to provide insight into changes in network structure over time .
Revised:  We discuss some theoretical properties and limitations of the new measure, and use it to provide insight into changes in network structure over time .
Edit intent: clarity
Original:  It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to 3 and more dimensions , together with adaptive quantization , run-length and arithmetic coding to store the HOSVD transform coefficients ' relative positions as sorted by their absolute magnitude .
Revised:  It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to three dimensions and higher , together with adaptive quantization , run-length and arithmetic coding to store the HOSVD transform coefficients ' relative positions as sorted by their absolute magnitude .
Edit intent: clarity
Original:  It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to 3 and more dimensions , together with adaptive quantization , run-length and arithmetic coding to store the HOSVD transform coefficients ' relative positions as sorted by their absolute magnitude .
Revised:  It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to 3 and more dimensions , together with adaptive quantization , run-length and arithmetic coding to compress the HOSVD transform coefficients ' relative positions as sorted by their absolute magnitude .
Edit intent: clarity
Original:  It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to 3 and more dimensions , together with adaptive quantization , run-length and arithmetic coding to store the HOSVD transform coefficients ' relative positions as sorted by their absolute magnitude .
Revised:  It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to 3 and more dimensions , together with adaptive quantization , run-length and arithmetic coding to store the HOSVD transform coefficients .
Edit intent: clarity
Original:  Our scheme degrades the data particularly smoothly and outperforms other state-of-the-art volume compressors at low-to-medium bit rates, as  required in data archiving and management for visualization purposes.
Revised:  Our scheme degrades the data particularly smoothly and outperforms other state-of-the-art algorithms at low-to-medium bit rates, as required in data archiving and management for visualization purposes.
Edit intent: clarity
Original:  Our scheme degrades the data particularly smoothly and outperforms other state-of-the-art volume compressors at low-to-medium bit rates, as  required in data archiving and management for visualization purposes.
Revised:  Our scheme degrades the data particularly smoothly and outperforms other state-of-the-art volume compressors at low-to-medium bit rates, as it is required in data archiving and management for visualization purposes.
Edit intent: coherence
Original:  Further advantages of the proposed algorithm include extremely fine bit rate selection granularity , bounded resulting l^2 error, and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct subsampled or filtered-resampled versions of all (or selected parts) of the data set.
Revised:  Further advantages of the proposed algorithm include very fine bit rate selection granularity , bounded resulting l^2 error, and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct subsampled or filtered-resampled versions of all (or selected parts) of the data set.
Edit intent: fluency
Original:  Further advantages of the proposed algorithm include extremely fine bit rate selection granularity , bounded resulting l^2 error, and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct subsampled or filtered-resampled versions of all (or selected parts) of the data set.
Revised:  Further advantages of the proposed algorithm include extremely fine bit rate selection granularity and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct subsampled or filtered-resampled versions of all (or selected parts) of the data set.
Edit intent: clarity
Original:  Further advantages of the proposed algorithm include extremely fine bit rate selection granularity , bounded resulting l^2 error, and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct subsampled or filtered-resampled versions of all (or selected parts) of the data set.
Revised:  Further advantages of the proposed algorithm include extremely fine bit rate selection granularity , bounded resulting l^2 error, and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct filtered and/or subsampled versions of all (or selected parts) of the data set.
Edit intent: clarity
Original:  For multi-parameter problems, we improve on and generalize our previous work.
Revised:  For multiparameter problems, we improve on and generalize our previous work.
Edit intent: fluency
Original: Using a mean-field network formulation of the Bass innovation diffusion model and exact results by Fotohui and Rabbat on the degree correlations of Barabasi-Albert networks, we compute the times of the diffusion peak and compare them with those on scale-free networks which have the same scale-free exponent but different assortativity properties.
Revised: Using a mean-field network formulation of the Bass innovation diffusion model and exact results by Fotouhi and Rabbat on the degree correlations of Barabasi-Albert networks, we compute the times of the diffusion peak and compare them with those on scale-free networks which have the same scale-free exponent but different assortativity properties.
Edit intent: fluency
Original:  Finally, we verify the effectiveness and efficiency of the proposed method through extensive experiments on real and synthetic datasets  .
Revised:  Finally, we conduct extensive experiments on real and synthetic datasets .
Edit intent: clarity
Original:  Finally, we conduct extensive experiments on real and synthetic datasets which verify the efficiency and effectiveness of our proposed algorithms .
Revised:  Finally, we verify the effectiveness and efficiency of the proposed method through extensive experiments on real and synthetic datasets which verify the efficiency and effectiveness of our proposed algorithms .
Edit intent: clarity
Original:  Finally, we conduct extensive experiments on real and synthetic datasets which verify the efficiency and effectiveness of our proposed algorithms .
Revised:  Finally, we conduct extensive experiments on real and synthetic datasets .
Edit intent: clarity
Original: We adapt population annealing , a simulation scheme originating from Monte Carlo simulations , to all-atom molecular dynamics simulations .
Revised: Population annealing is a powerful tool for large-scale Monte Carlo simulations , to all-atom molecular dynamics simulations .
Edit intent: clarity
Original: We adapt population annealing , a simulation scheme originating from Monte Carlo simulations , to all-atom molecular dynamics simulations .
Revised: We adapt population annealing , a simulation scheme originating from Monte Carlo simulations . We adapt this method to molecular dynamics simulations .
Edit intent: clarity
Original:  The method is compared to the well established parallel tempering approach of accelerating simulations, and it is found to yield a similar broadening of the accessible configuration space compared to canonical simulations .
Revised:  The method is compared to the well established parallel tempering approach and is found to yield a similar broadening of the accessible configuration space compared to canonical simulations .
Edit intent: clarity
Original:  The method is compared to the well established parallel tempering approach of accelerating simulations, and it is found to yield a similar broadening of the accessible configuration space compared to canonical simulations .
Revised:  The method is compared to the well established parallel tempering approach of accelerating simulations, and it is found to yield similar performance for the same computational resources .
Edit intent: clarity
Original:  We develop \emph{local differential privacy , which is a strong notion that guarantees user privacy regardless of any auxiliary information an adversary may have, for a larger family of convex distributed optimization problems.
Revised:  We develop \emph{local differential privacy , which is a strong notion that guarantees user privacy regardless of any auxiliary information an adversary may have, for a larger family of convex distributed optimization problems.
Edit intent: fluency
Original:  We analyze inherent trade-offs between privacy and suboptimality and propose allocation schemes to divide the maximum allowable noise, a privacy budget , among all participating agents.
Revised:  We analyze inherent trade-offs between privacy and suboptimality and propose allocation schemes to divide the maximum allowable noise, a privacy budget , among all participating agents.
Edit intent: fluency
Original:  Based on the frequency decomposition of covariance between indicator functions  , we define the quantile cross-spectral beta of an assetcapturing tail-specific  as well as horizon-, or frequency-specific  risks.
Revised:  Based on the frequency decomposition of covariance between indicator functions , we define a as well as horizon-, or frequency-specific risks.
Edit intent: clarity
Original:  First, we define tail market risk that captures dependence between extremely low market as well as asset returns.
Revised:  First, we define tail market risk that captures dependence between extremely low market and asset returns.
Edit intent: clarity
Original:  Results suggest that both frequency-specific tail market risk and extreme volatility risks are significantly priced and our five-factor model provides improvement over specifications considered by previous literature.
Revised:  Results suggest that both frequency-specific tail market risk and extreme volatility risk are priced and our five-factor model provides improvement over specifications considered by previous literature.
Edit intent: clarity
Original:  Results suggest that both frequency-specific tail market risk and extreme volatility risks are significantly priced and our five-factor model provides improvement over specifications considered by previous literature.
Revised:  Results suggest that both frequency-specific tail market risk and extreme volatility risks are significantly priced and our final model provides significant improvement over specifications considered by previous literature.
Edit intent: clarity
Original:  Based on the decomposition of covariance between indicator functions capturing fluctuations of different parts of return distributions over various frequencies, we define aquantile spectral beta representation that characterizes asset's risk generally.
Revised:  Based on the decomposition of covariance between indicator functions capturing fluctuations of different parts of return distributions over various frequencies, we define a beta representation that characterizes asset's risk generally.
Edit intent: clarity
Original:  Nesting the traditional frameworks, the new representation explainstail -specific as well as horizon-, or frequency-specificspectral risks.
Revised:  Nesting the traditional frameworks, the new representation explains -specific as well as horizon-, or frequency-specificspectral risks.
Edit intent: fluency
Original:  Nesting the traditional frameworks, the new representation explainstail -specific as well as horizon-, or frequency-specificspectral risks.
Revised:  Nesting the traditional frameworks, the new representation explainstail spectral risks.
Edit intent: clarity
Original:  Nesting the traditional frameworks, the new representation explainstail -specific as well as horizon-, or frequency-specificspectral risks.
Revised:  Nesting the traditional frameworks, the new representation explainstail -specific as well as horizon-, or frequency-specific risks.
Edit intent: fluency
Original:  P2RoCAl offers better data utility than similar methods: classification accuracies of P2RoCAl perturbed data streams are very close to those of the original data streams.
Revised:  P2RoCAl offers better data utility than similar methods: classification accuracies of P^2RoCAl perturbed data streams are very close to those of the original data streams.
Edit intent: clarity
Original:  P2RoCAl also provides higher resilience against data reconstruction attacks.
Revised:  P^2RoCAl also provides higher resilience against data reconstruction attacks.
Edit intent: fluency
Original: We propose an approach to constructing iterative methods for simultaneously finding polynomial roots  .
Revised: We propose an approach to constructing iterative methods for finding polynomial roots .
Edit intent: clarity
Original: We propose an approach to constructing iterative methods for simultaneously finding polynomial roots  .
Revised: We propose an approach to constructing iterative methods for simultaneously finding polynomial roots simultaneously .
Edit intent: coherence
Original:  One feature of which is the use of the fundamental theorem of symmetric polynomials.
Revised:  One feature of this approach is using the fundamental theorem of symmetric polynomials.
Edit intent: clarity
Original:  The most interesting results are the simultaneous Householder's method and some generalizations of the Durand-Kerner method.
Revised:  The new results presented in this paper are simultaneous Householder's method and some generalizations of the Durand-Kerner method.
Edit intent: clarity
Original:   The new results presented in this paper are simultaneous Householder's method and some generalizations of the Durand-Kerner method.
Revised:  The new results presented in this paper are some modifications of the Durand-Kerner method.
Edit intent: clarity
Original:  Although many powerful mathematical tools have been developed to analyse stochastic dynamics, quite rarely these are applied to experimental developmental biology.
Revised:  Although many powerful mathematical tools have been developed to analyse stochastic dynamics, rarely these are applied to experimental developmental biology.
Edit intent: clarity
Original:  Here, we take root tip regeneration in the plant model system Arabidopsis thaliana as an example of robust morphogenesis in living tissue , and present a novel approach to quantify and model the relaxation of the system to its intact morphology.
Revised:  Here, we take root tip regeneration in the plant model system Arabidopsis thaliana as an example of robust morphogenesis in living tissue and present a novel approach to quantify and model the relaxation of the system to its intact morphology.
Edit intent: fluency
Original:  Here, we take root tip regeneration in the plant model system Arabidopsis thaliana as an example of robust morphogenesis in living tissue , and present a novel approach to quantify and model the relaxation of the system to its intact morphology.
Revised:  Here, we take root tip regeneration in the plant model system Arabidopsis thaliana as an example of robust morphogenesis in living tissue , and present a novel approach to quantify and model the relaxation of the system to its unperturbed morphology.
Edit intent: clarity
Original:  By generating and analysing time-lapse series of confocal microscopy images of regenerating root tips  , we are able to extract and model the dynamics of key morphological traits at cellular resolution.
Revised:  By generating and analysing time-lapse series of regenerating root tips , we are able to extract and model the dynamics of key morphological traits at cellular resolution.
Edit intent: clarity
Original:  By generating and analysing time-lapse series of confocal microscopy images of regenerating root tips  , we are able to extract and model the dynamics of key morphological traits at cellular resolution.
Revised:  By generating and analysing time-lapse series of confocal microscopy images of regenerating root tips captured with confocal microscopy , we are able to extract and model the dynamics of key morphological traits at cellular resolution.
Edit intent: clarity
Original:  We find that the resulting eigenvalues can be classified in two groups, suggesting the co-existence of two distinct temporal scales during the process of regeneration.
Revised:  We find that the resulting eigenvalues can be classified into two groups, suggesting the co-existence of two distinct temporal scales during the process of regeneration.
Edit intent: fluency
Original:  We discuss the possible biological implications of our specific results , and suggest future experiments to further probe the self-organising properties of living tissue.
Revised:  We discuss the possible biological implications of our specific results and suggest future experiments to further probe the self-organising properties of living tissue.
Edit intent: fluency
Original: Sustained rhythmic oscillations, pulsing dynamics, directly emerge when the local connection scheme is randomised in 3-value complex cellular automata --- those characterised by emergent "glider" dynamics.
Revised: Sustained rhythmic oscillations, pulsing dynamics, emerge spontaneously when the local connection scheme is randomised in 3-value complex cellular automata --- those characterised by emergent "glider" dynamics.
Edit intent: clarity
Original: Sustained rhythmic oscillations, pulsing dynamics, directly emerge when the local connection scheme is randomised in 3-value complex cellular automata --- those characterised by emergent "glider" dynamics.
Revised: Sustained rhythmic oscillations, pulsing dynamics, directly emerge when the local connection scheme is randomised in 3-value cellular automata that feature "glider" dynamics.
Edit intent: clarity
Original:  With random wiring, time-plots of pulsing measures maintain a particular waveform for each complex rule, and scatter plots of entropy/density and the density return-map , show unique signatures, which have the characteristics of chaotic strange attractors.
Revised:  Time-plots of pulsing measures maintain a particular waveform for each complex rule, and scatter plots of entropy/density and the density return-map , show unique signatures, which have the characteristics of chaotic strange attractors.
Edit intent: clarity
Original:  With random wiring, time-plots of pulsing measures maintain a particular waveform for each complex rule, and scatter plots of entropy/density and the density return-map , show unique signatures, which have the characteristics of chaotic strange attractors.
Revised:  With random wiring, time-plots of pulsing measures maintain a distinct waveform for each complex rule, and scatter plots of entropy/density and the density return-map , show unique signatures, which have the characteristics of chaotic strange attractors.
Edit intent: clarity
Original:  With random wiring, time-plots of pulsing measures maintain a particular waveform for each complex rule, and scatter plots of entropy/density and the density return-map , show unique signatures, which have the characteristics of chaotic strange attractors.
Revised:  With random wiring, time-plots of pulsing measures maintain a particular waveform for each glider rule, and scatter plots of entropy/density and the density return-map , show unique signatures, which have the characteristics of chaotic strange attractors.
Edit intent: clarity
Original:  With random wiring, time-plots of pulsing measures maintain a particular waveform for each complex rule, and scatter plots of entropy/density and the density return-map , show unique signatures, which have the characteristics of chaotic strange attractors.
Revised:  With random wiring, time-plots of pulsing measures maintain a particular waveform for each complex rule, and scatter plots of entropy/density and the density return-map show unique signatures, which have the characteristics of chaotic strange attractors.
Edit intent: fluency
Original: A flexible and effective algorithm GRPF (Global complex Roots and Poles Finding) for complex roots and poles finding is presented.
Revised: A flexible and effective algorithm for complex roots and poles finding is presented.
Edit intent: coherence
Original:  The effectiveness of the presented technique is supported by numerical tests involving different types of functions (microwave and optical applications) .
Revised:  The effectiveness of the presented technique is supported by numerical tests involving different types of structures, where electromagnetic waves are guided and radiated .
Edit intent: clarity
Original:  High efficiency of the proposed method is demonstrated by its comparison with other sampling techniques (LHS, Sobol  sequence sampling, and Maxvol sampling) on the problem of least-squares polynomial approximation.
Revised:  High efficiency of the proposed method is demonstrated by its comparison with other sampling techniques (LHS, Sobol ' sequence sampling, and Maxvol sampling) on the problem of least-squares polynomial approximation.
Edit intent: fluency
Original:  Additional materials are available at URL vogl/dafx2018.
Revised:  Additional materials are available at URL 
Edit intent: clarity
Original:  From the model, we can determine the number of different molecule compositions at the time of the creation of Earth to be 1.6 million and the number of molecule compositions in interstellar space to a mere 719.
Revised:  From the model, we can determine the number of different molecule compositions at the time of the emergence of Earth to be 1.6 million and the number of molecule compositions in interstellar space to a mere 719.
Edit intent: clarity
Original:  From the model, we can determine the number of different molecule compositions at the time of the creation of Earth to be 1.6 million and the number of molecule compositions in interstellar space to a mere 719.
Revised:  From the model, we can determine the number of different molecule compositions at the time of the creation of Earth to be 1.6 million and the number of molecule compositions in interstellar space to a mere 719 species.
Edit intent: clarity
Original:  We use a low dimensional, computationally tractable summary statistic, dubbed the singleton-tail statistic, to carry out approximate likelihood ratio tests between these models .
Revised:  We use a low dimensional, computationally tractable summary statistic, dubbed the singleton-tail statistic, to carry out approximate likelihood ratio tests between these model classes .
Edit intent: clarity
Original:  The singleton-tail statistic has been shown to distinguish between the two classes with high power in the simple setting of neutrally evolving, panmictic populations without recombination.
Revised:  The singleton-tail statistic has been shown to distinguish between them with high power in the simple setting of neutrally evolving, panmictic populations without recombination.
Edit intent: clarity
Original: Persistence diagrams are important feature descriptors in Topological Data Analysis.
Revised: Persistence diagrams are important descriptors in Topological Data Analysis.
Edit intent: clarity