wanyu/IteraTeR_v2 huggingface dataset:
Original:  There are two components to this framework: (i) a confidence-adjusted surprise measure to capture environmental statistics as well as subjective beliefs, (ii) a surprise-minimization learning rule, or SMiLe-rule, which dynamically adjusts the balance between new and old information without making prior assumptions about the temporal statistics in the environment.
Revised:  There are two components to this framework: (i) a confidence-adjusted surprise measure to capture environmental statistics as well as subjective beliefs, (ii) a surprise-minimization learning rule, or SMiLe-rule, which dynamically adjusts the balance between new and old information without making prior assumptions about the temporal statistics of the environment.
Edit intent: clarity
Original:  We apply our framework to a dynamic decision making task and a maze exploration task to demonstrate that it is suitable for learning in complex environments, even if the environment undergoes gradual or sudden changes .
Revised:  We apply our framework to a dynamic decision-making task and a maze exploration task to demonstrate that it is suitable for learning in complex environments, even if the environment undergoes gradual or sudden changes .
Edit intent: fluency
Original: The paper is devoted to upper bounds on  expected first hitting times of the sets of local or global optima for non-elitist genetic algorithms with very high selection pressure.
Revised: The paper is devoted to upper bounds on the expected first hitting times of the sets of local or global optima for non-elitist genetic algorithms with very high selection pressure.
Edit intent: fluency
Original:  The obtained results extend the range of situations where the upper bounds on the expected runtime are known for genetic algorithms and apply, in particular, to  Canonical Genetic Algorithm  .
Revised:  The results of this paper extend the range of situations where the upper bounds on the expected runtime are known for genetic algorithms and apply, in particular, to Canonical Genetic Algorithm .
Edit intent: clarity
Original:  The obtained results extend the range of situations where the upper bounds on the expected runtime are known for genetic algorithms and apply, in particular, to  Canonical Genetic Algorithm  .
Revised:  The obtained results extend the range of situations where the upper bounds on the expected runtime are known for genetic algorithms and apply, in particular, to the Canonical Genetic Algorithm .
Edit intent: fluency
Original:  The method consists of constructing a new functional that is less nonlinear in comparison with the classical functional by removing the nonlinearity of the activation functions from the output layer.
Revised:  The method consists of constructing a new functional that is less nonlinear in comparison with the classical functional by removing the nonlinearity of the activation function from the output layer.
Edit intent: fluency
Original:  We validate this new method by a series of experiments that show an improved learning speed and also a better classification error.
Revised:  We validate this new method by a series of experiments that show an improved learning speed and better classification error.
Edit intent: clarity
Original:  Finally, we discuss the fact that the traditional, unconditioned likelihood always delivers an answer, which is often unfalsifiable and appears reasonable also when it is wrong .
Revised:  Finally, we discuss the fact that the traditional, unconditioned likelihood always delivers an answer, which is often unfalsifiable and appears reasonable also when it is not correct .
Edit intent: clarity
Original: The research community has considered the application of Artificial Intelligence (AI) techniques to control and operate networks.
Revised: The research community has considered in the past the application of Artificial Intelligence (AI) techniques to control and operate networks.
Edit intent: clarity
Original:  A notable example is the Knowledge Plane as proposed by D.Clark et al.
Revised:  A notable example is the Knowledge Plane proposed by D.Clark et al.
Edit intent: clarity
Original:  Such techniques have not been extensively prototyped or deployed in the field yet.
Revised:  However, such techniques have not been extensively prototyped or deployed in the field yet.
Edit intent: coherence
Original:  In this paper, we explore the reasons for the lack of adoption and posit that the rise of two recent paradigms: Software Defined Networking (SDN) and Network Analytics (NA), will facilitate the adoption of AI techniques in the context of network operation and control.
Revised:  In this paper, we explore the reasons for the lack of adoption and posit that the rise of two recent paradigms: Software-Defined Networking (SDN) and Network Analytics (NA), will facilitate the adoption of AI techniques in the context of network operation and control.
Edit intent: fluency
Original:  We describe in some detail an architecture which accommodates and exploits SDN, NA and AI, and provide use cases that illustrate its applicability and benefits , together with simple experimental results that support its feasibility.
Revised:  We describe a new paradigm that accommodates and exploits SDN, NA and AI, and provide use cases that illustrate its applicability and benefits , together with simple experimental results that support its feasibility.
Edit intent: clarity
Original:  We describe in some detail an architecture which accommodates and exploits SDN, NA and AI, and provide use cases that illustrate its applicability and benefits , together with simple experimental results that support its feasibility.
Revised:  We describe in some detail an architecture which accommodates and exploits SDN, NA and AI, and provide use cases that illustrate its applicability and benefits . We also present simple experimental results that support its feasibility.
Edit intent: clarity
Original:  We refer to this architecture as Knowledge Defined Networking (KDN).
Revised:  We refer to this new paradigm as Knowledge-Defined Networking (KDN).
Edit intent: clarity
Original: Woolly mammoths (Mammuthus primigenius) populated Siberia, Beringea , and North America during the pleistocene and early holocene .
Revised: Woolly mammoths (Mammuthus primigenius) populated Siberia, Beringia , and North America during the pleistocene and early holocene .
Edit intent: fluency
Original: Woolly mammoths (Mammuthus primigenius) populated Siberia, Beringea , and North America during the pleistocene and early holocene .
Revised: Woolly mammoths (Mammuthus primigenius) populated Siberia, Beringea , and North America during the Pleistocene and early Holocene .
Edit intent: fluency
Original:  One mammoth specimen is from a mainland population  45,000 years ago when mammoths were plentiful.
Revised:  One mammoth specimen is from a mainland population ~ 45,000 years ago when mammoths were plentiful.
Edit intent: fluency
Original:  We also propose and test a new mechanism to produce self-organized criticality (SOC) : the use of dynamic neuronal gains - a form of short-term plasticity probably in the axon initial segment (AIS) - instead of depressing synapses at the dendrites (as previously studied in the literature).
Revised:  We also propose and test a new mechanism to produce SOC : the use of dynamic neuronal gains - a form of short-term plasticity probably in the axon initial segment (AIS) - instead of depressing synapses at the dendrites (as previously studied in the literature).
Edit intent: clarity
Original:  We also propose and test a new mechanism to produce self-organized criticality (SOC) : the use of dynamic neuronal gains - a form of short-term plasticity probably in the axon initial segment (AIS) - instead of depressing synapses at the dendrites (as previously studied in the literature).
Revised:  We also propose and test a new mechanism to produce self-organized criticality (SOC) : the use of dynamic neuronal gains -- a form of short-term plasticity probably in the axon initial segment (AIS) - instead of depressing synapses at the dendrites (as previously studied in the literature).
Edit intent: fluency
Original:  We also propose and test a new mechanism to produce self-organized criticality (SOC) : the use of dynamic neuronal gains - a form of short-term plasticity probably in the axon initial segment (AIS) - instead of depressing synapses at the dendrites (as previously studied in the literature).
Revised:  We also propose and test a new mechanism to produce self-organized criticality (SOC) : the use of dynamic neuronal gains - a form of short-term plasticity probably in the axon initial segment (AIS) -- instead of depressing synapses at the dendrites (as previously studied in the literature).
Edit intent: fluency
Original:  One such popular model is the  known I.I.D. model where different customer types arrive online from a known distribution.
Revised:  One such popular model is the " known I.I.D. model where different customer types arrive online from a known distribution.
Edit intent: fluency
Original:  One such popular model is the  known I.I.D. model where different customer types arrive online from a known distribution.
Revised:  One such popular model is the known I.I.D. model " where different customer-types arrive online from a known distribution.
Edit intent: fluency
Original:  We develop algorithms with improved competitive ratios for some basic variants of this model with integral arrival rates, including (a) the case of general weighted edges, where we improve the best-known ratio of 0.667 due to Haeupler, Mirrokni and Zadimoghaddam to 0.705  and (b) the vertex-weighted case, where we improve the 0.7250 ratio of Jaillet and Lu to 0.7299.
Revised:  We develop algorithms with improved competitive ratios for some basic variants of this model with integral arrival rates, including (a) the case of general weighted edges, where we improve the best-known ratio of 0.667 due to Haeupler, Mirrokni and Zadimoghaddam to 0.705 ; and (b) the vertex-weighted case, where we improve the 0.7250 ratio of Jaillet and Lu to 0.7299.
Edit intent: fluency
Original:  This article has been accepted for publication in Physical Review Letters, May 2016.
Revised:  This article has been published in Physical Review Letters, May 2016.
Edit intent: clarity
Original:  For larger number of genes, on the other hand, the spatial structure of the population is less important and the species overlap considerably in space .
Revised:  For larger number of genes, on the other hand, the spatial structure of the population is less important and the species distribution overlap considerably .
Edit intent: clarity
Original:  G is <i> almost hypohamiltonian </i> if there exists a vertex w in G such that G - w is non-hamiltonian, and G - v is hamiltonian for every vertex v \ne w . McKay asked in J. Graph Theory, doi: 10.1002/jgt.22043%DIFDELCMD < ] %%% whether infinitely many planar cubic hypohamiltonian graphs of girth 5 exist.
Revised:  G is <i> almost hypohamiltonian </i> if there exists a vertex w in G such that G - w is non-hamiltonian, and G - v is hamiltonian for every vertex v \ne w J. Graph Theory, doi: 10.1002/jgt.22043%DIFDELCMD < ] %%% whether infinitely many planar cubic hypohamiltonian graphs of girth 5 exist.
Edit intent: coherence
Original:  G is <i> almost hypohamiltonian </i> if there exists a vertex w in G such that G - w is non-hamiltonian, and G - v is hamiltonian for every vertex v \ne w . McKay asked in J. Graph Theory, doi: 10.1002/jgt.22043%DIFDELCMD < ] %%% whether infinitely many planar cubic hypohamiltonian graphs of girth 5 exist.
Revised:  G is <i> almost hypohamiltonian </i> if there exists a vertex w in G such that G - w is non-hamiltonian, and G - v is hamiltonian for every vertex v \ne w . McKay asked in %DIFDELCMD < ] %%% whether infinitely many planar cubic hypohamiltonian graphs of girth 5 exist.
Edit intent: coherence
Original:  The second author asked in [J. Graph Theory 79 (2015) 63--81] to find all orders for which almost hypohamiltonian graphs exist---we solve this problem as well .
Revised:  The second author asked in [J. Graph Theory 79 (2015) 63--81] for all orders for which almost hypohamiltonian graphs exist---we solve this problem as well .
Edit intent: coherence
Original:  The second author asked in [J. Graph Theory 79 (2015) 63--81] to find all orders for which almost hypohamiltonian graphs exist---we solve this problem as well .
Revised:  The second author asked in [J. Graph Theory 79 (2015) 63--81] to find all orders for which almost hypohamiltonian graphs exist---we solve this problem .
Edit intent: clarity
Original:  We also provide a lower bound for the order of the smallest planar almost hypohamiltonian graph and improve the upper bound for the order of the smallest planar almost hypohamiltonian graph containing a cubic vertex.
Revised:  We provide a lower bound for the order of the smallest planar almost hypohamiltonian graph and improve the upper bound for the order of the smallest planar almost hypohamiltonian graph containing a cubic vertex.
Edit intent: clarity
Original:  Finally, we determine the smallest planar almost hypohamiltonian graphs of girth 5, both in the general and cubic case  } } .
Revised:  We also determine the smallest planar almost hypohamiltonian graphs of girth 5, both in the general and cubic case } } .
Edit intent: coherence
Original:  Here we consider both the multi-layer and dynamic nature of social relations by analysing a diverse set of empirical temporal multiplex networks.
Revised:  Here we consider the twofold multi-layer and dynamic nature of social relations by analysing a diverse set of empirical temporal multiplex networks.
Edit intent: clarity
Original:  We focus on the measurement and characterization of inter-layer correlations to investigate how activity in one layer affects social acts in another layer.
Revised:  We focus on the measurement and characterization of inter-layer correlations to investigate how activity in one layer affects social interaction in another layer.
Edit intent: clarity
Original:  We define observables able to detect when genuine correlations are present in empirical data, and single out spurious correlation induced by the bursty nature of human dynamics.
Revised:  We define observables able to detect when genuine correlations are present in empirical data, and single out spurious correlations induced by the bursty nature of human dynamics.
Edit intent: fluency
Original:  We show that such temporal correlations do exist in social interactions  where they act to depress the tendency to concentrate long stretches of activity on the same layer and imply some amount of potential predictability in the connection patterns between layers.
Revised:  We show that such temporal correlations do exist in social interactions , where they act to depress the tendency to concentrate long stretches of activity on the same layer and imply some amount of potential predictability in the connection patterns between layers.
Edit intent: fluency
Original:  We show that such temporal correlations do exist in social interactions  where they act to depress the tendency to concentrate long stretches of activity on the same layer and imply some amount of potential predictability in the connection patterns between layers.
Revised:  We show that such temporal correlations do exist in social interactions where they act to depress the tendency to concentrate long stretches of activity on the same layer , implying at the same time some amount of potential predictability in the connection patterns between layers.
Edit intent: coherence
Original:   Our work sets up a general framework to measure temporal correlations in multiplex networks, and we anticipate that it will be of interest to researchers in a broad array of fields.
Revised:  Our work sets up a general framework to measure temporal correlations and their effects on multiplex networks, and we anticipate that it will be of interest to researchers in a broad array of fields.
Edit intent: clarity
Original:  Here we consider the twofold multi-layer and dynamic nature of social relations by analysing a diverse set of empirical temporal multiplex networks.
Revised:  Here we study the temporal correlations between layers exhibited by real social multiplex networks.
Edit intent: clarity
Original:  More importantly, such inter-layer correlations turn out to affect the dynamics of spreading processes unfolding on different layers .
Revised:  More importantly, such inter-layer correlations turn out to affect the dynamics of coupled epidemic processes unfolding on different layers .
Edit intent: clarity
Original:  More importantly, such inter-layer correlations turn out to affect the dynamics of spreading processes unfolding on different layers .
Revised:  More importantly, such inter-layer correlations turn out to affect the dynamics of spreading processes unfolding on the network .
Edit intent: clarity
Original:  Our work sets up a general framework to measure temporal correlations and their effects on multiplex networks , and we anticipate that it will be of interest to researchers in a broad array of fields.
Revised:  Our work opens the way for the systematic study of temporal multiplex networks and we anticipate that it will be of interest to researchers in a broad array of fields.
Edit intent: clarity
Original:  Our work sets up a general framework to measure temporal correlations and their effects on multiplex networks , and we anticipate that it will be of interest to researchers in a broad array of fields.
Revised:  Our work sets up a general framework to measure temporal correlations and their effects on multiplex networks , and we anticipate it will be of interest to researchers in a broad array of fields.
Edit intent: fluency
Original:  When the TF's own promoter is heterozygous, the TF produced at the higher concentration is also dominant.
Revised:  When the TF's own promoter is heterozygous, the TF produced at the higher dosage is also dominant.
Edit intent: clarity
Original:  Binding dominance extends to the expression of downstream loci and is sensitive to genetic background  .
Revised:  Binding dominance propagates to affect the expression of downstream loci and is sensitive to genetic background .
Edit intent: clarity
Original:  Advances in technology (not merely those related to astronomical detectors) are now enabling astronomers to build extremely powerful instruments to the extent that instruments have now achieved importance comparable or even exceeding the usual importance accorded to the apertures of the telescopes.
Revised:  Advances in technology are now enabling astronomers to build extremely powerful instruments to the extent that instruments have now achieved importance comparable or even exceeding the usual importance accorded to the apertures of the telescopes.
Edit intent: clarity
Original:  However, the cost of successive generations of instruments has risen at a rate far above that of the rate of inflation.
Revised:  However, the cost of successive generations of instruments has risen at a rate noticeably above that of the rate of inflation.
Edit intent: clarity
Original:   I investigate how well instrument builders are rewarded (via citations by users of their instruments) and find acknowledgements ranging from 60\% to 100 \%.
Revised:  I investigate how well instrument builders are rewarded . I find acknowledgements ranging from 60\% to 100 \%.
Edit intent: clarity
Original: Many natural processes rely on optimizing the success ratio of an underlying search process.
Revised: Many natural processes rely on optimizing the success ratio of a search process.
Edit intent: clarity
Original:  Furthermore, a priori access to information about the landscape turns search strategies into self-adaptive processes in which the trajectory on the board evolves to show a well-defined characteristic jumping length.
Revised:  Furthermore, a priori access to information about the landscape turns search strategies into self-adaptive processes in which the length of each displacement evolves to show a well-defined characteristic jumping length.
Edit intent: clarity
Original:  Let X_i be the position of the i-th sensor in interval  .
Revised:  Let X_i be the the i-th sensor in interval .
Edit intent: clarity
Original:  Then the following identity holds : i=1^nE\left[\left|X_i-\left(i{n}-1{2n}\right)\right|^a\right]=\Gamma\left(\frac{a{2}+1\right)}{2^{a{2}}(1+a)}1{n^{a{2}-1}}+O\left(1{n^{a-1{2}}}\right),  where \Gamma(z) is Euler Gamma function.
Revised:  Then the following identity holds i=1^nE\left[\left|X_i-\left(i{n}-1{2n}\right)\right|^a\right]=\Gamma\left(\frac{a{2}+1\right)}{2^{a{2}}(1+a)}1{n^{a{2}-1}}+O\left(1{n^{a-1{2}}}\right), where \Gamma(z) is Euler Gamma function.
Edit intent: fluency
Original:  In this work, we propose a method to approximate  a d-dimensional C^{m+1} smooth submanifold \mathcal{M R^n (d << n) based upon  scattered data points (i.e., a data cloud).
Revised:  In this work, we propose a method to approximate \mathcal{M a d-dimensional C^{m+1} smooth submanifold \mathcal{M R^n (d << n) based upon scattered data points (i.e., a data cloud).
Edit intent: fluency
Original:  In this work, we propose a method to approximate  a d-dimensional C^{m+1} smooth submanifold \mathcal{M R^n (d << n) based upon  scattered data points (i.e., a data cloud).
Revised:  In this work, we propose a method to approximate a d-dimensional C^{m+1} smooth submanifold of R^n (d << n) based upon scattered data points (i.e., a data cloud).
Edit intent: clarity
Original:  We assume that the data points are located "near" the noisy lower dimensional manifold and perform a non-linear moving least-squares projection on an approximating  manifold.
Revised:  We assume that the data points are located "near" the lower dimensional manifold and perform a non-linear moving least-squares projection on an approximating manifold.
Edit intent: clarity
Original:  We assume that the data points are located "near" the noisy lower dimensional manifold and perform a non-linear moving least-squares projection on an approximating  manifold.
Revised:  We assume that the data points are located "near" the noisy lower dimensional manifold and suggest a non-linear moving least-squares projection on an approximating manifold.
Edit intent: clarity
Original:  Furthermore, the method presented here assumes no analytic knowledge of the approximated manifold and the approximation algorithm is linear in the large dimension n  .
Revised:  The method presented here assumes no analytic knowledge of the approximated manifold and the approximation algorithm is linear in the large dimension n .
Edit intent: coherence
Original: In order to avoid the curse of dimensionality, frequently encountered in Big Data analysis, there was a vast development in the field of linear and non-linear dimension reduction techniques in recent years.
Revised: In order to avoid the curse of dimensionality, frequently encountered in Big Data analysis, there was a vast development in the field of linear and nonlinear dimension reduction techniques in recent years.
Edit intent: fluency
Original:  In this work, we propose a method to approximate \mathcal{M \MM a d-dimensional C^{m+1} smooth submanifold of \mathbb{R \RR ^n (d << n) based upon noisy scattered data points (i.e., a data cloud).
Revised:  In this work, we propose a method to approximate \MM a d-dimensional C^{m+1} smooth submanifold of \mathbb{R \RR ^n (d << n) based upon noisy scattered data points (i.e., a data cloud).
Edit intent: clarity
Original:  In this work, we propose a method to approximate \mathcal{M \MM a d-dimensional C^{m+1} smooth submanifold of \mathbb{R \RR ^n (d << n) based upon noisy scattered data points (i.e., a data cloud).
Revised:  In this work, we propose a method to approximate \mathcal{M \MM a d-dimensional C^{m+1} smooth submanifold of \RR ^n (d << n) based upon noisy scattered data points (i.e., a data cloud).
Edit intent: coherence