wanyu/IteraTeR_v2 huggingface dataset:
Original:  To tackle this new problem, we extend an online learning algorithm, called UCB, to deal with a critical tradeoff between exploitation and exploration and employ the virtual queue technique to properly handle the fairness constraints.
Revised:  To tackle this new problem, we extend an online learning algorithm, UCB, to deal with a critical tradeoff between exploitation and exploration and employ the virtual queue technique to properly handle the fairness constraints.
Edit intent: clarity
Original:  Early selection is thought to enable very fast visual performance by limiting processing to only the most relevant candidate portions of an image.
Revised:  Early selection is thought to enable very fast visual performance by limiting processing to only the most salient candidate portions of an image.
Edit intent: fluency
Original: In Time Sensitive Networking (TSN), it is important to formally prove per flow latency and backlog bounds.
Revised: In Time-Sensitive Networking (TSN), it is important to formally prove per flow latency and backlog bounds.
Edit intent: fluency
Original:  The latency component of such service curves is directly derived from upper bounds on the values of the credit counters used by the Credit-Based Shaper (CBS), an essential building block of TSN.
Revised:  The latency component of such service curves is directly derived from upper bounds on the values of the credit counters used by the Credit-Based Shaper (CBS), an essential building-block of TSN.
Edit intent: fluency
Original: We study the problem of whether a given finite clone generated by finitely many operations contains a cube term and give both structural and algorithmic results.
Revised: We study the problem of whether a given finite clone generated by finitely many operations contains a cube term ; we give both structural and algorithmic results.
Edit intent: coherence
Original:  We show that if such a clone has a cube term then it has a cube term of dimension at most N, where the number N depends on the arities of the generators of the clone and the size of the basic set.
Revised:  We show that if such an algebra has a cube term then it has a cube term of dimension at most N, where the number N depends on the arities of the generators of the clone and the size of the basic set.
Edit intent: clarity
Original:  We show that if such a clone has a cube term then it has a cube term of dimension at most N, where the number N depends on the arities of the generators of the clone and the size of the basic set.
Revised:  We show that if such a clone has a cube term then it has a cube term of dimension at most N, where the number N depends on the arities of basic operations of the algebra and the size of the basic set.
Edit intent: clarity
Original:  On the algorithmic side, we show that deciding the existence of cube terms is in P for idempotent clones and in EXPTIME in general.
Revised:  On the algorithmic side, we show that deciding the existence of cube terms is in P for idempotent algebras and in EXPTIME in general.
Edit intent: clarity
Original:  Since a clone contains a k-ary near unanimity operation if and only if it contains a  cube term and a chain of J\'onsson terms, our results can also be also used to decide whether a given finite algebra has a near unanimity operation.
Revised:  Since an algebra contains a k-ary near unanimity operation if and only if it contains a cube term and a chain of J\'onsson terms, our results can also be also used to decide whether a given finite algebra has a near unanimity operation.
Edit intent: fluency
Original: Motivated by the success of using black-box predictive algorithms as subroutines for online decision-making, we develop a new framework for designing online policies given access to an oracle providing statistical information about an offline benchmark.
Revised: We develop a new framework for designing online policies given access to an oracle providing statistical information about an offline benchmark.
Edit intent: clarity
Original:  Our work makes two important contributions towards tackling this question: First, we develop a general technique we call *compensated coupling* which can be used to derive bounds on the expected regret (i.e., additive loss with respect to a benchmark) for any online policy and offline benchmark ;
Revised:  Our work makes two important contributions towards this question: First, we develop a general technique we call *compensated coupling* which can be used to derive bounds on the expected regret (i.e., additive loss with respect to a benchmark) for any online policy and offline benchmark ;
Edit intent: clarity
Original:  Our work makes two important contributions towards tackling this question: First, we develop a general technique we call *compensated coupling* which can be used to derive bounds on the expected regret (i.e., additive loss with respect to a benchmark) for any online policy and offline benchmark ;
Revised:  Our work makes two important contributions towards tackling this question: First, we develop a general technique we call *compensated coupling* which can be used to derive bounds on the expected regret (i.e., additive loss with respect to a benchmark) for any online policy and offline benchmark .
Edit intent: fluency
Original:  Our results generalize and simplify many existing results for online packing and matching problems , and suggest a promising pathway for obtaining oracle-driven policies for other online decision-making settings.
Revised:  Our results generalize and simplify several existing results for online packing and matching problems , and suggest a promising pathway for obtaining oracle-driven policies for other online decision-making settings.
Edit intent: clarity
Original:  Our results generalize and simplify many existing results for online packing and matching problems , and suggest a promising pathway for obtaining oracle-driven policies for other online decision-making settings.
Revised:  Our results generalize and simplify many existing results for Online Packing and Online Matching , and suggest a promising pathway for obtaining oracle-driven policies for other online decision-making settings.
Edit intent: clarity
Original:  We present several efficient and scalable algorithms for both the variational and game-theoretic formulations, and present numerical results on synthetic data and on classification and regression problems that illustrate the effectiveness of the p-Laplacian  for semi-supervised learning with few labels \to  \to  .
Revised:  We present several efficient and scalable algorithms for both the variational and game-theoretic formulations, and present numerical results on synthetic data and real data that illustrate the effectiveness of the p-Laplacian for semi-supervised learning with few labels \to \to .
Edit intent: clarity
Original:  We present several efficient and scalable algorithms for both the variational and game-theoretic formulations, and present numerical results on synthetic data and on classification and regression problems that illustrate the effectiveness of the p-Laplacian  for semi-supervised learning with few labels \to  \to  .
Revised:  We present several efficient and scalable algorithms for both the variational and game-theoretic formulations, and present numerical results on synthetic data and on classification and regression problems that illustrate the effectiveness of the p-Laplacian formulation for semi-supervised learning with few labels \to \to .
Edit intent: fluency
Original: This article proposes a two-dimensional classification methodology to select the relevant forecasting tools developed by the scientific community based on a classification of load forecasting studies  .
Revised: The key contribution of this paper is to propose a classification into two dimensions of the load forecasting studies .
Edit intent: clarity
Original:  The inputs of the classifier are the articles of the literature and the outputs are articles classified into categories.
Edit intent: coherence
Original:  The classification process relies on two couple of parameters that defines a forecasting problem.
Revised:  The classification process relies on two couples of parameters that defines a forecasting problem.
Edit intent: fluency
Original:  The classification process relies on two couple of parameters that defines a forecasting problem.
Revised:  The classification process relies on two couple of parameters that define a forecasting problem.
Edit intent: fluency
Original:  Each article is classified with key information about the dataset used and the forecasting tools implemented: the forecasting techniques (probabilistic or deterministic) and methodologies, the cleansing data techniques and the error metrics.
Revised:  Each article is classified with key information about the dataset used and the forecasting tools implemented: the forecasting techniques (probabilistic or deterministic) and methodologies, the data cleansing techniques, and the error metrics.
Edit intent: fluency
Original:  Due to the \# P-hardness in computing influence, the core problem is to design effective sampling methods to estimate the function value.
Revised:  Due to the P-hardness in computing influence, the core problem is to design effective sampling methods to estimate the function value.
Edit intent: coherence
Original: dune-composites is the first open-source software framework designed to support the development of high-performance scalable solvers for composite applications. dune-composite is an initiative to overcome the limitations of commercially available solvers by encapsulating the mathematical complexities of the underlying solvers within an efficient C++ framework, making the techniques more accessible to the broader scientific and industrial communities.
Revised: dune-composites is the first open-source , high-performance scalable solvers for composite applications. dune-composite is an initiative to overcome the limitations of commercially available solvers by encapsulating the mathematical complexities of the underlying solvers within an efficient C++ framework, making the techniques more accessible to the broader scientific and industrial communities.
Edit intent: clarity
Original: dune-composites is the first open-source software framework designed to support the development of high-performance scalable solvers for composite applications. dune-composite is an initiative to overcome the limitations of commercially available solvers by encapsulating the mathematical complexities of the underlying solvers within an efficient C++ framework, making the techniques more accessible to the broader scientific and industrial communities.
Revised: dune-composites is the first open-source software framework designed to support the development of high-performance scalable solvers for composite applications. dune-composite is an initiative to overcome the limitations of commercially available solvers by encapsulating the mathematical complexities of the underlying packages within an efficient C++ framework, making the techniques more accessible to the broader scientific and industrial communities.
Edit intent: clarity
Original:  In this contribution we demonstrate the scalability of the solver on over 15,000 cores on the UK national supercomputer Archer, solving industrially motivated problems with over 200 million degrees of freedom in  minutes.
Revised:  In this contribution we demonstrate the scalability of the solver on more than 15,000 cores on the UK national supercomputer Archer, solving industrially motivated problems with over 200 million degrees of freedom in minutes.
Edit intent: fluency
Original:  In this contribution we demonstrate the scalability of the solver on over 15,000 cores on the UK national supercomputer Archer, solving industrially motivated problems with over 200 million degrees of freedom in  minutes.
Revised:  In this contribution we demonstrate the scalability of the solver on over 15,000 cores of the UK national supercomputer Archer, solving industrially motivated problems with over 200 million degrees of freedom in minutes.
Edit intent: clarity
Original:  In this contribution we demonstrate the scalability of the solver on over 15,000 cores on the UK national supercomputer Archer, solving industrially motivated problems with over 200 million degrees of freedom in  minutes.
Revised:  In this contribution we demonstrate the scalability of the solver on over 15,000 cores on the UK national supercomputer Archer, solving industrially motivated problems with over 200 million degrees of freedom in a few minutes.
Edit intent: clarity
Original:  This scale of computations brings composites problems that would otherwise be unthinkable into the feasible range.
Revised:  This scale of computation brings composites problems that would otherwise be unthinkable into the feasible range.
Edit intent: fluency
Original:  To operationalise this , we develop a novel variant of text distance metric,  time-sensitive semantic edit distance , accounting for temporal context across multiple traces.
Revised:  We operationalise this idea by developing a novel text distance metric, time-sensitive semantic edit distance , accounting for temporal context across multiple traces.
Edit intent: clarity
Original:  To operationalise this , we develop a novel variant of text distance metric,  time-sensitive semantic edit distance , accounting for temporal context across multiple traces.
Revised:  To operationalise this , we develop a novel variant of text distance metric, the time-sensitive semantic edit distance , accounting for temporal context across multiple traces.
Edit intent: fluency
Original:  Through experiments aiming to identify the role of trolls into one of  left-leaning, right-leaning, and news feed categories, we show the effectiveness of the proposed metric to measure differences between tweets in a temporal context.
Revised:  Through experiments aiming to identify the role of trolls into one of the predefined categories left-leaning, right-leaning, and news feed categories, we show the effectiveness of the proposed metric to measure differences between tweets in a temporal context.
Edit intent: clarity
Original:  Through experiments aiming to identify the role of trolls into one of  left-leaning, right-leaning, and news feed categories, we show the effectiveness of the proposed metric to measure differences between tweets in a temporal context.
Revised:  Through experiments aiming to identify the role of trolls into one of left-leaning, right-leaning, and news feed . We show the effectiveness of the proposed metric to measure differences between tweets in a temporal context.
Edit intent: clarity
Original: Candlestick charts display the high, low, open and closing prices for a specific time series . Candlestick patterns emerge because human actions and reactions are patterned and continuously replicate and captured in the formation of the candles.
Revised: Candlestick charts display the high, low, opening, and closing prices for a specific time series . Candlestick patterns emerge because human actions and reactions are patterned and continuously replicate and captured in the formation of the candles.
Edit intent: fluency
Original: Candlestick charts display the high, low, open and closing prices for a specific time series . Candlestick patterns emerge because human actions and reactions are patterned and continuously replicate and captured in the formation of the candles.
Revised: Candlestick charts display the high, low, open and closing prices in a specific period . Candlestick patterns emerge because human actions and reactions are patterned and continuously replicate and captured in the formation of the candles.
Edit intent: clarity
Original: Candlestick charts display the high, low, open and closing prices for a specific time series . Candlestick patterns emerge because human actions and reactions are patterned and continuously replicate and captured in the formation of the candles.
Revised: Candlestick charts display the high, low, open and closing prices for a specific time series . Candlestick patterns emerge because human actions and reactions are patterned and continuously replicate . These patterns capture information on the candles.
Edit intent: clarity
Original:  However, the candlestick patterns classification takes the hard work out of identifying them visually .
Revised:  Candlestick pattern classification approaches take the hard work out of identifying them visually .
Edit intent: clarity
Original:  We use the Gramian Angular Field (GAF) to encode the time series as different types of images.
Revised:  The first step uses the Gramian Angular Field (GAF) to encode the time series as different types of images.
Edit intent: clarity
Original:  Then we use the CNN with the GAF encoding images to learn eight critical kinds of candlestick patterns.
Revised:  Then we use the CNN with the GAF images to learn eight critical kinds of candlestick patterns.
Edit intent: clarity
Original:  To this end, we utilise well-known reconstruction formulae which have been used repeatedly in recent years [ 4 ,%DIFDELCMD < [%%% 6-8 ].
Revised:  To this end, we utilise well-known reconstruction formulae which have been used repeatedly in recent years [ ,%DIFDELCMD < [%%% 6-8 ].
Edit intent: coherence
Original:  To this end, we utilise well-known reconstruction formulae which have been used repeatedly in recent years [ 4 ,%DIFDELCMD < [%%% 6-8 ].
Revised:  To this end, we utilise well-known reconstruction formulae which have been used repeatedly in recent years [ 4 %DIFDELCMD < [%%% 6-8 ].
Edit intent: fluency
Original:  It has been shown that , in the deterministic setting , phase retrieval from frame coefficients is always unstable in infinite dimensional Hilbert spaces [7] and possibly severely ill-conditioned in finite dimensional Hilbert spaces [7].
Revised:  It has been shown that in the deterministic setting , phase retrieval from frame coefficients is always unstable in infinite dimensional Hilbert spaces [7] and possibly severely ill-conditioned in finite dimensional Hilbert spaces [7].
Edit intent: fluency
Original:  It has been shown that , in the deterministic setting , phase retrieval from frame coefficients is always unstable in infinite dimensional Hilbert spaces [7] and possibly severely ill-conditioned in finite dimensional Hilbert spaces [7].
Revised:  It has been shown that , in the deterministic setting phase retrieval from frame coefficients is always unstable in infinite dimensional Hilbert spaces [7] and possibly severely ill-conditioned in finite dimensional Hilbert spaces [7].
Edit intent: fluency
Original:  It has been shown that , in the deterministic setting , phase retrieval from frame coefficients is always unstable in infinite dimensional Hilbert spaces [7] and possibly severely ill-conditioned in finite dimensional Hilbert spaces [7].
Revised:  It has been shown that , in the deterministic setting , phase retrieval from frame coefficients is always unstable in infinite-dimensional Hilbert spaces [7] and possibly severely ill-conditioned in finite dimensional Hilbert spaces [7].
Edit intent: fluency
Original:  It has been shown that , in the deterministic setting , phase retrieval from frame coefficients is always unstable in infinite dimensional Hilbert spaces [7] and possibly severely ill-conditioned in finite dimensional Hilbert spaces [7].
Revised:  It has been shown that , in the deterministic setting , phase retrieval from frame coefficients is always unstable in infinite dimensional Hilbert spaces [7] and possibly severely ill-conditioned in finite-dimensional Hilbert spaces [7].
Edit intent: fluency
Original:  Recently, it was also shown that phase retrieval from measurements induced by the Gabor transform with Gaussian window function is stable when one is willing to accept a more relaxed semi-global stability regime [1].
Revised:  Recently, it has also been shown that phase retrieval from measurements induced by the Gabor transform with Gaussian window function is stable when one is willing to accept a more relaxed semi-global stability regime [1].
Edit intent: coherence
Original:  Recently, it was also shown that phase retrieval from measurements induced by the Gabor transform with Gaussian window function is stable when one is willing to accept a more relaxed semi-global stability regime [1].
Revised:  Recently, it was also shown that phase retrieval from measurements induced by the Gabor transform with Gaussian window function is stable under a more relaxed semi-global stability regime [1].
Edit intent: clarity
Original:  To this end, we utilise well-known reconstruction formulae which have been used repeatedly in recent years [6,12,18,20].
Revised:  To this end, we utilise reconstruction formulae which have been used repeatedly in recent years [6,12,18,20].
Edit intent: clarity
Original:  To this end, we utilise well-known reconstruction formulae which have been used repeatedly in recent years [6,12,18,20].
Revised:  To this end, we utilise well-known reconstruction formulae which have become common tools in recent years [6,12,18,20].
Edit intent: clarity
Original: We apply a space adaptive interior penalty discontinuous Galerkin method for solving advective Allen-Cahn (AC) equation with expanding and contracting velocity fields.
Revised: We apply a space adaptive interior penalty discontinuous Galerkin method for solving advective Allen-Cahn equation with expanding and contracting velocity fields.
Edit intent: clarity
Original:  In this article, we propose a methodology that permits to express security requirements for IoT applications, as well as infrastructure security capabilities, in a simple and declarative manner, and to automatically get a probabilistic and explainable assessment of the security level of the possible application deployments.
Revised:  In this article, we present a methodology that permits to express security requirements for IoT applications, as well as infrastructure security capabilities, in a simple and declarative manner, and to automatically get a probabilistic and explainable assessment of the security level of the possible application deployments.
Edit intent: clarity
Original:  In this article, we propose a methodology that permits to express security requirements for IoT applications, as well as infrastructure security capabilities, in a simple and declarative manner, and to automatically get a probabilistic and explainable assessment of the security level of the possible application deployments.
Revised:  In this article, we propose a methodology that permits to express security requirements for IoT applications, as well as infrastructure security capabilities, in a simple and declarative manner, and to automatically obtain an explainable assessment of the security level of the possible application deployments.
Edit intent: clarity
Original: In the paper a mathematical model of the PEN structure (positive electrode - electrolyte -negative electrode) of the Solid Oxide Fuel Cell (SOFC) is analyzed.
Revised: In the paper a mathematical model of the PEN structure (positive electrode - electrolyte - negative electrode) of the Solid Oxide Fuel Cell (SOFC) is analyzed.
Edit intent: fluency
Original: Molecular Communications (MC) is a bio-inspired communication technique that uses molecules as a means of information transfer among nanoscale devices.
Revised: Molecular Communications (MC) uses molecules as a means of information transfer among nanoscale devices.
Edit intent: clarity
Original:  Sensing the dynamic molecular spectrum, i.e., multiplexed detection of the concentration of multiple ligand types of similar properties co-existing in the MC channel, provides opportunities for eliminating molecular interference resulting from external sources in crowded physiological environments, and multi-user interference (MUI)
Revised:  Sensing the dynamic molecular spectrum, i.e., multiplexed detection of the concentration of multiple ligand types provides opportunities for eliminating molecular interference resulting from external sources in crowded physiological environments, and multi-user interference (MUI)
Edit intent: clarity