wanyu/IteraTeR_v2 huggingface dataset:
Original:  The observed changes are mysteriously context-dependent, with increased exposure to odorants leading variously to increased, decreased or unchanged abundance of activated receptors.
Revised:  The observed changes are mysteriously context-dependent, with increased exposure to odorants leading variously to increased, decreased or unchanged abundances of activated receptors.
Edit intent: fluency
Original: Olfactory receptor usage is highly non-uniform , with some receptor types being orders of magnitude more abundant than others.
Revised: Olfactory receptor usage is highly heterogeneous , with some receptor types being orders of magnitude more abundant than others.
Edit intent: clarity
Original:  This model predicts further that in mammals, where olfactory sensory neurons are replaced regularly, receptor abundances should continuously adapt to odor statistics.
Revised:  This model predicts that in mammals, where olfactory sensory neurons are replaced regularly, receptor abundances should continuously adapt to odor statistics.
Edit intent: clarity
Original:  These changes are mysteriously context-dependent, with increased exposure to odorants leading variously to increased, decreased  or unchanged abundances of  activated receptors.
Revised:  These changes are mysteriously context-dependent, with increased exposure to odorants leading variously to increased, decreased , or unchanged abundances of activated receptors.
Edit intent: fluency
Original:  These changes are mysteriously context-dependent, with increased exposure to odorants leading variously to increased, decreased  or unchanged abundances of  activated receptors.
Revised:  These changes are mysteriously context-dependent, with increased exposure to odorants leading variously to increased, decreased or unchanged abundances of different activated receptors.
Edit intent: clarity
Original:  We show that efficient coding theory predicts precisely such a context-dependence when sensors are correlated .
Revised:  We demonstrate that this diversity of effects is required for efficient coding when sensors are correlated .
Edit intent: clarity
Original:  Finally, we demonstrate simple dynamical rules for neural birth and death processes that might provide a mechanism for receptor abundances to adapt optimally .
Revised:  Finally, we give simple dynamical rules for neural birth and death processes that might provide a mechanism for receptor abundances to adapt optimally .
Edit intent: clarity
Original:  Finally, we demonstrate simple dynamical rules for neural birth and death processes that might provide a mechanism for receptor abundances to adapt optimally .
Revised:  Finally, we demonstrate simple dynamical rules for neural birth and death processes that might underlie this adaptation .
Edit intent: clarity
Original:  By the monotonicity , in combination with the factorization method and stochastic calculus in martingale-type 2 Banach spaces, we derive a uniform \mathbb L^\infty-estimation and a H\"older-type regularity for both stochastic and random equations.
Revised:  By the monotone assumption , in combination with the factorization method and stochastic calculus in martingale-type 2 Banach spaces, we derive a uniform \mathbb L^\infty-estimation and a H\"older-type regularity for both stochastic and random equations.
Edit intent: clarity
Original: While the modern parallel computing systems offer high performance, utilizing these powerful computing resources to the highest possible extent demands advanced knowledge of various hardware architectures and parallel programming models.
Revised: While modern parallel computing systems offer high performance, utilizing these powerful computing resources to the highest possible extent demands advanced knowledge of various hardware architectures and parallel programming models.
Edit intent: clarity
Original:  We prove that: (i) the computed approximations bound the desired measures from below;
Revised:  We prove that: (i) the computed approximations bound the measures from below;
Edit intent: clarity
Original:  and (iii) the scheme converges  in the sense that  as the truncation tends to the entire state space, the total variation distances tend to zero.
Revised:  and (iii) the scheme converges , in the sense that as the truncation tends to the entire state space, the total variation distances tend to zero.
Edit intent: fluency
Original:  and (iii) the scheme converges  in the sense that  as the truncation tends to the entire state space, the total variation distances tend to zero.
Revised:  and (iii) the scheme converges in the sense that , as the truncation tends to the entire state space, the total variation distances tend to zero.
Edit intent: fluency
Original:  To establish the theoretical properties of the ETFSP scheme, we revisit the related finite state projection scheme taking a probabilistic viewpoint and proving the latter's convergence .
Revised:  We also revisit the related finite state projection scheme taking a probabilistic viewpoint and proving the latter's convergence .
Edit intent: clarity
Original:  A convenient identification of the response  of organ j to TB is provided by the following  age-dependent  death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Revised:  A convenient characterization of the response of organ j to TB is provided by the following age-dependent death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Edit intent: clarity
Original:  A convenient identification of the response  of organ j to TB is provided by the following  age-dependent  death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Revised:  A convenient identification of the response to TB of organ j to TB is provided by the following age-dependent death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Edit intent: fluency
Original:  A convenient identification of the response  of organ j to TB is provided by the following  age-dependent  death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Revised:  A convenient identification of the response of organ j is given by the following age-dependent death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Edit intent: clarity
Original:  A convenient identification of the response  of organ j to TB is provided by the following  age-dependent  death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Revised:  A convenient identification of the response of organ j to TB is provided by the following ( age-dependent death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Edit intent: fluency
Original:  A convenient identification of the response  of organ j to TB is provided by the following  age-dependent  death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Revised:  A convenient identification of the response of organ j to TB is provided by the following age-dependent ) death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Edit intent: fluency
Original:  A convenient identification of the response  of organ j to TB is provided by the following  age-dependent  death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Revised:  A convenient identification of the response of organ j to TB is provided by the following age-dependent death ratio: Tj (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Edit intent: fluency
Original:  A convenient identification of the response  of organ j to TB is provided by the following  age-dependent  death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Revised:  A convenient identification of the response of organ j to TB is provided by the following age-dependent death ratio: T_j (t)=(death by TB of type j )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Edit intent: clarity
Original:  A convenient identification of the response  of organ j to TB is provided by the following  age-dependent  death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Revised:  A convenient identification of the response of organ j to TB is provided by the following age-dependent death ratio: T_j (t)=(death by type j TB )/(all TB deaths) The development of cancer tumors can be described by a similar function Cj (t) = (death by type j cancer)/(all cancer deaths) .
Edit intent: clarity
Original:  A convenient identification of the response  of organ j to TB is provided by the following  age-dependent  death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) = (death by type j cancer)/(all cancer deaths) .
Revised:  A convenient identification of the response of organ j to TB is provided by the following age-dependent death ratio: T_j (t)=(death by type j TB )/(all TB deaths) A similar function will describe the deaths due to cancer lesions: C_j (t) .
Edit intent: coherence
Original:  Although such responses are highly organ-dependent, it appears that for the same organ at age t: T_j (t) is similar to C_j (t).
Revised:  Although such responses are highly organ-dependent, it appears that for the same organ Tj (t) is similar to C_j (t).
Edit intent: clarity
Original:  Although such responses are highly organ-dependent, it appears that for the same organ at age t: T_j (t) is similar to C_j (t).
Revised:  Although such responses are highly organ-dependent, it appears that for the same organ at age t: T_j (t) is similar in shape to Cj (t).
Edit intent: clarity
Original:  In other words, the idiosyncrasies of each organ are more important than the functional differences induced by TB or cancer.
Edit intent: coherence
Original:  For instance, with regard to brain lesions , both TB and cancer mortalities peak around the age of 10.
Revised:  For instance, with regard to brain tumors , both TB and cancer mortalities peak around the age of 10.
Edit intent: clarity
Original:  For instance, with regard to brain lesions , both TB and cancer mortalities peak around the age of 10.
Revised:  For instance, with regard to brain lesions , both TB and cancer mortality peak around the age of 10.
Edit intent: fluency
Original:  Such parallel features may bring to light vulnerabilities due to (temporary) faults or deficiencies of the immune system .
Revised:  Such observations may bring to light vulnerabilities due to (temporary) faults or deficiencies of the immune system .
Edit intent: clarity
Original:  This problem is particularly difficult in RDF systems since queries over RDF data are navigational and thus tend to involve many joins.
Revised:  This problem is particularly difficult in RDF systems : queries over RDF data are navigational and thus tend to involve many joins.
Edit intent: coherence
Original:  In this paper we present a new technique for estimating the cardinality of conjunctive queries in RDF. We use a summary of an RDF graph as a synopsis that we interpret using a possible world semantics .
Revised:  We present a new technique for estimating the cardinality of conjunctive queries in RDF. We use a summary of an RDF graph as a synopsis that we interpret using a possible world semantics .
Edit intent: coherence
Original:  In this paper we present a new technique for estimating the cardinality of conjunctive queries in RDF. We use a summary of an RDF graph as a synopsis that we interpret using a possible world semantics .
Revised:  In this paper we present a new technique for estimating the cardinality of conjunctive queries in RDF. We use a summary of an RDF graph using a possible world semantics .
Edit intent: coherence
Original:  We formalise the estimation problem as computing the expectation of query cardinality over all RDF graphs represented by the summary, and we present a closed-form formula for computing the expectation of arbitrary queries.
Revised:  We formalise the estimation problem as computing the expected cardinality over all RDF graphs represented by the summary, and we present a closed-form formula for computing the expectation of arbitrary queries.
Edit intent: clarity
Original:  Finally, we show empirically that our cardinality technique is more accurate and more consistent, often by orders of magnitude, than several state-of-the-art approaches .
Revised:  Finally, we show empirically that our cardinality technique is more accurate and more consistent, often by orders of magnitude, than the state of the art .
Edit intent: clarity
Original:  In this work, we provide a quantitative assessment of new numerical methods as well as available state-of-the-art methods for discretizing the fractional Laplacian, and we present new results on the differences in features, regularity, and boundary behaviors of solutions to equations posed with these different definitions.
Revised:  In this work, we provide new numerical methods as well as available state-of-the-art methods for discretizing the fractional Laplacian, and we present new results on the differences in features, regularity, and boundary behaviors of solutions to equations posed with these different definitions.
Edit intent: clarity
Original: MapReduce is a popular programming paradigm for running large-scale  data-intensive computation.
Revised: MapReduce is a popular programming paradigm for developing large-scale data-intensive computation.
Edit intent: clarity
Original: MapReduce is a popular programming paradigm for running large-scale  data-intensive computation.
Revised: MapReduce is a popular programming paradigm for running large-scale , data-intensive computation.
Edit intent: fluency
Original:  Recently, many frameworks that implement that paradigm have been developed.
Revised:  Many frameworks that implement that paradigm have been developed.
Edit intent: clarity
Original:  Recently, many frameworks that implement that paradigm have been developed.
Revised:  Recently, many frameworks that implement this paradigm have recently been developed.
Edit intent: clarity
Original:  To leverage such frameworks, however, developers need to familiarize with each framework's API and rewrite their code.
Revised:  To leverage these frameworks, however, developers need to familiarize with each framework's API and rewrite their code.
Edit intent: fluency
Original:  We present CORA, a new tool that automatically translates sequential Java programs to the MapReduce paradigm.
Revised:  We present CORA, a new tool that automatically translates sequential Java programs into the MapReduce paradigm.
Edit intent: fluency
Original:  Rather than building a compiler by tediously designing pattern-matching rules to identify code fragments to translate from the input, CORA translates the input program in two steps: first, CORA uses program synthesis to identify input code fragments and search for a program summary (i.e., a functional specification) of each  fragment.
Revised:  Casper identifies potential code fragments to translate from the input, CORA translates the input program in two steps: first, CORA uses program synthesis to identify input code fragments and search for a program summary (i.e., a functional specification) of each fragment.
Edit intent: clarity
Original:  Rather than building a compiler by tediously designing pattern-matching rules to identify code fragments to translate from the input, CORA translates the input program in two steps: first, CORA uses program synthesis to identify input code fragments and search for a program summary (i.e., a functional specification) of each  fragment.
Revised:  Rather than building a compiler by tediously designing pattern-matching rules to identify code fragments to rewrite and translates them in two steps: first, CORA uses program synthesis to identify input code fragments and search for a program summary (i.e., a functional specification) of each fragment.
Edit intent: clarity
Original:  Rather than building a compiler by tediously designing pattern-matching rules to identify code fragments to translate from the input, CORA translates the input program in two steps: first, CORA uses program synthesis to identify input code fragments and search for a program summary (i.e., a functional specification) of each  fragment.
Revised:  Rather than building a compiler by tediously designing pattern-matching rules to identify code fragments to translate from the input, CORA translates the input program in two steps: first, CORA uses program synthesis to search for a program summary (i.e., a functional specification) of each fragment.
Edit intent: coherence
Original:  Rather than building a compiler by tediously designing pattern-matching rules to identify code fragments to translate from the input, CORA translates the input program in two steps: first, CORA uses program synthesis to identify input code fragments and search for a program summary (i.e., a functional specification) of each  fragment.
Revised:  Rather than building a compiler by tediously designing pattern-matching rules to identify code fragments to translate from the input, CORA translates the input program in two steps: first, CORA uses program synthesis to identify input code fragments and search for a program summary (i.e., a functional specification) of each code fragment.
Edit intent: fluency
Original:  We have evaluated CORA by automatically converting real-world  sequential Java benchmarks to MapReduce.
Revised:  We have evaluated CORA by automatically converting real-world , sequential Java benchmarks to MapReduce.
Edit intent: fluency
Original:  The resulting benchmarks perform up to 32.2 x faster compared to the original , and are all translated without designing any pattern-matching rules .
Revised:  The resulting benchmarks perform up to 32.2 x faster compared to the original .
Edit intent: coherence
Original: Decoding specific task states from human fMRI ( functional magnetic resonance imaging ) signals constitutes a major goal of neuroimaging.
Revised: Decoding specific task states based on functional magnetic resonance imaging ) signals constitutes a major goal of neuroimaging.
Edit intent: clarity
Original:  Here, we assembled a novel deep neural network (DNN) for classifying directly from 4-D fMRI time series, retaining both spatial and temporal information of fMRI signals .
Revised:  Here, we assembled a novel deep neural network (DNN) for directly decoding multiple brain task states from fMRI signals of the brain without any burden for feature handcrafts .
Edit intent: clarity
Original:  Researchers thus need to reduce the features to tens or hundreds of dimensions through feature selection/extraction that requires expert knowledgeand may lead to a selection bias .
Revised:  Researchers thus need to reduce the features to tens or hundreds of dimensions through feature selection/extraction according to expert knowledge .
Edit intent: clarity
Original: We use matrix completion methods for haplotype assembly from NGS reads to develop the new HapSVT, HapNuc, and HapOPT algorithms.
Revised: We apply matrix completion methods for haplotype assembly from NGS reads to develop the new HapSVT, HapNuc, and HapOPT algorithms.
Edit intent: fluency
Original:  This  is followed by quantizing and decoding the completed matrix in order to generate haplotypes.
Revised:  This process is followed by quantizing and decoding the completed matrix in order to generate haplotypes.
Edit intent: clarity
Original:  This  is followed by quantizing and decoding the completed matrix in order to generate haplotypes.
Revised:  This is followed by quantizing and decoding the completed matrix in order to estimate haplotypes.
Edit intent: clarity
Original: Recent progress in genomics is bringing genetic testing to the masses , as participatory public initiatives are well underway to sequence the genome of millions of volunteers, and a new market is booming with a number of companies like 23andMe and AncestryDNA offering affordable tests directly to consumers.
Revised: Recent progress in genomics is bringing genetic testing to the masses . Participatory public initiatives are well underway to sequence the genome of millions of volunteers, and a new market is booming with a number of companies like 23andMe and AncestryDNA offering affordable tests directly to consumers.
Edit intent: coherence
Original: Recent progress in genomics is bringing genetic testing to the masses , as participatory public initiatives are well underway to sequence the genome of millions of volunteers, and a new market is booming with a number of companies like 23andMe and AncestryDNA offering affordable tests directly to consumers.
Revised: Recent progress in genomics is bringing genetic testing to the masses , as participatory public initiatives are underway to sequence the genome of millions of volunteers, and a new market is booming with a number of companies like 23andMe and AncestryDNA offering affordable tests directly to consumers.
Edit intent: clarity
Original:  In this paper, we introduce the Social Event Scheduling (SES) problem, which schedules a set of social events considering user preferences and behavior, events' spatiotemporal conflicts, and competing events , in order to maximize the overall number of participants .
Revised:  In this paper, we introduce the Social Event Scheduling (SES) problem, which schedules a set of social events considering user preferences and behavior, events' spatiotemporal conflicts, and competing vents , in order to maximize the overall number of participants .
Edit intent: fluency
Original:  In this paper, we introduce the Social Event Scheduling (SES) problem, which schedules a set of social events considering user preferences and behavior, events' spatiotemporal conflicts, and competing events , in order to maximize the overall number of participants .
Revised:  In this paper, we introduce the Social Event Scheduling (SES) problem, which schedules a set of social events considering user preferences and behavior, events' spatiotemporal conflicts, and competing events , in order to maximize the overall number of attendees .
Edit intent: clarity
Original:  Here we show that this coupling induces standing twist waves in bent DNA, and we provide an analytical solution of the minimum-energy shape of a bent double-helical molecule .
Revised:  Here we investigate its effect on bent DNA. We provide an analytical solution of the minimum-energy shape of a bent double-helical molecule .
Edit intent: clarity