wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Saturated networks generalize normal networks by Gnacadja, atomic event-systems by Adleman et al. and constructive networks by Shinar et al. Our result is independent of the specific rates,and the deficiency of the network. The question of permanence for weakly-reversible reaction networks remains an important and long-standing open problem .
Revised:  Saturated networks generalize normal networks by Gnacadja, atomic event-systems by Adleman et al. , and normal networks of Gnacadja. We define "autocatalytic networks," and conjecture that weakly-reversible reaction networks remains an important and long-standing open problem .
Edit intent: clarity
Original: 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 "on " in the presence of certain catalysts and "off " in their absence.
Revised: We define catalytic networks with an essentially catalytic reaction pathway: one which is "on " in the presence of certain catalysts and "off " in their absence.
Edit intent: clarity
Original:  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 .
Revised:  We show that synthetic DNA molecular circuits that have been shown to perform signal amplification and molecular logic . Recall that 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 .
Edit intent: meaning-changed
Original: We have combined and integrated our previously developed library-based Growth and Monte Carlo simulation techniques in order to allow for both thorough sampling and free energy measurements of all-atom peptides.
Revised: Pre-calculated libraries of molecular fragment configurations have previously been used as a basis for both equilibrium sampling (via " library-based Growth and Monte Carlo simulation techniques in order to allow for both thorough sampling and free energy measurements of all-atom peptides.
Edit intent: meaning-changed
Original: We have combined and integrated our previously developed library-based Growth and Monte Carlo simulation techniques in order to allow for both thorough sampling and free energy measurements of all-atom peptides.
Revised: We have combined and integrated our previously developed library-based Monte Carlo") and for obtaining absolute free energies using a polymer-growth formalism. Here, we combine the two approaches to extend the size of systems for which free energies can be calculated. We study a series of all-atom peptides.
Edit intent: meaning-changed
Original: We have combined and integrated our previously developed library-based Growth and Monte Carlo simulation techniques in order to allow for both thorough sampling and free energy measurements of all-atom peptides. The integrated growth and relaxation technique makes use of pre-calculated Boltzmann distributed statistical libraries of molecular-fragments and their corresponding energies . Due to this new implementation, we are now able to accurately determine free energies and sample phase space for larger systems that were previously unattainable with library-based growth. We report sampling quality and statistics on free energy measurements for four polypeptide systems that we examined. We discuss possible applications of this new and more general library-based method .
Revised: We have combined and integrated our previously developed library-based Growth and Monte Carlo simulation techniques in order to allow for both thorough sampling and free energy measurements of all-atom poly-alanine systems in a simple dielectric "solvent" and find that precise free energies can be obtained rapidly. For instance, for 12 residues, less than an hour of single-processor is required. The combined approach is formally equivalent to the "annealed importance sampling" algorithm; instead of annealing by decreasing temperature, however, interactions among fragments are gradually added as the molecule is "grown." We discuss implications for future binding affinity calculations in which a ligand is grown into a binding site .
Edit intent: meaning-changed
Original:  A scheme for the estimation of some parameters of the model is illustrated, so that it can be tailored on the URLanizational structure of a specific bank . We focus on the case in which there are no causal loops in the matrix of couplings and exploit the exact solution to estimate also the parameters of the noise.
Revised:  A scheme for the estimation of some parameters of the model is illustrated, so that it can be tailored on the URLanizational structure of a specific bank by estimating some of its parameters from historical operational losses. The model is exactly solved in the case in which there are no causal loops in the matrix of couplings and exploit the exact solution to estimate also the parameters of the noise.
Edit intent: meaning-changed
Original:  The scheme for the estimation of the parameters is proved to be consistent and the model is shown to exhibit a remarkable capability in forecasting future cumulative losses .
Revised:  The forecasting power of the model is investigated by using a fraction f of simulated data to estimate the parameters, showing that for f = 0.75 the VaR can be forecast with an error \simeq 10^{-3 .
Edit intent: meaning-changed
Original: Site-specific recombination is an important cellular process that yields a variety of knotted and catenated DNA products on supercoiled circular DNA  . Twist knots are some of the most common conformations of these products  .
Revised: Site-specific recombination is an important cellular process that yields a variety of knotted and catenated DNA products on supercoiled circular DNA molecules can yield a variety of knots and catenanes . Twist knots are some of the most common conformations of these products .
Edit intent: meaning-changed
Original: Site-specific recombination is an important cellular process that yields a variety of knotted and catenated DNA products on supercoiled circular DNA  . Twist knots are some of the most common conformations of these products  .
Revised: Site-specific recombination is an important cellular process that yields a variety of knotted and catenated DNA products on supercoiled circular DNA . Twist knots are some of the most common conformations of these products and they can act as substrates for further rounds of site-specific recombination .
Edit intent: meaning-changed
Original:  The model cell includes three independent  pathways, whose topologies of PPI subnetworks are different, but whose functional concentrations equally contribute to cell's fitness . The model cells evolve through genotypic mutations and phenotypic protein copy number variations.
Revised:  The model cell includes three independent pathways, whose topologies of PPI subnetworks are different, but whose contributions to the cell fitness are equal. Model cells evolve through genotypic mutations and phenotypic protein copy number variations.
Edit intent: clarity
Original:  We found a strong relationship between evolved physical-chemical properties of protein interactions and their abundances due to a "frustration" effect: strengthening of functional interactions brings about hydrophobic surfaces , which make proteins prone to promiscuous binding.
Revised:  We found a strong relationship between evolved physical-chemical properties of protein interactions and their abundances due to a "frustration" effect: strengthening of functional interactions brings about hydrophobic interfaces , which make proteins prone to promiscuous binding.
Edit intent: clarity
Original:  The non-monotonic relation between abundances and Protein-Protein Interaction network degrees of yeast proteins validates our predictions. Furthermore, in agreement with our model we found that highly abundant yeast proteins show a positive correlation between their degree and dosage sensitivity with respect to overexpression .
Revised:  Based on these principles we generated and analyzed a possible realization of the proteome-wide PPI network in yeast. In this simulation we found that highly abundant yeast proteins show a positive correlation between their degree and dosage sensitivity with respect to overexpression .
Edit intent: clarity
Original:  Carr with Itkin and Sun have discussed the pricing of variance swaps under this type of model. This paper studies a special case of this model and observes an explosion of prices for squared volatility and variance swaps . It argues that such a price explosion may have deeper economic reasons, which should be taken into account when designing volatility derivativesraire portfolio.
Revised:  Carr with Itkin and Sun have discussed the pricing of variance swaps are obtained under the benchmark approach, which only requires the existence of the num\'{eraire portfolio.
Edit intent: meaning-changed
Original:  This paper explores the dynamics of VANETs in urban environments  . Using both real and realistic mobility traces, we study the networking shape of VANETs in urban environments under different transmission and market penetration ranges.
Revised:  This paper explores the dynamics of VANETs in urban environments and investigates the impact of these findings in the design of VANET routing protocols . Using both real and realistic mobility traces, we study the networking shape of VANETs in urban environments under different transmission and market penetration ranges.
Edit intent: meaning-changed
Original: We present an analytical model that enables a comparison of multiple design options of Opportunistic Spectrum Orthogonal Frequency Division Multiple Access (OS-OFDMA) . The model considers continuous and non-continuous subchannel allocation algorithms, as well as different ways to bond separate non-continuous frequency bands.
Revised: We present an analytical model that enables throughput evaluation of Opportunistic Spectrum Orthogonal Frequency Division Multiple Access (OS-OFDMA) . The model considers continuous and non-continuous subchannel allocation algorithms, as well as different ways to bond separate non-continuous frequency bands.
Edit intent: clarity
Original: We present an analytical model that enables a comparison of multiple design options of Opportunistic Spectrum Orthogonal Frequency Division Multiple Access (OS-OFDMA) . The model considers continuous and non-continuous subchannel allocation algorithms, as well as different ways to bond separate non-continuous frequency bands. Different user priorities and channel dwell times, for the Secondary Users and the Primary Users of the radio spectrum, are studied. Further, the model allows the inclusion of different types of Secondary User traffic. Finally, the model enables the study of multiple two-stage spectrum sensing algorithms.
Revised: We present an analytical model that enables a comparison of multiple design options of Opportunistic Spectrum Orthogonal Frequency Division Multiple Access (OS-OFDMA) networks. The core feature of the model, based on a discrete time Markov chain, is the consideration of different channel and subchannel allocation strategies under different Primary and Secondary user types, traffic and priority levels. The analytical model also assesses the impact of different spectrum sensing strategies on the throughput of OS-OFDMA network. The analysis applies to the IEEE 802.22 standard, to evaluate the impact of two-stage spectrum sensing algorithms.
Edit intent: meaning-changed
Original:  Finally, the model enables the study of multiple two-stage spectrum sensing algorithms. Analysis is based on a discrete time Markov chain model which allows for the computation of network characteristics such as the average throughput. From the analysis we conclude that OS-OFDMA with subchannel notching and channel bonding could provide , under certain network configurations, almost seven times higher throughput than the design without those options enabled .
Revised:  Finally, the model enables the study of multiple two-stage spectrum sensing strategy and varying temporal activity of wireless microphones on the IEEE 802.22 throughput. Our study suggests that OS-OFDMA with subchannel notching and channel bonding could provide , under certain network configurations, almost seven times higher throughput than the design without those options enabled .
Edit intent: meaning-changed
Original:  From the analysis we conclude that OS-OFDMA with subchannel notching and channel bonding could provide , under certain network configurations, almost seven times higher throughput than the design without those options enabled .
Revised:  From the analysis we conclude that OS-OFDMA with subchannel notching and channel bonding could provide , under certain network configurations, almost seven times higher throughput compared with the design without those options enabled .
Edit intent: clarity
Original:  From the analysis we conclude that OS-OFDMA with subchannel notching and channel bonding could provide , under certain network configurations, almost seven times higher throughput than the design without those options enabled .
Revised:  From the analysis we conclude that OS-OFDMA with subchannel notching and channel bonding could provide , under certain network configurations, almost seven times higher throughput than the design without those options , when the activity and density of wireless microphones is very high. Furthermore, we confirm that OS-OFDMA implementation without subchannel notching, used in the IEEE 802.22, is able to support real-time and non-real-time quality of service classes, provided that wireless microphones temporal activity is moderate (with approximately one wireless microphone per 3,000 inhabitants with light urban population density and short duty cycles). Finally, two-stage spectrum sensing option improves OS-OFDMA throughput, provided that the length of spectrum sensing at every stage is optimized using our model .
Edit intent: meaning-changed
Original:  This paper aims at working out the optimal retention ratio, dividend payout level, explicit value function of the insurance company under bankrupt probability constraint by stochastic analysis, PDE methods and variational inequality approach , getting a risk-based capital standard to ensure the capital requirement of can cover the total given risk by numerical analysis , and giving reasonable economic interpretation for the results.
Revised:  This paper aims working out the optimal retention ratio, dividend payout level, explicit value function of the insurance company under bankrupt probability constraint by stochastic analysis, PDE methods and variational inequality approach , getting a risk-based capital standard to ensure the capital requirement of can cover the total given risk by numerical analysis , and giving reasonable economic interpretation for the results.
Edit intent: fluency
Original:  This paper aims at working out the optimal retention ratio, dividend payout level, explicit value function of the insurance company under bankrupt probability constraint by stochastic analysis, PDE methods and variational inequality approach , getting a risk-based capital standard to ensure the capital requirement of can cover the total given risk by numerical analysis , and giving reasonable economic interpretation for the results.
Revised:  This paper aims at working out the optimal control policy as well as optimal return function for the company under bankrupt probability constraint by stochastic analysis, PDE methods and variational inequality approach , getting a risk-based capital standard to ensure the capital requirement of can cover the total given risk by numerical analysis , and giving reasonable economic interpretation for the results.
Edit intent: clarity
Original:  This paper aims at working out the optimal retention ratio, dividend payout level, explicit value function of the insurance company under bankrupt probability constraint by stochastic analysis, PDE methods and variational inequality approach , getting a risk-based capital standard to ensure the capital requirement of can cover the total given risk by numerical analysis , and giving reasonable economic interpretation for the results.
Revised:  This paper aims at working out the optimal retention ratio, dividend payout level, explicit value function of the insurance company under bankrupt probability constraint by stochastic analysis, PDE methods and variational inequality approach . Moreover, we establish a risk-based capital standard to ensure the capital requirement of can cover the total given risk by numerical analysis , and giving reasonable economic interpretation for the results.
Edit intent: coherence
Original:  This paper aims at working out the optimal retention ratio, dividend payout level, explicit value function of the insurance company under bankrupt probability constraint by stochastic analysis, PDE methods and variational inequality approach , getting a risk-based capital standard to ensure the capital requirement of can cover the total given risk by numerical analysis , and giving reasonable economic interpretation for the results.
Revised:  This paper aims at working out the optimal retention ratio, dividend payout level, explicit value function of the insurance company under bankrupt probability constraint by stochastic analysis, PDE methods and variational inequality approach , getting a risk-based capital standard to ensure the capital requirement of can cover the total given risk by numerical analysis and give reasonable economic interpretation for the results.
Edit intent: coherence
Original:  5) The exergonic and endergonic folding are distinguished through the comparison between theoretical and experimental rates for each protein and the ultrafast folding problem is viewed from the point of quantum folding theory  .
Revised:  5) The exergonic and endergonic foldings are distinguished through the comparison between theoretical and experimental rates for each protein and the ultrafast folding problem is viewed from the point of quantum folding theory .
Edit intent: fluency
Original:  5) The exergonic and endergonic folding are distinguished through the comparison between theoretical and experimental rates for each protein and the ultrafast folding problem is viewed from the point of quantum folding theory  .
Revised:  5) The exergonic and endergonic folding are distinguished through the comparison between theoretical and experimental rates for each protein . The ultrafast folding problem is viewed from the point of quantum folding theory .
Edit intent: coherence
Original:  5) The exergonic and endergonic folding are distinguished through the comparison between theoretical and experimental rates for each protein and the ultrafast folding problem is viewed from the point of quantum folding theory  .
Revised:  5) The exergonic and endergonic folding are distinguished through the comparison between theoretical and experimental rates for each protein and the ultrafast folding problem is viewed from the point of quantum folding theory and a new folding speed limit is deduced from quantum uncertainty relation .
Edit intent: meaning-changed
Original:  And finally, 6) since only the torsion-accessible states are manageable in the present formulation of quantum transition how the set of torsion-accessible states can be expanded by using statistical energy landscape approach is discussed  .
Revised:  And finally, 6) since only the torsion-accessible states are manageable in the present formulation of quantum transition how the set of torsion-accessible states can be expanded by using statistical energy landscape approach is discussed . All above discussions support the view that the protein folding is essentially a quantum transition between conformational states .
Edit intent: meaning-changed
Original: Ribosome is a molecular machine that polymerizes a protein where the sequence of the amino acid subunits of the protein  is dictated by the sequence of codons (triplets of nucleotide subunits ) on a messenger RNA (mRNA) that serves as the template.
Revised: Ribosome is a molecular machine that polymerizes a protein where the sequence of the amino acid residues, the monomers of the protein is dictated by the sequence of codons (triplets of nucleotide subunits ) on a messenger RNA (mRNA) that serves as the template.
Edit intent: meaning-changed
Original: Ribosome is a molecular machine that polymerizes a protein where the sequence of the amino acid subunits of the protein  is dictated by the sequence of codons (triplets of nucleotide subunits ) on a messenger RNA (mRNA) that serves as the template.
Revised: Ribosome is a molecular machine that polymerizes a protein where the sequence of the amino acid subunits of the protein , is dictated by the sequence of codons (triplets of nucleotide subunits ) on a messenger RNA (mRNA) that serves as the template.
Edit intent: fluency
Original: Ribosome is a molecular machine that polymerizes a protein where the sequence of the amino acid subunits of the protein  is dictated by the sequence of codons (triplets of nucleotide subunits ) on a messenger RNA (mRNA) that serves as the template.
Revised: Ribosome is a molecular machine that polymerizes a protein where the sequence of the amino acid subunits of the protein is dictated by the sequence of codons (triplets of nucleotides ) on a messenger RNA (mRNA) that serves as the template.
Edit intent: clarity
Original: A Markovian model  is proposed in this paper to study the performance of 1-persistent CSMA / CA protocols, from which we obtain stable regions with respect to the throughput and bounded delay of Geometric Retransmission and Exponential Backoff scheduling algorithms .
Revised: A Markovian model of 1-persistent CSMA/CA protocols with K-Exponential Backoff scheduling algorithms is proposed in this paper to study the performance of 1-persistent CSMA / CA protocols, from which we obtain stable regions with respect to the throughput and bounded delay of Geometric Retransmission and Exponential Backoff scheduling algorithms .
Edit intent: meaning-changed
Original: A Markovian model  is proposed in this paper to study the performance of 1-persistent CSMA / CA protocols, from which we obtain stable regions with respect to the throughput and bounded delay of Geometric Retransmission and Exponential Backoff scheduling algorithms .
Revised: A Markovian model is proposed in this paper . The input buffer of each access node is modeled as a Geo / CA protocols, from which we obtain stable regions with respect to the throughput and bounded delay of Geometric Retransmission and Exponential Backoff scheduling algorithms .
Edit intent: meaning-changed
Original: A Markovian model  is proposed in this paper to study the performance of 1-persistent CSMA / CA protocols, from which we obtain stable regions with respect to the throughput and bounded delay of Geometric Retransmission and Exponential Backoff scheduling algorithms .
Revised: A Markovian model is proposed in this paper to study the performance of 1-persistent CSMA / G/1 queue, and the service time distribution of each individual head-of-line packet is derived from the Markov chain of underlying scheduling algorithm, from which we obtain stable regions with respect to the throughput and bounded delay of Geometric Retransmission and Exponential Backoff scheduling algorithms .
Edit intent: meaning-changed
Original: A Markovian model  is proposed in this paper to study the performance of 1-persistent CSMA / CA protocols, from which we obtain stable regions with respect to the throughput and bounded delay of Geometric Retransmission and Exponential Backoff scheduling algorithms .
Revised: A Markovian model is proposed in this paper to study the performance of 1-persistent CSMA / CA protocols, from which we obtain stable regions of the retransmission factor that ensures the throughput stability of the system and bounded mean delay of input packets .
Edit intent: clarity