wanyu/IteraTeR_v2 huggingface dataset:
Original:  This problems is a common generalization of (i) The combinatorial problem of junta testing  on the hypercube which tests whether a Boolean function is dependent on at most k of its variables and (ii) Geometric testing problems such as testing if a function is an intersection of k halfspaces .
Revised:  This problems is a common generalization of (i) The combinatorial problem of junta testing on at most k of its variables and (ii) Geometric testing problems such as testing if a function is an intersection of k halfspaces .
Edit intent: coherence
Original:  This problems is a common generalization of (i) The combinatorial problem of junta testing  on the hypercube which tests whether a Boolean function is dependent on at most k of its variables and (ii) Geometric testing problems such as testing if a function is an intersection of k halfspaces .
Revised:  This problems is a common generalization of (i) The combinatorial problem of junta testing on the hypercube which tests whether a Boolean function is dependent on at most k of the variables and intersection of k halfspaces .
Edit intent: coherence
Original:  This problems is a common generalization of (i) The combinatorial problem of junta testing  on the hypercube which tests whether a Boolean function is dependent on at most k of its variables and (ii) Geometric testing problems such as testing if a function is an intersection of k halfspaces .
Revised:  This problems is a common generalization of (i) The combinatorial problem of junta testing on the hypercube which tests whether a Boolean function is dependent on at most k of its variables and (ii) Geometric testing problems such as testing if a function is an2. intersection of k halfspaces .
Edit intent: fluency
Original:  The polynomial dependence on s is necessary as we provide a \mathsf{poly .
Revised:  We show that the polynomial dependence on s is necessary as we provide a \mathsf{poly .
Edit intent: coherence
Original:  The polynomial dependence on s is necessary as we provide a \mathsf{poly .
Revised:  The polynomial dependence on s is necessary .
Edit intent: coherence
Original:  Moreover, we show that if the function is a linear k-junta with surface area at most s, then there is a (s \cdot k)^{O(k)}-query non-adaptive algorithm to learn the function up to a rotation of the basis .%DIFDELCMD < {%%% We also use this procedure to obtain a non-adaptive tester (with the same query complexity ) for subclasses of linear k-juntas closed under rotation.
Revised:  Moreover, we show that if the function is a linear k-junta with surface area at most s, we give a (s \cdot k)^{O(k)}-query non-adaptive algorithm to learn the function up to a rotation of the basis .%DIFDELCMD < {%%% We also use this procedure to obtain a non-adaptive tester (with the same query complexity ) for subclasses of linear k-juntas closed under rotation.
Edit intent: clarity
Original:  Moreover, we show that if the function is a linear k-junta with surface area at most s, then there is a (s \cdot k)^{O(k)}-query non-adaptive algorithm to learn the function up to a rotation of the basis .%DIFDELCMD < {%%% We also use this procedure to obtain a non-adaptive tester (with the same query complexity ) for subclasses of linear k-juntas closed under rotation.
Revised:  Moreover, we show that if the function is a linear k-junta with surface area at most s, then there is a (s \cdot k)^{O(k)}-query non-adaptive algorithm to learn the function .%DIFDELCMD < {%%% We also use this procedure to obtain a non-adaptive tester (with the same query complexity ) for subclasses of linear k-juntas closed under rotation.
Edit intent: clarity
Original:  Moreover, we show that if the function is a linear k-junta with surface area at most s, then there is a (s \cdot k)^{O(k)}-query non-adaptive algorithm to learn the function up to a rotation of the basis .%DIFDELCMD < {%%% We also use this procedure to obtain a non-adaptive tester (with the same query complexity ) for subclasses of linear k-juntas closed under rotation.
Revised:  Moreover, we show that if the function is a linear k-junta with surface area at most s, then there is a (s \cdot k)^{O(k)}-query non-adaptive algorithm to learn the function up to a rotation of the basis %DIFDELCMD < {%%% We also use this procedure to obtain a non-adaptive tester (with the same query complexity ) for subclasses of linear k-juntas closed under rotation.
Edit intent: fluency
Original: Anytime approximation algorithms for computing query probabilities over probabilistic databases can be of great use to statistical learning tasks.
Revised: Anytime approximation algorithms that compute the probabilities of queries over probabilistic databases can be of great use to statistical learning tasks.
Edit intent: clarity
Original:  They have so far been based on either sampling or a branch-and-bound approach using model-based bounds.
Revised:  Those approaches have been based so far on either (i) sampling or (ii) branch-and-bound approach using model-based bounds.
Edit intent: clarity
Original:  They have so far been based on either sampling or a branch-and-bound approach using model-based bounds.
Revised:  They have so far been based on either sampling or a branch-and-bound with model-based bounds.
Edit intent: clarity
Original:  We present here a general framework for the branch-and-bound approach, where we extend the possible bounding methods by using dissociation , which yields tighter bounds.
Revised:  We present here a more general branch-and-bound framework that extends the possible bounds by using 'dissociation' , which yields tighter bounds.
Edit intent: clarity
Original: Cardiopulmonary resuscitation (CPR) is alongside with electrical defibrillation the most important treatment for sudden cardiac arrest, which affects thousands of individuals every year.
Revised: Cardiopulmonary resuscitation (CPR) is alongside electrical defibrillation the most important treatment for sudden cardiac arrest, which affects thousands of individuals every year.
Edit intent: fluency
Original: Cardiopulmonary resuscitation (CPR) is alongside with electrical defibrillation the most important treatment for sudden cardiac arrest, which affects thousands of individuals every year.
Revised: Cardiopulmonary resuscitation (CPR) is alongside with electrical defibrillation the most crucial countermeasure for sudden cardiac arrest, which affects thousands of individuals every year.
Edit intent: clarity
Original:  In this paper, we present a robust sinusoid model that uses skeletal motion data from an RGB-D (Kinect) sensor and the Differential Evolution (DE) optimization algorithm to dynamically fit sinusoidal curves to derive frequency and depth parameters for cardiopulmonary resuscitation training.
Revised:  In this paper, we present a novel approach including sinusoid models that use skeletal motion data from an RGB-D (Kinect) sensor and the Differential Evolution (DE) optimization algorithm to dynamically fit sinusoidal curves to derive frequency and depth parameters for cardiopulmonary resuscitation training.
Edit intent: clarity
Original:  We optimized the DE algorithm constants and have shown that with these optimized parameters the frequency of the CPR is recognized with a median error of 2.55 (2.4\%) compressions per minute compared to the reference training mannequin.
Revised:  We optimized the DE algorithm hyperparameters and showed that with these optimized parameters the frequency of the CPR is recognized with a median error of 2.55 (2.4\%) compressions per minute compared to the reference training mannequin.
Edit intent: clarity
Original:  We optimized the DE algorithm hyperparameters and showed that with these optimized parameters the frequency of the CPR is recognized with a median error of +- \pm 2.9 compressions per minute compared to the reference training mannequin.
Revised:  We optimized the DE algorithm hyperparameters and showed that with these optimized parameters the frequency of the CPR is recognized with a median error of \pm 2.9 compressions per minute compared to the reference training mannequin.
Edit intent: clarity
Original:  The nodes and the aggregators are transmitting in a random access manner under slotted time, the aggregators use network-level cooperation .
Revised:  The nodes and the aggregators are transmitting in a random access manner under slotted time, the aggregators perform network-level cooperation .
Edit intent: clarity
Original:  The aggregators with out-of-band full duplex capability, are equipped with queues to store data packets that are transmitted by the network nodes and relaying them to the destination node.
Revised:  The aggregators are equipped with queues to store data packets that are transmitted by the network nodes and relaying them to the destination node.
Edit intent: clarity
Original:  One of the most fundamental problems in social network analysis is community detection, and one of the most basic primitives to model a community is a clique.
Revised:  One of the most fundamental problems in (social) network analysis is community detection, and one of the most basic primitives to model a community is a clique.
Edit intent: fluency
Original:  In particular, for the special case of delta-1-plexes (that is, delta-cliques ), we observe that delta-k-BronKerbosch is even faster than the previous algorithm by Himmel et al. at enumerating delta-cliques [  .
Revised:  In particular, for the special case of delta-1-plexes (that is, delta-cliques ), we observe that our algorithm is significantly faster than the previous algorithm by Himmel et al. at enumerating delta-cliques [ .
Edit intent: clarity
Original:  In particular, for the special case of delta-1-plexes (that is, delta-cliques ), we observe that delta-k-BronKerbosch is even faster than the previous algorithm by Himmel et al. at enumerating delta-cliques [  .
Revised:  In particular, for the special case of delta-1-plexes (that is, delta-cliques ), we observe that delta-k-BronKerbosch is even faster than the previous algorithm by Himmel et al. [ .
Edit intent: clarity
Original:  They can be modeled as temporal graphs where interactions between vertices ( in case of social networks these would represent people ) are represented by time-stamped edges.
Revised:  They can be modeled as temporal graphs where interactions between vertices ( which represent people in the case of social networks these would represent people ) are represented by time-stamped edges.
Edit intent: clarity
Original:  They can be modeled as temporal graphs where interactions between vertices ( in case of social networks these would represent people ) are represented by time-stamped edges.
Revised:  They can be modeled as temporal graphs where interactions between vertices ( in case of social networks ) are represented by time-stamped edges.
Edit intent: clarity
Original:  We define a \Delta-k-plex as a set of vertices with a lifetime, where during the lifetime each vertex has an edge to all but at most k-1 vertices at least once within any consecutive \Delta+1 time steps .
Revised:  We define a \Delta-k-plex as a set of vertices with a lifetime, where during the lifetime each vertex has in each consecutive \Delta + 1 time steps edges to all but at most k-1 vertices at least once within any consecutive \Delta+1 time steps .
Edit intent: clarity
Original:  We develop a recursive algorithm for enumerating all maximal \Delta-k-plexes and perform experiments on real-world social networks that demonstrate the  feasibility of our approach.
Revised:  We develop a recursive algorithm for enumerating all maximal \Delta-k-plexes and perform experiments on real-world social networks that demonstrate the practical feasibility of our approach.
Edit intent: clarity
Original:  In particular, for the special case of \Delta-1-plexes (that is, \Delta cliques ), we observe that our algorithm is  significantly faster than the previous algorithm by Himmel et al.
Revised:  In particular, for the special case of \Delta-1-plexes (that is, \Delta cliques ), we observe that our algorithm is significantly faster than the previous algorithms by Himmel et al.
Edit intent: fluency
Original:  We define a \Delta-k-plex as a set of vertices with a lifetime , where during the lifetime each vertex has in each consecutive \Delta + 1 time steps edges to all but at most k-1 vertices in the chosen set of vertices.
Revised:  We define a \Delta-k-plex as a set of vertices with a lifetime , where during this time interval each vertex has in each consecutive \Delta + 1 time steps edges to all but at most k-1 vertices in the chosen set of vertices.
Edit intent: clarity
Original:  We define a \Delta-k-plex as a set of vertices with a lifetime , where during the lifetime each vertex has in each consecutive \Delta + 1 time steps edges to all but at most k-1 vertices in the chosen set of vertices.
Revised:  We define a \Delta-k-plex as a set of vertices with a lifetime , where during the lifetime each vertex has in each consecutive \Delta + 1 time steps at least one edge to all but at most k-1 vertices in the chosen set of vertices.
Edit intent: clarity
Original:  We develop a recursive algorithm for enumerating all maximal \Delta -k-plexes and perform experiments on real-world social networks that demonstrate the practical feasibility of our approach.
Revised:  We develop a recursive algorithm for enumerating all maximal \Delta -k-plexs and perform experiments on real-world social networks that demonstrate the practical feasibility of our approach.
Edit intent: fluency
Original:  We provide a demo of Guided ES at : URL
Revised:  We provide a demo of Guided ES at URL
Edit intent: fluency
Original:  Finally, we apply our method to example problems including truncated unrolled optimization and a synthetic gradient problem, demonstrating improvement over both standard evolutionary strategies and first-order methods  that directly follow the surrogate gradient  .
Revised:  Finally, we apply our method to example problems , demonstrating an improvement over both standard evolutionary strategies and first-order methods that directly follow the surrogate gradient .
Edit intent: coherence
Original:  Finally, we apply our method to example problems including truncated unrolled optimization and a synthetic gradient problem, demonstrating improvement over both standard evolutionary strategies and first-order methods  that directly follow the surrogate gradient  .
Revised:  Finally, we apply our method to example problems including truncated unrolled optimization and a synthetic gradient problem, demonstrating improvement over both standard evolutionary strategies and first-order methods ( that directly follow the surrogate gradient .
Edit intent: fluency
Original:  Finally, we apply our method to example problems including truncated unrolled optimization and a synthetic gradient problem, demonstrating improvement over both standard evolutionary strategies and first-order methods  that directly follow the surrogate gradient  .
Revised:  Finally, we apply our method to example problems including truncated unrolled optimization and a synthetic gradient problem, demonstrating improvement over both standard evolutionary strategies and first-order methods that directly follow the surrogate gradient ) .
Edit intent: fluency
Original:  However , the large dimensions of information carriers in previous realizations of conservative logic detract from the system efficiency, and a nanoscale conservative logic system remains elusive.
Revised:  However , the large dimensions of information carriers in previous realizations detract from the system efficiency, and a nanoscale conservative logic system remains elusive.
Edit intent: clarity
Original:  However , the large dimensions of information carriers in previous realizations of conservative logic detract from the system efficiency, and a nanoscale conservative logic system remains elusive.
Revised:  However , the large dimensions of information carriers in previous realizations of conservative logic detract from the system efficiency, and nanoscale conservative logic system remains elusive.
Edit intent: fluency
Original:  However , the large dimensions of information carriers in previous realizations of conservative logic detract from the system efficiency, and a nanoscale conservative logic system remains elusive.
Revised:  However , the large dimensions of information carriers in previous realizations of conservative logic detract from the system efficiency, and a nanoscale conservative logic remains elusive.
Edit intent: clarity
Original:  Here we propose a non-volatile conservative logic system in which the information carriers are magnetic skyrmions, topologically-stable magnetic whirls.
Revised:  We therefore propose a non-volatile conservative logic system in which the information carriers are magnetic skyrmions, topologically-stable magnetic whirls.
Edit intent: coherence
Original:  Here we propose a non-volatile conservative logic system in which the information carriers are magnetic skyrmions, topologically-stable magnetic whirls.
Revised:  Here we propose a non-volatile reversible computing system in which the information carriers are magnetic skyrmions, topologically-stable magnetic whirls.
Edit intent: clarity
Original:  These  quasiparticles interact with one another as they propagate through ferromagnetic nanowires via the spin-Hall and skyrmion-Hall effects to enable AND/OR and INV/COPY logic functions .
Revised:  These quasiparticles interact with one another via the spin-Hall and skyrmion-Hall effects to enable AND/OR and INV/COPY logic functions .
Edit intent: clarity
Original:  As skyrmions can be transported in a pipelined and non-volatile manner at room temperature without the motion of any physical particles, this conservative skyrmion logic paradigm has the potential to deliver scalable high-speed low-power  computing.
Revised:  As skyrmions can be transported in a pipelined and non-volatile manner at room temperature without the motion of any physical particles, this skyrmion logic system has the potential to deliver scalable high-speed low-power computing.
Edit intent: clarity
Original: This paper discusses technology challenges and opportunities to embrace artificial intelligence (AI) era in the design of wireless networks .
Revised: This paper discusses technology and opportunities to embrace artificial intelligence (AI) era in the design of wireless networks .
Edit intent: clarity
Original: This paper discusses technology challenges and opportunities to embrace artificial intelligence (AI) era in the design of wireless networks .
Revised: This paper discusses technology challenges and opportunities to embrace artificial intelligence (AI) in the design of wireless networks .
Edit intent: clarity
Original:  We aim to provide readers with motivation and general methodology for adoption of AI in the context of next-generation networks.
Revised:  We aim to provide readers with motivation and general AI methodology of autonomous agents in the context of next-generation networks.
Edit intent: clarity
Original:  Finally, we discuss design of intelligent agent and it's functions to enable knowledge-driven wireless networks with AI .
Revised:  Finally, we conceptually introduce the functions of an autonomous agent with knowledge management .
Edit intent: clarity
Original:  Tested on three types of labeled data containing 5,000 to 6M  disambiguated names, DBLP is shown to assign author names quite accurately to distinct authors, resulting in pairwise precision, recall, and F1 measures around 0.90 or above overall.
Revised:  Tested on three types of labeled data containing 5,000 to 6M pairs of disambiguated names, DBLP is shown to assign author names quite accurately to distinct authors, resulting in pairwise precision, recall, and F1 measures around 0.90 or above overall.
Edit intent: clarity
Original:  It is especially well-suited for  singular MEPs, a weakness of all other existing methods, as the fiber product homotopy method is provably convergent with probability one for singular problems as well, a fact borne out by numerical experiments.
Revised:  It is especially well-suited for singular MEPs, a weakness of all other existing methods, as the fiber product homotopy method is provably convergent with probability one for such problems as well, a fact borne out by numerical experiments.
Edit intent: clarity
Original:  We show that the fiber product MEP that we solve in the fiber product homotopy method, although mathematically equivalent to a standard MEP, is typically a much better-conditioned problem.
Revised:  We show that the fiber product MEP that we solve in the fiber product homotopy method, although mathematically equivalent to a standard MEP, is typically a much better conditioned problem.
Edit intent: fluency
Original: In this paper we consider the continuous mathematical model of tumour growth and invasion based on the model introduced by Anderson, Chaplain et al.
Revised: In this paper we consider continuous mathematical models of tumour growth and invasion based on the model introduced by Anderson, Chaplain et al.
Edit intent: fluency
Original:  The model consists of a system of three coupled nonlinear reaction-diffusion-taxis partial differential equations describing the interactions between cancer cells, the matrix degrading enzyme and the tissue.
Revised:  The models consist of a system of three coupled nonlinear reaction-diffusion-taxis partial differential equations describing the interactions between cancer cells, the matrix degrading enzyme and the tissue.
Edit intent: fluency
Original:  For this model under certain conditions on the model parameters we obtain the exact analytical solutions in terms of traveling wave variables.
Revised:  For these models under certain conditions on the model parameters we obtain the exact analytical solutions in terms of traveling wave variables.
Edit intent: clarity
Original:  For this model under certain conditions on the model parameters we obtain the exact analytical solutions in terms of traveling wave variables.
Revised:  For this model under certain conditions on the model parameters we obtain exact analytical solutions in terms of traveling wave variables.
Edit intent: fluency
Original:  Covariance inflation and localization are ubiquitously employed to counteract the effect of using ensembles of finite sizes in all practical data assimilation systems.
Revised:  Covariance inflation and localization are ubiquitously employed to alleviate the effect of using ensembles of finite sizes in all practical data assimilation systems.
Edit intent: clarity
Original:  The performance of the assimilation algorithm is critically influenced by the choice of the parameters of these techniques, that is, the inflation factor and the localization radius  .
Revised:  The choice of both the inflation factor and the localization radius .
Edit intent: clarity
Original:  The performance of the assimilation algorithm is critically influenced by the choice of the parameters of these techniques, that is, the inflation factor and the localization radius  .
Revised:  The performance of the assimilation algorithm is critically influenced by the choice of the parameters of these techniques, that is, the inflation factor and the localization radius can have a significant impact on the performance of the assimilation scheme .
Edit intent: clarity
Original:  In this study, we present a variational framework for adaptive tuning of space-time inflation factors and localization radii .
Revised:  In this study, we present a variational framework for adaptive tuning of the inflation and localization parameters .
Edit intent: clarity
Original:  Each of these parameters is optimized independently and can be applied separately , with an objective to minimize the uncertainty in the posterior state.
Revised:  Each of these parameters is optimized independently , with an objective to minimize the uncertainty in the posterior state.
Edit intent: coherence