wanyu/IteraTeR_full_sent huggingface dataset:
Original: The paper addresses the question of how to test the validity of candidate systems for general odor reproduction .
Revised: In 1950 Alan Turing proposed his imitation game, better known as the Turing test, for determining whether a computer system claimed to adequately exhibit intelligence indeed does so. This work was carried out although no such system was anywhere in sight at the time, and we are still far from it now, many decades later. The current paper raises the similarly tantalizing question of how to test the validity of candidate systems for general odor reproduction .
Edit intent: meaning-changed
Original: The paper addresses the question of how to test the validity of candidate systems for general odor reproduction . A novel method and three variants of tests are proposedfor this, which involve ideas from recognition and imitation and take advantage of the availability of near-perfect reproduction methods for sight and sound.
Revised: The paper addresses the question of how to test the validity of candidate systems for general odor reproduction , despite such systems still being far from viable. The reasons for the question being nontrivial are discussed, and a novel method is proposed, which involves ideas from recognition and imitation and take advantage of the availability of near-perfect reproduction methods for sight and sound.
Edit intent: meaning-changed
Original: In  1950 Alan Turing proposed his imitation game, better known as the Turing test, for determining whether a computer system claimed to adequately exhibit intelligence indeed does so.
Revised: In 1950 article in Mind, decades before the existence of anything resembling an artificial intelligence system, Alan Turing addressed the question of how to test whether machines can think, or in modern terminology, whether a computer system claimed to adequately exhibit intelligence indeed does so.
Edit intent: meaning-changed
Original:  The current paper raises the similarly tantalizing question of how to test the validity of a candidate system for general odor reproduction, despite such systems still being far from viable. The reasons for the question being nontrivialare discussed , and a novel method is proposed , which involves ideas from recognition and imitation, taking advantage of the availability of near-perfect reproduction methods for sight and sound.
Revised:  The current paper raises the similarly tantalizing question of how to test the validity of a system claimed to reproduce arbitrary odors artificially, in a way recognizable to humans, in face of the unavailability of a general naming method for odors. Although odor reproduction systems are still far from being viable, the question of how to test candidates thereof is claimed to be interesting and nontrivial , and a novel method is proposed , which involves ideas from recognition and imitation, taking advantage of the availability of near-perfect reproduction methods for sight and sound.
Edit intent: meaning-changed
Original:  The reasons for the question being nontrivialare discussed , and a novel method is proposed , which involves ideas from recognition and imitation, taking advantage of the availability of near-perfect reproduction methods for sight and sound.
Revised:  The reasons for the question being nontrivialare discussed , and a novel method is proposed . To some extent, the method is inspired by Turing`s test for AI, in that it involves a human challenger and the real and artificial entities, yet it is very different: our test is conditional, requiring from the artificial no more than is required from the original, and it employs a novel method of immersion that takes advantage of the availability of near-perfect reproduction methods for sight and sound.
Edit intent: meaning-changed
Original:  We show in the second part that the signal that the market makers use in the general case is a time-changed version of the one that they would use if the final pay-off had a Bernoulli distribution.
Revised:  We show in the second part that the signal of the market makers use in the general case is a time-changed version of the one that they would use if the final pay-off had a Bernoulli distribution.
Edit intent: fluency
Original:  We show in the second part that the signal that the market makers use in the general case is a time-changed version of the one that they would use if the final pay-off had a Bernoulli distribution.
Revised:  We show in the second part that the signal that the market makers use in the general case is a time-changed version of the one that they would have used had the final payoff had a Bernoulli distribution.
Edit intent: clarity
Original:  While Kyle's lambda is a potential, i.e. converges to 0, for the Bernoulli distribured final payoff, its limit in general is different than 0. Also, differently from \mbox{%DIFAUXCMD BB
Revised:  While Kyle's lambda is a potential, i.e. converges to 0, for the Bernoulli distribured final payoff, its limit in general is different than 0. 
Edit intent: coherence
Original: In the literature, researchers have widely addressed the portfolio optimization problem with various stock price models, and by choosing different kinds of optimization criteria. Models driven by Jump processes seem to provide a flexible class of models which capture statistical and economical properties of market data. In particular, we consider a portfolio optimization problem, without any consumption and transaction cost, where the market consisting of stock prices is modelled by a multi dimensional jump diffusion process with  semi-Markov modulated coefficients.
Revised: This article studies a portfolio optimization problem, without any consumption and transaction cost, where the market consisting of stock prices is modelled by a multi dimensional jump diffusion process with semi-Markov modulated coefficients.
Edit intent: clarity
Original:  In particular, we consider a portfolio optimization problem, without any consumption and transaction cost, where the market consisting of stock prices is modelled by a multi dimensional jump diffusion process with  semi-Markov modulated coefficients.
Revised:  In particular, we consider a portfolio optimization problem, without any consumption and transaction cost, where the market consisting of several stocks is modeled by a multi-dimensional jump diffusion process with semi-Markov modulated coefficients.
Edit intent: clarity
Original:  In particular, we consider a portfolio optimization problem, without any consumption and transaction cost, where the market consisting of stock prices is modelled by a multi dimensional jump diffusion process with  semi-Markov modulated coefficients.
Revised:  In particular, we consider a portfolio optimization problem, without any consumption and transaction cost, where the market consisting of stock prices is modelled by a multi dimensional jump diffusion process with age-dependent semi-Markov modulated coefficients.
Edit intent: meaning-changed
Original: This article studies a portfolio optimization problem, without any consumption and transaction cost, where the market consisting of several stocks is modeled by a multi-dimensional jump diffusion process with age-dependent semi-Markov modulated coefficients.
Revised: This article studies a portfolio optimization problem, where the market consisting of several stocks is modeled by a multi-dimensional jump diffusion process with age-dependent semi-Markov modulated coefficients.
Edit intent: coherence
Original: This article studies a portfolio optimization problem, without any consumption and transaction cost, where the market consisting of several stocks is modeled by a multi-dimensional jump diffusion process with age-dependent semi-Markov modulated coefficients.
Revised: This article studies a portfolio optimization problem, without any consumption and transaction cost, where the market consisting of several stocks is modeled by a multi-dimensional jump-diffusion process with age-dependent semi-Markov modulated coefficients.
Edit intent: fluency
Original:  A new risk measure, the Lambda value at risk (Lambda VaR), has been recently proposed by Frittelli et al. (2014), as a generalization of VaR , with the ability of discriminating the risk among P&L distributions with different tail behaviour.
Revised:  A new risk measure, the Lambda value at risk (Lambda VaR), has been recently proposed by Frittelli et al. (2014), as a generalization of VaR with the ability of discriminating the risk among P&L distributions with different tail behaviour.
Edit intent: fluency
Original:  A new risk measure, the Lambda value at risk (Lambda VaR), has been recently proposed by Frittelli et al. (2014), as a generalization of VaR , with the ability of discriminating the risk among P&L distributions with different tail behaviour.
Revised:  A new risk measure, the Lambda value at risk (Lambda VaR), has been recently proposed by Frittelli et al. (2014), as a generalization of VaR , with the ability to discriminate the risk among P&L distributions with different tail behaviour.
Edit intent: fluency
Original:  However, by exploiting the fact that the price process still is a semimartingale and accordingly using the martingale method, one can get an analytical expression for the option price in the regime when the volatility process is fast mean reverting .
Revised:  However, by exploiting the fact that the price process is still a semimartingale and accordingly using the martingale method, one can get an analytical expression for the option price in the regime when the volatility process is fast mean reverting .
Edit intent: coherence
Original:  However, by exploiting the fact that the price process still is a semimartingale and accordingly using the martingale method, one can get an analytical expression for the option price in the regime when the volatility process is fast mean reverting .
Revised:  However, by exploiting the fact that the price process still is a semimartingale and accordingly using the martingale method, we can obtain an analytical expression for the option price in the regime when the volatility process is fast mean reverting .
Edit intent: clarity
Original:  However, by exploiting the fact that the price process still is a semimartingale and accordingly using the martingale method, one can get an analytical expression for the option price in the regime when the volatility process is fast mean reverting .
Revised:  However, by exploiting the fact that the price process still is a semimartingale and accordingly using the martingale method, one can get an analytical expression for the option price in the regime where the volatility process is fast mean reverting .
Edit intent: clarity
Original:  However, by exploiting the fact that the price process still is a semimartingale and accordingly using the martingale method, one can get an analytical expression for the option price in the regime when the volatility process is fast mean reverting .
Revised:  However, by exploiting the fact that the price process still is a semimartingale and accordingly using the martingale method, one can get an analytical expression for the option price in the regime when the volatility process is fast mean-reverting .
Edit intent: coherence
Original:  The volatility process is here modeled as a smooth and bounded function of a fractional Ornstein Uhlenbeck processand we give the expression for the implied volatility  which has a fractional term structure.
Revised:  The volatility process is modeled as a smooth and bounded function of a fractional Ornstein Uhlenbeck processand we give the expression for the implied volatility which has a fractional term structure.
Edit intent: clarity
Original:  The volatility process is here modeled as a smooth and bounded function of a fractional Ornstein Uhlenbeck processand we give the expression for the implied volatility  which has a fractional term structure.
Revised:  The volatility process is here modeled as a smooth and bounded function of a fractional Ornstein-Uhlenbeck process. We give the expression for the implied volatility which has a fractional term structure.
Edit intent: fluency
Original:  The volatility process is here modeled as a smooth and bounded function of a fractional Ornstein Uhlenbeck processand we give the expression for the implied volatility  which has a fractional term structure.
Revised:  The volatility process is here modeled as a smooth and bounded function of a fractional Ornstein Uhlenbeck processand we give the expression for the implied volatility , which has a fractional term structure.
Edit intent: fluency
Original:  Second, we show that two previously described `intoxication reversers' raise T_c in vesicles and counter ethanol's effects in vesicles, mimicking the findings of previous electrophysiological  measurements.
Revised:  Second, we show that two previously described `intoxication reversers' raise T_c and counter ethanol's effects in vesicles, mimicking the findings of previous electrophysiological measurements.
Edit intent: fluency
Original:  Second, we show that two previously described `intoxication reversers' raise T_c in vesicles and counter ethanol's effects in vesicles, mimicking the findings of previous electrophysiological  measurements.
Revised:  Second, we show that two previously described `intoxication reversers' raise T_c in vesicles and counter ethanol's effects in vesicles, mimicking the findings of previous electrophysiological and behavioral measurements.
Edit intent: meaning-changed
Original:  Third, we find that hydrostatic pressure, long known to reverse anesthesia, also raises T_c in vesicles with a magnitude that counters the effect of an anesthetic at relevant concentrations and pressures.
Revised:  Third, we find that hydrostatic pressure, long known to reverse anesthesia, also raises T_c in vesicles with a magnitude that counters the effect of butanol at relevant concentrations and pressures.
Edit intent: meaning-changed
Original:  Taken togetner , these results demonstrate that \Delta T_c predicts anesthetic potency for n-alcohols better than hydrophobicity in a range of contexts, supporting a mechanistic role for membrane heterogeneity in general anesthesia.
Revised:  Taken together , these results demonstrate that \Delta T_c predicts anesthetic potency for n-alcohols better than hydrophobicity in a range of contexts, supporting a mechanistic role for membrane heterogeneity in general anesthesia.
Edit intent: clarity
Original:  The existence of such a scheme, whose practical value is tempered by its use of the Axiom of Choice , shows that imposing regularity conditions (such as measurability) is essential even in the foundations of game-theoretic probability .
Revised:  For simplicity the interest rate is assumed zero. If the price path is assumed continuous, the trader can become infinitely rich immediately after it becomes non-constant (if it ever does). If it is assumed positive, he can become infinitely rich immediately after reaching a point in time such that the variation of the log price is infinite in any right neighbourhood of that point (whereas reaching a point in time such that the variation of the log price is infinite in any left neighbourhood of that point is not sufficient). The practical value of these schemes is tempered by its use of the Axiom of Choice , shows that imposing regularity conditions (such as measurability) is essential even in the foundations of game-theoretic probability .
Edit intent: meaning-changed
Original:  The existence of such a scheme, whose practical value is tempered by its use of the Axiom of Choice , shows that imposing regularity conditions (such as measurability) is essential even in the foundations of game-theoretic probability .
Revised:  The existence of such a scheme, whose practical value is tempered by their use of the Axiom of Choice , shows that imposing regularity conditions (such as measurability) is essential even in the foundations of game-theoretic probability .
Edit intent: fluency
Original: Network enrichment analysis (NEA) is a powerful method, that integrates gene enrichment analysis with information on dependences between genes . Existing tests for NEA rely on normality assumptions, they can deal only with undirected networks and are computationally slow .
Revised: Network enrichment analysis is a powerful method, that integrates gene enrichment analysis with information on dependences between genes . Existing tests for NEA rely on normality assumptions, they can deal only with undirected networks and are computationally slow .
Edit intent: clarity
Original: Network enrichment analysis (NEA) is a powerful method, that integrates gene enrichment analysis with information on dependences between genes . Existing tests for NEA rely on normality assumptions, they can deal only with undirected networks and are computationally slow .
Revised: Network enrichment analysis (NEA) is a powerful method, which allows to integrate gene enrichment analysis with information on dependences between genes . Existing tests for NEA rely on normality assumptions, they can deal only with undirected networks and are computationally slow .
Edit intent: clarity
Original: Network enrichment analysis (NEA) is a powerful method, that integrates gene enrichment analysis with information on dependences between genes . Existing tests for NEA rely on normality assumptions, they can deal only with undirected networks and are computationally slow .
Revised: Network enrichment analysis (NEA) is a powerful method, that integrates gene enrichment analysis with the information on relationships between genes that is provided by gene networks . Existing tests for NEA rely on normality assumptions, they can deal only with undirected networks and are computationally slow .
Edit intent: clarity
Original: Network enrichment analysis (NEA) is a powerful method, that integrates gene enrichment analysis with information on dependences between genes . Existing tests for NEA rely on normality assumptions, they can deal only with undirected networks and are computationally slow .
Revised: Network enrichment analysis (NEA) is a powerful method, that integrates gene enrichment analysis with information on dependences between genes . Existing tests for network enrichment analysis deal only with undirected networks and are computationally slow .
Edit intent: coherence
Original: Network enrichment analysis (NEA) is a powerful method, that integrates gene enrichment analysis with information on dependences between genes . Existing tests for NEA rely on normality assumptions, they can deal only with undirected networks and are computationally slow .
Revised: Network enrichment analysis (NEA) is a powerful method, that integrates gene enrichment analysis with information on dependences between genes . Existing tests for NEA rely on normality assumptions, they can deal only with undirected networks , they can be computationally slow and are based on normality assumptions .
Edit intent: clarity
Original:  We propose PNEA, an alternative test based on the hypergeometric distribution . PNEA can be applied also to directed and mixed networks , and our simulations show that it is faster and more powerful than existing NEA tests.
Revised:  We propose NEAT, a test for network enrichment analysis. The test is based on the hypergeometric distribution . PNEA can be applied also to directed and mixed networks , and our simulations show that it is faster and more powerful than existing NEA tests.
Edit intent: meaning-changed
Original:  We propose PNEA, an alternative test based on the hypergeometric distribution . PNEA can be applied also to directed and mixed networks , and our simulations show that it is faster and more powerful than existing NEA tests.
Revised:  We propose PNEA, an alternative test based on the hypergeometric distribution , which naturally arises as the null distribution in this context. NEAT can be applied also to directed and mixed networks , and our simulations show that it is faster and more powerful than existing NEA tests.
Edit intent: meaning-changed
Original:  We propose PNEA, an alternative test based on the hypergeometric distribution . PNEA can be applied also to directed and mixed networks , and our simulations show that it is faster and more powerful than existing NEA tests.
Revised:  We propose PNEA, an alternative test based on the hypergeometric distribution . PNEA can be applied not only to undirected, but to directed and partially directed networks as well. Our simulations indicate that NEAT is considerably faster than alternative resampling-based methods, and that its capacity to detect enrichments is at least as good as the one of alternative tests. We discuss applications of NEAT to network analyses in yeast by testing for enrichment of the Environmental Stress Response target gene set with GO Slim and KEGG functional gene sets, and also by testing for associations between GO Slim categories themselves. NEAT is a flexible and efficient test for network enrichment analysis that aims to overcome some limitations of existing resampling-based tests.
Edit intent: meaning-changed
Original:  The method is implemented in the R package pnea, that can be freely downloaded from CRAN repositories. Application to genetic data shows that PNEA detects most of the enrichments that are found with traditional GEA tests, and unveils some further enrichments that would be overlooked, if dependences between genes were ignored.
Revised:  The method is implemented in the R package pnea, that can be freely downloaded from CRAN URL
Edit intent: meaning-changed
Original:  But our recently published experimental findings obtained from Plasmodium falciparum strongly suggest the existence of DNA to DNA transcription in the genome of eukaryotic cells, which could shed some light on the mystery of large amounts of noncoding DNA in the human and other eukaryotic genomes.
Revised:  But our recently published experimental findings obtained from Plasmodium falciparum strongly suggest the existence of DNA to DNA transcription in the genome of eukaryotic cells, which could shed some light on the functions of large amounts of noncoding DNA in the human and other eukaryotic genomes.
Edit intent: clarity
Original:  Two other articles report creation of a magnetically-gated ion channel by attaching ferritin to an ion channel and pulling on the ferritin with a magnetic field (Stanley et al., 2015;
Revised:  Two other articles report creation of a magnetically-gated ion channel by attaching ferritin to an ion channel protein and then tugging the ferritin or heating it with a magnetic field (Stanley et al., 2015;
Edit intent: meaning-changed
Original: The Extended Yard-Sale Model of asset exchange is an agent-based economic model with binary transactions, and simple models of redistribution and Wealth-Attained Advantage. As recently shown, the model exhibits a second-order phase transition to a coexistence regime with partial wealth condensation. The evolution of its wealth distribution is described by a nonlinear, nonlocal Fokker-Planck equation.
Revised: The Extended Yard-Sale Model of asset exchange is an agent-based , binary-transaction Asset-Exchange Model (AEM) for wealth distribution that allows for agents with negative wealth. This model retains certain features of prior AEMs such as redistribution and wealth-attained advantage, but it also allows for shifts as well as scalings of the agent density function. We derive the Fokker-Planck equation.
Edit intent: meaning-changed