wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our method of proof is based on an integral representation of the option price involving the tail probability of the log-return process under the share measure and a suitable change of probability measure under which the   process becomes stable .
Revised:  Our method of proof is based on an integral representation of the option price involving the tail probability of the log-return process under the share measure and a suitable change of probability measure under which the process .
Edit intent: clarity
Original:  This extends the  known result that the leading term is \sigma t^{1/2}/2\pi, where \sigma is the volatility of the continuous component.
Revised:  This extends the already known result that the leading term is \sigma t^{1/2}/2\pi, where \sigma is the volatility of the continuous component.
Edit intent: coherence
Original:   Our numerical results show that first-order term typically exhibits rather poor performance and that the second-order term significantly improves the approximation's accuracy.
Revised:  Our numerical results show that first-order term typically exhibits rather poor performance and that the second-order term significantly improves the approximation's accuracy.
Edit intent: fluency
Original:  The information on the relative frequency of negative and positive jumps appears only in the second-order term , which is shown to be of the form d_{2} t and whose order of decay turns out to be independent of Y.
Revised:  The second-order term , which is shown to be of the form d_{2} t and whose order of decay turns out to be independent of Y.
Edit intent: clarity
Original:  Our  numerical results show that first-order term typically exhibits rather poor performance and that the second-order term significantly improves the approximation's accuracy.
Revised:  Our numerical results show that first-order term typically exhibits rather poor performance and that the second-order term significantly improves the approximation's accuracy.
Edit intent: fluency
Original:  The second-order term is shown to be of the form d _{2} t and, therefore, its order of decay turns out to be independent of Y.
Revised:  The second-order term is shown to be of the form _{2} t and, therefore, its order of decay turns out to be independent of Y.
Edit intent: clarity
Original:  Our numerical results show that  first-order term typically exhibits rather poor performance and that the second-order term significantly improves the approximation's accuracy  .
Revised:  Our numerical results show that the first-order term typically exhibits rather poor performance and that the second-order term significantly improves the approximation's accuracy .
Edit intent: fluency
Original:  Our numerical results show that  first-order term typically exhibits rather poor performance and that the second-order term significantly improves the approximation's accuracy  .
Revised:  Our numerical results show that first-order term typically exhibits rather poor performance and that the second-order term can significantly improve the approximation's accuracy .
Edit intent: clarity
Original: Epidemics occur in all shapes and forms: infections propagating in our sparse sexual networks, information spreading through our much denser social interactions, or viruses circulating on the Internet.
Revised: Epidemics occur in all shapes and forms: infections propagating in our sparse sexual networks, rumours and diseases spreading through our much denser social interactions, or viruses circulating on the Internet.
Edit intent: clarity
Original:  Our agent-centric notion of proof is  negation-complete disjunctive explicit refinement of standard KD45-belief, and also yields a disjunctive but negation-incomplete explicit refinement of standard S5-knowledge.
Revised:  Our agent-centric notion of proof is a negation-complete disjunctive explicit refinement of standard KD45-belief, and also yields a disjunctive but negation-incomplete explicit refinement of standard S5-knowledge.
Edit intent: fluency
Original: We produce a decidable classical normal modal logic of internalised negation-complete or disjunctive non-monotonic interactive proofs (LDiiP) from an existing logical counterpart of non-monotonic or instant interactive proofs (LiiP).
Revised: We produce a decidable classical normal modal logic of internalised negation-complete and thus disjunctive non-monotonic interactive proofs (LDiiP) from an existing logical counterpart of non-monotonic or instant interactive proofs (LiiP).
Edit intent: clarity
Original:  Our agent-centric  notion of proof is a negation-complete disjunctive explicit refinement of standard KD45-belief, and also yields a disjunctive but negation-incomplete explicit refinement of standard S5-knowledge .
Revised:  Our agent-centric notion of proof can also be viewed as a negation-complete disjunctive explicit refinement of standard KD45-belief, and also yields a disjunctive but negation-incomplete explicit refinement of standard S5-knowledge .
Edit intent: clarity
Original:  Our agent-centric  notion of proof is a negation-complete disjunctive explicit refinement of standard KD45-belief, and also yields a disjunctive but negation-incomplete explicit refinement of standard S5-knowledge .
Revised:  Our agent-centric notion of proof is a negation-complete disjunctive explicit refinement of standard KD45-belief, and yields a disjunctive but negation-incomplete explicit refinement of standard S5-knowledge .
Edit intent: clarity
Original:  To achieve this we define a heuristic algorithm, which we test %DIFDELCMD < {\it %%% in silico using simulations of a Wright-Fisher model for a realistic range of mutation rates and selection strength.
Revised:  To achieve this we define a heuristic algorithm, which we test %DIFDELCMD < {\it %%% in silico using simulations of a Wright-Fisher model for a realistic range of mutation rates and selection strength.
Edit intent: fluency
Original:  Inferred fitness ranking correlates strongly with the actual fitness, with  top 10\% ranked being in the top 20\% fittest with false discovery rate of 0.1-0.3 depending on the mutation/selection parameters.
Revised:  Inferred fitness ranking correlates strongly with actual fitness, with top 10\% ranked being in the top 20\% fittest with false discovery rate of 0.1-0.3 depending on the mutation/selection parameters.
Edit intent: fluency
Original:  The ranking also enables to predict the common genotype of the future population .
Revised:  The ranking also enables to predict the genotypes that future populations inherit from the present one .
Edit intent: clarity
Original:  While the inference accuracy increases monotonically with sample size, sample sizes of 200 nearly saturate the performance.
Revised:  While the inference accuracy increases monotonically with sample size, samples of 200 nearly saturate the performance.
Edit intent: fluency
Original:  of a BMU, less is known about how bone refilling is regulated in a BMU . Here, we extend our previous mathematical model of cell development within a single BMU to investigate the dynamics of refilling in the BMU and help elucidate the contributions to the refilling rate of osteoblast number and osteoblast secretory activity at various positions along the BMU's length.
Revised:  of a BMU, less is known about how bone refilling is regulated in a BMU . Here, we extend our previous mathematical model of cell development within a single BMU to investigate how osteoblast number and osteoblast secretory activity at various positions along the BMU's length.
Edit intent: clarity
Original:  of a BMU, less is known about how bone refilling is regulated in a BMU . Here, we extend our previous mathematical model of cell development within a single BMU to investigate the dynamics of refilling in the BMU and help elucidate the contributions to the refilling rate of osteoblast number and osteoblast secretory activity at various positions along the BMU's length.
Revised:  of a BMU, less is known about how bone refilling is regulated in a BMU . Here, we extend our previous mathematical model of cell development within a single BMU to investigate the dynamics of refilling in the BMU and help elucidate the contributions to the refilling rate of osteoblast number and osteoblast secretory activity vary along the BMU's length.
Edit intent: clarity
Original:  Our model shows that tetracycline double labelling does not reveal the start and the end of the refillingprocess in a BMU . This suggests that at a particular bone site undergoing remodelling, bone formation starts and ends rapidly.
Revised:  Our model shows that tetracycline double labelling does not reveal the start and end of refilling . This suggests that at a particular bone site undergoing remodelling, bone formation starts and ends rapidly.
Edit intent: clarity
Original:  Our model also suggests that part of the observed cross-sectional variability in tetracycline data may be due to different bone sites being remodelled by BMUs at different stages of their lifetime.
Revised:  Our model also suggests that part of the observed cross-sectional variability in tetracycline data may be due to different bone sites being refilled by BMUs at different stages of their lifetime.
Edit intent: clarity
Original:  In cortical bone, a linear phenomenological relationship between matrix apposition rate (MAR) and BMU cavity radius is found  .
Revised:  In cortical bone, a linear phenomenological relationship between matrix apposition rate (MAR) and BMU cavity radius is found experimentally .
Edit intent: clarity
Original: We examine  characteristic features of reversible and quantum computations in the presence of supplementary external information, known as advice.
Revised: We examine the characteristic features of reversible and quantum computations in the presence of supplementary external information, known as advice.
Edit intent: fluency
Original:  An immediate application of those properties leads to containments and separations among various language families that are further assisted by appropriate advice.
Revised:  An immediate application of those properties leads to containments and separations among various language families when they are assisted by appropriately chosen advice.
Edit intent: clarity
Original:  We further demonstrate the power  of randomized advice and quantum advice when  given to one-way quantum finite automata.
Revised:  We further demonstrate the power of randomized advice and quantum advice when they are given to one-way quantum finite automata.
Edit intent: clarity
Original:  An immediate application of those properties leads to containments and separations among various language families when they are assisted by appropriately chosen advice.
Revised:  Immediate applications of those properties leads to containments and separations among various language families when they are assisted by appropriately chosen advice.
Edit intent: fluency
Original:  An immediate application of those properties leads to containments and separations among various language families when they are assisted by appropriately chosen advice.
Revised:  An immediate application of those properties lead to containments and separations among various language families when they are assisted by appropriately chosen advice.
Edit intent: fluency
Original: We present algorithms for checking and enforcing robustness of parallel programs against the Total Store Ordering (TSO) relaxed memory model.
Revised: We present algorithms for checking and enforcing robustness of concurrent programs against the Total Store Ordering (TSO) relaxed memory model.
Edit intent: clarity
Original: We present algorithms for checking and enforcing robustness of parallel programs against the Total Store Ordering (TSO) relaxed memory model.
Revised: We present algorithms for checking and enforcing robustness of parallel programs against the Total Store Ordering (TSO) memory model.
Edit intent: clarity
Original:  A program is robust if its TSO behavior coincides with the Sequential Consistency (SC) semantics.
Revised:  A program is robust if all its TSO computations correspond to computations under the Sequential Consistency (SC) semantics.
Edit intent: clarity
Original:  We show that the detection of attacks can be parallelized, and can be solved by considering only SC computations.
Revised:  Then, we show that detecting attacks can be parallelized, and can be solved by considering only SC computations.
Edit intent: clarity
Original:  Moreover , the construction is valid for an arbitrary number of addresses and an arbitrary number of parallel components , and it is independent from the data domain , and from the size of store buffers in the TSO semantics.
Revised:  Moreover , the construction is valid for an arbitrary number of addresses and an arbitrary number of parallel threads , and it is independent from the data domain , and from the size of store buffers in the TSO semantics.
Edit intent: clarity
Original:  Moreover , the construction is valid for an arbitrary number of addresses and an arbitrary number of parallel components , and it is independent from the data domain , and from the size of store buffers in the TSO semantics.
Revised:  Moreover , the construction is valid for an arbitrary number of addresses and an arbitrary number of parallel components , and it is independent from the data domain and from the size of store buffers in the TSO semantics.
Edit intent: fluency
Original:  In particular, when the data domain is finite and the number of addresses is fixed, we obtain new decidability result for robustness, even for an arbitrary number of components .
Revised:  In particular, when the data domain is finite and the number of addresses is fixed, we obtain new decidability result for robustness, even for an arbitrary number of threads .
Edit intent: clarity
Original:  This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy automata and to the decidability of freeness for semigroups generated by two-letter invertible-reversible Mealy automata.
Revised:  This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy automata and to the decidability of freeness for semigroups generated by two-state invertible-reversible Mealy automata.
Edit intent: fluency
Original: Summary: The Smith-Waterman (SW) algorithm, which produces the optimal pairwise alignment between two sequences, is frequently used as a key component of fast heuristic read mapping tools and variation detecting tools.
Revised: Summary: The Smith Waterman (SW) algorithm, which produces the optimal pairwise alignment between two sequences, is frequently used as a key component of fast heuristic read mapping tools and variation detecting tools.
Edit intent: fluency
Original:  To allow the fast Single-Instruction-Multiple-Data (SIMD) SW been widely used in third-party software, we wrote a C/C++ library, which extends Farrar Striped SW (SSW) to return the full information of the optimal alignment , and necessary information of a next-optimal alignment while keeping the same speed as the original algorithm that only returns the optimal score.
Revised:  To allow the fast Single-Instruction-Multiple-Data (SIMD) SW algorithm into third party software, we wrote a C/C++ library, which extends Farrar Striped SW (SSW) to return the full information of the optimal alignment , and necessary information of a next-optimal alignment while keeping the same speed as the original algorithm that only returns the optimal score.
Edit intent: clarity
Original:  To allow the fast Single-Instruction-Multiple-Data (SIMD) SW been widely used in third-party software, we wrote a C/C++ library, which extends Farrar Striped SW (SSW) to return the full information of the optimal alignment , and necessary information of a next-optimal alignment while keeping the same speed as the original algorithm that only returns the optimal score.
Revised:  To allow the fast Single-Instruction-Multiple-Data (SIMD) SW been widely used in third-party software, we wrote a C/C++ library, which extends Farrars Striped SW (SSW) to return the full information of the optimal alignment , and necessary information of a next-optimal alignment while keeping the same speed as the original algorithm that only returns the optimal score.
Edit intent: fluency
Original:  To allow the fast Single-Instruction-Multiple-Data (SIMD) SW been widely used in third-party software, we wrote a C/C++ library, which extends Farrar Striped SW (SSW) to return the full information of the optimal alignment , and necessary information of a next-optimal alignment while keeping the same speed as the original algorithm that only returns the optimal score.
Revised:  To allow the fast Single-Instruction-Multiple-Data (SIMD) SW been widely used in third-party software, we wrote a C/C++ library, which extends Farrar Striped SW (SSW) to return alignment information in addition to the optimal SW score.
Edit intent: clarity
Original:  We analyze here the years 1994 to 2011. %DIFDELCMD < {\em %%% Service , as it was termed, is produced by the Classification Society.
Revised:  We analyze here the years 1994 to 2011. %DIFDELCMD < {\em %%% The Classification Society's Service , as it was termed, is produced by the Classification Society.
Edit intent: clarity
Original:  We analyze here the years 1994 to 2011. %DIFDELCMD < {\em %%% Service , as it was termed, is produced by the Classification Society.
Revised:  We analyze here the years 1994 to 2011. %DIFDELCMD < {\em %%% Service , as it was termed, has been produced by the Classification Society.
Edit intent: clarity
Original:  In earlier decades it was distributed with the%DIFDELCMD < {\em %%%  Journal of Classification  .
Revised:  In earlier decades it was distributed %DIFDELCMD < {\em %%% Journal of Classification .
Edit intent: clarity
Original: We introduce the notion of an Eulerian graph being strongly even cycle decomposable, and note that a few basic classes have this property.
Revised: We introduce the notion of an Eulerian graph being strongly even-cycle decomposable, and note that a few basic classes have this property.
Edit intent: fluency
Original:  We then prove that several fundamental composition operations that preserve the property of being Eulerian also preserve the property of being strongly even cycle decomposable.
Revised:  Our main results are that several fundamental composition operations that preserve the property of being Eulerian also preserve the property of being strongly even cycle decomposable.
Edit intent: clarity
Original:  Our composition operations imply that all simple Eulerian k-partite graphs are strongly even cycle decomposable, with the exception of K_5.
Revised:  Our composition operations imply that all simple Eulerian k-partite graphs are strongly even-cycle decomposable, with the exception of K_5.
Edit intent: fluency
Original: We introduce the notion of an Eulerian graph being strongly even-cycle decomposable , and note that a few basic classes have this property.
Revised: A graph is strongly even-cycle decomposable , and note that a few basic classes have this property.
Edit intent: clarity
Original:  Our main results are that several fundamental composition operations that preserve the property of being Eulerian also preserve the property of being strongly even-cycle decomposable  .
Revised:  Our main results are that several fundamental composition operations that preserve the property of being Eulerian also yield strongly even-cycle decomposable .
Edit intent: clarity
Original:  Our main results are that several fundamental composition operations that preserve the property of being Eulerian also preserve the property of being strongly even-cycle decomposable  .
Revised:  Our main results are that several fundamental composition operations that preserve the property of being Eulerian also preserve the property of being strongly even-cycle decomposable graphs .
Edit intent: clarity
Original:  As an application, our composition operations easily imply that all Eulerian complete k-partite graphs are strongly even-cycle decomposable, with the exception of K_5 .
Revised:  As an easy application of our theorems, we give an exact characterization of the set of strongly even-cycle decomposable, with the exception of K_5 .
Edit intent: clarity
Original:  As an application, our composition operations easily imply that all Eulerian complete k-partite graphs are strongly even-cycle decomposable, with the exception of K_5 .
Revised:  As an application, our composition operations easily imply that all Eulerian complete k-partite graphs are strongly even-cycle decomposable cographs .
Edit intent: clarity
Original: Background: In recent years automated data analysis techniques have drawn great attention and are used in almost every ?eld of research including biomedical.
Revised: Background: In recent years automated data analysis techniques have drawn great attention and are used in almost every field of research including biomedical.
Edit intent: fluency
Original:  Arti?cial Neural Networks (ANNs) are one of the Computer- Aided- Diagnosis tools which are used extensively by advances in computer hardware technology.
Revised:  Artificial Neural Networks (ANNs) are one of the Computer- Aided- Diagnosis tools which are used extensively by advances in computer hardware technology.
Edit intent: fluency
Original:  As every real signal recorded by the equipment can have di?erent artifacts, we need to do some preprocessing steps before feeding it to the ANN.
Revised:  As every real signal recorded by the equipment can have different artifacts, we need to do some preprocessing steps before feeding it to the ANN.
Edit intent: fluency
Original:  Wavelet transform is used for extracting the morphological parameters and median ?lter for data reduction of the ECG signal.
Revised:  Wavelet transform is used for extracting the morphological parameters and median filter for data reduction of the ECG signal.
Edit intent: fluency
Original:  We had two approaches in our investigation, the ?rst one uses the whole signal with 289 normalized and de-noised data points as input to the ANN.
Revised:  We had two approaches in our investigation, the first one uses the whole signal with 289 normalized and de-noised data points as input to the ANN.
Edit intent: fluency
Original:  Results: The outcome of the two approaches for 8 types of arrhythmia shows that the second approach is superior than the ?rst one with an average accuracy of \%99.42.
Revised:  Results: The outcome of the two approaches for 8 types of arrhythmia shows that the second approach is superior than the first one with an average accuracy of \%99.42.
Edit intent: fluency
Original:  Transposable elements (TEs) in eukaryote genomes are quantitatively the main components affecting genome size, structure and expression.
Revised: Background: Transposable elements (TEs) in eukaryote genomes are quantitatively the main components affecting genome size, structure and expression.
Edit intent: coherence
Original:  We estimated the rates of evolution of TE sequences in Arabidopsis thaliana, and found that they depend on the distance to the nearest genes: TEs located close to genes evolve faster than those that are more distant.
Revised:  Results: We estimated ages of TE sequences in Arabidopsis thaliana, and found that they depend on the distance to the nearest genes: TEs located close to genes evolve faster than those that are more distant.
Edit intent: clarity
Original:  We present a model of TE sequence dynamics in TE-rich genomes, such as maize and wheat, and in TE-poor genomes such as fly and A. thaliana.
Revised:  We present a model of TE sequence dynamics in TE-rich genomes, such as maize and wheat, compared to TE-poor genomes such as fly and A. thaliana.
Edit intent: coherence