wanyu/IteraTeR_v2 huggingface dataset:
Original: Instance sparsification is well-known in the world of exact computation since it is very closely linked to the Exponential Time Hypothesis .
Revised: Instance sparsification is well-known in the world of exact computation since it is very closely linked to the Exponential Time Hypothesis .
Edit intent: fluency
Original:  Our point of view is that all of the non-linear elastic behavior of these materials can be attributed to the onset of fiber alignment with induced strain.
Revised:  Our point of view is that all of the non-linear elastic behavior of these materials to fiber alignment induced by strain.
Edit intent: clarity
Original:  We treat homogeneous deformations such as shear and extension, and also treat the case of a localized perturbation which is intended to be a simple model for a contacting cell in a medium.
Revised:  We treat homogeneous deformations such as shear and extension, and also treat the case of a localized perturbation which is a simple model for a contacting cell in a medium.
Edit intent: clarity
Original:  We treat homogeneous deformations such as shear and extension, and also treat the case of a localized perturbation which is intended to be a simple model for a contacting cell in a medium.
Revised:  We treat homogeneous deformations such as shear and extension, and also treat the case of a localized perturbation which is intended to be a simple model for a contracting cell in a medium.
Edit intent: clarity
Original:  Much evidence appears in favor of event-driven control hypothesis: human operators are passive by default and only start actively controling the system when the discrepancy between the current and desired system states becomes in some sense large .
Revised:  Increasingly much evidence appears in favor of event-driven control hypothesis: human operators are passive by default and only start actively controling the system when the discrepancy between the current and desired system states becomes in some sense large .
Edit intent: clarity
Original:  Much evidence appears in favor of event-driven control hypothesis: human operators are passive by default and only start actively controling the system when the discrepancy between the current and desired system states becomes in some sense large .
Revised:  Much evidence appears in favor of event-driven control hypothesis: human operators only start actively controling the system when the discrepancy between the current and desired system states becomes in some sense large .
Edit intent: clarity
Original:  Much evidence appears in favor of event-driven control hypothesis: human operators are passive by default and only start actively controling the system when the discrepancy between the current and desired system states becomes in some sense large .
Revised:  Much evidence appears in favor of event-driven control hypothesis: human operators are passive by default and only start actively controlling the system when the discrepancy between the current and desired system states becomes in some sense large .
Edit intent: fluency
Original:  Much evidence appears in favor of event-driven control hypothesis: human operators are passive by default and only start actively controling the system when the discrepancy between the current and desired system states becomes in some sense large .
Revised:  Much evidence appears in favor of event-driven control hypothesis: human operators are passive by default and only start actively controling the system when the discrepancy between the current and desired system states exceeds certain threshold .
Edit intent: clarity
Original:  We propose a model which captures the stochastic threshold mechanism and show that it matches the experimental data on human balancing of virtual overdamped stick.
Revised:  We propose a model capturing this interplay and show that it matches the experimental data on human balancing of virtual overdamped stick.
Edit intent: clarity
Original:  Our results suggest that the stochasticity of the threshold mechanism is a fundamental property and may play an important role in the dynamics of human-controlled systems .
Revised:  Our results suggest that noise-driven control activation plays crucial role at least in the considered task, and, possibly, in a broad range of processes under human control .
Edit intent: clarity
Original:  Our results suggest that noise-driven control activation plays crucial role at least in the considered task, and, possibly , in a broad range of processes under human control .
Revised:  Our results illuminate that the noise-driven control activation plays crucial role at least in the considered task, and, possibly , in a broad range of processes under human control .
Edit intent: clarity
Original:  Our results suggest that noise-driven control activation plays crucial role at least in the considered task, and, possibly , in a broad range of processes under human control .
Revised:  Our results suggest that noise-driven activation mechanism plays a crucial role at least in the considered task, and, possibly , in a broad range of processes under human control .
Edit intent: clarity
Original:  Our results suggest that noise-driven control activation plays crucial role at least in the considered task, and, possibly , in a broad range of processes under human control .
Revised:  Our results suggest that noise-driven control activation plays crucial role at least in the considered task, and, hypothetically , in a broad range of processes under human control .
Edit intent: clarity
Original:  Our results suggest that noise-driven control activation plays crucial role at least in the considered task, and, possibly , in a broad range of processes under human control .
Revised:  Our results suggest that noise-driven control activation plays crucial role at least in the considered task, and, possibly , in a broad range of human-controlled processes .
Edit intent: clarity
Original: We consider the causal structure of the sensorimotor loop (SML) and represent the agent's policies in terms of conditional restricted Boltzmann machines (CRBMs). CRBMs can model non-trivial conditional distributions on high dimensional input-output spaces with relatively few parameters.
Revised: Conditional restricted Boltzmann machines (CRBMs). CRBMs can model non-trivial conditional distributions on high dimensional input-output spaces with relatively few parameters.
Edit intent: coherence
Original:  We address the representational power of these models, proving results on the minimal size of universal approximators of conditional probability distributions , the minimal size of universal approximators of deterministic functions , the maximal model approximation errors, and on the dimension of the set of representable conditional distributions.
Revised:  We address the representational power of these models, proving results on the minimal size of universal approximators of conditional probability distributions , the minimal size of universal approximators , the maximal model approximation errors, and on the dimension of the set of representable conditional distributions.
Edit intent: clarity
Original:  We contribute new tools for investigating conditional models and obtain significant improvements over the results that can be derived directly from existing work on restricted Boltzmann machine probability models.
Revised:  We contribute new tools for investigating conditional probability models, which allow us to improve the results that can be derived directly from existing work on restricted Boltzmann machine probability models.
Edit intent: clarity
Original:  We contribute new tools for investigating conditional models and obtain significant improvements over the results that can be derived directly from existing work on restricted Boltzmann machine probability models.
Revised:  We contribute new tools for investigating conditional models and obtain significant improvements over the results that can be derived from existing work on restricted Boltzmann machine probability models.
Edit intent: clarity
Original:  For statistical query, an \epsilon-differentially mechanism and its companioned estimators are developed, under which the distortion for each statistical query scales as O(1/n ^{\alpha) for any 0<\alpha<1/2, where n is the number of entries in the database, namely the size of the database.
Revised:  For statistical query, an \epsilon-differentially mechanism and its companioned estimators are developed, under which the distortion for each statistical query scales as O(1/n ) for any 0<\alpha<1/2, where n is the number of entries in the database, namely the size of the database.
Edit intent: clarity
Original: Several kinds of quantum pushdown automata have been proposed, and their computational power is investigated intensively.
Revised: Several kinds of quantum pushdown automaton models have been proposed, and their computational power is investigated intensively.
Edit intent: clarity
Original:  We also show that our model can solve a  promise problem exactly while deterministic pushdown automata cannot.
Revised:  We also show that our model can solve a certain promise problem exactly while deterministic pushdown automata cannot.
Edit intent: clarity
Original: We propose a novel model for representing finite discrete Time-Varying Graphs ~ (TVGs) .
Revised: We propose a novel model for representing finite discrete Time-Varying Graphs (TVGs) .
Edit intent: fluency
Original:  We also analyze the data structures built following our proposed model and demonstrate that, for most practical cases, the asymptotic memory complexity of our model is restricted to the cardinality of the set of edges.
Revised:  We also analyze the data structures built from our proposed model and demonstrate that, for most practical cases, the asymptotic memory complexity of our model is restricted to the cardinality of the set of edges.
Edit intent: clarity
Original:  We also analyze the data structures built following our proposed model and demonstrate that, for most practical cases, the asymptotic memory complexity of our model is restricted to the cardinality of the set of edges.
Revised:  We also analyze the data structures built following our proposed model and demonstrate that, for most practical cases, the asymptotic memory complexity of our model is in the order of the cardinality of the set of edges.
Edit intent: clarity
Original:  We also show that our unifying model can represent several previous (classes of) models for dynamic networks found in the recent literature, which in general are unable to represent each other.
Revised:  We also show that our proposal is an unifying model that can represent several previous (classes of) models for dynamic networks found in the recent literature, which in general are unable to represent each other.
Edit intent: clarity
Original:  In contrast to previous models, our proposal is also able to intrinsically model cyclic ~ (i.e. periodic) behavior in dynamic networks.
Revised:  In contrast to previous models, our proposal is also able to intrinsically model cyclic (i.e. periodic) behavior in dynamic networks.
Edit intent: fluency
Original:  this corresponds to about 3\\%DIF < of the %DIF > of  theoretical peak performance of the machine and we use more than 40\\%DIF < of the %DIF > of  peak memory bandwidth with a Conjugate Gradient (CG) solver.
Revised:  this corresponds to about 3\\%DIF < of the %DIF > of the theoretical peak performance of the machine and we use more than 40\\%DIF < of the %DIF > of peak memory bandwidth with a Conjugate Gradient (CG) solver.
Edit intent: fluency
Original:  this corresponds to about 3\\%DIF < of the %DIF > of  theoretical peak performance of the machine and we use more than 40\\%DIF < of the %DIF > of  peak memory bandwidth with a Conjugate Gradient (CG) solver.
Revised:  this corresponds to about 3\\%DIF < of the %DIF > of theoretical peak performance of the machine and we use more than 40\\%DIF < of the %DIF > of the peak memory bandwidth with a Conjugate Gradient (CG) solver.
Edit intent: fluency
Original: The architecture of a neural network controling an unknown environment is presented.
Revised: The architecture of a neural network controlling an unknown environment is presented.
Edit intent: fluency
Original:  It  based on a random reservoir from which both perception and action are simultaneously read  .
Revised:  It is based on a random reservoir from which both perception and action are simultaneously read .
Edit intent: fluency
Original:  It  based on a random reservoir from which both perception and action are simultaneously read  .
Revised:  It based on a random reservoir from which both perception and action are simultaneously read and fed back .
Edit intent: clarity
Original:  This provides a simple implementation of the ideomotor theory, which says that action could be designed with the goal of modifying the perception.
Edit intent: coherence
Original:  The coherent behavior of the neural network in its environement is a consequence of the interaction between the two principles  .
Revised:  The coherent behavior of the neural network in its environment is a consequence of the interaction between the two principles .
Edit intent: fluency
Original: A subgraph T of a graph G is a tree t-spanner of G if and only if T is a tree and for every pair of vertices in G their distance in T is at most t times their distance in G, where t is called a stretch factor of T.
Revised: Tree spanners approximate distances within graphs; a subtree of a graph G is a tree t-spanner of G if and only if T is a tree and for every pair of vertices in G their distance in T is at most t times their distance in G, where t is called a stretch factor of T.
Edit intent: clarity
Original: A subgraph T of a graph G is a tree t-spanner of G if and only if T is a tree and for every pair of vertices in G their distance in T is at most t times their distance in G, where t is called a stretch factor of T.
Revised: A subgraph T of a graph is a tree t-spanner of G if and only if T is a tree and for every pair of vertices in G their distance in T is at most t times their distance in G, where t is called a stretch factor of T.
Edit intent: fluency
Original: A subgraph T of a graph G is a tree t-spanner of G if and only if T is a tree and for every pair of vertices in G their distance in T is at most t times their distance in G, where t is called a stretch factor of T.
Revised: A subgraph T of a graph G is a tree t-spanner of the graph if and only if T is a tree and for every pair of vertices in G their distance in T is at most t times their distance in G, where t is called a stretch factor of T.
Edit intent: clarity
Original: A subgraph T of a graph G is a tree t-spanner of G if and only if T is a tree and for every pair of vertices in G their distance in T is at most t times their distance in G, where t is called a stretch factor of T.
Revised: A subgraph T of a graph G is a tree t-spanner of G if and only if for every pair of vertices in G their distance in T is at most t times their distance in G, where t is called a stretch factor of T.
Edit intent: coherence
Original: A subgraph T of a graph G is a tree t-spanner of G if and only if T is a tree and for every pair of vertices in G their distance in T is at most t times their distance in G, where t is called a stretch factor of T.
Revised: A subgraph T of a graph G is a tree t-spanner of G if and only if T is a tree and for every pair of vertices their distance in T is at most t times their distance in G, where t is called a stretch factor of T.
Edit intent: fluency
Original:  An efficient algorithm to determine whether a graph admits a tree 2-spanner has been developed, while for each t\geq 4 the problem to determine whether a graph admits a tree t-spanner has been proven to be NP-complete.
Revised:  An efficient algorithm to determine whether a graph admits a tree t-spanner. Now, determining whether a graph admits a tree t-spanner has been proven to be NP-complete.
Edit intent: coherence
Original:  Although it is not known whether it is tractable to decide graphs that admit a tree 3-spanner  , an efficient algorithm to determine whether a graph admits a tree 3-spanner of diameter at most 5 is presented  .
Revised:  Although it is not known whether it is tractable to decide graphs that admit a tree 3-spanner , an efficient algorithm to determine graphs that admit a tree 3-spanner of diameter at most 5 is presented .
Edit intent: coherence
Original: We present the first decentralized multi-copter flock that is capable of stable autonomous outdoor flight .
Revised: We present the first decentralized multi-copter flock that performs stable autonomous outdoor flight .
Edit intent: clarity
Original:  By autonomous we mean that all members navigate themselves based on the dynamic information received from other robots in the vicinity , without any central data processing or control .
Revised:  By autonomous we mean that all members navigate themselves based on the dynamic information received from other robots in the vicinity . We do not use central data processing or control .
Edit intent: clarity
Original:  The model allows for stable group flight even in  noisy, windy, delayed and error-prone environment.
Revised:  In addition, the model is optimized for stable group flight even in noisy, windy, delayed and error-prone environment.
Edit intent: clarity
Original:  The model allows for stable group flight even in  noisy, windy, delayed and error-prone environment.
Revised:  The model allows for stable group flight even in a noisy, windy, delayed and error-prone environment.
Edit intent: fluency
Original:  Using this framework we successfully demonstrated several fundamental collective flight tasks with up to 11 units: i) we achieved self-propelled flocking in a bounded area with self-organized object avoidance capabilities and ii) performed collective target tracking with stable formation flights (grid, rotating ring, straight line).
Revised:  Using this framework we successfully implemented several fundamental collective flight tasks with up to 11 units: i) we achieved self-propelled flocking in a bounded area with self-organized object avoidance capabilities and ii) performed collective target tracking with stable formation flights (grid, rotating ring, straight line).
Edit intent: clarity
Original:  With realistic numerical simulations we demonstrated that the local broadcast-type communication and the decentralized autonomous control method allows for the scalability of the model for larger flock sizes .
Revised:  With realistic numerical simulations we demonstrated that the local broadcast-type communication and the decentralized autonomous control method allows for the scalability of the model for much larger flocks .
Edit intent: clarity
Original: The issue of constructing a risk minimizing hedge with additional constraints on the shortfall risk is examined.
Revised: The issue of constructing a risk minimizing hedge with additional constraints on the shortfall profile is examined.
Edit intent: clarity
Original:  Several classical risk minimizing problems have been adapted to the new setting and solved.
Revised:  Several classical risk minimizing problems are adapted to the new setting and solved.
Edit intent: clarity
Original:   The existence and specific forms of optimal strategies in a general semimartingale market model with the use of conditional statistical tests have been proven.
Revised:  The existence and concrete forms of optimal strategies in a general semimartingale market model with the use of conditional statistical tests have been proven.
Edit intent: clarity
Original:   The existence and specific forms of optimal strategies in a general semimartingale market model with the use of conditional statistical tests have been proven.
Revised:  The existence and specific forms of optimal strategies in a general semimartingale market model with the use of conditional statistical tests are proven.
Edit intent: clarity
Original:  The  quantile hedging method applied in \mbox{ FL10pt and \mbox{ FL2 }0pt } as well as the classical Neyman-Pearson lemma have been generalized.
Revised:  The well known quantile hedging method applied in \mbox{ FL10pt and \mbox{ FL2 }0pt } as well as the classical Neyman-Pearson lemma have been generalized.
Edit intent: clarity
Original:  The  quantile hedging method applied in \mbox{ FL10pt and \mbox{ FL2 }0pt } as well as the classical Neyman-Pearson lemma have been generalized.
Revised:  The quantile hedging method 0pt and \mbox{ FL2 }0pt } as well as the classical Neyman-Pearson lemma have been generalized.
Edit intent: clarity
Original:  The  quantile hedging method applied in \mbox{ FL10pt and \mbox{ FL2 }0pt } as well as the classical Neyman-Pearson lemma have been generalized.
Revised:  The quantile hedging method applied in \mbox{ FL10pt and \mbox{ FL2 }0pt } as well as the classical Neyman-Pearson lemma are generalized.
Edit intent: clarity
Original:  Optimal hedging strategies with shortfall constraints in the Black-Scholes and exponential Poisson model have been explicitly determined.
Revised:  Optimal hedging strategies with shortfall constraints in the Black-Scholes and exponential Poisson model are explicitly determined.
Edit intent: clarity
Original:  Our analysis also shows that dropout unit and weight will be more helpful than drop unit or weight only.
Edit intent: coherence
Original:  The biotechnology potential of thermal cycling via a thermochemical oscillator is highlighted.
Edit intent: coherence
Original:  Moreover we show that it is possible to synthesize such strategy profiles that are finite-memory and use few memory.
Revised:  Moreover we show that one can synthesize finite-memory strategy profiles with few memory.
Edit intent: clarity
Original:  Finally, we prove that the constrained existence problem for secure equilibria is decidable for sup, inf, lim sup, lim inf and mean-payoff measures.
Revised:  We also prove that the constrained existence problem for secure equilibria is decidable for sup, inf, lim sup, lim inf and mean-payoff measures.
Edit intent: coherence
Original:  We derive an analytic expression for the lag-time distribution, which agrees well with existing experimental results for the aggregation of bovine insulin into amyloid fibrils.
Revised:  We derive an analytic expression for the lag-time distribution, which agrees well with experimental results for the aggregation of bovine insulin into amyloid fibrils.
Edit intent: clarity
Original:  Our solution provides a way to interpret small-volume experiments on fibril formation, providing insight into the mechanisms at play in early-stage aggregation  .
Revised:  Our solution provides a way to extract mechanistic information on early-stage aggregation .
Edit intent: clarity
Original:  Our solution provides a way to interpret small-volume experiments on fibril formation, providing insight into the mechanisms at play in early-stage aggregation  .
Revised:  Our solution provides a way to interpret small-volume experiments on fibril formation, providing insight into the mechanisms at play in early-stage aggregation from small-volume experiments .
Edit intent: clarity
Original:  Our analysis shows that significant lag-time variability can arise from both primary nucleation and from autocatalytic growth  and should provide a way to extract mechanistic information on early-stage aggregation from small-volume experiments.
Revised:  Our analysis shows that significant lag-time variability can arise from both primary nucleation and from autocatalytic growth , and should provide a way to extract mechanistic information on early-stage aggregation from small-volume experiments.
Edit intent: fluency
Original: Linearizability is the defacto correctness criterion for concurrent data structures.
Revised: Linearizability is the de facto correctness criterion for concurrent data structures.
Edit intent: fluency
Original:  We define quantitative quiescent consistency (QQC), a relaxation of linearizability where the degree of relaxation is proportional to  degree of contention.
Revised:  We define quantitative quiescent consistency (QQC), a relaxation of linearizability where the degree of relaxation is proportional to the degree of contention.
Edit intent: fluency