wanyu/IteraTeR_v2 huggingface dataset:
Original:  When we used distortionsof the training set we obtained error rates below 0.6\% . To achieve this performance , we introduce several methods for enhancing ELM implementation , which individually and in combination can significantly improve performance , to the point where it is nearly indistinguishable from deep network performance .
Revised:  When we used distortionsof the training set we obtained error rates below 0.6\% . To achieve these results , we introduce several methods for enhancing ELM implementation , which individually and in combination can significantly improve performance , to the point where it is nearly indistinguishable from deep network performance .
Edit intent: clarity
Original:  When we used distortionsof the training set we obtained error rates below 0.6\% . To achieve this performance , we introduce several methods for enhancing ELM implementation , which individually and in combination can significantly improve performance , to the point where it is nearly indistinguishable from deep network performance .
Revised:  When we used distortionsof the training set we obtained error rates below 0.6\% . To achieve this performance , we introduce several enhancements to the standard ELM algorithm , which individually and in combination can significantly improve performance , to the point where it is nearly indistinguishable from deep network performance .
Edit intent: clarity
Original:  When we used distortionsof the training set we obtained error rates below 0.6\% . To achieve this performance , we introduce several methods for enhancing ELM implementation , which individually and in combination can significantly improve performance , to the point where it is nearly indistinguishable from deep network performance .
Revised:  When we used distortionsof the training set we obtained error rates below 0.6\% . To achieve this performance , we introduce several methods for enhancing ELM implementation , which individually and in combination can significantly improve performance .
Edit intent: coherence
Original:  This form of random ' receptive field' sampling of the input ensures the input weight matrix is sparse, with about 90 percent of weights equal to zero , which is a potential advantage for hardware implementations .
Revised:  This form of random ` receptive field' sampling of the input ensures the input weight matrix is sparse, with about 90 percent of weights equal to zero , which is a potential advantage for hardware implementations .
Edit intent: fluency
Original:  This form of random ' receptive field' sampling of the input ensures the input weight matrix is sparse, with about 90 percent of weights equal to zero , which is a potential advantage for hardware implementations .
Revised:  This form of random ' receptive field' sampling of the input ensures the input weight matrix is sparse, with about 90 \% of weights equal to zero , which is a potential advantage for hardware implementations .
Edit intent: fluency
Original:  This form of random ' receptive field' sampling of the input ensures the input weight matrix is sparse, with about 90 percent of weights equal to zero , which is a potential advantage for hardware implementations .
Revised:  This form of random ' receptive field' sampling of the input ensures the input weight matrix is sparse, with about 90 percent of weights equal to zero .
Edit intent: clarity
Original:  Our close to state-of-the-art results for MNIST  suggest that the ease of use and accuracy of ELM should cause it to be given greater consideration as an alternative to deep networks applied to more challenging datasets .
Revised:  Our close to state-of-the-art results for MNIST suggest that the ease of use and accuracy of ELM should cause it to be given greater consideration as an alternative to deep networks applied to more difficult problems .
Edit intent: clarity
Original:  The strong chromatic index %DIFDELCMD < \chiup%%% _{s '(G) of a graph G is the minimum number of colors in a strong edge coloring of G. Let \Delta \geq 4 be an integer.
Revised:  The strong chromatic index %DIFDELCMD < \chiup%%% \chi_s '(G) of a graph G is the minimum number of colors in a strong edge coloring of G. Let \Delta \geq 4 be an integer.
Edit intent: fluency
Original:  In this note, we study the properties of the odd graphs, and show that every planar graph with maximum degree at most \Delta and girth at least 10 \Delta - 4 has a strong edge coloring using 2\Delta - 1 colors.
Revised:  In this note, we study the properties of the odd graphs, and show that every planar graph with maximum degree at most \Delta and girth at least 10 \Delta - 4 has a strong edge coloring with 2\Delta - 1 colors.
Edit intent: fluency
Original:  The strong chromatic index \chi_s \chiup '(G) of a graph G is the minimum number of colors in a strong edge coloring of G. Let \Delta \geq 4 be an integer.
Revised:  The strong chromatic index \chiup '(G) of a graph G is the minimum number of colors in a strong edge coloring of G. Let \Delta \geq 4 be an integer.
Edit intent: clarity
Original:  In this note, we study the properties of the odd graphs , and show ] that every planar graph with maximum degree at most \Delta and girth at least 10 \Delta - 4 has a strong edge coloring with 2\Delta - 1 colors.
Revised:  In this note, we study the properties of the odd graphs , and show ], we show that every planar graph with maximum degree at most \Delta and girth at least 10 \Delta - 4 has a strong edge coloring with 2\Delta - 1 colors.
Edit intent: coherence
Original:  In addition, we prove that if G is a graph with girth at least 2\Delta - 1 and %DIFDELCMD < \mad%%%  (G) < 2 + 1{3\Delta - 2}, where \Delta  \geq 4, then %DIFDELCMD < \chiup%%% _{s '(G) \leq 2\Delta - 1 ;
Revised:  In addition, we prove that if G is a graph with girth at least 2\Delta - 1 and %DIFDELCMD < \mad%%% mad (G) < 2 + 1{3\Delta - 2}, where \Delta \geq 4, then %DIFDELCMD < \chiup%%% _{s '(G) \leq 2\Delta - 1 ;
Edit intent: fluency
Original:  In addition, we prove that if G is a graph with girth at least 2\Delta - 1 and %DIFDELCMD < \mad%%%  (G) < 2 + 1{3\Delta - 2}, where \Delta  \geq 4, then %DIFDELCMD < \chiup%%% _{s '(G) \leq 2\Delta - 1 ;
Revised:  In addition, we prove that if G is a graph with girth at least 2\Delta - 1 and %DIFDELCMD < \mad%%% (G) < 2 + 1{3\Delta - 2}, where \Delta \geq 4, then %DIFDELCMD < \chiup%%% \chi_s '(G) \leq 2\Delta - 1 ;
Edit intent: fluency
Original:  In addition, we prove that if G is a graph with girth at least 2\Delta - 1 and %DIFDELCMD < \mad%%%  (G) < 2 + 1{3\Delta - 2}, where \Delta  \geq 4, then %DIFDELCMD < \chiup%%% _{s '(G) \leq 2\Delta - 1 ;
Revised:  In addition, we prove that if G is a graph with girth at least 2\Delta - 1 and %DIFDELCMD < \mad%%% (G) < 2 + 1{3\Delta - 2}, where \Delta \geq 4, then %DIFDELCMD < \chiup%%% _{s '(G) \leq 2\Delta - 1 ,
Edit intent: fluency
Original:  if G is a subcubic graph with girth at least 8 and %DIFDELCMD < \mad%%%  (G) < 2 + 2{23}, then %DIFDELCMD < \chiup%%% _{s '(G) \leq 5.
Revised:  if G is a subcubic graph with girth at least 8 and %DIFDELCMD < \mad%%% (G) < 2 + 2{23}, then %DIFDELCMD < \chiup%%% \chi_s '(G) \leq 5.
Edit intent: fluency
Original:  Then we use it to improve the best known upper bound on the reset threshold for finite prefix codes . Next we present polynomial time algorithms to find reset words with lengths of the proven bounds for finite prefix codes and other classes of automata .
Revised:  Then we use it to improve the best general upper bound for reset thresholds of finite prefix codes . Next we present polynomial time algorithms to find reset words with lengths of the proven bounds for finite prefix codes and other classes of automata .
Edit intent: clarity
Original:  In addition to that, we show that the reset threshold of a decoder can be in%DIFDELCMD < \varTheta%%% (n ) for any non-unary alphabet .
Revised:  In addition to that, we show that the reset threshold of a %DIFDELCMD < \varTheta%%% (n ) for any non-unary alphabet .
Edit intent: clarity
Original:  In another corollary, using the recent results of Nicaud, we show that the probability that the Cern\'y conjecture does not hold for a random  automaton is exponentially small in terms of the number of states and.
Revised:  In another corollary, based on the recent results of Nicaud, we show that the probability that the Cern\'y conjecture does not hold for a random automaton is exponentially small in terms of the number of states and.
Edit intent: coherence
Original:  It follows that the expected value of the reset threshold of an n-state random  automaton is at most n^{ 7 / 4 + 6\varepsilon%DIFDELCMD < \MBLOCKRIGHTBRACE%%%  (1 +o(1)) . Moreover, reset words of the lengths within our bounds are computable in polynomial time.
Revised:  It follows that the expected value of the reset threshold of an n-state random automaton is at most n^{ 7 / 4 + 6\varepsilon%DIFDELCMD < \MBLOCKRIGHTBRACE%%% o (1 +o(1)) . Moreover, reset words of the lengths within our bounds are computable in polynomial time.
Edit intent: fluency
Original:  It follows that the expected value of the reset threshold of an n-state random  automaton is at most n^{ 7 / 4 + 6\varepsilon%DIFDELCMD < \MBLOCKRIGHTBRACE%%%  (1 +o(1)) . Moreover, reset words of the lengths within our bounds are computable in polynomial time.
Revised:  It follows that the expected value of the reset threshold of an n-state random automaton is at most n^{ 7 / 4 + 6\varepsilon%DIFDELCMD < \MBLOCKRIGHTBRACE%%% (1 ) . Moreover, reset words of the lengths within our bounds are computable in polynomial time.
Edit intent: clarity
Original:  It follows that the expected value of the reset threshold of an n-state random  automaton is at most n^{ 7 / 4 + 6\varepsilon%DIFDELCMD < \MBLOCKRIGHTBRACE%%%  (1 +o(1)) . Moreover, reset words of the lengths within our bounds are computable in polynomial time.
Revised:  It follows that the expected value of the reset threshold of an n-state random automaton is at most n^{ 7 / 4 + 6\varepsilon%DIFDELCMD < \MBLOCKRIGHTBRACE%%% (1 +o(1)) . Moreover, reset words of lengths within all of our bounds are computable in polynomial time.
Edit intent: clarity
Original:  It is thus crucial to have good estimates for the statistics of IET tails.
Edit intent: coherence
Original:  We demonstrate that the resulting bias can lead to systematic underestimates of the variance in the IET distributions and that correcting for the bias can lead to qualitatively different results for the tails of the IET distributions --- and this is especially true for IETs with heavy-tails, which are often of interest .
Revised:  We demonstrate that the resulting bias can lead to systematic underestimates of the variance in the IET distributions and that correcting for the bias can lead to qualitatively different results for the tails of the IET distributions .
Edit intent: coherence
Original:  Our model learns to embed image representations (generated from a previously trained Convolutional Neural Network) into a multimodal space that is common to the images and the phrases that are used to described them.
Revised:  Our model learns to embed image representations (generated from a previously trained Convolutional Neural Network) and phrases that are used to described them.
Edit intent: clarity
Original:  Based on the sentence descriptions , we propose a simple language model that is able to produce relevant descriptions for a given test image using the feature representation and the phrases inferred.
Revised:  Based on the sentence descriptions , we propose a simple language model that can produce relevant descriptions for a given test image using the feature representation and the phrases inferred.
Edit intent: clarity
Original:  Based on the sentence descriptions , we propose a simple language model that is able to produce relevant descriptions for a given test image using the feature representation and the phrases inferred.
Revised:  Based on the sentence descriptions , we propose a simple language model that is able to produce relevant descriptions for a given test image using the phrases inferred.
Edit intent: clarity
Original:  We show that the adaptive diffusion provides a strong protection of the anonymity of the source even under this more practical scenario.
Revised:  We show that the adaptive diffusion provides a strong protection of the anonymity of the source even under this scenario.
Edit intent: clarity
Original: An algorithm for the efficient computation of the CUR decomposition is presented.
Revised: The manuscript describes efficient algorithms for the computation of the CUR decomposition is presented.
Edit intent: clarity
Original:  This problem is exacerbated for a graph with a large order and size - the number of vertices and edges - as many community detection algorithms scale poorly.
Revised:  This problem is exacerbated for a graph with a large order and size -- the number of vertices and edges - as many community detection algorithms scale poorly.
Edit intent: fluency
Original:  This problem is exacerbated for a graph with a large order and size - the number of vertices and edges - as many community detection algorithms scale poorly.
Revised:  This problem is exacerbated for a graph with a large order and size - the number of vertices and edges -- as many community detection algorithms scale poorly.
Edit intent: fluency
Original: This paper discusses proving correctness and completeness of definite clause logic programs.
Revised: We discuss proving correctness and completeness of definite clause logic programs.
Edit intent: clarity
Original:  We compare the proof methods with declarative diagnosis (algorithmic debugging) .
Revised:  We compare the proof methods to declarative diagnosis (algorithmic debugging) .
Edit intent: fluency
Original:  We show that approximate specifications remove a substantial drawback of declarative diagnosis .
Revised:  We show that approximate specifications eliminate a major drawback of the latter .
Edit intent: clarity
Original:  We argue that the proof methods correspond to natural declarative thinking about programs, and that they can be used, formally or informally, in every-day programming.
Revised:  We argue that our proof methods reflect natural declarative thinking about programs, and that they can be used, formally or informally, in every-day programming.
Edit intent: clarity
Original:  A nonlinear reaction-diffusion equation has been formulated as a model for this dynamics.
Revised:  A nonlinear reaction-diffusion equation has been formulated to elucidate this dynamics.
Edit intent: clarity
Original:  A nonlinear continuum model , comprising cell migration, proliferation and exclusion process, has been formulated to elucidate this dynamics.
Revised:  A nonlinear continuum model , comprising cell migration, proliferation and exclusion process, has been employed to elucidate this dynamics.
Edit intent: clarity
Original:  The analytical and numerical results reveal that the front speed is enhanced by the exclusion process, which increases with cell packing fraction.
Revised:  The analytical and numerical solutions reveal that the front speed is enhanced by the exclusion process, which increases with cell packing fraction.
Edit intent: clarity
Original:  The analytical and numerical results reveal that the front speed is enhanced by the exclusion process, which increases with cell packing fraction.
Revised:  The analytical and numerical results reveal that the front speed is enhanced by the exclusion process, which depends on the cell packing fraction.
Edit intent: clarity
Original:  The consistency with the experimental evidences of the theoretical results is discussed.
Revised:  The qualitative comparison between the theoretical results and the experimental evidences is discussed.
Edit intent: clarity
Original: The effect of mechanical interaction between cells on the spreading of bacterial population was investigated in one-dimensional space.
Revised: The effect of mechanical interactions between cells in the spreading of bacterial population was investigated in one-dimensional space.
Edit intent: clarity
Original: The effect of mechanical interaction between cells on the spreading of bacterial population was investigated in one-dimensional space.
Revised: The effect of mechanical interaction between cells on the spreading of bacterial populations was investigated in one-dimensional space.
Edit intent: fluency
Original:  A continuum mechanical approach, comprising cell migration, proliferation and exclusion process, has been employed to elucidate this dynamics.
Revised:  A continuum-mechanics approach, comprising cell migration, proliferation and exclusion process, has been employed to elucidate this dynamics.
Edit intent: fluency
Original:  A continuum mechanical approach, comprising cell migration, proliferation and exclusion process, has been employed to elucidate this dynamics.
Revised:  A continuum mechanical approach, comprising cell migration, proliferation , and exclusion processes, was employed to elucidate this dynamics.
Edit intent: fluency
Original:  A continuum mechanical approach, comprising cell migration, proliferation and exclusion process, has been employed to elucidate this dynamics.
Revised:  A continuum mechanical approach, comprising cell migration, proliferation and exclusion process, has been employed to elucidate the dynamics.
Edit intent: clarity
Original:  The consequent nonlinear reaction-diffusion-like equation arises as the constitution of the bacterial populationdynamics .
Revised:  The consequent nonlinear reaction-diffusion-like equation describes the constitution dynamics of a bacterial population .
Edit intent: clarity
Original:  In this model, the bacterial cells are treated as the rod-like particles that interact , when contacting each other , through the hard-core repulsion .
Revised:  In this model, bacterial cells were treated as rod-like particles that interact , when contacting each other , through the hard-core repulsion .
Edit intent: clarity
Original:  In this model, the bacterial cells are treated as the rod-like particles that interact , when contacting each other , through the hard-core repulsion .
Revised:  In this model, the bacterial cells are treated as the rod-like particles that interact with each other through hard-core repulsion .
Edit intent: clarity
Original:  The repulsion introduces the exclusion effect that causes the bacterial populations to migrate fast at high density.
Revised:  The repulsion introduces the exclusion effect that causes bacterial populations to migrate fast at high density.
Edit intent: fluency
Original:  The repulsion introduces the exclusion effect that causes the bacterial populations to migrate fast at high density.
Revised:  The repulsion introduces the exclusion effect that causes the bacterial populations to migrate quickly and at high density.
Edit intent: clarity
Original:  The propagation of the bacterial density as the traveling wave front in long time behavior has been analyzed .
Revised:  The propagation of bacterial density as the traveling wave front in long time behavior has been analyzed .
Edit intent: fluency
Original:  The propagation of the bacterial density as the traveling wave front in long time behavior has been analyzed .
Revised:  The propagation of the bacterial density as a traveling wave front in long time behavior has been analyzed .
Edit intent: fluency
Original:  The propagation of the bacterial density as the traveling wave front in long time behavior has been analyzed .
Revised:  The propagation of the bacterial density as the traveling wave front over extended times was also analysed .
Edit intent: clarity
Original:  The analytical and numerical solutions reveal that the front speed is enhanced by the exclusion process, which depends on the cell packing fraction.
Revised:  The analytical and numerical solutions revealed that the front speed is enhanced by the exclusion process, which depends on the cell packing fraction.
Edit intent: fluency
Original:  The analytical and numerical solutions reveal that the front speed is enhanced by the exclusion process, which depends on the cell packing fraction.
Revised:  The analytical and numerical solutions reveal that the front speed was enhanced by the exclusion process, which depends on the cell packing fraction.
Edit intent: fluency
Original:  In this paper, we propose an alternative approach to justify the convergence of forward towards spot prices as time-to-maturity goes to zero .
Revised:  In this paper, we propose an alternative approach to justify the convergence of futures towards spot prices as time-to-maturity goes to zero .
Edit intent: clarity
Original:  In this paper, we propose an alternative approach to justify the convergence of forward towards spot prices as time-to-maturity goes to zero .
Revised:  In this paper, we propose an alternative approach to justify the convergence of forward towards spot prices as the time to maturity of the contracts goes to zero .
Edit intent: clarity
Original:  We show that the classical no-arbitrage relationship between spot and forward prices holds through the well-posedness of an expected profit maximization problem for an agent producing and storing a commodity while trading in forward contracts.
Revised:  We show that the classical no-arbitrage arguments. In this paper we propose an alternative approach, that relies on the expected profit maximization problem for an agent producing and storing a commodity while trading in forward contracts.
Edit intent: clarity
Original:  We show that the classical no-arbitrage relationship between spot and forward prices holds through the well-posedness of an expected profit maximization problem for an agent producing and storing a commodity while trading in forward contracts.
Revised:  We show that the classical no-arbitrage relationship between spot and forward prices holds through the well-posedness of an expected profit maximization problem of an agent producing and storing a commodity while trading in forward contracts.
Edit intent: fluency
Original:  A consequence of this is that the forward price of energy can be seen as  risk-neutral expectation of the spot price at maturity .
Revised:  A consequence of this is that the forward price of energy can be seen as the risk-neutral expectation of the spot price at maturity .
Edit intent: fluency
Original:  Moreover, we obtain an explicit formula for the forward volatility and provide a heuristic analysis of the optimal solution for the production / storage / investment problem in a Markovian setting  .
Revised:  Moreover, we obtain an explicit formula for the forward volatility . Moreover, we provide an heuristic analysis of the optimal solution for the production / storage / investment problem in a Markovian setting .
Edit intent: coherence
Original:  Moreover, we obtain an explicit formula for the forward volatility and provide a heuristic analysis of the optimal solution for the production / storage / investment problem in a Markovian setting  .
Revised:  Moreover, we obtain an explicit formula for the forward volatility and provide a heuristic analysis of the optimal solution for the production / storage / trading problem, in a Markovian setting .
Edit intent: clarity
Original: In commodity markets , the convergence of futures towards spot prices as the time to maturity of the contracts goes to zero is usually justified by no-arbitrage arguments.
Revised: In commodity markets the convergence of futures towards spot prices as the time to maturity of the contracts goes to zero is usually justified by no-arbitrage arguments.
Edit intent: fluency
Original: In commodity markets , the convergence of futures towards spot prices as the time to maturity of the contracts goes to zero is usually justified by no-arbitrage arguments.
Revised: In commodity markets , the convergence of futures towards spot prices , at the expiration of the contract, is usually justified by no-arbitrage arguments.
Edit intent: clarity