wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Our algorithm follows the general high-level approach of Cabello, but differs in the way it is implemented. Our main technical contribution is an explicit and efficient construction of additively weighted Voronoi diagrams on planar graphs (under the assumption that all Voronoi sites lie on a constant number of faces). The idea of using Voronoi diagrams is also borrowed from Cabello, except that he uses abstract Voronoi diagrams (as a black box) , which makes the implementation more involved, more expensive, and randomized.
Revised:  Our use of Voronoi diagrams to compute the diameter follows that of Cabello, but he used abstract Voronoi diagrams (as a black box) , which makes the implementation more involved, more expensive, and randomized.
Edit intent: clarity
Original:  The idea of using Voronoi diagrams is also borrowed from Cabello, except that he uses abstract Voronoi diagrams (as a black box) , which makes the implementation more involved, more expensive, and randomized.
Revised:  The idea of using Voronoi diagrams is also borrowed from Cabello, except that he uses abstract Voronoi diagrams , which makes the implementation more involved, more expensive, and randomized.
Edit intent: coherence
Original:  The idea of using Voronoi diagrams is also borrowed from Cabello, except that he uses abstract Voronoi diagrams (as a black box) , which makes the implementation more involved, more expensive, and randomized.
Revised:  The idea of using Voronoi diagrams is also borrowed from Cabello, except that he uses abstract Voronoi diagrams (as a black box) , which makes his diameter algorithm more involved, more expensive, and randomized.
Edit intent: clarity
Original:  As in Cabello's work, our algorithm can also compute the Wiener index of ( sum of all pairwise distances in) a planar graph, within the same bounds  .
Revised:  As in Cabello's work, our algorithm can also compute the Wiener index of a planar graph (i.e., the sum of all pairwise distances in) a planar graph, within the same bounds .
Edit intent: clarity
Original:  As in Cabello's work, our algorithm can also compute the Wiener index of ( sum of all pairwise distances in) a planar graph, within the same bounds  .
Revised:  As in Cabello's work, our algorithm can also compute the Wiener index of ( sum of all pairwise distances in) a planar graph, within the same bound. Our construction of Voronoi diagrams for planar graphs is of independent interest. It has already been used to obtain fast exact distance oracles for planar graphs .
Edit intent: meaning-changed
Original:  As in Cabello's work, our algorithm can also compute the Wiener index of ( sum of all pairwise distances in) a planar graph, within the same bounds  .
Revised:  As in Cabello's work, our algorithm can also compute the Wiener index of ( sum of all pairwise distances in) a planar graph, within the same bounds Cohen-Addad et al., FOCS'17 .
Edit intent: meaning-changed
Original:  We show how to preprocess G in \tilde O(nb^2) time \tilde  so that one can compute any additively weighted Voronoi diagram for these sites in \tilde O(b) time.
Revised:  We show how to preprocess G in \tilde O(nb^2) time (footnote: The\tilde so that one can compute any additively weighted Voronoi diagram for these sites in \tilde O(b) time.
Edit intent: meaning-changed
Original:  We show how to preprocess G in \tilde O(nb^2) time \tilde  so that one can compute any additively weighted Voronoi diagram for these sites in \tilde O(b) time.
Revised:  We show how to preprocess G in \tilde O(nb^2) time \tilde O notation hides polylogarithmic factors.) so that one can compute any additively weighted Voronoi diagram for these sites in \tilde O(b) time.
Edit intent: meaning-changed
Original:  As in Cabello's work, our algorithm can also computethe Wiener index of a planar graph (i.e., the sum of all pairwise distances)  within the same bound .
Revised:  As in Cabello's work, our algorithm can compute, for every vertex v, both the farthest vertex from v (i.e., the sum of all pairwise distances) within the same bound .
Edit intent: meaning-changed
Original:  As in Cabello's work, our algorithm can also computethe Wiener index of a planar graph (i.e., the sum of all pairwise distances)  within the same bound .
Revised:  As in Cabello's work, our algorithm can also computethe Wiener index of a planar graph (i.e., the eccentricity of v), and the sum of distances from v to all other vertices. Hence, our algorithm can also compute the radius, median, and Wiener index (sum of all pairwise distances) within the same bound .
Edit intent: meaning-changed
Original:  As in Cabello's work, our algorithm can also computethe Wiener index of a planar graph (i.e., the sum of all pairwise distances)  within the same bound .
Revised:  As in Cabello's work, our algorithm can also computethe Wiener index of a planar graph (i.e., the sum of all pairwise distances) of a planar graph within the same bound .
Edit intent: meaning-changed
Original:  As in Cabello's work, our algorithm can also computethe Wiener index of a planar graph (i.e., the sum of all pairwise distances)  within the same bound .
Revised:  As in Cabello's work, our algorithm can also computethe Wiener index of a planar graph (i.e., the sum of all pairwise distances) within the same time bounds .
Edit intent: clarity
Original:  Our approach utilizes oblique Decision Trees in order to recursively partition an application's configuration space in disjoint regions, choose a set of representative samples from each subregion according to a defined policy and returns a model for the entire configuration space as a composition of linear models over each subregion.
Revised:  Our approach utilizes oblique Decision Trees in order to recursively partition an application's configuration space in disjoint regions, choose a set of representative samples from each subregion according to a defined policy and return a model for the entire configuration space as a composition of linear models over each subregion.
Edit intent: fluency
Original:  Our approach utilizes oblique Decision Trees in order to recursively partition an application's configuration space in disjoint regions, choose a set of representative samples from each subregion according to a defined policy and returns a model for the entire configuration space as a composition of linear models over each subregion.
Revised:  Our approach utilizes oblique Decision Trees in order to recursively partition an application's configuration space in disjoint regions, choose a set of representative samples from each subregion according to a defined policy and returns a model for the entire space as a composition of linear models over each subregion.
Edit intent: fluency
Original: It is a long standing open problem whether Yao-Yao graphs YY_{k} are all spanners ~\mbox{%DIFAUXCMD li2002sparse . Bauer and Damian ~\mbox{%DIFAUXCMD bauer2013infinite showed that all YY_{6k} for k \geq 6 are spanners.
Revised: It is a long standing open problem whether Yao-Yao graphs YY_{k} are all spanners li2002sparse . Bauer and Damian ~\mbox{%DIFAUXCMD bauer2013infinite showed that all YY_{6k} for k \geq 6 are spanners.
Edit intent: fluency
Original: It is a long standing open problem whether Yao-Yao graphs YY_{k} are all spanners ~\mbox{%DIFAUXCMD li2002sparse . Bauer and Damian ~\mbox{%DIFAUXCMD bauer2013infinite showed that all YY_{6k} for k \geq 6 are spanners.
Revised: It is a long standing open problem whether Yao-Yao graphs YY_{k} are all spanners ~\mbox{%DIFAUXCMD li2002sparse . Bauer and Damian bauer2013infinite showed that all YY_{6k} for k \geq 6 are spanners.
Edit intent: fluency
Original:  Li and Zhan ~\mbox{%DIFAUXCMD li2016almost generalized their result and proved that all even Yao-Yao graphs YY_{2k} are spanners (for k\geq 42).
Revised:  Li and Zhan li2016almost generalized their result and proved that all even Yao-Yao graphs YY_{2k} are spanners (for k\geq 42).
Edit intent: coherence
Original:  Finally, since simulation-based methods are needed to simulate from the joint posterior distribution, we utilize recent innovations to efficiently sample from high-dimensional multivariate Gaussian distributions that improve upon recent algorithms by large margins. In the empirical exercise we apply the model to US data and evaluate its forecasting capabilities.
Revised:  Finally, since simulation-based methods are needed to simulate from the joint posterior distribution, we utilize recent innovations to efficiently sample from high-dimensional multivariate Gaussian distributions . This makes simulation-based fully Bayesian inference feasible when the dimensionality is large but the time series length is moderate. We demonstrate the merits of our approach in an extensive simulation study and apply the model to US data and evaluate its forecasting capabilities.
Edit intent: meaning-changed
Original:  Comparison with light scattering experiments revealed that MARTINI strongly overestimates non-bonded interactions for a prototypic polysaccharide , leading to unrealistic aggregation .
Revised:  Comparison with light scattering experiments revealed a non-physical aggregation of a prototypical polysaccharide in MARTINI, pointing at an imbalance of the non-bonded interactions for a prototypic polysaccharide , leading to unrealistic aggregation .
Edit intent: clarity
Original:  Comparison with light scattering experiments revealed that MARTINI strongly overestimates non-bonded interactions for a prototypic polysaccharide , leading to unrealistic aggregation .
Revised:  Comparison with light scattering experiments revealed that MARTINI strongly overestimates non-bonded interactions for a prototypic polysaccharide , solute-water, and water-water interactions .
Edit intent: meaning-changed
Original: We obtain the ] ] stationary invariant distribution of a Markov model of a LRU cache assuming a capacity in terms of a fixed number of objects .
Revised: We obtain the ] ], exploring different insertion and eviction policies, and the performance of networks of them have been analyzed in different ways. We review stationary Markovian models of caching networks with independent incident (data) object demand processes and independent storing decisions (object insertion) and forwarding decisions (owing to cache misses) by the caches. We obtain a novel closed-form stationary invariant distribution of a Markov model of a LRU cache assuming a capacity in terms of a fixed number of objects .
Edit intent: meaning-changed
Original: We obtain the ] ] stationary invariant distribution of a Markov model of a LRU cache assuming a capacity in terms of a fixed number of objects .
Revised: We obtain the ] ] stationary invariant distribution for LRU and MRU caching nodes, and numerically compare with a simple "Incremental Rank Progress" caching mechanism where cache hits result in slower progress through the ranks than LRU .
Edit intent: meaning-changed
Original: An large number of different caching mechanisms have been previously proposed 1 ,%DIFDELCMD < [%%% 3 , exploring different insertion and eviction policies , and the performance of networks of them have been analyzed in different ways.
Revised: An large number of different caching mechanisms have been previously proposed ,%DIFDELCMD < [%%% 3 , exploring different insertion and eviction policies , and the performance of networks of them have been analyzed in different ways.
Edit intent: coherence
Original: An large number of different caching mechanisms have been previously proposed 1 ,%DIFDELCMD < [%%% 3 , exploring different insertion and eviction policies , and the performance of networks of them have been analyzed in different ways.
Revised: An large number of different caching mechanisms have been previously proposed 1 %DIFDELCMD < [%%% 3 , exploring different insertion and eviction policies , and the performance of networks of them have been analyzed in different ways.
Edit intent: fluency
Original: An large number of different caching mechanisms have been previously proposed 1 ,%DIFDELCMD < [%%% 3 , exploring different insertion and eviction policies , and the performance of networks of them have been analyzed in different ways.
Revised: An large number of different caching mechanisms have been previously proposed 1 ,%DIFDELCMD < [%%% , exploring different insertion and eviction policies , and the performance of networks of them have been analyzed in different ways.
Edit intent: clarity
Original: An large number of different caching mechanisms have been previously proposed 1 ,%DIFDELCMD < [%%% 3 , exploring different insertion and eviction policies , and the performance of networks of them have been analyzed in different ways.
Revised: An large number of different caching mechanisms have been previously proposed 1 ,%DIFDELCMD < [%%% 3 \mbox{%DIFAUXCMD Aven87,Krunz04,Wikipedia-cache-replacement-policies exploring different insertion and eviction policies , and the performance of networks of them have been analyzed in different ways.
Edit intent: meaning-changed
Original: An large number of different caching mechanisms have been previously proposed 1 ,%DIFDELCMD < [%%% 3 , exploring different insertion and eviction policies , and the performance of networks of them have been analyzed in different ways. We review stationary Markovian models of caching networkswith independent incident (data) object demand processes and independent storing decisions (object insertion) and forwarding decisions (owing to cache misses) by the caches .
Revised: An large number of different caching mechanisms have been previously proposed 1 ,%DIFDELCMD < [%%% 3 , exploring different insertion and eviction policies and their performance individually and as part of caching networks .
Edit intent: clarity
Original:  We obtain a novel closed-form stationary invariant distribution for  LRU and MRU caching nodes , and numerically compare with a simple "Incremental Rank Progress" caching mechanism where cache hits result in slower progress through the ranks than LRU.
Revised:  We obtain a novel closed-form stationary invariant distribution for Markov model of a generalization of LRU and MRU caching nodes , and numerically compare with a simple "Incremental Rank Progress" caching mechanism where cache hits result in slower progress through the ranks than LRU.
Edit intent: meaning-changed
Original:  We obtain a novel closed-form stationary invariant distribution for  LRU and MRU caching nodes , and numerically compare with a simple "Incremental Rank Progress" caching mechanism where cache hits result in slower progress through the ranks than LRU.
Revised:  We obtain a novel closed-form stationary invariant distribution for LRU and MRU caching nodes . Numerical comparisons are made with an "Incremental Rank Progress" caching mechanism where cache hits result in slower progress through the ranks than LRU.
Edit intent: clarity
Original:  We obtain a novel closed-form stationary invariant distribution for  LRU and MRU caching nodes , and numerically compare with a simple "Incremental Rank Progress" caching mechanism where cache hits result in slower progress through the ranks than LRU.
Revised:  We obtain a novel closed-form stationary invariant distribution for LRU and MRU caching nodes , and numerically compare with a simple "Incremental Rank Progress" (CLIMB) and random eviction/replacement methods under a Zipf popularity distribution. The range of cache hit probabilities is smaller under MRU and larger under IRP compared to LRU.
Edit intent: meaning-changed
Original: An large number of different caching mechanisms have been previously proposed \mbox{%DIFAUXCMD Aven87,Krunz04,Wikipedia-cache-replacement-policies , exploring different insertion and eviction policies and their performance individually and as part of caching networks.
Revised: Many different caching mechanisms have been previously proposed \mbox{%DIFAUXCMD Aven87,Krunz04,Wikipedia-cache-replacement-policies , exploring different insertion and eviction policies and their performance individually and as part of caching networks.
Edit intent: clarity
Original: An large number of different caching mechanisms have been previously proposed \mbox{%DIFAUXCMD Aven87,Krunz04,Wikipedia-cache-replacement-policies , exploring different insertion and eviction policies and their performance individually and as part of caching networks.
Revised: An large number of different caching mechanisms have been previously proposed , exploring different insertion and eviction policies and their performance individually and as part of caching networks.
Edit intent: clarity
Original:  We obtain a novel closed-form stationary invariant distribution for Markov model of a generalization of LRU and MRU caching nodes  . Numerical comparisons are made with an "Incremental Rank Progress" (  CLIMB) and random eviction /replacement methods under a  Zipf popularity distribution.
Revised:  We obtain a novel closed-form stationary invariant distribution for a generalization of LRU and MRU caching nodes . Numerical comparisons are made with an "Incremental Rank Progress" ( CLIMB) and random eviction /replacement methods under a Zipf popularity distribution.
Edit intent: clarity
Original:  We obtain a novel closed-form stationary invariant distribution for Markov model of a generalization of LRU and MRU caching nodes  . Numerical comparisons are made with an "Incremental Rank Progress" (  CLIMB) and random eviction /replacement methods under a  Zipf popularity distribution.
Revised:  We obtain a novel closed-form stationary invariant distribution for Markov model of a generalization of LRU and MRU caching nodes under a reference Markov model . Numerical comparisons are made with an "Incremental Rank Progress" ( CLIMB) and random eviction /replacement methods under a Zipf popularity distribution.
Edit intent: meaning-changed
Original:  We obtain a novel closed-form stationary invariant distribution for Markov model of a generalization of LRU and MRU caching nodes  . Numerical comparisons are made with an "Incremental Rank Progress" (  CLIMB) and random eviction /replacement methods under a  Zipf popularity distribution.
Revised:  We obtain a novel closed-form stationary invariant distribution for Markov model of a generalization of LRU and MRU caching nodes . Numerical comparisons are made with an "Incremental Rank Progress" ( IRP a.k.a. CLIMB) and random eviction /replacement methods under a Zipf popularity distribution.
Edit intent: meaning-changed
Original:  We obtain a novel closed-form stationary invariant distribution for Markov model of a generalization of LRU and MRU caching nodes  . Numerical comparisons are made with an "Incremental Rank Progress" (  CLIMB) and random eviction /replacement methods under a  Zipf popularity distribution.
Revised:  We obtain a novel closed-form stationary invariant distribution for Markov model of a generalization of LRU and MRU caching nodes . Numerical comparisons are made with an "Incremental Rank Progress" ( CLIMB) and random eviction (a.k.a. random replacement) methods under a Zipf popularity distribution.
Edit intent: clarity
Original:  We obtain a novel closed-form stationary invariant distribution for Markov model of a generalization of LRU and MRU caching nodes  . Numerical comparisons are made with an "Incremental Rank Progress" (  CLIMB) and random eviction /replacement methods under a  Zipf popularity distribution.
Revised:  We obtain a novel closed-form stationary invariant distribution for Markov model of a generalization of LRU and MRU caching nodes . Numerical comparisons are made with an "Incremental Rank Progress" ( CLIMB) and random eviction /replacement methods under a steady-state Zipf popularity distribution.
Edit intent: clarity
Original: Molecular motors are nonequilibrium open systems that convert chemical energy to mechanical work. Here we investigate the nonequilibrium energetics of a single molecule kinesin by measuring the motion of an attached probe particle and its response to external forces with optical tweezers.
Revised: Nonequilibrium energetics of single molecule translational motor kinesin was investigated by measuring heat dissipation from the violation of the motion of an attached probe particle and its response to external forces with optical tweezers.
Edit intent: meaning-changed
Original:  The sum of the heat dissipation estimated from the violation of the fluctuation-response relation and the output power was inconsistent with the input free energy rate, implying that internal dissipation is dominant. By using a two-state Markov model, we discuss the energy flow of the kinesin motor .
Revised:  The sum of the heat dissipation estimated from the violation of the fluctuation-response relation and the output power was inconsistent with the input free energy change, indicating large hidden dissipation exists. Possible sources of the hidden dissipation were explored by analyzing the Langevin dynamics of the probe, which incorporates the two-state Markov model, we discuss the energy flow of the kinesin motor .
Edit intent: meaning-changed
Original: It was shown in C. elegans that life-long treatments with low level of the prooxidant paraquat increased ROS , which then acted as the signal to slow down aging by activating the intrinsic apoptosis pathway. And deficiencies of the electron transport chain subunits increased longevity through similar mechanisms. We surprisingly found that ROS were down- and up-regulated respectively upon chronic and transient paraquat treatments, although the same ROS measuring approaches were applied. Adaptive responses were shown to be responsible for the reduction under chronic stress. Post young adult stage started treatments shortened lifespan at all concentrations tested, and mild extension was only observed by treating with proper concentration of paraquat from egg hatching. However, the extension in the latter case can be fully explained by growth retardation. Thus, paraquat actually accelerated aging rather than slowed down it. The interactions between oxidative stress, ROS, and aging should be more elegant than thought .
Revised: It was shown in C. elegans that life-long treatments with low level of the prooxidant paraquat increased ROS , which then acted as the signal to slow down aging is getting popular. We here proposed an idea that aging is slowed down by secondary responses rather than ROS .
Edit intent: meaning-changed
Original:  The relation between pairs, called  spread, is modeled by a Gaussian mean-reverting process whose drift rate is modulated by an unobservable continuous-time finite state Markov chain.
Revised:  The relation between pairs, called spread, is modeled by a Gaussian mean-reverting process whose drift rate is modulated by an unobservable continuous-time , finite-state Markov chain.
Edit intent: fluency
Original:  Using the classical stochastic filtering theory, we reduce this problem with partial information to the one with complete information and solve it for the logarithmic utility function, where the terminal wealth is penalized by the riskiness of the portfolio according to the realized volatility of the wealth process.
Revised:  Using the classical stochastic filtering theory, we reduce this problem with partial information to the one with full information and solve it for the logarithmic utility function, where the terminal wealth is penalized by the riskiness of the portfolio according to the realized volatility of the wealth process.
Edit intent: clarity
Original:  In this paper, we propose an O(n^2 log nlog log n+nm log m)-time algorithm for any m, which improves the previous work even for m=1.
Revised:  In this paper, we propose an O(n^2 log nlog log n+nm log m)-time algorithm for a more general setting with any m\geq 1, which also improves the previous work even for m=1.
Edit intent: meaning-changed
Original:  We then consider a line-constrained version of the problem in which the segments of S are all initially on the line L. Previously, an O(n log n)-time algorithm was known for the case m=1.
Revised:  We then consider a line-constrained version of the problem in which the segments of S are all initially on the line L. Previously, an O(n \log n)-time algorithm was known for the case m=1.
Edit intent: meaning-changed