wanyu/IteraTeR_full_sent huggingface dataset:
Original: We consider the problem of scheduling a group of heterogeneous, distributed processes, with different relative priorities and service preferences , to a group of heterogeneous virtual machines. Assuming linearly elastic IT resource needs, we extend prior results on proportional fair and  max-min fair scheduling to a constrained multiresource case for a fam- ily of fairness criteria(including our recently proposed Per- Server Dominant-Share Fairness) .
Revised: We first consider the static problem of allocating resources to ( i.e. , scheduling) multiple distributed application framework s, possibly with different priorities and max-min fair scheduling to a constrained multiresource case for a fam- ily of fairness criteria(including our recently proposed Per- Server Dominant-Share Fairness) .
Edit intent: clarity
Original:  Assuming linearly elastic IT resource needs, we extend prior results on proportional fair and  max-min fair scheduling to a constrained multiresource case for a fam- ily of fairness criteria(including our recently proposed Per- Server Dominant-Share Fairness) .
Revised:  Assuming linearly elastic IT resource needs, we extend prior results on proportional fair and server preferences , in a private cloud with heterogeneous servers. Several fai r scheduling mechanisms have been proposed for this purpose. We extend pr ior results on max-min fair scheduling to a constrained multiresource case for a fam- ily of fairness criteria(including our recently proposed Per- Server Dominant-Share Fairness) .
Edit intent: meaning-changed
Original:  Assuming linearly elastic IT resource needs, we extend prior results on proportional fair and  max-min fair scheduling to a constrained multiresource case for a fam- ily of fairness criteria(including our recently proposed Per- Server Dominant-Share Fairness) . Performance comparison is made by illustrative numerical example. We conclude with a discussion of scheduling problems for a public cloud with heterogeneous instances and servers .
Revised:  Assuming linearly elastic IT resource needs, we extend prior results on proportional fair and max-min and proportional fair scheduling to t his constrained multiresource and multiserver case for generi c fair scheduling criteria. The task efficiencies (a metric r elated to proportional fairness) of max-min fair allocations found b y progressive filling are compared by illustrative examples . They show that "server specific" fairness criteria and those that are b ased on residual (unreserved) resources are more efficient .
Edit intent: meaning-changed
Original: We investigate the dynamical effects of non-Gaussian  noisy fluctuations on the evolution of the transcrip- tion factor activator in the kinetic  model of a single genetic regulation system.
Revised: We investigate the dynamical effects of non-Gaussian asymmetric stable L\'evy noisy fluctuations on the evolution of the transcrip- tion factor activator in the kinetic model of a single genetic regulation system.
Edit intent: meaning-changed
Original:  We use two deterministic quantities, the mean first exit time (MFET) and the first escape probability (FEP), to examine the transition events from low to concentration states under the influences of two types of noise.
Revised:  We compute two deterministic quantities, the mean first exit time (MFET) and the first escape probability (FEP), to examine the transition events from low to concentration states under the influences of two types of noise.
Edit intent: clarity
Original:  We use two deterministic quantities, the mean first exit time (MFET) and the first escape probability (FEP), to examine the transition events from low to concentration states under the influences of two types of noise. In the first case, the noise is multiplicative and symmetric, and we conclude that the fluctuations of the degradation reaction rate induce different switching processes for different noise param- eters.
Revised:  We use two deterministic quantities, the mean first exit time (MFET) and the first escape probability (FEP), to examine the transition events from low to high concentration state under the influence of L\'evy noise. We find that the fluctuations of the degradation reaction rate induce different switching processes for different noise param- eters.
Edit intent: meaning-changed
Original:  In the first case, the noise is multiplicative and symmetric, and we conclude that the fluctuations of the degradation reaction rate induce different switching processes for different noise param- eters.For the second case, the noise is additive and asymmetric, and we find that the fluctuations of the synthesis reaction rate lead to interesting transitions. The mean first exit time can be shortened and first escape probability can be increased by adjusting the noise parameters.
Revised:  In the first case, the noise is multiplicative and symmetric, and we conclude that the fluctuations of the synthesis reaction rate lead to peculiar transitions to higher concentrations (i.e., higher likelihood for transcriptions), such as higher likelihood of transcription for larger positive skewness parameter (asymmetry index) \beta, achieving the minimum likelihood of transcription by tuning skewness parameter \beta, achieving the higher likelihood of transcription by tuning non-Gaussianity index \alpha, and a bifurcation for transcription at the critical value \alpha=1. We conduct a series of numerical experiments about `regulating' the likelihood of gene transcription by tuning asymmetric stable L\'evy noise parameters.
Edit intent: meaning-changed
Original: In this paper, we show both theoretically and empirically that the size of over-the-counter (OTC) markets can be reduced without affecting individual net positions.
Revised: Over-the-counter markets are at the center of the postcrisis global reform of the financial system. We show how the size and structure of such markets can undergo rapid and extensive changes when participants engage in portfolio compression, a post-trade netting technology. Tightly-knit and concentrated trading structures, as featured by many large over-the-counter (OTC) markets can be reduced without affecting individual net positions.
Edit intent: meaning-changed
Original: In this paper, we show both theoretically and empirically that the size of over-the-counter (OTC) markets can be reduced without affecting individual net positions. First, we find that the networked nature of these markets generates an excess of notional obligations between the aggregate gross amount and the minimum amount required to satisfy each individual net position. Second, we show conditions under which such excess can be removed. We refer to this netting operation as compression and identify feasibility and efficiency criteria, highlighting intermediation as the key element for excess levels.
Revised: In this paper, we show both theoretically and empirically that the size of over-the-counter markets, are especially susceptible to reductions of notional and identify feasibility and efficiency criteria, highlighting intermediation as the key element for excess levels.
Edit intent: clarity
Original:  We refer to this netting operation as compression and identify feasibility and efficiency criteria, highlighting intermediation as the key element for excess levels. We show that a trade-off exists between the amount of notional that can be eliminated from the system and the conservation of original trading relationships. Third, we apply our framework to a unique and comprehensive transaction-level dataset on OTC derivatives including all firms based in the European Union.
Revised:  We refer to this netting operation as compression and reconfigurations of network structure resulting from compression activities. Using transaction-level dataset on OTC derivatives including all firms based in the European Union.
Edit intent: clarity
Original:  Third, we apply our framework to a unique and comprehensive transaction-level dataset on OTC derivatives including all firms based in the European Union. On average, we find that around 75\% of market gross notional relates to excess. While around 50\% can in general be removed via bilateral compression, more sophisticated multilateral compression approaches are substantially more efficient. In particular, we find that even the most conservative multilateral approach which satisfies relationship constraints can eliminate up to 98\% of excess in the markets .
Revised:  Third, we apply our framework to a unique and comprehensive transaction-level data on credit-default-swaps markets, we estimate reduction levels consistent with the historical development observed in these markets since the Global Financial Crisis. Finally, we study the effect of a mandate to centrally clear over-the-counter markets. When participants engage in both central clearing and portfolio compression, we find large netting failures if clearinghouses proliferate. Allowing for compression across clearinghouses by-and-large offsets this adverse effect .
Edit intent: meaning-changed
Original:  Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than four quadrillion elementwise comparisons achieved per second  on the ORNL Titan system  .
Revised:  Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than nine quadrillion elementwise comparisons achieved per second on the ORNL Titan system .
Edit intent: meaning-changed
Original:  Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than four quadrillion elementwise comparisons achieved per second  on the ORNL Titan system  .
Revised:  Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than four quadrillion elementwise comparisons achieved per second with the latest optimized code on the ORNL Titan system .
Edit intent: meaning-changed
Original:  Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than four quadrillion elementwise comparisons achieved per second  on the ORNL Titan system  .
Revised:  Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than four quadrillion elementwise comparisons achieved per second on the ORNL Titan system , this being over 3,000X faster than rates using other codes and platforms as reported in the literature. Also it is estimated that as many as 90 quadrillion comparisons per second may be achievable on the upcoming ORNL Summit system, an additional 10X performance increase .
Edit intent: meaning-changed
Original:  Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than nine quadrillion elementwise comparisons achieved per second with the latest optimized code on the ORNL Titan system, this being over 3,000X faster than rates  using other codes and platforms as reported in the literature.
Revised:  Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than nine quadrillion elementwise comparisons achieved per second with the latest optimized code on the ORNL Titan system, this being orders of magnitude faster than rates using other codes and platforms as reported in the literature.
Edit intent: clarity
Original:  Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than nine quadrillion elementwise comparisons achieved per second with the latest optimized code on the ORNL Titan system, this being over 3,000X faster than rates  using other codes and platforms as reported in the literature.
Revised:  Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than nine quadrillion elementwise comparisons achieved per second with the latest optimized code on the ORNL Titan system, this being over 3,000X faster than rates achieved using other codes and platforms as reported in the literature.
Edit intent: fluency
Original:  Though too-connected stocks might be relatively stable during the crisis, they are so influential that a small downward fluctuation will cascade to trigger severe drops of massive successor stocks, implying that their disturbances might be unexpectedly amplified by the collective panic and result in the market crash.
Revised:  Though too-connected stocks might be relatively stable during the crisis, they are so influential that a small downward fluctuation will cascade to trigger severe drops of massive successor stocks, implying that their falls might be unexpectedly amplified by the collective panic and result in the market crash.
Edit intent: clarity
Original:  However, when we are in a heavy-tailed context (in particular when our data are described by a Pareto distribution, as is common in much of extreme value theory), the theory of [ 4 ] is insufficient, and requires an additional regularization step which we introduce.
Revised:  However, when we are in a heavy-tailed context (in particular when our data are described by a Pareto distribution, as is common in much of extreme value theory), the theory of [ 5 ] is insufficient, and requires an additional regularization step which we introduce.
Edit intent: meaning-changed
Original: This note is a study on the problem of assigning non-overlapping disks centered at a set of given points in%DIFDELCMD < {\IR}%%% ^2 such that the sum of area covered by them is maximized.
Revised: We study the problem of assigning non-overlapping disks centered at a set of given points in%DIFDELCMD < {\IR}%%% ^2 such that the sum of area covered by them is maximized.
Edit intent: clarity
Original: This note is a study on the problem of assigning non-overlapping disks centered at a set of given points in%DIFDELCMD < {\IR}%%% ^2 such that the sum of area covered by them is maximized.
Revised: This note is a study on the problem of assigning non-overlapping geometric objects centered at a set of given points in%DIFDELCMD < {\IR}%%% ^2 such that the sum of area covered by them is maximized.
Edit intent: clarity
Original: This note is a study on the problem of assigning non-overlapping disks centered at a set of given points in%DIFDELCMD < {\IR}%%% ^2 such that the sum of area covered by them is maximized.
Revised: This note is a study on the problem of assigning non-overlapping disks centered at a %DIFDELCMD < {\IR}%%% ^2 such that the sum of area covered by them is maximized.
Edit intent: clarity
Original: This note is a study on the problem of assigning non-overlapping disks centered at a set of given points in%DIFDELCMD < {\IR}%%% ^2 such that the sum of area covered by them is maximized.
Revised: This note is a study on the problem of assigning non-overlapping disks centered at a set of given points in%DIFDELCMD < {\IR}%%% given set of points such that the sum of area covered by them is maximized.
Edit intent: clarity
Original:  We show that Eppstein's algorithm for maximizing sum of perimeter of the disks in { %DIFDELCMD < \IR%%%  }^2 gives a 2-approximation solution for the sum of area maximization problem.
Revised:  We show that Eppstein's algorithm for maximizing sum of perimeter of the disks in { %DIFDELCMD < \IR%%% \mathbb{R }^2 gives a 2-approximation solution for the sum of area maximization problem.
Edit intent: meaning-changed
Original:  In particular, by exploiting the Stein-Chen method, we provide a novel and general performance framework applicable to any combination of system and service parameters, such as finite field sizes, lengths of the data stream and level of sparsity.
Revised:  In particular, by exploiting the Stein--Chen method, we provide a novel and general performance framework applicable to any combination of system and service parameters, such as finite field sizes, lengths of the data stream and level of sparsity.
Edit intent: fluency
Original: The ultrastructure fluctuations and complex dynamics of the multi-layered membrane structure of myelin are fundamental for understanding and control its formation process and the processes associated with degeneration and repair in neurological diseases such as multiple sclerosis (MS).
Revised: The ultrastructure fluctuations and complex dynamics of the multi-layered membrane structure of myelin are fundamental for understanding and control its formation process and its degeneration and repair in neurological diseases such as multiple sclerosis (MS).
Edit intent: clarity
Original:  Myelin is considered a quasi-crystalline material due to limitations of the available standard techniques that do not allow to solve heterogeneity and fluctuations in matter at nanoscale and mesoscale .
Revised:  Myelin is considered a liquid-crystal but information are confined to its average structure due to limitations of the available standard techniques that do not allow to solve heterogeneity and fluctuations in matter at nanoscale and mesoscale .
Edit intent: meaning-changed
Original:  To overcome this limitation in this work we  used Scanning micro X-ray Diffraction (S{\mu}XRD) , which is a unique non-invasive probe of both k-space and real space allowing to visualize statistical fluctuations of myelin order with high spatial resolution in real space.
Revised:  To overcome this limitation in this work we have used Scanning micro X-ray Diffraction (S{\mu}XRD) , which is a unique non-invasive probe of both k-space and real space allowing to visualize statistical fluctuations of myelin order with high spatial resolution in real space.
Edit intent: coherence
Original:  To overcome this limitation in this work we  used Scanning micro X-ray Diffraction (S{\mu}XRD) , which is a unique non-invasive probe of both k-space and real space allowing to visualize statistical fluctuations of myelin order with high spatial resolution in real space.
Revised:  To overcome this limitation in this work we used Scanning micro X-ray Diffraction (S{\mu}XRD) which is a unique non-invasive probe of both k-space and real space allowing to visualize statistical fluctuations of myelin order with high spatial resolution in real space.
Edit intent: fluency
Original:  To overcome this limitation in this work we  used Scanning micro X-ray Diffraction (S{\mu}XRD) , which is a unique non-invasive probe of both k-space and real space allowing to visualize statistical fluctuations of myelin order with high spatial resolution in real space.
Revised:  To overcome this limitation in this work we used Scanning micro X-ray Diffraction (S{\mu}XRD) , which is a unique non-invasive probe of both k-space and real space allowing to visualize disorder in myelin with high spatial resolution in real space.
Edit intent: clarity
Original:  Thus, one faces a tradeoff between exploring the available treatments  and exploiting the best treatment, i.e. administering it as often as possible, in order to maximize the cumulative welfare of all the assignments made.
Revised:  Thus, there is a tradeoff between exploring the available treatments and exploiting the best treatment, i.e. administering it as often as possible, in order to maximize the cumulative welfare of all the assignments made.
Edit intent: clarity
Original:  Thus, one faces a tradeoff between exploring the available treatments  and exploiting the best treatment, i.e. administering it as often as possible, in order to maximize the cumulative welfare of all the assignments made.
Revised:  Thus, one faces a tradeoff between exploring the available treatments to learn about their merits and exploiting the best treatment, i.e. administering it as often as possible, in order to maximize the cumulative welfare of all the assignments made.
Edit intent: meaning-changed
Original:  Thus, one faces a tradeoff between exploring the available treatments  and exploiting the best treatment, i.e. administering it as often as possible, in order to maximize the cumulative welfare of all the assignments made.
Revised:  Thus, one faces a tradeoff between exploring the available treatments and exploiting the best treatment, i.e. administering it as often as possible, in order to maximise the cumulative welfare of all the assignments made.
Edit intent: fluency
Original:  Furthermore, we show that the minimax optimality does not come at the price of overly aggressive experimentation in the beginning of the treatment period as we provide upper bounds on the expected number of times any suboptimal treatment is assigned.
Revised:  Furthermore, we show that the minimax optimality does not come at the price of overly aggressive experimentation as we provide upper bounds on the expected number of times any suboptimal treatment is assigned.
Edit intent: clarity
Original:  Thus, a doctor faces a tradeoff between getting imprecise information quickly by making the measurement soon after the treatment is given or getting precise information later at the expense of less information for the individuals who are treated in the meantime  .
Revised:  Thus, a doctor faces a tradeoff between getting imprecise information quickly by making the measurement soon after the treatment is given or getting precise information later at the expense of less information for the individuals who are treated in the meantime . Finally, using Danish register data, we show how our treatment policy can be used to assign unemployed to active labor market policy programs in order to maximise the probability of ending the unemployment spell .
Edit intent: meaning-changed
Original: In a treatment allocation problem the individuals to be treated often arrive gradually. Initially, when the first treatments are made, little is known about the effect of the treatments but as more treatments are assigned the policy maker learns about their effects by observing outcomes. Thus, there is a tradeoff between exploring the available treatments to learn about their merits and exploiting the best treatment, i.e. administering it as often as possible, in order to maximise the cumulative welfare of all the assignments made. Furthermore, a policy maker may not only be interested in the expected effect of the treatment but also its riskiness.
Revised: In a treatment allocation problem the individuals to be treated often arrive sequentially. We study a problem in which the policy maker is not only interested in the expected effect of the treatment but also its riskiness.
Edit intent: clarity
Original:  We propose a dynamic treatment  policy which attains the minimax optimal regret relative to the unknown best treatment in this dynamic setting. We allow for the data to arrive in batches as, say, unemployment programs only start once a month or blood samples are only send to the laboratory for investigation in batches. Furthermore, we show that the minimax optimality does not come at the price of overly aggressive experimentation as we provide upper bounds on the expected number of times any suboptimal treatment is assigned.
Revised:  We propose a dynamic treatment policy which attains the minimax optimal regret is proposed. We also demonstrate that the expected number of times any suboptimal treatment is assigned.
Edit intent: coherence
Original:  Furthermore, we show that the minimax optimality does not come at the price of overly aggressive experimentation as we provide upper bounds on the expected number of times any suboptimal treatment is assigned. We also consider the case where the outcome of a treatment is only observed with delay as it may take time for the treatment to work. Thus, a doctor faces a tradeoff between getting imprecise information quickly by making the measurement soon after the treatment is given or getting precise information later at the expense of less information for the individuals who are treated in the meantime .
Revised:  Furthermore, we show that the minimax optimality does not come at the price of overly aggressive experimentation as we provide upper bounds on the expected number of suboptimal treatments only grows slowly in the number of treatments .
Edit intent: coherence