wanyu/IteraTeR_v2 huggingface dataset:
Original: Aiming at the paucity of urban parcels in developing countries in general and Chinain particular , this paper proposes a method to automatically identify and characterize parcels (AICP) with ubiquitous available OpenStreetMap (OSM) and Points of Interest ( POIs) . Parcels are the basic spatial units for fine-scale urban modeling, urban studies, as well as spatial planning.
Revised: Aiming at the paucity of urban parcels in developing countries in general and Chinain particular , this paper proposes a method to automatically identify and characterize parcels (AICP) with OpenStreetMap (OSM) and Points of Interest ( POIs) . Parcels are the basic spatial units for fine-scale urban modeling, urban studies, as well as spatial planning.
Edit intent: clarity
Original: Aiming at the paucity of urban parcels in developing countries in general and Chinain particular , this paper proposes a method to automatically identify and characterize parcels (AICP) with ubiquitous available OpenStreetMap (OSM) and Points of Interest ( POIs) . Parcels are the basic spatial units for fine-scale urban modeling, urban studies, as well as spatial planning.
Revised: Aiming at the paucity of urban parcels in developing countries in general and Chinain particular , this paper proposes a method to automatically identify and characterize parcels (AICP) with ubiquitous available OpenStreetMap (OSM) and Points of Interest ( POI) data . Parcels are the basic spatial units for fine-scale urban modeling, urban studies, as well as spatial planning.
Edit intent: clarity
Original:  In this note, we give an explicit construction of such a collection of size O(n ^{1/2+ \epsilon } ) for every \epsilon>0 , which improves the O(n^{2/3}) bound shown in the previous work by the second author [Disc.
Revised:  In this note, we give an explicit construction of such a collection of size n ^{1/2+ \epsilon } ) for every \epsilon>0 , which improves the O(n^{2/3}) bound shown in the previous work by the second author [Disc.
Edit intent: fluency
Original:  In this note, we give an explicit construction of such a collection of size O(n ^{1/2+ \epsilon } ) for every \epsilon>0 , which improves the O(n^{2/3}) bound shown in the previous work by the second author [Disc.
Revised:  In this note, we give an explicit construction of such a collection of size O(n ^{1/2+ \epsilon } , which improves the O(n^{2/3}) bound shown in the previous work by the second author [Disc.
Edit intent: coherence
Original:  In this note, we give an explicit construction of such a collection of size O(n ^{1/2+ \epsilon } ) for every \epsilon>0 , which improves the O(n^{2/3}) bound shown in the previous work by the second author [Disc.
Revised:  In this note, we give an explicit construction of such a collection of size O(n ^{1/2+ \epsilon } ) for every \epsilon>0 , which improves the O(n^{2/3}) bound shown in the previous work [Disc.
Edit intent: clarity
Original:  a construction of n \times n 0/1 matrices of rank O(n ^{1/2+ \epsilon%DIFDELCMD < \MBLOCKRIGHTBRACE%%%  ) which have a fooling set of size n, i.e., the gap between them can be at least almost quadratic, and (ii)
Revised:  a construction of n \times n 0/1 matrices of rank n ^{1/2+ \epsilon%DIFDELCMD < \MBLOCKRIGHTBRACE%%% ) which have a fooling set of size n, i.e., the gap between them can be at least almost quadratic, and (ii)
Edit intent: clarity
Original:  a construction of n \times n 0/1 matrices of rank O(n ^{1/2+ \epsilon%DIFDELCMD < \MBLOCKRIGHTBRACE%%%  ) which have a fooling set of size n, i.e., the gap between them can be at least almost quadratic, and (ii)
Revised:  a construction of n \times n 0/1 matrices of rank O(n ^{1/2+ \epsilon%DIFDELCMD < \MBLOCKRIGHTBRACE%%% ) which have a fooling set of size n, i.e., the gap between rank and fooling set size can be at least almost quadratic, and (ii)
Edit intent: clarity
Original:  an improved lower bound ( 2-\epsilon) \log N on the nondeterministic communication complexity of the clique vs. independent set problem, which almost matches the best known lower bound on the deterministic version of the problem shown by Kushilevitz, Linial and Ostrovsky [Combinatorica, 1999].
Revised:  an improved lower bound ( 2-\epsilon) \log N on the nondeterministic communication complexity of the clique vs. independent set problem, which matches the best known lower bound on the deterministic version of the problem shown by Kushilevitz, Linial and Ostrovsky [Combinatorica, 1999].
Edit intent: clarity
Original:  By applying our modelto concrete biological examples with real experimental data, we show that cancer cell plasticity plays an essential role in transient regulation of cancer heterogeneity.
Revised:  Furthermore, according to the transient analysis of our model, it is found that cancer cell plasticity plays an essential role in transient regulation of cancer heterogeneity.
Edit intent: clarity
Original:  Here we present an instrument to simultaneously manipulates neural activity via Channelrhodopsin, monitors neural response via GCaMP3, and observes behavior in freely moving C. elegans.
Revised:  Here we present an instrument to simultaneously manipulate neural activity via Channelrhodopsin, monitors neural response via GCaMP3, and observes behavior in freely moving C. elegans.
Edit intent: fluency
Original:  Here we present an instrument to simultaneously manipulates neural activity via Channelrhodopsin, monitors neural response via GCaMP3, and observes behavior in freely moving C. elegans.
Revised:  Here we present an instrument to simultaneously manipulates neural activity via Channelrhodopsin, monitor neural response via GCaMP3, and observes behavior in freely moving C. elegans.
Edit intent: fluency
Original:  Here we present an instrument to simultaneously manipulates neural activity via Channelrhodopsin, monitors neural response via GCaMP3, and observes behavior in freely moving C. elegans.
Revised:  Here we present an instrument to simultaneously manipulates neural activity via Channelrhodopsin, monitors neural response via GCaMP3, and observe behavior in freely moving C. elegans.
Edit intent: fluency
Original:  In the computation of  CTT values, three identified important context dimensions, including Product Category, Transaction Amount and Transaction Time , are taken into account.
Revised:  In the computation of three CTT values, three identified important context dimensions, including Product Category, Transaction Amount and Transaction Time , are taken into account.
Edit intent: fluency
Original:  In the computation of  CTT values, three identified important context dimensions, including Product Category, Transaction Amount and Transaction Time , are taken into account.
Revised:  In the computation of CTT values, the identified three important context dimensions, including Product Category, Transaction Amount and Transaction Time , are taken into account.
Edit intent: fluency
Original:  In the computation of  CTT values, three identified important context dimensions, including Product Category, Transaction Amount and Transaction Time , are taken into account.
Revised:  In the computation of CTT values, three identified important context dimensions, including product category, transaction amount and transaction time , are taken into account.
Edit intent: fluency
Original:  In order to promptly answer buyers' CTT requests  , we then propose new index schemes CMK-tree and CMK-treeRS.
Revised:  In order to promptly answer buyers' CTT requests , we then propose a new index scheme CMK-tree and CMK-treeRS.
Edit intent: fluency
Original:   Finally, the experimental results illustrate that they are superior in efficiency of computing CTT values to all three existing approaches in the literature.
Revised:  Finally, the experimental results illustrate that they are superior in efficiency for computing CTT values to all three existing approaches in the literature.
Edit intent: clarity
Original:  In addition, with significantly reduced storage space, the CMK-treeRS approach can further improve the efficiency in computing CTT values .
Revised:  In addition, though with reduced storage space, the CMK-treeRS approach can further improve the efficiency in computing CTT values .
Edit intent: clarity
Original:  In addition, with significantly reduced storage space, the CMK-treeRS approach can further improve the efficiency in computing CTT values .
Revised:  In addition, with significantly reduced storage space, the CMK-treeRS approach can further improve the performance in answering buyers' CTT queries .
Edit intent: clarity
Original: We introduce a simple procedure of multivariate signal analysis to uncover the connectivity structure among cells composing a living tissue and describe how to apply it for extracting insight on the effect of drugs in the tissue.
Revised: We introduce a simple procedure of multivariate signal analysis to uncover the functional connectivity among cells composing a living tissue and describe how to apply it for extracting insight on the effect of drugs in the tissue.
Edit intent: clarity
Original:  The procedure is based in the covariance matrix of time resolved activity signals.
Revised:  The procedure is based on the covariance matrix of time resolved activity signals.
Edit intent: fluency
Original:  By determining the time-lag that maximizes covariance  one derives the weight of the corresponding connection between cells.
Revised:  By determining the time-lag that maximizes covariance , one derives the weight of the corresponding connection between cells.
Edit intent: fluency
Original:  Introducing simple constraints, it is possible to conclude if pairs of cells are connected or not and in which direction.
Revised:  Introducing simple constraints, it is possible to conclude whether pairs of cells are connected or not and in which direction.
Edit intent: fluency
Original:  After testing the method against synthetic data we apply it to study  propagation of Ca^{2+} waves in astrocytes  , with the aim of uncovering the cell connectivity structure .
Revised:  After testing the method against synthetic data we apply it to study propagation of Ca^{2+} waves in astrocytes , with the aim of uncovering the functional cellular connectivity network .
Edit intent: clarity
Original:  Our method shows to be particularly suited for this type of networking signal propagation where signals are pulse-like and have short time-delays, and is shown to be superior to standard methods, namely a multivariate Granger algorithm.
Revised:  Our method proves to be particularly suited for this type of networking signal propagation where signals are pulse-like and have short time-delays, and is shown to be superior to standard methods, namely a multivariate Granger algorithm.
Edit intent: fluency
Original:  Finally, based the statistical analysis of the connection weight distribution, we propose simple measures for accessing the impact of drugs in the functional connectivity between cells.
Revised:  Finally, based the statistical analysis of the connection weight distribution, we propose simple measures for assessing the impact of drugs in the functional connectivity between cells.
Edit intent: clarity
Original:  Finally, based the statistical analysis of the connection weight distribution, we propose simple measures for accessing the impact of drugs in the functional connectivity between cells.
Revised:  Finally, based the statistical analysis of the connection weight distribution, we propose simple measures for accessing the impact of drugs on the functional connectivity between cells.
Edit intent: fluency
Original:  The real time interaction of the Gag, RNA and lipid leading to the formation of minivesicles is measured in real time using confocal microscopy.
Revised:  Real time interaction of the Gag, RNA and lipid leading to the formation of minivesicles is measured in real time using confocal microscopy.
Edit intent: clarity
Original:  The real time interaction of the Gag, RNA and lipid leading to the formation of minivesicles is measured in real time using confocal microscopy.
Revised:  The real time interaction of Gag, RNA and lipid leading to the formation of minivesicles is measured in real time using confocal microscopy.
Edit intent: fluency
Original:  The real time interaction of the Gag, RNA and lipid leading to the formation of minivesicles is measured in real time using confocal microscopy.
Revised:  The real time interaction of the Gag, RNA and lipid leading to the formation of mini-vesicles was measured using confocal microscopy.
Edit intent: fluency
Original:  The bud formation and the decrease in GUV size were found to be proportional to the Gag concentration.
Revised:  The bud formation and decrease in GUV size were found to be proportional to the Gag concentration.
Edit intent: fluency
Original:  The bud formation and the decrease in GUV size were found to be proportional to the Gag concentration.
Revised:  The bud formation and the decrease in GUV size were proportional to Gag concentration.
Edit intent: clarity
Original:  We also give explicit subcodes of folded Reed-Solomon (RS) codes where the folding order is small that are list-decodable  with optimal redundancy, motivated by the fact that list decoding RS codes reduces to list decoding such folded RS codes.
Revised:  We also give explicit subcodes of folded Reed-Solomon (RS) codes with small folding order that are list-decodable with optimal redundancy, motivated by the fact that list decoding RS codes reduces to list decoding such folded RS codes.
Edit intent: clarity
Original:  However, as we only list decode a subcode of such folded RS codes, the Johnson radius continues to be the best known error fraction for list decoding RS codes.
Revised:  However, as we only list decode a subcode of these codes, the Johnson radius continues to be the best known error fraction for list decoding RS codes.
Edit intent: clarity
Original:  How does this chaos manifests in the neural code - that is, the spike patterns that the network will produce in response to an input signal?
Revised:  How does this chaos manifest in the neural code - that is, the spike patterns that the network will produce in response to an input signal?
Edit intent: fluency
Original:  How does this chaos manifests in the neural code - that is, the spike patterns that the network will produce in response to an input signal?
Revised:  How does this chaos manifests in the neural code - that is, the spike patterns that such a network produces in response to an input signal?
Edit intent: clarity
Original:  We derive a bound for the entropy of multicell spike pattern distributions in large recurrent networks of spiking neurons responding to fluctuating input signals .
Revised:  To answer this, we derive a bound for the entropy of multicell spike pattern distributions in large recurrent networks of spiking neurons responding to fluctuating input signals .
Edit intent: coherence
Original:  We derive a bound for the entropy of multicell spike pattern distributions in large recurrent networks of spiking neurons responding to fluctuating input signals .
Revised:  We derive a bound for the entropy of multi-cell spike pattern distributions in large recurrent networks of spiking neurons responding to fluctuating input signals .
Edit intent: fluency
Original:  We derive a bound for the entropy of multicell spike pattern distributions in large recurrent networks of spiking neurons responding to fluctuating input signals .
Revised:  We derive a bound for the entropy of multicell spike pattern distributions in large recurrent networks of spiking neurons responding to fluctuating inputs .
Edit intent: clarity
Original:  We find that the spike pattern entropy is an order of magnitude lower than what would be extrapolated from single cells - despite network coupling that becomes vanishingly sparse as network size grows  . Moreover, the level of spike variability is found to be strongly dependent on temporal features of  inputs.
Revised:  We find that the spike pattern entropy is an order of magnitude lower than what would be extrapolated from single cells . This holds despite the fact that network coupling becomes vanishingly sparse as network size grows . Moreover, the level of spike variability is found to be strongly dependent on temporal features of inputs.
Edit intent: clarity
Original:  We find that the spike pattern entropy is an order of magnitude lower than what would be extrapolated from single cells - despite network coupling that becomes vanishingly sparse as network size grows  . Moreover, the level of spike variability is found to be strongly dependent on temporal features of  inputs.
Revised:  We find that the spike pattern entropy is an order of magnitude lower than what would be extrapolated from single cells - despite network coupling that becomes vanishingly sparse as network size grows . Moreover, we show how spike pattern entropy is controlled by temporal features of inputs.
Edit intent: clarity
Original:  We find that the spike pattern entropy is an order of magnitude lower than what would be extrapolated from single cells - despite network coupling that becomes vanishingly sparse as network size grows  . Moreover, the level of spike variability is found to be strongly dependent on temporal features of  inputs.
Revised:  We find that the spike pattern entropy is an order of magnitude lower than what would be extrapolated from single cells - despite network coupling that becomes vanishingly sparse as network size grows . Moreover, the level of spike variability is found to be strongly dependent on temporal features of the inputs.
Edit intent: fluency
Original:  First, we propose unordered regular expressions (UREs), essentially regular expressions with unordered concatenation instead of standard concatenation, that define languages of unordered words to model the allowed content of a node (i.e., collections of the labels of children).
Revised:  First, we propose unordered regular expressions (UREs), essentially regular expressions with unordered concatenation instead of standard concatenation, that define languages of unordered words to model the allowed content of a node (i.e., collections of the labels of children).
Edit intent: fluency
Original:  Consequently, we propose a practical and tractable restriction of UREs, disjunctive interval multiplicity expressions (DIMEs).
Revised:  Consequently, we propose a practical and tractable restriction of UREs, disjunctive interval multiplicity expressions (DIMEs).
Edit intent: fluency
Original:  Next, we employ DIMEs to define languages of unordered trees and propose two schema languages: disjunctive interval multiplicity schema (DIMS), and its restriction, disjunction-free interval multiplicity schema (IMS).
Revised:  Next, we employ DIMEs to define languages of unordered trees and propose two schema languages: disjunctive interval multiplicity schema (DIMS), and its restriction, disjunction-free interval multiplicity schema (IMS).
Edit intent: fluency
Original:  We show that this does not extend to directed graphs by exhibiting an infinite class of directed graphs for which the expected absorption time is exponential in the number of vertices.
Revised:  We show that this does not extend to directed graphs by exhibiting an infinite family of directed graphs for which the expected absorption time is exponential in the number of vertices.
Edit intent: clarity
Original: An original  dataset referring to a medium-sized Italian university is implemented for analyzing the determinants of scientific research production at individual level.
Revised: An original dataset referring to a medium sized Italian university is implemented for analyzing the determinants of scientific research production at individual level.
Edit intent: fluency
Original: An original  dataset referring to a medium-sized Italian university is implemented for analyzing the determinants of scientific research production at individual level.
Revised: An original dataset referring to a medium-sized Italian university is implemented in order to analyze the determinants of scientific research production at individual level.
Edit intent: coherence
Original:   Three different indicators , based on the number of publications and/or citations , are considered .
Revised:  Three different indicators - based on the number of publications and/or citations , are considered .
Edit intent: fluency
Original:  Their distributions are highly skewed , displaying an excess of zero-valued observations, thus zero-inflated and hurdle regression models are introduced.
Revised:  Their distributions are highly skewed and display an excess of zero-valued observations, thus zero-inflated and hurdle regression models are introduced.
Edit intent: fluency
Original:  Indeed, a major teaching load does not apparently affect the odds to be a non-active researcher , while it has mixed and very weak effects on publication performance of active researchers.
Revised:  Indeed, a major teaching load does not affect the odds to be a non-active researcher , while it has mixed and very weak effects on publication performance of active researchers.
Edit intent: clarity
Original:  Indeed, a major teaching load does not apparently affect the odds to be a non-active researcher , while it has mixed and very weak effects on publication performance of active researchers.
Revised:  Indeed, a major teaching load does not apparently affect the odds to be a non-active researcher and does not significantly reduce the number of publications for active researchers.
Edit intent: clarity
Original: Genetic Algorithms (GAs) are powerful metaheuristics mostly used in research fields .
Revised: Genetic Algorithms (GAs) are powerful metaheuristic techniques mostly used in research fields .
Edit intent: clarity
Original: Genetic Algorithms (GAs) are powerful metaheuristics mostly used in research fields .
Revised: Genetic Algorithms (GAs) are powerful metaheuristics mostly used in many real-world applications .
Edit intent: clarity
Original:  The sequential execution of GAs needs of considerable computational power  .
Revised:  The sequential execution of GAs requires considerable computational power .
Edit intent: fluency
Original:  Nevertheless, GAs are naturally parallelizable and renting a cluster on Cloud platforms is easy and cheap.
Revised:  Nevertheless, GAs are naturally parallel and accessing a parallel platform such as Cloud is easy and cheap.
Edit intent: clarity
Original:  One of the most common solutions for parallel applications is Apache Hadoop.
Revised:  Apache Hadoop is one of the common services that can be used for parallel applications is Apache Hadoop.
Edit intent: clarity
Original:  What is not simple is developing parallel GAs without facing with the inner workingsof Hadoop .
Revised:  What is not simple without facing its inner workings .
Edit intent: clarity
Original:  In this paper is described a framework for parallel GAs so as to be executed on the Hadoop platform, following the paradigm of MapReduce.
Revised:  In this paper is described a framework for parallel GAs on the Hadoop platform, following the paradigm of MapReduce.
Edit intent: clarity
Original:  The main purpose of this framework is to allow the user to focus on the aspects of GA that are specific to the problem to be addressed, being sure that this task is going to be correctly executed on the cluster with a good performance.
Revised:  The main purpose of this framework is to allow the user to focus on the aspects of GA that are specific to the problem to be addressed, being sure that this task is going to be correctly executed on the Cloud with a good performance.
Edit intent: clarity