wanyu/IteraTeR_v2 huggingface dataset:
Original:  Stated in the language of binary relational structures in this paper [ 13 ], Lov\'asz proved a fundamental theorem that  the graph homomorphism function G \mapsto \hom(G, H) for 0-1 valued H (as the adjacency matrix of a graph) determines the isomorphism type of H. In the past 50 years various extensions have been proved by Lov\'asz and others [ 14, 9 , 1, 18, 16 ].
Revised:  Stated in the language of binary relational structures in this paper [ 13 ], Lov\'asz proved a fundamental theorem that the graph homomorphism function G \mapsto \hom(G, H) for 0-1 valued H (as the adjacency matrix of a graph) determines the isomorphism type of H. In the past 50 years various extensions have been proved by many researchers [ 14, 9 , 1, 18, 16 ].
Edit intent: clarity
Original:  An innovative aspect is we prove this by a surprisingly simple and unified argument.
Revised:  A noteworthy aspect is that we prove this by a surprisingly simple and unified argument.
Edit intent: clarity
Original:  Thirdly, the program simplification can be used to enhance the implementations of the LPMLN solvers , which is expected to facilitate the applications of LPMLN .
Revised:  Thirdly, the program simplification can be used to enhance the implementations of the LPMLN solvers .. .
Edit intent: coherence
Original:  A typical approach consists of a series of conditional independence tests on the covariance structure meant to progressively reduce the space of possible causal models .
Revised:  Many of these computational methods are designed to infer individual regulatory relationships among genes from data on gene expression .
Edit intent: clarity
Original:  We propose a novel efficient Bayesian method for discovering the local causal relationships among triplets of (normally distributed) variables.
Revised:  We propose a novel efficient Bayesian method for discovering local causal relationships among triplets of (normally distributed) variables.
Edit intent: fluency
Original:  In our approach, we score the patterns in the covariance matrix in one go and we incorporate the available background knowledge in the form of priors over causal structures.
Revised:  In our approach, we score the patterns in the covariance matrix in one go and incorporate available background knowledge in the form of priors over causal structures.
Edit intent: fluency
Original:  We apply the approach to the task of inferring gene regulatory networks by learning regulatory relationships between gene expression levels .
Revised:  We apply our approach to the task of inferring gene regulatory networks by learning regulatory relationships between gene expression levels .
Edit intent: fluency
Original:  We apply the approach to the task of inferring gene regulatory networks by learning regulatory relationships between gene expression levels .
Revised:  We apply the approach to the task of learning causal regulatory relationships among genes .
Edit intent: clarity
Original: Learning the parameters of a Gaussian mixtures models is a fundamental and widely studied problem with numerous applications.
Revised: Learning the parameters of Gaussian mixture models is a fundamental and widely studied problem with numerous applications.
Edit intent: fluency
Original:  As a corollary, we obtain a novel series representation for the solution with much improved convergence properties .
Revised:  As a corollary, we obtain a novel series representation for the solution with improved convergence properties .
Edit intent: clarity
Original: The Fragile Points Method (FPM) is a stable and elementarily simple , meshless Galerkin weak-form method, employing simple, local, polynomial, Point-based , discontinuous and identical trial and test functions which are derived from the Generalized Finite Difference method.
Revised: The Fragile Points Method (FPM) is an elementarily simple Galerkin meshless method, employing simple, local, polynomial, Point-based , discontinuous and identical trial and test functions which are derived from the Generalized Finite Difference method.
Edit intent: clarity
Original: The Fragile Points Method (FPM) is a stable and elementarily simple , meshless Galerkin weak-form method, employing simple, local, polynomial, Point-based , discontinuous and identical trial and test functions which are derived from the Generalized Finite Difference method.
Revised: The Fragile Points Method (FPM) is a stable and elementarily simple , meshless Galerkin weak-form method, employing simple, local, polynomial, Point-based discontinuous trial and test functions which are derived from the Generalized Finite Difference method.
Edit intent: coherence
Original: We develop the third-order adaptive Adams-Bashforth time stepping scheme and the second-order finite difference discretization equation for variable time steps.
Revised: We develop the third-order adaptive Adams-Bashforth time stepping and the second-order finite difference discretization equation for variable time steps.
Edit intent: clarity
Original: We develop the third-order adaptive Adams-Bashforth time stepping scheme and the second-order finite difference discretization equation for variable time steps.
Revised: We develop the third-order adaptive Adams-Bashforth time stepping scheme and the second-order finite difference equation for variable time steps.
Edit intent: clarity
Original:  This software uses a hybrid finite volume - finite difference scheme and leverages  GPU to solve the equations faster than real-time as well to concurrently visualize them.
Revised:  This software uses a hybrid finite volume - finite difference scheme and leverages the GPU to solve the equations faster than real-time as well to concurrently visualize them.
Edit intent: fluency
Original:  This software uses a hybrid finite volume - finite difference scheme and leverages  GPU to solve the equations faster than real-time as well to concurrently visualize them.
Revised:  This software uses a hybrid finite volume - finite difference scheme and leverages GPU to solve the equations faster than real-time while concurrently visualizing them.
Edit intent: clarity
Original:  The adaptive scheme significantly improves the robustness of the model without slowing it down .
Revised:  The adaptive scheme significantly improves the robustness of the model while providing faster computational performance .
Edit intent: clarity
Original:  In this paper , we propose a  method to quantify the degree of semantic progressiveness in each usage.
Revised:  In this paper , we propose a novel method to quantify the degree of semantic progressiveness in each usage.
Edit intent: clarity
Original:  Documents that are predicted to be semantically progressive receive a larger number of citations, indicating that they are especially influential.
Revised:  Documents that are scored as semantically progressive receive a larger number of citations, indicating that they are especially influential.
Edit intent: clarity
Original:  Our work thus provides a new technique for identifying lexical semantic leaders and demonstrates a new link between early adoption and influence in a citation network.
Revised:  Our work thus provides a new technique for identifying lexical semantic leaders and demonstrates a new link between progressive use of language and influence in a citation network.
Edit intent: clarity
Original:  By "learning" and organizing the subtle change of waveform morphology from large amounts of raw waveform data, unsupervised manifold learning can help delineate a high-dimensional structure .
Revised:  By "learning" and organizing the subtle change of waveform morphology from large amounts of raw waveform data, unsupervised manifold learning helps delineate a high-dimensional structure .
Edit intent: clarity
Original:  To validate this hypothesis, we investigate the electrocardiography (ECG) waveform for ischemic heart disease and arterial blood pressure (ABP) waveform in dynamic vasoactive episodes.
Revised:  We investigate the electrocardiography (ECG) waveform for ischemic heart disease and arterial blood pressure (ABP) waveform in dynamic vasoactive episodes.
Edit intent: coherence
Original:  The ABP waveform analysis of Nicardipine administration shows inter-individual difference ( SVM classification accuracy= 99.3\% ) and their common directions from intra-individual moving trajectories.
Revised:  The ABP waveform analysis of Nicardipine administration shows inter-individual difference ( accuracy= 99.3\% ) and their common directions from intra-individual moving trajectories.
Edit intent: clarity
Original:  The dynamic change of  ABP waveform during endo-tracheal intubation shows a loop-like trajectory structure, which can be further classified using the knowledge of antihypertensive medication.
Revised:  The dynamic change of ABP waveform during endotracheal intubation shows a loop-like trajectory structure, which can be further classified using the knowledge of antihypertensive medication.
Edit intent: fluency
Original:  The dynamic change of  ABP waveform during endo-tracheal intubation shows a loop-like trajectory structure, which can be further classified using the knowledge of antihypertensive medication.
Revised:  The dynamic change of ABP waveform during endo-tracheal intubation shows a loop-like trajectory structure, which can be further divided using the knowledge of antihypertensive medication.
Edit intent: clarity
Original: Most existing models of multi-agent reinforcement learning (MARL) adopt centralized training with decentralized execution framework .
Revised: In many real-world problems, a team of agents need to collaborate to maximize the common reward. Although existing works formulate this problem into a centralized learning with decentralized execution framework .
Edit intent: coherence
Original:  To resolve this problem , we propose Signal Instructed Coordination (SIC), a novel coordination module that can be integrated with most existing models . SIC casts a common signal sampled from a pre-defined distribution to team members, and adopts an information-theoretic regularization to encourage agents to exploit in learning the instruction of centralized signals .
Revised:  To resolve this problem , we propose Signal Instructed Coordination (SIC), a novel coordination module that can be integrated with most existing MARL frameworks . SIC casts a common signal sampled from a pre-defined distribution to team members, and adopts an information-theoretic regularization to encourage agents to exploit in learning the instruction of centralized signals .
Edit intent: clarity
Original:  To resolve this problem , we propose Signal Instructed Coordination (SIC), a novel coordination module that can be integrated with most existing models . SIC casts a common signal sampled from a pre-defined distribution to team members, and adopts an information-theoretic regularization to encourage agents to exploit in learning the instruction of centralized signals .
Revised:  To resolve this problem , we propose Signal Instructed Coordination (SIC), a novel coordination module that can be integrated with most existing models . SIC casts a common signal sampled from a pre-defined distribution to all agents, and introduces an information-theoretic regularization to encourage agents to exploit in learning the instruction of centralized signals .
Edit intent: clarity
Original:  To resolve this problem , we propose Signal Instructed Coordination (SIC), a novel coordination module that can be integrated with most existing models . SIC casts a common signal sampled from a pre-defined distribution to team members, and adopts an information-theoretic regularization to encourage agents to exploit in learning the instruction of centralized signals .
Revised:  To resolve this problem , we propose Signal Instructed Coordination (SIC), a novel coordination module that can be integrated with most existing models . SIC casts a common signal sampled from a pre-defined distribution to team members, and adopts an information-theoretic regularization to facilitate the consistency between the observed signal and agents' policies .
Edit intent: clarity
Original:  Our experiments show that SIC can consistently improve team performance over well-recognized MARL models on matrix games and  predator-prey games .
Revised:  Our experiments show that SIC consistently improves performance over well-recognized MARL models on matrix games and predator-prey games .
Edit intent: clarity
Original:  Our experiments show that SIC can consistently improve team performance over well-recognized MARL models on matrix games and  predator-prey games .
Revised:  Our experiments show that SIC can consistently improve team performance over well-recognized MARL models in both matrix games and predator-prey games .
Edit intent: clarity
Original:  Our experiments show that SIC can consistently improve team performance over well-recognized MARL models on matrix games and  predator-prey games .
Revised:  Our experiments show that SIC can consistently improve team performance over well-recognized MARL models on matrix games and a predator-prey games .
Edit intent: fluency
Original:  On a selection of 116 structural optimization tasks, our approach produces an optimal design 50\% more often than the best baseline method.
Revised:  On a selection of 116 structural optimization tasks, our approach produces the best design 50\% more often than the best baseline method.
Edit intent: clarity
Original:  In this paper, we propose Long Short-Term Memory Multi-Seasonal Net (LSTM-MSNet), a decompositionbased , unified prediction framework to forecast time series with multiple seasonal patterns.
Revised:  In this paper, we propose Long Short-Term Memory Multi-Seasonal Net (LSTM-MSNet), a decomposition based , unified prediction framework to forecast time series with multiple seasonal patterns.
Edit intent: fluency
Original:  In contrast, LSTM-MSNet is a globally trained Long Short-Term Memory network (LSTM), where a single prediction model is built across all the available time series to exploit the crossseries knowledge in a group of related time series.
Revised:  In contrast, LSTM-MSNet is a globally trained Long Short-Term Memory network (LSTM), where a single prediction model is built across all the available time series to exploit the cross series knowledge in a group of related time series.
Edit intent: fluency
Original:  All options are readily included in the framework and allow us to achieve competitive results for both cases, outperforming many state-ofthe-art multi-seasonal forecasting methods 
Revised:  All options are readily included in the framework and allow us to achieve competitive results for both cases, outperforming many state-of-the-art multi-seasonal forecasting methods 
Edit intent: fluency
Original:  All options are readily included in the framework and allow us to achieve competitive results for both cases, outperforming many state-ofthe-art multi-seasonal forecasting methods 
Revised:  All options are readily included in the framework and allow us to achieve competitive results for both cases, outperforming many state-ofthe-art multi-seasonal forecasting methods .
Edit intent: fluency
Original: The present study proposes a simple grey-box identification approach to model a real dc-dc buck converter operating in continuous mode using a nonlinear polynomial autoregressive with exogenous input (NARX) model.
Revised: The present study proposes a simple grey-box identification approach to model a real DC-DC buck converter operating in continuous mode using a nonlinear polynomial autoregressive with exogenous input (NARX) model.
Edit intent: fluency
Original:  The proposed approach casts the grey-box identification problem into a multi-objective framework and explicitly uses a priori information about the static nonlinearity into the structure selection process.
Revised:  The proposed approach casts grey-box identification problem into a multi-objective framework and explicitly uses a priori information about the static nonlinearity into the structure selection process.
Edit intent: fluency
Original:  The multi-objective framework could identify globally valid models with improved dynamic prediction and can mimic the static behavior of the buck converter over a wide input range.
Revised:  The results of the investigation, considering the case of practical buck converter, demonstrate that it is possible to identify parsimonious models which can capture both the dynamic and static behavior of the buck converter over a wide input range.
Edit intent: clarity
Original:  The multi-objective framework could identify globally valid models with improved dynamic prediction and can mimic the static behavior of the buck converter over a wide input range.
Revised:  The multi-objective framework could identify globally valid models with improved dynamic prediction and can mimic the static behavior of the system over a wide input range.
Edit intent: clarity
Original: In this paper  we are concerned with the weighted plane wave least-squares (PWLS) method for three-dimensional Helmholtz equations, and develop the multi-level adaptive BDDC algorithms for solving the resulting discrete system.
Revised: In this paper , we are concerned with the weighted plane wave least-squares (PWLS) method for three-dimensional Helmholtz equations, and develop the multi-level adaptive BDDC algorithms for solving the resulting discrete system.
Edit intent: fluency
Original:  The condition number of the two-level adaptive BDDC preconditioned system is proved to be bounded above by a user-defined tolerance and a constant that is only dependent on the maximum number of faces and edges per subdomain and the number of subdomains sharing a common edge.
Revised:  The condition number of the two-level adaptive BDDC preconditioned system is proved to be bounded above by a user-defined tolerance and a constant which is dependent on the maximum number of faces and edges per subdomain and the number of subdomains sharing a common edge.
Edit intent: clarity
Original:  The effectiveness of these algorithms is illustrated on  benchmark problem.
Revised:  The efficiency of these algorithms is illustrated on benchmark problem.
Edit intent: clarity
Original:  The effectiveness of these algorithms is illustrated on  benchmark problem.
Revised:  The effectiveness of these algorithms is illustrated on a benchmark problem.
Edit intent: fluency
Original:  The numerical results show the robustness of our two-level adaptive BDDC algorithms with respect to the wave number, the number of subdomains and the mesh size, and appear that our multi-level adaptive BDDC algorithm can reduce the number of dofs at the coarse problem and can be used to solving large wave number problems efficiently.
Revised:  The numerical results show the robustness of our two-level adaptive BDDC algorithms with respect to the wave number, the number of subdomains and the mesh size, and illustrate that our multi-level adaptive BDDC algorithm can reduce the number of dofs at the coarse problem and can be used to solving large wave number problems efficiently.
Edit intent: coherence
Original:  The numerical results show the robustness of our two-level adaptive BDDC algorithms with respect to the wave number, the number of subdomains and the mesh size, and appear that our multi-level adaptive BDDC algorithm can reduce the number of dofs at the coarse problem and can be used to solving large wave number problems efficiently.
Revised:  The numerical results show the robustness of our two-level adaptive BDDC algorithms with respect to the wave number, the number of subdomains and the mesh size, and appear that our multi-level adaptive BDDC algorithm can reduce the scale of the coarse problem and can be used to solving large wave number problems efficiently.
Edit intent: clarity
Original:  The numerical results show the robustness of our two-level adaptive BDDC algorithms with respect to the wave number, the number of subdomains and the mesh size, and appear that our multi-level adaptive BDDC algorithm can reduce the number of dofs at the coarse problem and can be used to solving large wave number problems efficiently.
Revised:  The numerical results show the robustness of our two-level adaptive BDDC algorithms with respect to the wave number, the number of subdomains and the mesh size, and appear that our multi-level adaptive BDDC algorithm can reduce the number of dofs at the coarse problem and can be used to solve large wave number problems efficiently.
Edit intent: fluency
Original: Many factors such as economy size, capital resources, and size of national publication market seem to be related to the scientific performance of nations .
Revised: National culture is among those societal factors which could influence research and innovation activities .
Edit intent: clarity
Original:  We found that four dimensions of culture (i. e. individualism, power distance, uncertainty avoidance, and indulgence) correlate practically and statistically significantly with scientific impact of nations.
Revised:  We found that four dimensions of culture (i. e. individualism, power distance, individualism, and uncertainty avoidance had statistically significant associations with citation impact of nations.
Edit intent: clarity
Original:  We additionally calculated multiple regression analyses controlling for the possible effects of confounding factors including international migrant stock, investments in research and development,  number of researchers , international co-authorships, and national self-citations .
Revised:  We additionally calculated multiple regression analyses controlling for the possible effects of confounding factors including national self-citations, international co-authorships, invest-ments in research and development, number of researchers , international co-authorships, and national self-citations .
Edit intent: clarity
Original:  We additionally calculated multiple regression analyses controlling for the possible effects of confounding factors including international migrant stock, investments in research and development,  number of researchers , international co-authorships, and national self-citations .
Revised:  We additionally calculated multiple regression analyses controlling for the possible effects of confounding factors including international migrant stock, investments in research and development, international migrant stock, number of researchers , international co-authorships, and national self-citations .
Edit intent: fluency
Original:  In this paper, we aim to i ) study the slicing admission control problem by means of a multi-queuing system for heterogeneous tenant requests, ii)
Revised:  In this paper, we aim to i study the slicing admission control problem by means of a multi-queuing system for heterogeneous tenant requests, ii)
Edit intent: fluency
Original: The ability to reuse lessons from past experiences is one of the most critical abilities for intelligent behavior.
Revised: The ability to create abstract categorizations to be reused in different contexts is one of the most critical abilities for intelligent behavior.
Edit intent: clarity
Original:  In this paper, we introduce three terms: kernel , kernel dimension, and kernelization .
Revised:  In this paper, we introduce three terms: kernel and kernel dimension .
Edit intent: clarity
Original:  one to show that certain a structural property of influences the kernel dimension and the other to show that cognitive functioning is effected by the dimension of the kernel.
Revised:  one to show that structural density can effect kernel dimension and the other to show that cognitive functioning is effected by the dimension of the kernel.
Edit intent: clarity
Original:  The class of relaxations for combinatorial optimization has so far eluded quantum speedups.
Revised:  This class of relaxations for combinatorial optimization has so far eluded quantum speedups.
Edit intent: fluency