wanyu/IteraTeR_v2 huggingface dataset:
Original:  We demonstrated  state-of-the-art classification performances with NIN on CIFAR-10 , CIFAR-100 and SVHN datasets.
Revised:  We demonstrated state-of-the-art classification performances with NIN on CIFAR-10 and SVHN datasets.
Edit intent: clarity
Original:  The proposed scheme employs the intermediated energy storage (IES) circuit which consists of a constant power driving circuit and a super-capacitor.
Revised:  The proposed scheme employs the intermediate energy storage (IES) circuit which consists of a constant power driving circuit and a super-capacitor.
Edit intent: fluency
Original:  The proposed scheme employs the intermediate energy storage (IES) circuit which consists of a constant power driving circuit and a super-capacitor.
Revised:  The proposed scheme employs the intermediated energy storage (IES) circuit which consists of a constant power driving circuit and a super-capacitor.
Edit intent: fluency
Original: The collective behaviour of proteins on biomembranes is usually studied within the spontaneous curvature model.
Revised: The collective behavior of proteins on biomembranes is usually studied within the spontaneous curvature model.
Edit intent: fluency
Original:  Here we consider an alternative approach, which accounts consistently for the liquid-crystalline order of proteins together with the morphology of biomembrane.
Revised:  Here we consider a novel approach, which accounts consistently for the liquid-crystalline order of proteins together with the morphology of biomembrane.
Edit intent: clarity
Original:  Within a broad range of parameters the calculated equilibrium shapes are similar to the ones observed in experiments while budding of vesicles and division of cells .
Revised:  We find equilibrium shapes similar to the ones observed in experiments while budding of vesicles and division of cells .
Edit intent: clarity
Original:  Within a broad range of parameters the calculated equilibrium shapes are similar to the ones observed in experiments while budding of vesicles and division of cells .
Revised:  Within a broad range of parameters the calculated equilibrium shapes are similar to the ones observed during the budding of vesicles and division of cells .
Edit intent: clarity
Original:  Within a broad range of parameters the calculated equilibrium shapes are similar to the ones observed in experiments while budding of vesicles and division of cells .
Revised:  Within a broad range of parameters the calculated equilibrium shapes are similar to the ones observed in experiments while budding of vesicles and cell division .
Edit intent: clarity
Original: The collective behavior of proteins on biomembranes is usually studied within the spontaneous curvature model.
Revised: Collective behavior of proteins on biomembranes is usually studied within the spontaneous curvature model.
Edit intent: fluency
Original:  We show analytically that the anchoring forces exerted on the membrane by a layer of proteins can lead to the membrane bending.
Revised:  We show analytically that the anchoring forces exerted on a membrane by layer of proteins can lead to the membrane bending.
Edit intent: fluency
Original:  The predicted instabilities can advance our conceptual understanding of the collective phenomena in biological systems, in particular those with inherent anisotropy.
Revised:  The predicted instabilities can advance our conceptual understanding of physical mechanisms behind collective phenomena in biological systems, in particular those with inherent anisotropy.
Edit intent: clarity
Original: We show that a finitely generated subgroups of a free group, chosen uniformly at random, is strictly Whitehead minimal  .
Revised: We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal .
Edit intent: fluency
Original:  The proofs strongly rely on automata theory and on the combinatorial toolsused in the analysis of algorithms .
Revised:  The proofs strongly rely on combinatorial tools, notably those of analytic combinatorics .
Edit intent: clarity
Original:  We predict the activity of new sequences and extract the exact locations of transcription factor binding sites  .
Revised:  We predict the activity of new sequences and extract the locations of transcription factor binding sites .
Edit intent: clarity
Original: Many studies have shown that the icosahedral symmetry adopted by most spherical viruses is the result of free energy minimization of a generic interaction between virus proteins.
Revised: Many studies have shown that symmetric shells appear in nature as a result of the free energy minimization of a generic interaction between virus proteins.
Edit intent: clarity
Original:  Our minimal model of virus assembly shows that structures of small shells are basically determined by the spontaneous curvature almost independently of the mechanical properties of the protein subunits .
Revised:  Our model of nano-shell assembly shows that structures of small shells are basically determined by the spontaneous curvature almost independently of the mechanical properties of the protein subunits .
Edit intent: clarity
Original:  Our minimal model of virus assembly shows that structures of small shells are basically determined by the spontaneous curvature almost independently of the mechanical properties of the protein subunits .
Revised:  Our minimal model of virus assembly shows that the spontaneous curvature almost independently of the mechanical properties of the protein subunits .
Edit intent: clarity
Original: Relational models theory (RMT)  posits four elementary models of relationships governing all human interactions, singly or in combination: Communal Sharing, Authority Ranking, Equality Matching, and Market Pricing.
Revised: Relational models theory (RMT) , a theory of human social relationships. RMT posits four elementary models of relationships governing all human interactions, singly or in combination: Communal Sharing, Authority Ranking, Equality Matching, and Market Pricing.
Edit intent: clarity
Original: Relational models theory (RMT)  posits four elementary models of relationships governing all human interactions, singly or in combination: Communal Sharing, Authority Ranking, Equality Matching, and Market Pricing.
Revised: Relational models theory (RMT) posits four elementary models of relationships governing human interactions, singly or in combination: Communal Sharing, Authority Ranking, Equality Matching, and Market Pricing.
Edit intent: clarity
Original:  We formally demonstrate that the exchange fluxes arising from this setting aggregate into six discrete categories, four of which map unequivocally to the four RMs , while the remaining two correspond to  asocial and null relationships.
Revised:  We formally demonstrate that the relationships generated by this model aggregate into six discrete categories, four of which map unequivocally to the four RMs , while the remaining two correspond to asocial and null relationships.
Edit intent: clarity
Original:  We formally demonstrate that the exchange fluxes arising from this setting aggregate into six discrete categories, four of which map unequivocally to the four RMs , while the remaining two correspond to  asocial and null relationships.
Revised:  We formally demonstrate that the exchange fluxes arising from this setting aggregate into six discrete categories, four of which map unequivocally to the four RMs , while the remaining two correspond to the asocial and null relationships.
Edit intent: fluency
Original:  One of these forms allows  to define complete problems on ordered structures, and another form to define them on unordered non-Aristotelian structures.
Revised:  One of these forms allows us to define complete problems on ordered structures, and another form to define them on unordered non-Aristotelian structures.
Edit intent: coherence
Original:  An evidence is shown that there cannot be any complete problem on Aristotelian structures for several complexity classes.
Revised:  Evidence is shown that there cannot be any complete problem on Aristotelian structures for several complexity classes.
Edit intent: clarity
Original:  Using a similar form, a logic is developed to capture the complexity class \mathrm{NP\cap coNP which very likely contains no complete problem.
Revised:  Using a similar form, a logic is developed to capture the complexity class NP\cap coNP which very likely contains no complete problem.
Edit intent: clarity
Original:  Given a bound k and a pattern x of length m, a query has to return all the strings of the dictionary which are at edit-distance at most k from x, where the edit distance between two strings  is defined as the minimum number of edit operations needed to transform one string into the other.
Revised:  Given a bound k and a pattern x of length m, a query has to return all the strings of the dictionary which are at edit distance at most k from x, where the edit distance between two strings is defined as the minimum number of edit operations needed to transform one string into the other.
Edit intent: clarity
Original:  Given a bound k and a pattern x of length m, a query has to return all the strings of the dictionary which are at edit-distance at most k from x, where the edit distance between two strings  is defined as the minimum number of edit operations needed to transform one string into the other.
Revised:  Given a bound k and a pattern x of length m, a query has to return all the strings of the dictionary which are at edit-distance at most k from x, where the edit distance between two strings is defined as the minimum-cost sequence of edit operations needed to transform one string into the other.
Edit intent: clarity
Original:  We present a practical implementation of a recently proposed dictionary which works only for one error.
Revised:  We present a practical implementation of the data structure we recently proposed and which works only for one error.
Edit intent: clarity
Original:  We extend the scheme to support 2 or more errors .
Revised:  We extend the scheme to 2 or more errors .
Edit intent: clarity
Original:  Finally our data structure is simple to implement as it only uses basic ideas from the literature  .
Revised:  Finally our data structure is simple to implement as it only uses basic techniques from the literature .
Edit intent: clarity
Original: Multisite phosphorylation networks are encountered in many intracellular processes like signal transduction, cell-cycle control or nuclear signal integration.
Revised: Multisite protein phosphorylation plays a prominent role in intracellular processes like signal transduction, cell-cycle control or nuclear signal integration.
Edit intent: clarity
Original: Multisite phosphorylation networks are encountered in many intracellular processes like signal transduction, cell-cycle control or nuclear signal integration.
Revised: Multisite phosphorylation networks are encountered in many intracellular processes like signal transduction, cell-cycle control and nuclear signal integration.
Edit intent: fluency
Original:  They furthermore conjecture that , for odd n, there are at most n and that, for even n, there are at most n+1 steady states.
Revised:  They furthermore conjecture that for odd n, there are at most n and that, for even n, there are at most n+1 steady states.
Edit intent: fluency
Original:  We conclude with a brief biological interpretation of the inherent geometric properties of multistationarity  .
Revised:  We furthermore study the inherent geometric properties of multistationarity .
Edit intent: clarity
Original:  The model considered, while manageable, is sufficiently complex, however.
Revised:  The model considered, while manageable, is significantly complex, however.
Edit intent: clarity
Original:  It already is able to reveal phenomena that can be interpreted as emergence and collapse of money as well as the related competition effects.
Revised:  It is already able to reveal phenomena that can be interpreted as emergence and collapse of money as well as the related competition effects.
Edit intent: fluency
Original: A previously described pathway analysis technique is applied to generic schemes of enzyme kinetics .
Revised: Recently, we described a pathway analysis technique is applied to generic schemes of enzyme kinetics .
Edit intent: coherence
Original:  Statistical models are derived for key channel parameters including the path loss, number of spatial clusters, angular dispersion and blocking .
Revised:  Statistical models are derived for key channel parameters including the path loss, number of spatial clusters, angular dispersion and outage .
Edit intent: clarity
Original:  It is found that, even in highly non-line-of-sight environments, strong signals can be detected 100m to 200m from potential cell sites, potentially with multiple clusters to support spatial multiplexing.
Revised:  It is found that, even in highly non-line-of-sight environments, strong signals can be detected 100 m to 200 m from potential cell sites, potentially with multiple clusters to support spatial multiplexing.
Edit intent: fluency
Original:  Moreover, a system simulation based on the models predicts that mmW systems with cell radii of 100m can offer an order of magnitude increase in capacity over current state-of-the-art 4G cellular networks with similar cell density .
Revised:  Moreover, a system simulation based on the models predicts that mmW systems can offer an order of magnitude increase in capacity over current state-of-the-art 4G cellular networks with similar cell density .
Edit intent: clarity
Original:   Here we construct a simplified cell-cycle model in budding yeast to investigate the underlying mechanism that ensures the robustness in the multi-step process .
Revised:  To ensure genome stability and genetic information inheritance, this regulatory network must be dynamically robust against various fluctuations. Here we construct a simplified cell-cycle model in budding yeast to investigate the underlying mechanism that ensures the robustness in the multi-step process .
Edit intent: clarity
Original:   Here we construct a simplified cell-cycle model in budding yeast to investigate the underlying mechanism that ensures the robustness in the multi-step process .
Revised:  Here we construct a simplified cell cycle model for a budding yeast to investigate the underlying mechanism that ensures the robustness in the multi-step process .
Edit intent: fluency
Original:  First, we establish a three-variable model and select a parameter set that can qualitatively describe the yeast cell-cycle process.
Revised:  First, we establish a three-variable model and select a parameter set that qualitatively describes the yeast cell cycle process.
Edit intent: clarity
Original:  These results highlight the dynamical regulatory mechanism for complex biological processes to execute successive events and multi-task .
Revised:  These results not only highlight a regulatory mechanism for complex biological processes to execute successive events and multi-task .
Edit intent: clarity
Original:  These results highlight the dynamical regulatory mechanism for complex biological processes to execute successive events and multi-task .
Revised:  These results highlight the dynamical regulatory mechanism for executing successive cell cycle processes, but also provide a possible strategy for the synthetic network design of sequential-task processes .
Edit intent: clarity
Original:  In this work we define a procedure in order to reduce the condition number based on building an ellipsoid that closely matches the sampling space .
Revised:  In this work we focus on rounding procedures based on building an ellipsoid that closely matches the sampling space .
Edit intent: clarity
Original:  This defines an affine transformation that renders the space homogeneous and suited to an efficient sampling by means of an Hit-and-Run Montecarlo markov chain .
Revised:  This defines an affine transformation that renders the space homogeneous and suited to an efficient sampling by means of an Hit-and-Run markov chain Monte Carlo .
Edit intent: fluency
Original:  We propose two methods in order to build the ellipsoid: one based on principal component analysis and the other on linear programming .
Revised:  We propose two methods in order to build the ellipsoid: one based on principal component analysis (PCA), the second on linear programming .
Edit intent: clarity
Original:  This is the case of inferring the feasible steady states in models of metabolic networks, since they can show heterogeneous timescales .
Revised:  This is the case of inferring the feasible steady states in models of metabolic networks, since they can show heterogeneous time scales .
Edit intent: fluency
Original:  In this way the uniformity of the sampling  is rigorously guaranteed  at odds with procedures based on non-markovian dynamics .
Revised:  In this way the uniformity of the sampling is rigorously guaranteed , at odds with procedures based on non-markovian dynamics .
Edit intent: fluency
Original:  In this way the uniformity of the sampling  is rigorously guaranteed  at odds with procedures based on non-markovian dynamics .
Revised:  In this way the uniformity of the sampling is rigorously guaranteed at odds with non markovian methods .
Edit intent: clarity
Original:  The first is based on principal component analysis (PCA), the second on linear programming (LP) and finally we employ the Lovazs ellipsoid method (LEM).
Revised:  The first is based on principal component analysis (PCA), the second on linear programming (LP) and finally we employ the lovasz ellipsoid method (LEM).
Edit intent: fluency
Original:  Our results show that a rounding procedure is mandatory for such inference problems and suggest that a combination of LEM or LP with a subsequent PCA seems to perform the best  .
Revised:  Our results show that a rounding procedure is mandatory for such inference problems and suggest that a combination of LEM or LP with a subsequent PCA perform the best .
Edit intent: clarity
Original: This work establishes the complexity class of several instances of the S-coloring problem: For a graph G, a positive integer k and a non decreasing list of integers S = ( s1 , ..., sk ), G admits a S-coloring , if its vertices can be partitioned into sets Xsi , i = 1,... , k, where each Xsi being an si -packing (a set of vertices at pairwise distance greater than si ).
Revised: This work establishes the complexity class of several instances of the S-packing coloring problem: for a graph G, a positive integer k and a non decreasing list of integers S = ( s1 , ..., sk ), G admits a S-coloring , if its vertices can be partitioned into sets Xsi , i = 1,... , k, where each Xsi being an si -packing (a set of vertices at pairwise distance greater than si ).
Edit intent: fluency
Original: This work establishes the complexity class of several instances of the S-coloring problem: For a graph G, a positive integer k and a non decreasing list of integers S = ( s1 , ..., sk ), G admits a S-coloring , if its vertices can be partitioned into sets Xsi , i = 1,... , k, where each Xsi being an si -packing (a set of vertices at pairwise distance greater than si ).
Revised: This work establishes the complexity class of several instances of the S-coloring problem: For a graph G, a positive integer k and a non decreasing list of integers S = ( s_1 , ..., sk ), G admits a S-coloring , if its vertices can be partitioned into sets Xsi , i = 1,... , k, where each Xsi being an si -packing (a set of vertices at pairwise distance greater than si ).
Edit intent: clarity
Original: This work establishes the complexity class of several instances of the S-coloring problem: For a graph G, a positive integer k and a non decreasing list of integers S = ( s1 , ..., sk ), G admits a S-coloring , if its vertices can be partitioned into sets Xsi , i = 1,... , k, where each Xsi being an si -packing (a set of vertices at pairwise distance greater than si ).
Revised: This work establishes the complexity class of several instances of the S-coloring problem: For a graph G, a positive integer k and a non decreasing list of integers S = ( s1 , ..., s_k ), G admits a S-coloring , if its vertices can be partitioned into sets Xsi , i = 1,... , k, where each Xsi being an si -packing (a set of vertices at pairwise distance greater than si ).
Edit intent: clarity
Original: This work establishes the complexity class of several instances of the S-coloring problem: For a graph G, a positive integer k and a non decreasing list of integers S = ( s1 , ..., sk ), G admits a S-coloring , if its vertices can be partitioned into sets Xsi , i = 1,... , k, where each Xsi being an si -packing (a set of vertices at pairwise distance greater than si ).
Revised: This work establishes the complexity class of several instances of the S-coloring problem: For a graph G, a positive integer k and a non decreasing list of integers S = ( s1 , ..., sk ), G is S-colorable , if its vertices can be partitioned into sets Xsi , i = 1,... , k, where each Xsi being an si -packing (a set of vertices at pairwise distance greater than si ).
Edit intent: clarity
Original: This work establishes the complexity class of several instances of the S-coloring problem: For a graph G, a positive integer k and a non decreasing list of integers S = ( s1 , ..., sk ), G admits a S-coloring , if its vertices can be partitioned into sets Xsi , i = 1,... , k, where each Xsi being an si -packing (a set of vertices at pairwise distance greater than si ).
Revised: This work establishes the complexity class of several instances of the S-coloring problem: For a graph G, a positive integer k and a non decreasing list of integers S = ( s1 , ..., sk ), G admits a S-coloring , if its vertices can be partitioned into sets S_i , i = 1,... , k, where each Xsi being an si -packing (a set of vertices at pairwise distance greater than si ).
Edit intent: clarity
Original:  the size of spines is optimal for probability codingof Ca2+ increases, which makes robust and sensitive to input timing information .
Revised:  the size of spines is optimal for information coding. Spines code input timing information by the probability of Ca^{2+ increases, which makes robust and sensitive to input timing information .
Edit intent: clarity
Original:  the size of spines is optimal for probability codingof Ca2+ increases, which makes robust and sensitive to input timing information .
Revised:  the size of spines is optimal for probability codingof Ca2+ increases, which makes robust and sensitive information coding possible .
Edit intent: clarity
Original:  We created a stochastic simulation model of input timing-dependent Ca2+ increases in a cerebellar Purkinje cells spine.
Revised:  We created a stochastic simulation model of input timing-dependent Ca^{2+ increases in a cerebellar Purkinje cells spine.
Edit intent: fluency
Original:  We created a stochastic simulation model of input timing-dependent Ca2+ increases in a cerebellar Purkinje cells spine.
Revised:  We created a stochastic simulation model of input timing-dependent Ca2+ increases in a cerebellar Purkinje cell's spine.
Edit intent: clarity
Original: This technical report introduces three metrics of user engagement with online media.
Revised: This technical report discusses three metrics of user engagement with online media.
Edit intent: clarity
Original:  Paper concludes by discussing future applications and the needs of the quantification of user interaction with new media services.
Revised:  The paper concludes by discussing future applications and the needs of the quantification of user interaction with new media services.
Edit intent: fluency
Original: An proof is presented that gene regulatory networks (GRNs) based solely on protein transcription factors (TFs) cannot control the development of complex multicellular life.
Revised: A proof is presented that gene regulatory networks (GRNs) based solely on protein transcription factors (TFs) cannot control the development of complex multicellular life.
Edit intent: fluency