wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Here, we outline a largely analytical method for studying reaction-diffusion models . Using a prototypic model of cell polarization, we characterize protein activation in response to an external stimulus and highlight the importance of phase-space analysis. We demonstrate how comprehensive treatment of the phase space can guide experimental design and supplement simulation studies.
Revised:  Here, we outline a largely analytical method for studying reaction-diffusion models and analyzing their stability properties. Using two representative biological examples, we demonstrate how this approach can guide experimental design and supplement simulation studies.
Edit intent: meaning-changed
Original: In pattern-forming developmental systems, cells commonly interpret graded input signals, known as morphogens.
Revised: Information theory is gaining popularity as a tool to characterize performance of biological systems. However, information is commonly quantified without reference to whether or how a system could extract and use it; as a result, information-theoretic quantities are easily misinterpreted. Here we take the example of pattern-forming developmental systems, cells commonly interpret graded input signals, known as morphogens.
Edit intent: coherence
Original:  However, while the rationale for periodic message exchange is to improve awareness, existing DCC algorithms do not use awareness as a metric for deciding when, at what power, and at what rate the periodic messages need to be sent in order to make sure that the hard-to-reach vehicles are informed.
Revised:  However, while the rationale for periodic message exchange is to improve awareness, existing DCC algorithms do not use awareness as a metric for deciding when, at what power, and at what rate the periodic messages need to be sent in order to make sure all vehicles are informed.
Edit intent: clarity
Original:  We propose ECPR, an environment and context-aware DCC algorithm , which combines power and rate control  to improve cooperative awareness by adapting to both specific propagation environments ( such as urban intersections, open highways, suburban roads) as well as application requirements (e.g., different target cooperative awareness range).
Revised:  We propose an environment- and context-aware DCC algorithm , which combines power and rate control to improve cooperative awareness by adapting to both specific propagation environments ( such as urban intersections, open highways, suburban roads) as well as application requirements (e.g., different target cooperative awareness range).
Edit intent: clarity
Original:  We propose ECPR, an environment and context-aware DCC algorithm , which combines power and rate control  to improve cooperative awareness by adapting to both specific propagation environments ( such as urban intersections, open highways, suburban roads) as well as application requirements (e.g., different target cooperative awareness range).
Revised:  We propose ECPR, an environment and context-aware DCC algorithm combines power and rate control to improve cooperative awareness by adapting to both specific propagation environments ( such as urban intersections, open highways, suburban roads) as well as application requirements (e.g., different target cooperative awareness range).
Edit intent: coherence
Original:  We propose ECPR, an environment and context-aware DCC algorithm , which combines power and rate control  to improve cooperative awareness by adapting to both specific propagation environments ( such as urban intersections, open highways, suburban roads) as well as application requirements (e.g., different target cooperative awareness range).
Revised:  We propose ECPR, an environment and context-aware DCC algorithm , which combines power and rate control in order to improve cooperative awareness by adapting to both specific propagation environments ( such as urban intersections, open highways, suburban roads) as well as application requirements (e.g., different target cooperative awareness range).
Edit intent: coherence
Original:  We propose ECPR, an environment and context-aware DCC algorithm , which combines power and rate control  to improve cooperative awareness by adapting to both specific propagation environments ( such as urban intersections, open highways, suburban roads) as well as application requirements (e.g., different target cooperative awareness range).
Revised:  We propose ECPR, an environment and context-aware DCC algorithm , which combines power and rate control to improve cooperative awareness by adapting to both specific propagation environments ( e.g., urban intersections, open highways, suburban roads) as well as application requirements (e.g., different target cooperative awareness range).
Edit intent: coherence
Original:  Using the current context that the vehicle operates in (e.g., speed, direction, and application requirement), ECPR adjusts the transmit power of the messages  to reach the desired awareness ratio at the target distance while at the same time controlling the channel load using an adaptive rate control algorithm.
Revised:  Studying various operational conditions (e.g., speed, direction, and application requirement), ECPR adjusts the transmit power of the messages to reach the desired awareness ratio at the target distance while at the same time controlling the channel load using an adaptive rate control algorithm.
Edit intent: clarity
Original:  Using the current context that the vehicle operates in (e.g., speed, direction, and application requirement), ECPR adjusts the transmit power of the messages  to reach the desired awareness ratio at the target distance while at the same time controlling the channel load using an adaptive rate control algorithm.
Revised:  Using the current context that the vehicle operates in (e.g., speed, direction, and application requirement), ECPR adjusts the transmit power of the messages in order to reach the desired awareness ratio at the target distance while at the same time controlling the channel load using an adaptive rate control algorithm.
Edit intent: clarity
Original:  By performing extensive simulations, including realistic propagation and environment modeling and realistic vehicle contexts (varying demand on both awareness range and rate), we show that ECPR can increase awareness by 20\% while keeping the channel load and interference at almost the same level.
Revised:  By performing extensive simulations, including realistic propagation as well as environment modeling and realistic vehicle contexts (varying demand on both awareness range and rate), we show that ECPR can increase awareness by 20\% while keeping the channel load and interference at almost the same level.
Edit intent: clarity
Original:  By performing extensive simulations, including realistic propagation and environment modeling and realistic vehicle contexts (varying demand on both awareness range and rate), we show that ECPR can increase awareness by 20\% while keeping the channel load and interference at almost the same level.
Revised:  By performing extensive simulations, including realistic propagation and environment modeling and realistic vehicle operational environments (varying demand on both awareness range and rate), we show that ECPR can increase awareness by 20\% while keeping the channel load and interference at almost the same level.
Edit intent: clarity
Original:  The forward and the spot equilibrium commodity prices are endogenously derived as the outcome of the interaction between producers and speculators . Assuming that both are utility maximizers and that the demand shocks and the exogenously priced financial market are correlated, we provide semi-explicit expressions for the equilibrium prices and analyze their dependence on the model parameters.
Revised:  The spot and forward equilibrium commodity prices are endogenously derived as the outcome of the interaction between producers and speculators . Assuming that both are utility maximizers and that the demand shocks and the exogenously priced financial market are correlated, we provide semi-explicit expressions for the equilibrium prices and analyze their dependence on the model parameters.
Edit intent: coherence
Original:  The forward and the spot equilibrium commodity prices are endogenously derived as the outcome of the interaction between producers and speculators . Assuming that both are utility maximizers and that the demand shocks and the exogenously priced financial market are correlated, we provide semi-explicit expressions for the equilibrium prices and analyze their dependence on the model parameters.
Revised:  The forward and the spot equilibrium commodity prices are endogenously derived as the outcome of the interaction between producers and investors . Assuming that both are utility maximizers and that the demand shocks and the exogenously priced financial market are correlated, we provide semi-explicit expressions for the equilibrium prices and analyze their dependence on the model parameters.
Edit intent: clarity
Original:  The forward and the spot equilibrium commodity prices are endogenously derived as the outcome of the interaction between producers and speculators . Assuming that both are utility maximizers and that the demand shocks and the exogenously priced financial market are correlated, we provide semi-explicit expressions for the equilibrium prices and analyze their dependence on the model parameters.
Revised:  The forward and the spot equilibrium commodity prices are endogenously derived as the outcome of the interaction between producers and speculators . Assuming that both are utility maximizers , we first prove the existence of an equilibrium in an abstract setting. Then, in a framework where the consumers' demand and the exogenously priced financial market are correlated, we provide semi-explicit expressions for the equilibrium prices and analyze their dependence on the model parameters.
Edit intent: meaning-changed
Original:  In this paper, we consider the optimal PEV charging scheduling problem in a practical scenario where the non-causal information about future PEV arrivals is not known in advance, but its statistical distribution can be estimated.
Revised:  In this paper, we consider the optimal PEV charging scheduling , where the non-causal information about future PEV arrivals is not known in advance, but its statistical distribution can be estimated.
Edit intent: clarity
Original:  In this paper, we consider the optimal PEV charging scheduling problem in a practical scenario where the non-causal information about future PEV arrivals is not known in advance, but its statistical distribution can be estimated.
Revised:  In this paper, we consider the optimal PEV charging scheduling problem in a practical scenario where the non-causal information about future PEV arrivals is not known in advance, but its statistical information can be estimated.
Edit intent: clarity
Original:  This leads to an "online" charging scheduling problem that is  formulated as a multistage stochastic programming (MSP) problem in this paper. Instead of solving the MSP using the standard approaches such as sample average approximation (SAA), we show that solving a deterministic counterpart of the stochastic problem yields significant complexity reduction with negligible performance loss. Compared with the SAA approach, the computational complexity of the proposed algorithm is drastically reduced from O(\epsilon^T) to O( T^3) per time stage , where T is the total number of the time stagesand \epsilon is a constant related to the accuracy of the solution.
Revised:  This leads to an "online" charging scheduling problem that is formulated as a finite-horizon dynamic programming with continuous state space and action space. To avoid the prohibitively high complexity of solving such a dynamic programming problem, we provide a Model Predictive Control (MPC) based algorithm with computational complexity O( T^3) per time stage , where T is the total number of the time stagesand \epsilon is a constant related to the accuracy of the solution.
Edit intent: meaning-changed
Original:  Compared with the SAA approach, the computational complexity of the proposed algorithm is drastically reduced from O(\epsilon^T) to O( T^3) per time stage , where T is the total number of the time stagesand \epsilon is a constant related to the accuracy of the solution.
Revised:  Compared with the SAA approach, the computational complexity of the proposed algorithm is drastically reduced from O(\epsilon^T) to O( T^3) , where T is the total number of the time stagesand \epsilon is a constant related to the accuracy of the solution.
Edit intent: clarity
Original:  Compared with the SAA approach, the computational complexity of the proposed algorithm is drastically reduced from O(\epsilon^T) to O( T^3) per time stage , where T is the total number of the time stagesand \epsilon is a constant related to the accuracy of the solution. More importantly, we show that the proposed algorithm can be made scalable when the random process describing the arrival of charging demands is first-order periodic .
Revised:  Compared with the SAA approach, the computational complexity of the proposed algorithm is drastically reduced from O(\epsilon^T) to O( T^3) per time stage , where T is the total number of time stages. We rigorously analyze the performance gap between the near-optimal solution of the MPC-based approach and the optimal solution for any distributions of exogenous random variables. Furthermore, our rigorous analysis shows that when the random process describing the arrival of charging demands is first-order periodic .
Edit intent: meaning-changed
Original:  More importantly, we show that the proposed algorithm can be made scalable when the random process describing the arrival of charging demands is first-order periodic . That is , the complexity of obtaining the charging schedule at each time stage is O(1) and is independent of T. Extensive simulations show that the proposed online algorithm performs very closely to the optimal online algorithm.
Revised:  More importantly, we show that the proposed algorithm can be made scalable when the random process describing the arrival of charging demands is first-order periodic , the complexity of obtaining the charging schedule at each time stage is O(1) and is independent of T. Extensive simulations show that the proposed online algorithm performs very closely to the optimal online algorithm.
Edit intent: coherence
Original:  That is , the complexity of obtaining the charging schedule at each time stage is O(1) and is independent of T. Extensive simulations show that the proposed online algorithm performs very closely to the optimal online algorithm.
Revised:  That is , the complexity of obtaining the charging schedule at each time stage is O(1) , which is independent of T. Extensive simulations show that the proposed online algorithm performs very closely to the optimal online algorithm.
Edit intent: coherence
Original:  The results obtained herein are markedly different from those obtained in recent papers for close-to-the-money option prices and implied volatility, and aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters, such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results.
Revised:  The results obtained herein are remarkably different from those obtained in recent papers for close-to-the-money option prices and implied volatility, and aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters, such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results.
Edit intent: fluency
Original:  The results obtained herein are markedly different from those obtained in recent papers for close-to-the-money option prices and implied volatility, and aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters, such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results.
Revised:  The results obtained herein are markedly different from those obtained in recent papers close-to-the-money option prices and implied volatility, and aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters, such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results.
Edit intent: fluency
Original:  The results obtained herein are markedly different from those obtained in recent papers for close-to-the-money option prices and implied volatility, and aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters, such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results.
Revised:  The results obtained herein are markedly different from those obtained in recent papers for close-to-the-money option prices in that they aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters, such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results.
Edit intent: clarity
Original:  In this paper, we fill this gap by providing high-order asymptotic expansions for the at-the-money implied volatility slope of a rich class of stochastic volatility models with independent stable-like jumps of infinite variation.
Revised:  We rectify this by providing high-order asymptotic expansions for the at-the-money implied volatility slope of a rich class of stochastic volatility models with independent stable-like jumps of infinite variation.
Edit intent: clarity
Original:  In this paper, we fill this gap by providing high-order asymptotic expansions for the at-the-money implied volatility slope of a rich class of stochastic volatility models with independent stable-like jumps of infinite variation.
Revised:  In this paper, we fill this gap by providing high-order asymptotic expansions for the at-the-money implied volatility skew, under a rich class of stochastic volatility models with independent stable-like jumps of infinite variation.
Edit intent: clarity
Original:  As an intermediary result, we also obtain high-order expansions for at-the-money digital call option prices . The results obtained herein are remarkably different from those obtained in recent papers close-to-the-money option prices in that they aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters , such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results .
Revised:  Unlike recent results for "near-the-money" option prices and implied volatility, the results herein aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters , such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results .
Edit intent: clarity
Original:  The results obtained herein are remarkably different from those obtained in recent papers close-to-the-money option prices in that they aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters , such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results .
Revised:  The results obtained herein are remarkably different from those obtained in recent papers close-to-the-money option prices in that they aid in understanding how the implied volatility smile near expiry is affected by important model parameters , such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results .
Edit intent: clarity
Original:  The results obtained herein are remarkably different from those obtained in recent papers close-to-the-money option prices in that they aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters , such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results .
Revised:  The results obtained herein are remarkably different from those obtained in recent papers close-to-the-money option prices in that they aid in understanding how the behavior of implied volatility near expiry is affected by important features of the continuous component , such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results .
Edit intent: meaning-changed
Original:  The results obtained herein are remarkably different from those obtained in recent papers close-to-the-money option prices in that they aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters , such as the leverage and vol vol parameters, that were not present in the aforementioned earlier results . Our simulation results also indicate that for parameter values of relevance in finance, the asymptotic expansions give a good fit for maturities up to one month   .
Revised:  The results obtained herein are remarkably different from those obtained in recent papers close-to-the-money option prices in that they aid in understanding how the behavior of implied volatility near expiry is affected by important model parameters , such as the leverage and vol-of-vol parameters. As intermediary results we obtain high-order expansions for at-the-money digital call option prices, which furthermore allow us to infer analogous results for the delta of at-the-money options. Simulation results indicate that our asymptotic expansions give a good fit for maturities up to one month .
Edit intent: meaning-changed
Original:  Our simulation results also indicate that for parameter values of relevance in finance, the asymptotic expansions give a good fit for maturities up to one month   .
Revised:  Our simulation results also indicate that for parameter values of relevance in finance, the asymptotic expansions give a good fit for maturities up to one month , underpinning their relevance in practical applications, and an analysis of the implied volatility skew in recent S .
Edit intent: meaning-changed
Original:  Our simulation results also indicate that for parameter values of relevance in finance, the asymptotic expansions give a good fit for maturities up to one month   .
Revised:  Our simulation results also indicate that for parameter values of relevance in finance, the asymptotic expansions give a good fit for maturities up to one month P500 options data shows it to be consistent with the infinite variation jump component of our models .
Edit intent: meaning-changed
Original: The analytical tractability of affine (short rate) models, such as the Vasi\v{c and the Cox-Ingersoll-Ross models, has made them a popular choice for modelling the dynamics of interest rates.
Revised: The analytical tractability of affine (short rate) models, such as the Vasicek and the Cox-Ingersoll-Ross models, has made them a popular choice for modelling the dynamics of interest rates.
Edit intent: clarity
Original:  Although promoter activity is often governed by a single limiting step, we argue here that the size of the noise strongly depends on whether this step is the initial equilibrium binding or one of the subsequent steps. In particular, the multi-step transcription initiation process allows weak promoters and repressors having fast binding kinetics to have substantial noise. Therefore the architecture of the promoter has implications for estimating the on-rates for transcriptional repressors in living cells .
Revised:  Although promoter activity is often governed by a single limiting step, we argue here that the size of the noise strongly depends on whether this step is the initial equilibrium binding or one of the subsequent uni-directional steps. Overall, we show that non-equilibrium steps of transcription initiation systematically increase the cell to cell heterogeneity in bacterial populations. In particular, this allows also weak promoters to give substantial transcriptional noise .
Edit intent: clarity