wanyu/IteraTeR_full_sent huggingface dataset:
Original: This paper focuses on designing and analyzing throughput-optimal scheduling policies that avoid the use of per-flow  information, maintain one single data queue for each link, exploit only local information, and potentially improve the delay performance, for multi-hop wireless networks under general interference constraints.
Revised: This paper focuses on designing and analyzing throughput-optimal scheduling policies that avoid the use of per-flow information, maintain one single data queue for each link, exploit only local information, for multi-hop wireless networks under general interference constraints.
Edit intent: clarity
Original:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow  information (which may be difficult to obtain and maintain), maintains per-flow (or per-destination) queues at each node, relies on constant exchange of queue length information among neighboring nodes to calculate link weights, and may result in poor delay performance  .
Revised:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain), maintains per-flow (or per-destination) queues at each node, relies on constant exchange of queue length information among neighboring nodes to calculate link weights, and may result in poor delay performance .
Edit intent: fluency
Original:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow  information (which may be difficult to obtain and maintain), maintains per-flow (or per-destination) queues at each node, relies on constant exchange of queue length information among neighboring nodes to calculate link weights, and may result in poor delay performance  .
Revised:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow information (which may be difficult to obtain and maintain), maintains complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes to calculate link weights, and may result in poor delay performance .
Edit intent: clarity
Original:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow  information (which may be difficult to obtain and maintain), maintains per-flow (or per-destination) queues at each node, relies on constant exchange of queue length information among neighboring nodes to calculate link weights, and may result in poor delay performance  .
Revised:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow information (which may be difficult to obtain and maintain), maintains per-flow (or per-destination) queues at each node, relies on constant exchange of queue length information among neighboring nodes , and results in poor delay performance .
Edit intent: clarity
Original:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow  information (which may be difficult to obtain and maintain), maintains per-flow (or per-destination) queues at each node, relies on constant exchange of queue length information among neighboring nodes to calculate link weights, and may result in poor delay performance  .
Revised:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow information (which may be difficult to obtain and maintain), maintains per-flow (or per-destination) queues at each node, relies on constant exchange of queue length information among neighboring nodes to calculate link weights, and may result in poor delay performance in certain scenarios .
Edit intent: clarity
Original: This paperfocuses on designing throughput-optimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link,  exploit only local information, for multi-hop wireless networks under general interference constraints .
Revised: In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a single data queue for each link, exploit only local information, for multi-hop wireless networks under general interference constraints .
Edit intent: clarity
Original: This paperfocuses on designing throughput-optimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link,  exploit only local information, for multi-hop wireless networks under general interference constraints .
Revised: This paperfocuses on designing throughput-optimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, for multi-hop wireless networks under general interference constraints .
Edit intent: coherence
Original: This paperfocuses on designing throughput-optimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link,  exploit only local information, for multi-hop wireless networks under general interference constraints .
Revised: This paperfocuses on designing throughput-optimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link, exploit only local information, while guaranteeing throughput optimality .
Edit intent: clarity
Original:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain ), maintains complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes, and  results in poor delay performance in certain scenarios.
Revised:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information . It is usually difficult to obtain and maintain ), maintains complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes, and results in poor delay performance in certain scenarios.
Edit intent: coherence
Original:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain ), maintains complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes, and  results in poor delay performance in certain scenarios.
Revised:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain this type of information, especially in large networks, where there are numerous flows. Also, the back-pressure algorithm maintains a complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes, and results in poor delay performance in certain scenarios.
Edit intent: meaning-changed
Original:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain ), maintains complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes, and  results in poor delay performance in certain scenarios.
Revised:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain ), maintains complex data structure at each node, keeps exchanging queue length information among neighboring nodes, and results in poor delay performance in certain scenarios.
Edit intent: clarity
Original:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain ), maintains complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes, and  results in poor delay performance in certain scenarios.
Revised:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain ), maintains complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes, and commonly results in poor delay performance in certain scenarios.
Edit intent: coherence
Original:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain ), maintains complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes, and  results in poor delay performance in certain scenarios. In contrast, the proposed schemes can circumvent these drawbacks while guaranteeing throughput optimality.
Revised:  Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain ), maintains complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes, and results in poor delay performance . In this paper, we propose scheduling schemes that can circumvent these drawbacks while guaranteeing throughput optimality.
Edit intent: clarity
Original:  Here  we predict that for a large class of biomolecular interactions  it is possible to accurately estimate the relative free energy of binding based on the fluctuation properties of their energy spectra, even if a finite number of the energy levels is known.
Revised:  Here , using a variant of the Derrida model, we predict that for a large class of biomolecular interactions it is possible to accurately estimate the relative free energy of binding based on the fluctuation properties of their energy spectra, even if a finite number of the energy levels is known.
Edit intent: meaning-changed
Original:  Here  we predict that for a large class of biomolecular interactions  it is possible to accurately estimate the relative free energy of binding based on the fluctuation properties of their energy spectra, even if a finite number of the energy levels is known.
Revised:  Here we predict that for a large class of biomolecular interactions , it is possible to accurately estimate the relative free energy of binding based on the fluctuation properties of their energy spectra, even if a finite number of the energy levels is known.
Edit intent: fluency
Original:  Our predictions imply that low-affinity binding scores, usually wasted in protein-protein and protein-DNA docking algorithms, can be efficiently utilized to compute the free energy  .
Revised:  Our predictions imply that low-affinity binding scores, usually wasted in protein-protein and protein-DNA docking algorithms, can be efficiently utilized to compute the free energy . Using the results of Rosetta docking simulations of protein-protein interactions from Andre et al., Proc. Natl. Acad. Sci. U.S.A. 105, 16148 (2008), we demonstrate the power of our predictions .
Edit intent: meaning-changed
Original: It is argued that the simple trading strategy of leveraging or deleveraging an investment in the market portfolio cannot outperform the market. Such stochastic market efficiency places strong constraints on the possible stochastic properties of the market.
Revised: It is argued that the simple trading strategy of leveraging or deleveraging an investment in the market portfolio cannot yield long-run outperformance. Historical data support the hypothesis. This places a strong constraint on the stochastic properties of the market.
Edit intent: meaning-changed
Original:  Such stochastic market efficiency places strong constraints on the possible stochastic properties of the market.Historical data confirm the hypothesis .
Revised:  Such stochastic market efficiency places strong constraints on the possible stochastic properties of traded assets, which we call "leverage efficiency." Market conditions that deviate from leverage efficiency are unstable and may create leverage-driven bubbles. This result resolves the equity premium puzzle, informs interest rate setting, and constitutes a theory of noise in financial markets .
Edit intent: meaning-changed
Original:  This result resolves the equity premium puzzle , informs interest rate setting , and constitutes a theory of noise in financial markets  .
Revised:  Here we expand on the hypothesis and its implications. These include a theory of noise that explains how systemic stability rules out smooth price changes at any pricing frequency; a resolution of the so-called equity premium puzzle , informs interest rate setting , and constitutes a theory of noise in financial markets .
Edit intent: meaning-changed
Original:  This result resolves the equity premium puzzle , informs interest rate setting , and constitutes a theory of noise in financial markets  .
Revised:  This result resolves the equity premium puzzle , informs interest rate setting to avoid leverage-driven price instabilities; and a method for detecting fraudulent investment schemes by exploiting differences between the stochastic properties of their prices and those of legitimately-traded assets. To submit the hypothesis to a rigorous test we choose price data from different assets: the S .
Edit intent: meaning-changed
Original:  This result resolves the equity premium puzzle , informs interest rate setting , and constitutes a theory of noise in financial markets  .
Revised:  This result resolves the equity premium puzzle , informs interest rate setting , and constitutes a theory of noise in financial markets P500 index, Bitcoin, Berkshire Hathaway Inc., and Bernard L. Madoff Investment Securities LLC. Analysis of these data supports the hypothesis .
Edit intent: meaning-changed
Original:  Biological systems are known in which several different kinases phosphorylate a single substrate and others where a single kinase phosphorylate several different substrates. Furthermore, phosphorylation in more than one site can be carried out by a unique kinase or, as in the case of priming kinases, different ones (and similarly for phosphatases) .
Revised:  In particular, signaling pathways regulated by protein phosphorylation display features that facilitate a variety of responses to different biological inputs. The features that lead to multistationarity are of particular interest to determine as well as the stability properties of the steady states .
Edit intent: clarity
Original:  Our modules are built on a one-site modification cycle and contain one or two cycles combined in all possible ways with the above features regarding the number of modification sites, and competition and non-specificity of enzymes, incorporated.
Revised:  We derive an explicit mathematical relationship between the concentration of a chemical species at steady state and a conserved quantity of the system such as the total amount of substrate available. We show that the relation determines the number of modification sites, and competition and non-specificity of enzymes, incorporated.
Edit intent: meaning-changed
Original:  Our modules are built on a one-site modification cycle and contain one or two cycles combined in all possible ways with the above features regarding the number of modification sites, and competition and non-specificity of enzymes, incorporated. We conclude that multistationarity arises whenever a single enzyme is responsible for catalyzing the modification of two different but linked substrates and that the presence of multiple steady states requires two opposing dynamics (e. g. phosphatase and kinase) acting on the same substrate. The mathematical modeling is based on mass-action kinetics and the conclusions are derived in full generality without restoring to simulations or random generation of parameters  .
Revised:  Our modules are built on a one-site modification cycle and contain one or two cycles combined in all possible ways with the above features regarding the number of steady states and provides a necessary condition for a steady state to be stable, that is, to be biologically attainable. Further, we identify characteristics of the motifs that lead to multistationarity, and extend the view that multistationarity in signaling pathways arises from multisite phosphorylation. Our approach relies on mass-action kinetics and the conclusions are derived in full generality without restoring to simulations or random generation of parameters .
Edit intent: clarity
Original:  The model jointly reproduces two known empirical scaling laws: the scale-free distribution of family sizes and the nonlinear scaling of the number of genes in certain functional categories  with genome size.
Revised:  The model jointly reproduces two known empirical scaling laws: the scale-free distribution of family sizes and the nonlinear scaling of the number of genes in certain functional categories (e.g. transcription factors) with genome size.
Edit intent: meaning-changed
Original:  This mathematical property of our model was subsequently confirmed in real-life prokaryotic genomes. To further support the assumptions of our model we present an empirical evidence of correlations between functional repertoires of prokaryotic genomes. The overall pattern of these correlations remains mostly unchanged when large and small genomes are analyzed separately. This hints at universality of biological mechanisms shaping up prokaryotic genomes irrespective of their size .
Revised:  It predicts that functional categories that grow faster-than-linearly with genome size to be characterized by flatter-than-average family size distributions. This exponent relation is subsequently confirmed by our bioinformatics analysis of prokaryotic genomes .
Edit intent: meaning-changed
Original:  The model jointly reproduces two known empirical laws: the powerlaw distribution of family sizes and the nonlinear scaling of the number of genes in certain functional categories (e.g. transcription factors) with genome size.
Revised:  The model jointly reproduces two known empirical laws: the distribution of family sizes and the nonlinear scaling of the number of genes in certain functional categories (e.g. transcription factors) with genome size.
Edit intent: fluency
Original:  In this article, we have extended the previous studies of collateralized derivative pricing to more generic situation, that is asymmetric and imperfect collateralization as well as the associated CVA. We have presented approximate expressions for various cases using Gateaux derivative which allow straightforward numerical analysis.
Revised:  In this article, we have extended the previous studies of collateralized derivative pricing to more generic situation, that is asymmetric and imperfect collateralization with the associated counter party credit risk. By introducing the collateral coverage ratio, our framework can handle these issues in an unified manner. Although the resultant pricing formula becomes non-linear FBSDE and cannot be solve exactly, the fist order approximation is provided using Gateaux derivative which allow straightforward numerical analysis.
Edit intent: meaning-changed
Original:  We have presented approximate expressions for various cases using Gateaux derivative which allow straightforward numerical analysis. Numerical examples for CCS (cross currency swap)and IRS(interest rate swap) with asymmetric collateralization were also provided. They clearly show the practical relevance of sophisticated collateral management for financial firms. The valuation and the associated issue of collateral cost under the one-way CSA (or unilateral collateralization) , which is common when SSA (sovereign, supranational and agency) entities are involved, have been also studied .
Revised:  We have presented approximate expressions for various cases using Gateaux derivative .
Edit intent: coherence
Original:   We have also discussed some generic implications of asymmetric collateralization for netting and resolution of information .
Revised:  We have shown that it allows us to decompose the price of generic contract into three parts: market benchmark, bilateral credit value adjustment (CVA), and the collateral cost adjustment (CCA) independent from the credit risk. We have also discussed some generic implications of asymmetric collateralization for netting and resolution of information .
Edit intent: meaning-changed
Original:  These constraints are modeled by predictable convex-set-valued processes whose values do not necessarily contain the origin, i.e.,  no risky investment at all may be inadmissible .
Revised:  These constraints are modeled by predictable convex-set-valued processes whose values do not necessarily contain the origin, i.e., it may be inadmissible for an investor to hold no risky investment at all may be inadmissible .
Edit intent: clarity
Original:  Our main result establishes existence of the optimal trading strategies in such markets under no smoothness requirements on the utility function , and relates them to the corresponding dual objects. Moreover, we show that the dual optimization problem can be posed over a set of countably-additive probability measures, thus eschewing the need for the usual finitely-additive enlargement.
Revised:  Our main result establishes existence of the optimal trading strategies in such markets under no smoothness requirements on the utility function . The result also shows that, up to attainment, the dual optimization problem can be posed over a set of countably-additive probability measures, thus eschewing the need for the usual finitely-additive enlargement.
Edit intent: clarity
Original:  These constraints are modeled by predictable convex-set-valued processes whose values do not necessarily contain the origin , i.e., it may be inadmissible for an investor to hold no risky investment at all.
Revised:  These constraints are modeled by predictable convex-set-valued processes whose values do not necessarily contain the origin ; that is, it may be inadmissible for an investor to hold no risky investment at all.
Edit intent: coherence
Original:  The result also shows that, up to attainment, the dual optimization problem can be posed over a set of countably-additive probability measures, thus eschewing the need for the usual finitely additive enlargement.
Revised:  The result also shows that, up to attainment, the dual optimization problem can be posed over a set of countably-additive probability measures, thus eschewing the need for the usual finitely-additive enlargement.
Edit intent: fluency
Original: We consider an optimal consumption - investment problem for financial markets of Black-Scholes 's type with the random coefficients . The existence and uniqueness theorem for the Hamilton-Jacobi-Bellman (HJB) equation is shown.
Revised: We consider an optimal consumption - investment problem for financial markets of Black-Scholes financial market with stochastic coefficients driven by a diffusion process. We assume that an agent makes consumption and investment decisions based on CRRA utility functions. The dynamical programming approach leads to an investigation of the Hamilton Jacobi Bellman (HJB) equation is shown.
Edit intent: meaning-changed