wanyu/IteraTeR_v2 huggingface dataset:
Original:  These results significantly improve the state-of-the-art scheme in which it takes 5 \frac{n{d tests to identify the positives in O%DIFDELCMD < \left( %DIFDELCMD < %%% \frac{n{d} \frac{n{d}} + d^2 }%DIFDELCMD < \right) %%% time with the measurement matrices associated with the scheme stored somewhere \approx 4.
Revised:  These results significantly improve the state-of-the-art scheme in which it takes 5 \frac{n{d tests to identify %DIFDELCMD < \left( %DIFDELCMD < %%% \frac{n{d} \frac{n{d}} + d^2 }%DIFDELCMD < \right) %%% time with the measurement matrices associated with the scheme stored somewhere \approx 4.
Edit intent: clarity
Original:  These results significantly improve the state-of-the-art scheme in which it takes 5 \frac{n{d tests to identify the positives in O%DIFDELCMD < \left( %DIFDELCMD < %%% \frac{n{d} \frac{n{d}} + d^2 }%DIFDELCMD < \right) %%% time with the measurement matrices associated with the scheme stored somewhere \approx 4.
Revised:  These results significantly improve the state-of-the-art scheme in which it takes 5 \frac{n{d tests to identify the positives in O%DIFDELCMD < \left( %DIFDELCMD < %%% {d} \frac{n{d}} + d^2 }%DIFDELCMD < \right) %%% time with the measurement matrices associated with the scheme stored somewhere \approx 4.
Edit intent: fluency
Original:  We use our improved algorithm for maximum flow in  k-apex graphs , together with additional insights, to obtain an O(k^3 n \polylog (nC))-time algorithm for computing maximum integer flows in planar graphs with integer arc and vertex capacities bounded by C, and k sources and sinks.
Revised:  We use our improved algorithm for maximum flow in the k-apex graphs , together with additional insights, to obtain an O(k^3 n \polylog (nC))-time algorithm for computing maximum integer flows in planar graphs with integer arc and vertex capacities bounded by C, and k sources and sinks.
Edit intent: fluency
Original:  We use our improved algorithm for maximum flow in  k-apex graphs , together with additional insights, to obtain an O(k^3 n \polylog (nC))-time algorithm for computing maximum integer flows in planar graphs with integer arc and vertex capacities bounded by C, and k sources and sinks.
Revised:  We use our improved algorithm for maximum flow in k-apex graphs polylog (nC))-time algorithm for computing maximum integer flows in planar graphs with integer arc and vertex capacities bounded by C, and k sources and sinks.
Edit intent: clarity
Original: Formal methods and supporting tools have a long record of successes in the development of safety-critical systems.
Revised: Formal methods and supporting tools have a long record of success in the development of safety-critical systems.
Edit intent: fluency
Original:  However, it cannot be said that a single tool has emerged as the dominant solution for system design.
Revised:  However, no single tool has emerged as the dominant solution for system design.
Edit intent: clarity
Original:  Each tool differs from the others in terms of modelling language used,  verification capabilities and other complementary features, and each development context has peculiar needs that require different tools.
Revised:  Each tool differs from the others in terms of the modeling language used, verification capabilities and other complementary features, and each development context has peculiar needs that require different tools.
Edit intent: fluency
Original:  Each tool differs from the others in terms of modelling language used,  verification capabilities and other complementary features, and each development context has peculiar needs that require different tools.
Revised:  Each tool differs from the others in terms of modelling language used, its verification capabilities and other complementary features, and each development context has peculiar needs that require different tools.
Edit intent: clarity
Original:  To guide companies in the selection of the most appropriate formal tools to adopt for their contexts, a clear assessment of the features of the  available tools is required.
Revised:  To guide companies in the selection of the most appropriate formal tools to adopt in their contexts, a clear assessment of the features of the available tools is required.
Edit intent: clarity
Original:  To guide companies in the selection of the most appropriate formal tools to adopt for their contexts, a clear assessment of the features of the  available tools is required.
Revised:  To guide companies in the selection of the most appropriate formal tools to adopt for their contexts, a clear assessment of the features of the currently available tools is required.
Edit intent: clarity
Original:  To address this goal, this paper considers a set of 14 formal tools for system design, and  presents a systematic evaluation of the tools and a usability analysis with practitioners.
Revised:  To address this goal, this paper considers a set of 14 formal tools for system design, and it presents a systematic evaluation of the tools and a usability analysis with practitioners.
Edit intent: clarity
Original:  To address this goal, this paper considers a set of 14 formal tools for system design, and  presents a systematic evaluation of the tools and a usability analysis with practitioners.
Revised:  To address this goal, this paper considers a set of 14 formal tools for system design, and presents a systematic evaluation of such tools and a usability analysis with practitioners.
Edit intent: clarity
Original:  The focus is on the railway domain, but the overall methodology can be applied to similar contexts.
Revised:  The focus is on the railway domain, the overall methodology can be applied to similar contexts.
Edit intent: coherence
Original:  Our study  contributes with a systematic evaluation of formal tools and  shows that despite the poor graphical interfaces, usability and maturity of the tools are not major problems, as claimed by other works .
Revised:  Our study thus contributes with a systematic evaluation of formal tools and shows that despite the poor graphical interfaces, usability and maturity of the tools are not major problems, as claimed by other works .
Edit intent: coherence
Original:  Our study  contributes with a systematic evaluation of formal tools and  shows that despite the poor graphical interfaces, usability and maturity of the tools are not major problems, as claimed by other works .
Revised:  Our study contributes with a systematic evaluation of formal tools and it shows that despite the poor graphical interfaces, usability and maturity of the tools are not major problems, as claimed by other works .
Edit intent: coherence
Original:  Our study  contributes with a systematic evaluation of formal tools and  shows that despite the poor graphical interfaces, usability and maturity of the tools are not major problems, as claimed by other works .
Revised:  Our study contributes with a systematic evaluation of formal tools and shows that despite the poor graphical interfaces, usability and maturity of the tools are not major problems, as claimed by contributions from the literature .
Edit intent: clarity
Original:  Instead, process integration support is the most relevant pain point for the majority of the platforms .
Revised:  Instead, support for process integration is the most relevant pain point for the majority of the platforms .
Edit intent: fluency
Original:  Instead, process integration support is the most relevant pain point for the majority of the platforms .
Revised:  Instead, process integration support is the most relevant obstacle for the adoption of most of the tools .
Edit intent: clarity
Original: Network Intrusion Detection Systems (NIDSs) datasets are essential tools used by researchers for the training and evaluation of Machine Learning (ML) -based NIDSmodels.
Revised: Network Intrusion Detection Systems (NIDSs) are important tools for the protection of computer networks against increasingly frequent and sophisticated cyber attacks. Recently, a lot of research effort has been dedicated to the development of Machine Learning (ML) -based NIDSmodels.
Edit intent: clarity
Original:  However, their performances in classifying network traffic , mainly using the multi-classification method, is often unreliable.
Revised:  The use of a unique and proprietary set of features for each of the publicly available datasets makes it virtually impossible to compare the performance of ML-based traffic classifiers on different datasets, and hence to evaluate the ability of these systems to generalise across different network scenarios. To address that limitation , mainly using the multi-classification method, is often unreliable.
Edit intent: coherence
Original:  When needed, the models are extended to account for observed phenomena such as multi-wave dynamics.
Revised:  As important test of the relevance of symmetries we show how to mathematically account for observed phenomena such as multi-wave dynamics.
Edit intent: clarity
Original:  Although we consider the COVID-19 pandemic as an explicit phenomenological application, the models presented here are of immediate relevance for different realms of scientific enquiry from medical applications to the understanding of human behaviour  .
Revised:  The models presented here are of immediate relevance for different realms of scientific enquiry from medical applications to the understanding of human behaviour .
Edit intent: coherence
Original:  In large commercial platforms, however, it is often the case that the recommenders need to make click-through rate (CTR) predictions for multiple business domains.
Revised:  However, in large commercial platforms, however, it is often the case that the recommenders need to make click-through rate (CTR) predictions for multiple business domains.
Edit intent: coherence
Original:  In large commercial platforms, however, it is often the case that the recommenders need to make click-through rate (CTR) predictions for multiple business domains.
Revised:  In large commercial platforms, it is often the case that the recommenders need to make click-through rate (CTR) predictions for multiple business domains.
Edit intent: coherence
Original:  Different domains have overlapping user groups and items , thus exist commonalities.
Revised:  Different domains have overlapping user groups and items . Thus, there exist commonalities.
Edit intent: fluency
Original:  Since the specific user group may be different and the user behaviors may change within a specific domain, different domains also have distinctions.
Revised:  Since the specific user groups have disparity and the user behaviors may change within a specific domain, different domains also have distinctions.
Edit intent: clarity
Original:  Since the specific user group may be different and the user behaviors may change within a specific domain, different domains also have distinctions.
Revised:  Since the specific user group may be different and the user behaviors may change in various business domains, there also have distinctions.
Edit intent: clarity
Original:  The distinctions result in different domain-specific data distributions, which makes it hard for a single shared model to work well on all domains.
Revised:  The distinctions result in domain-specific data distributions, which makes it hard for a single shared model to work well on all domains.
Edit intent: clarity
Original:  The distinctions result in different domain-specific data distributions, which makes it hard for a single shared model to work well on all domains.
Revised:  The distinctions result in different domain-specific data distributions, making it hard for a single shared model to work well on all domains.
Edit intent: coherence
Original:  To address the problem , we present Star Topology Adaptive Recommender (STAR) , where one model is learned to serve all domains effectively . Concretely, STAR has the star topology, which consists of the shared centered parameters and domain-specific parameters.
Revised:  To address the problem , we present Star Topology Adaptive Recommender (STAR) . Concretely, STAR has the star topology, which consists of the shared centered parameters and domain-specific parameters.
Edit intent: clarity
Original:  The shared parameters are used to learn commonalities of all domains  and the domain-specific parameters capture domain distinction for more refined prediction.
Revised:  The shared parameters are applied to learn commonalities of all domains and the domain-specific parameters capture domain distinction for more refined prediction.
Edit intent: clarity
Original:  The shared parameters are used to learn commonalities of all domains  and the domain-specific parameters capture domain distinction for more refined prediction.
Revised:  The shared parameters are used to learn commonalities of all domains , and the domain-specific parameters capture domain distinction for more refined prediction.
Edit intent: fluency
Original:  Given requests from different  domains, STAR can adapt its parameters conditioned on the domain  .
Revised:  Given requests from different business domains, STAR can adapt its parameters conditioned on the domain .
Edit intent: clarity
Original: In today's digital world  there is an increasing focus on soft skills.
Revised: In today's digital world , there is an increasing focus on soft skills.
Edit intent: fluency
Original:  We measured the performance of the tools considering different training models and validated our approach comparing our list of soft skills with the skills labelled as transversal in ESCO (European Skills /Competence Qualification and Occupation) .
Revised:  We measured the performance of our approach against different training models and validated our approach comparing our list of soft skills with the skills labelled as transversal in ESCO (European Skills /Competence Qualification and Occupation) .
Edit intent: clarity
Original:  We measured the performance of the tools considering different training models and validated our approach comparing our list of soft skills with the skills labelled as transversal in ESCO (European Skills /Competence Qualification and Occupation) .
Revised:  We measured the performance of the tools considering different training models and validated our approach comparing our list of soft skills with the skills labelled as transversal in ESCO (European Skill /Competence Qualification and Occupation) .
Edit intent: fluency
Original:  Finally we give a first example of how the SkillNER can be used, identifying the relationships among ESCO job profiles based on  soft skills shared, and the relationships among soft skills based on job profiles in common.
Revised:  Finally we give a first example of how the SkillNER can be used, identifying the relationships among ESCO job profiles based on soft skills based on job profiles in common.
Edit intent: coherence
Original:  Our normalization result is reduction-free, in the sense of yielding an injective function from equivalence classes of terms in context to a tractable language of \beta/\eta-normal forms.
Revised:  Our normalization result is reduction-free, in the sense of yielding a bijection between equivalence classes of terms in context to a tractable language of \beta/\eta-normal forms.
Edit intent: clarity
Original:  Our normalization result is reduction-free, in the sense of yielding an injective function from equivalence classes of terms in context to a tractable language of \beta/\eta-normal forms.
Revised:  Our normalization result is reduction-free, in the sense of yielding an injective function from equivalence classes of terms in context and a tractable language of \beta/\eta-normal forms.
Edit intent: coherence
Original:  As corollaries we obtain both decidability of judgmental equality as well as the injectivity of type constructors in judgmentally consistent contexts .
Revised:  As corollaries we obtain both decidability of judgmental equality and the injectivity of type constructors in judgmentally consistent contexts .
Edit intent: coherence
Original:  As corollaries we obtain both decidability of judgmental equality as well as the injectivity of type constructors in judgmentally consistent contexts .
Revised:  As corollaries we obtain both decidability of judgmental equality as well as the injectivity of type constructors .
Edit intent: clarity
Original:  While previous research has mostly focused on the "number of mentions" of scientific research on social media, the current study uses "topic networks" to measure public attention to scientific research on Twitter.
Revised:  While previous research has mostly focused on the "number of mentions" of scientific research on social media, the current study applies "topic networks" to measure public attention to scientific research on Twitter.
Edit intent: clarity
Original:  Topic networks in this research are the " co-occurring author keywords " in scientific publications and the " co-occurring hashtags " in the tweets mentioning scientific publications.
Revised:  Topic networks are the networks of co-occurring author keywords " in scientific publications and the " co-occurring hashtags " in the tweets mentioning scientific publications.
Edit intent: clarity
Original:  Topic networks in this research are the " co-occurring author keywords " in scientific publications and the " co-occurring hashtags " in the tweets mentioning scientific publications.
Revised:  Topic networks in this research are the " co-occurring author keywords in scholarly publications and networks of co-occurring hashtags " in the tweets mentioning scientific publications.
Edit intent: clarity
Original:  Topic networks in this research are the " co-occurring author keywords " in scientific publications and the " co-occurring hashtags " in the tweets mentioning scientific publications.
Revised:  Topic networks in this research are the " co-occurring author keywords " in scientific publications and the " co-occurring hashtags in the tweets mentioning scientific publications.
Edit intent: fluency
Original:  Since bots (automated social media accounts) may significantly influence public attention , this study also investigates whether the topic networks based on the tweets by all accounts (bot and non-bot accounts) differ from the topic networks by non-bot accounts.
Revised:  Since bots (automated social media accounts) may significantly influence public attention , this study also investigates whether the topic networks generated from the publications tweeted by all accounts (bot and non-bot accounts) differ from the topic networks by non-bot accounts.
Edit intent: clarity
Original:  Since bots (automated social media accounts) may significantly influence public attention , this study also investigates whether the topic networks based on the tweets by all accounts (bot and non-bot accounts) differ from the topic networks by non-bot accounts.
Revised:  Since bots (automated social media accounts) may significantly influence public attention , this study also investigates whether the topic networks based on the tweets by all accounts (bot and non-bot accounts) differ from those generated by non-bot accounts.
Edit intent: clarity
Original:  Our analysis is based on a set of opioid scientific publications from 2011 to 2019 and the tweets associated with them.
Revised:  Our analysis is based on a set of opioid scholarly publications from 2011 to 2019 and the tweets associated with them.
Edit intent: fluency
Original:  Results indicated that the public has mostly used generic terms to discuss opioid publications . Results confirmed that topic networks provide a legitimate method to visualize public discussions of ( health-related ) scientific publications , and how the public discusses ( health-related ) scientific research differently from the scientific community.
Revised:  Results indicated that the public has mostly used generic terms to discuss opioid publications . Results confirmed that topic networks provide a legitimate method to visualize public discussions of health-related ) scientific publications , and how the public discusses ( health-related ) scientific research differently from the scientific community.
Edit intent: fluency
Original:  Results indicated that the public has mostly used generic terms to discuss opioid publications . Results confirmed that topic networks provide a legitimate method to visualize public discussions of ( health-related ) scientific publications , and how the public discusses ( health-related ) scientific research differently from the scientific community.
Revised:  Results indicated that the public has mostly used generic terms to discuss opioid publications . Results confirmed that topic networks provide a legitimate method to visualize public discussions of ( health-related ) scientific publications , and how the public discusses ( health-related scientific research differently from the scientific community.
Edit intent: fluency
Original:  There was a significant overlap between the topic networks based on the tweets by all accounts and non-bot accounts.
Revised:  There was a substantial overlap between the topic networks based on the tweets by all accounts and non-bot accounts.
Edit intent: fluency
Original:  This result indicates that in generating topic networks , bot accounts do not need to be excluded as they have  negligible impact on the results.
Revised:  This result indicates that it might not be necessary to exclude bot accounts for generating topic networks , bot accounts do not need to be excluded as they have negligible impact on the results.
Edit intent: clarity
Original:  This result indicates that in generating topic networks , bot accounts do not need to be excluded as they have  negligible impact on the results.
Revised:  This result indicates that in generating topic networks as they have negligible impact on the results.
Edit intent: clarity
Original:  This result indicates that in generating topic networks , bot accounts do not need to be excluded as they have  negligible impact on the results.
Revised:  This result indicates that in generating topic networks , bot accounts do not need to be excluded as they have a negligible impact on the results.
Edit intent: fluency
Original:  If the order N is unknown, an easy modification of such algorithms gives a complexity of O(N\log N).
Edit intent: coherence
Original:  Specifically  let x be an element in a semigroup having finite order N_x. If y\in \langle x \rangle is given the paper provides an algorithm having time complexity O(N_x\log N_x) to find all natural numbers m with x^m=y.
Revised:  Specifically , let x be an element in a semigroup having finite order N_x. If y\in \langle x \rangle is given the paper provides an algorithm having time complexity O(N_x\log N_x) to find all natural numbers m with x^m=y.
Edit intent: fluency
Original:  Finding all Pareto-optimal solutions for the multi-criteria single-source single-destination shortest  path problem with non-negative edge lengths might yield a solution with the exponential number of paths.
Revised:  Finding all Pareto-optimal solutions for the multi-criteria single-source single-destination shortest path problem with non-negative edge lengths might yield a solution with an exponential number of paths.
Edit intent: clarity
Original: Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source  to a target vertex.
Revised: Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex.
Edit intent: fluency
Original:  Problems of this form arise naturally in road networks , robot navigation, and even optimal control of hybrid dynamical systems.
Revised:  Problems of this form arise naturally in motion planning of autonomous vehicles , robot navigation, and even optimal control of hybrid dynamical systems.
Edit intent: clarity
Original:  This formulation has a very tight convex relaxation and allows to efficiently find globally-optimal paths in large graphs and in high-dimensional spaces.
Revised:  This formulation has a very tight convex relaxation and makes it possible to efficiently find globally-optimal paths in large graphs and in high-dimensional spaces.
Edit intent: clarity