wanyu/IteraTeR_full_sent huggingface dataset:
Original:  The predictability of the model is also tested on bovine rhodopsin, the prototype of the G protein coupled receptor (GPCR) family also sensitive to the light, with results exhibiting the opposite behaviour of a decrease of conductance in the presence of light.
Revised:  The predictability of the model is also tested on bovine rhodopsin, the prototype of the G protein coupled receptor (GPCR) family also sensitive to light. In this case, results show an opposite behaviour with a decrease of conductance in the presence of light.
Edit intent: clarity
Original:  This point of view reveals misunderstandings about this model of a recycled system, overlooks the possibility of energy exchanges that could take place in prebiotic systems, and leads the authors to unawarely remove the activation reaction and energy source from their `` non-equilibrium '' models.
Revised:  This point of view reveals misunderstandings about this model of a recycled system, overlooks the possibility of energy exchanges that could take place in prebiotic systems, and leads the authors to unawarely remove the activation reaction and energy source from their " non-equilibrium '' models.
Edit intent: fluency
Original:  This point of view reveals misunderstandings about this model of a recycled system, overlooks the possibility of energy exchanges that could take place in prebiotic systems, and leads the authors to unawarely remove the activation reaction and energy source from their `` non-equilibrium '' models.
Revised:  This point of view reveals misunderstandings about this model of a recycled system, overlooks the possibility of energy exchanges that could take place in prebiotic systems, and leads the authors to unawarely remove the activation reaction and energy source from their `` non-equilibrium " models.
Edit intent: fluency
Original:  In this simple asymmetric multicore model we study the problem of executing parallel programs that are represented as DAGs or chains of tasks .
Revised:  In this simple asymmetric multicore model we study the problem of scheduling tasks with dependencies in multiprocessor architectures where processors have different speeds. We present the preemptive algorithm "Save-Energy" that given a schedule of tasks it post processes it to improve the energy efficiency without any deterioration of the makespan. In terms of time efficiency, we show that preemptive scheduling in an asymmetric system can achieve the same or better optimal makespan than in a symmetric system. Motivited by real multiprocessor systems, we investigate architectures that exhibit limited asymmetry: there are two essentially different speeds .
Edit intent: meaning-changed
Original:  We assume 2 (essential) speeds in our proposed platform. We relax this assumption and consider many speedsin our energy considerations. This problem has been considered previously in the field of parallel computing and scheduling theory for the general case where multiprocessor platforms have K distinct speeds.
Revised:  Interestingly, this special case has not been studied in the field of parallel computing and scheduling theory for the general case where multiprocessor platforms have K distinct speeds.
Edit intent: coherence
Original:  This problem has been considered previously in the field of parallel computing and scheduling theory for the general case where multiprocessor platforms have K distinct speeds. Our model is a bridge between the assumptions in these fields and recent advances in multicore processors technology .
Revised:  This problem has been considered previously in the field of parallel computing and scheduling theory for the general case was studied where processors have K essentially different speeds. We present the non-preemptive algorithm ``Remnants'' that achieves almost optimal makespan .
Edit intent: meaning-changed
Original: Stochastic differential equations are commonly used to describe the dynamics of diffusive systems. Since their introduction, they have also been considered natural candidates for the description of the dynamics of financial returns. In this context we analyze the problem of the analytical characterization of the still unknown probability distribution of returns of the exponential Ornstein-Uhlenbeck model with stochastic volatility , where the price is driven by a Geometric Brownian motion, whose diffusion coefficient is expressed as an exponential function of an hidden variable Y governed by an Ornstein-Uhlenbeck process.
Revised: We analyze the problem of the analytical characterization of the still unknown probability distribution of returns of the exponential Ornstein-Uhlenbeck model with stochastic volatility , where the price is driven by a Geometric Brownian motion, whose diffusion coefficient is expressed as an exponential function of an hidden variable Y governed by an Ornstein-Uhlenbeck process.
Edit intent: clarity
Original:  In this context we analyze the problem of the analytical characterization of the still unknown probability distribution of returns of the exponential Ornstein-Uhlenbeck model with stochastic volatility , where the price is driven by a Geometric Brownian motion, whose diffusion coefficient is expressed as an exponential function of an hidden variable Y governed by an Ornstein-Uhlenbeck process.
Revised:  In this context we analyze the problem of the analytical characterization of the probability distribution of returns of the exponential Ornstein-Uhlenbeck model with stochastic volatility , where the price is driven by a Geometric Brownian motion, whose diffusion coefficient is expressed as an exponential function of an hidden variable Y governed by an Ornstein-Uhlenbeck process.
Edit intent: clarity
Original:  In this context we analyze the problem of the analytical characterization of the still unknown probability distribution of returns of the exponential Ornstein-Uhlenbeck model with stochastic volatility , where the price is driven by a Geometric Brownian motion, whose diffusion coefficient is expressed as an exponential function of an hidden variable Y governed by an Ornstein-Uhlenbeck process.
Revised:  In this context we analyze the problem of the analytical characterization of the still unknown probability distribution of financial returns in the exponential Ornstein-Uhlenbeck model with stochastic volatility , where the price is driven by a Geometric Brownian motion, whose diffusion coefficient is expressed as an exponential function of an hidden variable Y governed by an Ornstein-Uhlenbeck process.
Edit intent: meaning-changed
Original:  In this context we analyze the problem of the analytical characterization of the still unknown probability distribution of returns of the exponential Ornstein-Uhlenbeck model with stochastic volatility , where the price is driven by a Geometric Brownian motion, whose diffusion coefficient is expressed as an exponential function of an hidden variable Y governed by an Ornstein-Uhlenbeck process.
Revised:  In this context we analyze the problem of the analytical characterization of the still unknown probability distribution of returns of the exponential Ornstein-Uhlenbeck model with stochastic volatility . In this model the prices are driven by a Geometric Brownian motion, whose diffusion coefficient is expressed as an exponential function of an hidden variable Y governed by an Ornstein-Uhlenbeck process.
Edit intent: clarity
Original:  In this context we analyze the problem of the analytical characterization of the still unknown probability distribution of returns of the exponential Ornstein-Uhlenbeck model with stochastic volatility , where the price is driven by a Geometric Brownian motion, whose diffusion coefficient is expressed as an exponential function of an hidden variable Y governed by an Ornstein-Uhlenbeck process.
Revised:  In this context we analyze the problem of the analytical characterization of the still unknown probability distribution of returns of the exponential Ornstein-Uhlenbeck model with stochastic volatility , where the price is driven by a Geometric Brownian motion, whose diffusion coefficient is expressed through an exponential function of an hidden variable Y governed by an Ornstein-Uhlenbeck process.
Edit intent: clarity
Original:  In this context we analyze the problem of the analytical characterization of the still unknown probability distribution of returns of the exponential Ornstein-Uhlenbeck model with stochastic volatility , where the price is driven by a Geometric Brownian motion, whose diffusion coefficient is expressed as an exponential function of an hidden variable Y governed by an Ornstein-Uhlenbeck process.
Revised:  In this context we analyze the problem of the analytical characterization of the still unknown probability distribution of returns of the exponential Ornstein-Uhlenbeck model with stochastic volatility , where the price is driven by a Geometric Brownian motion, whose diffusion coefficient is expressed as an exponential function of an hidden variable Y governed by a mean-reverting process.
Edit intent: meaning-changed
Original:  The effectiveness of the analytical predictions is checked via a careful analysis of the parameters involved in the numerical implementation of the Euler-Maruyama scheme . Both analytical and numerical results we obtain can be exploited for useful applications in stock option pricing and risk management .
Revised:  The effectiveness of the analytical predictions is checked via a careful analysis of the parameters involved in the numerical implementation of the Euler-Maruyama scheme and is tested on a data set of financial indexes. In particular, we discuss results for the German DAX30 and Dow Jones Euro Stoxx 50, finding a good agreement between the empirical data and the theoretical description .
Edit intent: meaning-changed
Original:  It has been shown that AND-EXOR based Logic Arrays are C-Testable and size of test set is equal to number of entries in cell truth table .
Revised:  It has been shown that AND-EXOR based Logic Arrays are C-Testable and size of test set is equal to number of entries in cells truth table implying that the reversible ILAs are also Optimal-Testable, i.e. O-Testable .
Edit intent: meaning-changed
Original:   The test generation problem has been shown to be related to certain properties of cycles in a set of graphs derived from cell truth table.
Revised:  Uniform-Testability, i.e. U-Testability has been defined and Reversible Heterogeneous ILAs have been characterized as U-Testable. The test generation problem has been shown to be related to certain properties of cycles in a set of graphs derived from cell truth table.
Edit intent: meaning-changed
Original: Based on analogies with statistical physics and complexity theory, we have developed in the last decade an approach that diagnoses bubbles as transient super-exponential regimes. Here, We present an analysis of oil prices in US dollars and in other major currencies that diagnoses unsustainable faster-than-exponential behavior.
Revised:  We present an analysis of oil prices in US dollars and in other major currencies that diagnoses unsustainable faster-than-exponential behavior.
Edit intent: coherence
Original:  This provides evidence that the recent oil price run-up has been amplified by speculative behavior of the type found during a bubble-like expansion. 
Revised:  This provides evidence that the recent oil price run-up has been amplified by speculative behavior of the type found during a bubble-like expansion. We also attempt to unravel the information hidden in the oil supply-demand data reported by two leading agencies, the US Energy Information Administration (EIA) and the International Energy Agency (IEA). We suggest that the found increasing discrepancy between the EIA and IEA figures provides a measure of the estimation errors. Rather than a clear transition to a supply restricted regime, we interpret the discrepancy between the IEA and EIA as a signature of uncertainty, and there is no better fuel than uncertainty to promote speculation!
Edit intent: meaning-changed
Original:  Even in such a heavily simplified method, which disregards most of the dynamic aspects of biochemistry, one is faced with fundamental questions, such as how the chemical reaction systems should be reduced to a graph so that as much information as possible about the original network is retained.
Revised:  Even in such a heavily simplified method, which disregards most of the dynamic aspects of biochemistry, one is faced with fundamental questions, such as how the chemical reaction systems should be reduced to a graph retaining as much functional information as possible about the original network is retained.
Edit intent: clarity
Original:  Even in such a heavily simplified method, which disregards most of the dynamic aspects of biochemistry, one is faced with fundamental questions, such as how the chemical reaction systems should be reduced to a graph so that as much information as possible about the original network is retained. Vertices may represent either chemical substances, or reactions , or both .
Revised:  Even in such a heavily simplified method, which disregards most of the dynamic aspects of biochemistry, one is faced with fundamental questions, such as how the chemical reaction systems should be reduced to a graph so that as much information as possible from the original reaction system. In such graph representations, should the edges go between substrates and products, or substrates and substrates , or both .
Edit intent: clarity
Original:  Vertices may represent either chemical substances, or reactions , or both . A common practice in the analysis of metabolic networks is to preprocess the network by deleting so called currency metabolites -- abundant molecular species that react with a large number of metabolites. One of several reasons to do this is that they do not put any constraint on the reactions, and thus do not give much information of the higher order functionality of the system.
Revised:  Vertices may represent either chemical substances, or reactions , or both ? Should vertices represent substances or reactions? Different definitions encode different information about the reaction system.
Edit intent: meaning-changed
Original:  In this paper we evaluate different network representations of metabolism and describe their structure with respect to both modularity and currency metabolites .
Revised:  In this paper we evaluate different network representations of metabolism , applied to data from URLanisms and databases. The graph representations are evaluated by comparing the overlap between clusters (network modules) and annotated functions, and also by comparing the set of identified currency metabolites with those that other authors have identified using qualitative biological arguments .
Edit intent: meaning-changed
Original:  We find that a "substance network," where all metabolites participating in a reaction are connected, is a good trade-off between high functional overlap (between network modules and observed functions ) and a reasonable number of currency metabolites.
Revised:  We find that a "substance network," where all metabolites participating in a reaction are connected, is relatively better than others, evaluated both with respect to the functional overlap between modules and functions and to the number and identity of identified currency metabolites.
Edit intent: clarity
Original:  The interesting features of the solution are that it is available in a very explicit form, that for some parameter values the optimal strategy is more sophisticated than might originally be expected, and that although the set-up is based on continuous diffusions, the optimal martingale may involve a jump process.
Revised:  The interesting features of the solution are that it is available in a very explicit form, that for some parameter values the optimal strategy is more sophisticated than might originally be expected, and that although the setup is based on continuous diffusions, the optimal martingale may involve a jump process.
Edit intent: fluency
Original: This paper is a survey of recent progress in the theory of ruin for risk processes that earn investment return on invested assets  .
Revised: This survey treats the problem of ruin in a risk model when assets earn investment income. In addition to a general presentation of the problem, topics covered are a presentation of the relevant integro-differential equations, exact and numerical solutions, asymptotic results, bounds on the ruin probability and also the possibility of minimizing the ruin probability by investment and possibly reinsurance control. The main emphasis is on continuous time models, but discrete time models are also covered. A fairly extensive list of references is provided, particularly of papers published after 1998. For more references to papers published before that, the reader can consult .
Edit intent: meaning-changed
Original:  Most real-world networks show a number of properties, such as small-worldness or scale-free degree distribution, which are rather general features of networks  from molecules to the society . Based on extensive analogies I propose that the existing findings and methodology  enable us to detect active centres in cells,  social networks and ecosystems.
Revised:  Most real-world networks show a number of properties, such as small-worldness or scale-free degree distribution, which are rather general features of networks from molecules to society at large. Using analogy I propose that the existing findings and methodology enable us to detect active centres in cells, social networks and ecosystems.
Edit intent: clarity
Original:  Members of these active centres are  creative elements of the respective networks, which may help them to survive unprecedented, novel challenges, and play a key role in the development, survival and evolvability of complex systems.
Revised:  Members of these active centres are termed here as creative elements of the respective networks, which may help them to survive unprecedented, novel challenges, and play a key role in the development, survival and evolvability of complex systems.
Edit intent: clarity
Original: We address two issues that puzzled moral and socio-economic thinking since antiquity. The first of the puzzles is the emergence and selection fitness of altruist behavior in a world of self-reproducing individuals (or capital,etc.; memes in general). The second is the sustainability of growth and the survival in a stochastic world where along with large gains individuals incur often very large and even total losses. We show that the solution for each of these puzzles lies within the other one. It is known that in a multiplicative random process even if in the mathematical evaluation of the expected gain the wins overwhelm the losses, one is likely to be faced with extinction.For example if the probability of a total loss event is arbitrarily small but finite, the measure of histories with non-vanishing gains approaches 0 for asymptotic times >.
Revised: Most of real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the measure of histories with non-vanishing gains approaches 0 for asymptotic times >.
Edit intent: clarity
Original: For example if the probability of a total loss event is arbitrarily small but finite, the measure of histories with non-vanishing gains approaches 0 for asymptotic times >. Thus the optimistic theoretical expectation is dominated by event chains whose probability is too small to happen in reality. We find that in those situations, there is a way to insure self survival. The individuals can insure continuous, unlimited growth by sharing their gains/losses after each step of the random process. We compute the minimal necessary sharing group size Ncrit . Usually, in order to make "sharing" a stable profitable strategy, one has to introduce a credible punishment (/reward) mechanism that can be trusted by the individuals. However, such coercion is incompatible with the concept of real altruism. In a group of Ncrit individuals , defection by one individual leads automatically, thus credibly, to the ruin of the entire group (including the defector) . Consequently sharing becomes the only stable survivalstrategy without the need of any additional enforcing mechanism. This implies the survival and thriving of "altruistic genes" for very long evolutionary periods .
Revised: For example if the probability of a total loss event is arbitrarily small but finite, the parameters influencing their dynamics. While in the physical systems the random component is usually additive (e.g. molecules can absorb or emit spontaneously energy quanta), in biological, social, economic and financial systems the noise is mainly multiplicative. The special properties of multiplicative noise as opposed to the additive noise have been noticed for a long while. Even though apparently and formally the difference between free additive vs. multiplicative random walks consists in just a move from normal to log-normal distributions, in practice the implications are much more far reaching. In the present paper we study in some detail the difference between the emergence of cooperation in additive vs. multiplicative random environments. While in an additive context the emergence and survival of cooperation requires special conditions (especially some level of reward, punishment, reciprocity), we find that in the multiplicative random context the emergence of cooperation is much more natural and effective. In fact given a set of individuals that play independently and repeatedly a game where they can gain by a factor a>1 with probability p or loose by a factor b<1 with probability q=1-p, one can show that for a^p b^q < 1 < pa +q b the cooperation makes the difference between extinction and (thriving) survival. We study quantitatively the various implications of this observation and its applications in various contexts .
Edit intent: meaning-changed
Original:  In fact given a set of individuals that play independently and repeatedly a game where they can gain by a factor a>1 with probability p or loose by a factor b<1 with probability q=1-p, one can show that for a^p b^q < 1 < pa +q b the cooperation makes the difference between extinction and (thriving) survival. We study quantitatively the various implications of this observation and its applications in various contexts.
Revised:  We study the various implications of this observation and its applications in various contexts.
Edit intent: coherence
Original: Constraint-based modelling of metabolic networks often gives rise to a linear programming problem. Mathematically, there always exists a dual to any linear programming problem, with dual variables known as shadow prices. Here we analyse the structure of the dual problem and the properties of the shadow prices, for typical constraint-based metabolic models. We apply our results to a representative set of recent genome-scale metabolic reconstructions. The dual problem is found to have an elegant structure. The shadow prices are to be interpreted as yield coefficients Varma and Palsson, J. theor.
Revised:  Varma and Palsson, J. theor.
Edit intent: meaning-changed
Original:  The shadow prices are to be interpreted as yield coefficients Varma and Palsson, J. theor. Biol. v165, 477; 503 (1993)%DIFDELCMD < ]%%% . In combination with reaction fluxes , they can be used to decorate the metabolic model with a yield flux network.
Revised:  The shadow prices are to be interpreted as yield coefficients %DIFDELCMD < ]%%% . In combination with reaction fluxes , they can be used to decorate the metabolic model with a yield flux network.
Edit intent: coherence