wanyu/IteraTeR_full_sent huggingface dataset:
Original:   In aspect of security, we propose TILP & SSS strategies to secure our system .
Revised:  A new data synchronization mechanism named "Converged Consensus" is proposed to ensure the system reaches a consistent distributed consensus. We think the famous blockchain mechanism based on PoW is nolonger an essential element of a cryptocurrency system. In aspect of security, we propose TILP & SSS strategies to secure our system .
Edit intent: meaning-changed
Original:  The major parts what we have changed include  removing the bloated history transactions from data synchronization, no mining, no blockchain, it's environmentally friendly, no checkpoint, no exchange hub needed, it's purely decentralized and purely based on proof of stake.
Revised:  The major parts what we have changed include , a fast transparent distribution solution which can avoid deceptions between the sponsor and the audience, removing the bloated history transactions from data synchronization, no mining, no blockchain, it's environmentally friendly, no checkpoint, no exchange hub needed, it's purely decentralized and purely based on proof of stake.
Edit intent: meaning-changed
Original:  The major parts what we have changed include  removing the bloated history transactions from data synchronization, no mining, no blockchain, it's environmentally friendly, no checkpoint, no exchange hub needed, it's purely decentralized and purely based on proof of stake.
Revised:  The major parts what we have changed include removing the bloated history transactions from data synchronization, no mining, no blockchain, it's environmentally friendly, no checkpoint, no exchange hub needed, it's truly decentralized and purely based on proof of stake.
Edit intent: clarity
Original: There are some alternative Cryptocurrency systems which claim that they are based on PoS are actually based on PoSTW which denotes the Proof of Stake(coin), Time(day) and Work(hashing), while the other pure PoS Cryptocurrency systems are actually centralized. In this paper we propose a new framework of Cryptocurrency system .
Revised: We give an explicit definition of decentralization and show you that decentralization is almost impossible for the current stage. We propose a new framework of Cryptocurrency system .
Edit intent: meaning-changed
Original:  In this paper we propose a new framework of Cryptocurrency system . The major parts what we have changed include, a fast transparent distribution solution which can avoid deceptions between the sponsor and the audience, removing the bloated history transactions from data synchronization , no mining, no blockchain, it's environmentally friendly, no checkpoint, no exchange hub needed, it's truly decentralized and purely based on proof of stake.
Revised:  In this paper we propose a new framework of noncentralized cryptocurrency system with an assumption of the existence of a weak adversary for a bank alliance. It abandons the mining process and blockchain, and removes history transactions from data synchronization , no mining, no blockchain, it's environmentally friendly, no checkpoint, no exchange hub needed, it's truly decentralized and purely based on proof of stake.
Edit intent: meaning-changed
Original:  The major parts what we have changed include, a fast transparent distribution solution which can avoid deceptions between the sponsor and the audience, removing the bloated history transactions from data synchronization , no mining, no blockchain, it's environmentally friendly, no checkpoint, no exchange hub needed, it's truly decentralized and purely based on proof of stake. The logic is very simple and intuitive, 51\% of stakes talk. The highlight of this paper is a proposal of a new concise data synchronization mechanism named "Converged Consensus" which ensures the system reaches a consistent distributed consensus.
Revised:  The major parts what we have changed include, a fast transparent distribution solution which can avoid deceptions between the sponsor and the audience, removing the bloated history transactions from data synchronization . We propose a consensus algorithm named "Converged Consensus" which ensures the system reaches a consistent distributed consensus.
Edit intent: clarity
Original:  The highlight of this paper is a proposal of a new concise data synchronization mechanism named "Converged Consensus" which ensures the system reaches a consistent distributed consensus. We think the famous blockchain mechanism based on PoW is no longer an essential element of a Cryptocurrency system. In aspect of security, we propose TILP SSS strategies to secure our system.
Revised:  The highlight of this paper is a proposal of a new concise data synchronization mechanism named "Converged Consensus" SSS strategies to secure our system.
Edit intent: coherence
Original:  Several works have proposed asymptotic analysis of densities and implied volatilities in models involving specific instances of this equation, based on a careful implementation of saddle-point methods and (essentially) the explicit knowledge of Fourier transforms.
Revised:  Several works have proposed asymptotic analysis of densities and implied volatilities in models involving instances of this equation, based on a careful implementation of saddle-point methods and (essentially) the explicit knowledge of Fourier transforms.
Edit intent: clarity
Original:  2013, arxiv:1305.6765 suggests to work with the rescaled variable X^{\varepsilon}:=\varepsilon^{1/(1-\gamma)} X: while allowing to turn a spatial asymptotic problem into a  fixed terminal point, small-\varepsilon problem, the process X^{\varepsilon} satisfies a SDE in Wentzell--Freidlin form (i.e. with driving noise \varepsilon dB).
Revised:  2013, arxiv:1305.6765 suggests to work with the rescaled variable X^{\varepsilon}:=\varepsilon^{1/(1-\gamma)} X: while allowing to turn a space asymptotic problem into a fixed terminal point, small-\varepsilon problem, the process X^{\varepsilon} satisfies a SDE in Wentzell--Freidlin form (i.e. with driving noise \varepsilon dB).
Edit intent: fluency
Original:  2013, arxiv:1305.6765 suggests to work with the rescaled variable X^{\varepsilon}:=\varepsilon^{1/(1-\gamma)} X: while allowing to turn a spatial asymptotic problem into a  fixed terminal point, small-\varepsilon problem, the process X^{\varepsilon} satisfies a SDE in Wentzell--Freidlin form (i.e. with driving noise \varepsilon dB).
Revised:  2013, arxiv:1305.6765 suggests to work with the rescaled variable X^{\varepsilon}:=\varepsilon^{1/(1-\gamma)} X: while allowing to turn a spatial asymptotic problem into a small-\varepsilon problem with fixed terminal point, small-\varepsilon problem, the process X^{\varepsilon} satisfies a SDE in Wentzell--Freidlin form (i.e. with driving noise \varepsilon dB).
Edit intent: clarity
Original:  2013, arxiv:1305.6765 suggests to work with the rescaled variable X^{\varepsilon}:=\varepsilon^{1/(1-\gamma)} X: while allowing to turn a spatial asymptotic problem into a  fixed terminal point, small-\varepsilon problem, the process X^{\varepsilon} satisfies a SDE in Wentzell--Freidlin form (i.e. with driving noise \varepsilon dB).
Revised:  2013, arxiv:1305.6765 suggests to work with the rescaled variable X^{\varepsilon}:=\varepsilon^{1/(1-\gamma)} X: while allowing to turn a spatial asymptotic problem into a fixed terminal point, the process X^{\varepsilon} satisfies a SDE in Wentzell--Freidlin form (i.e. with driving noise \varepsilon dB).
Edit intent: meaning-changed
Original:  while on the one hand the resulting formulae are confirmed by the CIR-CEV benchmarks, on the other hand the large deviation approach (i) applies to equations with a more general drift term  (ii) potentially opens the way to heat kernel analysis for higher-dimensional diffusions involving such an SDE as a component.
Revised:  while on the one hand the resulting formulae are confirmed by the CIR-CEV benchmarks, on the other hand the large deviation approach (i) applies to equations with a more general drift term and (ii) potentially opens the way to heat kernel analysis for higher-dimensional diffusions involving such an SDE as a component.
Edit intent: coherence
Original:  Assume that each queue of type  r is replicated k times and consider the set of policies that are periodic with period k \sum_r p_r and such that exactly p_r jobs are sent in a period to each queue of type  r.
Revised:  Assuming that each queue of type r is replicated k times and consider the set of policies that are periodic with period k \sum_r p_r and such that exactly p_r jobs are sent in a period to each queue of type r.
Edit intent: coherence
Original:  Assume that each queue of type  r is replicated k times and consider the set of policies that are periodic with period k \sum_r p_r and such that exactly p_r jobs are sent in a period to each queue of type  r.
Revised:  Assume that each queue of type ~ r is replicated k times and consider the set of policies that are periodic with period k \sum_r p_r and such that exactly p_r jobs are sent in a period to each queue of type r.
Edit intent: meaning-changed
Original:  Assume that each queue of type  r is replicated k times and consider the set of policies that are periodic with period k \sum_r p_r and such that exactly p_r jobs are sent in a period to each queue of type  r.
Revised:  Assume that each queue of type r is replicated ~k times, we consider a set of policies that are periodic with period k \sum_r p_r and such that exactly p_r jobs are sent in a period to each queue of type r.
Edit intent: clarity
Original:  Assume that each queue of type  r is replicated k times and consider the set of policies that are periodic with period k \sum_r p_r and such that exactly p_r jobs are sent in a period to each queue of type  r.
Revised:  Assume that each queue of type r is replicated k times and consider the set of policies that are periodic with period k \sum_r p_r and such that exactly p_r jobs are sent in a period to each queue of type ~ r.
Edit intent: meaning-changed
Original:  When k\to\infty, our main result shows that all the policies in this set are equivalent, in the sense that they yield the same mean stationary waiting time, and optimal, in the sense that no other policy having the same aggregate arrival rate to all queues of a given type can do better in minimizing the stationary mean waiting time.
Revised:  When k\to\infty, our main result shows that all the policies in this set are equivalent, in the sense that they yield the same mean stationary waiting time, and optimal, in the sense that no other policy having the same aggregate arrival rate to all queues of a given type can do better in minimizing the stationary mean waiting time.
Edit intent: fluency
Original: Though the problem of pattern formation in biological systems has been studied  more than sixty years, it is from the beginning of this cen- tury that the synergy between theoretical and experimental researchers are depicting the ins and outs of this problem.
Revised: Though the problem of pattern formation in biological systems has been studied for more than sixty years, it is from the beginning of this cen- tury that the synergy between theoretical and experimental researchers are depicting the ins and outs of this problem.
Edit intent: clarity
Original: Though the problem of pattern formation in biological systems has been studied  more than sixty years, it is from the beginning of this cen- tury that the synergy between theoretical and experimental researchers are depicting the ins and outs of this problem.
Revised: Though the problem of pattern formation in biological systems has been studied more than sixty years, it is from the beginning of this century that the synergy between theoretical and experimental researchers are depicting the ins and outs of this problem.
Edit intent: fluency
Original:  We found that the mechanism underlying the patterning obeys to the dy- namics of a 3-nodes network motif with a double negative feedback loop fed by a morphogenetic gradient that triggers the inhibition in a French flag problem fashion.
Revised:  We found that the mechanism underlying the patterning obeys to the dynamics of an activator-repressor feedback loop fed by a morphogenetic gradient that triggers the inhibition in a French flag problem fashion.
Edit intent: clarity
Original:  We found that the mechanism underlying the patterning obeys to the dy- namics of a 3-nodes network motif with a double negative feedback loop fed by a morphogenetic gradient that triggers the inhibition in a French flag problem fashion.
Revised:  We found that the mechanism underlying the patterning obeys to the dy- namics of a 3-nodes network motif with a double negative feedback loop fed by a morphogenetic gradient in a French flag problem fashion.
Edit intent: clarity
Original:  Interestingly, the network provides a steady state solution in the interocellar part of the patterning and an oscillatory regime in the ocelli . Though the dynamical models can achieve steady state solutions for the full pattern, it is possible that the transcriptional regulation in part of this network is actually done in an oscillatory way .
Revised:  Interestingly, the network provides a steady state solution in the interocellar part of the patterning and an oscillatory regime in the ocelli .
Edit intent: coherence
Original: Though the problem of pattern formation in biological systems has been studied for more than sixty years, it is from the beginning of this century that the synergy between theoretical and experimental researchers are depicting the ins and outs of this problem .
Revised: URLanogenesis, developmental programs governed by Gene Regulatory Networks (GRN) define the functionality, size and shape of the different constituents of URLanisms. Robustness, thus, is an essential characteristic that GRNs need to fulfill in order to maintain viability and reproducibility in a species .
Edit intent: meaning-changed
Original:  Interestingly, the Boolean networks analysis reveals a steady state solution in the interocellar part of the patterning and an oscillatory regime in the ocelli  .
Revised:  Interestingly, the Boolean networks analysis reveals a steady state solution in the interocellar part of the patterning and an oscillatory regime in the ocelli . This theoretical result predicts that the ocellar pattern may underlie oscillatory dynamics in its genetic regulation .
Edit intent: meaning-changed
Original: When trades are crossed between multiple alpha streams, portfolio turnover decreases. Turnover reduction needs to be taken into account for optimizing asset allocation to these alphas. We propose a spectral model of turnover reduction for a general alpha correlation matrix in the limit where the number of alphas is large .
Revised: When trades are crossed internally. We model turnover reduction via alpha correlations. Then, for a large number of alphas is large .
Edit intent: clarity
Original: In the last years the vertex enumeration problem of polyhedra has seen a revival in the study of metabolic networks, which increased the demand for efficient vertex enumeration algorithms for high-dimensional polyhedra given by inequalities.
Revised: Over the last years the vertex enumeration problem of polyhedra has seen a revival in the study of metabolic networks, which increased the demand for efficient vertex enumeration algorithms for high-dimensional polyhedra given by inequalities.
Edit intent: clarity
Original:   In this paper we apply the concept of branch-decomposition to the vertex enumeration problem of polyhedra P = \{x : Sx = b, x \geq 0\}.
Revised:  It is a famous and long standing open question in polyhedral theory and computational geometry whether the vertices of a polytope (bounded polyhedron), described by a set of linear constraints, can be enumerated in total polynomial time. In this paper we apply the concept of branch-decomposition to the vertex enumeration problem of polyhedra P = \{x : Sx = b, x \geq 0\}.
Edit intent: meaning-changed
Original:  In addition to smart meters, buildings are also increasingly managed with Building Management Systems (BMS) which control different sub-systems such as lighting and heating, ventila-tion , and air conditioning (HVAC).
Revised:  In addition to smart meters, buildings are also increasingly managed with Building Management Systems (BMS) which control different sub-systems such as lighting and heating, ventilation , and air conditioning (HVAC).
Edit intent: fluency
Original: Maximum drawdown, the largest cumulative loss from peak to trough, is one of the most widely used indicators of risk in the fund management industry, but one of the least developed in the context of probabilistic riskmetrics .
Revised: Maximum drawdown, the largest cumulative loss from peak to trough, is one of the most widely used indicators of risk in the fund management industry, but one of the least developed in the context of measures of risk .
Edit intent: clarity
Original:  The structural properties we considered include buriedness (  relative solvent accessibility and contact number), structural flexibility (  B factors, root-mean-square fluctuations, and variation in dihedral angles), and variability in designed structures.
Revised:  The quantities we considered include buriedness ( relative solvent accessibility and contact number), structural flexibility ( B factors, root-mean-square fluctuations, and variation in dihedral angles), and variability in designed structures.
Edit intent: clarity
Original:  The structural properties we considered include buriedness (  relative solvent accessibility and contact number), structural flexibility (  B factors, root-mean-square fluctuations, and variation in dihedral angles), and variability in designed structures.
Revised:  The structural properties we considered include buriedness ( as measured by relative solvent accessibility and contact number), structural flexibility ( B factors, root-mean-square fluctuations, and variation in dihedral angles), and variability in designed structures.
Edit intent: meaning-changed
Original:  The structural properties we considered include buriedness (  relative solvent accessibility and contact number), structural flexibility (  B factors, root-mean-square fluctuations, and variation in dihedral angles), and variability in designed structures.
Revised:  The structural properties we considered include buriedness ( relative solvent accessibility ), packing density (as measured by contact number), structural flexibility ( B factors, root-mean-square fluctuations, and variation in dihedral angles), and variability in designed structures.
Edit intent: meaning-changed
Original:  The structural properties we considered include buriedness (  relative solvent accessibility and contact number), structural flexibility (  B factors, root-mean-square fluctuations, and variation in dihedral angles), and variability in designed structures.
Revised:  The structural properties we considered include buriedness ( relative solvent accessibility and contact number), structural flexibility ( as measured by B factors, root-mean-square fluctuations, and variation in dihedral angles), and variability in designed structures.
Edit intent: meaning-changed
Original:  We conclude that simple measures of buriedness  are better predictors of evolutionary variation than are more complicated predictors obtained from dynamic simulations, ensembles of homologous structures, or computational protein design.
Revised:  We conclude that simple measures of buriedness and packing density are better predictors of evolutionary variation than are more complicated predictors obtained from dynamic simulations, ensembles of homologous structures, or computational protein design.
Edit intent: meaning-changed
Original: We study a bivariate mean reverting stochastic volatility model , finding an explicit expression for the decay of cross-asset correlations over time. We compare our result with the empirical time series of the Dow Jones Industrial Average and the Financial Times Stock Exchange 100 in the period 1984-2013 , finding an excellent agreement.
Revised: We study a bivariate mean reverting stochastic volatility model which satisfies some relevant stylized facts of financial markets. We introduce an algorithm for the detection of peaks in the volatility profile, that we apply to the time series of the Dow Jones Industrial Average and the Financial Times Stock Exchange 100 in the period 1984-2013 , finding an excellent agreement.
Edit intent: meaning-changed
Original:  We compare our result with the empirical time series of the Dow Jones Industrial Average and the Financial Times Stock Exchange 100 in the period 1984-2013 , finding an excellent agreement. The main features of the model consist in the jumps in the volatilities and a nonlinear mean reversion. Based on these features , we propose an algorithm for the detection of jumps in the volatility .
Revised:  We compare our result with the empirical time series of the Dow Jones Industrial Average and the Financial Times Stock Exchange 100 in the period 1984-2013 . Based on empirical results , we propose an algorithm for the detection of jumps in the volatility .
Edit intent: coherence
Original: Central counterparties (CCPs) require initial margin (IM) to be posted for derivative portfolios cleared through them. Additionally, the Basel Committee on Banking Supervision has proposed in BCBS-261 that all significant OTC derivatives trading must also post IM by 2019. IM is typically calculated using Value-at-Risk (VAR)or Conditional Value-at-Risk (CVAR, aka Expected Shortfall) , based on historical simulation.
Revised: Initial margin requirements are becoming an increasingly common feature of derivative markets. However, while the valuation of derivatives under collateralisation (Piterbarg 2010 , based on historical simulation.
Edit intent: meaning-changed
Original:  IM is typically calculated using Value-at-Risk (VAR)or Conditional Value-at-Risk (CVAR, aka Expected Shortfall) , based on historical simulation. As previously noted (Green2013a), (Green2013b)IM requirements give rise to a need for unsecured funding similar to FVA on unsecured derivatives. The IM cost to the derivatives originator requires an integral of the funding cost over the funding profile which depends on VAR- or CVAR-based calculation. VAR, here, involves running a historical simulation Monte Carlo inside a risk-neutral Monte Carlo simulation. Brute force calculation is computationally unfeasible. This paper presents a computationally efficient method of calculating IM costs for any derivative portfolio: Longstaff-Schwartz Augmented Compression , (LSAC) . Essentially, Longstaff-Schwartz is used with an augmented state space to retain accuracy for VAR-relevant changes to the state variables.
Revised:  IM is typically calculated using Value-at-Risk (VAR)or Conditional Value-at-Risk (CVAR, aka Expected Shortfall) , Piterbarg2012), under counterparty risk with unsecured funding costs (FVA) (Burgard2011, Burgard2011, Burgard2013) and in the presence of regulatory capital (KVA) (Green2014) are established through valuation adjustments, hitherto initial margin has not been considered. This paper further extends the semi-replication framework of (Burgard2013a), itself later extended by (Green2014), to cover the cost of initial margin, leading to Margin Valuation Adjustment (MVA). Initial margin requirements are typically generated through the use of VAR or CVAR models. Given the form of MVA as an integral over the expected initial margin profile this would lead to excessive computational costs if a brute force calculation were to be used. Hence we also propose a computationally efficient method of calculating IM costs for any derivative portfolio: Longstaff-Schwartz Augmented Compression , (LSAC) . Essentially, Longstaff-Schwartz is used with an augmented state space to retain accuracy for VAR-relevant changes to the state variables.
Edit intent: meaning-changed