wanyu/IteraTeR_v2 huggingface dataset:
Original:  From this perspective, this paper revisits the node classification task in a semi-supervised scenario by graph convolutional neural network .
Revised:  From this perspective, this paper revisits the node classification task in a semi-supervised scenario by graph convolutional networks (GCNs) .
Edit intent: clarity
Original:  For this aim , this paper provides a new graph convolutional neural network architecture.
Revised:  The contribution of this paper is twofold. First , this paper provides a new graph convolutional neural network architecture.
Edit intent: clarity
Original:  This paper shows that the proposed architecture is also powerful in combining a graph realization and independent non-graph observations.
Edit intent: coherence
Original: In this paper, we present SimultaneousGreedys, a deterministic algorithm for constrained submodular maximization.
Revised: We present SimultaneousGreedys, a deterministic algorithm for constrained submodular maximization.
Edit intent: clarity
Original:  In this work , we introduce a third option additional to those of packing and rejecting an item, namely that of reserving an item for the cost of a fixed fraction \alpha of its size.
Revised:  In this work we introduce a third option additional to those of packing and rejecting an item, namely that of reserving an item for the cost of a fixed fraction \alpha of its size.
Edit intent: fluency
Original:  While the classical Online Simple Knapsack Problem does not admit any constantly bounded competitive ratio in the deterministic setting, we find that adding the possibility of reservation makes the problem constantly competitive , with varying competitive ratios depending on the value of \alpha.
Revised:  We find that adding the possibility of reservation makes the problem constantly competitive , with varying competitive ratios depending on the value of \alpha.
Edit intent: coherence
Original:  However, for higher reservation costs between \sqrt{2}-1 and 0.5 , an algorithm that is unable to reject any items tightly matches the lower bound and is thus the best possible.
Revised:  However, for higher reservation costs between \sqrt{2}-1 , an algorithm that is unable to reject any items tightly matches the lower bound and is thus the best possible.
Edit intent: clarity
Original:  On the other hand, for any positive reservation cost smaller than 1/6, any algorithm that is unable to reject any items performs considerably worse than one that is able to reject.
Revised:  On the other hand, for any positive reservation cost smaller than 1/6, any algorithm that is unable to reject items performs considerably worse than one that is able to reject.
Edit intent: clarity
Original:  We present a analytical framework by using the method of multiple timescales to obtain the normal form up to the fifth order.
Revised:  We present a analytical framework by using the method of multiple scales to obtain the normal form up to the fifth order.
Edit intent: clarity
Original: Mass spectrometry  based omics data analysis require significant time and resources.
Revised: Mass spectrometry (MS) based omics data analysis require significant time and resources.
Edit intent: clarity
Original:  To date, few parallel algorithms have been proposed for deducing peptides from mass spectrometry based data.
Revised:  To date, few parallel algorithms have been proposed for deducing peptides from mass spectrometry-based data.
Edit intent: fluency
Original:  To further validate our claim, we performed a meta-analysis of published parallel algorithms, and their performance results.
Revised:  To validate our claim, we performed a meta-analysis of published parallel algorithms, and their performance results.
Edit intent: clarity
Original:  Consequently, we assert that next-generation of provable , and demonstrated superior parallel algorithms are urgently needed for MS based large systems-biology studies especially for meta-proteomics, protegenomics , microbiome, and proteomics for non-model organisms  .
Revised:  Consequently, we assert that next-generation of provable , and demonstrated superior parallel algorithms are urgently needed for MS based large systems-biology studies especially for meta-proteomics, protegenomics , microbiome, and proteomics for non-model organisms .
Edit intent: fluency
Original: With COVID-19, the interest for digital interaction has raised, putting in turn real-time  or low-latency  codecs into a new light.
Revised: With COVID-19, the interest for digital interactions has raised, putting in turn real-time or low-latency codecs into a new light.
Edit intent: fluency
Original: With COVID-19, the interest for digital interaction has raised, putting in turn real-time  or low-latency  codecs into a new light.
Revised: With COVID-19, the interest for digital interaction has raised, putting in turn real-time ( or low-latency codecs into a new light.
Edit intent: fluency
Original: With COVID-19, the interest for digital interaction has raised, putting in turn real-time  or low-latency  codecs into a new light.
Revised: With COVID-19, the interest for digital interaction has raised, putting in turn real-time or low-latency ) codecs into a new light.
Edit intent: fluency
Original:  Most of the codec ecosystem, including AV1, has been focusing on coding efficiency which is the main sought after improvement for Video On Demand use case.
Revised:  Most of the codec research has been traditionally focusing on coding efficiency which is the main sought after improvement for Video On Demand use case.
Edit intent: clarity
Original:  Measurements are made on encoding of Full HD video sequences from the literature to compare \%1/ the speed of AV1 real-time and default AV1, 2/ the respective performances of  H.264,  VP8, VP9 and AV1 all in real-time mode .
Revised:  Measurements are made on encoding of Full HD video sequences from the literature to compare \%1/ the speed of AV1 real-time and default AV1, 2/ the respective performances of several implementations of the H.264, VP8, VP9 and AV1 all in real-time mode .
Edit intent: clarity
Original:  Measurements are made on encoding of Full HD video sequences from the literature to compare \%1/ the speed of AV1 real-time and default AV1, 2/ the respective performances of  H.264,  VP8, VP9 and AV1 all in real-time mode .
Revised:  Measurements are made on encoding of Full HD video sequences from the literature to compare \%1/ the speed of AV1 real-time and default AV1, 2/ the respective performances of H.264, VP8, VP9 and AV1 codecs .
Edit intent: clarity
Original:  We introduce an opponent classifier---trained in parallel to Q-learning, using the same data---and use the classifier results to refine the mixing of Q-values.
Revised:  We introduce an opponent classifier -- trained in parallel to Q-learning, using the same data---and use the classifier results to refine the mixing of Q-values.
Edit intent: fluency
Original:  We introduce an opponent classifier---trained in parallel to Q-learning, using the same data---and use the classifier results to refine the mixing of Q-values.
Revised:  We introduce an opponent classifier---trained in parallel to Q-learning, using the same data -- and use the classifier results to refine the mixing of Q-values.
Edit intent: fluency
Original: This paper considers price volatility as the reason for description of the second-degree economic variables, trades and expectations } } aggregated during certain time interval {\Delta}.
Revised: We introduce the price probability measure } } aggregated during certain time interval {\Delta}.
Edit intent: clarity
Original:  We believe that agents perform trades under action of multiple expectations .
Revised:  We take into account expectations that govern agents trades and introduce aggregated expectations alike to aggregated trades .
Edit intent: clarity
Original:  We separate the literature into cluster and line flocking, and categorize cluster flocking with respect to the system objective, which may be realized by a reactive , or planning , control algorithm.
Revised:  We separate the literature into cluster and line flocking, and categorize cluster flocking with respect to the system-level objective, which may be realized by a reactive , or planning , control algorithm.
Edit intent: clarity
Original:  We separate the literature into cluster and line flocking, and categorize cluster flocking with respect to the system objective, which may be realized by a reactive , or planning , control algorithm.
Revised:  We separate the literature into cluster and line flocking, and categorize cluster flocking with respect to the system objective, which may be realized by a reactive or planning control algorithm.
Edit intent: fluency
Original:  We also  present several approaches aimed at minimizing flocking communication and computational requirements in real systems via neighbor filtering and event-driven planning .
Revised:  We also present several approaches aimed at minimizing the communication and computational requirements in real systems via neighbor filtering and event-driven planning .
Edit intent: fluency
Original:  Existing research includes positive and negative tone only to improve macroeconomic forecasts, focusing predominantly on large economies such as the US.
Revised:  For the most part, existing research includes positive and negative tone only to improve macroeconomic forecasts, focusing predominantly on large economies such as the US.
Edit intent: clarity
Original:  This study expands the existing body of research by incorporating a wide array of emotions from newspapers around the world -- extracted from the Global Database of Events, Language and Tone (GDELT) - into macroeconomic forecasts.
Revised:  This study expands the existing body of research by incorporating a wide array of emotions from newspapers around the world - extracted from the Global Database of Events, Language and Tone (GDELT) - into macroeconomic forecasts.
Edit intent: fluency
Original:  Because of the spatial and temporal resolution of these measurements , they present a unique opportunity to characterize spatiotemporally coherent structures that underlie neural activity across many regions of the brain.
Revised:  These measurements present a unique opportunity to characterize spatiotemporally coherent structures that underlie neural activity across many regions of the brain.
Edit intent: coherence
Original:  Because of the spatial and temporal resolution of these measurements , they present a unique opportunity to characterize spatiotemporally coherent structures that underlie neural activity across many regions of the brain.
Revised:  Because of the spatial and temporal resolution of these measurements , they present a unique opportunity to characterize spatiotemporal coherent structures that underlie neural activity across many regions of the brain.
Edit intent: fluency
Original:  In this work, we leverage analytic techniques from fluid dynamics to develop a visualization framework that highlights features of flow across the cortex, mapping time-varying sources and wave fronts that may be correlated with behavioral events.
Revised:  In this work, we leverage analytic techniques from fluid dynamics to develop a visualization framework that highlights features of flow across the cortex, mapping wave fronts that may be correlated with behavioral events.
Edit intent: clarity
Original:  We demonstrate the application of FLOW portraits on  two widefield calcium imaging datasets : activity of the developing mouse cortex during the first 8 postnatal days, and spontaneous cortical activity in an adult mouse.
Revised:  We demonstrate the application of FLOW portraits on two widefield calcium imaging datasets : activity of the developing mouse and spontaneous cortical activity in an adult mouse.
Edit intent: clarity
Original:  In this paper, we address this problem by incorporating an automated DSE framework-AutoDSE- that leverages  bottleneck-guided gradient optimizer to systematically find abetter design point.
Revised:  To address this problem by incorporating an automated DSE framework-AutoDSE- that leverages bottleneck-guided gradient optimizer to systematically find abetter design point.
Edit intent: coherence
Original:  In this paper, we address this problem by incorporating an automated DSE framework-AutoDSE- that leverages  bottleneck-guided gradient optimizer to systematically find abetter design point.
Revised:  In this paper, we address this problem , we propose an automated DSE framework-AutoDSE- that leverages bottleneck-guided gradient optimizer to systematically find abetter design point.
Edit intent: clarity
Original:  In this paper, we address this problem by incorporating an automated DSE framework-AutoDSE- that leverages  bottleneck-guided gradient optimizer to systematically find abetter design point.
Revised:  In this paper, we address this problem by incorporating an automated DSE framework-AutoDSE- that leverages a bottleneck-guided gradient optimizer to systematically find abetter design point.
Edit intent: fluency
Original:  In this paper, we address this problem by incorporating an automated DSE framework-AutoDSE- that leverages  bottleneck-guided gradient optimizer to systematically find abetter design point.
Revised:  In this paper, we address this problem by incorporating an automated DSE framework-AutoDSE- that leverages bottleneck-guided gradient optimizer to systematically find a better design point.
Edit intent: fluency
Original:  AutoDSE finds the bottleneck of the design in each step and focuses on high-impact parameters to overcome that, which is similar to the approach an expert would take .
Revised:  AutoDSE detects the bottleneck of the design in each step and focuses on high-impact parameters to overcome that, which is similar to the approach an expert would take .
Edit intent: style
Original:  AutoDSE finds the bottleneck of the design in each step and focuses on high-impact parameters to overcome that, which is similar to the approach an expert would take .
Revised:  AutoDSE finds the bottleneck of the design in each step and focuses on high-impact parameters to overcome it .
Edit intent: coherence
Original:  The experimental results show that AutoDSE is able to find the design point that achieves, on the geometric mean, 19.9x speedup over one CPU core for Machsuite and Rodinia benchmarks and 1.04x over the manually designed HLS accelerated vision kernels in Xilinx Vitis libraries yet with 26x reduction of their optimization pragmas  .
Revised:  The experimental results show that AutoDSE is able to identify the design point that achieves, on the geometric mean, 19.9x speedup over one CPU core for Machsuite and Rodinia benchmarks and 1.04x over the manually designed HLS accelerated vision kernels in Xilinx Vitis libraries yet with 26x reduction of their optimization pragmas .
Edit intent: clarity
Original:  The experimental results show that AutoDSE is able to find the design point that achieves, on the geometric mean, 19.9x speedup over one CPU core for Machsuite and Rodinia benchmarks and 1.04x over the manually designed HLS accelerated vision kernels in Xilinx Vitis libraries yet with 26x reduction of their optimization pragmas  .
Revised:  The experimental results show that AutoDSE is able to find the design point that achieves, on the geometric mean, 19.9x speedup over one CPU core for Machsuite and Rodinia benchmarks . Compared to the manually optimized HLS vision kernels in Xilinx Vitis libraries yet with 26x reduction of their optimization pragmas .
Edit intent: clarity
Original:  The experimental results show that AutoDSE is able to find the design point that achieves, on the geometric mean, 19.9x speedup over one CPU core for Machsuite and Rodinia benchmarks and 1.04x over the manually designed HLS accelerated vision kernels in Xilinx Vitis libraries yet with 26x reduction of their optimization pragmas  .
Revised:  The experimental results show that AutoDSE is able to find the design point that achieves, on the geometric mean, 19.9x speedup over one CPU core for Machsuite and Rodinia benchmarks and 1.04x over the manually designed HLS accelerated vision kernels in Xilinx Vitis libraries , AutoDSE can reduce their optimization pragmas .
Edit intent: coherence
Original: As we all know, users and item-providers are two main groups of participants in recommender systems.
Revised: As we all know, users and item-providers are two main parties of participants in recommender systems.
Edit intent: clarity
Original:  The main task of this paper is to significantly improve the coverage fairness (item-provider oriented objective), and simultaneously keep the recommendation accuracy in a high level (user oriented objective).
Revised:  However, most existing research efforts on recommendation were focused on better serving users and overlooked the purpose of item-providers. This paper is devoted to improve the item exposure fairness for item-providers' objective, and keep the recommendation accuracy in a high level (user oriented objective).
Edit intent: coherence
Original:  First, an effective and totally robust approach of improving the coverage fairness is proposed, that is to constrain the allowed recommendation times of an item to be proportional to the frequency of its being purchased in the past .
Revised:  First, an effective and totally robust approach of improving the coverage fairness is proposed, that is to constrain the allowed recommendation times of an item to be proportional to the frequency of its being interacted in the past .
Edit intent: clarity
Original:  Whatis more, our proposed framework is parameter-free and thus achieves this superior performance without the time cost of parameter optimization, while all the above existing enhanced algorithms have to traverse their intrinsic parameter to get the best performance.
Revised:  Whatis more, our proposed framework is parameter-free , while those counterpart algorithms have to traverse their intrinsic parameter to get the best performance.
Edit intent: clarity
Original:  Whatis more, our proposed framework is parameter-free and thus achieves this superior performance without the time cost of parameter optimization, while all the above existing enhanced algorithms have to traverse their intrinsic parameter to get the best performance.
Revised:  Whatis more, our proposed framework is parameter-free and thus achieves this superior performance without the time cost of parameter optimization, while all the above existing enhanced algorithms have to resort to parameter traversal process to achieve their best performance.
Edit intent: clarity
Original:  This paper focuses on its impact on the Chinese  market by analyzing the e-commerce behavioral changes seen at an online shopping platform before and during the pandemic.
Revised:  This paper focuses on its impact on the Chinese e-commerce market by analyzing the e-commerce behavioral changes seen at an online shopping platform before and during the pandemic.
Edit intent: clarity
Original:  This paper focuses on its impact on the Chinese  market by analyzing the e-commerce behavioral changes seen at an online shopping platform before and during the pandemic.
Revised:  This paper focuses on its impact on the Chinese market by analyzing behavioral changes seen at an online shopping platform before and during the pandemic.
Edit intent: clarity
Original:  This paper focuses on its impact on the Chinese  market by analyzing the e-commerce behavioral changes seen at an online shopping platform before and during the pandemic.
Revised:  This paper focuses on its impact on the Chinese market by analyzing the e-commerce behavioral changes seen from a large online shopping platform before and during the pandemic.
Edit intent: clarity
Original:  We find that disruptions in the supply of essential goods needed during a disaster can be leveraged for epidemic forecasting, and further design a hierarchical attention learning model to predict the newly confirmed cases . Experiment results demonstrate that our predictions outperform existing baselines , which also extends to the long-term and province-level forecasts.
Revised:  We find that disruptions in the supply of essential goods needed during a disaster can be leveraged for epidemic forecasting, and further design a hierarchical attention learning model to predict the newly confirmed cases . Experiment results demonstrate that our predictions outperform existing baselines and further extend to the long-term and province-level forecasts.
Edit intent: coherence
Original:  We believe models like ours contribute to better preparing for future epidemics by gaining extra time to launch preventive steps.
Revised:  We discuss how our market analysis and prediction can help better prepare for future pandemics by gaining an extra time to launch preventive steps.
Edit intent: clarity
Original:  Finally, we explore a generalization of the concept of a Hausdorff middle to more than two sets and show how to approximate or compute it .
Revised:  Finally, we explore a generalization of the concept of a Hausdorff middle to more than two input sets. We show how to approximate or compute it .
Edit intent: clarity
Original:  We also follow and generalize Webster's approach and provide for \log\Gamma_p-type functions analogues of Euler's infinite product, Weierstrass'infinite product, Gauss' limit, Gauss' multiplication formula, Legendre's duplication formula , Euler's constant, Stirling' s constant , Stirling's formula, Wallis's product formula, and Raabe' s formula for the gamma function.
Revised:  We also follow and generalize Webster's approach and provide for \log\Gamma_p-type functions analogues of Euler's infinite product, Weierstrass'infinite product, Gauss' limit, Gauss' multiplication formula, Legendre's duplication formula , Euler's reflection formula, Gauss' multiplication theorem , Stirling's formula, Wallis's product formula, and Raabe' s formula for the gamma function.
Edit intent: clarity
Original:  We also propose a system to address these tasks, obtaining an accuracy of ~80\% for abuse presence, ~82\% for abuse target detection , and ~ 64 \% for abuse severity detection .
Revised:  We also propose a system to address these tasks, obtaining an accuracy of ~80\% for abuse presence, ~82\% for abuse target prediction , and ~ 64 \% for abuse severity detection .
Edit intent: clarity
Original:  We also propose a system to address these tasks, obtaining an accuracy of ~80\% for abuse presence, ~82\% for abuse target detection , and ~ 64 \% for abuse severity detection .
Revised:  We also propose a system to address these tasks, obtaining an accuracy of ~80\% for abuse presence, ~82\% for abuse target detection , and ~ 64 \% for abuse severity prediction .
Edit intent: clarity
Original: In this paper, we present a supervised machine learning (ML) based computational framework for designing particulate multifunctional composite materials for desired thermal conductivity (TC) . In this framework, the design variables are physical descriptors of the material microstructure to link microstructure to properties for materialdesign.
Revised: A supervised machine learning (ML) based computational framework for designing particulate multifunctional composite materials for desired thermal conductivity (TC) . In this framework, the design variables are physical descriptors of the material microstructure to link microstructure to properties for materialdesign.
Edit intent: coherence
Original: In this paper, we present a supervised machine learning (ML) based computational framework for designing particulate multifunctional composite materials for desired thermal conductivity (TC) . In this framework, the design variables are physical descriptors of the material microstructure to link microstructure to properties for materialdesign.
Revised: In this paper, we present a supervised machine learning (ML) based computational methodology for the design of particulate multifunctional composite materials for desired thermal conductivity (TC) . In this framework, the design variables are physical descriptors of the material microstructure to link microstructure to properties for materialdesign.
Edit intent: clarity