wanyu/IteraTeR_v2 huggingface dataset:
Original:  We also found that the ratio of vectors-to-host in the community (i) crucially influences the infection spread, (ii) regulates a percolating phase transition in the  parasite transmission and (iii) increases the infection rate in hosts.
Revised:  We also find that the ratio of vectors-to-host in the community (i) crucially influences the infection spread, (ii) regulates a percolating phase transition in the parasite transmission and (iii) increases the infection rate in hosts.
Edit intent: fluency
Original:  We also found that the ratio of vectors-to-host in the community (i) crucially influences the infection spread, (ii) regulates a percolating phase transition in the  parasite transmission and (iii) increases the infection rate in hosts.
Revised:  We also found that the ratio of vectors-to-host in the community (i) crucially influences the infection spread, (ii) regulates a percolating phase transition in the rate of parasite transmission and (iii) increases the infection rate in hosts.
Edit intent: clarity
Original:  Through the study of the multiplex cartography and immunisation experiments , we show that the multiplex structure can be fundamental in outlining the role that each host species plays in parasite transmission in a given ecosystem.
Revised:  Through the study of the multiplex cartography and immunisation experiments , we show that the multiplex topology is fundamental in outlining the role that each host species plays in parasite transmission in a given ecosystem.
Edit intent: clarity
Original:  We also show that the time needed to infect all the nodes in empirical ecological scenarios is minimised when both transmission mechanisms have similar importance .
Revised:  We also show that the multiplex models provide a richer phenomenology in terms of parasite spreading dynamics compared to mono-layer models. Our work opens new challenges and provides new quantitative tools for modelling multi-channel spreading in networked systems .
Edit intent: coherence
Original:  This is not appropriate for taxa that have been densely sampled across evolutionary time and may be in a direct ancestral relationship  .
Revised:  This is not appropriate if the taxa have been densely sampled across evolutionary time and may be in a direct ancestral relationship .
Edit intent: fluency
Original:  On average, internal branches in the FJ-BIC tree have higher bootstrap support than branches in the leaf-labeled bifurcating tree constructed using RAxML. 36 \% and 25\% of the internal branches in the FJ-BIC tree and RAxML tree, \\%DIF > and 25\\% of the internal branches in the FJ-BIC tree and RAxML tree, respectively, have bootstrap support greater than 70 \%.
Revised:  On average, internal branches in the FJ-BIC tree have higher bootstrap support than branches in the leaf-labeled bifurcating tree constructed using RAxML. 36 \\%DIF > and 25\\% of the internal branches in the FJ-BIC tree and RAxML tree, respectively, have bootstrap support greater than 70 \%.
Edit intent: fluency
Original:  To the best of our \\%DIF > . To the best of our knowledge the method presented here is the first attempt at modeling the evolutionary relationships of densely sampled pathogens using generally labeled trees.
Revised:  To the best of our \\%DIF > . To the best of our knowledge the method presented here is the first attempt at modeling evolutionary relationships using generally labeled trees.
Edit intent: clarity
Original: We discuss  two-dimensional generalizations of the familiar Lyndon-Sch\"utzenberger theorem for words.
Revised: We discuss several two-dimensional generalizations of the familiar Lyndon-Sch\"utzenberger theorem for words.
Edit intent: clarity
Original:  We define the notion of primitive array (as one that cannot be expressed as the repetition of smaller arrays).
Revised:  We consider the notion of primitive array (as one that cannot be expressed as the repetition of smaller arrays).
Edit intent: clarity
Original:  We show that one can test primitivity and compute the primitive root  in linear time.
Revised:  Finally, we show that one can test primitivity and compute the primitive root in linear time.
Edit intent: coherence
Original:  Precisely, we substitute the random rotation in the standard cross-polytope scheme for a fast Johnson-Lindenstrauss transform followed by lifted rotation to reduce the number of hash computations from O(d^2) to O(d \ln d).
Revised:  Precisely, we substitute the random rotation in the standard cross-polytope scheme for a fast Johnson-Lindenstrauss transform followed by lifted rotation to reduce the time for hash computations from O(d^2) to O(d \ln d).
Edit intent: clarity
Original: We provide a variant of cross-polytope locality sensitive hashing with respect to angular distance which is both optimal in asymptotic sensitivity and provably fast.
Revised: We provide a variant of cross-polytope locality sensitive hashing with respect to angular distance which is provably optimal in asymptotic sensitivity and provably fast.
Edit intent: clarity
Original:  Precisely, we substitute the random rotation in the standard cross-polytope scheme for a fast Johnson-Lindenstrauss transform followed by lifted rotation to reduce the time for hash computations from O(d ^2) to \mathcal{O \ln d ) . This builds on a recent result in ( Andoni, Indyk, Laarhoven, Razenshteyn, Schmidt, 2015) by providing an LSH scheme for angular distance which is not only optimal in asymptotic sensitivity , but also fast .
Revised:  Precisely, we substitute the random rotation in the standard cross-polytope scheme for a fast Johnson-Lindenstrauss transform followed by lifted rotation to reduce the time for hash computations from O(d \ln d ) . This builds on a recent result in ( Andoni, Indyk, Laarhoven, Razenshteyn, Schmidt, 2015) by providing an LSH scheme for angular distance which is not only optimal in asymptotic sensitivity , but also fast .
Edit intent: clarity
Original:  Precisely, we substitute the random rotation in the standard cross-polytope scheme for a fast Johnson-Lindenstrauss transform followed by lifted rotation to reduce the time for hash computations from O(d ^2) to \mathcal{O \ln d ) . This builds on a recent result in ( Andoni, Indyk, Laarhoven, Razenshteyn, Schmidt, 2015) by providing an LSH scheme for angular distance which is not only optimal in asymptotic sensitivity , but also fast .
Revised:  Precisely, we substitute the random rotation in the standard cross-polytope scheme for a fast Johnson-Lindenstrauss transform followed by lifted rotation to reduce the time for hash computations from O(d ^2) to \mathcal{O \ln d ) hash computation time. Building on a recent result in ( Andoni, Indyk, Laarhoven, Razenshteyn, Schmidt, 2015) by providing an LSH scheme for angular distance which is not only optimal in asymptotic sensitivity , but also fast .
Edit intent: clarity
Original:  Precisely, we substitute the random rotation in the standard cross-polytope scheme for a fast Johnson-Lindenstrauss transform followed by lifted rotation to reduce the time for hash computations from O(d ^2) to \mathcal{O \ln d ) . This builds on a recent result in ( Andoni, Indyk, Laarhoven, Razenshteyn, Schmidt, 2015) by providing an LSH scheme for angular distance which is not only optimal in asymptotic sensitivity , but also fast .
Revised:  Precisely, we substitute the random rotation in the standard cross-polytope scheme for a fast Johnson-Lindenstrauss transform followed by lifted rotation to reduce the time for hash computations from O(d ^2) to \mathcal{O \ln d ) . This builds on a recent result (by Andoni, Indyk, Laarhoven, Razenshteyn, Schmidt, 2015) by providing an LSH scheme for angular distance which is not only optimal in asymptotic sensitivity , but also fast .
Edit intent: fluency
Original:  Discrete-event network simulation is a useful tool for researchers and will no doubt be invaluable for evaluating novel 5G protocols and systems from an end-to-end perspective.
Revised:  Discrete-event network simulation will be an invaluable tool for researchers to evaluate novel 5G protocols and systems from an end-to-end perspective.
Edit intent: clarity
Original:  Channel models are provided along with a configurable physical and MAC-layer implementation, which can be interfaced with the higher-layer protocols and core network model from the ns-3 LTE module for simulating end-to-end connectivity.
Revised:  Channel models are provided along with a configurable physical and MAC-layer implementation, which can be interfaced with the higher-layer protocols and core network model from the ns-3 LTE module to simulate end-to-end connectivity.
Edit intent: fluency
Original: The aim of this study is to compare the growth speed of different populations of cells measured by their Malthus parameter.
Revised: The aim of this study is to compare the growth speed of different cell populations measured by their Malthus parameter.
Edit intent: clarity
Original:  A first population (of reference) is composed of cells all aging or growing at the same rate \bar  . A second population (with variability) is composed of cells each aging or growing at a rate v drawn according to a non-degenerated distribution \rho with mean \bar  .
Revised:  A first population (of reference) is composed of cells all aging or growing at the same rate \bar v . A second population (with variability) is composed of cells each aging or growing at a rate v drawn according to a non-degenerated distribution \rho with mean \bar .
Edit intent: fluency
Original:  A first population (of reference) is composed of cells all aging or growing at the same rate \bar  . A second population (with variability) is composed of cells each aging or growing at a rate v drawn according to a non-degenerated distribution \rho with mean \bar  .
Revised:  A first population (of reference) is composed of cells all aging or growing at the same rate \bar . A second population (with variability) is composed of cells each aging or growing at a rate v drawn according to a non-degenerated distribution \rho with mean \bar v .
Edit intent: fluency
Original:  In a second part, numerical answers  based on stochastic simulations  are derived for the size-structured model.
Revised:  In a second part, numerical answers -- based on stochastic simulations are derived for the size-structured model.
Edit intent: fluency
Original:  In a second part, numerical answers  based on stochastic simulations  are derived for the size-structured model.
Revised:  In a second part, numerical answers based on stochastic simulations -- are derived for the size-structured model.
Edit intent: fluency
Original:  It appears numerically that for experimentally plausible division rates the population with variability proliferates more slowly than the population of reference  .
Revised:  It appears numerically that the population with variability proliferates more slowly than the population of reference .
Edit intent: clarity
Original:  It appears numerically that for experimentally plausible division rates the population with variability proliferates more slowly than the population of reference  .
Revised:  It appears numerically that for experimentally plausible division rates the population with variability proliferates more slowly than the population of reference (for experimentally plausible division rates) .
Edit intent: clarity
Original:  The decrease in the Malthus parameter we measure, around 2\% for distributions \rho with realistic coefficients of variations around 15-20 \%, is determinant since it controls the exponential \\%DIF > , is determinant since it controls the {\it  growth of the whole population.
Revised:  The decrease in the Malthus parameter we measure, around 2\% for distributions \rho with realistic coefficients of variations around 15-20 \\%DIF > , is determinant since it controls the {\it growth of the whole population.
Edit intent: clarity
Original:  The decrease in the Malthus parameter we measure, around 2\% for distributions \rho with realistic coefficients of variations around 15-20 \%, is determinant since it controls the exponential \\%DIF > , is determinant since it controls the {\it  growth of the whole population.
Revised:  The decrease in the Malthus parameter we measure, around 2\% for distributions \rho with realistic coefficients of variations around 15-20 \%, is determinant since it controls the exponential \\%DIF > , is determinant since it controls the {\it exponential growth of the whole population.
Edit intent: clarity
Original:  On the other hand, in cancer immunity, the linear model leads to an expression for the lifetime risk, which accounts for both the  carcinogens (endogenous or external) and the immune response.
Revised:  On the other hand, in cancer immunity, the linear model leads to an expression for the lifetime risk, which accounts for both the effects of carcinogens (endogenous or external) and the immune response.
Edit intent: clarity
Original: I use simple ideas, endowed from mathematical control theory and from qualitative theory of differential equations, in order to analyze in general grounds the human immune system.
Revised: Simple ideas, endowed from mathematical control theory and from qualitative theory of differential equations, in order to analyze in general grounds the human immune system.
Edit intent: coherence
Original: I use simple ideas, endowed from mathematical control theory and from qualitative theory of differential equations, in order to analyze in general grounds the human immune system.
Revised: I use simple ideas, endowed from the mathematical theory of control, are used in order to analyze in general grounds the human immune system.
Edit intent: clarity
Original:  The simplest model, in which the response is proportional to the pathogen load, leads to the condition that the annihilation rate of pathogens in any tissue should be greater than the pathogen's average rate of growth.
Revised:  The simplest model, in which the response is proportional to the load, the annihilation rate of pathogens in any tissue should be greater than the pathogen's average rate of growth.
Edit intent: clarity
Original:  When nonlinearities are added, a reference value for the number of pathogens  and a stability condition , relating strength of regular threats, barrier height and annihilation rate , emerge .
Revised:  When nonlinearities are added, a reference value for the number of pathogens is set, and a stability condition , relating strength of regular threats, barrier height and annihilation rate , emerge .
Edit intent: clarity
Original:  When nonlinearities are added, a reference value for the number of pathogens  and a stability condition , relating strength of regular threats, barrier height and annihilation rate , emerge .
Revised:  When nonlinearities are added, a reference value for the number of pathogens and a stability condition emerges, which relates strength of regular threats, barrier height and annihilation rate , emerge .
Edit intent: coherence
Original:  When nonlinearities are added, a reference value for the number of pathogens  and a stability condition , relating strength of regular threats, barrier height and annihilation rate , emerge .
Revised:  When nonlinearities are added, a reference value for the number of pathogens and a stability condition , relating strength of regular threats, barrier height and annihilation rate .
Edit intent: coherence
Original:  Vulnerabilities in web applications allow malicious actors to access and / or modify restricted data.
Revised:  Vulnerabilities in web and attack at his / or modify restricted data.
Edit intent: clarity
Original:  Moreover, an attacker can explore a deployed service on the web and attack at his/her own leisure.
Revised:  An attacker can explore a deployed service on the web and attack at his/her own leisure.
Edit intent: coherence
Original:  Although Moving Target Defense (MTD) in web applications is an effective mechanism to nullify this advantage of their reconnaissance , the framework demands a good switching strategy when switching between multiple configurations for its web-stack.
Revised:  Moving Target Defense (MTD) in web applications is an effective mechanism to nullify this advantage of their reconnaissance , the framework demands a good switching strategy when switching between multiple configurations for its web-stack.
Edit intent: coherence
Original:  Although Moving Target Defense (MTD) in web applications is an effective mechanism to nullify this advantage of their reconnaissance , the framework demands a good switching strategy when switching between multiple configurations for its web-stack.
Revised:  Although Moving Target Defense (MTD) in web applications is an effective mechanism to nullify this advantage of their reconnaissance but the framework demands a good switching strategy when switching between multiple configurations for its web-stack.
Edit intent: coherence
Original:  To incorporate this model into a real system, we propose an automated system for generating attack sets of Common Vulnerabilities and Exposures (CVEs) for input attacker types with predefined capabilities.
Revised:  To incorporate this model into a real system, we develop an automated system for generating attack sets of Common Vulnerabilities and Exposures (CVEs) for input attacker types with predefined capabilities.
Edit intent: clarity
Original:  Also, with our model, we address the issue of prioritizing vulnerabilities that when fixed, improves the security of the MTD system.
Revised:  We also address the issue of prioritizing vulnerabilities that when fixed, improves the security of the MTD system.
Edit intent: clarity
Original: Understanding the ways in which local network structures are formed and organized is a fundamental problem in network science.
Edit intent: clarity
Original:  However, what influence the diverse structures formed by common neighbors have on link formation is much less well understood .
Revised:  However, what influence the diverse structures embedded in common neighbors have on link formation is much less well understood .
Edit intent: clarity
Original:  However, what influence the diverse structures formed by common neighbors have on link formation is much less well understood .
Revised:  However, what influence the diverse structures formed by common neighbors have on link formation is much less well-understood .
Edit intent: coherence
Original:  To explore this problem, we begin by formally defining the structural diversity of common neighborhoods.
Revised:  To explore this problem, we begin by characterizing the structural diversity of common neighborhoods.
Edit intent: clarity
Original: The increasingly dense deployments of CSMA networks (e.g., WiFi, Zigbee) arising from applications of Internet-of-things call for an improvement to mitigate the interference among simultaneous transmitting wireless devices.
Revised: The increasingly dense deployments of wireless CSMA networks arising from applications of Internet-of-things call for an improvement to mitigate the interference among simultaneous transmitting wireless devices.
Edit intent: clarity
Original:  For cost efficiency and backward compatibility with legacy transceiver hardware, a simple approach to address interference is by appropriately configuring the carrier sensing thresholds in  CSMA protocols, particularly in dense wireless networks.
Revised:  For cost efficiency and backward compatibility with legacy transceiver hardware, a simple approach to address interference is by appropriately configuring the carrier sensing thresholds in wireless CSMA protocols, particularly in dense wireless networks.
Edit intent: fluency
Original:  We provide a comprehensive study for two effective  CSMA protocols: Cumulative-interference-Power Carrier Sensing and Incremental-interference-Power Carrier Sensing, considering two aspects: (1) static approach that sets a universal carrier sensing threshold for ensuring interference-safe transmissions regardless of network topology, and (2) adaptive approach that adjusts the carrier sensing thresholds dynamically based on the feedback of nearby transmissions.
Revised:  We provide a comprehensive study for two effective wireless CSMA protocols: Cumulative-interference-Power Carrier Sensing and Incremental-interference-Power Carrier Sensing, considering two aspects: (1) static approach that sets a universal carrier sensing threshold for ensuring interference-safe transmissions regardless of network topology, and (2) adaptive approach that adjusts the carrier sensing thresholds dynamically based on the feedback of nearby transmissions.
Edit intent: clarity
Original:  We provide a comprehensive study for two effective  CSMA protocols: Cumulative-interference-Power Carrier Sensing and Incremental-interference-Power Carrier Sensing, considering two aspects: (1) static approach that sets a universal carrier sensing threshold for ensuring interference-safe transmissions regardless of network topology, and (2) adaptive approach that adjusts the carrier sensing thresholds dynamically based on the feedback of nearby transmissions.
Revised:  We provide a comprehensive study for two effective CSMA protocols: Cumulative-interference-Power Carrier Sensing and Incremental-interference-Power Carrier Sensing, in two aspects: (1) static approach that sets a universal carrier sensing threshold for ensuring interference-safe transmissions regardless of network topology, and (2) adaptive approach that adjusts the carrier sensing thresholds dynamically based on the feedback of nearby transmissions.
Edit intent: clarity
Original:  We provide a comprehensive study for two effective  CSMA protocols: Cumulative-interference-Power Carrier Sensing and Incremental-interference-Power Carrier Sensing, considering two aspects: (1) static approach that sets a universal carrier sensing threshold for ensuring interference-safe transmissions regardless of network topology, and (2) adaptive approach that adjusts the carrier sensing thresholds dynamically based on the feedback of nearby transmissions.
Revised:  We provide a comprehensive study for two effective CSMA protocols: Cumulative-interference-Power Carrier Sensing and Incremental-interference-Power Carrier Sensing, considering two aspects: (1) static approach that sets a universal carrier sensing threshold to ensure interference-safe transmissions regardless of network topology, and (2) adaptive approach that adjusts the carrier sensing thresholds dynamically based on the feedback of nearby transmissions.
Edit intent: fluency
Original: Brain regions are often topographically connected: nearby locations in one brain area connect with nearby locations in another area.
Revised: Brain regions are often topographically connected: nearby locations within one brain area connect with nearby locations in another area.
Edit intent: clarity
Original:  Here, we introduce principled, fully data-driven methods for mapping connectopies using functional magnetic resonance imaging (fMRI) data acquired at rest by combining spectral embedding of voxel-wise connectivity 'fingerprints' with a novel approach to spatial statistical inference.
Revised:  Here, we propose principled, fully data-driven methods for mapping connectopies using functional magnetic resonance imaging (fMRI) data acquired at rest by combining spectral embedding of voxel-wise connectivity 'fingerprints' with a novel approach to spatial statistical inference.
Edit intent: clarity
Original:  We applied the methods in human primary motor cortex and show that it can trace biologically plausible, overlapping connectopies in individual subjects with exceptionally high reproducibility .
Revised:  We applied the approach in human primary motor cortex and show that it can trace biologically plausible, overlapping connectopies in individual subjects with exceptionally high reproducibility .
Edit intent: clarity