wanyu/IteraTeR_full_sent huggingface dataset:
Original:  It is first established that checking the sign-stability of a Metzler sign-matrix can be either characterized in terms of the Hurwitz stability of the unit sign-matrix in the corresponding qualitative class, or in terms of the acyclicity of the graph associated with the sign-pattern . Similar results are obtained for the case of  block-matrices and  mixed-matrices, the latter containing both sign patterns and fixed real entries.
Revised:  It is first established that checking the sign-stability of a Metzler sign-matrix can be either characterized in terms of the Hurwitz stability of the unit sign-matrix in the corresponding qualitative class, or in terms of the acyclicity of the graph associated with the sign-pattern . Similar results are obtained for the case of block-matrices and mixed-matrices, the latter being a class of Metzler matrices containing both sign- and real-type entries.
Edit intent: clarity
Original:  The problem of assessing the sign-stability of the convex full of a finite  family of Metzler matrices is also solved, and a necessary and sufficient condition for the existence of a common Lyapunov function for all the matrices in the convex hull is obtained.
Revised:  The problem of assessing the sign-stability of the convex hull of a finite family of Metzler matrices is also solved, and a necessary and sufficient condition for the existence of a common Lyapunov function for all the matrices in the convex hull is obtained.
Edit intent: fluency
Original:  The problem of assessing the sign-stability of the convex full of a finite  family of Metzler matrices is also solved, and a necessary and sufficient condition for the existence of a common Lyapunov function for all the matrices in the convex hull is obtained.
Revised:  The problem of assessing the sign-stability of the convex full of a finite and summable family of Metzler matrices is also solved, and a necessary and sufficient condition for the existence of a common Lyapunov function for all the matrices in the convex hull is obtained.
Edit intent: meaning-changed
Original:  The problem of assessing the sign-stability of the convex full of a finite  family of Metzler matrices is also solved, and a necessary and sufficient condition for the existence of a common Lyapunov function for all the matrices in the convex hull is obtained.
Revised:  The problem of assessing the sign-stability of the convex full of a finite family of Metzler matrices is also solved, and a necessary and sufficient condition for the existence of common Lyapunov functions for all the matrices in the convex hull is obtained.
Edit intent: fluency
Original:  The notion of relative sign-stability is also introduced and a sufficient condition for the relative sign-stability of Metzler matrices is proposed .
Revised:  The notion of relative sign-stability is then generalized to the concept of Ker_+(B)-sign-stability, a problem that arises in analysis of certain jump Markov processes. A sufficient condition for the relative sign-stability of Metzler matrices is proposed .
Edit intent: meaning-changed
Original:  In the former case, margin valuation adjustment (MVA) is defined as the liability-side discounted expected margin profile, while in the latter, an extended partial differential equation is derived and solved by finite difference for an all-in fair value, decomposable into coherent CVA, FVA and MVA.
Revised:  In the former case, margin valuation adjustment (MVA) is defined as the liability-side discounted expected margin profile, while in the latter, an extended partial differential equation is derived and solved for an all-in fair value, decomposable into coherent CVA, FVA and MVA.
Edit intent: clarity
Original:  Initial margin funding charge enters the PDE's delta term as a cost, irrespective of being a long or short position, effectively a tax that cannot be transferred between two clearing members, or a bid-ask spread a market maker charges uncollateralized clients or fellow financial counterparties .
Revised:  For uncollateralized customer trades, MVA can be transferred to the customer via an extension of the liability-side pricing theory. For BCBS-IOSCO covered OTC derivatives, a market maker has to charge financial counterparties a bid-ask spread a market maker charges uncollateralized clients or fellow financial counterparties .
Edit intent: meaning-changed
Original:  Initial margin funding charge enters the PDE's delta term as a cost, irrespective of being a long or short position, effectively a tax that cannot be transferred between two clearing members, or a bid-ask spread a market maker charges uncollateralized clients or fellow financial counterparties .
Revised:  Initial margin funding charge enters the PDE's delta term as a cost, irrespective of being a long or short position, effectively a tax that cannot be transferred between two clearing members, or a bid-ask spread to transfer its funding cost .
Edit intent: clarity
Original:  At 5-day margin period of risk, 99-percentile, and 150 bp margin funding cost, a standalone at-the-money uncollateralized swap of 10 year maturity shows about 2 basis point equivalent charge. The model illustrates that recent CME-LCH basis spread widening is related to elevated MVA accompanying dealers' hedging of customer flows.
Revised:  In particular, a link to ISDA SIMM for equity, commodity and fx risks is established through the PDE with its vega and curvature IM components captured fully. Numerical examples are given for swaps and equity portfolios and offer a plausible attribution of recent CME-LCH basis spread widening is related to elevated MVA accompanying dealers' hedging of customer flows.
Edit intent: meaning-changed
Original:  It turns out that if the topological space X is quasi-compact and sequentially compact, then any element x\in X is R-dominated by an R-maximal element m\in X: xRm . In particular, since the (n-1)-dimensional simplex is a compact subset of the real n-dimensional vector space, then considering its members as portfolios consisting of n financial assets, we obtain the classical 1952 result of Harry Markowitz that any portfolio is dominated by an efficient portfolio.
Revised:  It turns out that if the topological space X is quasi-compact and sequentially compact, then any element of X is R-dominated by an R-maximal element m\in X: xRm . In particular, since the (n-1)-dimensional simplex is a compact subset of the real n-dimensional vector space, then considering its members as portfolios consisting of n financial assets, we obtain the classical 1952 result of Harry Markowitz that any portfolio is dominated by an efficient portfolio.
Edit intent: clarity
Original:  It turns out that if the topological space X is quasi-compact and sequentially compact, then any element x\in X is R-dominated by an R-maximal element m\in X: xRm . In particular, since the (n-1)-dimensional simplex is a compact subset of the real n-dimensional vector space, then considering its members as portfolios consisting of n financial assets, we obtain the classical 1952 result of Harry Markowitz that any portfolio is dominated by an efficient portfolio.
Revised:  It turns out that if the topological space X is quasi-compact and sequentially compact, then any element x\in X is R-dominated by an R-maximal element of X . In particular, since the (n-1)-dimensional simplex is a compact subset of the real n-dimensional vector space, then considering its members as portfolios consisting of n financial assets, we obtain the classical 1952 result of Harry Markowitz that any portfolio is dominated by an efficient portfolio.
Edit intent: clarity
Original: We extend the two-dimension (2D) ePlace algorithm to a flat, analytic, mixed-size placement algorithm ePlace-3D , for three-dimension integrated circuits (3D-ICs) . Nonlinear optimizationis applied over the entire cuboid domain.
Revised: We propose a flat, analytic, mixed-size placement algorithm ePlace-3D , for three-dimension integrated circuits (3D-ICs) . Nonlinear optimizationis applied over the entire cuboid domain.
Edit intent: clarity
Original: We extend the two-dimension (2D) ePlace algorithm to a flat, analytic, mixed-size placement algorithm ePlace-3D , for three-dimension integrated circuits (3D-ICs) . Nonlinear optimizationis applied over the entire cuboid domain.
Revised: We extend the two-dimension (2D) ePlace algorithm to a flat, analytic, mixed-size placement algorithm ePlace-3D for three-dimension integrated circuits (3D-ICs) . Nonlinear optimizationis applied over the entire cuboid domain.
Edit intent: fluency
Original: We extend the two-dimension (2D) ePlace algorithm to a flat, analytic, mixed-size placement algorithm ePlace-3D , for three-dimension integrated circuits (3D-ICs) . Nonlinear optimizationis applied over the entire cuboid domain. Specifically, we develop (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Revised: We extend the two-dimension (2D) ePlace algorithm to a flat, analytic, mixed-size placement algorithm ePlace-3D , for three-dimension integrated circuits (3D-ICs) using nonlinear optimization. Our contributions are (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Edit intent: clarity
Original:  Specifically, we develop (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Revised:  Specifically, we develop (1) electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Edit intent: clarity
Original:  Specifically, we develop (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Revised:  Specifically, we develop (1) eDensity-3D: an electrostatics based 3D density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Edit intent: fluency
Original:  Specifically, we develop (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Revised:  Specifically, we develop (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Edit intent: fluency
Original:  Specifically, we develop (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Revised:  Specifically, we develop (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Edit intent: fluency
Original:  Specifically, we develop (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Revised:  Specifically, we develop (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre-conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Edit intent: fluency
Original:  Specifically, we develop (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for quality and efficiency enhancement.
Revised:  Specifically, we develop (1) eDensity-3D: an electrostatics based 3D placement density function with globally uniform smoothness (2) a 3D numerical solution with improved spectral formulation (3) a 3D nonlinear pre conditioner for convergence acceleration (4) interleaved 2D-3D placement for efficiency enhancement.
Edit intent: clarity
Original:  We integrate all the features into our 3D-IC placement prototype ePlace-3D. Compared to the leading placers mPL6-3D and NTUplace3-3D , our algorithm produces 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer  vertical interconnects (VI) while runs 2.55x faster and 0.30x slower on average of all the ten IBM-PLACE circuits , respectively.
Revised:  Our placer outperforms the leading work mPL6-3D and NTUplace3-3D , our algorithm produces 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer vertical interconnects (VI) while runs 2.55x faster and 0.30x slower on average of all the ten IBM-PLACE circuits , respectively.
Edit intent: clarity
Original:  Compared to the leading placers mPL6-3D and NTUplace3-3D , our algorithm produces 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer  vertical interconnects (VI) while runs 2.55x faster and 0.30x slower on average of all the ten IBM-PLACE circuits , respectively.
Revised:  Compared to the leading placers mPL6-3D and NTUplace3-3D with 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer vertical interconnects (VI) while runs 2.55x faster and 0.30x slower on average of all the ten IBM-PLACE circuits , respectively.
Edit intent: clarity
Original:  Compared to the leading placers mPL6-3D and NTUplace3-3D , our algorithm produces 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer  vertical interconnects (VI) while runs 2.55x faster and 0.30x slower on average of all the ten IBM-PLACE circuits , respectively.
Revised:  Compared to the leading placers mPL6-3D and NTUplace3-3D , our algorithm produces 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer 3D vertical interconnects (VI) while runs 2.55x faster and 0.30x slower on average of all the ten IBM-PLACE circuits , respectively.
Edit intent: meaning-changed
Original:  Compared to the leading placers mPL6-3D and NTUplace3-3D , our algorithm produces 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer  vertical interconnects (VI) while runs 2.55x faster and 0.30x slower on average of all the ten IBM-PLACE circuits , respectively.
Revised:  Compared to the leading placers mPL6-3D and NTUplace3-3D , our algorithm produces 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer vertical interconnects (VI) on average of all the ten IBM-PLACE circuits , respectively.
Edit intent: meaning-changed
Original:  Compared to the leading placers mPL6-3D and NTUplace3-3D , our algorithm produces 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer  vertical interconnects (VI) while runs 2.55x faster and 0.30x slower on average of all the ten IBM-PLACE circuits , respectively.
Revised:  Compared to the leading placers mPL6-3D and NTUplace3-3D , our algorithm produces 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer vertical interconnects (VI) while runs 2.55x faster and 0.30x slower on average of IBM-PLACE circuits , respectively.
Edit intent: clarity
Original:  Compared to the leading placers mPL6-3D and NTUplace3-3D , our algorithm produces 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer  vertical interconnects (VI) while runs 2.55x faster and 0.30x slower on average of all the ten IBM-PLACE circuits , respectively. We also validate ePlace-3D on the large-scale modern mixed-size (MMS) 3D circuits , which shows high performance and scalability.
Revised:  Compared to the leading placers mPL6-3D and NTUplace3-3D , our algorithm produces 6.44\% and 37.15\% shorter wirelength, 9.11\% and 10.27\% fewer vertical interconnects (VI) while runs 2.55x faster and 0.30x slower on average of all the ten IBM-PLACE circuits . Validation on the large-scale modern mixed-size (MMS) 3D circuits , which shows high performance and scalability.
Edit intent: coherence
Original: We investigate the stationary characteristics of an M/G/1 retrial queue where the server, subject to active failures, primarily attends incoming calls and directs outgoing calls only when idle.
Revised: Efficient use of call center operators through technological innovations more often come at the expense of added operation management issues. In this paper, the stationary characteristics of an M/G/1 retrial queue where the server, subject to active failures, primarily attends incoming calls and directs outgoing calls only when idle.
Edit intent: coherence
Original:   On finding the server unavailable ( busy or failed), inbound calls join the orbit and reattempt for service at exponentially-distributed time intervals.
Revised:  The incoming calls arriving at the server follow a Poisson arrival process, while outgoing calls are made in an exponentially distributed time. On finding the server unavailable ( busy or failed), inbound calls join the orbit and reattempt for service at exponentially-distributed time intervals.
Edit intent: meaning-changed
Original:  The system stability condition and probability generating functions  of the number of calls in orbit and system are derived and evaluated numerically in the context of mean system size, server availability, failure frequency , and orbit waiting time.
Revised:  The system stability condition and probability generating functions for the joint queue length distribution of the number of calls in orbit and system are derived and evaluated numerically in the context of mean system size, server availability, failure frequency , and orbit waiting time.
Edit intent: meaning-changed
Original:  The system stability condition and probability generating functions  of the number of calls in orbit and system are derived and evaluated numerically in the context of mean system size, server availability, failure frequency , and orbit waiting time.
Revised:  The system stability condition and probability generating functions of the number of calls in the orbit and the state of the server are derived and evaluated numerically in the context of mean system size, server availability, failure frequency , and orbit waiting time.
Edit intent: meaning-changed
Original:  Stock distance effect is further studied, where companies are found to more likely set their headquarters close to each other. In the normal market environment, the stock correlation decays with the stock distance , but is independent of the stock distance in and after the financial crisis .
Revised:  Stock distance effect is further studied, with a crossover behavior observed for the stock distance distribution. The probability of the short distance is much greater than that of the long distance. The average stock correlation is found to weakly decay with the stock distance , but is independent of the stock distance in and after the financial crisis .
Edit intent: meaning-changed
Original: The sizes in a population of genetically identical%DIFDELCMD < {\it %%% Escherichia coli cells is known to vary, independent of growth stage. Multiple genes and proteins involved in cell division and DNA segregation are involved in regulating cell size. At the same time, physical factors such as temperature, growth rate and population size also appear to affect cell sizes. How these physical factors interact with the genetically encoded ones to produce such effects is however not clearly understood .
Revised: The sizes in a population of genetically identical%DIFDELCMD < {\it %%% Escherichia coli variability in cell size of an isogenic population of Escherichia coli has been widely reported in experiment. The probability density function (PDF) of cell lengths has been variously described by exponential and lognormal functions. While temperature, population density and growth rate have all been shown to affect E. coli cell size distributions, and recent models have validated a link between growth rate and cell size through DNA replication, cell size variability is thought to emerge from growth rate variability. A mechanistic link that could distinguish the source of stochasticity, could improve our understanding of cell size regulation .
Edit intent: meaning-changed
Original:  Here, we have developed a multi-scale model of bacterial DNA replication coupled to cell division in the context of a logistically growing population. DNA replication is modeled as the stochastic dynamics of replication forks (RFs) which transition probabilistically between two states, stalled and recovered. In the model stalled RFs or incomplete DNA replication results in aberrant cell division.
Revised:  Here, we have developed a population dynamics model of individual cell division based on the BCD, birth, chromosome replication and division model, with DNA replication based on the Cooper and Helmstetter (CH) multi-fork replication. In our model, stochasticity in the model arises solely from the dynamics of DNA replication forks. We model the model stalled RFs or incomplete DNA replication results in aberrant cell division.
Edit intent: meaning-changed
Original:  Our model also predicts the variability in cell sizes is independent of growth temperature between 22^o and 42^oC. To test the model, we perform experiments with%DIFDELCMD < {\it %%% E. coli strains mutant for recA, sulA and slmA, factors known to affect replication fork dynamics and coupling to cell division.
Revised:  Our model %DIFDELCMD < {\it %%% E. coli strains mutant for recA, sulA and slmA, factors known to affect replication fork dynamics and coupling to cell division.
Edit intent: coherence
Original:  To test the model, we perform experiments with%DIFDELCMD < {\it %%% E. coli strains mutant for recA, sulA and slmA, factors known to affect replication fork dynamics and coupling to cell division.
Revised:  To test the model, we perform experiments with%DIFDELCMD < {\it %%% strains mutant for recA, sulA and slmA, factors known to affect replication fork dynamics and coupling to cell division.
Edit intent: meaning-changed