wanyu/IteraTeR_v2 huggingface dataset:
Original:  To compute the expected information flow to a source vertex, we propose the F-tree as a specialized data structure, that identifies independent components of the graph for which the information flow can either be computed analytically and efficiently, or for which traditional Monte-Carlo sampling can be applied independent of the remaining network.
Revised:  To compute the expected information flow to a source vertex, we propose the F-tree as a specialized data structure, that identifies independent components of the graph for which the information flow can either be computed analytically and efficiently, or for which traditional Monte-Carlo sampling can be applied independently of the remaining network.
Edit intent: fluency
Original:  Our evaluation shows that these heuristics lead to high quality solutions, thus yielding high information flow, while maintaining low run-time .
Revised:  Our evaluation shows that these heuristics lead to high quality solutions, thus yielding high information flow, while maintaining low running time .
Edit intent: fluency
Original: Reliable propagation of information through large networks, e.g.  communication networks, social networks or sensor networks is very important in many applications concerning marketing, social networks, and wireless sensor networks.
Revised: Reliable propagation of information through large networks, e.g. , communication networks, social networks or sensor networks is very important in many applications concerning marketing, social networks, and wireless sensor networks.
Edit intent: fluency
Original: Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurovi\'{c et al. ( WABI 2015, full version to appearin IEEE TCBB ) introduced the minimum conflict-free row split (MCRS) problem: split each row of a given binary matrix into a bitwise OR of a set of rows so that the resulting matrix corresponds to a perfect phylogeny and has the minimum number of rows among all matrices with this property.
Revised: Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurovi\'c et al. ( WABI 2015, full version to appearin IEEE TCBB ) introduced the minimum conflict-free row split (MCRS) problem: split each row of a given binary matrix into a bitwise OR of a set of rows so that the resulting matrix corresponds to a perfect phylogeny and has the minimum number of rows among all matrices with this property.
Edit intent: fluency
Original: Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurovi\'{c et al. ( WABI 2015, full version to appearin IEEE TCBB ) introduced the minimum conflict-free row split (MCRS) problem: split each row of a given binary matrix into a bitwise OR of a set of rows so that the resulting matrix corresponds to a perfect phylogeny and has the minimum number of rows among all matrices with this property.
Revised: Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurovi\'{c et al. ( IEEE TCBB, to appear ) introduced the minimum conflict-free row split (MCRS) problem: split each row of a given binary matrix into a bitwise OR of a set of rows so that the resulting matrix corresponds to a perfect phylogeny and has the minimum number of rows among all matrices with this property.
Edit intent: coherence
Original:  Hujdurovi\'{c et al. proved that both problems are NP-hard, gave a related characterization of transitively orientable graphs, and proposed a polynomial time heuristic algorithm for the MCRS problem based on coloring cocomparability graphs.
Revised:  Hujdurovi\'c et al. proved that both problems are NP-hard, gave a related characterization of transitively orientable graphs, and proposed a polynomial time heuristic algorithm for the MCRS problem based on coloring cocomparability graphs.
Edit intent: fluency
Original:  Hujdurovi\'{c et al. proved that both problems are NP-hard, gave a related characterization of transitively orientable graphs, and proposed a polynomial time heuristic algorithm for the MCRS problem based on coloring cocomparability graphs.
Revised:  Hujdurovi\'{c et al. proved that both problems are NP-hard, gave a related characterization of transitively orientable graphs, and proposed a polynomial-time heuristic algorithm for the MCRS problem based on coloring cocomparability graphs.
Edit intent: fluency
Original:  Building on these formulations, we obtain new results on the two problems, including: (i) a strengthening of the heuristic by Hujdurovi\'{c et al. via a new min-max result in digraphs generalizing Dilworth's theorem,  (ii) APX-hardness results for both problems, (iii) two approximation algorithms for the MCRS problem, and (iv) a 2-approximation algorithm for the MDCRS problem.
Revised:  Building on these formulations, we obtain new results on the two problems, including: (i) a strengthening of the heuristic by Hujdurovi\'c et al. via a new min-max result in digraphs generalizing Dilworth's theorem, (ii) APX-hardness results for both problems, (iii) two approximation algorithms for the MCRS problem, and (iv) a 2-approximation algorithm for the MDCRS problem.
Edit intent: fluency
Original:  The branching formulations also lead to exact exponential time algorithms for solving the two problems to optimality faster than the na\"ive brute-force approach.
Revised:  The branching formulations also lead to exact exponential-time algorithms for solving the two problems to optimality faster than the na\"ive brute-force approach.
Edit intent: fluency
Original: Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurovi\'c et al. (IEEE TCBB, to appear) introduced the minimum conflict-free row split (MCRS) problem: split each row of a given binary matrix into a bitwise OR of a set of rows so that the resulting matrix corresponds to a perfect phylogeny and has the minimum  number of rows among all matrices with this property.
Revised: Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurovi\'c et al. (IEEE TCBB, to appear) introduced the minimum conflict-free row split (MCRS) problem: split each row of a given binary matrix into a bitwise OR of a set of rows so that the resulting matrix corresponds to a perfect phylogeny and has the minimum possible number of rows among all matrices with this property.
Edit intent: clarity
Original:  Hajirasouliha and Raphael also proposed the study of a similar problem, referred to as the minimum distinct conflict-free row split (MDCRS) problem, in which the task is to minimize the number of distinct rows of the resulting matrix.
Revised:  Hajirasouliha and Raphael also proposed the study of a similar problem, in which the task is to minimize the number of distinct rows of the resulting matrix.
Edit intent: clarity
Original:  Building on these formulations, we obtain new results on the two problems, including: (i) a strengthening of the heuristic by Hujdurovi\'c et al. via a new min-max result in digraphs generalizing Dilworth's theorem, which may be of independent interest, (ii) APX-hardness results for both problems, (iii) two approximation algorithmsfor the MCRS problem , and (iv) a 2-approximation algorithm for the MDCRS problem.
Revised:  Building on these formulations, we obtain new results on the two problems, including: (i) a strengthening of the heuristic by Hujdurovi\'c et al. via a new min-max result in digraphs generalizing Dilworth's theorem, which may be of independent interest, (ii) APX-hardness results for both problems, (iii) approximation algorithms , and (iv) a 2-approximation algorithm for the MDCRS problem.
Edit intent: fluency
Original:  The branching formulations also lead to exact exponential-time algorithms for solving the two problems to optimality faster than the na\"ive brute-force approach  .
Revised:  The branching formulations also lead to exact exponential-time algorithms solving the two problems to optimality faster than the na\"ive brute-force approach .
Edit intent: clarity
Original:  Using ideas from algebraic and tropical geometry, we provide a recursion formula for the number of complex solutions of such systems.
Revised:  Using ideas from algebraic and tropical geometry, we provide a recursive formula for the number of complex solutions of such systems.
Edit intent: fluency
Original:  More precisely, we are given an n-point set P, and a collection F = \{F_1, ..., F_m\} of subsets of P, and our goal is color P with two colors, red and blue, so that the largest absolute difference between the number of red elements and the number of blue elements ( i.e. the discrepancy) in any F_i is minimized.
Revised:  More precisely, we are given an n-point set P, and a collection F = \{F_1, ..., F_m\} of subsets of P, and our goal is color P with two colors, red and blue, so that the maximum over the F_i of the absolute difference between the number of red elements and the number of blue elements ( i.e. the discrepancy) in any F_i is minimized.
Edit intent: clarity
Original:  More precisely, we are given an n-point set P, and a collection F = \{F_1, ..., F_m\} of subsets of P, and our goal is color P with two colors, red and blue, so that the largest absolute difference between the number of red elements and the number of blue elements ( i.e. the discrepancy) in any F_i is minimized.
Revised:  More precisely, we are given an n-point set P, and a collection F = \{F_1, ..., F_m\} of subsets of P, and our goal is color P with two colors, red and blue, so that the largest absolute difference between the number of red elements and the number of blue elements ( the discrepancy) in any F_i is minimized.
Edit intent: coherence
Original:  We investigate the combinatorial discrepancy of geometrically defined set systems, in which P is an n-point set in d-dimensional space ,and F is the collection of subsets of P induced by dilations and translations of a fixed convex polytope B.
Revised:  We investigate the combinatorial discrepancy of geometrically defined systems, in which P is an n-point set in d-dimensional space ,and F is the collection of subsets of P induced by dilations and translations of a fixed convex polytope B.
Edit intent: fluency
Original:  Such set systems include  sets induced by axis-aligned boxes, whose discrepancy is the subject of the well known Tusnady problem.
Revised:  Such set systems include systems of sets induced by axis-aligned boxes, whose discrepancy is the subject of the well known Tusnady problem.
Edit intent: clarity
Original:  The primary challenge for this technique is identifying and extracting the molecular components within the crowded cellular environment.
Revised:  A primary challenge for this technique is identifying and extracting the molecular components within the crowded cellular environment.
Edit intent: fluency
Original: Recently  merging signal processing techniques with information security services has found lots of attentions . Steganography and steganalysis are among these emerging trends.
Revised: Recently , merging signal processing techniques with information security services has found lots of attentions . Steganography and steganalysis are among these emerging trends.
Edit intent: fluency
Original: Recently  merging signal processing techniques with information security services has found lots of attentions . Steganography and steganalysis are among these emerging trends.
Revised: Recently merging signal processing techniques with information security services has found a lot of attention . Steganography and steganalysis are among these emerging trends.
Edit intent: fluency
Original: Recently  merging signal processing techniques with information security services has found lots of attentions . Steganography and steganalysis are among these emerging trends.
Revised: Recently merging signal processing techniques with information security services has found lots of attentions . Steganography and steganalysis are among those trends.
Edit intent: clarity
Original:  Like their counterparts in cryptology, steganography and steganalysis are in a constant battle- steganography methods try to hide the presence of covert messages in innocuous-looking data, whereas steganalysis methods try to reveal existence of such messages and to break steganography methods.
Revised:  Like their counterparts in cryptology, steganography and steganalysis are in a constant battle. Steganography methods try to hide the presence of covert messages in innocuous-looking data, whereas steganalysis methods try to reveal existence of such messages and to break steganography methods.
Edit intent: fluency
Original:  The stream nature of audio signals, their popularity, and their wide spread usage makes them very suitable media for steganography.
Revised:  The stream nature of audio signals, their popularity, and their wide spread usage make them very suitable media for steganography.
Edit intent: fluency
Original:  This review intends to conduct a comprehensive survey of audio steganalysis methods aggregated over near fifteen years.
Revised:  This paper intends to conduct a comprehensive survey of audio steganalysis methods aggregated over near fifteen years.
Edit intent: clarity
Original:  This review intends to conduct a comprehensive survey of audio steganalysis methods aggregated over near fifteen years.
Revised:  This review intends to conduct a comprehensive review of audio steganalysis methods aggregated over near fifteen years.
Edit intent: fluency
Original: The problem of reducing the age-of-information has been extensively studied in the single-hop setting .
Revised: The problem of reducing the age-of-information has been extensively studied in the single-hop networks .
Edit intent: clarity
Original:  We first prove that for exponential packet transmission times , a preemptive Last Generated First Served (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy.
Revised:  If the packet transmission times , a preemptive Last Generated First Served (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy.
Edit intent: clarity
Original:  We then show that for the class of non-preemptive work-conserving policies, for any general packet transmission time distributions , the non-preemptive LGFS policy minimizes the age processes at all nodes of the network  (again in a stochastic ordering sense).
Revised:  In addition, for arbitrary general distributions of packet transmission times , the non-preemptive LGFS policy minimizes the age processes at all nodes of the network (again in a stochastic ordering sense).
Edit intent: clarity
Original:  We then show that for the class of non-preemptive work-conserving policies, for any general packet transmission time distributions , the non-preemptive LGFS policy minimizes the age processes at all nodes of the network  (again in a stochastic ordering sense).
Revised:  We then show that for the class of non-preemptive work-conserving policies, for any general packet transmission time distributions , the non-preemptive LGFS policy is shown to minimize the age processes at all nodes of the network (again in a stochastic ordering sense).
Edit intent: clarity
Original:   These optimality results not only hold for the age process , but also for any non-decreasing functional of the age process .
Revised:  These optimality results not only hold for the age processes , but also for any non-decreasing functional of the age process .
Edit intent: fluency
Original:   These optimality results not only hold for the age process , but also for any non-decreasing functional of the age process .
Revised:  These optimality results not only hold for the age process , but also for any non-decreasing functional of the age processes .
Edit intent: fluency
Original:  We found that trees at the lower distributional margin have lower first-order autocorrelation coefficients in annual growth and have experienced an increase in locally-absent rings ( stem-growth cessation ) since 2001.
Revised:  We found that trees at the lower distributional margin have experienced a higher rate of stem-growth cessation ) since 2001.
Edit intent: clarity
Original:  We found that trees at the lower distributional margin have lower first-order autocorrelation coefficients in annual growth and have experienced an increase in locally-absent rings ( stem-growth cessation ) since 2001.
Revised:  We found that trees at the lower distributional margin have lower first-order autocorrelation coefficients in annual growth and have experienced an increase in locally-absent rings ( stem-growth cessation events since 2001 compared to trees at other elevations.
Edit intent: clarity
Original:  If this occurs, it could potentially increase the mortality rate of lower distributional margin trees , especially those that are already experiencing events of temporary growth cessation.
Revised:  If this occurs, it could potentially increase the mortality rate of lower distributional margin trees could increase, especially of those that are already experiencing events of temporary growth cessation.
Edit intent: clarity
Original:  Using this notionwe first characterize the minimal dominating sets in a nontrivial lexicographic product of two graphs and then build on this characterization to characterize when a nontrivial lexicographic product of two graphsis well-dominated .
Revised:  Based on this notion, we characterize the family of minimal dominating sets in a nontrivial lexicographic product of two graphs and then build on this characterization to characterize when a nontrivial lexicographic product of two graphsis well-dominated .
Edit intent: clarity
Original:  Using this notionwe first characterize the minimal dominating sets in a nontrivial lexicographic product of two graphs and then build on this characterization to characterize when a nontrivial lexicographic product of two graphsis well-dominated .
Revised:  Using this notionwe first characterize the minimal dominating sets in a lexicographic product of two graphs and then build on this characterization to characterize when a nontrivial lexicographic product of two graphsis well-dominated .
Edit intent: fluency
Original:  Using this notionwe first characterize the minimal dominating sets in a nontrivial lexicographic product of two graphs and then build on this characterization to characterize when a nontrivial lexicographic product of two graphsis well-dominated .
Revised:  Using this notionwe first characterize the minimal dominating sets in a nontrivial lexicographic product of two graphs and derive a characterization of the well-dominated lexicographic product graphs .
Edit intent: clarity
Original:  In this paper , we introduce the notion of an irreducible dominating set, a variant of dominating set generalizing both minimal dominating sets and minimal total dominating sets.
Revised:  In this paper we introduce the notion of an irreducible dominating set, a variant of dominating set generalizing both minimal dominating sets and minimal total dominating sets.
Edit intent: fluency
Original:  A key question therefore is how one could kill as many cells as possible for a given acceptable risk of drug resistance evolution.
Revised:  A key question therefore is how one could eradicate as many cells as possible for a given acceptable risk of drug resistance evolution.
Edit intent: clarity
Original:  Importantly, our model also includes the influence of convection, resulting for instance from blood flow.
Revised:  Importantly, our model takes into account the influence of convection, resulting for instance from blood flow.
Edit intent: clarity
Original:  Our analysis also reveals that the trade-off between death and adaptation depends on a few key control parameters, which compare the strengths of the spatial drug gradient with the convection and random dispersal terms .
Revised:  Our analysis reveals that the trade-off between death and adaptation depends on a few key control parameters, which compare the strengths of the spatial drug gradient with the convection and random dispersal terms .
Edit intent: clarity
Original:  Our analysis also reveals that the trade-off between death and adaptation depends on a few key control parameters, which compare the strengths of the spatial drug gradient with the convection and random dispersal terms .
Revised:  Our analysis also reveals that the trade-off between death and adaptation depends on a few key control parameters, which compare the strengths of the spatial drug gradient and random dispersal terms .
Edit intent: clarity
Original:  Our results show in particular that convection can have a momentous effect on the rate of establishment of new mutations, and may heavily impact the efficiency of antibiotic treatment.
Revised:  Our results show that convection can have a momentous effect on the rate of establishment of new mutations, and may heavily impact the efficiency of antibiotic treatment.
Edit intent: coherence
Original:  In addition, we give a complete characterization of the algorithmic/ computational complexity of conflict-free coloring.
Revised:  We also give a complete characterization of the algorithmic/ computational complexity of conflict-free coloring.
Edit intent: coherence
Original:  In addition, we give a complete characterization of the algorithmic/ computational complexity of conflict-free coloring.
Revised:  In addition, we give a complete characterization of the computational complexity of conflict-free coloring.
Edit intent: clarity
Original:  It is NP-complete to decide whether a planar graph has a conflict-free coloring with one color, while for outerplanar graphs , this can be decided in polynomial time .
Revised:  It is NP-complete to decide whether a planar graph has a conflict-free coloring with one color, while for outerplanar graphs .
Edit intent: clarity
Original:  Furthermore, it is NP-complete to decide whether a planar graph has a conflict-free coloring with two colors, while for outerplanar graphs , two colors always suffice .
Revised:  Furthermore, it is NP-complete to decide whether a planar graph has a conflict-free coloring with two colors, while for outerplanar graphs .
Edit intent: clarity
Original: We address a problem of optimization on product of embedded submanifolds of convolution kernels (PEMs ) in convolutional neural networks (CNNs).
Revised: We address a problem of optimization on ensembles of products of submanifolds (PEMs) of convolution kernels (PEMs ) in convolutional neural networks (CNNs).
Edit intent: clarity
Original:  Millions of voters expressed their views and voting preferences through following and tweeting.
Edit intent: clarity
Original:  Meanwhile, social media has been filled with fake news and rumors, which could have had huge impacts on voters' decisions.
Revised:  Meanwhile, social media has been filled with rumors, which could have had huge impacts on voters' decisions.
Edit intent: clarity
Original:  Meanwhile, social media has been filled with fake news and rumors, which could have had huge impacts on voters' decisions.
Revised:  Meanwhile, social media has been filled with fake news and rumors, which might have had huge impacts on voters' decisions.
Edit intent: fluency
Original:  To overcome the difficulty of labeling a large amount of tweets as training data, we first detect rumor tweets by matching them with verified rumor articles.
Revised:  To overcome the difficulty of labeling a large amount of tweets as training data, we detect rumor tweets by matching them with verified rumor articles.
Edit intent: coherence
Original: A Fog Radio Access Network (F-RAN) is a cellular wireless system that enables content delivery via edge caching , i.e., storage of popular content at the edge nodes (ENs) , and cloud processing.
Revised: A Fog Radio Access Network (F-RAN) is a cellular wireless system that enables content delivery via the caching of popular content at the edge nodes (ENs) , and cloud processing.
Edit intent: clarity