wanyu/IteraTeR_v2 huggingface dataset:
Original:  It also proposes an axiomatization of inconsistency in pairwise comparisons  which is independent of any method of approximation or the inconsistency indicator definition (e.g., AHP)
Revised:  It also proposes an axiomatization of inconsistency in pairwise comparisons and propose an axiomatization which is independent of any method of approximation or the inconsistency indicator definition (e.g., AHP)
Edit intent: coherence
Original: Volatility clustering, long-range dependence, non-Gaussianity and anomalous scaling are all well-known stylized facts of financial assets return dynamics.
Revised: Volatility clustering, long-range dependence, and non-Gaussian scaling are stylized facts of financial assets return dynamics.
Edit intent: clarity
Original:  These elements  have a relevant impact on the aptness of models for the pricing of options written on financial assets.
Revised:  These elements have a relevant impact on the pricing of options written on financial assets.
Edit intent: clarity
Original:  Using these results, we study the diversity behavior of MRC in the high-reliability regime and obtain the critical density of simultaneous transmissions for a given outage constraint.
Revised:  Using these results, we study the diversity behavior of MRC and characterize the critical density of simultaneous transmissions for a given outage constraint.
Edit intent: clarity
Original: We investigate what aspects of empirical temporal networks of human dyadic relationships that are important to disease spreading.
Revised: We investigate what aspects of empirical temporal networks of human contacts are important to disease spreading.
Edit intent: clarity
Original:  The picture we find is that the start time and duration of dyadic relationships , and the total number of contacts during the relationships , are essential to predict outbreaks.
Revised:  The picture we find is that the start time and duration of dyadic relationships , and the total number of contacts over a link , are essential to predict outbreaks.
Edit intent: clarity
Original:  I.e. , a simplified picture of these empirical datasets that suffices for epidemiological purposes is that relationships are born, is active with some intensity, and die .
Revised:  In other words , a simplified picture of these empirical datasets that suffices for epidemiological purposes is that relationships are born, is active with some intensity, and die .
Edit intent: coherence
Original:  I.e. , a simplified picture of these empirical datasets that suffices for epidemiological purposes is that relationships are born, is active with some intensity, and die .
Revised:  I.e. , a simplified picture of these empirical data sets that suffices for epidemiological purposes is that relationships are born, is active with some intensity, and die .
Edit intent: clarity
Original:  I.e. , a simplified picture of these empirical datasets that suffices for epidemiological purposes is that relationships are born, is active with some intensity, and die .
Revised:  I.e. , a simplified picture of these empirical datasets that suffices for epidemiological purposes is that links are born, is active with some intensity, and die .
Edit intent: fluency
Original: Let X and Y be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group G. Assuming that Y is d-connected and dim Xis at most\le 2d,  we provide an algorithm that computes the set of all equivariant homotopy classes of equivariant continuous maps |X| --> \to |Y|;
Revised: Let X and Y be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group G. Assuming that Y is d-connected and \dim X\le 2d, we provide an algorithm that computes the set of all equivariant homotopy classes of equivariant continuous maps |X| --> \to |Y|;
Edit intent: clarity
Original: Let X and Y be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group G. Assuming that Y is d-connected and dim Xis at most\le 2d,  we provide an algorithm that computes the set of all equivariant homotopy classes of equivariant continuous maps |X| --> \to |Y|;
Revised: Let X and Y be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group G. Assuming that Y is d-connected and dim Xis at most\le 2d, we provide an algorithm that computes the set of all equivariant homotopy classes of equivariant continuous maps |X| \to |Y|;
Edit intent: coherence
Original:  This yields the first algorithm for deciding topological embeddability of a k-dimensional finite simplicial complex into R^n when k is at most (2/ 3 ) \le \le n-1.
Revised:  This yields the first algorithm for deciding topological embeddability of a k-dimensional finite simplicial complex into R^n when k is at most (2/ 3 \le \le n-1.
Edit intent: fluency
Original:  This yields the first algorithm for deciding topological embeddability of a k-dimensional finite simplicial complex into R^n when k is at most (2/ 3 ) \le \le n-1.
Revised:  This yields the first algorithm for deciding topological embeddability of a k-dimensional finite simplicial complex into R^n when k is at most (2/ 3 ) \le k\le n-1.
Edit intent: fluency
Original:   Mileyko and his collaborators made the first study of the properties of the Fr\'{e mean in ( D _p,W_p), the space of persistence diagrams equipped with the p-th Wasserstein metric.
Revised:  Mileyko and his collaborators made the first study of the properties of the Fr\'echet mean in ( D _p,W_p), the space of persistence diagrams equipped with the p-th Wasserstein metric.
Edit intent: fluency
Original:  As an unfortunate consequence, one sees that the means of a continuously-varying set of diagrams do not themselves  vary continuously, which presents obvious problems when trying to extend the Fr\'{e mean definition to the realm of vineyards.
Revised:  The means of a continuously-varying set of diagrams do not themselves vary continuously, which presents obvious problems when trying to extend the Fr\'{e mean definition to the realm of vineyards.
Edit intent: coherence
Original:  As an unfortunate consequence, one sees that the means of a continuously-varying set of diagrams do not themselves  vary continuously, which presents obvious problems when trying to extend the Fr\'{e mean definition to the realm of vineyards.
Revised:  As an unfortunate consequence, one sees that the means of a continuously-varying set of diagrams do not themselves vary continuously, which presents obvious problems when trying to extend the Fr\'echet mean definition to the realm of vineyards.
Edit intent: fluency
Original:  in a nutshell, the mean of a set of diagrams will be a weighted sum of atomic measures, where each atom is itself the (Fr\'{e a perturbation of the input diagrams.
Revised:  in a nutshell, the mean of a set of diagrams will be a weighted sum of atomic measures, where each atom is itself a persistence diagram determined using a perturbation of the input diagrams.
Edit intent: clarity
Original:  We develop a simple method for parameter rescaling that provides the best possible computational performance for a given error tolerance , and a detailed theoretical analysis of the robustness of rescaling across the parameter space.
Revised:  We develop a simple method for parameter rescaling that provides the best possible computational performance for a given error tolerance . We perform a detailed theoretical analysis of the robustness of rescaling across the parameter space.
Edit intent: coherence
Original:  Based on the generated SNP frequencies, the expected balancing selection signature under the trench warfare dynamics appears to be only observable in parasite sequences in  a limited range of parameter , if effective population sizes are sufficiently large (>1000) and if selectionhas been acting for a long time (>4N generations).
Revised:  Based on the generated SNP frequencies, the expected balancing selection signature under the trench warfare dynamics appears to be only observable in parasite sequences in a limited parameter space with high effective population sizes are sufficiently large (>1000) and if selectionhas been acting for a long time (>4N generations).
Edit intent: clarity
Original:  Numerical simulations show that our method outperforms previous ones on both synthetic and real networks, in some cases by a very large margin.
Revised:  Numerical simulations show that our method outperforms previous ones on both synthetic and real networks, often by a very large margin.
Edit intent: clarity
Original: Energy landscape theory describes how a full-length protein can attain its native fold by sampling only a tiny fraction of all possible structures.
Revised: Energy landscape theory describes how a full-length protein can attain its native fold after sampling only a tiny fraction of all possible structures.
Edit intent: fluency
Original:  Although protein folding is now understood to be concomitant with synthesis on the ribosome , there have been few attempts to modify energy landscape theory by accounting for cotranslational folding.
Revised:  Although protein folding is now understood to be concomitant with synthesis on the ribosome there have been few attempts to modify energy landscape theory by accounting for cotranslational folding.
Edit intent: fluency
Original:  This paper introduces a model for cotranslational folding that leads to a natural definition of a nested energy landscapes .
Revised:  This paper introduces a model for cotranslational folding that leads to a natural definition of a nested energy landscape .
Edit intent: fluency
Original: We give a strongly polynomial algorithm  for the generalized flow maximization problem.
Revised: A strongly polynomial algorithm for the generalized flow maximization problem.
Edit intent: clarity
Original:  Our algorithm uses a new variant of the scaling technique, called continuous scaling.
Revised:  It uses a new variant of the scaling technique, called continuous scaling.
Edit intent: clarity
Original:  This guarantees that within a strongly polynomial number of steps, we are able to identify an arc that must be tight in every dual optimal solution, and thus can be contracted.
Revised:  The main measure of progress is that within a strongly polynomial number of steps, we are able to identify an arc that must be tight in every dual optimal solution, and thus can be contracted.
Edit intent: clarity
Original:  This guarantees that within a strongly polynomial number of steps, we are able to identify an arc that must be tight in every dual optimal solution, and thus can be contracted.
Revised:  This guarantees that within a strongly polynomial number of steps, an arc can be identified that must be tight in every dual optimal solution, and thus can be contracted.
Edit intent: clarity
Original:  Of late, this has extended to cancer biology to understand the dynamics of disease progression as a game between competing cellular phenotypes.
Revised:  Of late, this has extended to cancer biology to understand the dynamics of disease progression as an evolutionary game between cellular phenotypes.
Edit intent: clarity
Original:  A major assumption in this modeling paradigm is that the population is inviscid: the probability of a player with a given phenotypic strategy interacting with another depends exclusively on the respective abundance of those strategies in the population.
Revised:  A typical assumption in this modeling paradigm is that the population is inviscid: the probability of a player with a given phenotypic strategy interacting with another depends exclusively on the respective abundance of those strategies in the population.
Edit intent: clarity
Original:  A major assumption in this modeling paradigm is that the population is inviscid: the probability of a player with a given phenotypic strategy interacting with another depends exclusively on the respective abundance of those strategies in the population.
Revised:  A major assumption in this modeling paradigm is that the probability of a player with a given phenotypic strategy interacting with another depends exclusively on the respective abundance of those strategies in the population.
Edit intent: clarity
Original:  A major assumption in this modeling paradigm is that the population is inviscid: the probability of a player with a given phenotypic strategy interacting with another depends exclusively on the respective abundance of those strategies in the population.
Revised:  A major assumption in this modeling paradigm is that the population is inviscid: the probability of a given phenotypic strategy interacting with another depends exclusively on the respective abundance of those strategies in the population.
Edit intent: clarity
Original:  A major assumption in this modeling paradigm is that the population is inviscid: the probability of a player with a given phenotypic strategy interacting with another depends exclusively on the respective abundance of those strategies in the population.
Revised:  A major assumption in this modeling paradigm is that the population is inviscid: the probability of a player with a given phenotypic strategy interacting with another depends exclusively on the abundance of those strategies in the population.
Edit intent: clarity
Original:  In this study we use a recently developed mathematical tool, the Ohtsuki-Nowak transform , to study the effect of interaction neighborhood size on a canonical evolutionary cancer game: go vs. grow .
Revised:  In this study we use a recently developed mathematical tool, the Ohtsuki-Nowak transform to introduce spatial structure to the go vs. grow .
Edit intent: clarity
Original:  In this study we use a recently developed mathematical tool, the Ohtsuki-Nowak transform , to study the effect of interaction neighborhood size on a canonical evolutionary cancer game: go vs. grow .
Revised:  In this study we use a recently developed mathematical tool, the Ohtsuki-Nowak transform , to study the effect of interaction neighborhood size on a canonical evolutionary cancer game: go vs. grow game. Results:
Edit intent: coherence
Original:  We show that spatial structure promotes invasive (go) strategy.
Revised:  We show that spatial structure can promote the invasive (go) strategy.
Edit intent: clarity
Original:  This edge effect allows a tumour with no invasive phenotypes expressed internally to have a polyclonal boundary with both invasive and non-invasive cells.
Revised:  This edge effect allows a tumour with no invasive phenotypes expressed internally to have a polyclonal boundary with invasive cells.
Edit intent: clarity
Original:  We focus on evolutionary game dynamics between competing cancer cells , but we anticipate that our approach can be extended to games between other types of players where interaction neighborhoods change at a static system boundary .
Revised:  We focus on evolutionary game dynamics between competing cancer cells , but we anticipate that our approach can be extended to games between other types of players where interaction neighborhoods change at fixed system boundaries .
Edit intent: clarity
Original:  The feedback vertex set problem consists of constructing a FVS of size less than  certain given value.
Revised:  The feedback vertex set problem consists of constructing a FVS of size less than a certain given value.
Edit intent: fluency
Original:  This combinatorial optimization problem has many practical applications, but it can be extremely difficult to solve as it belongs to the nondeterministic polynomial-complete (NP-complete) class of worst-case computational complexity.
Revised:  This combinatorial optimization problem has many practical applications, but it is in the nondeterministic polynomial-complete (NP-complete) class of worst-case computational complexity.
Edit intent: clarity
Original:  This combinatorial optimization problem has many practical applications, but it can be extremely difficult to solve as it belongs to the nondeterministic polynomial-complete (NP-complete) class of worst-case computational complexity.
Revised:  This combinatorial optimization problem has many practical applications, but it can be extremely difficult to solve as it belongs to the nondeterministic polynomial-complete class of worst-case computational complexity.
Edit intent: clarity
Original:  A key novelty of our model is that the global cycle constraints are represented through the local constraints on all the edges of the graph . After this mapping from the global cycle constraints to the local edge constraints, the FVS problem can then be treated by distributed message-passing procedures such as belief propagation.
Revised:  In our model the global cycle constraints are represented through the local constraints on all the edges of the graph . After this mapping from the global cycle constraints to the local edge constraints, the FVS problem can then be treated by distributed message-passing procedures such as belief propagation.
Edit intent: clarity
Original:  A key novelty of our model is that the global cycle constraints are represented through the local constraints on all the edges of the graph . After this mapping from the global cycle constraints to the local edge constraints, the FVS problem can then be treated by distributed message-passing procedures such as belief propagation.
Revised:  A key novelty of our model is that the global cycle constraints are represented through the local constraints on all the edges of the graph , and they are then treated by distributed message-passing procedures such as belief propagation.
Edit intent: clarity
Original:  We demonstrate that the belief propagation-guided decimation algorithm based on our spin glass model is able to construct nearly optimal feedback vertex sets for single random graph instances  .
Revised:  Our belief propagation-guided decimation algorithm based on our spin glass model is able to construct nearly optimal feedback vertex sets for single random graph instances .
Edit intent: clarity
Original:  We demonstrate that the belief propagation-guided decimation algorithm based on our spin glass model is able to construct nearly optimal feedback vertex sets for single random graph instances  .
Revised:  We demonstrate that the belief propagation-guided decimation algorithm can construct nearly optimal feedback vertex sets for single random graph instances .
Edit intent: clarity
Original:  We also construct a spin glass model for the FVS problem on a directed graph.
Revised:  We also design a spin glass model for the FVS problem on a directed graph.
Edit intent: clarity
Original:  A tester may test halting on the empty input or when the tested program is given to itself as its input .
Revised:  A tester may test halting on the empty input , does a given program halt when given itself as its input .
Edit intent: clarity
Original:  It may also test whether a given program halts on a given input.
Revised:  It may also test whether a given program halt on a given input.
Edit intent: fluency
Original: We present a control framework for achieving encirclement of a 3D target using a multi-robot system.
Revised: We present a control framework for achieving encirclement of a target moving in 3D using a multi-robot system.
Edit intent: clarity
Original:  The proposed strategy is validated through simulations on kinematic point robots and quadrotor UAVs, as well as experiments on differential-drive wheeled mobile robots.
Revised:  We validate the proposed strategy through simulations on kinematic point robots and quadrotor UAVs, as well as experiments on differential-drive wheeled mobile robots.
Edit intent: clarity
Original:  In this paper, we analyze the impact on uplink relaying performance of node distances, relay height and line-of-sight conditions .
Revised:  In this paper, we analyze the impact on relaying performance of node distances, relay height and line-of-sight conditions .
Edit intent: clarity
Original:  The second objective is to estimate the energy efficiency and performance upper-bounds of a relay-aided cell , considering both a practical full decode-forward scheme and an energy-optimized partial decode-forward scheme.
Revised:  The second objective is to estimate the maximum cell coverage of a relay-aided cell , considering both a practical full decode-forward scheme and an energy-optimized partial decode-forward scheme.
Edit intent: clarity
Original:  The maximum cell coverage is obtained given power constraints  and conversely, the averaged energy consumption is given as a function of the cell coverage .
Revised:  The maximum cell coverage is obtained given power constraints , and conversely, the averaged energy consumption is given as a function of the cell coverage .
Edit intent: fluency
Original:  However, away from this optimum for relay location, performance rapidly degrades and more advanced coding scheme, such as partial decode-forward, is needed to maintain good performance and allow more freedom in the relay placement.
Revised:  However, away from this optimum relay location, performance rapidly degrades and more advanced coding scheme, such as partial decode-forward, is needed to maintain good performance and allow more freedom in the relay placement.
Edit intent: clarity
Original:  Finally, we define a trade-off between cell coverage and average energy efficiency, and show that moderate coverage extension is more energy-efficient .
Revised:  Finally, we define a trade-off between cell coverage and energy efficiency, and show that moderate coverage extension is more energy-efficient .
Edit intent: clarity
Original: In this paper, we propose cost-aware automatic program repair as a step toward integrating expert human intent and intuition into an automated program repair framework.
Revised: In this paper, we propose cost-aware automatic program repair as a step toward integrating programmer intent and intuition into an automated program repair framework.
Edit intent: clarity
Original: In this paper, we propose cost-aware automatic program repair as a step toward integrating expert human intent and intuition into an automated program repair framework.
Revised: In this paper, we propose cost-aware automatic program repair as a step toward integrating expert human intent and intuition in automated program repair framework.
Edit intent: fluency
Original:  Given an erroneous program P, a set U of permissible update schemas, a cost function that associates costs with applying update schemas to program statements, and a total repair budget delta, the goal of cost-aware automatic program repair is to compute a program P' such that : P' is correct, P' is obtained by modifying P using a set of update schemas from U, and the total modification cost does not exceed delta.
Revised:  Given an erroneous program P, a cost function that associates costs with applying update schemas to program statements, and a total repair budget delta, the goal of cost-aware automatic program repair is to compute a program P' such that : P' is correct, P' is obtained by modifying P using a set of update schemas from U, and the total modification cost does not exceed delta.
Edit intent: clarity
Original:  Given an erroneous program P, a set U of permissible update schemas, a cost function that associates costs with applying update schemas to program statements, and a total repair budget delta, the goal of cost-aware automatic program repair is to compute a program P' such that : P' is correct, P' is obtained by modifying P using a set of update schemas from U, and the total modification cost does not exceed delta.
Revised:  Given an erroneous program P, a set U of permissible update schemas, a cost function associated with permissible statement modifications, the goal is to ensure that the total program modification cost does not exceed delta.
Edit intent: clarity
Original: How is the published scientific literature used by scientific community?
Revised: How does the published scientific literature used by scientific community?
Edit intent: clarity