wanyu/IteraTeR_full_sent huggingface dataset:
Original:  %DIFDELCMD < \mbb %%% R_+ \to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf\{t\ge0: X(t) \leq b(t)\} is given by %DIFDELCMD < \ovl %%% \overline H. In this paper we consider a version of the IFPT problem where the barrier is %DIFDELCMD < {\em %%% fixed at zero and the problem is to find an entrance law \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Revised:  %DIFDELCMD < \mbb %%% \mathbb R^+ \to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf\{t\ge0: X(t) \leq b(t)\} is given by %DIFDELCMD < \ovl %%% \overline H. In this paper we consider a version of the IFPT problem where the barrier is %DIFDELCMD < {\em %%% fixed at zero and the problem is to find an entrance law \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Edit intent: meaning-changed
Original:  %DIFDELCMD < \mbb %%% R_+ \to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf\{t\ge0: X(t) \leq b(t)\} is given by %DIFDELCMD < \ovl %%% \overline H. In this paper we consider a version of the IFPT problem where the barrier is %DIFDELCMD < {\em %%% fixed at zero and the problem is to find an entrance law \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Revised:  %DIFDELCMD < \mbb %%% R_+ \to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf\{t\ge0: X(t) < b(t)\} is given by %DIFDELCMD < \ovl %%% \overline H. In this paper we consider a version of the IFPT problem where the barrier is %DIFDELCMD < {\em %%% fixed at zero and the problem is to find an entrance law \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Edit intent: clarity
Original:  %DIFDELCMD < \mbb %%% R_+ \to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf\{t\ge0: X(t) \leq b(t)\} is given by %DIFDELCMD < \ovl %%% \overline H. In this paper we consider a version of the IFPT problem where the barrier is %DIFDELCMD < {\em %%% fixed at zero and the problem is to find an entrance law \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Revised:  %DIFDELCMD < \mbb %%% R_+ \to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf\{t\ge0: X(t) \leq b(t)\} is given by %DIFDELCMD < \ovl %%% \overline H. In this paper we consider a version of the IFPT problem where the barrier is %DIFDELCMD < {\em %%% fixed at zero and the problem is to find an initial distribution \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Edit intent: clarity
Original:  For any L\'{e}vy process X satisfying a Cram\'{e the solution of this problem , which is given in terms of a quasi-invariant distribution of the process X killed at the epoch of first entrance into the negative half-axis.
Revised:  For any L\'{e}vy process X satisfying an exponential moment condition, we derive the solution of this problem , which is given in terms of a quasi-invariant distribution of the process X killed at the epoch of first entrance into the negative half-axis.
Edit intent: meaning-changed
Original:  For any L\'{e}vy process X satisfying a Cram\'{e the solution of this problem , which is given in terms of a quasi-invariant distribution of the process X killed at the epoch of first entrance into the negative half-axis.
Revised:  For any L\'{e}vy process X satisfying a Cram\'{e the solution of this problem in terms of a quasi-invariant distribution of the process X killed at the epoch of first entrance into the negative half-axis.
Edit intent: clarity
Original:  For any L\'{e}vy process X satisfying a Cram\'{e the solution of this problem , which is given in terms of a quasi-invariant distribution of the process X killed at the epoch of first entrance into the negative half-axis.
Revised:  For any L\'{e}vy process X satisfying a Cram\'{e the solution of this problem , which is given in terms of \lambda-invariant distributions of the process X killed at the epoch of first entrance into the negative half-axis.
Edit intent: meaning-changed
Original:   For a given multi-variate survival function %DIFDELCMD < \ovl %%% H of generalised \overline  frailty type we construct subsequently an explicit solution to the corresponding IFPT with the barrier level fixed at zero.
Revised:  We provide an explicit characterization of such distributions, which is a result of independent interest. For a given multi-variate survival function %DIFDELCMD < \ovl %%% H of generalised \overline frailty type we construct subsequently an explicit solution to the corresponding IFPT with the barrier level fixed at zero.
Edit intent: meaning-changed
Original:   For a given multi-variate survival function %DIFDELCMD < \ovl %%% H of generalised \overline  frailty type we construct subsequently an explicit solution to the corresponding IFPT with the barrier level fixed at zero.
Revised:  For a given multi-variate survival function %DIFDELCMD < \ovl %%% \overline frailty type we construct subsequently an explicit solution to the corresponding IFPT with the barrier level fixed at zero.
Edit intent: clarity
Original:   For a given multi-variate survival function %DIFDELCMD < \ovl %%% H of generalised \overline  frailty type we construct subsequently an explicit solution to the corresponding IFPT with the barrier level fixed at zero.
Revised:  For a given multi-variate survival function %DIFDELCMD < \ovl %%% H of generalised \overline H of generalized frailty type we construct subsequently an explicit solution to the corresponding IFPT with the barrier level fixed at zero.
Edit intent: meaning-changed
Original: For a given Markov process X and survival function %DIFDELCMD < \overline %%% H on \mathbb R ^+, the inverse first-passage time problem (IFPT) is to find a barrier function b:
Revised: For a given Markov process X and survival function %DIFDELCMD < \overline %%% on \mathbb{R ^+, the inverse first-passage time problem (IFPT) is to find a barrier function b:
Edit intent: meaning-changed
Original:  \mathbb R ^+\to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf \{t\ge0:X(t)<b(t)\} is given by %DIFDELCMD < \overline %%% H . In this paper  we consider a version of the IFPT problem where the barrier is fixed at zero and the problem is to find an initial distribution \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Revised:  \mathbb{R ^+\to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf \{t\ge0:X(t)<b(t)\} is given by %DIFDELCMD < \overline %%% H . In this paper we consider a version of the IFPT problem where the barrier is fixed at zero and the problem is to find an initial distribution \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Edit intent: fluency
Original:  \mathbb R ^+\to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf \{t\ge0:X(t)<b(t)\} is given by %DIFDELCMD < \overline %%% H . In this paper  we consider a version of the IFPT problem where the barrier is fixed at zero and the problem is to find an initial distribution \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Revised:  \mathbb R ^+\to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf \{t\ge0:X(t)<b(t)\} is given by %DIFDELCMD < \overline %%% . In this paper we consider a version of the IFPT problem where the barrier is fixed at zero and the problem is to find an initial distribution \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Edit intent: coherence
Original:  \mathbb R ^+\to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf \{t\ge0:X(t)<b(t)\} is given by %DIFDELCMD < \overline %%% H . In this paper  we consider a version of the IFPT problem where the barrier is fixed at zero and the problem is to find an initial distribution \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Revised:  \mathbb R ^+\to[-\infty,+\infty] such that the survival function of the first-passage time \tau_b=\inf \{t\ge0:X(t)<b(t)\} is given by %DIFDELCMD < \overline %%% H . In this paper , we consider a version of the IFPT problem where the barrier is fixed at zero and the problem is to find an initial distribution \mu and a time-change I such that for the time-changed process X\circ I the IFPT problem is solved by a constant barrier at the level zero.
Edit intent: fluency
Original:  For a given multi-variate survival function %DIFDELCMD < \overline %%% H of generalized frailty type  we construct subsequently an explicit solution to the corresponding IFPT with the barrier level fixed at zero.
Revised:  For a given multi-variate survival function %DIFDELCMD < \overline %%% of generalized frailty type we construct subsequently an explicit solution to the corresponding IFPT with the barrier level fixed at zero.
Edit intent: clarity
Original:  For a given multi-variate survival function %DIFDELCMD < \overline %%% H of generalized frailty type  we construct subsequently an explicit solution to the corresponding IFPT with the barrier level fixed at zero.
Revised:  For a given multi-variate survival function %DIFDELCMD < \overline %%% H of generalized frailty type , we construct subsequently an explicit solution to the corresponding IFPT with the barrier level fixed at zero.
Edit intent: fluency
Original:  However, the physical model explaining the critical role of multivalency for the histone code is still largely unknown . Here, we propose a theory that explains the energetic "payout" of multivalency in the formalism of statistical mechanics.
Revised:  However, the physical model explaining the critical role of multivalency for the histone code is still lacking . Here, we propose a theory that explains the energetic "payout" of multivalency in the formalism of statistical mechanics.
Edit intent: clarity
Original:  The model explains how the histone-mediated signalling may rely upon weak individual histone-effector affinities while maintaining high probabilities for simultaneous binding of multiple partners and introduces an entropic "lock-and-key" as a critical component of the histone code .
Revised:  An all-atom molecular dynamics study of a relevant biological system involving the multivalent chromatin effector UHRF1 and its target histone H3 demonstrate that this interaction conforms to the conditions for an optimal free-energy payout, as predicted by the model .
Edit intent: meaning-changed
Original:  However, the physical model explaining the critical role of multivalency for the histone code is still lacking. Here, we propose a theory that explains the energetic " payout " of multivalency in the formalism of statistical mechanics.
Revised:  However, as examples of multivalent histone engagement accumulate, an apparent contradiction is emerging. The isolated effector domains are notably weak binders, thus it is often asserted that the entropic cost of orienting multiple domains can be " payout " of multivalency in the formalism of statistical mechanics.
Edit intent: meaning-changed
Original:  Here, we propose a theory that explains the energetic " payout " of multivalency in the formalism of statistical mechanics. The model quantifies the dependence of binding entropy in a multivalent system on the geometry and flexibility of the binding partners .
Revised:  Here, we propose a theory that explains the energetic " payout " by a rigid tether. Meanwhile, evidence suggests that the tethers are largely disordered and offer little rigidity. Here we consider a mechanism to "prepay" the entropic costs of orienting the domains for binding, not through rigidity of the tether but through the careful spacing of the modifications on chromatin .
Edit intent: meaning-changed
Original:  An all-atom molecular dynamics study of a relevant biological system involving the multivalent chromatin effector UHRF1 and its target histone H3 demonstrate that this interaction conforms to the conditions for an optimal free-energy payout, as predicted by the model  .
Revised:  An all-atom molecular dynamics study of the most fully characterized multivalent chromatin effector UHRF1 and its target histone H3 demonstrate that this interaction conforms to the conditions for an optimal free-energy payout, as predicted by the model .
Edit intent: meaning-changed
Original:  An all-atom molecular dynamics study of a relevant biological system involving the multivalent chromatin effector UHRF1 and its target histone H3 demonstrate that this interaction conforms to the conditions for an optimal free-energy payout, as predicted by the model  .
Revised:  An all-atom molecular dynamics study of a relevant biological system involving the multivalent chromatin effector conforms to the conditions for an optimal free-energy payout, as predicted by the model .
Edit intent: clarity
Original:  An all-atom molecular dynamics study of a relevant biological system involving the multivalent chromatin effector UHRF1 and its target histone H3 demonstrate that this interaction conforms to the conditions for an optimal free-energy payout, as predicted by the model  .
Revised:  An all-atom molecular dynamics study of a relevant biological system involving the multivalent chromatin effector UHRF1 and its target histone H3 demonstrate that this interaction conforms to the conditions for an optimal free-energy payout, as predicted by the model discussed here .
Edit intent: meaning-changed
Original: We first present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems, and use it to develop an algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments.
Revised: We present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems, and use it to develop an algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments.
Edit intent: coherence
Original: We first present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems, and use it to develop an algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments.
Revised: We first present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems, and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments.
Edit intent: clarity
Original:  The cutting surface algorithm is also applicable to problems with non-differentiable semi-infinite constraints indexed by an infinite-dimensional index set.
Revised:  Moments of arbitrary order, as well as non-polynomial moments can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum, and stochastic programming at the other. Although our primary motivation is to solve distributionally robust optimization problems with moment uncertainty, the cutting surface method for general semi-infinite convex programs is also of independent interest. The proposed method is applicable to problems with non-differentiable semi-infinite constraints indexed by an infinite-dimensional index set.
Edit intent: meaning-changed
Original:  Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of the central cutting surface algorithm even in the solution of traditional semi-infinite convex programming problems , whose constraints are differentiable , and are indexed by an index set of low dimension.
Revised:  Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of our algorithm even in the solution of traditional semi-infinite convex programming problems , whose constraints are differentiable , and are indexed by an index set of low dimension.
Edit intent: fluency
Original:  Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of the central cutting surface algorithm even in the solution of traditional semi-infinite convex programming problems , whose constraints are differentiable , and are indexed by an index set of low dimension.
Revised:  Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of the central cutting surface algorithm even in the solution of traditional semi-infinite convex programming problems whose constraints are differentiable , and are indexed by an index set of low dimension.
Edit intent: fluency
Original:  Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of the central cutting surface algorithm even in the solution of traditional semi-infinite convex programming problems , whose constraints are differentiable , and are indexed by an index set of low dimension.
Revised:  Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of the central cutting surface algorithm even in the solution of traditional semi-infinite convex programming problems , whose constraints are differentiable and are indexed by an index set of low dimension.
Edit intent: fluency
Original:  Our primary motivation for the higher level of generality is to solve distributionally robust optimization problems with moment uncertainty. After the analysis of the cutting surface algorithm, we extend the authors' moment matching scenario generation algorithm to a probabilistic algorithm that finds optimal probability distributions subject to moment constraints.
Revised:  After the rate of convergence analysis of the cutting surface algorithm, we extend the authors' moment matching scenario generation algorithm to a probabilistic algorithm that finds optimal probability distributions subject to moment constraints.
Edit intent: meaning-changed
Original:  The model is parsimonious, requires only two parameters to fit a specific financial time series , and can be grounded in a straightforward framework where volatility fluctuations are driven by the estimation error of an exogenous Poisson rate.
Revised:  The model is parsimonious, contains only two parameters to fit a specific financial time series , and can be grounded in a straightforward framework where volatility fluctuations are driven by the estimation error of an exogenous Poisson rate.
Edit intent: clarity
Original:  The model is parsimonious, requires only two parameters to fit a specific financial time series , and can be grounded in a straightforward framework where volatility fluctuations are driven by the estimation error of an exogenous Poisson rate.
Revised:  The model is parsimonious, requires only two parameters that are easily estimated, fits empirical data better than standard models , and can be grounded in a straightforward framework where volatility fluctuations are driven by the estimation error of an exogenous Poisson rate.
Edit intent: meaning-changed
Original:  This result, which---although undoubtedly correct---has been regarded by many as counterintuitive and even pathological , stems from the implicit assumption that the long-term discount function has an exponential tail.
Revised:  This result, which, although undoubtedly correct, has been regarded by many as counterintuitive and even pathological , stems from the implicit assumption that the long-term discount function has an exponential tail.
Edit intent: fluency
Original:  The conditions necessary for the existence of such "hyperbolic" long rates turn out to be those of so-called social discounting, which allow for long-term cash flows to be treated as broadly "just as important" as those of the short or medium term.
Revised:  The conditions necessary for the existence of such "hyperbolic" and "generalised hyperbolic" long rates are those of so-called social discounting, which allow for long-term cash flows to be treated as broadly "just as important" as those of the short or medium term.
Edit intent: meaning-changed
Original:  The conditions necessary for the existence of such "hyperbolic" and " generalised hyperbolic" long rates are those of so-called social discounting, which allow for long-term cash flows to be treated as broadly "just as important" as those of the short or medium term.
Revised:  The conditions necessary for the existence of such "hyperbolic" and " generalized hyperbolic" long rates are those of so-called social discounting, which allow for long-term cash flows to be treated as broadly "just as important" as those of the short or medium term.
Edit intent: clarity
Original:  Hence, we focus on characterizing the kinetic (motion) energy that can be harvested by a mobile device with an IoT form factor . We first discuss methods for estimating harvested energy from acceleration traces.
Revised:  Hence, we focus on characterizing the kinetic (motion) energy that can be harvested by a mobile device with an IoT form factor and on developing energy allocation algorithms for such nodes. In this paper, we describe methods for estimating harvested energy from acceleration traces.
Edit intent: meaning-changed
Original:  Finally, we use our measurement traces to evaluate the performance of energy harvesting-adaptive algorithms . Overall, the observations will provide insights into the design of networking algorithms and motion energy harvesters, which will be embedded in mobile devices .
Revised:  We also briefly summarize our experiments with moving objects. We develop energy allocation algorithms that take into account practical IoT node design considerations, and evaluate the algorithms using the collected measurements. Our observations provide insights into the design of networking algorithms and motion energy harvesters, which will be embedded in mobile devices .
Edit intent: meaning-changed
Original:  Spontanous curvatures of both phosphatidylethanolamines and cholesterol were found to be one order of magnitude more negative than those of phosphatidylcholines, whose J0 is close to zero.
Revised:  Spontanous curvatures of both phosphatidylethanolamines and cholesterol were found to be at least a factor of two more negative than those of phosphatidylcholines, whose J0 is close to zero.
Edit intent: meaning-changed
Original:  Spontanous curvatures of both phosphatidylethanolamines and cholesterol were found to be one order of magnitude more negative than those of phosphatidylcholines, whose J0 is close to zero.
Revised:  Spontanous curvatures of both phosphatidylethanolamines and cholesterol were found to be one order of magnitude more negative than those of phosphatidylcholines, whose J0 are closer to zero.
Edit intent: clarity