wanyu/IteraTeR_v2 huggingface dataset:
Original:  ii) Enhanced loco-manipulation capabilities that do not compromise the worker mobility.
Revised:  ii) A simplistic communication channel via a simple buttons board that allows controlling the robot with one hand only; iii) The interface offers enhanced loco-manipulation capabilities that do not compromise the worker mobility.
Edit intent: coherence
Original:  Thus, our results for the two selected scenarios show that there is a stringent trade-off between the targeted semantic security level and the number of reliably and securely accessible legitimate receivers.
Revised:  Thus, our results for the two selected scenarios reveal that there is a stringent trade-off between the targeted semantic security level and the number of reliably and securely accessible legitimate receivers.
Edit intent: fluency
Original:  Furthermore,  effects of secrecy code parameters and antenna properties on the achievable semantic security levels are illustrated to show directions for possible improvements to guarantee practically-acceptable security levels with PLS methods for industrial indoor THz-wireless communication applications.
Revised:  Furthermore, the effects of secrecy code parameters and antenna properties on the achievable semantic security levels are illustrated to show directions for possible improvements to guarantee practically-acceptable security levels with PLS methods for industrial indoor THz-wireless communication applications.
Edit intent: fluency
Original:  The experimental results demonstrate that the proposed MWDLP framework generates high-fidelity synthetic speech for seen and unseen speakers and/or language on 300 speakers training data including clean and noisy/reverberant conditions, where the number of training utterances is limited to 60 per speaker, while allowing for real-time low-latency processing using a single core of \sim\! 2.1--2.7 ~ GHz CPU with \sim\! 0.57--0.64 real-time factor including input/output and feature extraction.
Revised:  The experimental results demonstrate that the proposed MWDLP framework generates high-fidelity synthetic speech for seen and unseen speakers and/or language on 300 speakers training data including clean and noisy/reverberant conditions, where the number of training utterances is limited to 60 per speaker, while allowing for real-time low-latency processing using a single core of \sim\! 2.1--2.7 GHz CPU with \sim\! 0.57--0.64 real-time factor including input/output and feature extraction.
Edit intent: fluency
Original:  The experimental results demonstrate that the proposed framework achieves high-performance VC, while allowing for LLRT usage with a single-core of 2.1--2.7 ~ GHz CPU on a real-time factor of 0.87--0.95, including input/output, feature extraction, on a frame shift of 10 ms, a window length of 27.5 ms, and 2 lookup frames.
Revised:  The experimental results demonstrate that the proposed framework achieves high-performance VC, while allowing for LLRT usage with a single-core of 2.1--2.7 GHz CPU on a real-time factor of 0.87--0.95, including input/output, feature extraction, on a frame shift of 10 ms, a window length of 27.5 ms, and 2 lookup frames.
Edit intent: fluency
Original:  In this work, we build upon the deep support vector data description algorithm and address multi-perspective anomaly detection using three different fusion techniques  i.e.  early fusion, late fusion, and late fusion with multiple decoders.
Revised:  In this work, we build upon the deep support vector data description algorithm and address multi-perspective anomaly detection using three different fusion techniques , i.e. early fusion, late fusion, and late fusion with multiple decoders.
Edit intent: fluency
Original:  In this work, we build upon the deep support vector data description algorithm and address multi-perspective anomaly detection using three different fusion techniques  i.e.  early fusion, late fusion, and late fusion with multiple decoders.
Revised:  In this work, we build upon the deep support vector data description algorithm and address multi-perspective anomaly detection using three different fusion techniques i.e. , early fusion, late fusion, and late fusion with multiple decoders.
Edit intent: fluency
Original:  Furthermore, we introduce the dices dataset that %DIF > ).
Revised:  Furthermore, we introduce the dices dataset %DIF > ).
Edit intent: fluency
Original:  Furthermore, we introduce the dices dataset,  consists of over 2000 grayscale images of falling dices from multiple perspectives, with 5\\%DIF < of the images containing rare anomalies (e.g. drill %DIF > of the images containing rare anomalies (e.g., drill holes, sawing, or scratches).
Revised:  Furthermore, we introduce the dices dataset, which consists of over 2000 grayscale images of falling dices from multiple perspectives, with 5\\%DIF < of the images containing rare anomalies (e.g. drill %DIF > of the images containing rare anomalies (e.g., drill holes, sawing, or scratches).
Edit intent: fluency
Original:  The methods developed up to now measure urban morphology with numerical indices describing density, proportion, and mixture, but they do not directly represent morphological features from  human's visual and intuitive perspective.
Revised:  The methods developed up to now measure urban morphology with numerical indices describing density, proportion, and mixture, but they do not directly represent morphological features from the human's visual and intuitive perspective.
Edit intent: fluency
Original:  Nine cities around the world are selected as the study areas and their road networks are acquired from OpenStreetMap.
Revised:  Nine cities around the world are selected as the study areas with their road networks are acquired from OpenStreetMap.
Edit intent: fluency
Original:  Nine cities around the world are selected as the study areas and their road networks are acquired from OpenStreetMap.
Revised:  Nine cities around the world are selected as the study areas and their road networks acquired from OpenStreetMap.
Edit intent: fluency
Original:  Latent subgroups among the cities are uncovered through a clustering on the percentage of each road network category.
Revised:  Latent subgroups among the cities are uncovered through clustering on the percentage of each road network category.
Edit intent: fluency
Original:  In the subsequent part of the paper, we focus on the usability of such classification: the effectiveness of our human perception augmentation is examined by a case study of urban vitality prediction.
Revised:  In the subsequent part of the paper, we focus on the usability of such classification: we apply our method in a case study of urban vitality prediction.
Edit intent: clarity
Original:  however, when equipped with a robust objective, we show the chance constraints can mediate a trade-off between robustness to uncertainty and strict constraint satisfaction and also reduce the solve time compared to using the robust cost alone .
Revised:  however, when equipped with a robust objective, we show the chance constraints can mediate a trade-off between robustness to uncertainty and strict constraint satisfaction .
Edit intent: coherence
Original:  As a result, we } show that register-bounded synthesis from universal register automata over domain (N, <)is { {  decidable in 2ExpTime as in the equality-only case, giving the order for free  }  }   .
Revised:  As a result, we } show that register-bounded synthesis from universal register automata over domain (N, <)is { { decidable in 2ExpTime as in the equality-only case, giving the order for free } } to .
Edit intent: fluency
Original: This paper concerns the problem of reactive synthesis of systems interacting with its environment via letters from an infinite data domain . Register automata and transducers are popular formalisms for specifying and modeling such systems.
Revised: We study reactive synthesis of systems interacting with its environment via letters from an infinite data domain . Register automata and transducers are popular formalisms for specifying and modeling such systems.
Edit intent: clarity
Original: This paper concerns the problem of reactive synthesis of systems interacting with its environment via letters from an infinite data domain . Register automata and transducers are popular formalisms for specifying and modeling such systems.
Revised: This paper concerns the problem of reactive synthesis of systems interacting with environments using infinite alphabets . Register automata and transducers are popular formalisms for specifying and modeling such systems.
Edit intent: clarity
Original: This paper concerns the problem of reactive synthesis of systems interacting with its environment via letters from an infinite data domain . Register automata and transducers are popular formalisms for specifying and modeling such systems.
Revised: This paper concerns the problem of reactive synthesis of systems interacting with its environment via letters from an infinite data domain . Register automata and transducers are popular formalisms for specifying and modelling such systems.
Edit intent: fluency
Original:  They extend finite-state automata by introducing registers that are used to store data and to test incoming data against the stored one.
Revised:  They extend finite-state automata by adding registers to store data and to test incoming data against the stored one.
Edit intent: clarity
Original:  In those synthesis works, however, automata can only compare data for equality , which limits synthesis applications .
Revised:  In those synthesis works, however, automata can only compare data for equality .
Edit intent: clarity
Original:  In this paper, we  introduce the notion of \omega -regular approximable data domains, and show that register-bounded synthesis from universal register automata over such domains is decidable.
Revised:  In this paper, we introduce the notion of \omega -regular approximable data domains, and show that register-bounded synthesis from universal register automata on such domains is decidable.
Edit intent: fluency
Original:  Importantly, the data domain (N, \leq) with natural order is \omega -regular approximable.
Revised:  Importantly, the data domain (N, \leq) with natural order is -regular approximable.
Edit intent: clarity
Original:  Finally, we describe the notion of reducibility between data domains , and reduce synthesis in the domain N^k%DIFDELCMD < } %DIFDELCMD < %%% with partial order \leq^k%DIFDELCMD < } %%% to (N, \leq)^d, =^d, <^d) of tuples of numbers equipped with the component-wise partial order and (\Sigma^*, =, \prec) of finite strings with the prefix relation} .
Revised:  Finally, we describe the notion of reducibility between data domains N^k%DIFDELCMD < } %DIFDELCMD < %%% with partial order \leq^k%DIFDELCMD < } %%% to (N, \leq)^d, =^d, <^d) of tuples of numbers equipped with the component-wise partial order and (\Sigma^*, =, \prec) of finite strings with the prefix relation} .
Edit intent: coherence
Original:  Finally, we describe the notion of reducibility between data domains , and reduce synthesis in the domain N^k%DIFDELCMD < } %DIFDELCMD < %%% with partial order \leq^k%DIFDELCMD < } %%% to (N, \leq)^d, =^d, <^d) of tuples of numbers equipped with the component-wise partial order and (\Sigma^*, =, \prec) of finite strings with the prefix relation} .
Revised:  Finally, we describe the notion of reducibility between data domains , and reduce synthesis in the domain %DIFDELCMD < } %DIFDELCMD < %%% with partial order \leq^k%DIFDELCMD < } %%% to (N, \leq)^d, =^d, <^d) of tuples of numbers equipped with the component-wise partial order and (\Sigma^*, =, \prec) of finite strings with the prefix relation} .
Edit intent: coherence
Original:  Finally, we describe the notion of reducibility between data domains , and reduce synthesis in the domain N^k%DIFDELCMD < } %DIFDELCMD < %%% with partial order \leq^k%DIFDELCMD < } %%% to (N, \leq)^d, =^d, <^d) of tuples of numbers equipped with the component-wise partial order and (\Sigma^*, =, \prec) of finite strings with the prefix relation} .
Revised:  Finally, we describe the notion of reducibility between data domains , and reduce synthesis in the domain N^k%DIFDELCMD < } %DIFDELCMD < %%% \leq^k%DIFDELCMD < } %%% to (N, \leq)^d, =^d, <^d) of tuples of numbers equipped with the component-wise partial order and (\Sigma^*, =, \prec) of finite strings with the prefix relation} .
Edit intent: coherence
Original:  Finally, we describe the notion of reducibility between data domains , and reduce synthesis in the domain N^k%DIFDELCMD < } %DIFDELCMD < %%% with partial order \leq^k%DIFDELCMD < } %%% to (N, \leq)^d, =^d, <^d) of tuples of numbers equipped with the component-wise partial order and (\Sigma^*, =, \prec) of finite strings with the prefix relation} .
Revised:  Finally, we describe the notion of reducibility between data domains , and reduce synthesis in the domain N^k%DIFDELCMD < } %DIFDELCMD < %%% with partial order %DIFDELCMD < } %%% to (N, \leq)^d, =^d, <^d) of tuples of numbers equipped with the component-wise partial order and (\Sigma^*, =, \prec) of finite strings with the prefix relation} .
Edit intent: fluency
Original:  Finally, we describe the notion of reducibility between data domains , and reduce synthesis in the domain N^k%DIFDELCMD < } %DIFDELCMD < %%% with partial order \leq^k%DIFDELCMD < } %%% to (N, \leq)^d, =^d, <^d) of tuples of numbers equipped with the component-wise partial order and (\Sigma^*, =, \prec) of finite strings with the prefix relation} .
Revised:  Finally, we describe the notion of reducibility between data domains , and reduce synthesis in the domain N^k%DIFDELCMD < } %DIFDELCMD < %%% with partial order \leq^k%DIFDELCMD < } %%% (N, \leq)^d, =^d, <^d) of tuples of numbers equipped with the component-wise partial order and (\Sigma^*, =, \prec) of finite strings with the prefix relation} .
Edit intent: coherence
Original:  Our focus is on distributed sampling problem where the robots are operating independent of their teammates, but have the ability to communicate their states to other neighbors with a constraint on the communication range.
Revised:  We focus on the distributed sampling problem where the robots are operating independent of their teammates, but have the ability to communicate their states to other neighbors with a constraint on the communication range.
Edit intent: coherence
Original:  Our focus is on distributed sampling problem where the robots are operating independent of their teammates, but have the ability to communicate their states to other neighbors with a constraint on the communication range.
Revised:  Our focus is on distributed sampling problem where the robots operate independent of their teammates, but have the ability to communicate their states to other neighbors with a constraint on the communication range.
Edit intent: fluency
Original:  Our focus is on distributed sampling problem where the robots are operating independent of their teammates, but have the ability to communicate their states to other neighbors with a constraint on the communication range.
Revised:  Our focus is on distributed sampling problem where the robots are operating independent of their teammates, but have the ability to communicate their current state to other neighbors with a constraint on the communication range.
Edit intent: clarity
Original:  Our focus is on distributed sampling problem where the robots are operating independent of their teammates, but have the ability to communicate their states to other neighbors with a constraint on the communication range.
Revised:  Our focus is on distributed sampling problem where the robots are operating independent of their teammates, but have the ability to communicate their states to other neighbors within a fixed communication range.
Edit intent: clarity
Original:  We design and apply an informed non-myopic path planning technique on multiple robotic platforms to efficiently collect measurements from a spatial field.
Edit intent: coherence
Original:  Our proposed approach is highly adaptive to challenging environments, growing team size , and runs in real-time, which are the key features for any real-world scenario.
Revised:  Our proposed approach is scalable and adaptive to various environmental scenarios, changing robot team configurations , and runs in real-time, which are the key features for any real-world scenario.
Edit intent: clarity
Original:  Our proposed approach is highly adaptive to challenging environments, growing team size , and runs in real-time, which are the key features for any real-world scenario.
Revised:  Our proposed approach is highly adaptive to challenging environments, growing team size , and runs in real-time, which are important features for many real-world scenario.
Edit intent: clarity
Original: To make a modular robotic system both capable and scalable, the controller must be equally as modular as the mechanism . Given the large number of designs that can be generated from even a small set of modules , it becomes impractical to create a new system-wide controller for each design .
Revised: To make a modular robotic system both capable and scalable, the large number of designs that can be generated from even a small set of modules , it becomes impractical to create a new system-wide controller for each design .
Edit intent: clarity
Original: To make a modular robotic system both capable and scalable, the controller must be equally as modular as the mechanism . Given the large number of designs that can be generated from even a small set of modules , it becomes impractical to create a new system-wide controller for each design .
Revised: To make a modular robotic system both capable and scalable, the controller must be equally as modular as the mechanism . Given the large number of designs that can be generated from even a small set of modules .
Edit intent: coherence
Original:  This novel policy is trained with a new model-based reinforcement learning algorithm, which interleaves model learning and trajectory optimization to guide policy learning for multiple designs simultaneously.
Revised:  This novel policy is trained with a new model-based reinforcement learning algorithm, interleaving model learning and trajectory optimization to guide policy learning for multiple designs simultaneously.
Edit intent: coherence
Original:  We show that the policy can then generalize to a larger set of designs not seen during training .
Revised:  We show the modular policy generalizes to a large number of designs that were not seen during training .
Edit intent: clarity
Original:  The numerical resultsalso imply that the optimal privacy in case (i) and (iii) is securer than the one in case (ii) whereas for the optimal privacy, the achievable coding rates in case (ii) and (iii) are smaller than the one in case (i) .
Revised:  Through the numerical results, we clarify the significance of the choice of the encoded set .
Edit intent: clarity
Original:  \% The We design an algorithm which on input F computes the dimension of V. Letting L be the evaluation complexity of F and s=1, it runs using O^\sim \big (L D^{n(d+3)+1}\big ) arithmetic operations in Q and at most D^{n(d+1)} isolations of real roots of polynomials of degree at most D^n.
Revised:  We design an algorithm which on input F computes the dimension of V. Letting L be the evaluation complexity of F and s=1, it runs using O^\sim \big (L D^{n(d+3)+1}\big ) arithmetic operations in Q and at most D^{n(d+1)} isolations of real roots of polynomials of degree at most D^n.
Edit intent: coherence
Original:  Our algorithm depends on the real geometry of V;
Revised:  Our algorithm depends on the real geometry of V;
Edit intent: fluency
Original:  In the second problem, only the head is known  and a desired model for the whole system is given.
Revised:  In the second problem, only the head is known , and a desired model for the whole system is given.
Edit intent: fluency
Original:  We give a polynomial time algorithm that computes whether such a tail exists, whereas methods developed for general unknown component equations take exponential time.
Revised:  We show that, while it is possible to decide in polynomial time whether such a tail exists, whereas methods developed for general unknown component equations take exponential time.
Edit intent: clarity
Original:  However, we also show that there are instances of the problem where the size of the tail is bounded from bellow by an exponential function in the sizes of the head and the desired system.
Revised:  However, we also show that there are instances where its size is exponential in the sizes of the head and the desired system.
Edit intent: clarity
Original:  Among the results, anti-vaxxers more frequently conducted reply behavior to other clusters, especially to neutral accounts, and the content of their replies was significantly toxic and emotional.
Revised:  Among the results, anti-vaxxers more frequently conducted reply behavior with other clusters, especially to neutral accounts, and the content of their replies was significantly toxic and emotional.
Edit intent: clarity
Original:  Furthermore, the most-targeted users were so-called "decent" accounts with large numbers of followers  , including accounts related to health care or representing scientists, policymakers , or media figures or outlets.
Revised:  Furthermore, the most-targeted users were so-called "decent" accounts with large numbers of followers , including accounts that relate to health care or representing scientists, policymakers , or media figures or outlets.
Edit intent: clarity
Original:  Furthermore, the most-targeted users were so-called "decent" accounts with large numbers of followers  , including accounts related to health care or representing scientists, policymakers , or media figures or outlets.
Revised:  Furthermore, the most-targeted users were so-called "decent" accounts with large numbers of followers , including accounts related to health care or represent scientists, policy-makers , or media figures or outlets.
Edit intent: clarity
Original:  We discussed and evaluated the effectiveness of these reply strategies , as well as the possible countermeasures to them.
Revised:  We discussed how their reply behaviors are effective in spreading their beliefs , as well as the possible countermeasures to them.
Edit intent: clarity
Original:  We discussed and evaluated the effectiveness of these reply strategies , as well as the possible countermeasures to them.
Revised:  We discussed and evaluated the effectiveness of these reply strategies , as well as possible countermeasures to them.
Edit intent: fluency
Original:  Those findings should prove useful for developing guidelines for pro-vaxxers and fact-checkers in online communities .
Revised:  Those findings should prove useful for pro-vaxxers and fact-checkers in online communities .
Edit intent: clarity
Original:  Those findings should prove useful for developing guidelines for pro-vaxxers and fact-checkers in online communities .
Revised:  Those findings should prove useful for developing guidelines for pro-vaxxers and platformers to promote trusted information while reducing the effect of vaccine disinformation .
Edit intent: clarity
Original:  Unlike standard structures where a single prediction is made, we adopt encoder-decoder models with sequence-to-sequence and Attention mechanisms , to generate a forecasting path.
Revised:  Unlike standard structures where a single prediction is made, we adopt encoder-decoder models with sequence-to-sequence and Attention mechanisms to generate a forecasting path.
Edit intent: fluency
Original:  Given that encoder-decoder models rely on recurrent neural layers, they generally suffer from a slow training process .
Revised:  Given that encoder-decoder models rely on recurrent neural layers, they generally suffer from slow training processes .
Edit intent: fluency
Original:  In 1981, Myerson answered this question with an emphatic "No" for a monopolist selling a single product .
Revised:  In 1981, Myerson answered this question with an emphatic ``No'' for a monopolist selling a single product .
Edit intent: fluency