wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper, we propose a novel scheme for L ocation-A wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Revised:  In this paper, we propose a novel scheme for L ocation-A wareC ross- ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Edit intent: fluency
Original:  In this paper, we propose a novel scheme for L ocation-A wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Revised:  In this paper, we propose a novel scheme for L ocation-A wareC ross-T C ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Edit intent: fluency
Original:  In this paper, we propose a novel scheme for L ocation-A wareC ross-T ierC ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Revised:  In this paper, we propose a novel scheme for L ocation-A wareC ross-T ier ooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks.
Edit intent: fluency
Original:  The main results are that: (i) \log\log n is a tight space lower bound for accepting general nonregular languages on weak realtime PDAs, (ii ) there exist unary nonregular languages accepted by realtime alternating CAs within weak \log n space, ( iii ) there exist nonregular languages accepted by two-way DPADs within strong \log\log n space, and, ( iv ) there exist unary nonregular languages accepted by two-way CAs with quantum and classical states within middle \log n space and bounded error.
Revised:  The main results are that: (i) \log\log n is a tight space lower bound for accepting general nonregular languages on weak realtime pushdown automata, (iii ) there exist unary nonregular languages accepted by realtime alternating CAs within weak \log n space, ( iii ) there exist nonregular languages accepted by two-way DPADs within strong \log\log n space, and, ( iv ) there exist unary nonregular languages accepted by two-way CAs with quantum and classical states within middle \log n space and bounded error.
Edit intent: clarity
Original:  The main results are that: (i) \log\log n is a tight space lower bound for accepting general nonregular languages on weak realtime PDAs, (ii ) there exist unary nonregular languages accepted by realtime alternating CAs within weak \log n space, ( iii ) there exist nonregular languages accepted by two-way DPADs within strong \log\log n space, and, ( iv ) there exist unary nonregular languages accepted by two-way CAs with quantum and classical states within middle \log n space and bounded error.
Revised:  The main results are that: (i) \log\log n is a tight space lower bound for accepting general nonregular languages on weak realtime PDAs, (ii ) there exist unary nonregular languages accepted by realtime alternating CAs within weak \log n space, ( iv ) there exist nonregular languages accepted by two-way DPADs within strong \log\log n space, and, ( iv ) there exist unary nonregular languages accepted by two-way CAs with quantum and classical states within middle \log n space and bounded error.
Edit intent: fluency
Original:  The main results are that: (i) \log\log n is a tight space lower bound for accepting general nonregular languages on weak realtime PDAs, (ii ) there exist unary nonregular languages accepted by realtime alternating CAs within weak \log n space, ( iii ) there exist nonregular languages accepted by two-way DPADs within strong \log\log n space, and, ( iv ) there exist unary nonregular languages accepted by two-way CAs with quantum and classical states within middle \log n space and bounded error.
Revised:  The main results are that: (i) \log\log n is a tight space lower bound for accepting general nonregular languages on weak realtime PDAs, (ii ) there exist unary nonregular languages accepted by realtime alternating CAs within weak \log n space, ( iii ) there exist nonregular languages accepted by two-way DPADs within strong \log\log n space, and, ( iv ) there exist unary nonregular languages accepted by two-way CAs with quantum and classical states with middle \log n space and bounded error.
Edit intent: fluency
Original: Hybrid evolution , horizontal gene transfer (HGT) and recombination are processes where evolutionary relationships may more accurately be described by a reticulated network than by a tree.
Revised: Hybrid evolution and horizontal gene transfer (HGT) and recombination are processes where evolutionary relationships may more accurately be described by a reticulated network than by a tree.
Edit intent: fluency
Original: Hybrid evolution , horizontal gene transfer (HGT) and recombination are processes where evolutionary relationships may more accurately be described by a reticulated network than by a tree.
Revised: Hybrid evolution , horizontal gene transfer (HGT) are processes where evolutionary relationships may more accurately be described by a reticulated network than by a tree.
Edit intent: clarity
Original:  In this note , we ask whether this average distance is able to distinguish reticulate evolution from pure tree-like evolution.
Revised:  In this article , we ask whether this average distance is able to distinguish reticulate evolution from pure tree-like evolution.
Edit intent: clarity
Original: In 1930s Paul Erd\H{o conjectured that for any positive integer C in any infinite \pm 1 sequence (x_n) there exists a subsequence x_d, x_{2d}, x_{3d},\dots, x_{kd}, for some positive integers k and d, such that \mid i=1^k x_{i\cdot d} \mid >C.
Revised: In 1930s Paul Erdos conjectured that for any positive integer C in any infinite \pm 1 sequence (x_n) there exists a subsequence x_d, x_{2d}, x_{3d},\dots, x_{kd}, for some positive integers k and d, such that \mid i=1^k x_{i\cdot d} \mid >C.
Edit intent: fluency
Original:  More recently, a fascinating phase transition phenomena was conjectured by Decelle et al. and proved by Massoulie and Mossel et al. concerning a weaker notion of reconstruction: recovering slightly more than 50\% of the vertices (i.e., beating a random guess) is possible  if and only if (a-b)^2 > 2(a+b), where a=pn and b= pn are constant.
Revised:  More recently, a fascinating phase transition phenomena was conjectured by Decelle et al. and proved by Massouli\'e and Mossel et al. concerning a weaker notion of reconstruction: recovering slightly more than 50\% of the vertices (i.e., beating a random guess) is possible if and only if (a-b)^2 > 2(a+b), where a=pn and b= pn are constant.
Edit intent: fluency
Original:  This paper investigates this question and shows that if  pn/\log(n)  = \alpha and qn/\log(n) =\beta are constant (and \alpha>\beta), exact recovery of the communities is impossible (maximum likelihood fails w.h.p. ) if -
Revised:  This paper answers this question and shows that if pn/\log(n) = \alpha and qn/\log(n) =\beta are constant (and \alpha>\beta), exact recovery of the communities is impossible (maximum likelihood fails w.h.p. ) if -
Edit intent: clarity
Original:  This paper investigates this question and shows that if  pn/\log(n)  = \alpha and qn/\log(n) =\beta are constant (and \alpha>\beta), exact recovery of the communities is impossible (maximum likelihood fails w.h.p. ) if -
Revised:  This paper investigates this question and shows that if pn/\log(n) = qn/\log(n) =\beta are constant (and \alpha>\beta), exact recovery of the communities is impossible (maximum likelihood fails w.h.p. ) if -
Edit intent: coherence
Original:  This paper investigates this question and shows that if  pn/\log(n)  = \alpha and qn/\log(n) =\beta are constant (and \alpha>\beta), exact recovery of the communities is impossible (maximum likelihood fails w.h.p. ) if -
Revised:  This paper investigates this question and shows that if pn/\log(n) = \alpha and qn/\log(n) are constant (and \alpha>\beta), exact recovery of the communities is impossible (maximum likelihood fails w.h.p. ) if -
Edit intent: fluency
Original:  \alpha \beta<1 (i.e., maximum likelihood fails) and possible if \alpha+\beta{2} - \sqrt{\alpha \beta}>1, where the latter condition is equivalent to } (\alpha - \beta)^2 < 4(\alpha + \beta) - 4 and is possible if (\alpha- \beta)^2 > 4(\alpha +\beta ) + \frac{4{3}(\alpha - \beta).
Revised:  \alpha \beta<1 (i.e., maximum likelihood fails) and possible if \alpha+\beta{2} - \sqrt{\alpha \beta}>1, where the latter condition is equivalent to } (\alpha - \beta)^2 > 4(\alpha + \beta) - 4 and is possible if (\alpha- \beta)^2 > 4(\alpha +\beta ) + \frac{4{3}(\alpha - \beta).
Edit intent: fluency
Original:  \alpha \beta<1 (i.e., maximum likelihood fails) and possible if \alpha+\beta{2} - \sqrt{\alpha \beta}>1, where the latter condition is equivalent to } (\alpha - \beta)^2 < 4(\alpha + \beta) - 4 and is possible if (\alpha- \beta)^2 > 4(\alpha +\beta ) + \frac{4{3}(\alpha - \beta).
Revised:  \alpha \beta<1 (i.e., maximum likelihood fails) and possible if \alpha+\beta{2} - \sqrt{\alpha \beta}>1, where the latter condition is equivalent to } (\alpha - \beta)^2 < 4(\alpha + \beta) - 4 and \alpha +\beta ) + \frac{4{3}(\alpha - \beta).
Edit intent: coherence
Original:  \alpha \beta<1 (i.e., maximum likelihood fails) and possible if \alpha+\beta{2} - \sqrt{\alpha \beta}>1, where the latter condition is equivalent to } (\alpha - \beta)^2 < 4(\alpha + \beta) - 4 and is possible if (\alpha- \beta)^2 > 4(\alpha +\beta ) + \frac{4{3}(\alpha - \beta).
Revised:  \alpha \beta<1 (i.e., maximum likelihood fails) and possible if \alpha+\beta{2} - \sqrt{\alpha \beta}>1, where the latter condition is equivalent to } (\alpha - \beta)^2 < 4(\alpha + \beta) - 4 and is possible if (\alpha- \beta)^2 > 4(\alpha +\beta {3}(\alpha - \beta).
Edit intent: coherence
Original:  In the past two decades, a large body of literature in statistics and computer science has focused on the exact recovery of the communities, providing lower-bounds on the order of |p-q| to ensure recovery.
Revised:  In the past two decades, a large body of literature in statistics and computer science has focused on providing lower-bounds on the order of |p-q| to ensure recovery.
Edit intent: clarity
Original:  In the past two decades, a large body of literature in statistics and computer science has focused on the exact recovery of the communities, providing lower-bounds on the order of |p-q| to ensure recovery.
Revised:  In the past two decades, a large body of literature in statistics and computer science has focused on the exact recovery of the communities, providing lower-bounds on the scaling of |p-q| to ensure recovery.
Edit intent: clarity
Original:  This paper answers this question and shows that if \alpha=pn/\log(n) and \beta=qn/\log(n) are constant ( and \alpha>\beta), recovering exactly the communities w.h.p. is impossible if \alpha+\beta{2} -
Revised:  This paper answers this question and shows that if \alpha=pn/\log(n) and \beta=qn/\log(n) are constant ( with \alpha>\beta), recovering exactly the communities w.h.p. is impossible if \alpha+\beta{2} -
Edit intent: coherence
Original:  \alpha \beta<1 (i.e., maximum likelihood fails) and possible if \alpha+\beta{2} - \alpha \beta> 1, where the latter condition is equivalent to (\alpha - \beta) ^2 > 4(\alpha + \beta)- 4 and \alpha+\beta > 2. In addition, an efficient algorithm based on semidefinite programming is proposed and shown to succeed in recovering the communities when (\alpha - \beta)^2 > 8(\alpha + \beta)+ \frac{8{3} (\alpha - \beta}  ).
Revised:  \alpha \beta<1 (i.e., maximum likelihood fails) and possible if \alpha+\beta{2} - \alpha \beta> 1, where the latter condition is equivalent to (\alpha - \beta) ^2 > 4(\alpha + \beta)- 4 and \alpha+\beta > 2. In addition, an efficient algorithm based on semidefinite programming is proposed and shown to succeed in recovering the communities {3} (\alpha - \beta} ).
Edit intent: coherence
Original:  This paperidentifies the sharp threshold for exact recovery .
Revised:  In this paper, we identify a sharp threshold phenomenon for exact recovery .
Edit intent: clarity
Original:  This sharpens the existing bounds and sets a new line of sight for efficient clustering algorithms.
Revised:  In particular, this improves the existing bounds and sets a new line of sight for efficient clustering algorithms.
Edit intent: clarity
Original:  This sharpens the existing bounds and sets a new line of sight for efficient clustering algorithms.
Revised:  This sharpens the existing bounds . This also sets a new line of sight for efficient clustering algorithms.
Edit intent: clarity
Original:  It is also shown how an efficient algorithm which succeeds all the way down to the threshold can be obtained from efficient algorithms for partial recovery combined with a local improvement procedure .
Revised:  An efficient algorithm which succeeds all the way down to the threshold can be obtained from efficient algorithms for partial recovery combined with a local improvement procedure .
Edit intent: coherence
Original:  It is also shown how an efficient algorithm which succeeds all the way down to the threshold can be obtained from efficient algorithms for partial recovery combined with a local improvement procedure .
Revised:  It is also shown how an efficient algorithm which succeeds all the way down to the threshold is also obtained using a partial recovery algorithm combined with a local improvement procedure .
Edit intent: clarity
Original:  Our model relies on, first, activation dynamics via spatially-limited (foveated) access to saliency information, and, second, a leaky memory process controlling the re-inspection of target regions.
Revised:  Our model relies on, first, activation dynamics via spatially- limited (foveated) access to saliency information, and, second, a leaky memory process controlling the re-inspection of target regions.
Edit intent: fluency
Original: In this note, we show that  most real multiple view L2 triangulation problems can be globally solved in high efficiency by Newton-type iterative methodssuch as Newton-Raphson, Gauss-Newton and Levenberg-Marquardt algorithms . Such a working two-stage iterative approach differs from conventional implementations in three aspects : first, the algorithm is initialized by symmedian point triangulation, a multiple-view generalization of the mid-point method;
Revised: In this note, we show that most real multiple view L2 triangulation problems can be efficiently obtained by two-stage Newton-like iterative methods, while the difficulty of such problems mainly lies in how to verify the L2 optimality . Such a working two-stage iterative approach differs from conventional implementations in three aspects : first, the algorithm is initialized by symmedian point triangulation, a multiple-view generalization of the mid-point method;
Edit intent: clarity
Original: In this note, we show that  most real multiple view L2 triangulation problems can be globally solved in high efficiency by Newton-type iterative methodssuch as Newton-Raphson, Gauss-Newton and Levenberg-Marquardt algorithms . Such a working two-stage iterative approach differs from conventional implementations in three aspects : first, the algorithm is initialized by symmedian point triangulation, a multiple-view generalization of the mid-point method;
Revised: In this note, we show that most real multiple view L2 triangulation problems can be globally solved in high efficiency by Newton-type iterative methodssuch as Newton-Raphson, Gauss-Newton and Levenberg-Marquardt algorithms . Such a working two-stage bundle adjustment approach features : first, the algorithm is initialized by symmedian point triangulation, a multiple-view generalization of the mid-point method;
Edit intent: clarity
Original:  second, a divide-and-conquer symbolic-numeric method is employed to compute derivatives accurately;
Revised:  second, a symbolic-numeric method is employed to compute derivatives accurately;
Edit intent: clarity
Original:  third, globalizing strategies such as line search and trust region which assure algorithm robustness in iteration are also applied.
Revised:  third, globalizing strategy such as line search and trust region which assure algorithm robustness in iteration are also applied.
Edit intent: fluency
Original:  Numerical experiments indicate that the local minimizers obtained by Newton-type iterations are also global L2 optimal solutions to the real calibrated data sets made available online by  Oxford visual geometry group so far.
Revised:  Numerical experiments indicate that the local minimizers obtained by Newton-type iterations are also global L2 optimal solutions to all the calibrated data sets made available online by Oxford visual geometry group so far.
Edit intent: clarity
Original:  Numerical experiments indicate that the local minimizers obtained by Newton-type iterations are also global L2 optimal solutions to the real calibrated data sets made available online by  Oxford visual geometry group so far.
Revised:  Numerical experiments indicate that the local minimizers obtained by Newton-type iterations are also global L2 optimal solutions to the real calibrated data sets available online by Oxford visual geometry group so far.
Edit intent: clarity
Original:  Numerical experiments indicate that the local minimizers obtained by Newton-type iterations are also global L2 optimal solutions to the real calibrated data sets made available online by  Oxford visual geometry group so far.
Revised:  Numerical experiments indicate that the local minimizers obtained by Newton-type iterations are also global L2 optimal solutions to the real calibrated data sets made available online by the Oxford visual geometry group so far.
Edit intent: fluency
Original:  The IEEE 754 double precision C++ implementation on Oxford dinosaur data shows that it takes 0.859 second to compute all the 4983 points via Gauss-Newton iteration with an Armijo backtracking line search strategy on a Lenovo^{R computer with a 2.2GHz Intel ^{R CPU.
Revised:  The IEEE 754 double precision C++ implementation shows that it takes 0.859 second to compute all the 4983 points via Gauss-Newton iteration with an Armijo backtracking line search strategy on a Lenovo^{R computer with a 2.2GHz Intel ^{R CPU.
Edit intent: clarity
Original:  The IEEE 754 double precision C++ implementation on Oxford dinosaur data shows that it takes 0.859 second to compute all the 4983 points via Gauss-Newton iteration with an Armijo backtracking line search strategy on a Lenovo^{R computer with a 2.2GHz Intel ^{R CPU.
Revised:  The IEEE 754 double precision C++ implementation on Oxford dinosaur data shows that it takes 0.859 second to compute all the 4983 points in the Oxford dinosaur data setvia Gauss-Newton iteration with an Armijo backtracking line search strategy on a Lenovo^{R computer with a 2.2GHz Intel ^{R CPU.
Edit intent: clarity
Original:  The IEEE 754 double precision C++ implementation on Oxford dinosaur data shows that it takes 0.859 second to compute all the 4983 points via Gauss-Newton iteration with an Armijo backtracking line search strategy on a Lenovo^{R computer with a 2.2GHz Intel ^{R CPU.
Revised:  The IEEE 754 double precision C++ implementation on Oxford dinosaur data shows that it takes 0.859 second to compute all the 4983 points via Gauss-Newton iteration with an Armijo backtracking line search strategy on a computer with a 2.2GHz Intel ^{R CPU.
Edit intent: clarity
Original:  Our family generalizes the family of coronas of complete graphs discovered by Cvetkovi\'{c and Stevanovi\'{c}}  .
Revised:  Our family generalizes the family of coronas of complete graphs discovered by and Stevanovi\'{c}} .
Edit intent: clarity
Original: We consider the problem of caching in next generation mobile cellular networks where small base stations (SBSs) are able to store their users' content and serve them accordingly .
Revised: We consider a network model where small base stations (SBSs) are able to store their users' content and serve them accordingly .
Edit intent: clarity
Original: We consider the problem of caching in next generation mobile cellular networks where small base stations (SBSs) are able to store their users' content and serve them accordingly .
Revised: We consider the problem of caching in next generation mobile cellular networks where small base stations (SBSs) have caching capabilities as a means to alleviate the backhaul load and satisfy users' demand .
Edit intent: clarity
Original:  We model and characterize the outage probability and average content delivery rate as a function of the signal-to-interference-ratio (SINR), base station intensity , target file bitrate, storage size  and file popularity.
Revised:  We model and characterize the outage probability and the average delivery rate as a function of the signal-to-interference-ratio (SINR), base station intensity , target file bitrate, storage size and file popularity.
Edit intent: clarity
Original:  We model and characterize the outage probability and average content delivery rate as a function of the signal-to-interference-ratio (SINR), base station intensity , target file bitrate, storage size  and file popularity.
Revised:  We model and characterize the outage probability and average content delivery rate as a function of the signal-to-interference-ratio (SINR), base station intensity , target file bitrate, storage size , file length and file popularity.
Edit intent: clarity
Original:  Our results provide key insights into the problem of cache-enabled small cell  networks.
Revised:  Our results provide key insights into the deployment of cache-enabled small cell networks.
Edit intent: clarity
Original:  in response, new techniques based on social Internet data such as social media and search queries are emerging.
Revised:  in response, new techniques based on social internet data such as social media and search queries are emerging.
Edit intent: fluency
Original:  We propose a freely available, open data source previously unexplored for this use: access logs from the online encyclopedia Wikipedia.
Revised:  We examine a freely available, open data source previously unexplored for this use: access logs from the online encyclopedia Wikipedia.
Edit intent: clarity
Original:  We propose a freely available, open data source previously unexplored for this use: access logs from the online encyclopedia Wikipedia.
Revised:  We propose a freely available, open data source for this use: access logs from the online encyclopedia Wikipedia.
Edit intent: clarity
Original:  Using linear models, language as a proxy for location, and a  simple article selection procedure, we  demonstrate that these data feasibly support an approach which overcomes these challenges.
Revised:  Using linear models, language as a proxy for location, and a simple article selection procedure, we demonstrate that these data feasibly support an approach that overcomes these challenges.
Edit intent: fluency
Original:  These methods have been successful very often despite sphere recognition being known to be hard (for dimensions d%DIFDELCMD < \ge %%% 3) or even undecidable (for d%DIFDELCMD < \ge %%% 5).
Revised:  These methods have been successful very often despite sphere recognition being known to be %DIFDELCMD < \ge %%% 3) or even undecidable (for d%DIFDELCMD < \ge %%% 5).
Edit intent: clarity
Original:  A minimal mesoscopic model is used where the double helix is made of two interacting bead-spring freely rotating strands with a prescribed torsional modulus in the duplex state.
Revised:  A minimal mesoscopic model is used where the double helix is made of two interacting bead-spring rotating strands with a prescribed torsional modulus in the duplex state.
Edit intent: clarity
Original: The rise of machine-to-machine communications has rekindled the interest in random access protocols and their use to support a massive number of uncoordinatedly transmitting devices.
Revised: The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices.
Edit intent: clarity