wanyu/IteraTeR_v2 huggingface dataset:
Original:  Since the MHq is approved in this study as a valid indicator, we apply the indicator to six zero-inflated altmetrics data and test whether different altmetrics sources are related to quality.
Revised:  Since the MHq is shown in this study as a valid indicator, we apply the indicator to six zero-inflated altmetrics data and test whether different altmetrics sources are related to quality.
Edit intent: clarity
Original:  Since the MHq is approved in this study as a valid indicator, we apply the indicator to six zero-inflated altmetrics data and test whether different altmetrics sources are related to quality.
Revised:  Since the MHq is approved in this study to be a valid indicator, we apply the indicator to six zero-inflated altmetrics data and test whether different altmetrics sources are related to quality.
Edit intent: fluency
Original:  Since the MHq is approved in this study as a valid indicator, we apply the indicator to six zero-inflated altmetrics data and test whether different altmetrics sources are related to quality.
Revised:  Since the MHq is approved in this study as a valid indicator, we apply it to six types of zero-inflated altmetrics data and test whether different altmetrics sources are related to quality.
Edit intent: clarity
Original:  The results for the various altmetrics demonstrate that the relationship between altmetrics (Wikipedia, Facebook, blogs, and news data) and assessments by peers is not given as strong as the relationship between citations and assessments by peers.
Revised:  The results for the various altmetrics demonstrate that the relationship between altmetrics (Wikipedia, Facebook, blogs, and news data) and assessments by peers is not as strong as the relationship between citations and assessments by peers.
Edit intent: clarity
Original: The generation of high-quality staggered unstructured grids for computational simulation is considered;
Revised: The generation of high-quality staggered unstructured grids is considered,
Edit intent: clarity
Original:  leading to the development of a new optimisation-based strategy for the construction of weighted `Regular-Power' tessellations appropriate for co-volume type numerical  techniques.
Revised:  leading to the development of a new optimisation-based strategy designed to construct weighted `Regular-Power' tessellations appropriate for co-volume type numerical techniques.
Edit intent: clarity
Original:  In this study, a  hybrid optimisation strategy is proposed;
Revised:  In this study, a new hybrid optimisation strategy is proposed;
Edit intent: clarity
Original:  The performance of the new method is tested experimentally, with a range of complex, multi-resolution primal-dual grids generated for various coastal and regional ocean modelling applications.
Revised:  The performance of this new method is tested experimentally, with a range of complex, multi-resolution primal-dual grids generated for various coastal and regional ocean modelling applications.
Edit intent: clarity
Original:  As a result, they tend to  look pretty artificial and contrived .
Revised:  As a result, they tend to be contrived and look pretty artificial and contrived .
Edit intent: coherence
Original:  As a result, they tend to  look pretty artificial and contrived .
Revised:  As a result, they tend to look pretty artificial .
Edit intent: clarity
Original:  This might suggest that vulnerability to misclassification of slight input perturbations can only arise in a truly adversarial setting and thus is unlikely to be a problem in more benign contexts.
Revised:  This might suggest that such vulnerability to slight input perturbations can only arise in a truly adversarial setting and thus is unlikely to be a problem in more benign contexts.
Edit intent: clarity
Original:  This might suggest that vulnerability to misclassification of slight input perturbations can only arise in a truly adversarial setting and thus is unlikely to be a problem in more benign contexts.
Revised:  This might suggest that vulnerability to misclassification of slight input perturbations can only arise in a truly adversarial setting and thus is unlikely to be an issue in more "natural" contexts.
Edit intent: clarity
Original:  In this paper, we provide evidence that such a belief might be incorrect.
Revised:  In this paper, we provide evidence that such belief might be incorrect.
Edit intent: fluency
Original:  To this end, we show that neural networks are already vulnerable to significantly simpler- and more likely to occur naturally - transformations of the inputs.
Revised:  We demonstrate that significantly simpler, and more likely to occur naturally - transformations of the inputs.
Edit intent: clarity
Original:  To this end, we show that neural networks are already vulnerable to significantly simpler- and more likely to occur naturally - transformations of the inputs.
Revised:  To this end, we show that neural networks are already vulnerable to significantly simpler- and more likely to occur naturally , transformations of the inputs.
Edit intent: fluency
Original:  Specifically, we demonstrate that rotations and translations alone  suffice to significantly degrade the classification performance of neural network-based vision models across a spectrum of datasets.
Revised:  Specifically, we demonstrate that rotations and translations alone , suffice to significantly degrade the classification performance of neural network-based vision models across a spectrum of datasets.
Edit intent: fluency
Original:  Also, finding such "fooling" transformation does not even require having any special access to the model or its surrogate - just trying out a small number of random rotation and translation combinations already has a significant effect.
Revised:  Also, finding such "fooling" transformations does not require having any special access to the model or its surrogate - just trying out a small number of random rotation and translation combinations already has a significant effect.
Edit intent: coherence
Original:  Also, finding such "fooling" transformation does not even require having any special access to the model or its surrogate - just trying out a small number of random rotation and translation combinations already has a significant effect.
Revised:  Also, finding such "fooling" transformation does not even require having any special access to the model - just trying out a small number of random rotation and translation combinations already has a significant effect.
Edit intent: clarity
Original:  We demonstrate that significantly simpler, and more likely to occur naturally, transformationsof the input - namely, rotations and translations alone , suffice to significantly degrade the classification performance of neural network-based vision models across a spectrum of datasets.
Revised:  We demonstrate that significantly simpler, and more likely to occur naturally, transformationsof the input - namely, rotations and translations alone , namely translations and rotations alone, are sufficient to fool neural network-based vision models across a spectrum of datasets.
Edit intent: clarity
Original:   We evaluated our proposed framework using SigWiComp2013 Japanese and GPDSsyntheticOnLineOffLineSignature dataset .
Revised:  We evaluated our proposed framework using SigWiComp2013 Japanese and GPDSsyntheticOnLineOffLineSignature datasets .
Edit intent: fluency
Original:  Monitoring continuous-time multivariate processes by using Bayesian control charts is studied in Makis (2008 ) [ Makis, V.  (2008) .
Revised:  Monitoring continuous-time multivariate processes by using Bayesian control charts is studied in Makis (2008 ) [ Makis, V. (2008) 
Edit intent: fluency
Original:  Operations Research, 56(2), 487-496, DOI: 10.1287/opre.1070.0495].
Revised:  Operations Research, DOI: 10.1287/opre.1070.0495].
Edit intent: coherence
Original:  Its model-theoretic semantics is formalized by extending the earlier interpretation functions for dependent descriptors.
Revised:  Its model-theoretic semantics is formalized by extending the interpretation functions for dependent descriptors.
Edit intent: clarity
Original:  PSOA RuleML 1.0 specifies for each descriptor whether it is to be interpreted under the perspective of the predicate in whose scope it occurs.
Revised:  PSOA RuleML explicitly specifies for each descriptor whether it is to be interpreted under the perspective of the predicate in whose scope it occurs.
Edit intent: clarity
Original:  This perspectivity dimension refines the space between oidless, positional atoms (relationships) and oidful, slotted atoms ( frames ): While relationships use only a predicate-scope-sensitive (predicate-dependent) tuple and frames use only predicate-scope-insensitive (predicate-independent) slots, PSOA RuleML 1.0 uses a systematics of orthogonal constructs also permitting atoms with (predicate-)independent tuples and atoms with (predicate-)dependent slots.
Revised:  This predicate-dependency dimension refines the space between oidless, positional atoms (relationships) and oidful, slotted atoms ( frames ): While relationships use only a predicate-scope-sensitive (predicate-dependent) tuple and frames use only predicate-scope-insensitive (predicate-independent) slots, PSOA RuleML 1.0 uses a systematics of orthogonal constructs also permitting atoms with (predicate-)independent tuples and atoms with (predicate-)dependent slots.
Edit intent: clarity
Original:  This perspectivity dimension refines the space between oidless, positional atoms (relationships) and oidful, slotted atoms ( frames ): While relationships use only a predicate-scope-sensitive (predicate-dependent) tuple and frames use only predicate-scope-insensitive (predicate-independent) slots, PSOA RuleML 1.0 uses a systematics of orthogonal constructs also permitting atoms with (predicate-)independent tuples and atoms with (predicate-)dependent slots.
Revised:  This perspectivity dimension refines the space between oidless, positional atoms (relationships) and oidful, slotted atoms ( framepoints ): While relationships use only a predicate-scope-sensitive (predicate-dependent) tuple and frames use only predicate-scope-insensitive (predicate-independent) slots, PSOA RuleML 1.0 uses a systematics of orthogonal constructs also permitting atoms with (predicate-)independent tuples and atoms with (predicate-)dependent slots.
Edit intent: clarity
Original:  This perspectivity dimension refines the space between oidless, positional atoms (relationships) and oidful, slotted atoms ( frames ): While relationships use only a predicate-scope-sensitive (predicate-dependent) tuple and frames use only predicate-scope-insensitive (predicate-independent) slots, PSOA RuleML 1.0 uses a systematics of orthogonal constructs also permitting atoms with (predicate-)independent tuples and atoms with (predicate-)dependent slots.
Revised:  This perspectivity dimension refines the space between oidless, positional atoms (relationships) and oidful, slotted atoms ( frames ): While relationships use only a predicate-scope-sensitive (predicate-dependent) tuple and framepoints use only predicate-scope-insensitive (predicate-independent) slots, PSOA RuleML 1.0 uses a systematics of orthogonal constructs also permitting atoms with (predicate-)independent tuples and atoms with (predicate-)dependent slots.
Edit intent: clarity
Original:  The open PSOATransRun system since Version 1.3 realizes PSOA RuleML 1.0 by a translator to runtime predicates, including for dependent tuples (prdtupterm) and slots (prdsloterm).
Revised:  The open-source PSOATransRun system realizes PSOA RuleML 1.0 by a translator to runtime predicates, including for dependent tuples (prdtupterm) and slots (prdsloterm).
Edit intent: coherence
Original: The general problem in topology optimization is correctly formulated as a double-\min mixed integer nonlinear programming (MINLP) problembased on the minimum total potential energy principle.
Revised: Topology optimization for general materials is correctly formulated as a double-\min mixed integer nonlinear programming (MINLP) problembased on the minimum total potential energy principle.
Edit intent: clarity
Original:  However, by using canonical duality theory (CDT) developed recently by the author, this challenging 0-1 integer programming problem can be solved analytically to obtain global optimal solution at each design iteration.
Revised:  By using canonical duality theory (CDT) developed recently by the author, this challenging 0-1 integer programming problem can be solved analytically to obtain global optimal solution at each design iteration.
Edit intent: coherence
Original:  However, by using canonical duality theory (CDT) developed recently by the author, this challenging 0-1 integer programming problem can be solved analytically to obtain global optimal solution at each design iteration.
Revised:  However, by using canonical duality theory (CDT) developed by the author, this challenging 0-1 integer programming problem can be solved analytically to obtain global optimal solution at each design iteration.
Edit intent: clarity
Original:   The novel CDT method for general topology optimization is refined and tested mainly by both 2-D benchmark problems in topology optimization .
Revised:  The novel CDT method for general topology optimization is refined and tested by both 2-D benchmark problems in topology optimization .
Edit intent: coherence
Original:  Numerical results show that without using filter  , the CDT method can obtain exactly 0-1 optimal density distribution with almost no checkerboard pattern.
Revised:  Numerical results show that without using filter , the CDT method can produce exactly 0-1 optimal density distribution with almost no checkerboard pattern.
Edit intent: clarity
Original:  Choosing the right one is vital for good performance .
Revised:  While choosing the right network is vital for good performance .
Edit intent: clarity
Original:  Empirical results show that it gracefully deals with transient behaviors, has relatively fast convergence to the optimal network with reduced switching, and achieves fairness among devices  .
Revised:  Empirical results show that it stabilizes at the optimal state, achieves fairness among devices .
Edit intent: clarity
Original:  More broadly, this paper provides a roadmap for how to adapt and use adversarial bandit algorithms (which are beautiful in theory, and yet often do not work well in practice) to efficiently solve networking problems .
Revised:  We conclude that multi-armed bandit algorithms can play an important role in distributed resource selection problems, when practical concerns, such as switching costs and convergence time, are addressed .
Edit intent: clarity
Original: We show that the discrete Sinkhorn algorithm, as applied in the setting of Optimal Transport on a compact manifold, converges in the large scale limit, to the solution of a parabolic PDE of Monge-Amp\`ere type.
Revised: We show that the discrete Sinkhorn algorithm, as applied in the setting of Optimal Transport on a compact manifold, converges in the large-scale limit, to the solution of a parabolic PDE of Monge-Amp\`ere type.
Edit intent: fluency
Original: We show that the discrete Sinkhorn algorithm , as applied in the setting of Optimal Transport on a compact manifold , converges in the large-scale limit, to the solution of a  parabolic PDE of Monge-Amp\`ere type .
Revised: We show that the discrete Sinkhorn algorithm - as applied in the setting of Optimal Transport on a compact manifold , converges in the large-scale limit, to the solution of a parabolic PDE of Monge-Amp\`ere type .
Edit intent: fluency
Original: We show that the discrete Sinkhorn algorithm , as applied in the setting of Optimal Transport on a compact manifold , converges in the large-scale limit, to the solution of a  parabolic PDE of Monge-Amp\`ere type .
Revised: We show that the discrete Sinkhorn algorithm , as applied in the setting of Optimal Transport on a compact manifold - converges to the solution of a parabolic PDE of Monge-Amp\`ere type .
Edit intent: clarity
Original:  The latter evolution equation has previously appeared in different contexts ( in particular, on the torus it can be be identified with the Ricci flow).
Revised:  The latter evolution equation has previously appeared in different contexts ( e.g. on the torus it can be be identified with the Ricci flow).
Edit intent: clarity
Original:  This leads to a meshfree algorithmic approximation of the potential of the optimal transport map(or equivalently, certain geometric Monge-Amp\`ere equations) with explicit bounds on the time-complexity of the construction and the approximation errors.
Revised:  This leads to algorithmic approximations of the potential of the optimal transport map(or equivalently, certain geometric Monge-Amp\`ere equations) with explicit bounds on the time-complexity of the construction and the approximation errors.
Edit intent: clarity
Original:  This leads to a meshfree algorithmic approximation of the potential of the optimal transport map(or equivalently, certain geometric Monge-Amp\`ere equations) with explicit bounds on the time-complexity of the construction and the approximation errors.
Revised:  This leads to a meshfree algorithmic approximation of the potential of the optimal transport map(or equivalently, certain geometric Monge-Amp\`ere equations) with explicit bounds on the arithmetic complexity of the construction and the approximation errors.
Edit intent: clarity
Original:  Applications to the far-field antenna problem are given and connections to Quasi-Monte Carlo methods are provided .
Revised:  Applications to the far-field antenna problem . Connections to Quasi-Monte Carlo methods are provided .
Edit intent: clarity
Original:  Applications to the far-field antenna problem are given and connections to Quasi-Monte Carlo methods are provided .
Revised:  Applications to the far-field antenna problem are given and connections to Quasi-Monte Carlo methods are exploited .
Edit intent: clarity
Original:  This means they can share orientation and zoom  , commands and other operations in almost real time over the Internet , with the comfort of standard web pages.
Revised:  This means they can share orientation and zoom , commands and other operations in almost real time over the Internet through standard web pages.
Edit intent: clarity
Original:  More broadly, it illustrates the strong integrability of libraries and technologies for client-side web programming, and opens the way for similar web apps for concurrent work in other disciplines.
Revised:  More broadly, it illustrates the strong integrability of technologies for client-side web programming, and opens the way for similar web apps for concurrent work in other disciplines.
Edit intent: clarity
Original:  More broadly, it illustrates the strong integrability of libraries and technologies for client-side web programming, and opens the way for similar web apps for concurrent work in other disciplines.
Revised:  More broadly, it illustrates the strong integrability of libraries and technologies for client-side web programming, and paves the way for similar web apps for concurrent work in other disciplines.
Edit intent: clarity
Original:  More broadly, it illustrates the strong integrability of libraries and technologies for client-side web programming, and opens the way for similar web apps for concurrent work in other disciplines.
Revised:  More broadly, it illustrates the strong integrability of libraries and technologies for client-side web programming, and opens the way for similar apps for concurrent work in other disciplines.
Edit intent: fluency
Original:  The web app is available at: URL
Revised:  Web app is available at: URL
Edit intent: clarity
Original: Through modeling human's brainstorming process, the brain storm optimization (BSO) algorithm has become a promising population based evolution algorithm.
Revised: Through modeling human's brainstorming process, the brain storm optimization (BSO) algorithm has become a promising population-based evolutionary algorithm.
Edit intent: fluency
Original:  In this paper, the Nelder-Mead 's Simplex (NMS) method is adopted in a simple version of BSO.
Revised:  In this paper, the Nelder-Mead Simplex (NMS) method is adopted in a simple version of BSO.
Edit intent: fluency
Original:  Our goal is to combine BSO  's exploration ability and NMS's exploitation ability together, and develop an enhanced BSO via a better balance between global exploration and local exploitation.
Revised:  Our goal is to combine BSO . Through combining BSO 's exploration ability and NMS's exploitation ability together, and develop an enhanced BSO via a better balance between global exploration and local exploitation.
Edit intent: coherence
Original:   Large number of experimental results are reported, and the proposed algorithm is shown to perform better than both BSO and NMS .
Revised:  Large number of experimental results show that Simplex-BSO is a promising algorithm for global optimization problems .
Edit intent: clarity
Original:  The proposed filter is based on a nonlinear optimization that enforces smoothness of the signal within designated neighborhoods, while preserving signal variations that correspond to features of certain scales.
Revised:  The proposed filter is based on a nonlinear optimization that enforces smoothness of the signal while preserving variations that correspond to features of certain scales.
Edit intent: clarity
Original:  Expanding on the methods of Bozeman and Morales, we find a necessary condition for the existence of oscillations in the MM approximation of the composite system.
Revised:  Expanding on the methods of Bozeman and Morales, we preclude oscillations in the MM approximation of the composite system.
Edit intent: clarity
Original:  We also consider some open research questions in the area of hybrid model development and the future directions for the field.
Revised:  We also consider some open research questions in the area of hybrid method development and the future directions for the field.
Edit intent: clarity
Original: Unsupervised, user-owned mobile and embedded devices are used to deliver increasingly impactful services, such as remote health monitoring and assistive technologies.
Revised: Remote mobile and embedded devices are used to deliver increasingly impactful services, such as remote health monitoring and assistive technologies.
Edit intent: clarity
Original:  These services necessitate secure system logging to aid audit and forensic investigations , particularly if devices bring harm to users . Logs should be tamper-resistant  , both during executionand in storage, while being retrievable by remote verifiers in a secure fashion .
Revised:  Secure system logging is beneficial in these scenarios to aid audit and forensic investigations , particularly if devices bring harm to users . Logs should be tamper-resistant , both during executionand in storage, while being retrievable by remote verifiers in a secure fashion .
Edit intent: clarity
Original:  These services necessitate secure system logging to aid audit and forensic investigations , particularly if devices bring harm to users . Logs should be tamper-resistant  , both during executionand in storage, while being retrievable by remote verifiers in a secure fashion .
Revised:  These services necessitate secure system logging to aid audit and forensic investigations particularly if devices bring harm to users . Logs should be tamper-resistant , both during executionand in storage, while being retrievable by remote verifiers in a secure fashion .
Edit intent: fluency
Original:  These services necessitate secure system logging to aid audit and forensic investigations , particularly if devices bring harm to users . Logs should be tamper-resistant  , both during executionand in storage, while being retrievable by remote verifiers in a secure fashion .
Revised:  These services necessitate secure system logging to aid audit and forensic investigations , particularly if devices bring harm to end-users . Logs should be tamper-resistant , both during executionand in storage, while being retrievable by remote verifiers in a secure fashion .
Edit intent: clarity