wanyu/IteraTeR_v2 huggingface dataset:
Original:  In contrast with classical methods, the surrogate data used here are realisations of a non-stationary linear stochastic process, preserving both the amplitude and time-frequency distributions of original data .
Revised:  In contrast with standard methods, the surrogate data used here are realisations of a non-stationary linear stochastic process, preserving both the amplitude and time-frequency distributions of original data .
Edit intent: clarity
Original:  In contrast with classical methods, the surrogate data used here are realisations of a non-stationary linear stochastic process, preserving both the amplitude and time-frequency distributions of original data .
Revised:  In contrast with classical methods, the surrogate data used here are realisations of a non-stationary stochastic process, preserving both the amplitude and time-frequency distributions of original data .
Edit intent: clarity
Original:  Available techniques, ranging from simple automated docking procedures to sophisticated thermodynamics-based methods, have been developed almost exclusively for use in soluble proteins .
Revised:  Existing techniques, ranging from simple automated docking procedures to sophisticated thermodynamics-based methods, have been developed almost exclusively for use in soluble proteins .
Edit intent: clarity
Original:  Non-ideality of cholesterol in a binary cholesterol: phosphatidylcholine (POPC ) bilayer is characterized and consistently incorporated into the interpretation.
Revised:  Non-ideality of cholesterol in a binary cholesterol: POPC bilayer is characterized and consistently incorporated into the interpretation.
Edit intent: clarity
Original: In this article , the data notion is mathematically conceptualized as typed information based on the two concepts of information and computable functionality.
Revised: The contribution of this article is a data concept that is essentially based on the two concepts of information and computable functionality.
Edit intent: clarity
Original:   A data type is defined as a pair of a set of distinguishable characters (an alphabet) and a set of operations ( surjective, computable functions) that operate on this alphabet as domain and capture the intent of a parameterizable concept .
Revised:  A data type is defined as a pair of a set of distinguishable characters (an alphabet) and a set of operations ( computable functions) that operate on this alphabet as domain and capture the intent of a parameterizable concept .
Edit intent: clarity
Original:   A data type is defined as a pair of a set of distinguishable characters (an alphabet) and a set of operations ( surjective, computable functions) that operate on this alphabet as domain and capture the intent of a parameterizable concept .
Revised:  A data type is defined as a pair of a set of distinguishable characters (an alphabet) and a set of operations ( surjective, computable functions) that operate on this alphabet as domain .
Edit intent: coherence
Original:  They lead to two different partial orders on types in the sense of subtyping as formulated by Liskov and Wing .
Revised:  They lead to two different partial orders on types .
Edit intent: coherence
Original:  On top of providing a remarkable extension of the nonlinear Perron-Frobenius theory to the multi-dimensional case, our contribution poses the basis for several improvements and a deeper understanding of the current spectral theory for nonnegative tensors.
Revised:  On top of providing a new extension of the nonlinear Perron-Frobenius theory to the multi-dimensional case, our contribution poses the basis for several improvements and a deeper understanding of the current spectral theory for nonnegative tensors.
Edit intent: clarity
Original: The one way function based on  Collatz problem is proposed.
Revised: The one way function based on the Collatz problem is proposed.
Edit intent: fluency
Original:  While Colatz (3x+1) problem is well known and undecided, the proposal is actually based on the problem's underlying conditional branching structure  .
Revised:  It is based on the problem's underlying conditional branching structure .
Edit intent: coherence
Original:  While Colatz (3x+1) problem is well known and undecided, the proposal is actually based on the problem's underlying conditional branching structure  .
Revised:  While Colatz (3x+1) problem is well known and undecided, the proposal is actually based on the problem's conditional branching structure .
Edit intent: clarity
Original:  The analysis shows why the 3x+1 problem is so difficult and how the algorithm conditional branching structure can be used to construct an one way function .
Revised:  The analysis shows why the problem is mathematically so inaccessible and how the algorithm conditional branching structure can be used to construct an one way function .
Edit intent: clarity
Original:  The analysis shows why the 3x+1 problem is so difficult and how the algorithm conditional branching structure can be used to construct an one way function .
Revised:  The analysis shows why the 3x+1 problem is so difficult and how the algorithm conditional branching structure can be used to construct one way functions .
Edit intent: fluency
Original:  It also shows exponential depenence between algorithm's conditional branching and running cost of algorithm branch-less reductions.
Revised:  It also shows exponential dependence between algorithm's conditional branching and running cost of algorithm branch-less reductions.
Edit intent: fluency
Original: We establish a formula which allows to embed any non-complete \theta-invariant code into a complete one : this brings a positive answer to the open question that was stated in N%DIFDELCMD < {%%% \'e raud J. and Selmi C.
Revised: We establish a formula which allows to embed any non-complete \theta-invariant code into a complete one N%DIFDELCMD < {%%% \'e raud J. and Selmi C.
Edit intent: coherence
Original: We establish a formula which allows to embed any non-complete \theta-invariant code into a complete one : this brings a positive answer to the open question that was stated in N%DIFDELCMD < {%%% \'e raud J. and Selmi C.
Revised: We establish a formula which allows to embed any non-complete \theta-invariant code into a complete one : this brings a positive answer to the open question that was stated in %DIFDELCMD < {%%% \'e raud J. and Selmi C.
Edit intent: fluency
Original: We establish a formula which allows to embed any non-complete \theta-invariant code into a complete one : this brings a positive answer to the open question that was stated in N%DIFDELCMD < {%%% \'e raud J. and Selmi C.
Revised: We establish a formula which allows to embed any non-complete \theta-invariant code into a complete one : this brings a positive answer to the open question that was stated in N%DIFDELCMD < {%%% raud J. and Selmi C.
Edit intent: fluency
Original:  We argue that such structural changes in the environment have to be taken into account for an unbiased measurment of national bibliometric performance.
Revised:  We argue that such structural changes in the environment have to be taken into account for an unbiased measurement of national bibliometric performance.
Edit intent: fluency
Original: Here is presented an original program based on molecular Schr\"odinger equations.
Revised: Here is presented an original program based on molecular Schrodinger equations.
Edit intent: fluency
Original:  An eigensolver combined with a new probing technique accumulate information along the iterations so that desired eigenpairs rapidly tend towards the variational limit.
Revised:  An eigensolver combined with a new probing technique accumulates information along the iterations so that desired eigenpairs rapidly tend towards the variational limit.
Edit intent: fluency
Original: Reversible video watermarking can guarantee that the original watermark and the original frame can be recovered from the watermarked frame without any distortion.
Revised: Reversible video watermarking can guarantee that the watermark logo and the original frame can be recovered from the watermarked frame without any distortion.
Edit intent: clarity
Original:  Although reversible video watermarking has successfully been applied in multimedia, but its application has not been extensively explored in medical videos.
Revised:  Although reversible video watermarking has successfully been applied in multimedia, its application has not been extensively explored in medical videos.
Edit intent: coherence
Original:  We suggest to use temporal correlations for improving the prediction accuracy.
Revised:  We suggest using temporal correlations for improving the prediction accuracy.
Edit intent: fluency
Original:  To the best of our knowledge, this is the first time this method is applied for medical videos.
Revised:  To the best of our knowledge, this is the first time this method is applied to medical videos.
Edit intent: fluency
Original:  The method helps to protect patients' personal and medical information by watermarking, i.e.  increase the security of Health Information Systems (HIS).
Revised:  The method helps to protect patients' personal and medical information by watermarking, i.e. , increase the security of Health Information Systems (HIS).
Edit intent: fluency
Original:  Experimental results demonstrate a high quality watermarking based on PSNR metric and a large capacity for data hiding on medical videos.
Revised:  Experimental results demonstrate the high quality of the proposed watermarking method based on PSNR metric and a large capacity for data hiding on medical videos.
Edit intent: clarity
Original:  Experimental results demonstrate a high quality watermarking based on PSNR metric and a large capacity for data hiding on medical videos.
Revised:  Experimental results demonstrate a high quality watermarking based on PSNR metric and a large capacity for data hiding in medical videos.
Edit intent: fluency
Original:  The approach to the stationary state can also been characterized, with strong similarities with a simple "aging" model considered by Barrat \& M\'ezard.
Revised:  The approach to the stationary state can also been characterized, with strong similarities with a simple "aging" model considered by Barrat M\'ezard.
Edit intent: fluency
Original: In diffusion social learning over weakly-connected graphs, it has been shown recently that influential agents end up shaping the beliefs of non-influential agents.
Revised: In diffusion social learning over weakly-connected graphs, it has been shown recently that influential agents shape the beliefs of non-influential agents.
Edit intent: clarity
Original:  This paper analyzes this control mechanism more closely and addresses two main questions.
Revised:  This paper analyzes this mechanism more closely and addresses two main questions.
Edit intent: clarity
Original:  Second, even if there is a limit to what influential agents can accomplish, this article develops mechanisms by which these agents can lead receiving agents to adopt certain beliefs.
Revised:  Second, even if there is a limit to what influential agents can accomplish, this article develops mechanisms by which they can lead receiving agents to adopt certain beliefs.
Edit intent: clarity
Original:  The theoretical findings are illustrated by means of several examples.
Revised:  The theoretical findings are illustrated by means of examples.
Edit intent: clarity
Original: We study three problems regarding the so called graph-indexed random walks (or equivalently Lipschitz mappings of graphs) . Computing the average range of graph-indexed random walk of a graph..
Revised: Graph-indexed random walks (or equivalently Lipschitz mappings of graphs) . Computing the average range of graph-indexed random walk of a graph..
Edit intent: coherence
Original:  For M \in }\N \to \Z \le  Computing the maximum range of  graph-indexed random walk for a given graph.
Revised:  For M \in }\N \to \Z \le Computing the maximum range of a graph-indexed random walk for a given graph.
Edit intent: fluency
Original:   Deciding if we can extend  partial GI random walk into  full GI random walk for a given graph.
Revised:  - Deciding if we can extend partial GI random walk into full GI random walk for a given graph.
Edit intent: fluency
Original:   Deciding if we can extend  partial GI random walk into  full GI random walk for a given graph.
Revised:  Deciding if we can extend a partial GI random walk into full GI random walk for a given graph.
Edit intent: fluency
Original:   Deciding if we can extend  partial GI random walk into  full GI random walk for a given graph.
Revised:  Deciding if we can extend partial GI random walk into a full GI random walk for a given graph.
Edit intent: fluency
Original: Graph-indexed random walks (or equivalently M-Lipschitz mappings of graphs  ) are a generalization of standard random walk on Z.
Revised:  M-Lipschitz mappings of graphs ) are a generalization of standard random walk on Z.
Edit intent: clarity
Original: We propose methods for learning vector representations of SQL workloads to support a variety of administration tasksand application features, including query recommendation, workload summarization , index selection , identifying expensive queries, and predicting query reuse .
Revised: We consider methods for learning vector representations of SQL workloads to support a variety of administration tasksand application features, including query recommendation, workload summarization , index selection , identifying expensive queries, and predicting query reuse .
Edit intent: clarity
Original:  We consider vector representations of both raw SQL text and optimized query plans under various assumptions and pre-processing strategies , and evaluate these methods on multiple real SQL workloads by comparing with results of task and application feature metrics in the literature .
Revised:  We consider vector representations of both raw SQL text and optimized query plans , and evaluate these methods on multiple real SQL workloads by comparing with results of task and application feature metrics in the literature .
Edit intent: clarity
Original:  We consider vector representations of both raw SQL text and optimized query plans under various assumptions and pre-processing strategies , and evaluate these methods on multiple real SQL workloads by comparing with results of task and application feature metrics in the literature .
Revised:  We consider vector representations of both raw SQL text and optimized query plans under various assumptions and pre-processing strategies , and evaluate these methods on synthetic and real SQL workloads by comparing with results of task and application feature metrics in the literature .
Edit intent: clarity
Original:  We consider vector representations of both raw SQL text and optimized query plans under various assumptions and pre-processing strategies , and evaluate these methods on multiple real SQL workloads by comparing with results of task and application feature metrics in the literature .
Revised:  We consider vector representations of both raw SQL text and optimized query plans under various assumptions and pre-processing strategies , and evaluate these methods on multiple real SQL workloads .
Edit intent: coherence
Original:  We find that simple algorithms based on these generic vector representations compete favorably with previous approaches that require a number of assumptions and task-specific heuristics.
Revised:  We find that general algorithms based on these generic vector representations compete favorably with previous approaches that require a number of assumptions and task-specific heuristics.
Edit intent: clarity
Original:  We find that the general approach , when trained on a large corpus of SQL queries, provides a robust foundation for a variety of workload analysis tasks .
Revised:  We find that these general approaches , when trained on a large corpus of SQL queries, provides a robust foundation for a variety of workload analysis tasks .
Edit intent: clarity
Original:  Our compression scheme directly gives a new protocol for the vector in subspace problem with randomized one-way communication complexity that matches (up to polylogarithmic factors) the best known upper bound, due to Raz.
Revised:  Our compression scheme directly gives a new protocol for the vector in subspace problem with randomized one-way communication complexity that matches (up to polylogarithmic factors) the optimal upper bound, due to Raz.
Edit intent: clarity
Original: With the widespread use of information technologies, information networks have increasingly become popular to capture complex relationships across various disciplines, such as social networks, citation networks, telecommunication networks, and biological networks.
Revised: With the widespread use of information technologies, information networks are becoming increasingly popular to capture complex relationships across various disciplines, such as social networks, citation networks, telecommunication networks, and biological networks.
Edit intent: fluency
Original:  Analyzing these networks sheds light on different aspects of social life such as the structure of society , information diffusion, and different patterns of communication .
Revised:  Analyzing these networks sheds light on different aspects of social life such as the structure of societies , information diffusion, and different patterns of communication .
Edit intent: fluency
Original:  Recently, network representation learning has been  proposed as a new learning paradigm that embeds network vertices into a low-dimensional vector space, by preserving network topology structure, vertex content, and other side information.
Revised:  Recently, network representation learning has been proposed as a new learning paradigm to embed network vertices into a low-dimensional vector space, by preserving network topology structure, vertex content, and other side information.
Edit intent: fluency
Original:  In this survey, we perform a thorough review of the current literature on network representation learning in the field of data mining and machine learning  .
Revised:  In this survey, we perform a comprehensive review of the current literature on network representation learning in the field of data mining and machine learning .
Edit intent: fluency
Original:  In this survey, we perform a thorough review of the current literature on network representation learning in the field of data mining and machine learning  .
Revised:  In this survey, we perform a thorough review of the current literature on network representation learning in the data mining and machine learning .
Edit intent: clarity
Original:  We propose a new categorization to analyze and summarize state-of-the-art network representation learning techniques according to the methodology they employ and the network information they preserve.
Revised:  We propose new taxonomies to categorize and summarize the state-of-the-art network representation learning techniques according to the methodology they employ and the network information they preserve.
Edit intent: clarity
Original:  We propose a new categorization to analyze and summarize state-of-the-art network representation learning techniques according to the methodology they employ and the network information they preserve.
Revised:  We propose a new categorization to analyze and summarize state-of-the-art network representation learning techniques according to the underlying learning mechanisms, the network information they preserve.
Edit intent: clarity
Original:  We summarize evaluation protocols used for validating network representation learning including published benchmark datasets, evaluation methods, and open source projects .
Revised:  We summarize evaluation protocols used for validating network representation learning including published benchmark datasets, evaluation methods, and open source algorithms .
Edit intent: clarity
Original: We propose novel semi-supervised and active learning algorithms for the problem of community detection on networks.
Revised: We present a novel active learning algorithm for community detection on networks.
Edit intent: clarity
Original:  The optimization framework is inspired by prior work on the unsupervised community detection problem in Stochastic Block Models (SBM) using Semi-Definite Programming (SDP).
Revised:  The optimization framework is inspired by detection in the benchmark Stochastic Block Model (SBM) using Semi-Definite Programming (SDP).
Edit intent: clarity
Original:  (3) it is possible to construct a self-replicating system where the entropy of some parts spontaneously decreases, in a manner similar to that discussed by Schrodinger ;
Revised:  (3) it is possible to construct a self-replicating system where the entropy of some parts spontaneously decreases, in a manner similar to that discussed by Schr\"odinger ;
Edit intent: fluency
Original:  One of the most important ways for aggregation preference used in a multi agent system is using election.
Revised:  One of the most important ways for aggregating preference that has been used in multiagent systems is election.
Edit intent: clarity
Original:  In an election, the aim is to select the candidate who reects the common will of the whole society.
Revised:  In an election, the aim is to select the candidate who reflects the common will of the whole society.
Edit intent: fluency
Original:  In an election, the aim is to select the candidate who reects the common will of the whole society.
Revised:  In an election, the aim is to select the candidate who reects the common will of society.
Edit intent: clarity
Original:  Despite the importance of this subject, in the real world situations, sometimes under special circumstances, the result of the election is completely an antithesis of the purpose of those who execute it or the election leads to the dissatisfaction of a large amount of people .
Revised:  Despite the importance of this subject, in real-world situations, under special circumstances, the result of the election is completely an antithesis of the purpose of those who execute it or the election leads to the dissatisfaction of a large amount of people .
Edit intent: coherence
Original:  Despite the importance of this subject, in the real world situations, sometimes under special circumstances, the result of the election is completely an antithesis of the purpose of those who execute it or the election leads to the dissatisfaction of a large amount of people .
Revised:  Despite the importance of this subject, in the real world situations, sometimes under special circumstances, the result of the election does not respect the purpose of those who execute it or the election leads to the dissatisfaction of a large amount of people .
Edit intent: clarity
Original:  Despite the importance of this subject, in the real world situations, sometimes under special circumstances, the result of the election is completely an antithesis of the purpose of those who execute it or the election leads to the dissatisfaction of a large amount of people .
Revised:  Despite the importance of this subject, in the real world situations, sometimes under special circumstances, the result of the election is completely an antithesis of the purpose of those who execute it and the election leads to the dissatisfaction of a large amount of people .
Edit intent: coherence
Original:  A version of the impossibility theorem is stated and proved regarding social disappointment in elections .
Revised:  A version of the impossibility theorem is proved regarding social disappointment in elections .
Edit intent: clarity
Original: Mechanism design is concerned with settings where a policy maker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision.
Revised: Mechanism design is concerned with settings where a policymaker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision.
Edit intent: fluency