wanyu/IteraTeR_v2 huggingface dataset:
Original:  Especially in scenarios involving multiple traffic participants that interact densely, autonomous vehicles still struggle to interpret situations and to eventually achieve their own driving goal.
Revised:  Especially in scenarios involving multiple traffic participants that interact densely, autonomous vehicles still struggle to interpret situations and to eventually achieve their own mission goal.
Edit intent: clarity
Original:  We evaluate the scheme numerically within the context of high-order computational fluid-dynamics .
Revised:  We evaluate the scheme numerically within the context of high-order computational fluid dynamics .
Edit intent: fluency
Original:  For both the isentropic convecting vortex and the Taylor--Green vortex test cases  the results are found to be comparable to those without compression.
Revised:  For both the isentropic convecting vortex and the Taylor--Green vortex test cases , the results are found to be comparable to those without compression.
Edit intent: fluency
Original:  We also use linear and non-linear models to predict a specific property based on the other properties .
Revised:  We also use linear and non-linear models to predict a given property based on the other properties .
Edit intent: clarity
Original:  While there has been a lot of progress in MaxSAT solvers during the last decade , the theoretical analysis of MaxSAT inference has not followed the pace.
Revised:  While there has been a lot of research interest in the last decade , the theoretical analysis of MaxSAT inference has not followed the pace.
Edit intent: clarity
Original:  Finally, we show that the strongest system captures the recently proposed concept of Circular Proof while being conceptually simpler, since weights, which are intrinsic in MaxSAT, naturally guarantee the flow condition required for the SAT case .
Revised:  Finally, we show that the strongest system captures the recently proposed concept of circular proof .
Edit intent: coherence
Original:  Under the majority rule model, we observe a phase transition phenomenon, where consensus on the preferred opinion is achieved with high probability only when the initial fraction of agents having the preferred opinion is above a certain threshold.
Revised:  Under the majority rule model, we show that consensus can be achieved on the preferred opinion is achieved with high probability only when the initial fraction of agents having the preferred opinion is above a certain threshold.
Edit intent: clarity
Original:  Under the majority rule model, we observe a phase transition phenomenon, where consensus on the preferred opinion is achieved with high probability only when the initial fraction of agents having the preferred opinion is above a certain threshold.
Revised:  Under the majority rule model, we observe a phase transition phenomenon, where consensus on the preferred opinion with high probability only when the initial fraction of agents having the preferred opinion is above a certain threshold.
Edit intent: clarity
Original:  For the  majority rule model with stubborn agents we find the stationary distribution of opinions in the network in the large system limit using mean field techniques.
Revised:  For the majority rule model when stubborn agents with fixed opinions are present. We find that the stationary distribution of opinions in the network in the large system limit using mean field techniques.
Edit intent: clarity
Original:  Moreover, we demonstrate how one can apply TFQ to tackle advanced quantum learning tasks including meta-learning,  Hamiltonian learning, and sampling thermal states  .
Revised:  Moreover, we demonstrate how one can apply TFQ to tackle advanced quantum learning tasks including meta-learning, Hamiltonian learning, sampling thermal states .
Edit intent: fluency
Original:  As motivation for our model we provide experimental data that assist in illustrating the induced-switching process , and further data on durations of cell cycle phases that guide our model choice .
Revised:  As motivation for our model we provide experimental data that illustrate the induced-switching process , and further data on durations of cell cycle phases that guide our model choice .
Edit intent: clarity
Original:  As motivation for our model we provide experimental data that assist in illustrating the induced-switching process , and further data on durations of cell cycle phases that guide our model choice .
Revised:  As motivation for our model we provide experimental data that assist in illustrating the induced-switching process .
Edit intent: clarity
Original:  We find that the parameters for induced switching are bifurcation parameters and therefore determine the overall dynamics of the model.
Revised:  We find that the parameters for induced switching are bifurcation parameters and therefore determine the long-term behaviour of the model.
Edit intent: clarity
Original:  In this paper, we propose the first end-to-end trainable solution named Deep Light Transport (DeLTra) that estimates radiometrically uncalibrated projector-camera light transport.
Revised:  In this paper, we propose a novel end-to-end trainable solution named Deep Light Transport (DeLTra) that estimates radiometrically uncalibrated projector-camera light transport.
Edit intent: clarity
Original:  This study provides  evidence that NSCLBP appears to affect LLAs during walking and running.
Revised:  This study provides evidence that NSCLBP might affect LLAs during walking and running.
Edit intent: clarity
Original:  Meanwhile, autonomous micro air vehicles still lag far behind their biological counterparts, displaying inferior performance with a much higher energy consumption.
Revised:  Meanwhile, autonomous micro air vehicles still lag far behind their biological counterparts, displaying inferior performance at a much higher energy consumption.
Edit intent: clarity
Original:  In light of this, we want to mimic flying insects in terms of their processing capabilities, and consequently apply gained knowledge to a maneuver of relevance .
Revised:  In light of this, we want to mimic flying insects in terms of their processing capabilities, and consequently show the efficiency of this approach in the real world .
Edit intent: clarity
Original:  This letter does so through evolving spiking neural networks for controlling landings of micro air vehicles using the divergence of the optical flow field of a downward-looking camera.
Revised:  This letter does so through evolving spiking neural networks for controlling landings of micro air vehicles using optical flow divergence from a downward-looking camera.
Edit intent: clarity
Original:  Furthermore, we provide insight into the resources required for successfully solving the problem of divergence-based landing, showing that high-resolution control can potentially be learned with only a single spiking neuron.
Revised:  Furthermore, we provide insight into the resources required for successfully solving the problem of divergence-based landing, showing that high-resolution control can be learned with only a single spiking neuron.
Edit intent: clarity
Original:  To the best of our knowledge, this  is the first work integrating spiking neural networks in the control loop of a real-world flying robot.
Revised:  To the best of our knowledge, this work is the first work integrating spiking neural networks in the control loop of a real-world flying robot.
Edit intent: fluency
Original:  To the best of our knowledge, this  is the first work integrating spiking neural networks in the control loop of a real-world flying robot.
Revised:  To the best of our knowledge, this is the first to integrate spiking neural networks in the control loop of a real-world flying robot.
Edit intent: clarity
Original: For elliptic diffusion equations with random coefficient and source term,  the probability measure of the solution random field is shown to be Lipschitz-continuous in both total variation and Wasserstein distance as a function of the input probability measure.
Revised: For elliptic diffusion equations with random coefficient and source term, for which the probability measure of the solution random field is shown to be Lipschitz-continuous in both total variation and Wasserstein distance as a function of the input probability measure.
Edit intent: clarity
Original:  These results extend to Lipschitz continuous quantities of interest of the solution as well as to coherent risk functionals of those applied to evaluate  their uncertainty.
Revised:  These results extend to Lipschitz continuous quantities of interest of the solution as well as to coherent risk functionals of these applied to evaluate their uncertainty.
Edit intent: fluency
Original:  The established results particularly apply to the case of lognormal diffusions and the truncation of series representations of input random fields.
Revised:  The established results are applied, in particular, to the case of lognormal diffusions and the truncation of series representations of input random fields.
Edit intent: clarity
Original:  The established results particularly apply to the case of lognormal diffusions and the truncation of series representations of input random fields.
Revised:  The established results particularly apply to the case of lognormal diffusion and the truncation of series representations of input random fields.
Edit intent: fluency
Original:  This Gray code can be generated in O(log \Oh ^2 n) amortized time per word, while the best generation algorithm hitherto has O \Oh (n) running time per word.
Revised:  This Gray code can be generated in O(log \Oh ^2 n) amortized time per word, while the best generation algorithm hitherto has \Oh (n) running time per word.
Edit intent: clarity
Original:  Here we present fast algorithms to calculate that variance in arbitrary graphs and forests.
Revised:  Here we present fast algorithms to calculate the variance in arbitrary graphs and forests.
Edit intent: clarity
Original:  Furthermore, the same algorithm can be used to solve the so-called rank-restricted semidefinite relaxations of PGO, a crucial class of non-convex Riemannian optimization problems at the center of recent PGO solvers with global optimality guarantees .
Revised:  Furthermore, ASAPP can be applied on the rank-restricted semidefinite relaxations of PGO, a crucial class of non-convex Riemannian optimization problems at the center of recent PGO solvers with global optimality guarantees .
Edit intent: clarity
Original:  Furthermore, the same algorithm can be used to solve the so-called rank-restricted semidefinite relaxations of PGO, a crucial class of non-convex Riemannian optimization problems at the center of recent PGO solvers with global optimality guarantees .
Revised:  Furthermore, the same algorithm can be used to solve the so-called rank-restricted relaxations of PGO, a crucial class of non-convex Riemannian optimization problems at the center of recent PGO solvers with global optimality guarantees .
Edit intent: clarity
Original:  Furthermore, the same algorithm can be used to solve the so-called rank-restricted semidefinite relaxations of PGO, a crucial class of non-convex Riemannian optimization problems at the center of recent PGO solvers with global optimality guarantees .
Revised:  Furthermore, the same algorithm can be used to solve the so-called rank-restricted semidefinite relaxations of PGO, a crucial class of non-convex Riemannian optimization problems that underlies recent breakthroughs on globally optimal PGO .
Edit intent: clarity
Original:  The derived stepsize depends on the worst-case delay and inherent problem sparsity, and furthermore matches known result for synchronous algorithms when delay is zero .
Revised:  The derived stepsize depends on the worst-case delay and inherent problem sparsity, and furthermore matches known result for synchronous algorithms when there is no delay .
Edit intent: clarity
Original:  Numerical evaluations on both simulated and real-world SLAM datasets demonstrate the speedup achieved with ASAPP and show the algorithm 's resilience against a wide range of communication delays in practice.
Revised:  Numerical evaluations on simulated and real-world SLAM datasets demonstrate the speedup achieved with ASAPP and show the algorithm 's resilience against a wide range of communication delays in practice.
Edit intent: coherence
Original:  Numerical evaluations on both simulated and real-world SLAM datasets demonstrate the speedup achieved with ASAPP and show the algorithm 's resilience against a wide range of communication delays in practice.
Revised:  Numerical evaluations on both simulated and real-world SLAM datasets demonstrate the speedup achieved with ASAPP and show the algorithm 's resilience against a wide range of delays in practice.
Edit intent: clarity
Original:  The goal of this work is to give some insights about performance and energy footprint of contemporary architectures with a real astrophysical application in an HPC context.
Revised:  The goal of this work is to give some insights about performance and energy footprint of contemporary architectures for a real astrophysical application in an HPC context.
Edit intent: fluency
Original:  We investigate the behaviour of the different devices where the high-end GPUs excel in terms of time-to-solution while MPSoC-FPGA systems outperform GPUs in power consumption.
Revised:  We investigate the behavior of the different devices where the high-end GPUs excel in terms of time-to-solution while MPSoC-FPGA systems outperform GPUs in power consumption.
Edit intent: fluency
Original:  We show that Moon's formula underestimates the true variance and provide exact formulae.
Revised:  We show that Moon's formulae are inaccurate in predicting the true variance and provide exact formulae.
Edit intent: clarity
Original:  However, many of the current techniques employ a considerably high amount of memory, and require a specific minimum audio segment length to obtain good performances.
Revised:  Although many of the current techniques employ a considerably high amount of memory, and require a specific minimum audio segment length to obtain good performances.
Edit intent: fluency
Original:  However, many of the current techniques employ a considerably high amount of memory, and require a specific minimum audio segment length to obtain good performances.
Revised:  However, many of the current techniques have achieved high performances, they require a considerably high amount of memory, and require a specific minimum audio segment length to obtain good performances.
Edit intent: clarity
Original:  However, many of the current techniques employ a considerably high amount of memory, and require a specific minimum audio segment length to obtain good performances.
Revised:  However, many of the current techniques employ a considerably high amount of memory, and a specific minimum audio segment length to obtain good performances.
Edit intent: fluency
Original:  Thus, we present a complete online speaker identifier, based on a simple voting system  that shows that the proposed BLSTM-based model and the current state of the art are similarly accurate at identifying speakers online .
Revised:  Thus, we present a complete online speaker identifier, based on a simple voting system , that shows that the proposed BLSTM-based model and the current state of the art are similarly accurate at identifying speakers online .
Edit intent: fluency
Original:  Thus, we present a complete online speaker identifier, based on a simple voting system  that shows that the proposed BLSTM-based model and the current state of the art are similarly accurate at identifying speakers online .
Revised:  Thus, we present a complete online speaker identifier, based on a simple voting system that shows that the proposed BLSTM-based model achieves a similar performance at identifying speakers online compared to the current state of the art are similarly accurate at identifying speakers online .
Edit intent: clarity
Original:  Thus, we present a complete online speaker identifier, based on a simple voting system  that shows that the proposed BLSTM-based model and the current state of the art are similarly accurate at identifying speakers online .
Revised:  Thus, we present a complete online speaker identifier, based on a simple voting system that shows that the proposed BLSTM-based model and the current state of the art .
Edit intent: clarity
Original:  In this work, we highlight a connection between metaplasticity models and the training process of binarized neural networks, a low-precision version of deep neural networks  . Building on this idea, we propose and demonstrate experimentally, in situations of multitask and stream learning, a training technique that prevents catastrophic forgetting without needing previously presented data, nor formal boundaries between datasets  .
Revised:  In this work, we highlight a connection between metaplasticity models and the training process of binarized neural networks, a low-precision version of deep neural networks . Building on this idea, we propose and demonstrate experimentally, in situations of multitask and stream learning, a training technique that reduces catastrophic forgetting without needing previously presented data, nor formal boundaries between datasets .
Edit intent: clarity
Original:  Moreover, complexity theory helps to identify ``hard'' problems which require an excessive amount of computation time to solve.
Revised:  Moreover, complexity theory helps to identify ``hard'' problems which require excessive amount of computation time to solve.
Edit intent: fluency
Original: Dynamic flux balance analysis uses a quasi-steady state assumption to calculate an organism's metabolic activity at each time-step of a dynamic simulation, using the well-know technique of flux balance analysis.
Revised: Dynamic flux balance analysis uses a quasi-steady state assumption to calculate an organism's metabolic activity at each time-step of a dynamic simulation, using the well-known technique of flux balance analysis.
Edit intent: fluency
Original:  Using our method, we can use this solution as long as the resulting metabolic activity remains within the optimization problem's constraints (i.e. the solution remains feasible ).
Revised:  Using our method, we can use this solution as long as the resulting metabolic activity remains within the optimization problem's constraints (i.e. the solution to the linear system of equations remains a feasible to the linear program ).
Edit intent: clarity
Original:  For reproducibility,  code is available at URL and in the Python Package Index (PyPI) as surfinFBA.
Revised:  For reproducibility, code is available at URL 
Edit intent: coherence
Original: We consider minimally unsatisfiable 2-CNFs , i.e., minimally unsatisfiable conjunctive normal forms, where each clause contains at most 2 literals (short 2-MUs).
Revised: We consider minimally unsatisfiable 2-CNFs (short 2-MUs).
Edit intent: clarity
Original:  The main tool used here is the implication digraph, which allows to reduce the problem of determining the isomorphism types of 2-MUs to the isomorphism types of "weak double cycles " ( WDCs), obtained from the digraph versions of undirected cycles by splitting vertices and arcs.
Revised:  The main tool is the implication digraph, which allows to reduce the problem of determining the isomorphism types of 2-MUs to the isomorphism types of "weak double cycles " ( WDCs), obtained from the digraph versions of undirected cycles by splitting vertices and arcs.
Edit intent: coherence
Original:  The main tool used here is the implication digraph, which allows to reduce the problem of determining the isomorphism types of 2-MUs to the isomorphism types of "weak double cycles " ( WDCs), obtained from the digraph versions of undirected cycles by splitting vertices and arcs.
Revised:  The main tool used here is the implication digraph, which allows to reduce the problem of determining the isomorphism types of 2-MUs to the isomorphism types of "weak double cycle " ( WDCs), obtained from the digraph versions of undirected cycles by splitting vertices and arcs.
Edit intent: fluency
Original:  With respect to the first topic we investigate the notion of uniform distribution of letters over intervals, and in the spirit of the famous Chung-Graham-Wilson theorem for graphs we provide a list of word properties which are equivalent to uniformity.
Revised:  With respect to the first topic we investigate the notion of uniform distribution of letters over intervals, and in the spirit of the famous Chung--Graham--Wilson theorem for graphs we provide a list of word properties which are equivalent to uniformity.
Edit intent: fluency
Original:  Polymer solution is used as an example to demonstrate the essential ideas.
Revised:  Dumbbell polymer solutions are used as examples to demonstrate the essential ideas.
Edit intent: clarity
Original:  The final model , named the deep non-Newtonian model (DeePN^2), takes the form of conventional non-Newtonian fluid dynamics models, with a new form of the objective tensor derivative.
Revised:  The final model named the deep non-Newtonian model (DeePN^2), takes the form of conventional non-Newtonian fluid dynamics models, with a new form of the objective tensor derivative.
Edit intent: fluency
Original:  In other words, these problems are not only large-scale but also computationally expensive, that makes them very difficult to solve.
Edit intent: coherence
Original:  Also, we conducted some experiments on CEC-2017 , D=10, 30, 50, and 100 to investigate the behavior of SOO algorithm in lower dimensions.
Revised:  Also, we conducted some experiments on CEC-2017 to investigate the behavior of SOO algorithm in lower dimensions.
Edit intent: coherence
Original:  To the best our knowledge, there is no significant study to assess benchmark functions with various dimensions and landscape properties to investigate CD algorithm and compare with other metaheuristic algorithms .
Revised:  To the best our knowledge, there is no significant study to assess benchmark functions with various dimensions and landscape properties to investigate CD algorithm .
Edit intent: clarity
Original: In this article we propose and calculate, under the Black Scholes option pricing model, a measure of the relative value of a delta- Symmetric Strangle .
Revised: Trading option strangles is a highly popular strategy often used by market participants to mitigate volatility risks in their portfolios. In this paper we propose a measure of the relative value of a delta- Symmetric Strangle .
Edit intent: clarity
Original:  {\it   In fact, the simple and intuitively appealing expression for this measure  allows us to study the strangle's exit strategy and the corresponding optimal choices for values {\it   of delta.
Revised:  {\it benchmark In fact, the simple and intuitively appealing expression for this measure allows us to study the strangle's exit strategy and the corresponding optimal choices for values {\it of delta.
Edit intent: fluency
Original:  {\it   In fact, the simple and intuitively appealing expression for this measure  allows us to study the strangle's exit strategy and the corresponding optimal choices for values {\it   of delta.
Revised:  {\it In fact, the simple and intuitively appealing expression for this measure allows us to study the strangle's exit strategy and the corresponding {\it of delta.
Edit intent: clarity
Original:  {\it   In fact, the simple and intuitively appealing expression for this measure  allows us to study the strangle's exit strategy and the corresponding optimal choices for values {\it   of delta.
Revised:  {\it In fact, the simple and intuitively appealing expression for this measure allows us to study the strangle's exit strategy and the corresponding optimal choices for values {\it optimal of delta.
Edit intent: fluency