wanyu/IteraTeR_v2 huggingface dataset:
Original:  We are currently adapting our solver to model the linearized Poisson-Boltzmann equation for dilute ionic solutions, and our BEM simulator is flexible enough to solve a variety of other integral equation problems as well , ranging from simple Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Revised:  We are currently adapting our solver to model the linearized Poisson-Boltzmann equation for dilute ionic solutions, and our BEM simulator is flexible enough to be extended for a variety of other integral equation problems as well , ranging from simple Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Edit intent: clarity
Original:  We are currently adapting our solver to model the linearized Poisson-Boltzmann equation for dilute ionic solutions, and our BEM simulator is flexible enough to solve a variety of other integral equation problems as well , ranging from simple Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Revised:  We are currently adapting our solver to model the linearized Poisson-Boltzmann equation for dilute ionic solutions, and our BEM simulator is flexible enough to solve a variety of integral equation problems as well , ranging from simple Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Edit intent: fluency
Original:  We are currently adapting our solver to model the linearized Poisson-Boltzmann equation for dilute ionic solutions, and our BEM simulator is flexible enough to solve a variety of other integral equation problems as well , ranging from simple Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Revised:  We are currently adapting our solver to model the linearized Poisson-Boltzmann equation for dilute ionic solutions, and our BEM simulator is flexible enough to solve a variety of other integral equation problems , ranging from simple Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Edit intent: coherence
Original:  We are currently adapting our solver to model the linearized Poisson-Boltzmann equation for dilute ionic solutions, and our BEM simulator is flexible enough to solve a variety of other integral equation problems as well , ranging from simple Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Revised:  We are currently adapting our solver to model the linearized Poisson-Boltzmann equation for dilute ionic solutions, and our BEM simulator is flexible enough to solve a variety of other integral equation problems as well , ranging from Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Edit intent: clarity
Original: We present teraflop-scale simulations of biomolecular electrostatics enabled by the combination of algorithmic and hardware acceleration.
Revised: We present teraflop-scale calculations of biomolecular electrostatics enabled by the combination of algorithmic and hardware acceleration.
Edit intent: fluency
Original:  The applications demonstrated include the electrostatics of protein-drug binding and several multi-million atom systems consisting of hundreds to thousands of copies of lysozyme molecules.
Revised:  The applications demonstrated include the electrostatics of protein--drug binding and several multi-million atom systems consisting of hundreds to thousands of copies of lysozyme molecules.
Edit intent: fluency
Original:  Delicate tuning has resulted in a strong scaling with parallel efficiency of  0.5 for 512 GPUs.
Revised:  Delicate tuning has resulted in strong scaling with parallel efficiency of 0.5 for 512 GPUs.
Edit intent: fluency
Original:  For the largest application run, with over 20 million atoms and one billion unknowns  required only one minute on 512 GPUs.
Revised:  The largest application run, with over 20 million atoms and one billion unknowns required only one minute on 512 GPUs.
Edit intent: fluency
Original:  For the largest application run, with over 20 million atoms and one billion unknowns  required only one minute on 512 GPUs.
Revised:  For the largest application run, with over 20 million atoms and one billion unknowns , required only one minute on 512 GPUs.
Edit intent: fluency
Original:  Can these drawbacks be counteracted by counting citation weights fractionally instead of using integers ? (i) Fractional citation counts are normalized in terms of the citing papers and thus would take into account differences in citation behavior among fields of science.
Revised:  Can these drawbacks be counteracted by counting citation weights fractionally instead of using integers ? (i) Fractional citation counts are normalized in terms of the citing sources and thus would take into account differences in citation behavior among fields of science.
Edit intent: clarity
Original:  A list of fractionally counted Impact Factors and Total Cites for 2008 is available online at URL 
Revised:  A list of fractionally counted Impact Factors for 2008 is available online at URL 
Edit intent: clarity
Original: Most, if not all, population models use the concept of a carrying capacity.
Revised: A large amount of population models use the concept of a carrying capacity.
Edit intent: clarity
Original: This paper formalizes the " optimal base problem " , presents an algorithm to solve it, and describes its application to the encoding of Pseudo-Boolean constraints to SAT.
Revised: This paper formalizes the optimal base problem " , presents an algorithm to solve it, and describes its application to the encoding of Pseudo-Boolean constraints to SAT.
Edit intent: fluency
Original: This paper formalizes the " optimal base problem " , presents an algorithm to solve it, and describes its application to the encoding of Pseudo-Boolean constraints to SAT.
Revised: This paper formalizes the " optimal base problem , presents an algorithm to solve it, and describes its application to the encoding of Pseudo-Boolean constraints to SAT.
Edit intent: fluency
Original:  We demonstrate the impact of integrating our algorithm within the Pseudo-Boolean constraint solver MiniSAT +. Experimentation indicates that our algorithm scales to consider bases involving numbers up to 1,000,000, improving on the restriction in MiniSAT + to prime numbers up to 17.
Revised:  We demonstrate the impact of integrating our algorithm within the Pseudo-Boolean constraint solver MINISAT +. Experimentation indicates that our algorithm scales to consider bases involving numbers up to 1,000,000, improving on the restriction in MiniSAT + to prime numbers up to 17.
Edit intent: fluency
Original:  We demonstrate the impact of integrating our algorithm within the Pseudo-Boolean constraint solver MiniSAT +. Experimentation indicates that our algorithm scales to consider bases involving numbers up to 1,000,000, improving on the restriction in MiniSAT + to prime numbers up to 17.
Revised:  We demonstrate the impact of integrating our algorithm within the Pseudo-Boolean constraint solver MiniSAT +. Experimentation indicates that our algorithm scales to bases involving numbers up to 1,000,000, improving on the restriction in MiniSAT + to prime numbers up to 17.
Edit intent: clarity
Original:  We demonstrate the impact of integrating our algorithm within the Pseudo-Boolean constraint solver MiniSAT +. Experimentation indicates that our algorithm scales to consider bases involving numbers up to 1,000,000, improving on the restriction in MiniSAT + to prime numbers up to 17.
Revised:  We demonstrate the impact of integrating our algorithm within the Pseudo-Boolean constraint solver MiniSAT +. Experimentation indicates that our algorithm scales to consider bases involving numbers up to 1,000,000, improving on the restriction in MINISAT + to prime numbers up to 17.
Edit intent: fluency
Original:  We show that, while for many examples primes up to 17 do suffice, encoding with respect to arbitrary bases improves the subsequent SAT solving time considerably .
Revised:  We show that, while for many examples primes up to 17 do suffice, encoding with respect to arbitrary bases improves the subsequent SAT solving time for many examples .
Edit intent: clarity
Original:  First, we introduce streaming data-word transducers that map input data words to output data words in a single left-to-right pass in linear time.
Edit intent: coherence
Original:  The transducer uses a finite set of states, a finite set of variables ranging over  data domain, and a finite set of variables ranging over data words .
Revised:  The transducer uses a finite set of states, a finite set of variables ranging over the data domain, and a finite set of variables ranging over data words .
Edit intent: fluency
Original:  Second, we establish Pspace bounds for the problems of checking functional equivalence of two streaming transducers, and of checking whether a streaming transducer satisfies pre/post verification conditions specified by streaming acceptors over data-words.
Revised:  We establish that the problems of checking functional equivalence of two streaming transducers, and of checking whether a streaming transducer satisfies pre/post verification conditions specified by streaming acceptors over data-words.
Edit intent: clarity
Original:  Finally, we identify an expressively equivalent fragment of list-processing functional programs with syntactically restricted recursive calls.
Revised:  We also identify an expressively equivalent fragment of list-processing functional programs with syntactically restricted recursive calls.
Edit intent: coherence
Original:  Finally, we identify an expressively equivalent fragment of list-processing functional programs with syntactically restricted recursive calls.
Revised:  Finally, we identify an expressively equivalent fragment of functional programs that traverse a list using syntactically restricted recursive calls.
Edit intent: clarity
Original: With social networking sites providing increasingly richer context, user-centric service creation is expected to follow a similar growth with User-Generated Content.
Revised: With social networking sites providing increasingly richer context, User-Centric Service (UCS) creation is expected to follow a similar growth with User-Generated Content.
Edit intent: clarity
Original: With social networking sites providing increasingly richer context, user-centric service creation is expected to follow a similar growth with User-Generated Content.
Revised: With social networking sites providing increasingly richer context, user-centric service creation is expected to explode following a similar success path to User-Generated Content.
Edit intent: clarity
Original:  The performance of our algorithm shows remarkable insensitivity to the size and diameter of the network and resilience to inaccurate estimates of the service demand across the network.
Revised:  The performance of our algorithm shows remarkable insensitivity to the size and diameter of the network and resilience to inaccurate estimates of demands for UCS across the network.
Edit intent: clarity
Original:  Compared with distributed approaches that constrain the 1-median subgraph to the direct node neighborhood, our mechanism yields better service placements, which are not dependent on the location of the service generation .
Revised:  Compared with distributed approaches that constrain the subgraph to the direct node neighborhood, our mechanism yields better service placements, which are not dependent on the location of the service generation .
Edit intent: clarity
Original:  Compared with distributed approaches that constrain the 1-median subgraph to the direct node neighborhood, our mechanism yields better service placements, which are not dependent on the location of the service generation .
Revised:  Compared with distributed approaches that constrain the 1-median subgraph to the immediate neighbourhood of the node currently hosting UCS .
Edit intent: clarity
Original:  At rate \theta , new individuals singly enter the total population and start a new population which evolves like a supercritical, homogeneous, binary Crump-Mode-Jagers process: individuals have i.i.d. lifetimes durations (non necessarily exponential) during which they give birth independently at constant rate b.
Revised:  At rate theta , new individuals singly enter the total population and start a new population which evolves like a supercritical, homogeneous, binary Crump-Mode-Jagers process: individuals have i.i.d. lifetimes durations (non necessarily exponential) during which they give birth independently at constant rate b.
Edit intent: clarity
Original:  In the first model, the limit is the GEM distribution with parameter \theta /b.
Revised:  In the first model, the limit is the GEM distribution with parameter theta /b.
Edit intent: coherence
Original:  However , 3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g., Wi-Fi).
Revised:  At the same time , 3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g., Wi-Fi).
Edit intent: clarity
Original: Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy - even on parallel processors - unlike the classical (deterministic) alternatives.
Revised: Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy --- even on parallel processors - unlike the classical (deterministic) alternatives.
Edit intent: fluency
Original: Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy - even on parallel processors - unlike the classical (deterministic) alternatives.
Revised: Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy - even on parallel processors --- unlike the classical (deterministic) alternatives.
Edit intent: fluency
Original:  Note that the above results for single receiver scenario can be applied to the general setting in which there are multiple transmitters, relay nodes and receivers.
Revised:  Note that based on above results for single receiver scenario can be applied to the general setting in which there are multiple transmitters, relay nodes and receivers.
Edit intent: clarity
Original:  This contrasts with previous results such as  NP-hardness of computing individually stable or Nash stable partitions.
Revised:  This contrasts with previous results such as the NP-hardness of computing individually stable or Nash stable partitions.
Edit intent: fluency
Original:  Our results show that for a two-node star network, when transmitting energy and receiving energy are approximately the same, e.g., in a narrow-band system, the amount of energy reduction achievable through the network coding approach can be on the order of 27\% , while the reduction in the packet delivery energy per throughput rate can be as high as 37\%;
Revised:  Our results show that even for small networks, the amount of energy reduction achievable through the network coding approach can be on the order of 27\% , while the reduction in the packet delivery energy per throughput rate can be as high as 37\%;
Edit intent: clarity
Original:  If  matrices permit, both types of algorithms compute  eigenvalues and eigenvectors with high relative accuracy.
Revised:  If the matrices permit, both types of algorithms compute eigenvalues and eigenvectors with high relative accuracy.
Edit intent: fluency
Original:  If  matrices permit, both types of algorithms compute  eigenvalues and eigenvectors with high relative accuracy.
Revised:  If matrices permit, both types of algorithms compute the eigenvalues and eigenvectors with high relative accuracy.
Edit intent: fluency
Original:  We present novel parallelization techniques for both trigonometric and hyperbolic classes of algorithms, as well as some new ideas  how pivoting in each cycle of the algorithm can make the parallel one-sided algorithms even faster.
Revised:  We present novel parallelization techniques for both trigonometric and hyperbolic classes of algorithms, as well as some new ideas on how pivoting in each cycle of the algorithm can make the parallel one-sided algorithms even faster.
Edit intent: fluency
Original:  We present novel parallelization techniques for both trigonometric and hyperbolic classes of algorithms, as well as some new ideas  how pivoting in each cycle of the algorithm can make the parallel one-sided algorithms even faster.
Revised:  We present novel parallelization techniques for both trigonometric and hyperbolic classes of algorithms, as well as some new ideas how pivoting in each cycle of the algorithm can improve the speed of the parallel one-sided algorithms even faster.
Edit intent: clarity
Original:  The presented numerical testing shows that hyperbolic algorithms happen to be superior to  trigonometric ones, although in theory the latter seem more natural.
Revised:  The presented numerical testing shows that hyperbolic algorithms happen to be superior to the trigonometric ones, although in theory the latter seem more natural.
Edit intent: fluency
Original:  The presented numerical testing shows that hyperbolic algorithms happen to be superior to  trigonometric ones, although in theory the latter seem more natural.
Revised:  The presented numerical testing shows that hyperbolic algorithms happen to be superior to trigonometric ones, although , in theory, the latter seem more natural.
Edit intent: fluency
Original:  k Alon et al. , SODA 2010%DIFDELCMD < ] %%% and Crowston et al., SWAT 2010%DIFDELCMD < ]%%% . We observe that an O(2^{\eps k + \eps m \eps{\sc  \eps algorithm for every \eps >0 would imply that 3SAT is in subexponential time, so it seems unlikely that our runtime dependence on k can be significantly improved.
Revised:  k %DIFDELCMD < ] %%% and Crowston et al., SWAT 2010%DIFDELCMD < ]%%% . We observe that an O(2^{\eps k + \eps m \eps{\sc \eps algorithm for every \eps >0 would imply that 3SAT is in subexponential time, so it seems unlikely that our runtime dependence on k can be significantly improved.
Edit intent: clarity
Original:  k Alon et al. , SODA 2010%DIFDELCMD < ] %%% and Crowston et al., SWAT 2010%DIFDELCMD < ]%%% . We observe that an O(2^{\eps k + \eps m \eps{\sc  \eps algorithm for every \eps >0 would imply that 3SAT is in subexponential time, so it seems unlikely that our runtime dependence on k can be significantly improved.
Revised:  k Alon et al. , SODA 2010%DIFDELCMD < ] %%% Crowston et al., SWAT 2010%DIFDELCMD < ]%%% . We observe that an O(2^{\eps k + \eps m \eps{\sc \eps algorithm for every \eps >0 would imply that 3SAT is in subexponential time, so it seems unlikely that our runtime dependence on k can be significantly improved.
Edit intent: coherence
Original:  k Alon et al. , SODA 2010%DIFDELCMD < ] %%% and Crowston et al., SWAT 2010%DIFDELCMD < ]%%% . We observe that an O(2^{\eps k + \eps m \eps{\sc  \eps algorithm for every \eps >0 would imply that 3SAT is in subexponential time, so it seems unlikely that our runtime dependence on k can be significantly improved.
Revised:  k Alon et al. , SODA 2010%DIFDELCMD < ] %%% and %DIFDELCMD < ]%%% . We observe that an O(2^{\eps k + \eps m \eps{\sc \eps algorithm for every \eps >0 would imply that 3SAT is in subexponential time, so it seems unlikely that our runtime dependence on k can be significantly improved.
Edit intent: coherence
Original:  Our proof also shows that every Max-c-CSP has a linear kernel (of at most c(c + 1) k {\sc   /2 variables) under this parameterization, and that every Max-c-CSP admits a nontrivial hybrid algorithm. - Better algorithms for problemsapproximable by SDP: There is an algorithm for Max Cut such that for every graph with m edges, the algorithm outputs a cut with value at least \alpha OPT +k in 2 ^{O(k) m time (provided such a cut exists), where \alpha = .878\ldots is the Goemans-Williamson constant.
Revised:  Our proof also shows that every Max-c-CSP has a linear kernel (of at most c(c + 1) k {\sc /2 variables) under this parameterization, and that every Max-c-CSP admits a nontrivial hybrid algorithm. - Better algorithms for problemsapproximable by SDP: There is an algorithm for Max Cut such that for every graph with m edges, the algorithm outputs a cut with value at least \alpha OPT +k / 2 ^{O(k) m time (provided such a cut exists), where \alpha = .878\ldots is the Goemans-Williamson constant.
Edit intent: clarity
Original:  Our proof also shows that every Max-c-CSP has a linear kernel (of at most c(c + 1) k {\sc   /2 variables) under this parameterization, and that every Max-c-CSP admits a nontrivial hybrid algorithm. - Better algorithms for problemsapproximable by SDP: There is an algorithm for Max Cut such that for every graph with m edges, the algorithm outputs a cut with value at least \alpha OPT +k in 2 ^{O(k) m time (provided such a cut exists), where \alpha = .878\ldots is the Goemans-Williamson constant.
Revised:  Our proof also shows that every Max-c-CSP has a linear kernel (of at most c(c + 1) k {\sc /2 variables) under this parameterization, and that every Max-c-CSP admits a nontrivial hybrid algorithm. - Better algorithms for problemsapproximable by SDP: There is an algorithm for Max Cut such that for every graph with m edges, the algorithm outputs a cut with value at least \alpha OPT +k in 2 m time (provided such a cut exists), where \alpha = .878\ldots is the Goemans-Williamson constant.
Edit intent: clarity
Original:  Also there is an algorithm for }  {   \sc Max-2-Sat } such that for 2CNF with m clauses, the algorithm outputs an assignment with value at least \alpha OPT + k in 2^{O(k){\sc  {\sc  , where \alpha = .940\ldots is the Lewin { %DIFDELCMD < \em %%% et al.
Revised:  Also there is an algorithm for } { \sc Max-2-Sat } such that for 2CNF with m clauses, the algorithm outputs an assignment with value at least \alpha OPT + k in 2^{O(k){\sc {\sc , where \alpha = .940\ldots is the Lewin { %DIFDELCMD < \em %%% 
Edit intent: coherence
Original:  4) The inertial moment dependence of folding rate is calculated based on the model of dynamical contact order and the consistent results are obtained by comparison with 80-protein experimental dataset.
Revised:  4) The inertial moment dependence of folding rate is calculated based on the model of dynamical contact order and consistent results are obtained by comparison with 80-protein experimental dataset.
Edit intent: fluency
Original:  the sum of the durations of a pause and the following translocation is defined as the time of dwell of the ribosome at the corresponding codon.
Revised:  the sum of the durations of a pause and the following translocation is the time of dwell of the ribosome at the corresponding codon.
Edit intent: clarity
Original:  We present an analytical calculation of the distribution of the dwell times of a ribosome in our model.
Revised:  We derive the analytical expression for the distribution of the dwell times of a ribosome in our model.
Edit intent: clarity
Original: Motivated by recent observations in neural systems we investigate  networks of non-identical oscillators with an adaptive couplingthat models spike-timing dependent plasticity in which the sum of the weights of all incoming links is conserved.
Revised: Motivated by recent observations in neuronal systems we investigate networks of non-identical oscillators with an adaptive couplingthat models spike-timing dependent plasticity in which the sum of the weights of all incoming links is conserved.
Edit intent: fluency
Original:  Focusing on weak, all-to-all coupling we use the Kuramoto model to describe the oscillators.
Edit intent: coherence