wanyu/IteraTeR_full_sent huggingface dataset:
Original:  A good correlation was observed between the spread and decay durations (R2=0.37) . However, some exceptions were observed in prefectures that are adjacent to primary prefectures (e.g., Tokyo, Osaka, Aichi, and Fukuoka) and in areas where people returned from foreign countries, which were defined origins of cluster infections . Excluding these prefectures, population density is shown to be the primary factor affecting spread and decay patterns, with correlations of 0.52 and 0.76, respectively. The absolute humidity also affected the spread duration (R2  = 0.40).
Revised:  A good correlation was observed between the spread and decay durations (R2=0.37) . However, some exceptions were observed in prefectures that are adjacent to primary prefectures (e.g., Tokyo, Osaka, Aichi, and Fukuoka) and in areas where people returned from foreign countries, which were defined origins of cluster infections . Excluding these prefectures, population density is shown to be the primary factor affecting spread and decay patterns, with R2=0.39 (p<0.05) and 0.42 (p<0.05), respectively, approximately corresponding to social distancing. The maximum absolute humidity was found to affect the decay duration normalized by the population density (R2 = 0.40).
Edit intent: meaning-changed
Original:  The absolute humidity also affected the spread duration (R2  = 0.40). These findings could be useful for intervention planning during potential future pandemics, including a second COVID-19 outbreak.
Revised:  The absolute humidity also affected the spread duration (R2 = 0.53, p-value<0.05), could prove useful for intervention planning during potential future pandemics, including a second COVID-19 outbreak.
Edit intent: meaning-changed
Original:  Experimental results of disease transmission confirms that contact tracing requires both significant visibility (at least 60 %DIFDELCMD < \\%%% %DIF < ) into the proximity graph and the ability to place half of the population under isolation, in order to stop the disease.
Revised:  Experimental results of disease spreading shows that that at low visibility rates contact tracing slows disease spreading. However to stop disease spreading, contact tracing requires both significant visibility (at least 60 %DIFDELCMD < \\%%% %DIF < ) into the proximity graph and the ability to place half of the population under isolation, in order to stop the disease.
Edit intent: meaning-changed
Original:  We argue that proactive innoculation of a population by disabling super-links and super-spreaders may have an important complimentary role alongside contact tracing and testing as part of a sophisticated public-health response to epidemic outbreaks.abstract 
Revised:  We argue that proactive innoculation of a population by disabling super-links and super-spreaders may have an important complimentary role alongside contact tracing and testing as part of a sophisticated public-health response to epidemic outbreaks.abstract \%) into the proximity graph and the ability to place half of the population under isolation. We find that pro-actively isolating super-links -- key proximity encounters -- has significant benefits: targeted isolation of a fourth of the population based on 35\% visibility into the proximity graph prevents an epidemic outbreak. It turns out that isolating super-spreaders is more effective than contact tracing and testing but less effective than targeting super-links. We highlight the important role of topology in epidemic outbreaks. We argue that proactive innoculation of a population by disabling super-links and super-spreaders may have an important complimentary role alongside contact tracing and testing as part of a sophisticated public-health response to epidemic outbreaks.
Edit intent: meaning-changed
Original:  We consider duplication/loss scenarios and characterize unambiguous false-positive (u-fp) orthology assignments, that is, edges in the Best Match Graphs (BMGs) that cannot correspond to orthologs for any gene tree that explains the BMG. We characterize u-fp edges in terms of subgraphs of the BMG and show that, given a BMG, there is a unique "augmented tree" that explains the BMG and identifies all u-fp edges in terms of overlapping sets of species in certain subtrees.
Revised:  We consider duplication/loss scenarios and characterize unambiguous false-positive (u-fp) orthology assignments, that is, edges in the best match graphs (BMGs) that cannot correspond to orthologs for any gene tree that explains the BMG. We characterize u-fp edges in terms of subgraphs of the BMG and show that, given a BMG, there is a unique "augmented tree" that explains the BMG and identifies all u-fp edges in terms of overlapping sets of species in certain subtrees.
Edit intent: fluency
Original:  We consider duplication/loss scenarios and characterize unambiguous false-positive (u-fp) orthology assignments, that is, edges in the Best Match Graphs (BMGs) that cannot correspond to orthologs for any gene tree that explains the BMG. We characterize u-fp edges in terms of subgraphs of the BMG and show that, given a BMG, there is a unique "augmented tree" that explains the BMG and identifies all u-fp edges in terms of overlapping sets of species in certain subtrees.
Revised:  We consider duplication/loss scenarios and characterize unambiguous false-positive (u-fp) orthology assignments, that is, edges in the Best Match Graphs (BMGs) that cannot correspond to orthologs for any gene tree that explains the BMG. Moreover, we provide a polynomial-time algorithm to identify all u-fp edges in terms of overlapping sets of species in certain subtrees.
Edit intent: meaning-changed
Original:  We consider duplication/loss scenarios and characterize unambiguous false-positive (u-fp) orthology assignments, that is, edges in the Best Match Graphs (BMGs) that cannot correspond to orthologs for any gene tree that explains the BMG. We characterize u-fp edges in terms of subgraphs of the BMG and show that, given a BMG, there is a unique "augmented tree" that explains the BMG and identifies all u-fp edges in terms of overlapping sets of species in certain subtrees. The augmented tree can be constructed as a refinement of the unique least resolved tree of the BMGin polynomial time. Removal of the u-fp edges from the reciprocal best matches results in a unique orthology assignment.
Revised:  We consider duplication/loss scenarios and characterize unambiguous false-positive (u-fp) orthology assignments, that is, edges in the Best Match Graphs (BMGs) that cannot correspond to orthologs for any gene tree that explains the BMG. We characterize u-fp edges in terms of subgraphs of the BMG and show that, given a BMG, there is a unique "augmented tree" that explains the BMG and identifies all u-fp orthology assignments in a BMG. Simulations show that at least 75
Edit intent: meaning-changed
Original:  We created a theory, based on polymer physics  and the maximum entropy principles, referred to as HIPPS (Hi-C-Polymer-Physics-Structures) method, that allows us to calculate the 3D structures solely from Hi-C contact maps.
Revised:  We created a theory, based on polymer physics characteristics of chromosomes and the maximum entropy principles, referred to as HIPPS (Hi-C-Polymer-Physics-Structures) method, that allows us to calculate the 3D structures solely from Hi-C contact maps.
Edit intent: meaning-changed
Original:  Redundancy could mitigate stragglers by reducing the dependence of the computing engine on every server. Nevertheless, redundancy could yet be a burden to the system and aggravate stragglers. In this paper, we consider task replication as the redundancy technique andstudy the optimum redundancy planning to improve the performance of a master-worker distributed computing system. We start with optimum assignment policy of a given set of redundant tasks to a set of workers. Using the results from majorization theory, we show thatif the service time of workersis a stochastically (decreasing and) convex random variable , a balanced assignment of non-overlapping batches of tasks minimizes the average job compute time.
Revised:  Tasks are grouped into batches and assigned to one or more workers for execution. We first consider the case when the batches do not overlap and, using the results from majorization theory, we show thatif the service time of workersis a stochastically (decreasing and) convex random variable , a balanced assignment of non-overlapping batches of tasks minimizes the average job compute time.
Edit intent: coherence
Original:  Using the results from majorization theory, we show thatif the service time of workersis a stochastically (decreasing and) convex random variable , a balanced assignment of non-overlapping batches of tasks minimizes the average job compute time.
Revised:  Using the results from majorization theory, show that, for a general class of workers' service time distributions , a balanced assignment of non-overlapping batches of tasks minimizes the average job compute time.
Edit intent: clarity
Original:  Using the results from majorization theory, we show thatif the service time of workersis a stochastically (decreasing and) convex random variable , a balanced assignment of non-overlapping batches of tasks minimizes the average job compute time.
Revised:  Using the results from majorization theory, we show thatif the service time of workersis a stochastically (decreasing and) convex random variable , a balanced assignment of batches to workers minimizes the average job compute time.
Edit intent: clarity
Original:  With that results, we then study the optimum level of redundancy from the perspective of average job compute time and compute time predictability. We derive the efficient redundancy level as a function of tasks' service time distribution .
Revised:  With that results, we then study the optimum level of redundancy from the perspective of average job compute time compared to the overlapping schemes proposed in the literature. Furthermore, we derive the optimum redundancy level as a function of tasks' service time distribution .
Edit intent: meaning-changed
Original:  We derive the efficient redundancy level as a function of tasks' service time distribution . We observe that , the redundancy level that minimizes average  compute time is not necessarily the same as the redundancy level that maximized compute timepredictability .
Revised:  We derive the efficient redundancy level as a function of tasks' service time distribution at workers. We show that the redundancy level that minimizes average compute time is not necessarily the same as the redundancy level that maximized compute timepredictability .
Edit intent: meaning-changed
Original:  Finally, by running experiments on Google cluster traces, we show that a careful planning of redundancy according to the tasks' service time distribution can speed up the computing job by an order of magnitude  .
Revised:  Finally, by running experiments on Google cluster traces, we show that a careful planning of redundancy according to the tasks' service time distribution can speed up the computing job by an order of magnitude , and that the optimum level of redundancy depends on the distribution of tasks' service time .
Edit intent: meaning-changed
Original:  From a scientific perspective, understanding the conditions under which language emerges in communities of deep agents and the characteristics of the resulting code can shed light on human language evolution , and on what is unique about the latter. From a practical perspective, endowing deep networks with the ability to solve problems interactively by communicating with each other and with us will make them more flexible and useful in everyday life.
Revised:  From a scientific perspective, understanding the conditions under which language emerges in communities of deep agents and the characteristics of the resulting code can shed light on human language evolution . From an applied perspective, endowing deep networks with the ability to solve problems interactively by communicating with each other and with us will make them more flexible and useful in everyday life.
Edit intent: clarity
Original:  The identified set is of a union bounds form that previously developed partial identification inference methods do not apply to. We develop a novel bootstrap method to construct  valid confidence intervals for the identified set and parameter of interest when the identified set is of a union bounds form, and we establish the  theoretical properties.
Revised:  The identified set is of a union bounds form that involves the minimum and maximum operators, which makes the canonical bootstrap generally inconsistent and naive methods overly conservative. By utilizing the directional inconsistency of the bootstrap distribution, we develop a novel bootstrap method to construct valid confidence intervals for the identified set and parameter of interest when the identified set is of a union bounds form, and we establish the theoretical properties.
Edit intent: meaning-changed
Original:  Applying the proposed test to the market share data from the Dominick's Finer Foods retail chain, we find that a common ad hoc procedure to deal with zero market shares results in a failure of the root-n asymptotic normality 
Revised:  Applying the proposed test to the market share data from the Dominick's Finer Foods retail chain, we find that a common ad hoc procedure to deal with zero market shares results in a failure to satisfy the conditions for both the consistency and the root-n asymptotic normality 
Edit intent: meaning-changed
Original:  Applying the proposed test to the market share data from the Dominick's Finer Foods retail chain, we find that a common ad hoc procedure to deal with zero market shares results in a failure of the root-n asymptotic normality 
Revised:  Applying the proposed test to the market share data from the Dominick's Finer Foods retail chain, we find that a common ad hoc procedure to deal with zero market shares results in a failure of the root-n asymptotic normality .
Edit intent: fluency
Original:  Applying the proposed test to the market share data from the Dominick's Finer Foods retail chain, we find that a common ad hoc procedure to deal with zero market shares  results in a failure to satisfy the conditions for both the consistency and the root-n asymptotic normality.
Revised:  Applying the proposed test to the market share data from the Dominick's Finer Foods retail chain, we find that a common ad hoc procedure to deal with zero market shares results in a failure to satisfy the conditions for both the consistency and the root-n asymptotic normality.
Edit intent: fluency
Original:  Applying the proposed test to the market share data from the Dominick's Finer Foods retail chain, we find that a common ad hoc procedure to deal with zero market shares  results in a failure to satisfy the conditions for both the consistency and the root-n asymptotic normality.
Revised:  Applying the proposed test to the market share data from the Dominick's Finer Foods retail chain, we find that a common ad hoc procedure to deal with zero market shares in analysis of differentiated products markets results in a failure to satisfy the conditions for both the consistency and the root-n asymptotic normality.
Edit intent: meaning-changed
Original:  Practical implementations of PMLs often use smooth-varying attenuation coefficients to reduce the numerical reflection from PMLs and to reduce the thickness required for reaching a certain level of absorption .
Revised:  Many PML implementations often use a smoothly-increasing attenuation coefficient to increase the absorption for a given layer thickness, and, at the same time, to reduce the numerical reflection from PMLs and to reduce the thickness required for reaching a certain level of absorption .
Edit intent: meaning-changed
Original:  In discontinuous Galerkin time-domain (DGTD) methods, assigning smooth-varying coefficients calls for storing individual mass matrices for each mesh element , which significantly increases the memory-cost.
Revised:  In discontinuous Galerkin time-domain (DGTD) methods, using a PML coefficient that varies within a mesh element requires a different mass matrix to be stored for every element and therefore significantly increases the memory-cost.
Edit intent: clarity
Original:  In discontinuous Galerkin time-domain (DGTD) methods, assigning smooth-varying coefficients calls for storing individual mass matrices for each mesh element , which significantly increases the memory-cost. This workproposes a memory-efficient implementation of smooth-varying PMLs in DGTD. A weight-adjusted approximation is applied to the mass matricesinvolved in the PML formulation, which yields a low memory-cost algorithm and maintains the high-order accuracy of DGTD.
Revised:  In discontinuous Galerkin time-domain (DGTD) methods, assigning smooth-varying coefficients calls for storing individual mass matrices for each mesh element , which significantly increases the memory footprint. In this work, this bottleneck is addressed by applying a weight-adjusted approximation is applied to the mass matricesinvolved in the PML formulation, which yields a low memory-cost algorithm and maintains the high-order accuracy of DGTD.
Edit intent: clarity
Original:  A weight-adjusted approximation is applied to the mass matricesinvolved in the PML formulation, which yields a low memory-cost algorithm and maintains the high-order accuracy of DGTD. The proposed scheme has the same accuracy as the implementation of storing local mass matricesof each element, and provides a higher mesh flexibility and a smaller reflectionthan using a constant coefficient in each element .
Revised:  A weight-adjusted approximation to these mass matrices. The resulting DGTD scheme has the same accuracy as the implementation of storing local mass matricesof each element, and provides a higher mesh flexibility and a smaller reflectionthan using a constant coefficient in each element .
Edit intent: clarity
Original:  The proposed scheme has the same accuracy as the implementation of storing local mass matricesof each element, and provides a higher mesh flexibility and a smaller reflectionthan using a constant coefficient in each element .
Revised:  The proposed scheme has the same advantages as the scheme that stores individual mass matrices, namely higher accuracy (due to reduced numerical reflection) and increased meshing flexibility (since the PML does not have to be defined layer by layer) but it requires significantly less memory .
Edit intent: clarity
Original:  Unlike existing AA globalization approaches that often rely on safeguarding operations and might hinder fast local convergence, we adopt a nonmonotone trust-region framework and introduce an adaptive quadratic regularization together with a tailored acceptance mechanism.
Revised:  Unlike existing AA globalization approaches that rely on safeguarding operations and might hinder fast local convergence, we adopt a nonmonotone trust-region framework and introduce an adaptive quadratic regularization together with a tailored acceptance mechanism.
Edit intent: clarity
Original:  In order to overcome this shortcoming, we consider the special continuation method based on the Newton flow and follow its trajectory with the new time-stepping scheme based on the trust-region technique. Furthermore, we analyze the global convergence and local superlinear convergence of the new method. Finally, the promising numerical results of the new method for some real-world problems are also reported,
Revised:  In order to overcome this shortcoming, we consider the special continuation method based on the Newton flow and follow its trajectory with the new time-stepping scheme for nonlinear equations. According to our numerical experiments, it is more robust and faster to find the required solution of the real-world problems are also reported,
Edit intent: clarity
Original:  Finally, the promising numerical results of the new method for some real-world problems are also reported, with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{%DIFAUXCMD MATLAB,More1978 ) and the classical homotopy continuation methods (HOMPACK90 \mbox{%DIFAUXCMD \cite{WSMMW1997 }\hspace{0pt}%DIFAUXCMD and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{%DIFAUXCMD \cite{ZL2013}}\hspace{0pt}%DIFAUXCMD )}  .
Revised:  Finally, the promising numerical results of the new method for some real-world problem than the traditional optimization method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{%DIFAUXCMD MATLAB,More1978 ) and the classical homotopy continuation methods (HOMPACK90 \mbox{%DIFAUXCMD \cite{WSMMW1997 }\hspace{0pt}%DIFAUXCMD and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{%DIFAUXCMD \cite{ZL2013}}\hspace{0pt}%DIFAUXCMD )} .
Edit intent: clarity
Original:  with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{%DIFAUXCMD MATLAB,More1978 ) and the classical homotopy continuation methods (HOMPACK90 \mbox{%DIFAUXCMD \cite{WSMMW1997 }\hspace{0pt}%DIFAUXCMD and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{%DIFAUXCMD \cite{ZL2013}}\hspace{0pt}%DIFAUXCMD )}  .
Revised:  with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment ) and the classical homotopy continuation methods (HOMPACK90 \mbox{%DIFAUXCMD \cite{WSMMW1997 }\hspace{0pt}%DIFAUXCMD and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{%DIFAUXCMD \cite{ZL2013}}\hspace{0pt}%DIFAUXCMD )} .
Edit intent: coherence
Original:  with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{%DIFAUXCMD MATLAB,More1978 ) and the classical homotopy continuation methods (HOMPACK90 \mbox{%DIFAUXCMD \cite{WSMMW1997 }\hspace{0pt}%DIFAUXCMD and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{%DIFAUXCMD \cite{ZL2013}}\hspace{0pt}%DIFAUXCMD )}  .
Revised:  with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{%DIFAUXCMD MATLAB,More1978 ) and the homotopy continuation methods (HOMPACK90 \mbox{%DIFAUXCMD \cite{WSMMW1997 }\hspace{0pt}%DIFAUXCMD and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{%DIFAUXCMD \cite{ZL2013}}\hspace{0pt}%DIFAUXCMD )} .
Edit intent: coherence
Original:  with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{%DIFAUXCMD MATLAB,More1978 ) and the classical homotopy continuation methods (HOMPACK90 \mbox{%DIFAUXCMD \cite{WSMMW1997 }\hspace{0pt}%DIFAUXCMD and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{%DIFAUXCMD \cite{ZL2013}}\hspace{0pt}%DIFAUXCMD )}  .
Revised:  with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{%DIFAUXCMD MATLAB,More1978 ) and the classical homotopy continuation methods (HOMPACK90 }\hspace{0pt}%DIFAUXCMD and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{%DIFAUXCMD \cite{ZL2013}}\hspace{0pt}%DIFAUXCMD )} .
Edit intent: meaning-changed