wanyu/IteraTeR_full_sent huggingface dataset:
Original: CUDA and OpenCL offer two different interfaces for programming GPUs . OpenCL is an open standard that can be used to program CPUs, GPUs, and other devices from different vendors, while CUDA is specific to NVIDIA GPUs.
Revised: CUDA and OpenCL are two different frameworks for GPU programming . OpenCL is an open standard that can be used to program CPUs, GPUs, and other devices from different vendors, while CUDA is specific to NVIDIA GPUs.
Edit intent: clarity
Original:  The aforementioned robust growth-optimal strategy can also be seen as a limit, as the terminal date does to infinity, of optimal arbitrages in the terminology of Fernholz and Karatzas.
Revised:  The aforementioned robust growth-optimal strategy can also be seen as a limit, as the terminal date goes to infinity, of optimal arbitrages in the terminology of Fernholz and Karatzas.
Edit intent: clarity
Original:  The robust growth-optimal strategy can also be seen as a limit, as the terminal date goes to infinity, of optimal arbitrages in the terminology of Fernholz and Karatzas  .
Revised:  The robust growth-optimal strategy can also be seen as a limit, as the terminal date goes to infinity, of optimal arbitrages in the terminology of Fernholz and Karatzas Ann. Appl. Probab. 20 (2010) 1179-1204 .
Edit intent: meaning-changed
Original: In this paper, we analyze a real-valued reflected backward stochastic differential equation (RBSDE) with an unbounded obstacle and an unbounded terminal condition when its generator f has quadratic growth in the z variable .
Revised: In this paper, we analyze a real-valued reflected backward stochastic differential equation (RBSDE) with an unbounded obstacle and an unbounded terminal condition when its generator f has quadratic growth in the z-variable .
Edit intent: clarity
Original:  In particular, we obtain existence, comparison, and stability results . Moreover, we study the link between the reflected forward backward SDEs and the obstacle problem for semi-linear parabolic PDEs in which the non-linearity appears as the square of the gradient.
Revised:  In particular, we obtain existence, comparison, and stability results , and consider the optimal stopping for quadratic g-evaluations. As an application of our results we analyze the obstacle problem for semi-linear parabolic PDEs in which the non-linearity appears as the square of the gradient.
Edit intent: meaning-changed
Original: We present a Monte Carlo algorithm that allows efficient and unbiased sampling of polymer melts consisting of two chains of equal length that jointly visit all the sites of a cubic lattice  .
Revised: We present a Monte Carlo algorithm that allows efficient and unbiased sampling of polymer melts consisting of two chains of equal length that jointly visit all the sites of a cubic lattice with rod geometry L x L x rL and non-periodic (hard wall) boundary conditions .
Edit intent: meaning-changed
Original:  Using this algorithm  , we show that in the limit of a large lattice the two chains phase separate , in contradiction with the ideal chain behaviour predicted by the Flory theorem .
Revised:  Using this algorithm for chains of length up to 40 000 monomers and aspect ratios 1 <= r <= 10 , we show that in the limit of a large lattice the two chains phase separate , in contradiction with the ideal chain behaviour predicted by the Flory theorem .
Edit intent: meaning-changed
Original:  We consider some life insurance products, derive the corresponding time-delayed BSDEs and solve them explicitly or at least provide hints how to solve them numerically.
Revised:  We consider pay-offs arising under participating contracts, variable annuities, structured products and hedge funds with hurdle rates and high water marks. We derive the corresponding time-delayed BSDEs and solve them explicitly or at least provide hints how to solve them numerically.
Edit intent: meaning-changed
Original:  Time-delayed BSDEs may arise  when we want to find a strategy and a portfolio which should replicate the liability whose pay-off depends on the applied investment strategy or the past values of the portfolio.
Revised:  Time-delayed BSDEs may arise in finance when we want to find a strategy and a portfolio which should replicate the liability whose pay-off depends on the applied investment strategy or the past values of the portfolio.
Edit intent: meaning-changed
Original:  Time-delayed BSDEs may arise  when we want to find a strategy and a portfolio which should replicate the liability whose pay-off depends on the applied investment strategy or the past values of the portfolio.
Revised:  Time-delayed BSDEs may arise when we want to find an investment strategy and an investment portfolio which should replicate the liability whose pay-off depends on the applied investment strategy or the past values of the portfolio.
Edit intent: fluency
Original:  Despite its simplicity , the model has several interesting features . The volatility is not constant and displays high peaks. The empirical distribution of the log-returns (increments of the logarithm of the index) is non-Gaussian and may exhibit heavy tails. Log-returns corresponding to disjoint time intervals are uncorrelated but not independent: the correlation of their absolute values decays exponentially fast in the distance between the time intervals for large distances, while it has a slower decay for moderate distances. Finally, the distribution of the log-returns obeys scaling relations that are detected on real time series, but are not satisfied by most available models .
Revised:  Despite its simplicity , the model is able to fit several key features of the time series of financial indexes, such as the Dow Jones Industrial Average, with a remarkable accuracy .
Edit intent: clarity
Original:  We also define two different measures of efficiency and strength of mechano-chemical coupling of this molecular machine. We calculate all these quantities analytically . Some of these quantities show apparently counterintuitive trends of variation with the qualityof kinetic proofreading.
Revised:  We also define two different measures of the efficiency of this machine . Some of these quantities show apparently counterintuitive trends of variation with the qualityof kinetic proofreading.
Edit intent: clarity
Original:  We calculate all these quantities analytically . Some of these quantities show apparently counterintuitive trends of variation with the qualityof kinetic proofreading. We interpret the origin of these trends .
Revised:  We calculate all these quantities analytically . However, we arugue that its performance is evaluated better in terms of the translational fidelity and the speed with which it polymerizes a protein. We define both these quantities and calculate these analytically. Fidelity is a measure of the quality of the products while the total quantity of products synthesized in a given interval depends on the speed of polymerization. We show that for synthesizing a large quantity of proteins, it is not necessary to sacrifice the quality .
Edit intent: meaning-changed
Original: Nature uses combinatorial control strategies that are different from those used by present pharmacological approaches for controlling disease. Function and differentiation of cells URLanisms are naturally regulated by control networks that are bipartite, i.e. contain two different types of nodes: controllers and targets. Each controller acts on many targets, and target nodes are controlled by many controllers in a strongly overlapping many-to-many network structure.
Revised: Cells are regulated by networks of controllers having many targets, and target nodes are controlled by many controllers in a strongly overlapping many-to-many network structure.
Edit intent: clarity
Original:  Each controller acts on many targets, and target nodes are controlled by many controllers in a strongly overlapping many-to-many network structure. We present a quantitative analysis of the network properties of three key biological systems for which sufficiently comprehensive datasets are now available: transcription factors, microRNAs  and protein kinases .
Revised:  Each controller acts on many targets, and target nodes are controlled by many controllers in a strongly overlapping many-to-many " combinatorial control systems are poorly understood. Here we analyze distinct cellular networks ( transcription factors, microRNAs and protein kinases .
Edit intent: meaning-changed
Original:  We present a quantitative analysis of the network properties of three key biological systems for which sufficiently comprehensive datasets are now available: transcription factors, microRNAs  and protein kinases . We find that some parameters defining general network properties vary only within limited ranges , suggesting the existence of common control strategies in biology.
Revised:  We present a quantitative analysis of the network properties of three key biological systems for which sufficiently comprehensive datasets are now available: transcription factors, microRNAs and protein kinases ) and a drug-target network. Certain network properties seem universal across systems and species , suggesting the existence of common control strategies in biology.
Edit intent: meaning-changed
Original:  The \pm  many-to-many structure might permit higher robustness to variation.
Revised:  The \pm 1.2\%. Links per node are predominantly exponentially distributed, implying conservation of the average, which we explain using a mathematical model of robustness in control networks. These findings suggest that optimal pharmacological strategies may benefit from a similar, many-to-many structure might permit higher robustness to variation.
Edit intent: meaning-changed
Original:  The \pm  many-to-many structure might permit higher robustness to variation. A mathematical model also provides insight into the factors determining the values of the biological control network parameters and the network structure. The model showed an increased probability of finding solutions that achieve control within the naturally occurring range. This analysis of biological control networkssuggests a new paradigm for pharmacological interventions. Combinatorial therapies could be found by searching within biomimetic pharmacological sets with the same many-to-many structure as the biological systems and parameters within the ranges we observed in biology. The molecular tools for testing this new approach have recently become available . The necessary experiments would be greatly accelerated by a concerted effort of several pharmaceutical and biotech companies willing to pool compounds. This effort has potential benefits for the therapies of complex diseases, for the pharmaceutical industry and for our basic understanding of biological control .
Revised:  The \pm many-to-many combinatorial structure, and molecular tools are available to test this approach .
Edit intent: clarity
Original: This paper considers a top-down approach for CDO valuation and proposes a market model. We extend previous research on this topic in two directions: on the one side, we use as driving process for the interest rate dynamics a time-inhomogeneous L\'evy process, and on the other side, we do not assume that all maturities are available in the market.
Revised: This paper considers a top-down setting driven by time-inhomogeneous L\'evy process, and on the other side, we do not assume that all maturities are available in the market.
Edit intent: clarity
Original:  We extend previous research on this topic in two directions: on the one side, we use as driving process for the interest rate dynamics a time-inhomogeneous L\'evy process, and on the other side, we do not assume that all maturities are available in the market. Only a discrete tenor structure is considered, which is in the spirit of the classical Libor market model. We create a general frameworkfor market models based on multidimensional semimartingales. This framework is able to capture dependence between the default-free and the defaultable dynamics, as well as contagion effects. Conditions for absence of arbitrage and valuation formulas for tranches of CDOs are given .
Revised:  We extend previous research on this topic in two directions: on the one side, we use as driving process for the interest rate dynamics a time-inhomogeneous L\'evy processes. We provide a new framework, conditions for absence of arbitrage and valuation formulas for tranches of CDOs are given .
Edit intent: coherence
Original:  Conditions for absence of arbitrage and valuation formulas for tranches of CDOs are given .
Revised:  Conditions for absence of arbitrage , explicit examples, an affine setup which includes contagion and pricing formulas for STCDOs and options on STCDOs. A calibration to iTraxx data with an extended Kalman filter shows an excellent fit over the full observation period. The calibration is done on a set of CDO tranche spreads ranging across six tranches and three maturities .
Edit intent: meaning-changed
Original:  The problem is easily solved via the cavity method both in the small forces range and in presence of overstretching transition, so that some properties such as bending stiffness and elasticity of dsDNA emerge in a very clear manner.
Revised:  The problem is easily solved via the cavity method both in the small forces range and in presence of overstretching transition, so that some properties such as bending stiffness and elasticity of DNA emerge in a very clear manner.
Edit intent: clarity
Original: The evolution of protein-protein interactions over time has led to a complex network whose character is modular in the cellular function and highly correlated in its connectivity. The question of the characterization and emergence of modularity following principles of evolution remains an important challenge as there is no encompassing theory to explain the resulting modular topology.
Revised: The evolution of protein-protein interaction (PPI) networks are the key to the characterization and emergence of modularity following principles of evolution remains an important challenge as there is no encompassing theory to explain the resulting modular topology.
Edit intent: clarity
Original:  The question of the characterization and emergence of modularity following principles of evolution remains an important challenge as there is no encompassing theory to explain the resulting modular topology. Here, we perform an empirical study of the yeast protein-interaction network . We find a novel large-scale URLanization of the functional classes of proteins characterized in terms of scale-invariant laws of modularity.
Revised:  The question of the functional understanding of cells. In the last years, large-scale URLanization of the functional classes of proteins characterized in terms of scale-invariant laws of modularity.
Edit intent: clarity
Original:  We find a novel large-scale URLanization of the functional classes of proteins characterized in terms of scale-invariant laws of modularity. We develop a mathematical framework and demonstrate a relationship between the modular structure and the evolution growth rate of the interactions, conserved proteins , and topological length-scales in the system revealing a hierarchy of mutational events giving rise to the modular topology. These results are expected to apply to other complex networks providing a general theoretical framework to describe their URLanization and dynamics.
Revised:  We find a novel large-scale PPI networks of several URLanisms were investigated. Methodological improvements now allow the analysis of PPI networks of URLanisms simultaneously as well as the direct modeling of ancestral networks. This provides the opportunity to challenge existing assumptions on network evolution. We utilized present-day PPI networks from integrated datasets of seven URLanisms and developed a theoretical and bioinformatic framework for studying the evolutionary dynamics of PPI networks. A novel filtering approach using percolation analysis was developed to remove low confidence interactions based on topological constraints. We then reconstructed the ancient PPI networks of different ancestors, for which the ancestral proteomes, as well as the ancestral interactions, were inferred. Ancestral proteins were reconstructed using orthologous groups on different evolutionary levels. A stochastic approach, using the duplication-divergence model, was developed for estimating the probabilities of ancient interactions from today's PPI networks. The growth rates for nodes, edges, sizes and modularities of the networks indicate multiplicative growth and are consistent with the results from independent static analysis. Our results support the duplication-divergence model of evolution and indicate fractality and multiplicative growth as general properties of the PPI network structure and dynamics.
Edit intent: meaning-changed
Original: Our goal is to resolve a problem proposed by Karatzas and Fernholz  (2008) : Characterizing  the minimum amount of initial capital that would guarantee the investor to beat the market portfolio with a certain probability  as a function of the market configuration and time to maturity.
Revised: Our goal is to resolve a problem proposed by Fernholz and Karatzas (2008) : Characterizing the minimum amount of initial capital that would guarantee the investor to beat the market portfolio with a certain probability as a function of the market configuration and time to maturity.
Edit intent: fluency
Original: Our goal is to resolve a problem proposed by Karatzas and Fernholz  (2008) : Characterizing  the minimum amount of initial capital that would guarantee the investor to beat the market portfolio with a certain probability  as a function of the market configuration and time to maturity.
Revised: Our goal is to resolve a problem proposed by Karatzas and Fernholz On optimal arbitrage (2008) : Characterizing the minimum amount of initial capital that would guarantee the investor to beat the market portfolio with a certain probability as a function of the market configuration and time to maturity.
Edit intent: meaning-changed
Original: Our goal is to resolve a problem proposed by Karatzas and Fernholz  (2008) : Characterizing  the minimum amount of initial capital that would guarantee the investor to beat the market portfolio with a certain probability  as a function of the market configuration and time to maturity.
Revised: Our goal is to resolve a problem proposed by Karatzas and Fernholz (2008) Columbia Univ. the minimum amount of initial capital that would guarantee the investor to beat the market portfolio with a certain probability as a function of the market configuration and time to maturity.
Edit intent: coherence
Original: Our goal is to resolve a problem proposed by Karatzas and Fernholz  (2008) : Characterizing  the minimum amount of initial capital that would guarantee the investor to beat the market portfolio with a certain probability  as a function of the market configuration and time to maturity.
Revised: Our goal is to resolve a problem proposed by Karatzas and Fernholz (2008) : Characterizing : to characterize the minimum amount of initial capital that would guarantee the investor to beat the market portfolio with a certain probability as a function of the market configuration and time to maturity.
Edit intent: coherence
Original: Our goal is to resolve a problem proposed by Karatzas and Fernholz  (2008) : Characterizing  the minimum amount of initial capital that would guarantee the investor to beat the market portfolio with a certain probability  as a function of the market configuration and time to maturity.
Revised: Our goal is to resolve a problem proposed by Karatzas and Fernholz (2008) : Characterizing the minimum amount of initial capital with which an investor can beat the market portfolio with a certain probability as a function of the market configuration and time to maturity.
Edit intent: clarity
Original: Our goal is to resolve a problem proposed by Karatzas and Fernholz  (2008) : Characterizing  the minimum amount of initial capital that would guarantee the investor to beat the market portfolio with a certain probability  as a function of the market configuration and time to maturity.
Revised: Our goal is to resolve a problem proposed by Karatzas and Fernholz (2008) : Characterizing the minimum amount of initial capital that would guarantee the investor to beat the market portfolio with a certain probability , as a function of the market configuration and time to maturity.
Edit intent: fluency
Original:  As in Karatzas and Fernholz  (2008)  , we do not assume the existence of an equivalent local martingale measure  but merely the existence of a local martingale deflator.
Revised:  As in Fernholz and Karatzas (2008) , we do not assume the existence of an equivalent local martingale measure but merely the existence of a local martingale deflator.
Edit intent: fluency
Original:  As in Karatzas and Fernholz  (2008)  , we do not assume the existence of an equivalent local martingale measure  but merely the existence of a local martingale deflator.
Revised:  As in Karatzas and Fernholz On optimal arbitrage (2008) , we do not assume the existence of an equivalent local martingale measure but merely the existence of a local martingale deflator.
Edit intent: meaning-changed
Original:  As in Karatzas and Fernholz  (2008)  , we do not assume the existence of an equivalent local martingale measure  but merely the existence of a local martingale deflator.
Revised:  As in Karatzas and Fernholz (2008) Columbia Univ. , we do not assume the existence of an equivalent local martingale measure but merely the existence of a local martingale deflator.
Edit intent: meaning-changed
Original:  As in Karatzas and Fernholz  (2008)  , we do not assume the existence of an equivalent local martingale measure  but merely the existence of a local martingale deflator.
Revised:  As in Karatzas and Fernholz (2008) , we do not assume the existence of an equivalent local martingale measure , but merely the existence of a local martingale deflator.
Edit intent: fluency
Original: It is a common expectation in chemistry that a chemical transformation which takes place in the presence of a catalyst must also take place in its absence , though perhaps at a much slower rate. We say a reaction network is " saturated " if it satisfies such an expectation.
Revised: A "critical siphon" is a subset of the species in a chemical reaction network whose absence is forward invariant and stoichiometrically compatible with a positive point. We define "catalytic networks" as networks with an essentially catalytic reaction pathway: one which is " saturated " if it satisfies such an expectation.
Edit intent: meaning-changed
Original:  We say a reaction network is " saturated " if it satisfies such an expectation. We prove that the associated dynamical systems of saturated networkshave no relevant siphons , and are therefore permanent. Saturated networks generalize normal networks by Gnacadja, atomic event-systems by Adleman et al. and constructive networks by Shinar et al.
Revised:  We say a reaction network is " saturated " in the presence of certain catalysts and "off" in their absence. We show that synthetic DNA molecular circuits that have been shown to perform signal amplification and molecular logic happen to be examples of catalytic networks. Our main theorem is that all weakly-reversible networks with critical siphons are catalytic. We obtain new proofs for the persistence of atomic event-systems by Adleman et al. and constructive networks by Shinar et al.
Edit intent: meaning-changed