wanyu/IteraTeR_v2 huggingface dataset:
Original:  The convenient reconstruction of the text contours and the tolerance of the prediction errors in our method guarantee the high detection accuracy and the fast inference speed  respectively.
Revised:  The convenient reconstruction of text contours and the tolerance of the prediction errors in our method guarantee the high detection accuracy and the fast inference speed respectively.
Edit intent: fluency
Original:  The convenient reconstruction of the text contours and the tolerance of the prediction errors in our method guarantee the high detection accuracy and the fast inference speed  respectively.
Revised:  The convenient reconstruction of the text contours and the tolerance of prediction errors in our method guarantee the high detection accuracy and the fast inference speed respectively.
Edit intent: fluency
Original:  The convenient reconstruction of the text contours and the tolerance of the prediction errors in our method guarantee the high detection accuracy and the fast inference speed  respectively.
Revised:  The convenient reconstruction of the text contours and the tolerance of the prediction errors in our method guarantee the high detection accuracy and the fast inference speed , respectively.
Edit intent: fluency
Original:  To validate the effectiveness of our designs , we conduct experiments on several commonly used scene text benchmarks, including both curved and multi-oriented text datasets.
Revised:  To validate the effectiveness of our method , we conduct experiments on several commonly used scene text benchmarks, including both curved and multi-oriented text datasets.
Edit intent: clarity
Original:  For the task of end-to-end scene text recognition, we outperform Mask TextSpotter v3 by 1.1\% on Total-Text.
Revised:  For the task of end-to-end scene text recognition, our method outperforms Mask TextSpotter v3 by 1.1\% on Total-Text.
Edit intent: clarity
Original:  We respond to the above and develop a prototype groupware for real-time collaborative editing of raster images in a web browser.
Revised:  We respond to the above and develop prototype groupware for real-time collaborative editing of raster images in a web browser.
Edit intent: fluency
Original:  This ability can be associated with spatial reasoning, where an agent is able to perceive spatial relationships and regularities, and discover object affordances .
Revised:  This ability can be associated with spatial reasoning, where an agent is able to perceive spatial relationships and regularities, and discover object characteristics .
Edit intent: clarity
Original:  We propose to answer this question in a principled manner by framing it as a statistical hypothesis in terms of a formal and model-agnostic homophily metric.
Revised:  We propose to answer this question in a principled manner by framing it as a statistical hypothesis in terms of a formal and general homophily metric.
Edit intent: clarity
Original:  Motivated by this, there have recently emerged a number of new iterative refinement schemes for solving linear systems Ax=b, both based on standard LU factorization and GMRES solvers, that exploit multiple different precisions . Each particular algorithm and each combination of precisions leads to different condition number-based constraints for convergence of the backward and forward errors, and each has different performance costs.
Revised:  Motivated by this, there has been a renewed interest in mixed precision iterative refinement for solving linear systems Ax=b, both based on standard LU factorization and GMRES solvers, that exploit multiple different precisions . Each particular algorithm and each combination of precisions leads to different condition number-based constraints for convergence of the backward and forward errors, and each has different performance costs.
Edit intent: clarity
Original:  Motivated by this, there have recently emerged a number of new iterative refinement schemes for solving linear systems Ax=b, both based on standard LU factorization and GMRES solvers, that exploit multiple different precisions . Each particular algorithm and each combination of precisions leads to different condition number-based constraints for convergence of the backward and forward errors, and each has different performance costs.
Revised:  Motivated by this, there have recently emerged a number of new iterative refinement schemes for solving linear systems Ax=b, both based on standard LU factorization and GMRES solvers, that exploit multiple different precisions . Each particular variant with a given combination of precisions leads to different condition number-based constraints for convergence of the backward and forward errors, and each has different performance costs.
Edit intent: clarity
Original:  For a given combination of precisions, the algorithm begins with the least expensive approach and convergence is monitored via inexpensive computations with quantities produced during the iteration.
Revised:  For an initial combination of precisions, the algorithm begins with the least expensive approach and convergence is monitored via inexpensive computations with quantities produced during the iteration.
Edit intent: clarity
Original:  If slow convergence or divergence is detected using particular stopping criteria, the algorithm switches to use  more expensive, but more reliable GMRES-based refinement approaches.
Revised:  If slow convergence or divergence is detected using particular stopping criteria, the algorithm switches to use a more expensive, but more reliable GMRES-based refinement approaches.
Edit intent: fluency
Original:  After presenting the algorithm and its details, we perform extensive numerical experiments on a variety of random dense problems and problems from real applications .
Revised:  After presenting the algorithm and its details, we perform extensive numerical experiments on random dense problems and problems from real applications .
Edit intent: clarity
Original: Quasi-Newton methods are able to construct model of the objective function without needing second derivatives of the objective function.
Edit intent: coherence
Original:  Multipoint symmetric secant  methods can be thought of as generalizations of quasi-Newton methods in that they have additional requirements on their approximation of the Hessian.
Revised:  Multipoint symmetric secant methods can be thought of as generalizations of quasi-Newton methods in that they attempt to impose additional requirements on their approximation of the Hessian.
Edit intent: clarity
Original:  Given an initial Hessian approximation, the multipoint symmetric secant (MSS ) method generates a sequence of matrices using rank-2 updates.
Revised:  Given an initial Hessian approximation, MSS methods generate a sequence of matrices using rank-2 updates.
Edit intent: clarity
Original:  Several algorithms for recommendation systems with multi-step critiquing have therefore been developed.
Revised:  Several algorithms for recommender systems with multi-step critiquing have therefore been developed.
Edit intent: fluency
Original:  under the loss functions of image-level and semantic-level restorations , respectively, showing that pixel-wise filtering can obtain much higher image quality (e.g., higher PSNR) as well as higher robustness (e.g., higher accuracy on adversarial examples) than existing pixel-wise additive-based method.
Revised:  under the loss functions of image-level and semantic-level , respectively, showing that pixel-wise filtering can obtain much higher image quality (e.g., higher PSNR) as well as higher robustness (e.g., higher accuracy on adversarial examples) than existing pixel-wise additive-based method.
Edit intent: clarity
Original:  The proposed method is termed as AdvFilter.
Revised:  The method is termed as AdvFilter.
Edit intent: clarity
Original:  The experiments conduct on NeurIPS-2017DEV, SVHN , and CIFAR10 datasets and show the advantages over enhancing CNNs' robustness, high generalization to different models , and noise levels.
Revised:  The experiments conduct on NeurIPS-2017DEV, SVHN and CIFAR10 datasets and show the advantages over enhancing CNNs' robustness, high generalization to different models , and noise levels.
Edit intent: fluency
Original:  The experiments conduct on NeurIPS-2017DEV, SVHN , and CIFAR10 datasets and show the advantages over enhancing CNNs' robustness, high generalization to different models , and noise levels.
Revised:  The experiments conduct on NeurIPS-2017DEV, SVHN , and CIFAR10 datasets and show advantages over enhancing CNNs' robustness, high generalization to different models , and noise levels.
Edit intent: fluency
Original:  The experiments conduct on NeurIPS-2017DEV, SVHN , and CIFAR10 datasets and show the advantages over enhancing CNNs' robustness, high generalization to different models , and noise levels.
Revised:  The experiments conduct on NeurIPS-2017DEV, SVHN , and CIFAR10 datasets and show the advantages over enhancing CNNs' robustness, high generalization to different models and noise levels.
Edit intent: fluency
Original:  We further show how to use our sampling algorithm to get an approximate counting algorithm, with essentially the same complexity.
Edit intent: coherence
Original:  Useful sharing turns out to be harder to manipulate in call-by-need than in call-by-name or call-by-value, because call-by-need evaluates inside environments, making it harder to specify when a substitution step is useful.
Revised:  Useful sharing turns out to be harder in call-by-need than in call-by-name or call-by-value, because call-by-need evaluates inside environments, making it harder to specify when a substitution step is useful.
Edit intent: clarity
Original:  We isolate the key involved concepts and prove the correctness  of useful sharing in this setting.
Revised:  We isolate the key involved concepts and prove the correctness and the completeness of useful sharing in this setting.
Edit intent: clarity
Original:  The extent to which it represents gradient descent is an open question in deep learning theory .
Revised:  The extent to which it represents gradient descent is an open question in the theory of deep learning .
Edit intent: clarity
Original:  Viewing gradient descent as an approximate numerical solution to the initial value problem of gradient flow, we find that the degree of approximation depends on the curvature along the latter's trajectory.
Revised:  Viewing gradient descent as an approximate numerical solution to the initial value problem of gradient flow, we find that the degree of approximation depends on the curvature around the gradient flow trajectory.
Edit intent: clarity
Original:  Experiments suggest that over simple deep neural networks, gradient descent with conventional step size is indeed close to the continuous limit .
Revised:  Experiments suggest that over simple deep neural networks, gradient descent with conventional step size is indeed close to gradient flow .
Edit intent: clarity
Original:  We hypothesize that the theory of gradient flows will be central to unraveling mysteries behind deep learning.
Revised:  We hypothesize that the theory of gradient flows will unravel mysteries behind deep learning.
Edit intent: clarity
Original: As of July 2021, there is a continuing outbreak of the  B.1.617.2 (Delta ) variant of SARS-CoV-2  in Sydney, Australia .
Revised: An outbreak of the B.1.617.2 (Delta ) variant of SARS-CoV-2 in Sydney, Australia .
Edit intent: clarity
Original:  The outbreak is of major concern as the Delta variant is estimated to have twice the reproductive number to previous variants that circulated in Australia in 2020, which is worsened by low levels of acquired immunity in the population.
Revised:  The outbreak is of major concern as the Delta variant is estimated to have twice the reproductive number to previous variants that circulated in Australia in 2020.
Edit intent: coherence
Original:  Using a re-calibrated agent-based model, we explored a feasible range of non-pharmaceutical interventions, in terms of both mitigation ( case isolation, home quarantine ) and suppression ( school closures, social distancing ).
Revised:  Using a re-calibrated agent-based model, we explored a feasible range of non-pharmaceutical interventions, including case isolation, home quarantine ) and suppression ( school closures, social distancing ).
Edit intent: clarity
Original:  Using a re-calibrated agent-based model, we explored a feasible range of non-pharmaceutical interventions, in terms of both mitigation ( case isolation, home quarantine ) and suppression ( school closures, social distancing ).
Revised:  Using a re-calibrated agent-based model, we explored a feasible range of non-pharmaceutical interventions, in terms of both mitigation ( case isolation, home quarantine , school closures, social distancing ).
Edit intent: clarity
Original:  Our nowcasting modelling indicated that the level of social distancing currently attained in Sydney is inadequate for the outbreak control .
Revised:  Our nowcasting modelling indicated that the levels of reduced interactions in workplaces and across communities attained in Sydney is inadequate for the outbreak control .
Edit intent: clarity
Original:  Our nowcasting modelling indicated that the level of social distancing currently attained in Sydney is inadequate for the outbreak control .
Revised:  Our nowcasting modelling indicated that the level of social distancing currently attained in Sydney and other parts of the nation were inadequate for controlling the outbreak .
Edit intent: clarity
Original:  A counter-factual analysis suggested that if 80\% of agents comply with social distancing , then at least a month is needed for the new daily cases to reduce from their peak to below ten . A small reduction in social distancing compliance to 70\% lengthens this period to 45 days .
Revised:  A counter-factual analysis suggested that if 80\% of agents comply with social distancing , then at least 45 days are needed for new daily cases to reduce from their peak to below ten . A small reduction in social distancing compliance to 70\% lengthens this period to 45 days .
Edit intent: clarity
Original:  A counter-factual analysis suggested that if 80\% of agents comply with social distancing , then at least a month is needed for the new daily cases to reduce from their peak to below ten . A small reduction in social distancing compliance to 70\% lengthens this period to 45 days .
Revised:  A counter-factual analysis suggested that if 80\% of agents comply with social distancing , then at least a month is needed for the new daily cases to fall from their peak to below ten . A small reduction in social distancing compliance to 70\% lengthens this period to 45 days .
Edit intent: clarity
Original:  Our nowcasting modelling indicated that the levels of reduced interactions in workplaces and across communities attained in Sydney and other parts of the nation were inadequate for controlling the outbreak.
Revised:  Our modelling indicated that the levels of reduced interactions in workplaces and across communities attained in Sydney and other parts of the nation were inadequate for controlling the outbreak.
Edit intent: fluency
Original:  A counter-factual analysis suggested that if 70\% of the population comply with tight stay-at-home restrictions, then at least 45 days are needed for new daily cases to fall from their peak to below ten per day.
Revised:  A counter-factual analysis suggested that if 70\% of the population followed tight stay-at-home restrictions, then at least 45 days are needed for new daily cases to fall from their peak to below ten per day.
Edit intent: clarity
Original:  A counter-factual analysis suggested that if 70\% of the population comply with tight stay-at-home restrictions, then at least 45 days are needed for new daily cases to fall from their peak to below ten per day.
Revised:  A counter-factual analysis suggested that if 70\% of the population comply with tight stay-at-home restrictions, then at least 45 days would have been needed for new daily cases to fall from their peak to below ten per day.
Edit intent: clarity
Original:  Our model successfully predicted that, under a progressive vaccination rollout, if 40-50\% of the Australian population follow stay-at-home restrictions, the incidence will stabilise by mid-October 2021.
Revised:  Our model successfully predicted that, under a progressive vaccination rollout, if 40-50\% of the Australian population follow stay-at-home restrictions, the incidence will peak by mid-October 2021.
Edit intent: clarity
Original:  and acoustic (ocean) materials sourced by physics-based non-linear earthquake dynamic rupture , thereby gaining insight into the tsunami generation process without relying on approximations that have previously been applied to permit solution of this challenging problem . Complicated geometries, including high-resolution bathymetry, coastlines and segmented earthquake faults are discretized by adaptive unstructured tetrahedral meshes.
Revised:  and acoustic (ocean) materials sourced by physics-based non-linear earthquake dynamic rupture . Complicated geometries, including high-resolution bathymetry, coastlines and segmented earthquake faults are discretized by adaptive unstructured tetrahedral meshes.
Edit intent: coherence
Original:  This leads inevitably to large differences in element sizes and wave speeds which can be mitigated by ADER local time-stepping and a Discontinuous Galerkin discretisation yielding high-order accuracy in time and space  .
Revised:  A Discontinuous Galerkin discretization with ADER local time-stepping and a Discontinuous Galerkin discretisation yielding high-order accuracy in time and space .
Edit intent: clarity
Original: Many speech and music analysis and processing schemes rely on an estimate of the fundamental frequency f0 of periodic signal components.
Revised: Many speech and music analysis and processing schemes rely on an estimate of the fundamental frequency f_0 of periodic signal components.
Edit intent: clarity
Original:  This study proposes a novel time-domain locked-loop algorithm with low computational effort and low memory footprint for f0 estimation.
Revised:  This study proposes a novel time-domain locked-loop algorithm with low computational effort and low memory footprint for f_0 estimation.
Edit intent: fluency
Original:  Theoretically, this allows for a noise-robust and rapid f0 estimation for periodic signals of arbitrary waveform, and without the requirement of a prior frequency analysis.
Revised:  Theoretically, this allows for a noise-robust and rapid f_0 estimation for periodic signals of arbitrary waveform, and without the requirement of a prior frequency analysis.
Edit intent: clarity
Original: Power-domain non-orthogonal multiple access (NOMA) has arisen as a promising multiple access technique for the next-generation wireless networks.
Edit intent: coherence
Original:  Each cluster includes a set of users in which the well-known superposition coding (SC) combined with successive interference cancellation (SIC) technique (called SC-SIC) is applied among them.
Revised:  Each cluster includes a set of users in which the well-known superposition coding (SC) combined with successive interference cancellation (SIC) technique is applied among them.
Edit intent: clarity
Original:  Interestingly, we prove that in both the sum-rate and energy efficiency maximization problems, network-NOMA can be equivalently transformed to a virtual network-OMA system, where the effective channel gain of these virtual OMA users are obtained in closed-form.
Revised:  Interestingly, we prove that in both the sum-rate and energy efficiency maximization problems, network-NOMA can be equivalently transformed to a virtual network-OMA system, where the effective channel gain of these virtual OMA users is obtained in closed-form.
Edit intent: fluency
Original: The main difficulty is solving the discrete constrained problem is its poor and even ill condition.
Revised: The main difficulty in solving the discrete constrained problem is its poor and even ill condition.
Edit intent: fluency
Original: The vision of providing access to all web content equally for all users makes web accessibility a fundamental goal of todays internet.
Revised: The vision of providing access to all web content equally for all users makes web accessibility a fundamental goal of today's internet.
Edit intent: fluency
Original:  Web accessibility is measured against the accessibility guidelines such as WCAG, GIGW  and so on.
Revised:  Web accessibility is measured against the accessibility guidelines such as WCAG, GIGW , and so on.
Edit intent: fluency
Original:  Despite the availability of several tools to check  conformity of websites with WCAG 2.1 guidelines, there is  scarcity of tools that are both open source and scalable.
Revised:  Despite the availability of several tools to check the conformity of websites with WCAG 2.1 guidelines, there is scarcity of tools that are both open source and scalable.
Edit intent: fluency
Original:  Despite the availability of several tools to check  conformity of websites with WCAG 2.1 guidelines, there is  scarcity of tools that are both open source and scalable.
Revised:  Despite the availability of several tools to check conformity of websites with WCAG 2.1 guidelines, there is a scarcity of tools that are both open source and scalable.
Edit intent: fluency
Original:  To support automated accessibility evaluation of numerous websites against WCAG 2.2 and 2.1, we present here a tool, WAccess.
Revised:  To support automated accessibility evaluation of numerous websites against WCAG 2.2 , 2.1, we present here a tool, WAccess.
Edit intent: coherence
Original:  WAccess highlights violations of  9 guidelines from WCAG 2.1  and 7 guidelines from WCAG 2.2 of a specific web page on the web console and suggests the fix for violations while specifying violating code snippet simultaneously.
Revised:  WAccess highlights violations of 9 guidelines from WCAG 2.1 , and 7 guidelines from WCAG 2.2 of a specific web page on the web console and suggests the fix for violations while specifying violating code snippet simultaneously.
Edit intent: fluency
Original:  We evaluated WAccess against 2246 government websites of India , and observed a total of about 2 million violations.
Revised:  We evaluated WAccess against 2246 government websites of India and observed a total of about 2 million violations.
Edit intent: fluency
Original:  and 2) propose  a model that effectively and dynamically combines facial and body information, which makes it suitable for gender recognition in wild conditions.
Revised:  and 2) propose a model that effectively and dynamically complements facial and body information, which makes it suitable for gender recognition in wild conditions.
Edit intent: clarity
Original:  Our model combines facial and body information through a learnable fusion matrix and a channel-attention sub-network, focusing on the most influential body parts according to the specific image/subject features.
Revised:  YY-Net combines facial and body information through a learnable fusion matrix and a channel-attention sub-network, focusing on the most influential body parts according to the specific image/subject features.
Edit intent: clarity
Original: We propose a powerful Reinforced Hybrid Genetic Algorithm (RHGA) for  the famous NP-hard Traveling Salesman Problem (TSP). RHGA combines reinforcement learning technique with the well-known Edge Assembly Crossover genetic algorithm (EAX-GA) and the Lin-Kernighan-Helsgaun (LKH) local search heuristic.
Revised: We propose a novel method called the Reinforced Hybrid Genetic Algorithm (RHGA) for the famous NP-hard Traveling Salesman Problem (TSP). RHGA combines reinforcement learning technique with the well-known Edge Assembly Crossover genetic algorithm (EAX-GA) and the Lin-Kernighan-Helsgaun (LKH) local search heuristic.
Edit intent: clarity