wanyu/IteraTeR_v2 huggingface dataset:
Original:  We refer to these type of simultaneous interactions on sets of more than two nodes as higher-order interactions ;
Revised:  Such higher-order interactions ;
Edit intent: clarity
Original:  We study the temporal evolution of 19 datasets from a variety of domains, and use our higher-order formulation of link prediction to assess the types of structural features that are most predictive of new multi-way interactions.
Revised:  We study the temporal evolution of 19 datasets with explicit accounting for higher-order formulation of link prediction to assess the types of structural features that are most predictive of new multi-way interactions.
Edit intent: clarity
Original:  As an example, we will show the polynomial-time solution of the subset-sum problem for the worst case ...
Revised:  As an example, we will show the polynomial-time solution of the subset-sum problem for the worst ...
Edit intent: clarity
Original: Commodity OS kernels are known to have broad attack surfaces due to the large code base and the numerous features such as device drivers.
Revised: Commodity OS kernels have broad attack surfaces due to the large code base and the numerous features such as device drivers.
Edit intent: clarity
Original:  Within the used code, a certain part is invoked only at the runtime phase while the rest are executed at startup and/or shutdown phases in the kernel's lifetime run.
Revised:  Within the used code, a certain part is invoked only at runtime while the rest are executed at startup and/or shutdown phases in the kernel's lifetime run.
Edit intent: fluency
Original:  In this paper, we propose a reliable and practical system, named KASR, which transparently reduces attack surfaces of commodity OS kernels at the runtime phase without requiring their source code.
Revised:  In this paper, we propose a reliable and practical system, named KASR, which transparently reduces attack surfaces of commodity OS kernels at runtime without requiring their source code.
Edit intent: clarity
Original:  The KASR system, residing in a trusted hypervisor, achieves the attack surface reduction through two reliable steps : (1) deprives unused code of executable permissions, and (2) transparently segments used code and selectively activates themaccording to their phases.
Revised:  The KASR system, residing in a trusted hypervisor, achieves the attack surface reduction through a two-step approach : (1) deprives unused code of executable permissions, and (2) transparently segments used code and selectively activates themaccording to their phases.
Edit intent: clarity
Original:  The KASR system, residing in a trusted hypervisor, achieves the attack surface reduction through two reliable steps : (1) deprives unused code of executable permissions, and (2) transparently segments used code and selectively activates themaccording to their phases.
Revised:  The KASR system, residing in a trusted hypervisor, achieves the attack surface reduction through two reliable steps : (1) reliably depriving unused code of executable permissions, and (2) transparently segments used code and selectively activates themaccording to their phases.
Edit intent: clarity
Original:  The KASR system, residing in a trusted hypervisor, achieves the attack surface reduction through two reliable steps : (1) deprives unused code of executable permissions, and (2) transparently segments used code and selectively activates themaccording to their phases.
Revised:  The KASR system, residing in a trusted hypervisor, achieves the attack surface reduction through two reliable steps : (1) deprives unused code of executable permissions, and (2) transparently segmenting used code and selectively activates themaccording to their phases.
Edit intent: fluency
Original:  We implement a prototype of KASR on the Xen-4.8.2 hypervisor and evaluate its security effectiveness on Linux kernel-4.4.0-87-generic.
Revised:  We implement a prototype of KASR on Xen-4.8.2 hypervisor and evaluate its security effectiveness on Linux kernel-4.4.0-87-generic.
Edit intent: fluency
Original:  Our evaluation shows that KASR reduces  kernel attack surface by 64\% , trims off 40\% of in-memory CVE vulnerabilitiesand 66\% of system calls, and prohibits 99\% of on-disk device drivers (including their related CVEs) from executing .
Revised:  Our evaluation shows that KASR reduces the kernel attack surface by 64\% , trims off 40\% of in-memory CVE vulnerabilitiesand 66\% of system calls, and prohibits 99\% of on-disk device drivers (including their related CVEs) from executing .
Edit intent: fluency
Original:  Our evaluation shows that KASR reduces  kernel attack surface by 64\% , trims off 40\% of in-memory CVE vulnerabilitiesand 66\% of system calls, and prohibits 99\% of on-disk device drivers (including their related CVEs) from executing .
Revised:  Our evaluation shows that KASR reduces kernel attack surface by 64\% and trims off 40\% of in-memory CVE vulnerabilitiesand 66\% of system calls, and prohibits 99\% of on-disk device drivers (including their related CVEs) from executing .
Edit intent: fluency
Original:  Our evaluation shows that KASR reduces  kernel attack surface by 64\% , trims off 40\% of in-memory CVE vulnerabilitiesand 66\% of system calls, and prohibits 99\% of on-disk device drivers (including their related CVEs) from executing .
Revised:  Our evaluation shows that KASR reduces kernel attack surface by 64\% , trims off 40\% of CVE vulnerabilities .
Edit intent: coherence
Original:  The experimental results indicate that KASR imposes less than 1\% averaged performance overhead compared to an unmodified Xen hypervisor  .
Revised:  The experimental results indicate that KASR imposes less than 1\% performance overhead ( compared to an unmodified Xen hypervisor .
Edit intent: clarity
Original:  While most of the recent theoretical research on temporal graphs has focused on the notion of a temporal path and other "path-related " temporal notions, only few attempts have been made to investigate "non-path" temporal graph problems.
Revised:  While most of the recent theoretical research on temporal graphs has focused on the notion of a temporal path and other "path-related '' temporal notions, only few attempts have been made to investigate "non-path" temporal graph problems.
Edit intent: fluency
Original:  In this paper, motivated by applications in sensor and in transportation networks, we introduce and study two natural temporal extensions of the classical problem VERTEX COVER .
Revised:  In this paper, motivated by applications in sensor and in transportation networks, we introduce and study two natural temporal extensions of the classical problem Vertex Cover .
Edit intent: fluency
Original:  In our first problem, TEMPORAL VERTEX COVER , the aim is to cover every edge at least once during the lifetime of the temporal graph, where an edge can only be covered by one of its endpoints  at a time step when it is active.
Revised:  In our first problem, Temporal Vertex Cover , the aim is to cover every edge at least once during the lifetime of the temporal graph, where an edge can only be covered by one of its endpoints at a time step when it is active.
Edit intent: fluency
Original:  In our first problem, TEMPORAL VERTEX COVER , the aim is to cover every edge at least once during the lifetime of the temporal graph, where an edge can only be covered by one of its endpoints  at a time step when it is active.
Revised:  In our first problem, TEMPORAL VERTEX COVER , the aim is to cover every edge at least once during the lifetime of the temporal graph, where an edge can be covered by one of its endpoints at a time step when it is active.
Edit intent: clarity
Original:  In our first problem, TEMPORAL VERTEX COVER , the aim is to cover every edge at least once during the lifetime of the temporal graph, where an edge can only be covered by one of its endpoints  at a time step when it is active.
Revised:  In our first problem, TEMPORAL VERTEX COVER , the aim is to cover every edge at least once during the lifetime of the temporal graph, where an edge can only be covered by one of its endpoints , only at a time step when it is active.
Edit intent: coherence
Original:  In our second, more pragmatic variation SLIDING WINDOW TEMPORAL VERTEX COVER , we are also given a parameter \Delta, and our aim is to cover every edge at least once at every \Delta consecutive time steps.
Revised:  In our second, more pragmatic variation Sliding Window Temporal Vertex Cover , we are also given a parameter \Delta, and our aim is to cover every edge at least once at every \Delta consecutive time steps.
Edit intent: fluency
Original:  In our second, more pragmatic variation SLIDING WINDOW TEMPORAL VERTEX COVER , we are also given a parameter \Delta, and our aim is to cover every edge at least once at every \Delta consecutive time steps.
Revised:  In our second, more pragmatic variation SLIDING WINDOW TEMPORAL VERTEX COVER , we are also given a natural number \Delta, and our aim is to cover every edge at least once at every \Delta consecutive time steps.
Edit intent: clarity
Original:  While most of the recent theoretical research on temporal graphs has focused on the notion of a temporal path and other "path-related '' temporal notions, only few attempts have been made to investigate "non-path" temporal graph problems.
Revised:  While most of the recent theoretical research on temporal graphs has focused on the notion of a temporal path and other "path-related " temporal notions, only few attempts have been made to investigate "non-path" temporal graph problems.
Edit intent: fluency
Original:  As part of this framework, we develop efficient algorithms for finding rankings that maximize the utility for the user while satisfying fairness constraints for the items . Since fairness goals can be application specific, we show how a broad range of fairness constraints can be implemented in our framework, including forms of demographic parity, disparate treatment, and disparate impact constraints.
Revised:  As part of this framework, we develop efficient algorithms for finding rankings that maximize the utility for the user while provably satisfying a specifiable notion of fairness . Since fairness goals can be application specific, we show how a broad range of fairness constraints can be implemented in our framework, including forms of demographic parity, disparate treatment, and disparate impact constraints.
Edit intent: clarity
Original:  As part of this framework, we develop efficient algorithms for finding rankings that maximize the utility for the user while satisfying fairness constraints for the items . Since fairness goals can be application specific, we show how a broad range of fairness constraints can be implemented in our framework, including forms of demographic parity, disparate treatment, and disparate impact constraints.
Revised:  As part of this framework, we develop efficient algorithms for finding rankings that maximize the utility for the user while satisfying fairness constraints for the items . Since fairness goals can be application specific, we show how a broad range of fairness constraints can be implemented using our framework, including forms of demographic parity, disparate treatment, and disparate impact constraints.
Edit intent: clarity
Original:  This phenomenon is reflected -- and often amplified -- in online social networks where, however, humans are no more the only players, and co-exist alongside with social bots, i.e.  software-controlled accounts.
Revised:  This phenomenon is reflected -- and often amplified -- in online social networks where, however, humans are no more the only players, and co-exist alongside with social bots, i.e. , software-controlled accounts.
Edit intent: fluency
Original:  Analyzing large-scale social data collected during the Catalan referendum for independence on October 1  2017, consisting of nearly 4 millions Twitter posts generated by almost 1 million users, we identify the two polarized groups of Independentists and Constitutionalists and quantify the structural and emotional roles played by social bots.
Revised:  Analyzing large-scale social data collected during the Catalan referendum for independence on October 1 , 2017, consisting of nearly 4 millions Twitter posts generated by almost 1 million users, we identify the two polarized groups of Independentists and Constitutionalists and quantify the structural and emotional roles played by social bots.
Edit intent: fluency
Original:  We show that bots act from peripheral areas of the social system to target influential humans of both groups, mostly bombarding Independentists with negative and violent contents, sustaining and inflating instability in this onlinesociety.
Revised:  We show that bots act from peripheral areas of the social system to target influential humans of both groups, bombarding Independentists with negative and violent contents, sustaining and inflating instability in this onlinesociety.
Edit intent: coherence
Original:  We show that bots act from peripheral areas of the social system to target influential humans of both groups, mostly bombarding Independentists with negative and violent contents, sustaining and inflating instability in this onlinesociety.
Revised:  We show that bots act from peripheral areas of the social system to target influential humans of both groups, mostly bombarding Independentists with violent contents, sustaining and inflating instability in this onlinesociety.
Edit intent: clarity
Original:  Attempts to link Cd toxicity and fertilizers to chronic diseases , sometimes with good evidence, but mostly on less certain data are frequent .
Revised:  Attempts to link Cd toxicity and fertilizers to chronic diseases are common .
Edit intent: clarity
Original:  This analysis does %DIFDELCMD < {\it %%% not modify the accepted views on Cd contamination by airborne delivery, smoking, and industrial activity  .
Revised:  This analysis does %DIFDELCMD < {\it %%% not modify the accepted views on Cd contamination by airborne delivery, smoking, and industrial activity .
Edit intent: fluency
Original: In recent years , rumor news has been generated by humans as well as robots in order to attract readership, influence opinions, and increase internet click revenue.
Revised: Recent years have witnessed a widespread increase of rumor news generated by humans as well as robots in order to attract readership, influence opinions, and increase internet click revenue.
Edit intent: clarity
Original:  Here, we propose a novel agreement-aware search framework , Maester, for dealing with the problem of rumor detection . Given an investigative question summarizing some news story or topic, it will retrieve related articles to that question, assign and display top articles from agree, disagree, and discuss categories to users , and thus provide a more holistic view .
Revised:  Here, we propose a novel agreement-aware search framework for investigating rumor news . Given an investigative question summarizing some news story or topic, it will retrieve related articles to that question, assign and display top articles from agree, disagree, and discuss categories to users , and thus provide a more holistic view .
Edit intent: clarity
Original:  Here, we propose a novel agreement-aware search framework , Maester, for dealing with the problem of rumor detection . Given an investigative question summarizing some news story or topic, it will retrieve related articles to that question, assign and display top articles from agree, disagree, and discuss categories to users , and thus provide a more holistic view .
Revised:  Here, we propose a novel agreement-aware search framework , Maester, for dealing with the problem of rumor detection . Given an investigative question , Maester will retrieve related articles to that question, assign and display top articles from agree, disagree, and discuss categories to users , and thus provide a more holistic view .
Edit intent: clarity
Original:  First, relatedness can commonly be determined by keywords and entities occurred in both questions and articles .
Revised:  First, relatedness can commonly be determined by keywords and entities occurring in both questions and articles .
Edit intent: fluency
Original:  Accordingly, we design our approach for relatedness detection to focus on keyword/entity matching using gradient boosting trees, while leveraging recurrent neural networks and posing attentions to key sentences to infer the agreement level .
Revised:  Accordingly, we use gradient boosting tree models with keyword/entity matching using gradient boosting trees, while leveraging recurrent neural networks and posing attentions to key sentences to infer the agreement level .
Edit intent: clarity
Original:  Our evaluation is based on the dataset from the Fake News Challenge (FNC) . Extensive experiments demonstrate up to an order of magnitude improvement of Maester over all baseline methods for agreement-aware search as well as slightly improved accuracy based on the same metrics used in FNC .
Revised:  Our evaluation is based on the dataset from the Fake News Challenge (FNC) dataset demonstrate up to an order of magnitude improvement of Maester over all baseline methods for agreement-aware search as well as slightly improved accuracy based on the same metrics used in FNC .
Edit intent: clarity
Original:  Our evaluation is based on the dataset from the Fake News Challenge (FNC) . Extensive experiments demonstrate up to an order of magnitude improvement of Maester over all baseline methods for agreement-aware search as well as slightly improved accuracy based on the same metrics used in FNC .
Revised:  Our evaluation is based on the dataset from the Fake News Challenge (FNC) . Extensive experiments demonstrate up to an order of magnitude improvement of Maester over all baseline methods for agreement-aware search .
Edit intent: clarity
Original:  Because of the differences in the assumptions and the objectives, the proposed learning theory is meant to be complementary to previous learning theoryand is not designed to compete with it .
Revised:  As a result, it provides different types of results and insights when compared to statistical learning theory .
Edit intent: coherence
Original:  We point out that existing approaches do not perform well at matching long documents, which is critical, for example, to AI-based news article understanding and event or story formation.
Revised:  We point out that existing approaches do not perform well in matching longer documents, which is critical, for example, to AI-based news article understanding and event or story formation.
Edit intent: fluency
Original:  Extensive evaluation of the proposed approach based on two labeled news article datasets created at Tencent for its intelligent news products show that the proposed graph approach to long document matching significantly outperforms a wide range of state-of-the-art methods  .
Revised:  Extensive evaluation of the proposed methods on the two datasets demonstrate significant improvements over a wide range of state-of-the-art methods .
Edit intent: clarity
Original:  Robots are also envisioned to be of such multi-modal sensing ability.
Revised:  Robots could also benefit from such multi-modal sensing ability.
Edit intent: clarity
Original:  But the learned features are of a high dimensionality and are redundant due to the differences in the two sensing modalities, which deteriorates the perception performance.
Revised:  But the learned features are of a high dimensionality and are redundant due to the differences between the two sensing modalities, which deteriorates the perception performance.
Edit intent: fluency
Original:  To solve this, the learned features are paired using maximum covariance analysis.
Revised:  To address this, the learned features are paired using maximum covariance analysis.
Edit intent: clarity
Original:  Results of the algorithm on a newly collected dataset of paired visual and tactile data relating to cloth textures show that a good recognition performance of greater than 90 \% can be achieved by using \\%DIF > can be achieved by using the proposed DMCA framework.
Revised:  Results of the algorithm on a newly collected dataset of paired visual and tactile data relating to cloth textures show that a good recognition performance of greater than 90 \\%DIF > can be achieved by using the proposed DMCA framework.
Edit intent: fluency
Original:  However, continual lifelong learning remains a long-standing challenge for machine learning and neural network models since the incremental acquisition of new skills from non-stationary data distributions generally leads to catastrophic forgetting or interference.
Revised:  However, lifelong learning remains a long-standing challenge for machine learning and neural network models since the incremental acquisition of new skills from non-stationary data distributions generally leads to catastrophic forgetting or interference.
Edit intent: clarity
Original:  However, continual lifelong learning remains a long-standing challenge for machine learning and neural network models since the incremental acquisition of new skills from non-stationary data distributions generally leads to catastrophic forgetting or interference.
Revised:  However, continual lifelong learning remains a long-standing challenge for machine learning and neural network models since the continual acquisition of incrementally available information from non-stationary data distributions generally leads to catastrophic forgetting or interference.
Edit intent: clarity
Original:  In this review, we critically summarize the main challenges linked to continual lifelong learning for artificial learning systems and compare existing neural network approaches that alleviate, to different extents, catastrophic interference .
Revised:  In this review, we critically summarize the main challenges linked to lifelong learning for artificial learning systems and compare existing neural network approaches that alleviate, to different extents, catastrophic interference .
Edit intent: clarity
Original:  In this review, we critically summarize the main challenges linked to continual lifelong learning for artificial learning systems and compare existing neural network approaches that alleviate, to different extents, catastrophic interference .
Revised:  In this review, we critically summarize the main challenges linked to continual lifelong learning for artificial learning systems and compare existing neural network approaches that alleviate, to different extents, catastrophic forgetting .
Edit intent: clarity
Original:  Although significant advances have been made in domain-specific continual lifelong learning with neural networks, extensive research efforts are required for the development of general-purpose artificial intelligence and autonomous agents .
Revised:  Although significant advances have been made in domain-specific learning with neural networks, extensive research efforts are required for the development of general-purpose artificial intelligence and autonomous agents .
Edit intent: clarity
Original:  Although significant advances have been made in domain-specific continual lifelong learning with neural networks, extensive research efforts are required for the development of general-purpose artificial intelligence and autonomous agents .
Revised:  Although significant advances have been made in domain-specific continual lifelong learning with neural networks, extensive research efforts are required for the development of robust lifelong learning on autonomous agents and robots .
Edit intent: clarity
Original:  We discuss well-established research and recent methodological trends motivated by experimentally observed lifelong learning factors in biological systems .
Revised:  We discuss well-established and emerging research motivated by lifelong learning factors in biological systems .
Edit intent: clarity