wanyu/IteraTeR_v2 huggingface dataset:
Original:  This factor compares to the value of an exponential sizeconfiguration LP . In this paper, we introduce a matroid version of the Santa Claus problem with unit size presents and design an algorithm which gives a polynomial time (3+\varepsilon)-approximation compared to a natural, compact LP . Our algorithm is also based on Haxell's augmentation tree, but despite the greater generality, it is cleaner than previous methods.
Revised:  This factor compares to the value of an exponential sizeconfiguration LP . In this paper, we introduce a matroid version of the Santa Claus problem with unit size presents and design an algorithm which gives a polynomial time (3+\varepsilon)-approximation compared to a natural, compact LP . Our algorithm is also based on Haxell's augmentation tree, but with the introduction of the matroid structure we solve a more general problem with cleaner methods.
Edit intent: clarity
Original:  Our result can then be used as a blackbox to obtain a ( 6 +\varepsilon)-approximation for Santa Claus (with arbitrary present sizes) .
Revised:  Our result can then be used as a blackbox to obtain a ( 6 +\varepsilon)-approximation for Santa Claus .
Edit intent: clarity
Original: We introduce the first living lab for scholarly recommender systems.
Revised: We introduce the first 'living lab' for scholarly recommender systems.
Edit intent: fluency
Original:  This lab allows recommender-system researchers to conduct online evaluations of their novel algorithms for scholarly recommendations, i.e.,  research papers, citations, conferences, research grants  etc.
Revised:  This lab allows recommender-system researchers to conduct online evaluations of their novel algorithms for scholarly recommendations, i.e., recommendations for research papers, citations, conferences, research grants etc.
Edit intent: clarity
Original:  This lab allows recommender-system researchers to conduct online evaluations of their novel algorithms for scholarly recommendations, i.e.,  research papers, citations, conferences, research grants  etc.
Revised:  This lab allows recommender-system researchers to conduct online evaluations of their novel algorithms for scholarly recommendations, i.e., research papers, citations, conferences, research grants , etc.
Edit intent: fluency
Original:  Recommendations are delivered through the living lab's API in platforms such as reference management software and digital libraries.
Revised:  Recommendations are delivered through the living lab's API to platforms such as reference management software and digital libraries.
Edit intent: fluency
Original:  The living lab is built on top of the recommender system as-a-service Mr. DLib.
Revised:  The living lab is built on top of the recommender-system as-a-service Mr. DLib.
Edit intent: fluency
Original:  During this time, 970,517 recommendations were delivered with a mean click-through rate of 0.22 \%.
Revised:  During this time, 970,517 recommendations were delivered with an average click-through rate of 0.22 \%.
Edit intent: clarity
Original:  Finally we prove that no nonadaptive algorithm for the gambler can achieve better than 0.732.
Revised:  Finally we prove that no algorithm for the gambler can achieve better than 0.732.
Edit intent: clarity
Original: This paper addresses uncertainties arising in the nano-scale fabrication of optical devices.
Revised: This work addresses uncertainties arising in the nano-scale fabrication of optical devices.
Edit intent: clarity
Original:  For this model problem, the adaptive strategy allows to compute statistical moments, probabilities and global sensitivity indices, taking into account a moderately high number of uncertain input parameters.
Revised:  For this model problem, the adaptive strategy allows us to conduct a thorough uncertainty analysis, taking into account a moderately high number of uncertain input parameters.
Edit intent: clarity
Original:  In particular , it is found that  geometric sensitivities outweigh sensitivities with respect to material parameters for the considered setting  .
Revised:  In particular , it is found that geometric sensitivities outweigh material-related sensitivities in the considered setting .
Edit intent: clarity
Original:  For this model problem, the adaptive strategy allows us to conduct a thorough uncertainty analysis, taking into account a moderately large number of random parameters . Among various results, it is found that, interestingly, geometric sensitivities outweigh material-related sensitivities in the considered setting, even if the geometrical variations are rather small .
Revised:  For this model problem, the adaptive strategy allows us to conduct a thorough uncertainty analysis, taking into account a moderately large number of random parameters .
Edit intent: coherence
Original: Finding (maximum-cardinality) "cliquish" subgraphs is a central topic in graph mining and community detection.
Revised: Finding large "cliquish" subgraphs is a central topic in graph mining and community detection.
Edit intent: clarity
Original:  A popular clique relaxation are 2-clubs: instead of asking for subgraphs of diameter one (these are cliques), one asks for subgraphs of diameter  two (these are 2-clubs).
Revised:  A popular clique relaxation are 2-clubs: instead of asking for subgraphs of diameter one (these are cliques), one asks for subgraphs of diameter at most two (these are 2-clubs).
Edit intent: clarity
Original:  A drawback of the 2-club model is that it produces  hub-and-spoke structures (typically star-like) as maximum-cardinality solutions.
Revised:  A drawback of the 2-club model is that it produces star-like hub-and-spoke structures (typically star-like) as maximum-cardinality solutions.
Edit intent: coherence
Original:  A drawback of the 2-club model is that it produces  hub-and-spoke structures (typically star-like) as maximum-cardinality solutions.
Revised:  A drawback of the 2-club model is that it produces hub-and-spoke structures as maximum-cardinality solutions.
Edit intent: clarity
Original:  Finding these more dense 2-clubs is NP-hard;
Revised:  Finding these more cohesive 2-clubs is NP-hard;
Edit intent: clarity
Original:  We implant the mote on the sciatic nerve of anesthetized rats and investigate the full range of physiological responses achievable with the wireless system .
Revised:  We investigate the performance of the system with motes implanted on the sciatic nerve of anesthetized rats and investigate the full range of physiological responses achievable with the wireless system .
Edit intent: clarity
Original:  We implant the mote on the sciatic nerve of anesthetized rats and investigate the full range of physiological responses achievable with the wireless system .
Revised:  We implant the mote on the sciatic nerve of anesthetized rats and investigate the full range of physiological responses .
Edit intent: clarity
Original:  Current clinically approved neural stimulators require batteries and are many cubic centimeters in size- typically much larger than their intended targets.
Revised:  Current clinically approved neural stimulators require batteries and are many cubic centimeters in size: typically much larger than their intended targets.
Edit intent: fluency
Original:  Current clinically approved neural stimulators require batteries and are many cubic centimeters in size : typically much larger than their intended targets.
Revised:  Current clinically approved neural stimulators require batteries and are many cubic centimeters in size -- typically much larger than their intended targets.
Edit intent: fluency
Original:  We show that the system operates at an acoustic power one fifth the FDA limit for diagnostic ultrasound and is robust to expected real-world acoustic link misalignment.
Revised:  We show that the mote operates at an acoustic power one fifth the FDA limit for diagnostic ultrasound and is robust to expected real-world acoustic link misalignment.
Edit intent: clarity
Original:  We show that the system operates at an acoustic power one fifth the FDA limit for diagnostic ultrasound and is robust to expected real-world acoustic link misalignment.
Revised:  We show that the system operates at an acoustic power one fifth the FDA limit for diagnostic ultrasound and characterize the acoustic wireless link's robustness to expected real-world acoustic link misalignment.
Edit intent: clarity
Original:  We show that the system operates at an acoustic power one fifth the FDA limit for diagnostic ultrasound and is robust to expected real-world acoustic link misalignment.
Revised:  We show that the system operates at an acoustic power one fifth the FDA limit for diagnostic ultrasound and is robust to expected real-world misalignment.
Edit intent: clarity
Original:  Current clinically approved neural stimulators require batteries and are many cubic centimeters in size -- typically much larger than their intended targets.
Revised:  Current clinically approved neural stimulators require batteries and are many cubic centimetres in size -- typically much larger than their intended targets.
Edit intent: fluency
Original:  By combining ideas from Harmonic Analysis (partitions of unity and approximation theory) with Hashing-Based-Estimators~ [Charikar, Siminelakis FOCS'17], we provide a general framework for designing such data-structures through hashing.
Revised:  By combining ideas from *Harmonic Analysis* (partitions of unity and approximation theory) with Hashing-Based-Estimators~ [Charikar, Siminelakis FOCS'17], we provide a general framework for designing such data-structures through hashing.
Edit intent: fluency
Original:  By combining ideas from Harmonic Analysis (partitions of unity and approximation theory) with Hashing-Based-Estimators~ [Charikar, Siminelakis FOCS'17], we provide a general framework for designing such data-structures through hashing.
Revised:  By combining ideas from Harmonic Analysis (partitions of unity and approximation theory) with *Hashing-Based-Estimators* [Charikar, Siminelakis FOCS'17], we provide a general framework for designing such data-structures through hashing.
Edit intent: fluency
Original:  Using this new framework along with \emph{Distance Sensitive Hashing [Aumuller, Christiani, Pagh, Silvestri PODS'18], we show that such a collection can be constructed and evaluated efficiently for any log-convex function w(x,y)=e^{\phi(\langle x,y\rangle)} of the inner product on the unit sphere x,y\in S^{d-1}.
Revised:  Using this new framework along with \emph{Distance Sensitive Hashing [Aumuller, Christiani, Pagh, Silvestri PODS'18], we show that such a collection can be constructed and evaluated efficiently for any *log-convex* function w(x,y)=e^{\phi(\langle x,y\rangle)} of the inner product on the unit sphere x,y\in S^{d-1}.
Edit intent: clarity
Original:  Using this new framework along with \emph{Distance Sensitive Hashing [Aumuller, Christiani, Pagh, Silvestri PODS'18], we show that such a collection can be constructed and evaluated efficiently for any log-convex function w(x,y)=e^{\phi(\langle x,y\rangle)} of the inner product on the unit sphere x,y\in S^{d-1}.
Revised:  Using this new framework along with \emph{Distance Sensitive Hashing [Aumuller, Christiani, Pagh, Silvestri PODS'18], we show that such a collection can be constructed and evaluated efficiently for any log-convex function w(x,y)=e^{\phi(\langle x,y\rangle)} of the *inner product* on the unit sphere x,y\in S^{d-1}.
Edit intent: fluency
Original:  Our method leads to data-structures with sub-linear query time that significantly improve upon random sampling and can be used for Kernel Density or Partition Function Estimation.
Revised:  Our method leads to data-structures with *sub-linear query time* that significantly improve upon random sampling and can be used for Kernel Density or Partition Function Estimation.
Edit intent: coherence
Original:  By combining ideas from *Harmonic Analysis* (partitions of unity and approximation theory) with *Hashing-Based-Estimators* [Charikar, Siminelakis FOCS'17], we provide a general framework for designing such data-structures through hashing .
Revised:  By combining ideas from Harmonic Analysis (partitions of unity and approximation theory) with *Hashing-Based-Estimators* [Charikar, Siminelakis FOCS'17], we provide a general framework for designing such data-structures through hashing .
Edit intent: fluency
Original:  By combining ideas from *Harmonic Analysis* (partitions of unity and approximation theory) with *Hashing-Based-Estimators* [Charikar, Siminelakis FOCS'17], we provide a general framework for designing such data-structures through hashing .
Revised:  By combining ideas from *Harmonic Analysis* (partitions of unity and approximation theory) with Hashing-Based-Estimators [Charikar, Siminelakis FOCS'17], we provide a general framework for designing such data-structures through hashing .
Edit intent: fluency
Original:  Using this new framework along with *Distance Sensitive Hashing* [Aumuller, Christiani, Pagh, Silvestri PODS'18], we show that such a collection can be constructed and evaluated efficiently for any *log-convex* function w(x,y)=e^{\phi(\langle x,y\rangle)} of the *inner product* on the unit sphere x,y\in \mathcal{S}^{d-1}.
Revised:  Using this new framework along with Distance Sensitive Hashing [Aumuller, Christiani, Pagh, Silvestri PODS'18], we show that such a collection can be constructed and evaluated efficiently for any *log-convex* function w(x,y)=e^{\phi(\langle x,y\rangle)} of the *inner product* on the unit sphere x,y\in \mathcal{S}^{d-1}.
Edit intent: fluency
Original:  Using this new framework along with *Distance Sensitive Hashing* [Aumuller, Christiani, Pagh, Silvestri PODS'18], we show that such a collection can be constructed and evaluated efficiently for any *log-convex* function w(x,y)=e^{\phi(\langle x,y\rangle)} of the *inner product* on the unit sphere x,y\in \mathcal{S}^{d-1}.
Revised:  Using this new framework along with *Distance Sensitive Hashing* [Aumuller, Christiani, Pagh, Silvestri PODS'18], we show that such a collection can be constructed and evaluated efficiently for any log-convex function w(x,y)=e^{\phi(\langle x,y\rangle)} of the *inner product* on the unit sphere x,y\in \mathcal{S}^{d-1}.
Edit intent: fluency
Original:  Using this new framework along with *Distance Sensitive Hashing* [Aumuller, Christiani, Pagh, Silvestri PODS'18], we show that such a collection can be constructed and evaluated efficiently for any *log-convex* function w(x,y)=e^{\phi(\langle x,y\rangle)} of the *inner product* on the unit sphere x,y\in \mathcal{S}^{d-1}.
Revised:  Using this new framework along with *Distance Sensitive Hashing* [Aumuller, Christiani, Pagh, Silvestri PODS'18], we show that such a collection can be constructed and evaluated efficiently for any *log-convex* function w(x,y)=e^{\phi(\langle x,y\rangle)} of the inner product on the unit sphere x,y\in \mathcal{S}^{d-1}.
Edit intent: fluency
Original:  Our method leads to data-structures with *sub-linear query time* that significantly improve upon random sampling and can be used for Kernel Density or Partition Function Estimation.
Revised:  Our method leads to data structures with sub-linear query time that significantly improve upon random sampling and can be used for Kernel Density or Partition Function Estimation.
Edit intent: fluency
Original:  We provide extensions of our result from the sphere to \mathbb{R}^{d} , and from scalar functions to vector functions.
Revised:  We provide extensions of our result from the sphere to \mathbb{R}^{d} and from scalar functions to vector functions.
Edit intent: fluency
Original: As a generalization of many classic problems in combinatorial optimization , submodular optimization has found a wide range of applications in machine learning (e.g., in feature engineering and active learning).
Revised: Submodular optimization generalizes many classic problems in combinatorial optimization , submodular optimization has found a wide range of applications in machine learning (e.g., in feature engineering and active learning).
Edit intent: coherence
Original: As a generalization of many classic problems in combinatorial optimization , submodular optimization has found a wide range of applications in machine learning (e.g., in feature engineering and active learning).
Revised: As a generalization of many classic problems in combinatorial optimization , submodular optimization has found a wide range of applications in machine learning (e.g., feature engineering and active learning).
Edit intent: fluency
Original:  While low adaptivity is ideal, it is not sufficient for a (distributed ) algorithm to be efficient, since in many practical applications of submodular optimization the number of function evaluations becomes prohibitively expensive.
Revised:  While low adaptivity is ideal, it is not sufficient for a distributed algorithm to be efficient, since in many practical applications of submodular optimization the number of function evaluations becomes prohibitively expensive.
Edit intent: fluency
Original:  Motivated by such applications, we study the adaptivity and query complexity of adaptive submodular optimization.
Revised:  Motivated by these applications, we study the adaptivity and query complexity of adaptive submodular optimization.
Edit intent: clarity
Original:  Furthermore, this algorithm runs in O(\log(n)) adaptive rounds and makes O(n) calls to the function evaluation oracle in expectation.
Revised:  This algorithm runs in O(\log(n)) adaptive rounds and makes O(n) calls to the function evaluation oracle in expectation.
Edit intent: coherence
Original:  Finally, to show the generality of our simple algorithm and techniques, we extend our results to the submodular cover problem  .
Revised:  Last, we extend our results to the submodular cover problem .
Edit intent: clarity
Original:  Finally, to show the generality of our simple algorithm and techniques, we extend our results to the submodular cover problem  .
Revised:  Finally, to show the generality of our simple algorithm and techniques, we extend our results to the submodular cover problem to demonstrate the generality of our algorithm and techniques .
Edit intent: coherence
Original: Urbanization and the decline of access to naturehave coincided with a rise of mental health problems . A growing body of research has demonstrated an association between nature contact and improved mental affect (i.e., mood).
Revised: With more people living in cities, we are witnessing a decline in exposure to nature . A growing body of research has demonstrated an association between nature contact and improved mental affect (i.e., mood).
Edit intent: clarity
Original:  Here, we use Twitter to investigate how mental affect varies before, during, and after visits to a large urban park system.
Revised:  Here, we use Twitter to investigate how sentiment, or the estimated happiness of the words people write, varied before, during, and after visits to a large urban park system.
Edit intent: clarity
Original:  Here, we use Twitter to investigate how mental affect varies before, during, and after visits to a large urban park system.
Revised:  Here, we use Twitter to investigate how mental affect varies before, during, and after visits to San Francisco's urban park system.
Edit intent: clarity
Original:  We find that affect is substantially higher during park visits and remains elevated for several hours following the visit.
Revised:  We find that affect is substantially higher during park visits and remained elevated for several hours following the visit.
Edit intent: fluency
Original:  Visits to Regional Parks, which are greener and have greater vegetative cover, result in a greater increase in affect compared to Civic Plazas and Squares.
Revised:  Leveraging differences in vegetative cover across park types, we explored how different types of outdoor public spaces may contribute to subjective well-being. Tweets during visits to Regional Parks, which are greener and have greater vegetative cover, result in a greater increase in affect compared to Civic Plazas and Squares.
Edit intent: clarity
Original:  Visits to Regional Parks, which are greener and have greater vegetative cover, result in a greater increase in affect compared to Civic Plazas and Squares.
Revised:  Visits to Regional Parks, which are greener and have greater vegetative cover, exhibited larger increases in sentiment than tweets during visits to Civic Plazas and Squares.
Edit intent: clarity
Original:  Finally, we analyze the words in tweets around park visits to explore several theorized mechanisms linking nature exposure with mental and cognitive benefits.
Revised:  Finally, we analyzed word frequencies to explore several theorized mechanisms linking nature exposure with mental and cognitive benefits.
Edit intent: clarity
Original:  Finally, we analyze the words in tweets around park visits to explore several theorized mechanisms linking nature exposure with mental and cognitive benefits.
Revised:  Finally, we analyze the words in tweets around park visits to explore several mechanisms theorized to link nature exposure with mental and cognitive benefits.
Edit intent: fluency
Original:  Negation words such as "no", "not", and " don't " decrease in frequency during visits to urban parks.
Revised:  Negation words such as 'no', 'not', and ' don't " decrease in frequency during visits to urban parks.
Edit intent: fluency
Original:  Negation words such as "no", "not", and " don't " decrease in frequency during visits to urban parks.
Revised:  Negation words such as "no", "not", and " don't ' decreased in frequency during visits to urban parks.
Edit intent: fluency
Original:  These results point to the most beneficial types of nature contact for mental health benefits and can be used by urban planners and public health officials to improve the well-being of growing urban populations.
Revised:  These results can be used by urban planners and public health officials to improve the well-being of growing urban populations.
Edit intent: clarity
Original:  These results point to the most beneficial types of nature contact for mental health benefits and can be used by urban planners and public health officials to improve the well-being of growing urban populations.
Revised:  These results point to the most beneficial types of nature contact for mental health benefits and can be used by urban planners and public health officials to better target nature contact recommendations for growing urban populations.
Edit intent: clarity
Original: This paper considers the design of optimal resource allocation policies in wireless communication systems which are generically modeled as a functional optimization problems with stochastic constraints.
Revised: This paper considers the design of optimal resource allocation policies in wireless communication systems which are generically modeled as a functional optimization problem with stochastic constraints.
Edit intent: fluency
Original:  These optimization problems have the structure of a learning problem in which the statistical loss appears as a constraint  motivating the development of learning methodologies to attempt their solution.
Revised:  These optimization problems have the structure of a learning problem in which the statistical loss appears as a constraint , motivating the development of learning methodologies to attempt their solution.
Edit intent: fluency
Original:  We find strikingly different phase diagrams corresponding to each networkstructure . Neuronal network dynamics is not only different within certain parameter ranges, but it also undergoes different bifurcations .
Revised:  We find strikingly different phase diagrams in the all-to-all network . Neuronal network dynamics is not only different within certain parameter ranges, but it also undergoes different bifurcations .
Edit intent: clarity
Original: An important application of introduced in 1 Lebesgue integral quadrature  is developed.
Revised: An important application of 1 Lebesgue integral quadrature is developed.
Edit intent: clarity
Original: An important application of introduced in 1 Lebesgue integral quadrature  is developed.
Revised: An important application of introduced in Lebesgue integral quadrature is developed.
Edit intent: fluency