wanyu/IteraTeR_v2 huggingface dataset:
Original:  We also tested a variety of methods to regulate expression: (4) explicit genome labels that allow programs to dynamically refer to specific positions in the genome , (5) position relative search instructions, and (6) multiple new flow control instructions, including conditionals and jump instructions . Each of these features also adds additional complication to the instruction set and runs the risk of slowing down evolution due to epistatic interactions.
Revised:  We also tested a variety of methods to regulate expression: (4) explicit genome labels that allow programs to dynamically refer to specific positions in the genome , (5) position-relative search instructions, and (6) multiple new flow control instructions, including conditionals and jump instructions . Each of these features also adds additional complication to the instruction set and runs the risk of slowing down evolution due to epistatic interactions.
Edit intent: fluency
Original:  We also tested a variety of methods to regulate expression: (4) explicit genome labels that allow programs to dynamically refer to specific positions in the genome , (5) position relative search instructions, and (6) multiple new flow control instructions, including conditionals and jump instructions . Each of these features also adds additional complication to the instruction set and runs the risk of slowing down evolution due to epistatic interactions.
Revised:  We also tested a variety of methods to regulate expression: (4) explicit genome labels that allow programs to dynamically refer to specific positions in the genome , (5) position relative search instructions, and (6) multiple new flow control instructions, including conditionals and jumps . Each of these features also adds additional complication to the instruction set and runs the risk of slowing down evolution due to epistatic interactions.
Edit intent: fluency
Original:  We also tested a variety of methods to regulate expression: (4) explicit genome labels that allow programs to dynamically refer to specific positions in the genome , (5) position relative search instructions, and (6) multiple new flow control instructions, including conditionals and jump instructions . Each of these features also adds additional complication to the instruction set and runs the risk of slowing down evolution due to epistatic interactions.
Revised:  We also tested a variety of methods to regulate expression: (4) explicit genome labels that allow programs to dynamically refer to specific positions in the genome , (5) position relative search instructions, and (6) multiple new flow control instructions, including conditionals and jump instructions . Each of these features also adds complication to the instruction set and runs the risk of slowing down evolution due to epistatic interactions.
Edit intent: clarity
Original:  We also tested a variety of methods to regulate expression: (4) explicit genome labels that allow programs to dynamically refer to specific positions in the genome , (5) position relative search instructions, and (6) multiple new flow control instructions, including conditionals and jump instructions . Each of these features also adds additional complication to the instruction set and runs the risk of slowing down evolution due to epistatic interactions.
Revised:  We also tested a variety of methods to regulate expression: (4) explicit genome labels that allow programs to dynamically refer to specific positions in the genome , (5) position relative search instructions, and (6) multiple new flow control instructions, including conditionals and jump instructions . Each of these features also adds additional complication to the instruction set and risks slowing evolution due to epistatic interactions.
Edit intent: clarity
Original:  However, we found that two features (multiple argument specification and separated I/O) demonstrated substantial improvements in the majority of test environments , along with versions of each of the remaining architecture modifications that show significant improvements in multiple environments . Combined, these enhancements enable more rapid evolution of complex solutions to a broad range of environmental challenges.
Revised:  However, we found that two features (multiple argument specification and separated I/O) demonstrated substantial improvements int the majority of test environments , along with versions of each of the remaining architecture modifications that show significant improvements in multiple environments . Combined, these enhancements enable more rapid evolution of complex solutions to a broad range of environmental challenges.
Edit intent: fluency
Original:  However, we found that two features (multiple argument specification and separated I/O) demonstrated substantial improvements in the majority of test environments , along with versions of each of the remaining architecture modifications that show significant improvements in multiple environments . Combined, these enhancements enable more rapid evolution of complex solutions to a broad range of environmental challenges.
Revised:  However, we found that two features (multiple argument specification and separated I/O) demonstrated substantial improvements in the majority of test environments , along with versions of each of the remaining architecture modifications that show significant improvements in multiple environments . Combined, these enhancements enable more rapid evolution of complex solutions to a broad range of challenges.
Edit intent: clarity
Original: We present the first public release of our generic neural network training algorithm, called SKYNET .
Revised: We present the first public release of our generic neural network training algorithm, called SkyNet .
Edit intent: fluency
Original:  This efficient and robust machine-learning tool is able to train large and deep feed-forward neural networks, including autoencoders, for use in a wide range of supervised and unsupervised learning applications, such as regression, classification, density estimation, clustering and dimensionality reduction.
Revised:  This efficient and robust machine learning tool is able to train large and deep feed-forward neural networks, including autoencoders, for use in a wide range of supervised and unsupervised learning applications, such as regression, classification, density estimation, clustering and dimensionality reduction.
Edit intent: fluency
Original:  SKYNET uses a powerful ' pre-training' method , to obtain a set of network parameters close to the true global maximum of the training objective function , followed by further optimisation using an automatically-regularised variant of Newton's method  ;
Revised:  SkyNet uses a ` pre-training' method , to obtain a set of network parameters close to the true global maximum of the training objective function , followed by further optimisation using an automatically-regularised variant of Newton's method ;
Edit intent: clarity
Original:  SKYNET uses a powerful ' pre-training' method , to obtain a set of network parameters close to the true global maximum of the training objective function , followed by further optimisation using an automatically-regularised variant of Newton's method  ;
Revised:  SKYNET uses a powerful ' pre-training' method to obtain a set of network parameters close to the true global maximum of the training objective function , followed by further optimisation using an automatically-regularised variant of Newton's method ;
Edit intent: fluency
Original:  SKYNET uses a powerful ' pre-training' method , to obtain a set of network parameters close to the true global maximum of the training objective function , followed by further optimisation using an automatically-regularised variant of Newton's method  ;
Revised:  SKYNET uses a powerful ' pre-training' method , to obtain a set of network parameters close to the true global maximum of the training objective function , followed by further optimisation using a regularised variant of Newton's method ;
Edit intent: clarity
Original:  SKYNET employs convergence criteria that naturally prevent overfitting, and also includes a fast algorithm for estimating the accuracy of network outputs.
Revised:  SkyNet employs convergence criteria that naturally prevent overfitting, and also includes a fast algorithm for estimating the accuracy of network outputs.
Edit intent: fluency
Original:  The utility and flexibility of SKYNET are demonstrated by application to a number of toy problems, and to astronomical problems focusing on the recovery of structure from blurred and noisy images, the identification of gamma-ray bursters, and the compression and denoising of galaxy images.
Revised:  The utility and flexibility of SkyNet are demonstrated by application to a number of toy problems, and to astronomical problems focusing on the recovery of structure from blurred and noisy images, the identification of gamma-ray bursters, and the compression and denoising of galaxy images.
Edit intent: fluency
Original:  The SKYNET software, which is implemented in standard ANSI C and fully parallelised using MPI, is available at URL
Revised:  The SkyNet software, which is implemented in standard ANSI C and fully parallelised using MPI, is available at URL
Edit intent: fluency
Original: Close analysis of the published interpretation of the number of rock-shelter sites in Australia provides further evidence that there was no intensification in the growth of human population between 1000 years BP and 10,000 years BP.
Revised: Close analysis of the published interpretation of the number of rock-shelter sites in Australia provides further evidence that there was no intensification in the growth of human population between 1000 and 10,000 years BP.
Edit intent: fluency
Original: Wireless transmission using non-contiguous chunks of spectrum is becoming increasingly necessary due to : incumbent users in TV white space , anticipated spectrum sharing between commercial and military systems , and uncoordinated interference in unlicensed bands.
Revised: Wireless transmission using non-contiguous chunks of spectrum is becoming increasingly necessary due to : incumbent users in TV white space ; anticipated spectrum sharing between commercial and military systems , and uncoordinated interference in unlicensed bands.
Edit intent: fluency
Original: Wireless transmission using non-contiguous chunks of spectrum is becoming increasingly necessary due to : incumbent users in TV white space , anticipated spectrum sharing between commercial and military systems , and uncoordinated interference in unlicensed bands.
Revised: Wireless transmission using non-contiguous chunks of spectrum is becoming increasingly necessary due to : incumbent users in TV white space , anticipated spectrum sharing between commercial and military systems ; and spectrum sharing among uncoordinated interferers in unlicensed bands.
Edit intent: clarity
Original:  Multi-Channel Multi-Radio ( MC-MR ) platforms and Non-Contiguous Orthogonal Frequency Division Multiple Access (NC-OFDMA) technology are the two commercially viable transmission choices to access these non-contiguous spectrum chunks.
Revised:  Multi-Channel Multi-Radio ( MCMR ) platforms and Non-Contiguous Orthogonal Frequency Division Multiple Access (NC-OFDMA) technology are the two commercially viable transmission choices to access these non-contiguous spectrum chunks.
Edit intent: clarity
Original:  Fixed MC-MR does not scale with increasing number of non-contiguous spectrum chunks due to its fixed set of supporting radio front ends.
Revised:  Fixed MC-MRs do not scale with increasing number of non-contiguous spectrum chunks due to its fixed set of supporting radio front ends.
Edit intent: clarity
Original:  Fixed MC-MR does not scale with increasing number of non-contiguous spectrum chunks due to its fixed set of supporting radio front ends.
Revised:  Fixed MC-MR does not scale with increasing number of non-contiguous spectrum chunks due to their fixed set of supporting radio front ends.
Edit intent: fluency
Original:  However, nulling subcarriers increases the sampling rate (spectrum span) which, in turn, increases the power consumption of radio front ends.
Revised:  However, nulling sub-carriers increases the sampling rate (spectrum span) which, in turn, increases the power consumption of radio front ends.
Edit intent: fluency
Original:  Our work characterizes this trade-off from a cross-layer perspective  . Specifically, we perform joint power control, spectrum span selection, scheduling and routing to minimize system power of multi-hop NC-OFDMA networks.
Revised:  Our work characterizes this trade-off from a cross-layer perspective . Specifically, we perform joint power control, spectrum span selection, scheduling and routing in order to minimize the system power of multi-hop NC-OFDMA networks.
Edit intent: clarity
Original:  Motivated by theoretical interest of the problem and also by its significant practical importance, we show in this paper a new algorithm to enumerating all chordless cycles in undirected graphs.
Revised:  Motivated by theoretical interest of the problem and also by its significant practical importance, we show in this paper a new algorithm to enumerate all chordless cycles in undirected graphs.
Edit intent: fluency
Original: In a finite undirected simple graph, a chordless cycle {\it  is an induced subgraph which is a cycle.
Revised: In a finite undirected simple graph, a {\it is an induced subgraph which is a cycle.
Edit intent: clarity
Original:  In this paper we present two new algorithms to enumerate all chordless cycles of such a graph.
Revised:  We propose two algorithms to enumerate all chordless cycles of such a graph.
Edit intent: clarity
Original:  Compared to other  algorithms with the same purpose, these two new algorithms have the advantage of finding each chordless cycle only once.
Revised:  Compared to other algorithms have the advantage of finding each chordless cycle only once.
Edit intent: clarity
Original:  To guarantee that the expansion of a given chordless path will always lead to a chordless cycle, we use a breadth-first search (BFS) in a subgraph obtained by the elimination of many  vertices from the original graph.
Revised:  To guarantee that the expansion of a given chordless path will always lead to a chordless cycle, we use a breadth-first search in a subgraph obtained by the elimination of many vertices from the original graph.
Edit intent: clarity
Original:  To guarantee that the expansion of a given chordless path will always lead to a chordless cycle, we use a breadth-first search (BFS) in a subgraph obtained by the elimination of many  vertices from the original graph.
Revised:  To guarantee that the expansion of a given chordless path will always lead to a chordless cycle, we use a breadth-first search (BFS) in a subgraph obtained by the elimination of many of the vertices from the original graph.
Edit intent: fluency
Original:  We focus on the class of randomized cooperative policies, whereby the secondary user  serves either the queue of its own data or the queue of the primary user  relayed data with certain service probabilities.
Revised:  We focus on the class of randomized cooperative policies, whereby the secondary user serves either the queue of its own data or the queue of the primary user (PU) relayed data with certain service probabilities.
Edit intent: clarity
Original:  The proposed randomized policy opens room for trading the primary user delay for enhanced secondary user delay.
Revised:  The proposed policy opens room for trading the primary user delay for enhanced secondary user delay.
Edit intent: clarity
Original:  The proposed randomized policy opens room for trading the primary user delay for enhanced secondary user delay.
Revised:  The proposed randomized policy opens room for trading the PU delay for enhanced secondary user delay.
Edit intent: clarity
Original:  The proposed randomized policy opens room for trading the primary user delay for enhanced secondary user delay.
Revised:  The proposed randomized policy opens room for trading the primary user delay for enhanced SU delay.
Edit intent: clarity
Original:  Moreover, we quantify the gain obtained in terms of the secondary user delay under the proposed randomized policy, over conventional relaying that gives strict priority to the relay queue.
Revised:  Moreover, we quantify the gain obtained in terms of the SU delay under the proposed randomized policy, over conventional relaying that gives strict priority to the relay queue.
Edit intent: clarity
Original:  Moreover, we quantify the gain obtained in terms of the secondary user delay under the proposed randomized policy, over conventional relaying that gives strict priority to the relay queue.
Revised:  Moreover, we quantify the gain obtained in terms of the secondary user delay under the proposed policy, over conventional relaying that gives strict priority to the relay queue.
Edit intent: clarity
Original: We consider three important and well-studied algorithmic problems in group theory: word-, geodesic- , and conjugacy problem.
Revised: We consider three important and well-studied algorithmic problems in group theory: the word, geodesic , and conjugacy problem.
Edit intent: fluency
Original:  For the group theoretical part we apply Bass-Serre theory.
Revised:  For the group-theoretical part we apply Bass-Serre theory.
Edit intent: fluency
Original:  But as we need explicit formulae and as we design concrete algorithms all our group theoretical calculations are completely explicit and accessible to non-specialists.
Revised:  But as we need explicit formulae and as we design concrete algorithms all our group-theoretical calculations are completely explicit and accessible to non-specialists.
Edit intent: fluency
Original: This is a review of aspects of the theory of algorithmic information (AIT) that may constitute an appropriate framework for formulating questions related to economics .
Revised: This is a review of aspects of the theory of algorithmic information that may contribute to a framework for formulating questions related to economics .
Edit intent: clarity
Original:  We start by  surveying classical results from algorithmic complexity and algorithmic probability, highlighting their deep connection and possible relevance to frequency distributions common in the study of price movement and volatility.
Revised:  We start by surveying classical results from algorithmic complexity and algorithmic probability, highlighting their deep connection to the study of price movement and volatility.
Edit intent: clarity
Original: We consider two computational problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (determine whether all terms of a given LRS are positive) and the effective Ultimate Positivity Problem (determine whether all but finitely many terms of a given LRS are positive, and if so, compute an index threshold beyond which all terms are positive) .
Revised: Given a linear recurrence sequence (LRS) over the integers, namely the Positivity Problem (determine whether all terms of a given LRS are positive) and the effective Ultimate Positivity Problem (determine whether all but finitely many terms of a given LRS are positive, and if so, compute an index threshold beyond which all terms are positive) .
Edit intent: clarity
Original: We consider two computational problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (determine whether all terms of a given LRS are positive) and the effective Ultimate Positivity Problem (determine whether all but finitely many terms of a given LRS are positive, and if so, compute an index threshold beyond which all terms are positive) .
Revised: We consider two computational problems for linear recurrence sequences (LRS) over the integers, the Positivity Problem (determine whether all terms of a given LRS are positive) and the effective Ultimate Positivity Problem (determine whether all but finitely many terms of a given LRS are positive, and if so, compute an index threshold beyond which all terms are positive) .
Edit intent: clarity
Original: We consider two computational problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (determine whether all terms of a given LRS are positive) and the effective Ultimate Positivity Problem (determine whether all but finitely many terms of a given LRS are positive, and if so, compute an index threshold beyond which all terms are positive) .
Revised: We consider two computational problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem asks whether all terms of a given LRS are positive) and the effective Ultimate Positivity Problem (determine whether all but finitely many terms of a given LRS are positive, and if so, compute an index threshold beyond which all terms are positive) .
Edit intent: clarity
Original:  These simpler formulations allow CAD to  address the question of the existence of a path.
Revised:  Simpler formulations allow CAD to address the question of the existence of a path.
Edit intent: coherence
Original:  These simpler formulations allow CAD to  address the question of the existence of a path.
Revised:  These simpler formulations allow CAD to easily address the question of the existence of a path.
Edit intent: clarity
Original: Pricing formulae for defaultable corporate bonds with discrete coupons ( under consideration of the government taxes ) in the united model of structural and reduced form models are provided.
Revised: Pricing formulae for defaultable corporate bonds with discrete coupons under consideration of the government taxes ) in the united model of structural and reduced form models are provided.
Edit intent: fluency
Original: Pricing formulae for defaultable corporate bonds with discrete coupons ( under consideration of the government taxes ) in the united model of structural and reduced form models are provided.
Revised: Pricing formulae for defaultable corporate bonds with discrete coupons ( under consideration of the government taxes in the united model of structural and reduced form models are provided.
Edit intent: fluency
Original:  The aim of this paper is to generalize the  structural model for defaultable corporate discrete coupon bonds (considered in [1]) into the unified model of structural and reduced form models.
Revised:  The aim of this paper is to generalize the structural model for defaultable corporate discrete coupon bonds (considered in [1]) into a comprehensive unified model of structural and reduced form models.
Edit intent: clarity
Original:  We consider the model and pricing formula for equity value and using it calculate expected default barrier , Then We provide pricing model and formula for defaultable corporate bonds with discrete coupons and consider its duration .
Revised:  We consider the model and pricing formula for equity value and using it calculate expected default barrier . Then we provide pricing model and formula for defaultable corporate bonds with discrete coupons and consider its duration .
Edit intent: fluency
Original: Diffusion processes have been applied with great success to model the dynamics of large populations throughout science, in particular in biology.
Revised: Diffusion processes have been applied with great success to model the dynamics of large populations throughout science, in particular biology.
Edit intent: fluency
Original:  One of the advantages of the technique is that it bridges two different scales: the microscopic and the macroscopic one.
Revised:  One advantage is that they bridge two different scales: the microscopic and the macroscopic one.
Edit intent: clarity
Original:  Diffusion is a mathematical idealisation, however: it assumes that state changes at the microscopic level are small .
Revised:  Diffusion is a mathematical idealisation, however: it assumes that state changes at the microscopic level .
Edit intent: clarity
Original:  In real biological system this is often not the case.
Revised:  In real biological systems this is often not the case.
Edit intent: fluency