wanyu/IteraTeR_v2 huggingface dataset:
Original: In this paper, we introduce a concise LFS-DA method, which is able to achieve an exact balance between electricity demand and supply for each time slot throughout learning phase.
Revised: In this paper, we introduce a concise LFS-DA can achieve an exact balance between electricity demand and supply for each time slot throughout learning phase.
Edit intent: clarity
Original:  We proved that the price profile dynamics of the LFS-DA method are equal to those achieved by RTP controlled by the algorithm derived from the dual decomposition framework after deriving the RTP algorithm.
Revised:  We proved that the changes in the price profile of the LFS-DA method are equal to those achieved by RTP controlled by the algorithm derived from the dual decomposition framework after deriving the RTP algorithm.
Edit intent: clarity
Original:  We proved that the price profile dynamics of the LFS-DA method are equal to those achieved by RTP controlled by the algorithm derived from the dual decomposition framework after deriving the RTP algorithm.
Revised:  We proved that the price profile dynamics of the LFS-DA mechanism are equal to those achieved by RTP controlled by the algorithm derived from the dual decomposition framework after deriving the RTP algorithm.
Edit intent: clarity
Original:  We proved that the price profile dynamics of the LFS-DA method are equal to those achieved by RTP controlled by the algorithm derived from the dual decomposition framework after deriving the RTP algorithm.
Revised:  We proved that the price profile dynamics of the LFS-DA method are equal to those achieved by the RTP mechanism derived from the dual decomposition framework after deriving the RTP algorithm.
Edit intent: clarity
Original: The idea that a group of cooperating agents can solve problems more efficiently than when those agents work independently is hardly controversial, despite the little quantitative groundwork to support it .
Revised: The idea that a group of cooperating agents can solve problems more efficiently than when those agents work independently is hardly controversial, despite our obliviousness of the conditions that make cooperation a successful problem solving strategy .
Edit intent: clarity
Original: Molecular motors and cytoskeletal filaments mostly work collectively under opposing forces.
Revised: Molecular motors and cytoskeletal filaments work collectively most of the time under opposing forces.
Edit intent: clarity
Original:  This opposing force may be due to cargo carried by motors , or resistance coming from  cell membrane pressing against the cytoskeletal filaments.
Revised:  This opposing force may be due to cargo carried by motors or resistance coming from cell membrane pressing against the cytoskeletal filaments.
Edit intent: fluency
Original:  This opposing force may be due to cargo carried by motors , or resistance coming from  cell membrane pressing against the cytoskeletal filaments.
Revised:  This opposing force may be due to cargo carried by motors , or resistance coming from the cell membrane pressing against the cytoskeletal filaments.
Edit intent: fluency
Original:  To understand this phenomena of excess or deficit collective force generation , we study a broad class of models of both cytoskeletal filaments and molecular motors.
Revised:  To understand this excess or deficit collective force generation , we study a broad class of models of both cytoskeletal filaments and molecular motors.
Edit intent: clarity
Original:  To understand this phenomena of excess or deficit collective force generation , we study a broad class of models of both cytoskeletal filaments and molecular motors.
Revised:  To understand this phenomena of excess or deficit in the collective force , we study a broad class of models of both cytoskeletal filaments and molecular motors.
Edit intent: clarity
Original:  Consequently , we show that this additivity typically does not hold  when the system departs from equilibrium at stall.
Revised:  Conversely , we show that this additivity typically does not hold when the system departs from equilibrium at stall.
Edit intent: coherence
Original:  Consequently , we show that this additivity typically does not hold  when the system departs from equilibrium at stall.
Revised:  Consequently , we show that this additive property typically does not hold when the system departs from equilibrium at stall.
Edit intent: clarity
Original:  Consequently , we show that this additivity typically does not hold  when the system departs from equilibrium at stall.
Revised:  Consequently , we show that this additivity typically does not hold true when the system departs from equilibrium at stall.
Edit intent: clarity
Original:  Consequently , we show that this additivity typically does not hold  when the system departs from equilibrium at stall.
Revised:  Consequently , we show that this additivity typically does not hold when the system is not at equilibrium at stall.
Edit intent: clarity
Original:  We thus present a novel and unified understanding of  existing models exhibiting such non- addivity, and generalize our arguments by developing new models that demonstrate this phenomena.
Revised:  We thus present a novel and unified understanding of the existing models exhibiting such non- addivity, and generalize our arguments by developing new models that demonstrate this phenomena.
Edit intent: fluency
Original:  We thus present a novel and unified understanding of  existing models exhibiting such non- addivity, and generalize our arguments by developing new models that demonstrate this phenomena.
Revised:  We thus present a novel and unified understanding of existing models exhibiting such non-addivity, and generalise our arguments by developing new models that demonstrate this phenomena.
Edit intent: fluency
Original:  We also propose a quantity similar to thermodynamic efficiency to provide a simple understanding of deviation from stall-force additivity for filament and motor collectives.
Revised:  We also propose a quantity similar to thermodynamic efficiency to easily predict this deviation from stall-force additivity for filament and motor collectives.
Edit intent: clarity
Original:  iii) V2V and V2I communication have distinct awareness and interference patterns;
Revised:  iii) V2V and V2I communication have distinct awareness patterns;
Edit intent: clarity
Original:  and v) achieving high awareness levels results in increased interference ;
Revised:  and v) achieving high awareness levels results in increased reception of potentially unwanted messages ;
Edit intent: clarity
Original:  higher transmit power and fewer messages transmissions are a better approach, since message delivery is dominated by shadowing. ii) the efficacy of cooperative awareness varies greatly in different environments on both large scale (e.g., 90 \% awareness is achievable up to 200 m in urban and over 500 m \\%DIF > awareness is achievable up to 200~m in urban and over 500~m in highway) and small scale (e.g., vehicles in nearby streets can have significantly different awareness);
Revised:  higher transmit power and fewer messages transmissions are a better approach, since message delivery is dominated by shadowing. ii) the efficacy of cooperative awareness varies greatly in different environments on both large scale (e.g., 90 \\%DIF > awareness is achievable up to 200~m in urban and over 500~m in highway) and small scale (e.g., vehicles in nearby streets can have significantly different awareness);
Edit intent: fluency
Original: Online social networks represent a popular and highly diverse class of social media systems.
Revised: Online social networks represent a popular and diverse class of social media systems.
Edit intent: clarity
Original:  We then exploit natural experiments embedded in this dataset and complementary data obtained via Internet archaeology to show that different subnetworks , e.g., among students and among alumni, matured at different rates toward similar end states.
Revised:  We then exploit natural experiments embedded in this dataset and complementary data obtained via Internet archaeology to show that different subnetworks matured at different rates toward similar end states.
Edit intent: coherence
Original:  These results shed new light on the processes and patterns of online social network assembly, and may facilitate more effective design for online social systems.
Revised:  These results shed light on the processes and patterns of online social network assembly, and may facilitate more effective design for online social systems.
Edit intent: clarity
Original:  Here  we argue how the nature of this modified phase diagram, obtained from a microscopic model of the helix-coil transition in a solvent, would illuminate the turned-out response of IDPs to the changes in the environment conditions that follow straightforwardly from the re-entrant (cold denaturation) branch in their folding phase diagram.
Revised:  Here , we argue how the nature of this modified phase diagram, obtained from a microscopic model of the helix-coil transition in a solvent, would illuminate the turned-out response of IDPs to the changes in the environment conditions that follow straightforwardly from the re-entrant (cold denaturation) branch in their folding phase diagram.
Edit intent: fluency
Original:  Here  we argue how the nature of this modified phase diagram, obtained from a microscopic model of the helix-coil transition in a solvent, would illuminate the turned-out response of IDPs to the changes in the environment conditions that follow straightforwardly from the re-entrant (cold denaturation) branch in their folding phase diagram.
Revised:  Here we argue how the nature of this modified phase diagram, obtained from a model of the helix-coil transition in a solvent, would illuminate the turned-out response of IDPs to the changes in the environment conditions that follow straightforwardly from the re-entrant (cold denaturation) branch in their folding phase diagram.
Edit intent: clarity
Original: We study the effect of the perturbation of the coefficients of a neuronal recurrence equation y(n) of memory size h on its basin of attraction .
Revised: We study the effect of the perturbation of the coefficients of a neuronal recurrence equation y(n) of memory size h on its attracting basin .
Edit intent: clarity
Original:  Firstly, we characterize the structure and the length of all the cycles of the neuronal recurrence equation y(n) of memory size h. Secondly , we apply a perturbation on the neuronal recurrence equation y(n) to obtain a neuronal recurrence equation z(n,d), and we characterize the structure and the length of all the cycles of the neuronal recurrence equation z(n,d).
Revised:  Firstly, we characterize the structure and the length of all the cycles of the neuronal recurrence equation y(n) . Thirdly , we apply a perturbation on the neuronal recurrence equation y(n) to obtain a neuronal recurrence equation z(n,d), and we characterize the structure and the length of all the cycles of the neuronal recurrence equation z(n,d).
Edit intent: clarity
Original: We study the effect of the perturbation of the coefficients of a neuronal recurrence equation y(n) of memory size h on its attracting basin .
Revised: We characterize the structure of the periods of a neuronal recurrence equation y(n) of memory size h on its attracting basin .
Edit intent: clarity
Original: We study the effect of the perturbation of the coefficients of a neuronal recurrence equation y(n) of memory size h on its attracting basin .
Revised: We study the effect of the perturbation of the coefficients of a neuronal recurrence equation .
Edit intent: clarity
Original:  Firstly, we give a characterization of k-chains in 0-1 periodic sequence .
Revised:  Firstly, we give a characterization of k-chains in 0-1 periodic sequences .
Edit intent: fluency
Original:  Secondly, we characterize the periods of all cycles of some neuronal recurrence equations y(n) . Thirdly, we apply a perturbation on the neuronal recurrence equation y(n) to obtain a neuronal recurrence equation z(n,d), and we characterize the structure and the length of all the cycles of the neuronal recurrence equation z(n,d).
Revised:  Secondly, we characterize the periods of all cycles of some neuronal recurrence equation . Thirdly, we apply a perturbation on the neuronal recurrence equation y(n) to obtain a neuronal recurrence equation z(n,d), and we characterize the structure and the length of all the cycles of the neuronal recurrence equation z(n,d).
Edit intent: fluency
Original:  Our second contribution is the first mechanised formalisation of the OpenCL 2.0 memory model, extending our simplified C11 model.
Revised:  Our second contribution is the first mechanised formalisation of the OpenCL (which extends C11 model.
Edit intent: clarity
Original:  We use our improved C11 model to present the first rigorous memory model formalisation for OpenCL (which extends C11 with support for heterogeneous many-core programming).
Revised:  We extend our improved C11 model to present the first rigorous memory model formalisation for OpenCL (which extends C11 with support for heterogeneous many-core programming).
Edit intent: clarity
Original:  We use our improved C11 model to present the first rigorous memory model formalisation for OpenCL (which extends C11 with support for heterogeneous many-core programming).
Revised:  We use our improved C11 model to obtain the first rigorous memory model formalisation for OpenCL (which extends C11 with support for heterogeneous many-core programming).
Edit intent: clarity
Original:  We argue that these strengthenings are natural, and prove that all of the formalised C11 and OpenCL compilation schemes of which we are aware (Power and x86  for C11, AMD GPU for OpenCL) remain valid in our revised models.
Revised:  We argue that these strengthenings are natural, and that all of the formalised C11 and OpenCL compilation schemes of which we are aware (Power and x86 for C11, AMD GPU for OpenCL) remain valid in our revised models.
Edit intent: coherence
Original:  We argue that these strengthenings are natural, and prove that all of the formalised C11 and OpenCL compilation schemes of which we are aware (Power and x86  for C11, AMD GPU for OpenCL) remain valid in our revised models.
Revised:  We argue that these strengthenings are natural, and prove that all of the formalised C11 and OpenCL compilation schemes of which we are aware (Power and x86 for C11, AMD GPUs for OpenCL) remain valid in our revised models.
Edit intent: fluency
Original:  Using the Herd memory model simulator, we show that our overhaul leads to an exponential improvement in simulation time for C11 litmus tests compared with the original model, making *exhaustive* simulation competitive, time-wise, with the *non-exhaustive* CDSChecker tool.
Revised:  Using the Herd memory model simulator, we show that our overhaul leads to an exponential improvement in simulation time for C11 litmus tests compared with the original model, making exhaustive simulation competitive, time-wise, with the *non-exhaustive* CDSChecker tool.
Edit intent: clarity
Original:  Using the Herd memory model simulator, we show that our overhaul leads to an exponential improvement in simulation time for C11 litmus tests compared with the original model, making *exhaustive* simulation competitive, time-wise, with the *non-exhaustive* CDSChecker tool.
Revised:  Using the Herd memory model simulator, we show that our overhaul leads to an exponential improvement in simulation time for C11 litmus tests compared with the original model, making *exhaustive* simulation competitive, time-wise, with the non-exhaustive CDSChecker tool.
Edit intent: fluency
Original:  According to this adaptation mechanism, edges in the network  are randomly removed or added , depending on the risk of spread through them.
Revised:  According to this adaptation mechanism, edges in the network model are randomly removed or added , depending on the risk of spread through them.
Edit intent: clarity
Original:  According to this adaptation mechanism, edges in the network  are randomly removed or added , depending on the risk of spread through them.
Revised:  According to this adaptation mechanism, edges in the network are randomly removed or added depending on the risk of spread through them.
Edit intent: fluency
Original:  We illustrate our results with numerical simulations in a real human contact network .
Revised:  We illustrate our results with numerical simulations .
Edit intent: clarity
Original:  In this paper, we fundamentally tackle this problem and explicitly evaluate interference factor f for any mobile location m in a hexagonal network composed of omni-directional or tri-sectorized sites.
Revised:  In this paper, we fundamentally tackle this problem and explicitly evaluate interference factor f for any mobile location m in a hexagonal wireless network, whether composed of omni-directional or tri-sectorized sites.
Edit intent: clarity
Original:  The derived expression of f is used to show further that the SINR distribution is explicit as well and it is provided for any arbitrary mobile location distribution , reflecting the spatial traffic density in the network.
Revised:  The derived expression of f is used to show further that the SINR distribution is explicit as well and it is provided for any arbitrary distribution of mobile user locations , reflecting the spatial traffic density in the network.
Edit intent: clarity
Original:  III. Alteration of structure made by Misrepair is irreversible ;
Revised:  III. Alteration of structure made by Misrepair is irreversible ,
Edit intent: fluency
Original:  Accumulation of Misrepairs takes place on molecular, cellular and tissue levels respectively: on tissue level, it appears as disorganization of cells and extracellular matrixes (ECMs) ;
Revised:  Accumulation of Misrepairs takes place on molecular, cellular and tissue levels respectively: on tissue level, it appears as disorganization of cells and extracellular matrixes (ECMs) ,
Edit intent: fluency
Original:  on cellular level, it appears as deformation of cytoskeleton and change of cell shape ;
Revised:  on cellular level, it appears as deformation of cytoskeleton and change of cell shape ,
Edit intent: fluency
Original:  III. Alteration of structure made by Misrepair is irreversible , therefore Misrepairs accumulate and disorganize gradually a structure, which appears as aging of it.
Revised:  III. Alteration of structure made by Misrepair is irreversible ; therefore Misrepairs accumulate and disorganize gradually a structure, which appears as aging of it.
Edit intent: fluency
Original:  Accumulation of Misrepairs takes place on molecular, cellular and tissue levels respectively: on tissue level, it appears as disorganization of cells and extracellular matrixes (ECMs) , on cellular level, it appears as deformation of cytoskeleton and change of cell shape , and on DNA, it appears as accumulation of DNA mutations and alteration of DNA sequence.
Revised:  Accumulation of Misrepairs takes place on molecular, cellular and tissue levels respectively: on tissue level, it appears as disorganization of cells and extracellular matrixes (ECMs) ; on cellular level, it appears as deformation of cytoskeleton and change of cell shape , and on DNA, it appears as accumulation of DNA mutations and alteration of DNA sequence.
Edit intent: fluency
Original:  Accumulation of Misrepairs takes place on molecular, cellular and tissue levels respectively: on tissue level, it appears as disorganization of cells and extracellular matrixes (ECMs) , on cellular level, it appears as deformation of cytoskeleton and change of cell shape , and on DNA, it appears as accumulation of DNA mutations and alteration of DNA sequence.
Revised:  Accumulation of Misrepairs takes place on molecular, cellular and tissue levels respectively: on tissue level, it appears as disorganization of cells and extracellular matrixes (ECMs) , on cellular level, it appears as deformation of cytoskeleton and change of cell shape ; and on DNA, it appears as accumulation of DNA mutations and alteration of DNA sequence.
Edit intent: fluency
Original:  The current exponential increase in biological data is also exponentially increasing meta-database sizes.
Revised:  However,the current exponential increase in biological data is also exponentially increasing meta-database sizes.
Edit intent: coherence
Original:  The current exponential increase in biological data is also exponentially increasing meta-database sizes.
Revised:  The current exponential increase in biological data leads to exponentially increasing meta-database sizes.
Edit intent: clarity
Original:  In particular, there is  a need either to run an analysis with a particular version of a meta-database, or to rerun an analysis with an updated meta-database.
Revised:  In particular, there is often a need either to run an analysis with a particular version of a meta-database, or to rerun an analysis with an updated meta-database.
Edit intent: clarity
Original:  We present the GeStore system, as well as an evaluation of the performance characteristics of the system, and an evaluation of the benefits for a biological data analysis workflow.
Revised:  We present the GeStore system, an evaluation of the performance characteristics of the system, and an evaluation of the benefits for a biological data analysis workflow.
Edit intent: coherence
Original:  The common guideline is to solve them by a numerical iterative method ( e.g. Newton-Raphson method).
Revised:  The common guideline is to solve them by a numerical iterative method e.g. Newton-Raphson method).
Edit intent: fluency
Original:  But the number of solutions can be exponential and methods should provide solutions close to a sketch drawn by the user.
Revised:  However the number of solutions can be exponential and methods should provide solutions close to a sketch drawn by the user.
Edit intent: fluency
Original:  Assuming that a decomposition-recombination planner is used, we consider irreducible problems.
Edit intent: coherence
Original:  We aim at finding several solutions close to the sketch on a one-dimensional path defined by a global parameter-homotopy using the construction plan.
Revised:  We aim at finding several solutions close to the sketch on a one-dimensional path defined by a global parameter-homotopy using a construction plan.
Edit intent: fluency
Original:  The common guideline is to solve them by a numerical iterative method e.g.
Revised:  The common guideline is to solve them by a numerical iterative method (
Edit intent: coherence
Original:  It is applicable where the classes are believed to share a common covariance matrix of interest  obscured by class-dependent noise.
Revised:  It is applicable where the classes are believed to share a common covariance matrix of interest that is obscured by class-dependent noise.
Edit intent: clarity
Original:  As such, it provides a basis for integrative or meta-analysis of covariance matrices where the classes are formed by datasets.
Revised:  As such, it provides a basis for meta- or integrative analysis of covariance matrices where the classes are formed by datasets.
Edit intent: fluency
Original: Estimating gene networks in combination with posthoc analysis based on data from malignant tissue is a major challenge in cancer systems biology as it allows us to improve our understanding of disease pathology and eventually identify new drug targets.
Revised: The estimation of covariance matrices of gene expressions has many applications in cancer systems biology as it allows us to improve our understanding of disease pathology and eventually identify new drug targets.
Edit intent: clarity