wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We show that the differences between the exact solution and the exponential cooling law are not significant, and even negligible, for small surfaces of the order 10cm^2 . However, for larger surface sizes, the radiative cooling component may become comparable to the convective cooling component.
Revised:  We show that the differences between the exact solution and the exponential cooling law are not significant, and even negligible, for small surfaces of the order 10cm^2 . However, for larger surface sizes, the radiative cooling effect may become comparable to the convective cooling component.
Edit intent: clarity
Original:  We show that the differences between the exact solution and the exponential cooling law are not significant, and even negligible, for small surfaces of the order 10cm^2 . However, for larger surface sizes, the radiative cooling component may become comparable to the convective cooling component. Our results thus suggest that, in the absence of accurate temperature measurements, an exponential cooling law is accurate enough for  small-sized SoC systems that require low processing overhead.
Revised:  We show that the differences between the exact solution and the exponential cooling law are not significant, and even negligible, for small surfaces of the order 10cm^2 . However, for larger surface sizes, the radiative cooling component may become comparable to the convective cooling one. In other words, radiation becomes non-negligible for systems with a cooling surface larger than about 1\,dm^2. Otherwise for surfaces below 1\,dm^2, we show that the differences between the exact solution and the exponential cooling law becomes negligible. In the absence of accurate temperature measurements, an exponential cooling law is accurate enough for small-sized SoC systems that require low processing overhead.
Edit intent: meaning-changed
Original: In the framework of an incomplete financial market where the stock price dynamics are modeled by a continuous semimartingale , an explicit first-order expansion formula for the power investor's value function - seen as a function of the underlying market price of risk process - is provided and its second-order error is quantified .
Revised: In the framework of an incomplete financial market where the stock price dynamics are modeled by a continuous semimartingale (not necessarily Markovian) an explicit second-order expansion formula for the power investor's value function - seen as a function of the underlying market price of risk process - is provided and its second-order error is quantified .
Edit intent: meaning-changed
Original: In the framework of an incomplete financial market where the stock price dynamics are modeled by a continuous semimartingale , an explicit first-order expansion formula for the power investor's value function - seen as a function of the underlying market price of risk process - is provided and its second-order error is quantified .
Revised: In the framework of an incomplete financial market where the stock price dynamics are modeled by a continuous semimartingale , an explicit first-order expansion formula for the power investor's value function - seen as a function of the underlying market price of risk process - is provided . This allows us to provide first-order approximations of the optimal primal and dual controls .
Edit intent: meaning-changed
Original:  This article extends his model to a continuous-time setting with a Markov diffusion process X with state space R. Unfortunately, the continuous-time model fails to recover an objective measure from a risk-neutral measure.
Revised:  Many authors extended his model to a continuous-time setting with a Markov diffusion process X with state space R. Unfortunately, the continuous-time model fails to recover an objective measure from a risk-neutral measure.
Edit intent: clarity
Original:  In this article, when X is transient under the objective measure, we investigate what information is necessary and sufficient to recover . We also introduce the notion of a reference function, which contains the information near the area where the process X lies with high probability under the objective measure. A reference function will be used for empirical purposes when X is transient under the objective measure .
Revised:  In this article, when X is transient under the objective measure, we investigate what information is necessary and sufficient to recover .
Edit intent: coherence
Original: Here we present ComPPI, a cellular compartment-specific database of proteins and their interactions enabling an extensive, compartmentalized protein-protein interaction network analysis (URL : URL ComPPI enables the user to filter biologically unlikely interactions, where the two interacting proteins have no common subcellular localizations and to predict novel properties, such as compartment-specific biological functions.
Revised: Here we present ComPPI, a cellular compartment specific database of proteins and their interactions enabling an extensive, compartmentalized protein-protein interaction network analysis (URL : URL ComPPI enables the user to filter biologically unlikely interactions, where the two interacting proteins have no common subcellular localizations and to predict novel properties, such as compartment-specific biological functions.
Edit intent: fluency
Original: Here we present ComPPI, a cellular compartment-specific database of proteins and their interactions enabling an extensive, compartmentalized protein-protein interaction network analysis (URL : URL ComPPI enables the user to filter biologically unlikely interactions, where the two interacting proteins have no common subcellular localizations and to predict novel properties, such as compartment-specific biological functions.
Revised: Here we present ComPPI, a cellular compartment-specific database of proteins and their interactions enabling an extensive, compartmentalized protein-protein interaction network analysis URL ComPPI enables the user to filter biologically unlikely interactions, where the two interacting proteins have no common subcellular localizations and to predict novel properties, such as compartment-specific biological functions.
Edit intent: coherence
Original:  The compilation of 9 protein-protein interaction and 8 subcellular localization datasets had 4 curation steps including a manually built, comprehensive hierarchical structure of more than 1,600 subcellular localizations.
Revised:  The compilation of nine protein-protein interaction and 8 subcellular localization datasets had 4 curation steps including a manually built, comprehensive hierarchical structure of more than 1,600 subcellular localizations.
Edit intent: fluency
Original:  The compilation of 9 protein-protein interaction and 8 subcellular localization datasets had 4 curation steps including a manually built, comprehensive hierarchical structure of more than 1,600 subcellular localizations.
Revised:  The compilation of 9 protein-protein interaction and eight subcellular localization data sets had four curation steps including a manually built, comprehensive hierarchical structure of more than 1,600 subcellular localizations.
Edit intent: clarity
Original:  The compilation of 9 protein-protein interaction and 8 subcellular localization datasets had 4 curation steps including a manually built, comprehensive hierarchical structure of more than 1,600 subcellular localizations.
Revised:  The compilation of 9 protein-protein interaction and 8 subcellular localization datasets had 4 curation steps including a manually built, comprehensive hierarchical structure of more than 1600 subcellular localizations.
Edit intent: meaning-changed
Original:  Due to its novel features, ComPPI is useful for the analysis of experimental results in biochemistry and molecular biology, as well as for proteome-wide studies in bioinformatics and network science helping cellular biology, medicine and drug desig
Revised:  Due to its novel features, ComPPI is useful for the analysis of experimental results in biochemistry and molecular biology, as well as for proteome-wide studies in bioinformatics and network science helping cellular biology, medicine and drug design.
Edit intent: fluency
Original:  Since some applications require forecasting and planning for a wide variety of different contingencies, we also consider the problem of minimizing the expectation of the weighted sum of unpaid liabilities under the assumption that the net external asset holdings of all institutions are stochastic.
Revised:  We also consider the problem of minimizing the expectation of the weighted sum of unpaid liabilities under the assumption that the net external asset holdings of all institutions are stochastic.
Edit intent: clarity
Original:  For this problem, we develop a heuristic algorithm which uses reweighted l1 minimization . We show through numerical simulations that the solutions calculated by our algorithm are close to optimal .
Revised:  For this problem, we develop a heuristic algorithm which uses reweighted l1 minimization algorithm and a greedy algorithm. We illustrate these two algorithms using three synthetic network structures for which the optimal solution can be calculated exactly. We also compare these two algorithms on three types random networks which are more complex .
Edit intent: meaning-changed
Original:  Specifically, state-based CRDTs achieve this by sharing local state changes through shipping the entire state, that is then merged to other replicas with an idempotent, associative, and commutative join operation, ensuring convergence.
Revised:  Specifically, state-based CRDTs ensure convergence through disseminating the en- tire state, that is then merged to other replicas with an idempotent, associative, and commutative join operation, ensuring convergence.
Edit intent: clarity
Original:  Specifically, state-based CRDTs achieve this by sharing local state changes through shipping the entire state, that is then merged to other replicas with an idempotent, associative, and commutative join operation, ensuring convergence.
Revised:  Specifically, state-based CRDTs achieve this by sharing local state changes through shipping the entire state, that may be large, and merging it to other replicas with an idempotent, associative, and commutative join operation, ensuring convergence.
Edit intent: meaning-changed
Original:  Specifically, state-based CRDTs achieve this by sharing local state changes through shipping the entire state, that is then merged to other replicas with an idempotent, associative, and commutative join operation, ensuring convergence.This imposes a large communication overhead as the state size becomes larger.
Revised:  Specifically, state-based CRDTs achieve this by sharing local state changes through shipping the entire state, that is then merged to other replicas ; whereas operation-based CRDTs disseminate operations (i.e., small states) assuming an exactly-once reliable dissemination layer.
Edit intent: meaning-changed
Original:  We introduce Delta State Conflict-Free Replicated Datatypes ({\delta}-CRDT) , which make use of \delta%DIFDELCMD < }%%% -mutators, defined in such a way to return a delta-state, typically, with a much smaller size than the full state.
Revised:  We introduce Delta State Conflict-Free Replicated Datatypes ({\delta}-CRDT) \delta%DIFDELCMD < }%%% -mutators, defined in such a way to return a delta-state, typically, with a much smaller size than the full state.
Edit intent: clarity
Original:  We introduce Delta State Conflict-Free Replicated Datatypes ({\delta}-CRDT) , which make use of \delta%DIFDELCMD < }%%% -mutators, defined in such a way to return a delta-state, typically, with a much smaller size than the full state.
Revised:  We introduce Delta State Conflict-Free Replicated Datatypes ({\delta}-CRDT) , which make use of %DIFDELCMD < }%%% -mutators, defined in such a way to return a delta-state, typically, with a much smaller size than the full state.
Edit intent: coherence
Original:  We introduce Delta State Conflict-Free Replicated Datatypes ({\delta}-CRDT) , which make use of \delta%DIFDELCMD < }%%% -mutators, defined in such a way to return a delta-state, typically, with a much smaller size than the full state. Delta-states are joined to the local state as well as to the remote states (after being shipped). This can achieve the best of both worlds: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs.  } We introduce the {\delta}-CRDT framework, and we explain it through establishing a correspondence to current state- based CRDTs.
Revised:  We introduce Delta State Conflict-Free Replicated Datatypes ({\delta}-CRDT) , which make use of \delta%DIFDELCMD < }%%% that can achieve the best of both worlds: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs. } We introduce the {\delta}-CRDT framework, and we explain it through establishing a correspondence to current state- based CRDTs.
Edit intent: coherence
Original:  This can achieve the best of both worlds: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs.  } We introduce the {\delta}-CRDT framework, and we explain it through establishing a correspondence to current state- based CRDTs.
Revised:  This can achieve the best of both worlds: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs. This is achieved by defining } We introduce the {\delta}-CRDT framework, and we explain it through establishing a correspondence to current state- based CRDTs.
Edit intent: meaning-changed
Original:  This can achieve the best of both worlds: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs.  } We introduce the {\delta}-CRDT framework, and we explain it through establishing a correspondence to current state- based CRDTs.
Revised:  This can achieve the best of both worlds: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs. \delta} We introduce the {\delta}-CRDT framework, and we explain it through establishing a correspondence to current state- based CRDTs.
Edit intent: meaning-changed
Original:  This can achieve the best of both worlds: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs.  } We introduce the {\delta}-CRDT framework, and we explain it through establishing a correspondence to current state- based CRDTs.
Revised:  This can achieve the best of both worlds: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs. }-mutators to return a delta-state, typically with a much smaller size than the full state, that is joined to both: local and remote states. We introduce the {\delta}-CRDT framework, and we explain it through establishing a correspondence to current state- based CRDTs.
Edit intent: meaning-changed
Original:  This can achieve the best of both worlds: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs.  } We introduce the {\delta}-CRDT framework, and we explain it through establishing a correspondence to current state- based CRDTs.
Revised:  This can achieve the best of both worlds: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs. } We introduce the {\delta}-CRDT framework, and we explain it through establishing a correspondence to current state-based CRDTs.
Edit intent: fluency
Original:  In addition, we present two anti-entropy algorithms: a basic one that provides eventual convergence, and another one that ensures both convergence and causal consistency. We also introduce two {\delta}-CRDT specifications of well-known replicated datatypes.
Revised:  In addition, we present two anti-entropy algorithm that ensures causal consistency, and we introduce two {\delta}-CRDT specifications of well-known replicated datatypes.
Edit intent: coherence
Original: We consider the classical optimal dividend payments problem under the Cram\'er-Lundberg model with exponential claim sizes subject to a constraint on the time of ruin (P1). We use the Lagrangian dual function which leads to an auxiliary problem (P2). For this problem, given a multiplier \Lambda, we prove the uniqueness of the optimal barrier strategy and we also obtain its value function. Finally, we prove that the optimal value function of (P1) is obtained as the point-wise infimum over \Lambda of all value functions of problems (P2) .
Revised: We consider the classical optimal dividend payments problem under the Cram\'er-Lundberg model with exponential claim sizes subject to a constraint on the time of ruin . We introduce the dual problem and show that the complementary slackness conditions are satisfied, thus there is no duality gap. Therefore the optimal value function of (P1) is obtained as the point-wise infimum over \Lambda of all value functions of problems (P2) .
Edit intent: coherence
Original:  We introduce a concept of ` consistency ' of a risk measure , which is close to Dawid's `strong prequential principle' , and examine its application to quantile forecasting (VaR -- value at risk) and to mean estimation (applicable to CVaR -- expected shortfall).
Revised:  We introduce a concept of ` calibration ' of a risk measure , which is close to Dawid's `strong prequential principle' , and examine its application to quantile forecasting (VaR -- value at risk) and to mean estimation (applicable to CVaR -- expected shortfall).
Edit intent: meaning-changed
Original:  We introduce a concept of ` consistency ' of a risk measure , which is close to Dawid's `strong prequential principle' , and examine its application to quantile forecasting (VaR -- value at risk) and to mean estimation (applicable to CVaR -- expected shortfall).
Revised:  We introduce a concept of ` consistency ' of a risk measure in a dynamic setting, following the precepts of Dawid's `strong prequential principle' , and examine its application to quantile forecasting (VaR -- value at risk) and to mean estimation (applicable to CVaR -- expected shortfall).
Edit intent: meaning-changed
Original:  We introduce a concept of ` consistency ' of a risk measure , which is close to Dawid's `strong prequential principle' , and examine its application to quantile forecasting (VaR -- value at risk) and to mean estimation (applicable to CVaR -- expected shortfall).
Revised:  We introduce a concept of ` consistency ' of a risk measure , which is close to Dawid's weak and strong prequential principles , and examine its application to quantile forecasting (VaR -- value at risk) and to mean estimation (applicable to CVaR -- expected shortfall).
Edit intent: meaning-changed
Original:  Specifically, we derive the well known Lyapunov function of chemical reaction network theory as a scaling limit of the non-equilibrium potential of the stationary distribution of stochastically modeled complex balanced systems.
Revised:  Specifically, we derive the well known Lyapunov function of reaction network theory as a scaling limit of the non-equilibrium potential of the stationary distribution of stochastically modeled complex balanced systems.
Edit intent: clarity
Original:  While many endogenous homeostatic motifs have been studied in living cells, synthetic homeostatic circuits have received far less attention. The tight regulation of the abundance of cellular products and intermediates in the noisy environment of the cell is now recognised as a critical requirement for several biotechnology and therapeutic applications .
Revised:  While many endogenous homeostatic motifs have been studied in living cells, some other motifs may remain under-explored or even undiscovered. At the same time, known regulatory motifs have been mostly analyzed at the deterministic level, and the effect of noise on their regulatory function has received low attention .
Edit intent: clarity
Original:  Using these ideas, we propose a new regulation motif that implements an integral feedbackstrategy which can generically and effectively regulate{\em  a wide class of reaction networks.
Revised:  Using these ideas, we propose a new regulation motif that implements an integral feedbackstrategy which can generically and effectively regulate{\em antithetic integral feedback, and demonstrate its effectiveness as a strategy for generically regulating a wide class of reaction networks.
Edit intent: meaning-changed
Original:  By combining tools from probability and control theory, we show that the proposed control motif preserves the stability of the overall network, steers the population of any regulated species to a desired set point, and achieves robust perfect adaptation -- all without any prior knowledge of reaction rates.
Revised:  By combining tools from probability and control theory, we show that the proposed motif preserves the stability of the overall network, steers the population of any regulated species to a desired set point, and achieves robust perfect adaptation -- all without any prior knowledge of reaction rates.
Edit intent: fluency
Original:  By combining tools from probability and control theory, we show that the proposed control motif preserves the stability of the overall network, steers the population of any regulated species to a desired set point, and achieves robust perfect adaptation -- all without any prior knowledge of reaction rates.
Revised:  By combining tools from probability and control theory, we show that the proposed control motif preserves the stability of the overall network, steers the population of any regulated species to a desired set point, and achieves robust perfect adaptation -- all with low prior knowledge of reaction rates.
Edit intent: clarity
Original:  Faced with this paradox, one might hope that a rigorous mathematical approach might help determine which is the truth ] .
Revised:  Faced with this paradox, one might hope that a rigorous mathematical approach might help determine which is the truth ]. 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 .
Edit intent: meaning-changed
Original:  These arguments cannot both be correct, but both arguments seem meritorious. Faced with this paradox, one might hope that a rigorous mathematical approach might help determine the truth. 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:  Today, in 2020, we find ourselves in the midst of another crisis where government spending and fiscal stimulus is again being considered as a solution. In the present paper, we address this question by formulating an 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 .
Edit intent: meaning-changed