wanyu/IteraTeR_v2 huggingface dataset:
Original:  This occurs when the initial phase of the clock is within the horizontally closed region of the data eye . Next, we model the synchronizer system as a Markov chain with absorbing states and determine the mean absorption time which is indicative of the mean settling time of the circuit  .
Revised:  This occurs when the initial phase of the clock is within the horizontally closed region of the data eye . Next, we model the synchronizer system as a Markov chain with absorbing states . Here, the mean time of absorption of the Markov chain, which represents the mean settling time of the circuit .
Edit intent: clarity
Original:  This occurs when the initial phase of the clock is within the horizontally closed region of the data eye . Next, we model the synchronizer system as a Markov chain with absorbing states and determine the mean absorption time which is indicative of the mean settling time of the circuit  .
Revised:  This occurs when the initial phase of the clock is within the horizontally closed region of the data eye . Next, we model the synchronizer system as a Markov chain with absorbing states and determine the mean absorption time which is indicative of the mean settling time of the circuit , is determined .
Edit intent: coherence
Original:  The model predictions match well with behavioural simulations of the synchronizer.
Revised:  The model is validated by using behavioural simulations of the synchronizer.
Edit intent: clarity
Original: It is well known that timing jitter can degrade the bit error rate (BER) of receivers that recover clock information from the input data.
Revised: It is well known that timing jitter can degrade the bit error rate (BER) of receivers that recover the clock from input data.
Edit intent: clarity
Original:  However, timing jitter can also result in an indefinite increase in the settling time of clock recovery circuits at the receivers , particularly in low swing mesochronous systems.
Revised:  However, timing jitter can also result in an indefinite increase in the settling time of clock recovery circuits , particularly in low swing mesochronous systems.
Edit intent: clarity
Original:  First, a discussion on how timing jitter can result in  large increase in the settling time of the clock recovery circuit is presented . Next, the circuit is modeled as a Markov chain with absorbing states.
Revised:  First, a discussion on how timing jitter can result in a large increase in the settling time of the clock recovery circuit is presented . Next, the circuit is modeled as a Markov chain with absorbing states.
Edit intent: fluency
Original:  First, a discussion on how timing jitter can result in  large increase in the settling time of the clock recovery circuit is presented . Next, the circuit is modeled as a Markov chain with absorbing states.
Revised:  First, a discussion on how timing jitter can result in large increase in the settling time of the clock recovery circuit . Next, the circuit is modeled as a Markov chain with absorbing states.
Edit intent: clarity
Original:  First, a discussion on how timing jitter can result in  large increase in the settling time of the clock recovery circuit is presented . Next, the circuit is modeled as a Markov chain with absorbing states.
Revised:  First, a discussion on how timing jitter can result in large increase in the settling time of the clock recovery circuit is presented . Next, the circuit is modelled as a Markov chain with absorbing states.
Edit intent: fluency
Original:  Here, the mean time of absorption of the Markov chain, which represents the mean settling time of the circuit, is determined.
Revised:  The mean time to absorption of the Markov chain, which represents the mean settling time of the circuit, is determined.
Edit intent: coherence
Original:  The model is validated by using behavioural simulations of the circuit, the results of which match well with the model predictions.
Revised:  The model is validated through behavioural simulations of the circuit, the results of which match well with the model predictions.
Edit intent: coherence
Original:  The modelling is applied to study the effect of different types of jitter, like data dependent jitter of 1 bit and 2 bits, random jitter and random jitter along with 1 bit data dependent jitter.
Revised:  We consider circuits with (i) data dependent jitter of 1 bit and 2 bits, random jitter and random jitter along with 1 bit data dependent jitter.
Edit intent: clarity
Original:  We construct a joint generative model for the data and metadata, and a non-parametric Bayesian framework to infer its parameters from annotated datasets.
Revised:  We construct a joint generative model for the data and metadata, and a nonparametric Bayesian framework to infer its parameters from annotated datasets.
Edit intent: fluency
Original: Compression fundamentally involves a decision about what is relevant and what is not.
Revised: Compression fundamentally involves a decision about what features are relevant and which are not.
Edit intent: clarity
Original:  As suggested by its name, the solution to the DIB problem is a deterministic encoder,  as opposed to the stochastic encoder  that is optimal under the IB.
Revised:  As suggested by its name, the solution to the DIB problem turns out to be a deterministic encoder, as opposed to the stochastic encoder that is optimal under the IB.
Edit intent: clarity
Original:  After deriving the method, we then compare the IB and DIB on synthetic data, showing that the IB and DIB perform similarly in terms of the IB cost function, but that the DIB significantly outperforms the IB in terms of the DIB cost function.
Revised:  We compare the IB and DIB on synthetic data, showing that the IB and DIB perform similarly in terms of the IB cost function, but that the DIB significantly outperforms the IB in terms of the DIB cost function.
Edit intent: clarity
Original:  Moreover, the DIB offered a 1-2 order of magnitude speedup over the IB in our experiments .
Revised:  We also empirically find that the DIB offers a considerable gain in computational efficiency over the IB in our experiments .
Edit intent: clarity
Original:  Furthermore, we deduce the well-posedness of a variant of the model with quasi-static nutrient by rigorously passing to the limit where the ratio of  nutrient diffusion time-scale to the tumor doubling time-scale is small.
Revised:  Furthermore, we deduce the well-posedness of a variant of the model with quasi-static nutrient by rigorously passing to the limit where the ratio of the nutrient diffusion time-scale to the tumor doubling time-scale is small.
Edit intent: fluency
Original:  In this article, we study the opportunistic utilization of low-altitude unmanned aerial platforms equipped with base stations (BSs), i.e., drone-cells , in 5G networks.
Revised:  In this article, we study the opportunistic utilization of low-altitude unmanned aerial platforms equipped with base stations (BSs), i.e., drone-BSs , in 5G networks.
Edit intent: clarity
Original:  Hence, drone-cells bring the supply to where the demand is, which sets new frontiers for heterogeneity of 5G networks.
Revised:  Hence, drone-cells bring the supply to where the demand is, which sets new frontiers for the heterogeneity in 5G networks.
Edit intent: clarity
Original:  Here we exploit conditions that stabilize membrane heterogeneity to  test the correlation between the anesthetic potency of n-alcohols and effects on T_c.
Revised:  Here we exploit conditions that stabilize membrane heterogeneity to further test the correlation between the anesthetic potency of n-alcohols and effects on T_c.
Edit intent: clarity
Original: This note proposes a new get-rich-quick scheme that involves trading in a stock with a continuous but not constant price path.
Revised: This paper proposes new get-rich-quick scheme that involves trading in a stock with a continuous but not constant price path.
Edit intent: clarity
Original: This note proposes a new get-rich-quick scheme that involves trading in a stock with a continuous but not constant price path.
Revised: This note proposes a new get-rich-quick schemes that involve trading in a stock with a continuous but not constant price path.
Edit intent: fluency
Original: This note proposes a new get-rich-quick scheme that involves trading in a stock with a continuous but not constant price path.
Revised: This note proposes a new get-rich-quick scheme that involves trading in a stock with a non-degenerate price path.
Edit intent: clarity
Original:  The existence of such a scheme, whose practical value is tempered by its use of the Axiom of Choice , shows that imposing regularity conditions (such as measurability) is essential even in the foundations of game-theoretic probability .
Revised:  The existence of such a scheme, whose practical value is tempered by its use of the Axiom of Choice .
Edit intent: coherence
Original: This paper proposes new get-rich-quick schemes that involve trading in a stock with a non-degenerate price path.
Revised: This paper proposes new get-rich-quick schemes that involve trading in a financial security with a non-degenerate price path.
Edit intent: clarity
Original:  In this paper, we focus on a task of detecting structure-correlated attributes on a graph.
Revised:  In this paper, we thus focus on the task of detecting structure-correlated attributes on a graph.
Edit intent: coherence
Original:  To solve this task, we formulate a statistical hypothesis testing to decide if the given attribute activates a community in a graph with interfering by the Bernoulli noise .
Revised:  To solve the task, we formulate a statistical hypothesis testing to decide if the given attribute activates a community in a graph with interfering by the Bernoulli noise .
Edit intent: coherence
Original:  We further apply the proposed methods to two real-world applications: high air pollution detection and ranking attributes for community detection in a coauthorship network collected from IEEE Xplore.
Revised:  We further apply the proposed methods to two real-world applications: high air-pollution detection and keyword ranking in a co-authorship network collected from IEEE Xplore.
Edit intent: clarity
Original:  The experimental results show that the proposed graph wavelet statistic and graph scan statistic are effective and efficient.
Revised:  Experimental results show that the proposed graph wavelet statistic and graph scan statistic are effective and efficient.
Edit intent: clarity
Original:  I present tight bounds on the number of blanks when the pieces must be connected , convex or rectangular.
Revised:  I present tight bounds on the number of blanks when the pieces must be connected or convex or rectangular.
Edit intent: fluency
Original:  I present tight bounds on the number of blanks when the pieces must be connected or convex or rectangular.
Revised:  The paper presents tight bounds on the number of blanks when the pieces must be connected or convex or rectangular.
Edit intent: clarity
Original:  I present tight bounds on the number of blanks when the pieces must be connected or convex or rectangular.
Revised:  I present tight bounds on the number of blanks when the pieces must be connected , convex or rectangular.
Edit intent: fluency
Original: On a two-dimensional cake , there are m pairwise-disjoint toppings.
Revised: Inside a two dimensional region ("cake") , there are m pairwise-disjoint toppings.
Edit intent: clarity
Original:  The paper presents tight bounds on the number of blanks when the pieces must be connected, convex or rectangular .
Revised:  The paper presents tight bounds on the number of blanks .
Edit intent: clarity
Original:  We would like to expand the toppings ( keeping them non-overlapping ) and possibly add some blank pieces of the same "certain kind", such that the entire cake is covered.
Revised:  We want to expand the toppings ( keeping them non-overlapping ) and possibly add some blank pieces of the same "certain kind", such that the entire cake is covered.
Edit intent: coherence
Original:  We would like to expand the toppings ( keeping them non-overlapping ) and possibly add some blank pieces of the same "certain kind", such that the entire cake is covered.
Revised:  We would like to expand the toppings while keeping them non-overlapping ) and possibly add some blank pieces of the same "certain kind", such that the entire cake is covered.
Edit intent: clarity
Original:  We would like to expand the toppings ( keeping them non-overlapping ) and possibly add some blank pieces of the same "certain kind", such that the entire cake is covered.
Revised:  We would like to expand the toppings ( keeping them non-overlapping , and possibly add some blank pieces of the same "certain kind", such that the entire cake is covered.
Edit intent: fluency
Original: Finding relevant publications or presentations matters to scientists who have to cope with exponentially increasing numbers of published papers.
Revised: Finding relevant publications is important for scientists who have to cope with exponentially increasing numbers of published papers.
Edit intent: clarity
Original:  Algorithms help with this task , analogous to the ones used for music, movie, or product recommendations.
Revised:  Algorithms help with this task as they help for music, movie, or product recommendations.
Edit intent: clarity
Original:  Algorithms help with this task , analogous to the ones used for music, movie, or product recommendations.
Revised:  Algorithms help with this task , analogous to the ones used for music, movie, and product recommendations.
Edit intent: fluency
Original:  We viewed human curated topics assignments as inducing a noisy similarity metric and optimized our algorithm to produce a similarity metric that maximally correlated with the human one .
Revised:  Human curated topics are used to cross validate parameters in the algorithm and produce a similarity metric that maximally correlated with the human one .
Edit intent: clarity
Original:  We viewed human curated topics assignments as inducing a noisy similarity metric and optimized our algorithm to produce a similarity metric that maximally correlated with the human one .
Revised:  We viewed human curated topics assignments as inducing a noisy similarity metric and optimized our algorithm to produce a similarity metric that maximally correlates with human judgments .
Edit intent: clarity
Original:  Our result is based on a novel combination of both new and old ideas.
Revised:  Our result is based on a novel combination of both old and new ideas.
Edit intent: fluency
Original:  Finally, we use a deterministic variation of the witness-collector technique (developed recently by Devillers et al.) in the context of our stratified construction.
Revised:  Finally, we use a deterministic adaptation of the witness-collector technique (developed recently by Devillers et al.) in the context of our stratified construction.
Edit intent: clarity
Original:  Such problems are often encountered in multimedia and vision applications involving large-scale content recognition.
Revised:  Such problems are often encountered in multimedia applications involving large-scale content recognition.
Edit intent: clarity
Original:  Here I argue that these claims are in conflict with basic laws of physics taught in college .
Revised:  Here I argue that these claims are in conflict with basic laws of physics .
Edit intent: clarity
Original:  One can conveniently analyze these reports with the same back-of-the-envelope calculations .
Revised:  The paramagnetic nature of protein complexes is found to seriously limit their utility for engineering magnetically sensitive cells .
Edit intent: coherence
Original:  Two other articles report creation of a magnetically-gated ion channel by attaching ferritin to an ion channel and pulling on the ferritin with a magnetic field (Stanley et al., 2015;
Revised:  Two other articles report magnetic control of membrane conductance by attaching ferritin to an ion channel and pulling on the ferritin with a magnetic field (Stanley et al., 2015;
Edit intent: clarity
Original:  Here I argue that these claims are in conflict with basic laws of physics.
Revised:  Here I argue that these claims conflict with basic laws of physics.
Edit intent: clarity
Original: As previous OS abstractions and structures fail to explicitly consider the separation between resource users and providers, the shift toward server-side computing poses serious challenges to OS structures , which is aggravated by the increasing many-core scale and workload diversity .
Revised: Previous OS abstractions and structures fail to explicitly consider the separation between resource users and providers, the shift toward server-side computing poses serious challenges to OS structures , which is aggravated by the increasing many-core scale and workload diversity .
Edit intent: coherence
Original:  We horizontally decompose the OS into the supervisor for the resource provider and several subOSes for resource users.
Revised:  We horizontally decompose the OS into the supervisor and several subOSes for resource users.
Edit intent: clarity
Original:  We present the first implementation, RainForest, which supports unmodified Linux applications binaries.
Revised:  We present the first implementation-RainForest, which supports unmodified Linux applications binaries.
Edit intent: fluency
Original:  Our comprehensive evaluations using six benchmark suites quantitatively show RainForest outperforms Linux with three different kernels, LXC, and XEN . The RainForest source code is soon available.
Revised:  Our comprehensive evaluations show RainForest outperforms Linux with three different kernels, LXC, and XEN . The RainForest source code is soon available.
Edit intent: clarity
Original: Previous OS abstractions and structures are mainly proposed for the average performance.
Revised: Modern datacenter (DC) workloads are characterized by increasing diversity and differentiated QoS requirements in terms of the average or worst-case performance.
Edit intent: clarity
Original:  The shift toward server side computing calls for new OS structures for the worst-case performance .
Revised:  The shift towards DC calls for the new OS architectures that not only gracefully achieve disparate performance goals, but also protect software investments .
Edit intent: clarity
Original:  SubOSes and supervisor have confined state sharing (isolate states first), but fast inter-subOS communication mechanisms are provided on demand (then share).
Revised:  We confine state sharing among the supervisor and SubOSes (isolate states first), but fast inter-subOS communication mechanisms are provided on demand (then share).
Edit intent: clarity
Original:  SubOSes and supervisor have confined state sharing (isolate states first), but fast inter-subOS communication mechanisms are provided on demand (then share).
Revised:  SubOSes and supervisor have confined state sharing (isolate states first), and provide fast inter-subOS communication mechanisms are provided on demand (then share).
Edit intent: coherence
Original:  SubOSes and supervisor have confined state sharing (isolate states first), but fast inter-subOS communication mechanisms are provided on demand (then share).
Revised:  SubOSes and supervisor have confined state sharing (isolate states first), but fast inter-subOS communication mechanisms on demand (then share).
Edit intent: clarity
Original:  We present the first implementation-RainForest , which supports unmodified Linux applications binaries.
Revised:  We present the first implementation--RainForest , which supports unmodified Linux applications binaries.
Edit intent: fluency
Original:  We present the first implementation-RainForest , which supports unmodified Linux applications binaries.
Revised:  We present the first implementation-RainForest , which supports unmodified Linux binaries.
Edit intent: clarity
Original:  Our comprehensive evaluations show RainForest outperforms Linux with three different kernels, LXC, Xen, and Barrelfish in terms of reducing tail latency .
Revised:  Our comprehensive evaluations show RainForest outperforms Linux with three different kernels, LXC, and Xen in terms of reducing tail latency .
Edit intent: fluency
Original:  We decompose the OS into the supervisor and several subOSes running side by side : a subOS directly manages physical resources without intervention from the supervisor (isolate resources first) , while the supervisor can create, destroy, resize a subOS on-the-fly (then share).
Revised:  We decompose the OS into the supervisor and several subOSes running side by side : a subOS directly manages physical resources , while the supervisor can create, destroy, resize a subOS on-the-fly (then share).
Edit intent: clarity
Original:  We confine state sharing among the supervisor and SubOSes (isolate states first), and provide fast inter-subOS communication mechanisms on demand (then share) .
Revised:  We confine state sharing among the supervisor and SubOSes (isolate states first), and provide fast inter-subOS communication mechanisms are provided on demand .
Edit intent: clarity
Original:  We present the first implementation--RainForest, which supports unmodified Linux binaries.
Revised:  We present the first implementation, RainForest, which supports unmodified Linux binaries.
Edit intent: fluency
Original:  Our comprehensive evaluations show RainForest outperforms Linux with three different kernels, LXC, and Xen in terms of improving resource utilization, throughput, scalability, and worst-case performance.
Revised:  Our comprehensive evaluation shows RainForest outperforms Linux with three different kernels, LXC, and Xen in terms of improving resource utilization, throughput, scalability, and worst-case performance.
Edit intent: fluency
Original:  Our comprehensive evaluations show RainForest outperforms Linux with three different kernels, LXC, and Xen in terms of improving resource utilization, throughput, scalability, and worst-case performance.
Revised:  Our comprehensive evaluations show RainForest outperforms Linux with three different kernels, LXC, and Xen in terms of worst-case performance.
Edit intent: clarity
Original:  The RainForest source code is soon available .
Revised:  The RainForest source code is available soon .
Edit intent: coherence
Original:  We show that given the size-n efficient encoding of a 2^{ \mathcal{O k(n) ) }\times 2^{ \mathcal{O k(n) )%DIFDELCMD < \MBLOCKRIGHTBRACE %%% well-conditioned matrix H, approximating a particular entry of H^{-1 is complete for the class of problems solvable by a quantum algorithm that uses O(k(n)) space and performs all quantum measurements at the end of the computation.
Revised:  We show that given the size-n efficient encoding of a 2^{ k(n) ) }\times 2^{ \mathcal{O k(n) )%DIFDELCMD < \MBLOCKRIGHTBRACE %%% well-conditioned matrix H, approximating a particular entry of H^{-1 is complete for the class of problems solvable by a quantum algorithm that uses O(k(n)) space and performs all quantum measurements at the end of the computation.
Edit intent: fluency
Original:  We show that given the size-n efficient encoding of a 2^{ \mathcal{O k(n) ) }\times 2^{ \mathcal{O k(n) )%DIFDELCMD < \MBLOCKRIGHTBRACE %%% well-conditioned matrix H, approximating a particular entry of H^{-1 is complete for the class of problems solvable by a quantum algorithm that uses O(k(n)) space and performs all quantum measurements at the end of the computation.
Revised:  We show that given the size-n efficient encoding of a 2^{ \mathcal{O k(n) }\times 2^{ \mathcal{O k(n) )%DIFDELCMD < \MBLOCKRIGHTBRACE %%% well-conditioned matrix H, approximating a particular entry of H^{-1 is complete for the class of problems solvable by a quantum algorithm that uses O(k(n)) space and performs all quantum measurements at the end of the computation.
Edit intent: fluency