wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Here}  , we use instead approximate Bayesian computation (ABC) to calibrate the parameters in a data-driven automatic manner.
Revised:  Here} One of the main intuition is that these parameters are precisely the information needed for a pathological test identifying CVD captured and that they capture the inter-individual variability. Following this intuition, here we devise a Bayesian inferential scheme for estimation of these parameters. As the likelihood function of the numerical model is intractable due to the complex stochastic nature of the model , we use instead approximate Bayesian computation (ABC) to calibrate the parameters in a data-driven automatic manner.
Edit intent: meaning-changed
Original:  Here}  , we use instead approximate Bayesian computation (ABC) to calibrate the parameters in a data-driven automatic manner. ABC requires a prior distribution for the parameters, which we take to be uniform over a known range of plausible parameter values. ABC requires the generation of many pseudo-data by expensive simulation runs, we have thus developed an high performance computing (HPC) ABC framework , taking into account accuracy and scalability.
Revised:  Here} , we use instead approximate Bayesian computation (ABC) to calibrate the parameters in a data-driven manner. As ABC requires the generation of many pseudo-data by expensive simulation runs, we have thus developed an high performance computing (HPC) ABC framework , taking into account accuracy and scalability.
Edit intent: clarity
Original:  ABC requires the generation of many pseudo-data by expensive simulation runs, we have thus developed an high performance computing (HPC) ABC framework , taking into account accuracy and scalability.
Revised:  ABC requires the generation of many pseudo-data by expensive simulation runs, we have thus developed an high performance computing (HPC) framework for ABC to make the inference possible for this model. We illustrate that our mean posterior prediction of platelet deposition pattern matches the experimental dataset closely with a tight posterior prediction error margin for a collective dataset of 7 volunteers.
Edit intent: meaning-changed
Original:  In this article, we introduce a novel linkage map algorithm to construct high-quality and high-density linkage maps for diploid and polyploid species.
Revised:  In this article, we introduce a novel linkage map algorithm to construct high-quality and high-density linkage maps . Current multiple testing approaches based on pairwise recombination fractions are underpowered in the high-dimensional setting and do not extend easily to polyploid species.
Edit intent: meaning-changed
Original:  We illustrate the efficiency of the inference method on a broad range of synthetic data with varying rates of missingness and genotyping errors. We show that our method outperforms other available methods in terms of determining the correct number of linkage groups and ordering markers both when the data are clean and contain no missing observations and when data are noisy and incomplete.
Revised:  Through simulations, we illustrate the utility of our map construction method and compare its performance with other available methods in terms of determining the correct number of linkage groups and ordering markers both when the data are clean and contain no missing observations and when data are noisy and incomplete.
Edit intent: clarity
Original:  We show that our method outperforms other available methods in terms of determining the correct number of linkage groups and ordering markers both when the data are clean and contain no missing observations and when data are noisy and incomplete. In addition, we implement the method on real genotype data of barley and potato from diploid and tetraploid populations, respectively.
Revised:  We show that our method outperforms other available methods in terms of determining the correct number of linkage groups and ordering markers both when the data are clean and contain no missing observations and when data contain genotyping errors and are incomplete. We apply the proposed method to two genotype datasets: barley and potato from diploid and tetraploid populations, respectively.
Edit intent: clarity
Original:  Given that most tetraploid potato linkage maps have been generated either from diploid populations (Felcher et al., 2012) or from a subset of marker types (e.g. both parents were heterozygous) (Grandke et al., 2017), developing a map construction method based on discrete graphical models opens the opportunities to construct high-quality linkage maps for any biparental diploid and polyploid species containing all different marker types.
Revised:  Whereas most tetraploid potato linkage maps have been generated either from diploid populations (Felcher et al., 2012) or from a subset of marker types (e.g. both parents were heterozygous) (Grandke et al., 2017), developing a map construction method based on discrete graphical models opens the opportunities to construct high-quality linkage maps for any biparental diploid and polyploid species containing all different marker types.
Edit intent: fluency
Original:  Given that most tetraploid potato linkage maps have been generated either from diploid populations (Felcher et al., 2012) or from a subset of marker types (e.g. both parents were heterozygous) (Grandke et al., 2017), developing a map construction method based on discrete graphical models opens the opportunities to construct high-quality linkage maps for any biparental diploid and polyploid species containing all different marker types.
Revised:  Given that most tetraploid potato linkage maps until now have been created either from diploid populations (Felcher et al., 2012) or from a subset of marker types (e.g. both parents were heterozygous) (Grandke et al., 2017), developing a map construction method based on discrete graphical models opens the opportunities to construct high-quality linkage maps for any biparental diploid and polyploid species containing all different marker types.
Edit intent: clarity
Original:  Given that most tetraploid potato linkage maps have been generated either from diploid populations (Felcher et al., 2012) or from a subset of marker types (e.g. both parents were heterozygous) (Grandke et al., 2017), developing a map construction method based on discrete graphical models opens the opportunities to construct high-quality linkage maps for any biparental diploid and polyploid species containing all different marker types.
Revised:  Given that most tetraploid potato linkage maps have been generated either from diploid populations or from a subset of marker types (e.g. both parents were heterozygous) (Grandke et al., 2017), developing a map construction method based on discrete graphical models opens the opportunities to construct high-quality linkage maps for any biparental diploid and polyploid species containing all different marker types.
Edit intent: coherence
Original:  Given that most tetraploid potato linkage maps have been generated either from diploid populations (Felcher et al., 2012) or from a subset of marker types (e.g. both parents were heterozygous) (Grandke et al., 2017), developing a map construction method based on discrete graphical models opens the opportunities to construct high-quality linkage maps for any biparental diploid and polyploid species containing all different marker types.
Revised:  Given that most tetraploid potato linkage maps have been generated either from diploid populations (Felcher et al., 2012) or from a subset of marker types , our comprehensive map construction method based on discrete graphical models opens the opportunities to construct high-quality linkage maps for any biparental diploid and polyploid species containing all different marker types.
Edit intent: clarity
Original:  Given that most tetraploid potato linkage maps have been generated either from diploid populations (Felcher et al., 2012) or from a subset of marker types (e.g. both parents were heterozygous) (Grandke et al., 2017), developing a map construction method based on discrete graphical models opens the opportunities to construct high-quality linkage maps for any biparental diploid and polyploid species containing all different marker types.
Revised:  Given that most tetraploid potato linkage maps have been generated either from diploid populations (Felcher et al., 2012) or from a subset of marker types (e.g. both parents were heterozygous) (Grandke et al., 2017), developing a map construction method will be able to deal with realistic data settings for any biparental diploid and polyploid species containing all different marker types.
Edit intent: clarity
Original:  Given that most tetraploid potato linkage maps have been generated either from diploid populations (Felcher et al., 2012) or from a subset of marker types (e.g. both parents were heterozygous) (Grandke et al., 2017), developing a map construction method based on discrete graphical models opens the opportunities to construct high-quality linkage maps for any biparental diploid and polyploid species containing all different marker types.
Revised:  Given that most tetraploid potato linkage maps have been generated either from diploid populations (Felcher et al., 2012) or from a subset of marker types (e.g. both parents were heterozygous) (Grandke et al., 2017), developing a map construction method based on discrete graphical models opens the opportunities to construct high-quality linkage maps for any biparental diploid and polyploid species containing arbitrary marker types.
Edit intent: clarity
Original:  Whereas most tetraploid potato linkage maps until now have been created either from diploid populations or from a subset of marker types, our comprehensive map construction method will be able to deal with realistic data settings for any biparental diploid and polyploid species containing arbitrary marker types .
Revised:  Our comprehensive map construction method will be able to deal with realistic data settings for any biparental diploid and polyploid species containing arbitrary marker types .
Edit intent: clarity
Original:  Whereas most tetraploid potato linkage maps until now have been created either from diploid populations or from a subset of marker types, our comprehensive map construction method will be able to deal with realistic data settings for any biparental diploid and polyploid species containing arbitrary marker types .
Revised:  Whereas most tetraploid potato linkage maps until now have been created either from diploid populations or from a subset of marker types, our comprehensive map construction method makes full use of the dosage SNP data to reconstruct linkage map for any bi-parental diploid and polyploid species containing arbitrary marker types .
Edit intent: meaning-changed
Original:  Whereas most tetraploid potato linkage maps until now have been created either from diploid populations or from a subset of marker types, our comprehensive map construction method will be able to deal with realistic data settings for any biparental diploid and polyploid species containing arbitrary marker types .
Revised:  Whereas most tetraploid potato linkage maps until now have been created either from diploid populations or from a subset of marker types, our comprehensive map construction method will be able to deal with realistic data settings for any biparental diploid and polyploid species .
Edit intent: clarity
Original:  The new estimator can under mild conditions exhibit a rate of convergence in probability equal to n^{ -(p-1) /( 2p-1 )}, where p\ge 2 is an integer that indexes the strength of certain smoothness assumptions.
Revised:  The new estimator can under mild conditions exhibit a rate of convergence in probability equal to n^{ -p /( 2p-1 )}, where p\ge 2 is an integer that indexes the strength of certain smoothness assumptions.
Edit intent: fluency
Original:  The new estimator can under mild conditions exhibit a rate of convergence in probability equal to n^{ -(p-1) /( 2p-1 )}, where p\ge 2 is an integer that indexes the strength of certain smoothness assumptions.
Revised:  The new estimator can under mild conditions exhibit a rate of convergence in probability equal to n^{ -(p-1) /( 2p+1 )}, where p\ge 2 is an integer that indexes the strength of certain smoothness assumptions.
Edit intent: meaning-changed
Original:  The new estimator is an adaptation of a nearest-neighbours estimator of a conditional mean (Yang, 1981; Stute, 1984), and is under mild conditions consistent and asymptotically normal with a rate of convergence that is the same regardless of the degree to which selection depends on unobservables in the outcome equation .
Revised:  The new estimator , unlike other proposals in the literature, is under mild conditions consistent and asymptotically normal with a rate of convergence that is the same regardless of the degree to which selection depends on unobservables in the outcome equation .
Edit intent: clarity
Original:  Stute, 1984), and is under mild conditions consistent and asymptotically normal with a rate of convergence that is the same regardless of the degree to which selection depends on unobservables in the outcome equation . The first-order behaviour of the new estimator, unlike those of other proposals in the literature, does not depend on explicit assumptions regarding the relative tail behaviours of the determinants of selection . Simulation evidence and an empirical example are included.
Revised:  Stute, 1984), and is under mild conditions consistent and asymptotically normal with a rate of convergence that is the same regardless of the degree to which selection depends on unobservables in the outcome equation . Simulation evidence and an empirical example are included.
Edit intent: coherence
Original: We consider the problem of clearing a system of interconnected banks . Prior work has shown that when banks can only enter into simple debt contracts with each other, then a clearing vector of payments can be computed in polynomial time.
Revised: The 2008 financial crisis has been attributed to "excessive complexity" of the financial system due to financial innovation. We employ computational complexity theory to make this notion precise. Specifically, we consider the problem of clearing a system of interconnected banks . Prior work has shown that when banks can only enter into simple debt contracts with each other, then a clearing vector of payments can be computed in polynomial time.
Edit intent: meaning-changed
Original:  In this work, we show that the computational complexity of the clearing problem drastically increases when banks can also enter into credit default swaps (CDSs), i.e., financial derivative contracts that depend on the default of another bank . We first show that many important decision problems are NP-hard once CDSs are allowed.
Revised:  In this work, we show that the computational complexity of the clearing problem drastically increases when banks can also enter into credit default swaps (CDSs), i.e., financial derivative contracts that depend on the default of another bank , a solution may not even exist. In this work, we show that deciding if a solution exists is NP-complete if CDSs are allowed.
Edit intent: meaning-changed
Original:  This includes deciding if a specific bank is at risk of default and deciding if a clearing vector exists in the first place. Second, we show thatcomputing an approximate solution to the clearing problem with sufficiently small constant error is PPAD-complete  .
Revised:  This remains true if we relax the problem to \varepsilon-approximate solutions, for a constant \varepsilon. We further show that, under sufficient conditions where a solution is guaranteed to exist, the approximate search problem is PPAD-complete .
Edit intent: meaning-changed
Original:  Second, we show thatcomputing an approximate solution to the clearing problem with sufficiently small constant error is PPAD-complete  .
Revised:  Second, we show thatcomputing an approximate solution to the clearing problem with sufficiently small constant error is PPAD-complete for constant \varepsilon. We then try to isolate the "origin" of the complexity. It turns out that already determining which banks default is hard. Further, we show that the complexity is not driven by the dependence of counterparties on each other, but rather hinges on the presence of so-called naked CDSs .
Edit intent: meaning-changed
Original:  To prove our results, we demonstrate how financial networks with debt and CDSscan encode Boolean and arithmetic operations. Our results have practical importance for network stress tests and they reveal computational complexity as a new concern regarding the stability of the financial system .
Revised:  If naked CDSs are not present, we receive a simple polynomial-time algorithm. Our results are of practical importance for network stress tests and they reveal computational complexity as a new concern regarding the stability of the financial system .
Edit intent: meaning-changed
Original: When exploring statistical properties of genetic sequences two main features stand out: the existence of non-random structures at various scales (e. g., long-range correlations ) and the presence of symmetries (e.g., Chargaff parity rules).
Revised: Biologists have long sought a way to explain how statistical properties of genetic sequences two main features stand out: the existence of non-random structures at various scales (e. g., long-range correlations ) and the presence of symmetries (e.g., Chargaff parity rules).
Edit intent: clarity
Original: When exploring statistical properties of genetic sequences two main features stand out: the existence of non-random structures at various scales (e. g., long-range correlations ) and the presence of symmetries (e.g., Chargaff parity rules).
Revised: When exploring statistical properties of genetic sequences emerged and are maintained through evolution. On the one hand, non-random structures at various scales (e. g., long-range correlations ) and the presence of symmetries (e.g., Chargaff parity rules).
Edit intent: meaning-changed
Original: When exploring statistical properties of genetic sequences two main features stand out: the existence of non-random structures at various scales (e. g., long-range correlations ) and the presence of symmetries (e.g., Chargaff parity rules). In the last decades, numerous studies investigated the origin and significance of each of these features separately .
Revised: When exploring statistical properties of genetic sequences two main features stand out: the existence of non-random structures at different scales indicate a complex URLanisation. On the other hand, single-strand symmetry has been scrutinised using neutral models in which correlations are not considered or irrelevant, contrary to empirical evidence. Different studies investigated these two statistical features separately, reaching minimal consensus despite sustained efforts .
Edit intent: meaning-changed
Original:  Here we show that both symmetry and structure have to be considered as the outcome of the same biological processes, whose cumulative effect can be quantitatively measured on extant genomes. We present a novel analysis (based on a minimal model) that not only explains and reproduces previous observations but also predicts the existence of a nested hierarchy of symmetries emerging at different structural scales. Our genome-wide analysis of H. Sapiens confirms the theoretical predictions .
Revised:  Here we unravel previously unknown symmetries in genetic sequences, which URLanized hierarchically through scales in which non-random structures are known to be present. These observations are confirmed through the statistical analysis of the human genome and explained through a simple domain model. These results suggest that domain models which account for the cumulative action of mobile elements can explain simultaneously non-random structures and symmetries in genetic sequences .
Edit intent: clarity
Original:  Recurrent neural networks  , and in particular Long Short-Term Memory (LSTM) networks  have proven recently that they are able to outperform state-of-the-art univariate time series forecasting methods in this context , when trained across all available time series.
Revised:  Recurrent neural networks (RNNs) , and in particular Long Short-Term Memory (LSTM) networks have proven recently that they are able to outperform state-of-the-art univariate time series forecasting methods in this context , when trained across all available time series.
Edit intent: clarity
Original:  Recurrent neural networks  , and in particular Long Short-Term Memory (LSTM) networks  have proven recently that they are able to outperform state-of-the-art univariate time series forecasting methods in this context , when trained across all available time series.
Revised:  Recurrent neural networks , and in particular Long Short-Term Memory (LSTM) networks , have proven recently that they are able to outperform state-of-the-art univariate time series forecasting methods in this context , when trained across all available time series.
Edit intent: fluency
Original:  Recurrent neural networks  , and in particular Long Short-Term Memory (LSTM) networks  have proven recently that they are able to outperform state-of-the-art univariate time series forecasting methods in this context , when trained across all available time series.
Revised:  Recurrent neural networks , and in particular Long Short-Term Memory (LSTM) networks have proven recently that they are able to outperform state-of-the-art univariate time series forecasting methods in this context when trained across all available time series.
Edit intent: fluency
Original:  However, if the time series database is heterogeneous  accuracy may degenerate, so that on the way towards fully automatic forecasting methods in this space, a notion of similarity between the time series needs to be built into the methods.
Revised:  However, if the time series database is heterogeneous , accuracy may degenerate, so that on the way towards fully automatic forecasting methods in this space, a notion of similarity between the time series needs to be built into the methods.
Edit intent: fluency
Original:  The proposed methodology is able to consistently outperform the baseline LSTM model, and it achieves competitive results on benchmarking datasets , in particular outperforming all other methods on the CIF2016  dataset.
Revised:  We assess our proposed methodology using LSTM networks, a widely popular RNN variant. Our method achieves competitive results on benchmarking datasets , in particular outperforming all other methods on the CIF2016 dataset.
Edit intent: meaning-changed
Original:  The proposed methodology is able to consistently outperform the baseline LSTM model, and it achieves competitive results on benchmarking datasets , in particular outperforming all other methods on the CIF2016  dataset.
Revised:  The proposed methodology is able to consistently outperform the baseline LSTM model, and it achieves competitive results on benchmarking datasets under competition evaluation procedures. In particular, in terms of mean sMAPE accuracy, it consistently outperforms the baseline LSTM model and outperforms all other methods on the CIF2016 dataset.
Edit intent: meaning-changed
Original:  The proposed methodology is able to consistently outperform the baseline LSTM model, and it achieves competitive results on benchmarking datasets , in particular outperforming all other methods on the CIF2016  dataset.
Revised:  The proposed methodology is able to consistently outperform the baseline LSTM model, and it achieves competitive results on benchmarking datasets , in particular outperforming all other methods on the CIF2016 forecasting competition dataset.
Edit intent: meaning-changed