wanyu/IteraTeR_v2 huggingface dataset:
Original:  but secondly, SAC algorithms can achieve a polynomial reduction of the complexity of the uniform search . Under the error-successive-level independence condition, we show that a super-polynomial reduction of the complexity can be achieved.
Revised:  but secondly, SAC algorithms can achieve a polynomial reduction of the complexity of the uniform search . Under the error-successive-level independence condition, we show that a super-polynomial speedup can be achieved.
Edit intent: clarity
Original:  This work only touches the surface of the sample-and-learning framework, of which the power under other conditions is still open.
Revised:  This work only touches the surface of the framework. Its power under other conditions is still open.
Edit intent: clarity
Original: Networked control systems (NCS) are spatially-distributed systems in which communication between sensors, controllers, and actuators is supported by a shared communication network that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non-idealities.
Revised: Networked control systems (NCS) due to their high architecture flexibility and low installation and maintenance costs. In a NCS, communication between sensors, controllers, and actuators is supported by a shared communication network that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non-idealities.
Edit intent: coherence
Original: Networked control systems (NCS) are spatially-distributed systems in which communication between sensors, controllers, and actuators is supported by a shared communication network that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non-idealities.
Revised: Networked control systems (NCS) are spatially-distributed systems in which communication between sensors, controllers, and actuators is supported by a shared communication channel that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non-idealities.
Edit intent: clarity
Original:  This work investigates the problem of constructively deriving symbolic models of NCS by simultaneously considering the mentioned network non-idealities .
Revised:  This work investigates those complex objectives by constructively deriving symbolic models of NCS by simultaneously considering the mentioned network non-idealities .
Edit intent: clarity
Original:  This work investigates the problem of constructively deriving symbolic models of NCS by simultaneously considering the mentioned network non-idealities .
Revised:  This work investigates the problem of constructively deriving symbolic models of NCS , while encompassing the mentioned network non-idealities .
Edit intent: clarity
Original:  In a NCS , communication between sensors, controllers, and actuators is supported by a shared communication channel that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non idealities leading to numerous technical challenges.
Revised:  In wireless NCS the communication between sensors, controllers, and actuators is supported by a shared communication channel that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non idealities leading to numerous technical challenges.
Edit intent: clarity
Original:  In a NCS , communication between sensors, controllers, and actuators is supported by a shared communication channel that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non idealities leading to numerous technical challenges.
Revised:  In a NCS , communication between sensors, controllers, and actuators is supported by a communication channel that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non idealities leading to numerous technical challenges.
Edit intent: clarity
Original:  In a NCS , communication between sensors, controllers, and actuators is supported by a shared communication channel that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non idealities leading to numerous technical challenges.
Revised:  In a NCS , communication between sensors, controllers, and actuators is supported by a shared communication channel that is likely to introduce variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non idealities leading to numerous technical challenges.
Edit intent: clarity
Original:  In a NCS , communication between sensors, controllers, and actuators is supported by a shared communication channel that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non idealities leading to numerous technical challenges.
Revised:  In a NCS , communication between sensors, controllers, and actuators is supported by a shared communication channel that is subject to variable communication delays, packet losses, limited bandwidth, and other practical non idealities leading to numerous technical challenges.
Edit intent: clarity
Original:  In a NCS , communication between sensors, controllers, and actuators is supported by a shared communication channel that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non idealities leading to numerous technical challenges.
Revised:  In a NCS , communication between sensors, controllers, and actuators is supported by a shared communication channel that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non-idealities leading to numerous technical challenges.
Edit intent: fluency
Original:  Although stability properties of NCS have been investigated extensively in the past few years, there exist no remarkable results for NCS dealing with more complex and general objectives, such as verification or (controller ) synthesis for logical specifications  .
Revised:  Although stability properties of NCS have been investigated extensively , in the literature results for NCS dealing with more complex and general objectives, such as verification or (controller ) synthesis for logical specifications .
Edit intent: clarity
Original:  Although stability properties of NCS have been investigated extensively in the past few years, there exist no remarkable results for NCS dealing with more complex and general objectives, such as verification or (controller ) synthesis for logical specifications  .
Revised:  Although stability properties of NCS have been investigated extensively in the past few years, there exist no remarkable results for NCS under more complex and general objectives, such as verification or (controller ) synthesis for logical specifications .
Edit intent: clarity
Original:  Although stability properties of NCS have been investigated extensively in the past few years, there exist no remarkable results for NCS dealing with more complex and general objectives, such as verification or (controller ) synthesis for logical specifications  .
Revised:  Although stability properties of NCS have been investigated extensively in the past few years, there exist no remarkable results for NCS dealing with more complex and general objectives, and in particular results dealing with verification or controller synthesis for logical specifications .
Edit intent: clarity
Original:  This work investigates those complex objectives by constructively deriving symbolic models of NCS, while encompassing the mentioned network non-idealities : the obtained abstracted models can be employed to synthesize hybrid controllers enforcing rich logical specifications over NCS . Examples of such  specifications include properties expressed as formulae in linear temporal logic (LTL) or as automata on infinite strings , as evidenced in a final example .
Revised:  This work investigates how to address such complex objectives by constructively deriving symbolic models of NCS, while encompassing the mentioned network non-idealities : the obtained abstracted models can be employed to synthesize hybrid controllers enforcing rich logical specifications over NCS . Examples of such specifications include properties expressed as formulae in linear temporal logic (LTL) or as automata on infinite strings , as evidenced in a final example .
Edit intent: clarity
Original:  This work investigates those complex objectives by constructively deriving symbolic models of NCS, while encompassing the mentioned network non-idealities : the obtained abstracted models can be employed to synthesize hybrid controllers enforcing rich logical specifications over NCS . Examples of such  specifications include properties expressed as formulae in linear temporal logic (LTL) or as automata on infinite strings , as evidenced in a final example .
Revised:  This work investigates those complex objectives by constructively deriving symbolic models of NCS, while encompassing the mentioned network non-idealities . The obtained abstracted (symbolic) models can then be employed to synthesize hybrid controllers enforcing rich logical specifications over NCS . Examples of such specifications include properties expressed as formulae in linear temporal logic (LTL) or as automata on infinite strings , as evidenced in a final example .
Edit intent: clarity
Original:  This work investigates those complex objectives by constructively deriving symbolic models of NCS, while encompassing the mentioned network non-idealities : the obtained abstracted models can be employed to synthesize hybrid controllers enforcing rich logical specifications over NCS . Examples of such  specifications include properties expressed as formulae in linear temporal logic (LTL) or as automata on infinite strings , as evidenced in a final example .
Revised:  This work investigates those complex objectives by constructively deriving symbolic models of NCS, while encompassing the mentioned network non-idealities : the obtained abstracted models can be employed to synthesize hybrid controllers enforcing rich logical specifications over the concrete NCS models . Examples of such specifications include properties expressed as formulae in linear temporal logic (LTL) or as automata on infinite strings , as evidenced in a final example .
Edit intent: clarity
Original:  This work investigates those complex objectives by constructively deriving symbolic models of NCS, while encompassing the mentioned network non-idealities : the obtained abstracted models can be employed to synthesize hybrid controllers enforcing rich logical specifications over NCS . Examples of such  specifications include properties expressed as formulae in linear temporal logic (LTL) or as automata on infinite strings , as evidenced in a final example .
Revised:  This work investigates those complex objectives by constructively deriving symbolic models of NCS, while encompassing the mentioned network non-idealities : the obtained abstracted models can be employed to synthesize hybrid controllers enforcing rich logical specifications over NCS . Examples of such general specifications include properties expressed as formulae in linear temporal logic (LTL) or as automata on infinite strings , as evidenced in a final example .
Edit intent: clarity
Original:  Although stability properties of NCS have been investigated extensively , in the literature  results for NCS under more complex and general objectives, and in particular results dealing with verification or controller synthesis for logical specifications, are much more limited.
Revised:  Although stability properties of NCS have been investigated extensively in the literature results for NCS under more complex and general objectives, and in particular results dealing with verification or controller synthesis for logical specifications, are much more limited.
Edit intent: fluency
Original:  Although stability properties of NCS have been investigated extensively , in the literature  results for NCS under more complex and general objectives, and in particular results dealing with verification or controller synthesis for logical specifications, are much more limited.
Revised:  Although stability properties of NCS have been investigated extensively , in the literature , results for NCS under more complex and general objectives, and in particular results dealing with verification or controller synthesis for logical specifications, are much more limited.
Edit intent: fluency
Original: This paper is a contribution to the study of regular languages defined by fragments of first order or even monadic second order logic .
Revised: We investigate the decidability of the definability problem for fragments of first order or even monadic second order logic .
Edit intent: clarity
Original:  BigOP is part of an open-source big data benchmarking project, BigDataBench (available at URL BigOP's abstraction model not only guides the development of BigDataBench, but also enables automatic generation of tests with comprehensive workloads.
Revised:  BigOP is part of an open-source big data benchmarking project, BigDataBench . BigOP's abstraction model not only guides the development of BigDataBench, but also enables automatic generation of tests with comprehensive workloads.
Edit intent: coherence
Original:  Existing minmax regret models consider only deterministic solutions/strategies, and minmax regret versions of most polynomial solvable problems are NP-hard.
Revised:  The existing minmax regret model considers only deterministic solutions/strategies, and minmax regret versions of most polynomial solvable problems are NP-hard.
Edit intent: fluency
Original:  leading to sudden qualitative and sometimes irreversible regime shifts \mbox{ Schefferetal,Lentonetal development of early warning signals is recognized as a major challenge \mbox{ BoettingerRossHastings . Recent progress \mbox{ CarpenterBrock,KuehnCT1,AshwinWieczorekVitoloCox builds on a mathematical framework in which the real-world system at hand is described by a low-dimensional equation system that captures the dynamics in terms of a small number of key variables .
Revised:  leading to sudden qualitative and sometimes irreversible regime shifts . The development of early warning signals is recognized as a major challenge \mbox{ BoettingerRossHastings . Recent progress \mbox{ CarpenterBrock,KuehnCT1,AshwinWieczorekVitoloCox builds on a mathematical framework in which the real-world system at hand is described by a low-dimensional equation system that captures the dynamics in terms of a small number of key variables .
Edit intent: fluency
Original:  leading to sudden qualitative and sometimes irreversible regime shifts \mbox{ Schefferetal,Lentonetal development of early warning signals is recognized as a major challenge \mbox{ BoettingerRossHastings . Recent progress \mbox{ CarpenterBrock,KuehnCT1,AshwinWieczorekVitoloCox builds on a mathematical framework in which the real-world system at hand is described by a low-dimensional equation system that captures the dynamics in terms of a small number of key variables .
Revised:  leading to sudden qualitative and sometimes irreversible regime shifts \mbox{ Schefferetal,Lentonetal development of early warning signals is recognized as a major challenge . Recent progress \mbox{ CarpenterBrock,KuehnCT1,AshwinWieczorekVitoloCox builds on a mathematical framework in which the real-world system at hand is described by a low-dimensional equation system that captures the dynamics in terms of a small number of key variables .
Edit intent: clarity
Original:  leading to sudden qualitative and sometimes irreversible regime shifts \mbox{ Schefferetal,Lentonetal development of early warning signals is recognized as a major challenge \mbox{ BoettingerRossHastings . Recent progress \mbox{ CarpenterBrock,KuehnCT1,AshwinWieczorekVitoloCox builds on a mathematical framework in which the real-world system at hand is described by a low-dimensional equation system that captures the dynamics in terms of a small number of key variables .
Revised:  leading to sudden qualitative and sometimes irreversible regime shifts \mbox{ Schefferetal,Lentonetal development of early warning signals is recognized as a major challenge \mbox{ BoettingerRossHastings . Recent progress \mbox{ CarpenterBrock,KuehnCT1,AshwinWieczorekVitoloCox builds on a mathematical framework in which a real-world system at hand is described by a low-dimensional equation system that captures the dynamics in terms of a small number of key variables .
Edit intent: fluency
Original:  leading to sudden qualitative and sometimes irreversible regime shifts \mbox{ Schefferetal,Lentonetal development of early warning signals is recognized as a major challenge \mbox{ BoettingerRossHastings . Recent progress \mbox{ CarpenterBrock,KuehnCT1,AshwinWieczorekVitoloCox builds on a mathematical framework in which the real-world system at hand is described by a low-dimensional equation system that captures the dynamics in terms of a small number of key variables .
Revised:  leading to sudden qualitative and sometimes irreversible regime shifts \mbox{ Schefferetal,Lentonetal development of early warning signals is recognized as a major challenge \mbox{ BoettingerRossHastings . Recent progress \mbox{ CarpenterBrock,KuehnCT1,AshwinWieczorekVitoloCox builds on a mathematical framework in which the real-world system is described by a low-dimensional equation system that captures the dynamics in terms of a small number of key variables .
Edit intent: clarity
Original:  leading to sudden qualitative and sometimes irreversible regime shifts \mbox{ Schefferetal,Lentonetal development of early warning signals is recognized as a major challenge \mbox{ BoettingerRossHastings . Recent progress \mbox{ CarpenterBrock,KuehnCT1,AshwinWieczorekVitoloCox builds on a mathematical framework in which the real-world system at hand is described by a low-dimensional equation system that captures the dynamics in terms of a small number of key variables .
Revised:  leading to sudden qualitative and sometimes irreversible regime shifts \mbox{ Schefferetal,Lentonetal development of early warning signals is recognized as a major challenge \mbox{ BoettingerRossHastings . Recent progress \mbox{ CarpenterBrock,KuehnCT1,AshwinWieczorekVitoloCox builds on a mathematical framework in which the real-world system at hand is described by a low-dimensional equation system with a small number of key variables .
Edit intent: clarity
Original:  in a range of examples, including network models of epidemics \mbox{ GrossDLimaBlasius0pt and cooperation \mbox{ \cite{ZschalerTraulsenGross} }\hspace{0pt} and epidemiological data\mbox{ \cite{BjornstadFinkenstaedtGrenfell,GrenfellBjornstadFinkenstaedt}}\hspace{0pt} }  . This work thus establishes a connection between critical transitions and network science and provides an early warning sign for a new type of critical transition that could be relevant for many real world systems.
Revised:  in a range of examples, including network models of epidemics \mbox{ GrossDLimaBlasius0pt and cooperation \mbox{ \cite{ZschalerTraulsenGross} }\hspace{0pt} and epidemiological data\mbox{ \cite{BjornstadFinkenstaedtGrenfell,GrenfellBjornstadFinkenstaedt}}\hspace{0pt} } . This work thus establishes a connection from critical transitions to networks and an early warning sign for a new type of critical transition that could be relevant for many real world systems.
Edit intent: clarity
Original:  In particular, in the light of the perspective to move to more complex models and utilize big data sources it can be anticipated that this new type of transition will be encountered frequently in the future.
Revised:  In particular, in the light of the perspective to move to more complex models and big data we anticipate that saddle-transitions will be encountered frequently in the future.
Edit intent: clarity
Original:  D. simulans shows an excess of whole gene duplications and an excess of high frequency variants on the X chromosome, consistent with adaptive evolution through duplications on the D. simulans X  . We identify 79 chimeric genes in D. yakuba and 38 chimeric genes in D. simulans, as well as 143 cases of recruited non-coding sequence in D. yakuba and 96 in D. simulans, in agreement with rates of chimeric gene origination in D. melanogaster.
Revised:  D. simulans shows larger numbers of whole gene duplications and an excess of high frequency variants on the X chromosome, consistent with adaptive evolution through duplications on the D. simulans X . We identify 79 chimeric genes in D. yakuba and 38 chimeric genes in D. simulans, as well as 143 cases of recruited non-coding sequence in D. yakuba and 96 in D. simulans, in agreement with rates of chimeric gene origination in D. melanogaster.
Edit intent: clarity
Original:  In the method, a regularization term is incorporated in the optimization problem that significantly improves the estimation accuracy and at the same time makes it robust to inaccuracies in the positions of the location-aware nodes and the distances between the nodes.
Revised:  In the method, a regularization term is incorporated in the optimization problem leading to significant improvement in the estimation accuracy and at the same time makes it robust to inaccuracies in the positions of the location-aware nodes and the distances between the nodes.
Edit intent: clarity
Original:  In the method, a regularization term is incorporated in the optimization problem that significantly improves the estimation accuracy and at the same time makes it robust to inaccuracies in the positions of the location-aware nodes and the distances between the nodes.
Revised:  In the method, a regularization term is incorporated in the optimization problem that significantly improves the estimation accuracy even in the presence of position errors of the location-aware nodes and the distances between the nodes.
Edit intent: clarity
Original:  In the method, a regularization term is incorporated in the optimization problem that significantly improves the estimation accuracy and at the same time makes it robust to inaccuracies in the positions of the location-aware nodes and the distances between the nodes.
Revised:  In the method, a regularization term is incorporated in the optimization problem that significantly improves the estimation accuracy and at the same time makes it robust to inaccuracies in the positions of the location-aware nodes and distance errors between the nodes.
Edit intent: clarity
Original:  Experimental comparisons with state-of-the-art competing methods show that the proposed method is more robust, yielding node positions that are much more accurate  .
Revised:  Experimental comparisons with state-of-the-art competing methods show that the proposed method yields node positions that are much more accurate .
Edit intent: clarity
Original: In 2000, Elekes and R\'onyai ER00%DIFDELCMD < ] %%% considered the following problem.
Revised: In ER00%DIFDELCMD < ] %%% considered the following problem.
Edit intent: clarity
Original: In 2000, Elekes and R\'onyai ER00%DIFDELCMD < ] %%% considered the following problem.
Revised: In 2000, Elekes and R\'onyai %DIFDELCMD < ] %%% considered the following problem.
Edit intent: fluency