wanyu/IteraTeR_v2 huggingface dataset:
Original:  We acquired resting-state fMRI scans for 43 subjects (27 patients and 16 normal controls, with 2 replicate scans per subject ) and compared the observed FC changes with those obtained in two independent datasets, one made available by the PPMI consortium (91 patients, 18 controls) and a second one by the group of Tao Wu (20 patients, 20 controls) .
Revised:  We acquired resting-state fMRI scans for 43 subjects (27 patients and 16 normal controls, with 2 replicate scans per subject ) and compared the observed FC changes with those obtained in 2 independent datasets, one made available by the PPMI consortium (91 patients, 18 controls) and a second one by the group of Tao Wu (20 patients, 20 controls) .
Edit intent: fluency
Original: The existence of sexual partnerships that overlap in time (concurrent relationships) is believed by some to be a significant contributing factor to the spread of HIV , although this is controversial .
Revised: Sexual partnerships that overlap in time (concurrent relationships) is believed by some to be a significant contributing factor to the spread of HIV , although this is controversial .
Edit intent: clarity
Original: The existence of sexual partnerships that overlap in time (concurrent relationships) is believed by some to be a significant contributing factor to the spread of HIV , although this is controversial .
Revised: The existence of sexual partnerships that overlap in time (concurrent relationships) may play a significant role in the HIV epidemic, but the precise effect is unclear .
Edit intent: clarity
Original:  We derive an edge-based compartmental model which allows us to investigate and compare disease spread in  populations with and without concurrency .
Revised:  We derive edge-based compartmental model which allows us to investigate and compare disease spread in populations with and without concurrency .
Edit intent: fluency
Original:  We derive an edge-based compartmental model which allows us to investigate and compare disease spread in  populations with and without concurrency .
Revised:  We derive an edge-based compartmental models of disease spread in populations with and without concurrency .
Edit intent: clarity
Original:  We see that the effect of concurrency saturates, which leads to the perhaps surprising conclusion that interventions targeting concurrency may be most effective in populations with low to moderate levels of concurrency.
Revised:  We see that the effect of concurrency saturates, which leads to the perhaps surprising conclusion that interventions targeting concurrency may be most effective in populations with low to moderate concurrency.
Edit intent: clarity
Original: Identifying the "heavy hitter" flows or flows with large traffic volumes in the dataplane is important for several applications e.g., flow-size aware routing, DoS detection  and traffic engineering.
Revised: Identifying the "heavy hitter" flows or flows with large traffic volumes in the data plane is important for several applications e.g., flow-size aware routing, DoS detection and traffic engineering.
Edit intent: fluency
Original: Identifying the "heavy hitter" flows or flows with large traffic volumes in the dataplane is important for several applications e.g., flow-size aware routing, DoS detection  and traffic engineering.
Revised: Identifying the "heavy hitter" flows or flows with large traffic volumes in the dataplane is important for several applications e.g., flow-size aware routing, DoS detection , and traffic engineering.
Edit intent: fluency
Original:  HashPipe implements a pipeline of hash tables which retain counters for heavy flows in various stages while evicting lighter flows over time.
Revised:  HashPipe implements a pipeline of hash tables which retain counters for heavy flows while evicting lighter flows over time.
Edit intent: clarity
Original:  We prototype HashPipe in P4 and evaluate it with CAIDA packet traces from an ISP backbone link .
Revised:  We prototype HashPipe in P4 and evaluate it with packet traces from an ISP backbone link .
Edit intent: clarity
Original:  In Chapter 1: 1. It is proved that that the class of lower elementary functions (also known as Skolemelementary functions) is the set of all functions that can be obtained by a composition of x+1, xy, \max(x-y,0), x\wedge y \lfloor \rfloor and one exponential function (2^x or x^y) using formulas that have no more than 2 floors with respect to an exponent (for example, (x+y)^{xy+z}+1 has 2 floors, 2^{2^x} has 3 floors).
Revised:  In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all functions that can be obtained by a composition of x+1, xy, \max(x-y,0), x\wedge y \lfloor \rfloor and one exponential function (2^x or x^y) using formulas that have no more than 2 floors with respect to an exponent (for example, (x+y)^{xy+z}+1 has 2 floors, 2^{2^x} has 3 floors).
Edit intent: clarity
Original:  In Chapter 1: 1. It is proved that that the class of lower elementary functions (also known as Skolemelementary functions) is the set of all functions that can be obtained by a composition of x+1, xy, \max(x-y,0), x\wedge y \lfloor \rfloor and one exponential function (2^x or x^y) using formulas that have no more than 2 floors with respect to an exponent (for example, (x+y)^{xy+z}+1 has 2 floors, 2^{2^x} has 3 floors).
Revised:  In Chapter 1: 1. It is proved that that the class of lower elementary functions (also known as Skolemelementary functions) is the set of all functions that can be obtained by a composition of x+1, xy, \max(x-y,0), x\wedge y ,\lfloor \rfloor and one exponential function (2^x or x^y) using formulas that have no more than 2 floors with respect to an exponent (for example, (x+y)^{xy+z}+1 has 2 floors, 2^{2^x} has 3 floors).
Edit intent: fluency
Original:  In Chapter 1: 1. It is proved that that the class of lower elementary functions (also known as Skolemelementary functions) is the set of all functions that can be obtained by a composition of x+1, xy, \max(x-y,0), x\wedge y \lfloor \rfloor and one exponential function (2^x or x^y) using formulas that have no more than 2 floors with respect to an exponent (for example, (x+y)^{xy+z}+1 has 2 floors, 2^{2^x} has 3 floors).
Revised:  In Chapter 1: 1. It is proved that that the class of lower elementary functions (also known as Skolemelementary functions) is the set of all functions that can be obtained by a composition of x+1, xy, \max(x-y,0), x\wedge y \lfloor x/y\rfloor and one exponential function (2^x or x^y) using formulas that have no more than 2 floors with respect to an exponent (for example, (x+y)^{xy+z}+1 has 2 floors, 2^{2^x} has 3 floors).
Edit intent: clarity
Original:  In Chapter 1: 1. It is proved that that the class of lower elementary functions (also known as Skolemelementary functions) is the set of all functions that can be obtained by a composition of x+1, xy, \max(x-y,0), x\wedge y \lfloor \rfloor and one exponential function (2^x or x^y) using formulas that have no more than 2 floors with respect to an exponent (for example, (x+y)^{xy+z}+1 has 2 floors, 2^{2^x} has 3 floors).
Revised:  In Chapter 1: 1. It is proved that that the class of lower elementary functions (also known as Skolemelementary functions) is the set of all functions that can be obtained by a composition of x+1, xy, \max(x-y,0), x\wedge y \lfloor \rfloor, and one exponential function (2^x or x^y) using formulas that have no more than 2 floors with respect to an exponent (for example, (x+y)^{xy+z}+1 has 2 floors, 2^{2^x} has 3 floors).
Edit intent: fluency
Original:  Here x\wedge y is a bitwise AND of x and y. 2. It is proved that \{x+y,\ \max(x-y,0),\ x\wedge y,\ \lfloor x/y \rfloor,\ 2^{\lfloor \log_2 x \rfloor^2}\} and \{x+y,\ \max(x-y,0),\ x\wedge y,\ \lfloor x/y \rfloor,\ x^{\lfloor \log_2 y \rfloor ^2 }\} are composition bases in the functional version of the uniform TC^0 (also known as FOM).
Revised:  Here x\wedge y is a bitwise AND of x and y. 2. It is proved that \{x+y,\ \max(x-y,0),\ x\wedge y,\ \lfloor x/y \rfloor,\ 2^{\lfloor \log_2 x \rfloor^2}\} and \{x+y,\ \max(x-y,0),\ x\wedge y,\ \lfloor x/y \rfloor,\ x^{\lfloor \log_2 y \rfloor }\} are composition bases in the functional version of the uniform TC^0 (also known as FOM).
Edit intent: fluency
Original: Many physical, biological  and social phenomena can be described by cascades taking place on a network.
Revised: Many physical, biological , and social phenomena can be described by cascades taking place on a network.
Edit intent: fluency
Original:  We then offer three topological inversion methods to infer the structure of any directed network given a set of cascade arrival times.
Revised:  We then offer three topological methods to infer the structure of any directed network given a set of cascade arrival times.
Edit intent: clarity
Original:  Our forward and inverse formulas hold for a very general class of models where the activation probability of a node is a generic function of its degree and the number of its active neighbors.
Revised:  Our formulas hold for a very general class of models where the activation probability of a node is a generic function of its degree and the number of its active neighbors.
Edit intent: clarity
Original:  This problem is similar to species estimation problems, and we propose several novel estimators that are robust to false positives and compatible with prioritization.
Revised:  This problem requires new estimators that are robust to false positives and compatible with prioritization.
Edit intent: clarity
Original:  We prove that, differently from what stated or conjectured in the proposals above , all of these three subtyping relations are undecidable  .
Revised:  We prove that, differently from what stated or conjectured in above proposals , all of these three subtyping relations are undecidable .
Edit intent: fluency
Original: We present an analysis of citations accrued over time by cohorts of patents from specific technology sectors (e.g., Electrical and Electronic) granted by the United States Patent and Trademark Office in 1998.
Revised: We present an analysis of citations accrued over time by patents granted by the United States Patent and Trademark Office in 1998.
Edit intent: clarity
Original:  In contrast to previous studies that did not differentiate patents by technology category , we observe an intrinsic citation rate that clearly separates into an  ageing function and a completely time-independent preferential-attachment-type growth kernel.
Revised:  In contrast to previous studies , a disaggregation by technology category , we observe an intrinsic citation rate that clearly separates into an ageing function and a completely time-independent preferential-attachment-type growth kernel.
Edit intent: clarity
Original:  The time-dependent citation distribution is obtained analytically for the general case of  a separable citation rate, thus establishing a useful framework for the quantitative investigation of general knowledge-propagation dynamics  .
Revised:  The time-dependent citation distribution is obtained analytically for the general case of such a separable citation rate, thus establishing a useful framework for the quantitative investigation of general knowledge-propagation dynamics .
Edit intent: clarity
Original:  The time-dependent citation distribution is obtained analytically for the general case of  a separable citation rate, thus establishing a useful framework for the quantitative investigation of general knowledge-propagation dynamics  .
Revised:  The time-dependent citation distribution is obtained analytically for the general case of a separable citation rate, thus establishing a useful framework for addressing still open questions about knowledge-propagation dynamics .
Edit intent: clarity
Original: Identifying informative aspects of brain activity has traditionally been thought to provide insight into how brains may perform optimal computations .
Revised: Understanding brain function, constructing computational models and engineering neural prosthetics require assessing two problems, namely encoding and decoding, but their relation remains controversial. For decades, the encoding problem has been shown to provide insight into how brains may perform optimal computations .
Edit intent: coherence
Original:  However, here we show that this need not be the case when studying  spike-time precision or response discrimination, among other activity aspects beyond noise correlations .
Revised:  However, here we show that this need not be the case when studying spike-time precision and response discrimination, among other activity aspects beyond noise correlations .
Edit intent: coherence
Original:  Species, such as human, with pairs of homologous chromosomes are calleddiploid .
Revised:  Species, such as human, with pairs of homologous chromosomes are called .
Edit intent: clarity
Original:  Sequence analysisliterature is, however, almost solely built under the model of a singlehaplotype sequence representing a species.
Revised:  Sequence analysisliterature is, however, almost solely built under the model of a single representing a species.
Edit intent: clarity
Original:  In this paper, we show that not only raising the abstraction level creates conceptual difficulties, but also the computational complexity will change for a natural non-trivial extension of optimal alignment to diploids.
Revised:  In this paper, we show that the computational complexity will change for a natural non-trivial extension of optimal alignment to diploids.
Edit intent: coherence
Original:  Namely, we show that  a covering alignment of two labeled DAGs is NP-hard  . A covering alignment is to find two paths P_1 (A) and P_2(A ) in DAG A and two paths P_1(B) and P_2 (B ) in DAG B that cover the nodes of the graphs and maximize  sum of the global alignment scores:
Revised:  Namely, we show that finding a covering alignment of two labeled DAGs is NP-hard . A covering alignment is to find two paths P_1 (A) and P_2(A ) in DAG A and two paths P_1(B) and P_2 (B ) in DAG B that cover the nodes of the graphs and maximize sum of the global alignment scores:
Edit intent: fluency
Original:  Namely, we show that  a covering alignment of two labeled DAGs is NP-hard  . A covering alignment is to find two paths P_1 (A) and P_2(A ) in DAG A and two paths P_1(B) and P_2 (B ) in DAG B that cover the nodes of the graphs and maximize  sum of the global alignment scores:
Revised:  Namely, we show that a covering alignment of two labeled DAGs is NP-hard . A covering alignment is to find two paths P_1 (A) and P_2(A ) in DAG A and two paths P_1(B) and P_2 (B ) in DAG B that cover the nodes of the graphs and maximize the sum of the global alignment scores:
Edit intent: fluency
Original:  S(\ell(P_1(A)),\ell(P_1(B)) )  + S(\ell(P_2(A)),\ell(P_2(B))), where \ell(\mathsf{sp}(G_1),\mathsf{sp}(G_2)), where \mathsf{sp}} (P) is the concatenation of labels on the path P. Pair-wise alignment of haplotype sequences forming a diploid chromosome can be converted to a two-path coverable labelled DAG, and then the covering alignment models the similarity of two diploids over arbitrary recombination.
Revised:  S(\ell(P_1(A)),\ell(P_1(B)) ) ,\mathsf{sp + S(\ell(P_2(A)),\ell(P_2(B))), where \ell(\mathsf{sp}(G_1),\mathsf{sp}(G_2)), where \mathsf{sp}} (P) is the concatenation of labels on the path P. Pair-wise alignment of haplotype sequences forming a diploid chromosome can be converted to a two-path coverable labelled DAG, and then the covering alignment models the similarity of two diploids over arbitrary recombination.
Edit intent: fluency
Original:  The methods are rooted in statistical physics theory, in particular , the Ising model, also known as the (pairwise) maximum entropy model and Boltzmann machine.
Revised:  The methods are rooted in statistical physics theory, in particular the Ising model, also known as the (pairwise) maximum entropy model and Boltzmann machine.
Edit intent: fluency
Original:  The methods have been applied to fitting electrophysiological data in neuroscience for a decade, but its use in neuroimaging data is still in its infancy.
Revised:  The methods have been applied to fitting electrophysiological data in neuroscience for a decade, but their use in neuroimaging data is still in its infancy.
Edit intent: fluency
Original:  Seven research fronts were identified in this sub-network.
Revised:  Thirteen research fronts were identified in this sub-network.
Edit intent: clarity
Original:  Strict upper and lower bounds of various quantities of interest (QoI)  associated with the response sensitivity derivative fields are acquired.
Revised:  Strict upper and lower bounds of various quantities of interest (QoI) that are associated with the response sensitivity derivative fields are acquired.
Edit intent: clarity
Original:  Numerical results are presented to validate the strict bounding properties of the proposed technique.
Revised:  Numerical results are presented to assess the strict bounding properties of the proposed technique.
Edit intent: clarity
Original:  This begs understanding of the following question: can the  marketplace sustain multiple service providers (SPs) that offer privacy-differentiated free services?
Revised:  This leads to the following question: can the marketplace sustain multiple service providers (SPs) that offer privacy-differentiated free services?
Edit intent: clarity
Original:  This begs understanding of the following question: can the  marketplace sustain multiple service providers (SPs) that offer privacy-differentiated free services?
Revised:  This begs understanding of the following question: can the online marketplace sustain multiple service providers (SPs) that offer privacy-differentiated free services?
Edit intent: clarity
Original:  This paper studies this problem of market segmentation for the free online services market by augmenting the classical Hotelling model for market segmentation analysis to include the fact that for the free services market, a consumer values service not in monetized terms but by its quality of service (QoS) and that the differentiator of services is not product price but the privacy risk advertised by a SP.
Revised:  This paper studies the problem of market segmentation for the free online services market by augmenting the classical Hotelling model for market segmentation analysis to include the fact that for the free services market, a consumer values service not in monetized terms but by its quality of service (QoS) and that the differentiator of services is not product price but the privacy risk advertised by a SP.
Edit intent: coherence
Original:  (ii) SPs that are capable of differentiating on services that do not use directly consumer data (untargeted services) gain larger market share;
Revised:  (ii) SPs that are capable of differentiating on services that do not directly target consumers gain larger market share;
Edit intent: clarity
Original:  Our result implies that the non-causal model of classical closed timelike curves (CTCs) cannot  solve problems that lie outside of that class.
Revised:  Our result implies that classical deterministic closed timelike curves (CTCs) cannot solve problems that lie outside of that class.
Edit intent: clarity
Original:  Thus, in stark contrast to other CTC models, these CTCs cannot solve \mathsf{NP-complete} problems, unless  \mathsf{NP}=\mathsf{UP}\cap\mathsf{coUP} \mathsf{coNP} , which lets their existence in nature appear less implausible.
Revised:  Thus, in stark contrast to other CTC models, these CTCs cannot efficiently solve~ \mathsf{NP-complete} problems, unless \mathsf{NP}=\mathsf{UP}\cap\mathsf{coUP} \mathsf{coNP} , which lets their existence in nature appear less implausible.
Edit intent: clarity
Original:  Thus, in stark contrast to other CTC models, these CTCs cannot solve \mathsf{NP-complete} problems, unless  \mathsf{NP}=\mathsf{UP}\cap\mathsf{coUP} \mathsf{coNP} , which lets their existence in nature appear less implausible.
Revised:  Thus, in stark contrast to other CTC models, these CTCs cannot solve \mathsf{NP-complete} problems, unless ~ \mathsf{NP}=\mathsf{UP}\cap\mathsf{coUP} \mathsf{coNP} , which lets their existence in nature appear less implausible.
Edit intent: coherence
Original:  Thus, in stark contrast to other CTC models, these CTCs cannot solve \mathsf{NP-complete} problems, unless  \mathsf{NP}=\mathsf{UP}\cap\mathsf{coUP} \mathsf{coNP} , which lets their existence in nature appear less implausible.
Revised:  Thus, in stark contrast to other CTC models, these CTCs cannot solve \mathsf{NP-complete} problems, unless \mathsf{NP}=\mathsf{UP}\cap\mathsf{coUP} =\mathsf{coNP} , which lets their existence in nature appear less implausible.
Edit intent: coherence
Original:  This result gives a new characterization of  \mathsf{UP}\cap\operatorname{\mathsf{coUP}} in terms of fixed points.
Revised:  This result gives a new characterization of ~ \mathsf{UP}\cap\operatorname{\mathsf{coUP}} in terms of fixed points.
Edit intent: fluency
Original: A continuum model for epithelial tissue mechanics is formulated from cell level mechanical ingredients and morphogenetic cell dynamics, including cell  shape changes and cell rearrangements.
Revised: A continuum model of epithelial tissue mechanics is formulated from cell level mechanical ingredients and morphogenetic cell dynamics, including cell shape changes and cell rearrangements.
Edit intent: fluency
Original: A continuum model for epithelial tissue mechanics is formulated from cell level mechanical ingredients and morphogenetic cell dynamics, including cell  shape changes and cell rearrangements.
Revised: A continuum model for epithelial tissue mechanics was formulated using cellular-level mechanical ingredients and morphogenetic cell dynamics, including cell shape changes and cell rearrangements.
Edit intent: fluency
Original: A continuum model for epithelial tissue mechanics is formulated from cell level mechanical ingredients and morphogenetic cell dynamics, including cell  shape changes and cell rearrangements.
Revised: A continuum model for epithelial tissue mechanics is formulated from cell level mechanical ingredients and cell shape changes and cell rearrangements.
Edit intent: clarity
Original: A continuum model for epithelial tissue mechanics is formulated from cell level mechanical ingredients and morphogenetic cell dynamics, including cell  shape changes and cell rearrangements.
Revised: A continuum model for epithelial tissue mechanics is formulated from cell level mechanical ingredients and morphogenetic cell dynamics, including cell morphogenetic processes, including cellular shape changes and cell rearrangements.
Edit intent: clarity
Original:  The model is capable of dealing with finite deformation, and uses stress and deformation tensors that can be compared with experimental data.
Revised:  The model is capable of dealing with finite deformation, and incorporates stress and deformation tensors that can be compared with experimental data.
Edit intent: clarity
Original:  The model is capable of dealing with finite deformation, and uses stress and deformation tensors that can be compared with experimental data.
Revised:  The model is capable of dealing with finite deformation, and uses stress and deformation tensors , which can be compared with experimental data.
Edit intent: coherence
Original:  Using the model, we uncover the dynamical behaviour that underlies passive relaxationand active contraction-elongation of a tissue .
Revised:  Using this model, we uncover the dynamical behaviour that underlies passive relaxationand active contraction-elongation of a tissue .
Edit intent: fluency
Original:  Using the model, we uncover the dynamical behaviour that underlies passive relaxationand active contraction-elongation of a tissue .
Revised:  Using the model, we elucidated dynamical behavior underlying passive relaxation, active contraction-elongation of a tissue .
Edit intent: clarity