wanyu/IteraTeR_v2 huggingface dataset:
Original:  To characterize the efficiency of the proposed framework, a pair of practical case studies are provided : 1) To predict the positioning of drone-mounted areal base stations (BSs) deployments according to specific tele-traffic requirements  . 2) To predict the content caching requirements of BSs according to the users' preferences  .
Revised:  To characterize the efficiency of the proposed framework, a pair of intelligent practical applications are provided as case studies : 1) To predict the positioning of drone-mounted areal base stations (BSs) deployments according to specific tele-traffic requirements . 2) To predict the content caching requirements of BSs according to the users' preferences .
Edit intent: clarity
Original:  To characterize the efficiency of the proposed framework, a pair of practical case studies are provided : 1) To predict the positioning of drone-mounted areal base stations (BSs) deployments according to specific tele-traffic requirements  . 2) To predict the content caching requirements of BSs according to the users' preferences  .
Revised:  To characterize the efficiency of the proposed framework, a pair of practical case studies are provided : 1) To predict the positioning of drone-mounted areal base stations (BSs) according to the specific tele-traffic requirements . 2) To predict the content caching requirements of BSs according to the users' preferences .
Edit intent: clarity
Original:  Recently some two-stage fast algorithms have been proposed for computing the Hessenberg reduction of a  matrix A= D + UV ^H, where D is a unitary n \times n diagonal matrix and U, V \in\mathbb{C^{n \times k}, which carry out an intermediate transformation into a perturbed block CMV form.
Revised:  Recently some two-stage fast algorithms have been proposed for computing the Hessenberg reduction of a matrix A= D + UV ^H, where D is a unitary ^{n \times k}, which carry out an intermediate transformation into a perturbed block CMV form.
Edit intent: clarity
Original:  A natural extension then is to incorporate the fairness constraint into the clustering objective . Existing algorithms for doing so run in time super-quadratic in the size of the data set .
Revised:  A natural extension then is to incorporate the fairness constraint into the clustering problem . Existing algorithms for doing so run in time super-quadratic in the size of the data set .
Edit intent: clarity
Original:  This is in contrast to the standard k-center objective that can be approximately optimized in linear time.
Revised:  This is in contrast to the standard k-center problem being approximable in linear time.
Edit intent: clarity
Original:  We overcome this by proposing a natural variant of the stochastic block model  where h groups have strong inter-group connectivity, but also exhibit a "natural" clustering structure which is fair.
Revised:  We overcome this by proposing a natural variant of the stochastic block model , where h groups have strong inter-group connectivity, but also exhibit a "natural" clustering structure which is fair.
Edit intent: fluency
Original: This note presents an algebraic theory of instruction sequences with instructions for Turing tapes as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction between such behaviours and the Turing tapes provided by an execution environment.
Revised: This paper presents an algebraic theory of instruction sequences with instructions for Turing tapes as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction between such behaviours and the Turing tapes provided by an execution environment.
Edit intent: clarity
Original: This note presents an algebraic theory of instruction sequences with instructions for Turing tapes as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction between such behaviours and the Turing tapes provided by an execution environment.
Revised: This note presents an algebraic theory of instruction sequences with instructions for Turing tapes as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction between such behaviours and Turing tapes provided by an execution environment.
Edit intent: fluency
Original:  This theory provides a setting for investigating issues relating to computability and computational complexity that is more general than the closely related Turing-machine models of computation.
Revised:  This theory provides a setting for the development of theory in areas such as computability and computational complexity that is more general than the closely related Turing-machine models of computation.
Edit intent: clarity
Original:  This theory provides a setting for investigating issues relating to computability and computational complexity that is more general than the closely related Turing-machine models of computation.
Revised:  This theory provides a setting for investigating issues relating to computability and computational complexity that is more general than the setting provided by a known version of the Turing-machine models of computation.
Edit intent: clarity
Original:  This theory provides a setting for investigating issues relating to computability and computational complexity that is more general than the closely related Turing-machine models of computation.
Revised:  This theory provides a setting for investigating issues relating to computability and computational complexity that is more general than the closely related Turing-machine model of computation.
Edit intent: fluency
Original:   We propose an acknowledgement-free broadcast strategy using 1-bit labelling and broadcast with acknowledgement using a 2-bit labelling .
Revised:  We propose an acknowledgement-free broadcast strategy using 1-bit labels and broadcast with acknowledgement using a 2-bit labelling .
Edit intent: fluency
Original:   We propose an acknowledgement-free broadcast strategy using 1-bit labelling and broadcast with acknowledgement using a 2-bit labelling .
Revised:  We propose an acknowledgement-free broadcast strategy using 1-bit labelling and broadcast with acknowledgement using 2-bits labels .
Edit intent: fluency
Original:  In the class of level-separable networks our algorithms are memory optimal and finish within 2D rounds for both broadcast with and without acknowledgement, where D is the eccentricity of the broadcast initiator.
Revised:  In the class of level-separable networks our algorithms finish within 2D rounds for both broadcast with and without acknowledgement, where D is the eccentricity of the broadcast initiator.
Edit intent: clarity
Original:  In the broadcast with acknowledgement, we trigger the acknowledgement message during the broadcast propagation such that no extra rounds are needed for sending the acknowledgement back to the source once the broadcast is finished.
Edit intent: coherence
Original:  Second, we improve a recent  labelling-based broadcast scheme with acknowledgement designed for arbitrary networks in terms of memory and time complexity.
Revised:  Second, we improve a recent 11 labelling-based broadcast scheme with acknowledgement designed for arbitrary networks in terms of memory and time complexity.
Edit intent: fluency
Original: In this paper  we study the broadcast problem in wireless networks when the broadcast is helped by a labelling scheme.
Revised: In this paper , we study the broadcast problem in wireless networks when the broadcast is helped by a labelling scheme.
Edit intent: fluency
Original:  We focus on two variants of broadcast: broadcast without acknowledgement (i.e. the initiator of the broadcast is not notified at the end of broadcast) and broadcast with acknowledgement .
Revised:  We focus on two variants of broadcast: broadcast without acknowledgment (i.e. the initiator of the broadcast is not notified at the end of broadcast) and broadcast with acknowledgement .
Edit intent: fluency
Original:  We focus on two variants of broadcast: broadcast without acknowledgement (i.e. the initiator of the broadcast is not notified at the end of broadcast) and broadcast with acknowledgement .
Revised:  We focus on two variants of broadcast: broadcast without acknowledgement (i.e. the initiator of the broadcast is not notified at the end of broadcast) and broadcast with acknowledgment .
Edit intent: fluency
Original:  We propose an acknowledgement-free broadcast strategy using 1-bit labels and broadcast with acknowledgement using 2-bits labels.
Revised:  We propose an acknowledgement-free broadcast strategy using 1-bit labels and broadcast with acknowledgment using 2-bits labels.
Edit intent: fluency
Original:  In the class of level-separable networks  our algorithms finish within 2D rounds for both broadcast with and without acknowledgement , where D is the eccentricity of the broadcast initiator.
Revised:  In the class of level-separable networks , our algorithms finish within 2D rounds for both broadcast with and without acknowledgement , where D is the eccentricity of the broadcast initiator.
Edit intent: fluency
Original:  In the class of level-separable networks  our algorithms finish within 2D rounds for both broadcast with and without acknowledgement , where D is the eccentricity of the broadcast initiator.
Revised:  In the class of level-separable networks our algorithms finish within 2D rounds , where D is the eccentricity of the broadcast initiator.
Edit intent: clarity
Original:  Second, we improve a recent 11%DIFDELCMD < ] %%% labelling-based broadcast scheme with acknowledgement designed for arbitrary networks in terms of memory complexity .
Revised:  11%DIFDELCMD < ] %%% labelling-based broadcast scheme with acknowledgement designed for arbitrary networks in terms of memory complexity .
Edit intent: coherence
Original:  We first propose a volume-adjustable backhaul-constrained water-filling method (VABWF)  to derive the optimal power allocation for wireless transmission .
Revised:  We first propose a volume-adjustable backhaul-constrained water-filling method (VABWF) is proposed to derive the optimal power allocation for wireless transmission .
Edit intent: coherence
Original:  To explore the potential of throughput in cache-enabled FiWi access networks , we derive a tractable expression of the ergodic capacity (EC) of wireless links and provide a theoretical upper bound of the throughput by utilizing the analytical properties of EC.
Revised:  To explore the potential of throughput in cache-enabled FiWi access networks , we derive a upper bound of the throughput by utilizing the analytical properties of EC.
Edit intent: clarity
Original:  Numerical and simulation results validate our theoretical analysis and demonstrate the effectiveness of our proposed optimization method .
Revised:  The numerical and simulation results validate our theoretical analysis and demonstrate the effectiveness of our proposed optimization method .
Edit intent: fluency
Original:  To alleviate the backhual pressure, in this paper, caching capability is enabled at the edge of FiWi networks, i.e.,  ONU-APs . As caching has a significant impact on resource allocation, we reconsider performance optimization and analysis in cache-enabled FiWi networks.
Revised:  To alleviate the backhaul pressure, in this paper, caching capability is enabled at the edge of FiWi networks, i.e., ONU-APs . As caching has a significant impact on resource allocation, we reconsider performance optimization and analysis in cache-enabled FiWi networks.
Edit intent: fluency
Original:  Secondly, to investigate the theoretical capacity of the cache-enabled FiWi network with mmWave, we derive a upper bound of the downlink throughput by analyzing properties of the average rate of wireless links.
Revised:  Secondly, to investigate the theoretical capacity of the cache-enabled FiWi network with mmWave, we derive an upper bound of the downlink throughput by analyzing properties of the average rate of wireless links.
Edit intent: fluency
Original:  Paticularly , we show that appropriate power allocation for wireless transmission and caching at ONU-APs is essential to achieve higher throughput.
Revised:  Particularly , we show that appropriate power allocation for wireless transmission and caching at ONU-APs is essential to achieve higher throughput.
Edit intent: coherence
Original:  In addition, for a fixed iteration, we show that the norm of the error vector and the norm of the residual converge exponentially fast in probability, converge in mean , converge almost surely and, after centering and rescaling, converge in distribution .
Revised:  In addition, for a fixed iteration, we show that the norm of the error vector and the norm of the residual converge exponentially fast in probability, converge in mean and converge almost surely and, after centering and rescaling, converge in distribution .
Edit intent: coherence
Original:  In addition, for a fixed iteration, we show that the norm of the error vector and the norm of the residual converge exponentially fast in probability, converge in mean , converge almost surely and, after centering and rescaling, converge in distribution .
Revised:  In addition, for a fixed iteration, we show that the norm of the error vector and the norm of the residual converge exponentially fast in probability, converge in mean , converge almost surely .
Edit intent: coherence
Original:  In addition, for a fixed iteration  , we show that the norm of the error vector and the norm of the residual converge exponentially fast in probability, converge in mean and converge almost surely.
Revised:  In addition, for a fixed iteration count , we show that the norm of the error vector and the norm of the residual converge exponentially fast in probability, converge in mean and converge almost surely.
Edit intent: clarity
Original:  Following Frances Yao (1974), an element (player) is said to be (i,j)-mediocre if it is neither among the top i nor among the bottom j elements of S.  More than 40 years ago, Yao suggested a stunningly simple algorithm for finding an (i,j)-mediocre element: Pick i+j+1 elements arbitrarily and select the (i+1)-th largest among them.
Revised:  Following Frances Yao (1974), an element (player) is said to be (i,j)-mediocre if it is neither among the top i nor among the bottom j elements of S. More than 40 years ago, Yao suggested a very simple and elegant algorithm for finding an (i,j)-mediocre element: Pick i+j+1 elements arbitrarily and select the (i+1)-th largest among them.
Edit intent: clarity
Original:  No one seems to have found such an algorithm ever since.
Revised:  No one seems to have found a better algorithm ever since.
Edit intent: clarity
Original:  In summary, we answer Yao's question as follows: (i)  "Presently not" for deterministic algorithms and (ii)  "Definitely not" for randomized algorithms.
Revised:  In summary, we answer Yao's question as follows: (i) ~ "Presently not" for deterministic algorithms and (ii) "Definitely not" for randomized algorithms.
Edit intent: fluency
Original:  In summary, we answer Yao's question as follows: (i)  "Presently not" for deterministic algorithms and (ii)  "Definitely not" for randomized algorithms.
Revised:  In summary, we answer Yao's question as follows: (i) "Presently not" for deterministic algorithms and (ii) ~ "Definitely not" for randomized algorithms.
Edit intent: fluency
Original:  We formulate the optimal k-coverage charging problem of finding a feasible path for a mobile charger to charge a set of sensor nodes within their estimated charging time windows under the constraint of maintaining the k-coverage ability of the network system, with an objective of minimizing the energy consumption on traveling per tour.
Revised:  We formulate the optimal k-coverage charging problem of finding a feasible path for a mobile charger to charge a set of sensor nodes within their estimated charging deadlines under the constraint of maintaining the k-coverage ability of the network system, with an objective of minimizing the energy consumption on traveling per tour.
Edit intent: clarity
Original: We propose domain decomposition preconditioners for the solution of the integral equation formulation of forward and inverse acoustic scattering problems with points scatterers.
Revised: We propose domain decomposition preconditioners for the solution of an integral equation formulation of forward and inverse acoustic scattering problems with points scatterers.
Edit intent: fluency
Original: We propose domain decomposition preconditioners for the solution of the integral equation formulation of forward and inverse acoustic scattering problems with points scatterers.
Revised: We propose domain decomposition preconditioners for the solution of the integral equation formulation of forward and inverse acoustic scattering problems with point scatterers.
Edit intent: fluency
Original:  In the forward scattering case, first, we extend to integral equations the domain decomposition based preconditioning techniques presented for partial differential equations in {\em "A restricted additive Schwarz preconditioner for general sparse linear systems", SIAM Journal on Scientific Computing, 21 (1999), pp. 792--797} . Next, we propose a new preconditioner that is a low-rank correction of the domain decomposition based preconditioner.
Revised:  For the forward scattering case, first, we extend to integral equations the domain decomposition based preconditioning techniques presented for partial differential equations in {\em "A restricted additive Schwarz preconditioner for general sparse linear systems", SIAM Journal on Scientific Computing, 21 (1999), pp. 792--797} . Next, we propose a new preconditioner that is a low-rank correction of the domain decomposition based preconditioner.
Edit intent: fluency
Original:  In the forward scattering case, first, we extend to integral equations the domain decomposition based preconditioning techniques presented for partial differential equations in {\em "A restricted additive Schwarz preconditioner for general sparse linear systems", SIAM Journal on Scientific Computing, 21 (1999), pp. 792--797} . Next, we propose a new preconditioner that is a low-rank correction of the domain decomposition based preconditioner.
Revised:  In the forward scattering problem, we extend the domain decomposition based preconditioning techniques presented for partial differential equations in {\em "A restricted additive Schwarz preconditioner for general sparse linear systems", SIAM Journal on Scientific Computing, 21 (1999), pp. 792--797} . Next, we propose a new preconditioner that is a low-rank correction of the domain decomposition based preconditioner.
Edit intent: clarity
Original:  In the forward scattering case, first, we extend to integral equations the domain decomposition based preconditioning techniques presented for partial differential equations in {\em "A restricted additive Schwarz preconditioner for general sparse linear systems", SIAM Journal on Scientific Computing, 21 (1999), pp. 792--797} . Next, we propose a new preconditioner that is a low-rank correction of the domain decomposition based preconditioner.
Revised:  In the forward scattering case, first, we extend to integral equations the domain decomposition based preconditioning techniques presented for partial differential equations in {\em "A restricted additive Schwarz preconditioner for general sparse linear systems", SIAM Journal on Scientific Computing, 21 (1999), pp. 792--797} , to integral equations. We combine this domain decomposition preconditioner with a low-rank correction of the domain decomposition based preconditioner.
Edit intent: coherence
Original:  In the inverse scattering case , we use the low-rank corrected preconditioner proposed for the forward problem as the building block for constructing a preconditioner for the Gauss-Newton Hessian.
Revised:  In the inverse scattering problem , we use the low-rank corrected preconditioner proposed for the forward problem as the building block for constructing a preconditioner for the Gauss-Newton Hessian.
Edit intent: clarity
Original:  In the inverse scattering case , we use the low-rank corrected preconditioner proposed for the forward problem as the building block for constructing a preconditioner for the Gauss-Newton Hessian.
Revised:  In the inverse scattering case , we use the forward problem preconditioner as a building block for constructing a preconditioner for the Gauss-Newton Hessian.
Edit intent: clarity
Original:  Our numerical results show that both preconditioning strategies work well.
Revised:  We present numerical results that demonstrate the performance of both preconditioning strategies work well.
Edit intent: clarity
Original:  Tested on four datasets, our novel results demonstrate that deep learning methods can be applied directly also to high dimensional non-grid like data, while learning from a small amount of labeled examples with imbalanced classes and achieving better accuracy than the traditional two phases approach . Moreover, we have been able to create sparse MLP models with over one million neurons and to train them on a typical laptop without GPU .
Revised:  Tested on four datasets, our novel results demonstrate that our method can be applied directly also to high dimensional non-grid like data, while learning from a small amount of labeled examples with imbalanced classes and achieving better accuracy than the traditional two phases approach . Moreover, we have been able to create sparse MLP models with over one million neurons and to train them on a typical laptop without GPU .
Edit intent: clarity
Original:  Tested on four datasets, our novel results demonstrate that deep learning methods can be applied directly also to high dimensional non-grid like data, while learning from a small amount of labeled examples with imbalanced classes and achieving better accuracy than the traditional two phases approach . Moreover, we have been able to create sparse MLP models with over one million neurons and to train them on a typical laptop without GPU .
Revised:  Tested on four datasets, our novel results demonstrate that deep learning methods can be applied directly to handle high dimensional data, while learning from a small amount of labeled examples with imbalanced classes and achieving better accuracy than the traditional two phases approach . Moreover, we have been able to create sparse MLP models with over one million neurons and to train them on a typical laptop without GPU .
Edit intent: clarity
Original:  Tested on four datasets, our novel results demonstrate that deep learning methods can be applied directly also to high dimensional non-grid like data, while learning from a small amount of labeled examples with imbalanced classes and achieving better accuracy than the traditional two phases approach . Moreover, we have been able to create sparse MLP models with over one million neurons and to train them on a typical laptop without GPU .
Revised:  Tested on four datasets, our novel results demonstrate that deep learning methods can be applied directly also to high dimensional non-grid like data, while achieving higher accuracy than the traditional two phases approach . Moreover, we have been able to create sparse MLP models with over one million neurons and to train them on a typical laptop without GPU .
Edit intent: clarity