wanyu/IteraTeR_v2 huggingface dataset:
Original:  With this paper, we contribute to the field introducing a novel solving scheme coined as hybrid Quantum Computing - Tabu Search Algorithm.
Revised:  In this paper, we contribute to the field introducing a novel solving scheme coined as hybrid Quantum Computing - Tabu Search Algorithm.
Edit intent: fluency
Original:  With this paper, we contribute to the field introducing a novel solving scheme coined as hybrid Quantum Computing - Tabu Search Algorithm.
Revised:  With this paper, we introduce a novel solving scheme coined as hybrid Quantum Computing - Tabu Search Algorithm.
Edit intent: clarity
Original:  For assessing the quality of our method, we have used the well-known TSP as benchmarking problem.
Revised:  To assess the quality of our method, we have used the well-known TSP as benchmarking problem.
Edit intent: fluency
Original:  The obtained experimental outcomes support the preliminary conclusion that QTA is an approach which offers promising results for solving partitioning problems , while it drastically reduces the access to QC resources.
Revised:  The obtained outcomes support the preliminary conclusion that QTA is an approach which offers promising results for solving partitioning problems , while it drastically reduces the access to QC resources.
Edit intent: clarity
Original:  The obtained experimental outcomes support the preliminary conclusion that QTA is an approach which offers promising results for solving partitioning problems , while it drastically reduces the access to QC resources.
Revised:  The obtained experimental outcomes support the preliminary conclusion that our algorithm is an approach which offers promising results for solving partitioning problems , while it drastically reduces the access to QC resources.
Edit intent: clarity
Original:  The obtained experimental outcomes support the preliminary conclusion that QTA is an approach which offers promising results for solving partitioning problems , while it drastically reduces the access to QC resources.
Revised:  The obtained experimental outcomes support the preliminary conclusion that QTA is an approach which offers promising results for solving partitioning problems while it drastically reduces the access to QC resources.
Edit intent: fluency
Original:  Furthermore, we also contribute in this paper to the field of Transfer Optimization by developing and using a evolutionary multiform multitasking algorithm as initialization method for the introduced hybrid Quantum Computing - Tabu Search Algorithm.
Revised:  Furthermore, we also contribute in this paper to the field of Transfer Optimization by developing an evolutionary multiform multitasking algorithm as initialization method for the introduced hybrid Quantum Computing - Tabu Search Algorithm.
Edit intent: coherence
Original:  Furthermore, for the first time, we introduce semi-public signaling in which the sender can use a single communication channel per district.
Revised:  Furthermore, for the first time, we introduce semi-public signaling in which the sender can use a single communication channel per district.
Edit intent: fluency
Original:  In this article, we present a novel network architecture, called %DIFDELCMD < \system%%%  , for efficient CEP-based in-network processing as part of .%DIFDELCMD < \system %%%  enables efficient data processing in ICN by means of (1) a unified communication model that supports continuous data streams, (2) a meta query language for CEP to specify data processing operations in the data plane, and (3) query processing algorithms to resolve the specified operations.
Revised:  In this article, we present a novel network architecture, called %DIFDELCMD < \system%%% , for efficient CEP-based in-network processing as part of %DIFDELCMD < \system %%% enables efficient data processing in ICN by means of (1) a unified communication model that supports continuous data streams, (2) a meta query language for CEP to specify data processing operations in the data plane, and (3) query processing algorithms to resolve the specified operations.
Edit intent: fluency
Original:  Our experimental results for two IoT use cases and datasets show that %DIFDELCMD < \system %%%  offers very short response times of up to 73 \mu s under high workload and is more than 15 \times faster in terms of forwarding events than the state-of-the-art CEP system Flink.
Revised:  Our experimental results for two IoT use cases and datasets show that %DIFDELCMD < \system %%% offers very short response times of up to 73 \mu s under high workload and is more than 15 \times faster in terms of forwarding events than the state-of-the-art CEP system Flink.
Edit intent: fluency
Original:  Our experimental results for two IoT use cases and datasets show that %DIFDELCMD < \system %%%  offers very short response times of up to 73 \mu s under high workload and is more than 15 \times faster in terms of forwarding events than the state-of-the-art CEP system Flink.
Revised:  Our experimental results for two IoT use cases and datasets show that %DIFDELCMD < \system %%% offers very short response times of up to 73 \mu s under high workload and is more than 15X faster in terms of forwarding events than the state-of-the-art CEP system Flink.
Edit intent: clarity
Original: As memory capacity has outstripped TLB coverage, applications that use large data sets suffer from frequent page table walks.
Revised: As memory capacity has outstripped TLB coverage, large data applications suffer from frequent page table walks.
Edit intent: clarity
Original:  By flattening the page table we are able to reduce the number of indirections needed for a page walk from 4 to 2 in a non-virtualized system and from 24 to 8 under virtualization.
Revised:  By flattening the page table we are able to reduce the number of accesses required on a page walk from 4 to 2 in a non-virtualized system and from 24 to 8 under virtualization.
Edit intent: clarity
Original: Automatic speaker recognition algorithms typically use physiological speech characteristics encoded in the short term spectral features for characterizing speech audio .
Revised: Automatic speaker recognition algorithms typically characterize speech audio using short-term spectral features that encode the physiological and anatomical aspects of speech production .
Edit intent: clarity
Original:  Such algorithms do not capitalize on the complementary and discriminative speaker-dependent characteristics present in the behavioral speech features.
Revised:  Such algorithms do not fully capitalize on speaker-dependent characteristics present in the behavioral speech features.
Edit intent: clarity
Original:  Such algorithms do not capitalize on the complementary and discriminative speaker-dependent characteristics present in the behavioral speech features.
Revised:  Such algorithms do not capitalize on the complementary and discriminative speaker-dependent characteristics present in behavioral speech features.
Edit intent: fluency
Original:  The DeepTalk method outperforms several state-of-the-art physiological speech characteristics-based speaker recognition systems across multiple challenging datasets.
Revised:  The DeepTalk method outperforms several state-of-the-art speaker recognition systems across multiple challenging datasets.
Edit intent: clarity
Original:  We also integrate the DeepTalk method into a current state-of-the-art speech synthesizer to generate synthetic speech.
Revised:  We also integrate DeepTalk into a current state-of-the-art speech synthesizer to generate synthetic speech.
Edit intent: clarity
Original:  We evaluate portfolio performance , in a certain time period, by providing a new portfolio score, based on the aforementioned framework and concepts.
Revised:  We evaluate the performance of an allocation , in a certain time period, by providing a new portfolio score, based on the aforementioned framework and concepts.
Edit intent: clarity
Original:  In particular, it relies on the expected proportion of allocations that the portfolio outperforms when a certain set of strategies take place in that time period.
Revised:  In particular, it relies on the expected proportion of actually invested portfolios that it outperforms when a certain set of strategies take place in that time period.
Edit intent: clarity
Original: We discuss  a powerful, geometric representation of financial portfoliosand stock markets , which identifies the space of portfolios with the points lying in a simplex convex polytope.
Revised: We discuss a powerful, geometric framework to represent the set of portfolios , which identifies the space of portfolios with the points lying in a simplex convex polytope.
Edit intent: clarity
Original: We discuss  a powerful, geometric representation of financial portfoliosand stock markets , which identifies the space of portfolios with the points lying in a simplex convex polytope.
Revised: We discuss a powerful, geometric representation of financial portfoliosand stock markets , which identifies the space of portfolios with the points lying in a convex polytope.
Edit intent: fluency
Original:  Although our statistical tools are quite general, in this paper we focus on the problem of portfolio scoring.
Revised:  Although our tools are quite general, in this paper we focus on the problem of portfolio scoring.
Edit intent: clarity
Original:  Our contribution is to introduce an original computational framework to model portfolio allocation strategies, which is of independent interest for computational finance .
Revised:  Our contribution is to introduce an original computational framework to model asset allocation strategies, which is of independent interest for computational finance .
Edit intent: clarity
Original:  Our approach addresses the crucial question of evaluating portfolio management, and is relevant to the individual private investors as well as financial organizations.
Revised:  Our approach addresses the crucial question of evaluating portfolio management, and is relevant to individual managers as well as financial organizations.
Edit intent: clarity
Original:  In particular, it relies on the expected proportion of actually invested portfoliosthat it outperforms when a certain set of strategies take place in that time period.
Revised:  In particular, our score relies on the expected proportion of actually invested portfoliosthat it outperforms when a certain set of strategies take place in that time period.
Edit intent: clarity
Original:  However, the conditions to use the bypass require completely empty buffers in the intermediate routers.
Revised:  However, the conditions to use them requires completely empty buffers in the intermediate routers.
Edit intent: clarity
Original:  This paper presents and reviews NEBB, Non-Empty Buffer Bypass, a mechanism that allows to bypass flits even if the buffers to bypass are not empty.
Revised:  This paper presents NEBB, Non-Empty Buffer Bypass, a mechanism that allows to bypass flits even if the buffers to bypass are not empty.
Edit intent: clarity
Original: Cross-core communication is becoming a bottleneck as the number of processing elements (PEs) increase per system-on-chip (SoC) .
Revised: Cross-core communication is increasingly a bottleneck as the number of processing elements (PEs) increase per system-on-chip (SoC) .
Edit intent: clarity
Original: Cross-core communication is becoming a bottleneck as the number of processing elements (PEs) increase per system-on-chip (SoC) .
Revised: Cross-core communication is becoming a bottleneck as the number of processing elements increase per system-on-chip (SoC) .
Edit intent: clarity
Original: Cross-core communication is becoming a bottleneck as the number of processing elements (PEs) increase per system-on-chip (SoC) .
Revised: Cross-core communication is becoming a bottleneck as the number of processing elements (PEs) increase per system-on-chip .
Edit intent: clarity
Original:  A key problem to solve , as we will show, is that of shared state in any software-based message queue mechanism.
Revised:  A key problem , as we will show, is that of shared state in any software-based message queue mechanism.
Edit intent: clarity
Original:  A key problem to solve , as we will show, is that of shared state in any software-based message queue mechanism.
Revised:  A key problem to solve , as we will show, is that of shared state in software-based message queue mechanism.
Edit intent: clarity
Original:  In this paper , we propose Virtual-Link (VL), a novel light-weight communication mechanism with hardware support to facilitate data movement between multiple data producers and consumers . VL reduces the amount of coherent shared state for synchronization , which is a key bottleneck for many approaches, to zero.
Revised:  In this paper , we propose Virtual-Link (VL), a novel light-weight communication mechanism with hardware support to facilitate data movement between multiple data producers and consumers . VL reduces the amount of coherent shared state , which is a key bottleneck for many approaches, to zero.
Edit intent: clarity
Original:  In this paper , we propose Virtual-Link (VL), a novel light-weight communication mechanism with hardware support to facilitate data movement between multiple data producers and consumers . VL reduces the amount of coherent shared state for synchronization , which is a key bottleneck for many approaches, to zero.
Revised:  In this paper , we propose Virtual-Link (VL), a novel light-weight communication mechanism with hardware support to facilitate data movement between multiple data producers and consumers . VL reduces the amount of coherent shared state for synchronization , which is a bottleneck for many approaches, to zero.
Edit intent: clarity
Original:  VL provides further performance benefit by keeping data on the fast path (i.e., within the on-chip interconnect).
Revised:  VL provides further latency benefit by keeping data on the fast path (i.e., within the on-chip interconnect).
Edit intent: clarity
Original:  The method relates the value of Rt to the estimation of the doubling time performed with a local exponential fit.
Revised:  The method relates the value of R_t to the estimation of the doubling time performed with a local exponential fit.
Edit intent: clarity
Original:  Images generated using MorphNet conserve the identity of the person in the original image, and the provided control over head pose and facial expression allows test sets to be created to identify robustness issues of a facial recognition deep network with respect to pose and expression.
Revised:  Images generated using MorphGAN conserve the identity of the person in the original image, and the provided control over head pose and facial expression allows test sets to be created to identify robustness issues of a facial recognition deep network with respect to pose and expression.
Edit intent: clarity
Original: Emerging network architectures like Information-centric Networking (ICN) offer simplicity in the data plane by addressing named data .
Revised: Emerging network architectures like Information-centric Networking (ICN) offer simplicity in the data plane by addressing named data .
Edit intent: fluency
Original:  Such flexibility opens up the possibility to move data processing inside network elements for high-performance computation, known as \emph{in-network processing .
Revised:  Such flexibility opens up the possibility to move data processing inside network elements for high-performance computation, known as \emph{in-network processing .
Edit intent: fluency
Original:  However, existing ICN architectures are limited in terms \% of data plane programmability due to  lack of (i) in-network processing and (ii) data plane programming abstractions.
Revised:  However, existing ICN architectures are limited in terms of data plane programmability due to lack of (i) in-network processing and (ii) data plane programming abstractions.
Edit intent: clarity
Original:  However, existing ICN architectures are limited in terms \% of data plane programmability due to  lack of (i) in-network processing and (ii) data plane programming abstractions.
Revised:  However, existing ICN architectures are limited in terms \% of data plane programmability due to the lack of (i) in-network processing and (ii) data plane programming abstractions.
Edit intent: fluency
Original:  Yet, it is extremely challenging to integrate CEP because the current communication model of ICN is limited to consumer-initiated interaction that comes with significant overhead in  number of requests to process continuous data streams.
Revised:  Yet, it is extremely challenging to integrate CEP because the current communication model of ICN is limited to consumer-initiated interaction that comes with significant overhead in number of requests to process continuous data streams.
Edit intent: fluency
Original:  Yet, it is extremely challenging to integrate CEP because the current communication model of ICN is limited to consumer-initiated interaction that comes with significant overhead in  number of requests to process continuous data streams.
Revised:  Yet, it is extremely challenging to integrate CEP because the current communication model of ICN is limited to consumer-initiated interaction that comes with significant overhead in a number of requests to process continuous data streams.
Edit intent: fluency
Original:  In contrast, a change to producer-initiated interaction, as favored by CEP , imposes severe limitations for request-reply interactions.
Revised:  In contrast, a change to producer-initiated interaction, as favored by CEP , imposes severe limitations for request-reply interactions.
Edit intent: fluency
Original:  In this paper, we propose an in-network CEP architecture,%DIFDELCMD < \system %%%  that supports unified interaction patterns ( consumer- and\emph{producer- initiated ).
Revised:  In this paper, we propose an in-network CEP %DIFDELCMD < \system %%% that supports unified interaction patterns ( consumer- and\emph{producer- initiated ).
Edit intent: clarity
Original:  In this paper, we propose an in-network CEP architecture,%DIFDELCMD < \system %%%  that supports unified interaction patterns ( consumer- and\emph{producer- initiated ).
Revised:  In this paper, we propose an in-network CEP architecture,%DIFDELCMD < \system %%% that supports unified interaction patterns ( and\emph{producer- initiated ).
Edit intent: clarity
Original:  In this paper, we propose an in-network CEP architecture,%DIFDELCMD < \system %%%  that supports unified interaction patterns ( consumer- and\emph{producer- initiated ).
Revised:  In this paper, we propose an in-network CEP architecture,%DIFDELCMD < \system %%% that supports unified interaction patterns ( consumer- \emph{producer- initiated ).
Edit intent: fluency
Original:  In this paper, we propose an in-network CEP architecture,%DIFDELCMD < \system %%%  that supports unified interaction patterns ( consumer- and\emph{producer- initiated ).
Revised:  In this paper, we propose an in-network CEP architecture,%DIFDELCMD < \system %%% that supports unified interaction patterns ( consumer- and\emph{ initiated ).
Edit intent: fluency
Original:  In addition, we provide a CEP query language and facilitate CEP operations while increasing the range of applications that can be supported by ICN . We provide an open-source implementation and evaluation of %DIFDELCMD < \system %%% over an ICN architecture, Named Function Networking, and two applications: energy forecasting in smart homes and a disaster scenario.
Revised:  In addition, we provide a CEP query language and facilitate CEP operations while increasing the range of applications that can be supported by ICN . We provide an open-source implementation and evaluation of %DIFDELCMD < \system %%% over an ICN architecture, Named Function Networking, and two applications: energy forecasting in smart homes and a disaster scenario.
Edit intent: fluency
Original:  In addition, we provide a CEP query language and facilitate CEP operations while increasing the range of applications that can be supported by ICN . We provide an open-source implementation and evaluation of %DIFDELCMD < \system %%% over an ICN architecture, Named Function Networking, and two applications: energy forecasting in smart homes and a disaster scenario.
Revised:  In addition, we provide a CEP query language and facilitate CEP operations while increasing the range of applications that can be supported by ICN . We provide an open-source implementation and evaluation of %DIFDELCMD < \system %%% ICN architecture, Named Function Networking, and two applications: energy forecasting in smart homes and a disaster scenario.
Edit intent: clarity
Original: We show the use of the focal underdetermined system solver to recover sparse  quadrature rules for parametrized integrals from existing data  .
Revised: In this paper we show the use of the focal underdetermined system solver to recover sparse quadrature rules for parametrized integrals from existing data .
Edit intent: clarity
Original:  We propose an analytical framework able to find the optimal operating point in this continuum, linking the accuracy of the learning task with the corresponding network andcomputational cost for moving data and running the distributed training at the CPs.
Revised:  We propose an analytical framework able to find the optimal operating point in this continuum, linking the accuracy of the learning task with the corresponding andcomputational cost for moving data and running the distributed training at the CPs.
Edit intent: clarity
Original:  We propose an analytical framework able to find the optimal operating point in this continuum, linking the accuracy of the learning task with the corresponding network andcomputational cost for moving data and running the distributed training at the CPs.
Revised:  We propose an analytical framework able to find the optimal operating point in this continuum, linking the accuracy of the learning task with the corresponding network computational cost for moving data and running the distributed training at the CPs.
Edit intent: fluency
Original:  We propose an analytical framework able to find the optimal operating point in this continuum, linking the accuracy of the learning task with the corresponding network andcomputational cost for moving data and running the distributed training at the CPs.
Revised:  We propose an analytical framework able to find the optimal operating point in this continuum, linking the accuracy of the learning task with the corresponding network andnetwork and computational cost for moving data and running the distributed training at the CPs.
Edit intent: fluency
Original:  We show through simulations that the model accurately predicts the optimal trade-off, quite often an intermediate point between full centralisation and full decentralisation, showing also a significant cost saving w.r.t. both of them.
Revised:  We show through simulations that the model accurately predicts the optimal trade-off, quite often an intermediate point between full centralisation and full decentralisation, showing also a significant cost saving w.r.t. both of them.
Edit intent: fluency
Original: Fitting Susceptible-Infected-Recovered (SIR) models to incidence data is problematic when a fraction q of the infected individuals are not reported.
Revised: Fitting Susceptible-Infected-Recovered (SIR) models to incidence data is problematic when not all infected individuals are not reported.
Edit intent: clarity
Original: Fitting Susceptible-Infected-Recovered (SIR) models to incidence data is problematic when a fraction q of the infected individuals are not reported.
Revised: Fitting Susceptible-Infected-Recovered (SIR) models to incidence data is problematic when a fraction q of the infected individuals are reported.
Edit intent: clarity