wanyu/IteraTeR_v2 huggingface dataset:
Original: This paper explores  methodologies, challenges  and expected advantages related to the use of the Information Centric Network (ICN) technology for federating NoSQL databases.
Revised: This paper explores the methodologies, challenges and expected advantages related to the use of the Information Centric Network (ICN) technology for federating NoSQL databases.
Edit intent: fluency
Original: This paper explores  methodologies, challenges  and expected advantages related to the use of the Information Centric Network (ICN) technology for federating NoSQL databases.
Revised: This paper explores methodologies, challenges , and expected advantages related to the use of the Information Centric Network (ICN) technology for federating NoSQL databases.
Edit intent: fluency
Original: This paper explores  methodologies, challenges  and expected advantages related to the use of the Information Centric Network (ICN) technology for federating NoSQL databases.
Revised: This paper explores methodologies, challenges and expected advantages related to the use of the information-centric network (ICN) technology for federating NoSQL databases.
Edit intent: fluency
Original:  In this work  present an architecture  able to federate NoSQL spatial databases and evaluate its performance , by using a real data set  within a heterogeneous federation formed by MongoDB and CouchBase  database systems.
Revised:  In this work , we present an architecture able to federate NoSQL spatial databases and evaluate its performance , by using a real data set within a heterogeneous federation formed by MongoDB and CouchBase database systems.
Edit intent: fluency
Original:  In this work  present an architecture  able to federate NoSQL spatial databases and evaluate its performance , by using a real data set  within a heterogeneous federation formed by MongoDB and CouchBase  database systems.
Revised:  In this work present an architecture that is able to federate NoSQL spatial databases and evaluate its performance , by using a real data set within a heterogeneous federation formed by MongoDB and CouchBase database systems.
Edit intent: fluency
Original:  In this work  present an architecture  able to federate NoSQL spatial databases and evaluate its performance , by using a real data set  within a heterogeneous federation formed by MongoDB and CouchBase  database systems.
Revised:  In this work present an architecture able to federate spatial databases and evaluate its performance , by using a real data set within a heterogeneous federation formed by MongoDB and CouchBase database systems.
Edit intent: clarity
Original:  In this work  present an architecture  able to federate NoSQL spatial databases and evaluate its performance , by using a real data set  within a heterogeneous federation formed by MongoDB and CouchBase  database systems.
Revised:  In this work present an architecture able to federate NoSQL spatial databases and evaluate its performance using a real data set within a heterogeneous federation formed by MongoDB and CouchBase database systems.
Edit intent: coherence
Original:  In this work  present an architecture  able to federate NoSQL spatial databases and evaluate its performance , by using a real data set  within a heterogeneous federation formed by MongoDB and CouchBase  database systems.
Revised:  In this work present an architecture able to federate NoSQL spatial databases and evaluate its performance , by using a real data set within a heterogeneous federation formed by MongoDB and CouchBase spatial database systems.
Edit intent: fluency
Original:  Building the knowledge-base in the field where we can face more than one spreading process propagating over a network that has more than one layer is a challenging task where the complexity comes from both environments in which the spread happens and from characteristics and interplay of spreads' propagation.
Revised:  Building the knowledge-base in the field where we can face more than one spreading process propagating over a network that has more than one layer is a challenging task , as the complexity comes from both environments in which the spread happens and from characteristics and interplay of spreads' propagation.
Edit intent: coherence
Original:  Building the knowledge-base in the field where we can face more than one spreading process propagating over a network that has more than one layer is a challenging task where the complexity comes from both environments in which the spread happens and from characteristics and interplay of spreads' propagation.
Revised:  Building the knowledge-base in the field where we can face more than one spreading process propagating over a network that has more than one layer is a challenging task where the complexity comes both from the environment in which the spread happens and from characteristics and interplay of spreads' propagation.
Edit intent: fluency
Original: The  visual system is an intricate network of brain regions that enables us to recognize the world around us.
Revised: The human visual system is an intricate network of brain regions that enables us to recognize the world around us.
Edit intent: clarity
Original:  Despite its abundant lateral and feedback connections, human object processing is commonly viewed and studied as a feedforward process.
Revised:  Despite its abundant lateral and feedback connections, object processing is commonly viewed and studied as a feedforward process.
Edit intent: clarity
Original:  Finally, recurrent deep neural network models clearly outperform  feedforward models in terms of their ability to jointly capture the multi-region cortical dynamics  .
Revised:  Finally, recurrent deep neural network models clearly outperform feedforward models in terms of their ability to capture the multi-region cortical dynamics .
Edit intent: clarity
Original:  The prototype of these iterative regularization methods is in the form of second order evolution equation with a linear vanishing damping term, which can be viewed not only as a extension of the asymptotical regularization, but also as a continuous analog of the Nesterov's acceleration scheme.
Revised:  The prototype of these iterative regularization methods is in the form of second order evolution equation with a linear vanishing damping term, which can be viewed not only as an extension of the asymptotical regularization, but also as a continuous analog of the Nesterov's acceleration scheme.
Edit intent: fluency
Original:  The second part of this paper is concerned with the application of the newly developed accelerated iterative regularization methods with a posteriori stopping rule to the diffusion-based bioluminescence tomography, which is modeled as an inverse source problem in elliptic partial differential equations with both Dirichlet and Neumann boundary data  .
Revised:  The second part of this paper is concerned with the application of the newly developed accelerated iterative regularization methods to the diffusion-based bioluminescence tomography, which is modeled as an inverse source problem in elliptic partial differential equations with both Dirichlet and Neumann boundary data .
Edit intent: clarity
Original:  The mapping of the frequent subgraphs gives robust substructures in the graph: if a subgraph is present in the 80 %DIFDELCMD < \\%%% %DIF < of the graphs, then, most probably, it could not be an  artifact of the measurement or the data processing workflow.
Revised:  The mapping of the frequent subgraphs gives robust substructures in the graph: if a subgraph is present in the 80 %DIFDELCMD < \\%%% %DIF < of the graphs, then, most probably, it could not be an \% of the graphs, then, most probably, it could not be an artifact of the measurement or the data processing workflow.
Edit intent: fluency
Original:  We list here the frequent complete subgraphs of the female and the male braingraphs of 414 subjects, each with 463 nodes, with a frequency threshold of 80 %DIFDELCMD < \\%%% %DIF < , and identify  complete subgraphs, which are more frequent in male and female connectomes, respectively .
Revised:  We list here the frequent complete subgraphs of the female and the male braingraphs of 414 subjects, each with 463 nodes, with a frequency threshold of 80 %DIFDELCMD < \\%%% %DIF < , and identify complete subgraphs, which are more frequent in male and 224 complete subgraphs, which are more frequent in female connectomes .
Edit intent: clarity
Original:  We term this behavior as \emph{dynamics concentration as it stems from the fact that the network transfer matrix uniformly converges in probability to a unique dynamic response -- i.e., it concentrates -- determined by the distribution of the random transfer function of each node.
Revised:  We term this behavior as \emph{dynamics concentration as it stems from the fact that the network transfer matrix uniformly converges in probability to a unique dynamic response -- i.e., it concentrates -- determined by the distribution of the random transfer function of each node.
Edit intent: fluency
Original: The ability to achieve coordinated behavior -- engineered or emergent -- on networked systems has attracted widespread interest over several fields.
Revised: The ability to achieve coordinated behavior --engineered or emergent-- on networked systems has attracted widespread interest over several fields.
Edit intent: fluency
Original:  More precisely, we show that for linear networks of nodal random transfer functions, as the networks size and connectivity grows, every node in the network follows the same response to an input or disturbance --irrespectively of the source of this input.
Revised:  More precisely, we show that for linear networks of nodal random transfer functions, as the network size and connectivity grows, every node in the network follows the same response to an input or disturbance --irrespectively of the source of this input.
Edit intent: fluency
Original:  We term this behavior as dynamics concentration as it stems from the fact that the network transfer matrix uniformly converges in probability to a unique dynamic response -- i.e., it concentrates -- determined by the distribution of the random transfer function of each node.
Revised:  We term this behavior as dynamics concentration since it stems from the fact that the network transfer matrix uniformly converges in probability to a unique dynamic response -- i.e., it concentrates -- determined by the distribution of the random transfer function of each node.
Edit intent: coherence
Original:  We term this behavior as dynamics concentration as it stems from the fact that the network transfer matrix uniformly converges in probability to a unique dynamic response -- i.e., it concentrates -- determined by the distribution of the random transfer function of each node.
Revised:  We term this behavior as dynamics concentration as it stems from the fact that the network transfer matrix uniformly converges in probability , i.e., it concentrates -- determined by the distribution of the random transfer function of each node.
Edit intent: clarity
Original:  We term this behavior as dynamics concentration as it stems from the fact that the network transfer matrix uniformly converges in probability to a unique dynamic response -- i.e., it concentrates -- determined by the distribution of the random transfer function of each node.
Revised:  We term this behavior as dynamics concentration as it stems from the fact that the network transfer matrix uniformly converges in probability to a unique dynamic response -- i.e., it concentrates , to a unique dynamic response determined by the distribution of the random transfer function of each node.
Edit intent: fluency
Original:  We further discuss the implications of our analysis in the context of model reduction and robustness  and provide numerical evidence that similar phenomena occur in small deterministic networks over a properly defined frequency band.
Revised:  We further discuss the implications of our analysis in the context of model reduction and robustness , and provide numerical evidence that similar phenomena occur in small deterministic networks over a properly defined frequency band.
Edit intent: fluency
Original: We aim to find agglomerations of U.S. counties that are partitioned by commuting patterns by representing inter-county commuting patterns as a weighted network.
Revised: We find agglomerations of U.S. counties that are partitioned by commuting patterns by representing inter-county commuting patterns as a weighted network.
Edit intent: clarity
Original:  We develop and use a community detection method based on the configuration model to identify significant clusters of nodes in a weighted network that prominently feature self-loops which represent same-county commuting.
Revised:  To do so, we develop a community detection method based on the configuration model to identify significant clusters of nodes in a weighted network that prominently feature self-loops which represent same-county commuting.
Edit intent: coherence
Original:  After we apply this method to county level commuting data from 2010 , we find regions that are significantly different from existing delineations such as Metropolitian Statistical Areas and Megaregions.
Revised:  Application of this method to county level commuting data from 2010 , we find regions that are significantly different from existing delineations such as Metropolitian Statistical Areas and Megaregions.
Edit intent: clarity
Original:  After we apply this method to county level commuting data from 2010 , we find regions that are significantly different from existing delineations such as Metropolitian Statistical Areas and Megaregions.
Revised:  After we apply this method to county level commuting data from 2010 yielded regions that are significantly different from existing delineations such as Metropolitian Statistical Areas and Megaregions.
Edit intent: clarity
Original: We find agglomerations of U.S. counties that are partitioned by commuting patterns by representing inter-county commuting patterns as a weighted network.
Revised: We find agglomerations of U.S. counties by representing inter-county commuting patterns as a weighted network.
Edit intent: clarity
Original: We find agglomerations of U.S. counties that are partitioned by commuting patterns by representing inter-county commuting patterns as a weighted network.
Revised: We find agglomerations of U.S. counties that are partitioned by commuting patterns by representing inter-county commuting as a weighted network.
Edit intent: fluency
Original: We derive a closed form solution for an optimal control of interbank lending subject to terminal probability constraints on the failure of  a bank.
Revised: We derive a closed form solution for an optimal control problem related to an interbank lending schemes subject to terminal probability constraints on the failure of a bank.
Edit intent: clarity
Original:  The solution can be applied to a network of banks providing a general solution when  aforementioned probability constraints are assumed for all the banks in the system .
Revised:  The solution can be applied to a network of banks providing a general solution when the aforementioned probability constraints are assumed for all the banks in the system .
Edit intent: fluency
Original:  The solution can be applied to a network of banks providing a general solution when  aforementioned probability constraints are assumed for all the banks in the system .
Revised:  The solution can be applied to a network of banks providing a general solution when aforementioned probability constraints are assumed for all the banks .
Edit intent: clarity
Original:  We also show a direct method to compute the systemic relevance of any node within the financial networkitself.
Revised:  We also present a direct method to compute the systemic relevance of any node within the financial networkitself.
Edit intent: clarity
Original:  One of the difficulties of reasoning about such programs is due to the peculiarities of floating-point arithmetic: rounding errors, infinities, non-numeric objects (NaNs), signed zeroes, denormal numbers, different rounding modes ... . One possibility to reason about floating-point arithmetic is to model a program computation path by means of a set of ternary constraints of the form z = x op y and use constraint propagation techniques to infer new information on the variables' possible values.
Revised:  One of the difficulties of reasoning about such programs is due to the peculiarities of floating-point arithmetic: rounding errors, infinities, non-numeric objects (NaNs), signed zeroes, denormal numbers, different rounding modes , etc . One possibility to reason about floating-point arithmetic is to model a program computation path by means of a set of ternary constraints of the form z = x op y and use constraint propagation techniques to infer new information on the variables' possible values.
Edit intent: fluency
Original: In this work , we discuss the result of an experiment that wants to track how authors use self-citations in their articles.
Revised: In this article , we discuss the result of an experiment that wants to track how authors use self-citations in their articles.
Edit intent: clarity
Original: In this work , we discuss the result of an experiment that wants to track how authors use self-citations in their articles.
Revised: In this work , we discuss the outcomes of an experiment that wants to track how authors use self-citations in their articles.
Edit intent: clarity
Original:  In particular, we have analysed a subset of all the articles published between 1959 and 2016 in ScienceDirect written by the participants to the 2012-2013 Italian Scientific Habilitation so as to see if their citation habits have changed after 2012 as a consequence of the evaluation guidelines published by ANVUR (the Italian National Agency for the Evaluation of the University and Research Systems) in 2012 that have been used for assessing the quality of scholars' research.
Revised:  In particular, we have analysed a subset of all the articles published between 1959 and 2016 by the participants to the 2012-2013 Italian Scientific Habilitation so as to see if their citation habits have changed after 2012 as a consequence of the evaluation guidelines published by ANVUR (the Italian National Agency for the Evaluation of the University and Research Systems) in 2012 that have been used for assessing the quality of scholars' research.
Edit intent: clarity
Original:  In particular, we have analysed a subset of all the articles published between 1959 and 2016 in ScienceDirect written by the participants to the 2012-2013 Italian Scientific Habilitation so as to see if their citation habits have changed after 2012 as a consequence of the evaluation guidelines published by ANVUR (the Italian National Agency for the Evaluation of the University and Research Systems) in 2012 that have been used for assessing the quality of scholars' research.
Revised:  In particular, we have analysed a subset of all the articles published between 1959 and 2016 in ScienceDirect written by the participants to the 2012 that have been used for assessing the quality of scholars' research.
Edit intent: coherence
Original:  The results showed a clear increasing trend in author self-citations (i.e. those ones in which the citing and the cited bibliographic resources have at least one author in common ) in several of the  academic disciplines considered.
Revised:  The results showed a clear increasing trend in author self-citations (i.e. where the citing article and the cited bibliographic resources have at least one author in common ) in several of the academic disciplines considered.
Edit intent: clarity
Original:  The results showed a clear increasing trend in author self-citations (i.e. those ones in which the citing and the cited bibliographic resources have at least one author in common ) in several of the  academic disciplines considered.
Revised:  The results showed a clear increasing trend in author self-citations (i.e. those ones in which the citing and the cited article share at least one author in common ) in several of the academic disciplines considered.
Edit intent: clarity
Original:  The results showed a clear increasing trend in author self-citations (i.e. those ones in which the citing and the cited bibliographic resources have at least one author in common ) in several of the  academic disciplines considered.
Revised:  The results showed a clear increasing trend in author self-citations (i.e. those ones in which the citing and the cited bibliographic resources have at least one author ) in several of the academic disciplines considered.
Edit intent: clarity
Original: We study the interface of three elements of diffusion: the synergy between contagions, the dormancy rate of each individual contagion, and the multiplex network topology .
Revised: This study examines the interface of three elements of diffusion: the synergy between contagions, the dormancy rate of each individual contagion, and the multiplex network topology .
Edit intent: clarity
Original: We study the interface of three elements of diffusion: the synergy between contagions, the dormancy rate of each individual contagion, and the multiplex network topology .
Revised: We study the interface of three elements during co-contagion diffusion: the synergy between contagions, the dormancy rate of each individual contagion, and the multiplex network topology .
Edit intent: clarity
Original: We study the interface of three elements of diffusion: the synergy between contagions, the dormancy rate of each individual contagion, and the multiplex network topology .
Revised: We study the interface of three elements of diffusion: the synergy between contagions, the dormancy rate of each individual contagion, and the multiplex network topology .
Edit intent: fluency
Original:  The proposed model extends the literature on threshold models, which we use to show the intricate interdependencies between different graph structures.
Revised:  The proposed model extends the literature on threshold models, and demonstrates intricate interdependencies between different graph structures.
Edit intent: clarity
Original:  Our comprehensive simulations show that first, the faster diffusion contagion induces branching on the slower diffusion contagion;
Revised:  Our simulations show that first, the faster diffusion contagion induces branching on the slower diffusion contagion;
Edit intent: clarity
Original:  Our comprehensive simulations show that first, the faster diffusion contagion induces branching on the slower diffusion contagion;
Revised:  Our comprehensive simulations show that first, the faster contagion induces branching on the slower diffusion contagion;
Edit intent: fluency
Original:  Our comprehensive simulations show that first, the faster diffusion contagion induces branching on the slower diffusion contagion;
Revised:  Our comprehensive simulations show that first, the faster diffusion contagion induces branching on the slower contagion;
Edit intent: fluency
Original:  second, there exists a positive relationship between network radius and dormancy in lowering dormancy;
Revised:  second, shorter characteristic path lengths diminish the impact of dormancy in lowering dormancy;
Edit intent: clarity
Original:  third , when two long-range graphs are paired, the faster diffusing contagion depends on both dormancy rates, whereas the slower contagion depends  on its own;
Revised:  third , when two long-range graphs are paired, the faster contagion depends on both dormancy rates, whereas the slower contagion depends on its own;
Edit intent: clarity
Original:  third , when two long-range graphs are paired, the faster diffusing contagion depends on both dormancy rates, whereas the slower contagion depends  on its own;
Revised:  third , when two long-range graphs are paired, the faster diffusing contagion depends on both dormancy rates, whereas the slower contagion depends only on its own;
Edit intent: clarity
Original:  lastly , synergistic contagions are less sensitive to dormancy, and have a wider window to diffuse.
Revised:  fourth , synergistic contagions are less sensitive to dormancy, and have a wider window to diffuse.
Edit intent: fluency