wanyu/IteraTeR_v2 huggingface dataset:
Original:  This, combined with fast online intraday correlation matrix estimation from high frequency data for cluster identification, may enhance near-real-time risk assessment for financial practitioners.
Revised:  This, combined with fast on-line intraday correlation matrix estimation from high frequency data for cluster identification, may enhance near-real-time risk assessment for financial practitioners.
Edit intent: fluency
Original:  We demonstrate that the CUDA PGAimplementation is able to recover stock clusters in sub-second speed, significantly faster than the test case implementation of a comparable serial genetic algorithm  .
Revised:  We demonstrate that the CUDA PGAimplementation is able to recover stock clusters in sub-second speed, significantly faster than a test case implementation of a comparable serial genetic algorithm .
Edit intent: fluency
Original:  This, combined with fast on-line intraday correlation matrix estimation from high frequency data for cluster identification, may enhance near-real-time risk assessment for financial practitioners.
Revised:  This, combined with fast on-line intraday correlation matrix estimation from high frequency data for cluster identification, offers cost-effective, near-real-time risk assessment for financial practitioners.
Edit intent: clarity
Original:  We demonstrate that our GPU PGA, implemented on a commercially available general purpose GPU, is able to recover stock clusters in sub-second speed, significantly faster than a test case implementation of a comparable serial genetic algorithm, based on a subset of stocks in the South African market.
Revised:  We demonstrate that our GPU PGA, implemented on a commercially available general purpose GPU, is able to recover stock clusters in sub-second speed, based on a subset of stocks in the South African market.
Edit intent: clarity
Original:  These results also apply to other interventions to reduce the latent reservoir and  explain the observed return of viremia after months of apparent cure in recent bone marrow transplant recipients  .
Revised:  These results also apply to other interventions to reduce the latent reservoir and can explain the observed return of viremia after months of apparent cure in recent bone marrow transplant recipients .
Edit intent: coherence
Original: In wireless peer-to-peer networks that serve various proximity-based applications, peer discovery is the key to identifying other peers with which a peer can communicate and an understanding of its performance is fundamental to the design of an ef?cient discovery operation.
Revised: In wireless peer-to-peer networks that serve various proximity-based applications, peer discovery is the key to identifying other peers with which a peer can communicate and an understanding of its performance is fundamental to the design of an efficient discovery operation.
Edit intent: fluency
Original:  In the latter, the entity of the deviation from quasi-stationarity contains precious information that allows us to identify remarkable early-warning signals of the interbank crisis of 2008.
Revised:  In the latter, the entity of the deviation from quasi-stationarity contains precious information that allows us to identify remarkable early warning signals of the interbank crisis of 2008.
Edit intent: fluency
Original:  These early-warning signals involve certain dyadic and triadic topological properties, including dangerous ` debt loops' with different levels of interbank reciprocity.
Revised:  These early warning signals involve certain dyadic and triadic topological properties, including dangerous ` debt loops' with different levels of interbank reciprocity.
Edit intent: fluency
Original:  These early-warning signals involve certain dyadic and triadic topological properties, including dangerous ` debt loops' with different levels of interbank reciprocity.
Revised:  These early-warning signals involve certain dyadic and triadic topological properties, including dangerous ' debt loops' with different levels of interbank reciprocity.
Edit intent: fluency
Original: We provide the first effectively computable, modulo a mild conjecture, complete invariant for simultaneous conjugacy in Garside groups .
Revised: We solve the simultaneous conjugacy problem in Garside groups .
Edit intent: clarity
Original:  Computer experiments suggest that   the size of this invariant , for a list of O(N ) generic, independent elements of Artin's braid group B_N, is close to 1.
Revised:  Computer experiments suggest that , the size of this invariant , for a list of O(N ) generic, independent elements of Artin's braid group B_N, is close to 1.
Edit intent: fluency
Original: We solve the simultaneous conjugacy problem in Garside groups , by means of an effectively computable invariant.
Revised: We solve the simultaneous conjugacy problem in Garside groups by means of an effectively computable invariant.
Edit intent: fluency
Original:  In the one-dimensional case, our invariant generalizes the  notion of super summit set of a conjugacy class.
Revised:  This invariant generalizes the notion of super summit set of a conjugacy class.
Edit intent: coherence
Original:  In the one-dimensional case, our invariant generalizes the  notion of super summit set of a conjugacy class.
Revised:  In the one-dimensional case, our invariant generalizes the one-dimensional notion of super summit set of a conjugacy class.
Edit intent: fluency
Original:  As part of our solution , we identify a high-dimensional version of the cyclic sliding operation with a provable convergence rate .
Revised:  One key ingredient of our solution , we identify a high-dimensional version of the cyclic sliding operation with a provable convergence rate .
Edit intent: clarity
Original:  As part of our solution , we identify a high-dimensional version of the cyclic sliding operation with a provable convergence rate .
Revised:  As part of our solution is the introduction of a provable high-dimensional version of the cyclic sliding operation with a provable convergence rate .
Edit intent: clarity
Original:  The complexity of this solution is a small degree polynomial in the sizes of our generalized super summit sets and the input parameters.
Revised:  The complexity of this solution is a small degree polynomial in the cardinalities of our generalized super summit sets and the input parameters.
Edit intent: clarity
Original:  Computer experiments suggest that , in Artin's braid group , the size of this invariant for dimension of order N or higher , is generically close to 1.
Revised:  Computer experiments suggest that , the size of this invariant for dimension of order N or higher , is generically close to 1.
Edit intent: clarity
Original:  Computer experiments suggest that , in Artin's braid group , the size of this invariant for dimension of order N or higher , is generically close to 1.
Revised:  Computer experiments suggest that , in Artin's braid group , the size of this invariant , for a list of order N or higher , is generically close to 1.
Edit intent: clarity
Original:  One key ingredient of our solution is the introduction of a provable high-dimensional version of the Birman--Ko--Lee cycling theorem.
Revised:  One key ingredient in our solution is the introduction of a provable high-dimensional version of the Birman--Ko--Lee cycling theorem.
Edit intent: fluency
Original:  We implement ONAMA on resource-limited TelosB motes using TinyOS.
Revised:  We implement ONAMA on resource-constrained TelosB motes using TinyOS.
Edit intent: clarity
Original:  Extensive measurements on two testbeds independently attest to OLAMA 's superb performance compared to existing work: improving concurrency, throughput, and delay by a factor of 3.7, 3.0, and 5.3, respectively, while still maintaining reliability.
Revised:  Extensive measurements on two testbeds independently attest to ONAMA 's superb performance compared to existing work: improving concurrency, throughput, and delay by a factor of 3.7, 3.0, and 5.3, respectively, while still maintaining reliability.
Edit intent: style
Original:  We use tools provided by Bodlaender et al. ( 2007)to prove that such problem, paremeterized by number of states, does not admit a polynomial kernel unless  polynomial hierarchy collapses.
Revised:  We use tools provided by Bodlaender et al. ( 2007)to prove that such problem, paremeterized by number of states, does not admit a polynomial kernel unless the polynomial hierarchy collapses.
Edit intent: fluency
Original: Through separation of the fast spiking and the slow bursting timescales, we characterize the burst and spike synchronization transitions by varying the noise intensity D in a population of bursting neurons  .
Revised: We are interested in characterization of synchronization transitions of bursting neurons .
Edit intent: clarity
Original:  Through frequency filtering, we decompose R(t) into R_b (t) ( the instantaneous population burst rate (IPBR) showing the bursting behavior) and R_s(t) ( the instantaneous population spike rate (IPSR) showing the intraburst spiking behavior) .
Revised:  Through frequency filtering, we decompose R(t) into R_b (t) ( the instantaneous population burst rate (IPBR) showing the bursting behavior) and the instantaneous population spike rate (IPSR) showing the intraburst spiking behavior) .
Edit intent: clarity
Original:  Then, the bursting and spiking coherence factors \beta_b and \beta_s of the bursting and spiking peaks in the power spectral densities of R_b and R_s are shown to play the role of " frequency-domain " bursting and spiking order parameters, used for characterizing the burst and spike synchronization transitions, respectively .
Revised:  Then, the bursting and spiking "coherence factors" \beta_b and \beta_s of the bursting and spiking peaks in the power spectral densities of R_b and R_s are shown to play the role of " frequency-domain " bursting and spiking order parameters, used for characterizing the burst and spike synchronization transitions, respectively .
Edit intent: clarity
Original:  Then, the bursting and spiking coherence factors \beta_b and \beta_s of the bursting and spiking peaks in the power spectral densities of R_b and R_s are shown to play the role of " frequency-domain " bursting and spiking order parameters, used for characterizing the burst and spike synchronization transitions, respectively .
Revised:  Then, the bursting and spiking coherence factors \beta_b and \beta_s of the bursting and spiking peaks in the power spectral densities of R_b and R_s (i.e., " frequency-domain " bursting and spiking order parameters, used for characterizing the burst and spike synchronization transitions, respectively .
Edit intent: clarity
Original:  Through calculation of \beta_b and \beta_s, we obtain the bursting and spiking noise thresholds , D^*_b and D^*_s, beyond which the burst and spike synchronizations break up, respectively.
Revised:  Through calculation of \beta_b and \beta_s, we obtain the bursting and spiking thresholds beyond which the burst and spike synchronizations break up, respectively.
Edit intent: clarity
Original:  For more direct visualization of bursting behaviors, we consider another raster plot of bursting onset or offset times, from which we can directly obtain the IPBR, R_b^{(on)(t) or R_b^{(off)}(t), without frequency filtering.
Revised:  (t) or R_b^{(off)}(t), without frequency filtering.
Edit intent: clarity
Original: Users and developers are tapping into big, complex entity graphs for numerous applications.
Revised: Users are tapping into big, complex entity graphs for numerous applications.
Edit intent: clarity
Original: Users and developers are tapping into big, complex entity graphs for numerous applications.
Revised: Users and developers are tapping into big, complex entity graphs for many applications.
Edit intent: clarity
Original:  It is challenging to select entity graphs for a particular need, given abundant datasets from many sources and the oftentimes scarce information available for them.
Revised:  It is challenging to select entity graphs for a particular need, given abundant datasets from many sources and the oftentimes scarce information for them.
Edit intent: clarity
Original:  We propose methods to automatically produce preview tables for entity graphs, for compact presentation of important entity types and relationships  .
Revised:  We propose methods to produce preview tables for entity graphs, for compact presentation of important entity types and relationships .
Edit intent: clarity
Original:  We propose methods to automatically produce preview tables for entity graphs, for compact presentation of important entity types and relationships  .
Revised:  We propose methods to automatically produce preview tables for compact presentation of important entity types and relationships .
Edit intent: clarity
Original:  We propose methods to automatically produce preview tables for entity graphs, for compact presentation of important entity types and relationships  .
Revised:  We propose methods to automatically produce preview tables for entity graphs, for compact presentation of important entity types and relationships in entity graphs .
Edit intent: clarity
Original:  The experiments and user studies on Freebase demonstrated both the scoring measures' accuracy and the discovery algorithms' efficiency 
Revised:  The experiments and user studies demonstrated the scoring measures' accuracy and the discovery algorithms' efficiency 
Edit intent: clarity
Original:  The experiments and user studies on Freebase demonstrated both the scoring measures' accuracy and the discovery algorithms' efficiency 
Revised:  The experiments and user studies on Freebase demonstrated both the scoring measures' accuracy and the discovery algorithms' efficiency .
Edit intent: fluency
Original:  In this paper, we introduce a Network-based method for RNA-Seq-based Transcript Quantification (Net-RSTQ) to integrate protein domain-domain interaction information with short read alignment for transcript abundance estimation.
Revised:  In this paper, we introduce a Network-based method for RNA-Seq-based Transcript Quantification (Net-RSTQ) to integrate protein domain-domain interaction network with short read alignment for transcript abundance estimation.
Edit intent: clarity
Original:  In this paper, we introduce a Network-based method for RNA-Seq-based Transcript Quantification (Net-RSTQ) to integrate protein domain-domain interaction information with short read alignment for transcript abundance estimation.
Revised:  In this paper, we introduce a Network-based method for RNA-Seq-based Transcript Quantification (Net-RSTQ) to integrate protein domain-domain interaction information with short read alignments for transcript abundance estimation.
Edit intent: clarity
Original:  Based on the observation that the abundances of the neighboring transcripts by domain-domain interactions in the network are positively correlated, Net-RSTQ models the expression of the neighboring transcripts as Dirichlet priors on the likelihood of the observed read alignments against the transcripts in one gene.
Revised:  Based on our observation that the abundances of the neighboring transcripts by domain-domain interactions in the network are positively correlated, Net-RSTQ models the expression of the neighboring transcripts as Dirichlet priors on the likelihood of the observed read alignments against the transcripts in one gene.
Edit intent: fluency
Original:  Based on the observation that the abundances of the neighboring transcripts by domain-domain interactions in the network are positively correlated, Net-RSTQ models the expression of the neighboring transcripts as Dirichlet priors on the likelihood of the observed read alignments against the transcripts in one gene.
Revised:  Based on the observation that the abundances of the neighboring isoforms by domain-domain interactions in the network are positively correlated, Net-RSTQ models the expression of the neighboring transcripts as Dirichlet priors on the likelihood of the observed read alignments against the transcripts in one gene.
Edit intent: clarity
Original:  We demonstrate in the experiments that (1) qRT-PCR confirmed that Net-RSTQ achieves better transcript quantification accuracy with RNA-Seq data from a stem cell line and an ovarian cancer cell line compared with the models without using transcript network;
Revised:  We demonstrate in the experiments that (1) qRT-PCR confirmed that Net-RSTQ achieves better transcript quantification accuracy with RNA-Seq data from a stem cell line , an ovarian cancer cell line compared with the models without using transcript network;
Edit intent: fluency
Original:  and (2)the transcript abundances estimated by Net-RSTQ are more informative for patient sample classification tested on the RNA-Seq data of ovarian cancer, breast cancer and lung cancer in The Cancer Genome Atlas (TCGA) .
Revised:  and (2)the transcript abundances estimated by Net-RSTQ are more informative for patient sample classification of ovarian cancer, breast cancer and lung cancer in The Cancer Genome Atlas (TCGA) .
Edit intent: clarity
Original:  We consider here these two different strategies (based either on informational content for the candidate driver or on pruning of the pairwise links ) for partially conditioned Granger causality and show that depending on the data structure either one or the other might be equally valid.
Revised:  We consider here two different strategies (based either on informational content for the candidate driver or on pruning of the pairwise links ) for partially conditioned Granger causality and show that depending on the data structure either one or the other might be equally valid.
Edit intent: coherence
Original:  We consider here these two different strategies (based either on informational content for the candidate driver or on pruning of the pairwise links ) for partially conditioned Granger causality and show that depending on the data structure either one or the other might be equally valid.
Revised:  We consider here these two different strategies (based either on informational content for the candidate driver or on pruning of the pairwise links ) for partially conditioned Granger causality and show that depending on the data structure either one or the other might be valid.
Edit intent: clarity
Original:  We finally apply these methods to two different datasets of real data .
Revised:  We finally apply these methods to two different real datasets .
Edit intent: clarity
Original:  First, regarding epileptic electrophysiological data , we show that synergetic effects are dominant in the pre-ictal condition ( just before seizure occurrences ) . Second, our analysis applied to genetic information from the HeLa culture showed that the underlying gene regulatory networks are characterized by both redundancy and synergy.
Revised:  First, analyzing electrophysiological data from an epileptic brain , we show that synergetic effects are dominant in the pre-ictal condition ( just before seizure occurrences ) . Second, our analysis applied to genetic information from the HeLa culture showed that the underlying gene regulatory networks are characterized by both redundancy and synergy.
Edit intent: clarity
Original:  First, regarding epileptic electrophysiological data , we show that synergetic effects are dominant in the pre-ictal condition ( just before seizure occurrences ) . Second, our analysis applied to genetic information from the HeLa culture showed that the underlying gene regulatory networks are characterized by both redundancy and synergy.
Revised:  First, regarding epileptic electrophysiological data , we show that synergetic effects are dominant just before seizure occurrences ) . Second, our analysis applied to genetic information from the HeLa culture showed that the underlying gene regulatory networks are characterized by both redundancy and synergy.
Edit intent: clarity
Original:  First, regarding epileptic electrophysiological data , we show that synergetic effects are dominant in the pre-ictal condition ( just before seizure occurrences ) . Second, our analysis applied to genetic information from the HeLa culture showed that the underlying gene regulatory networks are characterized by both redundancy and synergy.
Revised:  First, regarding epileptic electrophysiological data , we show that synergetic effects are dominant in the pre-ictal condition ( just before seizure occurrences . Second, our analysis applied to genetic information from the HeLa culture showed that the underlying gene regulatory networks are characterized by both redundancy and synergy.
Edit intent: fluency
Original:  First, regarding epileptic electrophysiological data , we show that synergetic effects are dominant in the pre-ictal condition ( just before seizure occurrences ) . Second, our analysis applied to genetic information from the HeLa culture showed that the underlying gene regulatory networks are characterized by both redundancy and synergy.
Revised:  First, regarding epileptic electrophysiological data , we show that synergetic effects are dominant in the pre-ictal condition ( just before seizure occurrences ) . Second, our analysis applied to gene expression time series from HeLa culture shows that the underlying gene regulatory networks are characterized by both redundancy and synergy.
Edit intent: clarity
Original:  First, regarding epileptic electrophysiological data , we show that synergetic effects are dominant in the pre-ictal condition ( just before seizure occurrences ) . Second, our analysis applied to genetic information from the HeLa culture showed that the underlying gene regulatory networks are characterized by both redundancy and synergy.
Revised:  First, regarding epileptic electrophysiological data , we show that synergetic effects are dominant in the pre-ictal condition ( just before seizure occurrences ) . Second, our analysis applied to genetic information from the HeLa culture showed that the underlying regulatory networks are characterized by both redundancy and synergy.
Edit intent: clarity
Original: This work introduces the idea of breadth-first generation of infinite trees and languages.
Revised: This work builds on the notion of breadth-first generation of infinite trees and languages.
Edit intent: clarity
Original: This work introduces the idea of breadth-first generation of infinite trees and languages.
Revised: This work introduces the idea of breadth-first signature of infinite trees and languages.
Edit intent: clarity
Original:  This idea is brought into play with periodic inputs , a case that comes from the study of rational base number systemswhich correspond to specific inputs derived from Christoffel words . Conversely, we characterise languages generated in that way as representations of integers in such number systems with non-canonical alphabets of digits.
Revised:  This idea is brought into play with periodic inputs , a case coming from the study of rational base number systemswhich correspond to specific inputs derived from Christoffel words . Conversely, we characterise languages generated in that way as representations of integers in such number systems with non-canonical alphabets of digits.
Edit intent: fluency
Original:  This algorithm relies on the fact that dense "frontal" matrices that arise from the sparse elimination process can be efficiently represented as a hierarchically off-diagonal low-rank (HODLR) matrix.
Revised:  The solver relies on the fact that dense "frontal" matrices that arise from the sparse elimination process can be efficiently represented as a hierarchically off-diagonal low-rank (HODLR) matrix.
Edit intent: clarity
Original:  This algorithm relies on the fact that dense "frontal" matrices that arise from the sparse elimination process can be efficiently represented as a hierarchically off-diagonal low-rank (HODLR) matrix.
Revised:  This algorithm relies on the fact that these matrices can be efficiently represented as a hierarchically off-diagonal low-rank (HODLR) matrix.
Edit intent: clarity