wanyu/IteraTeR_v2 huggingface dataset:
Original:  We discuss our measure's applications in domains other than Go, especially in domains in which AI's decision-making ability will likely surpass that of human experts.
Revised:  We discuss our measure's applications in domains other than Go, especially in domains in which AI's decision making ability will likely surpass that of human experts.
Edit intent: fluency
Original:  We fill some gaps in the approaches and generalise them to  different underlying GFM model types.
Revised:  We fill some gaps in the approaches and generalise them to use different underlying GFM model types.
Edit intent: coherence
Original:  Comparing with the greedy algorithm, minimal and maximal alphabets are defined.
Revised:  Comparing with the greedy algorithm, minimal and natural alphabets are defined.
Edit intent: clarity
Original:  Comparing with the greedy algorithm, minimal and natural alphabets are defined.
Revised:  Comparing with the greedy algorithm, minimal and maximal alphabets are defined.
Edit intent: clarity
Original: The field of Artificial Intelligence (AI) has been introducing a certain level of anxiety in research, business and also policy.
Revised: Regulation of advanced technologies such as Artificial Intelligence (AI) has been introducing a certain level of anxiety in research, business and also policy.
Edit intent: clarity
Original:  Whether real or not, a belief in this narrative may be detrimental as some stakeholders will feel obliged to cut corners on safety precautions or ignore societal consequences . Starting from a game-theoretical model describing an idealised technology race in a well-mixed world  , here we investigate how different interaction structures among race participants can alter collective choices and requirements for regulatory actions.
Revised:  Whether real or not, a belief in this narrative may be detrimental as some stakeholders will feel obliged to cut corners on safety precautions or ignore societal consequences . Starting from a game-theoretical model describing an idealised technology race in a well-mixed world of players , here we investigate how different interaction structures among race participants can alter collective choices and requirements for regulatory actions.
Edit intent: clarity
Original:  Furthermore, our results suggest that technology governance and regulation may profit from the world's patent heterogeneity and inequality among firms and nations to design and implement meticulous interventions on a minority of participants  capable of influencing an entire population towards an ethical and sustainable use of AI .
Revised:  Furthermore, our results suggest that technology governance and regulation may profit from the world's patent heterogeneity and inequality among firms and nations , so as to enable the design and implementation of meticulous interventions on a minority of participants capable of influencing an entire population towards an ethical and sustainable use of AI .
Edit intent: clarity
Original:  Furthermore, our results suggest that technology governance and regulation may profit from the world's patent heterogeneity and inequality among firms and nations to design and implement meticulous interventions on a minority of participants  capable of influencing an entire population towards an ethical and sustainable use of AI .
Revised:  Furthermore, our results suggest that technology governance and regulation may profit from the world's patent heterogeneity and inequality among firms and nations to design and implement meticulous interventions on a minority of participants , which is capable of influencing an entire population towards an ethical and sustainable use of AI .
Edit intent: coherence
Original:  Furthermore, our results suggest that technology governance and regulation may profit from the world's patent heterogeneity and inequality among firms and nations to design and implement meticulous interventions on a minority of participants  capable of influencing an entire population towards an ethical and sustainable use of AI .
Revised:  Furthermore, our results suggest that technology governance and regulation may profit from the world's patent heterogeneity and inequality among firms and nations to design and implement meticulous interventions on a minority of participants capable of influencing an entire population towards an ethical and sustainable use of advanced technologies .
Edit intent: clarity
Original: Objectives: To evaluate the relationship between population size and number of crimes in cities across twelve countries and assess the impact of per capita measurements on crime analyses, depending on offense type.
Revised: Crime rates per capita are used virtually everywhere to rank and compare cities. However, their usage relies on a strong linear assumption that crime increases at the same pace as the number of people in a region. In this paper, we demonstrate that using per capita rates to rank cities can produce substantially different rankings from rankings adjusted for population size. We analyze the population-crime relationship in cities across 12 countries and assess the impact of per capita measurements on crime analyses, depending on offense type.
Edit intent: coherence
Original:  Similarly, when interacting with robots to perform complex tasks, such as surgery, we need to acquire the rich force information and contact location , to aid in the task .
Revised:  Similarly, when interacting with robots to perform complex tasks, such as surgery, we need to acquire the rich force information and contact location is important for task performance .
Edit intent: clarity
Original:  To address these issues , we present the design and fabrication of Wi-Chlorian, which is a 'wireless' sensors that can be attached to an object or robot, like a sticker.
Revised:  To address these challenges , we present the design and fabrication of Wi-Chlorian, which is a 'wireless' sensors that can be attached to an object or robot, like a sticker.
Edit intent: clarity
Original:  Wi-Chlorian's sensor transduces force magnitude and location into phase changes of an incident RF signal , which is reflected back to enable measurement of force  and contact location .
Revised:  Wi-Chlorian's sensor transduces force magnitude and location , to phase changes of an incident RF signal , which is reflected back to enable measurement of force and contact location .
Edit intent: fluency
Original:  Wi-Chlorian's sensor transduces force magnitude and location into phase changes of an incident RF signal , which is reflected back to enable measurement of force  and contact location .
Revised:  Wi-Chlorian's sensor transduces force magnitude and location into phase changes of an incident RF signal , which is reflected back to enable measurement of force magnitude and contact location .
Edit intent: fluency
Original: We present a dataflow model for extracting data parallelism latent in Unix shell scripts .
Revised: We present a dataflow model for modelling parallel Unix shell pipelines .
Edit intent: clarity
Original:  To accurately capture the semantics of Unix shell scripts , the dataflow model is order-aware, i.e., the order in which a node in the dataflow graph consumes inputs from different edges plays a central role in the semantics of the computation and therefore in the resulting parallelization.
Revised:  To accurately capture the semantics of complex Unix pipelines , the dataflow model is order-aware, i.e., the order in which a node in the dataflow graph consumes inputs from different edges plays a central role in the semantics of the computation and therefore in the resulting parallelization.
Edit intent: clarity
Original:  The idea is illustrated through particular examples of an interior penalty DG method for solving the Laplace-Beltrami equation and the corresponding eigenvalue problem with numerical verification.
Revised:  It is illustrated using examples of an interior penalty DG method for solving the Laplace-Beltrami equation and the corresponding eigenvalue problem with numerical verification.
Edit intent: clarity
Original: We present KumQuat, a system for automatically synthesizing parallel and distributed versions of Unix shell commands . KumQuat follows a divide-and-conquer approach, decomposing commands into (i) a parallelmapper applying the original command to produce partial results, and (ii) an ordered combiner that combines the partial results into the final output . KumQuat synthesizes the combiner by applying repeated rounds of exploration;
Revised: We present KumQuat, a system for automatically generating data parallel implementations of Unix shell commands . KumQuat follows a divide-and-conquer approach, decomposing commands into (i) a parallelmapper applying the original command to produce partial results, and (ii) an ordered combiner that combines the partial results into the final output . KumQuat synthesizes the combiner by applying repeated rounds of exploration;
Edit intent: clarity
Original: This paper proposes a closed-form parametric formula of the Minkowski sum boundary for broad classes of convex bodies in d-dimensional Euclidean space .
Revised: This article derives closed-form parametric formula of the Minkowski sum boundary for broad classes of convex bodies in d-dimensional Euclidean space .
Edit intent: clarity
Original: This paper proposes a closed-form parametric formula of the Minkowski sum boundary for broad classes of convex bodies in d-dimensional Euclidean space .
Revised: This paper proposes a closed-form parametric formulas for the Minkowski sums of convex bodies in d-dimensional Euclidean space .
Edit intent: clarity
Original:  The first theorem directly parameterizes the Minkowski sums using the unit normal vector at each body surface .
Revised:  The first theorem directly parameterizes the Minkowski sums using the unit normal vector at each surface point .
Edit intent: clarity
Original:  In order to further examine the results, numerical verifications and comparisons of the Minkowski sums between two superquadric bodies are conducted.
Revised:  In order to examine the results, numerical verifications and comparisons of the Minkowski sums between two superquadric bodies are conducted.
Edit intent: clarity
Original:  In order to further examine the results, numerical verifications and comparisons of the Minkowski sums between two superquadric bodies are conducted.
Revised:  In order to further examine the results, numerical validations and comparisons of the Minkowski sums between two superquadric bodies are conducted.
Edit intent: clarity
Original:  The application for the generation of configuration space obstacles in motion planning problems is introduced and demonstrated.
Revised:  Applications to generate configuration space obstacles in motion planning problems is introduced and demonstrated.
Edit intent: clarity
Original:  We formulate a stylised model in which market participants update their Bayesian prior on an efficient price with a model-based learning process.
Revised:  We formulate a stylised model in which market participants update their prior about an efficient price with a model-based learning process.
Edit intent: clarity
Original:  We show that exponential intensities for  aggressive orders arise naturally in this framework.
Revised:  We show that exponential intensities for the arrival of aggressive orders arise naturally in this framework.
Edit intent: clarity
Original:  The resulting theory allows us to derive simple analytic formulas for market dynamics and price impact in the case with Brownian efficient price and informed market takers.
Revised:  The resulting theory allows us to fully describe market dynamics in the case with Brownian efficient price and informed market takers.
Edit intent: clarity
Original:  To address these challenges, we propose a graph neural network (GNN) based framework for approximating node resilience in large complex networks.
Revised:  To address these challenges, we propose a graph neural network (GNN) based framework for identifying critical nodes/links in large complex networks.
Edit intent: clarity
Original:  The proposed framework defines a GNN  model that learns the node rank on a small representative subset of nodes .
Revised:  The proposed framework defines a GNN based model that learns the node rank on a small representative subset of nodes .
Edit intent: clarity
Original:  Then, the trained model can be employed to predict the ranks of unseen nodes in similar types of graphs .
Revised:  Then, the trained model can be employed to predict the scores of unseen nodes in similar types of graphs .
Edit intent: clarity
Original:  The scalability of the framework is demonstrated through the prediction of node ranks in real-world graphs .
Revised:  The scalability of the framework is demonstrated through the prediction of node ranks in real-world networks .
Edit intent: clarity
Original:  Graph theory is a widely used framework for modeling interdependent systems and to evaluate their resilience to disruptions.
Revised:  Graph theory is a widely used framework for modeling such complex networks and to evaluate their resilience to disruptions.
Edit intent: clarity
Original:  Graph theory is a widely used framework for modeling interdependent systems and to evaluate their resilience to disruptions.
Revised:  Graph theory is a widely used framework for modeling interdependent systems and to evaluate their robustness to disruptions.
Edit intent: clarity
Original:  To overcome these challenges, we propose a Bayesian graph neural network-based framework for quickly identifying critical nodes in a large graph. while systematically incorporating uncertainties.
Revised:  To overcome these challenges, we propose a Bayesian graph neural network based node classification framework that is computationally efficient and systematically incorporates uncertainties.
Edit intent: clarity
Original:  Instead of utilizing the observed graph for training the model, a MAP estimate of the graph is computed based on the observed topology , and node target labels.
Revised:  Instead of utilizing the observed graph for training the model, a MAP estimate of the graph is computed based on the observed topology and node target labels.
Edit intent: fluency
Original:  The fidelity and the gain in computational complexity offered by the Bayesian framework are illustrated using simulation results.
Revised:  The fidelity and the gain in computational complexity offered by the Bayesian framework is illustrated using simulation results.
Edit intent: fluency
Original:  Focusing on a setting where the client datasets are highly changing and temporal in nature, we investigate the timeliness of model updates and propose a novel timely communication scheme.
Revised:  Focusing on a setting where the client datasets are fast changing and highly temporal in nature, we investigate the timeliness of model updates and propose a novel timely communication scheme.
Edit intent: clarity
Original:  The calculation of full-softmax is very expensive from the computational and energy perspective.
Revised:  The calculation of full softmax is costly from the computational and energy perspective.
Edit intent: clarity
Original:  There have been a variety of sampling approaches to overcome this challenge, popularly known as negative sampling (NS).
Revised:  There have been various sampling approaches to overcome this challenge, popularly known as negative sampling (NS).
Edit intent: clarity
Original:  Unfortunately, due to the dynamically updated parameters and data samples, there does not exist any sampling scheme that is truly adaptive and also samples the negative classes in constant time every iteration .
Revised:  Unfortunately, due to the dynamically updated parameters and data samples, there is no sampling scheme that is truly adaptive and also samples the negative classes in constant time every iteration .
Edit intent: clarity
Original:  Unfortunately, due to the dynamically updated parameters and data samples, there does not exist any sampling scheme that is truly adaptive and also samples the negative classes in constant time every iteration .
Revised:  Unfortunately, due to the dynamically updated parameters and data samples, there does not exist any sampling scheme that is provably adaptive and samples the negative classes in constant time every iteration .
Edit intent: clarity
Original:  Unfortunately, due to the dynamically updated parameters and data samples, there does not exist any sampling scheme that is truly adaptive and also samples the negative classes in constant time every iteration .
Revised:  Unfortunately, due to the dynamically updated parameters and data samples, there does not exist any sampling scheme that is truly adaptive and also samples the negative classes efficiently .
Edit intent: clarity
Original:  Therefore, alternative heuristics like random sampling, static frequency-based sampling, or learning-based biased sampling, which primarily trade either the sampling cost or the adaptivity of samples per iteration , are adopted.
Revised:  Therefore, alternative heuristics like random sampling, static frequency-based sampling, or learning-based biased sampling, which primarily trade either the sampling cost or the adaptivity of samples per iteration are adopted.
Edit intent: fluency
Original:  In this paper, we show a class of distribution where the sampling scheme is truly adaptive and provably generates negative samples in constant time.
Revised:  In this paper, we show a class of distribution where the sampling scheme is truly adaptive and provably generates negative samples in near-constant time.
Edit intent: clarity
Original:  Our implementation in C++ on commodity CPU is significantly faster, in terms of wall clock time , compared to the most optimized TensorFlow implementations of standard softmax or other sampling approaches on modern GPUs (V100s) .
Revised:  Our implementation in C++ on CPU is significantly faster, in terms of wall clock time , compared to the most optimized TensorFlow implementations of standard softmax or other sampling approaches on modern GPUs (V100s) .
Edit intent: clarity
Original:  Our implementation in C++ on commodity CPU is significantly faster, in terms of wall clock time , compared to the most optimized TensorFlow implementations of standard softmax or other sampling approaches on modern GPUs (V100s) .
Revised:  Our implementation in C++ on commodity CPU is significantly superior, both in terms of wall clock time , compared to the most optimized TensorFlow implementations of standard softmax or other sampling approaches on modern GPUs (V100s) .
Edit intent: clarity
Original:  Our implementation in C++ on commodity CPU is significantly faster, in terms of wall clock time , compared to the most optimized TensorFlow implementations of standard softmax or other sampling approaches on modern GPUs (V100s) .
Revised:  Our implementation in C++ on commodity CPU is significantly faster, in terms of wall-clock time and accuracy , compared to the most optimized TensorFlow implementations of standard softmax or other sampling approaches on modern GPUs (V100s) .
Edit intent: clarity
Original:  Our implementation in C++ on commodity CPU is significantly faster, in terms of wall clock time , compared to the most optimized TensorFlow implementations of standard softmax or other sampling approaches on modern GPUs (V100s) .
Revised:  Our implementation in C++ on commodity CPU is significantly faster, in terms of wall clock time , compared to the most optimized TensorFlow implementations of standard softmax or other sampling approaches on powerful NVIDIA V100 GPU .
Edit intent: clarity
Original:  In this paper, we will discuss scheduling a single-server system when accurate information about the jobs' processing times is not available.
Revised:  In this paper, we discuss scheduling a single-server system when accurate information about the jobs' processing times is not available.
Edit intent: clarity
Original:  In this paper, we will discuss scheduling a single-server system when accurate information about the jobs' processing times is not available.
Revised:  In this paper, we will discuss scheduling a single-server system when exact information about the jobs' processing times is not available.
Edit intent: clarity
Original: Super-resolution microscopy has enabled valuable insights into the subcellular , mechanistic details of many different biological processes across a wide range of cell types.
Revised: Super-resolution microscopy has catalyzed valuable insights into the subcellular , mechanistic details of many different biological processes across a wide range of cell types.
Edit intent: clarity
Original: Super-resolution microscopy has enabled valuable insights into the subcellular , mechanistic details of many different biological processes across a wide range of cell types.
Revised: Super-resolution microscopy has enabled valuable insights into the sub-cellular , mechanistic details of many different biological processes across a wide range of cell types.
Edit intent: fluency
Original:  Our findings are largely qualitative but demonstrate promise in showing how fluorescence polarization and Slimfield-mediated super-resolved localization microscopy can be combined on the same sample to enable new biological insights .
Revised:  Our findings are qualitative but demonstrate promise in showing how fluorescence polarization and Slimfield-mediated super-resolved localization microscopy can be combined on the same sample to enable new biological insights .
Edit intent: clarity
Original:  Our findings are largely qualitative but demonstrate promise in showing how fluorescence polarization and Slimfield-mediated super-resolved localization microscopy can be combined on the same sample to enable new biological insights .
Revised:  Our findings are largely qualitative but demonstrate promise in showing how fluorescence polarization and super-resolved localization microscopy can be combined on the same sample to enable new biological insights .
Edit intent: clarity
Original: A major strategy to prevent the spread of COVID-19 is through the limiting of in-person contacts.
Revised: A major strategy to prevent the spread of COVID-19 is the limiting of in-person contacts.
Edit intent: clarity
Original:  However,  for the many disabled people who live in the community and require caregiversto assist them with activities of daily living, limiting contacts is impractical or impossible .
Revised:  However, this is impractical or impossible for the many disabled people who live in the community and require caregiversto assist them with activities of daily living, limiting contacts is impractical or impossible .
Edit intent: coherence
Original:  To accomplish this, we simulate COVID-19 transmission with a compartmental model on a network .
Revised:  We simulate transmission with a compartmental model on a network .
Edit intent: clarity
Original:  The networks  incorporate heterogeneity in the risks of different types of interactions, time-dependent lockdown and reopening measures, and interaction distributions for four different groups (caregivers, disabled people, essential workers, and the general population).
Revised:  The networks incorporate heterogeneity in the risks of different types of interactions, time-dependent lockdown and reopening measures, and contact distributions for four different groups (caregivers, disabled people, essential workers, and the general population).
Edit intent: clarity
Original:  Among these groups, we find the probability of becoming infected is highest for caregivers and second highest for disabled people.
Revised:  We find the probability of becoming infected is highest for caregivers and second highest for disabled people.
Edit intent: clarity
Original:  Among these groups, we find the probability of becoming infected is highest for caregivers and second highest for disabled people.
Revised:  Among these groups, we find the probability of becoming infected is largest for caregivers and second highest for disabled people.
Edit intent: clarity