wanyu/IteraTeR_v2 huggingface dataset:
Original:  . Using the analysis, we show for the first time that depending on the intensity of the BSs, the performance of the SCNs can be divided into four different regimes ,  i.e.,  the noise-limited regime,  the signal NLOS-to-LOS-transition regime, the interference NLOS-to-LOS-transition regime and the dense interference-limited regime , where in each regime the performance is dominated by different factors.
Revised:  . Using the analysis, we show for the first time that depending on the intensity of the BSs, the performance of the SCNs can be divided into four different regimes , i.e., the noise-limited regime, (ii) the signal NLOSto- LOS-transition regime, (iii) the signal NLOS-to-LOS-transition regime, the interference NLOS-to-LOS-transition regime and the dense interference-limited regime , where in each regime the performance is dominated by different factors.
Edit intent: fluency
Original:  . Using the analysis, we show for the first time that depending on the intensity of the BSs, the performance of the SCNs can be divided into four different regimes ,  i.e.,  the noise-limited regime,  the signal NLOS-to-LOS-transition regime, the interference NLOS-to-LOS-transition regime and the dense interference-limited regime , where in each regime the performance is dominated by different factors.
Revised:  . Using the analysis, we show for the first time that depending on the intensity of the BSs, the performance of the SCNs can be divided into four different regimes , i.e., the noise-limited regime, the interference NLOS-to-LOS-transition regime and the dense interference-limited regime , where in each regime the performance is dominated by different factors.
Edit intent: clarity
Original: Considering both non-line-of-sight ( NLOS ) and line-of-sight ( LOS ) transmissions, the transitional behaviors from noise-limited regime to dense interference-limited regime have been elaborated for the fifth generation (5G) small cell networks (SCNs).
Revised: Considering both non-line-of-sight ( NLoS ) and line-of-sight ( LOS ) transmissions, the transitional behaviors from noise-limited regime to dense interference-limited regime have been elaborated for the fifth generation (5G) small cell networks (SCNs).
Edit intent: fluency
Original: Considering both non-line-of-sight ( NLOS ) and line-of-sight ( LOS ) transmissions, the transitional behaviors from noise-limited regime to dense interference-limited regime have been elaborated for the fifth generation (5G) small cell networks (SCNs).
Revised: Considering both non-line-of-sight ( NLOS ) and line-of-sight ( LoS ) transmissions, the transitional behaviors from noise-limited regime to dense interference-limited regime have been elaborated for the fifth generation (5G) small cell networks (SCNs).
Edit intent: clarity
Original: Considering both non-line-of-sight ( NLOS ) and line-of-sight ( LOS ) transmissions, the transitional behaviors from noise-limited regime to dense interference-limited regime have been elaborated for the fifth generation (5G) small cell networks (SCNs).
Revised: Considering both non-line-of-sight ( NLOS ) and line-of-sight ( LOS ) transmissions, the transitional behaviors from noise-limited regime to dense interference-limited regime have been investigated for the fifth generation (5G) small cell networks (SCNs).
Edit intent: clarity
Original:  Besides, we identify four performance regimes based on base station (BS) density, i.e., (i) the noise-limited regime, (ii) the signal NLOSto- LOS-transition regime, (iii) the interference NLOS-to-LOS-transition regime, and (iv) the dense interference-limited regime.
Revised:  Besides, we identify four performance regimes based on base station (BS) density, i.e., (i) the noise-limited regime, (ii) the signal-dominated regime, (iii) the interference NLOS-to-LOS-transition regime, and (iv) the dense interference-limited regime.
Edit intent: clarity
Original:  Besides, we identify four performance regimes based on base station (BS) density, i.e., (i) the noise-limited regime, (ii) the signal NLOSto- LOS-transition regime, (iii) the interference NLOS-to-LOS-transition regime, and (iv) the dense interference-limited regime.
Revised:  Besides, we identify four performance regimes based on base station (BS) density, i.e., (i) the noise-limited regime, (ii) the signal NLOSto- LOS-transition regime, (iii) the interference-dominated regime, and (iv) the dense interference-limited regime.
Edit intent: clarity
Original:  To analytically illustrate the performance regime, we propose a unified framework characterizing the future 5G wireless networks over generalized shadowing/fading channels  . Simulation results indicate that different factors, i.e., noise, desired signal  and interference, successively and separately dominate the network performance with the increase of BS density.
Revised:  To characterize the performance regime, we propose a unified framework characterizing the future 5G wireless networks over generalized shadowing/fading channels . Simulation results indicate that different factors, i.e., noise, desired signal and interference, successively and separately dominate the network performance with the increase of BS density.
Edit intent: clarity
Original:  To analytically illustrate the performance regime, we propose a unified framework characterizing the future 5G wireless networks over generalized shadowing/fading channels  . Simulation results indicate that different factors, i.e., noise, desired signal  and interference, successively and separately dominate the network performance with the increase of BS density.
Revised:  To analytically illustrate the performance regime, we propose a unified framework analyzing the future 5G wireless networks over generalized shadowing/fading channels . Simulation results indicate that different factors, i.e., noise, desired signal and interference, successively and separately dominate the network performance with the increase of BS density.
Edit intent: clarity
Original:  To analytically illustrate the performance regime, we propose a unified framework characterizing the future 5G wireless networks over generalized shadowing/fading channels  . Simulation results indicate that different factors, i.e., noise, desired signal  and interference, successively and separately dominate the network performance with the increase of BS density.
Revised:  To analytically illustrate the performance regime, we propose a unified framework characterizing the future 5G wireless networks over generalized shadowing/fading channels . Simulation results indicate that different factors, i.e., noise, desired signal , and interference, successively and separately dominate the network performance with the increase of BS density.
Edit intent: fluency
Original:  Hence, our results shed  light on the design and management of SCNs in urban and rural areas with different BS deployment density .
Revised:  Hence, our results shed new light on the design and management of SCNs in urban and rural areas with different BS deployment density .
Edit intent: clarity
Original:  Hence, our results shed  light on the design and management of SCNs in urban and rural areas with different BS deployment density .
Revised:  Hence, our results shed light on the design and management of SCNs in urban and rural areas with different BS deployment densities .
Edit intent: fluency
Original:  We exhibit results showing that this sequence is deeply related to the combinatorial and periodical structure of a word.
Revised:  We exhibit results showing that this sequence is deeply related to the combinatorial and periodic structure of a word.
Edit intent: fluency
Original: In this paper, we construct framelets associated with a sequence of quadrature rules on the simplex T ^2 in R^{2}.
Revised: In this paper, we construct framelets associated with a sequence of quadrature rules on the simplex T ^{2 in R^{2}.
Edit intent: fluency
Original:  We give the framelet transforms --- decomposition and reconstruction of the coefficients for framelets of a function on T ^2 . We prove that the reconstruction is exact when the framelets are tight.
Revised:  We give the framelet transforms -- decomposition and reconstruction of the coefficients for framelets of a function on T ^2 . We prove that the reconstruction is exact when the framelets are tight.
Edit intent: fluency
Original:  We give the framelet transforms --- decomposition and reconstruction of the coefficients for framelets of a function on T ^2 . We prove that the reconstruction is exact when the framelets are tight.
Revised:  We give the framelet transforms --- decomposition and reconstruction of the coefficients for framelets of a function on T ^{2 . We prove that the reconstruction is exact when the framelets are tight.
Edit intent: fluency
Original: We analyze the effect of the social network structure on diffusion of new products in the discrete Bass-SIR model, in which consumers who adopt the product can later "recover" and stop influencing their peers to adopt the product.
Revised: We consider the diffusion of new products in the discrete Bass-SIR model, in which consumers who adopt the product can later "recover" and stop influencing their peers to adopt the product.
Edit intent: clarity
Original:  This is different from the case of non-recovering adopters, where the diffusion curves on one-sided and  two-sided 1D networks are identical.
Revised:  This is different from the case of non-recovering adopters, where the diffusion on one-sided and two-sided 1D networks are identical.
Edit intent: clarity
Original:  This is different from the case of non-recovering adopters, where the diffusion curves on one-sided and  two-sided 1D networks are identical.
Revised:  This is different from the case of non-recovering adopters, where the diffusion curves on one-sided and on two-sided 1D networks are identical.
Edit intent: fluency
Original:  We also propose a nonlinear model for recoveries, and show that on vertex-transitive networks, allowing consumersto be heterogeneous has a negligible effect on the  diffusion.
Revised:  We also propose a nonlinear model for recoveries, and show that consumers' heterogeneity has a negligible effect on the diffusion.
Edit intent: clarity
Original:  We also propose a nonlinear model for recoveries, and show that on vertex-transitive networks, allowing consumersto be heterogeneous has a negligible effect on the  diffusion.
Revised:  We also propose a nonlinear model for recoveries, and show that on vertex-transitive networks, allowing consumersto be heterogeneous has a negligible effect on the aggregate diffusion.
Edit intent: clarity
Original:  In this paper , we develop a theoretical framework that leads to the definition of the abstract concept of flow size in connection with the global quality of service (QoS ) requirements of a network.
Revised:  In this paper we present a theory of flow ordering that reveals the connection between the abstract concept of flow size in connection with the global quality of service (QoS ) requirements of a network.
Edit intent: clarity
Original:  In this paper , we develop a theoretical framework that leads to the definition of the abstract concept of flow size in connection with the global quality of service (QoS ) requirements of a network.
Revised:  In this paper , we develop a theoretical framework that leads to the definition of the abstract concept of flow size and the QoS properties of a network.
Edit intent: clarity
Original:  Results show positive outcome in hyperspectral analysis and visualization compared to previous literature, therefore we suggest using PlanetServer for such investigations.
Revised:  Results show positive outcome in hyper-spectral analysis and visualization compared to previous literature, therefore we suggest using PlanetServer for such investigations.
Edit intent: fluency
Original:  Results show positive outcome in hyperspectral analysis and visualization compared to previous literature, therefore we suggest using PlanetServer for such investigations.
Revised:  Results show positive outcome in hyperspectral analysis and visualization compared to previous literature, we suggestusing the PlanetServer approach for such investigations.
Edit intent: clarity
Original:  Such a relationship might show the features and trade-offs intrinsic to programming the mater.
Edit intent: clarity
Original: In this paper we consider some insurance policies related with drawdown and drawup events of log-returns for an underlying asset modeled by a spectrally negative geometric L\'evy process.
Revised: In this paper we consider some insurance policies related to drawdown and drawup events of log-returns for an underlying asset modeled by a spectrally negative geometric L\'evy process.
Edit intent: fluency
Original:  We consider four contracts among which three were introduced in Zhang et al. (2013) for a geometric Brownian motion.
Revised:  We consider four contracts , three of which were introduced in Zhang et al. (2013) for a geometric Brownian motion.
Edit intent: clarity
Original:  The first one is an insurance contract where  protection buyer pays a constant premium until the drawdown of fixed size of log-returns occurs.
Revised:  The first one is an insurance contract where the protection buyer pays a constant premium until the drawdown of fixed size of log-returns occurs.
Edit intent: fluency
Original:  In return he/she receives  certain insured amount at the drawdown epoch.
Revised:  In return he/she receives a certain insured amount at the drawdown epoch.
Edit intent: fluency
Original:  Next insurance contract provides protection from any specified drawdown with a drawup contingency.
Revised:  The next insurance contract provides protection from any specified drawdown with a drawup contingency.
Edit intent: clarity
Original:  This contract expires early if  certain fixed drawup event occurs prior to  fixed drawdown.
Revised:  This contract expires early if a certain fixed drawup event occurs prior to fixed drawdown.
Edit intent: fluency
Original:  This contract expires early if  certain fixed drawup event occurs prior to  fixed drawdown.
Revised:  This contract expires early if certain fixed drawup event occurs prior to the fixed drawdown.
Edit intent: fluency
Original:  The last two contracts are extensions of the previous ones by additional cancellable feature which allows an investor to terminate the contract earlier.
Revised:  The last two contracts are extensions of the previous ones by an additional cancellation feature which allows an investor to terminate the contract earlier.
Edit intent: clarity
Original:  The last two contracts are extensions of the previous ones by additional cancellable feature which allows an investor to terminate the contract earlier.
Revised:  The last two contracts are extensions of the previous ones by additional cancellable feature which allows the investor to terminate the contract earlier.
Edit intent: fluency
Original:  We focus on two problems: calculating the fair premium p for the basic contracts and identifying the optimal stopping rule for the polices with cancellable feature.
Revised:  We focus on two problems: calculating the fair premium p for the basic contracts and identifying the optimal stopping rule for the policies with the cancellation feature.
Edit intent: fluency
Original:  To do this we solve some two-sided exit problems related with the drawdown and the drawup of spectrally negative L\'evy processes  which is of own scientific interest.
Revised:  To do this we solve some two-sided exit problems related to drawdown and drawup of spectrally negative L\'evy processes which is of own scientific interest.
Edit intent: fluency
Original:  To do this we solve some two-sided exit problems related with the drawdown and the drawup of spectrally negative L\'evy processes  which is of own scientific interest.
Revised:  To do this we solve some two-sided exit problems related with the drawdown and the drawup of spectrally negative L\'evy processes , which is of own scientific interest.
Edit intent: fluency
Original:  To do this we solve some two-sided exit problems related with the drawdown and the drawup of spectrally negative L\'evy processes  which is of own scientific interest.
Revised:  To do this we solve some two-sided exit problems related with the drawdown and the drawup of spectrally negative L\'evy processes which is of independent mathematical interest.
Edit intent: clarity
Original:  We also heavily rely on a theory of optimal stopping.
Revised:  We also heavily rely on the theory of optimal stopping.
Edit intent: fluency
Original: Despite the population of the noninvasive, economic, comfortable, and easy-to-install photoplethysmography (PPG) sensor, a mathematically rigorous and stable algorithm  to simultaneously extract the fundamental physiological information, including the instantaneous heart rate (IHR) and the instantaneous respiratory rate (IRR) , from the single-channel PPG signal is lacking.
Revised: Despite the population of the noninvasive, economic, comfortable, and easy-to-install photoplethysmography (PPG) , it is still lacking a mathematically rigorous and stable algorithm to simultaneously extract the fundamental physiological information, including the instantaneous heart rate (IHR) and the instantaneous respiratory rate (IRR) , from the single-channel PPG signal is lacking.
Edit intent: clarity
Original: Despite the population of the noninvasive, economic, comfortable, and easy-to-install photoplethysmography (PPG) sensor, a mathematically rigorous and stable algorithm  to simultaneously extract the fundamental physiological information, including the instantaneous heart rate (IHR) and the instantaneous respiratory rate (IRR) , from the single-channel PPG signal is lacking.
Revised: Despite the population of the noninvasive, economic, comfortable, and easy-to-install photoplethysmography (PPG) sensor, a mathematically rigorous and stable algorithm which is able to simultaneously extract the fundamental physiological information, including the instantaneous heart rate (IHR) and the instantaneous respiratory rate (IRR) , from the single-channel PPG signal is lacking.
Edit intent: clarity
Original: Despite the population of the noninvasive, economic, comfortable, and easy-to-install photoplethysmography (PPG) sensor, a mathematically rigorous and stable algorithm  to simultaneously extract the fundamental physiological information, including the instantaneous heart rate (IHR) and the instantaneous respiratory rate (IRR) , from the single-channel PPG signal is lacking.
Revised: Despite the population of the noninvasive, economic, comfortable, and easy-to-install photoplethysmography (PPG) sensor, a mathematically rigorous and stable algorithm to simultaneously extract from a single-channel PPG signal the instantaneous heart rate (IHR) and the instantaneous respiratory rate (IRR) , from the single-channel PPG signal is lacking.
Edit intent: clarity
Original:  The algorithm is applied to two publicly available batch databases, one is collected during intense physical activities , for the reproducibility purpose and the state-of-the-art results are obtained compared with existing reported outcomes .
Revised:  The algorithm is applied to two publicly available batch databases, one is collected during intense physical activities , for the reproducibility purpose and the state-of-the-art in this field of research .
Edit intent: clarity
Original:  The results suggest the potential of the proposed algorithm to analyze the signal acquired from the widely available wearable devices, even when a subject exercises .
Revised:  The results suggest the potential of the proposed algorithm to analyze the signal acquired from widely available wearable devices, even when a subject exercises .
Edit intent: fluency
Original:  The results suggest the potential of the proposed algorithm to analyze the signal acquired from the widely available wearable devices, even when a subject exercises .
Revised:  The results suggest the potential of the proposed algorithm to analyze the signal acquired from the widely available wearable devices, even when a subject carries out intense physical activities .
Edit intent: clarity
Original:  We end with the conjecture that a change in the bookkeeping leads to an exact description of the network structure.
Revised:  We end with the conjecture that an extension of the bookkeeping leads to an exact description of the network structure.
Edit intent: clarity
Original: Light field cameras can capture the 3D information in a scene with a single shot .
Revised: Light field cameras capture the 3D information in a scene with a single shot .
Edit intent: clarity
Original: Light field cameras can capture the 3D information in a scene with a single shot .
Revised: Light field cameras can capture the 3D information in a scene with a single exposure .
Edit intent: clarity
Original:  This special feature makes light field cameras very appealing for a variety of applications: from the popular post-capture refocus, to depth estimation and image-based rendering.
Revised:  This special feature makes light field cameras very appealing for a variety of applications: from post-capture refocus, to depth estimation and image-based rendering.
Edit intent: clarity
Original:  We show that coupling the multi-frame approach with a graph regularizer, that enforces the light field structure via non local self similarities, permits to avoid the costly and challenging disparity estimation step for all the views.
Revised:  We show that coupling the multi-frame approach with a graph regularizer, that enforces the light field structure via nonlocal self similarities, permits to avoid the costly and challenging disparity estimation step for all the views.
Edit intent: fluency
Original:  Extensive experiments show that the proposed algorithm compares favorably to the other state-of-the-art methods for light field super-resolution, both in terms of PSNR and in terms of visual quality.
Revised:  Extensive experiments show that the new algorithm compares favorably to the other state-of-the-art methods for light field super-resolution, both in terms of PSNR and in terms of visual quality.
Edit intent: clarity
Original: In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff 2006 . A Combinatorial Game is a two-player game with no chance and no hidden information, such as Go or Chess.
Revised: In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff . A Combinatorial Game is a two-player game with no chance and no hidden information, such as Go or Chess.
Edit intent: coherence
Original: In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff 2006 . A Combinatorial Game is a two-player game with no chance and no hidden information, such as Go or Chess.
Revised: In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff 2006 . A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess.
Edit intent: fluency
Original:  A popular approach for data interpretation is the determination of the binding affinity by isotherms of weight-average sedimentation coefficients  sw.
Revised:  A popular approach for data interpretation is the determination of the binding affinity by isotherms of weight-average sedimentation coefficients , sw.
Edit intent: fluency
Original:  We show that this does not always hold true for systems that exhibit significant signal changes with complex formation -- properties that may be readily encountered in practice, e.g., from a change in fluorescence quantum yield.
Revised:  We show that this does not always hold true for systems that exhibit significant signal changes with complex formation - properties that may be readily encountered in practice, e.g., from a change in fluorescence quantum yield.
Edit intent: fluency
Original: A large number of Twitter users are bots .
Revised: It is known that many Twitter users are bots .
Edit intent: clarity