wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper we develop an analytical approach to study Quality of user Experience (QoE) for streaming by considering a MMFM ( Markov Modulated Fluid Model  ) that accurately approximates the queuing behaviour for network traffic exhibiting LRD ( Long Range Dependence ) behaviour.
Revised:  In this paper we develop an analytical approach to study Quality of user Experience (QoE) for streaming by considering a Markov Modulated Fluid Model ) that accurately approximates the queuing behaviour for network traffic exhibiting LRD ( Long Range Dependence ) behaviour.
Edit intent: clarity
Original:  In this paper we develop an analytical approach to study Quality of user Experience (QoE) for streaming by considering a MMFM ( Markov Modulated Fluid Model  ) that accurately approximates the queuing behaviour for network traffic exhibiting LRD ( Long Range Dependence ) behaviour.
Revised:  In this paper we develop an analytical approach to study Quality of user Experience (QoE) for streaming by considering a MMFM ( Markov Modulated Fluid Model (MMFM ) that accurately approximates the queuing behaviour for network traffic exhibiting LRD ( Long Range Dependence ) behaviour.
Edit intent: clarity
Original:  In this paper we develop an analytical approach to study Quality of user Experience (QoE) for streaming by considering a MMFM ( Markov Modulated Fluid Model  ) that accurately approximates the queuing behaviour for network traffic exhibiting LRD ( Long Range Dependence ) behaviour.
Revised:  In this paper we develop an analytical approach to study Quality of user Experience (QoE) for streaming by considering a MMFM ( Markov Modulated Fluid Model ) that accurately approximates the Long Range Dependence ) behaviour.
Edit intent: clarity
Original:  We compute the distribution of starvation as well as start-up delay using partial differential equation (PDEs) and solve them using the Laplace Transform.
Revised:  We compute the distribution of starvation as well as start-up delay using partial differential equations (PDEs) and solve them using the Laplace Transform.
Edit intent: fluency
Original:  We illustrate the results with the cases of the two-state Markov Modulated Fluid Model (MMFM) that is the most used in multimedia applications.
Revised:  We illustrate the results with the cases of the two-state Markov Modulated Fluid Model that is commonly used in multimedia applications.
Edit intent: clarity
Original:  Unlike  original measures, it is easily extendable for different cases, including overlapping clusters and clusters of inter-related data for complex networks.
Revised:  Unlike the original measures, it is easily extendable for different cases, including overlapping clusters and clusters of inter-related data for complex networks.
Edit intent: fluency
Original: The paper discusses the asymptotic gate complexity of the reversible circuits consisting of NOT, CNOT and 2-CNOT gates.
Revised: The paper discusses the gate complexity of the reversible circuits consisting of NOT, CNOT and 2-CNOT gates.
Edit intent: clarity
Original: The paper discusses the asymptotic gate complexity of the reversible circuits consisting of NOT, CNOT and 2-CNOT gates.
Revised: The paper discusses the asymptotic gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates.
Edit intent: fluency
Original:  Reversible circuit gate complexity function L(n, N) for circuit implementing some permutation from A(\colon \mathbb Z_2^n ) is introduced \to  as a function of n and the number of additional inputs N.
Revised:  Reversible circuit gate complexity function L(n, N) for circuit implementing some permutation from A(\colon \mathbb Z_2^n \to as a function of n and the number of additional inputs N.
Edit intent: coherence
Original:  with the reversible circuit having no additional inputs the gate complexity is bounded as n 2^{n-1 / \log_2 n }%DIFDELCMD < \lesssim %%%  L(n,0) %DIFDELCMD < \lesssim %%% 52n 2^n \leqslant (1+o(1)) \mathop } / \log_2n . It is proved that for the case of implementing permutation from A(\mathbb Z_2^n) with the reversible circuit having N_0 \sim n 2^{n- n/ \log_2 n of additional inputs the gate complexity is bounded as 2^{n-1} }%DIFDELCMD < \lesssim %%%  L(n, N _0) \lesssim 2^n  .
Revised:  with the reversible circuit having no additional inputs the gate complexity is bounded as n 2^{n-1 / \log_2 n }%DIFDELCMD < \lesssim %%% L(n,0) %DIFDELCMD < \lesssim %%% 52n 2^n \leqslant (1+o(1)) \mathop } / \log_2n . It is proved that for the case of implementing permutation from A(\mathbb Z_2^n) with the reversible circuit having N_0 \sim n 2^{n- n/ \log_2 n of additional inputs the gate complexity is bounded as 2^{n-1} }%DIFDELCMD < \lesssim %%% L(n, q _0) \lesssim 2^n .
Edit intent: fluency
Original:  In this paper, we continue the study for any fixed c by giving both a linear-vertex and a linear-edge kernel.
Revised:  In this paper, we extend the study to any fixed c by giving both a linear-vertex and a linear-edge kernel.
Edit intent: clarity
Original:  These results imply that for any fixed c\ge 2, (c,k)-LCP is FPT and that the optimization version of (c,k)-LCP (where k is  maximized) has an approximation algorithm with a constant ratio for any fixed c\ge 2.
Revised:  These results imply that for any fixed c\ge 2, (c,k)-LCP is FPT and that the optimization version of (c,k)-LCP (where k is to be maximized) has an approximation algorithm with a constant ratio for any fixed c\ge 2.
Edit intent: clarity
Original:  It is shown that the proposed model enjoys conjugacy , thus a Gibbs sampler is implemented for fixed dimension updates, while a reversible jump proposal is used for transdimensional transitions .
Revised:  It is shown that the proposed model enjoys conjugacy for fixed dimension updates, while a reversible jump proposal is used for transdimensional transitions .
Edit intent: clarity
Original: We consider the non-preemptive task scheduling problem with release times and deadlines on a single machine parameterized by the set of task lengths the tasks can have.
Revised: The non-preemptive task scheduling problem with release times and deadlines on a single machine parameterized by the set of task lengths the tasks can have.
Edit intent: coherence
Original: We consider the non-preemptive task scheduling problem with release times and deadlines on a single machine parameterized by the set of task lengths the tasks can have.
Revised: We consider the non-preemptive job scheduling problem with release times and deadlines on a single machine parameterized by the set of task lengths the tasks can have.
Edit intent: fluency
Original: We consider the non-preemptive task scheduling problem with release times and deadlines on a single machine parameterized by the set of task lengths the tasks can have.
Revised: We consider the non-preemptive task scheduling problem with release times and deadlines on a single machine parameterized by the set of job lengths the jobs can have.
Edit intent: fluency
Original:  The identical task lengths case is known to be solvable in polynomial time.
Revised:  The case where all job lengths are identical is known to be solvable in polynomial time.
Edit intent: clarity
Original:  We prove that the problem with two task lengths is NP-complete, except for the case in which the short jobs have unit task length, which was already known to be efficiently solvable  .
Revised:  We prove that the problem with two job lengths is NP-complete, except for the case in which the short jobs have unit task length, which was already known to be efficiently solvable .
Edit intent: fluency
Original:  We prove that the problem with two task lengths is NP-complete, except for the case in which the short jobs have unit task length, which was already known to be efficiently solvable  .
Revised:  We prove that the problem with two task lengths is NP-complete, except for the case in which the short jobs have unit job length, which was already known to be efficiently solvable .
Edit intent: fluency
Original:  We show that our formulation generalizes a number of label propagation algorithms described in the literature by allowing them to propagate generalized assumptions about influences between classes of neighboring nodes .
Revised:  We show that our formulation generalizes a number of label propagation algorithms by allowing them to propagate generalized assumptions about influences between classes of neighboring nodes .
Edit intent: clarity
Original:  For instance , we show that we can leverage the speech data to fine-tune the network trained for video recognition, given an initial set of audio-video parallel dataset within the same semantics.
Revised:  Specifically , we show that we can leverage the speech data to fine-tune the network trained for video recognition, given an initial set of audio-video parallel dataset within the same semantics.
Edit intent: coherence
Original:  For instance , we show that we can leverage the speech data to fine-tune the network trained for video recognition, given an initial set of audio-video parallel dataset within the same semantics.
Revised:  For instance , we show that we can leverage speech data to fine-tune the network trained for video recognition, given an initial set of audio-video parallel dataset within the same semantics.
Edit intent: fluency
Original:  Our approach  learns the analogy-preserving embeddings between the abstract representations learned from  each network, allowing for semantics-level transfer or reconstruction of the data among different modalities.
Revised:  Our approach first learns the analogy-preserving embeddings between the abstract representations learned from each network, allowing for semantics-level transfer or reconstruction of the data among different modalities.
Edit intent: clarity
Original:  While we mainly focus on applying transfer learning on the audio-visual recognition task as an application of our approach, our framework is flexible and thus can work with any multimodal datasets .
Revised:  While we present an audio-visual recognition task as an application of our approach, our framework is flexible and thus can work with any multimodal datasets .
Edit intent: clarity
Original:  In this work-in-progress report, we show our preliminary results on the AV-Letters dataset .
Revised:  In this work in progress report, we show our preliminary results on the AV-Letters dataset .
Edit intent: fluency
Original:  This program connects high school students and teachers in the Northeast US to regional university research labs and provides them with the opportunity to work on a year-long research project on network science , culminating in a formal presentation at a network science conference.
Revised:  This program connects high school students and teachers in the Northeast US to regional university research labs and provides them with the opportunity to work on a year-long network science research projects , culminating in a formal presentation at a network science conference.
Edit intent: fluency
Original:  This short paper reports the contents and materials we have developed to date, lessons learned from our experiences , and the future goals of this program .
Revised:  This short paper reports the content and materials that we have developed to date, lessons learned from our experiences , and the future goals of this program .
Edit intent: fluency
Original:  This short paper reports the contents and materials we have developed to date, lessons learned from our experiences , and the future goals of this program .
Revised:  This short paper reports the contents and materials we have developed to date, lessons learned from our experiences ; and the future goals of this program .
Edit intent: fluency
Original: We present several known formalizations of theorems from computational complexity in bounded arithmetic and formalize the PCP theorem in the theory PV_1 (no formalization of this theorem was known).
Revised: We present several known formalizations of theorems from computational complexity in bounded arithmetic and formalize the PCP theorem in the theory PV1 (no formalization of this theorem was known).
Edit intent: clarity
Original:  This includes a formalization of the existence and of some properties of the (n,d, \lambda )-graphs in PV_1 .
Revised:  This includes a formalization of the existence and of some properties of the (n,d, \lambda )-graphs in PV_1 .
Edit intent: fluency
Original:  This includes a formalization of the existence and of some properties of the (n,d, \lambda )-graphs in PV_1 .
Revised:  This includes a formalization of the existence and of some properties of the (n,d, \lambda )-graphs in PV1 .
Edit intent: clarity
Original:  P(x,y,z)=\partial P{\partial z}(x,y,z)=0), and generically its singularities are nodes (resp. nodes and ordinary cusp ).
Revised:  P(x,y,z)=\partial P{\partial z}(x,y,z)=0), and generically its singularities are nodes (resp. nodes and ordinary cusps ).
Edit intent: fluency
Original:  We solve this problem by  providing a square deflation system  that can be used to certify numerically whether B contains a singularity p . Then we introduce a numeric adaptive separation criterion based on interval arithmetic to ensure that the topology of \mathcal C in B is homeomorphic to the local topology at p  .
Revised:  We solve this problem by first providing a square deflation system that can be used to certify numerically whether B contains a singularity p . Then we introduce a numeric adaptive separation criterion based on interval arithmetic to ensure that the topology of \mathcal C in B is homeomorphic to the local topology at p .
Edit intent: coherence
Original: Let P_1,...,P\dots _{d+1}\subset R^d be d-dimensional point setssuch that the convex hull of each P_i contains the origin .
Revised: Let P_1,...,P\dots _{d+1}\subset R^d be d+1 point sets, each containing the origin in its convex hull .
Edit intent: clarity
Original:  We call the sets P_i color classes, and we think of the points in P_i as having color i . A colorful choiceis a set with at most one point of each color\dots with p_i \in C_i, for i = 1, }\dots .
Revised:  We call these sets color classes, and we think of the points in P_i as having color i . A colorful choiceis a set with at most one point of each color\dots with p_i \in C_i, for i = 1, }\dots .
Edit intent: fluency
Original:  The colorful Caratheodory theorem guarantees the existence of a colorful choice whose convex hull contains the origin .
Revised:  The colorful Carath\'eodory theorem guarantees the existence of a colorful choice whose convex hull contains the origin .
Edit intent: fluency
Original:  The colorful Caratheodory theorem guarantees the existence of a colorful choice whose convex hull contains the origin .
Revised:  The colorful Caratheodory theorem guarantees the existence of a colorful choice that also contains the origin .
Edit intent: clarity
Original:  We show that for any constant \varepsilon > 0,  an \lceil \varepsilon(d+1) \rceil-colorful choice containing the origin in its convex hull can be found in polynomial time.
Revised:  We show that for any fixed \varepsilon > 0, an \lceil \varepsilon(d+1) \rceil-colorful choice containing the origin in its convex hull can be found in polynomial time.
Edit intent: clarity
Original:  We show that for any constant \varepsilon > 0,  an \lceil \varepsilon(d+1) \rceil-colorful choice containing the origin in its convex hull can be found in polynomial time.
Revised:  We show that for any constant \varepsilon > 0, an \lceil \varepsilon(d+1) \rceil-colorful choice containing the origin in its convex hull in polynomial time.
Edit intent: clarity
Original:  In the second part, we present a natural generalization of the colorful Caratheodory problem : in the Nearest Colorful Polytope problem (NCP), we are given sets P_1,...,P\dots _n\subset\mathbb{R}^d that do not necessarily contain the origin in their convex hulls.
Revised:  In the second part, we present a natural generalization of the colorful Caratheodory problem : in the nearest colorful polytope problem (NCP), we are given sets P_1,...,P\dots _n\subset\mathbb{R}^d that do not necessarily contain the origin in their convex hulls.
Edit intent: fluency
Original:  We show that computing local optima for the NCP problem is PLS-complete, while computing a global optimum is NP-hard.
Revised:  We show that computing a local optimum for NCP is PLS-complete, while computing a global optimum is NP-hard.
Edit intent: clarity
Original: The heterogeneity of reaction fluxes present in metabolic networks can be exploited to construct disparity backbones as reduced version of metabolism.
Revised: The heterogeneity of reaction fluxes present in metabolic networks can be exploited to construct disparity backbones as reduced versions of metabolism.
Edit intent: fluency
Original:  Here, we apply the disparity filter method based on a high-flux fluctuation analysis to extract the metabolic backbones of two bacterial organisms, Escherichia coli and Mycoplasma pneumoniae, using computationally predicted fluxes that maximize their growth rate .
Revised:  Here, we disclose the metabolic backbone of Escherichia coli using computationally predicted fluxes that maximize their growth rate .
Edit intent: clarity
Original:  We find that the metabolic backbones of both organisms in minimal medium are mainly composed of a core of reactions belonging to ancient pathways, meaning that reactions in the early stages of the life of the organisms still remain at present significant for biomass production.
Revised:  We find that the core of both backbones are mainly composed of a core of reactions belonging to ancient pathways, meaning that reactions in the early stages of the life of the organisms still remain at present significant for biomass production.
Edit intent: clarity
Original:  We find that the metabolic backbones of both organisms in minimal medium are mainly composed of a core of reactions belonging to ancient pathways, meaning that reactions in the early stages of the life of the organisms still remain at present significant for biomass production.
Revised:  We find that the metabolic backbones of both organisms in minimal medium are mainly composed of reactions in ancient pathways, meaning that reactions in the early stages of the life of the organisms still remain at present significant for biomass production.
Edit intent: clarity
Original:  We find that the metabolic backbones of both organisms in minimal medium are mainly composed of a core of reactions belonging to ancient pathways, meaning that reactions in the early stages of the life of the organisms still remain at present significant for biomass production.
Revised:  We find that the metabolic backbones of both organisms in minimal medium are mainly composed of a core of reactions belonging to ancient pathways, meaning that those reactions still remain at present significant for biomass production.
Edit intent: clarity
Original:  Backbones, as networks of metabolic flux superhighways , are thus useful to trace simultaneously both long-term evolution and short-term adaptation fingerprints in cell metabolism.
Revised:  Backbones, as networks of metabolic flux superhighways , are thus useful to trace simultaneously both evolution and adaptation fingerprints in cell metabolism.
Edit intent: clarity
Original: The heterogeneity of reaction fluxes present in metabolic networks can be exploited to construct  high-flux fluctuation backbones as reduced versions of metabolism.
Revised: The heterogeneity of reaction fluxes present in a metabolic network can be exploited to construct high-flux fluctuation backbones as reduced versions of metabolism.
Edit intent: fluency
Original: The heterogeneity of reaction fluxes present in metabolic networks can be exploited to construct  high-flux fluctuation backbones as reduced versions of metabolism.
Revised: The heterogeneity of reaction fluxes present in metabolic networks can be exploited to construct the high-flux fluctuation backbones as reduced versions of metabolism.
Edit intent: fluency
Original: The heterogeneity of reaction fluxes present in metabolic networks can be exploited to construct  high-flux fluctuation backbones as reduced versions of metabolism.
Revised: The heterogeneity of reaction fluxes present in metabolic networks can be exploited to construct high-flux fluctuation backbone as a reduced version of metabolism.
Edit intent: fluency
Original:  These backbones maintain all relevant information while displaying a substantially decreased number of interconnections and, hence, they become a useful tool to extract main metabolic highways and so to unveil important biological information.
Revised:  The backbone maintains all relevant information while displaying a substantially decreased number of interconnections and, hence, they become a useful tool to extract main metabolic highways and so to unveil important biological information.
Edit intent: fluency
Original:  These backbones maintain all relevant information while displaying a substantially decreased number of interconnections and, hence, they become a useful tool to extract main metabolic highways and so to unveil important biological information.
Revised:  These backbones maintain all relevant information while displaying a substantially decreased number of interconnections and, hence, it becomes a useful tool to extract main metabolic highways and so to unveil important biological information.
Edit intent: coherence
Original:  These backbones maintain all relevant information while displaying a substantially decreased number of interconnections and, hence, they become a useful tool to extract main metabolic highways and so to unveil important biological information.
Revised:  These backbones maintain all relevant information while displaying a substantially decreased number of interconnections and, hence, they become a useful tool to extract relevant metabolic routes which unveil important biological information.
Edit intent: clarity
Original:  Here, we disclose the metabolic backbone of Escherichia coli using  computationally predicted fluxes that maximize the growth rate in glucose  medium, and we contrast it with the backbone of Mycoplasma pneumoniae, a much simpler organism.
Revised:  Here, we disclose the metabolic backbone of Escherichia coli using the computationally predicted fluxes that maximize the growth rate in glucose medium, and we contrast it with the backbone of Mycoplasma pneumoniae, a much simpler organism.
Edit intent: fluency
Original:  Here, we disclose the metabolic backbone of Escherichia coli using  computationally predicted fluxes that maximize the growth rate in glucose  medium, and we contrast it with the backbone of Mycoplasma pneumoniae, a much simpler organism.
Revised:  Here, we disclose the metabolic backbone of Escherichia coli using computationally predicted fluxes which maximize the growth rate in glucose medium, and we contrast it with the backbone of Mycoplasma pneumoniae, a much simpler organism.
Edit intent: fluency
Original:  At the same time, a comparative analysis of  E. coli backbones in different media leads to the identification of pathways sensitive to environmental changes.
Revised:  At the same time, a comparative analysis of E. coli in different media leads to the identification of pathways sensitive to environmental changes.
Edit intent: clarity
Original:  Backbones, as networks of metabolites connected by the most relevant fluxes, are thus useful to trace simultaneously both  evolution and adaptation fingerprints in cell metabolism .
Revised:  The metabolic backbone of an organism, as a network of metabolites connected by the most relevant fluxes, are thus useful to trace simultaneously both evolution and adaptation fingerprints in cell metabolism .
Edit intent: clarity
Original:  Backbones, as networks of metabolites connected by the most relevant fluxes, are thus useful to trace simultaneously both  evolution and adaptation fingerprints in cell metabolism .
Revised:  Backbones, as networks of metabolites connected by the most relevant fluxes, is thus useful to trace simultaneously both evolution and adaptation fingerprints in cell metabolism .
Edit intent: fluency