wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our analysis suggests I/ S {\cal  as a more natural candidate, where S is the \cal  bid-ask spread.
Revised:  Our analysis suggests I/ S {\cal as a more natural candidate, where \cal bid-ask spread.
Edit intent: clarity
Original:  We also establish two more complex scaling laws for the volatility \sigma and the traded volume V as a function of N, that reveal the existence of a characteristic number of trades N_0 above which the expected behaviour \sigma \sim N and V \sim N hold, but below which strong deviations appear, induced by the size of the  tick.
Revised:  We also establish two more complex scaling laws for the volatility \sigma and the traded volume V as a function of N, that reveal the existence of a characteristic number of trades N_0 above which the expected behaviour \sigma \sim N and V \sim N hold, but below which strong deviations appear, induced by the size of the ~ tick.
Edit intent: fluency
Original:  In this article, we propose a new approach to breeding which focuses on mating instead of selection, we refer it to as genomic mating.
Revised:  In this article, we propose an approach to breeding which focuses on mating instead of selection, we refer it to as genomic mating.
Edit intent: clarity
Original:  The results from our simulations point to the efficiency of our method to selection based breeding .
Revised:  The results from our simulations point to the efficiency of genomic mating for breeding complex traits compared to truncation selection .
Edit intent: clarity
Original:  Also it turns out that the hardness results are much more robust against conjunctive and disjunctive normal forms than plain QBF.
Revised:  Also it turns out that the hardness results do not collapse at the consideration of conjunctive and disjunctive normal forms than plain QBF.
Edit intent: clarity
Original:  Also it turns out that the hardness results are much more robust against conjunctive and disjunctive normal forms than plain QBF.
Revised:  Also it turns out that the hardness results are much more robust against conjunctive and disjunctive normal forms , in contrast to plain QBF.
Edit intent: coherence
Original:  The majority of prior studies focus on how to target highly influential users as initial adopters so that they can trigger substantial information cascades in social networks.
Revised:  The majority of prior studies focus on targeting influential seeders to trigger substantial information cascades in social networks.
Edit intent: clarity
Original:  The majority of prior studies focus on how to target highly influential users as initial adopters so that they can trigger substantial information cascades in social networks.
Revised:  The majority of prior studies focus on how to target highly influential users as initial adopters so that they can trigger substantial information spread in social networks.
Edit intent: clarity
Original:  We assume that we can "boost" a small set of users by offering them incentives (e.g., discounts) so that they are more likely to be influenced by their friends.
Revised:  We assume that we can "boost" users so that they are more likely to be influenced by their friends.
Edit intent: clarity
Original:  We assume that we can "boost" a small set of users by offering them incentives (e.g., discounts) so that they are more likely to be influenced by their friends.
Revised:  We assume that we can "boost" a small set of users by offering them incentives (e.g., discounts) so that they are more likely to be influenced by friends.
Edit intent: clarity
Original:  We study the k-boosting problem which asks for k users so that the influence spread upon " boosting " them is maximized.
Revised:  We study the k-boosting problem which aims to find k users to boost so that the influence spread upon " boosting " them is maximized.
Edit intent: clarity
Original:  We study the k-boosting problem which asks for k users so that the influence spread upon " boosting " them is maximized.
Revised:  We study the k-boosting problem which asks for k users so that the final " boosting " them is maximized.
Edit intent: clarity
Original:  We study the k-boosting problem which asks for k users so that the influence spread upon " boosting " them is maximized.
Revised:  We study the k-boosting problem which asks for k users so that the influence spread upon " boosted " them is maximized.
Edit intent: fluency
Original:  We study the k-boosting problem which asks for k users so that the influence spread upon " boosting " them is maximized.
Revised:  We study the k-boosting problem which asks for k users so that the influence spread upon " boosting " influence spread is maximized.
Edit intent: clarity
Original:  In our experiments, boosting solutions returned by our algorithms achieve boosts of influence that are 3%DIFDELCMD < \\%%% %DIF < to 2555\\% higher than  those achieved by boosting solutions returned by intuitive baselines  .
Revised:  In our experiments, boosting solutions returned by our algorithms achieves boosts of influence that are 3%DIFDELCMD < \\%%% %DIF < to 2555\\% higher than those achieved by boosting solutions returned by intuitive baselines .
Edit intent: fluency
Original:  In our experiments, boosting solutions returned by our algorithms achieve boosts of influence that are 3%DIFDELCMD < \\%%% %DIF < to 2555\\% higher than  those achieved by boosting solutions returned by intuitive baselines  .
Revised:  In our experiments, boosting solutions returned by our algorithms achieve boosts of influence that are %DIFDELCMD < \\%%% %DIF < to 2555\\% higher than those achieved by boosting solutions returned by intuitive baselines .
Edit intent: clarity
Original: Multiple myeloma , a type of plasma cell cancer, is associated with many health challenges, including damage to the kidney by tubulointerstitial fibrosis.
Revised: Multiple myeloma (MM), a plasma cell cancer, is associated with many health challenges, including damage to the kidney by tubulointerstitial fibrosis.
Edit intent: clarity
Original:  We develop an ordinary differential equation (ODE) model which captures the qualitative behavior of the cell  populations involved.
Revised:  We develop a mathematical model which captures the qualitative behavior of the cell populations involved.
Edit intent: clarity
Original:  Specifically, we model the interaction between cells in the proximal tubule of the kidney and free light chains produced by the myeloma monoclonal protein .
Revised:  Specifically, we model the interaction between cells in the proximal tubule of the kidney , free light chains produced by the myeloma monoclonal protein .
Edit intent: fluency
Original: Driven by new types of wireless devices and the proliferation of bandwidth-intensive applications, user data traffic and the corresponding network load are increasing dramatically.
Revised: Driven by new types of wireless devices and the proliferation of bandwidth-intensive applications, data traffic and the corresponding network load are increasing dramatically.
Edit intent: clarity
Original:  Network densification has been recognized as one of the most promising and efficient ways to provide higher network capacity and enhanced coverage.
Revised:  Network densification has been recognized as a promising and efficient ways to provide higher network capacity and enhanced coverage.
Edit intent: clarity
Original:  Network densification has been recognized as one of the most promising and efficient ways to provide higher network capacity and enhanced coverage.
Revised:  Network densification has been recognized as one of the most promising and efficient way to provide higher network capacity and enhanced coverage.
Edit intent: fluency
Original:  Most prior work on analyzing the performance of ultra dense networks (UDNs) has focused on random spatial deployment with idealized , singular path loss models and Rayleigh fading.
Revised:  Most prior work on performance analysis of ultra-dense networks (UDNs) has focused on random spatial deployment with idealized , singular path loss models and Rayleigh fading.
Edit intent: fluency
Original:  Most prior work on analyzing the performance of ultra dense networks (UDNs) has focused on random spatial deployment with idealized , singular path loss models and Rayleigh fading.
Revised:  Most prior work on analyzing the performance of ultra dense networks (UDNs) has focused on random spatial deployment with idealized singular path loss models and Rayleigh fading.
Edit intent: fluency
Original:  We derive the tail behavior and scaling laws on the coverage probability and the average rate assuming strongest base station association  .
Revised:  We derive the tail behavior and scaling laws for the coverage probability and the average rate assuming strongest base station association .
Edit intent: clarity
Original:  We derive the tail behavior and scaling laws on the coverage probability and the average rate assuming strongest base station association  .
Revised:  We derive the tail behavior and scaling laws on the coverage probability and the capacity considering strongest base station association .
Edit intent: clarity
Original:  We establish general results on when ultra densification leads to worse or even zero SINR coverage and rate, providing useful insights on the ultimate performance limits of network densification.
Revised:  We establish general results on when UDNs lead to worse or even zero SINR coverage and rate, providing useful insights on the ultimate performance limits of network densification.
Edit intent: clarity
Original:  We establish general results on when ultra densification leads to worse or even zero SINR coverage and rate, providing useful insights on the ultimate performance limits of network densification.
Revised:  We establish general results on when ultra densification leads to worse or even zero SINR coverage and capacity, and we provide crisp insights on the ultimate performance limits of network densification.
Edit intent: clarity
Original:  We establish general results on when ultra densification leads to worse or even zero SINR coverage and rate, providing useful insights on the ultimate performance limits of network densification.
Revised:  We establish general results on when ultra densification leads to worse or even zero SINR coverage and rate, providing useful insights on the fundamental limits of wireless network densification.
Edit intent: clarity
Original:  We introduce a new notion of polynomial depth based on time bounded Kolmogorov complexity.
Revised:  We introduce a new notion of polylog depth based on time bounded Kolmogorov complexity.
Edit intent: clarity
Original:  We show our polynomial depth notion satisfies all basic logical depth properties, namely neither sets in P nor sets random for EXP are polynomial deep, and only polynomial deep sets can polynomially Turing compute a polynomial deep set.
Revised:  We show polylog depth satisfies all basic logical depth properties, namely neither sets in P nor sets random for EXP are polynomial deep, and only polynomial deep sets can polynomially Turing compute a polynomial deep set.
Edit intent: clarity
Original:  We show our polynomial depth notion satisfies all basic logical depth properties, namely neither sets in P nor sets random for EXP are polynomial deep, and only polynomial deep sets can polynomially Turing compute a polynomial deep set.
Revised:  We show our polynomial depth notion satisfies all basic logical depth properties, namely sets in P nor sets random for EXP are polynomial deep, and only polynomial deep sets can polynomially Turing compute a polynomial deep set.
Edit intent: clarity
Original:  We show our polynomial depth notion satisfies all basic logical depth properties, namely neither sets in P nor sets random for EXP are polynomial deep, and only polynomial deep sets can polynomially Turing compute a polynomial deep set.
Revised:  We show our polynomial depth notion satisfies all basic logical depth properties, namely neither sets in P nor sets random for EXP are polynomial deep, and only polylog deep sets can polynomially Turing compute a polynomial deep set.
Edit intent: clarity
Original:  We show our polynomial depth notion satisfies all basic logical depth properties, namely neither sets in P nor sets random for EXP are polynomial deep, and only polynomial deep sets can polynomially Turing compute a polynomial deep set.
Revised:  We show our polynomial depth notion satisfies all basic logical depth properties, namely neither sets in P nor sets random for EXP are polynomial deep, and only polynomial deep sets can polynomially Turing compute a polylog deep set.
Edit intent: clarity
Original:  We prove all EXP- complete sets are poly-deep, and under the assumption that NP does not have p-measure zero, then NP contains a polynomial deep set .
Revised:  We prove that if NP does not have p-measure zero, then NP contains a polynomial deep set .
Edit intent: coherence
Original:  We show that every high set for E contains a polynomial deep set in its polynomial Turing degree, and that there exists lowfor Epolynomial deep sets .
Revised:  We show that every high set for E contains a polylog deep set in its polynomial Turing degree, and that there exists lowfor Epolynomial deep sets .
Edit intent: fluency
Original:  Adaptive schemes, where tasks are assigned  based on the data collected thus far, are widely used in practical crowdsourcing systems to efficiently allocate the budget.
Revised:  Adaptive schemes, where tasks are assigned based on the data collected thus far, are widely used in practical crowdsourcing systems to efficiently use a given fixed budget.
Edit intent: clarity
Original:  To bridge this gap, we investigate this question under a strictly more general probabilistic model, which has been recently introduced to model practical crowdsourcing datasets . Under this generalized Dawid-Skene model, we characterize the fundamental trade-off between budget and accuracy.
Revised:  To bridge this gap, we investigate this question under a strictly more general probabilistic model, which has been recently introduced to model practical crowdsourced annotations . Under this generalized Dawid-Skene model, we characterize the fundamental trade-off between budget and accuracy.
Edit intent: clarity
Original:  We further quantify the gain of adaptivity , by comparing the tradeoff with the one for non-adaptive schemes , and confirm that the gain is significantand can be made arbitrarily large depending on the distribution of the difficulty level of the tasks at hand .
Revised:  We further quantify the gain of adaptivity , by comparing the trade-off with the one for non-adaptive schemes , and confirm that the gain is significantand can be made arbitrarily large depending on the distribution of the difficulty level of the tasks at hand .
Edit intent: fluency
Original:  We further quantify the gain of adaptivity , by comparing the tradeoff with the one for non-adaptive schemes , and confirm that the gain is significantand can be made arbitrarily large depending on the distribution of the difficulty level of the tasks at hand .
Revised:  We further quantify the gain of adaptivity , by comparing the tradeoff with the one for non-adaptive schemes . Our analyses confirm that the gain is significantand can be made arbitrarily large depending on the distribution of the difficulty level of the tasks at hand .
Edit intent: clarity
Original:  We further quantify the gain of adaptivity , by comparing the tradeoff with the one for non-adaptive schemes , and confirm that the gain is significantand can be made arbitrarily large depending on the distribution of the difficulty level of the tasks at hand .
Revised:  We further quantify the gain of adaptivity , by comparing the tradeoff with the one for non-adaptive schemes , and confirm that the gap is significant .
Edit intent: clarity
Original: In this paper  we investigate few memristor based analog circuits namely the phase shift oscillator, integrator  and differentiator which have been explored numerously using the traditional lumped components.
Revised: In this paper , we investigate few memristor based analog circuits namely the phase shift oscillator, integrator and differentiator which have been explored numerously using the traditional lumped components.
Edit intent: fluency
Original: In this paper  we investigate few memristor based analog circuits namely the phase shift oscillator, integrator  and differentiator which have been explored numerously using the traditional lumped components.
Revised: In this paper we investigate few memristor-based analog circuits namely the phase shift oscillator, integrator and differentiator which have been explored numerously using the traditional lumped components.
Edit intent: fluency
Original: In this paper  we investigate few memristor based analog circuits namely the phase shift oscillator, integrator  and differentiator which have been explored numerously using the traditional lumped components.
Revised: In this paper we investigate few memristor based analog circuits namely the phase shift oscillator, integrator , and differentiator which have been explored numerously using the traditional lumped components.
Edit intent: fluency
Original:  We use LTspice-IV platform for simulation of the above said circuits.
Revised:  We use LTspice-IV platform for simulation of the above-said circuits.
Edit intent: fluency
Original:  The investigation resorts to the nonlinear dopent drift model of memristor and the window function portrayed in the literature for nonlinearity realization.
Revised:  The investigation resorts to the nonlinear dopant drift model of memristor and the window function portrayed in the literature for nonlinearity realization.
Edit intent: fluency
Original:  The results of our investigations depict good agreement with the conventional lumped component based phase shift oscillator, integrator  and differentiator circuits.
Revised:  The results of our investigations depict good agreement with the conventional lumped component based phase shift oscillator, integrator , and differentiator circuits.
Edit intent: fluency
Original:  The results are evident to showcase the potential of  memristor as a promising candidate for the next generation analog circuits.
Revised:  The results are evident to showcase the potential of the memristor as a promising candidate for the next generation analog circuits.
Edit intent: fluency
Original:  We also show how all of the components of our model---including schemas, instances, change-of-schema functors, and queries %DIFDELCMD < \dash %%%  fit into a single double categorical structure called a proarrow equipment (a.k.a. framed bicategory).
Revised:  We also show how all of the components of our model---including schemas, instances, change-of-schema functors, and queries %DIFDELCMD < \dash %%% - fit into a single double categorical structure called a proarrow equipment (a.k.a. framed bicategory).
Edit intent: fluency
Original: In this paper, we consider the problem of estimating the underlying graphical model of an Ising distribution given a number of independent and identically distributed samples.
Revised: In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples.
Edit intent: clarity
Original:  We adopt an approximate recovery criterion that allows for a number of missed edges or incorrectly-included edges, thus departing from the extensive literature considering the exact recovery problem.
Revised:  We adopt an approximate recovery criterion that allows for a number of missed edges or incorrectly-included edges, in contrast with the widely-studied exact recovery problem.
Edit intent: clarity
Original:  Our main results provide information-theoretic lower bounds on the required number of samples (i.e., the sample complexity ) for graph classes imposing constraints on the number of edges, maximal degree, and sparse separation properties.
Revised:  Our main results provide information-theoretic lower bounds on the sample complexity for graph classes imposing constraints on the number of edges, maximal degree, and sparse separation properties.
Edit intent: clarity
Original:  Our main results provide information-theoretic lower bounds on the required number of samples (i.e., the sample complexity ) for graph classes imposing constraints on the number of edges, maximal degree, and sparse separation properties.
Revised:  Our main results provide information-theoretic lower bounds on the required number of samples (i.e., the sample complexity ) for graph classes imposing constraints on the number of edges, maximal degree, and other properties.
Edit intent: clarity
Original: LBS have become extremely popular and used by millions of users.
Revised: Location Based Services (LBS) have become extremely popular and used by millions of users.
Edit intent: clarity
Original:  They are an essential data source for geospatial and commercial information such as Points- of-Interest (POIs) , restaurants , real-estate , user geo-distribution etc.
Revised:  Popular LBS run the entire gamut from mapping services (such as Google Maps) to restaurants (such as Yelp) and real-estate , user geo-distribution etc.
Edit intent: clarity
Original:  In this paper we investigate the following novel problem : Is it possible to develop density-based clustering algorithms over LBS data that only have local-view access to the data, such as a kNN query interface ?
Revised:  In this paper , we consider the novel problem of enabling density based clustering over an LBS with only a limited, kNN query interface ?
Edit intent: clarity
Original:  Asynchronous programs can have subtle bugs due to the non-deterministic scheduling of events , and a lot of recent research has focused on systematic testing of these programs . Empirically, many bugs in asynchronous programs have small bug depth :
Revised:  Asynchronous programs can have subtle bugs due to the non-deterministic scheduling of events , and a lot of recent research has focused on systematic testing of these programs . Empirically, many bugs in concurrent programs have been observed to have small bug depth :
Edit intent: clarity
Original:  Asynchronous programs can have subtle bugs due to the non-deterministic scheduling of events , and a lot of recent research has focused on systematic testing of these programs . Empirically, many bugs in asynchronous programs have small bug depth :
Revised:  Asynchronous programs can have subtle bugs due to the non-deterministic scheduling of events , and a lot of recent research has focused on systematic testing of these programs . Empirically, many bugs in asynchronous programs have small bug depth ;
Edit intent: fluency
Original:  that is, the number of events d that must be scheduled in a specific order for a bug to be exposed is small . A natural question then is to find a d-hitting family of schedules:  a set of schedules is a d-hitting family if for each set of d events, and for each allowed ordering of these events, there is some schedule in the family that executes these events in this ordering.
Revised:  that is, these bugs are exposed by every schedule that orders d specific events in a particular way, irrespective of how the other events are ordered, and d is small compared to the total number of events. To find all bugs of depth d, one needs to only test a d-hitting family of schedules: a set of schedules is a d-hitting family if for each set of d events, and for each allowed ordering of these events, there is some schedule in the family that executes these events in this ordering.
Edit intent: clarity