wanyu/IteraTeR_v2 huggingface dataset:
Original:  The theoretical analysis, supported by numerical experiments, indicates that the new methods are more efficient than \%diagonalising the matrix when its norm is not very large, and also than other schemes based on rational Pad\'e approximants and Taylor polynomials for all tolerances and time interval lengths.
Revised:  The theoretical analysis, supported by numerical experiments, indicates that the new methods are more efficient than schemes based on rational Pad\'e approximants and Taylor polynomials for all tolerances and time interval lengths.
Edit intent: clarity
Original: As highly sensitive camera pixel sensor arrays have grown both larger and faster and optical microscopy techniques become ever more refined, there has been an explosion in the quantity of data acquired during routine light microscopy.
Revised: As camera pixel sensors grow larger and faster and optical microscopy techniques become ever more refined, there has been an explosion in the quantity of data acquired during routine light microscopy.
Edit intent: clarity
Original: As highly sensitive camera pixel sensor arrays have grown both larger and faster and optical microscopy techniques become ever more refined, there has been an explosion in the quantity of data acquired during routine light microscopy.
Revised: As highly sensitive camera pixel sensor arrays have grown both larger and faster and optical microscopy techniques become ever more refined, there has been explosions in the quantity of data acquired during routine light microscopy.
Edit intent: fluency
Original:  At the single-molecule level, this analysis involves multiple steps and can quickly become computationally expensive , and in some cases intractable on an ordinary office workstation .
Revised:  At the single-molecule level, this analysis involves multiple steps and can quickly become computationally expensive and intractable on ordinary office workstations .
Edit intent: clarity
Original:  Moreover, complex bespoke software can present a high activation barrier to entry for new users.
Revised:  Moreover, complex bespoke software can present high activation barriers for new users.
Edit intent: clarity
Original:  We demonstrate that the performance of this code is on a par with our previous MATLAB implementation but runs at a fraction of the computational cost.
Revised:  We demonstrate the performance of this code is on a par with our previous MATLAB implementation but runs at a fraction of the computational cost.
Edit intent: fluency
Original:  We demonstrate that the performance of this code is on a par with our previous MATLAB implementation but runs at a fraction of the computational cost.
Revised:  We demonstrate that the performance of this code matches our previous MATLAB implementation but runs at a fraction of the computational cost.
Edit intent: clarity
Original:  We demonstrate that the performance of this code is on a par with our previous MATLAB implementation but runs at a fraction of the computational cost.
Revised:  We demonstrate that the performance of this code is on a par with our previous MATLAB implementation but at a fraction of the computational cost.
Edit intent: clarity
Original: As camera pixel sensors grow larger and faster  and optical microscopy techniques become ever more refined, there has been explosions in the quantity of data acquired during routine light microscopy .
Revised: As camera pixel sensors grow larger and faster , and optical microscopy techniques become ever more refined, there has been explosions in the quantity of data acquired during routine light microscopy .
Edit intent: fluency
Original: As camera pixel sensors grow larger and faster  and optical microscopy techniques become ever more refined, there has been explosions in the quantity of data acquired during routine light microscopy .
Revised: As camera pixel sensors grow larger and faster and optical microscopy techniques ever more refined, there has been explosions in the quantity of data acquired during routine light microscopy .
Edit intent: fluency
Original: As camera pixel sensors grow larger and faster  and optical microscopy techniques become ever more refined, there has been explosions in the quantity of data acquired during routine light microscopy .
Revised: As camera pixel sensors grow larger and faster and optical microscopy techniques become ever more refined, there has been an explosion in the quantity of data acquired during routine light microscopy .
Edit intent: fluency
Original: As camera pixel sensors grow larger and faster  and optical microscopy techniques become ever more refined, there has been explosions in the quantity of data acquired during routine light microscopy .
Revised: As camera pixel sensors grow larger and faster and optical microscopy techniques become ever more refined, there has been explosions in the quantity of data acquired during routine light microcopy .
Edit intent: fluency
Original:  At the single-molecule level, this analysis involves multiple steps and can quickly become computationally expensive and intractable on ordinary office workstations.
Revised:  At the single-molecule level, analysis involves multiple steps and can quickly become computationally expensive and intractable on ordinary office workstations.
Edit intent: clarity
Original:  At the single-molecule level, this analysis involves multiple steps and can quickly become computationally expensive and intractable on ordinary office workstations.
Revised:  At the single-molecule level, this analysis involves multiple steps and can rapidly become computationally expensive and intractable on ordinary office workstations.
Edit intent: fluency
Original:  At the single-molecule level, this analysis involves multiple steps and can quickly become computationally expensive and intractable on ordinary office workstations.
Revised:  At the single-molecule level, this analysis involves multiple steps and can quickly become computationally expensive , in some cases intractable on office workstations.
Edit intent: clarity
Original:  Moreover, complex bespoke software can present high activation barriers  for new users.
Revised:  Complex bespoke software can present high activation barriers for new users.
Edit intent: coherence
Original:  Moreover, complex bespoke software can present high activation barriers  for new users.
Revised:  Moreover, complex bespoke software can present high activation barriers to entry for new users.
Edit intent: clarity
Original:  It can also evaluate diffusion coefficients for the relatively short single-particle tracking data that is characteristic of time-resolved image stacks .
Revised:  It can evaluate 2D diffusion coefficients for the relatively short single-particle tracking data that is characteristic of time-resolved image stacks .
Edit intent: clarity
Original:  It can also evaluate diffusion coefficients for the relatively short single-particle tracking data that is characteristic of time-resolved image stacks .
Revised:  It can also evaluate diffusion coefficients for the characteristically short single-particle tracking data that is characteristic of time-resolved image stacks .
Edit intent: clarity
Original:  It can also evaluate diffusion coefficients for the relatively short single-particle tracking data that is characteristic of time-resolved image stacks .
Revised:  It can also evaluate diffusion coefficients for the relatively short single-particle tracking data .
Edit intent: clarity
Original:  To facilitate benchmarking against other codes, we also include data simulation routines which may trivially be used to compare different analysis programs.
Revised:  To facilitate benchmarking we include data simulation routines which may trivially be used to compare different analysis programs.
Edit intent: clarity
Original:  To facilitate benchmarking against other codes, we also include data simulation routines which may trivially be used to compare different analysis programs.
Revised:  To facilitate benchmarking against other codes, we also include data simulation routines to compare different analysis programs.
Edit intent: clarity
Original:  Finally, we show that PySTACHIO works also with two-color data and can perform colocalization analysis based on overlap integrals , to infer interactions between differently labelled biomolecules.
Revised:  Finally, we show that it works with 2-color data and enables colocalization analysis based on overlap integrals , to infer interactions between differently labelled biomolecules.
Edit intent: clarity
Original:  Finally, we show that PySTACHIO works also with two-color data and can perform colocalization analysis based on overlap integrals , to infer interactions between differently labelled biomolecules.
Revised:  Finally, we show that PySTACHIO works also with two-color data and can perform colocalization analysis based on overlap integration , to infer interactions between differently labelled biomolecules.
Edit intent: fluency
Original:  We hope that by making this freely available for use and modification we can make complex single-molecule analysis of light microscopy data more accessible .
Revised:  By making this freely available for use and modification we can make complex single-molecule analysis of light microscopy data more accessible .
Edit intent: coherence
Original:  We hope that by making this freely available for use and modification we can make complex single-molecule analysis of light microscopy data more accessible .
Revised:  We hope that by making this freely available we aim to make complex light microscopy single-molecule analysis of light microscopy data more accessible .
Edit intent: clarity
Original:  We hope that by making this freely available for use and modification we can make complex single-molecule analysis of light microscopy data more accessible .
Revised:  We hope that by making this freely available for use and modification we can make complex single-molecule analysis more democratized .
Edit intent: clarity
Original: In this paper, we investigate the relation between Bachelier and Black-Scholes (B-S) models driven by the infinitely divisible inverse subordinators.
Revised: In this paper, we investigate the relation between Bachelier and Black-Scholes models driven by the infinitely divisible inverse subordinators.
Edit intent: clarity
Original:  We introduce the subordinated Cox-Ross-Rubinstein (CRR) model and prove that it converges in distribution to the subordinated B-S model defined in \mbox{ gajda .
Revised:  We introduce the subordinated Cox-Ross-Rubinstein model and prove that it converges in distribution to the subordinated B-S model defined in \mbox{ gajda .
Edit intent: clarity
Original: We  apply domain functionals to study the conformal capacity of condensers (G,E) where G is a simply connected domain in the complex plane and E is a compact subset of G. Due to conformal invariance, our main tools are the hyperbolic geometry and functionals such as the hyperbolic perimeter of E. Novel computational algorithms based on implementations of the fast multipole method are combined with analytic techniques.
Revised: We apply domain functionals to study the capacities of condensers (G,E) where G is a simply connected domain in the complex plane and E is a compact subset of G. Due to conformal invariance, our main tools are the hyperbolic geometry and functionals such as the hyperbolic perimeter of E. Novel computational algorithms based on implementations of the fast multipole method are combined with analytic techniques.
Edit intent: fluency
Original:  Computational experiments are used throughout to , for instance, demonstrate sharpness of established inequalities.
Revised:  Computational experiments are used throughout to , for instance, sharpness of established inequalities.
Edit intent: clarity
Original: Decision and control are two of the core functionalities of high-level automated vehicles.
Revised: Decision and control are core functionalities of high-level automated vehicles.
Edit intent: clarity
Original:  Current mainstream methods, such as functionality decomposition or end-to-end reinforcement learning (RL), either suffer high time complexity or poor interpretability and limited safety performance in real-world complex autonomous driving tasks.
Revised:  Current mainstream methods, such as functionality decomposition or end-to-end reinforcement learning (RL), either suffer high time complexity or poor interpretability and adaptability on real-world complex autonomous driving tasks.
Edit intent: clarity
Original:  Current mainstream methods, such as functionality decomposition or end-to-end reinforcement learning (RL), either suffer high time complexity or poor interpretability and limited safety performance in real-world complex autonomous driving tasks.
Revised:  Current mainstream methods, such as functionality decomposition or end-to-end reinforcement learning (RL), either suffer high time complexity or poor interpretability and limited safety performance in real-world autonomous driving tasks.
Edit intent: clarity
Original:  In this paper, we present an interpretable and efficient decision and control framework for automated vehicles, which decomposes the driving task into multi-path planning and optimal tracking that are structured hierarchically.
Revised:  In this paper, we present an interpretable and efficient decision and control (IDC) for automated vehicles, which decomposes the driving task into multi-path planning and optimal tracking that are structured hierarchically.
Edit intent: clarity
Original:  First, the multi-path planning is to generate several paths only considering static constraints .
Revised:  First, the static path planning generates several candidate paths only considering static constraints .
Edit intent: clarity
Original:  First, the multi-path planning is to generate several paths only considering static constraints .
Revised:  First, the multi-path planning is to generate several paths only considering static traffic elements .
Edit intent: clarity
Original:  Then, the  optimal tracking is designed to track the optimal path while considering the dynamic obstacles.
Revised:  Then, the dynamic optimal tracking is designed to track the optimal path while considering the dynamic obstacles.
Edit intent: clarity
Original:  To that end, in theory, we formulate a constrained optimal control problem (OCP) for each candidate path, optimize them separately and choose the one with the best tracking performance to follow.
Revised:  To that end, we formulate a constrained optimal control problem (OCP) for each candidate path, optimize them separately and choose the one with the best tracking performance to follow.
Edit intent: coherence
Original:  To that end, in theory, we formulate a constrained optimal control problem (OCP) for each candidate path, optimize them separately and choose the one with the best tracking performance to follow.
Revised:  To that end, in theory, we formulate a constrained optimal control problem (OCP) for each candidate path, optimize them separately and follow the one with the best tracking performance to follow.
Edit intent: coherence
Original:  We verify our framework in both simulation and the real world.
Revised:  We verify our framework in both simulations and the real world.
Edit intent: fluency
Original:  Results show that our method has better online computing efficiency and driving performance including traffic efficiency and safety compared with baseline methods .
Revised:  Results show that our method has better online computing efficiency , as well as better driving performance including traffic efficiency and safety compared with baseline methods .
Edit intent: clarity
Original:  Results show that our method has better online computing efficiency and driving performance including traffic efficiency and safety compared with baseline methods .
Revised:  Results show that our method has better online computing efficiency and driving performance including traffic efficiency and safety .
Edit intent: clarity
Original:  The real road test also suggests that it is applicable in complicated traffic scenarios without even tuning .
Revised:  The effectiveness of the proposed method is also demonstrated in real road tests with complicated traffic conditions .
Edit intent: clarity
Original:  As an application, a search algorithm is designed for this computer model and is found to be  faster than the Grover's search algorithm for the standard quantum computer . Physical implementation of this computation model is discussed.
Revised:  As an application, a search algorithm is designed for this computer model and is found to be faster than the Grover's search algorithm . Physical implementation of this computation model is discussed.
Edit intent: clarity
Original:  A set of basic logical gates are constructed and their universality is proved rigorously .
Revised:  A set of basic logical gates are constructed and their universality is proved .
Edit intent: clarity
Original: How can minorities of regular individuals overturn social conventions?
Revised: How can minorities of individuals overturn social conventions?
Edit intent: clarity
Original:  Theoretical and empirical studies have proposed that when a committed minority reaches a critical group size-ranging from 10\% of the population up to 40\%-a cascade of behaviour change rapidly increases the acceptance of the minority view and apparently stable social norms can be overturned.
Revised:  Theoretical and empirical studies have proposed that when a committed minority reaches a critical size a cascade of behavioural changes can occur, overturning apparently stable social norms can be overturned.
Edit intent: clarity
Original:  In some cases, even groups as small as 0.3\% may overturn the current social norm.
Edit intent: coherence
Original:  Our findings reconcile the numerous observational accounts of rapid change in social convention triggered by committed minorities with the apparent difficulty of establishing such large minorities in the first place.
Revised:  Our findings reconcile the different sizes of critical mass found in previous empirical and theoretical investigations by unveiling the critical role played by groups in modulating the minority takeover. This further highlights the importance of the first place.
Edit intent: clarity
Original:  However, it was recently demonstrated that the extension of the stochastic quasi-steady-state approximation to an open Michaelis-Menten reaction mechanism is only valid under a condition that is far more restrictive than the qualifier that ensures the validity of its corresponding deterministic quasi-steady-state approximation.
Revised:  However, it was recently demonstrated that the extension of the stochastic quasi-steady-state approximation to an open Michaelis--Menten reaction mechanism is only valid under a condition that is far more restrictive than the qualifier that ensures the validity of its corresponding deterministic quasi-steady-state approximation.
Edit intent: fluency
Original:  In this paper, we explain this discrepancy through the rigorous application of geometric singular perturbation theory.
Revised:  In this paper, we suggest a possible explanation for this discrepancy from the lens of geometric singular perturbation theory.
Edit intent: clarity
Original:  In so doing, we illustrate a common misconception in the application of the quasi-steady-state approximation: a problem which involves timescale separation is not always a singular perturbationproblem .
Revised:  In so doing, we illustrate a misconception in the application of the quasi-steady-state approximation: a problem which involves timescale separation is not always a singular perturbationproblem .
Edit intent: clarity
Original:  In so doing, we illustrate a common misconception in the application of the quasi-steady-state approximation: a problem which involves timescale separation is not always a singular perturbationproblem .
Revised:  In so doing, we illustrate a common misconception in the application of the quasi-steady-state approximation: timescale separation does not imply singular perturbation .
Edit intent: clarity
Original:  We address this limitation with inspirations from quantum theory, which contains principled approaches for modeling complicated interactions and correlations.
Revised:  We address this limitation with inspirations from quantum theory, which contains principled methods for modeling complicated interactions and correlations.
Edit intent: clarity
Original: The CRISPR/Cas9 system acts as the prokariotic immune system and has important applications in gene editing.
Revised: The CRISPR/Cas9 system acts as the prokaryotic immune system and has important applications in gene editing.
Edit intent: fluency
Original:  The protein Cas9 is a crucial component of this system .
Revised:  The protein Cas9 is one of its crucial components .
Edit intent: clarity
Original:  In this Letter, we show that a model of facilitated diffusion fits data from single-molecule experiments and predicts that Cas9 search for targets by sliding, but with a short sliding length .
Revised:  In this Letter, we introduce a model of facilitated diffusion fits data from single-molecule experiments and predicts that Cas9 search for targets by sliding, but with a short sliding length .
Edit intent: clarity
Original:  In this Letter, we show that a model of facilitated diffusion fits data from single-molecule experiments and predicts that Cas9 search for targets by sliding, but with a short sliding length .
Revised:  In this Letter, we show that a model of facilitated diffusion fits data from single-molecule experiments . Our model confirms that Cas9 search for targets by sliding, but with a short sliding length .
Edit intent: clarity
Original:  In this Letter, we show that a model of facilitated diffusion fits data from single-molecule experiments and predicts that Cas9 search for targets by sliding, but with a short sliding length .
Revised:  In this Letter, we show that a model of facilitated diffusion fits data from single-molecule experiments and predicts that Cas9 search for targets by sliding, but shows that its sliding length is rather short .
Edit intent: clarity
Original:  We then investigate how Cas9 explores a long  DNA containing randomly placed targets.
Revised:  We then investigate how Cas9 explores a long stretch of DNA containing randomly placed targets.
Edit intent: clarity
Original:  To further advance the technology in this area, in this paper we propose a novel framework to incorporate human prior knowledge in the training of DRL agents .
Revised:  To further advance the technology in this paper proposes a novel framework to incorporate human prior knowledge in the training of DRL agents .
Edit intent: clarity
Original:  To validate the proposed method in autonomous driving applications, two simulated urban driving scenarios , i.e., the unprotected left turn and roundabout , are designedalong with human expert demonstrations .
Revised:  To validate the proposed method in autonomous driving applications, two simulated urban driving scenarios ( unprotected left turn and roundabout , are designedalong with human expert demonstrations .
Edit intent: coherence
Original:  To validate the proposed method in autonomous driving applications, two simulated urban driving scenarios , i.e., the unprotected left turn and roundabout , are designedalong with human expert demonstrations .
Revised:  To validate the proposed method in autonomous driving applications, two simulated urban driving scenarios , i.e., the unprotected left turn and roundabout ) are designed .
Edit intent: coherence
Original:  In testing conditions, the agent trained by our method obtains the highest success rate and shows diverse driving behaviors with human-like features demonstrated by the human expert.
Revised:  In testing conditions, the agent trained by our method obtains the highest success rate and shows diverse driving behaviors as demonstrated by the human expert.
Edit intent: clarity