wanyu/IteraTeR_v2 huggingface dataset:
Original: We present improved circuits intended for building a universal computer based on Random Pulse Computing (RPC) paradigm, a biologically-inspired (BIOLOGICALLY INSPIRED) way of computation in which variable is represented by a frequency of a Random Pulse Train (RPT) rather than a logic state.
Revised: We present improved circuits intended for building a universal computer based on Random Pulse Computing (RPC) paradigm, a biologically-inspired way of computation in which variable is represented by a frequency of a Random Pulse Train (RPT) rather than a logic state.
Edit intent: fluency
Original:  Under a recently-introduced latent node embedding model, we also analyze the trade-off between privacy and link prediction utility.
Revised:  Under a recently-introduced latent node embedding model, we present a formal trade-off between privacy and link prediction utility.
Edit intent: clarity
Original:  Under a recently-introduced latent node embedding model, we also analyze the trade-off between privacy and link prediction utility.
Revised:  Under a recently-introduced latent node embedding model, we also analyze the trade-off between privacy and LP utility.
Edit intent: clarity
Original:  Extensive experiments with eight diverse real-life graphs and several link prediction heuristics show that D P L P can trade off between privacy and predictive performance more effectively than several alternatives.
Revised:  Extensive experiments with several real-life graphs and several link prediction heuristics show that D P L P can trade off between privacy and predictive performance more effectively than several alternatives.
Edit intent: clarity
Original:  Extensive experiments with eight diverse real-life graphs and several link prediction heuristics show that D P L P can trade off between privacy and predictive performance more effectively than several alternatives.
Revised:  Extensive experiments with eight diverse real-life graphs and several LP heuristics show that D P L P can trade off between privacy and predictive performance more effectively than several alternatives.
Edit intent: clarity
Original:  Extensive experiments with eight diverse real-life graphs and several link prediction heuristics show that D P L P can trade off between privacy and predictive performance more effectively than several alternatives.
Revised:  Extensive experiments with eight diverse real-life graphs and several link prediction heuristics show that DPLP can trade off between privacy and predictive performance more effectively than several alternatives.
Edit intent: clarity
Original:  This paper develops a physics-based machine learning model based on the deep material network (DMN) enriched by cohesive layers, which enables the accurate and efficient prediction of multiscale responses for heterogeneous materials with interfacial effect.
Revised:  This paper develops a physics-based machine learning model based on the deep material network (DMN) with cohesive layers, which enables the accurate and efficient prediction of multiscale responses for heterogeneous materials with interfacial effect.
Edit intent: clarity
Original:  New fitting parameters are invoked in the cohesive building block and have physical meanings related to the length scale and orientation of the cohesive layer.
Revised:  In the newly invoked cohesive building block and have physical meanings related to the length scale and orientation of the cohesive layer.
Edit intent: clarity
Original:  New fitting parameters are invoked in the cohesive building block and have physical meanings related to the length scale and orientation of the cohesive layer.
Revised:  New fitting parameters are invoked in the cohesive building block , the fitting parameters have physical meanings related to the length scale and orientation of the cohesive layer.
Edit intent: coherence
Original:  It is shown that the enriched material network can be effectively optimized via a multi-stage training strategy, with training data generated  from linear elastic direct numerical simulation (DNS).
Revised:  It is shown that the enriched material network can be effectively optimized via a multi-stage training strategy, with training data generated only from linear elastic direct numerical simulation (DNS).
Edit intent: clarity
Original: Standard approaches for uncertainty quantification (UQ) in cardiovascular modeling pose challenges due to the large number of uncertain inputs and the significant computational cost of realistic 3D simulations.
Revised: Standard approaches for uncertainty quantification in cardiovascular modeling pose challenges due to the large number of uncertain inputs and the significant computational cost of realistic 3D simulations.
Edit intent: clarity
Original: Standard approaches for uncertainty quantification (UQ) in cardiovascular modeling pose challenges due to the large number of uncertain inputs and the significant computational cost of realistic 3D simulations.
Revised: Standard approaches for uncertainty quantification (UQ) in cardiovascular modeling pose challenges due to the large number of uncertain inputs and the significant computational cost of realistic three-dimensional simulations.
Edit intent: fluency
Original:  We propose an efficient UQ framework utilizing a multilevel multifidelity Monte Carlo (MLMF) estimator to improve the accuracy of hemodynamic quantities of interest while maintaining reasonable computational cost.
Revised:  We propose an efficient uncertainty quantification framework utilizing a multilevel multifidelity Monte Carlo (MLMF) estimator to improve the accuracy of hemodynamic quantities of interest while maintaining reasonable computational cost.
Edit intent: clarity
Original:  We propose an efficient UQ framework utilizing a multilevel multifidelity Monte Carlo (MLMF) estimator to improve the accuracy of hemodynamic quantities of interest while maintaining reasonable computational cost.
Revised:  We propose an efficient UQ framework utilizing a multilevel multifidelity Monte Carlo estimator to improve the accuracy of hemodynamic quantities of interest while maintaining reasonable computational cost.
Edit intent: clarity
Original:   Our goal is to investigate and compare the efficiency of estimators built from two low-fidelity model alternatives and our high-fidelity 3D models.
Revised:  Our goal is to investigate and compare the efficiency of estimators built from two low-fidelity and high-fidelity 3D models.
Edit intent: clarity
Original:   Our goal is to investigate and compare the efficiency of estimators built from two low-fidelity model alternatives and our high-fidelity 3D models.
Revised:  Our goal is to investigate and compare the efficiency of estimators built from two low-fidelity model alternatives and our high-fidelity models.
Edit intent: clarity
Original:  Our goal is to demonstrate that for this application it is possible to accelerate the convergence of the estimators by utilizing a MLMF paradigm.
Revised:  We seek to demonstrate that for this application it is possible to accelerate the convergence of the estimators by utilizing a MLMF paradigm.
Edit intent: clarity
Original:  Therefore, we compare our approach to single fidelity Monte Carlo estimators and to a multilevel Monte Carlo approach based only on 3D simulations, but leveraging multiple spatial resolutions .
Revised:  Therefore, we compare our approach to Monte Carlo and multilevel Monte Carlo approach based only on 3D simulations, but leveraging multiple spatial resolutions .
Edit intent: clarity
Original:  Therefore, we compare our approach to single fidelity Monte Carlo estimators and to a multilevel Monte Carlo approach based only on 3D simulations, but leveraging multiple spatial resolutions .
Revised:  Therefore, we compare our approach to single fidelity Monte Carlo estimators and to a multilevel Monte Carlo estimators based only on 3D simulations, but leveraging multiple spatial resolutions .
Edit intent: fluency
Original:  Therefore, we compare our approach to single fidelity Monte Carlo estimators and to a multilevel Monte Carlo approach based only on 3D simulations, but leveraging multiple spatial resolutions .
Revised:  Therefore, we compare our approach to single fidelity Monte Carlo estimators and to a multilevel Monte Carlo approach based only on three-dimensional simulations .
Edit intent: coherence
Original:  We demonstrate significant , on the order of 10 to 100 times, reduction in total computational cost with the MLMF estimators.
Revised:  We demonstrate significant reduction in total computational cost with the MLMF estimators.
Edit intent: clarity
Original:  As expected, healthy models and global quantities show larger reductions than diseased models and local quantities as the latter rely more heavily on the highest fidelity model evaluations.
Revised:  As expected, global quantities and healthy models show larger reductions than diseased models and local quantities as the latter rely more heavily on the highest fidelity model evaluations.
Edit intent: fluency
Original:  As expected, healthy models and global quantities show larger reductions than diseased models and local quantities as the latter rely more heavily on the highest fidelity model evaluations.
Revised:  As expected, healthy models and global quantities show larger reductions than local quantities and diseased model, as the latter rely more heavily on the highest fidelity model evaluations.
Edit intent: fluency
Original:  In all cases, our workflow coupling Dakota  MLMF estimators with the SimVascular cardiovascular workflow make UQ feasible for constrained computational budgets.
Revised:  In all cases, our workflow coupling Dakota 's MLMF estimators with the SimVascular cardiovascular workflow make UQ feasible for constrained computational budgets.
Edit intent: fluency
Original:  In all cases, our workflow coupling Dakota  MLMF estimators with the SimVascular cardiovascular workflow make UQ feasible for constrained computational budgets.
Revised:  In all cases, our workflow coupling Dakota MLMF estimators with the SimVascular cardiovascular modeling framework makes uncertainty quantification feasible for constrained computational budgets.
Edit intent: clarity
Original: The Cahn--Hilliard equation is a widely used model that describes amongst others phase separation processes of binary mixtures or two-phase-flows .
Revised: The Cahn--Hilliard equation is a widely used model that describes amongst others phase separation processes of binary mixtures or two-phase flows .
Edit intent: fluency
Original:  Furthermore, we establish the convergence of discrete solutions towards suitable weak solutions of the original model , which serves also as an additional pathway to establish existence of weak solutions  .
Revised:  Furthermore, we establish the convergence of discrete solutions towards suitable weak solutions of the original model . This serves also as an additional pathway to establish existence of weak solutions .
Edit intent: coherence
Original:  As a solution for this problem we present, given a text of length n whose characters are drawn from an integer alphabet, an O(n^2)  time algorithm computing Re-Pair in n \lg \tau bits of space including the text space, where \tau is the maximum of n and the number of terminals and non-terminals.
Revised:  As a solution for this problem we present, given a text of length n whose characters are drawn from an integer alphabet, an O(n^2) time algorithm computing Re-Pair in n \lg \tau bits of space including the text space, where \tau is the number of terminals and non-terminals.
Edit intent: clarity
Original:  These systems should fulfil time-sensitive functions with variable levels of integration with their environment, incorporating data storage, computation, communications, sensing, and control.
Revised:  These systems should fulfil time-sensitive functions , provide variable levels of integration with their environment, incorporating data storage, computation, communications, sensing, and control.
Edit intent: clarity
Original:  These systems should fulfil time-sensitive functions with variable levels of integration with their environment, incorporating data storage, computation, communications, sensing, and control.
Revised:  These systems should fulfil time-sensitive functions with variable levels of integration with their environment, and incorporate data storage, computation, communications, sensing, and control.
Edit intent: coherence
Original:  There are, however, significant problems emerging from the convergence between CPS and Internet of Things (IoT) areas .
Revised:  There are, however, significant problems to be solved before such systems can be considered fit for purpose .
Edit intent: clarity
Original:  The high heterogeneity, complexity, and dynamics of these resource-constrained systems bring new challenges to their robust and reliable operation, which implies the need for novel resilience management strategies.
Revised:  The high heterogeneity, complexity, and dynamics of these resource-constrained systems bring new challenges to their robust and reliable operation, which implies the need for integral resilience management strategies.
Edit intent: clarity
Original:  This paper surveys the state of the art in the relevant fields and, discusses the research issues and future trends that emerge.
Revised:  This paper surveys the state of the art in the relevant fields , and discusses the research issues and future trends that emerge.
Edit intent: fluency
Original:  Thus, we hope to provide new insights into the  management of resilient CPSs, formed by IoT devices, modelled by Game Theory, and flexibly programmed using the latest software and virtualization platforms.
Revised:  Thus, we hope to provide new insights into the design and management of resilient CPSs, formed by IoT devices, modelled by Game Theory, and flexibly programmed using the latest software and virtualization platforms.
Edit intent: clarity
Original:  Thus, we hope to provide new insights into the  management of resilient CPSs, formed by IoT devices, modelled by Game Theory, and flexibly programmed using the latest software and virtualization platforms.
Revised:  Thus, we hope to provide new insights into the management of resilient CPSs, formed by IoT devices, modelled by Game Theory, and flexibly programmed with the latest software and virtualization platforms.
Edit intent: fluency
Original:  Speeds of propagating action potentials at 20 degrees Celsius are in very good agreement with the HH experimental value at 18.5 degrees Celsius.
Revised:  The predicted speed of propagating action potentials at 20 degrees Celsius are in very good agreement with the HH experimental value at 18.5 degrees Celsius.
Edit intent: clarity
Original:  Speeds of propagating action potentials at 20 degrees Celsius are in very good agreement with the HH experimental value at 18.5 degrees Celsius.
Revised:  Speeds of propagating action potentials at 20 degrees Celsius is in good agreement with the HH experimental value at 18.5 degrees Celsius.
Edit intent: clarity
Original:  The basic question asks whether player Max can win a given game with at least a given probability.
Revised:  The basic question asks whether one player can ensure reaching a given target with at least a given probability.
Edit intent: clarity
Original:  A natural extension are games with a conjunction of such conditions as objective.
Revised:  A natural extension is games with a conjunction of such conditions as objective.
Edit intent: fluency
Original:  Despite a plethora of recent results on  analysis of systems with multiple objectives,  decidability of this basic problem remains open.
Revised:  Despite a plethora of recent results on the analysis of systems with multiple objectives, decidability of this basic problem remains open.
Edit intent: fluency
Original:  Despite a plethora of recent results on  analysis of systems with multiple objectives,  decidability of this basic problem remains open.
Revised:  Despite a plethora of recent results on analysis of systems with multiple objectives, the decidability of this basic problem remains open.
Edit intent: fluency
Original:  In this paper, we show the Pareto frontier of the achievable values can be approximated to a given precision.
Revised:  In this paper, we present an algorithm approximating the Pareto frontier of the achievable values can be approximated to a given precision.
Edit intent: clarity
Original:  In this paper, we show the Pareto frontier of the achievable values can be approximated to a given precision.
Revised:  In this paper, we show the Pareto frontier of the achievable values to a given precision.
Edit intent: clarity
Original:  In particular, our algorithm is not limited to stopping games and can be run as an anytime algorithm, always returning the current approximation and its error bound.
Revised:  Moreover, it is an anytime algorithm, always returning the current approximation and its error bound.
Edit intent: coherence
Original:  In particular, our algorithm is not limited to stopping games and can be run as an anytime algorithm, always returning the current approximation and its error bound.
Revised:  In particular, our algorithm is not limited to stopping games and can be run as an anytime algorithm, meaning it can be stopped at any time returning the current approximation and its error bound.
Edit intent: clarity
Original: In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unequivocally display the order type of S.
Revised: In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unambiguously display the order type of S.
Edit intent: clarity
Original:  In contrast, our results show that to minimise the expected error, the number of hash functions should be a constant, strictly greater than 1.
Revised:  In contrast, our results show that to minimize the expected error, the number of hash functions should be a constant, strictly greater than 1.
Edit intent: fluency
Original: This paper presents a highly-parallelizable parallel-in-time algorithm for efficient solution of (nonlinear ) time-periodic problems.
Revised: This paper presents a highly-parallelizable parallel-in-time algorithm for efficient solution of nonlinear time-periodic problems.
Edit intent: fluency
Original:  The proposed approach reduces  complexity of the periodic Parareal solution by introducing a special simplified Newton algorithm, which allows an additional parallelization on the coarse grid.
Revised:  The proposed approach reduces the complexity of the periodic Parareal solution by introducing a special simplified Newton algorithm, which allows an additional parallelization on the coarse grid.
Edit intent: fluency
Original:  The proposed approach reduces  complexity of the periodic Parareal solution by introducing a special simplified Newton algorithm, which allows an additional parallelization on the coarse grid.
Revised:  The proposed approach reduces complexity of the periodic Parareal solution by introducing a simplified Newton algorithm, which allows an additional parallelization on the coarse grid.
Edit intent: clarity
Original:  In particular, at each Newton iteration a multi-harmonic correction is performed, which converts the block-cyclic periodic system in the time domain into a block-diagonal system in the frequency domain, thereby allowing separate solution for each frequency component in parallel.
Revised:  In particular, at each Newton iteration a multi-harmonic correction is performed, which converts the block-cyclic periodic system in the time domain into a block-diagonal system in the frequency domain, thereby solving for each frequency component in parallel.
Edit intent: clarity
Original:  Comparison of the introduced algorithm and several existing solution approaches is illustrated via their application to the eddy current problem for both linear and nonlinear models of a coaxial cable  .
Revised:  Comparison of the introduced algorithm and several existing solution approaches are compared via their application to the eddy current problem for both linear and nonlinear models of a coaxial cable .
Edit intent: clarity
Original: The Weisfeiler-Leman procedure is a widely-used approach for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples.
Revised: The Weisfeiler-Leman procedure is a widely-used technique for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples.
Edit intent: clarity
Original:  Thus, the dimension of the algorithm needed to distinguish two given  graphs is at most the dimension required to distinguish the corresponding decompositions into 3-connected components (assuming it is at least 2).
Revised:  This implies that the dimension of the algorithm needed to distinguish two given graphs is at most the dimension required to distinguish the corresponding decompositions into 3-connected components (assuming it is at least 2).
Edit intent: coherence
Original:  Thus, the dimension of the algorithm needed to distinguish two given  graphs is at most the dimension required to distinguish the corresponding decompositions into 3-connected components (assuming it is at least 2).
Revised:  Thus, the dimension of the algorithm needed to distinguish two given graphs is at most the dimension required to distinguish the corresponding decompositions into 3-connected components of the graphs (assuming dimension at least 2).
Edit intent: clarity
Original:  In an application of the results, we show the new upper bound of k on the Weisfeiler-Leman dimension  of graphs of treewidth at most k.
Revised:  In an application of the results, we show the new upper bound of k on the Weisfeiler-Leman dimension of the class of graphs of treewidth at most k.
Edit intent: clarity
Original:  Much like the maximum entropy principle encapsulates `bet-hedging' behaviour displayed by organisms dealing with  uncertainty in a fluctuating environment, its cooperative extension describes how individuals adapt their metabolic resource allocation strategy to further accommodate limited knowledge about the welfare of others within a community.
Revised:  Much like the maximum entropy principle encapsulates `bet-hedging' behaviour displayed by organisms dealing with future uncertainty in a fluctuating environment, its cooperative extension describes how individuals adapt their metabolic resource allocation strategy to further accommodate limited knowledge about the welfare of others within a community.
Edit intent: clarity
Original:  Examples of such graphs include financial transactions, communication networks , or flights between airports  .
Revised:  Examples range from communication networks to flights between airports .
Edit intent: clarity
Original:  We propose Latent-Graph Convolutional Networks (L-GCNs), which can successfully propagate information from these edge labels to a latent adjacency tensor, after which further propagation and downstream tasks can be performed, such as node classification.
Revised:  We propose Latent-Graph Convolutional Networks (L-GCNs), which propagate information from these edge labels to a latent adjacency tensor, after which further propagation and downstream tasks can be performed, such as node classification.
Edit intent: clarity
Original:  We propose Latent-Graph Convolutional Networks (L-GCNs), which can successfully propagate information from these edge labels to a latent adjacency tensor, after which further propagation and downstream tasks can be performed, such as node classification.
Revised:  We propose Latent-Graph Convolutional Networks (L-GCNs), which can successfully propagate information from these complex edges to a latent adjacency tensor, after which further propagation and downstream tasks can be performed, such as node classification.
Edit intent: clarity