wanyu/IteraTeR_v2 huggingface dataset:
Original: Version 1 of this preprint did not introduce new mathematical ideas, it was more a state of the art June 2021 picture about solving polynomial systems efficiently by reconstructing a rational univariate representation (rur) with a very high probability of correctness using Groebner revlex computation, Berlekamp-Massey algorithm and Hankel linear system solving modulo several primes in parallel.
Revised: Version 1 of this preprint did not introduce new mathematical ideas, it was more a state of the art June 2021 picture about solving polynomial systems efficiently by reconstructing a rational univariate representation (rur) using Groebner revlex computation, Berlekamp-Massey algorithm and Hankel linear system solving modulo several primes in parallel.
Edit intent: coherence
Original: These algorithms are implemented in URL (\mbox{ giac since version 1.7.0-13 or 1.7.0-17 for certification, it has (July 2021) leading performances on multiple CPU, at least for an open-source software.
Revised: These algorithms are implemented in URL since version 1.7.0-13 or 1.7.0-17 for certification, it has (July 2021) leading performances on multiple CPU, at least for an open-source software.
Edit intent: coherence
Original: We introduce a notion of polynomial input-to-state stability  for infinite-dimensional linear systems.
Revised: We introduce a notion of polynomial input-to-state stability , for infinite-dimensional linear systems.
Edit intent: fluency
Original:  In the fourth stage, the submodels estimated in Stage ~ 2 are brought to a common basis by applying a novel basis transformation method which is necessary before performing output predictions to given inputs.
Revised:  In the fourth stage, the submodels estimated in Stage 2 are brought to a common basis by applying a novel basis transformation method which is necessary before performing output predictions to given inputs.
Edit intent: fluency
Original:  We prove that for all n \ge 1, there exists a k-colourable weakly chordal G graph where R_{k+n}(G) is disconnected, answering an open question of Feghali and Fiala.
Revised:  We prove that for all n \ge 1, there exists a k-colourable weakly chordal graph G where R_{k+n}(G) is disconnected, answering an open question of Feghali and Fiala.
Edit intent: fluency
Original:  Experimental results on three benchmark datasets , namely TREC-QA, WikiQA, and ANTIQUE, show that our method significantly improves the performance of ranking models by making full use of existing labeled data and can be easily applied to different ranking models.
Revised:  Experimental results on three benchmark datasets show that our method significantly improves the performance of ranking models by making full use of existing labeled data and can be easily applied to different ranking models.
Edit intent: clarity
Original:  Using a simple machine learning algorithm after spike encoding, we report performance higher than the state-of-the-art spiking neural networks on two open-source datasets for hand gesture recognition . Surface electromyogram (sEMG) signals result from muscle movement and hence they are an ideal candidate for benchmarking event-driven sensing and computing .
Revised:  Using a simple machine learning algorithm after spike encoding, we report performance higher than the state-of-the-art spiking neural networks on two open-source datasets for hand gesture recognition .
Edit intent: coherence
Original: Motivated by the emergence of power systems that consist of HVAC and HVDC subgrids this work focuses on grid-forming (GFM) control of Interconnecting Power Converters (IPCs) that are the key elements for connecting HVAC and HVDC systems .
Revised: This work focuses on grid-forming (GFM) control of Interconnecting Power Converters (IPCs) that are the key elements for connecting HVAC and HVDC systems .
Edit intent: clarity
Original: Motivated by the emergence of power systems that consist of HVAC and HVDC subgrids this work focuses on grid-forming (GFM) control of Interconnecting Power Converters (IPCs) that are the key elements for connecting HVAC and HVDC systems .
Revised: Motivated by the emergence of power systems that consist of HVAC and HVDC subgrids this work focuses on grid-forming (GFM) control of Interconnecting Power Converters (IPCs) that are used to interconnect multiple HVAC and HVDC systems .
Edit intent: clarity
Original:  This tutorial will provide a conceptual map of the data management tasks underlying these developments, paying particular attention to data models and query languages for graphs.
Revised:  The goal of this document is to provide a conceptual map of the data management tasks underlying these developments, paying particular attention to data models and query languages for graphs.
Edit intent: clarity
Original:  In this paper, we provide an accuracy analysis for cases with general utility functions and two timescale factors by constructing sub- and super-solutions to the fully nonlinear problem such that their difference is at the desired level of accuracy.
Revised:  In this paper, we provide an accurate analysis for cases with general utility functions and two timescale factors by constructing sub- and super-solutions to the fully nonlinear problem such that their difference is at the desired level of accuracy.
Edit intent: fluency
Original:  In this paper, we provide an accuracy analysis for cases with general utility functions and two timescale factors by constructing sub- and super-solutions to the fully nonlinear problem such that their difference is at the desired level of accuracy.
Revised:  In this paper, we provide an accuracy analysis for cases with general utility functions and two timescale factors by constructing sub- and super-solutions to the fully nonlinear problem so that their difference is at the desired level of accuracy.
Edit intent: fluency
Original:  (i) NP-completeness already for the case |D|=2 with only unit demands and capacities and no edge costs, and fixed-parameter tractability if there are no capacities, (ii) a fixed-parameter tractable O^{\star}(k^{O(k)}) time algorithm for the general case, and a kernel of size polynomial in k for the special case of Many Visits TSP, (iii) an |V(G)|^{O(tw)} time algorithm and a matching |V(G)|^{o(tw)} time conditional lower bound conditioned on the Exponential Time Hypothesis.
Revised:  (i) NP-completeness already for the case |D|=2 with only unit demands and capacities and no edge costs, and fixed-parameter tractability if there are no capacities, (ii) a fixed-parameter tractable O^{\star}(k^{O(k)}) time algorithm for the general case, and a kernel of size polynomial in k for the special case of Many Visits TSP, (iii) a |V(G)|^{O(tw)} time algorithm and a matching |V(G)|^{o(tw)} time conditional lower bound conditioned on the Exponential Time Hypothesis.
Edit intent: fluency
Original: This paper presents an online evolving neural network-based inverse dynamics learning controller for an autonomous vehicles' longitudinal and lateral control under model uncertainties and disturbances.
Revised: This paper presents an online evolving neural network-based inverse dynamics learning controller for an autonomous vehicle's longitudinal and lateral control under model uncertainties and disturbances.
Edit intent: fluency
Original:  The decoder is trained to extract the Wyner's common information between the input image and the correlated image from the latter.
Revised:  The decoder is trained to extract the common information between the input image and the correlated image from the latter.
Edit intent: clarity
Original:  The decoder is trained to extract the Wyner's common information between the input image and the correlated image from the latter.
Revised:  The decoder is trained to extract the Wyner's common information between the input image and the correlated image , using only the latter.
Edit intent: clarity
Original: This paper presents a novel fingerprinting methodology for the Intellectual Property protection of generative models . Prior solutions for discriminative models usually adopt adversarial examples as the fingerprints, which give anomalous inference behaviors and prediction results.
Revised: This paper presents a novel fingerprinting scheme for the Intellectual Property protection of generative models . Prior solutions for discriminative models usually adopt adversarial examples as the fingerprints, which give anomalous inference behaviors and prediction results.
Edit intent: clarity
Original: This paper presents a novel fingerprinting methodology for the Intellectual Property protection of generative models . Prior solutions for discriminative models usually adopt adversarial examples as the fingerprints, which give anomalous inference behaviors and prediction results.
Revised: This paper presents a novel fingerprinting methodology for the Intellectual Property protection of generative models . Prior solutions for classification models adopt adversarial examples as the fingerprints, which give anomalous inference behaviors and prediction results.
Edit intent: clarity
Original: We show that quantum algorithms of time T and space S\ge \log T with  intermediate measurements can be simulated by quantum algorithms of time T \cdot poly (S) and space O (S\cdot \log T)  without intermediate measurements.
Revised: We show that quantum algorithms of time T and space S\ge \log T with intermediate measurements can be simulated by quantum algorithms of time T \cdot poly (S) and space O (S\cdot \log T) without intermediate measurements.
Edit intent: fluency
Original:  The best simulations prior to this work required either \Omega(T) space (by the deferred measurement principle) or poly(2^S) time [FR21,GRZ21].
Revised:  The best results prior to this work required either \Omega(T) space (by the deferred measurement principle) or poly(2^S) time [FR21,GRZ21].
Edit intent: clarity
Original:  Results Executional error frequency varies by task and gesture  and correlates with skill level.
Revised:  Results Executional error frequency varies by task and gesture , and correlates with skill level.
Edit intent: fluency
Original:  Conclusions This study provides preliminary evidence that automated error detection can provide context-dependent and quantitative feedback to surgical trainees for performance improvement .
Revised:  Conclusions This study provides preliminary evidence that automated error detection mechanisms and improve training and skill assessment .
Edit intent: clarity
Original:  We also provide QueryTrack-ResNet-50 baseline results on YouTube-VIS-2021 dataset as references for the VIS community.
Revised:  We also provide QueryTrack-ResNet-50 baseline results on YouTube-VIS-2021 val set as references for the VIS community.
Edit intent: clarity
Original:  KrigR allows R-users to (1) download ERA5 and ERA5-Land climate reanalysis data for a user-specified region, and time-length , (2) aggregate these climate products to desired temporal resolutions and metrics, (3) acquire topographical co-variates, and (4) statistically downscale spatial data to a user-specified resolution using co-variate data via kriging.
Revised:  KrigR allows R-users to (1) download ERA5 (-Land) climate reanalysis data for a user-specified region, and time-length , (2) aggregate these climate products to desired temporal resolutions and metrics, (3) acquire topographical co-variates, and (4) statistically downscale spatial data to a user-specified resolution using co-variate data via kriging.
Edit intent: coherence
Original:  KrigR allows R-users to (1) download ERA5 and ERA5-Land climate reanalysis data for a user-specified region, and time-length , (2) aggregate these climate products to desired temporal resolutions and metrics, (3) acquire topographical co-variates, and (4) statistically downscale spatial data to a user-specified resolution using co-variate data via kriging.
Revised:  KrigR allows R-users to (1) download ERA5 and ERA5-Land climate reanalysis data for a user-specified region, and time-period , (2) aggregate these climate products to desired temporal resolutions and metrics, (3) acquire topographical co-variates, and (4) statistically downscale spatial data to a user-specified resolution using co-variate data via kriging.
Edit intent: clarity
Original: The investigation of properties of networks has many applications and is receiving considerable attention.
Edit intent: coherence
Original:  This variatonal family, represented as a neural network, consists in the combination of an attention-based hierarchical encoder feeding summary statistics to a set of normalizing flows.
Revised:  This variational family, represented as a neural network, consists in the combination of an attention-based hierarchical encoder feeding summary statistics to a set of normalizing flows.
Edit intent: fluency
Original:  We also open up several questions that lie at the intersection between SBI techniques and structured Variational Inference  .
Revised:  We also open up several questions that lie at the intersection between SBI techniques , structured Variational Inference .
Edit intent: fluency
Original: Applying artificial neural networks ( ANN) to specific tasks, researchers, programmers, and other specialists usually overshot the number of convolutional layers in their designs.
Revised: When optimizing convolutional neural networks ( ANN) to specific tasks, researchers, programmers, and other specialists usually overshot the number of convolutional layers in their designs.
Edit intent: clarity
Original: Applying artificial neural networks ( ANN) to specific tasks, researchers, programmers, and other specialists usually overshot the number of convolutional layers in their designs.
Revised: Applying artificial neural networks ( CNN) for a specific image-based task, specialists commonly overshoot the number of convolutional layers in their designs.
Edit intent: clarity
Original:  By implication, these ANNs hold too many parameters, which needed unnecessarily trained without impacting the result .
Revised:  By implication, these CNNs are unnecessarily resource intensive to train and deploy, with diminishing beneficial effects on the predictive performance .
Edit intent: clarity
Original:  The features , a convolutional layer can process , are strictly limited by its receptive field.
Revised:  The features a convolutional layer can process , are strictly limited by its receptive field.
Edit intent: fluency
Original:  The features , a convolutional layer can process , are strictly limited by its receptive field.
Revised:  The features , a convolutional layer can process are strictly limited by its receptive field.
Edit intent: fluency
Original:  By layer-wise analyzing the expansion of the receptive fields, we can reliably predict sequences of layers that will not contribute qualitatively to the inference in thegiven ANN architecture.
Revised:  By layer-wise analyzing the size of the receptive fields, we can reliably predict sequences of layers that will not contribute qualitatively to the inference in thegiven ANN architecture.
Edit intent: clarity
Original:  Based on these analyses , we propose design strategies to resolve these inefficiencies, optimizing the explainability and the computational performance of ANNs . Since neither the strategies nor the analysis requires training of the actual model, these insights allow for a very efficient design process of ANNs architectures which might be automated in the future.
Revised:  Based on this analysis , we propose design strategies to resolve these inefficiencies, optimizing the explainability and the computational performance of ANNs . Since neither the strategies nor the analysis requires training of the actual model, these insights allow for a very efficient design process of ANNs architectures which might be automated in the future.
Edit intent: fluency
Original:  Based on these analyses , we propose design strategies to resolve these inefficiencies, optimizing the explainability and the computational performance of ANNs . Since neither the strategies nor the analysis requires training of the actual model, these insights allow for a very efficient design process of ANNs architectures which might be automated in the future.
Revised:  Based on these analyses , we propose design strategies to resolve these inefficiencies, optimize the explainability and the computational performance of ANNs . Since neither the strategies nor the analysis requires training of the actual model, these insights allow for a very efficient design process of ANNs architectures which might be automated in the future.
Edit intent: fluency
Original:  The coherent integration timescale needed here is of 450 s though the available space oscillators cannot offer more than 10 s. Self-calibration methods might solve this issue in an interferometer formed by 3 antenna/satellite system , but the need in the 3rd satellite increases mission costs.
Revised:  The coherent integration time needed here is of 450 s though the available space oscillators cannot offer more than 10 s. Self-calibration methods might solve this issue in an interferometer formed by 3 antenna/satellite system , but the need in the 3rd satellite increases mission costs.
Edit intent: clarity
Original:  The coherent integration timescale needed here is of 450 s though the available space oscillators cannot offer more than 10 s. Self-calibration methods might solve this issue in an interferometer formed by 3 antenna/satellite system , but the need in the 3rd satellite increases mission costs.
Revised:  The coherent integration timescale needed here is 450 s though the available space oscillators cannot offer more than 10 s. Self-calibration methods might solve this issue in an interferometer formed by 3 antenna/satellite system , but the need in the 3rd satellite increases mission costs.
Edit intent: clarity
Original:  The coherent integration timescale needed here is of 450 s though the available space oscillators cannot offer more than 10 s. Self-calibration methods might solve this issue in an interferometer formed by 3 antenna/satellite system , but the need in the 3rd satellite increases mission costs.
Revised:  The coherent integration timescale needed here is of 450 s though the available space oscillators cannot offer more than 10 s. Self-calibration methods might solve this issue in an interferometer formed by 3 antenna/satellite systems , but the need in the 3rd satellite increases mission costs.
Edit intent: fluency
Original:  The coherent integration timescale needed here is of 450 s though the available space oscillators cannot offer more than 10 s. Self-calibration methods might solve this issue in an interferometer formed by 3 antenna/satellite system , but the need in the 3rd satellite increases mission costs.
Revised:  The coherent integration timescale needed here is of 450 s though the available space oscillators cannot offer more than 10 s. Self-calibration methods might solve this issue in an interferometer formed by 3 antenna/satellite system , but the need for the 3rd satellite increases mission costs.
Edit intent: fluency
Original:  The laboratory test set-up is presented and the verification of the temporal stability using standard analysis tool as TimePod is given .
Revised:  The laboratory test set-up is presented and the verification of the temporal stability using standard analysis tool as TimePod has been passed .
Edit intent: clarity
Original:  The obtained coherence in  range of 0.997-0.9998 is beneficial for space VLBI at 557 GHz.
Revised:  The obtained coherence in the range of 0.997-0.9998 is beneficial for space VLBI at 557 GHz.
Edit intent: fluency
Original: The optimal transmission switching problem ( OTSP \otsp ) is an established problem of changing a power grid's topology to obtain an improved operation by controlling the switching status of transmission lines.
Revised: The optimal transmission switching problem ( \otsp ) is an established problem of changing a power grid's topology to obtain an improved operation by controlling the switching status of transmission lines.
Edit intent: clarity
Original:  In this paper, we solve the full OTSP alongside reduced \otsp  instances of it.
Revised:  In this paper, we solve the full \otsp instances of it.
Edit intent: clarity
Original:  A parallel algorithmic architecture is proposed where full OTSP \otsp formulation is run in parallel to another process that generates solutions to be injected into the solution procedure of the full OTSP \otsp during run time.
Revised:  A parallel algorithmic architecture is proposed where full \otsp formulation is run in parallel to another process that generates solutions to be injected into the solution procedure of the full OTSP \otsp during run time.
Edit intent: fluency
Original:  A parallel algorithmic architecture is proposed where full OTSP \otsp formulation is run in parallel to another process that generates solutions to be injected into the solution procedure of the full OTSP \otsp during run time.
Revised:  A parallel algorithmic architecture is proposed where full OTSP \otsp formulation is run in parallel to another process that generates solutions to be injected into the solution procedure of the full \otsp during run time.
Edit intent: fluency
Original: Our research aims to enable automated property verification of deliberative components in robot control architectures.
Revised: In this paper, we enable automated property verification of deliberative components in robot control architectures.
Edit intent: clarity
Original:  We focus on a formalization of the execution context of Behavior Trees (BTs) to provide a scalable, yet formally grounded, methodology to enable runtime verification and prevent unexpected robot behaviors to hamper deployment .
Revised:  We focus on formalizing the execution context of Behavior Trees (BTs) to provide a scalable, yet formally grounded, methodology to enable runtime verification and prevent unexpected robot behaviors to hamper deployment .
Edit intent: fluency
Original:  We focus on a formalization of the execution context of Behavior Trees (BTs) to provide a scalable, yet formally grounded, methodology to enable runtime verification and prevent unexpected robot behaviors to hamper deployment .
Revised:  We focus on a formalization of the execution context of Behavior Trees (BTs) to provide a scalable, yet formally grounded, methodology to enable runtime verification and prevent unexpected robot behaviors .
Edit intent: coherence
Original:  We performed a set of experiments  both on simulations and on the real robot, demonstrating the feasibility of our approach in a realistic application , and its integration in a typical robot software architecture.
Revised:  We performed a set of experiments , both on simulations and on the real robot, demonstrating the feasibility of our approach in a realistic application , and its integration in a typical robot software architecture.
Edit intent: fluency
Original:  We performed a set of experiments  both on simulations and on the real robot, demonstrating the feasibility of our approach in a realistic application , and its integration in a typical robot software architecture.
Revised:  We performed a set of experiments both on simulations and on the real robot, demonstrating the feasibility of our approach in a realistic application and its integration in a typical robot software architecture.
Edit intent: fluency
Original: Development, deployment and maintenance of networked software has been revolutionized by DevOps practices, which boost system software quality and  agile evolution.
Revised: Development, deployment and maintenance of networked software has been revolutionized by DevOps , which have become essential to boost system software quality and agile evolution.
Edit intent: clarity
Original: Development, deployment and maintenance of networked software has been revolutionized by DevOps practices, which boost system software quality and  agile evolution.
Revised: Development, deployment and maintenance of networked software has been revolutionized by DevOps practices, which boost system software quality and to enable agile evolution.
Edit intent: coherence