wanyu/IteraTeR_v2 huggingface dataset:
Original:  In the opposite case, when the networks have small numbers of edges,  P(s) becomes the Poisson distribution.
Revised:  In the opposite case, when the networks have small numbers of edges, the distribution P(s) becomes the Poisson distribution.
Edit intent: clarity
Original:  We make use of an effective formula on the number of fixed degree irreducible polynomials in a given residue class.
Revised:  We make use of an effective formula for the number of fixed degree irreducible polynomials in a given residue class.
Edit intent: fluency
Original:  In particular, we present the " reign worm" which allows us to fully compromise test-setups in less than 100 seconds.
Revised:  In particular, we present the " rein worm" which allows us to fully compromise test-setups in less than 100 seconds.
Edit intent: fluency
Original:  To learn such a continuous disease score one could infer a latent variable from dynamic omics data such as RNA-seq that correlates with an outcome of interest such as survival time.
Revised:  To learn such a continuous disease score one could infer a latent variable from dynamic "omics" data such as RNA-seq that correlates with an outcome of interest such as survival time.
Edit intent: fluency
Original:  We apply our model to TCGA colorectal cancer RNA-seq data and demonstrate how incorporating microsatellite-instability (MSI) and metastatic status as external covariates allows us to identify genes that stratify patients on an immune-response trajectory.
Revised:  We apply our model to TCGA colorectal cancer RNA-seq data and demonstrate how incorporating microsatellite-instability (MSI) status as an external covariate allows us to identify genes that stratify patients on an immune-response trajectory.
Edit intent: clarity
Original:  When there is no delay, classical large deviations theory quantifies rare events such as escapes from nominally stable fixed points.
Revised:  When there is no delay, classical large deviations theory quantifies rare events such as escapes from metastable fixed points.
Edit intent: clarity
Original:  Near such fixed points  one can approximate nonlinear delay SDEs by linear delay SDEs.
Revised:  Near such fixed points , one can approximate nonlinear delay SDEs by linear delay SDEs.
Edit intent: fluency
Original:  Go can only detect global deadlocks at runtime, but provides no compile-time protection against all too common communication mis-matches or partial deadlocks.
Revised:  Go can only detect global deadlocks at runtime, but provides no compile-time protection against all too common communication mismatches or partial deadlocks.
Edit intent: fluency
Original:  This restriction allows us to implement a decision procedure for liveness and safety in types which in turn statically ensures liveness and safety in Go programs.
Revised:  This restriction allows us to implement procedures to check for liveness and safety in types which in turn statically ensures liveness and safety in Go programs.
Edit intent: clarity
Original:  This restriction allows us to implement a decision procedure for liveness and safety in types which in turn statically ensures liveness and safety in Go programs.
Revised:  This restriction allows us to implement a decision procedure for liveness and safety in types which in turn approximates liveness and safety in Go programs.
Edit intent: clarity
Original:  We have implemented a type inference and decision procedures in a tool-chain and tested it against publicly available Go programs  } .
Revised:  We have implemented a type inference and liveness and safety checks in a tool-chain and tested it against publicly available Go programs } .
Edit intent: clarity
Original:  Note: This is a revised  version of a paper that appeared in POPL 2017, see \S 9 for details.
Revised:  Note: This is a revised version of a paper that appeared in POPL 2017, see 9 for details.
Edit intent: clarity
Original: Efficient mobility management techniques in wireless networks are critical in providing seamless connectivity and session continuity between the user equipment (UE) and the network during mobility.
Revised: Efficient mobility management techniques are critical in providing seamless connectivity and session continuity between the user equipment (UE) and the network during mobility.
Edit intent: clarity
Original: Efficient mobility management techniques in wireless networks are critical in providing seamless connectivity and session continuity between the user equipment (UE) and the network during mobility.
Revised: Efficient mobility management techniques in wireless networks are critical in providing seamless connectivity and session continuity between a mobile node and the network during mobility.
Edit intent: clarity
Original:  We compare the mobility costs with those of the IETF standardized NetLMM protocol , Proxy Mobile IPv6 (PMIPv6).
Revised:  We compare the mobility costs with those of the IETF standardized solution , Proxy Mobile IPv6 (PMIPv6).
Edit intent: clarity
Original:  Both analysis and simulation results show the significant gain in the total cost of using an ICN core to facilitate NetLMM mobility for IP end users .
Revised:  Both analysis and simulation results show the significant gain in the total network cost when using our proposed solution, compared to its counterpart .
Edit intent: clarity
Original:  We explain how this fact is related to a statement, found in some literature, that an instability detected by the von Neumann analysis for a given numerical scheme implies an instability of that scheme with arbitrary (i.e., non-periodic) BC  . We also show that, and explain why, for the MoC employing some other ODE solvers, stability of the modes may be unaffected by the BC.
Revised:  This fact contradicts a statement, found in some literature, that an instability detected by the von Neumann analysis for a given numerical scheme implies an instability of that scheme with arbitrary (i.e., non-periodic) BC . We also show that, and explain why, for the MoC employing some other ODE solvers, stability of the modes may be unaffected by the BC.
Edit intent: clarity
Original:  This comparison allows a precise discussion about the relative merits of each programming abstraction.
Revised:  This comparison allows a precise discussion about the relative expressiveness of each programming abstraction.
Edit intent: clarity
Original:  These comprise syntax, operational semantics, a natural type-and-effect system, and, for handlers and reflection, a set-theoretic denotational semantics.
Revised:  These comprise syntax, operational semantics, a natural type-and-effect system, and, for effect handlers and monadic reflection, a set-theoretic denotational semantics.
Edit intent: clarity
Original: We study super-replication of contingent claims in markets with fixed transaction costs.
Revised: We study super--replication of contingent claims in markets with fixed transaction costs.
Edit intent: fluency
Original:   The first result in this paper reveals that in reasonable continuous time financial market  the super--replication price is prohibitively costly and leads to trivial buy--and--hold strategies.
Revised:  The first result in this paper reveals that in reasonable continuous time financial market models the super--replication price is prohibitively costly and leads to trivial buy--and--hold strategies.
Edit intent: clarity
Original:  Our second result is derives non trivial scaling limits of super--replication prices in the binomial models with small fixed costs.
Revised:  Our second result derives nontrivial scaling limits of super--replication prices in the binomial models with small fixed costs.
Edit intent: fluency
Original:  Our second result is derives non trivial scaling limits of super--replication prices in the binomial models with small fixed costs.
Revised:  Our second result is derives non trivial scaling limits of super--replication prices for binomial models with small fixed costs.
Edit intent: clarity
Original:  In this letter a novel reversible full adder-subtractor circuit based on QCA is proposed.
Revised:  In this paper a novel reversible full adder-subtractor circuit based on QCA is proposed.
Edit intent: clarity
Original: Aiming at automatic, convenient and non-instrusive motion capture, this paper presents the new generation markerless motion capture technique, the FlyCap system, to capture surface motions of moving characters using multiple autonomous flying cameras (autonomous unmanned aerial vehicle (UAV) integrated with a RGBD video camera).
Revised: Aiming at automatic, convenient and non-instrusive motion capture, this paper presents a new generation markerless motion capture technique, the FlyCap system, to capture surface motions of moving characters using multiple autonomous flying cameras (autonomous unmanned aerial vehicle (UAV) integrated with a RGBD video camera).
Edit intent: fluency
Original: Aiming at automatic, convenient and non-instrusive motion capture, this paper presents the new generation markerless motion capture technique, the FlyCap system, to capture surface motions of moving characters using multiple autonomous flying cameras (autonomous unmanned aerial vehicle (UAV) integrated with a RGBD video camera).
Revised: Aiming at automatic, convenient and non-instrusive motion capture, this paper presents the new generation markerless motion capture technique, the FlyCap system, to capture surface motions of moving characters using multiple autonomous flying cameras (autonomous unmanned aerial vehicles (UAV) integrated with a RGBD video camera).
Edit intent: fluency
Original: Aiming at automatic, convenient and non-instrusive motion capture, this paper presents the new generation markerless motion capture technique, the FlyCap system, to capture surface motions of moving characters using multiple autonomous flying cameras (autonomous unmanned aerial vehicle (UAV) integrated with a RGBD video camera).
Revised: Aiming at automatic, convenient and non-instrusive motion capture, this paper presents the new generation markerless motion capture technique, the FlyCap system, to capture surface motions of moving characters using multiple autonomous flying cameras (autonomous unmanned aerial vehicle (UAV) each integrated with an RGBD video camera).
Edit intent: clarity
Original:  Quantitative and qualitative experimental results demonstrate the competent and plausible surface and motion reconstruction results .
Revised:  Quantitative and qualitative experimental results demonstrate the competent and plausible surface and motion reconstruction results 
Edit intent: fluency
Original:  Our goal, in this work, is to understand and exploit design-induced variation to develop low-cost mechanisms to dynamically find and use the lowest latency  a DRAM chip can reliablyoperate at andthus improve overall system performance while ensuring reliable system operation.
Revised:  Our goal, in this work, is to understand and exploit design-induced variation to develop low-cost mechanisms that can dynamically find and use the lowest latency a DRAM chip can reliablyoperate at andthus improve overall system performance while ensuring reliable system operation.
Edit intent: fluency
Original:  Our goal, in this work, is to understand and exploit design-induced variation to develop low-cost mechanisms to dynamically find and use the lowest latency  a DRAM chip can reliablyoperate at andthus improve overall system performance while ensuring reliable system operation.
Revised:  Our goal, in this work, is to understand and exploit design-induced variation to develop low-cost mechanisms to dynamically find and use the lowest latency at which to operate a DRAM chip can reliablyoperate at andthus improve overall system performance while ensuring reliable system operation.
Edit intent: clarity
Original:  Our goal, in this work, is to understand and exploit design-induced variation to develop low-cost mechanisms to dynamically find and use the lowest latency  a DRAM chip can reliablyoperate at andthus improve overall system performance while ensuring reliable system operation.
Revised:  Our goal, in this work, is to understand and exploit design-induced variation to develop low-cost mechanisms to dynamically find and use the lowest latency a DRAM chip reliably, and, thus, improve overall system performance while ensuring reliable system operation.
Edit intent: clarity
Original: This paper considers the pricing of discretely-sampled variance swaps under the class of equity-interest rate hybridization.
Revised: This paper considers the case of pricing discretely-sampled variance swaps under the class of equity-interest rate hybridization.
Edit intent: clarity
Original:  We implement numerical experiments to evaluate the accuracy of our formula and confirm that the impact of the correlation between the underlying and  interest rate is significant  .
Revised:  Subsequently, we implement numerical experiments to evaluate the accuracy of our formula and confirm that the impact of the correlation between the underlying and interest rate is significant .
Edit intent: coherence
Original:  We implement numerical experiments to evaluate the accuracy of our formula and confirm that the impact of the correlation between the underlying and  interest rate is significant  .
Revised:  We implement numerical experiments to evaluate the accuracy of our pricing formula. Our findings confirmed that the impact of the correlation between the underlying and interest rate is significant .
Edit intent: clarity
Original:  We implement numerical experiments to evaluate the accuracy of our formula and confirm that the impact of the correlation between the underlying and  interest rate is significant  .
Revised:  We implement numerical experiments to evaluate the accuracy of our formula and confirm that the impact of the correlation between the underlying and the interest rate is significant .
Edit intent: fluency
Original: The architecture of eukaryotic coding genes allows the production of several different protein products by genes.
Revised: The architecture of eukaryotic coding genes allows the production of several different protein isoforms by genes.
Edit intent: clarity
Original:  Current gene phylogeny reconstruction methods make use of a single protein product per gene, ignoring information on alternative gene products .
Revised:  Current gene phylogeny reconstruction methods make use of a single protein product per gene, ignoring information on alternative protein isoforms .
Edit intent: clarity
Original:  Here, we propose a new approach for the joint reconstruction of accurate protein trees and gene trees making use of the full set of proteins produced by the genes of a gene family.
Revised:  Here, we propose a new approach for the reconstruction of accurate protein trees and gene trees making use of the full set of proteins produced by the genes of a gene family.
Edit intent: clarity
Original:  Here, we propose a new approach for the joint reconstruction of accurate protein trees and gene trees making use of the full set of proteins produced by the genes of a gene family.
Revised:  Here, we propose a new approach for the joint reconstruction of accurate gene trees and protein trees accounting for the production of alternative protein isoforms by the genes of a gene family.
Edit intent: clarity
Original:  We provide algorithmic exact and heuristic solutions for some versions of the two problems, and we present examples of application to the reconstruction of phylogenetic trees for gene families of the Ensembl database .
Revised:  We provide algorithmic exact and heuristic solutions for some versions of the problems .
Edit intent: clarity
Original:  We extend the concept of reconciliation to protein trees, and we define a new reconciliation problem called MinDRGT that consists in finding a gene tree that minimizes a double reconciliation cost with a given protein tree and a given species tree.
Revised:  We extend the concept of reconciliation to protein trees, and we define a new reconciliation problem called MinDRGT that consists in finding a gene tree that minimizes a double reconciliation cost with a given protein tree and a given species tree.
Edit intent: fluency
Original:  We define a second problem called MinDRPGT that consists in finding a protein tree and a gene tree minimizing a double reconciliation cost, given a species tree and a set of protein subtrees.
Revised:  We define a second problem called MinDRPGT that consists in finding a protein tree and a gene tree minimizing a double reconciliation cost, given a species tree and a set of protein subtrees.
Edit intent: fluency
Original:  The reduced order model is then obtained by Galerkin projection, where the tangent manifold at the current reduced configuration is used to project the discretized equations of motion.
Revised:  The reduced order model is then obtained by Galerkin projection, where the configuration-dependent tangent space of the manifold is used to project the discretized equations of motion.
Edit intent: clarity
Original: The solution of today's complex problems requires the grouping of task forces whose members are usually connected remotely over long physical distances and different time zones , so the importance of understanding the effects of imposed communication patterns (i.e., who can communicate with whom) on group performance .
Revised: The solution of today's complex problems requires the grouping of task forces whose members are usually connected remotely over long physical distances and different time zones . Hence, understanding the effects of imposed communication patterns (i.e., who can communicate with whom) on group performance .
Edit intent: coherence
Original:  Here we use an agent-based model to explore the influence of the betweenness centrality of the nodes on the time the group requires to find the global maxima of families of NK-fitness landscapes.
Revised:  Here we use an agent-based model to explore the influence of the betweenness centrality of the nodes on the time the group requires to find the global maxima of NK-fitness landscapes.
Edit intent: clarity
Original:  The agents cooperate by broadcasting messages  informing on their fitness to their neighbors  and use this information to copy the more successful agent in their neighborhood.
Revised:  The agents cooperate by broadcasting messages , informing on their fitness to their neighbors and use this information to copy the more successful agent in their neighborhood.
Edit intent: fluency
Original:  The agents cooperate by broadcasting messages  informing on their fitness to their neighbors  and use this information to copy the more successful agent in their neighborhood.
Revised:  The agents cooperate by broadcasting messages informing on their fitness to their neighbors , and use this information to copy the more successful agent in their neighborhood.
Edit intent: fluency
Original:  The agents cooperate by broadcasting messages  informing on their fitness to their neighbors  and use this information to copy the more successful agent in their neighborhood.
Revised:  The agents cooperate by broadcasting messages informing on their fitness to their neighbors and use this information to copy the more successful agents in their neighborhood.
Edit intent: fluency
Original:  We find that for easy tasks (smooth landscapes)  the topology of the communication network has no effect on the performance of the group  and that the more central nodes are the most likely to find the global maximum first.
Revised:  We find that for easy tasks (smooth landscapes) , the topology of the communication network has no effect on the performance of the group and that the more central nodes are the most likely to find the global maximum first.
Edit intent: fluency
Original:  We find that for easy tasks (smooth landscapes)  the topology of the communication network has no effect on the performance of the group  and that the more central nodes are the most likely to find the global maximum first.
Revised:  We find that for easy tasks (smooth landscapes) the topology of the communication network has no effect on the performance of the group , and that the more central nodes are the most likely to find the global maximum first.
Edit intent: fluency
Original:  For these tasks  the performances of individual nodes are strongly influenced by the agents dispositions to cooperate and by the particular realizations of the rugged landscapes.
Revised:  For these tasks , the performances of individual nodes are strongly influenced by the agents dispositions to cooperate and by the particular realizations of the rugged landscapes.
Edit intent: fluency
Original:  We developed a very simple confocal image generator to simulate confocal microscopy images from a known ground truth .
Revised:  We developed a user-friendly software to generate synthetic confocal microscopy images from a known ground truth .
Edit intent: clarity
Original: The physical basis of shortcut edges in a Protein Residue Network (PRN) and their applicability to a simplified protein folding pathway problem is investigated.
Revised: The physical basis of shortcut edges in a Protein Residue Network (PRN) and their applicability to a simplified protein folding pathway problem are investigated.
Edit intent: fluency
Original:  The results show promise , and suggest the dominant influence of native-state topology even for structurally homologous proteins with different preferred folding pathways.
Revised:  The results show promise and suggest the dominant influence of native-state topology even for structurally homologous proteins with different preferred folding pathways.
Edit intent: fluency
Original:  Shortcut edges are enriched with hydrogen bonds, and there is a significant strong negative correlation (Pearson's rho -0.7591) between their relative contact order and the  folding rates of 44 small and structurally diverse proteins.
Revised:  Shortcut edges are enriched with hydrogen bonds, and there is a significant strong negative correlation between their relative contact order and the folding rates of 44 small and structurally diverse proteins.
Edit intent: coherence
Original:  Shortcut edges are enriched with hydrogen bonds, and there is a significant strong negative correlation (Pearson's rho -0.7591) between their relative contact order and the  folding rates of 44 small and structurally diverse proteins.
Revised:  Shortcut edges are enriched with hydrogen bonds, and there is a significant strong negative correlation (Pearson's rho -0.7591) between their relative contact order and the relative folding rates of 44 small and structurally diverse proteins.
Edit intent: fluency
Original:  The initial folding reaction points identified for several single-domain proteins including LB1, GB1, and GB1's two variants NuG1 and NuG2 , by the clustering coefficient computed on the ShortCut Network (SCN), are in agreement with experimental and theoretical evidence.
Revised:  The initial folding reaction points identified for several single-domain proteins including LB1, GB1, and GB1's two variants NuG1 and NuG2 by the clustering coefficient computed on the ShortCut Network (SCN), are in agreement with experimental and theoretical evidence.
Edit intent: fluency
Original:  The results show promise and suggest the dominant influence of native-state topology  even for structurally homologous proteins with different preferred folding pathways .
Revised:  The results show promise and suggest the dominant influence of native-state topology on the protein folding process ( even for structurally homologous proteins with different preferred folding pathways .
Edit intent: clarity
Original: A graph theoretical approach is taken to describe the general logic underlying the folding of a set of single-domain proteins within a simple binary collision/coalescence model .
Revised: A complex network approach to protein folding is proposed .
Edit intent: clarity
Original:  The graph object employed is the network of shortcut edges present in a native-state protein .
Revised:  The graph object is the network of shortcut edges present in a native-state protein .
Edit intent: clarity