wanyu/IteraTeR_v2 huggingface dataset:
Original:  The output of our project, Dataset of Annotated Car Trajectories (DACT), is available online at URL 
Revised:  The output of our project, Dataset of Annotated Car Trajectories (DACT), is available online at URL .
Edit intent: fluency
Original: This work demonstrates how to accelerate dense linear algebra computations using CLBlast, an open-source OpenCL BLAS library providing optimized routines for a wide variety of devices.
Revised: This work introduces CLBlast, an open-source OpenCL BLAS library providing optimized routines for a wide variety of devices.
Edit intent: clarity
Original: This work demonstrates how to accelerate dense linear algebra computations using CLBlast, an open-source OpenCL BLAS library providing optimized routines for a wide variety of devices.
Revised: This work demonstrates how to accelerate dense linear algebra computations using CLBlast, an open-source BLAS library providing optimized routines for a wide variety of devices.
Edit intent: clarity
Original: This work demonstrates how to accelerate dense linear algebra computations using CLBlast, an open-source OpenCL BLAS library providing optimized routines for a wide variety of devices.
Revised: This work demonstrates how to accelerate dense linear algebra computations using CLBlast, an open-source OpenCL BLAS library providing optimized OpenCL routines to accelerate dense linear algebra for a wide variety of devices.
Edit intent: clarity
Original:  1) it is optimized for and tested on a large variety of OpenCL devices including less commonly used devices such as embedded and low-power GPUs, 2) it can be explicitly tuned for specific problem-sizes on specific hardware platforms, 3) it can perform operations in half-precision floating-point FP16 saving precious bandwidth, time and energy, 4  ) and it can combine multiple operations in a single batched routine, accelerating smaller problems significantly.
Revised:  1) it is optimized for and tested on a large variety of OpenCL devices including less commonly used devices such as embedded and low-power GPUs, 2) it can be explicitly tuned for specific problem-sizes on specific hardware platforms, 3) it can perform operations in half-precision floating-point FP16 saving bandwidth, time and energy, 4 ) and it can combine multiple operations in a single batched routine, accelerating smaller problems significantly.
Edit intent: clarity
Original:  We further propose several adaptive tests that are computationally tractable and completely data-driven.
Revised:  We further propose a class of adaptive tests that are computationally tractable and completely data-driven.
Edit intent: clarity
Original:  They achieve nontrivial powers in the contiguous regime and are consistent in the singular regime whenever n p_{n,av} \to\infty.
Revised:  They achieve nontrivial powers in the contiguous regime and consistency in the singular regime whenever n p_{n,av} \to\infty.
Edit intent: clarity
Original:  These tests remain powerful when the alternative becomes a more general stochastic block model with multiple blocks.
Revised:  These tests remain powerful when the alternative becomes a more general stochastic block model with more than two blocks.
Edit intent: clarity
Original:  We demonstrate that classifications solely using the documents' titles can be very good and very close to the classification results using full-text.
Revised:  We demonstrate that classifications solely using the documents' titles can be very good and very close to the classification performance when using the full-text.
Edit intent: clarity
Original: The cryptocurrency market has reached a record of %DIFDELCMD < \54 %%% billion in \91  2017  after months of steady growth.
Revised: The cryptocurrency market has reached a record of %DIFDELCMD < \54 %%% \91 2017 after months of steady growth.
Edit intent: clarity
Original: The cryptocurrency market has reached a record of %DIFDELCMD < \54 %%% billion in \91  2017  after months of steady growth.
Revised: The cryptocurrency market has reached a record of %DIFDELCMD < \54 %%% billion in \91 2017 , after months of steady growth.
Edit intent: fluency
Original:  However, a comprehensive analysis of the whole system has been lackingso far, since most studies have focused on the behaviour of one (Bitcoin) or few cryptocurrencies.
Revised:  However, a comprehensive analysis of the whole system is still lacking, as most studies have focused on the behaviour of one (Bitcoin) or few cryptocurrencies.
Edit intent: clarity
Original:  However, a comprehensive analysis of the whole system has been lackingso far, since most studies have focused on the behaviour of one (Bitcoin) or few cryptocurrencies.
Revised:  However, a comprehensive analysis of the whole system has been lackingso far, since most studies have focused exclusively on the behavior of one (Bitcoin) or few cryptocurrencies.
Edit intent: clarity
Original:  Here  we consider the  entire market and analyse the behaviour of \sim 1, 500 cryptocurrencies introduced since April 2013.
Revised:  Here , we consider the entire market and analyse the behaviour of \sim 1, 500 cryptocurrencies introduced since April 2013.
Edit intent: fluency
Original:  Here  we consider the  entire market and analyse the behaviour of \sim 1, 500 cryptocurrencies introduced since April 2013.
Revised:  Here we consider the history of the entire market and analyse the behaviour of \sim 1, 500 cryptocurrencies introduced since April 2013.
Edit intent: clarity
Original:  Here  we consider the  entire market and analyse the behaviour of \sim 1, 500 cryptocurrencies introduced since April 2013.
Revised:  Here we consider the entire market and analyze the behavior of 1, 500 cryptocurrencies introduced since April 2013.
Edit intent: clarity
Original:  Finally, we adopt an ecological perspective and show that the so-called 'neutral model ' of evolution , despite its simplicity, reproduces a number of key empirical observations .
Revised:  Adopting an ecological perspective and show that the so-called 'neutral model ' of evolution , despite its simplicity, reproduces a number of key empirical observations .
Edit intent: coherence
Original:  Finally, we adopt an ecological perspective and show that the so-called 'neutral model ' of evolution , despite its simplicity, reproduces a number of key empirical observations .
Revised:  Finally, we adopt an ecological perspective , we show that the so-called 'neutral model ' of evolution , despite its simplicity, reproduces a number of key empirical observations .
Edit intent: coherence
Original:  Finally, we adopt an ecological perspective and show that the so-called 'neutral model ' of evolution , despite its simplicity, reproduces a number of key empirical observations .
Revised:  Finally, we adopt an ecological perspective and show that the so-called neutral model of evolution is able to reproduce a number of key empirical observations .
Edit intent: clarity
Original: The cryptocurrency market has reached a record of%DIFDELCMD < \91 %%% \100 billion market capitalization in May 2017, after months of steady growth.
Revised: The cryptocurrency market %DIFDELCMD < \91 %%% \100 billion market capitalization in May 2017, after months of steady growth.
Edit intent: clarity
Original:  Despite its increasing relevance in the financial world, however, a comprehensive analysis of the whole system is still lacking, as most studies have focused exclusively on the behavior of one (Bitcoin) or few cryptocurrencies.
Revised:  Despite its increasing relevance in the financial world, however, a comprehensive analysis of the whole system is still lacking, as most studies have focused exclusively on the behaviour of one (Bitcoin) or few cryptocurrencies.
Edit intent: fluency
Original:  Here, we consider the history of the entire market and analyze the behavior of 1,469 cryptocurrencies introduced since April 2013.
Revised:  Here, we consider the history of the entire market and analyse the behaviour of 1,469 cryptocurrencies introduced since April 2013.
Edit intent: fluency
Original:  Our results shed light on the properties of the cryptocurrency market and establish a first formal link between ecological modeling and the study of this growing system.
Revised:  Our results shed light on the properties of the cryptocurrency market and establish a first formal link between ecological modelling and the study of this growing system.
Edit intent: fluency
Original:  When c=0, it is referred to as the homogenous rank p QTSP.
Edit intent: coherence
Original:  It is shown that the homogeneous fixed-rank QTSP is solvable in pseudopolynomial time and admits  FPTAS for each of the special cases studied, except for the case of matching edge ejection tours.
Revised:  It is shown that fixed-rank QTSP is solvable in pseudopolynomial time and admits FPTAS for each of the special cases studied, except for the case of matching edge ejection tours.
Edit intent: clarity
Original:  Interestingly, optimizing over the matching edge ejection tour neighbourhood is shown to be pseudopolynomial for the homogeneous rank 1 case  , but NP-hard for the adjacent quadratic TSP case  .
Revised:  Interestingly, optimizing over the matching edge ejection tour neighbourhood is shown to be pseudopolynomial for the rank 1 case , but NP-hard for the adjacent quadratic TSP case .
Edit intent: clarity
Original:  in particular, we provide numerical evidence that the two models may show drastically different results, where the model conditioned on the flow velocity provides what may not be the physically relevant solution because of the lack of the appropriate friction terms depending on a master parameter (\alpha) .
Revised:  in particular, we provide numerical evidence that the two models may show drastically different results, where the model conditioned on the flow velocity provides what may not be the physically relevant solution because of the lack of the appropriate friction terms depending on a master parameter .
Edit intent: clarity
Original: We propose a one-dimensional Saint-Venant ( also known as open channelor shallow water) equation model for overland flows including a water input--output source term  .
Revised: We propose a one-dimensional Saint-Venant ( open channel) model overland flows including a water input--output source term .
Edit intent: clarity
Original:  The proposed model extends most extant models by adding more scope depending on friction terms that depend on the rate of water entering or exiting the flow via rechargeand infiltration.
Revised:  The proposed model extends most extant models by adding more scope depending on friction terms that depends on the rate of water entering or exiting the flow via rechargeand infiltration.
Edit intent: fluency
Original:  We also look at a comparison with real-life data.
Revised:  We also provide a comparison with real-life data.
Edit intent: clarity
Original:  We also look at a comparison with real-life data.
Revised:  We also look at a comparison with experimental data.
Edit intent: clarity
Original:  GraphMaps reveals the structural properties of the graph and enables users to interact with the graph in a natural way  .
Revised:  GraphMaps reveals the structural properties of the graph and enables users to explore the graph in a natural way .
Edit intent: clarity
Original:  The available implementation of GraphMaps system is based on an incremental mesh generation technique that does not control the number of zoom levels and the way the nodes appear on different levels .
Revised:  The available implementation of GraphMaps faces many challenges such as the number of zoom levels and the way the nodes appear on different levels .
Edit intent: clarity
Original:  In this paper we develop a technique to construct GraphMaps from any given mesh that is generated from a 2D point set  , and for any given number of zoom levels.
Revised:  In this paper , we develop an algorithmic framework to construct GraphMaps from any given mesh that is generated from a 2D point set , and for any given number of zoom levels.
Edit intent: clarity
Original:  In this paper we develop a technique to construct GraphMaps from any given mesh that is generated from a 2D point set  , and for any given number of zoom levels.
Revised:  In this paper we develop a technique to construct GraphMaps from any given mesh ( generated from a 2D point set , and for any given number of zoom levels.
Edit intent: coherence
Original:  In this paper we develop a technique to construct GraphMaps from any given mesh that is generated from a 2D point set  , and for any given number of zoom levels.
Revised:  In this paper we develop a technique to construct GraphMaps from any given mesh that is generated from a 2D point set ) , and for any given number of zoom levels.
Edit intent: fluency
Original:  We demonstrate our approach introducing competition mesh, which is simple to construct, has  low dilation and high angular resolution.
Revised:  We demonstrate our approach introducing competition mesh, which is simple to construct, has a low dilation and high angular resolution.
Edit intent: fluency
Original:  Finally, we give an algorithm for assigning nodes to zoom levels that minimizes the  number of nodes appearing while the user zooms in to a lower level.
Revised:  We present an algorithm for assigning nodes to zoom levels that minimizes the number of nodes appearing while the user zooms in to a lower level.
Edit intent: clarity
Original:  Finally, we give an algorithm for assigning nodes to zoom levels that minimizes the  number of nodes appearing while the user zooms in to a lower level.
Revised:  Finally, we give an algorithm for assigning nodes to zoom levels that minimizes the number of nodes on visible on the screen while the user zooms in to a lower level.
Edit intent: clarity
Original: It is well-known that neural networks are universal approximators, but that deeper networks tend to be much more efficient than shallow ones.
Revised: It is well-known that neural networks are universal approximators, but that deeper networks tend in practice to be more powerful than shallower ones.
Edit intent: clarity
Original:  We also provide evidence that when the number of hidden layers is increased from 1 to k, the neuron requirement grows exponentially not with n but with n^{1/k}, suggesting that the minimum number of layers required for computational tractability grows only logarithmically with n.
Revised:  We also provide evidence that when the number of hidden layers is increased from 1 to k, the neuron requirement grows exponentially not with n but with n^{1/k}, suggesting that the minimum number of layers required for practical expressibility grows only logarithmically with n.
Edit intent: clarity
Original:  In this paper, we explore novel connections between antimatroids and matchings in a bipartite graph .
Revised:  In this paper, we explore novel connections between antimatroids and matchings in bipartite graphs .
Edit intent: fluency
Original:  We prove that a similar property holds for some special families of \theta-invariant codes such as prefix (bifix) codes, codes with a finite deciphering delay, uniformly synchronous codes and circular codes.
Revised:  We prove that a similar property holds for some special families of \theta-invariant codes such as prefix (bifix) codes, codes with a finite deciphering delay, uniformly synchronized codes and circular codes.
Edit intent: fluency
Original:  We prove that a similar property holds for some special families of \theta-invariant codes such as prefix (bifix) codes, codes with a finite deciphering delay, uniformly synchronized codes and circular codes.
Revised:  We prove that a similar property holds in the framework of some special families of \theta-invariant codes such as prefix (bifix) codes, codes with a finite deciphering delay, uniformly synchronized codes and circular codes.
Edit intent: clarity
Original: The Network Function Virtualization (NFV) paradigm is enabling flexibility and programmability of traditional network services deployed in dedicated hardware, into generic hardware, in form of  Virtual Network Functions (VNFs).
Revised: The Network Function Virtualization (NFV) paradigm is enabling flexibility and programmability of traditional network functions into generic hardware, in form of Virtual Network Functions (VNFs).
Edit intent: clarity
Original: The Network Function Virtualization (NFV) paradigm is enabling flexibility and programmability of traditional network services deployed in dedicated hardware, into generic hardware, in form of  Virtual Network Functions (VNFs).
Revised: The Network Function Virtualization (NFV) paradigm is enabling flexibility and programmability of traditional network services deployed in dedicated hardware, into generic hardware, in form of the so-called Virtual Network Functions (VNFs).
Edit intent: clarity
Original:  Today, cloud service providers are using virtual machines in Data Centers (DCs ) for the instantiation of VNFs in the data center networks.
Revised:  Today, cloud service providers use Virtual Machines (VMs ) for the instantiation of VNFs in the data center networks.
Edit intent: clarity
Original:  We propose using the replications of VNFs to reduce migrations, for DC networks during the peak hours not only in consideration of energy consumptionbut also of   Quality of Service (QoS) which in fact can degrade during migrations.
Revised:  We propose using the replications of VNFs to reduce migrations, for DC networks during the peak hours not only in consideration of energy consumptionbut also of migration Quality of Service (QoS) which in fact can degrade during migrations.
Edit intent: clarity
Original:   We propose a Linear Programming (LP) model to compare two different cases: 1) without replications, by finding a trade-off between the number of migrations and the server load balancing relevant to QoS , and 2) with replications, maximizing the server and network load balancing .
Revised:  We propose a Linear Programming (LP) model to study a trade-off between the number of migrations and the server load balancing relevant to QoS , and 2) with replications, maximizing the server and network load balancing .
Edit intent: clarity
Original:  The results show that replications generally reduce the number of required migrations , and can minimize the utilization of both the DC servers and network links .
Revised:  The results show that , for a given objective, the replications can reduce the number of required migrations , and can minimize the utilization of both the DC servers and network links .
Edit intent: clarity
Original:  The results show that replications generally reduce the number of required migrations , and can minimize the utilization of both the DC servers and network links .
Revised:  The results show that replications generally reduce the number of migrations and can also enable a better server and data center network load balancing .
Edit intent: clarity
Original: This paper explores in details the capabilities of two model reduction techniques - the Spectral Reduced Order Model (Spectral-ROM) and the Proper Generalised Decomposition (PGD) - to numerically solve moisture diffusion problems.
Revised: This paper explores in details the capabilities of two model-reduction techniques - the Spectral Reduced Order Model (Spectral-ROM) and the Proper Generalised Decomposition (PGD) - to numerically solve moisture diffusion problems.
Edit intent: fluency
Original: This paper explores in details the capabilities of two model reduction techniques - the Spectral Reduced Order Model (Spectral-ROM) and the Proper Generalised Decomposition (PGD) - to numerically solve moisture diffusion problems.
Revised: This paper explores in details the capabilities of two model reduction techniques - the Spectral Reduced-Order Model (Spectral-ROM) and the Proper Generalised Decomposition (PGD) - to numerically solve moisture diffusion problems.
Edit intent: fluency
Original:  Results have highlighted that both numerical techniques provide accurate solution and enable to reduce significantly the order of the model , allowing a fast computation of physical phenomena such as the moisture buffer effects that occur in porous building materials.
Revised:  Results have highlighted that both methods provide accurate solutions and enable to reduce significantly the order of the model , allowing a fast computation of physical phenomena such as the moisture buffer effects that occur in porous building materials.
Edit intent: clarity
Original:  In addition to learning node embeddings, we also model a directed edge as a learnable function of node embeddings , which enable us to learn more concise representations that better preserve the graph structure.
Revised:  In addition to learning node embeddings, we also model a directed edge as a function of node embeddings , which enable us to learn more concise representations that better preserve the graph structure.
Edit intent: clarity
Original:  We perform both intrinsic and extrinsic evaluations of our method , presenting results on a variety of graphs from social networks,  protein interactions, and e-commerce.
Revised:  We evaluate our method on a variety of graphs from social networks, protein interactions, and e-commerce.
Edit intent: clarity
Original:  Our results show that learning joint representations learned through our method significantly improves state-of-the-art on link prediction tasks, showing error reductions of up to 66\% and 16 \%, respectively, on directed and undirected graphs , while using representations with 8 times less dimensions per  node.
Revised:  Our results show that learning joint representations learned through our method significantly improves state-of-the-art on link prediction tasks, showing error reductions of up to 66\% and 16 \%, respectively, on directed and undirected graphs , while using representations with 8 times less dimensions per space to represent each node.
Edit intent: clarity
Original: Unlike previous works that utilize random walks to learn structure-preserving graph embeddings, we (1) explicitly model an edge as a function of node embeddings that we jointly learn with the node embeddings , and we (2) propose a novel objective which we callgraph likelihood , defined in terms of the random walk statistics .
Revised: Unlike previous works that utilize random walks to learn structure-preserving graph embeddings, we (1) explicitly model an edge as a function of node embeddings , and we (2) propose a novel objective which we callgraph likelihood , defined in terms of the random walk statistics .
Edit intent: clarity
Original: Unlike previous works that utilize random walks to learn structure-preserving graph embeddings, we (1) explicitly model an edge as a function of node embeddings that we jointly learn with the node embeddings , and we (2) propose a novel objective which we callgraph likelihood , defined in terms of the random walk statistics .
Revised: Unlike previous works that utilize random walks to learn structure-preserving graph embeddings, we (1) explicitly model an edge as a function of node embeddings that we jointly learn with the node embeddings , and we (2) propose a novel objective graph likelihood , defined in terms of the random walk statistics .
Edit intent: clarity
Original: Unlike previous works that utilize random walks to learn structure-preserving graph embeddings, we (1) explicitly model an edge as a function of node embeddings that we jointly learn with the node embeddings , and we (2) propose a novel objective which we callgraph likelihood , defined in terms of the random walk statistics .
Revised: Unlike previous works that utilize random walks to learn structure-preserving graph embeddings, we (1) explicitly model an edge as a function of node embeddings that we jointly learn with the node embeddings , and we (2) propose a novel objective which we call , defined in terms of the random walk statistics .
Edit intent: clarity