wanyu/IteraTeR_v2 huggingface dataset:
Original:  Here we reconstructed, using web search engines, a network representing the relatedness of researchers to their peers as well as  various research topics.
Revised:  Here we reconstructed, using web search engines, a network representing the relatedness of researchers to their peers as well as to various research topics.
Edit intent: fluency
Original:   We calculated correlations between visibility boosts by research topics and researchers' interdisciplinarity at individual and social levels, i.e., diversity of topics related to them and their centrality in the researchers' network , respectively.
Revised:  We calculated correlations between visibility boosts by research topics and researchers' interdisciplinarity at individual level ( diversity of topics related to them and their centrality in the researchers' network , respectively.
Edit intent: clarity
Original:  Our preliminary results suggested that visibility boosts by  network-related and other topics had positive correlations with researchers' social-level interdisciplinarity , while topics' correlations with researchers' individuallevel and social-level interdisciplinarities were  nearly independent from each other.
Revised:  Our preliminary results suggested that visibility boosts by network-related topics had positive correlations with researchers' social-level interdisciplinarity , while topics' correlations with researchers' individuallevel and social-level interdisciplinarities were nearly independent from each other.
Edit intent: clarity
Original:  Our preliminary results suggested that visibility boosts by  network-related and other topics had positive correlations with researchers' social-level interdisciplinarity , while topics' correlations with researchers' individuallevel and social-level interdisciplinarities were  nearly independent from each other.
Revised:  Our preliminary results suggested that visibility boosts by network-related and other topics had positive correlations with researchers' social-level interdisciplinarity . Research topics' correlations with researchers' individuallevel and social-level interdisciplinarities were nearly independent from each other.
Edit intent: clarity
Original:  Our preliminary results suggested that visibility boosts by  network-related and other topics had positive correlations with researchers' social-level interdisciplinarity , while topics' correlations with researchers' individuallevel and social-level interdisciplinarities were  nearly independent from each other.
Revised:  Our preliminary results suggested that visibility boosts by network-related and other topics had positive correlations with researchers' social-level interdisciplinarity , while topics' correlations with researchers' individual- and social-level interdisciplinarities were nearly independent from each other.
Edit intent: fluency
Original:  Our preliminary results suggested that visibility boosts by  network-related and other topics had positive correlations with researchers' social-level interdisciplinarity , while topics' correlations with researchers' individuallevel and social-level interdisciplinarities were  nearly independent from each other.
Revised:  Our preliminary results suggested that visibility boosts by network-related and other topics had positive correlations with researchers' social-level interdisciplinarity , while topics' correlations with researchers' individuallevel and social-level interdisciplinarities were found to be nearly independent from each other.
Edit intent: clarity
Original:  These surrogate models can be used in various parametric analysis task such as parameter identificiation or sensitivity analysis.
Revised:  These surrogate models can be used in various parametric analysis task such as identifiability analysis, parameter estimation, or sensitivity analysis.
Edit intent: clarity
Original: We investigate the dynamics of a trust game on a mixed population where individuals  are forced to play against a predetermined number of partners, who they choose dynamically.
Revised: We investigate the dynamics of a trust game on a mixed population where individuals are forced to play against a predetermined number of sellers, whom they choose dynamically.
Edit intent: clarity
Original:  Agents  are also allowed to adapt their level of trustworthiness , based on payoff.
Revised:  Agents with the role of sellers are also allowed to adapt their level of trustworthiness , based on payoff.
Edit intent: clarity
Original:  The dynamics undergoes a transition at a specific value of the strategy update rate, above which an emergent cartel organization is observed, where individuals have similar values of below optimal trustworthiness .
Revised:  The dynamics undergoes a transition at a specific value of the strategy update rate, above which an emergent cartel organization is observed, where sellers have similar values of below optimal trustworthiness .
Edit intent: clarity
Original: We consider resource allocation in the 3GPP Long Term Evolution (LTE) cellular uplink  .
Revised: In this paper, we consider resource allocation in the 3GPP Long Term Evolution (LTE) cellular uplink .
Edit intent: clarity
Original:  The key features of the 3GPP LTE uplink (UL) are that it is based on a modified form of the orthogonal frequency division multiplexing based multiple acess (OFDMA) , which enables localized channel dependent frequency selective scheduling, and that it allows for multi-user (MU) scheduling wherein multiple users can be assigned the same time-frequency resource.
Revised:  The key features of the 3GPP LTE uplink (UL) are that it is based on a modified form of the orthogonal frequency division multiplexing based multiple acess (OFDMA) which enables channel dependent frequency selective scheduling, and that it allows for multi-user (MU) scheduling wherein multiple users can be assigned the same time-frequency resource.
Edit intent: clarity
Original:  While these features promise significant spectral efficiency gains , several practical constraints are also imposed in order to maintain a low signaling overhead and mitigate inter-cell interference .
Revised:  While these features promise significant spectral efficiency gains , several practical constraints that seek to maintain a low signaling overhead and mitigate inter-cell interference .
Edit intent: clarity
Original:  While these features promise significant spectral efficiency gains , several practical constraints are also imposed in order to maintain a low signaling overhead and mitigate inter-cell interference .
Revised:  While these features promise significant spectral efficiency gains , several practical constraints are also imposed in order to maintain a low signaling overhead , are also imposed .
Edit intent: clarity
Original:  The proposed LRT based MU scheduling algorithm is an end-to-end solution which can accommodate all practical constraints{\em   . Detailed evaluations reveal that the proposed algorithm together with its proposed enhancements can indeed offer significant gains over a practical LTE uplink .
Revised:  The proposed LRT based MU scheduling algorithm is an end-to-end solution which can accommodate all practical constraints{\em good . Detailed evaluations reveal that the proposed algorithm together with its proposed enhancements can indeed offer significant gains over a practical LTE uplink .
Edit intent: fluency
Original:  The proposed LRT based MU scheduling algorithm is an end-to-end solution which can accommodate all practical constraints{\em   . Detailed evaluations reveal that the proposed algorithm together with its proposed enhancements can indeed offer significant gains over a practical LTE uplink .
Revised:  The proposed LRT based MU scheduling algorithm is an end-to-end solution which can accommodate all practical constraints{\em . Detailed evaluations reveal that the proposed algorithms and their enhancements offer significant gains over a practical LTE uplink .
Edit intent: clarity
Original:  The proposed LRT based MU scheduling algorithm is an end-to-end solution which can accommodate all practical constraints{\em   . Detailed evaluations reveal that the proposed algorithm together with its proposed enhancements can indeed offer significant gains over a practical LTE uplink .
Revised:  The proposed LRT based MU scheduling algorithm is an end-to-end solution which can accommodate all practical constraints{\em . Detailed evaluations reveal that the proposed algorithm together with its proposed enhancements can indeed offer significant gains .
Edit intent: clarity
Original:  The key features of the 3GPP LTE uplink (UL) are that it is based on a modified form of the orthogonal frequency division multiplexing based multiple acess (OFDMA) which enables channel dependent frequency selective scheduling, and that it allows for multi-user (MU) scheduling wherein multiple users can be assigned the same time-frequency resource.
Revised:  The key features of the 3GPP LTE uplink (UL) are that it is based on a modified form of the orthogonal frequency division multiplexing based multiple access (OFDMA) which enables channel dependent frequency selective scheduling, and that it allows for multi-user (MU) scheduling wherein multiple users can be assigned the same time-frequency resource.
Edit intent: fluency
Original:  Further, user pre-selection, wherein a smaller pool of %DIFDELCMD < {\em %%% good users is pre-selected and a sophisticated scheduling algorithm is then employed on the selected pool, is also examined.
Revised:  Further, user pre-selection, wherein a smaller pool of %DIFDELCMD < {\em %%% good users is pre-selected and a sophisticated scheduling algorithm is then employed on the selected pool, is also examined.
Edit intent: fluency
Original: In this paper, we address the problem of safety verification of nonlinear hybrid systems and stability analysis of nonlinear autonomous systems .
Revised: In this paper, we address the problem of safety verification of nonlinear hybrid systems .
Edit intent: clarity
Original:  A hybrid symbolic-numeric method is presented to compute exact inequality invariants of hybrid systems and exact estimates of regions of attraction of autonomous systems efficiently.
Revised:  A hybrid symbolic-numeric method is presented to compute exact inequality invariants of hybrid systems efficiently.
Edit intent: clarity
Original:  Some numerical invariants of a hybrid system or an estimate of region of attraction can be obtained by solving a bilinear SOS program via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants and estimates of regions of attraction with rational coefficients {\it   . Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
Revised:  Some numerical invariants of a hybrid system can be obtained by solving a bilinear SOS program via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants and estimates of regions of attraction with rational coefficients {\it . Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
Edit intent: coherence
Original:  Some numerical invariants of a hybrid system or an estimate of region of attraction can be obtained by solving a bilinear SOS program via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants and estimates of regions of attraction with rational coefficients {\it   . Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
Revised:  Some numerical invariants of a hybrid system or an estimate of region of attraction can be obtained by solving a bilinear SOS programming via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants and estimates of regions of attraction with rational coefficients {\it . Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
Edit intent: clarity
Original:  Some numerical invariants of a hybrid system or an estimate of region of attraction can be obtained by solving a bilinear SOS program via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants and estimates of regions of attraction with rational coefficients {\it   . Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
Revised:  Some numerical invariants of a hybrid system or an estimate of region of attraction can be obtained by solving a bilinear SOS program via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants with rational coefficients {\it . Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
Edit intent: coherence
Original:  Some numerical invariants of a hybrid system or an estimate of region of attraction can be obtained by solving a bilinear SOS program via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants and estimates of regions of attraction with rational coefficients {\it   . Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
Revised:  Some numerical invariants of a hybrid system or an estimate of region of attraction can be obtained by solving a bilinear SOS program via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants and estimates of regions of attraction with rational coefficients , which{\it . Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
Edit intent: clarity
Original:  Some numerical invariants of a hybrid system or an estimate of region of attraction can be obtained by solving a bilinear SOS program via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants and estimates of regions of attraction with rational coefficients {\it   . Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
Revised:  Some numerical invariants of a hybrid system or an estimate of region of attraction can be obtained by solving a bilinear SOS program via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants and estimates of regions of attraction with rational coefficients {\it exactly . Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
Edit intent: clarity
Original: The Riemann-Roch theorem on a graph G is closely related to Alexander duality in combinatorial commutive algebra.
Revised: The Riemann-Roch theorem on a graph G is related to Alexander duality in combinatorial commutive algebra.
Edit intent: clarity
Original: If G and H are two cubic graphs, then we write G\prec H , if G admits a proper edge-coloring f with edges of H, such that for each vertex x of G, there is a vertex y of H with f( N _G(x))= N _H(y).
Revised: If G and H are two cubic graphs, then we write H\prec G , if G admits a proper edge-coloring f with edges of H, such that for each vertex x of G, there is a vertex y of H with f( N _G(x))= N _H(y).
Edit intent: fluency
Original:  In this paper, we  show that if G is a connected bridgeless cubic graph with P\prec G , then G=P  .
Revised:  In this paper, we show that if G is a connected bridgeless cubic graph with G\prec P , then G=P .
Edit intent: clarity
Original:  We introduce notions of size for representations of data (accounting for sharing) and codata (using ideas from type-2 computational complexity) and establish that type-level ~ 1 RS1-functions have polynomial-bounded runtimes and satisfy a polynomial-time completeness condition.
Revised:  We introduce notions of size for representations of data (accounting for sharing) and codata (using ideas from type-2 computational complexity) and establish that type-level 1 RS1-functions have polynomial-bounded runtimes and satisfy a polynomial-time completeness condition.
Edit intent: fluency
Original:  Also, restricting RS1 terms to particular types produces characterizations of some standard complexity classes (e.g., omega-regular languages, linear-space functions) , some less-standard classes (e.g., log-space streams) , and some new interesting classes .
Revised:  Also, restricting RS1 terms to particular types produces characterizations of some standard complexity classes (e.g., omega-regular languages, linear-space functions) and some less-standard classes (e.g., log-space streams) , and some new interesting classes .
Edit intent: coherence
Original:  Also, restricting RS1 terms to particular types produces characterizations of some standard complexity classes (e.g., omega-regular languages, linear-space functions) , some less-standard classes (e.g., log-space streams) , and some new interesting classes .
Revised:  Also, restricting RS1 terms to particular types produces characterizations of some standard complexity classes (e.g., omega-regular languages, linear-space functions) , some less-standard classes (e.g., log-space streams) .
Edit intent: coherence
Original: Observe and understand the user populations of the Scientific and Technical Information, is preparing to offer  appropriate services.
Revised: Observe and understand users of the Scientific and Technical Information, is preparing to offer appropriate services.
Edit intent: clarity
Original: Observe and understand the user populations of the Scientific and Technical Information, is preparing to offer  appropriate services.
Revised: Observe and understand the user populations of the Scientific and Technical Information, is preparing to offer them appropriate services.
Edit intent: clarity
Original:  This exploratory study provides answers about the uses in the humanities and social sciences as well as hard.
Revised:  This exploratory study provides answers about the uses in the humanities , social sciences as well as hard.
Edit intent: fluency
Original:  We then outline the considerations and recommendations to guide the functionality of digital services for the research literature .
Revised:  We then outline the considerations and recommendations to specify functionalities of an efficient e-Linrary .
Edit intent: clarity
Original:  As an illustration of this claim, we use our formalism to highlight unusual behaviors of the size and composition of the components (small and giant) in a fictional , albeit realistic, social network.
Revised:  As an illustration of this claim, we use our formalism to highlight unusual behaviors of the size and composition of the components (small and giant) in a synthetic , albeit realistic, social network.
Edit intent: clarity
Original:  In this work we study the rainbow connectivity of the binomial graph G=G(n,p) at the connectivity threshold p= \log n+%DIFDELCMD < \om%%% /n where \om=\om(n) -->oo and \to \om =o( %DIFDELCMD < \logn}%%% . We) and of random r-regular graphs where r \geq 3 is a fixed integer.
Revised:  In this work we study the rainbow connectivity of binomial random graphs at the connectivity threshold p= \log n+%DIFDELCMD < \om%%% /n where \om=\om(n) -->oo and \to \om =o( %DIFDELCMD < \logn}%%% . We) and of random r-regular graphs where r \geq 3 is a fixed integer.
Edit intent: clarity
Original:  In this work we study the rainbow connectivity of the binomial graph G=G(n,p) at the connectivity threshold p= \log n+%DIFDELCMD < \om%%% /n where \om=\om(n) -->oo and \to \om =o( %DIFDELCMD < \logn}%%% . We) and of random r-regular graphs where r \geq 3 is a fixed integer.
Revised:  In this work we study the rainbow connectivity of the binomial graph G=G(n,p) at the connectivity threshold p= %DIFDELCMD < \om%%% /n where \om=\om(n) -->oo and \to \om =o( %DIFDELCMD < \logn}%%% . We) and of random r-regular graphs where r \geq 3 is a fixed integer.
Edit intent: clarity
Original:  In this work we study the rainbow connectivity of the binomial graph G=G(n,p) at the connectivity threshold p= \log n+%DIFDELCMD < \om%%% /n where \om=\om(n) -->oo and \to \om =o( %DIFDELCMD < \logn}%%% . We) and of random r-regular graphs where r \geq 3 is a fixed integer.
Revised:  In this work we study the rainbow connectivity of the binomial graph G=G(n,p) at the connectivity threshold p= \log n+%DIFDELCMD < \om%%% /n where \om=\om(n) \to \om =o( %DIFDELCMD < \logn}%%% . We) and of random r-regular graphs where r \geq 3 is a fixed integer.
Edit intent: coherence
Original:  Specifically, we } prove that the rainbow connectivity of G satisfies rc(G) \sim max set%DIFDELCMD < {%%% Z_1,diameter (G)  with high probability \whp . Here Z_1 is the number of vertices in G whose degree equals 1 and the diameter of G is asymptotically equal to logn/loglogn with high probability \diam \whp) }\whp .
Revised:  Specifically, we } prove that the rainbow connectivity rc(G) \sim max set%DIFDELCMD < {%%% Z_1,diameter (G) with high probability \whp . Here Z_1 is the number of vertices in G whose degree equals 1 and the diameter of G is asymptotically equal to logn/loglogn with high probability \diam \whp) }\whp .
Edit intent: clarity
Original:  Specifically, we } prove that the rainbow connectivity of G satisfies rc(G) \sim max set%DIFDELCMD < {%%% Z_1,diameter (G)  with high probability \whp . Here Z_1 is the number of vertices in G whose degree equals 1 and the diameter of G is asymptotically equal to logn/loglogn with high probability \diam \whp) }\whp .
Revised:  Specifically, we } prove that the rainbow connectivity of G satisfies rc(G) \sim max %DIFDELCMD < {%%% Z_1,diameter (G) with high probability \whp . Here Z_1 is the number of vertices in G whose degree equals 1 and the diameter of G is asymptotically equal to logn/loglogn with high probability \diam \whp) }\whp .
Edit intent: fluency
Original:  Specifically, we } prove that the rainbow connectivity of G satisfies rc(G) \sim max set%DIFDELCMD < {%%% Z_1,diameter (G)  with high probability \whp . Here Z_1 is the number of vertices in G whose degree equals 1 and the diameter of G is asymptotically equal to logn/loglogn with high probability \diam \whp) }\whp .
Revised:  Specifically, we } prove that the rainbow connectivity of G satisfies rc(G) \sim max set%DIFDELCMD < {%%% Z_1,diameter (G) with high probability (\whp . Here Z_1 is the number of vertices in G whose degree equals 1 and the diameter of G is asymptotically equal to logn/loglogn with high probability \diam \whp) }\whp .
Edit intent: fluency
Original:  Specifically, we } prove that the rainbow connectivity of G satisfies rc(G) \sim max set%DIFDELCMD < {%%% Z_1,diameter (G)  with high probability \whp . Here Z_1 is the number of vertices in G whose degree equals 1 and the diameter of G is asymptotically equal to logn/loglogn with high probability \diam \whp) }\whp .
Revised:  Specifically, we } prove that the rainbow connectivity of G satisfies rc(G) \sim max set%DIFDELCMD < {%%% Z_1,diameter (G) with high probability \whp) . Here Z_1 is the number of vertices in G whose degree equals 1 and the diameter of G is asymptotically equal to logn/loglogn with high probability \diam \whp) }\whp .
Edit intent: fluency
Original: A new size-independent indicator of scientific publication prestige, the SJR2 indicator, is proposed.
Revised: A new size-independent indicator of scientific journal prestige, the SJR2 indicator, is proposed.
Edit intent: clarity