wanyu/IteraTeR_v2 huggingface dataset:
Original:  and ( c) known general-purpose timing channel control methods undermine statistical resource sharing efficiency, and, with it, the cloud computing business model.
Revised:  and ( c) known general-purpose timing channel control undermine statistical sharing efficiency, and, with it, the cloud computing business model.
Edit intent: clarity
Original:  We propose a new cloud architecture that uses provider-enforced deterministic execution to eliminate all timing channels internal to a shared cloud domain , without limiting internal resource sharing.
Revised:  We propose a new approach to timing channel control, using provider-enforced deterministic execution to eliminate all timing channels internal to a shared cloud domain , without limiting internal resource sharing.
Edit intent: clarity
Original:  The hypervisor enables parallel guest processesand threadsto interact via familiar shared memoryand file system abstractions , and runs moderately coarse-grained parallel tasks as efficiently and scalably as current nondeterministic environments .
Revised:  The OS supports deterministic versions of familiar APIs such as processes, threads, shared memory, and file systems , and runs moderately coarse-grained parallel tasks as efficiently and scalably as current nondeterministic environments .
Edit intent: clarity
Original:  The hypervisor enables parallel guest processesand threadsto interact via familiar shared memoryand file system abstractions , and runs moderately coarse-grained parallel tasks as efficiently and scalably as current nondeterministic environments .
Revised:  The hypervisor enables parallel guest processesand threadsto interact via familiar shared memoryand file system abstractions , and runs coarse-grained parallel tasks as efficiently and scalably as current nondeterministic environments .
Edit intent: clarity
Original:  The hypervisor enables parallel guest processesand threadsto interact via familiar shared memoryand file system abstractions , and runs moderately coarse-grained parallel tasks as efficiently and scalably as current nondeterministic environments .
Revised:  The hypervisor enables parallel guest processesand threadsto interact via familiar shared memoryand file system abstractions , and runs moderately coarse-grained parallel tasks as efficiently and scalably as current timing channel-ridden systems .
Edit intent: clarity
Original:  Private data created by users is frequently disseminated around the Internet and users often lose the control and ownership of their contents.
Revised:  Private data created by users is frequently disseminated around the Internet and users often lose its control and ownership of their contents.
Edit intent: clarity
Original:  This paper explores and formalizes the concept of Ephemeral Data Systems , systems that prevent an adversary from accessing expired contents.
Revised:  This paper explores and formalizes the concept of Ephemeral Data Systems (EDSs): EDSs protect privacy of past data and prevent malicious parties from accessing expired contents.
Edit intent: clarity
Original:  We present EphCOM , a practical Ephemeral Data System that supports ephemeral data using only a primary Internet service , namely the Domain Name Service (DNS) . Our proposal leverages DNS servers caching mechanisms.
Revised:  We present EphCom , a practical Ephemeral Data System that supports ephemeral data using only a primary Internet service , namely the Domain Name Service (DNS) . Our proposal leverages DNS servers caching mechanisms.
Edit intent: fluency
Original:  We present EphCOM , a practical Ephemeral Data System that supports ephemeral data using only a primary Internet service , namely the Domain Name Service (DNS) . Our proposal leverages DNS servers caching mechanisms.
Revised:  We present EphCOM , a practical EDS using only a primary Internet service , namely the Domain Name Service (DNS) . Our proposal leverages DNS servers caching mechanisms.
Edit intent: clarity
Original:  We present EphCOM , a practical Ephemeral Data System that supports ephemeral data using only a primary Internet service , namely the Domain Name Service (DNS) . Our proposal leverages DNS servers caching mechanisms.
Revised:  We present EphCOM , a practical Ephemeral Data System that supports ephemeral data using only a primary Internet service --- the Domain Name Service (DNS) . Our proposal leverages DNS servers caching mechanisms.
Edit intent: coherence
Original:  EphCOM does not rely on any Trusted Platform Modules (TPM),  peer-to-peer networks, or centralized servers, and is transparent to existing applications and services .
Revised:  EphCOM does not rely on Trusted Platform Modules (TPM), peer-to-peer networks, or centralized servers, and is transparent to existing applications and services .
Edit intent: clarity
Original:  EphCOM does not rely on any Trusted Platform Modules (TPM),  peer-to-peer networks, or centralized servers, and is transparent to existing applications and services .
Revised:  EphCOM does not rely on any Trusted Platform Modules (TPM), centralized servers, peer-to-peer networks, or centralized servers, and is transparent to existing applications and services .
Edit intent: fluency
Original:  It allows users to closely control data lifetime.
Revised:  It allows users to tightly control data lifetime.
Edit intent: clarity
Original:  Finally, we provide as proof of concept a stand-alone Firefox extension that provides ephemeral email capabilities and a command line tool for ephemeral files.
Revised:  Finally, we present a proof-of-concept Firefox extension that provides ephemeral email capabilities and a command line tool for ephemeral files.
Edit intent: clarity
Original: The increasing amount of personal  information disseminated over the Internet raises serious privacy concerns.
Revised: The increasing amount of personal information disseminated over the Internet prompts commensurately growing privacy concerns.
Edit intent: clarity
Original:  Data may linger forever, and users often lose its control and ownership .
Revised:  Digital data often lingers indefinitely and users lose its control and ownership .
Edit intent: clarity
Original:  Data may linger forever, and users often lose its control and ownership .
Revised:  Data may linger forever, and users often lose its control .
Edit intent: clarity
Original:  This motivates the desire of binding availability of contents to expiration times set by the data owner.
Revised:  This motivates the desire to restrict content availability to an expiration time set by the data owner.
Edit intent: clarity
Original:  To this end, we discuss and formalize the notion of Ephemeral Data Systems (EDSs): EDSs protect privacy of past data and prevent malicious parties from accessing expired contents.
Revised:  This paper presents and formalizes the notion of Ephemeral Data Systems (EDSs): EDSs protect privacy of past data and prevent malicious parties from accessing expired contents.
Edit intent: clarity
Original:  We present EphCom, a practical EDS using only a primary Internet service --- the Domain Name Service (DNS) and its caching mechanism.
Revised:  We present EphCom, a practical EDS using only a primary Internet service --- the Domain Name System (DNS) and its caching mechanism.
Edit intent: fluency
Original:  It is transparent to existing applications and services, and allows users to tightly control data lifetime .
Revised:  It is transparent to existing applications , and does not rely on trusted hardware, centralized servers, or user proactive actions .
Edit intent: clarity
Original:  We analyze its security and show that EphCom instantiates a secure and practical EDS, with a negligible overhead on the DNS infrastructure.
Revised:  We analyze its robustness and show that EphCom instantiates a secure and practical EDS, with a negligible overhead on the DNS infrastructure.
Edit intent: clarity
Original:  We analyze its security and show that EphCom instantiates a secure and practical EDS, with a negligible overhead on the DNS infrastructure.
Revised:  We analyze its security and show that it incurs a negligible overhead on the DNS infrastructure.
Edit intent: clarity
Original:  In the process of testing EphCom's reliability, we performed extensive measurements on the caching behavior of Open DNS servers, which might be of independent interest this is to our knowledge the first such measurement.
Revised:  We also perform a large-scale study of the caching behavior of Open DNS servers, which might be of independent interest this is to our knowledge the first such measurement.
Edit intent: clarity
Original: We consider the pricing of derivatives written on the discrete realized variance of an underlying security.
Revised: We consider the pricing of derivatives written on the discretely sampled realized variance of an underlying security.
Edit intent: clarity
Original:  Here, we characterize the short-time limits of call options on both objects.
Revised:  Here, we characterize the small-time limits of options on both objects.
Edit intent: clarity
Original:  To illustrate our results , we also present some numerical examples.
Revised:  To illustrate our results by some numerical examples.
Edit intent: clarity
Original:  In some cases, the scaling was similar, but only when the MEG signal was not corrected for the frequency filtering of the environmental and instrumental noise .
Revised:  In some cases, the scaling was similar, but only when the signal-to-noise ratio of the MEG was low. Several methods of noise correction for environmental and instrumental noise .
Edit intent: clarity
Original:  In this paper, we study a generalized version of the SIR (susceptible-infected-recovered) model of epidemic disease that allows for arbitrary nonuniform distributions of transmission and recovery times.
Revised:  In this paper, we study a generalized version of the SIR (susceptible-infected-recovered) model of epidemic disease that allows for arbitrary distributions of transmission and recovery times.
Edit intent: clarity
Original:  The connection between our definition and Kreisel's notion of a mechanistic theory is discussed, and several examples of computable physical models are given, including models which feature discrete motion, models which feature non-discrete continuous motion, and non-deterministic models such as radioactive decay.
Revised:  The connection between our definition and Kreisel's notion of a mechanistic theory is discussed, and several examples of computable physical models are given, including models which feature discrete motion, a model which features non-discrete continuous motion, and non-deterministic models such as radioactive decay.
Edit intent: coherence
Original:  The definition of a computable physical model also allows for a precise formalization of the computable universe hypothesis-the claim that all the laws of physics are computable.
Revised:  The definition of a computable physical model also allows for a precise formalization of the computable universe hypothesis--the claim that all the laws of physics are computable.
Edit intent: fluency
Original:  The connection between our definition and Kreisel's notion of a mechanistic theory is discussed, and several examples of computable physical models are given, including models which feature discrete motion, a model which features non-discrete continuous motion, and non-deterministic models such as radioactive decay.
Revised:  The connection between our definition and Kreisel's notion of a mechanistic theory is discussed, and several examples of computable physical models are given, including models which feature discrete motion, a model which features non-discrete continuous motion, and probabilistic models such as radioactive decay.
Edit intent: clarity
Original: The lambda calculus, subject to typing restrictions, provides a syn- tax for the internal language of cartesian closed categories.
Revised: The lambda calculus, subject to typing restrictions, provides a syntax for the internal language of cartesian closed categories.
Edit intent: fluency
Original:  The connection is made by interpreting multi-stage type systems as indexed functors from polynomial categories to their reindexings (Definitions 15 and 16) .
Revised:  The connection is made by interpreting multi-stage type systems as indexed functors from polynomial categories to their reindexings .
Edit intent: coherence
Original:  The translation is defined by induction on the structure of the proof that the multi-stage program is well-typed, relying on information encoded in the proof's use of structural rules (weakening, contraction, exchange, and context associativity) .
Revised:  The translation is defined by induction on the structure of the proof that the multi-stage program is well-typed, relying on information encoded in the proof's use of structural rules .
Edit intent: clarity
Original: We prove that a certain Markov chain for phylogenetic reconstruction using SPRtransitions converges quickly to its stationary distribution when the data is generated from a tree with sufficiently short branch lengths .
Revised: This paper studies a Markov chain for phylogenetic reconstruction using SPRtransitions converges quickly to its stationary distribution when the data is generated from a tree with sufficiently short branch lengths .
Edit intent: clarity
Original:  Our proofs express the leading terms of the maximum likelihood function of a tree T as a function of the size of the minimum cut in T needed to realize single edge cuts of the generating  tree.
Revised:  Our proofs use that the leading term of the maximum likelihood function of a tree T as a function of the size of the minimum cut in T needed to realize single edge cuts of the generating tree.
Edit intent: clarity
Original: MicroRNAs are endogenous non coding RNAs which negatively regulate the expression of protein-coding genes in plants and animals.
Revised: MicroRNAs are endogenous non-coding RNAs which negatively regulate the expression of protein-coding genes in plants and animals.
Edit intent: fluency
Original:  The objective is to preprocess P  such that given any arbitrary query point q, the largest empty region of some desired shape that contains q but does not contain any point in P can be reported efficiently.
Revised:  The objective is to preprocess P , preprocess it such that given any arbitrary query point q, the largest empty region of some desired shape that contains q but does not contain any point in P can be reported efficiently.
Edit intent: clarity
Original:  The objective is to preprocess P  such that given any arbitrary query point q, the largest empty region of some desired shape that contains q but does not contain any point in P can be reported efficiently.
Revised:  The objective is to preprocess P such that given a query point q, the largest empty region of some desired shape that contains q but does not contain any point in P can be reported efficiently.
Edit intent: clarity
Original:  The objective is to preprocess P  such that given any arbitrary query point q, the largest empty region of some desired shape that contains q but does not contain any point in P can be reported efficiently.
Revised:  The objective is to preprocess P such that given any arbitrary query point q, the location of the largest circle that does not contain any point in P can be reported efficiently.
Edit intent: clarity
Original:  The objective is to preprocess P  such that given any arbitrary query point q, the largest empty region of some desired shape that contains q but does not contain any point in P can be reported efficiently.
Revised:  The objective is to preprocess P such that given any arbitrary query point q, the largest empty region of some desired shape that contains q but does not contain any member of P, but contains q can be reported efficiently.
Edit intent: clarity
Original:  We consider only%DIFDELCMD < {\it %%% circle and%DIFDELCMD < {\it %%% axis-parallel rectangle as the desired shapes, and will refer to these problems as the largest query point enclosing empty circle (QMEC) problem and the largest query point enclosing empty rectangle (QMER) problem, respectively.
Revised:  %DIFDELCMD < {\it %%% circle and%DIFDELCMD < {\it %%% axis-parallel rectangle as the desired shapes, and will refer to these problems as the largest query point enclosing empty circle (QMEC) problem and the largest query point enclosing empty rectangle (QMER) problem, respectively.
Edit intent: coherence
Original:  We consider only%DIFDELCMD < {\it %%% circle and%DIFDELCMD < {\it %%% axis-parallel rectangle as the desired shapes, and will refer to these problems as the largest query point enclosing empty circle (QMEC) problem and the largest query point enclosing empty rectangle (QMER) problem, respectively.
Revised:  We consider only%DIFDELCMD < {\it %%% and%DIFDELCMD < {\it %%% axis-parallel rectangle as the desired shapes, and will refer to these problems as the largest query point enclosing empty circle (QMEC) problem and the largest query point enclosing empty rectangle (QMER) problem, respectively.
Edit intent: fluency
Original:  We consider only%DIFDELCMD < {\it %%% circle and%DIFDELCMD < {\it %%% axis-parallel rectangle as the desired shapes, and will refer to these problems as the largest query point enclosing empty circle (QMEC) problem and the largest query point enclosing empty rectangle (QMER) problem, respectively.
Revised:  We consider only%DIFDELCMD < {\it %%% circle %DIFDELCMD < {\it %%% axis-parallel rectangle as the desired shapes, and will refer to these problems as the largest query point enclosing empty circle (QMEC) problem and the largest query point enclosing empty rectangle (QMER) problem, respectively.
Edit intent: coherence
Original:  We consider only%DIFDELCMD < {\it %%% circle and%DIFDELCMD < {\it %%% axis-parallel rectangle as the desired shapes, and will refer to these problems as the largest query point enclosing empty circle (QMEC) problem and the largest query point enclosing empty rectangle (QMER) problem, respectively.
Revised:  We consider only%DIFDELCMD < {\it %%% circle and%DIFDELCMD < {\it %%% as the desired shapes, and will refer to these problems as the largest query point enclosing empty circle (QMEC) problem and the largest query point enclosing empty rectangle (QMER) problem, respectively.
Edit intent: clarity
Original:  For safety specifications and measures that are defined by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be done in polynomial time.
Revised:  For safety specifications and measures given by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be done in polynomial time.
Edit intent: clarity
Original:  We present some experimental results showing optimal systems that were automatically generated in this way.
Revised:  We present some experimental results showing optimal systems that were generated in this way.
Edit intent: clarity
Original:  We show how to build such index in O(n^{\sigma/\Delta(\sigma)}\log(n)) average time and space , where \Delta is the average size of the subsets.
Revised:  We show how to build such index in O(n^{\sigma/\Delta(\sigma)}\log(n)) average time , where \Delta is the average size of the subsets.
Edit intent: clarity
Original: The Wako-Sait\^o-Mu\~noz-Eaton } (WSME) model  initially introduced in the theory of protein folding can also model some epitaxial phenomena.
Revised: The Wako-Sait } (WSME) model initially introduced in the theory of protein folding can also model some epitaxial phenomena.
Edit intent: coherence
Original:  A shortcoming of the model is that it accounts only for interactions within contiguous stretches of native bonds or atomic chains while neglecting interstretch (interchain) interactions.
Revised:  However, a shortcoming of this model is that it accounts only for interactions within contiguous stretches of native bonds or atomic chains while neglecting interstretch (interchain) interactions.
Edit intent: coherence
Original:  But due to the protein (or atomic chain) flexibility, the residues (atoms) separated by several non-native bonds along the sequence can become very close in the real space which usually causes their strong interaction.
Revised:  But due to the protein (or atomic chain) flexibility, the residues (atoms) separated by several non-native bonds along the sequence can become closely spaced. This produces their strong interaction.
Edit intent: clarity
Original:  Thus, inclusion of non-WSME interactions into the model should make it more realistic and improve its performance.
Revised:  The inclusion of non-WSME interactions into the model should make it more realistic and improve its performance.
Edit intent: coherence
Original:  Thus, inclusion of non-WSME interactions into the model should make it more realistic and improve its performance.
Revised:  Thus, inclusion of non-WSME interactions into the model makes the model more realistic and improve its performance.
Edit intent: clarity
Original:  Thus, inclusion of non-WSME interactions into the model should make it more realistic and improve its performance.
Revised:  Thus, inclusion of non-WSME interactions into the model should make it more realistic and improves its performance.
Edit intent: fluency
Original:  In this paper we augment the WSME model by arbitrary interactions of finite range along the sequence and solve it with the use of a transfer matrix technique.
Revised:  In this study we add arbitrary interactions of finite range along the sequence and solve it with the use of a transfer matrix technique.
Edit intent: clarity
Original:  In this paper we augment the WSME model by arbitrary interactions of finite range along the sequence and solve it with the use of a transfer matrix technique.
Revised:  In this paper we augment the WSME model by arbitrary interactions of finite range and solve the new model by means of the transfer matrix technique.
Edit intent: clarity
Original:  Our method makes it possible to exactly account for the interaction radii along the polypeptide chain which in the proteomics are classified as the medium-range interactions.
Revised:  We can therefore exactly account for the interaction radii along the polypeptide chain which in the proteomics are classified as the medium-range interactions.
Edit intent: coherence
Original:  Our method makes it possible to exactly account for the interaction radii along the polypeptide chain which in the proteomics are classified as the medium-range interactions.
Revised:  Our method makes it possible to exactly account for the interactions with the radii along the polypeptide chain which in the proteomics are classified as the medium-range interactions.
Edit intent: clarity
Original:  Our method makes it possible to exactly account for the interaction radii along the polypeptide chain which in the proteomics are classified as the medium-range interactions.
Revised:  Our method makes it possible to exactly account for the interaction radii along the chain which in the proteomics are classified as the medium-range interactions.
Edit intent: clarity
Original:  However, a shortcoming of this model is that it accounts only for interactions within contiguous stretches of native bonds or atomic chains while neglecting interstretch (interchain) interactions.
Revised:  However, a shortcoming of the model is that it accounts only for interactions within contiguous stretches of native bonds or atomic chains while neglecting interstretch (interchain) interactions.
Edit intent: coherence
Original:  However, a shortcoming of this model is that it accounts only for interactions within contiguous stretches of native bonds or atomic chains while neglecting interstretch (interchain) interactions.
Revised:  However, a shortcoming of this model is that it accounts only for interactions within continuous stretches of native bonds or atomic chains while neglecting interstretch (interchain) interactions.
Edit intent: fluency