wanyu/IteraTeR_v2 huggingface dataset:
Original:  interesting results (e. g.\beta2\alpha2  (i) the species that has the clearly and highly ordered S2-H2 \beta2\alpha2 loop usually owns a 3-10-helix in this loop, (ii) a " pi-circle " Y128-F175-Y218-Y163-F175-Y169-R164-Y128(-Y162 ) is around the S2-H2 loopof prion protein structures) were found \beta2\alpha2  .
Revised:  interesting results (e. g.\beta2\alpha2 (i) the species that has the clearly and highly ordered S2-H2 \beta2\alpha2 loop usually owns a 3-10-helix in this loop, (ii) a " pi-circle " Y128-F175-Y218-Y163-F175-Y169-R164-Y128(-Y162 ) is around the S2-H2 loopof prion protein structures) were found \beta2-\alpha2 .
Edit intent: clarity
Original:  interesting results (e. g.\beta2\alpha2  (i) the species that has the clearly and highly ordered S2-H2 \beta2\alpha2 loop usually owns a 3-10-helix in this loop, (ii) a " pi-circle " Y128-F175-Y218-Y163-F175-Y169-R164-Y128(-Y162 ) is around the S2-H2 loopof prion protein structures) were found \beta2\alpha2  .
Revised:  interesting results (e. g.\beta2\alpha2 (i) the species that has the clearly and highly ordered S2-H2 \beta2\alpha2 loop usually owns a 3-10-helix in this loop, (ii) a " pi-circle " Y128-F175-Y218-Y163-F175-Y169-R164-Y128(-Y162 ) is around the S2-H2 loopof prion protein structures) were found \beta2\alpha2 loop .
Edit intent: fluency
Original: We prove that when a class of partial differential equations, generalized from the cable equation, is defined on tree graphs, and when the inputs are restricted to a spatially discrete  set of points, the Green's function (GF) formalism can be rewritten to scale as O(n) with the number n of inputs locations, contrarily to the previously reported O(n^2) scaling.
Revised: We prove that when a class of partial differential equations, generalized from the cable equation, is defined on tree graphs, and when the inputs are restricted to a spatially discrete set of points, the Green's function (GF) formalism can be rewritten to scale as O(n) with the number n of input locations, contrary to the previously reported O(n^2) scaling.
Edit intent: fluency
Original:  This work provides a detailed theoretical and experimental comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge--Kutta schemes.
Revised:  This work provides a detailed theoretical and computational comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge--Kutta schemes.
Edit intent: clarity
Original:  Perhaps most surprisingly, we demonstrate both theoretically and experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM;
Revised:  Perhaps most surprisingly, we demonstrate both theoretically and computationally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM;
Edit intent: clarity
Original:  Mapper , a tool for such summarization, takes as input both a possibly high dimensional dataset and a map defined on the data, and produces a summary of the data by using a cover of the codomain of the map.
Revised:  Mapper , a tool for such summarization, takes as input both a possibly high dimensional dataset and a map defined on the data, and produces a summary of the data by using a cover of the codomain of the map.
Edit intent: fluency
Original:  Inspired by the concept, we explore a notion of hierarchical family of coverings which induces a hierarchical family of simplicial complexes connected by simplicial maps, which we call {\em multiscale mapper .
Revised:  Inspired by the concept, we explore a notion of a tower of covers which induces a hierarchical family of simplicial complexes connected by simplicial maps, which we call {\em multiscale mapper .
Edit intent: clarity
Original:  Inspired by the concept, we explore a notion of hierarchical family of coverings which induces a hierarchical family of simplicial complexes connected by simplicial maps, which we call {\em multiscale mapper .
Revised:  Inspired by the concept, we explore a notion of hierarchical family of coverings which induces a tower of simplicial complexes connected by simplicial maps, which we call {\em multiscale mapper .
Edit intent: clarity
Original:  This shows that in order to explore the impact of population structure on evolutionary dynamics , it is crucial to take the details of the microscopic evolutionary processinto account .
Revised:  Thus, the impact of population structure on evolutionary dynamics , it is crucial to take the details of the microscopic evolutionary processinto account .
Edit intent: coherence
Original:  This shows that in order to explore the impact of population structure on evolutionary dynamics , it is crucial to take the details of the microscopic evolutionary processinto account .
Revised:  This shows that in order to explore the impact of population structure on evolutionary dynamics is a subtle issue that will depend on seemingly minor details of the microscopic evolutionary processinto account .
Edit intent: clarity
Original:  This shows that in order to explore the impact of population structure on evolutionary dynamics , it is crucial to take the details of the microscopic evolutionary processinto account .
Revised:  This shows that in order to explore the impact of population structure on evolutionary dynamics , it is crucial to take the details of the underlying evolutionary process .
Edit intent: clarity
Original:  Using this language of graphs to analyze the monetary system, we first examine the systems based on commodity money and show their incompatibility with credit.
Revised:  Using this language of graphs to analyze the monetary system, we first examine the systems based on commodity money are incompatible with credit.
Edit intent: clarity
Original:  After dealing with the role of the state via its ability to spend and raise taxes, we discuss the chartalist systems based on pure fiat money, which are the current systems.
Revised:  We then study the current chartalist systems based on pure fiat money, which are the current systems.
Edit intent: clarity
Original:  We present a graph representation which allows for a clear understanding of modern monetary systems.
Revised:  We present a graph representation that allows for a clear understanding of modern monetary systems.
Edit intent: fluency
Original:  We consider statistical potentials for protein fragments which describe the mentioned frequencies of occurrence and discuss a model of the free energy of a protein where the free energy is equal to a sum of statistical potentials of the fragments.
Revised:  We consider statistical potentials for protein fragments which describe the mentioned frequencies of occurrence and discuss model of free energy of a protein where the free energy is equal to a sum of statistical potentials of the fragments.
Edit intent: fluency
Original:  We discuss application of this model to the problem of prediction of the native conformation of a protein from its primary structure and to the description of the dynamics of a protein.
Revised:  We discuss application of this model to problem of prediction of the native conformation of a protein from its primary structure and to the description of the dynamics of a protein.
Edit intent: fluency
Original:  We discuss application of this model to the problem of prediction of the native conformation of a protein from its primary structure and to the description of the dynamics of a protein.
Revised:  We discuss application of this model to the problem of prediction of the native conformation of a protein from its primary structure and to description of dynamics of a protein.
Edit intent: fluency
Original: We discuss a model of protein conformations where  conformations are combinations of short fragments from some small set.
Revised: We discuss a model of protein conformations where the conformations are combinations of short fragments from some small set.
Edit intent: clarity
Original:  These frequencies can be estimated due to smallness of the epsilon-entropy of the set of conformations of protein fragments.
Revised:  These frequencies can be estimated due to smallness of epsilon-entropy of the set of conformations of protein fragments.
Edit intent: fluency
Original:  With model-free learning, the decision-making entities adapt their behaviors based on the reinforcement through their interaction with the environment , and are able to (implicitly) build the understanding of the system through try-and-error mechanisms.
Revised:  With model-free learning, the decision-making entities adapt their behaviors based on the reinforcement from their interaction with the environment , and are able to (implicitly) build the understanding of the system through try-and-error mechanisms.
Edit intent: clarity
Original:  With model-free learning, the decision-making entities adapt their behaviors based on the reinforcement through their interaction with the environment , and are able to (implicitly) build the understanding of the system through try-and-error mechanisms.
Revised:  With model-free learning, the decision-making entities adapt their behaviors based on the reinforcement through their interaction with the environment and are able to (implicitly) build the understanding of the system through try-and-error mechanisms.
Edit intent: fluency
Original:  With model-free learning, the decision-making entities adapt their behaviors based on the reinforcement through their interaction with the environment , and are able to (implicitly) build the understanding of the system through try-and-error mechanisms.
Revised:  With model-free learning, the decision-making entities adapt their behaviors based on the reinforcement through their interaction with the environment , and are able to (implicitly) build the understanding of the system through trial-and-error mechanisms.
Edit intent: fluency
Original:  Such a characteristics of model-free learning is highly in accordance with the requirement of cognition and intelligence for wireless devices in cognitive wireless networks.
Revised:  Such characteristics of model-free learning is highly in accordance with the requirement of cognition and intelligence for wireless devices in cognitive wireless networks.
Edit intent: fluency
Original:  Such a characteristics of model-free learning is highly in accordance with the requirement of cognition and intelligence for wireless devices in cognitive wireless networks.
Revised:  Such a characteristics of model-free learning is highly in accordance with the requirement of cognition-based intelligence for devices in cognitive wireless networks.
Edit intent: clarity
Original:  In this paper, we provide a comprehensive survey on the applications of the state-of-art model-free learning mechanisms in  wireless networks.
Revised:  In this paper, we provide a comprehensive survey on the applications of the state-of-the-art model-free learning mechanisms in wireless networks.
Edit intent: fluency
Original:  A systematic overview of the learning algorithms in the domains of both multi-agent systems and multi-player games is provided.
Revised:  A systematic overview of the learning algorithms in the domains of single-agent system, multi-agent systems and multi-player games is provided.
Edit intent: clarity
Original:  Furthermore, the applications of model-free learning to various problems in  wireless networks are discussed with the focus on how the learning mechanisms helps to provide the solutions to these problems and improve the network performance over the existing model-based, non-adaptive methods.
Revised:  Furthermore, the applications of model-free learning to various problems in wireless networks are discussed with the focus on how the learning mechanisms help to provide the solutions to these problems and improve the network performance over the existing model-based, non-adaptive methods.
Edit intent: fluency
Original:  Finally, a broad spectrum of challenges and open issues are discussed to offer a guideline for the future research directions.
Revised:  Finally, a broad 
Edit intent: coherence
Original: The pathloss exponent and the variance of the large-scale fading  are two parameters that are of great importance when modeling and characterizing wireless propagation channels.
Revised: The pathloss exponent and the large-scale fading are two parameters that are of great importance when modeling and characterizing wireless propagation channels.
Edit intent: clarity
Original:  We investigate the effect that the number of samples and the sampling distances have on the standard errors of pathloss parameters estimated by ordinary least squares.
Edit intent: coherence
Original:  We show that the path loss and large scale fading estimates can be improved if the effects of censored samples, i.e., samples below the noise floor, are taken into account in the estimation.
Edit intent: coherence
Original: We consider a leaky integrate--and--fire neuron with deterministic subthreshold dynamics and a firing threshold that evolves as an Ornstein-Uhlenbeck process.
Revised: We consider a leaky integrate-and-fire neuron with deterministic subthreshold dynamics and a firing threshold that evolves as an Ornstein-Uhlenbeck process.
Edit intent: fluency
Original:  We test and reject the hypothesis that the apparent long memory of order flow is an artefact caused by structural breaks, in favour of the alternative hypothesis of true long memory.
Revised:  We test and reject the hypothesis that the apparent long memory of order flow is an artifact caused by structural breaks, in favour of the alternative hypothesis of true long memory.
Edit intent: fluency
Original: Word W is said to encounter word V provided there is a homomorphism \phi mapping letters to nonempty words so that \phi(V) is a substring of W. For example, taking \phi such that \phi(h)=c and \phi(u)=ien, we see that science encounters huh since cienc=\phi(huh).
Revised: Word W is said to encounter word V provided there is a homomorphism \phi mapping letters to nonempty words so that \phi(V) is a substring of W. For example, taking \phi such that \phi(h)=c and \phi(u)=ien, we see that "science" encounters "huh" since cienc=\phi(huh).
Edit intent: clarity
Original:  So the density of huh in science is 2/{8 \choose 2}.
Revised:  So the density of "huh" in "science" is 2/{8 \choose 2}.
Edit intent: fluency
Original:   V is doubled if and only if  \delta(V,W_n) = 0 asymptotically almost surely.
Revised:  Word V is doubled if and only if \delta(V,W_n) = 0 asymptotically almost surely.
Edit intent: fluency
Original: From 2012 to 2015 together with other Linked Data community members and experts from the social, behavioural , and economic sciences (SBE), we developed diverse vocabularies to represent SBE metadata and rectangular data in RDF.
Revised: From 2012 to 2015 together with other Linked Data community members and experts from the social, behavioral , and economic sciences (SBE), we developed diverse vocabularies to represent SBE metadata and rectangular data in RDF.
Edit intent: fluency
Original:  The DDI-RDF Discovery Vocabulary ( Disco ) is designed to support the dissemination, management, and reuse of person-level data, i.e., data about individuals, households, and businesses, collected in form of responses to studies and archived for research purposes.
Revised:  The DDI-RDF Discovery Vocabulary ( DDI-RDF ) is designed to support the dissemination, management, and reuse of person-level data, i.e., data about individuals, households, and businesses, collected in form of responses to studies and archived for research purposes.
Edit intent: clarity
Original:  In this paper, we evaluated the metadata and data quality of large real world aggregated (QB),person-level (Disco) , thesauri (SKOS), rectangular (PHDD), and statistical classification (XKOS) data sets by means of RDF constraints.
Revised:  In this paper, we evaluate the data quality of large real world aggregated (QB),person-level (Disco) , thesauri (SKOS), rectangular (PHDD), and statistical classification (XKOS) data sets by means of RDF constraints.
Edit intent: clarity
Original:  From 2012 to 2015 together with other Linked Data community members and experts from the social, behavioural , and economic sciences (SBE), we developed diverse vocabularies to represent SBE metadata and rectangular data in RDF.
Revised:  From 2012 to 2015 together with other Linked Data community members and experts from the social, behavioral , and economic sciences (SBE), we developed diverse vocabularies to represent SBE metadata and rectangular data in RDF.
Edit intent: fluency
Original:  We show that non-symmetric module under study can exhibit very rich behaviors , including the empirical oscillations described by repressilator.
Revised:  We show that non-symmetric module under study can exhibit very rich behaviours , including the empirical oscillations described by repressilator.
Edit intent: fluency
Original: The goal of a rumor source node in a social network is to spread its rumor to as many nodes as possible, while remaining hidden from the network administrator.
Revised: The goal of a rumor source node in a social network is to spread its infection to as many nodes as possible, while remaining hidden from the network administrator.
Edit intent: clarity
Original:  On the other hand, the network administrator aims to identify the source node based on knowledge of which nodes have accepted the rumor (which are called infectednodes) .
Revised:  On the other hand, the network administrator aims to identify the source node based on knowledge of which nodes have been infected .
Edit intent: clarity
Original:  We model the rumor spreading and source identification problem as a strategic game, where the rumor source and the network administrator are the two players.
Revised:  We model the infection spreading and source identification problem as a strategic game, where the rumor source and the network administrator are the two players.
Edit intent: clarity
Original:  We model the rumor spreading and source identification problem as a strategic game, where the rumor source and the network administrator are the two players.
Revised:  We model the rumor spreading and source identification problem as a strategic game, where the infection source and the network administrator are the two players.
Edit intent: clarity
Original:  As the Jordan center estimator is a minimax source estimator that has been shown to be robust in recent works, we assume that the network administrator utilizes a source estimation strategy that probes every node within a given radius of the Jordan center.
Revised:  As the Jordan center estimator is a minimax source estimator that has been shown to be robust in recent works, we assume that the network administrator utilizes a source estimation strategy that can probe any nodes within a given radius of the Jordan center.
Edit intent: clarity
Original:  Given any estimation strategy, we design a best-response infection strategy for the rumor source.
Revised:  Given any estimation strategy, we design a best-response infection strategy for the source.
Edit intent: clarity
Original:  We derive conditions under which the Nash equilibria of the strategic game exist . Simulations in both synthetic and real-world networks demonstrate that our proposed infection strategy infects more nodes while maintaining the same safety margin between the true source node and the Jordan center source estimator.
Revised:  We derive conditions under which a Nash equilibrium of the strategic game exist . Simulations in both synthetic and real-world networks demonstrate that our proposed infection strategy infects more nodes while maintaining the same safety margin between the true source node and the Jordan center source estimator.
Edit intent: clarity
Original:  We derive conditions under which the Nash equilibria of the strategic game exist . Simulations in both synthetic and real-world networks demonstrate that our proposed infection strategy infects more nodes while maintaining the same safety margin between the true source node and the Jordan center source estimator.
Revised:  We derive conditions under which the Nash equilibria of the strategic game exists . Simulations in both synthetic and real-world networks demonstrate that our proposed infection strategy infects more nodes while maintaining the same safety margin between the true source node and the Jordan center source estimator.
Edit intent: fluency
Original:  In our variant  Alice does not know g, but only knows some function f which is an approximation of g.
Revised:  In our variant , Alice does not know g, but only knows some function f which is an approximation of g.
Edit intent: fluency
Original:  The program was developed using the freeware Pascal RAD IDE Lazarus, and its source code and binaries compiled for Windows are freely accessible at URL  Triander can produce four types of plots.
Revised:  The program was developed using the freeware Pascal RAD IDE Lazarus, and its source code and binaries compiled for Windows are freely accessible at URL . Triander can produce four types of plots.
Edit intent: fluency
Original: The minimum number of total independent  sets of V \cup E of graph G (V,E) is called the total chromatic number of G, denoted by \chi " (G).
Revised: The minimum number of total independent sets of V \cup E of graph G (V,E) is called the total chromatic number of G, denoted by \chi '' (G).
Edit intent: fluency
Original:  If difference of cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of V \cup E is called the \emph{equitable total chromatic number}, and  denoted by \chi " _=(G).
Revised:  If the difference between cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of V \cup E is called the \emph{equitable total chromatic number}, and denoted by \chi " _=(G).
Edit intent: fluency
Original:  If difference of cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of V \cup E is called the \emph{equitable total chromatic number}, and  denoted by \chi " _=(G).
Revised:  If difference of cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of V \cup E is called the \emph{equitable total chromatic number}, and is denoted by \chi " _=(G).
Edit intent: fluency
Original:  If difference of cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of V \cup E is called the \emph{equitable total chromatic number}, and  denoted by \chi " _=(G).
Revised:  If difference of cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of V \cup E is called the \emph{equitable total chromatic number}, and denoted by \chi '' _=(G).
Edit intent: fluency
Original:  In this paper we consider equitable total coloring of corona of cubic graphs, G \circ H. It turns out that, independly on  equitable total chromatic numbers of G and H, equitable total chromatic number of corona G \circ H is equal to \Delta(G \circ H) +1.
Revised:  In this paper we consider equitable total coloring of coronas of cubic graphs, G \circ H. It turns out that, independly on equitable total chromatic numbers of G and H, equitable total chromatic number of corona G \circ H is equal to \Delta(G \circ H) +1.
Edit intent: fluency
Original:  In this paper we consider equitable total coloring of corona of cubic graphs, G \circ H. It turns out that, independly on  equitable total chromatic numbers of G and H, equitable total chromatic number of corona G \circ H is equal to \Delta(G \circ H) +1.
Revised:  In this paper we consider equitable total coloring of corona of cubic graphs, G \circ H. It turns out that, independly on equitable total chromatic number of factors G and H, equitable total chromatic number of corona G \circ H is equal to \Delta(G \circ H) +1.
Edit intent: clarity