wanyu/IteraTeR_v2 huggingface dataset:
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, are thus useful to trace simultaneously both its 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, are thus useful to trace simultaneously both evolution and adaptation fingerprints .
Edit intent: clarity
Original: The heterogeneity of reaction fluxes present in a metabolic network  can be exploited to construct the high-flux fluctuation backbone as a reduced version of metabolism.
Revised: The heterogeneity of reaction fluxes present in a metabolic network can be exploited to construct the so-called backbone as a reduced version of metabolism.
Edit intent: clarity
Original:  The backbone maintains all relevant information while displaying a substantially decreased number of interconnections and, hence, it becomes a useful tool to extract relevant metabolic routeswhich unveil important biological information .
Revised:  The backbone maintains all relevant information while displaying a substantially decreased number of interconnections and, hence, it becomes a useful tool to extract primary metabolic routes .
Edit intent: clarity
Original:  Here, we disclose the metabolic backbone of Escherichia coli using the computationally predicted fluxes which maximize the growth rate in glucose minimal 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 which maximize the growth rate in glucose minimal medium, and we compare it with the backbone of Mycoplasma pneumoniae, a much simpler organism.
Edit intent: fluency
Original:  We find that the core of both backbones are mainly composed of reactions in ancient pathways, meaning that those reactions still retain at present the central role in the evolved metabolism.
Revised:  We find that the central core in both backbones is mainly composed of reactions in ancient pathways, meaning that those reactions still retain at present the central role in the evolved metabolism.
Edit intent: fluency
Original:  We find that the core of both backbones are mainly composed of reactions in ancient pathways, meaning that those reactions still retain at present the central role in the evolved metabolism.
Revised:  We find that the core of both backbones are mainly composed of reactions in ancient pathways, still playing at present a key role in energy metabolism.
Edit intent: clarity
Original:  In E. coli, the analysis of the core reveals a dominant direction with the synthesis of purines and pyrimidines and the metabolism of lipids ensuing after energy metabolism .
Revised:  In E. coli, the analysis of the backbone reveals that the synthesis of purines and pyrimidines and the metabolism of lipids ensuing after energy metabolism .
Edit intent: clarity
Original:  At the same time, a comparative analysis of the backbone of E. coli in different media leads to the identification of pathways sensitive to environmental changes.
Revised:  At the same time, an analysis of the backbone of E. coli in different media leads to the identification of pathways sensitive to environmental changes.
Edit intent: clarity
Original:  At the same time, a comparative analysis of the backbone of E. coli in different media leads to the identification of pathways sensitive to environmental changes.
Revised:  At the same time, a comparative analysis of the dependence of this backbone on media composition leads to the identification of pathways sensitive to environmental changes.
Edit intent: clarity
Original:  The metabolic backbone of an organism , as a network of metabolites connected by the most relevant fluxes, is thus useful to trace simultaneously both its evolution and adaptation fingerprints.
Revised:  The metabolic backbone of an organism is thus useful to trace simultaneously both its evolution and adaptation fingerprints.
Edit intent: clarity
Original:  Our perturbative analysis can be used to show the bump position evolves as a multivariate Ornstein-Uhlenbeck process whose relaxation constants are determined by the shape of the input.
Revised:  Perturbative analysis shows the bump position evolves as a multivariate Ornstein-Uhlenbeck process whose relaxation constants are determined by the shape of the input.
Edit intent: clarity
Original:  Our analytical approximations all compare well to statistics of bump motion we compute from numerical simulations.
Revised:  Our analytical approximations all compare well to statistics of bump motion in numerical simulations.
Edit intent: clarity
Original:  Our algorithm consists in a reduction of the problem to the univariate case on the one hand and to the irreducible factorization of multivariate low-degree polynomials on the other hand , which is valid for any field of zero characteristic  .
Revised:  Our algorithm , which is valid for any field of zero characteristic .
Edit intent: coherence
Original:  The proof of correctness and the complexity bounds rely on the valuations of certain formal power series with rational exponents, called Puiseux series, and on considerations on the Newton polytope of the polynomial  .
Revised:  The proof of correctness and the complexity bounds rely on the Newton polytope of the polynomial .
Edit intent: clarity
Original:  Fast forwarding by frame sampling is a natural choice for faster video browsing.
Revised:  Fast forwarding (i.e. frame sampling) is a natural choice for faster video browsing.
Edit intent: clarity
Original:  However, in egocentric videos the shake introduced by natural head motion gets accentuated , making the fast forwarded video useless.
Revised:  However, this accentuates the shake caused by natural head motion gets accentuated , making the fast forwarded video useless.
Edit intent: clarity
Original:  However, in egocentric videos the shake introduced by natural head motion gets accentuated , making the fast forwarded video useless.
Revised:  However, in egocentric videos the shake introduced by natural head motion , making the fast forwarded video useless.
Edit intent: clarity
Original:  We propose EgoSampling, a novel approach for frame sampling which enables a more stable fast forward for egocentric videos.
Revised:  We propose EgoSampling, an adaptive frame sampling that gives more stable fast forward for egocentric videos.
Edit intent: clarity
Original:  Frame sampling is formulated as an energy minimizationproblem , whose optimal solution can be found in polynomial time.
Revised:  Frame sampling is formulated as energy minimization , whose optimal solution can be found in polynomial time.
Edit intent: fluency
Original:  Egocentric video taken while walking suffers from the left-right movement of the head as the body weight shifts from one leg to another.
Revised:  In addition, egocentric video taken while walking suffers from the left-right movement of the head as the body weight shifts from one leg to another.
Edit intent: coherence
Original:  We show that this drawback can be turned into a feature: Stereo video can be created by sampling the frames from the left most and right most head positions of each step, forming approximate stereo-pairs.
Revised:  We turn this drawback into a feature: Stereo video can be created by sampling the frames from the left most and right most head positions of each step, forming approximate stereo-pairs.
Edit intent: coherence
Original:  We investigate decidability and complexity issues of the logic and prove NP-hardness of the entailment problem  .
Revised:  We investigate decidability and complexity issues of the logic and prove that the entailment problem .
Edit intent: clarity
Original: We present a novel bit-parallel representation  of the nondeterministic KMP and suffix automata for a string P , based on the run-length encoding .
Revised: We present a novel bit-parallel representation , based on the run-length encoding, of the nondeterministic KMP and suffix automata for a string P , based on the run-length encoding .
Edit intent: fluency
Original:  Examples are the Linked Open Data cloud , the RDFaand Microformats data increasingly being embedded in  ordinary Web pages, or the schema.org initiative.
Revised:  Examples are the Linked Open Data cloud , the RDFaand Microformats data increasingly being embedded in ordinary Web pages, and with initiatives such as schema.org initiative.
Edit intent: coherence
Original:  Further, we generalize the results to partitions: every partition of the Hamming space into 1-error-correcting codes can be embedded to a partition of a space of some larger dimension into 1-perfect codes.
Revised:  Further, we generalize the results to partitions: every partition of the Hamming space into 1-error-correcting codes can be embedded in a partition of a space of some larger dimension into 1-perfect codes.
Edit intent: fluency
Original:  These are the first results on delay games with quantitative winning conditions .
Revised:  In contrast, we show that bounded lookahead is not always sufficient to win such a game .
Edit intent: coherence
Original:  In the presence of column outliers corruption , we reformulate the classical matrix L_{2,1} norm minimization problem as its stochastic programming counterpart .
Revised:  In the presence of column outliers , we reformulate the classical matrix L_{2,1} norm minimization problem as its stochastic programming counterpart .
Edit intent: clarity
Original:   Numerical experiments on synthetic and real data demonstrate the efficiency and accuracy of the proposed GASG21 algorithm even with heavy column outliers corruption.
Revised:  Numerical experiments on synthetic and real data demonstrate the efficiency and accuracy of the proposed algorithms even with heavy column outliers corruption.
Edit intent: clarity
Original:  We show that the problem{\sc  {\sc   is  { %DIFDELCMD < \bf %DIFDELCMD < %%% NP-hard \sc  } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc   \bf P=NP } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Revised:  We show that the problem{\sc CN {\sc is { %DIFDELCMD < \bf %DIFDELCMD < %%% NP-hard \sc } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc \bf P=NP } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Edit intent: fluency
Original:  We show that the problem{\sc  {\sc   is  { %DIFDELCMD < \bf %DIFDELCMD < %%% NP-hard \sc  } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc   \bf P=NP } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Revised:  We show that the problem{\sc {\sc CA is { %DIFDELCMD < \bf %DIFDELCMD < %%% NP-hard \sc } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc \bf P=NP } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Edit intent: fluency
Original:  We show that the problem{\sc  {\sc   is  { %DIFDELCMD < \bf %DIFDELCMD < %%% NP-hard \sc  } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc   \bf P=NP } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Revised:  We show that the problem{\sc {\sc is { %DIFDELCMD < \bf %DIFDELCMD < %%% \sc } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc \bf P=NP } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Edit intent: clarity
Original:  We show that the problem{\sc  {\sc   is  { %DIFDELCMD < \bf %DIFDELCMD < %%% NP-hard \sc  } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc   \bf P=NP } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Revised:  We show that the problem{\sc {\sc is { %DIFDELCMD < \bf %DIFDELCMD < %%% NP-hard \sc CN } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc \bf P=NP } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Edit intent: fluency
Original:  We show that the problem{\sc  {\sc   is  { %DIFDELCMD < \bf %DIFDELCMD < %%% NP-hard \sc  } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc   \bf P=NP } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Revised:  We show that the problem{\sc {\sc is { %DIFDELCMD < \bf %DIFDELCMD < %%% NP-hard \sc } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc CN \bf P=NP } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Edit intent: fluency
Original:  We show that the problem{\sc  {\sc   is  { %DIFDELCMD < \bf %DIFDELCMD < %%% NP-hard \sc  } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc   \bf P=NP } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Revised:  We show that the problem{\sc {\sc is { %DIFDELCMD < \bf %DIFDELCMD < %%% NP-hard \sc } even when the vertices of the DAG are unweighted and the cluster capacity is 2. Moreover, when the vertices of the DAG are weighted, the problem does not admit a (2-\epsilon)-approximation algorithm for each \epsilon >0, unless { \sc \bf NP-hard } . On the positive side, we show that in case the vertices of the DAG are unweighted and M=2, the problem admits a 2-approximation algorithm.
Edit intent: coherence
Original:  Running programs under constraints could enable other uses such as rare event simulation and probabilistic verification--except that all such probabilistic languages are necessarily limited because they are defined or implemented in terms of an impoverished theory of probability.
Revised:  Running programs under constraints could enable other uses such as rare event simulation and probabilistic verification---except that all such probabilistic languages are necessarily limited because they are defined or implemented in terms of an impoverished theory of probability.
Edit intent: fluency
Original:  Preimage functions are generally uncomputable, so we derive an approximating semantics.
Revised:  Preimage functions are generally uncomputable, so we derive an abstract semantics.
Edit intent: clarity
Original:  We implement the approximating semantics and use the implementation to carry out Bayesian inference, stochastic ray tracing (a rare event simulation), and probabilistic verification of floating-point error bounds.
Revised:  We implement the abstract semantics and use the implementation to carry out Bayesian inference, stochastic ray tracing (a rare event simulation), and probabilistic verification of floating-point error bounds.
Edit intent: clarity
Original:  A set of tasks with random origin , destination and computational structure is distributed on a network modeled as a graph and the latency of each task is computed during impulsive load simulations.
Revised:  A set of tasks with random origin , destination and computational structure is distributed on a network modeled as a graph . The execution time (or latency) of each task is computed during impulsive load simulations.
Edit intent: clarity
Original:  The sum of all latencies is used as the energy in a Montecarlo simulation in which a near-zero temperature leads to optimal resource allocation whereas higher values mimic actual balancing algorithms .
Revised:  The sum of all latencies is used as the energy in a Montecarlo simulation in which the temperature parameter controls the resource allocation optimality .
Edit intent: clarity
Original:  Finally, the time-evolution of the latency is approximately recovered by interpolating the latency probability distributions from the set of impulsive load simulations.
Revised:  Finally, the time-evolution of the system by interpolating the latency probability distributions from the set of impulsive load simulations.
Edit intent: clarity
Original:  The time-evolution of the system allows us to study the standard transition to the congested phase by varying the \lambda parameter governing the Poisson task production rate.
Revised:  The time-evolution of the system allows us to study the standard transition to the congested phase by varying the task production rate.
Edit intent: clarity
Original:  This approach allows us to reproduce , at least qualitatively, the main known results on network congestion and to gain a deeper insight over the maximum theoretical performance of a system  .
Revised:  We are able to reproduce the main known results on network congestion and to gain a deeper insight over the maximum theoretical performance of a system .
Edit intent: clarity
Original:  It is relevant in a variety of applications including localizing events for targeted advertising, mar- keting , localization of natural disasters and predicting sentiment of investors in financial markets.
Revised:  It is relevant in applications including localizing events for targeted advertising, mar- keting , localization of natural disasters and predicting sentiment of investors in financial markets.
Edit intent: clarity
Original:  It is relevant in a variety of applications including localizing events for targeted advertising, mar- keting , localization of natural disasters and predicting sentiment of investors in financial markets.
Revised:  It is relevant in a variety of applications including localizing events for targeted advertising, marketing , localization of natural disasters and predicting sentiment of investors in financial markets.
Edit intent: fluency
Original:  This paper presents a tutorial description of three important aspects of sensing-based information diffusion in social networks from a communications/signal processing perspective.
Revised:  This chapter presents a tutorial description of three important aspects of sensing-based information diffusion in social networks from a communications/signal processing perspective.
Edit intent: clarity
Original:  The overview, insights, models and algorithms presented in this paper stem from recent developments in computer-science, economics , psychology and electrical engineering .
Revised:  The overview, insights, models and algorithms presented in this chapter stem from recent developments in computer-science, economics , psychology and electrical engineering .
Edit intent: clarity
Original:  We pursue a framework based strictly on spike timing , that is, one that avoids invoking concepts pertaining to spike rates .
Revised:  We pursue a framework based strictly on spike timing and avoids invoking concepts pertaining to spike rates .
Edit intent: coherence
Original:  This formulation sidesteps the need for spike alignment , which in turn leads to closed form solutions for all quantities of interest.
Revised:  This formulation sidesteps the need for spike alignment and leads to closed form solutions for all quantities of interest.
Edit intent: coherence
Original:  Next, through a perturbation analysis of individual spike times and synaptic weights of the output as well as the intermediate neurons in the network, we derive the gradients of the error functional with respect to the said entities.
Revised:  Next, through a perturbation analysis of individual spike times and synaptic weights of the output as well as all intermediate neurons in the network, we derive the gradients of the error functional with respect to the said entities.
Edit intent: clarity
Original:  Next, through a perturbation analysis of individual spike times and synaptic weights of the output as well as the intermediate neurons in the network, we derive the gradients of the error functional with respect to the said entities.
Revised:  Next, through a perturbation analysis of individual spike times and synaptic weights of the output as well as the intermediate neurons in the network, which yields the gradients of the error functional with respect to the said entities.
Edit intent: clarity
Original:  The experiments also highlight the effects of sparse input and asymmetries between synapses on excitatory and inhibitory neurons.
Revised:  The experiments also highlight asymmetries between synapses on excitatory and inhibitory neurons.
Edit intent: clarity
Original:  The optimality criterion of a schedule is the total flow time.
Revised:  The optimality criterion of a schedule is the total completion time.
Edit intent: clarity
Original:  In order to cope with uncertainty we make use of the robust optimization framework: we seek a schedule which performs well under all possible instantiations of processing times.
Revised:  In order to cope with uncertainty we seek a schedule which performs well under all possible instantiations of processing times.
Edit intent: coherence
Original:  Consequently, the goal is to minimize the maximum regret value of solution.
Edit intent: coherence
Original:  Although the deterministic version of this problem is solvable in polynomial time, the minmax regret version is known to be weakly NP-hard even for a single machine, and strongly NP-hard for parallel unrelated machines.
Revised:  Although the deterministic version of the considered problem is solvable in polynomial time, the minmax regret version is known to be weakly NP-hard even for a single machine, and strongly NP-hard for parallel unrelated machines.
Edit intent: clarity