wanyu/IteraTeR_v2 huggingface dataset:
Original:  Straightforward choices of the underlying basis, such as piecewise multilinear finite elements on uniform tensor product grids, lead to the well-known matrix ill-conditioning of discrete operators.
Revised:  Standard choices of the underlying basis, such as piecewise multilinear finite elements on uniform tensor product grids, lead to the well-known matrix ill-conditioning of discrete operators.
Edit intent: fluency
Original:  Straightforward choices of the underlying basis, such as piecewise multilinear finite elements on uniform tensor product grids, lead to the well-known matrix ill-conditioning of discrete operators.
Revised:  Straightforward choices of the underlying basis, such as piecewise multilinear finite elements on uniform tensor product grids, entail the well-known matrix ill-conditioning of discrete operators.
Edit intent: clarity
Original:  We demonstrate that for low-rank representations, the use of tensor structure itself additionally leads to representation ill-conditioning, a new effect specific to computations in tensor networks.
Revised:  We demonstrate that for low-rank representations, the use of tensor structure itself additionally introduces representation ill-conditioning, a new effect specific to computations in tensor networks.
Edit intent: clarity
Original:  By additionally eliminating redundancies , we obtain a reduced-rank decomposition that is free of both matrix and representation ill-conditioning.
Revised:  By additionally eliminating redundancies , we obtain reduced-rank decomposition that is free of both matrix and representation ill-conditioning.
Edit intent: fluency
Original:  By additionally eliminating redundancies , we obtain a reduced-rank decomposition that is free of both matrix and representation ill-conditioning.
Revised:  By additionally eliminating redundancies , we obtain a reduced-rank decompositions that are free of both matrix and representation ill-conditioning.
Edit intent: fluency
Original:  We investigate a simple alternative technique that can provide information about the 3D shapes of cells in a tissue from non-consecutive 2D slices.
Revised:  We investigate a simple alternative technique to extract information about the 3D shapes of cells in a tissue from non-consecutive 2D slices.
Edit intent: clarity
Original:  Our technique uses a 3D cell vertex model to construct a mapping between the 3D properties of interest and the distribution of shapes observed in  2D slices.
Revised:  Our technique uses a 3D shapes in the tissue with the distribution of 2D shapes observed in 2D slices.
Edit intent: clarity
Original:   We analyze the errors that arise in the estimation of a 3D shape index from 2D imagery , and find that typically only a few dozen cells in 2D imagery are required to reduce uncertainty in the mean 3D shape index below 2\\%DIF < . This framework could be naturally extended to estimate additional 3D %DIF > . This framework could be naturally extended to estimate additional 3D geometric features and quantify their uncertainty in other materials.
Revised:  We analyze the errors that arise in the estimation of the mean 3D shape index from 2D imagery , and find that typically only a few dozen cells in 2D imagery are required to reduce uncertainty in the mean 3D shape index below 2\\%DIF < . This framework could be naturally extended to estimate additional 3D %DIF > . This framework could be naturally extended to estimate additional 3D geometric features and quantify their uncertainty in other materials.
Edit intent: fluency
Original:   We analyze the errors that arise in the estimation of a 3D shape index from 2D imagery , and find that typically only a few dozen cells in 2D imagery are required to reduce uncertainty in the mean 3D shape index below 2\\%DIF < . This framework could be naturally extended to estimate additional 3D %DIF > . This framework could be naturally extended to estimate additional 3D geometric features and quantify their uncertainty in other materials.
Revised:  We analyze the errors that arise in the estimation of a 3D shape index from 2D imagery and find that typically only a few dozen cells in 2D imagery are required to reduce uncertainty in the mean 3D shape index below 2\\%DIF < . This framework could be naturally extended to estimate additional 3D %DIF > . This framework could be naturally extended to estimate additional 3D geometric features and quantify their uncertainty in other materials.
Edit intent: fluency
Original:   We analyze the errors that arise in the estimation of a 3D shape index from 2D imagery , and find that typically only a few dozen cells in 2D imagery are required to reduce uncertainty in the mean 3D shape index below 2\\%DIF < . This framework could be naturally extended to estimate additional 3D %DIF > . This framework could be naturally extended to estimate additional 3D geometric features and quantify their uncertainty in other materials.
Revised:  We analyze the errors that arise in the estimation of a 3D shape index from 2D imagery , and find that typically only a few dozen cells in 2D imagery are required to reduce uncertainty below 2\\%DIF < . This framework could be naturally extended to estimate additional 3D %DIF > . This framework could be naturally extended to estimate additional 3D geometric features and quantify their uncertainty in other materials.
Edit intent: clarity
Original:   We analyze the errors that arise in the estimation of a 3D shape index from 2D imagery , and find that typically only a few dozen cells in 2D imagery are required to reduce uncertainty in the mean 3D shape index below 2\\%DIF < . This framework could be naturally extended to estimate additional 3D %DIF > . This framework could be naturally extended to estimate additional 3D geometric features and quantify their uncertainty in other materials.
Revised:  We analyze the errors that arise in the estimation of a 3D shape index from 2D imagery , and find that typically only a few dozen cells in 2D imagery are required to reduce uncertainty in the mean 3D shape index below 2\\%DIF < . This framework could be naturally extended to estimate %DIF > . This framework could be naturally extended to estimate additional 3D geometric features and quantify their uncertainty in other materials.
Edit intent: fluency
Original:  To evaluate our proposed method, we perform computer simulations for three typical chemical reactions and demonstrate that the results obtained with our method is consistent with the simulation results.
Revised:  To evaluate our proposed method, we perform computer simulations for three typical chemical reactions and demonstrate that the results obtained with our method are consistent with the simulation results.
Edit intent: fluency
Original: Steady-state is an essential concept in reaction networks.
Revised: Steady state is an essential concept in reaction networks.
Edit intent: fluency
Original:  Its properties, number and stability , reflect fundamental characteristics of several biological phenomena such as molecular switches, cell differentiation, and memory .
Revised:  Its stability reflects fundamental characteristics of several biological phenomena such as molecular switches, cell differentiation, and memory .
Edit intent: coherence
Original:  Its properties, number and stability , reflect fundamental characteristics of several biological phenomena such as molecular switches, cell differentiation, and memory .
Revised:  Its properties, number and stability , reflect fundamental characteristics of several biological phenomena such as cellular signal transduction and gene expression .
Edit intent: clarity
Original:  Although several methods have been proposed to detect and analyze the stability of steady-states for deterministic models, these methods cannot be applied to stochastic reaction networks.
Revised:  Although several methods have been proposed to detect and analyze the stability of steady states for deterministic models, these methods cannot be applied to stochastic reaction networks.
Edit intent: fluency
Original: The termination analysis of linear loops plays a key role in several areas of computer science, including program verification and abstract interpretation.
Revised: Termination analysis of linear loops plays a key role in several areas of computer science, including program verification and abstract interpretation.
Edit intent: fluency
Original: Sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis  and sparse canonical correlation analysis.
Revised: The sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis and sparse canonical correlation analysis.
Edit intent: fluency
Original: Sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis  and sparse canonical correlation analysis.
Revised: Sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis , and sparse canonical correlation analysis.
Edit intent: fluency
Original:  In addition, we provide  theoretical analysis for the proposed decomposition algorithm.
Revised:  In addition, we provide some theoretical analysis for the proposed decomposition algorithm.
Edit intent: coherence
Original:  Extensive experiments on both real-world and synthetic data sets have shown that the proposed method achieves state-of-the-art performance in terms of accuracy.
Revised:  Extensive experiments on both real-world and synthetic data sets have shown that the proposed method significantly and consistently outperforms existing solutions in term of accuracy.
Edit intent: clarity
Original:  The approximation is easily implementable, performing spatial discretization by the spectral Galerkin method and temporal discretization by a kind of nonlinearity-tamed accelerated exponential integrator scheme.
Revised:  The approximation is easily implementable, performing spatial discretization by a spectral Galerkin method and temporal discretization by a kind of nonlinearity-tamed accelerated exponential integrator scheme.
Edit intent: fluency
Original:  The approximation is easily implementable, performing  spatial discretization by a spectral Galerkin method and  temporal discretization by a kind of nonlinearity-tamed accelerated exponential integrator scheme.
Revised:  The approximation is easily implementable, performing the spatial discretization by a spectral Galerkin method and temporal discretization by a kind of nonlinearity-tamed accelerated exponential integrator scheme.
Edit intent: fluency
Original:  The approximation is easily implementable, performing  spatial discretization by a spectral Galerkin method and  temporal discretization by a kind of nonlinearity-tamed accelerated exponential integrator scheme.
Revised:  The approximation is easily implementable, performing spatial discretization by a spectral Galerkin method and the temporal discretization by a kind of nonlinearity-tamed accelerated exponential integrator scheme.
Edit intent: fluency
Original:  Error bounds in a strong sense are analyzed for both the spa- tial semi-discretization and the spatio-temporal full discretization, with convergence rates in both space and time explicitly identified.
Revised:  Error bounds in a strong sense are analyzed for both the spatial semi-discretization and the spatio-temporal full discretization, with convergence rates in both space and time explicitly identified.
Edit intent: fluency
Original:  It turns out that the  convergence rate of the new scheme is, in the temporal direction, twice as high as existing ones in the literature  .
Revised:  It turns out that the obtained convergence rate of the new scheme is, in the temporal direction, twice as high as existing ones in the literature .
Edit intent: clarity
Original:  In our work we implement Maximal Marginal Relevance [MMR] based multi-document text summarization and propose a na\"ive model to change tone of the summarization by setting a bias to specific set of words and restricting other words in the summarization output.
Revised:  In our work we implement Maximal Marginal Relevance [MMR] based multi-document text summarization and propose a naive model to change tone of the summarization by setting a bias to specific set of words and restricting other words in the summarization output.
Edit intent: fluency
Original:  To fully account for the increasing trends in life expectancies, we implemented a custom extrapolation model for mortality rates, based on deep learning techniques  .
Revised:  To fully account for the increasing trends in life expectancies, we propose mortality rate model based on deep learning techniques .
Edit intent: clarity
Original:  The population ageing due to the  postponement of death until advanced old age often occurs with the compression of morbidity, and thus will not, perforce, intrinsically strain healthcare costs.
Revised:  The population ageing due to the observed postponement of death until advanced old age often occurs with the compression of morbidity, and thus will not, perforce, intrinsically strain healthcare costs.
Edit intent: clarity
Original:  The population ageing due to the  postponement of death until advanced old age often occurs with the compression of morbidity, and thus will not, perforce, intrinsically strain healthcare costs.
Revised:  The population ageing due to the postponement of death until senectitude often occurs with the compression of morbidity, and thus will not, perforce, intrinsically strain healthcare costs.
Edit intent: clarity
Original: Obtaining the desired dataset is still a prime challenge faced by researchers while analysing Online Social Network (OSN) sites.
Revised: Obtaining the desired dataset is still a prime challenge faced by researchers while analyzing Online Social Network (OSN) sites.
Edit intent: fluency
Original:  To the best of our knowledge, the present work is the first attempt towards providing the detailed description of crawler design and gender-based information revealing behaviour of Facebook users .
Revised:  To the best of our knowledge, the present work is the first attempt towards providing the detailed description of crawler design for the Facebook website .
Edit intent: clarity
Original: In this paper we analyze the Beta-Bernoulli process from Bayesian nonparametrics using the framework of algebraic effects from programming language theory  .
Revised: In this paper we use the framework of algebraic effects from programming language theory .
Edit intent: coherence
Original:  Our analysis reveals the importance of abstract data types, and two types of program equations, called commutativity and discardability , in the study of the Beta-Bernoulli process .
Revised:  Our analysis reveals the importance of abstract data types, and two types of program equations, called commutativity and discardability .
Edit intent: clarity
Original:  Our analysis has a potential for being generalized to other Bayesian nonparametric models and helping understand these models from the perspective of programming.
Revised:  Our analysis has a potential for being generalized to other stochastic processes relevant to Bayesian modelling, yielding new understanding of these processes from the perspective of programming.
Edit intent: clarity
Original:  It then applies existing embedding methods on the coarsest graph and refines the embeddings to the original graph through a novel graph convolution neural network that it learns.
Revised:  It then applies existing embedding methods on the coarsest graph and refines the embeddings to the original graph through a graph convolution neural network that it learns.
Edit intent: clarity
Original:  Experimental results on five large-scale datasets demonstrate that MILE significantly boosts the speed (order of magnitude) of graph embedding while also often generating embeddings of better quality  for the task of node classification.
Revised:  Experimental results on five large-scale datasets demonstrate that MILE significantly boosts the speed (order of magnitude) of graph embedding while generating embeddings of better quality for the task of node classification.
Edit intent: clarity
Original:  Experimental results on five large-scale datasets demonstrate that MILE significantly boosts the speed (order of magnitude) of graph embedding while also often generating embeddings of better quality  for the task of node classification.
Revised:  Experimental results on five large-scale datasets demonstrate that MILE significantly boosts the speed (order of magnitude) of graph embedding while also often generating embeddings of better quality , for the task of node classification.
Edit intent: fluency
Original: We propose a new local community detection algorithm , which finds communities by identifying borderlines between them using boundary nodes.
Revised: We propose a new local community detection algorithm that finds communities by identifying borderlines between them using boundary nodes.
Edit intent: coherence
Original:  We apply a modified version of label propagation for community detection that uses the number of common neighbors for deciding community label of each node.
Revised:  Our method performs label propagation for community detection that uses the number of common neighbors for deciding community label of each node.
Edit intent: clarity
Original:  It is possible to scale the algorithm in parallel systems .
Revised:  The algorithm has a distributed nature and can be used on large networks in a parallel fashion .
Edit intent: clarity
Original: Light-to-Camera Communication (LCC) has emerged as a new wireless communication technology with great potential to benefit a broad range of applications.
Revised: Light-to-Camera Communications (LCC) has emerged as a new wireless communication technology with great potential to benefit a broad range of applications.
Edit intent: fluency
Original: Light-to-Camera Communication (LCC) has emerged as a new wireless communication technology with great potential to benefit a broad range of applications.
Revised: Light-to-Camera Communication (LCC) have emerged as a new wireless communication technology with great potential to benefit a broad range of applications.
Edit intent: fluency
Original:  However, the existing LCC systems either require the camera directly facing to the lights or can only communicate over a single link, resulting in low throughputs and being fragile to ambient illuminant interference.
Revised:  However, the existing LCC systems either require cameras directly facing to the lights or can only communicate over a single link, resulting in low throughputs and being fragile to ambient illuminant interference.
Edit intent: coherence
Original:  The experimental results show that the system throughput reaches 4.5 Kbps on iPhone 6s  .
Revised:  The experimental results show that the system throughput reaches 4.5 kbps on iPhone 6s .
Edit intent: fluency
Original: Modern data-center applications frequently exhibit one-to-many communication patterns and, at the same time, require the fabric to provide sub-millisecond latencies and high throughput.
Revised: Modern data-center applications frequently exhibit one-to-many communication patterns and, at the same time, require sub-millisecond latencies and high throughput.
Edit intent: clarity
Original:  Native IP multicast can achieve these requirements .
Revised:  IP multicast can achieve these requirements .
Edit intent: clarity
Original:  Tenants must, thus, either add custom support for multicast in their applications or rely on services like overlay multicast, both of which are unicast-based approaches that impose their own overhead on throughput and  CPU utilization, leading to higher and unpredictable latencies.
Revised:  Tenants must, thus, either add custom support for multicast in their applications , imposing overhead on throughput and CPU utilization, leading to higher and unpredictable latencies.
Edit intent: coherence
Original:  Tenants must, thus, either add custom support for multicast in their applications or rely on services like overlay multicast, both of which are unicast-based approaches that impose their own overhead on throughput and  CPU utilization, leading to higher and unpredictable latencies.
Revised:  Tenants must, thus, either add custom support for multicast in their applications or rely on services like overlay multicast, both of which are unicast-based approaches that impose their own overhead on throughput and CPU utilization, with higher and unpredictable latencies.
Edit intent: clarity
Original:  In this paper, we present Elmo , a mechanism for native multicast in switches which takes advantage of the unique characteristics of data-center topologies and workloads.
Revised:  Elmo scales network multicast by taking advantage of emerging programmable switches and the unique characteristics of data-center topologies and workloads.
Edit intent: clarity
Original:  Specifically , the symmetric topology and short paths in a data center and the tendency of virtual machines (VMs) from individual tenants to cluster in small portions of the topology .
Revised:  Specifically , the symmetric topology and short paths in a data center .
Edit intent: clarity
Original:  Elmo encodes multicast group information inside packets themselves, significantly reducing the need to store multicast group information in individual network switches.
Revised:  Elmo encodes multicast group information inside packets themselves, reducing the need to store multicast group information in individual network switches.
Edit intent: clarity
Original:  Elmo encodes multicast group information inside packets themselves, significantly reducing the need to store multicast group information in individual network switches.
Revised:  Elmo encodes multicast group information inside packets themselves, significantly reducing the need to store the same information in network switches.
Edit intent: clarity
Original:  In a  data-center topology with 27K hosts, Elmo supports a million multicast groups using a 325-byte packet header while requiring as few as 1.1K multicast flow-table entries on average in leaf switches  with a traffic overhead as low as 5\%  .
Revised:  In a data-center topology with 27K hosts, Elmo supports a million multicast groups using a 325-byte packet header , requiring as few as 1.1K multicast flow-table entries on average in leaf switches with a traffic overhead as low as 5\% .
Edit intent: clarity
Original:  In a  data-center topology with 27K hosts, Elmo supports a million multicast groups using a 325-byte packet header while requiring as few as 1.1K multicast flow-table entries on average in leaf switches  with a traffic overhead as low as 5\%  .
Revised:  In a data-center topology with 27K hosts, Elmo supports a million multicast groups using a 325-byte packet header while requiring as few as 1.1K multicast flow-table entries on average in leaf switches , with a traffic overhead as low as 5\% .
Edit intent: fluency
Original:  We outperform strong single and multi-task baselines and achieve a new state-of-the-art for aspect- and topic-based sentiment analysis.
Revised:  We outperform strong single and multi-task baselines and achieve a new state-of-the-art for topic-based sentiment analysis.
Edit intent: clarity
Original:  Specifically, we present trends in DNN architectures and the resulting implications on parallelization strategies.
Revised:  We present trends in DNN architectures and the resulting implications on parallelization strategies.
Edit intent: coherence
Original:  We discuss the different types of concurrency in DNNs ;
Revised:  We then review and model the different types of concurrency in DNNs ;
Edit intent: clarity