wanyu/IteraTeR_v2 huggingface dataset:
Original:  Building on the success of deep learning, a new approach was recently proposed by D\"utting et al. , 2017 in which the auction is modeled by a feed-forward neural network and the design problem is framed as a learning problem.
Revised:  Building on the success of deep learning, a new approach was recently proposed by Duetting et al. , 2017 in which the auction is modeled by a feed-forward neural network and the design problem is framed as a learning problem.
Edit intent: fluency
Original: Photosynthetic molecules, i.e., chlorophylls and carotenoids,  are proposed for molecular communications in nano scale with the mechanism of resonance energy transfer.
Revised: Chlorophylls and carotenoids, are proposed for molecular communications in nano scale with the mechanism of resonance energy transfer.
Edit intent: coherence
Original: Photosynthetic molecules, i.e., chlorophylls and carotenoids,  are proposed for molecular communications in nano scale with the mechanism of resonance energy transfer.
Revised: Photosynthetic molecules, i.e., chlorophylls and carotenoids, are proposed for molecular communications at the nanoscale with the mechanism of resonance energy transfer.
Edit intent: clarity
Original:  Both types of these pigments are introduced focusing on their exceptional properties like energy harvesting, ultra-low energy consumption during transmissions, picoseconds delays,  ability for signal conversions  and bio-compatibility.
Revised:  Both types of pigments are introduced focusing on their exceptional properties like energy harvesting, ultra-low energy consumption during transmissions, picoseconds delays, ability for signal conversions and bio-compatibility.
Edit intent: clarity
Original:  The paper reports results of two laboratory experiments performed on the isolated photosystem II core complex, a ubiquitous structure comprising these photosynthetic molecules assembled with respective proteins .
Revised:  The theoretical considerations are supported by two spectroscopic experiments on the photosystem II complex .
Edit intent: clarity
Original:  In the second experiment the photochemical efficiency is estimated  .
Revised:  In the second one, the photochemical efficiency is estimated .
Edit intent: clarity
Original:  These results indicate a really high potential of photosynthetic systems for nanocommunications , also with excellent energetic characteristics in terms of energy harvesting and consumption for data transmission .
Revised:  These results indicate a high potential of photosynthetic systems for nanocommunications , also with excellent energetic characteristics in terms of energy harvesting and consumption for data transmission .
Edit intent: coherence
Original:  These results indicate a really high potential of photosynthetic systems for nanocommunications , also with excellent energetic characteristics in terms of energy harvesting and consumption for data transmission .
Revised:  These results indicate a really high potential of photosynthetic systems for nanocommunications , also with excellent energetic characteristics in terms of energy harvesting abilities and low consumption for data transmission .
Edit intent: clarity
Original:  These results indicate a really high potential of photosynthetic systems for nanocommunications , also with excellent energetic characteristics in terms of energy harvesting and consumption for data transmission .
Revised:  These results indicate a really high potential of photosynthetic systems for nanocommunications , also with excellent energetic characteristics in terms of energy harvesting and consumption for data transmissions .
Edit intent: fluency
Original:  The algorithms are based on a novel technique which we call Steiner potential since in the linear case it reduces to controlling the value of the Steiner polynomial of a convex region at various scales.
Revised:  The algorithms are based on a novel technique of bounding the value of the Steiner polynomial of a convex region at various scales.
Edit intent: clarity
Original:  Finally, we extend these results to a  noisy feedback model, where each round our feedback is flipped with  fixed probability p < 1/2.
Revised:  Finally, we extend these results to a noisy feedback model, where each round our feedback is flipped with a fixed probability p < 1/2.
Edit intent: fluency
Original:  Our results also show that RMP-SNN achieves comparable accuracy to that provided by the converted SNN with "hard reset" spiking neurons using 2-8 times fewer inference time-steps across  datasets.
Revised:  Our results also show that RMP-SNN surpasses the best inference accuracy provided by the converted SNN with "hard reset" spiking neurons using 2-8 times fewer inference time-steps across datasets.
Edit intent: clarity
Original: We show that adversarial reinforcement learning (ARL) can be used to produce market marking agents that are robust to adversarial and adaptively chosen market conditions.
Revised: We show that adversarial reinforcement learning (ARL) can be used to produce market marking agents that are robust to adversarial and adaptively-chosen market conditions.
Edit intent: fluency
Original:  We empirically demonstrate that our ARL method consistently converges, and we prove for several special cases that the profiles that we converge to are Nash equilibria in a corresponding simplified single-stage game.
Revised:  We empirically demonstrate that our ARL method consistently converges, and we prove for several special cases that the profiles that we converge to correspond to Nash equilibria in a corresponding simplified single-stage game.
Edit intent: clarity
Original:  We empirically demonstrate that our ARL method consistently converges, and we prove for several special cases that the profiles that we converge to are Nash equilibria in a corresponding simplified single-stage game.
Revised:  We empirically demonstrate that our ARL method consistently converges, and we prove for several special cases that the profiles that we converge to are Nash equilibria in a simplified single-stage game.
Edit intent: clarity
Original:  In addition, we demonstrate that CPs capture local structural patterns unique in each domain, and thus comparing CPs of hypergraphs addresses Q2 and Q3.
Revised:  In addition, we demonstrate that CPs capture local structural patterns unique to each domain, and thus comparing CPs of hypergraphs addresses Q2 and Q3.
Edit intent: fluency
Original:  At each resolution level, attributes are processed in clusters by a set of block transforms.
Revised:  At each resolution level, attributes are processed in clusters using block transforms.
Edit intent: clarity
Original:  We first formalize the robust instability analysis problem for single-input-single-output linear time invariant systems by introducing a notion of the robust instability radius (RIR).
Revised:  We first formalize the problem for SISO LTI systems by introducing a notion of the robust instability radius (RIR).
Edit intent: clarity
Original:  We provide a method of finding the exact RIR for a certain class of systems and show that it works well for a class of second-order systems.
Revised:  We provide a method for calculating the RIR exactly for a certain class of systems and show that it works well for a class of second-order systems.
Edit intent: clarity
Original:  We provide a method of finding the exact RIR for a certain class of systems and show that it works well for a class of second-order systems.
Revised:  We provide a method of finding the exact RIR for a certain class of systems and show that it works well for a class of second order systems.
Edit intent: fluency
Original:  This approach is developed based on the optimal mass transport theory and is also viewed as an online reinforcement learning and approximate dynamic programming approach in the Wasserstein-GMM space, where a novel value functional is defined based on the probability density functions of robots and the time-varying  map functions describing the changing environmental information.
Revised:  This approach is developed based on the optimal mass transport theory . It is also viewed as an online reinforcement learning and approximate dynamic programming approach in the Wasserstein-GMM space, where a novel value functional is defined based on the probability density functions of robots and the time-varying map functions describing the changing environmental information.
Edit intent: coherence
Original:  The proposed approach is demonstrated on the path planning problem of very-large-scale robotic systems where the approximated layout of obstacles in the workspace is incrementally updated by the observations of robots, and compared with some existing state-of-the-art approaches.
Revised:  The proposed approach is demonstrated on the path planning problem of very-largescale robotic systems where the approximated layout of obstacles in the workspace is incrementally updated by the observations of robots, and compared with some existing state-of-the-art approaches.
Edit intent: clarity
Original:  The numerical simulation results show that the proposed approach outperforms these approaches in aspects of  average traveling distance and  energy cost.
Revised:  The numerical simulation results show that the proposed approach outperforms these approaches in aspects of the average traveling distance and energy cost.
Edit intent: fluency
Original:  The numerical simulation results show that the proposed approach outperforms these approaches in aspects of  average traveling distance and  energy cost.
Revised:  The numerical simulation results show that the proposed approach outperforms these approaches in aspects of average traveling distance and the energy cost.
Edit intent: fluency
Original:  We present an exact algorithm with O( k^{2 +  n^2\log n) runtime and O(kt^{2 , assuming that no three points lie on the same line.
Revised:  We present an exact algorithm with O( k^{2 + n^2\log n) runtime , assuming that no three points lie on the same line.
Edit intent: coherence
Original: We consider the discrete optimization problems with interval objective function on graphs and hypergraphs .
Revised: We consider the discrete optimization problems with interval objective function .
Edit intent: clarity
Original:  For the discrete optimization problems  we consider, the algorithm gives a set of all possible greedy solutions and the set of all possible values of the objective function for the solutions.
Revised:  For the discrete optimization problems that we consider, the algorithm gives a set of all possible greedy solutions and the set of all possible values of the objective function for the solutions.
Edit intent: fluency
Original:  For a given probability distribution that is defined on coefficients' intervals , we compute probabilities of the weak solutions, expected values of the objective function for them and other probabilistic characteristics  .
Revised:  For a given probability distribution on intervals of objective function' coefficients , we compute probabilities of the weak solutions, expected values of the objective function for them and other probabilistic characteristics .
Edit intent: clarity
Original:  For a given probability distribution that is defined on coefficients' intervals , we compute probabilities of the weak solutions, expected values of the objective function for them and other probabilistic characteristics  .
Revised:  For a given probability distribution that is defined on coefficients' intervals , we compute probabilities of the weak solutions, expected values of the objective function for them and other probabilistic characteristics of the problem .
Edit intent: clarity
Original:  In a first phase, the method relies on the Deep Optimal Stopping algorithm (DOS) proposed in \mbox{ DOS , which learns the optimal stopping rule from Monte-Carlo samples of the underlying risk factors.
Revised:  In a first phase, the method relies on the Deep Optimal Stopping algorithm , which learns the optimal stopping rule from Monte-Carlo samples of the underlying risk factors.
Edit intent: coherence
Original:  Cashflow paths are then created by applying the learned stopping strategy on a new set of realizations of the risk factors.
Revised:  Cashflow-paths are then created by applying the learned stopping strategy on a new set of realizations of the risk factors.
Edit intent: fluency
Original:  The regression step is carried out by ordinary least squares as well as neural networks, and it is shown that the latter performs more accurate approximations.
Revised:  The regression step is carried out by ordinary least squares as well as neural networks, and it is shown that the latter produces more accurate approximations.
Edit intent: clarity
Original:  When these systems arise from spatial discretizations of evolutionary partial differential equations, their coefficient matrices are typically becoming large and sparse.
Revised:  When these systems arise from spatial discretizations of evolutionary partial differential equations, their coefficient matrices are typically large and sparse.
Edit intent: clarity
Original: We investigate asynchronous programming in the context of algebraic effects.
Revised: We explore asynchronous programming with algebraic effects.
Edit intent: clarity
Original:  In contrast to their conventional synchronous treatment , we show that one can naturally also accommodate asynchrony within algebraic effects, by decoupling the execution of operation calls into signalling that the operation's implementation needs to be executed and interrupting the computation with the operation's result, to which the computation can react through a previously installed interrupt handler .
Revised:  We complement their conventional synchronous treatment , we show that one can naturally also accommodate asynchrony within algebraic effects, by decoupling the execution of operation calls into signalling that the operation's implementation needs to be executed and interrupting the computation with the operation's result, to which the computation can react through a previously installed interrupt handler .
Edit intent: clarity
Original:  In contrast to their conventional synchronous treatment , we show that one can naturally also accommodate asynchrony within algebraic effects, by decoupling the execution of operation calls into signalling that the operation's implementation needs to be executed and interrupting the computation with the operation's result, to which the computation can react through a previously installed interrupt handler .
Revised:  In contrast to their conventional synchronous treatment by showing how to naturally also accommodate asynchrony within algebraic effects, by decoupling the execution of operation calls into signalling that the operation's implementation needs to be executed and interrupting the computation with the operation's result, to which the computation can react through a previously installed interrupt handler .
Edit intent: clarity
Original:  In contrast to their conventional synchronous treatment , we show that one can naturally also accommodate asynchrony within algebraic effects, by decoupling the execution of operation calls into signalling that the operation's implementation needs to be executed and interrupting the computation with the operation's result, to which the computation can react through a previously installed interrupt handler .
Revised:  In contrast to their conventional synchronous treatment , we show that one can naturally also accommodate asynchrony within them, namely, by decoupling the execution of operation calls into signalling that the operation's implementation needs to be executed and interrupting the computation with the operation's result, to which the computation can react through a previously installed interrupt handler .
Edit intent: clarity
Original:  In contrast to their conventional synchronous treatment , we show that one can naturally also accommodate asynchrony within algebraic effects, by decoupling the execution of operation calls into signalling that the operation's implementation needs to be executed and interrupting the computation with the operation's result, to which the computation can react through a previously installed interrupt handler .
Revised:  In contrast to their conventional synchronous treatment , we show that one can naturally also accommodate asynchrony within algebraic effects, by decoupling the execution of operation calls into signalling that an operation's implementation needs to be executed and interrupting the computation with the operation's result, to which the computation can react through a previously installed interrupt handler .
Edit intent: fluency
Original:  In contrast to their conventional synchronous treatment , we show that one can naturally also accommodate asynchrony within algebraic effects, by decoupling the execution of operation calls into signalling that the operation's implementation needs to be executed and interrupting the computation with the operation's result, to which the computation can react through a previously installed interrupt handler .
Revised:  In contrast to their conventional synchronous treatment , we show that one can naturally also accommodate asynchrony within algebraic effects, by decoupling the execution of operation calls into signalling that the operation's implementation needs to be executed , and interrupting a running computation with the operation's result, to which the computation can react through a previously installed interrupt handler .
Edit intent: clarity
Original:  In contrast to their conventional synchronous treatment , we show that one can naturally also accommodate asynchrony within algebraic effects, by decoupling the execution of operation calls into signalling that the operation's implementation needs to be executed and interrupting the computation with the operation's result, to which the computation can react through a previously installed interrupt handler .
Revised:  In contrast to their conventional synchronous treatment , we show that one can naturally also accommodate asynchrony within algebraic effects, by decoupling the execution of operation calls into signalling that the operation's implementation needs to be executed and interrupting the computation with the operation's result, to which the computation can react by installing interrupt handlers .
Edit intent: clarity
Original:  We formalise these ideas in a small  calculus, called \text{\ae }.
Revised:  We formalise these ideas in a small calculus, called \text{ae }.
Edit intent: fluency
Original:  We demonstrate the flexibility of \text{\ae } using examples ranging from a simple three-party web application, to preemptive multi-threading, to remote function calls, to a parallel variant of runners of algebraic effects }'s type safety proofs in Agda, and a prototype implementation of \lambda_{\text{ae}} in OCaml} .
Revised:  We demonstrate the flexibility of \text{ae } using examples ranging from a simple three-party web application, to preemptive multi-threading, to remote function calls, to a parallel variant of runners of algebraic effects }'s type safety proofs in Agda, and a prototype implementation of \lambda_{\text{ae}} in OCaml} .
Edit intent: fluency
Original:  We demonstrate the flexibility of \text{\ae } using examples ranging from a simple three-party web application, to preemptive multi-threading, to remote function calls, to a parallel variant of runners of algebraic effects }'s type safety proofs in Agda, and a prototype implementation of \lambda_{\text{ae}} in OCaml} .
Revised:  We demonstrate the flexibility of \text{\ae } using examples ranging from a multi-party web application, to preemptive multi-threading, to remote function calls, to a parallel variant of runners of algebraic effects }'s type safety proofs in Agda, and a prototype implementation of \lambda_{\text{ae}} in OCaml} .
Edit intent: clarity
Original: In geographic information systems, Digital Elevation Models (DEMs) are commonly processed using radial scanning based algorithms.
Revised:  Digital Elevation Models (DEMs) are commonly processed using radial scanning based algorithms.
Edit intent: clarity
Original:  However, radial scanning algorithms imply a large number of accesses to 2D arrays , which despite being regular, results in poor data locality .
Revised:  However, radial scanning algorithms imply a large number of accesses to 2D arrays which, despite being regular, results in poor data locality .
Edit intent: fluency
Original:  However, radial scanning algorithms imply a large number of accesses to 2D arrays , which despite being regular, results in poor data locality .
Revised:  However, radial scanning algorithms imply a large number of accesses to 2D arrays , which despite being regular, result in poor data locality .
Edit intent: coherence
Original:  This paper proposes a new methodology , termed sDEM , which substantially improves the locality of memory accesses and largely increases the inherent parallelism involved in the computation of radial scanning algorithms.
Revised:  This paper proposes a new methodology , termed sDEM , which substantially improves the locality of memory accesses and increases the inherent parallelism involved in the computation of radial scanning algorithms.
Edit intent: clarity
Original:  In particular, sDEM applies a data restructuring technique prior to accessing the memory and performing the computation.
Revised:  In particular, sDEM applies a data restructuring technique before accessing the memory and performing the computation.
Edit intent: fluency
Original:  In order to demonstrate the high efficiency of sDEM, we use the problem of total viewshed computation as a case study .
Revised:  To demonstrate the high efficiency of sDEM, we use the problem of total viewshed computation as a case study .
Edit intent: coherence
Original:  For this reason, efficient uncertainty quantification algorithms are now needed to explore the often large parameter space of a given model .
Revised:  For this reason, efficient uncertainty quantification algorithms are key to understand the propagation of uncertainty -- from uncertain input parameters to uncertain output quantities -- in high resolution mathematical models of brain physiology .
Edit intent: clarity
Original:  In this paper, we design and apply QMC and MLMC methods to quantify uncertainty in a convection-diffusion model for tracer transport within the brain.
Revised:  In this paper, we design and apply QMC and MLMC methods to quantify uncertainty in a convection-diffusion model of tracer transport within the brain.
Edit intent: fluency
Original:  We show that QMC outperforms standard Monte Carlo simulations when the number of random inputs is small.
Revised:  We show that QMC outperforms standard MC simulations when the number of random inputs is small.
Edit intent: fluency
Original:  MLMC considerably outperforms both QMC and standard Monte Carlo methods and should therefore be preferred for brain transport models.
Revised:  MLMC considerably outperforms both QMC and standard MC methods and should therefore be preferred for brain transport models.
Edit intent: clarity
Original: Restarts are a widely used class of techniques integral to the efficiency of Conflict-Driven Clause Learning (CDCL)  SAT solvers.
Revised: Restarts are a widely-used class of techniques integral to the efficiency of Conflict-Driven Clause Learning (CDCL) SAT solvers.
Edit intent: fluency
Original:  While the utility of such policies has been well-established empirically, until now we didn't have a complexity-theoretic understanding of why restart policies are crucial to the power of CDCL SAT solvers .
Revised:  While the utility of such policies has been well-established empirically, a theoretical explanation of whether restarts are indeed crucial to the power of CDCL SAT solvers .
Edit intent: clarity
Original:  In this paper, we prove a series of theoretical results that characterize the power of restarts for various models of Boolean SAT solvers.
Revised:  In this paper, we prove a series of theoretical results that characterize the power of restarts for various models of SAT solvers.
Edit intent: clarity