wanyu/IteraTeR_v2 huggingface dataset:
Original:  The Explainable AI research program aims to develop analytic techniques for rendering such systems transparent, but lacks a general understanding of what it actually takes to do so .
Revised:  The Explainable AI research program aims to develop analytic techniques with which to render opaque computing systems transparent, but lacks a general understanding of what it actually takes to do so .
Edit intent: clarity
Original:  The Explainable AI research program aims to develop analytic techniques for rendering such systems transparent, but lacks a general understanding of what it actually takes to do so .
Revised:  The Explainable AI research program aims to develop analytic techniques for rendering such systems transparent, but lacks a normative framework with which to evaluate these techniques' explanatory success .
Edit intent: clarity
Original:  The aim of this discussion is to provide a general-purpose recipe for Explainable AI: A series of steps that should be taken to render an opaque computing system transparent.
Revised:  The aim of the present discussion is to provide a general-purpose recipe for Explainable AI: A series of steps that should be taken to render an opaque computing system transparent.
Edit intent: style
Original:  After analyzing the dual notions of 'opacity' and 'transparency', this recipe invokes David Marr's influential levels of analysis framework to characterize the different questions that should be asked about an opaque computing system, as well as the different ways in which these questions should be answered by different agents .
Revised:  After analyzing the dual notions of 'opacity' and 'transparency', this recipe invokes David Marr's influential levels of analysis framework to characterize the different questions that might be asked about an opaque computing system, as well as the different ways in which these questions should be answered by different agents .
Edit intent: clarity
Original:  After analyzing the dual notions of 'opacity' and 'transparency', this recipe invokes David Marr's influential levels of analysis framework to characterize the different questions that should be asked about an opaque computing system, as well as the different ways in which these questions should be answered by different agents .
Revised:  After analyzing the dual notions of 'opacity' and 'transparency', this recipe invokes David Marr's influential levels of analysis framework to characterize the different questions that should be asked about an opaque computing system, and specifies the general way in which these questions should be answered by different agents .
Edit intent: coherence
Original:  After analyzing the dual notions of 'opacity' and 'transparency', this recipe invokes David Marr's influential levels of analysis framework to characterize the different questions that should be asked about an opaque computing system, as well as the different ways in which these questions should be answered by different agents .
Revised:  After analyzing the dual notions of 'opacity' and 'transparency', this recipe invokes David Marr's influential levels of analysis framework to characterize the different questions that should be asked about an opaque computing system, as well as the different ways in which these questions should be answered .
Edit intent: clarity
Original:  By applying this recipe to recent techniques such as input heatmapping, feature-detector identification, and diagnostic classification, it will be possible to determine the extent to which Explainable AI can already solve the so-called Black Box Problem , as well as the extent to which more sophisticated techniques will be needed .
Revised:  By applying this normative framework to current techniques such as input heatmapping, feature-detector identification, and diagnostic classification, it will be possible to determine the extent to which Explainable AI can already solve the so-called Black Box Problem , as well as the extent to which more sophisticated techniques will be needed .
Edit intent: clarity
Original:  By applying this recipe to recent techniques such as input heatmapping, feature-detector identification, and diagnostic classification, it will be possible to determine the extent to which Explainable AI can already solve the so-called Black Box Problem , as well as the extent to which more sophisticated techniques will be needed .
Revised:  By applying this recipe to recent techniques such as input heatmapping, feature-detector identification, and diagnostic classification, it will be possible to determine the extent to which Explainable AI can already solve the so-called Black Box Problem can be solved .
Edit intent: clarity
Original:  Participants (N=192) were paired in an online environment to play a sketching-based reference game.
Revised:  Participants (N=192) were paired in an online environment to play a drawing-based reference game.
Edit intent: fluency
Original:  The sketcher's goal was to draw one of these objects - the target - so that the viewer could select it from the array.
Revised:  The sketcher's goal was to draw one of these objects so that the viewer could select it from the array.
Edit intent: clarity
Original:  There were two types of trials: close, where objects belonged to the same basic-level category, and far, where objects belonged to different categories.
Revised:  On `close' trials, objects belonged to the same basic-level category, and far, where objects belonged to different categories.
Edit intent: clarity
Original:  There were two types of trials: close, where objects belonged to the same basic-level category, and far, where objects belonged to different categories.
Revised:  There were two types of trials: close, where objects belonged to the same basic-level category, whereas on `far' trials objects belonged to different categories.
Edit intent: coherence
Original:  We hypothesized that humans succeed in this task by recruiting two core competencies: (1) visual abstraction, the capacity to perceive the correspondence between an object and a drawing of it;
Revised:  We hypothesized that humans succeed in this task by recruiting two core faculties: visual abstraction, the capacity to perceive the correspondence between an object and a drawing of it;
Edit intent: clarity
Original:  We hypothesized that humans succeed in this task by recruiting two core competencies: (1) visual abstraction, the capacity to perceive the correspondence between an object and a drawing of it;
Revised:  We hypothesized that humans succeed in this task by recruiting two core competencies: (1) visual abstraction, the ability to perceive the correspondence between an object and a drawing of it;
Edit intent: clarity
Original:  and (2) pragmatic inference, the ability to infer what information would help a viewer distinguish the target from distractors.
Revised:  and pragmatic inference, the ability to infer what information would help a viewer distinguish the target from distractors.
Edit intent: coherence
Original:  and (2) pragmatic inference, the ability to infer what information would help a viewer distinguish the target from distractors.
Revised:  and (2) pragmatic inference, the ability to judge what information would help a viewer distinguish the target from distractors.
Edit intent: fluency
Original:  To evaluate this hypothesis, we developed a computational model of the sketcher that embodied both competencies , instantiated as a deep convolutional neural network nested within a probabilistic program.
Revised:  To evaluate this hypothesis, we developed a computational model of the sketcher that embodied both faculties , instantiated as a deep convolutional neural network nested within a probabilistic program.
Edit intent: fluency
Original:  We found that this model fit human data well and outperformed lesioned variants , providing an algorithmically explicit theory of how  perception and social cognition jointly support contextual flexibility in visual communication.
Revised:  We found that this model fit human data well and outperformed lesioned variants , providing an algorithmically explicit theory of how visual perception and social cognition jointly support contextual flexibility in visual communication.
Edit intent: fluency
Original:  This method is thus most effective when the size of the convex polygon is much greater than the size of the other obstacles .
Revised:  This method is thus most effective when the convex polygon is much greater than the size of the other obstacles .
Edit intent: fluency
Original:  Recently, data programming has been proposed in the data management community to reduce the human cost in training data generation.
Revised:  Recently, the data programming paradigm has been proposed in the data management community to reduce the human cost in training data generation.
Edit intent: clarity
Original:  Recently, data programming has been proposed in the data management community to reduce the human cost in training data generation.
Revised:  Recently, data programming has been proposed to reduce the human cost in training data generation.
Edit intent: clarity
Original:  In the special case of truly non-motile bacteria, i.e. with zero bacterial diffusivity, we are able to derive analytical expressions describing the bacterial distributions and size of the inhibition zone.
Revised:  In the special case of truly non-motile bacteria, i.e. with zero bacterial diffusivity, we derive analytical expressions describing the bacterial distributions and size of the inhibition zone.
Edit intent: coherence
Original: Branching in vascular networks and in overall organismic form is one of the most common and ancient features of multicellular plants, fungi  and animals.
Revised: Branching in vascular networks and in overall organismic form is one of the most common and ancient features of multicellular plants, fungi , and animals.
Edit intent: fluency
Original:  Due to the asynchronous nature of the model, and a variety  schedulers that are efficient in both theory and practice, variants of the model are widely used in practice in languages such as Cilk and Java Fork-Join.
Revised:  Due to the asynchronous nature of the model, and a variety of schedulers that are efficient in both theory and practice, variants of the model are widely used in practice in languages such as Cilk and Java Fork-Join.
Edit intent: fluency
Original:  All  algorithms we describe are optimal in work and span (logarithmic in span).
Revised:  All the algorithms we describe are optimal in work and span (logarithmic in span).
Edit intent: clarity
Original: In this paper we develop optimal algorithms in the binary-forking model for a variety of fundamental problems, including sorting, semisorting, list ranking, tree contraction, range minima, and  set union, intersection and difference.
Revised: In this paper we develop optimal algorithms in the binary-forking model for a variety of fundamental problems, including sorting, semisorting, list ranking, tree contraction, range minima, and ordered set union, intersection and difference.
Edit intent: clarity
Original:  In the binary-forking model, tasks can only fork into two child tasks, but can do so recursively and asynchronously , and join up later .
Revised:  In the binary-forking model, tasks can only fork into two child tasks, but can do so recursively and asynchronously .
Edit intent: coherence
Original:  (b) Criticality analysis to identify the nodes in the network which can operate at reduced precision while allowing the network to maintain target accuracy levels;
Revised:  (b) Criticality analysis to identify nodes in the network which can operate at reduced precision while allowing the network to maintain target accuracy levels;
Edit intent: fluency
Original:  From the spatial perspective, our goal here is to get a first estimation of the granularity and reliability of the geographical information featured in the collected corpus.
Revised:  From the spatial perspective, our goal here is to get a first estimation of the quality and precision of the geographical information featured in the collected corpus.
Edit intent: clarity
Original:  We present the result of a large-scale matching exercise between the universes of 4.8 million patent families and 43 million publication records.
Revised:  We present the result of a large-scale matching exercise between 4.8 million patent families and 43 million publication records.
Edit intent: clarity
Original:  Strikingly, patents in the top decile are twice as valuable as patents in the bottom decile , which in turn are about as valuable as patents with no direct science link.
Revised:  Strikingly, high-rank patents are twice as valuable as patents in the bottom decile , which in turn are about as valuable as patents with no direct science link.
Edit intent: clarity
Original:  Strikingly, patents in the top decile are twice as valuable as patents in the bottom decile , which in turn are about as valuable as patents with no direct science link.
Revised:  Strikingly, patents in the top decile are twice as valuable as low-rank patents , which in turn are about as valuable as patents with no direct science link.
Edit intent: clarity
Original:  Strikingly, patents in the top decile are twice as valuable as patents in the bottom decile , which in turn are about as valuable as patents with no direct science link.
Revised:  Strikingly, patents in the top decile are twice as valuable as patents in the bottom decile , which in turn are about as valuable as patents without direct science link.
Edit intent: fluency
Original:  We show this core result for various measures of science quality and patent value  .
Revised:  We show this core result for various science quality and patent value .
Edit intent: clarity
Original:  We show this core result for various measures of science quality and patent value  .
Revised:  We show this core result for various measures of science quality and patent value measures .
Edit intent: clarity
Original:  The effect of science quality on patent value remains relevant even when science is linked indirectly , i.e., through other patents.
Revised:  The effect of science quality on patent value remains relevant even when science is linked indirectly through other patents.
Edit intent: coherence
Original: Objective: The main objective of this study was to investigate the formation of MCP-1 concentration gradients within the subendothelial extracelluar matrix (ECM ) and determine the effect on monocytes migration in response to inflammation.
Revised: Objective: The main objective of this study was to investigate the formation of MCP-1 concentration gradients within the subendothelial ECM and determine the effect on monocytes migration in response to inflammation.
Edit intent: clarity
Original:  The kth spectral gap is characterized here as an unstructured distance to ambiguity, namely as the minimal distance of the Laplacian to arbitrary symmetric matrices with vanishing kth spectral gap.
Revised:  The kth spectral gap is characterized in this paper as an unstructured distance to ambiguity, namely as the minimal distance of the Laplacian to arbitrary symmetric matrices with vanishing kth spectral gap.
Edit intent: clarity
Original: We consider clustered small-world networks (SWNs) with two inhibitory (I) and excitatory (E) populations.
Revised: We consider clustered small-world networks with both inhibitory (I) and excitatory (E) populations.
Edit intent: clarity
Original:  Such equalization effect is much more enhanced in the presence of combined I to E and E to I STDPs when compared with the case of individual I to E or E to I STDP.
Edit intent: coherence
Original:  To understand spatial arrangements of animal communities on such timescales, we introduce a class of diffusion-taxis equations for modelling inter-population movement responses between N \geq 2 populations.
Revised:  To understand spatial arrangements of animal communities on such timescales, we use a class of diffusion-taxis equations for modelling inter-population movement responses between N \geq 2 populations.
Edit intent: coherence
Original:  Our study highlights the importance of understanding between-population animal movement for understanding spatial species distributions, something that is typically ignored in species distribution modelling, and so carves a new paradigm for spatial population dynamics.
Revised:  Our study highlights the importance of understanding between-population animal movement for understanding spatial species distributions, something that is typically ignored in species distribution modelling, and so develops a new paradigm for spatial population dynamics.
Edit intent: clarity
Original:  these conditions are not needed for the A-stable methods of orders 1 and 2, for which furthermore a discrete energy bound irrespective of solution regularity is obtained .
Revised:  these conditions are not needed for the A-stable methods of orders 1 and 2, for which furthermore a discrete energy bound irrespective of solution regularity is proved .
Edit intent: clarity
Original: Stability landscapes are useful tools for understanding dynamical systems.
Revised: Stability landscapes are useful for understanding the properties of dynamical systems.
Edit intent: clarity
Original:  These landscapes are usually calculated from differential equations in analogy with the physical concept of scalar potential.
Revised:  These landscapes can be calculated from the system's dynamical equations using the physical concept of scalar potential.
Edit intent: clarity
Original:  Unfortunately, the conditions for those potentials to exist are quite restrictive for systems with two or more state variables  .
Revised:  Unfortunately, for most biological systems with two or more state variables .
Edit intent: clarity
Original: The continuous observation of the financial markets has identified some 'stylized facts ' which challenge the conventional assumptions, promoting the born of new approaches.
Revised: The continuous observation of the financial markets has identified some stylized facts which challenge the conventional assumptions, promoting the born of new approaches.
Edit intent: fluency
Original:  On the other hand, the local volatility CEV model , is an efficient formulation which address the 'Leverage effect ' and the smile-skew phenomena  .
Revised:  On the other hand, the CEV model addresses the Leverage effect and smile-skew phenomena .
Edit intent: clarity
Original:  In this paper, these two insights are merge and the fractional and mixed-fractional extension of the Constant Elasticity of Variance model are developed.
Revised:  In this paper, these two insights are merging and both the fractional and mixed-fractional extension of the Constant Elasticity of Variance model are developed.
Edit intent: clarity
Original:  In this paper, these two insights are merge and the fractional and mixed-fractional extension of the Constant Elasticity of Variance model are developed.
Revised:  In this paper, these two insights are merge and the fractional and mixed-fractional extensions for the CEV model, are developed.
Edit intent: clarity
Original:  and the analytical valuation formula for the European Call Option is provided .
Revised:  and the analytical valuation formula for a European Call option .
Edit intent: clarity
Original:  Besides, the greeks are computed and compared with the standard case.
Revised:  Besides, the Greeks are computed and compared with the standard case.
Edit intent: fluency
Original:  If sufficient regularity conditions hold at a solution point, namely that the implicit function theorem applies to the normalized residual function of [Busseti et al  , 2018], the problem solution map is differentiable.
Revised:  If sufficient regularity conditions hold at a solution point, namely that the implicit function theorem applies to the normalized residual function of [Busseti et al . , 2018], the problem solution map is differentiable.
Edit intent: fluency
Original:  This applies to any convex optimization problem in conic form, while a previous result [Amos et al  , 2016] studied strictly convex quadratic programs.
Revised:  This applies to any convex optimization problem in conic form, while a previous result [Amos et al . , 2016] studied strictly convex quadratic programs.
Edit intent: fluency
Original:  The novel numerical method consists in approximating the surface charge density, the liquid velocity and pressure, and the electric potential in the two dimensional liquid region.
Revised:  The numerical method consists in approximating the surface charge density, the liquid velocity and pressure, and the electric potential in the two dimensional liquid region.
Edit intent: clarity
Original: IoT Edge intelligence requires Convolutional Neural Network (CNN) inference to take place in the edge device itself.
Revised: IoT Edge intelligence requires Convolutional Neural Network (CNN) inference to take place in the edge devices itself.
Edit intent: fluency
Original:  ARM big.LITTLE architecture is at the heart of common commercial edge devices.
Revised:  ARM big.LITTLE architecture is at the heart of prevalent commercial edge devices.
Edit intent: clarity
Original:  It comprises of single-ISA heterogeneous multi-cores grouped in homogeneous clusters that enables performance and power trade-offs.
Revised:  It comprises of single-ISA heterogeneous cores grouped into multiple homogeneous clusters that enables performance and power trade-offs.
Edit intent: clarity
Original:  It comprises of single-ISA heterogeneous multi-cores grouped in homogeneous clusters that enables performance and power trade-offs.
Revised:  It comprises of single-ISA heterogeneous multi-cores grouped in homogeneous clusters that enable power and performance trade-offs.
Edit intent: fluency
Original:   However, high communication overhead involved in parallelization of computation from a convolution kernel across clusters is detrimental to throughput.
Revised:  However, high communication overhead involved in parallelization of computations from convolution kernels across clusters is detrimental to throughput.
Edit intent: fluency
Original:  We present an alternative framework called Pipe-it that employs a pipelined design to split the convolutional layers across clusters while limiting the parallelization of their respective kernels to the assigned clusters .
Revised:  We present an alternative framework called Pipe-it that employs pipelined design to split the convolutional layers across clusters while limiting the parallelization of their respective kernels to the assigned clusters .
Edit intent: fluency
Original:  We present an alternative framework called Pipe-it that employs a pipelined design to split the convolutional layers across clusters while limiting the parallelization of their respective kernels to the assigned clusters .
Revised:  We present an alternative framework called Pipe-it that employs a pipelined design to split convolutional layers across clusters while limiting the parallelization of their respective kernels to the assigned clusters .
Edit intent: fluency
Original:  We present an alternative framework called Pipe-it that employs a pipelined design to split the convolutional layers across clusters while limiting the parallelization of their respective kernels to the assigned clusters .
Revised:  We present an alternative framework called Pipe-it that employs a pipelined design to split the convolutional layers across clusters while limiting parallelization of their respective kernels to the assigned clusters .
Edit intent: fluency
Original:  We present an alternative framework called Pipe-it that employs a pipelined design to split the convolutional layers across clusters while limiting the parallelization of their respective kernels to the assigned clusters .
Revised:  We present an alternative framework called Pipe-it that employs a pipelined design to split the convolutional layers across clusters while limiting the parallelization of their respective kernels to the assigned cluster .
Edit intent: fluency
Original:  Pipe-it on average results in  39\% higher throughput than the highest antecedent throughput.
Revised:  Pipe-it on average results in a 39\% higher throughput than the highest antecedent throughput.
Edit intent: fluency