wanyu/IteraTeR_v2 huggingface dataset:
Original:  yielding accurate solutions to such complex models while considering the entire spectrum of scales . Based on operator splitting, finite volume adaptive multiresolution , and high order time integrators with specific stability properties for each operator, these methods yield a high computational efficiency for stiff reaction-diffusion problems and were specifically designed to carry out large multidimensional simulations on standard architectures such as powerful workstations.
Revised:  yielding accurate solutions to such complex models while considering the entire spectrum of scales . Based on operator splitting, finite volume adaptive multiresolution , and high order time integrators with specific stability properties for each operator, this strategy yields high computational efficiency for stiff reaction-diffusion problems and were specifically designed to carry out large multidimensional simulations on standard architectures such as powerful workstations.
Edit intent: clarity
Original:  yielding accurate solutions to such complex models while considering the entire spectrum of scales . Based on operator splitting, finite volume adaptive multiresolution , and high order time integrators with specific stability properties for each operator, these methods yield a high computational efficiency for stiff reaction-diffusion problems and were specifically designed to carry out large multidimensional simulations on standard architectures such as powerful workstations.
Revised:  yielding accurate solutions to such complex models while considering the entire spectrum of scales . Based on operator splitting, finite volume adaptive multiresolution , and high order time integrators with specific stability properties for each operator, these methods yield a high computational efficiency for large multidimensional computations on standard architectures such as powerful workstations.
Edit intent: coherence
Original:  While demonstrating the potential of such techniques the data structures of the original implementation, based on trees of pointers, provided limited opportunities for computational efficiency optimizations and posed challenges in terms of parallel programming and load balancing.
Revised:  However, the data structure of the original implementation, based on trees of pointers, provided limited opportunities for computational efficiency optimizations and posed challenges in terms of parallel programming and load balancing.
Edit intent: coherence
Original:  While demonstrating the potential of such techniques the data structures of the original implementation, based on trees of pointers, provided limited opportunities for computational efficiency optimizations and posed challenges in terms of parallel programming and load balancing.
Revised:  While demonstrating the potential of such techniques the data structures of the original implementation, based on trees of pointers, provides limited opportunities for computational efficiency optimizations and posed challenges in terms of parallel programming and load balancing.
Edit intent: fluency
Original:  While demonstrating the potential of such techniques the data structures of the original implementation, based on trees of pointers, provided limited opportunities for computational efficiency optimizations and posed challenges in terms of parallel programming and load balancing.
Revised:  While demonstrating the potential of such techniques the data structures of the original implementation, based on trees of pointers, provided limited opportunities for efficiency enhancements, while posing serious challenges in terms of parallel programming and load balancing.
Edit intent: clarity
Original:  The present contribution proposes a new implementation of the whole set of numerical methods including Radau5 and Rock4 , relying on  fully different data structures together with the use of a specific library, TBB, for shared-memory, task-based parallelism with work stealing .
Revised:  The present contribution proposes a new implementation of the whole set of numerical methods including Radau5 and ROCK4 , relying on fully different data structures together with the use of a specific library, TBB, for shared-memory, task-based parallelism with work stealing .
Edit intent: fluency
Original:  The present contribution proposes a new implementation of the whole set of numerical methods including Radau5 and Rock4 , relying on  fully different data structures together with the use of a specific library, TBB, for shared-memory, task-based parallelism with work stealing .
Revised:  The present contribution proposes a new implementation of the whole set of numerical methods including Radau5 and Rock4 , relying on a fully different data structures together with the use of a specific library, TBB, for shared-memory, task-based parallelism with work stealing .
Edit intent: fluency
Original:  The present contribution proposes a new implementation of the whole set of numerical methods including Radau5 and Rock4 , relying on  fully different data structures together with the use of a specific library, TBB, for shared-memory, task-based parallelism with work stealing .
Revised:  The present contribution proposes a new implementation of the whole set of numerical methods including Radau5 and Rock4 , relying on fully different data structure together with the use of a specific library, TBB, for shared-memory, task-based parallelism with work stealing .
Edit intent: fluency
Original:  The present contribution proposes a new implementation of the whole set of numerical methods including Radau5 and Rock4 , relying on  fully different data structures together with the use of a specific library, TBB, for shared-memory, task-based parallelism with work stealing .
Revised:  The present contribution proposes a new implementation of the whole set of numerical methods including Radau5 and Rock4 , relying on fully different data structures together with the use of a specific library, TBB, for shared-memory, task-based parallelism with work-stealing .
Edit intent: fluency
Original:  This risk not only depends on the two parties involved, but also on the risk from various other contracts each of these parties hold .
Revised:  This risk not only depends on the two parties involved, but also on the risk from various other contracts each of these parties holds .
Edit intent: fluency
Original:  In this paper, we reconstruct the weighted and time-dependent network of counterparty risk in the OTC derivative market of the United States between 1998 and 2012.
Revised:  In this paper, we reconstruct the weighted and time-dependent network of counterparty risk in the OTC derivatives market of the United States between 1998 and 2012.
Edit intent: fluency
Original:  On the shortest time-scale , we find that social gatherings are fluid, with members coming and going, but organized via a stable core of individuals.
Revised:  On the hourly timescale , we find that social gatherings are fluid, with members coming and going, but organized via a stable core of individuals.
Edit intent: clarity
Original:  On the shortest time-scale , we find that social gatherings are fluid, with members coming and going, but organized via a stable core of individuals.
Revised:  On the shortest time-scale , we find that gatherings are fluid, with members coming and going, but organized via a stable core of individuals.
Edit intent: clarity
Original:  We show that cores represent social contexts (9), with recurring meetings across weeks and months, each with varying degrees of regularity.
Revised:  Each core represents a social context. Cores exhibit a pattern of recurring meetings across weeks and months, each with varying degrees of regularity.
Edit intent: clarity
Original: The total evidence approach to divergence-time dating uses molecular and morphological data of extant and fossil species to infer phylogenetic relationships, species divergence times, and macroevolutionary parameters in a single coherent framework.
Revised: The total-evidence approach to divergence-time dating uses molecular and morphological data of extant and fossil species to infer phylogenetic relationships, species divergence times, and macroevolutionary parameters in a single coherent framework.
Edit intent: fluency
Original: The total evidence approach to divergence-time dating uses molecular and morphological data of extant and fossil species to infer phylogenetic relationships, species divergence times, and macroevolutionary parameters in a single coherent framework.
Revised: The total evidence approach to divergence-time dating uses molecular and morphological data from extant and fossil species to infer phylogenetic relationships, species divergence times, and macroevolutionary parameters in a single coherent framework.
Edit intent: clarity
Original:  Current model-based implementations of this approach lack an appropriate model for the tree describing the diversification and fossilisation process which can result in erroneous conclusions.
Revised:  Current model-based implementations of this approach lack an appropriate model for the tree describing the diversification and fossilization process and can produce estimates that lead to erroneous conclusions.
Edit intent: clarity
Original:  We address this shortcoming by providing a total evidence method implemented in a Bayesian framework.
Revised:  We address this shortcoming by providing a total-evidence method implemented in a Bayesian framework.
Edit intent: fluency
Original:  The fossilised birth-death  process explicitly models the diversification, fossilisation , and sampling processes and naturally allows for sampled ancestors.
Revised:  The fossilized birth-death process explicitly models the diversification, fossilisation , and sampling processes and naturally allows for sampled ancestors.
Edit intent: fluency
Original:  The fossilised birth-death  process explicitly models the diversification, fossilisation , and sampling processes and naturally allows for sampled ancestors.
Revised:  The fossilised birth-death (FBD) process explicitly models the diversification, fossilisation , and sampling processes and naturally allows for sampled ancestors.
Edit intent: clarity
Original:  The fossilised birth-death  process explicitly models the diversification, fossilisation , and sampling processes and naturally allows for sampled ancestors.
Revised:  The fossilised birth-death process explicitly models the diversification, fossilization , and sampling processes and naturally allows for sampled ancestors.
Edit intent: fluency
Original:  We incorporate the fossilised birth-death model and a model of morphological trait evolution into a Bayesian total-evidence approach to dating species phylogenies.
Revised:  We incorporate the FBD model and a model of morphological trait evolution into a Bayesian total-evidence approach to dating species phylogenies.
Edit intent: clarity
Original:  The method is available in BEAST2 ( v2.3) software www.beast2.org with packages SA ( v1.1.3 ) and morph-models ( v1.0.1)installed .
Revised:  The method is available in BEAST2 ( v. 2.4) www.beast2.org with packages SA ( v1.1.3 ) and morph-models ( v1.0.1)installed .
Edit intent: clarity
Original: A new  stochastic simulation algorithm  , named the Hashing-Leaping (HL)algorithm , for exact simulations of a class of Markov jump processes, is presented in this paper.
Revised: A new method of the stochastic simulation algorithm , named the Hashing-Leaping (HL)algorithm , for exact simulations of a class of Markov jump processes, is presented in this paper.
Edit intent: clarity
Original:  The HL algorithm has constant computational cost per event, which is independent of the number of exponential clocks in the Markov process.
Revised:  The HLM has a conditional constant computational cost per event, which is independent of the number of exponential clocks in the Markov process.
Edit intent: clarity
Original:  The main idea of the HL algorithm is to repeatedly implement a Hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length \tau.
Revised:  The main idea of the HLM is to repeatedly implement a Hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length \tau.
Edit intent: clarity
Original:  The main idea of the HL algorithm is to repeatedly implement a Hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length \tau.
Revised:  The main idea of the HL algorithm is to repeatedly implement a hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length \tau.
Edit intent: fluency
Original:  We introduce the algorithm , demonstrate its implementation,  and compare its performance with the benchmark NRM algorithm in three examples.
Revised:  We introduce the method , demonstrate its implementation, and compare its performance with the benchmark NRM algorithm in three examples.
Edit intent: clarity
Original:  Our performance test and CPU operation statistics show a significant advantage of the HL algorithm for large scale problems.
Revised:  Our performance tests and CPU operation statistics show a significant advantage of the HL algorithm for large scale problems.
Edit intent: fluency
Original:  Our performance test and CPU operation statistics show a significant advantage of the HL algorithm for large scale problems.
Revised:  Our performance test and CPU operation statistics show certain advantage of the HL algorithm for large scale problems.
Edit intent: clarity
Original:  Our performance test and CPU operation statistics show a significant advantage of the HL algorithm for large scale problems.
Revised:  Our performance test and CPU operation statistics show a significant advantage of the HLM for large scale problems.
Edit intent: clarity
Original:  This structure inherits some ideas from the construction of both  suffix trie and suffix tree.
Revised:  This structure inherits some ideas from the construction of both the suffix trie and suffix tree.
Edit intent: fluency
Original:  It is often realised by sequence alignment techniques, which are computationally expensive.
Revised:  It is often realized by sequence alignment techniques, which are computationally expensive.
Edit intent: fluency
Original:  This has led to increased research into alignment free techniques, which are based on measures referring to the composition of sequences in terms of their constituent patterns.
Revised:  This has led to increased research into alignment-free techniques, which are based on measures referring to the composition of sequences in terms of their constituent patterns.
Edit intent: fluency
Original:  These measures, such as q-gram distance, can usually be computed in time linear with respect to the length of the sequences.
Revised:  These measures, such as q-gram distance, are usually computed in time linear with respect to the length of the sequences.
Edit intent: clarity
Original:  In this article, we focus on the complementary idea: how two sequences can be efficiently compared based on information about what does not occur in the sequences.
Revised:  In this article, we focus on the complementary idea: how two sequences can be efficiently compared based on information that does not occur in the sequences.
Edit intent: fluency
Original:  In particular, we present a{\em  {\em   linear-time and linear-space algorithm to compare two sequences by considering all {\em  their minimal absent words.
Revised:  A word is an{\em {\em linear-time and linear-space algorithm to compare two sequences by considering all {\em their minimal absent words.
Edit intent: coherence
Original:  In particular, we present a{\em  {\em   linear-time and linear-space algorithm to compare two sequences by considering all {\em  their minimal absent words.
Revised:  In particular, we present a{\em {\em linear-time and linear-space algorithm to compare two sequences by considering {\em their minimal absent words.
Edit intent: clarity
Original:  In particular, we present a{\em  {\em   linear-time and linear-space algorithm to compare two sequences by considering all {\em  their minimal absent words.
Revised:  In particular, we present a{\em {\em linear-time and linear-space algorithm to compare two sequences by considering all {\em all their minimal absent words.
Edit intent: clarity
Original:  An absent word is minimal if all its proper factors occur in the sequence.
Edit intent: coherence
Original:  In the process, we present some results of combinatorial interest, and also extend the proposed techniques to  circular sequences.
Revised:  In the process, we present results of combinatorial interest, and also extend the proposed techniques to circular sequences.
Edit intent: clarity
Original:  In the process, we present some results of combinatorial interest, and also extend the proposed techniques to  circular sequences.
Revised:  In the process, we present some results of combinatorial interest, and also extend the proposed techniques to compare circular sequences.
Edit intent: clarity
Original:  The model based on the empirical nest network description combined with pruning (edge removal  ) and a memory effect (preferential growth from the latest added chambers) successfully predicts emergent nest properties (degree distribution,  average path lengths and backbone link ratios ).
Revised:  The model based on the empirical nest network description combined with pruning (edge removal ) and a memory effect (preferential growth from the latest added chambers) successfully predicts emergent nest properties (degree distribution, average path lengths , backbone link ratios ).
Edit intent: fluency
Original:  Our results provide an example of how complex network organization and efficient network properties can be generated from simple building rules and local interactions and contribute to our understanding of the mechanisms that come into play for the formation of termite networks and of biological transportation networks in general.
Revised:  Our results provide an example of how complex network organization and efficient network properties can be generated from simple building rules based on local interactions and contribute to our understanding of the mechanisms that come into play for the formation of termite networks and of biological transportation networks in general.
Edit intent: clarity
Original: Given a planetary-scale graph with millions of nodes and billions of edges, how to reveal macro patterns of interest, like cliques, bi-partite cores, stars, and chains?
Revised: Given a large-scale graph with millions of nodes and billions of edges, how to reveal macro patterns of interest, like cliques, bi-partite cores, stars, and chains?
Edit intent: clarity
Original: Given a planetary-scale graph with millions of nodes and billions of edges, how to reveal macro patterns of interest, like cliques, bi-partite cores, stars, and chains?
Revised: Given a planetary-scale graph with millions of nodes and edges, how to reveal macro patterns of interest, like cliques, bi-partite cores, stars, and chains?
Edit intent: clarity
Original:  Although there are many algorithmic and visual techniques to analyze graphs, none of the existing approaches is able to present the structural information of graphs at planetary scale .
Revised:  Although there are many algorithmic and visual techniques to analyze graphs, none of the existing approaches is able to present the structural information of graphs at large-scale .
Edit intent: clarity
Original:  Hence, this paper describes StructMatrix, a methodology aimed at high scalable visual inspection of graph structures with the goal of revealing macro patterns of interest.
Revised:  Hence, this paper describes StructMatrix, a methodology aimed at high-scalable visual inspection of graph structures with the goal of revealing macro patterns of interest.
Edit intent: fluency
Original:  We performed experiments in real, planetary-scale graphs with up to millions of nodes and over 10 billion edges.
Revised:  We performed experiments in real, large-scale graphs with up to millions of nodes and over 10 billion edges.
Edit intent: clarity
Original: Coevolution is a powerful tool in evoltionary computing that mitigate some of its endemic problems, namely stagnation in local optima and lack of convergence in high dimensionality problems.
Revised: Coevolution is a powerful tool in evolutionary computing that mitigates some of its endemic problems, namely stagnation in local optima and lack of convergence in high dimensionality problems.
Edit intent: fluency
Original:  Here, the time-dimension is the only one left for parallelisation and we focus on Parareal as one particular parallelisationin-time method.
Revised:  Here, the time-dimension is the only one left for parallelization and we focus on Parareal as one particular parallelisationin-time method.
Edit intent: fluency
Original:  Here, the time-dimension is the only one left for parallelisation and we focus on Parareal as one particular parallelisationin-time method.
Revised:  Here, the time-dimension is the only one left for parallelisation and we focus on Parareal as one particular parallelization-in-time method.
Edit intent: fluency
Original:  We present a software approach for making Parareal parallelisation transparent for application developers, hence allowing fast prototyping for Parareal.
Revised:  We discuss a software approach for making Parareal parallelisation transparent for application developers, hence allowing fast prototyping for Parareal.
Edit intent: clarity
Original:  We present a software approach for making Parareal parallelisation transparent for application developers, hence allowing fast prototyping for Parareal.
Revised:  We present a software approach for making Parareal parallelization transparent for application developers, hence allowing fast prototyping for Parareal.
Edit intent: fluency
Original: In recent years, confessions pages have grown popular on social media sites such as Facebook and Twitter, particularly within college communities.
Revised: Confessions pages have grown popular on social media sites such as Facebook and Twitter, particularly within college communities.
Edit intent: clarity
Original:  Such pages allow users to anonymously submit confessions related to collegiate experience that are subsequently publicly broadcasted . Because of the anonymous nature of disclosure, we believe that confessions pages are novel data sources from which to discover trends and issues in a collegiate community.
Revised:  Such pages allow users to anonymously submit confessions related to collegiate experience that are subsequently broadcast on a public forum . Because of the anonymous nature of disclosure, we believe that confessions pages are novel data sources from which to discover trends and issues in a collegiate community.
Edit intent: clarity
Original:  Aggregating a dataset of more than 20,000 posts from one such page , we analyze natural language characteristics of the originating community with LDA, pointwise mutual information and sentiment analysis.
Revised:  Aggregating data from more than 20,000 posts from one such page , we analyze natural language characteristics of the originating community with LDA, pointwise mutual information and sentiment analysis.
Edit intent: clarity
Original:  Aggregating a dataset of more than 20,000 posts from one such page , we analyze natural language characteristics of the originating community with LDA, pointwise mutual information and sentiment analysis.
Revised:  Aggregating a dataset of more than 20,000 entries posted to one such space , we analyze natural language characteristics of the originating community with LDA, pointwise mutual information and sentiment analysis.
Edit intent: clarity
Original:  Using a Markov topic model, we examine the latent topics in our corpus and find that loneliness is a highly regular pattern.
Revised:  Using a Markov topic model, we identify the latent topics in our corpus and find that loneliness is a highly regular pattern.
Edit intent: clarity