wanyu/IteraTeR_v2 huggingface dataset:
Original:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear dynamic systems . Using experiments on a testbed with multiple cart-pole systems, we are the first to demonstrate the feasibility and to assess the performance of closed-loop control and coordination over multi-hop low-power wireless for update intervals from 20 ms to 50 ms .
Revised:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear dynamic systems . Using experiments on a testbed with multiple cart-pole systems, we are the first to demonstrate the feasibility and to assess the performance of closed-loop control and coordination over multi-hop low-power wireless for update intervals of 20 ms to 50 ms .
Edit intent: clarity
Original:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear dynamic systems . Using experiments on a testbed with multiple cart-pole systems, we are the first to demonstrate the feasibility and to assess the performance of closed-loop control and coordination over multi-hop low-power wireless for update intervals from 20 ms to 50 ms .
Revised:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear dynamic systems . Using experiments on a testbed with multiple cart-pole systems, we are the first to demonstrate the feasibility and to assess the performance of closed-loop control and coordination over multi-hop low-power wireless for update intervals from 20 to 50 ms .
Edit intent: fluency
Original:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear dynamic systems . Using experiments on a testbed with multiple cart-pole systems, we are the first to demonstrate the feasibility and to assess the performance of closed-loop control and coordination over multi-hop low-power wireless for update intervals from 20 ms to 50 ms .
Revised:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear dynamic systems . Using experiments on a testbed with multiple cart-pole systems, we are the first to demonstrate the feasibility and to assess the performance of closed-loop control and coordination over multi-hop low-power wireless for update intervals from 20 ms to 50 milliseconds .
Edit intent: fluency
Original:  Low-power wireless  is preferred for its low cost, small form factor, and flexibility, especially if the devices support multi-hop communication.
Revised:  Low-power wireless technology is preferred for its low cost, small form factor, and flexibility, especially if the devices support multi-hop communication.
Edit intent: clarity
Original:  Thus far, however, feedback control over  multi-hop low-power wireless has only been demonstrated for update intervals on the order of seconds.
Revised:  So far, however, feedback control over multi-hop low-power wireless has only been demonstrated for update intervals on the order of seconds.
Edit intent: fluency
Original:  Thus far, however, feedback control over  multi-hop low-power wireless has only been demonstrated for update intervals on the order of seconds.
Revised:  Thus far, however, feedback control over wireless multi-hop low-power wireless has only been demonstrated for update intervals on the order of seconds.
Edit intent: clarity
Original:  Thus far, however, feedback control over  multi-hop low-power wireless has only been demonstrated for update intervals on the order of seconds.
Revised:  Thus far, however, feedback control over multi-hop networks has only been demonstrated for update intervals on the order of seconds.
Edit intent: clarity
Original:  Thus far, however, feedback control over  multi-hop low-power wireless has only been demonstrated for update intervals on the order of seconds.
Revised:  Thus far, however, feedback control over multi-hop low-power wireless has only been shown for update intervals on the order of seconds.
Edit intent: clarity
Original:  This paper presents a wireless embedded system that tames imperfections impairing control performance such as jitter or message losses ,
Revised:  This paper presents a wireless embedded system that tames imperfections impairing control performance (e.g., jitter and message loss) ,
Edit intent: clarity
Original:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear physical processes . Using experiments on a cyber-physical testbed with 20 wireless nodes and multiple cart-pole systems, we are the first to demonstrate and evaluate feedback control and coordination over  multi-hop low-power wireless for update intervals of 20 to 50 milliseconds.
Revised:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for physical processes with linear time-invariant dynamics . Using experiments on a cyber-physical testbed with 20 wireless nodes and multiple cart-pole systems, we are the first to demonstrate and evaluate feedback control and coordination over multi-hop low-power wireless for update intervals of 20 to 50 milliseconds.
Edit intent: clarity
Original:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear physical processes . Using experiments on a cyber-physical testbed with 20 wireless nodes and multiple cart-pole systems, we are the first to demonstrate and evaluate feedback control and coordination over  multi-hop low-power wireless for update intervals of 20 to 50 milliseconds.
Revised:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear physical processes . Using experiments on a cyber-physical testbed with 20 wireless nodes and multiple cart-pole systems, we are the first to demonstrate and evaluate feedback control and coordination over wireless multi-hop low-power wireless for update intervals of 20 to 50 milliseconds.
Edit intent: clarity
Original:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear physical processes . Using experiments on a cyber-physical testbed with 20 wireless nodes and multiple cart-pole systems, we are the first to demonstrate and evaluate feedback control and coordination over  multi-hop low-power wireless for update intervals of 20 to 50 milliseconds.
Revised:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear physical processes . Using experiments on a cyber-physical testbed with 20 wireless nodes and multiple cart-pole systems, we are the first to demonstrate and evaluate feedback control and coordination over multi-hop networks for update intervals of 20 to 50 milliseconds.
Edit intent: clarity
Original: Signal machines form an abstract and perfect model of collision computing as well as particle/signal/soliton dynamics in cellular automata based on dimensionless signals on a line.
Revised: Signal machines form an abstract and idealised model of collision computing as well as particle/signal/soliton dynamics in cellular automata based on dimensionless signals on a line.
Edit intent: clarity
Original: Signal machines form an abstract and perfect model of collision computing as well as particle/signal/soliton dynamics in cellular automata based on dimensionless signals on a line.
Revised: Signal machines form an abstract and perfect model of collision computing . Based on dimensionless signals on a line.
Edit intent: coherence
Original:  When signals meet  they get replaced by other signals.
Revised:  When signals meet , they get replaced by other signals.
Edit intent: fluency
Original:  A signal machine defines the kind of signals available , their speeds and the rules for replacement . Given any finite set of speeds S, we prove that there exists a signal machine  able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal ( ray of parallel signals inside a support zone) .
Revised:  A signal machine defines the types of available signals , their speeds and the rules for replacement . Given any finite set of speeds S, we prove that there exists a signal machine able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal ( ray of parallel signals inside a support zone) .
Edit intent: clarity
Original:  A signal machine defines the kind of signals available , their speeds and the rules for replacement . Given any finite set of speeds S, we prove that there exists a signal machine  able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal ( ray of parallel signals inside a support zone) .
Revised:  A signal machine defines the kind of signals available , their speeds and the rules for replacement . Given any finite set of speeds S, we construct a signal machine able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal ( ray of parallel signals inside a support zone) .
Edit intent: clarity
Original:  A signal machine defines the kind of signals available , their speeds and the rules for replacement . Given any finite set of speeds S, we prove that there exists a signal machine  able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal ( ray of parallel signals inside a support zone) .
Revised:  A signal machine defines the kind of signals available , their speeds and the rules for replacement . Given any finite set of speeds S, we prove that there exists a signal machine that is able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal ( ray of parallel signals inside a support zone) .
Edit intent: clarity
Original:  A signal machine defines the kind of signals available , their speeds and the rules for replacement . Given any finite set of speeds S, we prove that there exists a signal machine  able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal ( ray of parallel signals inside a support zone) .
Revised:  A signal machine defines the kind of signals available , their speeds and the rules for replacement . Given any finite set of speeds S, we prove that there exists a signal machine able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a macro-signal ( ray of parallel signals inside a support zone) .
Edit intent: clarity
Original:  A signal machine defines the kind of signals available , their speeds and the rules for replacement . Given any finite set of speeds S, we prove that there exists a signal machine  able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal ( ray of parallel signals inside a support zone) .
Revised:  A signal machine defines the kind of signals available , their speeds and the rules for replacement . Given any finite set of speeds S, we prove that there exists a signal machine able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal , a ray of parallel signals inside a support zone) .
Edit intent: fluency
Original:  A signal machine defines the kind of signals available , their speeds and the rules for replacement . Given any finite set of speeds S, we prove that there exists a signal machine  able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal ( ray of parallel signals inside a support zone) .
Revised:  A signal machine defines the kind of signals available , their speeds and the rules for replacement . Given any finite set of speeds S, we prove that there exists a signal machine able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a large macro-signal ( ray of parallel signals .
Edit intent: clarity
Original:  The simulation of a collision ( macro-collision ) consists of two phases.
Revised:  The simulation of a collision , a macro-collision ) consists of two phases.
Edit intent: fluency
Original:  The simulation of a collision ( macro-collision ) consists of two phases.
Revised:  The simulation of a collision ( macro-collision , consists of two phases.
Edit intent: fluency
Original:  In the first phase, macro-signals are shrunk-to get some delay-then involved macro-signals  are identified and it is ensured that no other macro-signal is too close.
Revised:  In the first phase, macro-signals are shrunk, then the macro-signals are identified and it is ensured that no other macro-signal is too close.
Edit intent: coherence
Original:  In the first phase, macro-signals are shrunk-to get some delay-then involved macro-signals  are identified and it is ensured that no other macro-signal is too close.
Revised:  In the first phase, macro-signals are shrunk-to get some delay-then involved macro-signals are identified and it is ensured that no other macro-signal comes too close.
Edit intent: clarity
Original:  If not , the process is aborted and the relative distance between shrunk macro-signals was enlarge so that the correct macro-collision will eventually be  initiated.
Revised:  If not , the process is aborted and the macro-signals was enlarge so that the correct macro-collision will eventually be initiated.
Edit intent: clarity
Original:  If not , the process is aborted and the relative distance between shrunk macro-signals was enlarge so that the correct macro-collision will eventually be  initiated.
Revised:  If not , the process is aborted and the relative distance between shrunk macro-signals are shrunk, so that the correct macro-collision will eventually be initiated.
Edit intent: clarity
Original:  Varying the set of speeds generates an intrinsically universal family of signal machines.
Revised:  Considering all finite set of speeds generates an intrinsically universal family of signal machines.
Edit intent: clarity
Original: Research  produced through international collaboration is often more highly cited than other work, but is it also more novel?
Revised: Research articles produced through international collaboration is often more highly cited than other work, but is it also more novel?
Edit intent: clarity
Original: Research  produced through international collaboration is often more highly cited than other work, but is it also more novel?
Revised: Research produced through international collaboration are more highly cited than other work, but is it also more novel?
Edit intent: clarity
Original: Research  produced through international collaboration is often more highly cited than other work, but is it also more novel?
Revised: Research produced through international collaboration is often more highly cited than other work, but are they also more novel?
Edit intent: clarity
Original:  Using measures of conventionality and novelty developed by Uzzi et al. (2013)  and replicated by Boyack and Klavans ( 2013), we test for novelty and conventionality in international research collaboration.
Revised:  Using measures developed by Uzzi et al. (2013) and replicated by Boyack and Klavans ( 2013), we test for novelty and conventionality in international research collaboration.
Edit intent: clarity
Original:  Using measures of conventionality and novelty developed by Uzzi et al. (2013)  and replicated by Boyack and Klavans ( 2013), we test for novelty and conventionality in international research collaboration.
Revised:  Using measures of conventionality and novelty developed by Uzzi et al. (2013) , and replicated by Boyack and Klavans ( 2013), we test for novelty and conventionality in international research collaboration.
Edit intent: fluency
Original:  Others have found that coauthored papers are more novel . Scholars have suggested that diverse groups have a greater chance of producing creative work.
Revised:  Others have found that coauthored articles are more novel . Scholars have suggested that diverse groups have a greater chance of producing creative work.
Edit intent: fluency
Original:  Others have found that coauthored papers are more novel . Scholars have suggested that diverse groups have a greater chance of producing creative work.
Revised:  Others have found that coauthored papers are more novel and have suggested that diverse groups have a greater chance of producing creative work.
Edit intent: coherence
Original:  As such, we expected to find that international collaboration is also more novel . Using data from Web of Science and Scopus in 2005, we failed to show that international collaboration tends to produce more novel articles.
Revised:  As such, we expected to find that international collaboration tends to produce more novel research . Using data from Web of Science and Scopus in 2005, we failed to show that international collaboration tends to produce more novel articles.
Edit intent: clarity
Original:  In fact, international collaboration appeared to produce less novel and more conventional research . Transaction costs and the limits of global communication may be suppressing novelty, while an audience effect may be responsible for higher citation rates.
Revised:  In fact, international collaboration appears to produce less novel and more conventional research . Transaction costs and the limits of global communication may be suppressing novelty, while an audience effect may be responsible for higher citation rates.
Edit intent: fluency
Original:  In fact, international collaboration appeared to produce less novel and more conventional research . Transaction costs and the limits of global communication may be suppressing novelty, while an audience effect may be responsible for higher citation rates.
Revised:  In fact, international collaboration appeared to produce less novel and more conventional knowledge combinations . Transaction costs and the limits of global communication may be suppressing novelty, while an audience effect may be responsible for higher citation rates.
Edit intent: clarity
Original:  In fact, international collaboration appeared to produce less novel and more conventional research . Transaction costs and the limits of global communication may be suppressing novelty, while an audience effect may be responsible for higher citation rates.
Revised:  In fact, international collaboration appeared to produce less novel and more conventional research . Transaction costs and communication barriers to international collaboration may suppress novelty. Higher citations to international work may be explained by an audience effect may be responsible for higher citation rates.
Edit intent: clarity
Original:  More precisely, given any d-dimensional tensor T :\underbrace{[k]\times \ldots [k]}_{d times}\to GF(2) of rank at most t, the bias of the associated d-linear form f_T(X_1,\ldots,X_d) := \sum_{(i_1,\dots,i_d) \in [k]^d} T(i_1,i_2,\ldots, i_d) X_{1,i_1}\cdot X_{1,i_2}\cdots X_{d,i_d} is at most \left(1-1{2^{d-1}}\right)^t.
Revised:  More precisely, given any d-dimensional tensor T :\underbrace{[k]\times \ldots [k]}_{d times}\to GF(2) of rank at most t, the bias of the associated d-linear form f_T(X_1,\ldots,X_d) := \sum_{(i_1,\dots,i_d) \in [k]^d} T(i_1,i_2,\ldots, i_d) X_{1,i_1}\cdot X_{1,i_2}\cdots X_{d,i_d} is at least \left(1-1{2^{d-1}}\right)^t.
Edit intent: fluency
Original:  Due to price impact, even if a price is not arbitrage free, the resulting arbitrage opportunity only exists for limited position sizes, and might be ignored because of hedging considerations.
Revised:  Due to price impact, even if a price is not arbitrage free, the resulting arbitrage opportunity only exists for limited position sizes, and may be ignored if outweighed by hedging considerations.
Edit intent: clarity
Original:  Thus , large positions endogenously arise either as market makers approach risk neutrality, or as the number of market makers becomes large .
Revised:  Therefore , large positions endogenously arise either as market makers approach risk neutrality, or as the number of market makers becomes large .
Edit intent: coherence
Original:  Thus , large positions endogenously arise either as market makers approach risk neutrality, or as the number of market makers becomes large .
Revised:  Thus , large positions endogenously arise in the limit of either market maker risk neutrality, or as the number of market makers becomes large .
Edit intent: clarity
Original:  Thus , large positions endogenously arise either as market makers approach risk neutrality, or as the number of market makers becomes large .
Revised:  Thus , large positions endogenously arise either as market makers approach risk neutrality, or a large number of market makers becomes large .
Edit intent: clarity
Original:  Thus , large positions endogenously arise either as market makers approach risk neutrality, or as the number of market makers becomes large .
Revised:  Thus , large positions endogenously arise either as market makers approach risk neutrality, or as the number of market makers .
Edit intent: clarity
Original:  The generated solver is implemented in Constraint Handling Rules (CHR) extending builtin heap, integer and equality solvers.
Revised:  The generated solver is implemented using a Constraint Handling Rules (CHR) extending builtin heap, integer and equality solvers.
Edit intent: fluency
Original:  The generated solver is implemented in Constraint Handling Rules (CHR) extending builtin heap, integer and equality solvers.
Revised:  The generated solver is implemented in Constraint Handling Rules (CHR) extension of built-in heap, integer and equality solvers.
Edit intent: clarity
Original:  A key property of our program analysis is that the target data-structure properties are shape neutral, i.e.  the analysis does not check for properties relating to a given data-structure graph shape, such as doubly-linked-lists versus trees.
Revised:  A key property of our program analysis is that the target data-structure properties are shape neutral, i.e. , the analysis does not check for properties relating to a given data-structure graph shape, such as doubly-linked-lists versus trees.
Edit intent: fluency
Original:  Nevertheless, the analysis can detect errors in  wide range of data-structure manipulating programs, including those that use lists, trees, DAGs, graphs, etc.
Revised:  Nevertheless, the analysis can detect errors in a wide range of data-structure manipulating programs, including those that use lists, trees, DAGs, graphs, etc.
Edit intent: fluency
Original:  We present an implementation based on a specialized shape neutral constraint solver implemented using the Satisfiability Modulo Constraint Handling Rules (SMCHR) system.
Revised:  We present an implementation that uses the Satisfiability Modulo Constraint Handling Rules (SMCHR) system.
Edit intent: coherence
Original: This paper is devoted to the important yet unexplored subject of crowding effects on market impact, that we call "co-impact".
Revised: This paper is devoted to the important yet unexplored subject of crowding effects on market impact, that we call "co-impact".
Edit intent: fluency
Original:  ~ DBLP:journals/jea/KumarMY03 proposed the open problem "Are there practical methods for computing an MEB with outliers?"
Revised:  DBLP:journals/jea/KumarMY03 proposed the open problem "Are there practical methods for computing an MEB with outliers?"
Edit intent: fluency
Original:  To answer this question, we extend the idea of core-set and present a randomized algorithm for MEB with outliers in high dimension.
Revised:  To answer this question, we present a randomized algorithm for MEB with outliers in high dimension.
Edit intent: coherence