wanyu/IteraTeR_v2 huggingface dataset:
Original: We model the ligand-receptor molecular communication channel with a discrete-time Markov model, and show how to obtain the capacity of this channel  .
Revised: We model the ligand-receptor binding mechanism, as a discrete-time Markov model, and show how to obtain the capacity of this channel .
Edit intent: clarity
Original:  Further , unusually for a channel with memory , we show that feedback does not increase the capacity of this channel.
Revised:  Further , we show that feedback does not increase the capacity of this channel.
Edit intent: clarity
Original:  However, we go on to show that for strongly regular graphs the implicit bound has an explicit corollary (Theorem thm:srg) which significantly improves upon standard bounds due to Tardos and to Bj{\"o}rner, Lov\'{a}sz and Shor - if n the number of vertices and N is the number of chips, the known bounds are of O(nN) form whereas our new bound is of O(n+N) form+\epsilon)n - the classic and the new bounds reduce to O(N) and O(n), respectively} .
Revised:  However, we go on to show that for strongly regular graphs the implicit bound has an explicit corollary (Theorem thm:srg) which significantly improves upon standard bounds due to Tardos and to Bj{\"o}rner, Lov\'{a}sz and Shor . In some cases the improvement is dramatic. For instance: for strongly regular graphs the classic and the new bounds reduce to O(nN) form whereas our new bound is of O(n+N) form+\epsilon)n - the classic and the new bounds reduce to O(N) and O(n), respectively} .
Edit intent: coherence
Original:  However, we go on to show that for strongly regular graphs the implicit bound has an explicit corollary (Theorem thm:srg) which significantly improves upon standard bounds due to Tardos and to Bj{\"o}rner, Lov\'{a}sz and Shor - if n the number of vertices and N is the number of chips, the known bounds are of O(nN) form whereas our new bound is of O(n+N) form+\epsilon)n - the classic and the new bounds reduce to O(N) and O(n), respectively} .
Revised:  However, we go on to show that for strongly regular graphs the implicit bound has an explicit corollary (Theorem thm:srg) which significantly improves upon standard bounds due to Tardos and to Bj{\"o}rner, Lov\'{a}sz and Shor - if n the number of vertices and N is the number of chips, the known bounds are of O(nN) and O(n+N) form+\epsilon)n - the classic and the new bounds reduce to O(N) and O(n), respectively} .
Edit intent: coherence
Original: In many situations a player may act so as to maximize a *perceived utility* that is not exactly her utility function, but rather some other, biased, utility.
Revised: In many situations a player may act so as to maximize a perceived utility that is not exactly her utility function, but rather some other, biased, utility.
Edit intent: fluency
Original:  When analyzing or designing a game, one may ask how inefficiency (say , measured by the Price of Anarchy  ) is affected by the perceived utilities.
Revised:  When analyzing a game, one may ask how inefficiency (say , measured by the Price of Anarchy ) is affected by the perceived utilities.
Edit intent: clarity
Original:  When analyzing or designing a game, one may ask how inefficiency (say , measured by the Price of Anarchy  ) is affected by the perceived utilities.
Revised:  When analyzing or designing a game, one may ask how inefficiency , measured by the Price of Anarchy ) is affected by the perceived utilities.
Edit intent: coherence
Original:  When analyzing or designing a game, one may ask how inefficiency (say , measured by the Price of Anarchy  ) is affected by the perceived utilities.
Revised:  When analyzing or designing a game, one may ask how inefficiency (say , measured by the Price of Anarchy (PoA ) is affected by the perceived utilities.
Edit intent: clarity
Original:  We show how the smoothness method of Roughgarden [ 2009 ] naturally extends to games with such perceived utilities or costs, regardless of the game or the behavioral bias.
Revised:  The smoothness method [ 2009 ] naturally extends to games with such perceived utilities or costs, regardless of the game or the behavioral bias.
Edit intent: coherence
Original:  Then, we focus on nonatomic congestion games with strict uncertainty, where players are risk averse Nikolova and Stier-Moses 2014, Meir and Parkes 2015%DIFDELCMD < ]%%% . Using the (modified) smoothness framework, we provide tight bounds for affine costs, thereby improving the results of Meir and Parkes 2015%DIFDELCMD < ]%%% , with simpler proofs.
Revised:  Then, we focus on nonatomic congestion games Nikolova and Stier-Moses 2014, Meir and Parkes 2015%DIFDELCMD < ]%%% . Using the (modified) smoothness framework, we provide tight bounds for affine costs, thereby improving the results of Meir and Parkes 2015%DIFDELCMD < ]%%% , with simpler proofs.
Edit intent: clarity
Original:  Then, we focus on nonatomic congestion games with strict uncertainty, where players are risk averse Nikolova and Stier-Moses 2014, Meir and Parkes 2015%DIFDELCMD < ]%%% . Using the (modified) smoothness framework, we provide tight bounds for affine costs, thereby improving the results of Meir and Parkes 2015%DIFDELCMD < ]%%% , with simpler proofs.
Revised:  Then, we focus on nonatomic congestion games with strict uncertainty, where players are risk averse %DIFDELCMD < ]%%% . Using the (modified) smoothness framework, we provide tight bounds for affine costs, thereby improving the results of Meir and Parkes 2015%DIFDELCMD < ]%%% , with simpler proofs.
Edit intent: coherence
Original:  Then, we focus on nonatomic congestion games with strict uncertainty, where players are risk averse Nikolova and Stier-Moses 2014, Meir and Parkes 2015%DIFDELCMD < ]%%% . Using the (modified) smoothness framework, we provide tight bounds for affine costs, thereby improving the results of Meir and Parkes 2015%DIFDELCMD < ]%%% , with simpler proofs.
Revised:  Then, we focus on nonatomic congestion games with strict uncertainty, where players are risk averse Nikolova and Stier-Moses 2014, Meir and Parkes 2015%DIFDELCMD < ]%%% . Using the (modified) smoothness framework, we provide tight bounds for affine costs, thereby improving the results of Meir and Parkes %DIFDELCMD < ]%%% , with simpler proofs.
Edit intent: fluency
Original:  Finally we show some initial implications for atomic congestion games. \%
Edit intent: coherence
Original:  Examples of such biased utility functions are common in behavioral economics , and include risk attitudes, altruism, present-bias and so on.
Revised:  Examples of such biased utility functions are common in behavioral economics : risk attitudes, altruism, present-bias and so on.
Edit intent: coherence
Original:  When analyzing a game, one may ask how inefficiency,  measured by the Price of Anarchy (PoA)  is affected by the perceived utilities.
Revised:  When analyzing a game, one may ask how inefficiency, as measured by the Price of Anarchy (PoA) is affected by the perceived utilities.
Edit intent: clarity
Original:  When analyzing a game, one may ask how inefficiency,  measured by the Price of Anarchy (PoA)  is affected by the perceived utilities.
Revised:  When analyzing a game, one may ask how inefficiency, measured by the Price of Anarchy (PoA) , is affected by the perceived utilities.
Edit intent: fluency
Original:   The smoothness method [Roughgarden and Tardos '04, Roughgarden '09] naturally extends to games with such perceived utilities or costs, regardless of the game or the behavioral bias.
Revised:  The smoothness method [Roughgarden and Tardos '04, '09] naturally extends to games with such perceived utilities or costs, regardless of the game or the behavioral bias.
Edit intent: fluency
Original:  The smoothness method Roughgarden '04,'09%DIFDELCMD < ] %%% naturally extends to games with homogeneous perceived utilities or costs, regardless of the game or the behavioral bias.
Revised:  The smoothness method %DIFDELCMD < ] %%% naturally extends to games with homogeneous perceived utilities or costs, regardless of the game or the behavioral bias.
Edit intent: coherence
Original:  For symmetric heterogeneous games , we provide a%DIFDELCMD < {\em %%% biased PoA bound that depends on the average biased-smoothness of all participating types.
Revised:  %DIFDELCMD < {\em %%% biased PoA bound that depends on the average biased-smoothness of all participating types.
Edit intent: coherence
Original:  For symmetric heterogeneous games , we provide a%DIFDELCMD < {\em %%% biased PoA bound that depends on the average biased-smoothness of all participating types.
Revised:  For symmetric heterogeneous games , we provide a%DIFDELCMD < {\em %%% bound that depends on the average biased-smoothness of all participating types.
Edit intent: clarity
Original:  The significance of the features in the resulting persistence diagrams can be analyzed with functions that implement the statistical methodsdiscussed in Fasy, Lecci, Rinaldo, Wasserman, Balakrishnan, and Singh (2014), Chazal, Fasy, Lecci, Rinaldo, and Wasserman (2014c) and Chazal, Fasy, Lecci, Michel, Rinaldo, and Wasserman (2014a) .
Revised:  The significance of the features in the resulting persistence diagrams can be analyzed with functions that implement recently developed statistical methods .
Edit intent: clarity
Original:  These results settle three open problems in the area of knowledge compilation Adnan Darwiche and Pierre Marquis, A Knowledge Compilation Map, 2002  .
Revised:  These results settle three open problems in the area of knowledge compilation (Darwiche and Marquis, 2002 .
Edit intent: coherence
Original:  These results settle three open problems in the area of knowledge compilation Adnan Darwiche and Pierre Marquis, A Knowledge Compilation Map, 2002  .
Revised:  These results settle three open problems in the area of knowledge compilation Adnan Darwiche and Pierre Marquis, A Knowledge Compilation Map, 2002 ) .
Edit intent: fluency
Original: Decomposable Negation Normal Forms (DNNFs) are a restricted form of Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables.
Revised: Decomposable Negation Normal Forms (DNNFs) are Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables.
Edit intent: clarity
Original: Design space exploration of multiprocessor systems involves the optimization of cost/performance functions over a large number of design parameters, most of which are discrete-valued .
Revised: Modern multi-core systems have a large number of design parameters, most of which are discrete-valued .
Edit intent: clarity
Original:  This optimization is non-trivial because the evaluation of cost/performance functions is computationally expensive , typically involving simulation of long benchmark programs on a cycle-accurate model of the system .
Revised:  This optimization is non-trivial because the evaluation of cost/performance functions is computationally expensive because it requires detailed cycle-accurate model of the system .
Edit intent: clarity
Original:  We describe a new approach to this optimization problem, based on embedding the discrete parameter space into an extended continuous space .
Revised:  We propose a novel technique for embedding the discrete parameter space into an extended continuous space .
Edit intent: clarity
Original:  The embedding is performed using a novel simulation-based ergodic interpolation method that produces the interpolated value in a single simulation run .
Revised:  The embedding is performed using a novel simulation-based ergodic interpolation , which, unlike spatial interpolation, produces the interpolated value in a single simulation run .
Edit intent: clarity
Original:  The embedding is performed using a novel simulation-based ergodic interpolation method that produces the interpolated value in a single simulation run .
Revised:  The embedding is performed using a novel simulation-based ergodic interpolation method that produces the interpolated value within a single simulation run .
Edit intent: clarity
Original:  Here we propose a continuum model of epithelial expansion that couples mechanical deformations in the tissue to contractile activity  in the cells.
Revised:  Here we propose a model for the dynamics of epithelial expansion that couples mechanical deformations in the tissue to contractile activity in the cells.
Edit intent: clarity
Original:  Inspired by these examples, we introduce a generalization of Turing patterns that is both self-organized and self-scaling.
Revised:  Inspired by these examples, we introduce a generalization of Turing patterns that is self-organized and self-scaling.
Edit intent: coherence
Original:  We couple a Turing instability to the reaction kinetics of diffusing expander molecules  .
Revised:  A feedback loop involving diffusing expander molecules .
Edit intent: clarity
Original:  Our model identifies minimal requirements for robust, self-scaling pattern formation and captures essential features of body plan regeneration in flatworms as observed in experiments.
Revised:  Our model captures essential features of body plan regeneration in flatworms as observed in experiments.
Edit intent: clarity
Original:  Some organisms  e.g. flatworms can regenerate a re-scaled body plan from tissue fragments of varying sizes.
Revised:  Some organisms , e.g. flatworms can regenerate a re-scaled body plan from tissue fragments of varying sizes.
Edit intent: fluency
Original:  Some organisms  e.g. flatworms can regenerate a re-scaled body plan from tissue fragments of varying sizes.
Revised:  Some organisms e.g. , flatworms, can regenerate a re-scaled body plan from tissue fragments of varying sizes.
Edit intent: fluency
Original:  Some organisms  e.g. flatworms can regenerate a re-scaled body plan from tissue fragments of varying sizes.
Revised:  Some organisms e.g. flatworms can regenerate a rescaled body plan from tissue fragments of varying sizes.
Edit intent: fluency
Original:  Simulation results on various general synthetic networks and real world networks suggest that Jordan center-based estimators consistently outperform the distance , closeness, and betweenness centrality based heuristics, even if the network is not a tree.
Revised:  Simulation results on various general synthetic networks and real world networks suggest that Jordan center-based estimators consistently outperform the betweenness , closeness, and betweenness centrality based heuristics, even if the network is not a tree.
Edit intent: clarity
Original:  This is done in order to evaluate the effectiveness of existing and possible fiscal and technological change policies for emissions reductions.
Revised:  This is done in order to evaluate the likely effectiveness of potential fiscal and technological change policies for emissions reductions.
Edit intent: clarity
Original:  We provide tools to understand and evaluate the effectiveness of policy taking account of the distributive structure of prices and emissions in segments of a diverse market, both for conventional as well as unconventional engine technologies.
Revised:  We provide tools to do so based on the distributive structure of prices and emissions in segments of a diverse market, both for conventional as well as unconventional engine technologies.
Edit intent: clarity
Original:  We furthermore find that markets for unconventional engine technologies differ significantly between nations, with patchy coverage of market segments .
Revised:  We furthermore find that markets for unconventional engine technologies have patchy coverages of varying levels .
Edit intent: clarity
Original:  We argue that aggregate choices and corresponding elasticities of substitution under changes of fiscal policy can be estimated, with uncertainty, using this data .
Revised:  We argue that choices and aggregate elasticities of substitution under changes of fiscal policy can be estimated, with uncertainty, using this data .
Edit intent: clarity
Original:  We argue that aggregate choices and corresponding elasticities of substitution under changes of fiscal policy can be estimated, with uncertainty, using this data .
Revised:  We argue that aggregate choices and corresponding elasticities of substitution can be predicted using this data .
Edit intent: clarity
Original:  This enables to evaluate the likely effectiveness of potential fiscal and technological change policies on fleet-year emissions reductions.
Revised:  This enables to evaluate the effectiveness of potential fiscal and technological change policies on fleet-year emissions reductions.
Edit intent: clarity
Original: An outstanding open question sublinear.info, Question #5  asks to characterize metric spaces in which distances can be estimated using efficient sketches.
Revised: An outstanding open question ( Question #5 asks to characterize metric spaces in which distances can be estimated using efficient sketches.
Edit intent: coherence
Original:  We further prove that for norms that are closed under sum-product, efficient sketching is equivalent to constant-distortion embedding into \ell_1  . Examples of such norms include the Earth Mover's Distance (specifically its norm variant, called Kantorovich-Rubinstein norm), and the trace norm (a.k.a.
Revised:  We further prove that for norms that are closed under sum-product, efficient sketching is equivalent to embedding into \ell_1 . Examples of such norms include the Earth Mover's Distance (specifically its norm variant, called Kantorovich-Rubinstein norm), and the trace norm (a.k.a.
Edit intent: clarity
Original:  We further prove that for norms that are closed under sum-product, efficient sketching is equivalent to constant-distortion embedding into \ell_1  . Examples of such norms include the Earth Mover's Distance (specifically its norm variant, called Kantorovich-Rubinstein norm), and the trace norm (a.k.a.
Revised:  We further prove that for norms that are closed under sum-product, efficient sketching is equivalent to constant-distortion embedding into \ell_1 with constant distortion . Examples of such norms include the Earth Mover's Distance (specifically its norm variant, called Kantorovich-Rubinstein norm), and the trace norm (a.k.a.
Edit intent: clarity
Original:  Math., 1978), we then conclude that these spaces do not admit efficient sketches either, making progress towards answering another open question sublinear.info, Question #7 . Finally, we observe that resolving whether "sketching is equivalent to embedding into \ell_1 for general norms" (i.e., without the above restriction) is equivalent to resolving a well-known open problem in Functional Analysis posed by Kwapien in 1969.
Revised:  Math., 1978), we then conclude that these spaces do not admit efficient sketches either, making progress towards answering another open question sublinear.info, Question #7 , URL Finally, we observe that resolving whether "sketching is equivalent to embedding into \ell_1 for general norms" (i.e., without the above restriction) is equivalent to resolving a well-known open problem in Functional Analysis posed by Kwapien in 1969.
Edit intent: coherence
Original:  We validate our model's ability to discover latent influence patterns using transcripts of arguments heard by the US Supreme Court and the movie "12 Angry Men ".
Revised:  We validate our model's ability to discover latent influence patterns using transcripts of arguments heard by the US Supreme Court and the movie "12 Angry Men ."
Edit intent: fluency
Original:  We showcase our model's capabilities by using it to infer latent influence patterns in Federal Open Market Committee meeting transcripts, demonstrating state-of-the-art performance at uncovering social dynamics in group discussions.
Revised:  We showcase our model's capabilities by using it to infer latent influence patterns from Federal Open Market Committee meeting transcripts, demonstrating state-of-the-art performance at uncovering social dynamics in group discussions.
Edit intent: fluency
Original: The cubic spline interpolation method, the Runge--Kutta method, and the Newton--Raph\-son method are extended to dual versions (developed in the context of dual numbers).
Revised: The cubic spline interpolation method, the Runge--Kutta method, and the Newton-Raphson method are extended to dual versions (developed in the context of dual numbers).
Edit intent: fluency
Original:  We develop a  Bayesian group factor analysis (BGFA) model that extends the factor model to multiple coupled observation matrices .
Revised:  We develop a Bayesian group factor analysis model that extends the factor model to multiple coupled observation matrices .
Edit intent: clarity
Original:  Our model puts a structured Bayesian hierarchical prior on the joint factor loading matrix, which achieves shrinkage effect at both a local level ( element-wise shrinkage) and a factor level (column-wise shrinkage) with non-parametric behavior that removes unnecessary factors .
Revised:  Our model puts a structured prior on the joint factor loading matrix, which achieves shrinkage effect at both a local level ( element-wise shrinkage) and a factor level (column-wise shrinkage) with non-parametric behavior that removes unnecessary factors .
Edit intent: clarity
Original:  We validate our model on simulated data with substantial structure and compare recovered factor loadings against results from related methods.
Revised:  We validate our method on both simulated data with substantial structure and compare recovered factor loadings against results from related methods.
Edit intent: clarity
Original:  More precisely, they build d de Bruijn graphs, each with a specific order, i.e., G_{K_1}, G_{K_2}, \ldots , G_{K_d}.
Revised:  More precisely, they build d de Bruijn graphs, each with a specific order, i.e., G_{K_1}, G_{K_2}, ... , G_{K_d}.
Edit intent: coherence
Original:  We present a protocol and a server network to decentrally store and archive data in the form of nanopublications, an RDF-based format to represent scientific data with formal semantics .
Revised:  We present a protocol and a server network to decentrally store and archive data in the form of nanopublications, an RDF-based format to represent scientific data .
Edit intent: clarity
Original:  We show how this approach allows researchers to produce, publish, retrieve, address, verify, and recombine datasets and their individual nanopublications in a reliable and trustworthy manner, and we argue that this architecture could be used for the Semantic Web in general.
Revised:  We show how this approach allows researchers to publish, retrieve, address, verify, and recombine datasets and their individual nanopublications in a reliable and trustworthy manner, and we argue that this architecture could be used for the Semantic Web in general.
Edit intent: clarity
Original:  We show how this approach allows researchers to produce, publish, retrieve, address, verify, and recombine datasets and their individual nanopublications in a reliable and trustworthy manner, and we argue that this architecture could be used for the Semantic Web in general.
Revised:  We show how this approach allows researchers to produce, publish, retrieve, verify, and recombine datasets and their individual nanopublications in a reliable and trustworthy manner, and we argue that this architecture could be used for the Semantic Web in general.
Edit intent: clarity
Original:  We show how this approach allows researchers to produce, publish, retrieve, address, verify, and recombine datasets and their individual nanopublications in a reliable and trustworthy manner, and we argue that this architecture could be used for the Semantic Web in general.
Revised:  We show how this approach allows researchers to produce, publish, retrieve, address, verify, and recombine datasets of nanopublications in a reliable and trustworthy manner, and we argue that this architecture could be used for the Semantic Web in general.
Edit intent: clarity