wanyu/IteraTeR_v2 huggingface dataset:
Original:  At the same time there is little or no evidence of protein expression for novel genes , those that have appeared since primates, or  genes that do not have any protein-like features or cross-species conservation.
Revised:  At the same time there is little or no evidence of protein expression for novel genes , those that have appeared since primates, or for genes that do not have any protein-like features or cross-species conservation.
Edit intent: fluency
Original:  We identify 19 non-protein like features such as weak conservation, no protein-like features or ambiguous annotations in the major databases that are indicators of low peptide detection rates.
Revised:  We identify 19 non-protein-like features such as weak conservation, no protein-like features or ambiguous annotations in the major databases that are indicators of low peptide detection rates.
Edit intent: fluency
Original:  We identify 19 non-protein like features such as weak conservation, no protein-like features or ambiguous annotations in the major databases that are indicators of low peptide detection rates.
Revised:  We identify 19 non-protein like features such as weak conservation, no protein features or ambiguous annotations in the major databases that are indicators of low peptide detection rates.
Edit intent: fluency
Original:  We identify 19 non-protein like features such as weak conservation, no protein-like features or ambiguous annotations in the major databases that are indicators of low peptide detection rates.
Revised:  We identify 19 non-protein like features such as weak conservation, no protein-like features or ambiguous annotations in major databases that are indicators of low peptide detection rates.
Edit intent: fluency
Original:  In cases where the stressis not too severe , autophagy acts as a survival mechanism .
Revised:  In cases of mild stress , autophagy acts as a survival mechanism .
Edit intent: clarity
Original:  In cases of severe stress , may lead to programmed cell death.
Revised:  In cases of severe stress cells may switch to programmed cell death.
Edit intent: clarity
Original:  To integrate the existing knowledge about this decision process into a rigorous, analytical framework, we built a mathematical model of cell fate decision mediated by autophagy.
Revised:  To integrate existing knowledge about this decision process into a rigorous, analytical framework, we built a mathematical model of cell fate decision mediated by autophagy.
Edit intent: fluency
Original:  To integrate the existing knowledge about this decision process into a rigorous, analytical framework, we built a mathematical model of cell fate decision mediated by autophagy.
Revised:  To integrate the existing knowledge about this decision process into a rigorous, analytical framework, we built a mathematical model of cell fate decisions mediated by autophagy.
Edit intent: fluency
Original:  Matsliah[MM12] . With the help of a new approach and of our handmade simulated annealing based solver , we have out-performed the IBM SAT-Solver used by Margalit and Matsliah .
Revised:  Matsliah[MM12] with the help of a new approach and of our handmade simulated annealing based solver , we have out-performed the IBM SAT-Solver used by Margalit and Matsliah .
Edit intent: fluency
Original:  Matsliah[MM12] . With the help of a new approach and of our handmade simulated annealing based solver , we have out-performed the IBM SAT-Solver used by Margalit and Matsliah .
Revised:  Matsliah[MM12] . With the help of a new approach and of our handmade simulated annealing based solver .
Edit intent: coherence
Original:  We show that for finitely generated k-counter-graph automatic groups there is an algorithm to compute normal forms (and therefore solve the word problem) in polynomial time , provided the normal forms have length that is linear in the geodesic length .
Revised:  We show that for finitely generated k-counter-graph automatic groups there is an algorithm to compute normal forms (and therefore solve the word problem) in polynomial time .
Edit intent: clarity
Original: This paper introduces the notion of public collaborative processes (PCPs)to the field of Business Process Management (BPM) . PCPs involve multiple organizations with a common objective, where a number of dispersed organizations cooperating under various unstructured forms  take a collaborative approach to reaching the final goal.
Revised: This paper introduces the notion of public collaborative processes (PCPs)to the field of Business Process Management (BPM) . PCPs involve multiple organizations with a common objective, where a number of dispersed organizations cooperate under various unstructured forms take a collaborative approach to reaching the final goal.
Edit intent: fluency
Original: This paper introduces the notion of public collaborative processes (PCPs)to the field of Business Process Management (BPM) . PCPs involve multiple organizations with a common objective, where a number of dispersed organizations cooperating under various unstructured forms  take a collaborative approach to reaching the final goal.
Revised: This paper introduces the notion of public collaborative processes (PCPs)to the field of Business Process Management (BPM) . PCPs involve multiple organizations with a common objective, where a number of dispersed organizations cooperating under various unstructured forms and take a collaborative approach to reaching the final goal.
Edit intent: coherence
Original:  The minimum number of cops required to capture a robber is called the cop number of G. We show that the cop number of graphs of diameter 2 and bipartite graphs of diameter 3 is at most 2n, improving a recent result of Lu and Peng  .
Revised:  The minimum number of cops required to capture a robber is called the cop number of G. We show that the cop number of graphs of diameter 2 is at most 2n, improving a recent result of Lu and Peng .
Edit intent: coherence
Original: We apply diffusion strategies to develop  fully-distributed cooperative reinforcement learning solutions, in which agents in a network communicate only with their immediate neighbors to improve predictions about their environment.
Revised: We apply diffusion strategies to develop a fully-distributed cooperative reinforcement learning solutions, in which agents in a network communicate only with their immediate neighbors to improve predictions about their environment.
Edit intent: fluency
Original: We apply diffusion strategies to develop  fully-distributed cooperative reinforcement learning solutions, in which agents in a network communicate only with their immediate neighbors to improve predictions about their environment.
Revised: We apply diffusion strategies to develop fully-distributed cooperative reinforcement learning algorithm in which agents in a network communicate only with their immediate neighbors to improve predictions about their environment.
Edit intent: clarity
Original:  The algorithm can also be applied to off-policy sampling , meaning that the agents can learn to predict the response to a behavior different from the actual policies they are following.
Revised:  The algorithm can also be applied to off-policy sampling , meaning that the agents can predict the response to a behavior different from the actual policies they are following.
Edit intent: clarity
Original:  but, more importantly, the network is able to approach the optimal solution even when none of the individual agents could (e.g., when the individual behavior policies restrict each agent to sample a small portion of the state space).
Revised:  but, more importantly, the network is able to approach the optimal solution even when none of the individual agents can (e.g., when the individual behavior policies restrict each agent to sample a small portion of the state space).
Edit intent: fluency
Original: Motivation: Analysis of structure-response relationships of drugs is a key to understanding off-target and unexpected drug effects, and for developing hypotheses on how to better tailor drug therapies .
Revised: Motivation: Analysis of relationships of drug structure to biological response is key to understanding off-target and unexpected drug effects, and for developing hypotheses on how to better tailor drug therapies .
Edit intent: clarity
Original: Motivation: Analysis of structure-response relationships of drugs is a key to understanding off-target and unexpected drug effects, and for developing hypotheses on how to better tailor drug therapies .
Revised: Motivation: Analysis of structure-response relationships of drugs is a key to understanding off-target and unexpected drug effects, and for developing hypotheses on how to tailor drug thera-pies .
Edit intent: clarity
Original:  New methods are required for analysis of genome-wide effects of drugs across multiple cell lines, against a large number of drug characteristics . Results: In this paper, we present the first comprehensive data-driven analysis of genome-wide effects of drugs across multiple cancer cell lines (CMap database) with a probabilistic Bayesian latent variable model.
Revised:  New methods are required for integrated analyses of a large number of drug characteristics . Results: In this paper, we present the first comprehensive data-driven analysis of genome-wide effects of drugs across multiple cancer cell lines (CMap database) with a probabilistic Bayesian latent variable model.
Edit intent: clarity
Original:  We identified 11 com-ponents  that link the structural descriptors  with specific gene ex-pression responses observed in the three cell lines .
Revised:  We identified 11 com-ponents that link the structural descriptors with specific gene expression responses observed in the three cell lines .
Edit intent: fluency
Original:  Two examples are the previously unknown role of 15-delta prostaglandin J2 as a Heat Shock Protein (90) inhibitor where 3D descriptors (Pentacle-N2) are linked to the expression, and simvas-tatin inducing anti-inflammatory responses of similar nature as corti-costeroids in leukemic cells.
Revised:  Two examples are the previously unknown role of 15-delta prostaglandin J2 and HSP90 inhibitors, which are linked to the expression, and simvas-tatin inducing anti-inflammatory responses of similar nature as corti-costeroids in leukemic cells.
Edit intent: clarity
Original:  Two examples are the previously unknown role of 15-delta prostaglandin J2 as a Heat Shock Protein (90) inhibitor where 3D descriptors (Pentacle-N2) are linked to the expression, and simvas-tatin inducing anti-inflammatory responses of similar nature as corti-costeroids in leukemic cells.
Revised:  Two examples are the previously unknown role of 15-delta prostaglandin J2 as a Heat Shock Protein (90) inhibitor where 3D descriptors (Pentacle-N2) are linked to the 3D descriptors of the drugs; and the induction by simvastatin of leukemia-specific anti-inflammatory responses of similar nature as corti-costeroids in leukemic cells.
Edit intent: clarity
Original: The critical thickness of an arithmetical discrete plane refers to the infimum thickness that preserves its 2-connectedness.
Revised: An arithmetical discrete plane refers to the infimum thickness that preserves its 2-connectedness.
Edit intent: clarity
Original:  This infimum thickness can be computed thanks to a multidimensional continued fraction algorithm , namely the fully subtractive algorithm .
Revised:  This infimum thickness can be computed thanks to the fully subtractive algorithm. This multidimensional continued fraction algorithm , namely the fully subtractive algorithm .
Edit intent: coherence
Original: Rauzy fractals are sets with fractal boundary that arise naturally in the study of substitutive dynamical systems.
Edit intent: coherence
Original:  This provides a characterization of what countable fundamental can be obtained from planar Rauzy fractals.
Revised:  This characterizes all countable fundamental groups for planar Rauzy fractals.
Edit intent: clarity
Original:  We provide explicit constructions, which rely on two operations on substitutions: symbolic splittings and conjugations by free group automorphisms.
Revised:  We give an explicit construction relying on two operations on substitutions: symbolic splittings and conjugations by free group automorphisms.
Edit intent: clarity
Original: We consider the problem of decentralized 20 questions with noise for multiple players/agents under the minimum entropy criterion 1 in the setting of stochastic search  , with application to target localization.
Revised: We consider the problem of decentralized 20 questions with noise for multiple players/agents under the minimum entropy criterion in the setting of stochastic search , with application to target localization.
Edit intent: coherence
Original:  We propose decentralized extensions of the active query-based search strategy that combines elements from the 20 questions approach of Tsiligkaridis et al. 2%DIFDELCMD < ] %DIFDELCMD < %%% and the social learningalgorithm of Jadbabaie et al. 3 . We prove convergence to correct consensus on the true target location .
Revised:  We propose decentralized extensions of the active query-based search strategy that combines elements from the 20 questions approach 2%DIFDELCMD < ] %DIFDELCMD < %%% and the social learningalgorithm of Jadbabaie et al. 3 . We prove convergence to correct consensus on the true target location .
Edit intent: coherence
Original:  We propose decentralized extensions of the active query-based search strategy that combines elements from the 20 questions approach of Tsiligkaridis et al. 2%DIFDELCMD < ] %DIFDELCMD < %%% and the social learningalgorithm of Jadbabaie et al. 3 . We prove convergence to correct consensus on the true target location .
Revised:  We propose decentralized extensions of the active query-based search strategy that combines elements from the 20 questions approach of Tsiligkaridis et al. %DIFDELCMD < ] %DIFDELCMD < %%% and the social learningalgorithm of Jadbabaie et al. 3 . We prove convergence to correct consensus on the true target location .
Edit intent: fluency
Original:  We propose decentralized extensions of the active query-based search strategy that combines elements from the 20 questions approach of Tsiligkaridis et al. 2%DIFDELCMD < ] %DIFDELCMD < %%% and the social learningalgorithm of Jadbabaie et al. 3 . We prove convergence to correct consensus on the true target location .
Revised:  We propose decentralized extensions of the active query-based search strategy that combines elements from the 20 questions approach of Tsiligkaridis et al. 2%DIFDELCMD < ] %DIFDELCMD < %%% 3 . We prove convergence to correct consensus on the true target location .
Edit intent: coherence
Original:  This framework provides a flexible and tractable mathematical model for active decentralized target estimation systems.
Revised:  This framework provides a flexible and tractable mathematical model for active decentralized parameter estimation systems.
Edit intent: clarity
Original:  This framework provides a flexible and tractable mathematical model for active decentralized parameter estimation systems  .
Revised:  This framework provides a flexible and tractable mathematical model for decentralized parameter estimation systems .
Edit intent: clarity
Original:  We illustrate the effectiveness and robustness of the proposed decentralized collaborative 20 questions model for several different network topologies associated with information sharing.
Revised:  We illustrate the effectiveness and robustness of the proposed decentralized collaborative 20 questions algorithm for random network topologies with information sharing.
Edit intent: clarity
Original: We propose a protocol for intrusion detection in distributed systems based on a relatively recent theory in immunology called danger theory.
Revised: We propose an artificial immune model for intrusion detection in distributed systems based on a relatively recent theory in immunology called danger theory.
Edit intent: clarity
Original: We propose a protocol for intrusion detection in distributed systems based on a relatively recent theory in immunology called danger theory.
Revised: We propose a protocol for intrusion detection in distributed systems based on a relatively recent theory in immunology called Danger theory.
Edit intent: fluency
Original:  Based on danger theory, immune response in natural systems is a result of sensing corruption as well as sensing unknown substances.
Revised:  Based on Danger theory, immune response in natural systems is a result of sensing corruption as well as sensing unknown substances.
Edit intent: fluency
Original: When using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is often not the signs of those polynomials that are of paramount importance but rather the truth values of certain quantifier free formulae involving them.
Revised: When using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is likely not the signs of those polynomials that are of paramount importance but rather the truth values of certain quantifier free formulae involving them.
Edit intent: clarity
Original:  In this paper we present an extended version of that theory which can be applied to an arbitrary list of formulae, present heuristics to help with the formulation of input to the algorithm, and explain how the theory of reduced projection operators can allow for further improvements in the lifting stage of CAD algorithms, even in the context of a single equational constraint.
Revised:  In this paper we present an extended version of our theory which can be applied to an arbitrary list of formulae, present heuristics to help with the formulation of input to the algorithm, and explain how the theory of reduced projection operators can allow for further improvements in the lifting stage of CAD algorithms, even in the context of a single equational constraint.
Edit intent: clarity
Original:  In this paper we present an extended version of that theory which can be applied to an arbitrary list of formulae, present heuristics to help with the formulation of input to the algorithm, and explain how the theory of reduced projection operators can allow for further improvements in the lifting stage of CAD algorithms, even in the context of a single equational constraint.
Revised:  In this paper we present an extended version of that theory which can be applied to an arbitrary list of formulae, present heuristics to help with the formulation of input to the algorithm, and explain how the theory of reduced projection operators can allow for further improvements to the lifting phase of CAD algorithms, even in the context of a single equational constraint.
Edit intent: clarity
Original:  We then explain how the theory of reduced projection operators can allow for further improvements to the lifting phase of CAD algorithms, even in the context of a single equational constraint.
Revised:  We also explain how the theory of reduced projection operators can allow for further improvements to the lifting phase of CAD algorithms, even in the context of a single equational constraint.
Edit intent: clarity
Original:  The algorithm is implemented fully in Maple and we present both promising results from experimentation and a complexity analysis showing the benefits of our new contributions.
Revised:  The algorithm is implemented fully in Maple and we present both promising results from experimentation and a complexity analysis showing the benefits of our contributions.
Edit intent: clarity
Original: Cylindrical Algebraic Decompositions (CADs) have been studied since their creation as a tool for working with semi-algebraic sets and eliminating quantifiers of the reals .
Revised: Cylindrical algebraic decompositions (CADs) have been studied since their creation as a tool for working with semi-algebraic sets and eliminating quantifiers of the reals .
Edit intent: fluency
Original: Cylindrical Algebraic Decompositions (CADs) have been studied since their creation as a tool for working with semi-algebraic sets and eliminating quantifiers of the reals .
Revised: Cylindrical Algebraic Decompositions (CADs) are a key tool in real algebraic geometry, used primarily for eliminating quantifiers over the reals and studying semi-algebraic sets and eliminating quantifiers of the reals .
Edit intent: clarity
Original: Cylindrical Algebraic Decompositions (CADs) have been studied since their creation as a tool for working with semi-algebraic sets and eliminating quantifiers of the reals .
Revised: Cylindrical Algebraic Decompositions (CADs) have been studied since their creation as a tool for working with semi-algebraic sets .
Edit intent: coherence
Original:  In this paper we are concerned with Cylindrical Algebraic Sub-Decompositions (sub-CADs), defined as subsets of CADs sufficient to describe the solutions for given formulae.
Revised:  In this paper we introduce cylindrical algebraic sub-decompositions (sub-CADs), defined as subsets of CADs sufficient to describe the solutions for given formulae.
Edit intent: clarity
Original:  In this paper we are concerned with Cylindrical Algebraic Sub-Decompositions (sub-CADs), defined as subsets of CADs sufficient to describe the solutions for given formulae.
Revised:  In this paper we are concerned with Cylindrical Algebraic Sub-Decompositions (sub-CADs), which are subsets of CADs sufficient to describe the solutions for given formulae.
Edit intent: clarity
Original:  We define a manifold sub-CAD as those cells in a CAD lying on a designated manifold and a layered sub-CAD as those cells with prescribed dimensions .
Revised:  We define a manifold sub-CAD as those cells in a CAD lying on a designated variety; and layered sub-CADs which have only those cells of dimension higher than a specified value .
Edit intent: clarity
Original:  We present algorithms to produce both and then describe how the ideas may be combined with each other , as well as their interaction with the recent theory of Truth-Table Invariant CAD(TTICAD) .
Revised:  We present algorithms to produce these and describe how the ideas may be combined with each other , as well as their interaction with the recent theory of Truth-Table Invariant CAD(TTICAD) .
Edit intent: clarity
Original:  We present algorithms to produce both and then describe how the ideas may be combined with each other , as well as their interaction with the recent theory of Truth-Table Invariant CAD(TTICAD) .
Revised:  We present algorithms to produce both and then describe how the two approaches may be combined with each other , as well as their interaction with the recent theory of Truth-Table Invariant CAD(TTICAD) .
Edit intent: clarity
Original:  We present algorithms to produce both and then describe how the ideas may be combined with each other , as well as their interaction with the recent theory of Truth-Table Invariant CAD(TTICAD) .
Revised:  We present algorithms to produce both and then describe how the ideas may be combined with each other and the recent theory of Truth-Table Invariant CAD(TTICAD) .
Edit intent: clarity
Original:  We present algorithms to produce both and then describe how the ideas may be combined with each other , as well as their interaction with the recent theory of Truth-Table Invariant CAD(TTICAD) .
Revised:  We present algorithms to produce both and then describe how the ideas may be combined with each other , as well as their interaction with the recent theory of truth-table invariant CAD .
Edit intent: clarity
Original:  We give a complexity analysis for manifold sub-CADs and 1-layered manifold sub-CADs and present examples where these techniques can be of use, offering substantial savings on previous approaches.
Revised:  We give a complexity analysis showing that these techniques can be of use, offering substantial savings on previous approaches.
Edit intent: clarity