wanyu/IteraTeR_full_sent huggingface dataset:
Original:  However, the performances obtained with different approaches are difficult to compare because of variations in components such as input data, participant selection, image preprocessing, feature extraction, feature selection (FS) and cross-validation (CV) procedure.
Revised:  However, the performances obtained with different approaches is difficult to compare because of variations in components such as input data, participant selection, image preprocessing, feature extraction, feature selection (FS) and cross-validation (CV) procedure.
Edit intent: coherence
Original:  However, the performances obtained with different approaches are difficult to compare because of variations in components such as input data, participant selection, image preprocessing, feature extraction, feature selection (FS) and cross-validation (CV) procedure. Moreover, these studies are also difficult to reproduce because these different components are not readily available.
Revised:  However, the performances obtained with different approaches are difficult to compare and these studies are also difficult to reproduce because these different components are not readily available.
Edit intent: coherence
Original:  Moreover, these studies are also difficult to reproduce because these different components are not readily available. In a previous work (Samper-Gonzalez et al. 2018), we proposed an open-source framework for the reproducible evaluation of AD classification from T1-weighted (T1w) MRI and PET data. In the present paper, we extend this framework to diffusion MRI data .
Revised:  Moreover, these studies are also difficult to reproduce . In the present paper, we extend this framework to diffusion MRI data .
Edit intent: coherence
Original:  In the present paper, we extend this framework to diffusion MRI data . The framework comprises: tools to automatically convert ADNI data into the BIDS standard , pipelines for image preprocessing and feature extraction , baseline classifiers and a rigorous CV procedure.
Revised:  In the present paper, we extend this framework to diffusion MRI data for AD classification. Specifically, we add: conversion of diffusion MRI ADNI data into the BIDS standard , pipelines for image preprocessing and feature extraction , baseline classifiers and a rigorous CV procedure.
Edit intent: clarity
Original:  The framework comprises: tools to automatically convert ADNI data into the BIDS standard , pipelines for image preprocessing and feature extraction , baseline classifiers and a rigorous CV procedure. We demonstrate the use of the framework through assessing the influence of diffusion tensor imaging (DTI) metrics (fractional anisotropy - FA, mean diffusivity - MD), feature types, imaging modalities (diffusion MRI or T1w MRI) , data imbalance and FS bias. First , voxel-wise features generally gave better performances than regional features.
Revised:  The framework comprises: tools to automatically convert ADNI data into the BIDS standard , pipelines for image preprocessing and feature extraction . We then apply the framework to compare different components. First, FS has a positive impact on classification results: highest balanced accuracy (BA) improved from 0.76 to 0.82 for task CN vs AD. Secondly , voxel-wise features generally gave better performances than regional features.
Edit intent: meaning-changed
Original:  Thirdly, T1w MRI performed better than diffusion MRI. Fourthly, we demonstrated that using non-nested validation of FS leads to unreliable and over-optimistic results .
Revised:  Moreover, we observe that the poor performance obtained in tasks involving MCI were potentially caused by the small data samples, rather than by the data imbalance. Furthermore, no extensive classification difference exists for different degree of smoothing and registration methods. Besides, we demonstrate that using non-nested validation of FS leads to unreliable and over-optimistic results .
Edit intent: meaning-changed
Original:  Fourthly, we demonstrated that using non-nested validation of FS leads to unreliable and over-optimistic results .
Revised:  Fourthly, we demonstrated that using non-nested validation of FS leads to unreliable and over-optimistic results : 0.05 up to 0.40 relative increase in BA. Lastly, with proper FR and FS, the performance of diffusion MRI features is comparable to that of T1w MRI.
Edit intent: meaning-changed
Original:  Here we add to this literature with two experiments.
Revised:  However, it remains unclear in what situations moral preferences can be activated by simply changing the framing of a decision problem. For example, earlier work proposed that moral preferences can account for framing effects in the Dictator game. However, more recent work has casted doubts on the very existence of framing effects in this game. Here we shed light on this point with two experiments.
Edit intent: meaning-changed
Original:  In Study 1 (N=567) we implement an extreme dictator game in which dictators either get \0.50 and another person gets nothing, or the other way around (i.e., the other person gets \0.50 and the dictator gets nothing).
Revised:  In Study 1 (N=567) we implement an extreme Dictator game in which dictators either get \0.50 and another person gets nothing, or the other way around (i.e., the other person gets \0.50 and the dictator gets nothing).
Edit intent: fluency
Original:  In Study 1 (N=567) we implement an extreme dictator game in which dictators either get \0.50 and another person gets nothing, or the other way around (i.e., the other person gets \0.50 and the dictator gets nothing).
Revised:  In Study 1 (N=567) we implement an extreme dictator game in which dictators either get \0.50 and another person gets nothing, or the opposite (i.e., the other person gets \0.50 and the dictator gets nothing).
Edit intent: clarity
Original:  Our hypothesis is that people are reluctant to make actions described using words with a negative connotation, and are eager to make actions described using words with a positive connotation, independently of their economic consequences. As predicted, we find that the connotation of the word has a U-shaped effect on pro-sociality .
Revised:  As we predicted, we find that the connotation of the word has a U-shaped effect on pro-sociality .
Edit intent: coherence
Original:  As predicted, we find that the connotation of the word has a U-shaped effect on pro-sociality . Moreover, we show that the overall pattern of results, the U-shape, but not its details, can be explained using a technique from Computational Linguistics known as Sentiment Analysis .
Revised:  As predicted, we find that the connotation of the word has a U-shaped effect on pro-sociality is affected by the words used to describe the available actions .
Edit intent: meaning-changed
Original:  In sum, our findings provide additional evidence for the existence and relevance of moral preferences, confirm the usefulness of Krupka \& Weber's utility function, and suggest that building bridges from computational linguistics to behavioral science can contribute to our understanding of human decision making .
Revised:  In sum, we find that changing only one word in the instructions of an extreme Dictator game can alter people's behavior, and that behavioral changes can be explained using moral judgments and feelings associated to these words .
Edit intent: clarity
Original: Real datasets often come in the form of an URLanised cloud of points . An overall shape of such data is hard to visualise when data points are given by coordinates in a high-dimensional Euclidean space.
Revised: Real datasets often come in the form of an URLanised cloud of points with only pairwise distances. Numerous applications require to visualise an overall shape of such data is hard to visualise when data points are given by coordinates in a high-dimensional Euclidean space.
Edit intent: meaning-changed
Original:  This paper compares three algorithms that solve the data skeletonisation problem for a general cloud with topological and geometric guarantees. First, the Mapper algorithm outputs a network of interlinked clusters. Second, the \alpha-Reeb algorithm discretises the classical Reeb graphand can be applied to discrete clouds at different scales \alpha. The third algorithm HoPeS produces a Homologically Persistent Skeleton without any extra parameters.
Revised:  This paper compares three algorithms that solve the data skeletonisation problem for any point cloud and guarantee a successful reconstruction. For example, given a highly noisy point sample of an unknown underlying graph, a reconstructed skeleton should be geometrically close and homotopy equivalent to (has the same number of independent cycles as) the underlying graph. One of these algorithm produces a Homologically Persistent Skeleton without any extra parameters.
Edit intent: meaning-changed
Original:  HoPeS represents the 1-dimensional shape of a cloud at any scale by the Optimality Theorem. The Reconstruction Theorem gives conditions on a noisy sample of a graph when HoPeS provides a reconstructed graph with a correct homotopy type and within a small offset of the sample.
Revised:  HoPeS represents the 1-dimensional shape of a cloud at any scale . Other subgraphs of HoPeS reconstruct an unknown graph from its noisy point sample with a correct homotopy type and within a small offset of the sample.
Edit intent: meaning-changed
Original:  We also demonstrate how the injection of temporal information into our  network can reduce the false negative rates from 67.8\% (baseline) down to 28.7\% (proposed)  .
Revised:  We also demonstrate how the injection of temporal information into our network can reduce the false negative rates from 67.8\% (baseline) down to 28.7\% (proposed) . Our findings in this work are expected to help biologists characterize the spatial arrangement of MTs, specifically the effects of MT-MT interactions .
Edit intent: meaning-changed
Original: We provide  excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target model depends on an unknown model that must be to be estimated from data (a "nuisance model") .
Revised: We provide non-asymptotic excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target model depends on an unknown model that must be to be estimated from data (a "nuisance model") .
Edit intent: meaning-changed
Original: We provide  excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target model depends on an unknown model that must be to be estimated from data (a "nuisance model") .
Revised: We provide excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target parameter depends on an unknown model that must be to be estimated from data (a "nuisance model") .
Edit intent: clarity
Original: We provide  excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target model depends on an unknown model that must be to be estimated from data (a "nuisance model") .
Revised: We provide excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target model depends on an unknown nuisance parameter that must be to be estimated from data (a "nuisance model") .
Edit intent: clarity
Original: We provide  excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target model depends on an unknown model that must be to be estimated from data (a "nuisance model") .
Revised: We provide excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target model depends on an unknown model that must be estimated from data (a "nuisance model") .
Edit intent: clarity
Original:  We highlight the applicability of our results in four settings of central importance in the literature : 1) heterogeneous treatment effect estimation, 2) offline policy optimization, 3) domain adaptation, and 4) learning with missing data.
Revised:  We highlight the applicability of our results in four settings of central importance : 1) heterogeneous treatment effect estimation, 2) offline policy optimization, 3) domain adaptation, and 4) learning with missing data.
Edit intent: clarity
Original:  simple resource-competition models do not allow for coexistence of a large number of species . However , it was recently shown that assuming the existence of metabolic trade-offs - in allocating a limited enzyme production capacity - can lead to unlimited diversity, when nutrients are steadily supplied.
Revised:  simple resource-competition models do not allow for coexistence of a large number of species , it was recently shown that assuming the existence of metabolic trade-offs - in allocating a limited enzyme production capacity - can lead to unlimited diversity, when nutrients are steadily supplied.
Edit intent: coherence
Original:  However , it was recently shown that assuming the existence of metabolic trade-offs - in allocating a limited enzyme production capacity - can lead to unlimited diversity, when nutrients are steadily supplied. Do such trade-offs permit diversity under more realistic, intermittent conditions of nutrient supply?
Revised:  However , it was recently shown that assuming the existence of metabolic trade-offs can allow unlimited diversity. Does this diversity persist with more realistic, intermittent conditions of nutrient supply?
Edit intent: clarity
Original:  Unlike the constant environment case , diversity depends on the concentration of nutrients supplied to the community. These changes in diversity are driven by an "early-bird" effect in which species specialized for nutrients that are initially more abundant gain a population advantage over other species.
Revised:  Unlike the constant environment case , diversity depends on the amount of nutrient supplied due to an "early-bird" effect in which species specialized for nutrients that are initially more abundant gain a population advantage over other species.
Edit intent: clarity
Original:  These changes in diversity are driven by an "early-bird" effect in which species specialized for nutrients that are initially more abundant gain a population advantage over other species. We explore the interplay of this effect with different environmental factors and diversity-supporting mechanisms , such as immigration and cross-feeding, and find a variety of ensuing relationships between nutrient supply and diversity .
Revised:  These changes in diversity are driven by an "early-bird" effect . The interplay of this effect with different environmental factors and diversity-supporting mechanisms , such as immigration and cross-feeding, and find a variety of ensuing relationships between nutrient supply and diversity .
Edit intent: coherence
Original:  We explore the interplay of this effect with different environmental factors and diversity-supporting mechanisms , such as immigration and cross-feeding, and find a variety of ensuing relationships between nutrient supply and diversity . The large variation seen in this simple model suggests that real ecosystems may not obey a single universal relationship between nutrient supply and diversity.
Revised:  We explore the interplay of this effect with different environmental factors and diversity-supporting mechanisms , such as immigration and cross-feeding, and find a variety of ensuing relationships between nutrient supply and diversity , suggesting that real ecosystems may not obey a single universal relationship between nutrient supply and diversity.
Edit intent: coherence
Original:  The large variation seen in this simple model suggests that real ecosystems may not obey a single universal relationship between nutrient supply and diversity. To connect to real microbial communities, we validate our growth model against previously published Escherichia coli batch and chemostat experiments and outline potential future experiments to test the model's multispecies predictions .
Revised:  The large variation seen in this simple model suggests that real ecosystems may not obey a universal nutrient-diversity relationship .
Edit intent: clarity
Original: Circadian rhythm is usually represented by the 24-hour biological cycles which are mainly driven by the daily light-dark cycle on earth. Light stimulus is widely used as the control input of the circadian system entrainment. In this paper, we study the light-based minimum-time circadian entrainment problem of mammals, Neurospora, and Drosophila based on mathematical models of clock gene transcription .
Revised: The light-based minimum-time circadian entrainment problem of mammals, Neurospora, and Drosophila based on mathematical models of clock gene transcription .
Edit intent: coherence
Original:  In this paper, we study the light-based minimum-time circadian entrainment problem of mammals, Neurospora, and Drosophila based on mathematical models of clock gene transcription .
Revised:  In this paper, we study the light-based minimum-time circadian entrainment problem of mammals, Neurospora, and Drosophila is studied based on the mathematical models of clock gene transcription .
Edit intent: coherence
Original:  Two model simplification methods are applied to multi-variable models: (1) the phase response curves (PRC) and the circadian phase dynamics of these models are generated by impulse response simulation; (2) the Principal Orthogonal Decomposition (POD) is performed to reduce these models to ones with merely two variables.
Revised:  Two model simplification methods are applied to multi-variable models: (1) the phase response curves (PRC) and the Principal Orthogonal Decomposition (POD) is performed to reduce these models to ones with merely two variables.
Edit intent: clarity
Original:  (2) the Principal Orthogonal Decomposition (POD) is performed to reduce these models to ones with merely two variables. The minimum-time entrainment of the circadian phase is performed in a feedback form; the minimum-time entrainment of the second-order model is treated as a two-point boundary valued problem(TPBVP), which is solved by a direct shooting algorithm in terms of the Hamiltonian and Pontryagin Minimum Principle. Eventually, the results in low-order models are used for initializing a gradient descent algorithm , which is introduced in solving the entrainment problem of the full models .
Revised:  (2) the Principal Orthogonal Decomposition (POD) . The variational calculus and a gradient descent algorithm are applied for solving the optimal light input in the high-order models. As the results of the gradient descent algorithm , which is introduced in solving the entrainment problem of the full models .
Edit intent: coherence
Original: With the ubiquity of accelerators , such as FPGAs and GPUs, the complexity of high-performance programming is increasing beyond the skill-set of the average scientist in domains outside of computer science.
Revised: With the ubiquity of accelerators , such as FPGAs and GPUs, the complexity of high-performance computing has driven programming complexity beyond the skill-set of the average scientist in domains outside of computer science.
Edit intent: clarity
Original: With the ubiquity of accelerators , such as FPGAs and GPUs, the complexity of high-performance programming is increasing beyond the skill-set of the average scientist in domains outside of computer science. It is thus imperative to decouple programming paradigms and architecture-specific implementation from the underlying scientific computations.
Revised: With the ubiquity of accelerators , such as FPGAs and GPUs, the complexity of high-performance programming is increasing beyond the skill-set of the average domain scientist. To maintain performance portability in the future, it is imperative to decouple programming paradigms and architecture-specific implementation from the underlying scientific computations.
Edit intent: meaning-changed
Original:  By combining fine-grained data dependencies with high-level control flow , SDFGs are both expressive and amenable to high-level program transformations, such as tiling , vectorization, and double buffering .
Revised:  By combining fine-grained data dependencies with high-level control-flow , SDFGs are both expressive and amenable to high-level program transformations, such as tiling , vectorization, and double buffering .
Edit intent: clarity
Original:  By combining fine-grained data dependencies with high-level control flow , SDFGs are both expressive and amenable to high-level program transformations, such as tiling , vectorization, and double buffering .
Revised:  By combining fine-grained data dependencies with high-level control flow , SDFGs are both expressive and amenable to program transformations, such as tiling , vectorization, and double buffering .
Edit intent: fluency
Original:  By combining fine-grained data dependencies with high-level control flow , SDFGs are both expressive and amenable to high-level program transformations, such as tiling , vectorization, and double buffering .
Revised:  By combining fine-grained data dependencies with high-level control flow , SDFGs are both expressive and amenable to high-level program transformations, such as tiling and double-buffering .
Edit intent: clarity
Original:  These transformations are then applied to the SDFG in an interactive process, using extensible pattern matching and graph rewriting. To facilitate this process, we provide a graphical user interface that enables applying transformations, as well as creating custom optimizations, reusable across applications .
Revised:  These transformations are then applied to the SDFG in an interactive process, using extensible pattern matching , graph rewriting, and a graphical user interface that enables applying transformations, as well as creating custom optimizations, reusable across applications .
Edit intent: coherence
Original:  More generally, suppose that the terminals could be covered by \gamma faces . In a recent paper Krauthgamer, Lee and Rika SODA19%DIFDELCMD < ] %%% showed an upper bound of O(\log \gamma) on the distortion, improving previous results by Lee and Sidiropoulos [STOC09] and Chekuri et . al. [J.Comb.
Revised:  More generally, suppose that the terminals could be covered by \gamma faces SODA19%DIFDELCMD < ] %%% showed an upper bound of O(\log \gamma) on the distortion, improving previous results by Lee and Sidiropoulos [STOC09] and Chekuri et . al. [J.Comb.
Edit intent: coherence
Original:  In a recent paper Krauthgamer, Lee and Rika SODA19%DIFDELCMD < ] %%% showed an upper bound of O(\log \gamma) on the distortion, improving previous results by Lee and Sidiropoulos [STOC09] and Chekuri et . al. [J.Comb.
Revised:  In a recent paper Krauthgamer, Lee and Rika %DIFDELCMD < ] %%% showed an upper bound of O(\log \gamma) on the distortion, improving previous results by Lee and Sidiropoulos [STOC09] and Chekuri et . al. [J.Comb.
Edit intent: clarity
Original:  In a recent paper Krauthgamer, Lee and Rika SODA19%DIFDELCMD < ] %%% showed an upper bound of O(\log \gamma) on the distortion, improving previous results by Lee and Sidiropoulos [STOC09] and Chekuri et . al. [J.Comb.
Revised:  In a recent paper Krauthgamer, Lee and Rika SODA19%DIFDELCMD < ] %%% , was studied by Lee and Sidiropoulos [STOC09] and Chekuri et . al. [J.Comb.
Edit intent: clarity
Original:  In a recent paper Krauthgamer, Lee and Rika SODA19%DIFDELCMD < ] %%% showed an upper bound of O(\log \gamma) on the distortion, improving previous results by Lee and Sidiropoulos [STOC09] and Chekuri et . al. [J.Comb.
Revised:  In a recent paper Krauthgamer, Lee and Rika SODA19%DIFDELCMD < ] %%% showed an upper bound of O(\log \gamma) on the distortion, improving previous results by Lee and Sidiropoulos [STOC09] and Chekuri et al. [J.Comb.
Edit intent: fluency