wanyu/IteraTeR_full_sent huggingface dataset:
Original:   In particular, we find a nonlinear scaling of the mean {\em   number of particles accumulated at the tip (%DIFDELCMD < {\em %%% tip size ) with injection rate and an associated phase transition leading to {\em pulsing states} characterized by periodic filling and emptying of the system . Moreover, we show that the ability of changing protofilaments can affect the transport efficiency. Finally, we show that the particle-direction change rate obtained from experiments is close to optimal in order to achieve efficient motor URLanelle transport in a living cell .
Revised:  In particular, we find a nonlinear scaling of the mean {\em number of particles accumulated at the tip (%DIFDELCMD < {\em %%% tip size ) with injection rate and an associated phase transition leading to {\em pulsing states} characterized by periodic filling and emptying of the system .
Edit intent: coherence
Original:   This paper presents low-level optimizations for the backprojection algorithm, guided by a thorough performance analysis on four generations of Intel multicore processors (Harpertown, Westmere, Nehalem EX, and Sandy Bridge).
Revised:  Medical imaging algorithms are on the verge of employing High Performance Computing (HPC) technology, and are therefore an interesting new candidate for optimization. This paper presents low-level optimizations for the backprojection algorithm, guided by a thorough performance analysis on four generations of Intel multicore processors (Harpertown, Westmere, Nehalem EX, and Sandy Bridge).
Edit intent: meaning-changed
Original:   This paper presents low-level optimizations for the backprojection algorithm, guided by a thorough performance analysis on four generations of Intel multicore processors (Harpertown, Westmere, Nehalem EX, and Sandy Bridge).
Revised:  This paper presents low-level optimizations for the backprojection algorithm, guided by a thorough performance analysis on four generations of Intel multicore processors (Harpertown, Westmere, Westmere EX, and Sandy Bridge).
Edit intent: clarity
Original:  We separate the influence of algorithmic optimizations, parallelization, SIMD vectorization, and microarchitectural issues on performance and pinpoint problems with current  instruction set extensions on standard CPUs (SSE, AVX)  . Finally we compare our results to the best GPGPU implementations available for this open competition benchmark.
Revised:  We separate the influence of algorithmic optimizations, parallelization, SIMD vectorization, and microarchitectural issues and pinpoint problems with current instruction set extensions on standard CPUs (SSE, AVX) . Finally we compare our results to the best GPGPU implementations available for this open competition benchmark.
Edit intent: clarity
Original:  We separate the influence of algorithmic optimizations, parallelization, SIMD vectorization, and microarchitectural issues on performance and pinpoint problems with current  instruction set extensions on standard CPUs (SSE, AVX)  . Finally we compare our results to the best GPGPU implementations available for this open competition benchmark.
Revised:  We separate the influence of algorithmic optimizations, parallelization, SIMD vectorization, and microarchitectural issues on performance and pinpoint problems with current SIMD instruction set extensions on standard CPUs (SSE, AVX) . Finally we compare our results to the best GPGPU implementations available for this open competition benchmark.
Edit intent: fluency
Original:  We separate the influence of algorithmic optimizations, parallelization, SIMD vectorization, and microarchitectural issues on performance and pinpoint problems with current  instruction set extensions on standard CPUs (SSE, AVX)  . Finally we compare our results to the best GPGPU implementations available for this open competition benchmark.
Revised:  We separate the influence of algorithmic optimizations, parallelization, SIMD vectorization, and microarchitectural issues on performance and pinpoint problems with current instruction set extensions on standard CPUs (SSE, AVX) . The use of assembly language is mandatory for best performance . Finally we compare our results to the best GPGPU implementations available for this open competition benchmark.
Edit intent: meaning-changed
Original:  Under a structural credit risk model based on spectrally negative Levy processes, we analyze the existence of the Nash equilibrium and derive the associated saddle point. Using the principles of smooth and continuous fit , we determine the buyer's and seller's equilibrium exercise strategies , which are of threshold type . Numerical examples are provided to illustrate the impacts of default risk and  contractual features on the fair premium and exercise strategies .
Revised:  Under a structural credit risk model based on spectrally negative Levy processes, we apply the principles of smooth and continuous fit , we determine the buyer's and seller's equilibrium exercise strategies , which are of threshold type . Numerical examples are provided to illustrate the impacts of default risk and contractual features on the fair premium and exercise strategies .
Edit intent: coherence
Original:  Using the principles of smooth and continuous fit , we determine the buyer's and seller's equilibrium exercise strategies , which are of threshold type . Numerical examples are provided to illustrate the impacts of default risk and  contractual features on the fair premium and exercise strategies .
Revised:  Using the principles of smooth and continuous fit to identify the equilibrium exercise strategies , which are of threshold type . Numerical examples are provided to illustrate the impacts of default risk and contractual features on the fair premium and exercise strategies .
Edit intent: clarity
Original:  Using the principles of smooth and continuous fit , we determine the buyer's and seller's equilibrium exercise strategies , which are of threshold type . Numerical examples are provided to illustrate the impacts of default risk and  contractual features on the fair premium and exercise strategies .
Revised:  Using the principles of smooth and continuous fit , we determine the buyer's and seller's equilibrium exercise strategies for the buyer and the seller. We then rigorously prove the existence of the Nash equilibrium and compute the contract value at equilibrium . Numerical examples are provided to illustrate the impacts of default risk and contractual features on the fair premium and exercise strategies .
Edit intent: meaning-changed
Original:  Using the principles of smooth and continuous fit , we determine the buyer's and seller's equilibrium exercise strategies , which are of threshold type . Numerical examples are provided to illustrate the impacts of default risk and  contractual features on the fair premium and exercise strategies .
Revised:  Using the principles of smooth and continuous fit , we determine the buyer's and seller's equilibrium exercise strategies , which are of threshold type . Numerical examples are provided to illustrate the impacts of default risk and other contractual features on the fair premium and exercise strategies .
Edit intent: clarity
Original:  Using the principles of smooth and continuous fit , we determine the buyer's and seller's equilibrium exercise strategies , which are of threshold type . Numerical examples are provided to illustrate the impacts of default risk and  contractual features on the fair premium and exercise strategies .
Revised:  Using the principles of smooth and continuous fit , we determine the buyer's and seller's equilibrium exercise strategies , which are of threshold type . Numerical examples are provided to illustrate the impacts of default risk and contractual features on the players' exercise timing at equilibrium .
Edit intent: clarity
Original:  The empirical collective strategy reproduces the theoretical equilibrium with striking accuracy for small  N, while for larger N the quality of the fit deteriorates. As a consequence, the same game exhibits lottery-like and game-of-skill features, depending on the collective size of the bidding pool .
Revised:  The empirical collective strategy reproduces the theoretical equilibrium with striking accuracy for small N, while for larger N a qualitatively different distribution is observed. We interpret this result as the emergence of two different phases, one in which adaptation is feasible and one in which it is not .
Edit intent: clarity
Original:  The model consists of a pre-synaptic bouton, a post-synaptic dendritic spine head , a synaptic cleft and a perisynaptic astrocyte controlling Ca2+ dynamics inside the synaptic bouton.
Revised:  The model consists of a pre-synaptic bouton, a post-synaptic dendritic spine-head , a synaptic cleft and a perisynaptic astrocyte controlling Ca2+ dynamics inside the synaptic bouton.
Edit intent: fluency
Original:  The model consists of a pre-synaptic bouton, a post-synaptic dendritic spine head , a synaptic cleft and a perisynaptic astrocyte controlling Ca2+ dynamics inside the synaptic bouton.
Revised:  The model consists of a pre-synaptic bouton, a post-synaptic dendritic spine head , a synaptic cleft and a peri-synaptic astrocyte controlling Ca2+ dynamics inside the synaptic bouton.
Edit intent: fluency
Original:  As an application, this model clearly shows synaptic potentiation in the hippocampal region, i.e., astrocyte Ca2+ mediates synaptic plasticity, which is in conformity with the majority of the recent findings   .
Revised:  As an application, this model clearly shows synaptic potentiation in the hippocampal region, i.e., astrocyte Ca2+ mediates synaptic plasticity, which is in conformity with the majority of the recent findings (Perea .
Edit intent: meaning-changed
Original:  As an application, this model clearly shows synaptic potentiation in the hippocampal region, i.e., astrocyte Ca2+ mediates synaptic plasticity, which is in conformity with the majority of the recent findings   .
Revised:  As an application, this model clearly shows synaptic potentiation in the hippocampal region, i.e., astrocyte Ca2+ mediates synaptic plasticity, which is in conformity with the majority of the recent findings Araque, 2007; Henneberger et al., 2010) .
Edit intent: meaning-changed
Original:  It is shown that, under some mild conditions, the suboptimal strategies for investors with different performance criterions can be constructed using a limited number of fixed processes (mutual funds), for a market with a larger number of available risky stocks.
Revised:  It is shown that, under some mild conditions, near optimal strategies for investors with different performance criterions can be constructed using a limited number of fixed processes (mutual funds), for a market with a larger number of available risky stocks.
Edit intent: clarity
Original:  It is shown that, under some mild conditions, the suboptimal strategies for investors with different performance criterions can be constructed using a limited number of fixed processes (mutual funds), for a market with a larger number of available risky stocks.
Revised:  It is shown that, under some mild conditions, the suboptimal strategies for investors with different performance criteria can be constructed using a limited number of fixed processes (mutual funds), for a market with a larger number of available risky stocks.
Edit intent: fluency
Original: We establish that mass conserving single terminal-linkage networks of chemical reactions admit positive equilibria regardless of the choice of reaction rate constants and network deficiency .
Revised: We establish that mass conserving single terminal-linkage networks of chemical reactions admit positive equilibria regardless of the choice of reaction rate constants . This result holds for closed systems without material exchange across the boundary, as well as for open systems with material exchange at rates that satisfy a simple sufficient and necessary condition .
Edit intent: meaning-changed
Original:  In particular, we argue that the presence of disorder in the topology of vertices crucially modifies the transport features of a network: irregular networks develop bimodal density distributions , whereas regular networks are dominated by shocks  .
Revised:  In particular, we argue that the presence of disorder in the topology of vertices crucially modifies the transport features of a network: irregular networks involve homogeneous segments and have a bimodal distribution of edge densities , whereas regular networks are dominated by shocks .
Edit intent: meaning-changed
Original:  In particular, we argue that the presence of disorder in the topology of vertices crucially modifies the transport features of a network: irregular networks develop bimodal density distributions , whereas regular networks are dominated by shocks  .
Revised:  In particular, we argue that the presence of disorder in the topology of vertices crucially modifies the transport features of a network: irregular networks develop bimodal density distributions , whereas regular networks are dominated by shocks leading to a unimodal density distribution .
Edit intent: meaning-changed
Original:  Changes of interaction-weights of yeast interactome were calculated from the changes of mRNA expression levels . Heat shock induced a significant decrease in both the overlaps and connections of yeast interactome modules.
Revised:  Changes of interaction-weights of yeast interactome were calculated from the changes of mRNA expression levels upon heat shock. The major finding of our study is that heat shock induced a significant decrease in both the overlaps and connections of yeast interactome modules.
Edit intent: clarity
Original:  The observed changes resemble to a  stratus-cumulus  type transition of the interactome structure, since the unstressed yeast interactome had a globally URLanization, similar to that of stratus clouds, whereas the heat shocked interactome had a URLanization, similar to that of cumulus clouds.
Revised:  The observed changes resemble to a " stratus-cumulus type transition of the interactome structure, since the unstressed yeast interactome had a globally URLanization, similar to that of stratus clouds, whereas the heat shocked interactome had a URLanization, similar to that of cumulus clouds.
Edit intent: fluency
Original:  The observed changes resemble to a  stratus-cumulus  type transition of the interactome structure, since the unstressed yeast interactome had a globally URLanization, similar to that of stratus clouds, whereas the heat shocked interactome had a URLanization, similar to that of cumulus clouds.
Revised:  The observed changes resemble to a stratus-cumulus " type transition of the interactome structure, since the unstressed yeast interactome had a globally URLanization, similar to that of stratus clouds, whereas the heat shocked interactome had a URLanization, similar to that of cumulus clouds.
Edit intent: fluency
Original: Understanding of virus URLanization and self-assembly mechanisms helps to get an insight into the protein interactions which render virus infectious, but also to advance new methods in nanotechnology which use capsid self-assembly to produce virus-like nanoparticles. As in abiotic nanostructures, the obstacles along this way are related not only to the nanoscopic size of capsids but also to their unconventional topology and symmetry. In the present work on the example of exceptional families of viruses we : i) show the existence of a completely new type URLanization, resulting in a chiral pentagonal quasicrystalline order of protein positions in a capsid with spherical topology and dodecahedral geometry ;
Revised: On the example of exceptional families of viruses we : i) show the existence of a completely new type URLanization, resulting in a chiral pentagonal quasicrystalline order of protein positions in a capsid with spherical topology and dodecahedral geometry ;
Edit intent: coherence
Original:  In the present work on the example of exceptional families of viruses we : i) show the existence of a completely new type URLanization, resulting in a chiral pentagonal quasicrystalline order of protein positions in a capsid with spherical topology and dodecahedral geometry ;
Revised:  In the present work on the example of exceptional families of viruses we i) show the existence of a completely new type URLanization, resulting in a chiral pentagonal quasicrystalline order of protein positions in a capsid with spherical topology and dodecahedral geometry ;
Edit intent: fluency
Original:  In the present work on the example of exceptional families of viruses we : i) show the existence of a completely new type URLanization, resulting in a chiral pentagonal quasicrystalline order of protein positions in a capsid with spherical topology and dodecahedral geometry ;
Revised:  In the present work on the example of exceptional families of viruses we : i) show the existence of a completely new type of URLanization in nanoparticles, in which the regions with a chiral pentagonal quasicrystalline order of protein positions in a capsid with spherical topology and dodecahedral geometry ;
Edit intent: meaning-changed
Original:  In the present work on the example of exceptional families of viruses we : i) show the existence of a completely new type URLanization, resulting in a chiral pentagonal quasicrystalline order of protein positions in a capsid with spherical topology and dodecahedral geometry ;
Revised:  In the present work on the example of exceptional families of viruses we : i) show the existence of a completely new type URLanization, resulting in a chiral pentagonal quasicrystalline order of protein positions are arranged in a structure commensurate with the spherical topology and dodecahedral geometry ;
Edit intent: clarity
Original:  In the present work on the example of exceptional families of viruses we : i) show the existence of a completely new type URLanization, resulting in a chiral pentagonal quasicrystalline order of protein positions in a capsid with spherical topology and dodecahedral geometry ;
Revised:  In the present work on the example of exceptional families of viruses we : i) show the existence of a completely new type URLanization, resulting in a chiral pentagonal quasicrystalline order of protein positions in a capsid with spherical topology and dodecahedral geometry ,
Edit intent: fluency
Original:  ii) generalize the classical theory of quasicrystals ( QC ) to explain URLanization and demonstrate that a particular non-linear phason strain induces chirality in QC; and iii) establish the relation between chiral order and inhomogeneous buckling strain of the capsid shell .
Revised:  ii) generalize the classical theory of quasicrystals ( QC ) to explain URLanization , and iii) establish the relation between chiral order and inhomogeneous buckling strain of the capsid shell .
Edit intent: coherence
Original: In this paper, we provide a new and effective approach for studying super-exponential solution of a retrial supermarket model with Poisson arrivals, exponential service times and exponential retrial timesand with two different probing-server numbers.
Revised: When decomposing the total orbit into N sub-orbits (or simply orbits) related to each of N servers and through comparing the numbers of customers in these orbits, we introduce a retrial supermarket model of N identical servers, where two probing-server choice numbers are respectively designed for dynamically allocating each primary arrival and each retrial arrival into these orbits when the chosen servers are all busy. Note that the designed purpose of the two choice numbers can effectively improve performance measures of this retrial supermarket model. This paper analyzes a simple and basic retrial supermarket model with Poisson arrivals, exponential service times and exponential retrial timesand with two different probing-server numbers.
Edit intent: meaning-changed
Original: In this paper, we provide a new and effective approach for studying super-exponential solution of a retrial supermarket model with Poisson arrivals, exponential service times and exponential retrial timesand with two different probing-server numbers.
Revised: In this paper, we provide a new and effective approach for studying super-exponential solution of a retrial supermarket model of N identical servers, that is, Poisson arrivals, exponential service times and exponential retrial timesand with two different probing-server numbers.
Edit intent: meaning-changed
Original: In this paper, we provide a new and effective approach for studying super-exponential solution of a retrial supermarket model with Poisson arrivals, exponential service times and exponential retrial timesand with two different probing-server numbers. We describe the retrial supermarket model as a system of differential equations by means of density-dependent jump Markov processes, and obtain an iterative algorithm for computing the fixed point of the system of differential equations.
Revised: In this paper, we provide a new and effective approach for studying super-exponential solution of a retrial supermarket model with Poisson arrivals, exponential service and retrial times. To this end, we first provide a detailed probability computation to set up an infinite-dimensional system of differential equations by means of density-dependent jump Markov processes, and obtain an iterative algorithm for computing the fixed point of the system of differential equations.
Edit intent: meaning-changed
Original:  We describe the retrial supermarket model as a system of differential equations by means of density-dependent jump Markov processes, and obtain an iterative algorithm for computing the fixed point of the system of differential equations. Based on the fixed point, we analyze the expected sojourn time that a tagged arriving customer spends in this system, and use numerical examples to indicate different influence of the two probing-server numbers on system performance including the fixed point and the expected sojourn time. Furthermore, we analyze exponential convergence of the current location of the retrial supermarket model to the fixed point, and apply the Kurtz Theorem to study density-dependent jump Markov process given in the retrial supermarket model, which leads to a Lipschitz condition under which the fraction measure of the retrial supermarket model weakly converges to the system of differential equations .
Revised:  We describe the retrial supermarket model as a system of differential equations (or mean-field equations) satisfied by the current location of the retrial supermarket model to the fixed point, and apply the Kurtz Theorem to study density-dependent jump Markov process given in the retrial supermarket model, which leads to a Lipschitz condition under which the fraction measure of the retrial supermarket model weakly converges to the system of differential equations .
Edit intent: meaning-changed
Original:  Furthermore, we analyze exponential convergence of the current location of the retrial supermarket model to the fixed point, and apply the Kurtz Theorem to study density-dependent jump Markov process given in the retrial supermarket model, which leads to a Lipschitz condition under which the fraction measure of the retrial supermarket model weakly converges to the system of differential equations .
Revised:  Furthermore, we analyze exponential convergence of the expected fraction vector. Then, as N goes to infinity, we apply the operator semigroup to obtaining the mean-field limit (or chaos of propagation) for the sequence of Markov processes which express the state of this retrial supermarket model to the fixed point, and apply the Kurtz Theorem to study density-dependent jump Markov process given in the retrial supermarket model, which leads to a Lipschitz condition under which the fraction measure of the retrial supermarket model weakly converges to the system of differential equations .
Edit intent: meaning-changed