wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Tiramisu relies on a flexible representation based on the polyhedral model and introduces a novel four-level IR that allows full separation between algorithms , schedules, data-layouts  and communication.
Revised:  Tiramisu relies on a flexible representation based on the polyhedral model and introduces a novel four-level IR that allows full separation between the algorithms, loop transformations , schedules, data-layouts and communication.
Edit intent: meaning-changed
Original:  We show that Tiramisu extends Halide with many new capabilities, and that Tiramisu can generate efficient code for multicores , GPUs, FPGAs and distributed heterogeneous systems. The performance of code generated by the Tiramisu backends matches or exceeds hand-optimized reference implementations. For example, the multicore backend matches the highly optimized Intel MKL library on many kernels and shows speedups reaching 4x over the original Halide .
Revised:  We show that Tiramisu extends Halide with many new capabilities, and that Tiramisu can generate efficient code for multicores , GPUs, and distributed machines .
Edit intent: clarity
Original:  The extensions include explicit communication, synchronization, and mapping buffers to different memory hierarchies. Tiramisu relies on a flexible representation based on the polyhedral model and explicitly uses a well-defined four-level IR that allows full separation between the algorithms, loop transformations, data-layouts , and communication.
Revised:  The framework is designed for the areas of image processing, stencils, linear algebra and deep learning. Tiramisu has two main features: it relies on a flexible representation based on the polyhedral model and explicitly uses a well-defined four-level IR that allows full separation between the algorithms, loop transformations, data-layouts , and communication.
Edit intent: meaning-changed
Original:  Tiramisu relies on a flexible representation based on the polyhedral model and explicitly uses a well-defined four-level IR that allows full separation between the algorithms, loop transformations, data-layouts , and communication.
Revised:  Tiramisu relies on a flexible representation based on the polyhedral model and it has a rich scheduling language allowing fine-grained control of optimizations. Tiramisu uses a four-level IR that allows full separation between the algorithms, loop transformations, data-layouts , and communication.
Edit intent: meaning-changed
Original:  Tiramisu relies on a flexible representation based on the polyhedral model and explicitly uses a well-defined four-level IR that allows full separation between the algorithms, loop transformations, data-layouts , and communication.
Revised:  Tiramisu relies on a flexible representation based on the polyhedral model and explicitly uses a well-defined four-level intermediate representation that allows full separation between the algorithms, loop transformations, data-layouts , and communication.
Edit intent: meaning-changed
Original:  Tiramisu relies on a flexible representation based on the polyhedral model and explicitly uses a well-defined four-level IR that allows full separation between the algorithms, loop transformations, data-layouts , and communication.
Revised:  Tiramisu relies on a flexible representation based on the polyhedral model and explicitly uses a well-defined four-level IR that allows full separation between the algorithms, loop transformations, data layouts , and communication.
Edit intent: fluency
Original:  Multiscale modeling benefits from both the expressive power of declarative modeling languages and the application of model reduction methods to link models across scale.
Revised:  The potential advantages are particularly relevant in the case of developmental modeling, wherein complex spatial structures exhibit dynamics at molecular, cellular, URLanogenic levels to relate genotype to multicellular phenotype. Multiscale modeling can benefit from both the expressive power of declarative modeling languages and the application of model reduction methods to link models across scale.
Edit intent: meaning-changed
Original:  Based on previous work, here we define declarative modeling of complex biological systems by defining the  semantics of an increasingly powerful series of declarative modeling languages including reaction-like dynamics of parameterized and extended objects , we define semantics-preserving implementation and semantics-approximating model reduction transformations , and we outline a "meta-hierarchy" URLanizing declarative models and the mathematical methods that can fruitfully manipulate them.
Revised:  Based on previous work, here we define declarative modeling of complex biological systems by defining the operator algebra semantics of an increasingly powerful series of declarative modeling languages including reaction-like dynamics of parameterized and extended objects , we define semantics-preserving implementation and semantics-approximating model reduction transformations , and we outline a "meta-hierarchy" URLanizing declarative models and the mathematical methods that can fruitfully manipulate them.
Edit intent: meaning-changed
Original:  Based on previous work, here we define declarative modeling of complex biological systems by defining the  semantics of an increasingly powerful series of declarative modeling languages including reaction-like dynamics of parameterized and extended objects , we define semantics-preserving implementation and semantics-approximating model reduction transformations , and we outline a "meta-hierarchy" URLanizing declarative models and the mathematical methods that can fruitfully manipulate them.
Revised:  Based on previous work, here we define declarative modeling of complex biological systems by defining the semantics of an increasingly powerful series of declarative modeling languages including reaction-like dynamics of parameterized and extended objects ; we define semantics-preserving implementation and semantics-approximating model reduction transformations , and we outline a "meta-hierarchy" URLanizing declarative models and the mathematical methods that can fruitfully manipulate them.
Edit intent: fluency
Original:  Based on previous work, here we define declarative modeling of complex biological systems by defining the  semantics of an increasingly powerful series of declarative modeling languages including reaction-like dynamics of parameterized and extended objects , we define semantics-preserving implementation and semantics-approximating model reduction transformations , and we outline a "meta-hierarchy" URLanizing declarative models and the mathematical methods that can fruitfully manipulate them.
Revised:  Based on previous work, here we define declarative modeling of complex biological systems by defining the semantics of an increasingly powerful series of declarative modeling languages including reaction-like dynamics of parameterized and extended objects , we define semantics-preserving implementation and semantics-approximating model reduction transformations ; and we outline a "meta-hierarchy" URLanizing declarative models and the mathematical methods that can fruitfully manipulate them.
Edit intent: fluency
Original:  In biostratigraphy and biochronology, using a much larger sample size, when more than one marker species is to be detected in the neighbourhood of the same biozone boundary, may help clarifying the nature of the apparent inconsistencies given by the observed reversals in the ordinal (rank) biostratigraphic data shown as intersections of the correlation lines .
Revised:  In biostratigraphy and biochronology, using a much larger sample size, when more than one marker species is to be detected in the neighborhood of the same biozone boundary, may help clarifying the nature of the apparent inconsistencies given by the observed reversals in the ordinal (rank) biostratigraphic data shown as intersections of the correlation lines .
Edit intent: fluency
Original:  In biostratigraphy and biochronology, using a much larger sample size, when more than one marker species is to be detected in the neighbourhood of the same biozone boundary, may help clarifying the nature of the apparent inconsistencies given by the observed reversals in the ordinal (rank) biostratigraphic data shown as intersections of the correlation lines .
Revised:  In biostratigraphy and biochronology, using a much larger sample size, when more than one marker species is to be detected in the neighbourhood of the same biozone boundary, may help clarifying the nature of the apparent inconsistencies given by the observed reversals in the ordinal (rank) biostratigraphic data shown as intersections of the correlation lines 
Edit intent: fluency
Original: We develop a new data-dependent distance for regression problems to compare two regressors (hyperplanes that fits or divides a data set). Most distances between objects attempt to capture the intrinsic geometry of these objects and measure how similar that geometry is. However, we argue that existing measures are inappropriate for regressors to a data set . We introduce a family of new distances that measure how similarly two regressors interact with the data they attempt to fit. For the variant we advocate we show it is a metric (under mild assumptions), induces metric balls with bounded VC-dimension, it is robust to changes in the corresponding data , and can be approximated quickly. We show a simple extension to trajectories that inherits these properties, as well as several other algorithmic applications. Moreover, in order to develop efficient approximation algorithms for this distance we formalize the relationship between sensitivity and leverage scores. This may be of independent interest .
Revised: We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute, and perform well in data analysis tasks. For trajectories, they match and in some cases significantly out-perform all state-of-the-art other metrics, can effortlessly be used in k-means clustering, and directly plugged into approximate nearest neighbor approaches which immediately out-perform the best recent advances in trajectory similarity search by several orders of magnitude. These distances do not require a geometry distorting dual (common in the line or halfspace case) or complicated alignment (common in trajectory case). We show reasonable and often simple conditions under which these distances are metrics .
Edit intent: meaning-changed
Original:  Inspired by the framework of integrated information theory, we propose a measure of the level of integration of a system as the response of a system to partitions that introduce perturbations in the interaction between subsystems, without assuming the existence of an stationary distribution.
Revised:  Inspired by the framework of integrated information theory, we propose a measure of the level of integration of a system as the response of a system to partitions that introduce perturbations in the interaction between subsystems, without assuming the existence of a stationary distribution.
Edit intent: fluency
Original:  Our findings suggest that, in order to preserve the integration of causal influences of a system as it grows in size, a living entity must be poised near critical points maximizing the sensitivity of the system to perturbations in the interaction between subsystems.
Revised:  Our findings suggest that, in order to preserve the integration of causal influences of a system as it grows in size, a living entity must be poised near critical points maximizing its sensitivity to perturbations in the interaction between subsystems.
Edit intent: clarity
Original:  Moreover, we observe how such a measure is able to delimit an agent and its environment, being able to characterize simple instances of agent-environment asymmetries in which the agent has the ability to modulate its interaction with the environment.
Revised:  Moreover, we observe how such a measure is able to delimit an agent and its environment, being able to characterize simple instances of agent-environment asymmetries in which the agent has the ability to modulate its coupling with the environment.
Edit intent: clarity
Original:  This simple framework predicts receptor responses to mixtures of up to twelve monomolecular odorants to within 10-30\% of experimental observations and provides a powerful method for leveraging limited experimental data. Simple extensions of our model describe phenomena such as synergy, overshadowing, and inhibition, suggesting that these perceptual effects can arise partly from receptor binding properties, and may not require either complex neural interactions or feedback from higher brain areas.
Revised:  This simple framework predicts receptor responses to mixtures of up to twelve monomolecular odorants to within 15
Edit intent: meaning-changed
Original:  By analyzing city-level cause-specific mortality data from the years 1922-1940, we found that eliminating typhoid fever infections decreased the risk of deaths due to non-waterborne diseases . Our estimates show that for one additional typhoid death, there were approximately one to three deaths due to other causes, such as tuberculosis and pneumonia.
Revised:  By analyzing city-level cause-specific mortality data from the years 1922-1940, we found that eliminating typhoid fever infections decreased the risk of deaths due to non-waterborne diseases such as tuberculosis and pneumonia.
Edit intent: coherence
Original:  By analyzing city-level cause-specific mortality data from 1922-1940, we find that eliminating typhoid fever infections decreased the risk of death due to non-waterborne diseases such as tuberculosis and pneumonia  .
Revised:  By analyzing city-level cause-specific mortality data from 1922-1940, we find that a decline in typhoid deaths by one per 1,000 people decreased the risk of death due to non-waterborne diseases such as tuberculosis and pneumonia .
Edit intent: meaning-changed
Original:  By analyzing city-level cause-specific mortality data from 1922-1940, we find that eliminating typhoid fever infections decreased the risk of death due to non-waterborne diseases such as tuberculosis and pneumonia  .
Revised:  By analyzing city-level cause-specific mortality data from 1922-1940, we find that eliminating typhoid fever infections decreased the risk of death due to non-waterborne diseases such as tuberculosis and pneumonia by 0.742-2.942 per 1,000 people .
Edit intent: meaning-changed
Original:  Both simulations develop specificities for optic flow which are comparable to those found in a neurophysiological study (Kubo et al. 2014), and relative frequencies of the various neuronal responses are best modelled by the sparse coding approach.
Revised:  Both simulations develop specificities for optic flow which are comparable to those found in a neurophysiological study (Kubo et al. 2014), and relative frequencies of the various neuronal responses are best modeled by the sparse coding approach.
Edit intent: fluency
Original:  Using a computer simulation, we show that information cannot be communicated reliably between neurons using a continuous representation , due to the presence of noise;
Revised:  We address this hypothesis using 2 approaches. First, we identify the fundamental communication requirements of the brain. Second, we estimate the symbol error probability and channel capacity for a continuous information representation. Our work concludes that information cannot be communicated reliably between neurons using a continuous representation , due to the presence of noise;
Edit intent: meaning-changed
Original:  In addition, we designed 3 (human) behavioral experiments on probability estimation and analyzed the data using a novel discrete (quantized) model of probability. Under a discrete model of probability, two distinct probabilities (say, 0.57 and 0.58) are treated indifferently. We found that data from all participants were better fit to discrete models than continuous ones. Furthermore, we re-analyzed the data from a published (human) behavioral study on intertemporal choice using a novel discrete (quantized) model of intertemporal choice. Under such a model, two distinct time delays (say, 16 days and 17 days) are treated indifferently. We found corroborating results, showing that data from all participants were better fit to discrete models than continuous ones. In summary, all results reported here support our discrete hypothesis of information representation in the brain, which signifies a major demarcation from the current understanding of the brain's physiology .
Revised:  This is a major demarcation from conventional and current wisdom. We apply this discrete result to the 4 major neural coding hypotheses, and illustrate the use of discrete ISI neural coding in analyzing electrophysiology experimental data. We further posit and illustrate a plausible direct link between Weber's Law and discrete neural coding. We end by outlining a number of key research questions on discrete neural coding .
Edit intent: meaning-changed
Original: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Revised: We study the k nearest neighbors problem in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Edit intent: clarity
Original: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Revised: We study k nearest neighbor queries in the plane for general , convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Edit intent: fluency
Original: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Revised: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Edit intent: fluency
Original: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Revised: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Edit intent: fluency
Original: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Revised: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segments , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Edit intent: fluency
Original: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Revised: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, and quadrilaterals and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Edit intent: coherence
Original: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and constant-size convex distance functions.
Revised: We study k nearest neighbor queries in the plane for general ( convex, pairwise disjoint ) sites of constant description complexity ( such as line segment , disks, quadrilaterals and so on) and with respect to a general family of distance functions including the L_p-norms and additively weighted Euclidean distances. For point sites in the Euclidean metric, after four decades of effort, an optimal data structure has recently been developed with O( n ) space, O( log n + k ) query time, and O( n log n ) preprocessing time.
Edit intent: meaning-changed
Original:  We develop a data structure with O( n log log n ) space,  O( log n + k ) query time, and expected O( n polylog n ) preprocessing time , removing a ( log^2 n log log n ) -factor from the O( n ( log^2 n )( log log n )^2 ) space of Bohler et al 's recent SoCG'16 work.
Revised:  We develop a static data structure for the general setting with nearly optimal O( n log log n ) space, O( log n + k ) query time, and expected O( n polylog n ) preprocessing time , removing a ( log^2 n log log n ) -factor from the O( n ( log^2 n )( log log n )^2 ) space of Bohler et al 's recent SoCG'16 work.
Edit intent: meaning-changed
Original:  We develop a data structure with O( n log log n ) space,  O( log n + k ) query time, and expected O( n polylog n ) preprocessing time , removing a ( log^2 n log log n ) -factor from the O( n ( log^2 n )( log log n )^2 ) space of Bohler et al 's recent SoCG'16 work.
Revised:  We develop a data structure with O( n log log n ) space, the optimal O( log n + k ) query time, and expected O( n polylog n ) preprocessing time , removing a ( log^2 n log log n ) -factor from the O( n ( log^2 n )( log log n )^2 ) space of Bohler et al 's recent SoCG'16 work.
Edit intent: meaning-changed
Original:  We develop a data structure with O( n log log n ) space,  O( log n + k ) query time, and expected O( n polylog n ) preprocessing time , removing a ( log^2 n log log n ) -factor from the O( n ( log^2 n )( log log n )^2 ) space of Bohler et al 's recent SoCG'16 work.
Revised:  We develop a data structure with O( n log log n ) space, O( log n + k ) query time, and expected O( n polylog n ) preprocessing time . The O( n log log n ) -factor from the O( n ( log^2 n )( log log n )^2 ) space of Bohler et al 's recent SoCG'16 work.
Edit intent: coherence