wanyu/IteraTeR_v2 huggingface dataset:
Original:   We propose GateKeeper, a new architecture that functions as a pre-alignment step that quickly filters out most incorrect candidate locations.
Revised:  Therefore, it is crucial to develop a fast and effective filter that can detect incorrect candidate locations and eliminate them before using computationally costly alignment operations. Results: We propose GateKeeper, a new architecture that functions as a pre-alignment step that quickly filters out most incorrect candidate locations.
Edit intent: coherence
Original:   We propose GateKeeper, a new architecture that functions as a pre-alignment step that quickly filters out most incorrect candidate locations.
Revised:  We propose GateKeeper, a new hardware accelerator that functions as a pre-alignment step that quickly filters out most incorrect candidate locations.
Edit intent: clarity
Original:  The main idea of GateKeeper is to filter out the incorrect mappings in a streaming fashion using Field-Programmable Gate Arrays (FPGAs) .
Revised:  GateKeeper is the first design to accelerate pre-alignment using Field-Programmable Gate Arrays (FPGAs) .
Edit intent: clarity
Original: Motivation: High throughput DNA sequencing (HTS) technologies generate an excessive number of small DNA segments -called short reads- that cause significant computational burden.
Revised: Motivation: High throughput DNA sequencing (HTS) technologies generate an excessive number of small DNA segments -- called short reads -- that cause significant computational burden.
Edit intent: fluency
Original:  Therefore, it is crucial to develop a fast and effective filter that can detect incorrect candidate locations and eliminate them before using computationally costly alignment operations.
Revised:  Therefore, it is crucial to develop a fast and effective filter that can detect incorrect candidate locations and eliminate them before invoking computationally costly alignment operations.
Edit intent: clarity
Original:  We argue that designing CNNs without timepadding and without timepooling, though slightly suboptimal for accuracy,  has two significant consequences.
Revised:  We argue that designing CNNs without timepadding and without timepooling, which is slightly suboptimal for accuracy, has two significant consequences.
Edit intent: coherence
Original:  We argue that designing CNNs without timepadding and without timepooling, though slightly suboptimal for accuracy,  has two significant consequences.
Revised:  We argue that designing CNNs without timepadding and without timepooling, though slightly suboptimal for accuracy, but has two significant consequences.
Edit intent: coherence
Original:   Our very deep CNN model sequence trained on the 2000h switchboard dataset obtains 9.4 word error rate on the Hub5 test-set, matching with a single model the performance of  2015 IBM system combination, which was the previous best published result.
Revised:  Our very deep CNN model sequence trained on the 2000h switchboard dataset obtains 9.4 word error rate on the Hub5 test-set, matching with a single model the performance of the 2015 IBM system combination, which was the previous best published result.
Edit intent: fluency
Original:  In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d%DIFDELCMD < \lesssim\Gs%%% \sqrt{q for some }%DIFDELCMD < \Gs%%% \in(0,1) } . By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing C11,CCX12  , we are able to locally recover arbitrarily large number k of coordinates  simultaneously at the cost of querying O( k\sqrt{q .
Revised:  In this paper, we focus on Reed-Muller codes with %DIFDELCMD < \lesssim\Gs%%% \sqrt{q for some }%DIFDELCMD < \Gs%%% \in(0,1) } . By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing C11,CCX12 , we are able to locally recover arbitrarily large number k of coordinates simultaneously at the cost of querying O( k\sqrt{q .
Edit intent: clarity
Original:  In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d%DIFDELCMD < \lesssim\Gs%%% \sqrt{q for some }%DIFDELCMD < \Gs%%% \in(0,1) } . By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing C11,CCX12  , we are able to locally recover arbitrarily large number k of coordinates  simultaneously at the cost of querying O( k\sqrt{q .
Revised:  In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d%DIFDELCMD < \lesssim\Gs%%% for some }%DIFDELCMD < \Gs%%% \in(0,1) } . By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing C11,CCX12 , we are able to locally recover arbitrarily large number k of coordinates simultaneously at the cost of querying O( k\sqrt{q .
Edit intent: fluency
Original:  In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d%DIFDELCMD < \lesssim\Gs%%% \sqrt{q for some }%DIFDELCMD < \Gs%%% \in(0,1) } . By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing C11,CCX12  , we are able to locally recover arbitrarily large number k of coordinates  simultaneously at the cost of querying O( k\sqrt{q .
Revised:  In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d%DIFDELCMD < \lesssim\Gs%%% \sqrt{q for some }%DIFDELCMD < \Gs%%% \in(0,1) q} . By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing C11,CCX12 , we are able to locally recover arbitrarily large number k of coordinates simultaneously at the cost of querying O( k\sqrt{q .
Edit intent: fluency
Original:  In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d%DIFDELCMD < \lesssim\Gs%%% \sqrt{q for some }%DIFDELCMD < \Gs%%% \in(0,1) } . By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing C11,CCX12  , we are able to locally recover arbitrarily large number k of coordinates  simultaneously at the cost of querying O( k\sqrt{q .
Revised:  In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d%DIFDELCMD < \lesssim\Gs%%% \sqrt{q for some }%DIFDELCMD < \Gs%%% \in(0,1) } . By introducing a local decoding of Reed-Muller codes via the concept of codex has been used for arithmetic secret sharing C11,CCX12 , we are able to locally recover arbitrarily large number k of coordinates simultaneously at the cost of querying O( k\sqrt{q .
Edit intent: coherence
Original:  In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d%DIFDELCMD < \lesssim\Gs%%% \sqrt{q for some }%DIFDELCMD < \Gs%%% \in(0,1) } . By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing C11,CCX12  , we are able to locally recover arbitrarily large number k of coordinates  simultaneously at the cost of querying O( k\sqrt{q .
Revised:  In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d%DIFDELCMD < \lesssim\Gs%%% \sqrt{q for some }%DIFDELCMD < \Gs%%% \in(0,1) } . By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing C11,CCX12 ) , we are able to locally recover arbitrarily large number k of coordinates simultaneously at the cost of querying O( k\sqrt{q .
Edit intent: fluency
Original:  In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d%DIFDELCMD < \lesssim\Gs%%% \sqrt{q for some }%DIFDELCMD < \Gs%%% \in(0,1) } . By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing C11,CCX12  , we are able to locally recover arbitrarily large number k of coordinates  simultaneously at the cost of querying O( k\sqrt{q .
Revised:  In this paper, we focus on Reed-Muller codes with evaluation polynomials of total degree d%DIFDELCMD < \lesssim\Gs%%% \sqrt{q for some }%DIFDELCMD < \Gs%%% \in(0,1) } . By introducing a local decoding of Reed-Muller codes via the concept of codex that has been used for arithmetic secret sharing C11,CCX12 , we are able to locally recover arbitrarily large number k of coordinates of a Reed-Muller code simultaneously at the cost of querying O( k\sqrt{q .
Edit intent: clarity
Original:  In contrast, by repetition of local decoding for recovery of a single coordinate, one has to query \Omega(k\sqrt{q\log k/\log q) coordinates}  for k= q^{\Omega(\sqrt{q\poly .
Revised:  In contrast, by repetition of local decoding for recovery of a single coordinate, one has to query \log k/\log q) coordinates} for k= q^{\Omega(\sqrt{q\poly .
Edit intent: coherence
Original:  Despite the success of traditional network analysis, standard networks provide a limited representation of these systems, which often includes different types of relationships (i.e., "multiplexity") among their constituent components and/or multiple interacting subsystems.
Revised:  Despite the success of traditional network analysis, standard networks provide a limited representation of complex systems, which often includes different types of relationships (i.e., "multiplexity") among their constituent components and/or multiple interacting subsystems.
Edit intent: clarity
Original:  Despite the success of traditional network analysis, standard networks provide a limited representation of these systems, which often includes different types of relationships (i.e., "multiplexity") among their constituent components and/or multiple interacting subsystems.
Revised:  Despite the success of traditional network analysis, standard networks provide a limited representation of these systems, which often include different types of relationships (i.e., "multiplexity") among their constituent components and/or multiple interacting subsystems.
Edit intent: fluency
Original:  Throwing away or aggregating available structural information can generate misleading results and provide a major obstacle towards attempts to understand the system under analysis .
Revised:  Throwing away or aggregating available structural information can generate misleading results and be a major obstacle towards attempts to understand the system under analysis .
Edit intent: clarity
Original:  Throwing away or aggregating available structural information can generate misleading results and provide a major obstacle towards attempts to understand the system under analysis .
Revised:  Throwing away or aggregating available structural information can generate misleading results and provide a major obstacle towards attempts to understand complex systems .
Edit intent: clarity
Original:  The recent "multilayer ' approach for modeling networked systems explicitly allows the incorporation of multiplexity and other features of realistic networked systems.
Revised:  The recent "multilayer " approach for modeling networked systems explicitly allows the incorporation of multiplexity and other features of realistic networked systems.
Edit intent: fluency
Original:  The recent "multilayer ' approach for modeling networked systems explicitly allows the incorporation of multiplexity and other features of realistic networked systems.
Revised:  The recent "multilayer ' approach for modeling networked systems explicitly allows the incorporation of multiplexity and other features of realistic systems.
Edit intent: fluency
Original:  The resulting framework plays a crucial role in helping to achieve a thorough, accurate understanding of complex systems.
Revised:  The resulting framework plays a crucial role in helping achieve a thorough, accurate understanding of complex systems.
Edit intent: fluency
Original:  The study of multilayer networks has also revealed new physical phenomena that remained hidden when using  the traditional network representation of graphs .
Revised:  The study of multilayer networks has also revealed new physical phenomena that remain hidden when using the traditional network representation of graphs .
Edit intent: fluency
Original:  The study of multilayer networks has also revealed new physical phenomena that remained hidden when using  the traditional network representation of graphs .
Revised:  The study of multilayer networks has also revealed new physical phenomena that remained hidden when using the traditional network representation .
Edit intent: clarity
Original:  Here we survey progress towards  a deeper understanding of dynamical processes on multilayer networks, and we highlight some of the physical phenomena  that emerge from multilayer structure and dynamics .
Revised:  Here we survey progress towards attaining a deeper understanding of dynamical processes on multilayer networks, and we highlight some of the physical phenomena that emerge from multilayer structure and dynamics .
Edit intent: clarity
Original:  Here we survey progress towards  a deeper understanding of dynamical processes on multilayer networks, and we highlight some of the physical phenomena  that emerge from multilayer structure and dynamics .
Revised:  Here we survey progress towards a deeper understanding of spreading processes on multilayer networks, and we highlight some of the physical phenomena that emerge from multilayer structure and dynamics .
Edit intent: clarity
Original:  Here we survey progress towards  a deeper understanding of dynamical processes on multilayer networks, and we highlight some of the physical phenomena  that emerge from multilayer structure and dynamics .
Revised:  Here we survey progress towards a deeper understanding of dynamical processes on multilayer networks, and we highlight some of the physical phenomena that emerge from multilayer structure .
Edit intent: clarity
Original:  We present an algorithm that generates recommendations by identifying overlapping co-clusters consisting of clients and products .
Revised:  We present an algorithm that generates recommendations by identifying overlapping co-clusters of clients and products .
Edit intent: clarity
Original:  The algorithm exhibits linear complexity in the number of co-clusters and input examples , and can therefore be applied to very large datasets .
Revised:  The algorithm exhibits linear complexity in the input examples and the number of co-clusters and input examples , and can therefore be applied to very large datasets .
Edit intent: coherence
Original:  The algorithm exhibits linear complexity in the number of co-clusters and input examples , and can therefore be applied to very large datasets .
Revised:  The algorithm exhibits linear complexity in the number of co-clusters .
Edit intent: clarity
Original:  We show, both on a real client-product dataset from our institution, as well as on publicly available datasets, that the recommendation accuracy of our algorithm is better than or equivalent to standard interpretable and non-interpretable recommendation techniques, such as standard one-class nearest neighbor and matrix factorization techniques.
Revised:  We show, both on real industrial data and on publicly available datasets, that the recommendation accuracy of our algorithm is better than or equivalent to standard interpretable and non-interpretable recommendation techniques, such as standard one-class nearest neighbor and matrix factorization techniques.
Edit intent: clarity
Original:  We show, both on a real client-product dataset from our institution, as well as on publicly available datasets, that the recommendation accuracy of our algorithm is better than or equivalent to standard interpretable and non-interpretable recommendation techniques, such as standard one-class nearest neighbor and matrix factorization techniques.
Revised:  We show, both on a real client-product dataset from our institution, as well as on publicly available datasets, that the recommendation accuracy of our algorithm is competitive to that of state-of-art matrix factorization techniques.
Edit intent: clarity
Original:  Most importantly, our approach is capable of offering textually and visually interpretable recommendations .
Revised:  In addition, our technique has the advantage of offering recommendations that are textually and visually interpretable recommendations .
Edit intent: clarity
Original:  We investigate this question using three theoretical approaches as well as an empirical analysis of concept propagation .
Revised:  We investigate this question using three theoretical approaches .
Edit intent: clarity
Original:  First, in evolutionary models , we show that a beneficial horizontally-transmissible element  , such as viral DNA, spreads super-exponentially through a population, substantially more quickly than a beneficial mutation.
Revised:  First, in the context of population genetics , we show that a beneficial horizontally-transmissible element , such as viral DNA, spreads super-exponentially through a population, substantially more quickly than a beneficial mutation.
Edit intent: clarity
Original:  First, in evolutionary models , we show that a beneficial horizontally-transmissible element  , such as viral DNA, spreads super-exponentially through a population, substantially more quickly than a beneficial mutation.
Revised:  First, in evolutionary models , we show that a horizontally-transmissible element , such as viral DNA, spreads super-exponentially through a population, substantially more quickly than a beneficial mutation.
Edit intent: fluency
Original:  First, in evolutionary models , we show that a beneficial horizontally-transmissible element  , such as viral DNA, spreads super-exponentially through a population, substantially more quickly than a beneficial mutation.
Revised:  First, in evolutionary models , we show that a beneficial horizontally-transmissible element , such as viral DNA, spreads superexponentially through a population, substantially more quickly than a beneficial mutation.
Edit intent: fluency
Original:  First, in evolutionary models , we show that a beneficial horizontally-transmissible element  , such as viral DNA, spreads super-exponentially through a population, substantially more quickly than a beneficial mutation.
Revised:  First, in evolutionary models , we show that a beneficial horizontally-transmissible element , such as viral DNA, spreads super-exponentially through a population, more quickly than a beneficial mutation.
Edit intent: clarity
Original:  Second, in an epidemiological social network approach , we show that infections that cause increased connectivity lead to faster-than-exponential fixation in the population.
Revised:  Second, in an epidemiological social network approach , we show that infections that cause increased connectivity lead to superexponential fixation in the population.
Edit intent: clarity
Original:  Third, in a sociological model with strategic rewiring , we find that preferences for increased global infection accelerate spread and produce super-exponential fixationrates, while preferences for local assortativity halt epidemics by disconnecting the infected from the susceptible.
Revised:  Third, in the context of dynamic social networks , we find that preferences for increased global infection accelerate spread and produce super-exponential fixationrates, while preferences for local assortativity halt epidemics by disconnecting the infected from the susceptible.
Edit intent: clarity
Original:  Third, in a sociological model with strategic rewiring , we find that preferences for increased global infection accelerate spread and produce super-exponential fixationrates, while preferences for local assortativity halt epidemics by disconnecting the infected from the susceptible.
Revised:  Third, in a sociological model with strategic rewiring , we find that preferences for increased global infection accelerate spread and produce superexponential fixation, but preferences for local assortativity halt epidemics by disconnecting the infected from the susceptible.
Edit intent: coherence
Original:  Finally, in an investigation of the Google Ngram corpus, we find that new words and phrases spread super-exponentially, as anticipated by our models.
Edit intent: coherence
Original:  We conclude that the dynamics of beneficial biological and social epidemics are characterized by the remarkably rapid spread of beneficial elements, which can be facilitated in biological systems by horizontal transmission and in social systems by active spreading strategies of infected individuals.
Revised:  We conclude that the dynamics of beneficial biological and social epidemics are characterized by the rapid spread of beneficial elements, which can be facilitated in biological systems by horizontal transmission and in social systems by active spreading strategies of infected individuals.
Edit intent: clarity
Original:  We conclude that the dynamics of beneficial biological and social epidemics are characterized by the remarkably rapid spread of beneficial elements, which can be facilitated in biological systems by horizontal transmission and in social systems by active spreading strategies of infected individuals.
Revised:  We conclude that the dynamics of beneficial biological and social epidemics are characterized by the remarkably rapid spread of beneficial elements, which is facilitated in biological systems by horizontal transmission and in social systems by active spreading strategies of infected individuals.
Edit intent: clarity
Original:  We conclude that the dynamics of beneficial biological and social epidemics are characterized by the remarkably rapid spread of beneficial elements, which can be facilitated in biological systems by horizontal transmission and in social systems by active spreading strategies of infected individuals.
Revised:  We conclude that the dynamics of beneficial biological and social epidemics are characterized by the remarkably rapid spread of beneficial elements, which can be facilitated in biological systems by horizontal transmission and in social systems by active spreading behavior of infected individuals.
Edit intent: clarity
Original: Signals are usually modeled as a superposition of exponential functions in spectroscopy of chemistry, biology and medical imaging.
Revised: Signals are generally modeled as a superposition of exponential functions in spectroscopy of chemistry, biology and medical imaging.
Edit intent: fluency
Original:  However, for fast data acquisition or other inevitable reasons,  only a small amount of samples may be acquired .
Revised:  For fast data acquisition or other inevitable reasons, only a small amount of samples may be acquired .
Edit intent: coherence
Original:  However, for fast data acquisition or other inevitable reasons,  only a small amount of samples may be acquired .
Revised:  However, for fast data acquisition or other inevitable reasons, however, only a small amount of samples may be acquired .
Edit intent: coherence
Original:  This paperstudies the problem of recovering N-dimensional (particularly N\geq 3) exponential signals from partial observations, and we formulate this problem as a low-rank tensor completion problem with exponential factors .
Revised:  In this paper, we study the problem of recovering N-dimensional (particularly N\geq 3) exponential signals from partial observations, and we formulate this problem as a low-rank tensor completion problem with exponential factors .
Edit intent: fluency
Original:  This paperstudies the problem of recovering N-dimensional (particularly N\geq 3) exponential signals from partial observations, and we formulate this problem as a low-rank tensor completion problem with exponential factors .
Revised:  This paperstudies the problem of recovering N-dimensional (particularly N\geq 3) exponential signals from partial observations, and formulate this problem as a low-rank tensor completion problem with exponential factors .
Edit intent: clarity