wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Our work sheds new light on the role of oil prices in shaping the world economy by investigating the metabolic paths of value across trade between 1960 and 2010 , by means of Markov Chain  analysis.
Revised:  Our work sheds new light on the role of oil prices in shaping the world economy by investigating flows of goods and services through global value chains between 1960 and 2010 , by means of Markov Chain analysis.
Edit intent: clarity
Original:  Our work sheds new light on the role of oil prices in shaping the world economy by investigating the metabolic paths of value across trade between 1960 and 2010 , by means of Markov Chain  analysis.
Revised:  Our work sheds new light on the role of oil prices in shaping the world economy by investigating the metabolic paths of value across trade between 1960 and 2011 , by means of Markov Chain analysis.
Edit intent: meaning-changed
Original:  Our work sheds new light on the role of oil prices in shaping the world economy by investigating the metabolic paths of value across trade between 1960 and 2010 , by means of Markov Chain  analysis.
Revised:  Our work sheds new light on the role of oil prices in shaping the world economy by investigating the metabolic paths of value across trade between 1960 and 2010 , by means of Markov Chain and network analysis.
Edit intent: meaning-changed
Original:  We observed a remarkably high correlation of 0.85, unmatched by any former study addressing the correlation between oil price and major economic indicators .
Revised:  We demonstrate that this correlation does not depend on the balance of payments nor on the nominal value of trade or trade agreements; it is instead linked to the way the Global Value Chains (GVCs) shape global trade. Our study suggests that transport played an important structural role in shaping GVCs .
Edit intent: meaning-changed
Original: Despite the growing interest around the emergence of novel technologies, especially from the policy-making perspective , there is still no consensus on what classifies a technology as 'emergent'  .
Revised: Despite the growing interest around the emergence of novel technologies, especially from the policy-making perspective . Yet as an area of study, emerging technologies lacks key foundational elements, namely a consensus on what classifies a technology as 'emergent' .
Edit intent: meaning-changed
Original:  Do living cells operate at the thermodynamic limits for taking a measurement? Here, we consider a canonical biochemical network for receptor readout and show how it maps onto a measurement protocol of the type studied in the computational literature.
Revised:  Can cells reach the thermodynamic limit of minimal dissipation for a given measurement accuracy, and, if not, what is the cause? We consider a canonical biochemical network for receptor readout and show how it maps onto a measurement protocol of the type studied in the computational literature.
Edit intent: clarity
Original:  We find that the biochemical network does not achieve thermodynamic limits of efficiency. A key consequence is that biochemical networks face a tradeoff between the energy dissipated for a measurement and the accuracy of the measurement that is more severe than and qualitatively distinct from the tradeoff required thermodynamically .
Revised:  We find that regardless of the network parameters, the biochemical network can never reach the thermodynamic limit of efficiency, and faces a tradeoff between the energy dissipated for a measurement and the accuracy of the measurement that is more severe than and qualitatively distinct from the tradeoff required thermodynamically .
Edit intent: clarity
Original:  A key consequence is that biochemical networks face a tradeoff between the energy dissipated for a measurement and the accuracy of the measurement that is more severe than and qualitatively distinct from the tradeoff required thermodynamically . We study this tradeoff .
Revised:  A key consequence is that biochemical networks face a tradeoff between the energy dissipated for a measurement and the accuracy of the measurement that is more severe than and qualitatively distinct from the tradeoff required thermodynamically .
Edit intent: coherence
Original:  This process appears to be similar to measurements made by computational devices, as extensively studied in the literature following Maxwell's demon. But at what level do measurements made by cellular systems map onto computational measurements made, for example, by magnetic devices ? Can cells reach the thermodynamic limit of minimal dissipation for a given measurement accuracy, and , if not, what is the cause?
Revised:  This process appears to be similar to measurements or copies in typical computational devices. But is this analogy rigorous ? Can cells reach the thermodynamic limit of minimal dissipation for a given measurement accuracy, and , if not, what is the cause?
Edit intent: clarity
Original:  But at what level do measurements made by cellular systems map onto computational measurements made, for example, by magnetic devices ? Can cells reach the thermodynamic limit of minimal dissipation for a given measurement accuracy, and , if not, what is the cause?
Revised:  But at what level do measurements made by cellular systems map onto computational measurements made, for example, by magnetic devices ? Can cells be optimally efficient, and if not, what is the cause?
Edit intent: clarity
Original:  But at what level do measurements made by cellular systems map onto computational measurements made, for example, by magnetic devices ? Can cells reach the thermodynamic limit of minimal dissipation for a given measurement accuracy, and , if not, what is the cause? We consider a canonical biochemical network that reads out the state of a receptor and show rigorously how it relates to a measurement protocol of the type studied in the computational literature.
Revised:  But at what level do measurements made by cellular systems map onto computational measurements made, for example, by magnetic devices ? Can cells reach the thermodynamic limit of minimal dissipation for a given measurement accuracy, and , if not, why? We show that, as in computation, a canonical biochemical network that reads out the state of a receptor and show rigorously how it relates to a measurement protocol of the type studied in the computational literature.
Edit intent: meaning-changed
Original:  We consider a canonical biochemical network that reads out the state of a receptor and show rigorously how it relates to a measurement protocol of the type studied in the computational literature. We find that regardless of the network parameters , the biochemical network can never reach the thermodynamic limit of efficiency, and faces a tradeoff between accuracy and dissipation that is more severe than and qualitatively distinct from the tradeoff required thermodynamically .
Revised:  We consider a canonical biochemical readout network generates correlations; extracting no work from these correlations sets a lower bound on dissipation. For general input , the biochemical network can never reach the thermodynamic limit of efficiency, and faces a tradeoff between accuracy and dissipation that is more severe than and qualitatively distinct from the tradeoff required thermodynamically .
Edit intent: meaning-changed
Original:  We find that regardless of the network parameters , the biochemical network can never reach the thermodynamic limit of efficiency, and faces a tradeoff between accuracy and dissipation that is more severe than and qualitatively distinct from the tradeoff required thermodynamically .
Revised:  We find that regardless of the network parameters , the biochemical network cannot reach this bound, even with arbitrarily slow reactions or weak thermodynamic driving. It faces an accuracy-dissipation trade-off that is qualitatively distinct from the tradeoff required thermodynamically .
Edit intent: meaning-changed
Original:  We find that regardless of the network parameters , the biochemical network can never reach the thermodynamic limit of efficiency, and faces a tradeoff between accuracy and dissipation that is more severe than and qualitatively distinct from the tradeoff required thermodynamically .
Revised:  We find that regardless of the network parameters , the biochemical network can never reach the thermodynamic limit of efficiency, and faces a tradeoff between accuracy and dissipation that is more severe than and qualitatively distinct from .
Edit intent: clarity
Original:  We find that regardless of the network parameters , the biochemical network can never reach the thermodynamic limit of efficiency, and faces a tradeoff between accuracy and dissipation that is more severe than and qualitatively distinct from the tradeoff required thermodynamically . We conclude by demonstrating how biomolecules can be used to achieve optimal protocols -- not under the control of a steady-state biochemical network, but rather under the control of exogenously manipulated baths of ATP and ADP.
Revised:  We find that regardless of the network parameters , the biochemical network can never reach the thermodynamic limit of efficiency, and faces a tradeoff between accuracy and dissipation that is more severe than and qualitatively distinct from the tradeoff required thermodynamically and worse than implied by the bound, and more complex steady-state biochemical network, but rather under the control of exogenously manipulated baths of ATP and ADP.
Edit intent: meaning-changed
Original:  We conclude by demonstrating how biomolecules can be used to achieve optimal protocols -- not under the control of a steady-state biochemical network, but rather under the control of exogenously manipulated baths of ATP and ADP. This leads to an experimental system that might be used to test theories on the thermodynamicsof computation .
Revised:  We conclude by demonstrating how biomolecules can be used to achieve optimal protocols -- not under the control of a steady-state copy processes cannot perform better. Nonetheless, the cost remains close to the thermodynamic bound unless accuracy is extremely high. Additionally, we show that biomolecular reactions could be used in thermodynamically optimal devices under exogenous manipulation of chemical fuels, suggesting an experimental system that might be used to test theories on the thermodynamicsof computation .
Edit intent: meaning-changed
Original: We determine the optimal strategy for investing in a Black-Scholes market in order to maximize the probability that wealth at death meets a bequest goal b . We, thereby, make more objective the goal of maximizing expected utility of death, first considered in a continuous-time framework by Merton (1969). Specifically, instead of requiring the individual tochoose a utility function, we only require the individual to choose a bequest goal b. We learn that, for wealth lying between 0 and b , the optimal investment strategy is {\it independent } of b , a surprising result.
Revised: We determine the optimal strategy for investing in a Black-Scholes market in order to maximize the probability that wealth at death meets a bequest goal b , the optimal investment strategy is {\it independent } of b , a surprising result.
Edit intent: meaning-changed
Original:  We learn that, for wealth lying between 0 and b , the optimal investment strategy is {\it independent } of b , a surprising result.
Revised:  We learn that, for wealth lying between 0 and b , a type of goal-seeking problem, as pioneered by Dubins and Savage (1965, 1976). The individual consumes at a constant rate c, so the level of wealth required for risklessly meeting consumption equals c/r, in which r is the rate of return of the riskless asset. Our problem is related to, but different from, the goal-reaching problems of Browne (1997). First, Browne (1997, Section 3.1) maximizes the probability that wealth reaches b < c/r before it reaches a < b. Browne's game ends when wealth reaches b. By contrast, for the problem we consider, the game continues until the individual dies or until wealth reaches 0; reaching b and then falling below it before death does not count. Second, Browne (1997, Section 4.2) maximizes the expected discounted reward of reaching b > c/r before wealth reaches c/r. If one interprets his discount rate as a hazard rate, then our two problems are {\it independent } of b , a surprising result.
Edit intent: meaning-changed
Original:  We learn that, for wealth lying between 0 and b , the optimal investment strategy is {\it independent } of b , a surprising result. Therefore, if the individual were to revise her bequest goal, her investment strategy would not change if her wealth is less than the new goal .
Revised:  We learn that, for wealth lying between 0 and b , the optimal investment strategy is {\it independent } equivalent for the special case for which b > c/r, with ruin level c/r. However, we obtain different results because we set the ruin level at 0, thereby allowing the game to continue when wealth falls below c/r .
Edit intent: meaning-changed
Original:  In RSK, the transmitter uses different chemical reactions to generate different time-varying functions of concentration of signalling molecules to represent different transmission symbols . We consider the problem of demodulating the RSK symbols assuming that the transmitter and receiver are synchronised. We assume the receiver consists of receptors and signalling molecules may react with these receptors to form ligand-receptor complexes.
Revised:  In RSK, the transmitter uses different chemical reactions to generate different time-varying functions of concentration of signalling molecules to represent different transmission symbols , and the receiver consists of receptors and signalling molecules may react with these receptors to form ligand-receptor complexes.
Edit intent: coherence
Original:  Upper and lower bounds are given by asymptotic independent and fully dependent components of V in dependence of the tail index \alpha being smaller or larger than 1. Counterexamples  complete the picture.
Revised:  Upper and lower bounds are given by asymptotically independent and fully dependent components of V in dependence of the tail index \alpha being smaller or larger than 1. Counterexamples complete the picture.
Edit intent: fluency
Original:  Upper and lower bounds are given by asymptotic independent and fully dependent components of V in dependence of the tail index \alpha being smaller or larger than 1. Counterexamples  complete the picture.
Revised:  Upper and lower bounds are given by asymptotic independent and fully dependent components of V in dependence of the tail index \alpha being smaller or larger than 1. Counterexamples , where for non-linear aggregation functions no bounds are available, complete the picture.
Edit intent: meaning-changed
Original: Evolution , in its course , has found many different solutions to the same problem. Focusing on proteins, the amino acid sequence of protein domains performing the same function in URLanisms differs markedly. Since the structure and function of proteins are ultimately encoded in the amino acid sequence, multiple sequence alignments (MSA) of homologous protein domains can be used to provide information about this encoding. Regarding each sequence in an MSA as a solution of an optimisation problem, we exploit the MSA to infer the relevance of different positions, thereby identifying a hierarchy of relevant sites. Our method exploits information on coevolution going beyond pairwise correlations.
Revised: Evolution , in its course , has found many different solutions to the same optimisation problem. The advent of high-throughput genomic sequencing has made available extensive data from which, in principle, one can infer the underlying structure on which biological functions rely. In this paper, we present a new method aimed at extracting sites encoding structural and func- tional properties from a set of protein primary sequences, namely a Multiple Sequence Alignment. The method, called Critical Variable Selection, is based on the idea that subsets of relevant sites cor- respond to subsequences that occur with a particularly broad frequency distribution in the dataset. By applying this algorithm to in silico sequences, to the Response Regulator Receiver and to the Voltage Sensor Domain of Ion Channels, we show that this procedure recovers not only information encoded in single site statistics and pairwise correlations but it also captures dependencies going beyond pairwise correlations.
Edit intent: meaning-changed
Original:  This method , called Critical Variable Selection (CVS), affords predictions that are significantly different from those of methods based on pairwise correlations, and it recovers biologically relevant sites , including highly conserved ones.
Revised:  The method proposed here is complementary to Statistical Coupling Analysis, in that the most relevant sites predicted by the two methods markedly differ. We find robust and consistent results for datasets as small as few hundred sequences, that reveal a hidden hierarchy of sites that is consistent with present knowledge on biologically relevant sites , including highly conserved ones.
Edit intent: meaning-changed
Original:  This method , called Critical Variable Selection (CVS), affords predictions that are significantly different from those of methods based on pairwise correlations, and it recovers biologically relevant sites , including highly conserved ones. As compared to other methods based on pairwise correlations, we find, in the analysed cases, that CVS is more efficient in identifying the core of relevant sites , as well as most of the tightest contacts in the protein tertiary structure .
Revised:  This method , called Critical Variable Selection (CVS), affords predictions that are significantly different from those of methods based on pairwise correlations, and it recovers biologically relevant sites and evo- lutionary dynamics. This suggests that Critical Variable Selection is able to identify in a Multiple Sequence Alignment a core of sites encoding functional and structural information .
Edit intent: clarity
Original: In bacteria such as Escherichia coli, DNA is compacted into a nucleoid near the cell center, while ribosomes - molecular complexes that translate messenger RNAs (mRNAs) into proteins - are  localized at the poles.
Revised: In bacteria such as Escherichia coli, DNA is compacted into a nucleoid near the cell center, while ribosomes - molecular complexes that translate messenger RNAs (mRNAs) into proteins - are mainly localized at the poles.
Edit intent: coherence
Original: In bacteria such as Escherichia coli, DNA is compacted into a nucleoid near the cell center, while ribosomes - molecular complexes that translate messenger RNAs (mRNAs) into proteins - are mainly localized at the poles.
Revised: In bacteria such as Escherichia coli, DNA is compacted into a nucleoid near the cell center, while ribosomes-molecular complexes that translate messenger RNAs (mRNAs) into proteins - are mainly localized at the poles.
Edit intent: clarity
Original: In bacteria such as Escherichia coli, DNA is compacted into a nucleoid near the cell center, while ribosomes - molecular complexes that translate messenger RNAs (mRNAs) into proteins - are mainly localized at the poles.
Revised: In bacteria such as Escherichia coli, DNA is compacted into a nucleoid near the cell center, while ribosomes - molecular complexes that translate messenger RNAs (mRNAs) into proteins-are mainly localized at the poles.
Edit intent: fluency
Original:  Our model predicts that %DIFDELCMD < \sim90%%%  \\% of mRNAs are segregated to the poles and reveals a "circulation" of ribosomes driven by the flux of mRNAs, from synthesis in the nucleoid to degradation at the poles.
Revised:  Our model predicts that %DIFDELCMD < \sim90%%% \sim 90 \\% of mRNAs are segregated to the poles and reveals a "circulation" of ribosomes driven by the flux of mRNAs, from synthesis in the nucleoid to degradation at the poles.
Edit intent: meaning-changed
Original: We show how the prices of options can be determined with the help of double-fractional differential equation in such a way that their admixture to a portfolio of stocks provides a more reliable hedge against dramatic price drops than the use of options whose prices were fixed by the Black-Scholes formula.
Revised: We show how the prices of options can be determined with the help of double-fractional differential equation in such a way that their inclusion in a portfolio of stocks provides a more reliable hedge against dramatic price drops than the use of options whose prices were fixed by the Black-Scholes formula.
Edit intent: clarity
Original: We show how the prices of options can be determined with the help of double-fractional differential equation in such a way that their admixture to a portfolio of stocks provides a more reliable hedge against dramatic price drops than the use of options whose prices were fixed by the Black-Scholes formula.
Revised: We show how the prices of options can be determined with the help of double-fractional differential equation in such a way that their admixture to a portfolio of stocks provides a more reliable hedge against dramatic price drops that the use of options whose prices were fixed by the Black-Scholes formula.
Edit intent: fluency
Original: We consider a switch with uniform traffic operating under the MaxWeight scheduling algorithm . This traffic pattern is interesting to study in the heavy-traffic regime since the queue lengths exhibit a multi-dimensional state-space collapse  .
Revised: We consider a switch with uniform traffic operating under the MaxWeight scheduling algorithm , under any traffic pattern such that all the ports are loaded. This system is interesting to study in the heavy-traffic regime since the queue lengths exhibit a multi-dimensional state-space collapse .
Edit intent: meaning-changed
Original:  We use a Lyapunov-type drift technique to characterize the heavy-traffic behavior of the expectation of the sum queue lengths in steady-state . Specifically, in the case of Bernoulli arrivals ,  we show that the heavy-traffic scaled queue length is \left({2n}}\right)\left( n-3{2}+1{2n} . Our result implies that the MaxWeight algorithm has optimal queue-length scaling behavior in the \right) heavy-traffic regime with respect to the size of a switch with a uniform traffic pattern.
Revised:  We use a Lyapunov-type drift technique to characterize the heavy-traffic behavior of the expectation of the sum queue lengths in steady-state , we show that the heavy-traffic scaled queue length is \left({2n}}\right)\left( n-3{2}+1{2n} . Our result implies that the MaxWeight algorithm has optimal queue-length scaling behavior in the \right) heavy-traffic regime with respect to the size of a switch with a uniform traffic pattern.
Edit intent: meaning-changed
Original:  Specifically, in the case of Bernoulli arrivals ,  we show that the heavy-traffic scaled queue length is \left({2n}}\right)\left( n-3{2}+1{2n} . Our result implies that the MaxWeight algorithm has optimal queue-length scaling behavior in the \right) heavy-traffic regime with respect to the size of a switch with a uniform traffic pattern.
Revised:  Specifically, in the case of Bernoulli arrivals , under the assumption that all ports are saturated and all queues receive non-zero traffic. Under these conditions, we show that the heavy-traffic scaled queue length is \left({2n}}\right)\left( n-3{2}+1{2n} . Our result implies that the MaxWeight algorithm has optimal queue-length scaling behavior in the \right) heavy-traffic regime with respect to the size of a switch with a uniform traffic pattern.
Edit intent: meaning-changed