wanyu/IteraTeR_v2 huggingface dataset:
Original:  This paperstudies the problem of recovering N-dimensional (particularly N\geq 3) exponential signals from partial observations, and we formulate this problem as a low-rank tensor completion problem with exponential factors .
Revised:  This paperstudies the problem of recovering N-dimensional (particularly N\geq 3) exponential signals from partial observations, and we formulate this problem as a low-rank tensor completion problem with exponential factor vectors .
Edit intent: clarity
Original:  The full signal is reconstructed by simultaneously exploiting the CANDECOMP/PARAFAC (CP) tensor decomposition and the exponential structure of the associated factors, of which the latter is promoted by minimizing an objective function involving the nuclear norm of Hankel matrices.
Revised:  The full signal is reconstructed by simultaneously exploiting the CANDECOMP/PARAFAC structure and the exponential structure of the associated factors, of which the latter is promoted by minimizing an objective function involving the nuclear norm of Hankel matrices.
Edit intent: clarity
Original:  The full signal is reconstructed by simultaneously exploiting the CANDECOMP/PARAFAC (CP) tensor decomposition and the exponential structure of the associated factors, of which the latter is promoted by minimizing an objective function involving the nuclear norm of Hankel matrices.
Revised:  The full signal is reconstructed by simultaneously exploiting the CANDECOMP/PARAFAC (CP) tensor decomposition and the exponential structure of the associated factor vectors. The latter is promoted by minimizing an objective function involving the nuclear norm of Hankel matrices.
Edit intent: clarity
Original:  Here, we explore the potential of sub-nanopores for single-molecule protein identification (SMPI) and describe an algorithm for analyzing the electrical current blockade signal (nanospectrum) resulting from the translocation of a denaturated, linearly charged protein through a sub-nanopore.
Revised:  Here, we explore the potential of sub-nanopores for single-molecule protein identification (SMPI) and describe an algorithm for identification of the electrical current blockade signal (nanospectrum) resulting from the translocation of a denaturated, linearly charged protein through a sub-nanopore.
Edit intent: clarity
Original:  We further describe the first SMPI algorithm, compute the p-values of Protein-Nanospectrum Matches, and discuss the promise and computational limitations of the current SMPI technology .
Revised:  The analysis of identification p-values suggests that the current technology is already sufficient for matching nanospectra against small protein databases, e.g., protein identification in bacterial proteomes .
Edit intent: clarity
Original:  Large scale metagenomic projects aim to extract biodiversity knowledge between different environmental conditions.
Revised: Background. Large scale metagenomic projects aim to extract biodiversity knowledge between different environmental conditions.
Edit intent: coherence
Original:  On the other hand, de novo methods, that compare the whole set of sequences,  do not scale up on ambitious metagenomic projects .
Revised:  On the other hand, de novo methods, that compare the whole sets of sequences, do not scale up on ambitious metagenomic projects .
Edit intent: fluency
Original:  On the other hand, de novo methods, that compare the whole set of sequences,  do not scale up on ambitious metagenomic projects .
Revised:  On the other hand, de novo methods, that compare the whole set of sequences, either do not scale up on ambitious metagenomic projects .
Edit intent: coherence
Original:  This method computes a large collection of standard ecology distances by replacing species counts by k-mer counts.
Revised:  This method computes a large collection of standard ecological distances by replacing species counts by k-mer counts.
Edit intent: fluency
Original:   Experiments on public Human Microbiome Project datasets demonstrate that Simka captures the essential underlying biological structure.
Revised:  Results. Experiments on public Human Microbiome Project datasets demonstrate that Simka captures the essential underlying biological structure.
Edit intent: fluency
Original:  Simka was able to compute in a few hours both qualitative and quantitative ecology distances on hundreds of metagenomic samples (690 samples, 32 billions of reads).
Revised:  Simka was able to compute in a few hours both qualitative and quantitative ecological distances on hundreds of metagenomic samples (690 samples, 32 billions of reads).
Edit intent: fluency
Original:  Simka scales-up today  metagenomic projects thanks to a new parallel k-mer counting strategy on multiple datasets.
Revised:  Simka scales-up today 's metagenomic projects thanks to a new parallel k-mer counting strategy on multiple datasets.
Edit intent: fluency
Original:  we adapt that work to a latent calculus in the and extend it work with dependent contracts in contract PCF (CPCF;
Revised:  we adapt that work to a latent calculus and extend it work with dependent contracts in contract PCF (CPCF;
Edit intent: fluency
Original: Standard higher-order contract monitoring breaks tail recursion and leads to space leaks that can change a program's asymptotic complexity . Space efficient semantics restore tail recursion and bound the amount of space used by contacts.
Revised: Standard higher-order contract monitoring breaks tail recursion and leads to space leaks that can change a program's asymptotic complexity ; space-efficiency restores tail recursion and bound the amount of space used by contacts.
Edit intent: clarity
Original: Standard higher-order contract monitoring breaks tail recursion and leads to space leaks that can change a program's asymptotic complexity . Space efficient semantics restore tail recursion and bound the amount of space used by contacts.
Revised: Standard higher-order contract monitoring breaks tail recursion and leads to space leaks that can change a program's asymptotic complexity . Space efficient semantics restore tail recursion and bounds the amount of space used by contacts.
Edit intent: fluency
Original:  Prior work establishes a space-efficient semantics in a manifest setting (Greenberg 2015);
Revised:  Prior work establishes a space-efficient semantics for manifest contracts without dependency (Greenberg 2015);
Edit intent: clarity
Original:  In this technical report we derive the math for the Hessian matrix of  shape matching energy , to allow more broadly application of the implicit shape matching technique .
Revised:  In this technical report we derive the math for the Hessian matrix of the shape matching energy , to allow more broadly application of the implicit shape matching technique .
Edit intent: fluency
Original: We give a new, strongly polynomial algorithm and improved analysis of the metric s-t path TSP.
Revised: We give a new, strongly polynomial algorithm and improved analysis for the metric s-t path TSP.
Edit intent: fluency
Original:  The algorithm finds a tour of cost less than 1.53 times the optimum of the subtour elimination LP, while known examples show that 1.5 is a lower bound for the integrality gap.
Revised:  It finds a tour of cost less than 1.53 times the optimum of the subtour elimination LP, while known examples show that 1.5 is a lower bound for the integrality gap.
Edit intent: clarity
Original:  On the one hand our algorithm and analysis extend previous tools , at the same time simplifying the framework .
Revised:  On the one hand this algorithm and analysis extend previous tools , at the same time simplifying the framework .
Edit intent: clarity
Original:  On the other hand  new tools are introduced , such as a linear program that allows us to efficiently choose the probabilities of edges used for analyzing the reconnection cost and a new way of applying the matroid partition theorem and algorithm to different matroids, in order to write the subtour elimination optimum as a particular convex combination of spanning trees .
Revised:  On the other hand , powerful new tools are introduced , such as a linear program that allows us to efficiently choose the probabilities of edges used for analyzing the reconnection cost and a new way of applying the matroid partition theorem and algorithm to different matroids, in order to write the subtour elimination optimum as a particular convex combination of spanning trees .
Edit intent: clarity
Original:  On the other hand  new tools are introduced , such as a linear program that allows us to efficiently choose the probabilities of edges used for analyzing the reconnection cost and a new way of applying the matroid partition theorem and algorithm to different matroids, in order to write the subtour elimination optimum as a particular convex combination of spanning trees .
Revised:  On the other hand new tools are solicited , such as a linear program that allows us to efficiently choose the probabilities of edges used for analyzing the reconnection cost and a new way of applying the matroid partition theorem and algorithm to different matroids, in order to write the subtour elimination optimum as a particular convex combination of spanning trees .
Edit intent: clarity
Original:  However, it suffers from various drawbacks .
Revised:  However, it suffers from various obvious limitations .
Edit intent: clarity
Original:  The sparsity structure of a polynomial ideal is often described by a graph that captures the interactions among the variables.
Revised:  The sparsity structure of a polynomial system is often described by a graph that captures the interactions among the variables.
Edit intent: clarity
Original:  Chordal networks provide a computationally convenient decomposition of the polynomial ideal into simpler (triangular) polynomial sets, while preserving its underlying graphical structure.
Revised:  Chordal networks provide a computationally convenient decomposition into simpler (triangular) polynomial sets, while preserving its underlying graphical structure.
Edit intent: clarity
Original:  Chordal networks provide a computationally convenient decomposition of the polynomial ideal into simpler (triangular) polynomial sets, while preserving its underlying graphical structure.
Revised:  Chordal networks provide a computationally convenient decomposition of the polynomial ideal into simpler (triangular) polynomial sets, while preserving the underlying graphical structure.
Edit intent: clarity
Original:  We show that many interesting families of polynomial ideals admit compact chordal network representations (of size linear in the number of variables), even though the number of components could be exponentially large.
Revised:  We show that many interesting families of polynomial ideals admit compact chordal network representations (of size linear in the number of variables), even though the number of components is exponentially large.
Edit intent: clarity
Original:  Chordal networks can be computed for arbitrary polynomial systems using a refinement of the chordal elimination algorithm from \mbox{ Cifuentes2014 . Furthermore, they can be effectively used to obtain several properties of the variety, such as its dimension, cardinality  and equidimensional components, as well as an efficient probabilistic test for radical ideal membership.
Revised:  Chordal networks can be computed for arbitrary polynomial systems using a refinement of the chordal elimination algorithm from \mbox{ Cifuentes2014 . Furthermore, they can be effectively used to obtain several properties of the variety, such as its dimension, cardinality , and equidimensional components, as well as an efficient probabilistic test for radical ideal membership.
Edit intent: fluency
Original: Adhesion molecules play an integral role in diverse biological functions ranging from cellular growth to transport . Estimation of their binding affinity , therefore, becomes important to quantify their biophysical impact on these phenomena.
Revised: Adhesion plays an integral role in diverse biological functions ranging from cellular growth to transport . Estimation of their binding affinity , therefore, becomes important to quantify their biophysical impact on these phenomena.
Edit intent: clarity
Original: Adhesion molecules play an integral role in diverse biological functions ranging from cellular growth to transport . Estimation of their binding affinity , therefore, becomes important to quantify their biophysical impact on these phenomena.
Revised: Adhesion molecules play an integral role in diverse biological functions ranging from cellular transport to tissue development . Estimation of their binding affinity , therefore, becomes important to quantify their biophysical impact on these phenomena.
Edit intent: clarity
Original: Adhesion molecules play an integral role in diverse biological functions ranging from cellular growth to transport . Estimation of their binding affinity , therefore, becomes important to quantify their biophysical impact on these phenomena.
Revised: Adhesion molecules play an integral role in diverse biological functions ranging from cellular growth to transport . Estimation of their binding affinity , therefore, becomes important to gain biophysical insight into these phenomena.
Edit intent: clarity
Original:  In this paper , we use curvature elasticity to present non-intuitive, yet remarkably simple, universal relationships to tease out adhesion energy from vesicle-substrate experiments .
Revised:  In this Letter , we use curvature elasticity to present non-intuitive, yet remarkably simple, universal relationships to tease out adhesion energy from vesicle-substrate experiments .
Edit intent: style
Original:  In this paper , we use curvature elasticity to present non-intuitive, yet remarkably simple, universal relationships to tease out adhesion energy from vesicle-substrate experiments .
Revised:  In this paper , we use curvature elasticity to present non-intuitive, yet remarkably simple, universal relationships that capture vesicle-substrate experiments .
Edit intent: clarity
Original:  In this paper , we use curvature elasticity to present non-intuitive, yet remarkably simple, universal relationships to tease out adhesion energy from vesicle-substrate experiments .
Revised:  In this paper , we use curvature elasticity to present non-intuitive, yet remarkably simple, universal relationships to tease out adhesion energy from vesicle-substrate interactions .
Edit intent: clarity
Original:  Most prior research on influence maximization only focused on online social networks (OSN) . However, according to a recent CNN report 1%DIFDELCMD < ]%%% , about 87\% of Facebook users access the social networking website from their mobile devices and Facebook earned 3.54 billion in the first quarter of 2015 with mobile advertising revenue making up 73\% of the social network's total advertising revenue.
Revised:  Most prior research on influence maximization only focused on online social networks (OSN) . However, according to a recent CNN report %DIFDELCMD < ]%%% , about 87\% of Facebook users access the social networking website from their mobile devices and Facebook earned 3.54 billion in the first quarter of 2015 with mobile advertising revenue making up 73\% of the social network's total advertising revenue.
Edit intent: fluency
Original:  In this work , therefore, we tackle the problem in a mobile social network of message overhead minimization, which integrates the relation between individuals in an OSN and the topology of mobile ad hoc network . Specifically, we formulate an optimization problem, named Agent Selection Problem (ASP), to minimize the message overheads transmitted in MSN while guaranteeing that every individual selects at most one of his friends to influence his friends on his behalf.
Revised:  In this work , therefore, we tackle the problem in a mobile social network of message overhead minimization, which integrates the relation between individuals in an OSN and the topology of mobile ad hoc network . Specifically, we formulate a new optimization problem, named Agent Selection Problem (ASP), to minimize the message overheads transmitted in MSN while guaranteeing that every individual selects at most one of his friends to influence his friends on his behalf.
Edit intent: clarity
Original:  Agent Selection with Privacy for Minimizing Transmission Cost (ASPMTC), which iteratively selects for each individual the agent who can reduce the largest number of message overheads compared to the other friends of the individual via exchanging messages between nearby individuals in MSN . Simulation results based on real and synthetic datasets demonstrate that the amount of message overhead can be significantly reduced compared to the existing method without selecting agents .
Revised:  Agent Selection with Privacy for Minimizing Transmission Cost (ASPMTC), which iteratively selects for each individual the agent who can reduce the largest number of message overheads compared to the other friends of the individual via exchanging messages between nearby individuals in MSN . Simulation results in real and synthetic datasets demonstrate that the amount of message overhead can be significantly reduced compared to the existing method without selecting agents .
Edit intent: clarity
Original:  Agent Selection with Privacy for Minimizing Transmission Cost (ASPMTC), which iteratively selects for each individual the agent who can reduce the largest number of message overheads compared to the other friends of the individual via exchanging messages between nearby individuals in MSN . Simulation results based on real and synthetic datasets demonstrate that the amount of message overhead can be significantly reduced compared to the existing method without selecting agents .
Revised:  Agent Selection with Privacy for Minimizing Transmission Cost (ASPMTC), which iteratively selects for each individual the agent who can reduce the largest number of message overheads compared to the other friends of the individual via exchanging messages between nearby individuals in MSN . Simulation results based on real and synthetic datasets manifest that the message overhead can be significantly reduced compared to the existing method without selecting agents .
Edit intent: clarity
Original:  Agent Selection with Privacy for Minimizing Transmission Cost (ASPMTC), which iteratively selects for each individual the agent who can reduce the largest number of message overheads compared to the other friends of the individual via exchanging messages between nearby individuals in MSN . Simulation results based on real and synthetic datasets demonstrate that the amount of message overhead can be significantly reduced compared to the existing method without selecting agents .
Revised:  Agent Selection with Privacy for Minimizing Transmission Cost (ASPMTC), which iteratively selects for each individual the agent who can reduce the largest number of message overheads compared to the other friends of the individual via exchanging messages between nearby individuals in MSN . Simulation results based on real and synthetic datasets demonstrate that the amount of message overhead can be significantly reduced compared with the existing approaches .
Edit intent: clarity
Original: We introduce a method based on the spatial Public Goods Game for solving optimization tasks.
Revised: We introduce a method based on the Public Goods Game for solving optimization tasks.
Edit intent: clarity
Original:  In particular, we focus on the Traveling Salesman Problem, i.e. , a problem whose search space exponentially grows increasing the number of cities , then becoming NP-hard .
Revised:  In particular, we focus on the Traveling Salesman Problem, i.e. a NP-hard problem whose search space exponentially grows increasing the number of cities , then becoming NP-hard .
Edit intent: fluency
Original:  In particular, we focus on the Traveling Salesman Problem, i.e. , a problem whose search space exponentially grows increasing the number of cities , then becoming NP-hard .
Revised:  In particular, we focus on the Traveling Salesman Problem, i.e. , a problem whose search space exponentially grows increasing the number of cities .
Edit intent: coherence
Original:  Then , agents interact by playing the Public Goods Game using the fitness of their solution as currency of the game.
Revised:  In doing so , agents interact by playing the Public Goods Game using the fitness of their solution as currency of the game.
Edit intent: clarity
Original:  In doing so , agents with better solutions provide higher contributions, while agents with lower ones tend to imitate the solution of richer agents to increase their fitness.
Revised:  Notably , agents with better solutions provide higher contributions, while agents with lower ones tend to imitate the solution of richer agents to increase their fitness.
Edit intent: coherence
Original:  In doing so , agents with better solutions provide higher contributions, while agents with lower ones tend to imitate the solution of richer agents to increase their fitness.
Revised:  In doing so , agents with better solutions provide higher contributions, while those with lower ones tend to imitate the solution of richer agents to increase their fitness.
Edit intent: clarity
Original:  In doing so , agents with better solutions provide higher contributions, while agents with lower ones tend to imitate the solution of richer agents to increase their fitness.
Revised:  In doing so , agents with better solutions provide higher contributions, while agents with lower ones tend to imitate the solution of richer agents for increasing their fitness.
Edit intent: fluency
Original:  As result, beyond to propose a new heuristic for combinatorial optimization tasks , our work aims to highlight the potentiality of evolutionary game theory outside its current horizons.
Revised:  As result, beyond to propose a new heuristic for combinatorial optimization problems , our work aims to highlight the potentiality of evolutionary game theory outside its current horizons.
Edit intent: clarity
Original:  As result, beyond to propose a new heuristic for combinatorial optimization tasks , our work aims to highlight the potentiality of evolutionary game theory outside its current horizons.
Revised:  As result, beyond to propose a new heuristic for combinatorial optimization tasks , our work aims to highlight the potentiality of evolutionary game theory beyond its current horizons.
Edit intent: fluency
Original: Keeler, Ross and Xia (2016) recently derived approximation and convergence results, which imply that the point process formed from the signal strengths received by an observer in a wireless network under a general statistical propagation model can be modeled by an inhomogeneous Poisson point process on the positive real line.
Revised: Keeler, Ross and Xia (2016) recently derived approximation and convergence results, which imply that the point process formed from the signal strengths received by an observer in a wireless network under a general statistical propagation model can be modelled by an inhomogeneous Poisson point process on the positive real line.
Edit intent: fluency
Original: The aim of this note is to apply some of the main results of Keeler, Ross and Xia (2016) in a less general but more easily applicable form , to illustrate how the results can apply to functions of the point process of signal strengths, and to gain intuition on when the Poisson model for transmitter locations is appropriate.
Revised: The aim of this note is to apply some of the main results of Keeler, Ross and Xia (2016) in a less general but more easily applicable form to illustrate how the results can apply to functions of the point process of signal strengths, and to gain intuition on when the Poisson model for transmitter locations is appropriate.
Edit intent: fluency
Original:  Is it possible to assess students ' engagement , not with questionnaires or surveys, but directly from their brain activity without distracting them from the material at hand?
Revised:  Is it possible to assess students engagement directly from their brain activity without distracting them from the material at hand?
Edit intent: coherence