wanyu/IteraTeR_full_sent huggingface dataset:
Original:  To address this shortcoming, we present ConceptScope, a text visualization technique that aids visual analysis of documents by referencing a domain ontology to represent the conceptual relationships in a document . ConceptScope uses a Bubble TreeMap visualizationlinked to multiple coordinated views of document structure and concept hierarchy . The visualization also includes overviews of each concept and corresponding information from the document . ConceptScope provides two visualization modes: an exploration mode that allows an overview+detail examination of a given document, and a comparison mode that allows the user to visually compare conceptual structure between multiple documents .
Revised:  To address this shortcoming, we present ConceptScope, a text visualization technique that aids visual analysis of documents by referencing a domain ontology to represent the conceptual relationships in a document . ConceptScope uses a Bubble TreeMap visualizationlinked to multiple coordinated views of document structure and concept hierarchy with text overviews further aid document analysis. ConceptScope facilitates exploration and comparison of single and multiple documents respectively . ConceptScope provides two visualization modes: an exploration mode that allows an overview+detail examination of a given document, and a comparison mode that allows the user to visually compare conceptual structure between multiple documents .
Edit intent: meaning-changed
Original:  We demonstrate ConceptScope by visualizing research articles and transcripts of technical presentations in the computer sciencedomain, and compare it with Docuburst, the popular knowledge visualization toolfor text .
Revised:  We demonstrate ConceptScope by visualizing research articles and transcripts of technical presentations in computer science. In a comparative study with DocuBurst, a popular document visualization tool, ConceptScope was found to be more informative in exploring and comparing domain-specific documents, but less so when it came to documents that spanned multiple disciplines .
Edit intent: meaning-changed
Original:  First, existing ETS designs inhibit emissions but do not constrain warming to any set level. Existing ETSs have the indirect objective of reducing emissions instead of directly reducing warming.
Revised:  First, existing ETS designs inhibit emissions but do not constrain warming to any fxed level, preventing certainty of the global path of warming. Instead, they have the indirect objective of reducing emissions instead of directly reducing warming.
Edit intent: meaning-changed
Original:  Existing ETSs have the indirect objective of reducing emissions instead of directly reducing warming. Even a global mechanism using an existing ETS cannot guarantee a particular warming path. Part 1: A Price on Warming addresses this. My proposed market trades contracts tied to temperature in a double-sided auction  of emissions permits and sequestration contracts . Unlike existing ETSs, the mechanism has a consistent timescale and metric tied to warming, with explicit limits on global temperature in every period into the far future .
Revised:  Existing ETSs have the indirect objective of reducing emissions . They provide poor future price information. And they have high transaction costs for implementation, requiring treaties and laws. To address these shortcomings, this paper proposes a novel double-sided auction of emissions permits and sequestration contracts . Unlike existing ETSs, the mechanism has a consistent timescale and metric tied to warming, with explicit limits on global temperature in every period into the far future .
Edit intent: coherence
Original:  My proposed market trades contracts tied to temperature in a double-sided auction  of emissions permits and sequestration contracts . Unlike existing ETSs, the mechanism has a consistent timescale and metric tied to warming, with explicit limits on global temperature in every period into the far future .
Revised:  My proposed market trades contracts tied to temperature in a double-sided auction mechanism of emissions permits and sequestration contracts . Unlike existing ETSs, the mechanism has a consistent timescale and metric tied to warming, with explicit limits on global temperature in every period into the far future .
Edit intent: clarity
Original:  My proposed market trades contracts tied to temperature in a double-sided auction  of emissions permits and sequestration contracts . Unlike existing ETSs, the mechanism has a consistent timescale and metric tied to warming, with explicit limits on global temperature in every period into the far future . Every auction finds prices for emissions into the far future. Second, if a jurisdiction does not require firms to manage their emissions, the firms have little incentive to do so. Part 2: A Climate Insidium addresses this. My design incentivizes firms to participate even if their jurisdictions do not join. With sanctions from member jurisdictions and participating firms, the design has bottom-up incentives for joining, and the incentives rise over time under realistic conditions, potentially resulting in a rush to join.
Revised:  My proposed market trades contracts tied to temperature in a double-sided auction of emissions permits and sequestration contracts tied to temperature. This mechanism constrains warming for many (e.g., 150) years into the future and every auction would provide price information for this time range. In addition, this paper proposes a set of market rules and a bottom-up incentives for joining, and the incentives rise over time under realistic conditions, potentially resulting in a rush to join.
Edit intent: clarity
Original:  With sanctions from member jurisdictions and participating firms, the design has bottom-up incentives for joining, and the incentives rise over time under realistic conditions, potentially resulting in a rush to join. Third, existing designs have high transaction costs for implementation , requiring international treaties to begin. Part 3: A Faster Path Forward addresses this. I propose a path without national or international action to begin. A coalition can implement these rules, creating political force to accelerate participation. Full implementation still requires national agreements.
Revised:  With sanctions from member jurisdictions and participating firms, the design has bottom-up implementation path. A coalition of businesses begin implementation with jurisdictions joining as they are ready. The combination of the selected market rules and the proposed implementation path appear to incentivize participation.
Edit intent: clarity
Original:  This design appears to be closer to "first best" , with a lower cost of climate mitigation , than any in the literature, while increasing the certainty of avoiding catastrophic global warming. It might also provide a faster pathway to implementation  .
Revised:  This design appears to be closer to "first best" , with a lower cost of climate mitigation , than any in the literature, while increasing the certainty of avoiding catastrophic warming. This design should also have a faster pathway to implementation .
Edit intent: clarity
Original:  In the case where both Willie and Alice jobs have exponential service times with respective rates \mu_1 and \mu_2, we demonstrate a phase-transition when Alice adopts the strategy of inserting a single job probabilistically when the server idles : over n busy periods, she can achieve a covert throughput of O(n) when \mu_1 < 2\mu_2, O(n/\log n) when \mu_1 = 2\mu_2, and O(n^{\mu_2/\mu_1}) when \mu_1 > 2\mu_2.
Revised:  In the case where both Willie and Alice jobs have exponential service times with respective rates \mu_1 and \mu_2, we demonstrate a phase-transition when Alice adopts the strategy of inserting a single job probabilistically when the server idles : over n busy periods, she can achieve a covert throughput , or equivalently an expected number of jobs inserted covertly, of O(n) when \mu_1 < 2\mu_2, O(n/\log n) when \mu_1 = 2\mu_2, and O(n^{\mu_2/\mu_1}) when \mu_1 > 2\mu_2.
Edit intent: meaning-changed
Original:  In the case where both Willie and Alice jobs have exponential service times with respective rates \mu_1 and \mu_2, we demonstrate a phase-transition when Alice adopts the strategy of inserting a single job probabilistically when the server idles : over n busy periods, she can achieve a covert throughput, or equivalently an expected number of jobs inserted covertly , of O(n) when \mu_1 < 2\mu_2, O(n/\log n) when \mu_1 = 2\mu_2, and O(n^{\mu_2/\mu_1}) when \mu_1 > 2\mu_2.
Revised:  In the case where both Willie and Alice jobs have exponential service times with respective rates \mu_1 and \mu_2, we demonstrate a phase-transition when Alice adopts the strategy of inserting a single job probabilistically when the server idles : over n busy periods, she can achieve a covert throughput, measured by the expected number of jobs inserted covertly , of O(n) when \mu_1 < 2\mu_2, O(n/\log n) when \mu_1 = 2\mu_2, and O(n^{\mu_2/\mu_1}) when \mu_1 > 2\mu_2.
Edit intent: clarity
Original:  In the case where both Willie and Alice jobs have exponential service times with respective rates \mu_1 and \mu_2, we demonstrate a phase-transition when Alice adopts the strategy of inserting a single job probabilistically when the server idles : over n busy periods, she can achieve a covert throughput, or equivalently an expected number of jobs inserted covertly , of O(n) when \mu_1 < 2\mu_2, O(n/\log n) when \mu_1 = 2\mu_2, and O(n^{\mu_2/\mu_1}) when \mu_1 > 2\mu_2.
Revised:  In the case where both Willie and Alice jobs have exponential service times with respective rates \mu_1 and \mu_2, we demonstrate a phase-transition when Alice adopts the strategy of inserting a single job probabilistically when the server idles : over n busy periods, she can achieve a covert throughput, or equivalently an expected number of jobs covertly inserted , of O(n) when \mu_1 < 2\mu_2, O(n/\log n) when \mu_1 = 2\mu_2, and O(n^{\mu_2/\mu_1}) when \mu_1 > 2\mu_2.
Edit intent: fluency
Original: How to provide explanations has experienced a surge of interest in Human-Robot Interaction (HRI) over the last three years . In HRIthis is known as explainability, expressivity, transparencyor sometimes legibility, and the challenge for embodied agents is that they offer a unique array of modalities to communicate this information thanks to their embodiment.
Revised: How to provide explanations has experienced a surge of interest in Human-Robot Interaction (HRI) over the last three years , and, in HRI, there are many terms that refer to this concept, e.g., transparency, or legibility. One reason for this high variance in terminology is the unique array of modalities to communicate this information thanks to their embodiment.
Edit intent: clarity
Original:  In HRIthis is known as explainability, expressivity, transparencyor sometimes legibility, and the challenge for embodied agents is that they offer a unique array of modalities to communicate this information thanks to their embodiment. Responding to this surge of interest, we review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions,  (2) showing how explainability is implemented and how it exploits different modalities, and  (3) showing how the impact of explainability is measured.
Revised:  In HRIthis is known as explainability, expressivity, transparencyor sometimes legibility, and the challenge for embodied agents is that they offer a unique array of modalities that embodied agents have access to when compared with non-embodied agents. Another reason is that, different authors use these terms in different ways. We, hence, review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions, (2) showing how explainability is implemented and how it exploits different modalities, and (3) showing how the impact of explainability is measured.
Edit intent: coherence
Original:  Responding to this surge of interest, we review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions,  (2) showing how explainability is implemented and how it exploits different modalities, and  (3) showing how the impact of explainability is measured.
Revised:  Responding to this surge of interest, we review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions, by (2) showing how explainability is implemented and how it exploits different modalities, and (3) showing how the impact of explainability is measured.
Edit intent: fluency
Original:  Responding to this surge of interest, we review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions,  (2) showing how explainability is implemented and how it exploits different modalities, and  (3) showing how the impact of explainability is measured.
Revised:  Responding to this surge of interest, we review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions, (2) showing how explainability is implemented and how it exploits different modalities, and by (3) showing how the impact of explainability is measured.
Edit intent: fluency
Original: How to make robots explainable has experienced a surge of interest in Human-Robot Interaction (HRI) over the last three years, and, in HRI, there are many terms that refer to this concept, e.g., transparency , or legibility.
Revised: The issue of how to make embodied agents explainable has experienced a surge of interest in Human-Robot Interaction (HRI) over the last three years, and, in HRI, there are many terms that refer to this concept, e.g., transparency , or legibility.
Edit intent: clarity
Original: How to make robots explainable has experienced a surge of interest in Human-Robot Interaction (HRI) over the last three years, and, in HRI, there are many terms that refer to this concept, e.g., transparency , or legibility.
Revised: How to make robots explainable has experienced a surge of interest over the last three years, and, in HRI, there are many terms that refer to this concept, e.g., transparency , or legibility.
Edit intent: coherence
Original: How to make robots explainable has experienced a surge of interest in Human-Robot Interaction (HRI) over the last three years, and, in HRI, there are many terms that refer to this concept, e.g., transparency , or legibility.
Revised: How to make robots explainable has experienced a surge of interest in Human-Robot Interaction (HRI) over the last three years, and, there are many terms that refer to this concept, e.g., transparency , or legibility.
Edit intent: fluency
Original: How to make robots explainable has experienced a surge of interest in Human-Robot Interaction (HRI) over the last three years, and, in HRI, there are many terms that refer to this concept, e.g., transparency , or legibility.
Revised: How to make robots explainable has experienced a surge of interest in Human-Robot Interaction (HRI) over the last three years, and, in HRI, there are many terms that refer to this concept, e.g., transparency or legibility.
Edit intent: fluency
Original:  We, hence, review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions, by (2) showing how explainability is implemented and how it exploits different modalities, and by (3) showing how the impact of explainability is measured.
Revised:  Hence, we review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions, by (2) showing how explainability is implemented and how it exploits different modalities, and by (3) showing how the impact of explainability is measured.
Edit intent: coherence
Original:  We, hence, review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions, by (2) showing how explainability is implemented and how it exploits different modalities, and by (3) showing how the impact of explainability is measured.
Revised:  We, hence, review the existing literature on explainability URLanize it by (1) providing an overview of existing definitions, by (2) showing how explainability is implemented and how it exploits different modalities, and by (3) showing how the impact of explainability is measured.
Edit intent: fluency
Original:  We, hence, review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions, by (2) showing how explainability is implemented and how it exploits different modalities, and by (3) showing how the impact of explainability is measured.
Revised:  We, hence, review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions, (2) showing how explainability is implemented and how it exploits different modalities, and by (3) showing how the impact of explainability is measured.
Edit intent: fluency
Original:  We, hence, review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions, by (2) showing how explainability is implemented and how it exploits different modalities, and by (3) showing how the impact of explainability is measured.
Revised:  We, hence, review the existing literature in explainability URLanize it by (1) providing an overview of existing definitions, by (2) showing how explainability is implemented and how it exploits different social cues, and (3) showing how the impact of explainability is measured.
Edit intent: clarity
Original: We study two new versions of independent and dominating set problems on vertex-colored interval graphs, namely f-Balanced Independent Set (f-BIS) and f-Balanced Dominating Set (f-BDS).
Revised: We study two new versions of independent and dominating set problems on vertex-colored interval graphs, namely f-Balanced Independent Set (f-BIS) and f-Balanced Dominating Set (f-BDS).
Edit intent: fluency
Original:  Let G=(V,E) be a vertex-colored interval graph with a k-coloring \gamma \colon V \rightarrow \{1,\ldots,k\} for some k \in \mathbb N . A subset of vertices S\subseteq V is called f-balanced if S contains f vertices from each color class.
Revised:  Let G=(V,E) be a vertex-colored interval graph with a color assignment function \gamma \colon V \rightarrow \{1,\ldots,k\} for some k \in \mathbb N . A subset of vertices S\subseteq V is called f-balanced if S contains f vertices from each color class.
Edit intent: meaning-changed
Original:  Let G=(V,E) be a vertex-colored interval graph with a k-coloring \gamma \colon V \rightarrow \{1,\ldots,k\} for some k \in \mathbb N . A subset of vertices S\subseteq V is called f-balanced if S contains f vertices from each color class.
Revised:  Let G=(V,E) be a vertex-colored interval graph with a k-coloring \gamma \colon V \rightarrow \{1,\ldots,k\} that maps all vertices in G onto k colors . A subset of vertices S\subseteq V is called f-balanced if S contains f vertices from each color class.
Edit intent: meaning-changed
Original:  Let G=(V,E) be a vertex-colored interval graph with a k-coloring \gamma \colon V \rightarrow \{1,\ldots,k\} for some k \in \mathbb N . A subset of vertices S\subseteq V is called f-balanced if S contains f vertices from each color class.
Revised:  Let G=(V,E) be a vertex-colored interval graph with a k-coloring \gamma \colon V \rightarrow \{1,\ldots,k\} for some k \in \mathbb N . A subset of vertices S\subseteq V is called f-balanced if S contains f vertices from each color class.
Edit intent: fluency
Original:  For the BIS problem on interval graphs, we design two %DIFDELCMD < \FPT%%% \ algorithms, one parameterized by (f,k) and the other by the vertex cover number of G. Moreover, we present a 2-approximation algorithm for a slight variation of BIS on proper interval graphs .
Revised:  For the BIS problem on interval graphs, we design two %DIFDELCMD < \FPT%%% FPT algorithms, one parameterized by (f,k) and the other by the vertex cover number of G. Moreover, we present a 2-approximation algorithm for a slight variation of BIS on proper interval graphs .
Edit intent: meaning-changed
Original:  For the BIS problem on interval graphs, we design two %DIFDELCMD < \FPT%%% \ algorithms, one parameterized by (f,k) and the other by the vertex cover number of G. Moreover, we present a 2-approximation algorithm for a slight variation of BIS on proper interval graphs .
Revised:  For the BIS problem on interval graphs, we design two %DIFDELCMD < \FPT%%% \ algorithms, one parameterized by (f,k) and the other by the vertex cover number of G. Moreover, for an optimization variant of BIS on proper interval graphs .
Edit intent: clarity
Original:  For the BIS problem on interval graphs, we design two %DIFDELCMD < \FPT%%% \ algorithms, one parameterized by (f,k) and the other by the vertex cover number of G. Moreover, we present a 2-approximation algorithm for a slight variation of BIS on proper interval graphs .
Revised:  For the BIS problem on interval graphs, we design two %DIFDELCMD < \FPT%%% \ algorithms, one parameterized by (f,k) and the other by the vertex cover number of G. Moreover, we present a 2-approximation algorithm for a slight variation of BIS on interval graphs, we present a polynomial time approximation scheme (PTAS) and an O(n\log n) time 2-approximation algorithm .
Edit intent: meaning-changed
Original:  The proposed FD method has 2-\alpha order of accuracy with respect to time, where \alpha \in(0, 1) is the subdiffusion parameter, and 2 with respect to space .
Revised:  The proposed FD method has 2-\alpha order of accuracy with respect to time, where \alpha \in(0,1) is the subdiffusion parameter, and 2 with respect to space .
Edit intent: fluency
Original:  The proposed FD method has 2-\alpha order of accuracy with respect to time, where \alpha \in(0, 1) is the subdiffusion parameter, and 2 with respect to space . The paper is a continuation of 13%DIFDELCMD < ]%%% , where the derivation of the governing fractional differential equation, similarly as the stability and convergence analysis can be found .
Revised:  The proposed FD method has 2-\alpha order of accuracy with respect to time, where \alpha \in(0, 1) is the subdiffusion parameter, and 2 with respect to space 13%DIFDELCMD < ]%%% , where the derivation of the governing fractional differential equation, similarly as the stability and convergence analysis can be found .
Edit intent: coherence
Original:  In the article it is also shown how to valuate numerically wide range of barrier options using the FD approach . The proposed FD method has 2-\alpha order of accuracy with respect to time, where \alpha\in(0,1) is the subdiffusion parameter, and 2 with respect to space .
Revised:  In the article it is also shown how to valuate numerically wide range of barrier options using the FD approach .
Edit intent: coherence
Original: Functional connectomes , which are symmetric correlation matrices, have been used to study changes in URLanization with aging, cognitive abilities and across a wide range of brain disorders. They have also been shown to provide a reproducible individual fingerprint, which has opened the possibility of personalized medicine for neuro/psychiatric disorders.
Revised: Functional connectomes (FCs), have been shown to provide a reproducible individual fingerprint, which has opened the possibility of personalized medicine for neuro/psychiatric disorders.
Edit intent: coherence
Original:  Thus, an accurate way to compare functional connectomes is essential . Canonically, functional connectomes are compared using Pearson's correlation coefficient of the entire functional connectivity profiles.
Revised:  Thus, developing accurate ways to compare FCs is essential to establish associations with behavior and/or cognition at the individual-level . Canonically, functional connectomes are compared using Pearson's correlation coefficient of the entire functional connectivity profiles.
Edit intent: meaning-changed