wanyu/IteraTeR_v2 huggingface dataset:
Original:  For this so-called stochastic households model, we provide a method for inferring the model parameters -- governing within-household transmission, recovery, and between-household transmission -- from data of the day upon which each individual became infectious and the household in which each infection occurred .
Revised:  For this so-called stochastic households model, we provide a method for inferring the model parameters -- governing within-household transmission, recovery, and between-household transmission---from data of the day upon which each individual became infectious and the household in which each infection occurred .
Edit intent: fluency
Original:  We show that when the field is very young, islands of individual researchers labored in relative isolation, and the co authorship network is disconnected.
Revised:  We show that when the field was very young, islands of individual researchers labored in relative isolation, and the co authorship network is disconnected.
Edit intent: fluency
Original:  We show that when the field is very young, islands of individual researchers labored in relative isolation, and the co authorship network is disconnected.
Revised:  We show that when the field is very young, islands of individual researchers labored in relative isolation, and the coauthorship network was disconnected.
Edit intent: fluency
Original:  We have data from the very earliest years of the field, and thus are able to observe the introduction of two different institutions: the first field-specific conference, and the first field-specific journals.
Revised:  We have data from the very earliest years of the field, a period which includes the introduction of two different institutions: the first field-specific conference, and the first field-specific journals.
Edit intent: clarity
Original:  We also identify two relevant behavioral shifts: a discrete increase in co authorship coincident with the first conference, and a shift among established authors away from collaborating with outsiders, towards collaborating with each other.
Revised:  We also identify two relevant behavioral shifts: a discrete increase in coauthorship coincident with the first conference, and a shift among established authors away from collaborating with outsiders, towards collaborating with each other.
Edit intent: fluency
Original: There are evidences that organic life cannot be reduced to a single biomolecular realm , but, similar to other natural phenomena, rather involves different mechanisms acting at different scale levels, which together define evolvement of the living world.
Revised: There are evidences that organic life cannot be reduced to a single biomolecular realm , acting at different scale levels, which together define evolvement of the living world.
Edit intent: coherence
Original:  Here we show that a certain biophysical mechanism of general nature , acting at a cellular scale level and above , is also an influential factor in life phenomena.
Revised:  Here , we present evidence of existence of a biophysical mechanism of general nature , acting at a cellular scale level and above , is also an influential factor in life phenomena.
Edit intent: clarity
Original:  In inherent unity with biomolecular mechanisms, it governs growth and reproduction of cells , organs and whole organisms , and secures irreversibility of the life cycle progression.
Revised:  In inherent unity with biomolecular mechanisms, it directs growth and reproduction of cells , organs and whole organisms , and secures irreversibility of the life cycle progression.
Edit intent: clarity
Original:  For validation of proposed concepts, we study the growth and division of B. subtilis, Staphylococcus, E. coli, S. pombe and Amoeba using extensive experimental observations.
Revised:  For validation of proposed concepts, we study the growth and division models for B. subtilis, Staphylococcus, E. coli, S. pombe and Amoeba using extensive experimental observations.
Edit intent: clarity
Original:  Here, we present evidence of existence of a biophysical mechanism of general nature (called a general growth law) , which acts at a cellularscale level and above .
Revised:  Here, we present evidence of existence of a physical mechanism (called a general growth law) , which acts at a cellularscale level and above .
Edit intent: clarity
Original:  it directs growth and reproduction of cells and living organisms by imposing constraints on distribution of nutrients between maintenance needs and biomass production , in accordance with the growth equation, which is a mathematical representation of this law . Based on this mechanism and growth equation, we present growth and division models for B. subtilis, Staphylococcus, E. coli, S. pombe and Amoeba, and prove their adequacy by experimental data.
Revised:  it directs growth and reproduction of cells and living organisms by imposing constraints on distribution of nutrients between maintenance needs and biomass production . This law is represented by a growth equation, which is a mathematical representation of this law . Based on this mechanism and growth equation, we present growth and division models for B. subtilis, Staphylococcus, E. coli, S. pombe and Amoeba, and prove their adequacy by experimental data.
Edit intent: clarity
Original:  it directs growth and reproduction of cells and living organisms by imposing constraints on distribution of nutrients between maintenance needs and biomass production , in accordance with the growth equation, which is a mathematical representation of this law . Based on this mechanism and growth equation, we present growth and division models for B. subtilis, Staphylococcus, E. coli, S. pombe and Amoeba, and prove their adequacy by experimental data.
Revised:  it directs growth and reproduction of cells and living organisms by imposing constraints on distribution of nutrients between maintenance needs and biomass production , in accordance with the growth equation, which is a new type of equation of mathematical physics . Based on this mechanism and growth equation, we present growth and division models for B. subtilis, Staphylococcus, E. coli, S. pombe and Amoeba, and prove their adequacy by experimental data.
Edit intent: clarity
Original:  it directs growth and reproduction of cells and living organisms by imposing constraints on distribution of nutrients between maintenance needs and biomass production , in accordance with the growth equation, which is a mathematical representation of this law . Based on this mechanism and growth equation, we present growth and division models for B. subtilis, Staphylococcus, E. coli, S. pombe and Amoeba, and prove their adequacy by experimental data.
Revised:  it directs growth and reproduction of cells and living organisms by imposing constraints on distribution of nutrients between maintenance needs and biomass production , in accordance with the growth equation, which is a mathematical representation of this law . Based on this mechanism , we introduce growth and division models for B. subtilis, Staphylococcus, E. coli, S. pombe and Amoeba, and prove their adequacy by experimental data.
Edit intent: clarity
Original:  An important result, serving both as a confirmation of the proposed theory and , at the same time, enhancing present knowledge, was obtaining a generalized form of logistic formula  , which was derived from the general form of the growth equation for certain geometry of cells.
Revised:  One of the important results, both validating the general growth law and significantly enhancing present knowledge, was obtaining a generalized form of logistic formula , which was derived from the general form of the growth equation for certain geometry of cells.
Edit intent: clarity
Original:  An important result, serving both as a confirmation of the proposed theory and , at the same time, enhancing present knowledge, was obtaining a generalized form of logistic formula  , which was derived from the general form of the growth equation for certain geometry of cells.
Revised:  An important result, serving both as a confirmation of the proposed theory and , at the same time, enhancing present knowledge, was obtaining a generalized form of logistic formula , which was derived from the general form of the growth equation for certain geometries of cells.
Edit intent: fluency
Original:  However, there is a growing number of facts that biological phenomena cannot be reduced to a biomolecular and biological realm alone, but should also consider mechanisms of different nature(like physical ones), which act at different scale levels.
Revised:  However, new facts and discoveries indicate that biological phenomena cannot be reduced to a biomolecular and biological realm alone, but should also consider mechanisms of different nature(like physical ones), which act at different scale levels.
Edit intent: clarity
Original:  However, there is a growing number of facts that biological phenomena cannot be reduced to a biomolecular and biological realm alone, but should also consider mechanisms of different nature(like physical ones), which act at different scale levels.
Revised:  However, there is a growing number of facts that biological phenomena cannot be reduced to a biomolecular realm alone, but should also consider mechanisms of different nature(like physical ones), which act at different scale levels.
Edit intent: clarity
Original:  These diverse mechanisms, acting cooperatively, define the life cycle of individual organisms, their growth andreproduction, and through this- the origin and evolution of the living world.
Revised:  These diverse mechanisms, acting cooperatively, define the life cycle of individual organisms, and, through this, the origin and evolution of the living world.
Edit intent: clarity
Original:  Here, we present evidence of existence of a physical mechanism ( called a general growth law) which appears to represent a new fundamental physical law of nature .
Revised:  Here, we present such a physical mechanism ( called a general growth law) which appears to represent a new fundamental physical law of nature .
Edit intent: clarity
Original:  Here, we present evidence of existence of a physical mechanism ( called a general growth law) which appears to represent a new fundamental physical law of nature .
Revised:  Here, we present evidence of existence of a physical mechanism ( General growth law) which appears to represent a new fundamental physical law of nature .
Edit intent: clarity
Original:  Here, we present evidence of existence of a physical mechanism ( called a general growth law) which appears to represent a new fundamental physical law of nature .
Revised:  Here, we present evidence of existence of a physical mechanism ( called a general growth law) , which represents a new physical law of nature .
Edit intent: clarity
Original:  In tight cooperation with biomolecular mechanisms, it directs growth and reproduction of cells and living organisms by imposing constraints on distribution of nutrients between maintenance needs and biomass production .
Revised:  In tight cooperation with biomolecular mechanisms, it directs growth and reproduction together with biomolecular mechanisms. It imposes uniquely defined constraints on distribution of nutrients between maintenance needs and biomass production .
Edit intent: clarity
Original: Distributed Denial of Service (DDoS) is a classic type of Cybercrime and can still strongly damage company reputation and increase  costs.
Revised: Distributed Denial of Service (DDoS) is a common type of Cybercrime and can still strongly damage company reputation and increase costs.
Edit intent: clarity
Original: Distributed Denial of Service (DDoS) is a classic type of Cybercrime and can still strongly damage company reputation and increase  costs.
Revised: Distributed Denial of Service (DDoS) is a classic type of Cybercrime . It can strongly damage a company reputation and increase costs.
Edit intent: coherence
Original: Distributed Denial of Service (DDoS) is a classic type of Cybercrime and can still strongly damage company reputation and increase  costs.
Revised: Distributed Denial of Service (DDoS) is a classic type of Cybercrime and can still strongly damage company reputation and increase its costs.
Edit intent: clarity
Original:  Attackers have continuously improved their strategies, and the amount of unleashed communication requests has doubled in volume, size and frequency.
Revised:  Attackers improve continuously their strategies. They doubled the amount of unleashed communication requests has doubled in volume, size and frequency.
Edit intent: coherence
Original:  Attackers have continuously improved their strategies, and the amount of unleashed communication requests has doubled in volume, size and frequency.
Revised:  Attackers have continuously improved their strategies, and the amount of unleashed communication requests in volume, size and frequency.
Edit intent: clarity
Original:  Previous studies have concentrated efforts in detecting or mitigating ongoing DDoS attacks.
Revised:  Previous studies focused on detecting or mitigating ongoing DDoS attacks.
Edit intent: clarity
Original:  However , addressing DDoS when it is already in place may be too late.
Revised:  Yet , addressing DDoS when it is already in place may be too late.
Edit intent: fluency
Original:  However , addressing DDoS when it is already in place may be too late.
Revised:  However , addressing DDoS attacks when they are already in place may be too late.
Edit intent: clarity
Original:  In this article, we attract the attention for the crucial role and importance of the early prediction of attack trends in order to support network resilience.
Revised:  In this article, we consider network resilience by early prediction of attack trends in order to support network resilience.
Edit intent: clarity
Original:  We suggest the use of statistical and non-parametric leading indicators for identifying trends of volumetric DDoS attacks and we report promising results over  real dataset from CAIDA  .
Revised:  We suggest the use of statistical and non-parametric leading indicators for early prediction of volumetric DDoS attacks and we report promising results over real dataset from CAIDA .
Edit intent: clarity
Original:  We suggest the use of statistical and non-parametric leading indicators for identifying trends of volumetric DDoS attacks and we report promising results over  real dataset from CAIDA  .
Revised:  We suggest the use of statistical and non-parametric leading indicators for identifying trends of volumetric DDoS attacks . We report promising results over real dataset from CAIDA .
Edit intent: coherence
Original:  We suggest the use of statistical and non-parametric leading indicators for identifying trends of volumetric DDoS attacks and we report promising results over  real dataset from CAIDA  .
Revised:  We suggest the use of statistical and non-parametric leading indicators for identifying trends of volumetric DDoS attacks and we report promising results over a real dataset from CAIDA .
Edit intent: fluency
Original:  Technically, BCS is a reachability problem that is known to be NP-complete if the context bound is part of the input .
Revised:  Technically, BCS is a reachability problem that is known to be NP-complete .
Edit intent: coherence
Original:  The main finding is a new algorithm that solves BCS when parameterized by the number of context switches  and the size of the memory . Notably, there are no restrictions on the number, the size, nor the behavior of the threads.
Revised:  The first result is an algorithm that solves BCS when parameterized by the number of context switches and the size of the memory . Notably, there are no restrictions on the number, the size, nor the behavior of the threads.
Edit intent: clarity
Original:  The main finding is a new algorithm that solves BCS when parameterized by the number of context switches  and the size of the memory . Notably, there are no restrictions on the number, the size, nor the behavior of the threads.
Revised:  The main finding is a new algorithm that solves BCS when parameterized by the number of context switches (cs) and the size of the memory . Notably, there are no restrictions on the number, the size, nor the behavior of the threads.
Edit intent: clarity
Original:  The proposed processing units can operate at  20 MHz with fully asynchronous activity, light-speed-limited latency, and power densities on the order of 1 mW/cm^2 for neurons with 700 connections operating at full speed at 2 K.
Revised:  The proposed processing units can operate at speeds of at least 20 MHz with fully asynchronous activity, light-speed-limited latency, and power densities on the order of 1 mW/cm^2 for neurons with 700 connections operating at full speed at 2 K.
Edit intent: clarity
Original:  By leveraging multilayer photonics with low-temperature-deposited waveguides and superconductors with feature sizes > 100 nm, this approach could scale to massive interconnectivity near that of the human brain, and could surpass the brain in speed and energy efficiency .
Revised:  By leveraging multilayer photonics with deposited waveguides and superconductors with feature sizes > 100 nm, this approach could scale to massive interconnectivity near that of the human brain, and could surpass the brain in speed and energy efficiency .
Edit intent: clarity
Original:  However, the nominal memoization programming model is error-prone: when the programmer unintentionally misuses names, their incremental program ceases to correspond with a purely functional specification .
Revised:  However, the nominal memoization programming model is error-prone: when the programmer unintentionally misuses names, their incremental program ceases to correspond to its purely functional semantics .
Edit intent: clarity
Original:  This paper develops a refinement type system for nominal memoization that enforces a program's correspondence with a purely functional specification .
Revised:  This paper develops a refinement type system for nominal memoization that enforces a program's correspondence with its purely functional semantics .
Edit intent: clarity
Original:  We prove that our type system enforces the dynamic side conditions proposed by Hammer et al 2015.
Revised:  We prove that our type system enforces the dynamic side conditions required by Hammer et al 2015.
Edit intent: clarity
Original:  We prove that our type system enforces the dynamic side conditions proposed by Hammer et al 2015.
Revised:  We prove that our type system enforces the dynamic side conditions proposed by Hammer et al . (2015).
Edit intent: clarity
Original:  Past work shows that these conditions suffice to write useful examples of nominal memoization while also guaranteeing from-scratch consistency of the incremental programs.
Revised:  Past work shows that these conditions suffice for realistic uses of nominal memoization while also guaranteeing from-scratch consistency of the incremental programs.
Edit intent: clarity
Original: Over the past decade, programming language techniques for incremental computation have demonstrated that incremental programs with precise, carefully chosen dynamic names for data and sub-computations can dramatically outperform non-incremental programs, as well as those using traditional memoization (without such names).
Revised: State-of-the-art programming language techniques for incremental computation have demonstrated that incremental programs with precise, carefully chosen dynamic names for data and sub-computations can dramatically outperform non-incremental programs, as well as those using traditional memoization (without such names).
Edit intent: clarity
Original:  Drawing closer to an implementation  , we derive a bidirectional version of the type system , and prove that it corresponds to our declarative type system.
Revised:  Drawing closer to an implementation of our type system , we derive a bidirectional version of the type system , and prove that it corresponds to our declarative type system.
Edit intent: fluency
Original:  Drawing closer to an implementation  , we derive a bidirectional version of the type system , and prove that it corresponds to our declarative type system.
Revised:  Drawing closer to an implementation , we derive a bidirectional version , and prove that it corresponds to our declarative type system.
Edit intent: clarity
Original: State-of-the-art programming language techniques for incremental computation employ programmer-specified names , whose role is critical for the asymptotic efficiency of many online algorithms.
Revised: Many programming language techniques for incremental computation employ programmer-specified names , whose role is critical for the asymptotic efficiency of many online algorithms.
Edit intent: clarity
Original:  These names identify "cache locations " for dynamic data and sub-computations---the program's dynamic dependencies.
Revised:  These names identify "cache location " for dynamic data and sub-computations---the program's dynamic dependencies.
Edit intent: fluency
Original: Deep learning has led to significant advances in artificial intelligence in recent years , in part by adopting architectures and functions motivated by neurophysiology.
Revised: Deep learning has led to significant advances in artificial intelligence , in part by adopting architectures and functions motivated by neurophysiology.
Edit intent: clarity
Original: Deep learning has led to significant advances in artificial intelligence in recent years , in part by adopting architectures and functions motivated by neurophysiology.
Revised: Deep learning has led to significant advances in artificial intelligence in recent years , in part , by adopting strategies motivated by neurophysiology.
Edit intent: clarity
Original:  However, current deep learning algorithms are biologically infeasible, because they assume non-spiking units, discontinuous-time, and non-local synaptic weight updates .
Revised:  However, it is unclear whether deep learning could occur in the real brain .
Edit intent: clarity
Original:  We show that , thanks to the separation of feedforward and feedback information in different dendrites, our learning algorithm can coordinate learning across layers, taking advantage of multilayer architectures to identify abstract categories - the hallmark of deep learning.
Revised:  We show that our learning algorithm can coordinate learning across layers, taking advantage of multilayer architectures to identify abstract categories - the hallmark of deep learning.
Edit intent: coherence
Original:  We show that , thanks to the separation of feedforward and feedback information in different dendrites, our learning algorithm can coordinate learning across layers, taking advantage of multilayer architectures to identify abstract categories - the hallmark of deep learning.
Revised:  We show that , thanks to the separation of feedforward and feedback information in different dendrites, our learning algorithm can take advantage of multilayer architectures to identify abstract categories - the hallmark of deep learning.
Edit intent: clarity
Original:  We show that , thanks to the separation of feedforward and feedback information in different dendrites, our learning algorithm can coordinate learning across layers, taking advantage of multilayer architectures to identify abstract categories - the hallmark of deep learning.
Revised:  We show that , thanks to the separation of feedforward and feedback information in different dendrites, our learning algorithm can coordinate learning across layers, taking advantage of multilayer architectures to identify abstract categories---the hallmark of deep learning.
Edit intent: fluency
Original:  Our model demonstrates that deep learning can be achieved within a biologically feasible framework using segregated dendritic compartments  , which may help to explain the anatomy of neocortical pyramidal neurons.
Revised:  This work demonstrates that deep learning can be achieved within a biologically feasible framework using segregated dendritic compartments , which may help to explain the anatomy of neocortical pyramidal neurons.
Edit intent: clarity