wanyu/IteraTeR_v2 huggingface dataset:
Original:  We use timed regular expressions as a compact, natural  and highly-expressive  specification language for monitoring applications involving  timing constraints.
Revised:  We use timed regular expressions as a compact, natural , and highly-expressive specification language for monitoring applications involving timing constraints.
Edit intent: fluency
Original:  Besides it is designed to work nicely with other tools via standard interfaces to perform more complex and versatile verification and validation tasks .
Revised:  Besides it is designed to work with other tools via standard interfaces to perform more complex and versatile verification and validation tasks .
Edit intent: clarity
Original:  As the first of its kind, we think Montre will enable a new line of inquiries and techniques to analyze real-time behaviors .
Revised:  As the first of its kind, we believe Montre will enable a new line of inquiries and techniques to analyze real-time behaviors .
Edit intent: fluency
Original:  As the first of its kind, we think Montre will enable a new line of inquiries and techniques to analyze real-time behaviors .
Revised:  As the first of its kind, we think Montre will enable a new line of inquiries and techniques in these fields .
Edit intent: clarity
Original: BeatBox combines flexible script language user interface with robust solvers to set up cardiac electrophysiology in-silico experiments without  re-compilation.
Revised: The BeatBox simulation environment combines flexible script language user interface with robust solvers to set up cardiac electrophysiology in-silico experiments without re-compilation.
Edit intent: clarity
Original: BeatBox combines flexible script language user interface with robust solvers to set up cardiac electrophysiology in-silico experiments without  re-compilation.
Revised: BeatBox combines flexible script language user interface with the robust computational tools, in order to setup cardiac electrophysiology in-silico experiments without re-compilation.
Edit intent: clarity
Original:  It is free C software run on Unix platforms sequentially or in MPI, for multi scale modelling from single cell to whole heart simulations with run-time local/global measurements , cardiac re- entry tip/filament tracing, etc.
Revised:  BeatBox is a free software written in C language to be run on a Unix-based platform. It provides the whole spectrum of multi scale tissue modelling from 0-dimensional individual cell simulation, 1-dimensional fibre, 2-dimensional sheet and 3-dimensional slab of tissue, up to anatomically realistic whole heart simulations with run-time local/global measurements , cardiac re- entry tip/filament tracing, etc.
Edit intent: clarity
Original:  It is free C software run on Unix platforms sequentially or in MPI, for multi scale modelling from single cell to whole heart simulations with run-time local/global measurements , cardiac re- entry tip/filament tracing, etc.
Revised:  It is free C software run on Unix platforms sequentially or in MPI, for multi scale modelling from single cell to whole heart simulations , with run time measurements including cardiac re-entry tip/filament tracing, etc.
Edit intent: clarity
Original:  However, the conventional registration approaches usually require long computational time for high quality images and video frames.
Revised:  However, conventional registration approaches usually require long computational time for high quality images and video frames.
Edit intent: coherence
Original:  However, the conventional registration approaches usually require long computational time for high quality images and video frames.
Revised:  However, the conventional registration approaches usually require long computational time for high resolution images and video frames.
Edit intent: clarity
Original:  This hinders the applications of the registration approaches in the modern industries.
Revised:  This hinders the application of the registration approaches in the modern industries.
Edit intent: fluency
Original:  In this work, we propose a novel approach called%DIFDELCMD < {\em %DIFDELCMD < %%% TRIM to accelerate the computations of the registration by triangulating the images .
Revised:  In this work, we %DIFDELCMD < {\em %DIFDELCMD < %%% TRIM to accelerate the computations of the registration by triangulating the images .
Edit intent: clarity
Original:  In this work, we propose a novel approach called%DIFDELCMD < {\em %DIFDELCMD < %%% TRIM to accelerate the computations of the registration by triangulating the images .
Revised:  In this work, we propose a novel approach called%DIFDELCMD < {\em %DIFDELCMD < %%% TRIM to accelerate the registration process by triangulating the images .
Edit intent: clarity
Original:  Then, the computation of the registration can be simplified with the aid of the coarse triangulation . Experimental results suggest that the computational time of the registration is significantly reduced using our triangulation-based approach, meanwhile the accuracy of the registration is well retained when compared with the conventional grid-based  approach.
Revised:  Then, the computation of the registration can be simplified with the aid of the coarse triangulation . Experimental results suggest that the computational time of the registration is significantly reduced using our triangulation-based approach, meanwhile the accuracy of the registration is well retained when compared with the conventional grid-based approach. Also, the computational time of the registration is significantly reduced using our triangulation-based approach.
Edit intent: coherence
Original:  The finite element analysis is performed with subdivision basis functions corresponding to a sufficiently fine control mesh.
Revised:  The finite element analysis is performed with subdivision basis functions corresponding to a sufficiently refined control mesh.
Edit intent: clarity
Original:  The proposed approach is applied to three optimisation examples, namely a catenary,  roof over a rectangular domain and  freeform architectural shell roof.
Revised:  The proposed approach is applied to three optimisation examples, namely a catenary, a roof over a rectangular domain and freeform architectural shell roof.
Edit intent: fluency
Original:  The proposed approach is applied to three optimisation examples, namely a catenary,  roof over a rectangular domain and  freeform architectural shell roof.
Revised:  The proposed approach is applied to three optimisation examples, namely a catenary, roof over a rectangular domain and a freeform architectural shell roof.
Edit intent: fluency
Original:  The influence of the geometry description and the used subdivision scheme on the obtained optimised curved geometries are investigated in detail.
Revised:  The influence of the geometry description and the used subdivision scheme on the obtained optimised curved geometries is investigated in detail.
Edit intent: fluency
Original:  Naming game, on the other hand, is a social communication model that simulates the process of learning a name of an object within a community of humans, where the individuals can  reach global consensus on naming an object asymptotically through iterative pair-wise conversations.
Revised:  Naming game, on the other hand, is a social communication model that simulates the process of learning a name of an object within a community of humans, where the individuals can generally reach global consensus on naming an object asymptotically through iterative pair-wise conversations.
Edit intent: coherence
Original:  Naming game, on the other hand, is a social communication model that simulates the process of learning a name of an object within a community of humans, where the individuals can  reach global consensus on naming an object asymptotically through iterative pair-wise conversations.
Revised:  Naming game, on the other hand, is a social communication model that simulates the process of learning a name of an object within a community of humans, where the individuals can reach global consensus asymptotically through iterative pair-wise conversations.
Edit intent: clarity
Original:  The underlying communication network indicates the relationships among the individuals.
Revised:  The underlying network indicates the relationships among the individuals.
Edit intent: clarity
Original:  In this paper, three typical topologies of human communication networks , namely random-graph, small-world and scale-free networks, are employed, which are embedded with the multi-local-world community structure, to study the naming game.
Revised:  In this paper, three typical topologies , namely random-graph, small-world and scale-free networks, are employed, which are embedded with the multi-local-world community structure, to study the naming game.
Edit intent: clarity
Original:  Simulations show that 1) when the intra-community connections increase while the inter-community connections remain to be unchanged, the convergence to global consensus is slow and eventually might fail;
Revised:  Simulations show that 1) the convergence process to global consensus is slow and eventually might fail;
Edit intent: clarity
Original:  2) when the inter-community connections are sufficiently dense, both the number and the size of the communities do not affect the convergence process;
Revised:  2) if the inter-community connections are sufficiently dense, both the number and the size of the communities do not affect the convergence process;
Edit intent: fluency
Original:  2) when the inter-community connections are sufficiently dense, both the number and the size of the communities do not affect the convergence process;
Revised:  2) when the inter-community connections are sufficiently dense, neither the number nor the size of the communities do not affect the convergence process;
Edit intent: fluency
Original:  2) when the inter-community connections are sufficiently dense, both the number and the size of the communities do not affect the convergence process;
Revised:  2) when the inter-community connections are sufficiently dense, both the number and the size of the communities affects the convergence process;
Edit intent: clarity
Original: In this work , we introduce a novel interpretation of residual networks showing they are exponential ensembles.
Revised: In this work we propose a novel interpretation of residual networks showing they are exponential ensembles.
Edit intent: clarity
Original:  For example, contrary to our expectations, most of the gradient in a residual network with 110 layers comes from an ensemble of very short networks, i.e., only 10-34 layers deep.
Revised:  For example, most of the gradient in a residual network with 110 layers comes from an ensemble of very short networks, i.e., only 10-34 layers deep.
Edit intent: clarity
Original:  For example, contrary to our expectations, most of the gradient in a residual network with 110 layers comes from an ensemble of very short networks, i.e., only 10-34 layers deep.
Revised:  For example, contrary to our expectations, most of the gradient in a residual network with 110 layers comes from paths that are only 10-34 layers deep.
Edit intent: clarity
Original:  In some circumstances, two species of motors that are directed oppositely (e.g. kinesin, dynein) can be attached to the same cargo .
Revised:  Two species of motors that are directed oppositely (e.g. kinesin, dynein) can be attached to the same cargo .
Edit intent: clarity
Original:  The resulting net motion is known to be bidirectional , but the mechanism of switching remains unclear.
Revised:  The resulting net motion is known to produce bidirectional net motion. However, the mechanism of switching remains unclear.
Edit intent: clarity
Original:  In this work , we propose a mean-field mathematical model of the mechanical interactions of two populations of molecular motors with diffusion of the cargo (thermal fluctuations ) as the fundamental noise source.
Revised:  In this work , we propose a mean-field mathematical model of mechanical interactions of two populations of molecular motors with diffusion of the cargo (thermal fluctuations ) as the fundamental noise source.
Edit intent: fluency
Original:  The system is then found to be "metastable", switching between two distinct directional transport states , or bidirectional motion .
Revised:  The system is then found to be "metastable", switching between two distinct directional transport states .
Edit intent: clarity
Original:  Although previous work focuses on the motor number as the driving noise source for switching, this work proposes an alternative possibility : cargo diffusion.
Revised:  Although previous work focuses on the motor number as the driving noise source for switching, we propose an alternative mechanism : cargo diffusion.
Edit intent: clarity
Original:  The system is then found to be metastable, with switching exclusively due to cargo diffusion between two distinct directional transport states.
Revised:  The system is then found to be metastable, with switching exclusively due to cargo diffusion between distinct directional transport states.
Edit intent: clarity
Original:  The switching time is found to be non-monotonic in the drag of the cargo, providing an experimental prediction for verification .
Revised:  The switching time is found to be non-monotonic in the drag of the cargo, providing an experimental test of the theory .
Edit intent: clarity
Original:  The structure of a biological population affects the outcome of evolutionary processes.
Revised: Evolution occurs in populations of reproducing individuals. The structure of a biological population affects the outcome of evolutionary processes.
Edit intent: clarity
Original:  Precise results have been absent for a long time, but have recently emerged for the special case where each individual has the same number of neighbors.
Revised:  Precise results have been absent for a long time, but have recently emerged for special structures where all individuals have the same number of neighbors.
Edit intent: clarity
Original:  But the general problem of determining natural selection , when the number of neighbors varies , has remained open.
Revised:  But the problem of determining natural selection , when the number of neighbors varies , has remained open.
Edit intent: clarity
Original:  But the general problem of determining natural selection , when the number of neighbors varies , has remained open.
Revised:  But the general problem of determining which trait is favored by selection in the natural case where the number of neighbors varies , has remained open.
Edit intent: clarity
Original:  But the general problem of determining natural selection , when the number of neighbors varies , has remained open.
Revised:  But the general problem of determining natural selection , when the number of neighbors can vary , has remained open.
Edit intent: clarity
Original:  But whether there exists a simple solution for weak selection was unanswered.
Revised:  Whether there exists a simple solution for weak selection was unanswered.
Edit intent: coherence
Original:  In particular, we show the reliability for non-conforming N\'{e}d\'{e}lec elements based on a residual type argument and a Helmholtz-Weyl decomposition of W _0^p (curl;\Omega).
Revised:  In particular, we show the reliability for non-conforming N\'{e}d\'{e}lec elements based on a residual type argument and a Helmholtz-Weyl decomposition of W ^p_0 (curl;\Omega).
Edit intent: clarity
Original: We study a stochastic online problem of learning to influence in a social network with semi-bandit feedback, individual observations of how influenced users influence others.
Revised: We study the stochastic online problem of learning to influence in a social network with semi-bandit feedback, individual observations of how influenced users influence others.
Edit intent: fluency
Original:  Our problem combines challenges of partial monitoring , because the learning agent only observes the influenced portion of the network, and combinatorial bandits , because the cardinality of the feasible set is exponential in the maximum number of influencers.
Revised:  Our problem combines challenges of limited feedback , because the learning agent only observes the influenced portion of the network, and combinatorial bandits , because the cardinality of the feasible set is exponential in the maximum number of influencers.
Edit intent: clarity
Original:  Our problem combines challenges of partial monitoring , because the learning agent only observes the influenced portion of the network, and combinatorial bandits , because the cardinality of the feasible set is exponential in the maximum number of influencers.
Revised:  Our problem combines challenges of partial monitoring , because the learning agent only observes the influenced portion of the network, and combinatorial number of actions , because the cardinality of the feasible set is exponential in the maximum number of influencers.
Edit intent: clarity
Original:  We propose a computationally efficient UCB-like algorithm for solving our problem , IMLinUCB, and analyze it on forests .
Revised:  We propose a computationally efficient UCB-like algorithm , IMLinUCB, and analyze it on forests .
Edit intent: clarity
Original:  We propose a computationally efficient UCB-like algorithm for solving our problem , IMLinUCB, and analyze it on forests .
Revised:  We propose a computationally efficient UCB-like algorithm for solving our problem , IMLinUCB, and analyze it .
Edit intent: clarity
Original:  and do not depend on inherently large quantities, such as the reciprocal of the minimum probability of being influenced and the cardinality of the action set.
Revised:  and do not depend on inherently large quantities, such as the cardinality of the action set.
Edit intent: clarity
Original:  We evaluate IMLinUCB on several synthetic problems and observe that the regret of IMLinUCB scales as suggested by our upper bounds .
Revised:  Our experiments show that the regret of IMLinUCB scales as suggested by our upper bounds .
Edit intent: clarity
Original:  IMLinUCB permits linear generalization and therefore is suitable for large-scale problems.
Edit intent: coherence
Original:  Our experiments show that  the regret of IMLinUCB scales as suggested by our upper bounds in several representative graph topologies;
Revised:  Our experiments show that in several representative graph topologies, the regret of IMLinUCB scales as suggested by our upper bounds in several representative graph topologies;
Edit intent: fluency
Original:  and based on linear generalization , IMLinUCB can significantly reduce regret of real-world influence maximization semi-bandits .
Revised:  and based on linear generalization , IMLinUCB can significantly reduce regret of real-world online influence maximization .
Edit intent: clarity
Original: We propose a novel measure of heterogeneity for unweighted and undirected complex networks that can be derived from the degree distribution of the network instead of the degree sequences, as is done at present .
Revised: We propose a novel measure of degree heterogeneity, for unweighted and undirected complex networks that can be derived from the degree distribution of the network instead of the degree sequences, as is done at present .
Edit intent: fluency
Original: We propose a novel measure of heterogeneity for unweighted and undirected complex networks that can be derived from the degree distribution of the network instead of the degree sequences, as is done at present .
Revised: We propose a novel measure of heterogeneity for unweighted and undirected complex networks , which requires only the degree distribution of the network instead of the degree sequences, as is done at present .
Edit intent: clarity
Original: We propose a novel measure of heterogeneity for unweighted and undirected complex networks that can be derived from the degree distribution of the network instead of the degree sequences, as is done at present .
Revised: We propose a novel measure of heterogeneity for unweighted and undirected complex networks that can be derived from the degree distribution of the network for its computation .
Edit intent: clarity
Original:  We show that the proposed measure can be applied to all types of  topology with ease and shows direct correlation with the diversity of node degrees in the network.
Revised:  We show that the proposed measure can be applied to all types of network topology with ease and shows direct correlation with the diversity of node degrees in the network.
Edit intent: fluency
Original:  The measure is mathematically well behaved and is normalised in the interval 0, 1%DIFDELCMD < ]%%% . The measure is applied to compute the heterogeneity of synthetic (both random and scale free) and real world networks .
Revised:  The measure is 0, 1%DIFDELCMD < ]%%% . The measure is applied to compute the heterogeneity of synthetic (both random and scale free) and real world networks .
Edit intent: coherence
Original:  The measure is mathematically well behaved and is normalised in the interval 0, 1%DIFDELCMD < ]%%% . The measure is applied to compute the heterogeneity of synthetic (both random and scale free) and real world networks .
Revised:  The measure is mathematically well behaved and is normalised in the interval %DIFDELCMD < ]%%% . The measure is applied to compute the heterogeneity of synthetic (both random and scale free) and real world networks .
Edit intent: coherence
Original:  The measure is mathematically well behaved and is normalised in the interval 0, 1%DIFDELCMD < ]%%% . The measure is applied to compute the heterogeneity of synthetic (both random and scale free) and real world networks .
Revised:  The measure is mathematically well behaved and is normalised in the interval 0, 1%DIFDELCMD < ]%%% applied to compute the heterogeneity of synthetic (both random and scale free) and real world networks .
Edit intent: coherence
Original:  Finally, as a specific application, we show that the proposed measure can be used to compare the heterogeneity of recurrence networks constructed from the time series of several low dimensional chaotic attractors, thereby providing a single index to compare the structural complexity of chaotic attractors.
Revised:  Finally, as a specific application, we show that the proposed measure can be used to compare the heterogeneity of recurrence networks constructed from the time series of several low dimensional chaotic attractors9thereby providing a single index to compare the structural complexity of chaotic attractors.
Edit intent: coherence
Original:  Here we consider the case of prior procedural knowledge  such as knowing the overall recursive structure of a sequence transduction program or the fact that a program will likely use arithmetic operations on real numbers to solve a task.
Revised:  Here we consider the case of prior procedural knowledge , such as knowing the overall recursive structure of a sequence transduction program or the fact that a program will likely use arithmetic operations on real numbers to solve a task.
Edit intent: fluency
Original:  Through a neural implementation of the dual stack machine that underlies Forth, programmers can write program sketches with slots that can be filled with learnable behaviour .
Revised:  Through a neural implementation of the dual stack machine that underlies Forth, programmers can write program sketches with slots that can be filled with behaviour trained from program input-output data .
Edit intent: clarity
Original:  Here we consider the case of prior procedural knowledge  , such as knowing the overall recursive structure of a sequence transduction program or the fact that a program will likely use arithmetic operations on real numbers to solve a task .
Revised:  In this paper, we consider the case of prior procedural knowledge , such as knowing the overall recursive structure of a sequence transduction program or the fact that a program will likely use arithmetic operations on real numbers to solve a task .
Edit intent: clarity