wanyu/IteraTeR_v2 huggingface dataset:
Original:  The main difference with prior work in implicit complexity is that (i) our results hold for non-orthogonal term rewriting systems with no assumptions on reduction strategy, and (ii)  results for cons-free term rewriting systems have previously only been obtained for K = 1, and with additional syntactic restrictions besides cons-freeness and left-linearity.
Revised:  The main difference with prior work in implicit complexity is that (i) our results hold for non-orthogonal term rewriting systems with no assumptions on reduction strategy, (ii) results for cons-free term rewriting systems have previously only been obtained for K = 1, and with additional syntactic restrictions besides cons-freeness and left-linearity.
Edit intent: fluency
Original:  Our work confirms prior results that having full non-determinism (via overlapping rules) does not directly allow  characterization of non-deterministic complexity classes like NE.
Revised:  Our work confirms prior results that having full non-determinism (via overlapping rules) does not directly allow for characterization of non-deterministic complexity classes like NE.
Edit intent: fluency
Original: This paper analyses the problem of scientific quality of physics journals.
Revised: This paper intends at contributing to a better explanation of the totality of physics journals.
Edit intent: clarity
Original:  Instead of constructing new indicators of scientific quality , we identify a physical journal with corresponding empirical distribution function of citations.
Revised:  Instead of constructing new scientometric indicators , we identify a physical journal with corresponding empirical distribution function of citations.
Edit intent: clarity
Original:  Instead of constructing new indicators of scientific quality , we identify a physical journal with corresponding empirical distribution function of citations.
Revised:  Instead of constructing new indicators of scientific quality , we identify a physics journal with corresponding empirical distribution function of citations.
Edit intent: fluency
Original:  From our relational point of view, the space of physics journals is only a system of differences between empirical distribution functions of citations.
Edit intent: coherence
Original:  The first provides an objective basis for the grouping of physics journals on the basis of a whole range of indicators (citation statistics, country, publisher, etc.) .
Revised:  The first provides an objective basis for the grouping of physics journals .
Edit intent: clarity
Original: Metabolic rate of living organisms ( energy produced per unit time) increases slower than organisms' mass.
Revised: Metabolic rate of organisms (amount of energy produced per unit time) increases slower than organisms' mass.
Edit intent: clarity
Original:  This phenomenon, when applied to different taxa, is called interspecific allometric scaling.
Revised:  This phenomenon, when considered across different taxa, is called interspecific allometric scaling.
Edit intent: clarity
Original:  Its  causes remain unknown.
Revised:  Its fundamental causes remain unknown.
Edit intent: clarity
Original:  Here we show that interspecific allometric scaling for multicellular organisms occurred as the result of evolution of organisms within the food chain, and certain mechanical constraints.
Revised:  We discovered that interspecific allometric scaling for multicellular organisms occurred as the result of evolution of organisms within the food chain, and certain mechanical constraints.
Edit intent: clarity
Original:  Here we show that interspecific allometric scaling for multicellular organisms occurred as the result of evolution of organisms within the food chain, and certain mechanical constraints.
Revised:  Here we show that interspecific allometric scaling occurred as the result of evolution of organisms within the food chain, and certain mechanical constraints.
Edit intent: clarity
Original:  Here we show that interspecific allometric scaling for multicellular organisms occurred as the result of evolution of organisms within the food chain, and certain mechanical constraints.
Revised:  Here we show that interspecific allometric scaling for multicellular organisms occurred as the result of collective adaptation of organisms within the food chain, and certain mechanical constraints.
Edit intent: clarity
Original:  Here we show that interspecific allometric scaling for multicellular organisms occurred as the result of evolution of organisms within the food chain, and certain mechanical constraints.
Revised:  Here we show that interspecific allometric scaling for multicellular organisms occurred as the result of evolution of organisms within the food chain, influenced by mechanical constraints.
Edit intent: clarity
Original:  We prove this conjecture by obtaining very close to experimental findings values of allometric exponents both for the maximal and basal metabolic rates  .
Revised:  It appears to be a fundamental principle, affecting life evolution and its organization. On one hand, organisms have to reliably acquire sufficient food for successful reproduction of their populations. This evolutionary need enforces adaptations enhancing metabolic power, when the size of an organism increases. On the other hand, this advantage in metabolic power cannot be too strong - otherwise, the populations of species in the food chain, which the organism feeds on, could be destroyed. The counteraction of these two opposing factors establishes a dynamic balance in the food chain and preserves its continuity. Applying this principle, we introduce biomechanical models and obtain allometric exponents for the maximal and basal metabolic rates .
Edit intent: coherence
Original:  On the other hand, this advantage in metabolic power cannot be too strong - otherwise, the populations of species in the food chain , which the organism feeds on, could be destroyed.
Revised:  On the other hand, neither biomechanical nor metabolic advantage can be too strong - otherwise, the populations of species in the food chain , which the organism feeds on, could be destroyed.
Edit intent: clarity
Original:  On the other hand, this advantage in metabolic power cannot be too strong - otherwise, the populations of species in the food chain , which the organism feeds on, could be destroyed.
Revised:  On the other hand, this advantage in metabolic power cannot be too strong - otherwise, the food chain could be destroyed.
Edit intent: clarity
Original:  The counteraction of these two opposing factors establishes a dynamic balance in the food chain and preserves its continuity.
Revised:  The counteraction of these two needs establishes a dynamic balance in the food chain and preserves its continuity.
Edit intent: clarity
Original:  It is hard because training data usually does not contain many different flow fields for the same image.
Revised:  Such a model is difficult to train, because we do not usually have training data containing many different shadings for the same image.
Edit intent: clarity
Original:  As a result, we need different images to share data to produce good models.
Revised:  As a result, we need different training examples to share data to produce good models.
Edit intent: clarity
Original:  We demonstrate our model on three example tasks using real data: image saturation adjustment, image relighting , and motion prediction .
Revised:  We demonstrate our model on three example tasks using real data: image saturation adjustment, image relighting .
Edit intent: clarity
Original:  We describe quantitative evaluation metrics to evaluate ambiguous generation results.
Revised:  We describe quantitative metrics to evaluate ambiguous generation results.
Edit intent: clarity
Original:  not in the last place by it's connections to coding theory and computer science.
Revised:  not in the last place by its connections to coding theory and computer science.
Edit intent: fluency
Original:  Unfortunately, conventional translation hardware (i.e., TLBs, MMU caches, and page table walkers) incurs dramatic overheads due to the limited reach , increasingly high miss penalty, and high translation coherence cost incurred with rapidly growing aggregate memory size .
Revised:  Unfortunately, conventional translation mechanisms fall short of providing fast translations as contemporary memories exceed the reach of TLBs, making expensive page walks common .
Edit intent: clarity
Original:  DIPTA completely eliminates the conventional translation hardware, as well as the performance overhead of translation, achieving speedups of up to 4.95x and 2.44 x over conventional translation using 4KB and 1GB pages respectively , and obviating the need for translation-related broadcasts .
Revised:  DIPTA completely eliminates the performance overhead of translation, achieving speedups of up to 4.95x and 2.44 x over conventional translation using 4KB and 1GB pages respectively , and obviating the need for translation-related broadcasts .
Edit intent: clarity
Original:  DIPTA completely eliminates the conventional translation hardware, as well as the performance overhead of translation, achieving speedups of up to 4.95x and 2.44 x over conventional translation using 4KB and 1GB pages respectively , and obviating the need for translation-related broadcasts .
Revised:  DIPTA completely eliminates the conventional translation hardware, as well as the performance overhead of translation, achieving speedups of up to 4.95x and 2.44 x over conventional translation using 4KB and 1GB pages respectively .
Edit intent: coherence
Original:  We show that a deep neural network trained  to respect these constraints implicitly identifies the characteristic motion patterns of many different sequence types.
Revised:  We show that a deep neural network trained to respect these constraints implicitly identify the image characteristic of motion in different sequence types.
Edit intent: clarity
Original:  Furthermore, we present results that suggest our method can be used to extract information useful for independent motion tracking, localization, and nearest neighbor identification .
Revised:  Furthermore, we present results that suggest our method can be used to extract information useful for localization, tracking, and odometry .
Edit intent: clarity
Original:  Our results suggest that this representation may be useful for motion-related tasks where explicit labels are often very difficult to obtain.
Revised:  Our results demonstrate that this representation may be useful for motion-related tasks where explicit labels are often very difficult to obtain.
Edit intent: clarity
Original:  Our results suggest that this representation may be useful for motion-related tasks where explicit labels are often very difficult to obtain.
Revised:  Our results suggest that this representation is useful for learning motion in the general setting where explicit labels are often very difficult to obtain.
Edit intent: clarity
Original:  Our results suggest that this representation may be useful for motion-related tasks where explicit labels are often very difficult to obtain.
Revised:  Our results suggest that this representation may be useful for motion-related tasks where explicit labels are difficult to obtain.
Edit intent: clarity
Original:  Additional insights from the simulation results include the suitability of hybrid model parameters, the impact of reactive surfaces  in the proximity of a hybrid interface, and the size of a bounded environment that is necessary to assume that it is unbounded.
Revised:  Additional insights from the simulation results include the selection of suitable hybrid model parameters, the impact of reactive surfaces in the proximity of a hybrid interface, and the size of a bounded environment that is necessary to assume that it is unbounded.
Edit intent: clarity
Original:  Additional insights from the simulation results include the suitability of hybrid model parameters, the impact of reactive surfaces  in the proximity of a hybrid interface, and the size of a bounded environment that is necessary to assume that it is unbounded.
Revised:  Additional insights from the simulation results include the suitability of hybrid model parameters, the impact of reactive surfaces that are in the proximity of a hybrid interface, and the size of a bounded environment that is necessary to assume that it is unbounded.
Edit intent: clarity
Original:  Development of AcCoRD is ongoing, so its future direction is also discussed in order to highlight improvements that will expand its potential areas of application.
Revised:  The development of AcCoRD is ongoing, so its future direction is also discussed in order to highlight improvements that will expand its potential areas of application.
Edit intent: clarity
Original:  Planned improvements include a fluid flow model and more complex actor behavior.
Revised:  New features that are being planned at the time of writing include a fluid flow model and more complex actor behavior.
Edit intent: clarity
Original:  Nevertheless, after long-term evolution of cellular networks in various generations, the assumption no longer holds.
Revised:  Nevertheless, after long-term evolution of cellular networks in various generations, this assumption no longer holds.
Edit intent: fluency
Original:  Instead, the BSs, which seem to be gradually deployed by operators in a casual manner, have embed many fundamental features in their locations, coverage and traffic loading.
Revised:  Instead, the BSs, which seem to be gradually deployed by operators in a casual manner, have embedded many fundamentally distinctive features in their locations, coverage and traffic loading.
Edit intent: clarity
Original:  Their features can be leveraged to analyze the intrinstic pattern in BSs and even human community.
Revised:  These features can be leveraged to analyze the intrinstic pattern in BSs and even human community.
Edit intent: fluency
Original:  Their features can be leveraged to analyze the intrinstic pattern in BSs and even human community.
Revised:  Their features can be leveraged to analyze the intrinsic pattern in BSs and even human community.
Edit intent: fluency
Original:  In this paper, according to large-scale measurement datasets, we build  correlation model of BSs by utilizing one of the most important features, that is, traffic.
Revised:  In this paper, according to large-scale measurement datasets, we build up a correlation model of BSs by utilizing one of the most important features, that is, traffic.
Edit intent: clarity
Original:  Simulation results show that its degree distribution follows scale-free property.
Revised:  Simulation results show that the degree distribution follows scale-free property.
Edit intent: clarity
Original:  Moreover, the datasets also unveil the characteristics of fractality and small-world.
Revised:  Also the datasets unveil the characteristics of fractality and small-world.
Edit intent: coherence
Original:  Furthermore, we apply Collective Influence (CI) algorithm to localize the influential base stations and demonstrate that some low-degree BSs may outrank BSs with larger degree.
Revised:  Furthermore, we apply collective influence (CI) algorithm to localize the influential base stations and demonstrate that some low-degree BSs may outrank BSs with larger degree.
Edit intent: fluency
Original:  We exemplify Dynamic SOS on two languages supporting dynamic software upgrades, namely the C-like PROTEUS , which supports updating of variables, functions, records, or types at specific program points, and CREOL , which supports dynamic class upgrades in the setting of concurrent objects.
Revised:  We exemplify Dynamic SOS on two languages supporting dynamic software upgrades, namely the C-like Proteus , which supports updating of variables, functions, records, or types at specific program points, and CREOL , which supports dynamic class upgrades in the setting of concurrent objects.
Edit intent: fluency
Original:  We exemplify Dynamic SOS on two languages supporting dynamic software upgrades, namely the C-like PROTEUS , which supports updating of variables, functions, records, or types at specific program points, and CREOL , which supports dynamic class upgrades in the setting of concurrent objects.
Revised:  We exemplify Dynamic SOS on two languages supporting dynamic software upgrades, namely the C-like PROTEUS , which supports updating of variables, functions, records, or types at specific program points, and Creol , which supports dynamic class upgrades in the setting of concurrent objects.
Edit intent: fluency
Original:  We show how to apply this in the setting of concurrent object-oriented programming with active objects and asynchronous method calls.
Revised:  We use encapsulation in the Creol setting of concurrent object-oriented programming with active objects and asynchronous method calls.
Edit intent: clarity
Original:  This work is a preliminary attempt to investigate the feasibility of online classification of auditory attention using a noninvasive EEG-based brain  interface.
Revised:  This work is a novel attempt to investigate the feasibility of online classification of auditory attention using a noninvasive EEG-based brain interface.
Edit intent: clarity
Original:  We introduce a sequence of new financial instruments best suited for hedging in jump-diffusion and stochastic volatility market models and those with long-range dependence.
Revised:  We introduce a sequence of new financial instruments best suited for hedging jump-diffusion and stochastic volatility market models and those with long-range dependence.
Edit intent: clarity
Original:  Our methods lead to a new set of partial and partial and partial-integro differential equations for pricing derivatives  .
Revised:  Our methods lead to a new set of partial and partial-integro differential equations for pricing derivatives .
Edit intent: fluency
Original:  "A semi-algebraic version of Zarankiewicz's problem" , Preprint, arXiv:1407.5705 (2014) ] on the semialgebraic planar Zarankiewicz problem to arbitrary o-minimal structures, in particular obtaining an o-minimal generalization of the Szemer\'edi-Trotter theorem.
Revised:  "A semi-algebraic version of Zarankiewicz's problem" ] on the semialgebraic planar Zarankiewicz problem to arbitrary o-minimal structures, in particular obtaining an o-minimal generalization of the Szemer\'edi-Trotter theorem.
Edit intent: coherence
Original:  The frequency of buy limit orders below a given price level, respectively sell limit orders above a given level are described by fixed demand and supply functions.
Revised:  The frequencies of buy limit orders below a given price level, respectively sell limit orders above a given level are described by fixed demand and supply functions.
Edit intent: fluency
Original:  In particular, we are able to calculate the exact rate of market makers needed to close the spread completely  .
Revised:  In particular, we are able to calculate the exact rate at which market makers need to place orders in order to close the spread completely .
Edit intent: clarity
Original: In the "correlated sampling" problem, two players , say Alice and Bob, are given two distributions, say P and Q respectively, over the same universe and access to shared randomness.
Revised: In the "correlated sampling" problem, two players are given probability measures P and Q respectively, over the same universe and access to shared randomness.
Edit intent: clarity
Original: In the "correlated sampling" problem, two players , say Alice and Bob, are given two distributions, say P and Q respectively, over the same universe and access to shared randomness.
Revised: In the "correlated sampling" problem, two players , say Alice and Bob, are given two distributions, say P and Q respectively, over the same measurable space and access to shared randomness.
Edit intent: clarity
Original:  The two players are  required to output two elements, without any interaction, sampled according to their respective distributions , while trying to minimize the probability that their outputs disagree.
Revised:  Without any interaction, the two players are required to output two elements, without any interaction, sampled according to their respective distributions , while trying to minimize the probability that their outputs disagree.
Edit intent: clarity
Original:  The two players are  required to output two elements, without any interaction, sampled according to their respective distributions , while trying to minimize the probability that their outputs disagree.
Revised:  The two players are each required to output two elements, without any interaction, sampled according to their respective distributions , while trying to minimize the probability that their outputs disagree.
Edit intent: clarity
Original:  The two players are  required to output two elements, without any interaction, sampled according to their respective distributions , while trying to minimize the probability that their outputs disagree.
Revised:  The two players are required to output an element sampled according to their respective distributions , while trying to minimize the probability that their outputs disagree.
Edit intent: clarity
Original:  The two players are  required to output two elements, without any interaction, sampled according to their respective distributions , while trying to minimize the probability that their outputs disagree.
Revised:  The two players are required to output two elements, without any interaction, sampled according to their respective measures , while trying to minimize the probability that their outputs disagree.
Edit intent: clarity
Original:  A well-known protocol due to  Holenstein, with close variants (for similar problems ) due to Broder, and to Kleinberg and Tardos, solves this task with disagreement probability at most 2 \delta/(1+\delta), where \delta is the total variation distance between P and Q.
Revised:  A well-known strategy due to Kleinberg Holenstein, with close variants (for similar problems ) due to Broder, and to Kleinberg and Tardos, solves this task with disagreement probability at most 2 \delta/(1+\delta), where \delta is the total variation distance between P and Q.
Edit intent: clarity
Original:  A well-known protocol due to  Holenstein, with close variants (for similar problems ) due to Broder, and to Kleinberg and Tardos, solves this task with disagreement probability at most 2 \delta/(1+\delta), where \delta is the total variation distance between P and Q.
Revised:  A well-known protocol due to Holenstein, with a close variant (for a similar problem ) due to Broder, and to Kleinberg and Tardos, solves this task with disagreement probability at most 2 \delta/(1+\delta), where \delta is the total variation distance between P and Q.
Edit intent: fluency
Original:  A well-known protocol due to  Holenstein, with close variants (for similar problems ) due to Broder, and to Kleinberg and Tardos, solves this task with disagreement probability at most 2 \delta/(1+\delta), where \delta is the total variation distance between P and Q.
Revised:  A well-known protocol due to Holenstein, with close variants (for similar problems ) due to Broder, solves this task with disagreement probability at most 2 \delta/(1+\delta), where \delta is the total variation distance between P and Q.
Edit intent: coherence
Original:  This protocol has been used in several different contexts including sketching algorithms, approximation algorithms based on rounding linear programming relaxations, the study of parallel repetition and cryptography.
Revised:  This strategy has been used in several different contexts including sketching algorithms, approximation algorithms based on rounding linear programming relaxations, the study of parallel repetition and cryptography.
Edit intent: clarity
Original:  In this note , we give a surprisingly simple proof that this protocol is in fact tight.
Revised:  In this paper , we give a surprisingly simple proof that this protocol is in fact tight.
Edit intent: clarity
Original:  In this note , we give a surprisingly simple proof that this protocol is in fact tight.
Revised:  In this note , we give a surprisingly simple proof that this strategy is in fact tight.
Edit intent: clarity