before_sent
stringlengths 0
50.4k
| before_sent_with_intent
stringlengths 10
50.5k
| after_sent
stringlengths 0
50.6k
| labels
stringclasses 5
values | confidence
stringlengths 5
10
| doc_id
stringlengths 2
10
| revision_depth
stringclasses 5
values |
|---|---|---|---|---|---|---|
We introduce a new stochastic model of the proteasomal transport. We account for the protein translocation and the topology of the positioning of cleavage centers of a proteasome from first principles. | <meaning-changed> We introduce a new stochastic model of the proteasomal transport. We account for the protein translocation and the topology of the positioning of cleavage centers of a proteasome from first principles. | We introduce a new stochastic model of the proteasomal digestion (cleavage) of proteins. In this model we account for the protein translocation and the topology of the positioning of cleavage centers of a proteasome from first principles. | meaning-changed | 0.99912566 | 0804.0682 | 1 |
We account for the protein translocation and the topology of the positioning of cleavage centers of a proteasome from first principles. | <clarity> We account for the protein translocation and the topology of the positioning of cleavage centers of a proteasome from first principles. | We account for the protein translocation and the positioning of cleavage centers of a proteasome from first principles. | clarity | 0.9990588 | 0804.0682 | 1 |
We account for the protein translocation and the topology of the positioning of cleavage centers of a proteasome from first principles. | <clarity> We account for the protein translocation and the topology of the positioning of cleavage centers of a proteasome from first principles. | We account for the protein translocation and the topology of the positioning of cleavage sites of a proteasome from first principles. | clarity | 0.99626523 | 0804.0682 | 1 |
We show by test examples and by a comparison with experimental data that our model allows reconstruction of the translocation rates from mass spectroscopy data on digestion patterns and can be used to investigate the properties of transport in different experimental set-ups. | <clarity> We show by test examples and by a comparison with experimental data that our model allows reconstruction of the translocation rates from mass spectroscopy data on digestion patterns and can be used to investigate the properties of transport in different experimental set-ups. | We show by test examples and by processing experimental data that our model allows reconstruction of the translocation rates from mass spectroscopy data on digestion patterns and can be used to investigate the properties of transport in different experimental set-ups. | clarity | 0.99797803 | 0804.0682 | 1 |
We show by test examples and by a comparison with experimental data that our model allows reconstruction of the translocation rates from mass spectroscopy data on digestion patterns and can be used to investigate the properties of transport in different experimental set-ups. | <meaning-changed> We show by test examples and by a comparison with experimental data that our model allows reconstruction of the translocation rates from mass spectroscopy data on digestion patterns and can be used to investigate the properties of transport in different experimental set-ups. | We show by test examples and by a comparison with experimental data that our model allows reconstruction of the translocation and cleavage rates from mass spectroscopy data on digestion patterns and can be used to investigate the properties of transport in different experimental set-ups. | meaning-changed | 0.9993807 | 0804.0682 | 1 |
Finally we design an experimental set-up for a synthetic polypeptide with a periodic sequence of amino acids which enables more reliable determination of translocation rates . | <clarity> Finally we design an experimental set-up for a synthetic polypeptide with a periodic sequence of amino acids which enables more reliable determination of translocation rates . | Detailed investigation with this model will enable theoretical quantitative prediction of the proteasomal activity . | clarity | 0.98456085 | 0804.0682 | 1 |
DNA inversion is an important mechanism by which bacteria and bacteriophage switch reversibly between alternative phenotypic states. | <clarity> DNA inversion is an important mechanism by which bacteria and bacteriophage switch reversibly between alternative phenotypic states. | DNA inversion is an important mechanism by which bacteria and bacteriophage switch reversibly between phenotypic states. | clarity | 0.997609 | 0804.1034 | 1 |
Orientational control causes the switch to deviate from Poissonian behaviour: the distribution of times in the on state shows a peak and successive flip times are correlated . This model should provide a framework for understanding how DNA inversion switch architecture determines switch flipping statistics, with relevance to the role of such switches in microbial population dynamics . | <clarity> Orientational control causes the switch to deviate from Poissonian behaviour: the distribution of times in the on state shows a peak and successive flip times are correlated . This model should provide a framework for understanding how DNA inversion switch architecture determines switch flipping statistics, with relevance to the role of such switches in microbial population dynamics . | Orientational control causes the switch to deviate from Poissonian behaviour: the distribution of times in the on state shows a peak and successive flip times are correlated . | clarity | 0.98372895 | 0804.1034 | 1 |
Recent {\it in-vivo} experiments with single cells have established that transcription takes place in ``bursts'' or ``pulses'' . In this letter we present a model that captures not only the mechano-chemistry of individual RNAPs and their steric interactions but also the switching of the gene between the ON and OFF states. | <fluency> Recent {\it in-vivo} experiments with single cells have established that transcription takes place in ``bursts'' or ``pulses'' . In this letter we present a model that captures not only the mechano-chemistry of individual RNAPs and their steric interactions but also the switching of the gene between the ON and OFF states. | Recent {\it in-vivo} experiments with single cells have established that transcription takes place in "bursts" or "pulses" . In this letter we present a model that captures not only the mechano-chemistry of individual RNAPs and their steric interactions but also the switching of the gene between the ON and OFF states. | fluency | 0.9991762 | 0804.1227 | 1 |
Charge transport modification exhibiting an increase of conductance activated by an external green light in Bacteriorhodopsin is correlated to its conformational change. | <meaning-changed> Charge transport modification exhibiting an increase of conductance activated by an external green light in Bacteriorhodopsin is correlated to its conformational change. | When moving from native to light activated bacteriorhodopsin, modification of charge transport consisting of an increase of conductance activated by an external green light in Bacteriorhodopsin is correlated to its conformational change. | meaning-changed | 0.9155678 | 0804.1720 | 1 |
Charge transport modification exhibiting an increase of conductance activated by an external green light in Bacteriorhodopsin is correlated to its conformational change. | <clarity> Charge transport modification exhibiting an increase of conductance activated by an external green light in Bacteriorhodopsin is correlated to its conformational change. | Charge transport modification exhibiting an increase of conductance is correlated to its conformational change. | clarity | 0.9986534 | 0804.1720 | 1 |
Charge transport modification exhibiting an increase of conductance activated by an external green light in Bacteriorhodopsin is correlated to its conformational change. | <clarity> Charge transport modification exhibiting an increase of conductance activated by an external green light in Bacteriorhodopsin is correlated to its conformational change. | Charge transport modification exhibiting an increase of conductance activated by an external green light in Bacteriorhodopsin is correlated to the protein conformational change. | clarity | 0.9980869 | 0804.1720 | 1 |
A theoretical model based on a map of the protein structure into a resistor network is implemented to account for a sequential tunneling mechanism of charge transfer through neighbouring amino-acids . | <meaning-changed> A theoretical model based on a map of the protein structure into a resistor network is implemented to account for a sequential tunneling mechanism of charge transfer through neighbouring amino-acids . | A theoretical model based on a map of the protein tertiary structure into a resistor network is implemented to account for a sequential tunneling mechanism of charge transfer through neighbouring amino-acids . | meaning-changed | 0.99938905 | 0804.1720 | 1 |
A theoretical model based on a map of the protein structure into a resistor network is implemented to account for a sequential tunneling mechanism of charge transfer through neighbouring amino-acids . | <fluency> A theoretical model based on a map of the protein structure into a resistor network is implemented to account for a sequential tunneling mechanism of charge transfer through neighbouring amino-acids . | A theoretical model based on a map of the protein structure into a resistor network is implemented to account for a sequential tunneling mechanism of charge transfer through neighbouring amino acids . | fluency | 0.9991221 | 0804.1720 | 1 |
The model is validated by comparison with current-voltage experiments and provides for the potential barriers involved in the charge transfer an average height of 69 meV over an interacting radius of 6 \aa . | <coherence> The model is validated by comparison with current-voltage experiments and provides for the potential barriers involved in the charge transfer an average height of 69 meV over an interacting radius of 6 \aa . | The model is validated by comparison with current-voltage experiments . | coherence | 0.81410074 | 0804.1720 | 1 |
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. | <clarity> 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. | The predictability of the model is further 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. | clarity | 0.9828084 | 0804.1720 | 1 |
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. | <clarity> 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. | The predictability of the model is also tested on bovine rhodopsin, a 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. | clarity | 0.9989034 | 0804.1720 | 1 |
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. | <clarity> 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. | The predictability of the model is also tested on bovine rhodopsin, the prototype of the G protein coupled receptor (GPCR) also sensitive to the light, with results exhibiting the opposite behaviour of a decrease of conductance in the presence of light. | clarity | 0.9990928 | 0804.1720 | 1 |
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. | <clarity> 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. | 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. | clarity | 0.97374207 | 0804.1720 | 1 |
The numeraire portfolio in a financial market is the unique positive wealth process that makes all other nonnegative wealth processes supermartingales , when deflated by it . | <clarity> The numeraire portfolio in a financial market is the unique positive wealth process that makes all other nonnegative wealth processes supermartingales , when deflated by it . | The numeraire portfolio in a financial market is the unique positive wealth process that makes all other nonnegative wealth processes , when deflated by it . | clarity | 0.8838496 | 0804.2912 | 1 |
The numeraire portfolio in a financial market is the unique positive wealth process that makes all other nonnegative wealth processes supermartingales , when deflated by it . | <fluency> The numeraire portfolio in a financial market is the unique positive wealth process that makes all other nonnegative wealth processes supermartingales , when deflated by it . | The numeraire portfolio in a financial market is the unique positive wealth process that makes all other nonnegative wealth processes supermartingales , when deflated by it , supermartingales . | fluency | 0.9915302 | 0804.2912 | 1 |
In a financial market with continuous-path asset prices, the stable behavior of the numeraire portfolio is established when each of the aforementioned market parameters is changed in an infinitesimal way. | <clarity> In a financial market with continuous-path asset prices, the stable behavior of the numeraire portfolio is established when each of the aforementioned market parameters is changed in an infinitesimal way. | In a financial market with continuous-path asset prices, we establish the stable behavior of the numeraire portfolio is established when each of the aforementioned market parameters is changed in an infinitesimal way. | clarity | 0.9980465 | 0804.2912 | 1 |
In a financial market with continuous-path asset prices, the stable behavior of the numeraire portfolio is established when each of the aforementioned market parameters is changed in an infinitesimal way. | <clarity> In a financial market with continuous-path asset prices, the stable behavior of the numeraire portfolio is established when each of the aforementioned market parameters is changed in an infinitesimal way. | In a financial market with continuous-path asset prices, the stable behavior of the numeraire portfolio when each of the aforementioned market parameters is changed in an infinitesimal way. | clarity | 0.99835986 | 0804.2912 | 1 |
Recent works on the emergence of homochirality introduce the concept of recycling, rather than the traditional open-flow system described by Frank. | <meaning-changed> Recent works on the emergence of homochirality introduce the concept of recycling, rather than the traditional open-flow system described by Frank. | The question of the onset of the homochirality on prebiotic Earth still remains a fundamental question in the quest for the origin of life. Recent works in this field introduce the concept of recycling, rather than the traditional open-flow system described by Frank. | meaning-changed | 0.9965922 | 0804.3939 | 1 |
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. | <fluency> 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. | 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. | fluency | 0.9993387 | 0804.3939 | 1 |
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. | <fluency> 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. | 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. | fluency | 0.99930537 | 0804.3939 | 1 |
In this work we model multicore platforms as chip multiprocessors made up from two different types cores; each type of cores has different computation capabilities. In this simple asymmetric multicore model we study the problem of executing parallel programs that are represented as DAGs or chains of tasks . | <clarity> In this work we model multicore platforms as chip multiprocessors made up from two different types cores; each type of cores has different computation capabilities. In this simple asymmetric multicore model we study the problem of executing parallel programs that are represented as DAGs or chains of tasks . | In this work we study the problem of executing parallel programs that are represented as DAGs or chains of tasks . | clarity | 0.896487 | 0804.4039 | 1 |
In this simple asymmetric multicore model we study the problem of executing parallel programs that are represented as DAGs or chains of tasks . | <meaning-changed> In this simple asymmetric multicore model we study the problem of executing parallel programs that are represented as DAGs or chains of tasks . | 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 . | meaning-changed | 0.9982863 | 0804.4039 | 1 |
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. | <coherence> 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. | 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. | coherence | 0.8322832 | 0804.4039 | 1 |
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. | <clarity> 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. | This problem has been considered previously in the field of parallel computing and scheduling theory ; only the general case where multiprocessor platforms have K distinct speeds. | clarity | 0.7905505 | 0804.4039 | 1 |
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 . | <meaning-changed> 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 . | 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 . | meaning-changed | 0.997109 | 0804.4039 | 1 |
Based on this analysis, we specialize the scheduling policy and provide an algorithm of (3 o(1)) expected approximation factor. | <meaning-changed> Based on this analysis, we specialize the scheduling policy and provide an algorithm of (3 o(1)) expected approximation factor. | Based on this analysis, we specialize the scheduling policy and provide an algorithm of (3 + o(1)) expected approximation factor. | meaning-changed | 0.9923151 | 0804.4039 | 1 |
Note that this improves the previous best factor (6 for two speeds) . | <meaning-changed> Note that this improves the previous best factor (6 for two speeds) . | Note that this improves the previous best factor (6 for two speeds) . We believe that our work will convince researchers to revisit this well studied scheduling problem for these simple, yet realistic, asymmetric multiprocessor architectures . | meaning-changed | 0.99818146 | 0804.4039 | 1 |
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. | <clarity> 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. | 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. | clarity | 0.99240077 | 0805.0540 | 1 |
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. | <clarity> 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. | 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. | clarity | 0.9918228 | 0805.0540 | 1 |
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. | <meaning-changed> 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. | 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. | meaning-changed | 0.94775534 | 0805.0540 | 1 |
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. | <clarity> 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. | 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. | clarity | 0.7373422 | 0805.0540 | 1 |
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. | <clarity> 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. | 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. | clarity | 0.99786216 | 0805.0540 | 1 |
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. | <meaning-changed> 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. | 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. | meaning-changed | 0.9981725 | 0805.0540 | 1 |
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 . | <meaning-changed> 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 . | 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 . | meaning-changed | 0.9993643 | 0805.0540 | 1 |
AND-EXOR based circuits are of interest in the design of very low power circuits where energy loss implied by high frequency switching is of much consideration. | <meaning-changed> AND-EXOR based circuits are of interest in the design of very low power circuits where energy loss implied by high frequency switching is of much consideration. | Reversible circuits are of interest in the design of very low power circuits where energy loss implied by high frequency switching is of much consideration. | meaning-changed | 0.9976961 | 0805.1293 | 1 |
AND-EXOR based circuits are of interest in the design of very low power circuits where energy loss implied by high frequency switching is of much consideration. | <clarity> AND-EXOR based circuits are of interest in the design of very low power circuits where energy loss implied by high frequency switching is of much consideration. | AND-EXOR based circuits are of interest in the design of very low power circuits where energy loss implied by high frequency switching is not of much consideration. | clarity | 0.994052 | 0805.1293 | 1 |
This paper examines the testability of AND-EXOR based Iterative Logic Arrays (ILAs) . | <meaning-changed> This paper examines the testability of AND-EXOR based Iterative Logic Arrays (ILAs) . | Reversibility is essential for Quantum Computing. This paper examines the testability of AND-EXOR based Iterative Logic Arrays (ILAs) . | meaning-changed | 0.99926084 | 0805.1293 | 1 |
This paper examines the testability of AND-EXOR based Iterative Logic Arrays (ILAs) . | <meaning-changed> This paper examines the testability of AND-EXOR based Iterative Logic Arrays (ILAs) . | This paper examines the testability of Reversible Iterative Logic Arrays (ILAs) . | meaning-changed | 0.9993819 | 0805.1293 | 1 |
This paper examines the testability of AND-EXOR based Iterative Logic Arrays (ILAs) . | <meaning-changed> This paper examines the testability of AND-EXOR based Iterative Logic Arrays (ILAs) . | This paper examines the testability of AND-EXOR based Iterative Logic Arrays (ILAs) composed of reversible k-CNOT gates . | meaning-changed | 0.999418 | 0805.1293 | 1 |
Former type of ILAs is known as Constant-Testable ( C-Testable ) . | <clarity> Former type of ILAs is known as Constant-Testable ( C-Testable ) . | Former type of ILAs is known as Constant-Testable , i.e. C-Testable ) . | clarity | 0.92867 | 0805.1293 | 1 |
Former type of ILAs is known as Constant-Testable ( C-Testable ) . | <fluency> Former type of ILAs is known as Constant-Testable ( C-Testable ) . | Former type of ILAs is known as Constant-Testable ( C-Testable . | fluency | 0.999244 | 0805.1293 | 1 |
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 . | <meaning-changed> 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 . | It has been shown that Reversible Logic Arrays are C-Testable and size of test set is equal to number of entries in cell truth table . | meaning-changed | 0.9988493 | 0805.1293 | 1 |
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 . | <meaning-changed> 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 . | 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 . | meaning-changed | 0.99940395 | 0805.1293 | 1 |
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. | <meaning-changed> 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. | 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. | meaning-changed | 0.99946135 | 0805.1293 | 1 |
By careful analysis of these cycles an efficient test generation technique that can be easily converted to an ATPG program has been presented for both 1D and 2D ILAs. | <fluency> By careful analysis of these cycles an efficient test generation technique that can be easily converted to an ATPG program has been presented for both 1D and 2D ILAs. | By careful analysis of these cycles an efficient test generation technique that can be easily converted to an ATPG program has been presented for both 1-D and 2D ILAs. | fluency | 0.99917775 | 0805.1293 | 1 |
How this property of ILAs can be used for testing FPGAs has also been discussed.Keywords - C-Testable, Iterative Logic Arrays, Bijective, Test Generation, ATPG | <meaning-changed> How this property of ILAs can be used for testing FPGAs has also been discussed.Keywords - C-Testable, Iterative Logic Arrays, Bijective, Test Generation, ATPG | The same algorithms can be easily extended for n-Dimensional Reversible ILAs. | meaning-changed | 0.9848032 | 0805.1293 | 1 |
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. | <coherence> 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. | We present an analysis of oil prices in US dollars and in other major currencies that diagnoses unsustainable faster-than-exponential behavior. | coherence | 0.8906722 | 0806.1170 | 1 |
Here, We present an analysis of oil prices in US dollars and in other major currencies that diagnoses unsustainable faster-than-exponential behavior. | <clarity> Here, We present an analysis of oil prices in US dollars and in other major currencies that diagnoses unsustainable faster-than-exponential behavior. | Here, We present an analysis of oil prices in US and in other major currencies that diagnoses unsustainable faster-than-exponential behavior. | clarity | 0.99767953 | 0806.1170 | 1 |
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. | <clarity> 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. | This supports the hypothesis that the recent oil price run-up has been amplified by speculative behavior of the type found during a bubble-like expansion. | clarity | 0.9981036 | 0806.1170 | 1 |
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. | <meaning-changed> 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. | 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! | meaning-changed | 0.9989243 | 0806.1170 | 1 |
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. | <clarity> 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. | 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. | clarity | 0.97670263 | 0806.2763 | 1 |
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 . | <clarity> 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 . | 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 . | clarity | 0.97357315 | 0806.2763 | 1 |
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. | <meaning-changed> 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. | 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. | meaning-changed | 0.56385654 | 0806.2763 | 1 |
In this paper we evaluate different network representations of metabolism and describe their structure with respect to both modularity and currency metabolites . | <meaning-changed> In this paper we evaluate different network representations of metabolism and describe their structure with respect to both modularity and currency metabolites . | In this paper we evaluate four different graph representations of metabolism and describe their structure with respect to both modularity and currency metabolites . | meaning-changed | 0.99904424 | 0806.2763 | 1 |
In this paper we evaluate different network representations of metabolism and describe their structure with respect to both modularity and currency metabolites . | <meaning-changed> In this paper we evaluate different network representations of metabolism and describe their structure with respect to both modularity and currency metabolites . | 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 . | meaning-changed | 0.99871194 | 0806.2763 | 1 |
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. | <clarity> 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. | 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. | clarity | 0.99588037 | 0806.2763 | 1 |
In this article we study an optimal stopping/optimal control problem which models the decision facing a risk averse agent over when to sell an asset. | <fluency> In this article we study an optimal stopping/optimal control problem which models the decision facing a risk averse agent over when to sell an asset. | In this article we study an optimal stopping/optimal control problem which models the decision facing a risk-averse agent over when to sell an asset. | fluency | 0.9992273 | 0806.4061 | 1 |
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. | <fluency> 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. | 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. | fluency | 0.99928695 | 0806.4061 | 1 |
One interpretation of the solution is that it is optimal for the risk averse agent to gamble. | <fluency> One interpretation of the solution is that it is optimal for the risk averse agent to gamble. | One interpretation of the solution is that it is optimal for the risk-averse agent to gamble. | fluency | 0.99901736 | 0806.4061 | 1 |
This paper is a survey of recent progress in the theory of ruin for risk processes that earn investment return on invested assets . | <meaning-changed> This paper is a survey of recent progress in the theory of ruin for risk processes that earn investment return on invested assets . | 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 . | meaning-changed | 0.9856523 | 0806.4125 | 1 |
This paper is a survey of recent progress in the theory of ruin for risk processes that earn investment return on invested assets . | <meaning-changed> This paper is a survey of recent progress in the theory of ruin for risk processes that earn investment return on invested assets . | This paper is a survey of recent progress in the theory of ruin for risk processes that earn investment return on invested assets 47 . | meaning-changed | 0.99930775 | 0806.4125 | 1 |
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 . | <fluency> 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 . | 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 . | fluency | 0.999281 | 0807.0308 | 1 |
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. | <clarity> 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. | 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. | clarity | 0.99875283 | 0807.0308 | 1 |
Based on extensive analogies I propose that the existing findings and methodology enable us to detect active centres in cells, social networks and ecosystems. | <fluency> Based on extensive analogies I propose that the existing findings and methodology enable us to detect active centres in cells, social networks and ecosystems. | Based on extensive analogies I propose that existing findings and methodology enable us to detect active centres in cells, social networks and ecosystems. | fluency | 0.9975598 | 0807.0308 | 1 |
Based on extensive analogies I propose that the existing findings and methodology enable us to detect active centres in cells, social networks and ecosystems. | <meaning-changed> Based on extensive analogies I propose that the existing findings and methodology enable us to detect active centres in cells, social networks and ecosystems. | Based on extensive analogies I propose that the existing findings and methodology already enable us to detect active centres in cells, social networks and ecosystems. | meaning-changed | 0.99506456 | 0807.0308 | 1 |
Based on extensive analogies I propose that the existing findings and methodology enable us to detect active centres in cells, social networks and ecosystems. | <meaning-changed> Based on extensive analogies I propose that the existing findings and methodology enable us to detect active centres in cells, social networks and ecosystems. | Based on extensive analogies I propose that the existing findings and methodology enable us to detect active centres in cells, and can be expanded to social networks and ecosystems. | meaning-changed | 0.9995401 | 0807.0308 | 1 |
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. | <clarity> 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. | 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. | clarity | 0.99742293 | 0807.0308 | 1 |
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. | <fluency> 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. | Members of these active centres are creative elements of their 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. | fluency | 0.99935657 | 0807.0308 | 1 |
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 >. | <clarity> 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 >. | 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 >. | clarity | 0.55000806 | 0807.1823 | 1 |
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 . | <meaning-changed> 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 . | 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 . | meaning-changed | 0.9355281 | 0807.1823 | 1 |
Most of real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the parameters influencing their dynamics. | <clarity> Most of real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the parameters influencing their dynamics. | Most real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the parameters influencing their dynamics. | clarity | 0.611768 | 0807.1823 | 2 |
Most of real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the parameters influencing their dynamics. | <clarity> Most of real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the parameters influencing their dynamics. | Most of real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the parameters determining their dynamics. | clarity | 0.9977277 | 0807.1823 | 2 |
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 . | <clarity> 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 . | These empirical systems are in many cases subject to noise of multiplicative nature . | clarity | 0.9984297 | 0807.1823 | 2 |
The special properties of multiplicative noise as opposed to the additive noise have been noticed for a long while. | <fluency> The special properties of multiplicative noise as opposed to the additive noise have been noticed for a long while. | The special properties of multiplicative noise as opposed to additive noise have been noticed for a long while. | fluency | 0.9940645 | 0807.1823 | 2 |
In the present paper we study in some detail the difference between the emergence of cooperation in additive vs. multiplicative random environments. | <coherence> In the present paper we study in some detail the difference between the emergence of cooperation in additive vs. multiplicative random environments. | coherence | 0.9959383 | 0807.1823 | 2 |
|
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. | <coherence> 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. | We study the various implications of this observation and its applications in various contexts. | coherence | 0.9977216 | 0807.1823 | 2 |
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. | <meaning-changed> 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. | Varma and Palsson, J. theor. | meaning-changed | 0.998281 | 0808.0321 | 1 |
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. | <coherence> 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. | 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. | coherence | 0.9477974 | 0808.0321 | 1 |
503 (1993)%DIFDELCMD < ]%%% . In combination with reaction fluxes , they can be used to decorate the metabolic model with a yield flux network. The yield flux network shows a kind of gauge invariance with respect to rescaling of the stoichiometric matrix, and is arguably more fundamental than either the reaction fluxes or shadow prices. Complementary slackness implies that the yield flux network also satisfies a conservation law, which can be used to explain why the shadow prices are strongly correlated with measures of molecular complexity such as molecular weight and atom count. | <clarity> 503 (1993)%DIFDELCMD < ]%%% . In combination with reaction fluxes , they can be used to decorate the metabolic model with a yield flux network. The yield flux network shows a kind of gauge invariance with respect to rescaling of the stoichiometric matrix, and is arguably more fundamental than either the reaction fluxes or shadow prices. Complementary slackness implies that the yield flux network also satisfies a conservation law, which can be used to explain why the shadow prices are strongly correlated with measures of molecular complexity such as molecular weight and atom count. | 503 (1993)%DIFDELCMD < ]%%% A metabolic model can be represented as bipartite graph comprising linked reaction and metabolite nodes. Here it is shown how a network of conserved fluxes can be assigned to the yield flux network also satisfies a conservation law, which can be used to explain why the shadow prices are strongly correlated with measures of molecular complexity such as molecular weight and atom count. | clarity | 0.9978377 | 0808.0321 | 1 |
Complementary slackness implies that the yield flux network also satisfies a conservation law, which can be used to explain why the shadow prices are strongly correlated with measures of molecular complexity such as molecular weight and atom count. For the genome-scale models , the shadow prices have a broad distribution and the overall pattern reflects the URLanisation of the metabolism . | <meaning-changed> Complementary slackness implies that the yield flux network also satisfies a conservation law, which can be used to explain why the shadow prices are strongly correlated with measures of molecular complexity such as molecular weight and atom count. For the genome-scale models , the shadow prices have a broad distribution and the overall pattern reflects the URLanisation of the metabolism . | Complementary slackness implies that the edges of such a graph by combining the reaction fluxes with a conserved metabolite property such as molecular weight. A similar flux network can be constructed by combining the primal and dual solutions to the linear programming problem that typically arises in constraint-based modelling. Such constructions may help with the visualisation of flux distributions in complex metabolic networks. The analysis also explains the strong correlation observed between metabolite shadow prices (the dual linear programming variables) and conserved metabolite properties. The methods were applied to recent metabolic models for Escherichia coli, Saccharomyces cerevisiae, and Methanosarcina barkeri. Detailed results are reported for E. coli; similar results were found for the URLanisms . | meaning-changed | 0.99782455 | 0808.0321 | 1 |
The universal scalability law (USL) of computational capacity is a rational function C_p = P(p)/Q(p) with P(p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has long been used for statistical modeling and prediction of computer system performance. | <clarity> The universal scalability law (USL) of computational capacity is a rational function C_p = P(p)/Q(p) with P(p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has long been used for statistical modeling and prediction of computer system performance. | The universal scalability law of computational capacity is a rational function C_p = P(p)/Q(p) with P(p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has long been used for statistical modeling and prediction of computer system performance. | clarity | 0.9989888 | 0808.1431 | 1 |
The universal scalability law (USL) of computational capacity is a rational function C_p = P(p)/Q(p) with P(p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has long been used for statistical modeling and prediction of computer system performance. | <fluency> The universal scalability law (USL) of computational capacity is a rational function C_p = P(p)/Q(p) with P(p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has long been used for statistical modeling and prediction of computer system performance. | The universal scalability law (USL) of computational capacity is a rational function C_p = P(p)/Q(p) with P(p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has been long used for statistical modeling and prediction of computer system performance. | fluency | 0.9938646 | 0808.1431 | 1 |
C_p is both necessary and sufficient for modeling all practical characteristics of computational scalability. | <meaning-changed> C_p is both necessary and sufficient for modeling all practical characteristics of computational scalability. | C_p is further shown to be both necessary and sufficient for modeling all practical characteristics of computational scalability. | meaning-changed | 0.89714146 | 0808.1431 | 1 |
By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | <meaning-changed> By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | Basic peculiarities of market price fluctuations are known to be well described by a recently developed random walk model in a temporally deforming quadric potential force whose center is given by a moving average of past price traces ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | meaning-changed | 0.999551 | 0808.3339 | 1 |
By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | <meaning-changed> By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | By analyzing Physica A 370, pp91-97, 2006] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | meaning-changed | 0.9994636 | 0808.3339 | 1 |
By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | <meaning-changed> By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | By analyzing ]. By analyzing high-frequency financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | meaning-changed | 0.99913293 | 0808.3339 | 1 |
By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | <clarity> By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the appearance of nonlinear potential forces in the markets. | clarity | 0.9980812 | 0808.3339 | 1 |
By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | <fluency> By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential forces in the markets. | By analyzing ] financial time series of exceptional events such as bubbles and crashes, we confirm the existence of nonlinear potential force in the markets. | fluency | 0.9992661 | 0808.3339 | 1 |
The shape of the potential function changes rather slowly and smoothly, thereby enabling a statistical prediction of market prices for a limited time range in the mathematical sense. This predictability does not ensure profits, but is expected to be applicable for averting catastrophes . | <meaning-changed> The shape of the potential function changes rather slowly and smoothly, thereby enabling a statistical prediction of market prices for a limited time range in the mathematical sense. This predictability does not ensure profits, but is expected to be applicable for averting catastrophes . | We show statistical significance of its existence by applying the information criterion. This new time series analysis is expected to be applicable for averting catastrophes . | meaning-changed | 0.998664 | 0808.3339 | 1 |
This predictability does not ensure profits, but is expected to be applicable for averting catastrophes . | <meaning-changed> This predictability does not ensure profits, but is expected to be applicable for averting catastrophes . | This predictability does not ensure profits, but is expected to be applied widely for detecting a non-stationary symptom in random phenomena . | meaning-changed | 0.8037388 | 0808.3339 | 1 |
Its popularity is partly due to the fact that it is an easily-understood measure of risk. | <fluency> Its popularity is partly due to the fact that it is an easily-understood measure of risk. | Its popularity is partly due to the fact that it is an easily understood measure of risk. | fluency | 0.99657154 | 0809.0241 | 1 |
The use of Product Partition Models allows us to remain in a normal setting , and to obtain a closed-form expression for Value-at-Risk computation. | <meaning-changed> The use of Product Partition Models allows us to remain in a normal setting , and to obtain a closed-form expression for Value-at-Risk computation. | The use of Product Partition Models allows us to remain in a Normal setting even in presence of outlying points , and to obtain a closed-form expression for Value-at-Risk computation. | meaning-changed | 0.9990429 | 0809.0241 | 1 |
The numerical results we present clearly show that Product Partition Models can be successfully exploited in order to quantify market risk exposure. | <clarity> The numerical results we present clearly show that Product Partition Models can be successfully exploited in order to quantify market risk exposure. | The numerical results clearly show that Product Partition Models can be successfully exploited in order to quantify market risk exposure. | clarity | 0.99598545 | 0809.0241 | 1 |
Value-at-Risk estimates we obtain are in full agreement with Maximum Likelihood approaches, but our methodology provides richer information about the clustering structure of the data and the presence of outlying points. | <clarity> Value-at-Risk estimates we obtain are in full agreement with Maximum Likelihood approaches, but our methodology provides richer information about the clustering structure of the data and the presence of outlying points. | The obtained Value-at-Risk estimates we obtain are in full agreement with Maximum Likelihood approaches, but our methodology provides richer information about the clustering structure of the data and the presence of outlying points. | clarity | 0.5305645 | 0809.0241 | 1 |