wanyu/IteraTeR_v2 huggingface dataset:
Original:  While the insertion of a MSM rate matrix into an RD framework seems formally straightforward, fundamental questions about the coupling are open: Which definition of MSM states is suitable?
Revised:  While the insertion of a MSM rate matrix into an RD framework seems formally straightforward, fundamental questions are still open: Which definition of MSM states is suitable?
Edit intent: clarity
Original:  Quantum circuits that are based on Clifford+T gates can  be made fault tolerant in nature but the T gate is very costly to implement.
Revised:  Quantum circuits that are based on Clifford+T gates can easily be made fault tolerant in nature but the T gate is very costly to implement.
Edit intent: clarity
Original:  Quantum circuits that are based on Clifford+T gates can  be made fault tolerant in nature but the T gate is very costly to implement.
Revised:  Quantum circuits that are based on Clifford+T gates can be made fault tolerant but the T gate is very costly to implement.
Edit intent: clarity
Original:  As a result . reducing T-count has become an important optimization goal.
Revised:  As a result , reducing T-count has become an important optimization goal.
Edit intent: fluency
Original:  Further, quantum circuits with many qubits are difficult to realize  making designs that save qubits and produce no garbage outputs desirable.
Revised:  Further, quantum circuits with many qubits are difficult to realize , making designs that save qubits and produce no garbage outputs desirable.
Edit intent: fluency
Original:  To have fair comparison against existing work, the Bennett's garbage removal scheme is used to remove garbage output from existing works.
Revised:  To make a fair comparison against existing work, the Bennett's garbage removal scheme is used to remove garbage output from existing works.
Edit intent: clarity
Original:  We determined that the proposed design achieves an average T-count savings of 40.91 \\%DIF < , 98.88 \\%, 39.25 \\% and 26.11 \\% as well as qubit savings of %DIF > , 98.95 \\%, 41.06 \\% and 20.28 \\% as well as qubit savings of 85.46 \\%DIF < , 95.16 \\%, 90.59 \\% and 86.77 \\% compared to existing work.abstract %DIF > , 95.16 \\%, 90.59 \\% and 86.77 \\% compared to existing works.
Revised:  We determined that out proposed design achieves an average T-count savings of 40.91 \\%DIF < , 98.88 \\%, 39.25 \\% and 26.11 \\% as well as qubit savings of %DIF > , 98.95 \\%, 41.06 \\% and 20.28 \\% as well as qubit savings of 85.46 \\%DIF < , 95.16 \\%, 90.59 \\% and 86.77 \\% compared to existing work.abstract %DIF > , 95.16 \\%, 90.59 \\% and 86.77 \\% compared to existing works.
Edit intent: clarity
Original:  We determined that out proposed design achieves an average T-count savings of 43.44 \\%, 98.95 \\%, 41.06 \\% and 20.28 \\% as well as qubit savings of 85.46 \\%, 95.16 \\%, 90.59 \\% and 86.77 \\% compared to existing works.
Revised:  We determined that our proposed design achieves an average T-count savings of 43.44 \\%, 98.95 \\%, 41.06 \\% and 20.28 \\% as well as qubit savings of 85.46 \\%, 95.16 \\%, 90.59 \\% and 86.77 \\% compared to existing works.
Edit intent: fluency
Original:  The long period orbits seem to be generated by several mechanisms, one of which is a canard explosion, for which  approximate the dynamics near the slow manifold.
Revised:  The long period orbits seem to be generated by several mechanisms, one of which is a canard explosion, for which we approximate the dynamics near the slow manifold.
Edit intent: clarity
Original:  Two parameter continuation reveals parameter regions with even more exotic dynamics including quasi-periodic and phase-locked tori, and chaotic solutions.
Revised:  Two-parameter continuation reveals parameter regions with even more exotic dynamics including quasi-periodic and phase-locked tori, and chaotic solutions.
Edit intent: clarity
Original:  The panoply of dynamics that we find in the model demonstrates that instability in the stem cell dynamics can be sufficient to generate the rich behaviour seen in dynamic hematological diseases.
Revised:  The panoply of dynamics that we find in the model demonstrates that instability in the stem cell dynamics could be sufficient to generate the rich behaviour seen in dynamic hematological diseases.
Edit intent: fluency
Original: Artifical Neural Network are a particular class of learning system modeled after biological neural functions with an interesting penchant for Hebbian learning, that is "neurons that wire together, fire together".
Revised: Artifical Neural Networks are a particular class of learning system modeled after biological neural functions with an interesting penchant for Hebbian learning, that is "neurons that wire together, fire together".
Edit intent: fluency
Original: Artifical Neural Network are a particular class of learning system modeled after biological neural functions with an interesting penchant for Hebbian learning, that is "neurons that wire together, fire together".
Revised: Artifical Neural Network are a particular class of learning systems modeled after biological neural functions with an interesting penchant for Hebbian learning, that is "neurons that wire together, fire together".
Edit intent: fluency
Original:  This paper performs a speed benchmark to compare the speed and accuracy capabilities of SG-DNI as over to a standard neural interface using multilayer perceptron MLP. SG-DNI shows good promise, in that it not only captures the learning problem, it is also over 3-fold faster due to it asynchronous learning capabilities.
Revised:  This paper performs a speed benchmark to compare the speed and accuracy capabilities of SG-DNI as opposed to a standard neural interface using multilayer perceptron MLP. SG-DNI shows good promise, in that it not only captures the learning problem, it is also over 3-fold faster due to it asynchronous learning capabilities.
Edit intent: fluency
Original:  Most notably we all acknowledge the efforts that Irmeli Barkefors put into all the practical arrangements and herding of the participants throughout the week.
Edit intent: coherence
Original: The classical Eilenberg correspondence , based on the concept of the syntactic monoid, relates varieties of regular languages with pseudovarieties of finite monoids.
Revised: The Eilenberg correspondence relates varieties of regular languages with pseudovarieties of finite monoids.
Edit intent: clarity
Original: The classical Eilenberg correspondence , based on the concept of the syntactic monoid, relates varieties of regular languages with pseudovarieties of finite monoids.
Revised: The classical Eilenberg correspondence , based on the concept of the syntactic monoid, relates varieties of regular languages to pseudovarieties of finite monoids.
Edit intent: fluency
Original:  Various modifications of this correspondence appeared, with more general classes of regular languages on one hand and classes of more complex algebraic structures on the other hand.
Revised:  Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of more complex algebraic structures on the other hand.
Edit intent: clarity
Original: During visuomotor tasks, robots have to compensate for the temporal delays inherent in their sensorimotor processing systems.
Revised: During visuomotor tasks, robots must compensate for temporal delays inherent in their sensorimotor processing systems.
Edit intent: fluency
Original:  This capability becomes crucial in a dynamic environment where the visual input is constantly changing, e.g. when interacting with humans .
Revised:  Delay compensation becomes crucial in a dynamic environment where the visual input is constantly changing, e.g. when interacting with humans .
Edit intent: clarity
Original:  This capability becomes crucial in a dynamic environment where the visual input is constantly changing, e.g. when interacting with humans .
Revised:  This capability becomes crucial in a dynamic environment where the visual input is constantly changing, e.g. , during the interacting with a human demonstrator .
Edit intent: clarity
Original:  For this purpose, the robot should be equipped with a prediction mechanism able to use the acquired perceptual experience in order to estimate possible future motor commands.
Revised:  For this purpose, the robot must be equipped with a prediction mechanism able to use the acquired perceptual experience in order to estimate possible future motor commands.
Edit intent: coherence
Original:  For this purpose, the robot should be equipped with a prediction mechanism able to use the acquired perceptual experience in order to estimate possible future motor commands.
Revised:  For this purpose, the robot should be equipped with a prediction mechanism for using the acquired perceptual experience in order to estimate possible future motor commands.
Edit intent: clarity
Original:  For this purpose, the robot should be equipped with a prediction mechanism able to use the acquired perceptual experience in order to estimate possible future motor commands.
Revised:  For this purpose, the robot should be equipped with a prediction mechanism able to use the acquired perceptual experience to estimate possible future motor commands.
Edit intent: coherence
Original:  In this paper, we present a novel neural network architecture that learns prototypical visuomotor representations and provides reliable predictions  to compensate for the delayed robot behavior in an online manner.
Revised:  In this paper, we present a novel neural network architecture that learns prototypical visuomotor representations and provides reliable predictions on the basis of the visual input. These predictions are used to compensate for the delayed robot behavior in an online manner.
Edit intent: clarity
Original:  In this paper, we present a novel neural network architecture that learns prototypical visuomotor representations and provides reliable predictions  to compensate for the delayed robot behavior in an online manner.
Revised:  In this paper, we present a novel neural network architecture that learns prototypical visuomotor representations and provides reliable predictions to compensate for the delayed motor behavior in an online manner.
Edit intent: clarity
Original:  We investigate the performance of our method in the context of a synchronization task, where a humanoid robot has to generate visually perceived arm motion trajectories in synchrony with a human demonstrator .
Revised:  We investigate the performance of our method with a set of experiments comprising a humanoid robot that has to learn and generate visually perceived arm motion trajectories in synchrony with a human demonstrator .
Edit intent: clarity
Original:  We investigate the performance of our method in the context of a synchronization task, where a humanoid robot has to generate visually perceived arm motion trajectories in synchrony with a human demonstrator .
Revised:  We investigate the performance of our method in the context of a synchronization task, where a humanoid robot has to generate visually perceived arm motion trajectories .
Edit intent: clarity
Original:  We evaluate the prediction accuracy in terms of mean prediction error and analyze the response of the network to novel movement demonstrations.
Revised:  We evaluate the accuracy in terms of mean prediction error and analyze the response of the network to novel movement demonstrations.
Edit intent: clarity
Original:  Additionally, we provide experiments with the system receiving incomplete data sequences, showing the robustness of the proposed architecture in the case of a noisy and faulty visual sensor.
Revised:  Additionally, we report experiments with incomplete data sequences, showing the robustness of the proposed architecture in the case of a noisy and faulty visual sensor.
Edit intent: clarity
Original:  The excitable population is uncoupled, while the inhibitory population is tightly coupled.
Revised:  The excitatory population is uncoupled, while the inhibitory population is tightly coupled.
Edit intent: fluency
Original:  Importantly, it is not trivial to design efficient spectrum sharing mechanisms, not only due to technical aspects, but also due to regulatory and business model constraints.
Revised:  Importantly, it is not trivial to design such efficient mechanisms, not only due to technical aspects, but also due to regulatory and business model constraints.
Edit intent: clarity
Original:  Using this framework, we present a literature review on inter-technology coexistence with a focus on wireless technologies with the same spectrum access rights, i.e. (i) primary/primary, (ii) secondary/secondary, and (iii) technologies operating in a spectrum commons.
Revised:  Using this framework, we present a literature review on inter-technology coexistence with a focus on wireless technologies with equal spectrum access rights, i.e. (i) primary/primary, (ii) secondary/secondary, and (iii) technologies operating in a spectrum commons.
Edit intent: clarity
Original:  Finally, we discuss spectrum sharing design challenges and suggest potential future research directions.
Revised:  Finally, we discuss spectrum sharing design challenges and suggest future research directions.
Edit intent: clarity
Original: We present DeepPicar, a low-cost deep neural network (DNN) based autonomous car platform.
Revised: We present DeepPicar, a low-cost deep neural network based autonomous car platform.
Edit intent: clarity
Original:  We also systematically compare other contemporary embedded computing platforms using the DeepPicar's CNN based real-time control software as a workload.
Revised:  We also systematically compare other contemporary embedded computing platforms using the DeepPicar's CNN-based real-time control software as a workload.
Edit intent: fluency
Original:  We also systematically compare other contemporary embedded computing platforms using the DeepPicar's CNN based real-time control software as a workload.
Revised:  We also systematically compare other contemporary embedded computing platforms using the DeepPicar's CNN based real-time control workload.
Edit intent: clarity
Original:  We find  all tested platforms, including the Pi 3, are capable of supporting deep-learning based real-time control, from 20 Hz up to 100 Hz  depending on hardware platform.
Revised:  We find that all tested platforms, including the Pi 3, are capable of supporting deep-learning based real-time control, from 20 Hz up to 100 Hz depending on hardware platform.
Edit intent: fluency
Original:  We find  all tested platforms, including the Pi 3, are capable of supporting deep-learning based real-time control, from 20 Hz up to 100 Hz  depending on hardware platform.
Revised:  We find all tested platforms, including the Pi 3, are capable of supporting deep-learning based real-time control, from 20 Hz up to 100 Hz , depending on hardware platform.
Edit intent: fluency
Original:  However,  shared resource contention remains an important issue that must be considered in applying deep-learning models on shared memory based embedded computing platforms  .
Revised:  However, we find that shared resource contention remains an important issue that must be considered in applying deep-learning models on shared memory based embedded computing platforms .
Edit intent: coherence
Original:  The emergence of Web ~ 2.0 platforms, where producers and consumers of content unify, has drastically changed the information market.
Revised:  The emergence of Web 2.0 platforms, where producers and consumers of content unify, has drastically changed the information market.
Edit intent: fluency
Original:  On the other hand, the decentralized and often un-monitored environment of such projects may make them susceptible to systematic malfunction and misbehavior .
Revised:  On the other hand, the decentralized and often un-monitored environment of such projects may make them susceptible to low quality content .
Edit intent: clarity
Original:  There is also a high presence of offensive content, but highly offensive content tends to receive lower scores through the  voting system.
Revised:  There is also a high presence of offensive content, but highly offensive content tends to receive lower scores through the dictionary's voting system.
Edit intent: clarity
Original:  Our study highlights that Urban Dictionary has a higher content heterogeneity than found in traditional dictionaries, which poses challenges in terms in processing but also offers opportunities to analyze and track language innovation.
Revised:  The low threshold to include new material in Urban Dictionary enables quick recording of new words and new meanings, but the resulting heterogeneous content can pose challenges in using Urban Dictionary as a source to study language innovation.
Edit intent: clarity
Original: Bipartite graph data increasingly occurs as a stream of edges that represent transactions, e.g., purchases by retail customers.
Revised: Bipartite networks manifest as a stream of edges that represent transactions, e.g., purchases by retail customers.
Edit intent: clarity
Original:  Applications such as recommender systems employ neighborhood-based measures of node similarity , such as the pairwise number of common neighbors (CN) and related metrics.
Revised:  Many machine learning applications employ neighborhood-based measures of node similarity , such as the pairwise number of common neighbors (CN) and related metrics.
Edit intent: clarity
Original:  Applications such as recommender systems employ neighborhood-based measures of node similarity , such as the pairwise number of common neighbors (CN) and related metrics.
Revised:  Applications such as recommender systems employ neighborhood-based measures to characterize the similarity among the nodes , such as the pairwise number of common neighbors (CN) and related metrics.
Edit intent: clarity
Original:  While the number of node pairs that share neighbors is potentially enormous, in real-word graphs only a relatively small proportion of all pairs have a large number of common neighbors.
Revised:  While the number of node pairs that share neighbors is potentially enormous, only a relatively small proportion of all pairs have a large number of common neighbors.
Edit intent: clarity
Original:  While the number of node pairs that share neighbors is potentially enormous, in real-word graphs only a relatively small proportion of all pairs have a large number of common neighbors.
Revised:  While the number of node pairs that share neighbors is potentially enormous, in real-word graphs only a relatively small proportion of them have many common neighbors.
Edit intent: clarity
Original:  This motivates finding a weighted sampling approach that preferentially samples such node pairs.
Revised:  This motivates finding a weighted sampling approach to preferentially sample these node pairs.
Edit intent: clarity
Original:  This paper presents a new sampling algorithm that provides a fixed size unbiased estimate of the similarity (or projected) graph on a bipartite edge stream .
Revised:  This paper presents a new sampling algorithm that provides a fixed size unbiased estimate of the similarity matrix resulting from a bipartite graph stream projection .
Edit intent: clarity
Original:  Second, arriving edges generate a stream of similarity updates based on their adjacency with the current sample.
Revised:  Second, arriving edges generate a stream of similarity updates based on their adjacency with the current sample.
Edit intent: fluency
Original:  Experiments on real world graphs show that a 10\% sample ar each stages yields estimates of high similarity edges with weighted relative errors of about 10^{-2
Revised:  Experiments on real world graphs show that a 10\% sample at each stage yields estimates of high similarity edges with weighted relative errors of about 10^{-2
Edit intent: fluency
Original: A%DIFDELCMD < {\it %%% Distance Labeling schemeis\emph{  a data structure that can answer shortest path queries on a graph.
Revised: %DIFDELCMD < {\it %%% Distance Labeling schemeis\emph{ a data structure that can answer shortest path queries on a graph.
Edit intent: fluency
Original: A%DIFDELCMD < {\it %%% Distance Labeling schemeis\emph{  a data structure that can answer shortest path queries on a graph.
Revised: A%DIFDELCMD < {\it %%% Distance Labeling schemeis\emph{ ; To answer a data structure that can answer shortest path queries on a graph.
Edit intent: coherence
Original:  Such a finding is not expected in the worst case, since even for graphs with maximum degree 3, it is known that any distance labeling requires (n^{3/2) labeling schemes on random graph models with a power law degree distribution .
Revised:  Such a finding is not expected in the worst case, since even for graphs with maximum degree 3, it is known that any distance labeling requires (n^{3/2) labeling schemes on sparse random graphs with a power law degree distribution .
Edit intent: clarity
Original:  In a labeling scheme, each vertex is assigned a\emph{label vector ;
Revised:  In a labeling scheme, each vertex is assigned a\emph{ ;
Edit intent: clarity
Original:  A set function f on a finite set V is {\em submodular} if f(X) + f(Y) \geq f(X \cup Y) - f(X \cap Y) for any pair X, Y \subseteq V.
Revised:  A set function f on a finite set V is {\em submodular} if f(X) + f(Y) \geq f(X \cup Y) + f(X \cap Y) for any pair X, Y \subseteq V.
Edit intent: coherence
Original:  of f by a {\em canonical set} S \subseteq V is a set function g given by g(X) = f(X \vartriangle S) for X \subseteq V,where X \vartriangle S = (X \setminus S) \cup (S \setminus X) is the%DIFDELCMD < {\it %%% symmetric difference between X and S. Despite that submodular functions and SD-transformations are regarded as counterparts of convex functions and affine transformations in finite discrete space, not all SD-transformations do not preserve the submodularity.
Revised:  of f by a {\em canonical set} S \subseteq V is a set function g given by g(X) = f(X \vartriangle S) for X \subseteq V,where X \vartriangle S = (X \setminus S) \cup (S \setminus X) %DIFDELCMD < {\it %%% symmetric difference between X and S. Despite that submodular functions and SD-transformations are regarded as counterparts of convex functions and affine transformations in finite discrete space, not all SD-transformations do not preserve the submodularity.
Edit intent: fluency
Original:  of f by a {\em canonical set} S \subseteq V is a set function g given by g(X) = f(X \vartriangle S) for X \subseteq V,where X \vartriangle S = (X \setminus S) \cup (S \setminus X) is the%DIFDELCMD < {\it %%% symmetric difference between X and S. Despite that submodular functions and SD-transformations are regarded as counterparts of convex functions and affine transformations in finite discrete space, not all SD-transformations do not preserve the submodularity.
Revised:  of f by a {\em canonical set} S \subseteq V is a set function g given by g(X) = f(X \vartriangle S) for X \subseteq V,where X \vartriangle S = (X \setminus S) \cup (S \setminus X) is the%DIFDELCMD < {\it %%% denotes the symmetric difference between X and S. Despite that submodular functions and SD-transformations are regarded as counterparts of convex functions and affine transformations in finite discrete space, not all SD-transformations do not preserve the submodularity.
Edit intent: clarity