wanyu/IteraTeR_v2 huggingface dataset:
Original:  For homogeneous networks we derive exact relations between these moments, quantifying the validity of approximating a continuous-time process (path times) with its discrete-time projection (path lengths) .
Revised:  For homogeneous networks we derive exact relations between these moments, quantifying the validity of approximating a continuous-time process with its discrete-time projection (path lengths) .
Edit intent: fluency
Original:  For homogeneous networks we derive exact relations between these moments, quantifying the validity of approximating a continuous-time process (path times) with its discrete-time projection (path lengths) .
Revised:  For homogeneous networks we derive exact relations between these moments, quantifying the validity of approximating a continuous-time process (path times) with its discrete-time projection .
Edit intent: clarity
Original:  For more general models we obtain recursion relations, reminiscent of transfer matrix and exact enumeration techniques, to  calculate path statistics numerically in an efficient way .
Revised:  For more general models we obtain recursion relations, reminiscent of transfer matrix and exact enumeration techniques, to efficiently calculate path statistics numerically in an efficient way .
Edit intent: fluency
Original:  For more general models we obtain recursion relations, reminiscent of transfer matrix and exact enumeration techniques, to  calculate path statistics numerically in an efficient way .
Revised:  For more general models we obtain recursion relations, reminiscent of transfer matrix and exact enumeration techniques, to calculate path statistics numerically .
Edit intent: clarity
Original:  We have implemented our recursive algorithm in PathMAN, a Python script that users can easily apply to their model of choice.
Revised:  We have implemented our algorithm in PathMAN, a Python script that users can easily apply to their model of choice.
Edit intent: clarity
Original:  We demonstrate the algorithm on a few representative examples to show the importance of non-exponential distributions, memory, and coarse-graining in CTRWs.
Revised:  We demonstrate the algorithm on a few representative examples which underscore the importance of non-exponential distributions, memory, and coarse-graining in CTRWs.
Edit intent: clarity
Original: We study the problem of non-preemptively scheduling n jobs, each job j with a release time t_j, a deadline d_j, and a processing time p_j, on a minimum number m of parallel identical machines.
Revised: We study the problem of non-preemptively scheduling n jobs, each job j with a release time t_j, a deadline d_j, and a processing time p_j, on m parallel identical machines.
Edit intent: clarity
Original:  The second one calculates the demanding resource shares and allocates first the most demanding of them  by choosing randomly among equally demanding shares.
Revised:  The second one calculates the demanding resource shares and allocates the most demanding of them by choosing randomly among equally demanding shares.
Edit intent: clarity
Original:  The second one calculates the demanding resource shares and allocates first the most demanding of them  by choosing randomly among equally demanding shares.
Revised:  The second one calculates the demanding resource shares and allocates first the most demanding of them first by choosing randomly among equally demanding shares.
Edit intent: clarity
Original:  To analyze such a complex interplay between local- and global-scale phenomena, I generalize the standard threshold model by introducing a new type of node, called global nodes (or trend followers  ), whose activation probability depends on a global-scale trend;
Revised:  To analyze such a complex interplay between local- and global-scale phenomena, I generalize the standard threshold model by introducing a new type of node, called global nodes ), whose activation probability depends on a global-scale trend;
Edit intent: clarity
Original:  The new lower bound on the threshold matches the "condensation phase transition" predicted by statistical physics considerations [Krzakala et al., PNAS ~ 2007].
Revised:  The new lower bound on the threshold matches the "condensation phase transition" predicted by statistical physics considerations [Krzakala et al., PNAS 2007].
Edit intent: fluency
Original:  As a result, those classes include a wide number and variety of systems that are result equivalent to each other.
Revised:  As a result, those classes include a wide number and variety of systems that result equivalent to each other.
Edit intent: fluency
Original:  The resulting "vertical dimension" further specializes the systemic classes and makes it easier to assess similarities and difference regarding properties such as resilience, performance, and quality-of-experience.
Revised:  The resulting "vertical dimension" further specializes the systemic classes and makes it easier to assess similarities and differences regarding properties such as resilience, performance, and quality-of-experience.
Edit intent: fluency
Original:  Our approach is exemplified by considering a telemonitoring systems designed in the framework of Flemish project  .
Revised:  Our approach is exemplified by considering a telemonitoring system designed in the framework of Flemish project .
Edit intent: fluency
Original: As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two k-cliques means  they share at leat l<k vertices.
Revised: As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two k-cliques means that they share at leat l<k vertices.
Edit intent: fluency
Original: As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two k-cliques means  they share at leat l<k vertices.
Revised: As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two k-cliques means they share at least l<k vertices.
Edit intent: fluency
Original:  In this paper, we develop a theoretical approach to study clique percolation in Erdo s-R\'enyi graphs, which can give the exact solutions of the order parameter and the critical point.
Revised:  In this paper, we develop a theoretical approach to study clique percolation in Erdo s-R\'enyi graphs, which gives not only the exact solutions of the order parameter and the critical point.
Edit intent: clarity
Original:  We find that the fraction  of cliques in the giant clique cluster always takes a continuous phase transition as the classical percolation.
Revised:  We find that the fraction of cliques in the giant clique cluster always makes a continuous phase transition as the classical percolation.
Edit intent: clarity
Original:  However, the fraction  of vertices in the giant clique cluster demonstrates an unnormal phase transitions for k>3 and l>1 , i.e., the fraction of vertices in the giant clique cluster always takes value 1 above the critical point, however, a size-independent constant at the critical point.
Revised:  However, the fraction of vertices in the giant clique cluster for l>1 , i.e., the fraction of vertices in the giant clique cluster always takes value 1 above the critical point, however, a size-independent constant at the critical point.
Edit intent: clarity
Original:  Together with the analysis of the finite size scaling and cluster number distribution, we give a theoretical support and clarification for previous simulation studies of the clique percolation.
Revised:  Together with the analysis of the finite size scaling and cluster number distribution, we give a theoretical support and clarification for previous simulation studies of clique percolation.
Edit intent: fluency
Original: This work investigates how the traditional image classification pipelines can be extended into a deep architecture, inspired by the recent successes of applying deep neural networks.
Revised: This work investigates how the traditional image classification pipelines can be extended into a deep architecture, inspired by recent successes of applying deep neural networks.
Edit intent: fluency
Original: This work investigates how the traditional image classification pipelines can be extended into a deep architecture, inspired by the recent successes of applying deep neural networks.
Revised: This work investigates how the traditional image classification pipelines can be extended into a deep architecture, inspired by the recent successes of deep neural networks.
Edit intent: clarity
Original:  We propose a hierarchical image representation based on layer-by-layer joint feature boosting and dictionary learning.
Revised:  We propose a deep boosting framework based on layer-by-layer joint feature boosting and dictionary learning.
Edit intent: clarity
Original:  In each layer, we construct a dictionary of filters by combining the filters from the lower layer, and iteratively optimize the image representation with a joint discriminative-generative formulation, i.e. , minimization of empirical classification error plus regularization of analysis image generation over training images.
Revised:  In each layer, we construct a dictionary of filters by combining the filters from the lower layer, and iteratively optimize the image representation with a joint discriminative-generative formulation, i.e. minimization of empirical classification error plus regularization of analysis image generation over training images.
Edit intent: fluency
Original:  Second, the generated image representation is compact and meaningful by jointly considering image classification and generation .
Revised:  Second, the generated image representation is compact and meaningful .
Edit intent: coherence
Original:  In several challenging visual recognition tasks, we demonstrate superior or comparable performances of our framework over other state-of-the-art approaches.
Revised:  In several visual recognition tasks, we demonstrate superior or comparable performances of our framework over other state-of-the-art approaches.
Edit intent: clarity
Original:  In several challenging visual recognition tasks, we demonstrate superior or comparable performances of our framework over other state-of-the-art approaches.
Revised:  In several challenging visual recognition tasks, our framework outperforms existing state-of-the-art approaches.
Edit intent: clarity
Original:  In settings with 5 small cells, the average cell-selection accuracy is 73\% - only an 3.9\% loss compared with a location-aided algorithm which requires genuine location information.
Revised:  In settings with 5 small cells, the average cell-selection accuracy is 73\% - only a 3.9\% loss compared with a location-aided algorithm which requires genuine location information.
Edit intent: fluency
Original: Nowadays, land covers are evaluated and classified with general features based in the reflectance or digital levels of the photographical or satellite supplies .
Revised: Land cover has been evaluated and classified with general features based in the reflectance or digital levels of the photographical or satellite supplies .
Edit intent: coherence
Original: Nowadays, land covers are evaluated and classified with general features based in the reflectance or digital levels of the photographical or satellite supplies .
Revised: Nowadays, land covers are evaluated and classified on the basis of general features using reflectance or digital levels of the photographical or satellite supplies .
Edit intent: clarity
Original: Nowadays, land covers are evaluated and classified with general features based in the reflectance or digital levels of the photographical or satellite supplies .
Revised: Nowadays, land covers are evaluated and classified with general features based in the reflectance or digital levels of photographic or satellite data .
Edit intent: fluency
Original:  Thus, an exaggerated generalization is used ( as palm groves, tall dense mangroves  and dense forests , between others)and important floristic and structural information from the vegetation types present in the areas is omitted.
Revised:  Thus, an exaggerated generalization is used ( as palm groves, tall dense mangroves , and dense forests , between others)and important floristic and structural information from the vegetation types present in the areas is omitted.
Edit intent: fluency
Original:  We designed a new methodological route incorporating biological distinctiveness ;
Revised:  We designed a new methodological approach that incorporates biological distinctiveness combined with
Edit intent: clarity
Original:  It is based on the use of parameters obtained by a Canonical Correspondence Analysis on a Fuzzy Logic Model that allows the production of multiple coverage maps.
Revised:  It is based on parameters obtained through canonical correspondence analysis on a fuzzy logic model, which are used to construct multiple coverage maps.
Edit intent: clarity
Original:  This tool is suitable for monitoring and analysing vegetation dynamics since it maintains the typological integrity of a cartographic series.
Revised:  This tool is useful for monitoring and analysing vegetation dynamics since it maintains the typological integrity of a cartographic series.
Edit intent: clarity
Original:  This tool is suitable for monitoring and analysing vegetation dynamics since it maintains the typological integrity of a cartographic series.
Revised:  This tool is suitable for monitoring and analyzing vegetation dynamics, since it maintains the typological integrity of a cartographic series.
Edit intent: fluency
Original:  Therefore, our methodology allows to find cartographic series congruent in time and scale, and can be applied to multiple and different satellite inputs.
Revised:  The methodology creates cartographic series congruent in time and scale, and can be applied to multiple and different satellite inputs.
Edit intent: clarity
Original:  Therefore, our methodology allows to find cartographic series congruent in time and scale, and can be applied to multiple and different satellite inputs.
Revised:  Therefore, our methodology allows to find cartographic series congruent in time and scale, can be applied to multiple and different satellite inputs.
Edit intent: coherence
Original:  In the present contribution we use the example of the implementation of the method in the south-western Colombian Caribbean region .
Revised:  In the present contribution we use the example of the implementation of the method in the southwestern Colombian Caribbean region .
Edit intent: fluency
Original:  We compared our results with forefront tools used in the analysis of deforestation in the world.
Revised:  We compared our results with forefront tools used in other analyses of deforestation around the world.
Edit intent: clarity
Original:  This limitation has been overlooked by current crowdsourcing platforms resulting this way in costly solutions.
Revised:  This limitation has been overlooked by current crowdsourcing platforms resulting therefore in costly solutions.
Edit intent: clarity
Original:  This work argues that optimization needs to be aware of diversity and correlation of information within groups of individuals so that crowdsourcing redundancy can be adequately planned beforehand.
Revised:  Our work argues that optimization needs to be aware of diversity and correlation of information within groups of individuals so that crowdsourcing redundancy can be adequately planned beforehand.
Edit intent: fluency
Original:  Modern data sets often contain a large number of genes  which can complicate the reconstruction problem due to the fact that different genes may undergo different evolutionary histories.
Revised:  Modern data sets often contain a large number of genes , which can complicate the reconstruction problem due to the fact that different genes may undergo different evolutionary histories.
Edit intent: fluency
Original:  This is the case in particular in the presence of lateral genetic transfer ( LGT), whereby a gene is inherited from a distant species rather than an immediate ancestor.
Revised:  This is the case in particular in the presence of horizontal genetic transfer ( LGT), whereby a gene is inherited from a distant species rather than an immediate ancestor.
Edit intent: fluency
Original:  Such an event produces a gene tree which is distinct from ( but related to ) the species phylogeny.
Revised:  Such an event produces a gene tree which is distinct from , but related to ) the species phylogeny.
Edit intent: fluency
Original:  Such an event produces a gene tree which is distinct from ( but related to ) the species phylogeny.
Revised:  Such an event produces a gene tree which is distinct from ( but related to , the species phylogeny.
Edit intent: fluency
Original:  Both lower and upper bounds on this rate were obtained, but a large gap remained.
Revised:  Both lower and upper bounds on this achievable rate were also obtained, but a large gap remained.
Edit intent: clarity
Original:  Specifically , we show that the species phylogeny can be reconstructed perfectly even wheneach edge of the  tree has a constant probability of being the location of an LGT event.
Revised:  Specifically we show that the species phylogeny can be reconstructed perfectly even wheneach edge of the tree has a constant probability of being the location of an LGT event.
Edit intent: fluency
Original:  Specifically , we show that the species phylogeny can be reconstructed perfectly even wheneach edge of the  tree has a constant probability of being the location of an LGT event.
Revised:  Specifically , we show that a species phylogeny can be reconstructed perfectly even wheneach edge of the tree has a constant probability of being the location of an LGT event.
Edit intent: fluency
Original:  Specifically , we show that the species phylogeny can be reconstructed perfectly even wheneach edge of the  tree has a constant probability of being the location of an LGT event.
Revised:  Specifically , we show that the species phylogeny can be reconstructed correctly from gene trees even when, on each gene, each edge of the tree has a constant probability of being the location of an LGT event.
Edit intent: clarity
Original:  Specifically , we show that the species phylogeny can be reconstructed perfectly even wheneach edge of the  tree has a constant probability of being the location of an LGT event.
Revised:  Specifically , we show that the species phylogeny can be reconstructed perfectly even wheneach edge of the species tree has a constant probability of being the location of an LGT event.
Edit intent: fluency
Original:  A common Open Source SW framework will also enable automatic discovery and selection, seamless data mobility as well as unified charging and billing across cellular, Wi-Fi , UAV and satellite access networks.
Revised:  A common Open Source SW framework will also enable automatic discovery and selection, seamless data mobility as well as unified charging and billing across cellular, WiFi , UAV and satellite access networks.
Edit intent: fluency
Original:  We expect that wireless internet growth driven by the need to connect all humankind (not just 1/3) as well as Billions of things to the Internet will require Terabit/s shared links for ground based local area and wide area wireless access, for wireless backhaul as well as access via unmanned aerial vehicles (UAVs) and satellites.
Revised:  We expect that wireless data growth driven by the need to connect all humankind (not just 1/3) as well as Billions of things to the Internet will require Terabit/s shared links for ground based local area and wide area wireless access, for wireless backhaul as well as access via unmanned aerial vehicles (UAVs) and satellites.
Edit intent: clarity
Original:  It therefore follows that the characteristic function of those n for which an automatic sequence x has a closed (resp.,  privileged, rich, trapezoidal , balanced) factor of length n is automatic.
Revised:  It therefore follows that the characteristic function of those n for which an automatic sequence x has a closed (resp., privileged, rich, trape- zoidal , balanced) factor of length n is automatic.
Edit intent: fluency
Original:  We compute the corresponding characteristic functions for various famous sequences, such as the Thue-Morse sequence, the Rudin-Shapiro sequence, the ordinary paperfolding sequence,  period-doubling sequence, and the Fibonacci sequence  .
Revised:  We compute the corresponding characteristic functions for various famous sequences, such as the Thue-Morse sequence, the Rudin-Shapiro sequence, the ordinary paperfolding sequence, the period-doubling sequence, and the Fibonacci sequence .
Edit intent: fluency
Original:  Experimentally, it is known that multivalent counterions has strong effect on the DNA condensation phenomenon.
Revised:  Experimentally, it is known that multivalent counterions have strong effect on the DNA condensation phenomenon.
Edit intent: fluency
Original:  While tri- and tetra-valent counterions are shown to easily condense free DNA molecules in solution into torroidal bundles, the situation with divalent counterions are not as clear cut.
Revised:  While tri- and tetra-valent counterions are shown to easily condense free DNA molecules in solution into toroidal bundles, the situation with divalent counterions are not as clear cut.
Edit intent: fluency
Original:  In this paper, we try to understand this variation using a very simple parameters , the size of the divalent counterions.
Revised:  In this paper, we try to understand this variation using a very simple parameter , the size of the divalent counterions.
Edit intent: fluency
Original:  Thus, for each equation there is a construction of a Lindenmayer system which generates all solutions in reduced words.
Edit intent: coherence
Original: Spontaneous oscillations measured by local field potentials , electroencephalograms and magnetoencephalograms exhibits variety of oscillations spanning frrequency band (1Hz-100Hz ) in animals and humans.
Revised: Spontaneous oscillations measured by local field potentials , electroencephalograms and magnetoencephalograms exhibits variety of oscillations spanning frequency band (1-100 Hz ) in animals and humans.
Edit intent: fluency
Original:  Both instantaneous power and phase of these ongoing oscillations have commonly been observed to correlate with peristimulus processing in animals and humans.
Revised:  Both instantaneous power and phase of these ongoing oscillations have commonly been observed to correlate with pre-stimulus processing in animals and humans.
Edit intent: fluency
Original:  Additionally, the algorithm has a runtime of o (kn^2) when k is not a constant.
Revised:  Additionally, the run time is bounded by O (kn^2) when k is not a constant.
Edit intent: clarity
Original:  In such a setting, the amount of traffic that can be served in a cell is not constrained by the data capacity, but rather by the signaling constraints in the PRACH, PDCCH, and PUSCH channels .
Revised:  In such a setting, the amount of traffic that can be served in a cell is not constrained by the data capacity, but rather by the signaling constraints in the random access channel and control channel .
Edit intent: clarity
Original:  We find that 1) assigning RAOs more frequently sometimes worsens performance;
Revised:  We find that 1) assigning more random access opportunities may actually worsen performance;
Edit intent: clarity
Original:  This suggests that a lightweight access method, with  reduced number of signaling messages, needs to be considered in standardization for M2M applications.
Revised:  This suggests that a lightweight access method, with a reduced number of signaling messages, needs to be considered in standardization for M2M applications.
Edit intent: fluency
Original:  Additionally we propose a tractable analytical model that accurately evaluates the outage for a given scenario at click-speed .
Revised:  Additionally we propose a tractable analytical model to calculate the outage that can be rapidly implemented and evaluated .
Edit intent: clarity