wanyu/IteraTeR_v2 huggingface dataset:
Original: In recent years  consumer-level depth sensors have been adopted in various applications.
Revised: In recent years consumer-level depth sensors have been adopted for various applications.
Edit intent: fluency
Original:  However, they often produce depth maps at a not very fast frame rate ( around 30 frames per second), preventing them from being used for applications like digitizing human performance involving fast motion.
Revised:  However, they often produce depth maps at a not very fast frame rate ( approximately 30 frames per second), preventing them from being used for applications like digitizing human performance involving fast motion.
Edit intent: clarity
Original:  However, they often produce depth maps at a not very fast frame rate ( around 30 frames per second), preventing them from being used for applications like digitizing human performance involving fast motion.
Revised:  However, they often produce depth maps at a not very fast frame rate ( around 30 frames per second), preventing them from being used for applications such as digitizing human performance involving fast motion.
Edit intent: fluency
Original:  On the other hand there are available low-cost faster-rate video cameras .
Revised:  On the other hand , low-cost faster-rate video cameras .
Edit intent: clarity
Original:  This motivates us to develop a hybrid camera that consists of a high-rate video camera and a low-rate depth camera , and to allow temporal interpolation of depth maps with the help of auxiliary color images.
Revised:  This motivates us to develop a hybrid camera that consists of a high-frame-rate video camera and a low-rate depth camera , and to allow temporal interpolation of depth maps with the help of auxiliary color images.
Edit intent: clarity
Original:  This motivates us to develop a hybrid camera that consists of a high-rate video camera and a low-rate depth camera , and to allow temporal interpolation of depth maps with the help of auxiliary color images.
Revised:  This motivates us to develop a hybrid camera that consists of a high-rate video camera and a low-frame-rate depth camera and to allow temporal interpolation of depth maps with the help of auxiliary color images.
Edit intent: clarity
Original:  To achieve this  we develop a novel algorithm that reconstructs intermediate depth frames and estimates scene flow simultaneously.
Revised:  To achieve this , we develop a novel algorithm that reconstructs intermediate depth frames and estimates scene flow simultaneously.
Edit intent: fluency
Original:  To achieve this  we develop a novel algorithm that reconstructs intermediate depth frames and estimates scene flow simultaneously.
Revised:  To achieve this we develop a novel algorithm that reconstructs intermediate depth maps and estimates scene flow simultaneously.
Edit intent: clarity
Original:  We have tested our algorithm on various examples involving fast, non-rigid motions of single or multiple objects.
Revised:  We test our algorithm on various examples involving fast, non-rigid motions of single or multiple objects.
Edit intent: clarity
Original:  Our experiments show that our scene flow estimation method is more precise than purely tracking based method and the state-of-the-art techniques.
Revised:  Our experiments show that our scene flow estimation method is more precise than a tracking-based method and the state-of-the-art techniques.
Edit intent: clarity
Original:  Syndromic surveillance data are typically fully aggregated in space , to be used for epidemic alert systems .
Revised:  Syndromic surveillance data are typically fully aggregated in space .
Edit intent: clarity
Original:  However, epidemics may be spatially heterogeneous, undergoing distinct dynamics in separate regions of the surveillance area.
Revised:  However, epidemics may be spatially heterogeneous, undergoing distinct dynamics in distinct regions of the surveillance area.
Edit intent: coherence
Original:  We quantify the relationship between local time series using Pearson correlation and use modularity to classify the local data .
Revised:  We quantify the relationship between local time series and then classify them using modularity maximization .
Edit intent: clarity
Original:  We analyze 31 years of surveillance data on influenza-like-illness (ILI) from the French system Sentinelles . Results.
Revised:  We analyzed 31 years of surveillance data on influenza-like-illness (ILI) from the French system Sentinelles . Results.
Edit intent: fluency
Original:  We analyze 31 years of surveillance data on influenza-like-illness (ILI) from the French system Sentinelles . Results.
Revised:  We analyze 31 years of data on influenza-like-illness (ILI) from the French system Sentinelles . Results.
Edit intent: clarity
Original:  We analyze 31 years of surveillance data on influenza-like-illness (ILI) from the French system Sentinelles . Results.
Revised:  We analyze 31 years of surveillance data on influenza-like-illness from the French system Sentinelles . Results.
Edit intent: clarity
Original:  Distinct epidemic regions could be identified as soon as five weeks after the nationwide alert.
Revised:  Distinct epidemic regions could be identified only 4-5 weeks after the nationwide alert.
Edit intent: clarity
Original:  We found three scenarios for the role of spatial heterogeneity in ILI epidemiology .
Revised:  The impact of spatial heterogeneity in ILI epidemiology .
Edit intent: clarity
Original:  First, when the nationwide epidemic alert was triggered, 32-41\% of the administrative regions were experiencing an epidemic, while the others were not.
Revised:  First, when the nationwide alert was triggered, 32-41\% of the administrative regions were experiencing an epidemic, while the others were not.
Edit intent: fluency
Original:  Spatial heterogeneity analyses may provide the timing of the epidemic peak and finish, in various regions, to tailor disease monitoring and control .
Revised:  Spatial heterogeneity analyses can provide the timing of the epidemic peak and finish, in various regions, to tailor disease monitoring and control .
Edit intent: clarity
Original: Williams and Beer (2010) proposed a nonnegative mutual information decomposition, based on the construction of redundancy lattices, which allows separating the information that a set of variables contains about a target variable into nonnegative components interpretable as the unique information of some variables not contained in others as well as redundant and synergistic components.
Revised: Williams and Beer (2010) proposed a nonnegative mutual information decomposition, based on the construction of redundancy lattices, which allows separating the information that a set of variables contains about a target variable into nonnegative components interpretable as the unique information of some variables not provided by others as well as redundant and synergistic components.
Edit intent: clarity
Original:  We here present a procedure to determine  multivariate redundancy measures, within the framework of maximum entropy models .
Revised:  We here present a procedure to determine multivariate redundancy measures, within the maximum entropy framework .
Edit intent: clarity
Original:  In particular, we generalize existing bivariate maximum entropy-based measures of redundancy and unique information, defining measures of the redundant information that a group of variables has about a target, and of the unique redundant information that a group of variables has about a target that is not redundant with information from another group.
Revised:  In particular, we generalize existing bivariate maximum entropy measures of redundancy and unique information, defining measures of the redundant information that a group of variables has about a target, and of the unique redundant information that a group of variables has about a target that is not redundant with information from another group.
Edit intent: clarity
Original:  Second, the construction of rooted tree-based decompositions to breakdown mutual information, ensuring nonnegativity by the local implementation of maximum entropy information projections at each binary unfolding of the tree nodes .
Revised:  Second, the construction of rooted tree-based decompositions of the mutual information, ensuring nonnegativity by the local implementation of maximum entropy information projections at each binary unfolding of the tree nodes .
Edit intent: clarity
Original:  Altogether, the proposed measures are nonnegative and conform to the desirable axioms for redundancy measures .
Revised:  Altogether, the proposed measures quantify the different multivariate redundancy contributions of a nonnegative mutual information decomposition consistent with the redundancy lattice .
Edit intent: clarity
Original: Assume we are given (finitely many) mutually independent variables and (finitely many) "undesirable" events  each depending on a subset of the variables of at most k elements, known as the scope of the event.
Revised: Assume we are given (finitely many) mutually independent variables and (finitely many) "undesirable" events , each depending on a subset of the variables of at most k elements, known as the scope of the event.
Edit intent: fluency
Original: Assume we are given (finitely many) mutually independent variables and (finitely many) "undesirable" events  each depending on a subset of the variables of at most k elements, known as the scope of the event.
Revised: Assume we are given (finitely many) mutually independent variables and (finitely many) "undesirable" events each depending on a subset of the variables of at most k elements, called the scope of the event.
Edit intent: clarity
Original:  Assume that the probability of an individual variable belonging to the scope of an occurring event is bounded by q. We prove that if ekq \leq 1 then there exists at least one assignment to the variables for which none of the events occurs.
Revised:  Assume that the probability of a variable belonging to the scope of an occurring event is bounded by q. We prove that if ekq \leq 1 then there exists at least one assignment to the variables for which none of the events occurs.
Edit intent: clarity
Original:  The proof is through a public coin, interactive implementation of the algorithm by Moser.
Revised:  The proof of the result is through an interactive, private-coin implementation of the algorithm by Moser.
Edit intent: clarity
Original:  however, the provers' (Merlin's) choices remain non-deterministic.
Revised:  however, the provers' choices remain non-deterministic.
Edit intent: clarity
Original:  Communication analysis between the driving component and each components of the system reveals that the combination of channel capacity and transfer entropy helps locate the wavebreaks.
Revised:  Communication analysis between the driving component and each component of the system reveals that the combination of channel capacity and transfer entropy helps locate the wavebreaks.
Edit intent: fluency
Original:  Communication analysis between the driving component and each components of the system reveals that the combination of channel capacity and transfer entropy helps locate the wavebreaks.
Revised:  Communication analysis between the driving component and each components of the system reveals that channel capacity, mutual information and transfer entropy helps locate the wavebreaks.
Edit intent: clarity
Original:  Communication analysis between the driving component and each components of the system reveals that the combination of channel capacity and transfer entropy helps locate the wavebreaks.
Revised:  Communication analysis between the driving component and each components of the system reveals that the combination of channel capacity and transfer entropy can locate the wavebreaks.
Edit intent: clarity
Original:  In this paper we seek to identify simple structural properties of instances of stable matching problems which will allow the design of efficient algorithms .
Revised:  In this paper we seek to identify structural properties of instances of stable matching problems which will allow the design of efficient algorithms .
Edit intent: clarity
Original:  This situation could arise in practice if agents form preferences  based on some small collection of agents' attributes.
Revised:  This situation would arise in practice if agents form preferences based on some small collection of agents' attributes.
Edit intent: clarity
Original:  This situation could arise in practice if agents form preferences  based on some small collection of agents' attributes.
Revised:  This situation could arise in practice if agents form preferences solely based on some small collection of agents' attributes.
Edit intent: clarity
Original:  We show that in this setting several well-studied NP-hard stable matching problems (such as MAX SMTI , MAX SRTI, and MAX SIZE MIN BP SMTI ) belong to the parameterised complexity class FPT when parameterised by the number of different types of agents , and so admit efficient algorithms when this number of types is small .
Revised:  We show that in this setting several well-studied NP-hard stable matching problems (such as MAX SMTI , MAX SRTI, and MAX SIZE MIN BP SMTI ) belong to the parameterised complexity class FPT when parameterised by the number of different types of agents , and so admit efficient algorithms when this number of types is bounded by a constant .
Edit intent: clarity
Original: In this paper  we set forth a 3-D ocean model of the radioactive trace isotopes Th-230 and Pa-231.
Revised: In this paper , we set forth a 3-D ocean model of the radioactive trace isotopes Th-230 and Pa-231.
Edit intent: fluency
Original:  The interest arises from the fact that these isotopes are extensively used in paleoceanography to reconstruct ocean circulation.
Revised:  The interest arises from the fact that these isotopes are extensively used for investigating particle transport in the ocean and reconstructing past ocean circulation.
Edit intent: clarity
Original:  Small and big lithogenic particles from dust deposition were included in our model as well.
Revised:  Small and big lithogenic particles from dust deposition are included in our model as well.
Edit intent: fluency
Original:  When the CSI is available, we show that the average secrecy capacity is higher when the receiver is located at the corner, even if the intensity of interferers over there is four times higher than the intensity of interferers in the bulk.
Revised:  When the CSI is available, we show that the average secrecy capacity is higher when the receiver is located at the corner, even if the intensity of interferers in this case is four times higher than the intensity of interferers in the bulk.
Edit intent: clarity
Original: Neuromorphic computing systems comprise net- works of neurons that use asynchronous events for both computation and communication.
Revised: Neuromorphic computing systems comprise networks of neurons that use asynchronous events for both computation and communication.
Edit intent: fluency
Original:  After the material solidifies, the product is pulled out of the mold.
Revised:  After the material solidifies, the product is removed from the mold.
Edit intent: clarity
Original:  We study the case in which the mold is made of a single part and the object to be produced is a three-dimensional polyhedron.
Revised:  We study the case where the mold is made of a single part and the object to be produced is a three-dimensional polyhedron.
Edit intent: clarity
Original:  A direction in which the object can be removed without breaking the mold is called a valid pull-out direction.
Revised:  A direction in which the object can be removed without breaking the mold is called a valid removal direction.
Edit intent: clarity
Original:  The time-varying PHE feature allows us to apply such class of multifractional processes to model stock prices under various market conditions .
Revised:  The time-varying feature of the PHE allows us to apply such class of multifractional processes to model stock prices under various market conditions .
Edit intent: clarity
Original:  An empirical study on modeling cross-listed stocks provides new evidence that equity's path roughness varies via time and  price informativeness properties from global  markets.
Revised:  An empirical study on modeling cross-listed stocks provides new evidence that the equity path's roughness varies via time and price informativeness properties from global markets.
Edit intent: clarity
Original:  An empirical study on modeling cross-listed stocks provides new evidence that equity's path roughness varies via time and  price informativeness properties from global  markets.
Revised:  An empirical study on modeling cross-listed stocks provides new evidence that equity's path roughness varies via time and price informativeness properties from global stock markets.
Edit intent: clarity
Original:  The time-varying feature of the PHE allows us to apply such class of multifractional processes to model stock prices under various market conditions, that are both time-dependent and region-dependent.
Revised:  The time-varying , can be used to model stock prices under various market conditions, that are both time-dependent and region-dependent.
Edit intent: clarity
Original:  As an application to finance, an empirical study on modeling cross-listed stocks provides new evidence that the equity path's roughness varies via time and  stock price informativeness properties from global stock markets.
Revised:  As an application to finance, an empirical study on modeling cross-listed stocks provides new evidence that the equity path's roughness varies via time and the stock price informativeness properties from global stock markets.
Edit intent: fluency
Original: Generalized polynomial chaos (gPC)  has been extensively used in uncertainty quantification problems to handle random variables.
Revised: Generalized polynomial chaos (gPC) method has been extensively used in uncertainty quantification problems to handle random variables.
Edit intent: clarity
Original: Generalized polynomial chaos (gPC)  has been extensively used in uncertainty quantification problems to handle random variables.
Revised: Generalized polynomial chaos (gPC) has been extensively used in uncertainty quantification problems where equations contain random variables.
Edit intent: clarity
Original:  For gPC to be valid, one requires high regularity on the random space that hyperbolic type problems usually cannot provide, and thus it is believed to behave poorly in those systems .
Revised:  For gPC to be valid, one requires high regularity on the random space , but this is what hyperbolic type problems usually cannot provide, and thus it is believed to behave poorly in those systems .
Edit intent: coherence
Original:  For gPC to be valid, one requires high regularity on the random space that hyperbolic type problems usually cannot provide, and thus it is believed to behave poorly in those systems .
Revised:  For gPC to be valid, one requires high regularity on the random space that hyperbolic type problems cannot provide .
Edit intent: coherence
Original:  We provide a counter-argument in this paper, and show that despite the solution profile itself develops singularities in the random space, which prevents the use of gPC, the physical quantities such as shock emergence time,  shock location, and shock width are all smooth functions of random variables in the initial data : with proper shifting, the solution's polynomial interpolation approximates with high accuracy .
Revised:  We provide a counter-argument in this paper, and show that even though the solution profile itself develops singularities in the random space, which prevents the use of gPC, the physical quantities such as shock emergence time, shock location, and shock width are all smooth functions of random variables in the initial data : with proper shifting, the solution's polynomial interpolation approximates with high accuracy .
Edit intent: fluency
Original:  We provide a counter-argument in this paper, and show that despite the solution profile itself develops singularities in the random space, which prevents the use of gPC, the physical quantities such as shock emergence time,  shock location, and shock width are all smooth functions of random variables in the initial data : with proper shifting, the solution's polynomial interpolation approximates with high accuracy .
Revised:  We provide a counter-argument in this paper, and show that despite the solution profile develops singularities in the random space, which prevents the use of gPC, the physical quantities such as shock emergence time, shock location, and shock width are all smooth functions of random variables in the initial data : with proper shifting, the solution's polynomial interpolation approximates with high accuracy .
Edit intent: clarity
Original:  We provide a counter-argument in this paper, and show that despite the solution profile itself develops singularities in the random space, which prevents the use of gPC, the physical quantities such as shock emergence time,  shock location, and shock width are all smooth functions of random variables in the initial data : with proper shifting, the solution's polynomial interpolation approximates with high accuracy .
Revised:  We provide a counter-argument in this paper, and show that despite the solution profile itself develops singularities in the random space, which prevents the use of gPC, the physical quantities (such as the shock emergence time, shock location, and shock width are all smooth functions of random variables in the initial data : with proper shifting, the solution's polynomial interpolation approximates with high accuracy .
Edit intent: fluency
Original:  We provide a counter-argument in this paper, and show that despite the solution profile itself develops singularities in the random space, which prevents the use of gPC, the physical quantities such as shock emergence time,  shock location, and shock width are all smooth functions of random variables in the initial data : with proper shifting, the solution's polynomial interpolation approximates with high accuracy .
Revised:  We provide a counter-argument in this paper, and show that despite the solution profile itself develops singularities in the random space, which prevents the use of gPC, the physical quantities such as shock emergence time, the shock location, and shock width are all smooth functions of random variables in the initial data : with proper shifting, the solution's polynomial interpolation approximates with high accuracy .
Edit intent: fluency
Original:  For gPC to be valid , PDE solutions need to have high regularity in the random space, but this is what hyperbolic type problems cannot provide.
Revised:  For gPC to achieve high accuracy , PDE solutions need to have high regularity in the random space, but this is what hyperbolic type problems cannot provide.
Edit intent: clarity
Original:  We provide a counter-argument in this paper, and show that even though the solution profile develops singularities in the random space, which prevents the use of gPC, the physical quantities (such as the shock emergence time, the shock location, and the shock strength) are all smooth functions of the uncertainties coming from both initial data and the wave speed: with proper shifting, the solution's polynomial interpolation approximates with high accuracy  .
Revised:  We provide a counter-argument in this paper, and show that even though the solution profile develops singularities in the random space, which destroys the high accuracy of gPC, the physical quantities (such as the shock emergence time, the shock location, and the shock strength) are all smooth functions of the uncertainties coming from both initial data and the wave speed: with proper shifting, the solution's polynomial interpolation approximates with high accuracy .
Edit intent: clarity