wanyu/IteraTeR_full_sent huggingface dataset:
Original:  This article develops a  haircut model by treating repos as debt investments and seeks haircuts to control counterparty contingent exposure to asset price gap risk.
Revised: A repurchase agreement lets investors borrow cash to buy securities. Financier only lends to securities' market value after a haircut and charges interest. Repo pricing is characterized with its puzzling dual pricing measures: repo haircut and repo spread. This article develops a haircut model by treating repos as debt investments and seeks haircuts to control counterparty contingent exposure to asset price gap risk.
Edit intent: meaning-changed
Original:  This article develops a  haircut model by treating repos as debt investments and seeks haircuts to control counterparty contingent exposure to asset price gap risk. It corroborates well with empirically stylized facts, explains tri-party and bilateral repo haircut differences, recasts haircut increases during the financial crisis , and sets a limit on access liquidity dealers can extract while acting as funding intermediaries between money market funds and hedge funds .
Revised:  This article develops a haircut model by designing haircuts to achieve high credit criteria, and identifies economic capital for repo's default risk as the main driver of repo pricing. A simple repo spread formula is obtained that relates spread to haircuts negative linearly. An investor wishing to minimize all-in funding cost can settle at an optimal combination of haircut and repo rate. The model empirically reproduces repo haircut hikes concerning asset backed securities during the financial crisis. It explains tri-party and bilateral repo haircut differences, recasts haircut increases during the financial crisis , and sets a limit on access liquidity dealers can extract while acting as funding intermediaries between money market funds and hedge funds .
Edit intent: meaning-changed
Original:  It corroborates well with empirically stylized facts, explains tri-party and bilateral repo haircut differences, recasts haircut increases during the financial crisis , and sets a limit on access liquidity dealers can extract while acting as funding intermediaries between money market funds and hedge funds .
Revised:  It corroborates well with empirically stylized facts, explains tri-party and bilateral repo haircut differences, quantifies shortening tenor's risk reduction effect , and sets a limit on access liquidity dealers can extract while acting as funding intermediaries between money market funds and hedge funds .
Edit intent: meaning-changed
Original:  It corroborates well with empirically stylized facts, explains tri-party and bilateral repo haircut differences, recasts haircut increases during the financial crisis , and sets a limit on access liquidity dealers can extract while acting as funding intermediaries between money market funds and hedge funds .
Revised:  It corroborates well with empirically stylized facts, explains tri-party and bilateral repo haircut differences, recasts haircut increases during the financial crisis , and sets a limit on excess liquidity intermediating dealers can extract while acting as funding intermediaries between money market funds and hedge funds .
Edit intent: clarity
Original:  It corroborates well with empirically stylized facts, explains tri-party and bilateral repo haircut differences, recasts haircut increases during the financial crisis , and sets a limit on access liquidity dealers can extract while acting as funding intermediaries between money market funds and hedge funds .
Revised:  It corroborates well with empirically stylized facts, explains tri-party and bilateral repo haircut differences, recasts haircut increases during the financial crisis , and sets a limit on access liquidity dealers can extract between money market funds and hedge funds .
Edit intent: clarity
Original:  It corroborates well with empirically stylized facts, explains tri-party and bilateral repo haircut differences, recasts haircut increases during the financial crisis , and sets a limit on access liquidity dealers can extract while acting as funding intermediaries between money market funds and hedge funds . Once a haircut is set, repo's residual risk becomes a pricing challenge, as is neither hedgeable nor diversifiable. We propose a capital pricing approach of computing repo economic capital and charging the borrower a cost of capital. Capital charge is shown to be countercyclical and a key element of repo pricing and used in explaining the repo pricing puzzle and maturity compression phenomenon .
Revised:  It corroborates well with empirically stylized facts, explains tri-party and bilateral repo haircut differences, recasts haircut increases during the financial crisis , and sets a limit on access liquidity dealers can extract while acting as funding intermediaries between money market funds and hedge funds .
Edit intent: coherence
Original:  We highlight that in a high bandwidth-delay product  regime, and with a large number of long-lived flows, the bottleneck queue may be modelled as an M/M/1/B or an M/D/1/B queue.
Revised:  We highlight that in a high bandwidth-delay product and a small buffer regime, and with a large number of long-lived flows, the bottleneck queue may be modelled as an M/M/1/B or an M/D/1/B queue.
Edit intent: meaning-changed
Original: Motivated by recent concerns that queuing delays in the Internet are on the rise, we conduct a performance evaluation of Compound TCP (C-TCP) in two topologies: a single bottleneck and a multi-bottleneck topology  .
Revised: Motivated by recent concerns that queuing delays in the Internet are on the rise, we conduct a performance evaluation of Compound TCP (C-TCP) in two topologies: a single bottleneck and a multi-bottleneck topology , under different traffic scenarios .
Edit intent: clarity
Original:  For both topologies , we develop fluid models and conduct a detailed local stability analysis in the small buffer regime, and obtain necessary and sufficient conditions for local stability.
Revised:  For both topologies , we develop fluid models in a regime wherein the number of flows is large, bandwidth-delay product is high, buffers are dimensioned small (independent of the bandwidth-delay product) and routers deploy a Drop-Tail queue policy. A detailed local stability analysis in the small buffer regime, and obtain necessary and sufficient conditions for local stability.
Edit intent: meaning-changed
Original:  For both topologies , we develop fluid models and conduct a detailed local stability analysis in the small buffer regime, and obtain necessary and sufficient conditions for local stability. Further, we show that the underlying non-linear models undergo a Hopf bifurcation as the stability conditions just get violated. Using a combination of analysis and packet-level simulations, we emphasise that larger buffer thresholds , in addition to increasing latency, are prone to inducing limit cycles  .
Revised:  For both topologies , we develop fluid models and conduct a detailed local stability analysis for these models yields the following key insight: smaller buffers favour stability. Additionally, we highlight that larger buffers , in addition to increasing latency, are prone to inducing limit cycles .
Edit intent: clarity
Original:  Using a combination of analysis and packet-level simulations, we emphasise that larger buffer thresholds , in addition to increasing latency, are prone to inducing limit cycles  .
Revised:  Using a combination of analysis and packet-level simulations, we emphasise that larger buffer thresholds , in addition to increasing latency, are prone to inducing limit cycles in the system dynamics, via a Hopf bifurcation .
Edit intent: meaning-changed
Original:  For the single bottleneck topology, we empirically analyse some statistical properties of the bottleneck queue. We highlight that in a high bandwidth-delay product and a small buffer regime , and with a large number of long-lived flows, the bottleneck queue may be modelled as an M/M/1/B or an M/D/1/B queue.
Revised:  For the single bottleneck topology, we empirically analyse some statistical properties of the bottleneck queues. These statistical analyses serve to validate an important modelling assumption: that in the regime considered, each bottleneck queue may be modelled as an M/M/1/B or an M/D/1/B queue.
Edit intent: clarity
Original:  We highlight that in a high bandwidth-delay product and a small buffer regime , and with a large number of long-lived flows, the bottleneck queue may be modelled as an M/M/1/B or an M/D/1/B queue.
Revised:  We highlight that in a high bandwidth-delay product and a small buffer regime , and with a large number of long-lived flows, the bottleneck queue may be approximated as either an M/M/1/B or an M/D/1/B queue.
Edit intent: clarity
Original: We aim to generalize the duality results of Bouchard and Nutz (2015) to the case of American options. By introducing an enlarged canonical space, we reformulate the superhedging problem for American options as a problem for European options .
Revised: We investigate pricing-hedging duality for American options in discrete time financial models where some assets are traded dynamically and others, e.g. a family of European options, only statically. In the first part of the paper we consider an abstract setting, which includes the classical case with a fixed reference probability measure as well as the robust framework with a non-dominated family of probability measures. Our first insight is that by considering a (universal) enlargement of the space, we reformulate the superhedging problem for American options as a problem for European options .
Edit intent: meaning-changed
Original:  By introducing an enlarged canonical space, we reformulate the superhedging problem for American options as a problem for European options . Then in a discrete time market with finitely many liquid options, we show that the minimum superhedging cost of an American option equals to the supremum of the expectation of the payoff at all (weak) stopping times and under a suitable family of martingale measures.
Revised:  By introducing an enlarged canonical space, we reformulate the superhedging problem for American options as European options and recover the pricing-hedging duality, which may fail in the original formulation. This may be seen as a weak formulation of the expectation of the payoff at all (weak) stopping times and under a suitable family of martingale measures.
Edit intent: meaning-changed
Original:  Then in a discrete time market with finitely many liquid options, we show that the minimum superhedging cost of an American option equals to the supremum of the expectation of the payoff at all (weak) stopping times and under a suitable family of martingale measures. Moreover, by taking the limit on the number of liquid options, we obtain a new class of martingale optimal transport problems as well as a Kantorovich duality result .
Revised:  Then in a discrete time market with finitely many liquid options, we show that the minimum superhedging cost of an American option equals to the supremum of the original problem. Our second insight is that lack of duality is caused by the lack of dynamic consistency and hence a different enlargement with dynamic consistency is sufficient to recover duality: it is enough to consider (fictitious) extensions of the market in which all the assets are traded dynamically. In the second part of the paper we study two important examples of robust framework: the setup of Bouchard and Nutz (2015) and the martingale optimal transport problems as well as a Kantorovich duality result .
Edit intent: meaning-changed
Original:  Moreover, by taking the limit on the number of liquid options, we obtain a new class of martingale optimal transport problems as well as a Kantorovich duality result .
Revised:  Moreover, by taking the limit on the number of liquid options, we obtain a new class of martingale optimal transport setup of Beiglb\"ock et al. (2013), and show that our general results apply in both cases and allow us to obtain pricing-hedging duality for American options .
Edit intent: meaning-changed
Original: Factor models are commonly used in financial applications to analyze portfolio risk and to decompose it to loadings of risk factors. A linear factor model often depends on a small number of carefully-chosen factors and it has been assumed that an arbitrary selection of factors does not yield a feasible factor model. We develop a statistical factor model, the random factor model, in which factors are chosen at random based on the random projection method.
Revised: In a very high-dimensional vector space, two randomly-chosen vectors are almost orthogonal with high probability. Starting from this observation, we develop a statistical factor model, the random factor model, in which factors are chosen at random based on the random projection method.
Edit intent: meaning-changed
Original:  Random selection of factors has the important consequence that the factors are almost orthogonal with respect to each other. The developed random factor model is expected to preserve covariance between time-series. We derive probabilistic bounds for the accuracy of the random factor representation of time-series, their cross-correlations and covariances.
Revised:  Random selection of factors has the consequence that covariance matrix is well preserved in a linear factor representation. It also enables derivation of probabilistic bounds for the accuracy of the random factor representation of time-series, their cross-correlations and covariances.
Edit intent: meaning-changed
Original:  As an application of the random factor model , we analyze reproduction of correlation coefficients in the well-diversified Russell 3,000 equity index using the random factor model. Comparison with the principal component analysis (PCA) shows that the random factor model requires significantly fewer factors to provide an equally accurate reproduction of correlation coefficients. This occurs despite the finding that PCA reproduces single equity return time-series more faithfully than the random factor model. Accuracy of a random factor model is not very sensitive to which particular set of randomly-chosen factors is used. A more general kind of universality of random factor models is also present: it does not much matter which particular method is used to construct the random factor model, accuracy of the resulting factor model is almost identical .
Revised:  As an application of the random factor model , we analyze reproduction of correlation coefficients in the well-diversified Russell 3,000 equity index .
Edit intent: coherence
Original:  We evaluate IGLOO against state-of-the-art LNA ( i.e., NetworkBLAST, NetAligner, AlignNemo, and AlignMCL) and GNA ( i.e., GHOST, NETAL, GEDEVO, MAGNA++, WAVE, and L-GRAAL) methods.
Revised:  We evaluate IGLOO against state-of-the-art LNA ( NetworkBLAST, NetAligner, AlignNemo, and AlignMCL) and GNA ( i.e., GHOST, NETAL, GEDEVO, MAGNA++, WAVE, and L-GRAAL) methods.
Edit intent: fluency
Original:  We evaluate IGLOO against state-of-the-art LNA ( i.e., NetworkBLAST, NetAligner, AlignNemo, and AlignMCL) and GNA ( i.e., GHOST, NETAL, GEDEVO, MAGNA++, WAVE, and L-GRAAL) methods.
Revised:  We evaluate IGLOO against state-of-the-art LNA ( i.e., NetworkBLAST, NetAligner, AlignNemo, and AlignMCL) and GNA ( GHOST, NETAL, GEDEVO, MAGNA++, WAVE, and L-GRAAL) methods.
Edit intent: fluency
Original: We consider a network of multi-server queues wherein each job can be processed in parallel by any subset of servers within a pre-defined set that depends on its class . Each server is allocated in FCFS order at each queue.
Revised: We represent a computer cluster as a multi-server queues wherein each job can be processed in parallel by any subset of servers within a pre-defined set that depends on its class . Each server is allocated in FCFS order at each queue.
Edit intent: clarity
Original: We consider a network of multi-server queues wherein each job can be processed in parallel by any subset of servers within a pre-defined set that depends on its class . Each server is allocated in FCFS order at each queue.
Revised: We consider a network of multi-server queues wherein each job can be processed in parallel by any subset of servers within a pre-defined set that depends on its class . Each server processes its jobs sequentially in FCFS order at each queue.
Edit intent: clarity
Original: We consider a network of multi-server queues wherein each job can be processed in parallel by any subset of servers within a pre-defined set that depends on its class . Each server is allocated in FCFS order at each queue. Jobs arrive according to Poisson processes, have independent exponential service requirements and are routed independently at random. We prove that , when stable, the network has a product-form stationary distribution. From a practical perspective, we propose an algorithm on this basis to allocate the resources of a computer cluster .
Revised: We consider a network of multi-server queues wherein each job can be processed in parallel by any subset of servers within a pre-defined set that depends on its class . Each server is allocated in FCFS order . The service rate of a job at any given time is the sum of the service rates of all servers processing this job. We show that the corresponding queue is quasi-reversible and use this property to design a scheduling algorithm achieving balanced fair sharing of the service capacity .
Edit intent: meaning-changed
Original:  After deriving and developing this new approach, we demonstrate that (i) the ability of the  TREX heuristic to reach the global minimum is strongly dependent on the difficulty of the underlying statistical problem, (ii) the  polynomial-time algorithm for TREX permits a novel variable ranking and selection scheme, (iii) this scheme can be incorporated into a rule that controls the false discovery rate (FDR) of included features in the model.
Revised:  After deriving and developing this new approach, we demonstrate that (i) the ability of the preexisting TREX heuristic to reach the global minimum is strongly dependent on the difficulty of the underlying statistical problem, (ii) the polynomial-time algorithm for TREX permits a novel variable ranking and selection scheme, (iii) this scheme can be incorporated into a rule that controls the false discovery rate (FDR) of included features in the model.
Edit intent: clarity
Original:  After deriving and developing this new approach, we demonstrate that (i) the ability of the  TREX heuristic to reach the global minimum is strongly dependent on the difficulty of the underlying statistical problem, (ii) the  polynomial-time algorithm for TREX permits a novel variable ranking and selection scheme, (iii) this scheme can be incorporated into a rule that controls the false discovery rate (FDR) of included features in the model.
Revised:  After deriving and developing this new approach, we demonstrate that (i) the ability of the TREX heuristic to reach the global minimum is strongly dependent on the difficulty of the underlying statistical problem, (ii) the new polynomial-time algorithm for TREX permits a novel variable ranking and selection scheme, (iii) this scheme can be incorporated into a rule that controls the false discovery rate (FDR) of included features in the model.
Edit intent: meaning-changed
Original:  Studying the dependences of these losses as a function of portfolio size, we moreover reveal that not only large portfolios of thousands of contracts, but also medium-sized and small ones with only a few dozens of contracts exhibit notable  loss correlations.
Revised:  Studying the dependences of these losses as a function of portfolio size, we moreover reveal that not only large portfolios of thousands of contracts, but also medium-sized and small ones with only a few dozens of contracts exhibit notable portfolio loss correlations.
Edit intent: fluency
Original:  Under the assumption of the existence of consistent price systems, which makes the duality approach possible, we consider the duality between the primal utility maximization problem and the dual one, which is set up on the domain of finitely additive measures.
Revised:  In the context of the existence of consistent price systems, which makes the duality approach possible, we consider the duality between the primal utility maximization problem and the dual one, which is set up on the domain of finitely additive measures.
Edit intent: clarity
Original:  Under the assumption of the existence of consistent price systems, which makes the duality approach possible, we consider the duality between the primal utility maximization problem and the dual one, which is set up on the domain of finitely additive measures.
Revised:  Under the assumption of the existence of consistent price systems, we consider the duality between the primal utility maximization problem and the dual one, which is set up on the domain of finitely additive measures.
Edit intent: clarity
Original: Because of the potential link between -1 programmed ribosomal frameshifting (PRF) and response of a pseudoknot (PK) RNA to force, a number of single molecule pulling experiments have been performed on PKs to decipher the mechanism of PRF . Motivated in part by these experiments, we performed simulations using a coarse-grained model of RNA to describe the response of a PK over a range of mechanical forces (fs) and monovalent salt concentrations (Cs).
Revised: Because of the potential link between -1 programmed ribosomal frameshifting and response of a pseudoknot (PK) RNA to force, a number of single molecule pulling experiments have been performed on PKs to decipher the mechanism of PRF . Motivated in part by these experiments, we performed simulations using a coarse-grained model of RNA to describe the response of a PK over a range of mechanical forces (fs) and monovalent salt concentrations (Cs).
Edit intent: fluency
Original: Because of the potential link between -1 programmed ribosomal frameshifting (PRF) and response of a pseudoknot (PK) RNA to force, a number of single molecule pulling experiments have been performed on PKs to decipher the mechanism of PRF . Motivated in part by these experiments, we performed simulations using a coarse-grained model of RNA to describe the response of a PK over a range of mechanical forces (fs) and monovalent salt concentrations (Cs).
Revised: Because of the potential link between -1 programmed ribosomal frameshifting (PRF) and response of a pseudoknot (PK) RNA to force, a number of single molecule pulling experiments have been performed on PKs to decipher the mechanism of programmed ribosomal frameshifting . Motivated in part by these experiments, we performed simulations using a coarse-grained model of RNA to describe the response of a PK over a range of mechanical forces (fs) and monovalent salt concentrations (Cs).
Edit intent: fluency
Original:  As f and C are changed, the stem-loop tertiary interactions rupture first  followed by unfolding of the 3^{\prime}-end hairpin (I\rightleftharpoonsF).
Revised:  As f and C are changed, the stem-loop tertiary interactions rupture first , followed by unfolding of the 3^{\prime}-end hairpin (I\rightleftharpoonsF).
Edit intent: fluency
Original:  Building on this approach , we introduce an iterative algorithm to predict specific interaction partners from among the members of two protein families . We assess the algorithm's performance on histidine kinases and response regulators from bacterial two-component signaling systems.
Revised:  Building on this approach , we introduce an iterative algorithm to predict specific interaction partners from among the members of two protein families whose members are known to interact. We first assess the algorithm's performance on histidine kinases and response regulators from bacterial two-component signaling systems.
Edit intent: meaning-changed