wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We address this economic question of fiscal stimulus as a new optimal control problem generalizing the model of Dutta and Radner 1999%DIFDELCMD < ]%%% . We find  that there exists an optimal strategy and provide rigorous verification proof for the optimality .
Revised:  We address this economic question of fiscal stimulus as a new optimal control problem generalizing the model of 1999%DIFDELCMD < ]%%% . We find that there exists an optimal strategy and provide rigorous verification proof for the optimality .
Edit intent: meaning-changed
Original:  We address this economic question of fiscal stimulus as a new optimal control problem generalizing the model of Dutta and Radner 1999%DIFDELCMD < ]%%% . We find  that there exists an optimal strategy and provide rigorous verification proof for the optimality .
Revised:  We address this economic question of fiscal stimulus as a new optimal control problem generalizing the model of Dutta and Radner %DIFDELCMD < ]%%% . We find that there exists an optimal strategy and provide rigorous verification proof for the optimality .
Edit intent: clarity
Original:  We address this economic question of fiscal stimulus as a new optimal control problem generalizing the model of Dutta and Radner 1999%DIFDELCMD < ]%%% . We find  that there exists an optimal strategy and provide rigorous verification proof for the optimality .
Revised:  We address this economic question of fiscal stimulus as a new optimal control problem generalizing the model of Dutta and Radner 1999%DIFDELCMD < ]%%% Radner that there exists an optimal strategy and provide rigorous verification proof for the optimality .
Edit intent: coherence
Original:  We address this economic question of fiscal stimulus as a new optimal control problem generalizing the model of Dutta and Radner 1999%DIFDELCMD < ]%%% . We find  that there exists an optimal strategy and provide rigorous verification proof for the optimality .
Revised:  We address this economic question of fiscal stimulus as a new optimal control problem generalizing the model of Dutta and Radner 1999%DIFDELCMD < ]%%% . We find Shepp (1996). The model allows for the company to borrow continuously from the government. We prove that there exists an optimal strategy and provide rigorous verification proof for the optimality .
Edit intent: meaning-changed
Original:  We address this economic question of fiscal stimulus as a new optimal control problem generalizing the model of Dutta and Radner 1999%DIFDELCMD < ]%%% . We find  that there exists an optimal strategy and provide rigorous verification proof for the optimality . Further, we prove a few interesting mathematical properties of our solution, providing deeper insight into this important politico-economic debate and illustrating how the fiscal stimulus from the government may affect the profit-taking behavior of firms in the private sector .
Revised:  We address this economic question of fiscal stimulus as a new optimal control problem generalizing the model of Dutta and Radner 1999%DIFDELCMD < ]%%% . We find that there exists an optimal strategy ; rigorous verification proofs for its optimality are provided. We proceed to prove that government loans increase the expected net value of a company. We also examine the consequences of different profit-taking behavior of firms in the private sector .
Edit intent: meaning-changed
Original:  Further, we prove a few interesting mathematical properties of our solution, providing deeper insight into this important politico-economic debate and illustrating how the fiscal stimulus from the government may affect the profit-taking behavior of firms in the private sector .
Revised:  Further, we prove a few interesting mathematical properties of our solution, providing deeper insight into this important politico-economic debate and illustrating how the fiscal stimulus from the government may affect the profit-taking behaviors among firms who receive fiscal stimulus .
Edit intent: clarity
Original:  Decompositions of the VA and GMWB contract into term-certain payments and options representing the guarantee and early surrender features similar to those presented in Hyndman and Wenger (Insurance Math. Econom. 55:283-290, 2014) are extended to the binomial framework.
Revised:  Decompositions of the VA and GMWB contract into term-certain payments and options representing the guarantee and early surrender features are extended to the binomial framework.
Edit intent: clarity
Original:  Several numerical examples are provided which illustrate both the accuracy and the tractability of the model .
Revised:  Several numerical examples are provided which illustrate both the accuracy and the tractability of the binomial model. We extend the binomial model to include policy holder mortality and death benefits. Pricing, hedging, and the decompositions of the contract are extended to incorporate mortality risk. We prove limiting results for the hedging strategies and demonstrate mortality risk diversification. Numerical examples are provided which illustrate the effectiveness of hedging and the diversification of mortality risk under capacity constraints with finite pools .
Edit intent: meaning-changed
Original: We model business relationships exemplified for a (re)insurance market by a bipartite graph which determines the sharing of severe losses . Using Pareto-tailed claims and multivariate regular variation we obtain asymptotic results for the Value-at-Risk and the Conditional Tail Expectation.
Revised: We model the influence of sharing large exogeneous losses to the reinsurance market by a bipartite graph which determines the sharing of severe losses . Using Pareto-tailed claims and multivariate regular variation we obtain asymptotic results for the Value-at-Risk and the Conditional Tail Expectation.
Edit intent: meaning-changed
Original: We model business relationships exemplified for a (re)insurance market by a bipartite graph which determines the sharing of severe losses . Using Pareto-tailed claims and multivariate regular variation we obtain asymptotic results for the Value-at-Risk and the Conditional Tail Expectation.
Revised: We model business relationships exemplified for a (re)insurance market by a bipartite graph . Using Pareto-tailed claims and multivariate regular variation we obtain asymptotic results for the Value-at-Risk and the Conditional Tail Expectation.
Edit intent: clarity
Original:  As is well-known  , if the Pareto exponent is larger than 1, then for the individual agent ( re-insurance company) diversification is beneficial, whereas when it is less than 1, concentration on a few objects is the better strategy.
Revised:  As is well-known in a non-network setting , if the Pareto exponent is larger than 1, then for the individual agent ( re-insurance company) diversification is beneficial, whereas when it is less than 1, concentration on a few objects is the better strategy.
Edit intent: meaning-changed
Original:  As is well-known  , if the Pareto exponent is larger than 1, then for the individual agent ( re-insurance company) diversification is beneficial, whereas when it is less than 1, concentration on a few objects is the better strategy.
Revised:  As is well-known , if the Pareto exponent is larger than 1, then for the individual agent ( reinsurance company) diversification is beneficial, whereas when it is less than 1, concentration on a few objects is the better strategy.
Edit intent: fluency
Original:  The situation changes, however, when systemic risk comes into play. The random network structure has a strong influence on diversification effects, which destroys this simple individual agent's diversification rule. It turns out that diversification is always beneficial from a macro-prudential point of view creating a conflicting situation between the incentives of individual agents and the interest of some superior entity to keep overall risk small.
Revised:  An additional aspect of this paper is the amount of uninsured losses which have to be convered by society. In the situation of networks of agents, in our setting diversification is never detrimental concerning the amount of uninsured losses. If the Pareto-tailed claims have finite mean, diversification turns out to be never detrimental, both for society and for individual agents. In contrast, if the Pareto-tailed claims have infinite mean, a conflicting situation may arise between the incentives of individual agents and the interest of some superior entity to keep overall risk small.
Edit intent: meaning-changed
Original:  Selected examples from physics, finance and environmental sciences illustrate usefulness of the framework .
Revised:  The former feature allows for distinguishing between effects for a pair of variables from different temporal perspectives. The latter ones make the method a significant improvement over the standard least squares estimation. Theoretical claims are supported by Monte Carlo simulations. The method is then applied on selected examples from physics, finance and environmental sciences illustrate usefulness of the framework .
Edit intent: meaning-changed
Original: The emerging fields of genetic engineering, synthetic biology, DNA computing, DNA nanotechnology, and molecular programming herald the birth of a new information technology that acquires information by directly sensing molecules within a chemical environment, stores information in molecules such as DNA, RNA, and proteins, processes that information by means of chemical and biochemical transformations, and uses that information to direct the manipulation of matter at the nanometer scale. To scale up beyond current proof-of-principle demonstrations, new methods for managing the complexity of designed molecular systems will need to be developed.
Edit intent: coherence
Original:  This problem relates to the verification of Petri Nets , but existing approaches are not sufficient for certain situations that commonly arise in molecular implementations, such as what we call "delayed choice. " We formulate a new theory of pathway decomposition that provides an elegant formal basis for comparing chemical reaction network implementations, and we present an algorithm that computes this basis.
Revised:  This problem relates to the verification of Petri Nets , but existing approaches are not sufficient for providing a single guarantee covering an infinite set of possible initial states (molecule counts) and an infinite state space potentially explored by the system given any initial state. We address these issues by formulating a new theory of pathway decomposition that provides an elegant formal basis for comparing chemical reaction network implementations, and we present an algorithm that computes this basis.
Edit intent: meaning-changed
Original:   We further show how pathway decomposition can be combined with weak bisimulation to handle a wider class that includes all currently known enzyme-free DNA implementation techniques.
Revised:  Our theory naturally handles certain situations that commonly arise in molecular implementations, such as what we call "delayed choice," that are not easily accommodated by other approaches. We further show how pathway decomposition can be combined with weak bisimulation to handle a wider class that includes all currently known enzyme-free DNA implementation techniques.
Edit intent: meaning-changed
Original:  marked point processes and in presence of margin requirements such as different interest rates for borrowing and lending and risk premiums for short positions . Margin requirements are modelled by adding in a margin payment function to the investor's wealth equation which is nonlinear with respect to the portfolio proportion process .
Revised:  marked point processes and so-called non-linear wealth dynamics which allows to take account of relaxed assumptions such as differential borrowing and lending and risk premiums for short positions . Margin requirements are modelled by adding in a margin payment function to the investor's wealth equation which is nonlinear with respect to the portfolio proportion process .
Edit intent: meaning-changed
Original:  marked point processes and in presence of margin requirements such as different interest rates for borrowing and lending and risk premiums for short positions . Margin requirements are modelled by adding in a margin payment function to the investor's wealth equation which is nonlinear with respect to the portfolio proportion process .
Revised:  marked point processes and in presence of margin requirements such as different interest rates for borrowing and lending interest rates or short positions with cash collateral and negative rebate rates .
Edit intent: meaning-changed
Original:  We give sufficient conditions for existence of optimal policies and find closed-form solutions for the optimal value function in the case of pure-jump models with jump-size distributions modulated by a two-state Markov chain and agents with logarithmic and fractional power utility .
Revised:  We give suffcient conditions for existence of optimal policies and find closed-form solutions for the optimal value function in the case of pure-jump models with jump-size distributions modulated by a two-state Markov chain and agents with logarithmic and fractional power utility .
Edit intent: clarity
Original:  We give sufficient conditions for existence of optimal policies and find closed-form solutions for the optimal value function in the case of pure-jump models with jump-size distributions modulated by a two-state Markov chain and agents with logarithmic and fractional power utility .
Revised:  We give sufficient conditions for existence of optimal policies for agents with logarithmic and CRRA power utility. We find closed-form solutions for the optimal value function in the case of pure-jump models with jump-size distributions modulated by a two-state Markov chain and agents with logarithmic and fractional power utility .
Edit intent: clarity
Original:  We give sufficient conditions for existence of optimal policies and find closed-form solutions for the optimal value function in the case of pure-jump models with jump-size distributions modulated by a two-state Markov chain and agents with logarithmic and fractional power utility .
Revised:  We give sufficient conditions for existence of optimal policies and find closed-form solutions for the optimal value function in the case of pure-jump models with jump-size distributions modulated by a two-state Markov chain .
Edit intent: coherence
Original:  Finance 19 (2009), 1-12] and are valid in great generality, both for extreme strike (with arbitrary bounded maturity, possibly varying with the strike) and for small maturity (with arbitrary strike, possibly varying with the maturity) .
Revised:  Finance 19 (2009), 1-12] . We present applications to popular models, including Carr-Wu finite moment logstable model, Merton's jump diffusion model and Heston's model .
Edit intent: meaning-changed
Original: Design space exploration of multiprocessor systems involves the optimization of cost/performance functions over a large number of design parameters, most of which are discrete-valued . This optimization is non-trivial because the evaluation of cost/performance functions is computationally expensive , typically involving simulation of long benchmark programs on a cycle-accurate model of the system .
Revised: Design space exploration of multiprocessor systems involves the optimization of cost/performance functions over a large number of design parameters, most of which are discrete-valued , and this number is likely to keep increasing as chip complexity rises. Further, the accurate evaluation of a potential design choice is computationally expensive , typically involving simulation of long benchmark programs on a cycle-accurate model of the system .
Edit intent: meaning-changed
Original:  This optimization is non-trivial because the evaluation of cost/performance functions is computationally expensive , typically involving simulation of long benchmark programs on a cycle-accurate model of the system . Further, algorithms for optimization over discrete parameters do not scale well with the number of parameters.
Revised:  This optimization is non-trivial because the evaluation of cost/performance functions is computationally expensive , typically involving simulation of long benchmark programs on a cycle-accurate system simulation. If the discrete parameter space can be embedded into a larger continuous parameter space, then continuous space techniques can, in principle, be applied to the system optimization problem. Such continuous space techniques often scale well with the number of parameters.
Edit intent: meaning-changed
Original:  We describe a new approach to this optimization problem, based on embedding the discrete parameter space into an extended continuous space . Optimization is then carried out over the extended continuous space using standard descent based continuous optimization schemes. The embedding is performed using a novel simulation-based ergodic interpolation method that produces the interpolated value in a single simulation run .
Revised:  We describe a new approach to this optimization problem, based on embedding the discrete parameter space into an extended continuous space so that continuous space techniques can be applied to the embedded problem using cycle accurate simulation for evaluating the objective function. This embedding is implemented using simulation-based ergodic interpolation method that produces the interpolated value in a single simulation run .
Edit intent: meaning-changed
Original:  The embedding is performed using a novel simulation-based ergodic interpolation method that produces the interpolated value in a single simulation run . The post-embedding performance function is continuous, and observed to be piecewise smooth. We demonstrate the approach by considering a multiprocessor design exploration problem with 31 discrete parameterswhere the objective function is a weighted sum of cost and performance metrics, and cost-performance tradeoff curves are obtained by varying the weights.
Revised:  The embedding is performed using a novel simulation-based ergodic interpolation method that produces the interpolated value in a single simulation run irrespective of the number of parameters. We have implemented this interpolation scheme in a cycle-based system simulator. In a characterization study, we observe that the interpolated performance curves are continuous, piece-wise smooth, and have low statistical error. We use the ergodic interpolation-based approach to solve a large multi-core design optimization problem with 31 discrete parameterswhere the objective function is a weighted sum of cost and performance metrics, and cost-performance tradeoff curves are obtained by varying the weights.
Edit intent: meaning-changed
Original:  We demonstrate the approach by considering a multiprocessor design exploration problem with 31 discrete parameterswhere the objective function is a weighted sum of cost and performance metrics, and cost-performance tradeoff curves are obtained by varying the weights. We use the COBYLA implementation from the Python SciPy library to perform the optimization on the extended continuous space . Near optimal solutions are obtained within three hundred simulation runs, and we observe improvements in the objective function ranging from 1.3X to 12.2X (for randomly chosen initial parameter values). Cost-performance trade-off curves generated from these optimization runs provide clear indicators for the optimal system configuration. Thus, continuous embeddings of discrete parameter optimization problemsoffer an effective mechanism for the design space exploration of multiprocessor systems .
Revised:  We demonstrate the approach by considering a multiprocessor design exploration problem with 31 design parameters. Our results indicate that continuous space optimization using ergodic interpolation-based embedding can be a viable approach for large multi-core design optimization problems .
Edit intent: clarity
Original: We formulate and characterize a model to describe  dynamics of semiflexible polymers in the presence of activity due to motor proteins attached irreversibly to a substrate, and a transverse pulling force acting on one end of the filament.
Revised: We formulate and characterize a model to describe the dynamics of semiflexible polymers in the presence of activity due to motor proteins attached irreversibly to a substrate, and a transverse pulling force acting on one end of the filament.
Edit intent: fluency
Original:  Performing molecular dynamics simulations of the polymer in presence of a Langevin heat bath, and stochastic motor activity  we obtain desorption phase diagrams that show good agreement with theory. With increase in pulling force, the polymer undergoes a first order phase transition from mostly adsorbed to fully desorbed state via a regime of coexistence where the steady state dynamics of the polymer switches between large fraction of adsorbed and desorbed lengths .
Revised:  Performing molecular dynamics simulations of the polymer in presence of a Langevin heat bath, and stochastic motor activity we obtain desorption phase diagrams . The correlation time for fluctuations in desorbed fraction increases as one approaches complete desorption, captured quantitatively by a power law spectral density. We present theoretical analysis of the phase diagram using mean field approximations in the weakly bending limit of the polymer switches between large fraction of adsorbed and desorbed lengths .
Edit intent: meaning-changed
Original:  With increase in pulling force, the polymer undergoes a first order phase transition from mostly adsorbed to fully desorbed state via a regime of coexistence where the steady state dynamics of the polymer switches between large fraction of adsorbed and desorbed lengths .
Revised:  With increase in pulling force, the polymer undergoes a first order phase transition from mostly adsorbed to fully desorbed state via a regime of coexistence where the steady state dynamics of the polymer and performing linear stability analysis. This predicts increase in the desorption force with the polymer bending rigidity, active velocity and processivity of the motor proteins to capture the main features of the simulation results .
Edit intent: meaning-changed
Original:  We consider the two casesin which this release time of information is known and not known, respectively, to the insider  . Allowing for very general dynamics, we study the structure of the insider's optimal strategies in equilibrium and we discuss market efficiency.
Revised:  We consider two cases. First when the release time of information is known and not known, respectively, to the insider . Allowing for very general dynamics, we study the structure of the insider's optimal strategies in equilibrium and we discuss market efficiency.
Edit intent: coherence
Original:  We consider the two casesin which this release time of information is known and not known, respectively, to the insider  . Allowing for very general dynamics, we study the structure of the insider's optimal strategies in equilibrium and we discuss market efficiency.
Revised:  We consider the two casesin which this release time of information is known to the insider . Allowing for very general dynamics, we study the structure of the insider's optimal strategies in equilibrium and we discuss market efficiency.
Edit intent: clarity
Original:  We consider the two casesin which this release time of information is known and not known, respectively, to the insider  . Allowing for very general dynamics, we study the structure of the insider's optimal strategies in equilibrium and we discuss market efficiency.
Revised:  We consider the two casesin which this release time of information is known and not known, respectively, to the insider and then when it is unknown also to her . Allowing for very general dynamics, we study the structure of the insider's optimal strategies in equilibrium and we discuss market efficiency.
Edit intent: meaning-changed