wanyu/IteraTeR_v2 huggingface dataset:
Original:  Depending on the initial multi-product state, the expectation values may be either easy to compute (the required number of operations scales polynomially with the particle number) or hard to compute (at least as hard as a permanent of a matrix).
Revised:  Depending on the initial multi-particle product state, the expectation values may be either easy to compute (the required number of operations scales polynomially with the particle number) or hard to compute (at least as hard as a permanent of a matrix).
Edit intent: fluency
Original: A deep neural network is a parameterization of a multi-layer mapping of signals in terms of many alternatively arranged linear and nonlinear transformations.
Revised: A deep neural network is a parametrization of a multilayer mapping of signals in terms of many alternatively arranged linear and nonlinear transformations.
Edit intent: clarity
Original:  The linear transformations, which are generally used in the fully-connected as well as convolutional layers, contain most of the variational parameters that are trained and stored.
Revised:  The linear transformations, which are generally used in the fully connected as well as convolutional layers, contain most of the variational parameters that are trained and stored.
Edit intent: fluency
Original:  Compressing a deep neural network to reduce its number of variational parameters but not its prediction power is an important but challenging problem towards the establishment of an optimized scheme in training efficiently these parameters and in lowering the risk of overfitting.
Revised:  Compressing a deep neural network to reduce its number of variational parameters but not its prediction power is an important but challenging problem toward the establishment of an optimized scheme in training efficiently these parameters and in lowering the risk of overfitting.
Edit intent: fluency
Original:  We have tested this approach in five main neural networks, including FC2, LeNet-5, VGG, ResNet, and DenseNet on two widely used datasets, namely MNIST and CIFAR-10, and found that this MPO representation indeed sets up a faithful and efficient mapping between input and output signals, which can keep or even improve the prediction accuracy with  dramatically reduced number of parameters  .
Revised:  We have tested this approach in five typical neural networks, including FC2, LeNet-5, VGG, ResNet, and DenseNet on two widely used datasets, namely MNIST and CIFAR-10, and found that this MPO representation indeed sets up a faithful and efficient mapping between input and output signals, which can keep or even improve the prediction accuracy with dramatically reduced number of parameters .
Edit intent: clarity
Original:  We have tested this approach in five main neural networks, including FC2, LeNet-5, VGG, ResNet, and DenseNet on two widely used datasets, namely MNIST and CIFAR-10, and found that this MPO representation indeed sets up a faithful and efficient mapping between input and output signals, which can keep or even improve the prediction accuracy with  dramatically reduced number of parameters  .
Revised:  We have tested this approach in five main neural networks, including FC2, LeNet-5, VGG, ResNet, and DenseNet on two widely used data sets, namely, MNIST and CIFAR-10, and found that this MPO representation indeed sets up a faithful and efficient mapping between input and output signals, which can keep or even improve the prediction accuracy with dramatically reduced number of parameters .
Edit intent: clarity
Original:  We have tested this approach in five main neural networks, including FC2, LeNet-5, VGG, ResNet, and DenseNet on two widely used datasets, namely MNIST and CIFAR-10, and found that this MPO representation indeed sets up a faithful and efficient mapping between input and output signals, which can keep or even improve the prediction accuracy with  dramatically reduced number of parameters  .
Revised:  We have tested this approach in five main neural networks, including FC2, LeNet-5, VGG, ResNet, and DenseNet on two widely used datasets, namely MNIST and CIFAR-10, and found that this MPO representation indeed sets up a faithful and efficient mapping between input and output signals, which can keep or even improve the prediction accuracy with a dramatically reduced number of parameters .
Edit intent: fluency
Original: QUIC is a secure transport protocol and aims to improve the performance of HTTPS traffic.
Revised: QUIC is a secure transport protocol that improves the performance of HTTPS traffic.
Edit intent: clarity
Original:  However, an initial handshake enforcing strict validation of the client's source address still requires two round-trips.
Revised:  However, an initial handshake enforcing strict validation of the client's source address requires two round-trips.
Edit intent: clarity
Original:  QUIC provides address validation tokens which allow saving a round-trip during the address validation upon repeat connections.
Edit intent: coherence
Original:  In this work, we extend the existing address validation mechanism by  out-of-band validation tokens .
Revised:  In this work, we extend the existing address validation mechanism by an out-of-band validation tokens .
Edit intent: fluency
Original:  The proposed tokens allow sharing address validation between the QUIC server and trusted entities issuing these tokens.
Revised:  The proposed token allows sharing an address validation between the QUIC server and trusted entities issuing these tokens.
Edit intent: clarity
Original:  This practice allows saving a round-trip time for the address validation also during initial connection establishments .
Revised:  This saves a round-trip time for the address validation also during initial connection establishments .
Edit intent: clarity
Original:  This practice allows saving a round-trip time for the address validation also during initial connection establishments .
Revised:  This practice allows saving a round-trip time for the address validation .
Edit intent: clarity
Original:  Furthermore, we introduce distribution mechanisms for these tokens using DNS resolvers and QUIC connections to other hostnames.
Revised:  Furthermore, we propose distribution mechanisms for these tokens using DNS resolvers and QUIC connections to other hostnames.
Edit intent: clarity
Original:  We evaluate our proposal based on the duration of QUIC's connection establishment and find that it can save up to 50\% of the delay overhead of an initial handshake.
Revised:  Our proposal can save up to 50\% of the delay overhead of an initial handshake.
Edit intent: clarity
Original:  Furthermore, our  results indicate that 363.6ms in total can be saved of all connections that are required to retrieve an average website .
Revised:  Furthermore, our analytical results indicate that 363.6ms in total can be saved of all connections that are required to retrieve an average website .
Edit intent: clarity
Original:  Furthermore, our  results indicate that 363.6ms in total can be saved of all connections that are required to retrieve an average website .
Revised:  Furthermore, our results indicate that 363.6ms in total can be saved for all connections required to retrieve an average website .
Edit intent: clarity
Original:  We rigorously prove that ParamRLS-F efficiently tunes RLS_k for Ridge* for any \kappa while ParamRLS-T requires at least a quadratic one .
Revised:  We rigorously prove that ParamRLS-F efficiently tunes RLS_k for Ridge* for any \kappa while ParamRLS-T requires at least quadratic \kappa .
Edit intent: clarity
Original:  In this study, we evaluate all errors in computing  complex moments.
Revised:  In this study, we evaluate all errors in computing the complex moments.
Edit intent: fluency
Original:  Each quadrature point gives rise to a linear system  and its structure enables us to develop an efficient technique to verify the approximate solution.
Revised:  Each quadrature point gives rise to a linear system , and its structure enables us to develop an efficient technique to verify the approximate solution.
Edit intent: fluency
Original:  Numerical experiments show that the proposed method outperforms a standard method and infer that the proposed methods is potentially efficient in parallel.
Revised:  Numerical experiments show that the proposed method outperforms a standard method and infer that the proposed method is potentially efficient in parallel.
Edit intent: fluency
Original: Journal ranking, that is, placing journals within their respective fields, is an important research evaluation tool.
Revised: Journal ranking, that is, placing journals within their respective fields, means an important research evaluation tool.
Edit intent: clarity
Original: Journal ranking , that is , placing journals within their respective fields, means an important research evaluation tool .
Revised: Journal ranking is becoming more important in assessing the quality of academic research .
Edit intent: clarity
Original:  This contribution reinforces that scientometrics cannot be entirely based on the use of bibliometric indices.
Edit intent: coherence
Original: Solar Renewable Energy Certificate Markets (SREC ) markets are a relatively novel market-based system to incentivize the production of energy from solar means.
Revised: SREC markets are a relatively novel market-based system to incentivize the production of energy from solar means.
Edit intent: clarity
Original:  In this work, we formulate a stochastic control problem for generating and trading in SREC markets for a regulated firm's perspective accounting for generation and trading costs, and the impact both have on prices.
Revised:  In this work, we formulate a stochastic control problem for generating and trading in SREC markets from a regulated firm's perspective accounting for generation and trading costs, and the impact both have on prices.
Edit intent: fluency
Original:  In this work, we formulate a stochastic control problem for generating and trading in SREC markets for a regulated firm's perspective accounting for generation and trading costs, and the impact both have on prices.
Revised:  In this work, we formulate a stochastic control problem for generating and trading in SREC markets for a regulated firm's perspective accounting for generation and trading costs, the impact both have on prices.
Edit intent: fluency
Original:  In this work, we introduce the notion of temporal walks for learning dynamic embeddings from temporal networks.
Revised:  In this work, we propose using the notion of temporal walks for learning dynamic embeddings from temporal networks.
Edit intent: clarity
Original:  In this work, we introduce the notion of temporal walks for learning dynamic embeddings from temporal networks.
Revised:  In this work, we introduce the notion of temporal walks for learning dynamic embeddings from temporal networks.
Edit intent: fluency
Original:  The experiments demonstrate the effectiveness of this class of embedding methods for prediction in temporal networks .
Revised:  Finally, the experiments demonstrate the effectiveness of this class of embedding methods for prediction in temporal networks .
Edit intent: coherence
Original:  However,  there are few public UGC datasets available for video compression and quality assessment research.
Revised:  However, there are few public UGC datasets available for research.
Edit intent: clarity
Original:  The method is realized by the two stage process in which the approximate solution is generated by existing numerical libraries and then is verified with a moderate computational time.
Revised:  The method is realized by a two-stage process in which the approximate solution is generated by existing numerical libraries and then is verified with a moderate computational time.
Edit intent: fluency
Original:  The procedure indicates that one of exact eigenvalue is located in an interval.
Revised:  The procedure returns intervals containing one exact eigenvalue in each interval.
Edit intent: clarity
Original:  Test calculations were carried out for organic device materials  and the verification method confirms that all the exact eigenvalues are well separated in the obtained intervals.
Revised:  Test calculations were carried out for organic device materials , and the verification method confirms that all the exact eigenvalues are well separated in the obtained intervals.
Edit intent: fluency
Original:  The verification method will be integrated into EigenKernel URL a middleware for the various parallel solvers in the generalized eigenvalue problem.
Revised:  The verification method will be integrated into EigenKernel URL a middleware for various parallel solvers in the generalized eigenvalue problem.
Edit intent: fluency
Original:  The verification method will be integrated into EigenKernel URL a middleware for the various parallel solvers in the generalized eigenvalue problem.
Revised:  The verification method will be integrated into EigenKernel URL a middleware for the various parallel solvers for the generalized eigenvalue problem.
Edit intent: fluency
Original:  Such an a posteriori verification method will be important in the future computational science.
Revised:  Such an a posteriori verification method will be important in future computational science.
Edit intent: fluency
Original: An a posteriori verification method is proposed for the generalized real-symmetric eigenvalue problems and is applied to densely clustered eigenvalue problems in large-scale electronic state calculations.
Revised: An a posteriori verification method is proposed for the generalized real-symmetric eigenvalue problem and is applied to densely clustered eigenvalue problems in large-scale electronic state calculations.
Edit intent: fluency
Original:  The  method is realized by a two-stage process in which the approximate solution is generated by existing numerical libraries and then is verified with a moderate computational time.
Revised:  The proposed method is realized by a two-stage process in which the approximate solution is generated by existing numerical libraries and then is verified with a moderate computational time.
Edit intent: clarity
Original:  The  method is realized by a two-stage process in which the approximate solution is generated by existing numerical libraries and then is verified with a moderate computational time.
Revised:  The method is realized by a two-stage process in which the approximate solution is computed by existing numerical libraries and then is verified with a moderate computational time.
Edit intent: clarity
Original:  The  method is realized by a two-stage process in which the approximate solution is generated by existing numerical libraries and then is verified with a moderate computational time.
Revised:  The method is realized by a two-stage process in which the approximate solution is generated by existing numerical libraries and is then verified in a moderate computational time.
Edit intent: clarity
Original:  Test calculations were carried out for organic device materials, and the verification method confirms that all the exact eigenvalues are well separated in the obtained intervals.
Revised:  Test calculations were carried out for organic device materials, and the verification method confirms that all exact eigenvalues are well separated in the obtained intervals.
Edit intent: fluency
Original:  The verification method will be integrated into EigenKernel URL a middleware for various parallel solvers for the generalized eigenvalue problem.
Revised:  This verification method will be integrated into EigenKernel URL a middleware for various parallel solvers for the generalized eigenvalue problem.
Edit intent: fluency
Original:  The verification method will be integrated into EigenKernel URL a middleware for various parallel solvers for the generalized eigenvalue problem.
Revised:  The verification method will be integrated into EigenKernel URL which is middleware for various parallel solvers for the generalized eigenvalue problem.
Edit intent: clarity
Original:  We shed light on classic measures by examining them against a set of rationality postulates , and propose a measure that is both rationale and tractable for the general class of denial constraints  .
Revised:  We shed light on classic measures by examining them against a set of rationality postulates , and propose a measure that is both rational and tractable for the general class of denial constraints .
Edit intent: fluency
Original: How should a cleaning system measure the amount of inconsistency in the database  ? Proper measures are important for quantifying the progress made in the cleaning process relative to the remaining effort and resources required.
Revised: How should we quantify the amount of inconsistency in the database ? Proper measures are important for quantifying the progress made in the cleaning process relative to the remaining effort and resources required.
Edit intent: clarity
Original: How should we quantify the amount of inconsistency in the database, when consistency is defined in terms of a given set of integrity constraintsor rules ? Proper measures are important for various tasks, such as progress indication and action prioritization in cleaning systems, and reliability estimation for new datasets.
Revised: How should we quantify the inconsistency of a database that violates integrity constraints ? Proper measures are important for various tasks, such as progress indication and action prioritization in cleaning systems, and reliability estimation for new datasets.
Edit intent: clarity
Original:  To choose an appropriate inconsistency measure for a specific use case , it is important to identify the desired properties of the application and understand which of these is guaranteed or , at least , expected in practice.
Revised:  To choose an appropriate inconsistency measure , it is important to identify the desired properties of the application and understand which of these is guaranteed or , at least , expected in practice.
Edit intent: clarity
Original:  To choose an appropriate inconsistency measure for a specific use case , it is important to identify the desired properties of the application and understand which of these is guaranteed or , at least , expected in practice.
Revised:  To choose an appropriate inconsistency measure for a specific use case , it is important to identify the desired properties in the application and understand which of these is guaranteed or , at least , expected in practice.
Edit intent: clarity
Original:  To choose an appropriate inconsistency measure for a specific use case , it is important to identify the desired properties of the application and understand which of these is guaranteed or , at least , expected in practice.
Revised:  To choose an appropriate inconsistency measure for a specific use case , it is important to identify the desired properties of the application and understand which of these is guaranteed or at least expected in practice.
Edit intent: fluency
Original:  For example, in some use cases , the inconsistency should reduce if constraints are eliminated;
Revised:  For example, in some use cases the inconsistency should reduce if constraints are eliminated;
Edit intent: fluency
Original:  in others , it should be stable and avoid jitters and jumps in reaction to small changes in the database.
Revised:  in others it should be stable and avoid jitters and jumps in reaction to small changes in the database.
Edit intent: fluency
Original:  Building on past research on inconsistency measures for knowledge bases, we embark on a systematic investigation of important properties for inconsistency measures.
Revised:  We embark on a systematic investigation of important properties for inconsistency measures.
Edit intent: clarity
Original:  Building on past research on inconsistency measures for knowledge bases, we embark on a systematic investigation of important properties for inconsistency measures.
Revised:  Building on past research on inconsistency measures for knowledge bases, we embark on a systematic investigation of properties for database inconsistency measures.
Edit intent: clarity
Original:  We investigate a collection of basic measures that have been proposed in the past in both the Knowledge Representation and Database communities, analyze their theoretical properties, and empirically observe their behavior in an experimental study.
Revised:  We investigate a collection of basic measures that have been proposed in the past in both the Knowledge Representation and Database communities, analyze their theoretical properties, and empirically observe their behaviour in an experimental study.
Edit intent: fluency
Original:  It has been used in a variety of contexts, including in particular ecology and climate science, to motivate the role of slow recovery rates and increased autocorrela tions as early-warning signals of such transitions.
Revised:  It has been used in a variety of contexts, including in particular ecology and climate science, to motivate the role of slow recovery rates and increased autocorrelations as early-warning signals of such transitions.
Edit intent: fluency
Original:  In particular, it may lead to the absence of critical slowing down prior to opulation collapse.
Revised:  In particular, it may lead to the absence of critical slowing down prior to population collapse.
Edit intent: fluency
Original:  More precisely, unlike in the unforced case, the question whether slow recovery rates can be observed  prior to the transition crucially depends on the chosen time-scales and the size of the considered data set.
Revised:  More precisely, unlike in the unforced case, the question whether slow recovery rates can be observed or detected prior to the transition crucially depends on the chosen time-scales and the size of the considered data set.
Edit intent: clarity
Original: The idea of the small world first put forth by Milgram in the 1960's shows empirically how people knowing reliably only connections to their direct contacts can leverage their knowledge to perform an efficient global search, referred to as social search, in surprisingly few steps.
Revised: Milgram empirically showed that people knowing only connections to their direct contacts can leverage their knowledge to perform an efficient global search, referred to as social search, in surprisingly few steps.
Edit intent: coherence
Original:  The results demonstrate that the spatial distributions of friends, and friends of friends (FoF) as well as the types of information utilized for search play a key role in effective social search.
Revised:  The results demonstrate that the spatial distributions of friends, and friends of friends are essential and sufficient for the efficiency of social search.
Edit intent: clarity
Original:  We also establish that neither the ways nodes are embedded into spacenor edges distributed among nodes are important for social search efficiency .
Revised:  Surprisingly, the original distribution of friends to edges is immune to changes of distributions of nodes into space .
Edit intent: clarity
Original:  Moreover, we show that even very limited knowledge of friends of friends significantly improves social search performance with gains growing most rapidly for small fractions of FoF knowledge .
Revised:  Moreover, the effect of using a limited knowledge that each node possesses about friends of its friends is strongly nonlinear. We show that gains of such use grow significantly only when this knowledge is limited to a small fraction of friends of friends .
Edit intent: clarity
Original:  The results demonstrate that only the distribution of friendships between node pairs and the partial knowledge of friends of friends are essential and sufficient for the efficiency of social search.
Revised:  The results demonstrate that only the distribution of friendship edges and the partial knowledge of friends of friends are essential and sufficient for the efficiency of social search.
Edit intent: clarity
Original:  Surprisingly, the  original distribution of friends to edges is immune to changes of distributions of nodes into space.
Revised:  Surprisingly, the original distribution of friendship edges is not dependent on how the nodes are distributed into space.
Edit intent: clarity