wanyu/IteraTeR_v2 huggingface dataset:
Original: A new statistical physics model is introduced for describing the interaction of bacteria with anti-microbial drugs (AMDs) which we show can reproduce qualitative features of the emergence of single and double anti-microbial resistance (AMR) through natural selection.
Revised: A new statistical physics model is introduced for describing the interaction of bacteria with anti-microbial drugs that can reproduce qualitative features of the emergence of single and double anti-microbial resistance (AMR) through natural selection.
Edit intent: coherence
Original:  The model portrays a lattice  inhabited by agents , the latter modelled by simple Ising perceptrons.
Revised:  The model portrays a lattice inhabited by agents modeled by Ising perceptrons.
Edit intent: clarity
Original:  Several applications are presented: (i) a simple proof for the fact that the expression evaluation problem over every finite algebra belongs to DLOGTIME-uniform NC^1 is given, (ii) it is shown that expressions for an arbitrary (possibly non-commutative) semiring can be transformed in DLOGTIME-uniform TC^0 into equivalent circuits of logarithmic depth and size O(n/\log n), and (iii) a corresponding result for regular expressions is shown.
Revised:  Several applications are presented: (i) a simple proof for the fact that the expression evaluation problem is given, (ii) it is shown that expressions for an arbitrary (possibly non-commutative) semiring can be transformed in DLOGTIME-uniform TC^0 into equivalent circuits of logarithmic depth and size O(n/\log n), and (iii) a corresponding result for regular expressions is shown.
Edit intent: clarity
Original:  This paper first presents the main modes of image compression methods such as JPEG and JPEG2000 without mathematical details.
Revised:  This paper first presents main modes of image compression methods such as JPEG and JPEG2000 without mathematical details.
Edit intent: fluency
Original:  Then, a new image compression (AKS) method is proposed based on the preliminary image compression algorithm that can improve standards of image compression.
Revised:  Then, a new image compression method is proposed based on the preliminary image compression algorithm that can improve standards of image compression.
Edit intent: clarity
Original:  We complement these mostly negative results by providing FPT approximation schemes parameterized by clique-width or treewidth which work efficiently independently of the values of k,r.
Revised:  We complement these mostly negative results by providing FPT approximation schemes parameterized by clique-width or treewidth which work efficiently independently of the values of k,r.
Edit intent: fluency
Original: In this paper, we present techniques and examples to reduce power consumption and increase energy efficiency of autonomous wireless sensor nodes for the Internet of Things.
Revised: In this paper, we present techniques and examples to reduce power consumption and increase energy efficiency of autonomous Wireless Sensor Nodes (WSNs) for the Internet of Things.
Edit intent: clarity
Original:  Its measurement results are presented , along with a discussion on how to define its power conversion efficiency .
Revised:  Its measurement results are presented .
Edit intent: clarity
Original:  To boost the rectifier output voltage, while presenting the best output load to it, a DC-DC converter with maximum power point tracking is presented.
Revised:  To boost the rectifier output voltage, a DC-DC converter with maximum power point tracking is presented.
Edit intent: clarity
Original:  To boost the rectifier output voltage, while presenting the best output load to it, a DC-DC converter with maximum power point tracking is presented.
Revised:  To boost the rectifier output voltage, while presenting the best output load to it, a DC-DC converter that employs maximum power point tracking is presented.
Edit intent: clarity
Original:  The first one is } } a passive transmitter implementation and the second a novel low-power sub-GHz UWB transmitter .
Revised:  The first one is } } a novel low-power sub-GHz UWB transmitter .
Edit intent: clarity
Original:  We show a lower bound on the number of clauses in any propagation complete encoding of  "at most one" constraint.
Revised:  We show a lower bound on the number of clauses in any propagation complete encoding of the "at most one" constraint.
Edit intent: fluency
Original:  In this paper, we provide the first comprehensive survey on IoT-aided SG systems, which includes the existing architectures, applications and prototypes of IoT-aided SG systems.
Revised:  In this paper, we provide a comprehensive survey on IoT-aided SG systems, which includes the existing architectures, applications and prototypes of IoT-aided SG systems.
Edit intent: clarity
Original: Recent developments in quaternion-valued widely linear processing have illustrated that the exploitation of complete second-order statistics requires consideration of both the covariance and complementary covariance matrices.
Revised: Recent developments in quaternion-valued widely linear processing have established that the exploitation of complete second-order statistics requires consideration of both the covariance and complementary covariance matrices.
Edit intent: clarity
Original:  Such matrices have a tremendous amount of structure , and their decomposition is a powerful tool in a variety of applications, however, this has proven rather difficult, owing to the non-commutative nature of the quaternion product  .
Revised:  Although such matrices have a tremendous amount of structure , and their decomposition is a powerful tool in a variety of applications, however, this has proven rather difficult, owing to the non-commutative nature of the quaternion product .
Edit intent: clarity
Original:  Such matrices have a tremendous amount of structure , and their decomposition is a powerful tool in a variety of applications, however, this has proven rather difficult, owing to the non-commutative nature of the quaternion product  .
Revised:  Such matrices have a tremendous amount of structure and their decomposition is a powerful tool in a variety of applications, however, this has proven rather difficult, owing to the non-commutative nature of the quaternion product .
Edit intent: fluency
Original:  Such matrices have a tremendous amount of structure , and their decomposition is a powerful tool in a variety of applications, however, this has proven rather difficult, owing to the non-commutative nature of the quaternion product  .
Revised:  Such matrices have a tremendous amount of structure , and their decomposition is a powerful tool in a variety of applications, the non-commutative nature of the quaternion product .
Edit intent: coherence
Original:  This gives new insight into the quaternion uncorrelating transform (QUT) and forms a basis for the proposed quaternion approximate uncorrelating transform (QAUT) which simultaneously diagonalises all four covariance matrices associated with improper quaternion signals.
Revised:  This gives new insights into the quaternion uncorrelating transform (QUT) and forms a basis for the proposed quaternion approximate uncorrelating transform (QAUT) which simultaneously diagonalises all four covariance matrices associated with improper quaternion signals.
Edit intent: fluency
Original:  The effectiveness of the proposed uncorrelating transforms is validated by simulations on  synthetic and real-world quaternion-valued signals.
Revised:  The effectiveness of the proposed uncorrelating transforms is validated by simulations on both synthetic and real-world quaternion-valued signals.
Edit intent: clarity
Original: In this paper, we propose a novel ranking approach for collaborative filtering based on Neural-Networks that jointly learns a new representation of users and items in an embedded space as well as the preference relation of users over  pairs of items.
Revised: In this paper, we propose a novel ranking framework for collaborative filtering based on Neural-Networks that jointly learns a new representation of users and items in an embedded space as well as the preference relation of users over pairs of items.
Edit intent: clarity
Original: In this paper, we propose a novel ranking approach for collaborative filtering based on Neural-Networks that jointly learns a new representation of users and items in an embedded space as well as the preference relation of users over  pairs of items.
Revised: In this paper, we propose a novel ranking approach for collaborative filtering based on Neural-Networks that jointly learns a new representation of users and items in an embedded space as well as the preference relation of users over the pairs of items.
Edit intent: fluency
Original:  The learning objective is based on two ranking losses that control the ability of the model to respect the ordering over the items induced from the users  preferences, as well as, the capacity of the dot-product defined in the learned embedded space to produce the ordering.
Revised:  The learning objective is based on two ranking losses that control the ability of the model to maintain the ordering over the items induced from the users preferences, as well as, the capacity of the dot-product defined in the learned embedded space to produce the ordering.
Edit intent: clarity
Original:  The learning objective is based on two ranking losses that control the ability of the model to respect the ordering over the items induced from the users  preferences, as well as, the capacity of the dot-product defined in the learned embedded space to produce the ordering.
Revised:  The learning objective is based on two ranking losses that control the ability of the model to respect the ordering over the items induced from the users ' preferences, as well as, the capacity of the dot-product defined in the learned embedded space to produce the ordering.
Edit intent: fluency
Original:  The proposed model is by nature suitable for both implicit and explicit feedback and involves the estimation of only very few parameters.
Revised:  The proposed model is by nature suitable for implicit feedback and involves the estimation of only very few parameters.
Edit intent: clarity
Original:  Through extensive experiments on several real-world benchmarks , both explicit and implicit , we show the interest of learning the preference and the embedding simultaneously when compared to learning those separately.
Revised:  Through extensive experiments on several real-world benchmarks on implicit data , we show the interest of learning the preference and the embedding simultaneously when compared to learning those separately.
Edit intent: clarity
Original:  We also demonstrate that our approach is very competitive with the best state-of-the-art collaborative filtering techniques proposed independently for explicit and implicit feedback.
Revised:  We also demonstrate that our approach is very competitive with the best state-of-the-art collaborative filtering techniques proposed for implicit feedback.
Edit intent: clarity
Original: In this paper we study arithmetic computations over non-associative, and non-commutative free polynomials ring F\{x_1,x_2,\ldots,x_n\}.
Revised: In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring F\{x_1,x_2,\ldots,x_n\}.
Edit intent: clarity
Original:  Prior to this work, the non-associative arithmetic model of computation was considered by Hrubes, Wigderson, and Yehudayoff [HWY10] .
Revised:  Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson, and Yehudayoff [HWY10] .
Edit intent: clarity
Original:  We focus on two main problems in algebraic complexity theory: Polynomial Identity Testing (PIT) and polynomial factorization over F\{x_1,x_2,\ldots,x_n\} . We show the following results.
Revised:  We consider Polynomial Identity Testing (PIT) and polynomial factorization over F\{x_1,x_2,\ldots,x_n\} . We show the following results.
Edit intent: clarity
Original:  We focus on two main problems in algebraic complexity theory: Polynomial Identity Testing (PIT) and polynomial factorization over F\{x_1,x_2,\ldots,x_n\} . We show the following results.
Revised:  We focus on two main problems in algebraic complexity theory: Polynomial Identity Testing (PIT) and polynomial factorization over F\{x_1,x_2,\ldots,x_n\} and show the following results.
Edit intent: coherence
Original:  Our result is obtained by a suitable adaptation of the PIT algorithm of Raz-Shpilka [RS05] for non-commutative ABPs.
Revised:  Our result is obtained by a suitable adaptation of the PIT algorithm of Raz-Shpilka [RS05] for noncommutative ABPs.
Edit intent: fluency
Original:  (2) Given an arithmetic circuit C of size s computing a polynomial f\in F \{x_1,x_2,\ldots,x_n\} of degree d, we give an efficient deterministic algorithm to compute the circuits for the irreducible factors of f in time poly(n,s,d) when F=Q.
Revised:  (2) Given an arithmetic circuit C of size s computing a polynomial f\in F \{x_1,x_2,\ldots,x_n\} of degree d, we give an efficient deterministic algorithm to compute circuits for the irreducible factors of f in time poly(n,s,d) when F=Q.
Edit intent: fluency
Original: One of the key concepts in the research on political attitudesis attitude strength . Strong attitudes are durable and impactful, while weak attitudes are fluctuating and inconsequential.
Revised: Attitude strength is a key characteristic of attitudes . Strong attitudes are durable and impactful, while weak attitudes are fluctuating and inconsequential.
Edit intent: clarity
Original:  Here, we test the central postulate of the CAN model that strong attitudes correspond to highly connected attitude networks  .
Revised:  Here, we test the central postulate of the CAN model that highly connected attitude networks .
Edit intent: clarity
Original:  The results show that attitude strength and connectivity of attitude networks are strongly related.
Revised:  We first show that political interest predicts connectivity of attitude networks are strongly related.
Edit intent: clarity
Original: We provide a lean  non-technical exposition on the pricing of path-dependent and European-style derivatives in the Cox-Ross-Rubinstein (CRR) pricing model.
Revised: We provide a lean , non-technical exposition on the pricing of path-dependent and European-style derivatives in the Cox-Ross-Rubinstein (CRR) pricing model.
Edit intent: fluency
Original:  The main tool  for cleaning up the reasoning is by using static hedging arguments.
Revised:  The main tool for cleaning up the reasoning is applying static hedging arguments.
Edit intent: coherence
Original:  While in the case of simple contagion, strategies focused on central nodes are known to be effective, the strategies that are most effective in the case of complex contagion are relatively unknown . Here, we study the strategies that optimize the diffusion of a behavior on a network in the case of complex contagion by comparing algorithms that choose which nodes to target at each  step.
Revised:  While in the case of simple contagion, strategies focused on central nodes are known to be effective, the strategies that are most effective in the case of complex contagion are relatively unknown . Here, we develop algorithms to identify the activities that are optimal to target at each step.
Edit intent: clarity
Original:  While in the case of simple contagion, strategies focused on central nodes are known to be effective, the strategies that are most effective in the case of complex contagion are relatively unknown . Here, we study the strategies that optimize the diffusion of a behavior on a network in the case of complex contagion by comparing algorithms that choose which nodes to target at each  step.
Revised:  While in the case of simple contagion, strategies focused on central nodes are known to be effective, the strategies that are most effective in the case of complex contagion are relatively unknown . Here, we study the strategies that optimize the diffusion of a behavior on a network in the case of complex contagion by comparing algorithms that choose which nodes to target at each time step.
Edit intent: clarity
Original:  Additionally, the performance gap between our algorithm and alternative approaches seems to widen with growing instance size.
Edit intent: coherence
Original:  Our algorithms are self-stabilizing and can be implemented in a variety of standard models of mobile robots operating in Look-Compute-Move cycles.
Revised:  Our algorithms can be implemented in a variety of standard models of mobile robots operating in Look-Compute-Move cycles.
Edit intent: coherence
Original:  The algorithms are self-stabilizing even in such a memoryless model, in the sense that the searchers may be located anywhere in the polygon when the execution begins, and hence the information they initially encode is arbitrary  .
Revised:  We stress that such memoryless searchers may be located anywhere in the polygon when the execution begins, and hence the information they initially encode is arbitrary .
Edit intent: clarity
Original: Optimization models based on coherent regret measures and coherent risk measures are of essential importance in financial management and reliability engineering .
Revised: Optimization models based on coherent regret measures and coherent risk measures are of essential importance in financial management and business operations .
Edit intent: clarity
Original:  This paper studies the dual representations of these two measures .
Revised:  This paper begins with a study on the dual representations of these two measures .
Edit intent: clarity
Original:  This paper studies the dual representations of these two measures .
Revised:  This paper studies the dual representations of risk and regret measures and their impact on modeling multistage decision making under uncertainty .
Edit intent: clarity
Original:  The relationship between risk envelopes and regret envelopes are established by using the Lagrangian duality theory.
Revised:  The relationship between risk envelopes and regret envelopes is established by using the Lagrangian duality theory.
Edit intent: fluency
Original: Optimization models based on coherent and averse risk measures are of essential importance in financial management and business operations.
Edit intent: coherence
Original:  The relationship between risk envelopes and regret envelopes is established by using the Lagrangian duality theory.
Revised:  A relationship between risk envelopes and regret envelopes is established by using the Lagrangian duality theory.
Edit intent: fluency
Original:  It is then pointed out that such a relationship opens a door to a decomposition scheme, called progressive hedging, for solving multistage risk minimization and regret minimization problems.
Revised:  Such a relationship opens a door to a decomposition scheme, called progressive hedging, for solving multistage risk minimization and regret minimization problems.
Edit intent: coherence
Original:  While inclusion checks are known to capture verification problems, two-player games generalise this relationship to include program synthesis.
Revised:  While inclusion checks are known to capture verification problems, two-player games generalize this relationship to include program synthesis.
Edit intent: fluency
Original:  While inclusion checks are known to capture verification problems, two-player games generalise this relationship to include program synthesis.
Revised:  While inclusion checks are known to capture verification problems, two-player games generalise this relationship to program synthesis.
Edit intent: clarity
Original:  The goal of the existential player is to avoid producing a word that lies outside of a regular language of unsafe words.
Revised:  The goal of the existential player is to avoid producing a word that lies outside of a regular language of safe words.
Edit intent: fluency
Original:  This second domain is therefore finite and we obtain, via standard fixed point techniques, a direct algorithm for the analysis of two-player inclusion games.
Revised:  This second domain is therefore finite and we obtain, via standard fixed-point techniques, a direct algorithm for the analysis of two-player inclusion games.
Edit intent: fluency
Original:  We show, via a second instantiation of the framework, that our finite domain can be optimised , leading to a (k+1)EXP algorithm for order-k recursion schemes.
Revised:  We show, via a second instantiation of the framework, that our finite domain can be optimized , leading to a (k+1)EXP algorithm for order-k recursion schemes.
Edit intent: fluency
Original:  Since our approach is based on standard Kleene iteration, existing techniques and tools for fixed point computations can be applied.
Revised:  Since our approach is based on standard Kleene iteration, existing techniques and tools for fixed-point computations can be applied.
Edit intent: fluency
Original:  Active flows on hexagonal arrays preserve input information over longer distances than their passive counterparts and are highly sensitive to bulk topological defects, which can be inferred holographically from marginal input-output distributions  .
Revised:  Active flows on hexagonal arrays preserve input information over longer distances than their passive counterparts and are highly sensitive to bulk topological defects, whose presence can be inferred holographically from marginal input-output distributions .
Edit intent: clarity
Original:  Active flows on hexagonal arrays preserve input information over longer distances than their passive counterparts and are highly sensitive to bulk topological defects, which can be inferred holographically from marginal input-output distributions  .
Revised:  Active flows on hexagonal arrays preserve input information over longer distances than their passive counterparts and are highly sensitive to bulk topological defects, which can be inferred from marginal input-output distributions .
Edit intent: clarity
Original: In this paper we determine the class of quantum states whose density matrix representation can be derived from graph Laplacian matrices associated with a weighted directed graph and we call them graph Laplacian quantum states.
Revised: In this paper we determine the class of quantum states whose density matrix representation can be derived from graph Laplacian matrices associated with a weighted directed graph and call them graph Laplacian quantum states.
Edit intent: fluency
Original:  Then we obtain structural properties of these graphs such that the corresponding graph Laplacian states have zero quantum discord by investigating structural properties of clustered graphs which provide a family of commuting normal matrices formed by the blocks of its Laplacian matrices .
Revised:  We find the graph-theoretic conditions for zero and non-zero quantum discord for these states .
Edit intent: clarity
Original:  In this work, the use of graph metrics is employed in network estimation by developing optimisation methods that incorporate prior knowledge of a network's topology.
Revised:  In this work, graph metrics are used in network estimation by developing optimisation methods that incorporate prior knowledge of a network's topology.
Edit intent: clarity
Original:  The derivatives of graph metrics are used in gradient descent schemes for weighted undirected network denoising, network decomposition , and network completion .
Revised:  The derivatives of graph metrics are used in gradient descent schemes for weighted undirected network denoising, network completion , and network completion .
Edit intent: clarity
Original:  The derivatives of graph metrics are used in gradient descent schemes for weighted undirected network denoising, network decomposition , and network completion .
Revised:  The derivatives of graph metrics are used in gradient descent schemes for weighted undirected network denoising, network decomposition , and network decomposition .
Edit intent: clarity