wanyu/IteraTeR_v2 huggingface dataset:
Original:  Under standard population genetic models, the two estimates should give similar answers but we found a 30 fold difference.
Revised:  Under standard population genetic models, the two estimates should give similar answers but we found a thirty fold difference.
Edit intent: fluency
Original:  This discrepancy provides evidence for an 'epigenotype' model in which distinct ecotypes are maintained by selection on an otherwise homogeneous genetic background .
Revised:  We propose that this discrepancy is caused by the subdivision of the species into a hundred or more ecotypes which are maintained stably in the population .
Edit intent: clarity
Original:  To investigate the genetic factors involved, we used 54 unrelated isolates to conduct a genome wide scan for epistatically interacting loci.
Revised:  To investigate the genetic factors involved, we used 54 unrelated isolates to conduct a genome-wide scan for epistatically interacting loci.
Edit intent: fluency
Original:  (b) extremists instigate neighborhood polarization that propagates outward through undecided agents;
Revised:  (b) opinion subcultures, and
Edit intent: clarity
Original:  Computational experiments establish that these extensions produce three novel results: (a) sustained "strong " diversity of opinions across society , (b) opinion subcultures, and (c) pluralistic ignorance.
Revised:  Computational experiments establish that these extensions produce three novel results: (a) sustained strong diversity of opinions across society , (b) opinion subcultures, and (c) pluralistic ignorance.
Edit intent: fluency
Original:  The TPA has been implemented in Matlab and the codes are available at URL 
Revised:  The TPA has been implemented in Matlab and the codes are available at URL .
Edit intent: fluency
Original: The construction of a meaningful graph plays a crucial role in the success of many graph-based data representations and algorithms  , especially in the emerging field of signal processing on graphs .
Revised: The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms , especially in the emerging field of signal processing on graphs .
Edit intent: clarity
Original: The construction of a meaningful graph plays a crucial role in the success of many graph-based data representations and algorithms  , especially in the emerging field of signal processing on graphs .
Revised: The construction of a meaningful graph plays a crucial role in the success of many graph-based data representations and algorithms , especially in the emerging field of graph signal processing .
Edit intent: clarity
Original:  In  this paper, we address the problem of graph learning , where we are interested in learning  graph topologies, namely, the relationships between data entities, that well explain the signal observations.
Revised:  In this paper, we address the problem of learning graph topologies, namely, the relationships between data entities, that well explain the signal observations.
Edit intent: coherence
Original:  In particular, we want to infer a graph such that the input data forms graph signals with smooth variations on the resulting topology.
Revised:  In particular, we want to infer a graph such that the input data form graph signals with smooth variations on the resulting topology.
Edit intent: fluency
Original:  To this end, we adopt a factor analysis model for the graph signals and impose a Gaussian probabilistic prior on the latent variables that control these graph signals.
Revised:  To this end, we adopt a factor analysis model for the graph signals and impose a Gaussian probabilistic prior on the latent variables that control these signals.
Edit intent: fluency
Original:  We then propose an algorithm for learning graphs that enforce such smoothness property for the signal observations by minimizing the variations of the signals on the learned graph.
Revised:  We then propose an algorithm for learning graphs that enforce such property and is based on minimizing the variations of the signals on the learned graph.
Edit intent: clarity
Original:  Experiments on both synthetic and real world data demonstrate that the proposed graph learning framework can efficiently infer meaningful graph topologies from only the signal observations .
Revised:  Experiments on both synthetic and real world data demonstrate that the proposed graph learning framework can lead to efficiently inferring meaningful graph topologies from only the signal observations .
Edit intent: clarity
Original:  We then propose an algorithm for learning graphs that enforce such property and is based on minimizing the variations of the signals on the learned graph.
Revised:  We then propose an algorithm for learning graphs that enforces such property and is based on minimizing the variations of the signals on the learned graph.
Edit intent: fluency
Original:  Experiments on both synthetic and real world data demonstrate that the proposed graph learning framework can lead to efficiently inferring meaningful graph topologies from signal observations under the smoothness prior.
Revised:  Experiments on both synthetic and real world data demonstrate that the proposed graph learning framework can efficiently infer meaningful graph topologies from signal observations under the smoothness prior.
Edit intent: clarity
Original:  For this degenerate BSPDE, we prove the existence of the minimal nonnegative solution.
Revised:  For this degenerate BSPDE, we prove the existence and uniqueness of the nonnegative solution.
Edit intent: clarity
Original: We study a constrained optimal control problem allowing for degenerate coefficients .
Revised: We study a constrained optimal control problem with possibly degenerate coefficients arising in models of optimal portfolio liquidation under market impact .
Edit intent: clarity
Original:  The coefficients can be random and then the value function is described by a degenerate backward stochastic partial differential equation (BSPDE) with singular terminal condition.
Revised:  The coefficients can be random in which case the value function is described by a degenerate backward stochastic partial differential equation (BSPDE) with singular terminal condition.
Edit intent: clarity
Original:  For this degenerate BSPDE, we prove the existence and uniqueness of the nonnegative solution .
Revised:  For this degenerate BSPDE, we prove existence and uniqueness of the nonnegative solution .
Edit intent: fluency
Original: The quantification of symmetries in complex networks is typically done globally in terms of automorphisms.
Revised: Quantification of symmetries in complex networks is typically done globally in terms of automorphisms.
Edit intent: fluency
Original:  In this work we focus on local symmetries around nodes, which we call connectivity patterns.
Revised:  Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify the symmetries around nodes, which we call connectivity patterns.
Edit intent: clarity
Original:  namely the Erdos-R\'enyi, Barab\'asi-Albert, random geometric graph, Waxman, Voronoi and rewired Voronoi models . Real-world networks, namely the scientific areas of Wikipedia, the world-wide airport network and the street networks of Oldenburg and San Joaquin, are also analyzed in terms of the proposed symmetry measurements.
Revised:  namely the Erdos-R\'enyi, Barab\'asi-Albert, random geometric graph, Waxman, Voronoi and rewired Voronoi . Real-world networks, namely the scientific areas of Wikipedia, the world-wide airport network and the street networks of Oldenburg and San Joaquin, are also analyzed in terms of the proposed symmetry measurements.
Edit intent: clarity
Original: parse optimization refers to an optimization problem involving the zero-norm in objective or constraints.
Revised: Sparse optimization refers to an optimization problem involving the zero-norm in objective or constraints.
Edit intent: fluency
Original: We present some new results on realtime classical and quantum alternating  models.
Revised: We present new results on realtime classical and quantum alternating models.
Edit intent: clarity
Original:  Then, we define realtime private alternating finite automata (PAFAs) and show that they can recognize some non-regular unary languages, and the emptiness problem is undecidable for them.
Revised:  Then, we define realtime private alternating finite automata (PAFAs) . We show that the emptiness problem is undecidable for them.
Edit intent: coherence
Original:  For quantum finite automata (QFAs), we show that the emptiness problem  for universal QFAs on general alphabets and alternating QFAs with two alternations on unary alphabets are undecidable .
Revised:  Regarding quantum finite automata (QFAs), we show that the emptiness problem for universal QFAs on general alphabets and alternating QFAs with two alternations on unary alphabets are undecidable .
Edit intent: fluency
Original:  For quantum finite automata (QFAs), we show that the emptiness problem  for universal QFAs on general alphabets and alternating QFAs with two alternations on unary alphabets are undecidable .
Revised:  For quantum finite automata (QFAs), we show that the emptiness problem for universal QFAs on general alphabets , and for alternating QFAs with two alternations on unary alphabets are undecidable .
Edit intent: coherence
Original:  For quantum finite automata (QFAs), we show that the emptiness problem  for universal QFAs on general alphabets and alternating QFAs with two alternations on unary alphabets are undecidable .
Revised:  For quantum finite automata (QFAs), we show that the emptiness problem for universal QFAs on general alphabets and alternating QFAs with two alternations on unary alphabets .
Edit intent: clarity
Original: Distributed, controllable energy storage devices offer several significant benefits to electric power system operation.
Revised: Distributed, controllable energy storage devices offer several benefits to electric power system operation.
Edit intent: clarity
Original:  An algorithm for optimal charge/discharge scheduling of community energy storage (CES) devices as well as an analysis of several of the key drivers of such optimization are discussed.
Revised:  An algorithm for optimal charge/discharge scheduling of community energy storage (CES) devices as well as an analysis of several of the key drivers of the optimization are discussed.
Edit intent: clarity
Original:  However due to its low power it is greatly affected by interference provided by other wireless technology working on same ISM(industrial, scientific medical) band, such as IEEE 802.11b/g%DIFDELCMD < & %%% Bluetooth.
Revised:  However due to its low power it is greatly affected by interference provided by other wireless technology working on same ISM(industrial, scientific %DIFDELCMD < & %%% Bluetooth.
Edit intent: clarity
Original:  Using the framework of stochastic geometry, we analyze the association probability in the DL/UL and the coverage probability.
Revised:  Using the framework of stochastic geometry, we derive the association probability in the DL/UL and the coverage probability.
Edit intent: clarity
Original:  Using the framework of stochastic geometry, we analyze the association probability in the DL/UL and the coverage probability.
Revised:  Using the framework of stochastic geometry, we analyze the association probability for DL/UL and the coverage probability.
Edit intent: clarity
Original:  It is shown that , as the density of the FBSs increases compared to the density of the MBSs , a large fraction of devices chooses decoupled access - receive from a MBS in the DL and transmit through a FBS in the UL.
Revised:  It is shown that , as the density of the FBSs increases compared to the density of the MBSs , a large fraction of devices chooses decoupled access , i.e. receive from a MBS in the DL and transmit through a FBS in the UL.
Edit intent: clarity
Original:  It is shown that , as the density of the FBSs increases compared to the density of the MBSs , a large fraction of devices chooses decoupled access - receive from a MBS in the DL and transmit through a FBS in the UL.
Revised:  It is shown that , as the density of the FBSs increases compared to the density of the MBSs , a large fraction of devices chooses decoupled access - receive from a MBS in DL and transmit through a FBS in the UL.
Edit intent: fluency
Original:  Inspired by recent experiments, we consider a generic metapopulation model comprising `` rock-paper-scissors '' interactions via dominance removal and replacement, reproduction, mutations, pair-exchange and hopping of individuals.
Revised:  Inspired by recent experiments, we consider a generic metapopulation model comprising " rock-paper-scissors '' interactions via dominance removal and replacement, reproduction, mutations, pair-exchange and hopping of individuals.
Edit intent: fluency
Original:  Inspired by recent experiments, we consider a generic metapopulation model comprising `` rock-paper-scissors '' interactions via dominance removal and replacement, reproduction, mutations, pair-exchange and hopping of individuals.
Revised:  Inspired by recent experiments, we consider a generic metapopulation model comprising `` rock-paper-scissors " interactions via dominance removal and replacement, reproduction, mutations, pair-exchange and hopping of individuals.
Edit intent: fluency
Original:  Our results allows us to clarify when spatial `` rock-paper-scissors '' competition leads to stable spiral waves and under which circumstances they are influenced by nonlinear mobility.
Revised:  Our results allows us to clarify when spatial " rock-paper-scissors '' competition leads to stable spiral waves and under which circumstances they are influenced by nonlinear mobility.
Edit intent: fluency
Original:  Our results allows us to clarify when spatial `` rock-paper-scissors '' competition leads to stable spiral waves and under which circumstances they are influenced by nonlinear mobility.
Revised:  Our results allows us to clarify when spatial `` rock-paper-scissors " competition leads to stable spiral waves and under which circumstances they are influenced by nonlinear mobility.
Edit intent: fluency
Original: Tagging of multimedia content is becoming more and more widespread as web 2.0 sites, like Flickr and Facebook for images, YouTube and Vimeo for videos, have popularized tagging functionalities among their users.
Revised: Tagging of visual content is becoming more and more widespread as web 2.0 sites, like Flickr and Facebook for images, YouTube and Vimeo for videos, have popularized tagging functionalities among their users.
Edit intent: clarity
Original: Tagging of multimedia content is becoming more and more widespread as web 2.0 sites, like Flickr and Facebook for images, YouTube and Vimeo for videos, have popularized tagging functionalities among their users.
Revised: Tagging of multimedia content is becoming more and more widespread as web-based services and social networks have popularized tagging functionalities among their users.
Edit intent: clarity
Original:  However, not all media are equally tagged by users : using the current browsers is easy to tag a single photo, and even tagging a part of a photo, like a face, has become common in sites like Flickr and Facebook.
Revised:  However, not all media are equally tagged by users . Using the current systems is easy to tag a single photo, and even tagging a part of a photo, like a face, has become common in sites like Flickr and Facebook.
Edit intent: clarity
Original:  On the other hand  tagging a video sequence is more complicated and time consuming, so that users just tag the overall content of a video.
Revised:  On the other hand , tagging a video sequence is more complicated and time consuming, so that users just tag the overall content of a video.
Edit intent: fluency
Original:  This approach exploits collective knowledge embedded in user generated tags and web sources, and visual similarity of keyframes and images uploaded to social sites like YouTube and Flickr, as well as web image sources like Google Images and BingImages .
Revised:  Our approach exploits collective knowledge embedded in user generated tags and web sources, and visual similarity of keyframes and images uploaded to social sites like YouTube and Flickr, as well as web image sources like Google Images and BingImages .
Edit intent: fluency
Original:  This approach exploits collective knowledge embedded in user generated tags and web sources, and visual similarity of keyframes and images uploaded to social sites like YouTube and Flickr, as well as web image sources like Google Images and BingImages .
Revised:  This approach exploits collective knowledge embedded in user-generated tags and web sources, and visual similarity of keyframes and images uploaded to social sites like YouTube and Flickr, as well as web image sources like Google Images and BingImages .
Edit intent: fluency
Original:  This approach exploits collective knowledge embedded in user generated tags and web sources, and visual similarity of keyframes and images uploaded to social sites like YouTube and Flickr, as well as web image sources like Google Images and BingImages .
Revised:  This approach exploits collective knowledge embedded in user generated tags and web sources, and visual similarity of keyframes and images uploaded to social sites like YouTube and Flickr, as well as web sources like Google Images and BingImages .
Edit intent: clarity
Original:  (i) In the case of stochastic minibatch optimization , the algorithm can be used to split a composite objective function into blocks, each of these blocks being processed sequentially by the computer.
Revised:  (i) In the case of stochastic approximation methods , the algorithm can be used to split a composite objective function into blocks, each of these blocks being processed sequentially by the computer.
Edit intent: clarity
Original: Based on the idea of randomized coordinate descent of \alpha -averaged operators, we provide a randomized primal-dual algorithm .
Revised: Based on the idea of randomized coordinate descent of \alpha -averaged operators, we provide a randomized primal-dual algorithm .
Edit intent: fluency
Original: Based on the idea of randomized coordinate descent of \alpha -averaged operators, we provide a randomized primal-dual algorithm .
Revised: Based on the idea of randomized coordinate descent of \alpha -averaged operators, a randomized primal-dual algorithm .
Edit intent: clarity
Original:  In particular for }  S being the open sets we show that the absence of arbitrage opportunities, with respect to an opportune filtration enlargement, guarantees the existence of full support martingale measures.
Revised:  In particular for } S being the open sets , absence of Open Arbitrage is equivalent to the existence of full support martingale measures.
Edit intent: clarity
Original:  Finally we provide a dual representation  in terms of weakly open sets of probability measures, which highlights the robust nature of our approach .
Revised:  Finally we provide a dual representation in terms of weakly open sets of probability measures, which highlights the robust nature of this concept .
Edit intent: clarity
Original:  We consider the problems where wildcards are restricted to either the pattern or the text, however, the results can be easily adapted to the case where wildcards are allowed in both.
Revised:  We consider the problems where wildcards are restricted to either the pattern or the text, however, the results are easily adapted to the case where wildcards are allowed in both.
Edit intent: coherence
Original:  We analyse the algorithms average-case complexity and theirexpected-case complexity and show new lower bounds for the average-case complexity of the problems.
Revised:  We analyse the average-case complexity and theirexpected-case complexity and show new lower bounds for the average-case complexity of the problems.
Edit intent: clarity
Original:  We analyse the algorithms average-case complexity and theirexpected-case complexity and show new lower bounds for the average-case complexity of the problems.
Revised:  We analyse the algorithms average-case complexity expected-case complexity and show new lower bounds for the average-case complexity of the problems.
Edit intent: clarity
Original:  We analyse the algorithms average-case complexity and theirexpected-case complexity and show new lower bounds for the average-case complexity of the problems.
Revised:  We analyse the algorithms average-case complexity and their complexity and show new lower bounds for the average-case complexity of the problems.
Edit intent: clarity
Original: Proving deadlock freedom for distributed applications is complex.
Revised: Programming distributed applications free from communication deadlocks and races is complex.
Edit intent: clarity
Original:  It becomes even harder if those applications dynamically adapt to face needs which were unexpected when the application was deployed or even started .
Revised:  Preserving these properties when applications are updated at runtime is even harder .
Edit intent: clarity
Original:  Deadlock freedom follows as a corollary .
Revised:  As corollaries, DPOC applications are free from communication deadlocks and races, even in presence of runtime updates .
Edit intent: clarity
Original:  To illustrate how the behavior of a WSN can be optimized using data from external WSNs  , a specific use-case is considered, where the operation of a WSN measuring relative humidity is optimized using the data obtained from a WSN measuring temperature.
Revised:  To illustrate how the predictions using data from external WSNs , a specific use-case is considered, where the operation of a WSN measuring relative humidity is optimized using the data obtained from a WSN measuring temperature.
Edit intent: clarity
Original:  To illustrate how the behavior of a WSN can be optimized using data from external WSNs  , a specific use-case is considered, where the operation of a WSN measuring relative humidity is optimized using the data obtained from a WSN measuring temperature.
Revised:  To illustrate how the behavior of a WSN can be optimized using data from external WSNs can be utilized , a specific use-case is considered, where the operation of a WSN measuring relative humidity is optimized using the data obtained from a WSN measuring temperature.
Edit intent: clarity
Original:  Evaluated using a dedicated performance score, the simulation results show that this new approach can find a trade-off between energy consumption and quality of measurements.
Revised:  Based on a dedicated performance score, the simulation results show that this new approach can find a trade-off between energy consumption and quality of measurements.
Edit intent: clarity
Original: Complex social behaviors lie at the heart of many of the challenges facing evolutionary biology, sociology, economics  and beyond.
Revised: Complex social behaviors lie at the heart of many of the challenges facing evolutionary biology, sociology, economics , and beyond.
Edit intent: fluency
Original:  For evolutionary biologists in particular the question is often how such behaviors can arise de novo in a simple evolving system.
Revised:  For evolutionary biologists in particular the question is often how such behaviors can arise de novo in a simple evolving system.
Edit intent: fluency
Original:  How can group behaviors such as collective action, or complex decision making that accounts for memories of past experience, emerge and persist?
Revised:  How can group behaviors such as collective action, or decision making that accounts for memories of past experience, emerge and persist?
Edit intent: clarity
Original:  Evolutionary  theory provides a framework for formalizing such questions , and admitting them to rigorous study.
Revised:  Evolutionary theory provides a framework for formalizing these questions and admitting them to rigorous study.
Edit intent: fluency