wanyu/IteraTeR_v2 huggingface dataset:
Original:  This paper aims to address this problem by developing an offline and real-time data lifecycle process that incorporates a layered, data-flow centric, and an edge/ cloud computing approach that is needed for handling heterogeneous, streaming and geographicallydispersed IoMT data streams .
Revised:  This paper aims to address this problem by developing an offline and real-time data lifecycle process that incorporates a layered, data-flow centric, and an edge/ cloud computing approach that is needed for handling heterogeneous, streaming and geographically-dispersed IoMT devices .
Edit intent: clarity
Original:  We describe and evaluate our prototype implementation using real-time transit data feeds and a commercial edge-based platform . Preliminary results are showing the advantages of running data lifecycle tasks at the edge of the network for reducing the volume of data streams that are redundant and should not be transported to the cloud.
Revised:  We describe and evaluate our prototype implementation using real-time transit data feeds . Preliminary results are showing the advantages of running data lifecycle tasks at the edge of the network for reducing the volume of data streams that are redundant and should not be transported to the cloud.
Edit intent: clarity
Original:  We describe and evaluate our prototype implementation using real-time transit data feeds and a commercial edge-based platform . Preliminary results are showing the advantages of running data lifecycle tasks at the edge of the network for reducing the volume of data streams that are redundant and should not be transported to the cloud.
Revised:  We describe and evaluate our prototype implementation using real-time transit data feeds and a commercial edge-based platform . Preliminary results are showing the advantages of running data life cycle tasks for reducing the volume of data streams that are redundant and should not be transported to the cloud.
Edit intent: clarity
Original:  We have integrated these capabilities into the Wireless Artifact-free Neuromodulation Device (WAND) . WAND features custom neural interface ASICs (Application Specific Integrated Circuit) and on-board computational components for neural signal processing and closed-loop control.
Revised:  We have integrated these capabilities into the Wireless Artifact-free Neuromodulation Device (WAND) . WAND features custom neural interface ASICs (Application Specific Integrated Circuit) and on-board processing to fully cancel stimulation artifacts, detect neural biomarkers, and automatically adjust stimulation parameters in a closed-loop control.
Edit intent: clarity
Original:  Using WAND , we demonstrate a functional response to closed-loop neuromodulation application during a delayed-reach task by stimulating in response to measured local field potential (LFP) beta band power modulation to disrupt neural preparatory activity.
Revised:  Using WAND , we demonstrate a functional response to closed-loop stimulation paradigm to disrupt movement preparatory activity during a delayed-reach task by stimulating in response to measured local field potential (LFP) beta band power modulation to disrupt neural preparatory activity.
Edit intent: clarity
Original:  It combines custom application specific integrated circuits (ASICs), an on-board FPGA, and a low power bidirectional radio.
Revised:  It combines custom application specific integrated circuits (ASICs), an on-board FPGA, and a low-power bidirectional radio.
Edit intent: fluency
Original:  the suppliers who provide the goods and services for sale \%and set the prices of those goods and the intermediary who is responsible for helping connect consumers to suppliers via its recommendation algorithms . \% and who takes a commission from the supplier and/or consumer in exchange for this service .
Revised:  the suppliers who provide the goods and services for sale and the intermediary who is responsible for helping connect consumers to suppliers via its recommendation algorithms . \% and who takes a commission from the supplier and/or consumer in exchange for this service .
Edit intent: clarity
Original:  the suppliers who provide the goods and services for sale \%and set the prices of those goods and the intermediary who is responsible for helping connect consumers to suppliers via its recommendation algorithms . \% and who takes a commission from the supplier and/or consumer in exchange for this service .
Revised:  the suppliers who provide the goods and services for sale \%and set the prices of those goods and the intermediary who is responsible for helping connect consumers to suppliers via its recommendation algorithms .
Edit intent: coherence
Original: The Engine for Likelihood-Free Inference (ELFI) is a Python software library for performing likelihood-free inference (LFI).
Revised:  Engine for Likelihood-Free Inference (ELFI) is a Python software library for performing likelihood-free inference (LFI).
Edit intent: clarity
Original:  ELFI provides a convenient syntax for specifying LFImodels commonly composed of priors, simulators, summaries , distancesand other custom operations.
Revised:  ELFI provides a convenient syntax for arranging components in LFI, such as priors, simulators, summaries , distancesand other custom operations.
Edit intent: clarity
Original:  Separating the modelling task from the inference makes it possible to use the same model with any of the available inference methods without modifications.
Revised:  The stand-alone ELFI graph can be used with any of the available inference methods without modifications.
Edit intent: clarity
Original:  This makes addition of new inference methods to ELFI straightforward and automatically compatible with the inbuilt features.
Revised:  This makes the adding of new inference methods to ELFI straightforward and automatically compatible with the inbuilt features.
Edit intent: fluency
Original:  In more recent studies they have been identified not only in the cerebral cortex and thalamus, but pervasively in the healthy basal ganglia.
Revised:  More recently, they have been identified not only in the cerebral cortex and thalamus, but pervasively in the healthy basal ganglia.
Edit intent: clarity
Original:  where they selectively establish and reinforce effective connections by controlling spike-timing-dependent gain . Corticostriatal and striatonigral conduction delays are critical to this mechanism,
Revised:  synchronizing those areas and functionally connecting them . Corticostriatal and striatonigral conduction delays are critical to this mechanism,
Edit intent: clarity
Original:  where they selectively establish and reinforce effective connections by controlling spike-timing-dependent gain . Corticostriatal and striatonigral conduction delays are critical to this mechanism,
Revised:  where they selectively establish and reinforce effective connections by controlling spike-timing-dependent gain . Corticostriatal and striatonigral conduction delays are crucial to this mechanism,
Edit intent: clarity
Original:  We describe a deterministic s-workspace algorithm for computing NVD (P) and FVD (P ) that runs in O((n^2/s)\log s) time.
Revised:  We describe a deterministic s-workspace algorithm for computing NVD and FVD for P that runs in O((n^2/s)\log s) time.
Edit intent: clarity
Original:  Moreover, we generalize our s-workspace algorithm so that for any given K\in \{1,%DIFDELCMD < \dots%%% , O(s)
Revised:  Moreover, we generalize our s-workspace algorithm so that for any given K\in \{1,%DIFDELCMD < \dots%%% O(s)
Edit intent: fluency
Original: While machine learning tools have been rapidly advancing , the majority of neural decoding approaches still use last century's methods.
Revised: Despite rapid advances in machine learning tools have been rapidly advancing , the majority of neural decoding approaches still use last century's methods.
Edit intent: clarity
Original: While machine learning tools have been rapidly advancing , the majority of neural decoding approaches still use last century's methods.
Revised: While machine learning tools , the majority of neural decoding approaches still use last century's methods.
Edit intent: clarity
Original: While machine learning tools have been rapidly advancing , the majority of neural decoding approaches still use last century's methods.
Revised: While machine learning tools have been rapidly advancing , the majority of neural decoding approaches still use traditional methods.
Edit intent: clarity
Original:  Improving the performance of neural decoding algorithms allows us to better understand what information is contained in the brain , and can help advance engineering applications such as brain machine interfaces.
Revised:  Improving the performance of neural decoding algorithms allows us to better understand the information contained in a neural population , and can help advance engineering applications such as brain machine interfaces.
Edit intent: clarity
Original:  Here, we apply modern machine learning techniques , including neural networks and gradient boosting , to decode from spiking activity in 1) motor cortex, 2) somatosensory cortex, and 3) hippocampus.
Revised:  Here, we apply modern machine learning techniques , including neural networks and gradient boosting , to decode from spiking activity in motor cortex, 2) somatosensory cortex, and 3) hippocampus.
Edit intent: fluency
Original:  Here, we apply modern machine learning techniques , including neural networks and gradient boosting , to decode from spiking activity in 1) motor cortex, 2) somatosensory cortex, and 3) hippocampus.
Revised:  Here, we apply modern machine learning techniques , including neural networks and gradient boosting , to decode from spiking activity in 1) motor cortex, somatosensory cortex, and 3) hippocampus.
Edit intent: fluency
Original:  Modern methods, in particular neural networks and ensembles, significantly outperform traditional approaches, such as Wiener and Kalman filters.
Revised:  Modern methods, particularly neural networks and ensembles, significantly outperform traditional approaches, such as Wiener and Kalman filters.
Edit intent: fluency
Original:  Improving the performance of neural decoding algorithms allows neuroscientists to better understand the information contained in a neural population , and can help advance engineering applications such as brain machine interfaces.
Revised:  Improving the performance of neural decoding algorithms allows neuroscientists to better understand the information contained in a neural population and can help advance engineering applications such as brain machine interfaces.
Edit intent: fluency
Original:  Finally, we illustrate the efficiency of our approach using several applications including rational, algebraic and P\'olya structures .
Revised:  Finally, we illustrate the efficiency of our approach using several applications of rational, algebraic and P\'olya structures .
Edit intent: clarity
Original:  For instance, polyomino tilings with prescribed tile frequencies or planar trees with  specific node degree distribution  .
Revised:  For instance, polyomino tilings with prescribed tile frequencies , planar trees with specific node degree distribution .
Edit intent: fluency
Original:  Although many species of fungi have been reported to be able to promote calcium mineralization, they have not yet been investigated in the application of self-healing concrete, thus an initial screening of different species of fungi has been conducted.
Revised:  An initial screening of different species of fungi has been conducted.
Edit intent: coherence
Original:  We employed material characterization techniques including X-ray diffraction (XRD) and scanning electron microscope (SEM) , both of which confirmed that the crystals precipitated on the fungal hyphae were composed of calcite  .
Revised:  X-ray diffraction (XRD) and scanning electron microscope (SEM) , both of which confirmed that the crystals precipitated on the fungal hyphae were composed of calcite .
Edit intent: clarity
Original:  We employed material characterization techniques including X-ray diffraction (XRD) and scanning electron microscope (SEM) , both of which confirmed that the crystals precipitated on the fungal hyphae were composed of calcite  .
Revised:  We employed material characterization techniques including X-ray diffraction (XRD) and scanning electron microscope (SEM) confirmed that the crystals precipitated on the fungal hyphae were composed of calcite .
Edit intent: coherence
Original: Recently, non-orthogonal multiple access (NOMA) has attracted considerable interest as one of the 5G-defining techniques.
Revised: Recently, non-orthogonal multiple access (NOMA) has attracted considerable interest as one of the 5G-enabling techniques.
Edit intent: clarity
Original:  However, as NOMA is intrinsically in favour of the transmission of strong users who are capable of carrying out successive decoding, judicious designs are required to guarantee user fairness.
Revised:  However, users with better channel conditions in downlink communications intrinsically benefits from NOMA thanks to successive decoding, judicious designs are required to guarantee user fairness.
Edit intent: clarity
Original:  In parallel, for delay-limited transmission, the sum of delay-limited throughput (DLT) is maximized subject to a maximum allowable user outage constraint under full CSIT, and the analysis for the sum of DLT is  performed under partial CSIT.
Revised:  In parallel, for delay-limited transmission, the sum of delay-limited throughput (DLT) is maximized subject to a maximum allowable user outage constraint under full CSIT, and the analysis for the sum of DLT is also performed under partial CSIT.
Edit intent: clarity
Original:  Furthermore, a sophisticated orthogonal multiple access (OMA) scheme is also studied as a benchmark to prove the superiority of NOMA over OMA with full CSIT. Finally, the theoretical analysis is verified via simulations by means of various trade-offs for the average sum-rate (sum-DLT) versus the minimum (maximum)  user rate (outage) requirement.
Revised:  Furthermore, an optimal orthogonal multiple access (OMA) scheme is also studied as a benchmark to prove the superiority of NOMA over OMA with full CSIT. Finally, the theoretical analysis is verified via simulations by means of various trade-offs for the average sum-rate (sum-DLT) versus the minimum (maximum) user rate (outage) requirement.
Edit intent: clarity
Original:  Furthermore, a sophisticated orthogonal multiple access (OMA) scheme is also studied as a benchmark to prove the superiority of NOMA over OMA with full CSIT. Finally, the theoretical analysis is verified via simulations by means of various trade-offs for the average sum-rate (sum-DLT) versus the minimum (maximum)  user rate (outage) requirement.
Revised:  Furthermore, a sophisticated orthogonal multiple access (OMA) scheme is also studied as a benchmark to prove the superiority of NOMA over OMA under full CSIT. Finally, the theoretical analysis is verified via simulations by means of various trade-offs for the average sum-rate (sum-DLT) versus the minimum (maximum) user rate (outage) requirement.
Edit intent: clarity
Original:  Furthermore, a sophisticated orthogonal multiple access (OMA) scheme is also studied as a benchmark to prove the superiority of NOMA over OMA with full CSIT. Finally, the theoretical analysis is verified via simulations by means of various trade-offs for the average sum-rate (sum-DLT) versus the minimum (maximum)  user rate (outage) requirement.
Revised:  Furthermore, a sophisticated orthogonal multiple access (OMA) scheme is also studied as a benchmark to prove the superiority of NOMA over OMA with full CSIT. Finally, the theoretical analysis is verified by simulations via different trade-offs for the average sum-rate (sum-DLT) versus the minimum (maximum) user rate (outage) requirement.
Edit intent: clarity
Original:  Furthermore, a sophisticated orthogonal multiple access (OMA) scheme is also studied as a benchmark to prove the superiority of NOMA over OMA with full CSIT. Finally, the theoretical analysis is verified via simulations by means of various trade-offs for the average sum-rate (sum-DLT) versus the minimum (maximum)  user rate (outage) requirement.
Revised:  Furthermore, a sophisticated orthogonal multiple access (OMA) scheme is also studied as a benchmark to prove the superiority of NOMA over OMA with full CSIT. Finally, the theoretical analysis is verified via simulations by means of various trade-offs for the average sum-rate (sum-DLT) versus the minimum (maximum) average user rate (outage) requirement.
Edit intent: clarity
Original:  It targets query sequences of 1kb-100Mb in length with per-base divergence typically below 25\%.
Revised:  It targets query sequences of 1kb--100Mb in length with per-base divergence typically below 25\%.
Edit intent: fluency
Original: Summary:\sim100  Minimap2 is a general-purpose mapper to align long noisy DNA or mRNA sequences against a large reference database.
Revised: Summary:\sim100 Minimap2 is a general-purpose alignment program to map DNA or long mRNA sequences against a large reference database.
Edit intent: clarity
Original:  It is 3--4 times faster than mainstream short-read mappers at comparable accuracy and \ge30 times faster at higher accuracy for both genomic and mRNA reads, surpassing most aligners specialized in one type of alignment.
Revised:  It is 3-4 times faster than mainstream short-read mappers at comparable accuracy and \ge30 times faster at higher accuracy for both genomic and mRNA reads, surpassing most aligners specialized in one type of alignment.
Edit intent: fluency
Original: This study presents a fast and exact computational method for crack propagation  which is based on the extended finite element method (X-FEM).
Revised: This study suggests a fast computational method for crack propagation which is based on the extended finite element method (X-FEM).
Edit intent: clarity
Original: This study presents a fast and exact computational method for crack propagation  which is based on the extended finite element method (X-FEM).
Revised: This study presents a fast and exact computational method for crack propagation , which is based on the extended finite element method (X-FEM).
Edit intent: fluency
Original:  This model is a "forward curve model" - it describes the stochastic evolution of forward prices - rather than a "spot model" that models the evolution of the spot commodity price (and possibly the convenience yield) .
Revised:  This model is a "forward curve model" - it describes the stochastic evolution of forward prices - rather than a "spot model" that models the evolution of the spot commodity price .
Edit intent: clarity
Original:  We first obtain a closed formula for the mean number of internal equilibria, characterise its asymptotic behaviour and study the effect of the correlation.
Revised:  We first obtain a closed formula for the mean number of internal (stable) equilibria. We then characterise the asymptotic behaviour of this important quantity and study the effect of the correlation.
Edit intent: clarity
Original:  Using techniques from the random polynomial theory we establish a closed formula for the mean number of internal (stable) equilibria.
Revised:  Using techniques from the random polynomial theory we establish a closed formula for the mean numbers of internal (stable) equilibria.
Edit intent: fluency
Original: We revisit the optimal periodic dividend problem where dividend payments can only be made at the jump times of an independent Poisson process.
Revised: In this paper, we revisit the optimal periodic dividend problem where dividend payments can only be made at the jump times of an independent Poisson process.
Edit intent: clarity
Original: We revisit the optimal periodic dividend problem where dividend payments can only be made at the jump times of an independent Poisson process.
Revised: We revisit the optimal periodic dividend problem , in which dividend payments can only be made at the jump times of an independent Poisson process.
Edit intent: fluency
Original:  In this paper, we show its optimality for a spectrally negative L\'evy model with a completely monotone L\'evy density.
Revised:  In this paper, we show the optimality of this strategy for a spectrally negative L\'evy model with a completely monotone L\'evy density.
Edit intent: clarity
Original:  In this paper, we show its optimality for a spectrally negative L\'evy model with a completely monotone L\'evy density.
Revised:  In this paper, we show its optimality for a spectrally negative L\'evy process whose dual has a completely monotone L\'evy density.
Edit intent: clarity
Original:  The optimal strategies and the value functions are concisely written in terms of the scale function .
Revised:  The optimal strategies and value functions are concisely written in terms of the scale function .
Edit intent: fluency
Original:  The optimal strategies and the value functions are concisely written in terms of the scale function .
Revised:  The optimal strategies and the value functions are concisely written in terms of the scale functions .
Edit intent: fluency
Original:  Numerical results are also given .
Revised:  Numerical results are also provided .
Edit intent: clarity
Original:  Here , we investigate a mathematical model of growth and interactions between mutualistic microbial species separated in space but coupled by a channel through which nutrients are exchangeddiffusively .
Revised:  Here , we investigate a mathematical model of growth and interactions between mutualistic microbial species separated in space but coupled by a channel through which metabolites are exchanged .
Edit intent: clarity
Original:  During brief time periods users often use a single communication channel, and communication channel alteration (CCA) occurs , which means that our understanding of the dynamics of social contagions must be redefined .
Revised:  During brief time periods users often use a single communication channel, but then communication channel alteration (CCA) occurs , which means that our understanding of the dynamics of social contagions must be redefined .
Edit intent: coherence
Original:  During brief time periods users often use a single communication channel, and communication channel alteration (CCA) occurs , which means that our understanding of the dynamics of social contagions must be redefined .
Revised:  During brief time periods users often use a single communication channel, and communication channel alteration (CCA) occurs , which means that our understanding of the dynamics of social contagions .
Edit intent: clarity
Original:  We propose a non-Markovian behavior spreading model  that takes into account the CCA mechanism in multiplex networks , and we develop a generalized edge-based compartmental theory to describe the spreading dynamics.
Revised:  We propose a non-Markovian behavior spreading model in multiplex networks that takes into account the CCA mechanism in multiplex networks , and we develop a generalized edge-based compartmental theory to describe the spreading dynamics.
Edit intent: fluency
Original:  We propose a non-Markovian behavior spreading model  that takes into account the CCA mechanism in multiplex networks , and we develop a generalized edge-based compartmental theory to describe the spreading dynamics.
Revised:  We propose a non-Markovian behavior spreading model that takes into account the CCA mechanism , and we develop a generalized edge-based compartmental theory to describe the spreading dynamics.
Edit intent: clarity
Original:  We propose a non-Markovian behavior spreading model  that takes into account the CCA mechanism in multiplex networks , and we develop a generalized edge-based compartmental theory to describe the spreading dynamics.
Revised:  We propose a non-Markovian behavior spreading model that takes into account the CCA mechanism in multiplex networks , and we develop a generalized edge-based compartmental method to describe the spreading dynamics.
Edit intent: clarity