wanyu/IteraTeR_v2 huggingface dataset:
Original:  Based on an international workshop involving leading researchers in the field of surgical data science , we review current practice, key achievements and initiatives as well as available standards and tools for a number of topics relevant to the field, namely (1) technical infrastructure for data acquisition, storage and access in the presence of regulatory constraints, (2) data annotation and sharing and (3) data analytics.
Revised:  Based on an international workshop involving leading researchers in the field of surgical data science , we review current practice, key achievements and initiatives as well as available standards and tools for a number of topics relevant to the field, namely (1) infrastructure for data acquisition, storage and access in the presence of regulatory constraints, (2) data annotation and sharing and (3) data analytics.
Edit intent: clarity
Original: COVID-19 has been affecting every social sector significantly, including human mobility and subsequently road traffic safety.
Revised: COVID-19 is affecting every social sector significantly, including human mobility and subsequently road traffic safety.
Edit intent: fluency
Original:  In this study, we analyze the impact of the pandemic on traffic accidents safety using two cities, namely Los Angeles and New York City in the U.S., as examples.
Revised:  In this study, we analyze the impact of the pandemic on traffic accidents using two cities, namely Los Angeles and New York City in the U.S., as examples.
Edit intent: clarity
Original:  We have made the following observations: 1) the pandemic has been affecting demographic groups categorized in age , race, and gender unequally ;
Revised:  We have made the following observations: 1) the pandemic has disproportionately affected certain age groups, races, and genders ;
Edit intent: clarity
Original:  and 3) the number of non-fatal accident cases has reduced but the number of severe and fatal cases of traffic accidents remains the same under the pandemic.
Revised:  and 3) the number of non-fatal accident cases has decreased but the number of severe and fatal cases of traffic accidents remains the same under the pandemic.
Edit intent: clarity
Original:  In this paper, we argue that , if this change of relative locations would be quantifiable, i.e., if the metamaterial elements would be accurately localizable, this location information could potentially be utilized for enabling novel SDM applications, as well as for optimizing the control of the metamaterial elements themselves.
Revised:  In this paper, we argue that if the metamaterial elements would be accurately localizable, this location information could potentially be utilized for enabling novel SDM applications, as well as for optimizing the control of the metamaterial elements themselves.
Edit intent: clarity
Original:  In this paper, we argue that , if this change of relative locations would be quantifiable, i.e., if the metamaterial elements would be accurately localizable, this location information could potentially be utilized for enabling novel SDM applications, as well as for optimizing the control of the metamaterial elements themselves.
Revised:  In this paper, we argue that , if this change of relative locations would be quantifiable, i.e., if the metamaterial elements would be accurately localizable, this location information could potentially be utilized for enabling novel SDM applications, as well as for optimizing the control of the elements themselves.
Edit intent: fluency
Original:  In this work, we assume that the metamaterial elements are controlled wirelessly through a Terahertz (THz)-operating nanonetwork.
Revised:  In this work, we assume that these elements are controlled wirelessly through a Terahertz (THz)-operating nanonetwork.
Edit intent: clarity
Original:  Moreover, we consider the elements to be energy-constrained, with their sole powering option being to harvest environmental energy.
Revised:  We consider the elements to be energy-constrained, with their sole powering option being to harvest environmental energy.
Edit intent: coherence
Original:  For such a setup , we demonstrate sub-millimeter accuracy of the two-way Time of Flight (ToF)-based localization, as well as high availability of the service (i.e., consistently more than 80\% of the time), which is a result of the low energy consumed in the localization.
Revised:  By means of simulation , we demonstrate sub-millimeter accuracy of the two-way Time of Flight (ToF)-based localization, as well as high availability of the service (i.e., consistently more than 80\% of the time), which is a result of the low energy consumed in the localization.
Edit intent: clarity
Original:  Finally, we qualitatively characterize the effects of the mentioned system parameters on the latency of the proposed localization service, as well as outline several challenges and future research directions.
Revised:  Finally, we qualitatively characterize the latency of the proposed localization service, as well as outline several challenges and future research directions.
Edit intent: clarity
Original:  Many of the applications envisage deformations of the SDM structure , such as its bending, stretching or rolling, which implies that the locations of metamaterial elements will be changing relative to one another.
Revised:  Many of the applications envisage deformations of the SDM structures , such as its bending, stretching or rolling, which implies that the locations of metamaterial elements will be changing relative to one another.
Edit intent: fluency
Original:  Many of the applications envisage deformations of the SDM structure , such as its bending, stretching or rolling, which implies that the locations of metamaterial elements will be changing relative to one another.
Revised:  Many of the applications envisage deformations of the SDM structure , such as their bending, stretching or rolling, which implies that the locations of metamaterial elements will be changing relative to one another.
Edit intent: fluency
Original:  We consider the elements to be energy-constrained , with their sole powering option being to harvest environmental energy .
Revised:  We consider the elements to be power-constrained , with their sole powering option being to harvest environmental energy .
Edit intent: fluency
Original:  By means of simulation, we demonstrate sub-millimeter accuracy of the two-way Time of Flight (ToF)-based localization, as well as high availability of the service (i.e., consistently more than 80\% of the time), which is a result of the low energy consumed during localization .
Revised:  By means of simulation, we demonstrate sub-millimeter accuracy of the two-way Time of Flight (ToF)-based localization, as well as high availability of the service (i.e., consistently more than 80\% of the time), which is a result of the low energy consumed in the localization process .
Edit intent: clarity
Original: We show a fast algorithm for determining the set of relevant edges in a planar undirected unweighted graph with respect to the maximum flow  .
Revised: We show a fast algorithm for determining the set of edges in a planar undirected unweighted graph with respect to the maximum flow .
Edit intent: clarity
Original:  This is a special case of the max flow vitality problem, that has been efficiently solved for general undirected graphs and st-planar graphs.
Revised:  This is a special case of the max flow vitality problem, that has been efficiently solved for general undirected graphs and st-planar graphs.
Edit intent: fluency
Original:  The vitality of an edge of a graph with respect to the maximum flow between two fixed vertices s and t is defined as the reduction of the maximum flow caused by the removal of that edge.
Revised:  The vitality of an edge of a graph with respect to the maximum flow between two fixed vertices s and t is defined as the reduction of the maximum flow caused by the removal of that edge.
Edit intent: fluency
Original:  In this paper we show that the set of edges having vitality greater than zero in a planar undirected unweighted graph with n vertices , can be found in O(n \log n) worst-case time and O(n) space.
Revised:  In this paper we show that the set of edges having vitality greater than zero in a planar undirected unweighted graph with n vertices can be found in O(n \log n) worst-case time and O(n) space.
Edit intent: fluency
Original:  In this paper we show that the set of edges having vitality greater than zero in a planar undirected unweighted graph with n vertices , can be found in O(n \log n) worst-case time and O(n) space.
Revised:  In this paper we show that the set of edges having vitality greater than zero in a planar undirected unweighted graph with n vertices , can be found in O(n log n) worst-case time and O(n) space.
Edit intent: fluency
Original:  Previous works on the subject either focus on synchronous algorithms, which can be heavily slowed down by a few slow nodes (the straggler problem ), or consider a historical asynchronous setting (Boyd et al., 2006) , which relies on a communication model that cannot be readily implemented in practice, as it does not capture important aspects of asynchronous communications such as non-instantaneous computations and communications .
Revised:  Previous works on the subject either focus on synchronous algorithms, which can be heavily slowed down by a few slow nodes (the straggler problem ), or consider a historical asynchronous setting (Boyd et al., 2006) , which relies on a communication model that cannot be readily implemented in practice, as it does not capture important aspects of asynchronous communications such as non-instantaneous computations and communications .
Edit intent: fluency
Original:  Previous works on the subject either focus on synchronous algorithms, which can be heavily slowed down by a few slow nodes (the straggler problem ), or consider a historical asynchronous setting (Boyd et al., 2006) , which relies on a communication model that cannot be readily implemented in practice, as it does not capture important aspects of asynchronous communications such as non-instantaneous computations and communications .
Revised:  Previous works on the subject either focus on synchronous algorithms, which can be heavily slowed down by a few slow nodes (the straggler problem ), or consider a model of asynchronous operation (Boyd et al., 2006) , which relies on a communication model that cannot be readily implemented in practice, as it does not capture important aspects of asynchronous communications such as non-instantaneous computations and communications .
Edit intent: clarity
Original:  1) We  introduce a new communication scheme , based onLoss-Networks , that is programmable in a fully asynchronous and decentralized fashion.
Revised:  1) We introduce a new communication scheme Loss-Networks , that is programmable in a fully asynchronous and decentralized fashion.
Edit intent: coherence
Original:  1) We  introduce a new communication scheme , based onLoss-Networks , that is programmable in a fully asynchronous and decentralized fashion.
Revised:  1) We introduce a new communication scheme , based onbased on Loss-Networks , that is programmable in a fully asynchronous and decentralized fashion.
Edit intent: fluency
Original: Several seroprevalence studies have been or are currently conducted in order to estimate the infection fatality rate (IFR) of the Coronavirus Disease 2019 (COVID-19) .
Revised: The infection fatality rate (IFR) of the Coronavirus Disease 2019 (COVID-19) .
Edit intent: clarity
Original:  Based on the example of Germany, this study illustrates the time-dependent evolution of effective IFR over the course of the pandemic , by combining age-group specific IFR estimates from multiple recent studies worldwide with publicly available German surveillance data .
Revised:  Based on the example of Germany, this study illustrates the time-dependent evolution of effective IFR over the course of the pandemic .
Edit intent: clarity
Original:  Results for Germany show that effective IFRs  are estimated to vary largely over time.
Revised:  Results show that effective IFRs are estimated to vary largely over time.
Edit intent: clarity
Original:  A comparison of estimated IFRs with observed CFRs indicates that a substantial fraction of the time-dependent variability in observed mortality can be explained by the evolving age distribution of infections.
Revised:  A comparison of effective IFRs with observed CFRs indicates that a substantial fraction of the time-dependent variability in observed mortality can be explained by the evolving age distribution of infections.
Edit intent: clarity
Original:  A comparison of estimated IFRs with observed CFRs indicates that a substantial fraction of the time-dependent variability in observed mortality can be explained by the evolving age distribution of infections.
Revised:  A comparison of estimated IFRs with observed CFRs indicates that a substantial fraction of the time-dependent variability in observed mortality can be explained by changes in the age distribution of infections.
Edit intent: clarity
Original:  In addition, the vanishing gap between estimated effective IFR and observed CFR is discussed in light of the assumptions of the analysis .
Revised:  Furthermore, a vanishing gap between estimated effective IFR and observed CFR is discussed in light of the assumptions of the analysis .
Edit intent: coherence
Original:  Further research is warranted to obtain timely age-stratified IFR estimates for Germany .
Revised:  Further research is warranted to obtain timely age-stratified IFR estimates .
Edit intent: clarity
Original:  On the other hand, for the problem of verifying if an N\times N matrix defines a metric and subcubic-time equivalent problems, we show that one may assume w.l.o.g. that the integer edge weights have at most N^{2+o(1)
Edit intent: coherence
Original: Processing time-dependent information requires cells to quantify the durations of past regulatory events and program the time span of future signals.
Revised: Processing time-dependent information requires cells to quantify the duration of past regulatory events and program the time span of future signals.
Edit intent: fluency
Original:  Such timer mechanisms are difficult to implement at the level of single cells , however, due to saturation in molecular components and stochasticity in the limited intracellular space.
Revised:  Such timer mechanisms are difficult to implement in single cells due to saturation in molecular components and stochasticity in the limited intracellular space.
Edit intent: clarity
Original:  This framework reveals that distributing different processes (in our case the production, detection and degradation of a time-encoding signal) across distinct bacterial strains enables the robust implementation of a multicellular timer.
Revised:  This framework reveals that distributing different processes (in our case the production, detection and degradation of a time-encoding signal) across distinct cell types enables the robust implementation of a multicellular timer.
Edit intent: clarity
Original:  Our analysis also shows the circuit to be easily tunable by varying the relative frequencies of the bacterial strains composing the consortium.
Revised:  Our analysis also shows the circuit to be easily tunable by varying the cellular composition of the consortium.
Edit intent: clarity
Original: In this paper, we introduce a superconvergent approximation method using a non-polynomial that consists of radial basis functions (RBFs) to solve conservation laws.
Revised: In this paper, we introduce a superconvergent approximation method that employs radial basis functions (RBFs) to solve conservation laws.
Edit intent: clarity
Original: In this paper, we introduce a superconvergent approximation method using a non-polynomial that consists of radial basis functions (RBFs) to solve conservation laws.
Revised: In this paper, we introduce a superconvergent approximation method using a non-polynomial that consists of radial basis functions (RBFs) in the numerical solution of conservation laws.
Edit intent: clarity
Original:  Superconvergence of the approximations is addressed through analyses, which result in the attainment of expressions for optimal RBF shape parameters .
Revised:  Superconvergence is addressed through analyses, which result in the attainment of expressions for optimal RBF shape parameters .
Edit intent: clarity
Original:  This study seeks to address the practical elements of the approach, including the evaluations of shape parameters and a hybrid implementation.
Revised:  This study seeks to address the practical elements of the approach, including the evaluations of shape parameters as well as hybrid implementation.
Edit intent: coherence
Original:  We propose two variants of it.
Revised:  We propose two variants :
Edit intent: clarity
Original: The equilibration of  trivalent polygonal network in two dimensions (2D) is an universal phenomena in nature, however, the behind mathematical mechanism remains unclear.
Revised: The equilibration of a trivalent polygonal network in two dimensions (2D) is an universal phenomena in nature, however, the behind mathematical mechanism remains unclear.
Edit intent: fluency
Original: The equilibration of  trivalent polygonal network in two dimensions (2D) is an universal phenomena in nature, however, the behind mathematical mechanism remains unclear.
Revised: The equilibration of trivalent polygonal network in two dimensions (2D) is a universal phenomenon in nature, however, the behind mathematical mechanism remains unclear.
Edit intent: fluency
Original: The equilibration of  trivalent polygonal network in two dimensions (2D) is an universal phenomena in nature, however, the behind mathematical mechanism remains unclear.
Revised: The equilibration of trivalent polygonal network in two dimensions (2D) is an universal phenomena in nature, but the underlying mathematical mechanism remains unclear.
Edit intent: fluency
Original:  In this study, to simulate the equilibration, we developed a relaxation algorithm just based on one simple geometrical rule .
Revised:  In this study, a relaxation algorithm just based on one simple geometrical rule .
Edit intent: coherence
Original:  In this study, to simulate the equilibration, we developed a relaxation algorithm just based on one simple geometrical rule .
Revised:  In this study, to simulate the equilibration, we developed a relaxation algorithm based on a simple geometrical rule .
Edit intent: clarity
Original:  The simulated relaxation changed the polygonal cell of  Voronoi network from  ellipse's inscribed polygon toward  ellipse's maximal inscribed polygon.
Revised:  The simulated relaxation changed the polygonal cell of the Voronoi network from ellipse's inscribed polygon toward ellipse's maximal inscribed polygon.
Edit intent: fluency
Original:  The simulated relaxation changed the polygonal cell of  Voronoi network from  ellipse's inscribed polygon toward  ellipse's maximal inscribed polygon.
Revised:  The simulated relaxation changed the polygonal cell of Voronoi network from an ellipse's inscribed polygon toward ellipse's maximal inscribed polygon.
Edit intent: fluency
Original:  The simulated relaxation changed the polygonal cell of  Voronoi network from  ellipse's inscribed polygon toward  ellipse's maximal inscribed polygon.
Revised:  The simulated relaxation changed the polygonal cell of Voronoi network from ellipse's inscribed polygon toward the ellipse's maximal inscribed polygon.
Edit intent: fluency
Original:  Meanwhile, the Aboav-Weaire's law, which describe the neighboring relationship between cells, still holds statistically.
Revised:  Meanwhile, the Aboav-Weaire's law, which describes the neighboring relationship between cells, still holds statistically.
Edit intent: fluency
Original:  The implementation of this algorithm strongly support the hypothesis Ellipse Packing which was proposed to explain the dynamic behaviors of  trivalent 2D structure.
Revised:  The succeed of simulation strongly supports the ellipse packing hypothesis that was proposed to explain the dynamic behaviors of trivalent 2D structure.
Edit intent: clarity
Original:  The implementation of this algorithm strongly support the hypothesis Ellipse Packing which was proposed to explain the dynamic behaviors of  trivalent 2D structure.
Revised:  The implementation of this algorithm strongly support the hypothesis Ellipse Packing which was proposed to explain the dynamic behaviors of a trivalent 2D structure.
Edit intent: fluency
Original:  We also found that the edge of large cells tend to be shorter  , and vice versa.
Revised:  We also found that the edge of large cells tends to be shorter , and vice versa.
Edit intent: fluency
Original:  Besides , the relaxation increased the area and the edge length of large cells and vice versa .
Revised:  In addition , the relaxation increased the area and the edge length of large cells and vice versa .
Edit intent: coherence
Original:  Besides , the relaxation increased the area and the edge length of large cells and vice versa .
Revised:  Besides , the relaxation increases the area and the edge length of large cells and vice versa .
Edit intent: fluency
Original:  Besides , the relaxation increased the area and the edge length of large cells and vice versa .
Revised:  Besides , the relaxation increased the area and edge length of large cells and vice versa .
Edit intent: fluency
Original:  The pattern of changes on the area of different edged cells due to relaxation is almost the same compared with the growth pattern described by  von-Neumann-Mullins 's law.
Revised:  The pattern of changes in the area of different edged cells due to relaxation is almost the same compared with the growth pattern described by von-Neumann-Mullins 's law.
Edit intent: fluency
Original:  The pattern of changes on the area of different edged cells due to relaxation is almost the same compared with the growth pattern described by  von-Neumann-Mullins 's law.
Revised:  The pattern of changes on the area of different-edged cells due to relaxation is almost the same compared with the growth pattern described by von-Neumann-Mullins 's law.
Edit intent: fluency
Original:  The pattern of changes on the area of different edged cells due to relaxation is almost the same compared with the growth pattern described by  von-Neumann-Mullins 's law.
Revised:  The pattern of changes on the area of different edged cells due to relaxation is almost the same as the growth pattern described by von-Neumann-Mullins 's law.
Edit intent: coherence
Original:  The pattern of changes on the area of different edged cells due to relaxation is almost the same compared with the growth pattern described by  von-Neumann-Mullins 's law.
Revised:  The pattern of changes on the area of different edged cells due to relaxation is almost the same compared with the growth pattern described by the von-Neumann-Mullins 's law.
Edit intent: fluency
Original:  To simulate the fact that both the initial state of the physical memristive devices and the impact of each voltage pulse are unknown we injected noise at each time step . Nevertheless, discrete updates based on local knowledge were shown to result in robust learning performance.
Revised:  To simulate the fact that both the initial state of the physical memristive devices and the impact of each voltage pulse are unknown we injected noise at each timestep . Nevertheless, discrete updates based on local knowledge were shown to result in robust learning performance.
Edit intent: fluency