wanyu/IteraTeR_v2 huggingface dataset:
Original: While DataBase Management Systems (DBMSs) are highly optimized, interactions across the Programming Language (PL) / DBMS boundary are costly, even for in-process embedded DBMSs. In this paper  we show that programs that interact with the widely-used embedded DBMS SQLite can be significantly optimized - by a factor of 3.4 in our benchmarks - by inlining across the PL / DBMS boundary.
Revised: While database management systems (DBMSs) are highly optimized, interactions across the Programming Language (PL) / DBMS boundary are costly, even for in-process embedded DBMSs. In this paper we show that programs that interact with the widely-used embedded DBMS SQLite can be significantly optimized - by a factor of 3.4 in our benchmarks - by inlining across the PL / DBMS boundary.
Edit intent: clarity
Original: While DataBase Management Systems (DBMSs) are highly optimized, interactions across the Programming Language (PL) / DBMS boundary are costly, even for in-process embedded DBMSs. In this paper  we show that programs that interact with the widely-used embedded DBMS SQLite can be significantly optimized - by a factor of 3.4 in our benchmarks - by inlining across the PL / DBMS boundary.
Revised: While DataBase Management Systems (DBMSs) are highly optimized, interactions across the boundary between the programming language (PL) / DBMS boundary are costly, even for in-process embedded DBMSs. In this paper we show that programs that interact with the widely-used embedded DBMS SQLite can be significantly optimized - by a factor of 3.4 in our benchmarks - by inlining across the PL / DBMS boundary.
Edit intent: clarity
Original: While DataBase Management Systems (DBMSs) are highly optimized, interactions across the Programming Language (PL) / DBMS boundary are costly, even for in-process embedded DBMSs. In this paper  we show that programs that interact with the widely-used embedded DBMS SQLite can be significantly optimized - by a factor of 3.4 in our benchmarks - by inlining across the PL / DBMS boundary.
Revised: While DataBase Management Systems (DBMSs) are highly optimized, interactions across the Programming Language (PL) and the DBMS are costly, even for in-process embedded DBMSs. In this paper we show that programs that interact with the widely-used embedded DBMS SQLite can be significantly optimized - by a factor of 3.4 in our benchmarks - by inlining across the PL / DBMS boundary.
Edit intent: clarity
Original: While DataBase Management Systems (DBMSs) are highly optimized, interactions across the Programming Language (PL) / DBMS boundary are costly, even for in-process embedded DBMSs. In this paper  we show that programs that interact with the widely-used embedded DBMS SQLite can be significantly optimized - by a factor of 3.4 in our benchmarks - by inlining across the PL / DBMS boundary.
Revised: While DataBase Management Systems (DBMSs) are highly optimized, interactions across the Programming Language (PL) / DBMS boundary are costly, even for in-process embedded DBMSs. In this paper , we show that programs that interact with the widely-used embedded DBMS SQLite can be significantly optimized - by a factor of 3.4 in our benchmarks - by inlining across the PL / DBMS boundary.
Edit intent: fluency
Original: While DataBase Management Systems (DBMSs) are highly optimized, interactions across the Programming Language (PL) / DBMS boundary are costly, even for in-process embedded DBMSs. In this paper  we show that programs that interact with the widely-used embedded DBMS SQLite can be significantly optimized - by a factor of 3.4 in our benchmarks - by inlining across the PL / DBMS boundary.
Revised: While DataBase Management Systems (DBMSs) are highly optimized, interactions across the Programming Language (PL) / DBMS boundary are costly, even for in-process embedded DBMSs. In this paper we show that programs that interact with the popular embedded DBMS SQLite can be significantly optimized - by a factor of 3.4 in our benchmarks - by inlining across the PL / DBMS boundary.
Edit intent: clarity
Original:  We achieved this speed-up by replacing parts of SQLite's C interpreter with RPython code and composing the resulting meta-tracing VM - called SQPyte - with the PyPy VM.
Revised:  We achieved this speed-up by replacing parts of SQLite's C interpreter with RPython code and composing the resulting meta-tracing virtual machine (VM) - called SQPyte - with the PyPy VM.
Edit intent: clarity
Original:  SQPyte does not compromise stand-alone SQL performance : it is 2.2\% faster than SQLite on the widely used TPC-H benchmark suite.
Revised:  SQPyte does not compromise stand-alone SQL performance and is 2.2\% faster than SQLite on the widely used TPC-H benchmark suite.
Edit intent: coherence
Original:  The implications are serious, from a person who exposes  his private information to an unknown third party entity, without any knowledge, to a company that is unable to control the flow of its information to the outside world.
Revised:  The implications are serious, from a person who exposes his private information to an unknown third party entity, to a company that is unable to control the flow of its information to the outside world.
Edit intent: clarity
Original:  The implications are serious, from a person who exposes  his private information to an unknown third party entity, without any knowledge, to a company that is unable to control the flow of its information to the outside world.
Revised:  The implications are serious, from a person who exposes his private information to an unknown third party entity, without any knowledge, to a company that is unable to control its information to the outside world.
Edit intent: clarity
Original: In decentralized supervisory control, several local control agents (supervisors ) cooperate to achieve a common goal expressed by a safety specificationand/or nonblockingness.
Revised: In decentralized supervisory control, several local supervisors cooperate to accomplish a common goal expressed by a safety specificationand/or nonblockingness.
Edit intent: clarity
Original:  One of the most important problems is thus to compute a coobservable sublanguage of the specification .
Revised:  We construct a controllable and coobservable sublanguage of the specification .
Edit intent: clarity
Original:  Namely, we extend the observable events of local supervisors via communication and apply a fully decentralized computation of local supervisors.
Revised:  Namely, we extend observable events of local supervisors via communication and apply a fully decentralized computation of local supervisors.
Edit intent: fluency
Original:  We also discuss sufficient conditions to achieve the centralized optimal solution  .
Revised:  Sufficient conditions to achieve the centralized optimal solution .
Edit intent: coherence
Original:  We also discuss sufficient conditions to achieve the centralized optimal solution  .
Revised:  We also discuss sufficient conditions to achieve the centralized optimal solution are discussed .
Edit intent: coherence
Original:  The empirical spectral distribution of A_n denoted by F_n(\cdot) is the empirical measure putting a mass 1/n at each of the n real eigenvalues of the symmetric matrix A_n. Under some technical conditions on the expected degrees sequence, we show that with probability one, F_n(\cdot) converges weakly to a deterministic distribution F(\cdot).
Revised:  The empirical spectral distribution of A_n denoted by F_n(\cdot) is the empirical measure putting a mass 1/n at each of the n real eigenvalues of the symmetric matrix A_n. Under some technical conditions on the expected degree sequence, we show that with probability one, F_n(\cdot) converges weakly to a deterministic distribution F(\cdot).
Edit intent: fluency
Original:  This model , albeit computationally efficient, does not support many real-world problems that require result tuples to satisfy constraints collectively, rather than individually.
Revised:  This model is computationally efficient, does not support many real-world problems that require result tuples to satisfy constraints collectively, rather than individually.
Edit intent: clarity
Original:  This model , albeit computationally efficient, does not support many real-world problems that require result tuples to satisfy constraints collectively, rather than individually.
Revised:  This model , albeit computationally efficient, does not support many real-world problems require a collection of result tuples to satisfy constraints collectively, rather than individually.
Edit intent: clarity
Original:  Second, we present a fundamental evaluation strategy that combines the capabilities of databases and constrain optimization solvers to derive solutions to package queries.
Revised:  Second, we present a fundamental evaluation strategy that combines the capabilities of databases and constraint optimization solvers to derive solutions to package queries.
Edit intent: fluency
Original:  Because embryogenesis deeply questions our understanding of the mechanisms of life, it has motivated many scientific theories and ideologies over the course of history.
Revised:  Because embryogenesis deeply questions our understanding of the mechanisms of life, it has motivated many scientific theories and philosophies over the course of history.
Edit intent: clarity
Original:  In the early 20th century, St\'ephane Leduc proposed that biology was merely a subset of fluid physics, and argued that biology should focus on how forces act on living matter.
Revised:  In the early 20th century, Stephane Leduc proposed that biology was merely a subset of fluid physics, and argued that biology should focus on how forces act on living matter.
Edit intent: fluency
Original:  Rejecting vitalism and life-specific approaches, he designed na\"ive experiments based on osmosis and diffusion to mimic shapes and phenomena found in living systems, in order to identify physical mechanisms that could support the development of the embryo.
Revised:  Rejecting vitalism and life-specific approaches, he designed naive experiments based on osmosis and diffusion to mimic shapes and phenomena found in living systems, in order to identify physical mechanisms that could support the development of the embryo.
Edit intent: fluency
Original:  In this article I give an overview of St\'ephane Leduc's physical approach to life, and show that the paradigm that he introduced, although long forsaken, becomes more and more topical today, as developmental biology increasingly turns to physics and self-organization theories to study the mechanisms of embryogenesis.
Revised:  In this article I give an overview of Stephane Leduc's physical approach to life, and show that the paradigm that he introduced, although long forsaken, becomes more and more topical today, as developmental biology increasingly turns to physics and self-organization theories to study the mechanisms of embryogenesis.
Edit intent: fluency
Original:  However, in most cases the proposals provide only qualitative arguments for their improved support of flexibility.
Revised:  However, most proposals provide only qualitative arguments for their improved support of flexibility.
Edit intent: clarity
Original:  For networks, flexibility would refer to the ability to adapt the available network resources  to changes of design requirements, e.g., lower latency budgets or different traffic distribution.
Revised:  For networks, flexibility would refer to the ability to adapt the available network resources to changes of design requirements, e.g., shorter latency budgets or different traffic distribution.
Edit intent: clarity
Original:  Recently, new concepts such as Software Defined Networking and Network (Function ) Virtualization have emerged claiming to provide more flexibility in networks.
Revised:  Recently, new concepts such as Software Defined Networking , Network Virtualization and Network Function Virtualization have emerged claiming to provide more flexibility in networks.
Edit intent: fluency
Original:  Nevertheless, a deeper understanding of what flexibility means and how it could be quantified to compare different network design choices remains open.
Revised:  Nevertheless, a deeper understanding of what flexibility means and how it could be quantified to compare different network designs remains open.
Edit intent: clarity
Original:  In this paper, we raise the question whether flexibility will be a new measure for network design space analysis.
Revised:  In this paper, we ask whether flexibility can be a new measure for network design space analysis.
Edit intent: clarity
Original:  It is quite challenging to formulate a flexibility measure that covers all network aspects, however we propose an initial set of flexibility aspects to start grounding guidelines for a flexibility measure.
Revised:  It is quite challenging to formulate a flexibility measure that covers all network aspects, we propose an initial set of flexibility aspects to start grounding guidelines for a flexibility measure.
Edit intent: coherence
Original:  Our initial selection of flexibility aspects is backed up by an analysis of Software Defined Networking, Network Virtualization and Network Function Virtualization for their support of the selected flexibility aspects vs. induced cost .
Revised:  Our initial selection is backed up by an analysis of Software Defined Networking, Network Virtualization and Network Function Virtualization for their support of the selected flexibility aspects vs. induced cost .
Edit intent: clarity
Original:  Here, some recent mathematical results about persistence and coexistence for models accounting for each form of stochasticity are reviewed .
Revised:  Here, some recent mathematical results about persistence and coexistence for models accounting for each of these forms of stochasticity .
Edit intent: clarity
Original:  Demographic stochasticity stems from populations and communities consisting of a finite number of interacting individuals, and can be represented by Markovian models with a countable number of states.
Revised:  Demographic stochasticity stems from populations consisting of a finite number of interacting individuals, and can be represented by Markovian models with a countable number of states.
Edit intent: clarity
Original:  Demographic stochasticity stems from populations and communities consisting of a finite number of interacting individuals, and can be represented by Markovian models with a countable number of states.
Revised:  Demographic stochasticity stems from populations and communities consisting of a finite number of interacting individuals, and often are represented by Markovian models with a countable number of states.
Edit intent: clarity
Original:  Under suitable large deviation assumptions and sufficiently large " system sizes", QSDs are shown to concentrate on the positive attractors of deterministic models.
Revised:  For sufficiently large " system sizes", QSDs are shown to concentrate on the positive attractors of deterministic models.
Edit intent: clarity
Original:  Under suitable large deviation assumptions and sufficiently large " system sizes", QSDs are shown to concentrate on the positive attractors of deterministic models.
Revised:  Under suitable large deviation assumptions and sufficiently large " habitat sizes", QSDs are shown to concentrate on the positive attractors of deterministic models.
Edit intent: fluency
Original:  Moreover, the probability extinction decreases exponentially with system size.
Revised:  Moreover, the probability extinction decreases exponentially with habitat size.
Edit intent: clarity
Original:  The main results are illustrated with stochastic counterparts of classical ecological models.
Revised:  The results are illustrated with stochastic counterparts of classical ecological models.
Edit intent: clarity
Original: Over the past century, nonlinear difference and differential equations have been used to understand conditions for coexistence of interacting populations .
Revised: Over the past century, nonlinear difference and differential equations have been used to understand conditions for species coexistence .
Edit intent: clarity
Original:  I review  recent mathematical results about persistence and coexistence for models accounting for each of these forms of stochasticity.
Revised:  I review some recent mathematical results about persistence and coexistence for models accounting for each of these forms of stochasticity.
Edit intent: clarity
Original:  Demographic stochasticity stems from populations  consisting of a finite number of interacting individuals, and often are represented by Markovian models with a countable number of states.
Revised:  Demographic stochasticity stems from populations and communities consisting of a finite number of interacting individuals, and often are represented by Markovian models with a countable number of states.
Edit intent: clarity
Original:  The results are illustrated with the dynamics of Bay checkerspot butterflies, the persistence of coupled sink populations, coexistence of competitors through the storage effect, and stochastic rock-paper-scissor communities.
Revised:  The results are illustrated with Bay checkerspot butterflies, the persistence of coupled sink populations, coexistence of competitors through the storage effect, and stochastic rock-paper-scissor communities.
Edit intent: clarity
Original:  The results are illustrated with the dynamics of Bay checkerspot butterflies, the persistence of coupled sink populations, coexistence of competitors through the storage effect, and stochastic rock-paper-scissor communities.
Revised:  The results are illustrated with the dynamics of Bay checkerspot butterflies, coupled sink populations, coexistence of competitors through the storage effect, and stochastic rock-paper-scissor communities.
Edit intent: clarity
Original:  The results are illustrated with the dynamics of Bay checkerspot butterflies, the persistence of coupled sink populations, coexistence of competitors through the storage effect, and stochastic rock-paper-scissor communities.
Revised:  The results are illustrated with the dynamics of Bay checkerspot butterflies, the persistence of coupled sink populations, the storage effect, and stochastic rock-paper-scissor communities.
Edit intent: clarity
Original:  The quantum protocol can improve the privacy level preserved by known classical protocols and at the same time it can  reduce the computational complexity and /or communication cost.
Revised:  The quantum protocol can improve the privacy level preserved by known classical protocols and at the same time it can reduce the computational complexity and communication cost.
Edit intent: coherence
Original: For a fixed graph F, we study the parameterized complexity of a variant of the F-Free Editing problem: Given a graph G and a natural number k, is it possible to modify at most k edges in G so that the resulting graph contains no induced subgraph isomorphic to F?
Revised: We study the parameterized complexity of a variant of the F-Free Editing problem: Given a graph G and a natural number k, is it possible to modify at most k edges in G so that the resulting graph contains no induced subgraph isomorphic to F?
Edit intent: clarity
Original: For a fixed graph F, we study the parameterized complexity of a variant of the F-Free Editing problem: Given a graph G and a natural number k, is it possible to modify at most k edges in G so that the resulting graph contains no induced subgraph isomorphic to F?
Revised: For a fixed graph F, we study the parameterized complexity of a variant of the F-free Editing problem: Given a graph G and a natural number k, is it possible to modify at most k edges in G so that the resulting graph contains no induced subgraph isomorphic to F?
Edit intent: fluency
Original:  While earlier works used the number k as parameter or structural parameters of the input graph G, we consider  the parameter \ell:=k-h(H) instead , that is, the number of edge modifications above the lower bound h(H).
Revised:  While earlier works used the number k as parameter or structural parameters of the input graph G, we consider instead the parameter \ell:=k-h(H) instead , that is, the number of edge modifications above the lower bound h(H).
Edit intent: fluency
Original:  While earlier works used the number k as parameter or structural parameters of the input graph G, we consider  the parameter \ell:=k-h(H) instead , that is, the number of edge modifications above the lower bound h(H).
Revised:  While earlier works used the number k as parameter or structural parameters of the input graph G, we consider the parameter \ell:=k-h(H) , that is, the number of edge modifications above the lower bound h(H).
Edit intent: coherence
Original: Advances in CMOS-compatible photonic elements have made it plausible to exploit nanophotonic communication to overcome the limitations of traditional NoCs.
Revised: Advances in CMOS-compatible photonic elements have made it plausible to exploit nanophotonic communications to overcome the limitations of traditional NoCs.
Edit intent: fluency
Original:  Amongst the architectures proposed to exploit nanophotonic technology for on-chip communication networks , optical crossbars have been shown to provide high performance in terms of bandwidth and latency.
Revised:  Amongst various proposed nanophotonic architectures , optical crossbars have been shown to provide high performance in terms of bandwidth and latency.
Edit intent: clarity
Original:  Generally , optical crossbars provide a huge volume of network resources that are shared among cores .
Revised:  In general , optical crossbars provide a huge volume of network resources that are shared among cores .
Edit intent: fluency
Original:  Generally , optical crossbars provide a huge volume of network resources that are shared among cores .
Revised:  Generally , optical crossbars provide a vast volume of network resources that are shared among cores .
Edit intent: fluency
Original:  Generally , optical crossbars provide a huge volume of network resources that are shared among cores .
Revised:  Generally , optical crossbars provide a huge volume of network resources that are shared among all the cores within the chip .
Edit intent: clarity
Original:  In this paper, we present a fair and efficient admission control mechanism for shared wavelengths and buffer space in an optical crossbar .
Revised:  In this paper, we present a fair and efficient admission control mechanism for shared wavelengths and buffer space in optical crossbars .
Edit intent: fluency
Original:  We model the buffer management and wavelength assignment as a utility-based convex optimization problem, whose solution determines the admission control policy.
Revised:  We model buffer management and wavelength assignment as a utility-based convex optimization problem, whose solution determines the admission control policy.
Edit intent: fluency
Original:  Thanks to efficient convex optimization techniques, we obtain the globally optimal solution of the admission control optimization problem  using simple and yet efficient iterative algorithms.
Revised:  Thanks to efficient convex optimization techniques, we obtain the globally optimal solution of the admission control optimization problem by using simple and yet efficient iterative algorithms.
Edit intent: coherence
Original:  Then, we cast our solution procedure as an iterative algorithm to be implemented inside a central admission controller.
Revised:  We cast our solution procedure as an iterative algorithm to be implemented inside a central admission controller.
Edit intent: coherence
Original:  Then, we cast our solution procedure as an iterative algorithm to be implemented inside a central admission controller.
Revised:  Then, we cast our solution procedure as an iterative algorithm to be implemented a central admission controller.
Edit intent: clarity
Original:  Our experimental results corroborate the efficacy of using such an admission controller to manage the shared resources of the system.
Revised:  Our experimental results corroborate the gain that can be obtained by using such an admission controller to manage the shared resources of the system.
Edit intent: clarity