wanyu/IteraTeR_v2 huggingface dataset:
Original:  How networks of spiking neurons can learn to reproduce these non-linear dynamics , using local, online and stable learning rules , is an important, open question .
Revised:  How networks of spiking neurons can learn to reproduce these non-linear dynamics , using local, online and stable learning rules .
Edit intent: clarity
Original:  hence we call the scheme FOLLOW ( Feedback-based Online Local Learning Of Weights ) The rule is local in the sense that weight changes depend on the presynaptic activity and the error signal projected onto the post-synaptic neuron.
Revised:  hence we call the scheme FOLLOW ( Feedback-based Online Local Learning Of Weights (FOLLOW) is local in the sense that weight changes depend on the presynaptic activity and the error signal projected onto the post-synaptic neuron.
Edit intent: clarity
Original:  hence we call the scheme FOLLOW ( Feedback-based Online Local Learning Of Weights ) The rule is local in the sense that weight changes depend on the presynaptic activity and the error signal projected onto the post-synaptic neuron.
Revised:  hence we call the scheme FOLLOW ( Feedback-based Online Local Learning Of Weights ) The rule is local in the sense that weight changes depend on the presynaptic activity and the error signal projected onto the postsynaptic neuron.
Edit intent: fluency
Original:  Using the Lyapunov method, and under reasonable assumptions and approximations, we show that FOLLOW learning is uniformly stable , with the error going to zero asymptotically.
Revised:  Using the Lyapunov method, and under reasonable assumptions and approximations, we show that FOLLOW learning is stable uniformly , with the error going to zero asymptotically.
Edit intent: fluency
Original:  Furthermore, instabilities are also introduced on the organism level: blood supply can be blocked by increased tissue pressure or the tortuousity of the tumor-neovascular vessels.
Revised:  Furthermore, instabilities are also introduced on the organism level: blood supply can be blocked by increased tissue pressure or the tortuosity of the tumor-neovascular vessels.
Edit intent: fluency
Original:  Here we introduce a cell-based computational model to study the effect of blood flow obstruction on the micro-evolution of cells within a tumorous tissue.
Revised:  Here we introduce a cell-based computational model to study the effect of blood flow obstruction on the micro-evolution of cells within a cancerous tissue.
Edit intent: clarity
Original:  Secondly, we show that instabilities in blood supply can impact the overall development of tumors and lead to the extinction of the dominant aggressive phenotype, showing a clear distinction between the fitness at the cell level and fitness at the populationlevel .
Revised:  Secondly, we show that instabilities in blood supply can impact the overall development of tumors and lead to the extinction of the dominant aggressive phenotype, showing a clear distinction between the fitness at the cell level and survival of the population .
Edit intent: clarity
Original:  These effects have become widespread in the on-line domain, where the data offers the potential to study competition among conventions at a fine-grained level.
Revised:  These effects have become widespread in the online domain, where the data offers the potential to study competition among conventions at a fine-grained level.
Edit intent: fluency
Original:  Our analysis is based on the spread of low-level authoring conventions in the e-print arXiv over 24 years: by tracking the spread of macros and other author-defined conventions, we are able to study conventions that vary even as the underlying meaning remains constant.
Revised:  Our analysis is based on the spread of low-level authoring conventions in the eprint arXiv over 24 years: by tracking the spread of macros and other author-defined conventions, we are able to study conventions that vary even as the underlying meaning remains constant.
Edit intent: fluency
Original:  Through our analysis we make predictions at the population level about the ultimate success of different synonymous conventions over time - and at the individual level about the outcome of "fights" between people over convention choices.
Revised:  Through our analysis we make predictions at the population level about the ultimate success of different synonymous conventions over time--at at the individual level about the outcome of "fights" between people over convention choices.
Edit intent: coherence
Original:  Through our analysis we make predictions at the population level about the ultimate success of different synonymous conventions over time--at at the individual level about the outcome of "fights" between people over convention choices.
Revised:  Through our analysis we make predictions at the population level about the ultimate success of different synonymous conventions over time--and at the individual level about the outcome of "fights" between people over convention choices.
Edit intent: fluency
Original:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study mostly of triangle enumeration, providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results (uselessness ( in terms of possibility of "faster" parameterized algorithms ) of certain parameters such as domination or chromatic number ).
Revised:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study of triangle enumeration, providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results (uselessness ( in terms of possibility of "faster" parameterized algorithms ) of certain parameters such as domination or chromatic number ).
Edit intent: coherence
Original:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study mostly of triangle enumeration, providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results (uselessness ( in terms of possibility of "faster" parameterized algorithms ) of certain parameters such as domination or chromatic number ).
Revised:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study mostly of triangle enumeration, providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results (uselessness in terms of possibility of "faster" parameterized algorithms ) of certain parameters such as domination or chromatic number ).
Edit intent: fluency
Original:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study mostly of triangle enumeration, providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results (uselessness ( in terms of possibility of "faster" parameterized algorithms ) of certain parameters such as domination or chromatic number ).
Revised:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study mostly of triangle enumeration, providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results (uselessness ( in terms of possibility of "faster" parameterized algorithms of certain parameters such as domination or chromatic number ).
Edit intent: fluency
Original:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study of triangle enumeration, providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results (  uselessness in terms of possibility of "faster" parameterized algorithms of certain parameters such as  diameter).
Revised:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study of triangle enumeration, providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results ( likely uselessness in terms of possibility of "faster" parameterized algorithms of certain parameters such as diameter).
Edit intent: fluency
Original:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study of triangle enumeration, providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results (  uselessness in terms of possibility of "faster" parameterized algorithms of certain parameters such as  diameter).
Revised:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study of triangle enumeration, providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results ( uselessness in terms of "faster" parameterized algorithms of certain parameters such as diameter).
Edit intent: clarity
Original: Listing all triangles in an undirected graph is a fundamental graph primitive with numerous applications.
Revised: The task of listing all triangles in an undirected graph is a fundamental graph primitive with numerous applications.
Edit intent: clarity
Original:  It has seen a significant body of work contributing to both theoretical aspects (e.g., lower and upper bounds on running time, adaption to new computational models) as well  practical aspects (e.g. algorithms tuned for large graphs).
Revised:  It has seen a significant body of work contributing to both theoretical aspects (e.g., lower and upper bounds on running time, adaption to new computational models) as well as practical aspects (e.g. algorithms tuned for large graphs).
Edit intent: fluency
Original:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study of triangle enumeration , providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results ( likely uselessness in terms of "faster" parameterized algorithms of certain parameters such as graph diameter)  .
Revised:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study of triangle enumeration . We provide both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results ( likely uselessness in terms of "faster" parameterized algorithms of certain parameters such as graph diameter) .
Edit intent: fluency
Original:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study of triangle enumeration , providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results ( likely uselessness in terms of "faster" parameterized algorithms of certain parameters such as graph diameter)  .
Revised:  Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study of triangle enumeration , providing both positive results (new enumerative kernelizations, "subcubic" parameterized solving algorithms) as well as negative results ( presumable uselessness in terms of "faster" parameterized algorithms of certain parameters such as graph diameter) .
Edit intent: clarity
Original: Recently, MacDonald et. al. showed that many algorithmic problems for  nilpotent groups including computation of normal forms, the subgroup membership problem, the conjugacy problem, and computation of presentations of subgroups can be done in Logspace.
Revised: Recently, Macdonald et. al. showed that many algorithmic problems for nilpotent groups including computation of normal forms, the subgroup membership problem, the conjugacy problem, and computation of presentations of subgroups can be done in Logspace.
Edit intent: fluency
Original: Recently, MacDonald et. al. showed that many algorithmic problems for  nilpotent groups including computation of normal forms, the subgroup membership problem, the conjugacy problem, and computation of presentations of subgroups can be done in Logspace.
Revised: Recently, MacDonald et. al. showed that many algorithmic problems for nilpotent groups including computation of normal forms, the subgroup membership problem, the conjugacy problem, and computation of subgroup presentations can be done in Logspace.
Edit intent: fluency
Original:  Here we follow their approach and show that all these problems are actually complete for the uniform circuit class TC^0 -
Revised:  Here we follow their approach and show that all these problems are complete for the uniform circuit class TC^0 -
Edit intent: clarity
Original:  The modular design of nature is found to make the antenna non-reciprocal , hence more efficient .
Revised:  The modular design of nature is found to make the antenna non-reciprocal .
Edit intent: clarity
Original: Cascades on social and information networks have been a popular subject of study in the past decade, and there is a considerable literature on phenomena such as diffusion mechanisms, virality, cascade prediction, and peer network effects.
Revised: Cascades on online networks have been a popular subject of study in the past decade, and there is a considerable literature on phenomena such as diffusion mechanisms, virality, cascade prediction, and peer network effects.
Edit intent: clarity
Original:  While versions of this question have been considered from the perspective of the "producers " of cascades, any answer to this question must also take into account the effect of cascades on their audience.
Revised:  While versions of this question have been considered from the perspective of the producers of cascades, any answer to this question must also take into account the effect of cascades on their audience.
Edit intent: fluency
Original:  In this work, we seek to fill this gap by providing a consumer perspective of information cascades . Users on online networks play the dual role of producers and consumers.
Revised:  In this work, we seek to fill this gap by providing a consumer perspective of cascade . Users on online networks play the dual role of producers and consumers.
Edit intent: clarity
Original:  We measure how often users observe retweets in their home timeline, and observe a phenomenon that we term the "Impressions Paradox": the share of impressions for cascades of size k decays much more slowly than frequency of cascades of size k.
Revised:  We measure how often users observe retweets in their home timeline, and observe a phenomenon that we term the "Impressions Paradox": the share of impressions for cascades of size k decays much slower than frequency of cascades of size k.
Edit intent: fluency
Original:  Motivated by our findings, we posit a simple theoretical model that focuses on the effect of cascades on the audience.
Revised:  Motivated by our findings, we posit a theoretical model that focuses on the effect of cascades on the audience.
Edit intent: clarity
Original: We present PORTHOS , the first tool that discovers porting bugs in performance-critical code.
Revised: We present Porthos , the first tool that discovers porting bugs in performance-critical code.
Edit intent: fluency
Original:  PORTHOS takes as input a program , the memory model of the source architecture for which the program has been developed , and the memory model of the targeted architecture .
Revised:  Porthos takes as input a program , the memory model of the source architecture for which the program has been developed , and the memory model of the targeted architecture .
Edit intent: fluency
Original:  PORTHOS takes as input a program , the memory model of the source architecture for which the program has been developed , and the memory model of the targeted architecture .
Revised:  PORTHOS takes as input a program and the memory models of the source architecture for which the program has been developed , and the memory model of the targeted architecture .
Edit intent: coherence
Original:  PORTHOS takes as input a program , the memory model of the source architecture for which the program has been developed , and the memory model of the targeted architecture .
Revised:  PORTHOS takes as input a program , the memory model of the source architecture for which the program has been developed and the target model to which it is ported .
Edit intent: clarity
Original:  If the code is not portable, PORTHOS finds a porting bug in the form of an unexpected execution - an execution that is consistent with the target but inconsistent with the source memory model.
Revised:  If the code is not portable, Porthos finds a bug in the form of an unexpected execution - an execution that is consistent with the target but inconsistent with the source memory model.
Edit intent: clarity
Original:  Technically, PORTHOS implements a bounded model checking method that reduces portability analysis to the satisfiability modulo theories (SMT) problem with integer difference logic .
Revised:  Technically, Porthos implements a bounded model checking method that reduces portability analysis to the satisfiability modulo theories (SMT) problem with integer difference logic .
Edit intent: fluency
Original:  Technically, PORTHOS implements a bounded model checking method that reduces portability analysis to the satisfiability modulo theories (SMT) problem with integer difference logic .
Revised:  Technically, PORTHOS implements a bounded model checking method that reduces the portability analysis problem to satisfiability modulo theories (SMT) problem with integer difference logic .
Edit intent: fluency
Original:  Technically, PORTHOS implements a bounded model checking method that reduces portability analysis to the satisfiability modulo theories (SMT) problem with integer difference logic .
Revised:  Technically, PORTHOS implements a bounded model checking method that reduces portability analysis to the satisfiability modulo theories (SMT) .
Edit intent: clarity
Original:  There are two  problems in the reduction that are unique to portability and that we present novel and efficient solutions for.
Revised:  There are two main problems in the reduction that are unique to portability and that we present novel and efficient solutions for.
Edit intent: clarity
Original:  There are two  problems in the reduction that are unique to portability and that we present novel and efficient solutions for.
Revised:  There are two problems in the reduction that we present novel and efficient solutions for.
Edit intent: clarity
Original:  First, the formulation of portability contains a quantifier alternation (consistent + inconsistent).
Revised:  First, the formulation of the portability problem contains a quantifier alternation (consistent + inconsistent).
Edit intent: clarity
Original:  We encode inconsistency as an existential query.
Revised:  We introduce a formula that encodes both in a single existential query.
Edit intent: clarity
Original:  We compute the corresponding least fixed points ] efficiently in SMT. Interestingly, we are able to prove that our execution-based notion of portability is the most liberal one that admits an efficient algorithmic analysis: for state-based portability, a polynomial SAT encoding cannot exist.
Revised:  We compute the corresponding least fixed points ]) efficiently in SMT. Interestingly, we are able to prove that our execution-based notion of portability is the most liberal one that admits an efficient algorithmic analysis: for state-based portability, a polynomial SAT encoding cannot exist.
Edit intent: fluency
Original:  Experimental results show that our scheme achieves significant bits saving compared with HEVC anchor especially at low bit rates, leading to on average 5.5\% BD-rate on common test sequences and on average 9.0\% BD-rate on ultra high definition (UHD) test sequences.
Edit intent: coherence
Original:  Different from previous studies on down/ up-sampling based coding, the up-sampling interpolation filters in our scheme have been designed by training CNN instead of hand-crafted.
Revised:  Different from previous studies on down/ up-sampling-based coding, the up-sampling interpolation filters in our scheme have been designed by training CNN instead of hand-crafted.
Edit intent: fluency
Original:  Different from previous studies on down/ up-sampling based coding, the up-sampling interpolation filters in our scheme have been designed by training CNN instead of hand-crafted.
Revised:  Different from previous studies on down/ up-sampling based coding, the up-sampling methods in our scheme have been designed by training CNN instead of hand-crafted.
Edit intent: clarity
Original: Based on a set of subjects and a collection of descriptors obtained from the Alzheimer's Disease Neuroimaging Initiative database, we use redescription mining to find  rules revealing associations between these determinants which provides insights about the Alzheimer's disease (AD).
Revised: We used redescription mining to find rules revealing associations between these determinants which provides insights about the Alzheimer's disease (AD).
Edit intent: coherence
Original: Based on a set of subjects and a collection of descriptors obtained from the Alzheimer's Disease Neuroimaging Initiative database, we use redescription mining to find  rules revealing associations between these determinants which provides insights about the Alzheimer's disease (AD).
Revised: Based on a set of subjects and a collection of descriptors obtained from the Alzheimer's Disease Neuroimaging Initiative database, we use redescription mining to find interpretable rules revealing associations between these determinants which provides insights about the Alzheimer's disease (AD).
Edit intent: clarity
Original: Based on a set of subjects and a collection of descriptors obtained from the Alzheimer's Disease Neuroimaging Initiative database, we use redescription mining to find  rules revealing associations between these determinants which provides insights about the Alzheimer's disease (AD).
Revised: Based on a set of subjects and a collection of descriptors obtained from the Alzheimer's Disease Neuroimaging Initiative database, we use redescription mining to find rules revealing associations between those determinants that provide insights about the Alzheimer's disease (AD).
Edit intent: clarity
Original:  We applied a four-step redescription mining algorithm (CLUS-RM), which has been extended to engender constraint-based redescription mining (CBRM) and enables several modes of targeted exploration of specific, user-defined associations.
Revised:  We extended the CLUS-RM redescription mining algorithm (CLUS-RM), which has been extended to engender constraint-based redescription mining (CBRM) and enables several modes of targeted exploration of specific, user-defined associations.
Edit intent: clarity
Original:  We applied a four-step redescription mining algorithm (CLUS-RM), which has been extended to engender constraint-based redescription mining (CBRM) and enables several modes of targeted exploration of specific, user-defined associations.
Revised:  We applied a four-step redescription mining algorithm to a constraint-based redescription mining (CBRM) and enables several modes of targeted exploration of specific, user-defined associations.
Edit intent: clarity