wanyu/IteraTeR_v2 huggingface dataset:
Original:  The generalized version of the law , namely an inverse relationship between the frequency of a unit and its magnitude , holds also for the behaviors of other species and the genetic code.
Revised:  The generalized version of the law - an inverse relationship between the frequency of a unit and its magnitude , holds also for the behaviors of other species and the genetic code.
Edit intent: coherence
Original:  The generalized version of the law , namely an inverse relationship between the frequency of a unit and its magnitude , holds also for the behaviors of other species and the genetic code.
Revised:  The generalized version of the law , namely an inverse relationship between the frequency of a unit and its magnitude - holds also for the behaviors of other species and the genetic code.
Edit intent: fluency
Original:  The generalized version of the law , namely an inverse relationship between the frequency of a unit and its magnitude , holds also for the behaviors of other species and the genetic code.
Revised:  The generalized version of the law , namely an inverse relationship between the frequency of a unit and its magnitude , holds also for the behaviours of other species and the genetic code.
Edit intent: fluency
Original:  We generalize the information theoretic concept of mean code length as a mean energetic cost function over the probability and the magnitude of the symbols of the alphabet .
Revised:  To this end, we generalize the information theoretic concept of mean code length as a mean energetic cost function over the probability and the magnitude of the symbols of the alphabet .
Edit intent: clarity
Original:  We generalize the information theoretic concept of mean code length as a mean energetic cost function over the probability and the magnitude of the symbols of the alphabet .
Revised:  We generalize the information theoretic concept of mean code length as a mean energetic cost function over the probability and the magnitude of the types of the repertoire .
Edit intent: clarity
Original:  We show that the minimization of that cost function and a negative correlation between probability and the magnitude of symbols are intimately related.
Revised:  We show that the minimization of that cost function and a negative correlation between probability and the magnitude of types are intimately related.
Edit intent: clarity
Original:  This paper presents a new population-based search method , namely Negatively Correlated Search (NCS), which essentially maintains multiple individual search processes in parallel .
Revised:  This paper presents a new EA , namely Negatively Correlated Search (NCS), which essentially maintains multiple individual search processes in parallel .
Edit intent: clarity
Original:  This paper presents a new population-based search method , namely Negatively Correlated Search (NCS), which essentially maintains multiple individual search processes in parallel .
Revised:  This paper presents a new population-based search method , namely Negatively Correlated Search (NCS), which maintains multiple individual search processes in parallel .
Edit intent: clarity
Original:  In NCS, the search behaviors of individual search processes are modeled as probability distributions.
Revised:  In NCS, the search behaviors of individual search processes as probability distributions.
Edit intent: clarity
Original:  Negatively correlated search behaviors are explicitly promoted by encouraging difference among the probability distributions (search behaviors).
Revised:  Negatively correlated search behaviors by encouraging differences among the probability distributions (search behaviors).
Edit intent: clarity
Original:  By this means, individual search processes share information and cooperate with each other to search diverse regions of a search space, and makes NCS a promising method for multimodal problems .
Revised:  By this means, individual search processes share information and cooperate with each other to search diverse regions of a search space, which makes NCS a promising method for multimodal problems .
Edit intent: coherence
Original:  By this means, individual search processes share information and cooperate with each other to search diverse regions of a search space, and makes NCS a promising method for multimodal problems .
Revised:  By this means, individual search processes share information and cooperate with each other to search diverse regions of a search space, and makes NCS a promising method for non-convex optimization .
Edit intent: clarity
Original:  Empirical studies on a set of multimodal continuous optimization problems showed that NCS is competitive to 6 well-established meta-heuristic search methods in the sense that NCS achieved better solutions on majority of the tested problems .
Revised:  Empirical studies showed that NCS is competitive to 6 well-established meta-heuristic search methods in the sense that NCS achieved better solutions on majority of the tested problems .
Edit intent: clarity
Original:  Empirical studies on a set of multimodal continuous optimization problems showed that NCS is competitive to 6 well-established meta-heuristic search methods in the sense that NCS achieved better solutions on majority of the tested problems .
Revised:  Empirical studies on a set of multimodal continuous optimization problems showed that NCS is competitive to well-established meta-heuristic search methods in the sense that NCS achieved better solutions on majority of the tested problems .
Edit intent: clarity
Original:  Empirical studies on a set of multimodal continuous optimization problems showed that NCS is competitive to 6 well-established meta-heuristic search methods in the sense that NCS achieved better solutions on majority of the tested problems .
Revised:  Empirical studies on a set of multimodal continuous optimization problems showed that NCS is competitive to 6 well-established search methods in the sense that NCS achieved better solutions on majority of the tested problems .
Edit intent: clarity
Original:  Further , on heterogeneous processors, our SpGEMM approach achieves higher throughput by using re-allocatable shared virtual memory.
Revised:  Furthermore , on heterogeneous processors, our SpGEMM approach achieves higher throughput by using re-allocatable shared virtual memory.
Edit intent: fluency
Original:  A regular language is most complex in its class if it meets the quotient complexity (state complexity) bounds for boolean operations,product (concatenation) , star, and reversal, has the largest syntactic semigroup, and has the maximal number of atoms, each of which has maximal quotient complexity \dots } }  . It is known that there exist such most complex  regular languages, and also right ideals, leftideals ,  and two-sided ideals.
Revised:  A regular language is most complex in its class if it meets the quotient complexity (state complexity) bounds for boolean operations,product (concatenation) , \dots } } . It is known that there exist such most complex regular languages, and also right ideals, leftideals , and two-sided ideals.
Edit intent: coherence
Original:  A regular language is most complex in its class if it meets the quotient complexity (state complexity) bounds for boolean operations,product (concatenation) , star, and reversal, has the largest syntactic semigroup, and has the maximal number of atoms, each of which has maximal quotient complexity \dots } }  . It is known that there exist such most complex  regular languages, and also right ideals, leftideals ,  and two-sided ideals.
Revised:  A regular language is most complex in its class if it meets the quotient complexity (state complexity) bounds for boolean operations,product (concatenation) , star, and reversal, has the largest syntactic semigroup, and has the maximal number of atoms, each of which has maximal quotient complexity \dots } } . It is known that there exist such most complex streams in the class of regular languages, and also right ideals, leftideals , and two-sided ideals.
Edit intent: clarity
Original:  A regular language is most complex in its class if it meets the quotient complexity (state complexity) bounds for boolean operations,product (concatenation) , star, and reversal, has the largest syntactic semigroup, and has the maximal number of atoms, each of which has maximal quotient complexity \dots } }  . It is known that there exist such most complex  regular languages, and also right ideals, leftideals ,  and two-sided ideals.
Revised:  A regular language is most complex in its class if it meets the quotient complexity (state complexity) bounds for boolean operations,product (concatenation) , star, and reversal, has the largest syntactic semigroup, and has the maximal number of atoms, each of which has maximal quotient complexity \dots } } . It is known that there exist such most complex regular languages, and also right ideals, leftideals , left, and two-sided ideals.
Edit intent: coherence
Original:  In contrast to this, we prove that there does not exist a most complex  suffix-free regular language .
Revised:  In contrast to this, we prove that there does not exist a most complex suffix-free regular languages .
Edit intent: fluency
Original:  However, we do exhibit one ternary suffix-free witness that meets the bound for product and whose restrictions to binary alphabets meet the bounds for star and boolean operations.
Revised:  However, we do exhibit one ternary suffix-free stream that meets the bound for product and whose restrictions to binary alphabets meet the bounds for star and boolean operations.
Edit intent: clarity
Original:  We also exhibit a quinary witness that meets the bounds for boolean operations, reversal, size of syntactic semigroup, and atom complexities.
Revised:  We also exhibit a quinary stream that meets the bounds for boolean operations, reversal, size of syntactic semigroup, and atom complexities.
Edit intent: clarity
Original:  Moreover, we show that the bound for the product of two languages of quotient complexities m and n can be met in the binary case  for infinitely many m and n . Two transition semigroups play an important role for suffix-free languages:
Revised:  Moreover, we show that the bound for the product of two languages of quotient complexities m and n in the binary case for infinitely many m and n . Two transition semigroups play an important role for suffix-free languages:
Edit intent: clarity
Original:  Moreover, we show that the bound for the product of two languages of quotient complexities m and n can be met in the binary case  for infinitely many m and n . Two transition semigroups play an important role for suffix-free languages:
Revised:  Moreover, we show that the bound for the product of two languages of quotient complexities m and n can be met in the binary case by showing that it can be met for infinitely many m and n . Two transition semigroups play an important role for suffix-free languages:
Edit intent: clarity
Original:  semigroup T^{\le 5(n) is the largest suffix-free semigroup for n}%DIFDELCMD < \le %%% 5, while semigroup \mathbf{T^{\ge 6}(n) is largest for n=2,3 and n}%DIFDELCMD < \ge %%% 6. We prove that all witnesses meeting the bounds for the star and the second witness in a product must have transition semigroups in \mathbf{T^{\le 5}(n).
Revised:  semigroup T^{\le 5(n) is the largest suffix-free semigroup for n}%DIFDELCMD < \le %%% ^{\ge 6}(n) is largest for n=2,3 and n}%DIFDELCMD < \ge %%% 6. We prove that all witnesses meeting the bounds for the star and the second witness in a product must have transition semigroups in \mathbf{T^{\le 5}(n).
Edit intent: coherence
Original:  As a step in this direction we compute several new cases and completely determine the linear strands of the minimal free resolutions of the ideals generated by sub-permanents.
Revised:  As a step in this direction we compute several new cases and completely determine the linear strand of the minimal free resolutions of the ideals generated by sub-permanents.
Edit intent: fluency
Original:  Our motivation is to lay the groundwork for the use of commutative algebra in algebraic complexity theory , building on the use of Hilbert functions in work of Gupta-Kamath-Kayal-Saptharishi.
Revised:  Our motivation is to lay groundwork for the use of commutative algebra in algebraic complexity theory , building on the use of Hilbert functions in work of Gupta-Kamath-Kayal-Saptharishi.
Edit intent: fluency
Original: Proportion regulation in nature is realized through and limited to local interactions .
Revised: Proportion regulation in nature is realized through and limited to local communications .
Edit intent: clarity
Original:  Our results show that asymmetric properties in local interactions  are crucial for adaptive regulation, which depends on group size and overall density.
Revised:  Our results show that asymmetric properties in local interactions are crucial for adaptive regulation, which depends on overall density.
Edit intent: clarity
Original: Proportion regulation in nature is realized through and limited to local communications.
Edit intent: coherence
Original:  One of the fundamental mysteries in biology concerns the method by which a cluster of organisms can regulate the proportion of individuals that perform various roles  as if each individual knows a whole situation , without a leader.
Revised:  One of the fundamental problems in biology concerns the method by which a cluster of organisms can regulate the proportion of individuals that perform various roles as if each individual knows a whole situation , without a leader.
Edit intent: clarity
Original:  One of the fundamental mysteries in biology concerns the method by which a cluster of organisms can regulate the proportion of individuals that perform various roles  as if each individual knows a whole situation , without a leader.
Revised:  One of the fundamental mysteries in biology concerns the method by which a cluster of organisms can regulate the proportion of individuals that perform various roles or modes as if each individual knows a whole situation , without a leader.
Edit intent: clarity
Original:  One of the fundamental mysteries in biology concerns the method by which a cluster of organisms can regulate the proportion of individuals that perform various roles  as if each individual knows a whole situation , without a leader.
Revised:  One of the fundamental mysteries in biology concerns the method by which a cluster of organisms can regulate the proportion of individuals that perform various roles as if each individual knows a whole situation without a leader.
Edit intent: fluency
Original:  This study focused on the fact that regulating system exists in various species , and found a common basis which is described by a series of local communications between individualswith creature-likeness .
Revised:  A specific ratio exists in various species , and found a common basis which is described by a series of local communications between individualswith creature-likeness .
Edit intent: clarity
Original:  This study focused on the fact that regulating system exists in various species , and found a common basis which is described by a series of local communications between individualswith creature-likeness .
Revised:  This study focused on the fact that regulating system exists in various species , and found a common basis of regulating a collective behavior which is realized by a series of local communications between individualswith creature-likeness .
Edit intent: clarity
Original:  This study focused on the fact that regulating system exists in various species , and found a common basis which is described by a series of local communications between individualswith creature-likeness .
Revised:  This study focused on the fact that regulating system exists in various species , and found a common basis which is described by a series of local contacts between individuals .
Edit intent: clarity
Original:  The most essential behavior of individuals in this theory is to change its internal mode through sharing information in communication with others.
Revised:  The most essential behavior of individuals in this theory is to change its internal mode through sharing information in contact with others.
Edit intent: clarity
Original:  From the theoretical analysis  , we found that asymmetric properties in local interactions originated from difference of parameter values in communication are crucial for adaptive regulation , which depends on overall density.
Revised:  From the theoretical analysis , we found that asymmetric properties in local contacts, are essential for adaptive regulation , which depends on overall density.
Edit intent: clarity
Original:  Furthermore, the critical condition which eliminates overlap with one another (excluded volume effect) also affects the resulting proportion in high density.
Revised:  Furthermore, a discrete system is crucial in no-leader groups to realize the flexible regulation, and the critical condition which eliminates overlap with one another (excluded volume effect) also affects the resulting proportion in high density.
Edit intent: coherence
Original:  The foremost advantage of this strategy is that no global information is required for each individual, and only a couple of transformations for each individual can achieve the whole proportion regulation.
Revised:  The foremost advantage of this strategy is that no global information is required for each individual, and only a couple of mode switching can achieve the whole proportion regulation.
Edit intent: clarity
Original: Research interest on Online Social Networks  , has increased dramatically over the last decade, mainly because online networks provide a vast source of social information.
Revised: Research interest on Online Social Networks (OSNs) , has increased dramatically over the last decade, mainly because online networks provide a vast source of social information.
Edit intent: clarity
Original:  Graph structure, user connections, growth, information exposure and diffusion of online social networks , are some of the most frequently researched subjects.
Revised:  Graph structure, user connections, growth, information exposure and diffusion , are some of the most frequently researched subjects.
Edit intent: clarity
Original:  However, some areas of these networks are overlooked or even unconsidered , such as anonymity, equality and bias  .
Revised:  However, some areas of these networks , such as anonymity, equality and bias .
Edit intent: coherence
Original:  However, some areas of these networks are overlooked or even unconsidered , such as anonymity, equality and bias  .
Revised:  However, some areas of these networks are overlooked or even unconsidered , such as anonymity, equality and bias are overlooked or even unconsidered .
Edit intent: coherence
Original:  In the limited bibliographyavailable , such features seem to be influential to social interactions.
Revised:  In the related bibliography , such features seem to be influential to social interactions.
Edit intent: clarity
Original:  Based on an extensive thinking of these studies, we aim to determine how universal anonymity affects : bias, user equality, information propagation, sharing and exposure, connection establishment and network structure.
Revised:  Based on these studies, we aim to determine how universal anonymity affects : bias, user equality, information propagation, sharing and exposure, connection establishment and network structure.
Edit intent: clarity
Original:  Based on an extensive thinking of these studies, we aim to determine how universal anonymity affects : bias, user equality, information propagation, sharing and exposure, connection establishment and network structure.
Revised:  Based on an extensive thinking of these studies, we aim at determining how universal anonymity affects : bias, user equality, information propagation, sharing and exposure, connection establishment and network structure.
Edit intent: fluency
Original:  Based on an extensive thinking of these studies, we aim to determine how universal anonymity affects : bias, user equality, information propagation, sharing and exposure, connection establishment and network structure.
Revised:  Based on an extensive thinking of these studies, we aim to determine how universal anonymity affects bias, user equality, information propagation, sharing and exposure, connection establishment and network structure.
Edit intent: fluency
Original:  Based on an extensive thinking of these studies, we aim to determine how universal anonymity affects : bias, user equality, information propagation, sharing and exposure, connection establishment and network structure.
Revised:  Based on an extensive thinking of these studies, we aim to determine how universal anonymity affects : bias, user equality, information propagation, sharing and exposure, connection establishment , as well as network structure.
Edit intent: coherence
Original:  Thus  we propose a new Anonymous Online Social Network, which will facilitate every type of monitoring and data analysis .
Revised:  Thus , we propose a new Anonymous Online Social Network, which will facilitate every type of monitoring and data analysis .
Edit intent: fluency
Original:  Thus  we propose a new Anonymous Online Social Network, which will facilitate every type of monitoring and data analysis .
Revised:  Thus we propose a new Anonymous Online Social Network, which will facilitate a variety of monitoring and data analysis .
Edit intent: clarity
Original: A recent result of Moshkovitz ~ Moshkovitz14 presented an ingenious method to provide a completely elementary proof of the Parallel Repetition Theorem for certain projection games via a construction called fortification.
Revised: A recent result of Moshkovitz Moshkovitz14 presented an ingenious method to provide a completely elementary proof of the Parallel Repetition Theorem for certain projection games via a construction called fortification.
Edit intent: fluency
Original:  We also obtain a new lower bound on the tensor rank of  powers of the generalized W-state  .
Revised:  At the same time we obtain a new lower bound on the tensor rank of powers of the generalized W-state .
Edit intent: clarity
Original:  We also obtain a new lower bound on the tensor rank of  powers of the generalized W-state  .
Revised:  We also obtain a new lower bound on the tensor rank of powers of the generalised W-state .
Edit intent: fluency
Original: The emergence and popularization of online social networks suddenly made available a large amount of data from social organization, interaction and human behaviour .
Revised: The emergence and popularization of online social networks suddenly made available a large amount of data from social organization, interaction and human behavior .
Edit intent: fluency
Original:  This work describes how computational researches have approached this subject and the methods used to analyse such systems.
Revised:  This work describes how computational researches have approached this subject and the methods used to analyze such systems.
Edit intent: fluency
Original: A simulation of an interactive protocol entails the use of an interactive communication to produce the output of the protocol to within a fixed statistical distance \epsilon.
Revised: A simulation of an interactive protocol entails the use of interactive communication to produce the output of the protocol to within a fixed statistical distance \epsilon.
Edit intent: fluency
Original:  Recent works in the TCS community have propagated that the information complexity of the protocol plays a central role in characterizing the minimum number of bits that the parties must exchange for a successful simulation, namely the distributional communication complexity of simulating the protocol.
Revised:  Recent works have proposed that the information complexity of the protocol plays a central role in characterizing the minimum number of bits that the parties must exchange for a successful simulation, namely the distributional communication complexity of simulating the protocol.
Edit intent: clarity