wanyu/IteraTeR_v2 huggingface dataset:
Original:  As p_r is increased and network deviates from  community structure there is a sudden change in the localization property for  very small value of deformation from the perfect community structure.
Revised:  As p_r is increased and network deviates from community structure there is a sudden change in the localization property for a very small value of deformation from the perfect community structure.
Edit intent: fluency
Original:   Furthermore, we investigate spectral properties of a metabolic networks of Zebra-fish and compare with spectral properties of various model networks.
Revised:  Furthermore, we investigate spectral properties of a metabolic network of zebrafish, and compare them with those of the model networks.
Edit intent: clarity
Original: Sustaining cooperation among self-interested agents is critical for the proliferation of emerging networked communities, such as the communities formed by social networking services.
Revised: Sustaining cooperation among self-interested agents is critical for the proliferation of emerging online social communities, such as the communities formed by social networking services.
Edit intent: clarity
Original: Sustaining cooperation among self-interested agents is critical for the proliferation of emerging networked communities, such as the communities formed by social networking services.
Revised: Sustaining cooperation among self-interested agents is critical for the proliferation of emerging networked communities, such as online communities formed through social networking services.
Edit intent: clarity
Original:  Providing incentives for cooperation in networked communities is particularly challenging because of their unique features: a large population of anonymous agents interacting infrequently, having asymmetric interests, and dynamically joining and leaving the community;
Revised:  Providing incentives for cooperation in social communities is particularly challenging because of their unique features: a large population of anonymous agents interacting infrequently, having asymmetric interests, and dynamically joining and leaving the community;
Edit intent: clarity
Original:  and low-cost identity whitewashing.
Revised:  and low-cost reputation whitewashing.
Edit intent: clarity
Original:  We first define the concept of  sustainable social norm under which no agent has an incentive to deviate .
Revised:  We first define the concept of a sustainable social norm under which no agent has an incentive to deviate .
Edit intent: fluency
Original:  The defining feature of the scheme is to let all nodes send their messages at the same time, where each node broadcasts a codeword (selected from its unique codebook) consisting of on-slots and off-slots , where it transmits only during its on-slots, and listens to its peers through its own off-slots.
Revised:  The defining feature of the scheme is to let all nodes send their messages at the same time, where each node broadcasts a codeword (selected from its unique codebook) consisting of on-slots and off-slots . A node transmits only during its on-slots, and listens to its peers through its own off-slots.
Edit intent: coherence
Original:  Each node decodes the messages of its peers based on the received superposed signals through its own off-slots.
Revised:  Each node decodes the messages of its peers based on the superposed signals received through its own off-slots.
Edit intent: fluency
Original:  Numerical results demonstrate that the message-passing algorithm outperforms popular compressed sensing algorithms such as CoSaMP and AMP. Furthermore, to achieve the same reliability for peer-to-peer broadcast, the proposed scheme achieves three to five times the rate of ALOHA and carrier-sensing multiple-access (CSMA ) in typical scenarios .
Revised:  Numerical results demonstrate that the proposed scheme achieves three to five times the rate of ALOHA and carrier-sensing multiple-access (CSMA ) in typical scenarios .
Edit intent: coherence
Original: A novel solution is proposed to achieve a frequent task in wireless networks, where all node broadcast information to and receive information from nodes within a single hop.
Revised: A novel solution is proposed to undertake a frequent task in wireless networks, where all node broadcast information to and receive information from nodes within a single hop.
Edit intent: clarity
Original: A novel solution is proposed to achieve a frequent task in wireless networks, where all node broadcast information to and receive information from nodes within a single hop.
Revised: A novel solution is proposed to achieve a frequent task in wireless networks, which is to let all nodes broadcast information to and receive information from nodes within a single hop.
Edit intent: clarity
Original:  A node transmits only during its on-slots, and listens to its peers through its own off-slots.
Revised:  A node transmits during its on-slots, and listens to its peers through its own off-slots.
Edit intent: clarity
Original:  A node transmits only during its on-slots, and listens to its peers through its own off-slots.
Revised:  A node transmits only during its on-slots, and listens to its neighbors only through its own off-slots.
Edit intent: clarity
Original:  Each node decodes the messages of its peers based on the superposed signals received through its own off-slots.
Revised:  Over one frame interval, each node broadcasts a message to neighbors and simultaneously decodes neighbors' messages based on the superposed signals received through its own off-slots.
Edit intent: clarity
Original:  In a network consisting of Poisson distributed nodes, numerical results demonstrate that the proposed scheme  achieves several times the rate of slotted ALOHA and CSMA with the same packet error rate (1\%) .
Revised:  In a network consisting of Poisson distributed nodes, numerical results demonstrate that the proposed scheme often achieves several times the rate of slotted ALOHA and CSMA with the same packet error rate (1\%) .
Edit intent: clarity
Original:  In a network consisting of Poisson distributed nodes, numerical results demonstrate that the proposed scheme  achieves several times the rate of slotted ALOHA and CSMA with the same packet error rate (1\%) .
Revised:  In a network consisting of Poisson distributed nodes, numerical results demonstrate that the proposed scheme achieves several times the rate of slotted ALOHA and CSMA with the same packet error rate .
Edit intent: clarity
Original:  Two qualifying measures of support are defined by lifting two minimax optimality criteria from the MDL literature .
Revised:  Two qualifying measures of support are defined .
Edit intent: clarity
Original:  The second is worst-sample  optimal and is equivalent to the normalized maximum likelihood that has been extended to the normalized maximum weighted likelihood for more general models.
Revised:  The second is worst-sample optimal and is equivalent to the normalized maximum likelihood . It has been extended to the normalized maximum weighted likelihood for more general models.
Edit intent: coherence
Original:  The second is worst-sample  optimal and is equivalent to the normalized maximum likelihood that has been extended to the normalized maximum weighted likelihood for more general models.
Revised:  The second is worst-sample optimal and is equivalent to the normalized maximum likelihood that has been extended by likelihood weights for compatibility with more general models.
Edit intent: clarity
Original:  Support combines across independent studies, additively if the studies share the same truth value of the hypothesis but not necessarily the same value of the interest parameter .
Revised:  One such model is that of two independent normal samples, the interest parameter .
Edit intent: clarity
Original:  This thesis is concerned with the reduction process for the ordinary ILS problem and the ellipsoid-constrained ILS prob- lem .
Revised:  This thesis is concerned with the reduction process for the ordinary ILS problem and the ellipsoid-constrained ILS problem .
Edit intent: fluency
Original:  The new understanding allows us to design a new re- duction algorithm which is more efficient than the well-known LLL reduction algorithm.
Revised:  The new understanding allows us to design a new reduction algorithm which is more efficient than the well-known LLL reduction algorithm.
Edit intent: fluency
Original:  Numerical stability is taken into account in designing the new re- duction algorithm.
Revised:  Numerical stability is taken into account in designing the new reduction algorithm.
Edit intent: fluency
Original:  For the ellipsoid-constrained ILS problem, we propose a new reduction algorithm which, unlike existing algorithms, uses all the avail- able information.
Revised:  For the ellipsoid-constrained ILS problem, we propose a new reduction algorithm which, unlike existing algorithms, uses all the available information.
Edit intent: fluency
Original:  The method is designed for regression problems involving binary or tertiary predictors and allows the number of predictors to exceed the size of the sample, two properties which make it well-suited for association studies.
Revised:  The method is designed for regression problems involving binary or tertiary predictors and allows the number of predictors to exceed the size of the sample, two properties which make it well suited for association studies.
Edit intent: fluency
Original:  The result is a robust method that requires no prior knowledge of the true predictor-response relationship.
Revised:  The result is a robust method that requires no prior knowledge of the true predictor--response relationship.
Edit intent: fluency
Original:  The small message space of activation codes introduces some problems that are illustrated by an adaptive chosen-plaintext attack (CPA-2) on a general 3-round Feistel network of size 2^(2n) .
Revised:  The small message space of activation codes introduces some problems that are illustrated by an adaptive chosen-plaintext attack (CPA-2) on a general 3-round Feis- tel network of size 2^(2n) .
Edit intent: fluency
Original:  We show an Omega(d/w log n) lower bound for the unamortised time required per new number in the stream.
Revised:  We show an Omega(d/w log n) lower bound for the time required per new number in the stream.
Edit intent: clarity
Original:  We give a lower bound of Omega(  d/w log n) time on average per output digit for this problem where 2^d is the maximum value of a digit.
Revised:  We give a lower bound of Omega( ( d/w log n) time on average per output digit for this problem where 2^d is the maximum value of a digit.
Edit intent: fluency
Original:  We show an Omega(  d/w log n) lower bound for the time required per new number in the stream.
Revised:  We show an Omega( ( d/w log n) lower bound for the time required per new number in the stream.
Edit intent: fluency
Original:  We give a lower bound of Omega ((d/w)*log n) time on average per output digit for this problem where 2^d is the maximum value of a digit.
Revised:  We give a Theta ((d/w)*log n) time on average per output digit for this problem where 2^d is the maximum value of a digit.
Edit intent: clarity
Original:  We give a lower bound of Omega ((d/w)*log n) time on average per output digit for this problem where 2^d is the maximum value of a digit.
Revised:  We give a lower bound of Omega ((d/w)*log n) bound on average per output digit for this problem where 2^d is the maximum value of a digit.
Edit intent: clarity
Original:  We show an Omega ((d/w)*log n) lower bound for the time required per new number in the stream.
Revised:  We show an Omega ((d/w)*log n) bound for the time required per new number in the stream.
Edit intent: clarity
Original:  Our findings are consistent with a Darwinian selection hypothesis which favors a weak species which can adapt rapidly, and establish an unexpected conceptual connection to the physics of quasi-random walks.
Revised:  Our findings are consistent with a Darwinian selection hypothesis which favors a weak species which can adapt rapidly, and establish an unexpected conceptual connection to the physics of correlated walks.
Edit intent: clarity
Original:  Furthermore we provide a simple axiomatic characterization of the class of isomorphism classes of indexed arrangements of oriented double pseudolines and we establish a one-to-one and onto correspondence between this latter class and the class of chirotopes of finite indexed families of pairwise disjoint oriented convex bodiesof real two-dimensional projective geometries.
Revised:  Furthermore we provide a simple axiomatic characterization of the class of isomorphism classes of indexed arrangements of oriented double pseudolines and we establish a one-to-one and onto correspondence between this latter class and the class of chirotopes of finite planar families of pairwise disjoint oriented convex bodiesof real two-dimensional projective geometries.
Edit intent: clarity
Original: We extend the classical  characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Revised: We extend the classical LR characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Edit intent: fluency
Original: We extend the classical  characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Revised: We extend the classical characterization of chirotopes of finite planar families of points to chirotopes of finite planar families of pairwise disjoint convex bodies: a map hi on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Edit intent: clarity
Original: We extend the classical  characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Revised: We extend the classical characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of 3-subsets of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Edit intent: fluency
Original: We extend the classical  characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Revised: We extend the classical characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Edit intent: clarity
Original: We extend the classical  characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Revised: We extend the classical characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite indexing set I is a chirotope of finite planar families of pairwise disjoint convex bodies if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Edit intent: fluency
Original: We extend the classical  characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Revised: We extend the classical characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of 3-subsets of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Edit intent: fluency
Original: We extend the classical  characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is the chirotope of a finite planar family of points---to chirotopes of finite planar families of pairwise disjoint convex bodies.
Revised: We extend the classical characterization of chirotopes of finite planar families of points---which says that a map \chi\ defined on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of \chi\ to the set of triples of J is a chirotope of finite planar families of pairwise disjoint convex bodies.
Edit intent: fluency
Original: Actomyosin contractility is essential for biological force generation, and is well understood in highly ordered structures such as striated muscle.
Revised: Actomyosin contractility is essential for biological force generation, and is well understood in highly organized structures such as striated muscle.
Edit intent: clarity
Original:  In vitro experiments have shown that non-sarcomeric bundles comprised only of F-actin and myosin thick filaments can also display contractile behavior , which cannot be described by standard muscle models.
Revised:  Additionally, actomyosin bundles devoid of this organization are known to contract both in vivo and in vitro , which cannot be described by standard muscle models.
Edit intent: clarity
Original:  We develop a mean-field formalism which is a generalization of the standard model, and which can directly incorporate macroscopic measurements of electric parameters and non-resistive (non-ohmic) properties of the extracellular medium, such as ionic diffusion effects.
Revised:  We develop a mean-field formalism which is a generalization of the standard model, and which can directly incorporate non-resistive (non-ohmic) properties of the extracellular medium, such as ionic diffusion effects.
Edit intent: clarity
Original:  Applying this formalism to experimental data could provide direct estimates of the nature of current sources  and in particular, estimate the possible contribution of electric monopoles.
Revised:  We found that the power spectrum of the signal contains the signature of the nature of current sources and in particular, estimate the possible contribution of electric monopoles.
Edit intent: clarity
Original: The current-source density  analysis is a widely used method in brain electrophysiology, but this method rests on a series of assumptions, namely that current sources are exclusively made by dipoles, and that the surrounding medium is resistive and uniform  .
Revised: The current-source density analysis is a widely used method in brain electrophysiology, but this method rests on a series of assumptions, namely that the surrounding extracellular medium is resistive and uniform .
Edit intent: clarity
Original:  Because of these assumptions, this standard model cannot be used to estimate the contributions of monopolar sources or of non-resistive aspects of the extracellular medium.
Revised:  Because of these assumptions, this standard model does not correctly describe the contributions of monopolar sources or of non-resistive aspects of the extracellular medium.
Edit intent: clarity
Original:  We propose here a general framework to model electric fields and potentials resulting from current source densities, without relying on such assumptions.
Revised:  We propose here a general framework to model electric fields and potentials resulting from current source densities, without relying on the above assumptions.
Edit intent: clarity
Original:  This formalism recovers the classic results of the standard model such as the current-source density (CSD ) analysis, but in addition, we provide expressions to generalize the CSD approach to situations with non-resistive media and arbitrarily complex multipolar configurations of current sources.
Revised:  This formalism recovers the classic results of the standard model such as the CSD analysis, but in addition, we provide expressions to generalize the CSD approach to situations with non-resistive media and arbitrarily complex multipolar configurations of current sources.
Edit intent: clarity
Original:  In this study, we demonstrate that yeast synthetic lethal genetic interactions can be explained by the genetic interactions between domains of those proteins.
Revised:  In this study, we demonstrated that yeast synthetic lethal genetic interactions can be explained by the genetic interactions between domains of those proteins.
Edit intent: fluency
Original:  Moreover, we find that domains in multidomain yeast proteins contribute to their genetic interactions differently.
Revised:  Moreover, we found that domains in multidomain yeast proteins contribute to their genetic interactions differently.
Edit intent: fluency
Original:  Using the probabilities of domain genetic interactions, we are able to achieve high precision and low false positive rate in predicting genome-wide yeast synthetic lethal genetic interactions.
Revised:  Using the probabilities of domain genetic interactions, we were able to predict novel yeast synthetic lethal genetic interactions.
Edit intent: clarity