wanyu/IteraTeR_v2 huggingface dataset:
Original: An interprocedural analysis is precise if it is flow sensitive and fully context sensitive even in the presence of recursion.
Revised: An interprocedural analysis is precise if it is flow sensitive and fully context-sensitive even in the presence of recursion.
Edit intent: fluency
Original:  However, this approach is restricted to IFDS/IDE problems, and is not suitable for general data flow frameworks such as constant propagation, heap reference analysis , and precise points-to analysis with strong updates which have non-distributive flow functions.
Revised:  However, this approach is restricted to IFDS/IDE problems, and is not suitable for general data flow frameworks such as heap reference analysis , and precise points-to analysis with strong updates which have non-distributive flow functions.
Edit intent: clarity
Original:  However, this approach is restricted to IFDS/IDE problems, and is not suitable for general data flow frameworks such as constant propagation, heap reference analysis , and precise points-to analysis with strong updates which have non-distributive flow functions.
Revised:  However, this approach is restricted to IFDS/IDE problems, and is not suitable for general data flow frameworks such as constant propagation, heap reference analysis and points-to analysis with strong updates which have non-distributive flow functions.
Edit intent: clarity
Original:  However, this approach is restricted to IFDS/IDE problems, and is not suitable for general data flow frameworks such as constant propagation, heap reference analysis , and precise points-to analysis with strong updates which have non-distributive flow functions.
Revised:  However, this approach is restricted to IFDS/IDE problems, and is not suitable for general data flow frameworks such as constant propagation, heap reference analysis , and precise points-to analysis which have non-distributive flow functions.
Edit intent: coherence
Original:  We instantiate our framework with a flow and context sensitive points-to analysis which enables construction of a far more precise call graphthan what can be constructed in Soot currently .
Revised:  The efficiency and precision of interprocedural analyses is heavily affected by the precision of the underlying call graph .
Edit intent: clarity
Original:  This is important for object oriented languages like Java where virtual method invocations cause an explosion of spurious call edges if the call graph is constructed naively.
Revised:  This is especially important for object-oriented languages like Java where virtual method invocations cause an explosion of spurious call edges if the call graph is constructed naively.
Edit intent: clarity
Original:  This report accompanies the article with the same title for the proceedings of the conference RTA 2013, and  differs from that by providing the proof of the characterization of lambda_{mu}-expressibility with binding-capturing chains.
Revised:  This report accompanies the article with the same title for the proceedings of the conference RTA 2013, and mainly differs from that by providing the proof of the characterization of lambda_{mu}-expressibility with binding-capturing chains.
Edit intent: coherence
Original:  In this model the transitions are labeled by letters or variables ranging over an infinite alphabet and guarded by conjunction of equalities and disequalities.
Revised:  In this model the transitions are labelled by letters or variables ranging over an infinite alphabet and guarded by conjunction of equalities and disequalities.
Edit intent: fluency
Original:  We embed this construction into several tilings of the hyperbolic plane and of the hyperbolic 3D-space giving rise to strongly universal cellular automata with 10 states.
Revised:  We embed this construction into several tilings of the hyperbolic plane and of the hyperbolic 3D space giving rise to strongly universal cellular automata with 10 states.
Edit intent: fluency
Original: In this paper we examine the question of designing and allocating transmission sequences to users in a mobile ad hoc network that has no spatial boundary.
Revised: In this paper we examine the problem of designing and allocating transmission sequences to users in a mobile ad hoc network that has no spatial boundary.
Edit intent: clarity
Original:  A basic tenet of the transmission sequence approach for addressing the media access control problem is that under normal operation conditions, there is no feedback based re-transmissions .
Revised:  A basic tenet of the transmission sequence approach for addressing media access control problem is that under normal operation conditions, there is no feedback based re-transmissions .
Edit intent: fluency
Original:  A basic tenet of the transmission sequence approach for addressing the media access control problem is that under normal operation conditions, there is no feedback based re-transmissions .
Revised:  A basic tenet of the transmission sequence approach for addressing the media access control is that under normal operation conditions, there is no feedback based re-transmissions .
Edit intent: clarity
Original:  A basic tenet of the transmission sequence approach for addressing the media access control problem is that under normal operation conditions, there is no feedback based re-transmissions .
Revised:  A basic tenet of the transmission sequence approach for addressing the media access control problem is that under normal operating conditions, there is no feedback based re-transmissions .
Edit intent: fluency
Original:  A basic tenet of the transmission sequence approach for addressing the media access control problem is that under normal operation conditions, there is no feedback based re-transmissions .
Revised:  A basic tenet of the transmission sequence approach for addressing the media access control problem is that under normal operation conditions, there is no feedback triggered re-transmission .
Edit intent: clarity
Original:  While these latter solutions enjoy excellent throughput performance, a fundamental drawback is that they are based on information feedback .
Revised:  While these solutions enjoy excellent throughput performance, a fundamental drawback is that they are based on information feedback .
Edit intent: clarity
Original:  While these latter solutions enjoy excellent throughput performance, a fundamental drawback is that they are based on information feedback .
Revised:  While these latter solutions enjoy excellent throughput performance, a fundamental drawback is that they are based on feedback information .
Edit intent: fluency
Original:  For systems in which there is no unique, naturally defined central controller that plays the role of a base station, the task of providing feedback information could easily become unmanageable.
Revised:  For systems without naturally defined central controller that plays the role of a base station, the task of providing feedback information could easily become unmanageable.
Edit intent: clarity
Original:  For systems in which there is no unique, naturally defined central controller that plays the role of a base station, the task of providing feedback information could easily become unmanageable.
Revised:  For systems in which there is no unique, naturally defined central controller that can play the role of a base station, the task of providing feedback information could easily become unmanageable.
Edit intent: clarity
Original:  We will propose a concept for media access control that is akin to the concept of frequency reuse.
Revised:  We propose in this paper a concept for media access control that is akin to the concept of frequency reuse.
Edit intent: clarity
Original:  We will propose a concept for media access control that is akin to the concept of frequency reuse.
Revised:  We will propose a concept for media access control that is akin to frequency reuse.
Edit intent: fluency
Original:  However, instead of reusing frequency division, the proposed approach allows transmission sequences be reused  .
Revised:  However, instead of reusing frequency , the new approach allows transmission sequences be reused .
Edit intent: clarity
Original: Networks of interconnected nodes have long played a key role in cognitive science , from artificial neural networks to spreading activation models of semantic memory . Recently, however, a new Network Science has been developed, providing insights into the emergence of global, system-scale properties in contexts as diverse as the Internet, metabolic reactions or collaborations among scientists.
Revised: Networks of interconnected nodes have long played a key role in Cognitive Science , from artificial neural networks to spreading activation models of semantic memory . Recently, however, a new Network Science has been developed, providing insights into the emergence of global, system-scale properties in contexts as diverse as the Internet, metabolic reactions or collaborations among scientists.
Edit intent: fluency
Original: Networks of interconnected nodes have long played a key role in cognitive science , from artificial neural networks to spreading activation models of semantic memory . Recently, however, a new Network Science has been developed, providing insights into the emergence of global, system-scale properties in contexts as diverse as the Internet, metabolic reactions or collaborations among scientists.
Revised: Networks of interconnected nodes have long played a key role in cognitive science , from artificial neural net- works to spreading activation models of semantic memory . Recently, however, a new Network Science has been developed, providing insights into the emergence of global, system-scale properties in contexts as diverse as the Internet, metabolic reactions or collaborations among scientists.
Edit intent: fluency
Original: Networks of interconnected nodes have long played a key role in cognitive science , from artificial neural networks to spreading activation models of semantic memory . Recently, however, a new Network Science has been developed, providing insights into the emergence of global, system-scale properties in contexts as diverse as the Internet, metabolic reactions or collaborations among scientists.
Revised: Networks of interconnected nodes have long played a key role in cognitive science , from artificial neural networks to spreading activation models of semantic mem- ory . Recently, however, a new Network Science has been developed, providing insights into the emergence of global, system-scale properties in contexts as diverse as the Internet, metabolic reactions or collaborations among scientists.
Edit intent: fluency
Original: Networks of interconnected nodes have long played a key role in cognitive science , from artificial neural networks to spreading activation models of semantic memory . Recently, however, a new Network Science has been developed, providing insights into the emergence of global, system-scale properties in contexts as diverse as the Internet, metabolic reactions or collaborations among scientists.
Revised: Networks of interconnected nodes have long played a key role in cognitive science , from artificial neural networks to spreading activation models of semantic memory . Recently, however, a new Network Science has been developed, providing insights into the emergence of global, system-scale properties in contexts as diverse as the Internet, metabolic reactions , and collaborations among scientists.
Edit intent: fluency
Original:  Today, the inclusion of network theory into cognitive sciences , and the expansion of complex systems science, promises to significantly change the way in which the organization and dynamics of cognitive and behavioral processes are understood.
Revised:  Today, the inclusion of network theory into Cognitive Sciences , and the expansion of complex systems science, promises to significantly change the way in which the organization and dynamics of cognitive and behavioral processes are understood.
Edit intent: fluency
Original:  Today, the inclusion of network theory into cognitive sciences , and the expansion of complex systems science, promises to significantly change the way in which the organization and dynamics of cognitive and behavioral processes are understood.
Revised:  Today, the inclusion of network theory into cognitive sciences , and the expansion of complex- systems science, promises to significantly change the way in which the organization and dynamics of cognitive and behavioral processes are understood.
Edit intent: fluency
Original:  In this paper, we review recent contributions of network theory at different levels and domains within the cognitive sciences .
Revised:  In this paper, we review recent contributions of network theory at different levels and domains within the Cognitive Sciences .
Edit intent: fluency
Original: This paper examines the role of interdisciplinary research for the development of knowledge pertaining to local issues.
Revised: This paper examines the role of interdisciplinarity on research pertaining to local issues.
Edit intent: clarity
Original:  Using Colombian publications from 1991 until 2011 in the Web of Science, we investigate the relationship between the degree of interdisciplinarity and the local focus of the articles.
Revised:  Using Colombian publications from 1991 until 2011 in the Web of Science, we investigate the relationship between the degree of interdisciplinarity and the local orientation of the articles.
Edit intent: clarity
Original:  In particular, our results support the view that research that combines cognitively disparate disciplines, what we refer to as Distal Interdisciplinarity , is associated with more local relevance of research.
Revised:  In particular, our results support the view that research that combines cognitively disparate disciplines, what we refer to as distal interdisciplinarity , is associated with more local relevance of research.
Edit intent: fluency
Original:  In particular, our results support the view that research that combines cognitively disparate disciplines, what we refer to as Distal Interdisciplinarity , is associated with more local relevance of research.
Revised:  In particular, our results support the view that research that combines cognitively disparate disciplines, what we refer to as Distal Interdisciplinarity , is associated with more local focus of research.
Edit intent: clarity
Original: This paper examines the role of interdisciplinarity on research pertaining to local issues.
Revised: This paper explores the relationship between interdisciplinarity and research pertaining to local issues.
Edit intent: clarity
Original:  We find that a higher degree of interdisciplinarity in a publication is associated with a greater emphasis on local issues.
Revised:  We find that a higher degree of interdisciplinarity in a publication is associated with a greater emphasis on Colombian issues.
Edit intent: clarity
Original:  In particular, our results support the view that research that combines cognitively disparate disciplines, what we refer to as distal interdisciplinarity, is associated with more local focus of research.
Revised:  In particular, our results suggest that research that combines cognitively disparate disciplines, what we refer to as distal interdisciplinarity, is associated with more local focus of research.
Edit intent: clarity
Original:  In particular, our results support the view that research that combines cognitively disparate disciplines, what we refer to as distal interdisciplinarity, is associated with more local focus of research.
Revised:  In particular, our results support the view that research that combines cognitively disparate disciplines, what we refer to as distal interdisciplinarity, tends to be associated with more local focus of research.
Edit intent: clarity
Original:  We discuss the policy implications of these results in the context of national research assessments targeting excellence and socio-economic impact  .
Revised:  We discuss the implications of these results in the context of national research assessments targeting excellence and socio-economic impact .
Edit intent: clarity
Original: A graph is {\em 1-planar} if it can be drawn on the plane such that every edge cross at most one other edge.
Revised: A graph is {\em 1-planar} if it can be drawn in the plane such that every edge cross at most one other edge.
Edit intent: clarity
Original: A graph is {\em 1-planar} if it can be drawn on the plane such that every edge cross at most one other edge.
Revised: A graph is {\em 1-planar} if it can be drawn on the plane such that every edge crosses at most one other edge.
Edit intent: fluency
Original:  In this paper, we present some strongly light subgraphs in the family of 1-planar graphs with minimum degree  7.
Revised:  In this paper, we present some strongly light subgraphs in the family of 1-planar graphs with minimum degree ~ 7.
Edit intent: fluency
Original: A stochastic version of  the Morris--Lecar model is formulated, where the noise originates from stochastic ion channels .
Revised: We consider a stochastic version of the Morris--Lecar model is formulated, where the noise originates from stochastic ion channels .
Edit intent: clarity
Original: A stochastic version of  the Morris--Lecar model is formulated, where the noise originates from stochastic ion channels .
Revised: A stochastic version of the noise originates from stochastic ion channels .
Edit intent: clarity
Original:  Instead of using a Langevin approximation, each population of ion channels Sodium (%DIFDELCMD < \Nat%%% ) and Potassium (%DIFDELCMD < \Kt%%% ) is modeled as a discrete birth-death process.
Revised:  Sodium (%DIFDELCMD < \Nat%%% ) and Potassium (%DIFDELCMD < \Kt%%% ) is modeled as a discrete birth-death process.
Edit intent: clarity
Original:  Instead of using a Langevin approximation, each population of ion channels Sodium (%DIFDELCMD < \Nat%%% ) and Potassium (%DIFDELCMD < \Kt%%% ) is modeled as a discrete birth-death process.
Revised:  Instead of using a Langevin approximation, each population of ion channels %DIFDELCMD < \Nat%%% ) and Potassium (%DIFDELCMD < \Kt%%% ) is modeled as a discrete birth-death process.
Edit intent: clarity
Original:  Instead of using a Langevin approximation, each population of ion channels Sodium (%DIFDELCMD < \Nat%%% ) and Potassium (%DIFDELCMD < \Kt%%% ) is modeled as a discrete birth-death process.
Revised:  Instead of using a Langevin approximation, each population of ion channels Sodium (%DIFDELCMD < \Nat%%% %DIFDELCMD < \Kt%%% ) is modeled as a discrete birth-death process.
Edit intent: coherence
Original:  Instead of using a Langevin approximation, each population of ion channels Sodium (%DIFDELCMD < \Nat%%% ) and Potassium (%DIFDELCMD < \Kt%%% ) is modeled as a discrete birth-death process.
Revised:  Instead of using a Langevin approximation, each population of ion channels Sodium (%DIFDELCMD < \Nat%%% ) and Potassium (%DIFDELCMD < \Kt%%% is modeled as a discrete birth-death process.
Edit intent: fluency
Original:  In the deterministic setting,%DIFDELCMD < \Kt %%% channel dynamics are slow and the fraction of open%DIFDELCMD < \Kt %%% channels is assumed to be fixed on the time scale of action potential initiation .
Revised:  In the deterministic setting,%DIFDELCMD < \Kt %%% %DIFDELCMD < \Kt %%% channels is assumed to be fixed on the time scale of action potential initiation .
Edit intent: clarity
Original:  The validity of this assumption in the stochastic setting is examined using a systematic perturbation analysis.
Revised:  The validity of this assumption in the stochastic model is examined using a systematic perturbation analysis.
Edit intent: clarity
Original: A perturbation framework , called the quasi-stationary analysis (QSA), is developed to analyze metastable behavior in stochastic processes with random internal and external states.
Revised: A perturbation framework is developed to analyze metastable behavior in stochastic processes with random internal and external states.
Edit intent: coherence
Original:  Two equivalent representations of the problem are considered: (i) direct optimization over the common divisors and cofactors (image representation), and (ii) Sylvester low-rank approximation (kernel representation).
Revised:  Two equivalent representations of the problem are considered: (i) direct parameterization over the common divisors and cofactors (image representation), and (ii) Sylvester low-rank approximation (kernel representation).
Edit intent: clarity
Original:  Two equivalent representations of the problem are considered: (i) direct optimization over the common divisors and cofactors (image representation), and (ii) Sylvester low-rank approximation (kernel representation).
Revised:  Two equivalent representations of the problem are considered: (i) direct optimization over the common divisors and quotients (image representation), and (ii) Sylvester low-rank approximation (kernel representation).
Edit intent: clarity
Original:  These methods have linear complexity in the degrees of the polynomials if either d is small or dis of the same order as the degrees of the polynomials .
Revised:  These methods have linear complexity in the degrees of the polynomials for small and large d .
Edit intent: clarity
Original:  We conclude that the RBF-IB method has significant advantages over the traditional Immersed Boundary method, and is well-suited for modeling of platelets in hemodynamic flows.
Revised:  We conclude that the RBF-IB method has advantages over the traditional Immersed Boundary method, and is well-suited for modeling of platelets in hemodynamic flows.
Edit intent: clarity
Original:  Such conformational changes may be amenable to study by molecular dynamics  techniques.
Revised:  Such conformational changes may be amenable to study by molecular dynamics (MD) techniques.
Edit intent: clarity
Original:  This paper studies the molecular structure of rabbit prion protein wild-type and mutants by molecular dynamics techniques, in order to understand the specific mechanism of rabbit prion protein and rabbit prions.
Revised:  This paper studies the molecular structure of rabbit prion protein wild-type and mutants by MD techniques, in order to understand the specific mechanism of rabbit prion protein and rabbit prions.
Edit intent: clarity
Original: In this study, we report findings about patterns of the Nature metrics page views over time . Using the page views data of papers published on Nature , we calculate from two perspectives.
Revised: In this study, we analyze the dynamic usage history of Nature publications over time using Nature metrics data. We conduct analysis from two perspectives.
Edit intent: clarity
Original:  The first one is the time before their page views reach 50\%/80\% of the total , and the second one is the percentage of total page views in 7 days, 30 days, and 100 days after publication.
Revised:  On the one hand, we examine how long it takes before the articles' downloads reach 50\%/80\% of the total , and the second one is the percentage of total page views in 7 days, 30 days, and 100 days after publication.
Edit intent: clarity
Original:  The first one is the time before their page views reach 50\%/80\% of the total , and the second one is the percentage of total page views in 7 days, 30 days, and 100 days after publication.
Revised:  The first one is the time before their page views reach 50\%/80\% of the total ; on the other hand, we compare the percentage of total page views in 7 days, 30 days, and 100 days after publication.
Edit intent: coherence
Original:  Papers are viewed most frequently within a short time period after publication.
Revised:  In general, papers are downloaded most frequently within a short time period after publication.
Edit intent: clarity
Original:  Using the usage data of a newly published paper, we conduct regression analysis to predict the future expected total usage count of the paper .
Revised:  Based on the usage data of a newly published paper, we conduct regression analysis to predict the future expected total usage count of the paper .
Edit intent: fluency