wanyu/IteraTeR_v2 huggingface dataset:
Original: In this paper, we study the effect of a full-duplex cooperative relay in a multiuser network.
Revised: The effect of full-duplex cooperative relay in a multiuser network.
Edit intent: clarity
Original:  The cooperative relay stores a source packet that it receives successfully in its queue when the transmission to the destination node has failed.
Revised:  The cooperative relay stores a source packet that it receives successfully in its queue when the transmission to the destination has failed.
Edit intent: clarity
Original:  We obtain analytical expressions for key performance metrics for the relay, such as arrival and service rates, stability conditions, and average queue length, as functions of the transmission probabilities, the self interference coefficient, and the links' outage probabilities.
Revised:  We obtain analytical expressions for key performance metrics at the relay, such as arrival and service rates, stability conditions, and average queue length, as functions of the transmission probabilities, the self interference coefficient, and the links' outage probabilities.
Edit intent: fluency
Original:  Furthermore, we study the impact of the relay node and the self interference coefficient on the per-user and aggregate throughput, and the average delay per packet  .
Revised:  Furthermore, we study the impact of the relay node and the self-interference coefficient on the per-user and aggregate throughput, and the average delay per packet .
Edit intent: fluency
Original:  Possible mechanisms enhancing mobility are proposed , and tested.
Revised:  Possible mechanisms enhancing mobility are proposed and tested.
Edit intent: fluency
Original:  Our main results quantify the growth of the slope for infinite activity exponential L\'evy models.
Revised:  Our main results quantify the growth of the slope for infinite activity exponential Levy models.
Edit intent: fluency
Original:  Our main results quantify the growth of the slope for infinite activity exponential Levy models .
Revised:  Our main results quantify the behavior of the slope for infinite activity exponential Levy models .
Edit intent: clarity
Original:  As auxiliary results, we obtain the limiting values of short maturity  digital call options, using Mellin transform asymptotics.
Revised:  As auxiliary results, we obtain asymptotic expansions of short maturity digital call options, using Mellin transform asymptotics.
Edit intent: clarity
Original: Urinary bladder carcinoma also known as%DIFDELCMD < {\it %%% Bladder Cancer (BC) is the seventh most common cancer worldwide.
Revised: %DIFDELCMD < {\it %%% Bladder Cancer (BC) is the seventh most common cancer worldwide.
Edit intent: coherence
Original: Urinary bladder carcinoma also known as%DIFDELCMD < {\it %%% Bladder Cancer (BC) is the seventh most common cancer worldwide.
Revised: Urinary bladder carcinoma also known as%DIFDELCMD < {\it %%% (BC) is the seventh most common cancer worldwide.
Edit intent: coherence
Original:  We simulate oxygen diffusion, carcinogen penetration and angiogenesis within the framework of the urothelial cell dynamics.
Revised:  We simulate oxygen diffusion, carcinogen penetration , and angiogenesis, within the framework of the urothelial cell dynamics.
Edit intent: fluency
Original:  The cell living cycle is modeled using discrete technique of Cellular Automata, while the continuous processes of carcinogen penetration and oxygen diffusion are described by the nonlinear diffusion-absorption equations.
Revised:  The cell dynamics are modeled using the discrete technique of Cellular Automata, while the continuous processes of carcinogen penetration and oxygen diffusion are described by the nonlinear diffusion-absorption equations.
Edit intent: clarity
Original:  The cell living cycle is modeled using discrete technique of Cellular Automata, while the continuous processes of carcinogen penetration and oxygen diffusion are described by the nonlinear diffusion-absorption equations.
Revised:  The cell living cycle is modeled using discrete technique of Cellular Automata, while the continuous processes of carcinogen penetration and oxygen diffusion are described by nonlinear diffusion-absorption equations.
Edit intent: fluency
Original:   Our model yields a theoretical insight into all stages of BC development and growth with especial accent on two most common types of urinary bladder carcinoma : bladder polyps and carcinoma {\it in situ}.
Revised:  Our model yields a theoretical insight into the main stages of development and growth with especial accent on two most common types of urinary bladder carcinoma : bladder polyps and carcinoma {\it in situ}.
Edit intent: clarity
Original:   Our model yields a theoretical insight into all stages of BC development and growth with especial accent on two most common types of urinary bladder carcinoma : bladder polyps and carcinoma {\it in situ}.
Revised:  Our model yields a theoretical insight into all stages of BC development and growth of urinary bladder carcinoma with emphasis on two most common types of urinary bladder carcinoma : bladder polyps and carcinoma {\it in situ}.
Edit intent: fluency
Original:   Our model yields a theoretical insight into all stages of BC development and growth with especial accent on two most common types of urinary bladder carcinoma : bladder polyps and carcinoma {\it in situ}.
Revised:  Our model yields a theoretical insight into all stages of BC development and growth with especial accent on two most common types : bladder polyps and carcinoma {\it in situ}.
Edit intent: clarity
Original:   Our numerical simulations are in a good qualitative agreement with {\it in vivo} results reported in the corresponding medical literature.
Revised:  Our numerical simulations have good qualitative agreement with {\it in vivo} results reported in the corresponding medical literature.
Edit intent: clarity
Original:  We first propose a new type of annotations to identify blocking functions , and we introduce CoroCheck, a tool for the static analysis and inference of cooperation and blocking annotations.
Revised:  We first propose a new type of annotations to identify blocking functions , and we introduce CoroCheck, a tool for the static analysis and inference of cooperation annotations.
Edit intent: coherence
Original:  Since researchers and practitioners realized the potential of using GPU for general purpose, their application has been extended to other fields  out of computer graphics scope.
Revised:  Since researchers and practitioners realized the potential of using GPU for general purposes, their applications have been extended to other fields out of computer graphics scope.
Edit intent: fluency
Original:  Since researchers and practitioners realized the potential of using GPU for general purpose, their application has been extended to other fields  out of computer graphics scope.
Revised:  Since researchers and practitioners realized the potential of using GPU for general purpose, their application has been extended to other fields , out of computer graphics scope.
Edit intent: fluency
Original:  Also, the interrelation of GPU parallel programming and initializing the algorithm variables was discussed, using numerical experiences.
Revised:  Also, the interrelation of GPU parallel programming and initialization of the algorithm variables was discussed, using numerical experiences.
Edit intent: fluency
Original:  Also, the interrelation of GPU parallel programming and initializing the algorithm variables was discussed, using numerical experiences.
Revised:  Also, the interrelation of GPU parallel programming and initializing the algorithm variables were discussed, using numerical experiences.
Edit intent: fluency
Original:  so , the results are expected to encourage whole of the researcher society to use GPUs and improve their research efficiency.
Revised:  therefor , the results are expected to encourage whole of the researcher society to use GPUs and improve their research efficiency.
Edit intent: fluency
Original:  so , the results are expected to encourage whole of the researcher society to use GPUs and improve their research efficiency.
Revised:  so , the results are expected to encourage all research society to use GPUs and improve their research efficiency.
Edit intent: clarity
Original:  Since researchers and practitioners realized the potential of using GPU for general purposes, their applications have been extended  to other fields , out of computer graphics scope .
Revised:  Once, researchers and practitioners realized the potential of using GPU for general purposes, their applications have been extended to other fields , out of computer graphics scope .
Edit intent: fluency
Original:  Since researchers and practitioners realized the potential of using GPU for general purposes, their applications have been extended  to other fields , out of computer graphics scope .
Revised:  Since researchers and practitioners noticed the potential of using GPU for general purposes, their applications have been extended to other fields , out of computer graphics scope .
Edit intent: clarity
Original:  Since researchers and practitioners realized the potential of using GPU for general purposes, their applications have been extended  to other fields , out of computer graphics scope .
Revised:  Since researchers and practitioners realized the potential of using GPU for general purposes, GPUs applications have been extended to other fields , out of computer graphics scope .
Edit intent: clarity
Original:  Since researchers and practitioners realized the potential of using GPU for general purposes, their applications have been extended  to other fields , out of computer graphics scope .
Revised:  Since researchers and practitioners realized the potential of using GPU for general purposes, their applications have been extended to other fields .
Edit intent: clarity
Original:  To accomplish that, GPU and CPU-based (multi-core) approaches were developed .
Revised:  To accomplish that, GPU and CPU-based (multi-core) programming context .
Edit intent: clarity
Original:  Moreover, we proposed an optimal synchronization arrangement for its implementation pseudo-code.
Revised:  Moreover, we proposed an optimal synchronization arrangement for the implementation pseudo-code.
Edit intent: fluency
Original:  Also, the interrelation of GPU parallel programming and initialization of the algorithm variables were discussed, using numerical experiences.
Revised:  Also, the interrelation of GPU parallel programming and initializing the algorithm variables were discussed, using numerical experiences.
Edit intent: fluency
Original:  Also, the interrelation of GPU parallel programming and initialization of the algorithm variables were discussed, using numerical experiences.
Revised:  Also, the interrelation of GPU parallel programming and initialization of the algorithm variables were discussed, taking advantage of numerical experiences.
Edit intent: clarity
Original:  The GPU-approach results are faster than  a much expensive parallel 8-thread CPU-based approach results .
Revised:  The GPU-approach results are faster than those obtained from a much expensive parallel 8-thread CPU-based approach results .
Edit intent: clarity
Original:  The GPU-approach results are faster than  a much expensive parallel 8-thread CPU-based approach results .
Revised:  The GPU-approach results are faster than a much expensive parallel 8-thread CPU-based programming .
Edit intent: clarity
Original:  The GPU , used in this paper, is an ordinary  laptop GPU (GT 335M  ) and is accessible for everyone ;
Revised:  The GPU used in this paper, is an ordinary laptop GPU (GT 335M ) and is accessible for everyone ;
Edit intent: fluency
Original:  therefor , the results are expected to encourage all research society to use GPUs and improve their research efficiency .
Revised:  therefor , the results are expected to encourage the entire research society to use GPUs and improve their research efficiency .
Edit intent: clarity
Original:  therefor , the results are expected to encourage all research society to use GPUs and improve their research efficiency .
Revised:  therefor , the results are expected to encourage all research society to take advantage of GPUs and improve their research efficiency .
Edit intent: clarity
Original:  therefor , the results are expected to encourage all research society to use GPUs and improve their research efficiency .
Revised:  therefor , the results are expected to encourage all research society to use GPUs and improve the time efficiency of their studies .
Edit intent: clarity
Original: In this paper, we focus on the one-dimensional Keller-Segel chemotaxis system in a random heterogeneous domain.
Revised: In this paper, we focus on the Keller-Segel chemotaxis system in a random heterogeneous domain.
Edit intent: clarity
Original:  We assume that the corresponding diffusion and chemotaxis coefficients are given by stationary ergodic processes, and apply methods pertaining to stochastic two-scale convergence  to derive the homogenized macroscopic equations.
Revised:  We assume that the corresponding diffusion and chemotaxis coefficients are given by stationary ergodic random fields and apply stochastic two-scale convergence to derive the homogenized macroscopic equations.
Edit intent: clarity
Original:  We assume that the corresponding diffusion and chemotaxis coefficients are given by stationary ergodic processes, and apply methods pertaining to stochastic two-scale convergence  to derive the homogenized macroscopic equations.
Revised:  We assume that the corresponding diffusion and chemotaxis coefficients are given by stationary ergodic processes, and apply methods pertaining to stochastic two-scale convergence methods to derive the homogenized macroscopic equations.
Edit intent: clarity
Original:  With this structural result at hand, we investigate fundamental solution concepts of the considered cooperative game, namely the Nash Bargaining Scheme, the (Inner) Core and the min-max fair Nucleolus.
Revised:  With this structural result at hand, we investigate fundamental solution concepts of the considered cooperative game, namely the (Inner) Core and the min-max fair Nucleolus.
Edit intent: clarity
Original:  Most notably , we show that they all bring about the system optimum.
Revised:  Most notably we prove that under certain conditions they contain the system optimum.
Edit intent: clarity
Original:  Specifically, we investigate fundamental solution concepts of the considered cooperative game, namely the (Inner) Core and the min-max fair Nucleolus.
Revised:  Specifically, we investigate fundamental solution concepts of the considered cooperative game, namely the core and a variant of the min-max fair Nucleolus.
Edit intent: clarity
Original:  The main limitation of the previous approach was that a partially acausual randomly sampled training dataset was used for proof of concept offline predictions.
Revised:  The main limitation of the previous approach was that a partially acausual randomly sampled training dataset was used to train proof of concept offline predictions.
Edit intent: fluency
Original:  The objective of this paper is therefore to address this limitation by proposing a novel online adaptive Extreme Learning Machine (ELM) extension named Weighted Ring-ELM.
Revised:  The objective of this paper is to address this limitation by proposing a novel online adaptive Extreme Learning Machine (ELM) extension named Weighted Ring-ELM.
Edit intent: coherence
Original:  The objective of this paper is therefore to address this limitation by proposing a novel online adaptive Extreme Learning Machine (ELM) extension named Weighted Ring-ELM.
Revised:  The objective of this paper is therefore to address this limitation by proposing a new online adaptive Extreme Learning Machine (ELM) extension named Weighted Ring-ELM.
Edit intent: clarity
Original:  The hope is that this new method will enable a new class of real-time model predictive control strategies for the high variability regions of HCCI , andpotentially make HCCI  's low engine-out NOx and high fuel efficiency more feasible for production engines.
Revised:  The broader objective of this approach is to enable a new class of real-time model predictive control strategies for the high variability regions of HCCI , andpotentially make HCCI 's low engine-out NOx and high fuel efficiency more feasible for production engines.
Edit intent: clarity
Original:  The hope is that this new method will enable a new class of real-time model predictive control strategies for the high variability regions of HCCI , andpotentially make HCCI  's low engine-out NOx and high fuel efficiency more feasible for production engines.
Revised:  The hope is that this new method will enable a new class of real-time model predictive control strategies for high variability HCCI 's low engine-out NOx and high fuel efficiency more feasible for production engines.
Edit intent: clarity
Original:  The hope is that this new method will enable a new class of real-time model predictive control strategies for the high variability regions of HCCI , andpotentially make HCCI  's low engine-out NOx and high fuel efficiency more feasible for production engines.
Revised:  The hope is that this new method will enable a new class of real-time model predictive control strategies for the high variability regions of HCCI , andpotentially make HCCI 's low engine-out NOx and high fuel efficiency to production engines.
Edit intent: clarity
Original: Fuel efficient Homogeneous Charge Compression Ignition (HCCI) engine combustion phasing predictions must contend with non-linear chemistry, non-linear physics, period doubling bifurcation(s), turbulent mixing, combustion deposits, model parameters that can drift day-to-day, and air-fuel mixture state information that cannot typically be resolved on a cycle-to-cycle basis, especially during transients.
Revised: Fuel efficient Homogeneous Charge Compression Ignition (HCCI) engine combustion timing predictions must contend with non-linear chemistry, non-linear physics, period doubling bifurcation(s), turbulent mixing, combustion deposits, model parameters that can drift day-to-day, and air-fuel mixture state information that cannot typically be resolved on a cycle-to-cycle basis, especially during transients.
Edit intent: clarity
Original: Fuel efficient Homogeneous Charge Compression Ignition (HCCI) engine combustion phasing predictions must contend with non-linear chemistry, non-linear physics, period doubling bifurcation(s), turbulent mixing, combustion deposits, model parameters that can drift day-to-day, and air-fuel mixture state information that cannot typically be resolved on a cycle-to-cycle basis, especially during transients.
Revised: Fuel efficient Homogeneous Charge Compression Ignition (HCCI) engine combustion phasing predictions must contend with non-linear chemistry, non-linear physics, period doubling bifurcation(s), turbulent mixing, model parameters that can drift day-to-day, and air-fuel mixture state information that cannot typically be resolved on a cycle-to-cycle basis, especially during transients.
Edit intent: clarity
Original:  In previous work, a generalized cycle-to-cycle mapping function coupled with epsilon-Support Vector Regression was shown to predict experimentally observed cycle-to-cycle phasing over a wide range of engine conditions, despite some of the aforementioned difficulties.
Revised:  In previous work, an abstract cycle-to-cycle mapping function coupled with epsilon-Support Vector Regression was shown to predict experimentally observed cycle-to-cycle phasing over a wide range of engine conditions, despite some of the aforementioned difficulties.
Edit intent: clarity
Original:  In previous work, a generalized cycle-to-cycle mapping function coupled with epsilon-Support Vector Regression was shown to predict experimentally observed cycle-to-cycle phasing over a wide range of engine conditions, despite some of the aforementioned difficulties.
Revised:  In previous work, a generalized cycle-to-cycle mapping function coupled with \epsilon-Support Vector Regression was shown to predict experimentally observed cycle-to-cycle phasing over a wide range of engine conditions, despite some of the aforementioned difficulties.
Edit intent: fluency
Original:  In previous work, a generalized cycle-to-cycle mapping function coupled with epsilon-Support Vector Regression was shown to predict experimentally observed cycle-to-cycle phasing over a wide range of engine conditions, despite some of the aforementioned difficulties.
Revised:  In previous work, a generalized cycle-to-cycle mapping function coupled with epsilon-Support Vector Regression was shown to predict experimentally observed cycle-to-cycle combustion timing over a wide range of engine conditions, despite some of the aforementioned difficulties.
Edit intent: clarity
Original:  The broader objective of this approach is to enable a new class of real-time model predictive control strategies for high variability HCCI and, ultimately, to bring HCCI's low engine-out NOx and high fuel efficiency to production engines.
Revised:  The broader objective of this approach is to enable a new class of real-time model predictive control strategies for high variability HCCI and, ultimately, to bring HCCI's low engine-out NOx and reduced CO2 emissions to production engines.
Edit intent: clarity
Original: The urinary system evolved to eject fluids from the body body quickly and efficiently.
Revised: The urinary system evolved to eject fluids from the body quickly and efficiently.
Edit intent: fluency
Original:  In this combined experimental and theoretical investigation, we elucidate the hydrodynamics of urination across five orders of magnitude in animal mass , from mice to elephants . Using high-speed fluid dynamics videos and flow-rate measurement at Zoo Atlanta, we discover the "Law of Urination ", which states animals empty their bladders over nearly constant duration of average 21 seconds (standard deviation 13 seconds)
Revised:  In this combined experimental and theoretical investigation, we elucidate the hydrodynamics of urination across five orders of magnitude in animal mass . Using high-speed fluid dynamics videos and flow-rate measurement at Zoo Atlanta, we discover the "Law of Urination ", which states animals empty their bladders over nearly constant duration of average 21 seconds (standard deviation 13 seconds)
Edit intent: coherence
Original:  In this combined experimental and theoretical investigation, we elucidate the hydrodynamics of urination across five orders of magnitude in animal mass , from mice to elephants . Using high-speed fluid dynamics videos and flow-rate measurement at Zoo Atlanta, we discover the "Law of Urination ", which states animals empty their bladders over nearly constant duration of average 21 seconds (standard deviation 13 seconds)
Revised:  In this combined experimental and theoretical investigation, we elucidate the hydrodynamics of urination across five orders of magnitude in animal mass , from mice to elephants . Using high-speed videography and flow rate measurement at Zoo Atlanta, we discover the "Law of Urination ", which states animals empty their bladders over nearly constant duration of average 21 seconds (standard deviation 13 seconds)
Edit intent: clarity
Original:  In this combined experimental and theoretical investigation, we elucidate the hydrodynamics of urination across five orders of magnitude in animal mass , from mice to elephants . Using high-speed fluid dynamics videos and flow-rate measurement at Zoo Atlanta, we discover the "Law of Urination ", which states animals empty their bladders over nearly constant duration of average 21 seconds (standard deviation 13 seconds)
Revised:  In this combined experimental and theoretical investigation, we elucidate the hydrodynamics of urination across five orders of magnitude in animal mass , from mice to elephants . Using high-speed fluid dynamics videos and flow-rate measurement at Zoo Atlanta, we discover the "Law of Urination ," which states animals empty their bladders over nearly constant duration of average 21 seconds (standard deviation 13 seconds)
Edit intent: fluency