wanyu/IteraTeR_v2 huggingface dataset:
Original:  By focusing on the  spreading data of six typical events on Sina Weibo, we surprisingly find that the spreading of modern news shows some new features, i.e. either explosively fast or slow, depending on the individual events.
Revised:  By focusing on the spreading data of six typical events on Sina Weibo, we surprisingly find that the spreading of modern news shows some new features, i.e. either extremely fast or slow, depending on the individual events.
Edit intent: clarity
Original:  By numerical simulations we show that the model can reproduce the main spreading patterns of the six typical events and the spreading speed can be promoted by increasing either the strength of information sensitivity or the social reinforcement.
Revised:  Numerical simulations show that the model can reproduce the main spreading patterns of the six typical events and the spreading speed can be promoted by increasing either the strength of information sensitivity or the social reinforcement.
Edit intent: coherence
Original:  By numerical simulations we show that the model can reproduce the main spreading patterns of the six typical events and the spreading speed can be promoted by increasing either the strength of information sensitivity or the social reinforcement.
Revised:  By numerical simulations we show that the model can reproduce the main spreading patterns of the six typical events and the spreading speed can be promoted by increasing either the strength of information sensitivity or social reinforcement.
Edit intent: fluency
Original:  Moreover, we find that the dependence of final accepted size on some key parameters, such as the transmission probability and information sensitivity,  can change from continuous to discontinuous  when the strength of the social reinforcement is large.
Revised:  Depending on the transmission probability and information sensitivity, can change from continuous to discontinuous when the strength of the social reinforcement is large.
Edit intent: coherence
Original:  An edge-based theory analysis is presented to explain the explosive spreading by information sensitivity and social reinforcement .
Revised:  Moreover, an edge-based theory analysis is presented to explain the explosive spreading by information sensitivity and social reinforcement .
Edit intent: coherence
Original:  We study the concept of synchronizing data words in RAs: Does there exist a data word that sends all states of the RA to a single state?
Revised:  We study the concept of synchronizing data words in RAs: does there exist a data word that sends all states of the RA to a single state?
Edit intent: fluency
Original:  For deterministic RAs with k registers (k-DRAs), we prove that inputting data words with 2k+1 distinct data , from the infinite data domain , is sufficient to synchronize.
Revised:  For deterministic RAs with k registers (k-DRAs), we prove that inputting data words with 2k+1 distinct data from the infinite data domain , is sufficient to synchronize.
Edit intent: fluency
Original:  For deterministic RAs with k registers (k-DRAs), we prove that inputting data words with 2k+1 distinct data , from the infinite data domain , is sufficient to synchronize.
Revised:  For deterministic RAs with k registers (k-DRAs), we prove that inputting data words with 2k+1 distinct data , from the infinite data domain is sufficient to synchronize.
Edit intent: fluency
Original:  We show that the synchronizing problem for DRAs is in general PSPACE-complete, and  is NLOGSPACE-complete for 1-DRAs.
Revised:  We show that the synchronization problem for DRAs is in general PSPACE-complete, and is NLOGSPACE-complete for 1-DRAs.
Edit intent: fluency
Original:  We show that the synchronizing problem for DRAs is in general PSPACE-complete, and  is NLOGSPACE-complete for 1-DRAs.
Revised:  We show that the synchronizing problem for DRAs is in general PSPACE-complete, and it is NLOGSPACE-complete for 1-DRAs.
Edit intent: fluency
Original:  The synchronizing problem for NRAs is in general undecidable, however, we establish Ackermann-completeness of the problem for 1-NRAs.
Revised:  The synchronization problem for NRAs is in general undecidable, however, we establish Ackermann-completeness of the problem for 1-NRAs.
Edit intent: fluency
Original:  Our most substantial achievement is proving NEXPTIME-completeness of the length-bounded synchronizing problem for NRAs (length encoded in binary) .
Revised:  Another main result is the NEXPTIME-completeness of the length-bounded synchronizing problem for NRAs (length encoded in binary) .
Edit intent: clarity
Original:  Our most substantial achievement is proving NEXPTIME-completeness of the length-bounded synchronizing problem for NRAs (length encoded in binary) .
Revised:  Our most substantial achievement is proving NEXPTIME-completeness of the length-bounded synchronization problem for NRAs (length encoded in binary) .
Edit intent: clarity
Original:  Our most substantial achievement is proving NEXPTIME-completeness of the length-bounded synchronizing problem for NRAs (length encoded in binary) .
Revised:  Our most substantial achievement is proving NEXPTIME-completeness of the length-bounded synchronizing problem for NRAs , where a bound on the length of the synchronizing data word, written in binary, is given .
Edit intent: clarity
Original:  A variant of this last construction allows to prove that the bounded universality problem for NRAs is coNEXPTIME-complete .
Revised:  A variant of this last construction allows to prove that the bounded universality problem for NRAs is co-NEXPTIME-complete .
Edit intent: fluency
Original:  We anticipate that ongoing efforts to develop scalable whole-cell modeling tools will enable dramatically more comprehensive and more accurate whole-cell models, including models of human cells.
Revised:  We anticipate that ongoing efforts to develop scalable whole-cell modeling tools will enable dramatically more comprehensive and more accurate models, including models of human cells.
Edit intent: fluency
Original: Predicting individual-level mobility patterns is an imperative part of ubiquitous computing, in growing real-world applicationslike transport management and disease spread .
Revised: In many domain applications, a continuous timeline of human locations is critical; for example for understanding possible locations where a disease may spread, or the flow of traffic .
Edit intent: clarity
Original:  While data sources such as GPS trackers or Call Data Records are temporally-rich, they are expensive, often not publicly available , or garnered only in select locations, restricting their wide use.
Revised:  While data sources such as GPS trackers or Call Data Records are temporally-rich, they are expensive, often not publicly available or garnered only in select locations, restricting their wide use.
Edit intent: fluency
Original:  Accordingly, we propose a stochastic framework, Intermediate Location Computing (ILC) which combines approaches from several existing mobility prediction methods, alongside community behavior, to predict every missing location from an individual's social media timeline.
Revised:  Accordingly, we propose a stochastic framework, Intermediate Location Computing (ILC) which uses prior knowledge about human mobility patterns to predict every missing location from an individual's social media timeline.
Edit intent: clarity
Original:  We compare ILC with several state-of-the-art approaches .
Revised:  We compare ILC with a state-of-the-art approaches .
Edit intent: clarity
Original:  For three major cities, ILC predicts  at 1 and 2-hour resolution  with up to 86\% accuracy , 19\% better than compared methods.
Revised:  For three major cities, ILC predicts at 1 and 2-hour resolution , with up to 86\% accuracy , 19\% better than compared methods.
Edit intent: fluency
Original:  However, cooperating microbial groups can be evolutionarily unstable, since a cheating strain that does not secrete the public good can reproduce quicker and take over.
Revised:  However, cooperating microbial groups can be evolutionarily unstable, since cheating strains can reproduce quicker and take over.
Edit intent: clarity
Original:   Here we study  the effects of fluid advection patterns on group reproduction as a mechanism to enable or enhance social behavior in microbial populations.
Revised:  Here we study the effects of fluid advection on these patterns as a mechanism to enable or enhance social behavior in microbial populations.
Edit intent: clarity
Original:  Regions of the flow domain with higher shear admits high cooperativity and large population density, whereas low shear regions are devoid of life due to opportunistic mutations.
Revised:  Regions of the flow domain with higher shear admit high cooperativity and large population density, whereas low shear regions are devoid of life due to opportunistic mutations.
Edit intent: fluency
Original: Rank-one updating of the spectrum of a matrix is fundamental in classical perturbation theory.
Revised: Rank-one update of the spectrum of a matrix is fundamental in classical perturbation theory.
Edit intent: fluency
Original: Rank-one updating of the spectrum of a matrix is fundamental in classical perturbation theory.
Revised: Rank-one updating of the spectrum of a matrix is a fundamental problem in classical perturbation theory.
Edit intent: clarity
Original:  Each extension is then modeled as a perturbation problem and is solved by updating the leading eigenpairs .
Revised:  In particular, we model this extension as a perturbation problem and is solved by updating the leading eigenpairs .
Edit intent: coherence
Original:  We provide a theoretical analysis of the error for such approximation approach , and back it up with empirical results that illustrate the advantagesof our method .
Revised:  We provide a theoretical analysis of this extension method , and back it up with empirical results that illustrate the advantagesof our method .
Edit intent: clarity
Original:  We provide a theoretical analysis of the error for such approximation approach , and back it up with empirical results that illustrate the advantagesof our method .
Revised:  We provide a theoretical analysis of the error for such approximation approach , and back it up with numerical results that illustrate the advantagesof our method .
Edit intent: clarity
Original:  We provide a theoretical analysis of the error for such approximation approach , and back it up with empirical results that illustrate the advantagesof our method .
Revised:  We provide a theoretical analysis of the error for such approximation approach , and back it up with empirical results that illustrate its advantages .
Edit intent: clarity
Original:  Here, we introduce a method which allows perfect sampling from random graph models in exponential family form ( aka "exponential  random graph" models), using a variant of Coupling From The Past.
Revised:  Here, we introduce a method which allows perfect sampling from random graph models in exponential family form ( "exponential random graph" models), using a variant of Coupling From The Past.
Edit intent: clarity
Original:  Here, we introduce a method which allows perfect sampling from random graph models in exponential family form ( aka "exponential  random graph" models), using a variant of Coupling From The Past.
Revised:  Here, we introduce a method which allows perfect sampling from random graph models in exponential family form ( aka "exponential family random graph" models), using a variant of Coupling From The Past.
Edit intent: clarity
Original:  We prove that the  semantics proposed in the original paper is the free model of CKA with bounded parallel iteration, meaning the completeness of these axioms .
Revised:  We prove that the semantics proposed in the original paper ; consequently, these semantics are the free model of CKA with bounded parallel iteration, meaning the completeness of these axioms .
Edit intent: coherence
Original:  Moreover, it allows us to establish a Kleene Theorem for CKA, extending an earlier Kleene Theorem for a fragment of CKA.
Revised:  Moreover, the techniques developed along the way are reusable; in particular, they allow us to establish a Kleene Theorem for CKA, extending an earlier Kleene Theorem for a fragment of CKA.
Edit intent: coherence
Original:  It is also an incremental algorithm, useful for online streaming applications.
Edit intent: coherence
Original:  The matrix is partitioned into blocks and a truncated SVD of each block is used to obtain the final SVD. A comparison with existing techniques shows that a 5-10x speedup is possible.
Revised:  The matrix is partitioned into blocks and the truncated SVDs of blocks are merged to obtain the final SVD. A comparison with existing techniques shows that a 5-10x speedup is possible.
Edit intent: clarity
Original: General-valued constraint satisfaction problems (VCSPs) are generalisations of CSPs dealing with homomorphisms between two valued structures.
Revised: The constraint satisfaction problem (CSP) is concerned with homomorphisms between two valued structures.
Edit intent: clarity
Original:  Our result generalises a result of Dalmau, Kolaitis, and Vardi [CP'02] and Grohe [  JACM'07] showing that for CSPs of bounded arity the tractable restrictions are precisely those with bounded ]  treewidth modulo homomorphic equivalence.
Revised:  Our result generalises a result of Dalmau, Kolaitis, and Vardi [CP'02] , Grohe [ JACM'07] showing that for CSPs of bounded arity the tractable restrictions are precisely those with bounded ] treewidth modulo homomorphic equivalence.
Edit intent: fluency
Original: Smart grid can be considered as a complex network where each node represents generation unit, producer, and links represent transmission lines.
Revised: A smart grid can be considered as a complex network where each node represents generation unit, producer, and links represent transmission lines.
Edit intent: fluency
Original: Smart grid can be considered as a complex network where each node represents generation unit, producer, and links represent transmission lines.
Revised: Smart grid can be considered as a complex network where each node represents a generation unit or a consumer. Whereas links can be used to represent transmission lines.
Edit intent: clarity
Original:  Agent-based modeling (ABM) is a paradigm represents a complex system of autonomous agents and their interactions with each other.
Revised:  One way to study complex systems is by using the agent-based modeling (ABM) is a paradigm represents a complex system of autonomous agents and their interactions with each other.
Edit intent: clarity
Original:  Agent-based modeling (ABM) is a paradigm represents a complex system of autonomous agents and their interactions with each other.
Revised:  Agent-based modeling (ABM) paradigm. An ABM is a way of representing a paradigm represents a complex system of autonomous agents and their interactions with each other.
Edit intent: clarity
Original:  Agent-based modeling (ABM) is a paradigm represents a complex system of autonomous agents and their interactions with each other.
Revised:  Agent-based modeling (ABM) is a complex system of autonomous agents and their interactions with each other.
Edit intent: clarity
Original:  Agent-based modeling (ABM) is a paradigm represents a complex system of autonomous agents and their interactions with each other.
Revised:  Agent-based modeling (ABM) is a paradigm represents a complex system of autonomous agents interacting with each other.
Edit intent: clarity
Original:  Previously, numbers of study have been presented in  smart grid domain using ABM methodologies .
Revised:  Previously, a number of studies have been presented in smart grid domain using ABM methodologies .
Edit intent: fluency
Original:  Previously, numbers of study have been presented in  smart grid domain using ABM methodologies .
Revised:  Previously, numbers of study have been presented in the smart grid domain using ABM methodologies .
Edit intent: fluency
Original:  Previously, numbers of study have been presented in  smart grid domain using ABM methodologies .
Revised:  Previously, numbers of study have been presented in smart grid domain making use of the ABM paradigm .
Edit intent: clarity
Original:  In this paper, we present an ABM for smart grid  using a combination of agent-based and complex network based approaches.
Revised:  In this paper, we present an ABM for smart grid . We propose an ABM by using a combination of agent-based and complex network based approaches.
Edit intent: coherence
Original:  We compare these two specification techniques qualitatively as well as quantitatively and conclude that DREAM approach is better than ODD in term of understanding and replicating ABM .
Revised:  We compare these two specification approaches qualitatively as well as quantitatively and conclude that DREAM approach is better than ODD in term of understanding and replicating ABM .
Edit intent: clarity
Original:  In uplink, mostly channel aware scheduling with throughput maximization has been studied.
Revised:  In up-link, channel aware scheduling with throughput maximization has been studied.
Edit intent: clarity
Original:  Therefore, in this work, we propose an LTE uplink packet scheduling procedure with a realistic traffic source .
Revised:  Therefore, we propose an LTE uplink packet scheduling procedure with a realistic traffic source .
Edit intent: clarity
Original:  Therefore, in this work, we propose an LTE uplink packet scheduling procedure with a realistic traffic source .
Revised:  Therefore, in this work, we propose an optimal uplink packet scheduling procedure with a realistic traffic source .
Edit intent: clarity
Original:  Therefore, in this work, we propose an LTE uplink packet scheduling procedure with a realistic traffic source .
Revised:  Therefore, in this work, we propose an LTE uplink packet scheduling pro-cedure with realistic traffic sources .
Edit intent: fluency
Original:  Firstly, we advocate a joint channel and buffer aware algorithm, which seeks to maximize the actual number of bits transmitted once a user is scheduled .
Revised:  Firstly, we advocate a joint channel and buffer aware algorithm, which maximizes the actual transmitted bit-count .
Edit intent: clarity
Original:  Thereafter, we modify our algorithm to support traffic types with delay constraints.
Revised:  Thereafter, we introduce delay constraints in our algorithm to support traffic types with delay constraints.
Edit intent: clarity
Original:  Next, we enhance our algorithm to support multiple classes of traffic .
Revised:  Next, we enhance our algorithm by incorporating the varied delay and throughput requirements demanded by mixed traffic classes .
Edit intent: clarity
Original:  Finally, we have introduced priority flipping to minimize bandwidth starvation of lower priority traffics in presence of higher percentage of high priority traffic.
Revised:  Finally, we in-troduce priority flipping to minimize bandwidth starvation of lower priority traffics in presence of higher percentage of high priority traffic.
Edit intent: clarity
Original:  Finally, we have introduced priority flipping to minimize bandwidth starvation of lower priority traffics in presence of higher percentage of high priority traffic.
Revised:  Finally, we have introduced priority flipping to minimize bandwidth starvation of lower priority traffic in presence of higher percentage of high priority traffic.
Edit intent: fluency
Original: In this brief exploratory paper, we consider a free group based method of error correction.
Revised: In this brief exploratory paper, we present a novel free group based method of error correction.
Edit intent: clarity
Original:  Through example  we show that, in certain scenarios, our method of error correction is more efficient and more deterministic than minimum distance error correction.
Revised:  Through example , we show that, in certain scenarios, our method of error correction is more efficient and more deterministic than minimum distance error correction.
Edit intent: fluency
Original:  We argue that our method works well under specific conditions that have been shown to be met by certain neural systems.
Revised:  We argue that our method works well under specific conditions that have been shown to have been met by certain neural systems.
Edit intent: fluency
Original:  We hope that this might interest others in the role free groups might play in understanding how error correction of neural codes works.
Revised:  We hope that this might interest others in the role free groups may play in understanding how error correction of neural codes works.
Edit intent: fluency
Original:  Even with optimizations/ approximations, collaborative filtering (CF)  approaches require real-time computations involving very large vectors.
Revised:  Even with numerous optimizations and approximations, collaborative filtering (CF) approaches require real-time computations involving very large vectors.
Edit intent: clarity
Original:  While achieving private recommendations in this setup further requires communication of long encrypted vectors, making the whole process inefficient.
Revised:  Modifying such systems to achieve private recommendations further requires communication of long encrypted vectors, making the whole process inefficient.
Edit intent: clarity
Original:  We argue that attacking a classifier is very different from attacking a detector, and that the structure of detectors -- which must search for their own bounding box, and which cannot estimate that box very accurately -- makes it quite likely that adversarial patternsare strongly disrupted .
Revised:  We argue that attacking a classifier is very different from attacking a detector, and that the structure of detectors - which must search for their own bounding box, and which cannot estimate that box very accurately -- makes it quite likely that adversarial patternsare strongly disrupted .
Edit intent: fluency
Original:  We argue that attacking a classifier is very different from attacking a detector, and that the structure of detectors -- which must search for their own bounding box, and which cannot estimate that box very accurately -- makes it quite likely that adversarial patternsare strongly disrupted .
Revised:  We argue that attacking a classifier is very different from attacking a detector, and that the structure of detectors -- which must search for their own bounding box, and which cannot estimate that box very accurately - likely makes it difficult to make adversarial patterns .
Edit intent: clarity
Original:  and soon ).
Revised:  and so on ).
Edit intent: coherence
Original:  An ideal motor would translocate cargos with a high speed and a minimal error in transport distance (or time) , while consuming minimal amount of energy.
Revised:  An efficient motor in cargo transport would travel with a high speed and a minimal error in transport distance (or time) , while consuming minimal amount of energy.
Edit intent: clarity
Original:  An ideal motor would translocate cargos with a high speed and a minimal error in transport distance (or time) , while consuming minimal amount of energy.
Revised:  An ideal motor would translocate cargos with a high speed and a minimal error in transport time (or distance) while consuming minimal amount of energy.
Edit intent: fluency
Original:  The travel distance and its variance of motor are, however,  constrained by energy consumption, the physical principle of which has recently been formulated into the thermodynamic uncertainty relation.
Revised:  The travel distance and its variance of motor are, however, physically constrained by energy consumption, the physical principle of which has recently been formulated into the thermodynamic uncertainty relation.
Edit intent: fluency
Original:  The travel distance and its variance of motor are, however,  constrained by energy consumption, the physical principle of which has recently been formulated into the thermodynamic uncertainty relation.
Revised:  The travel distance and its variance of motor are, however, constrained by energy consumption, the principle of which has recently been formulated into the thermodynamic uncertainty relation.
Edit intent: clarity