wanyu/IteraTeR_v2 huggingface dataset:
Original: The radio access network (RAN) is regarded as one of the potential proposals for massive Internet of Things (mIoT)  , where the random access channel (RACH) procedure should be exploited for IoT devices to access to the RAN . However, modelling of the dynamic process of RACH of mIoT devices is challenging.
Revised: The radio access network (RAN) is regarded as one of the potential proposals for massive Internet of things (mIoT) , where the random access channel (RACH) procedure should be exploited for IoT devices to access to the RAN . However, modelling of the dynamic process of RACH of mIoT devices is challenging.
Edit intent: fluency
Original: The radio access network (RAN) is regarded as one of the potential proposals for massive Internet of Things (mIoT)  , where the random access channel (RACH) procedure should be exploited for IoT devices to access to the RAN . However, modelling of the dynamic process of RACH of mIoT devices is challenging.
Revised: The radio access network (RAN) is regarded as one of the potential proposals for massive Internet of Things (mIoT) , where the random access channel (RACH) procedure should be exploited for IoT devices to access the networks . However, modelling of the dynamic process of RACH of mIoT devices is challenging.
Edit intent: clarity
Original: The radio access network (RAN) is regarded as one of the potential proposals for massive Internet of Things (mIoT)  , where the random access channel (RACH) procedure should be exploited for IoT devices to access to the RAN . However, modelling of the dynamic process of RACH of mIoT devices is challenging.
Revised: The radio access network (RAN) is regarded as one of the potential proposals for massive Internet of Things (mIoT) , where the random access channel (RACH) procedure should be exploited for IoT devices to access to the RAN . However, modelling of the dynamic process of RACH of massive IoT devices is challenging.
Edit intent: fluency
Original:  To address this challenge, we first revisit the frame and minislot structure of the RAN . Then, we correlate the RACH request of an IoT device with its queue status and analyze the queue evolution process . Based on the analysis result, we derive the closed-form expression of the RA success probability of the device.
Revised:  To address this challenge, we first revisit the frame and minislot structure of the radio access network (RAN) . Then, we correlate the RACH request of an IoT device with its queue status and analyze the queue evolution process . Based on the analysis result, we derive the closed-form expression of the RA success probability of the device.
Edit intent: clarity
Original:  To address this challenge, we first revisit the frame and minislot structure of the RAN . Then, we correlate the RACH request of an IoT device with its queue status and analyze the queue evolution process . Based on the analysis result, we derive the closed-form expression of the RA success probability of the device.
Revised:  To address this challenge, we first revisit the frame and minislot structure of the RAN . Then, we correlate the RACH request of an IoT device with its queue status and analyze the evolution of the queue status . Based on the analysis result, we derive the closed-form expression of the RA success probability of the device.
Edit intent: clarity
Original:  To address this challenge, we first revisit the frame and minislot structure of the RAN . Then, we correlate the RACH request of an IoT device with its queue status and analyze the queue evolution process . Based on the analysis result, we derive the closed-form expression of the RA success probability of the device.
Revised:  To address this challenge, we first revisit the frame and minislot structure of the RAN . Then, we correlate the RACH request of an IoT device with its queue status and analyze the queue evolution process . Based on the analysis result, we derive the closed-form expression of the random access (RA) success probability of the device.
Edit intent: clarity
Original:  Besides, considering the agreement on converging different services onto a shared infrastructure, we further investigate the RAN slicing for mIoT and bursty ultra-reliable and low latency communications (URLLC) service multiplexing.
Revised:  Besides, considering the agreement on converging different services onto a shared infrastructure, we investigate the RAN slicing for mIoT and bursty ultra-reliable and low latency communications (URLLC) service multiplexing.
Edit intent: clarity
Original:  Specifically, we formulate the RAN slicing problem as an optimization one aiming at optimally orchestrating RAN resources for mIoT slices and bursty URLLC slices to maximize the RA success probability and energy-efficiently satisfy bursty URLLC slices' quality-of-service (QoS) requirements .
Revised:  Specifically, we formulate the RAN slicing problem as an optimization one to maximize the RA success probability and energy-efficiently satisfy bursty URLLC slices' quality-of-service (QoS) requirements .
Edit intent: clarity
Original:  However, modelling of the dynamic process of RACH of massive IoT devices is challenging.
Revised:  However, the theoretical analysis of the RACH procedure for massive IoT devices is challenging.
Edit intent: clarity
Original:  Then, we correlate the RACH request of an IoT device with its queue status and analyze the evolution of the queue status.
Revised:  Then, we correlate the RACH request of an IoT device with the status of its maintained queue and analyze the evolution of the queue status.
Edit intent: clarity
Original: This article is about synchronized iterative voting in the context of Approval Voting .
Revised: We consider synchronized iterative voting in the context of Approval Voting .
Edit intent: clarity
Original:  Assuming that, before an election, successive polls occur to which voters react strategically, we shall exhibit examples showing the possibility of cycles with strong negative properties (in particular, non election of an existing Condorcet winner, or possible election of a candidate strongly rejected by a majority of the electorate).
Revised:  Assuming that, before an election, successive polls occur to which voters react strategically, we shall exhibit examples showing the possibility of cycles with strong negative properties (in particular, non election of an existing Condorcet winner, or that can even lead to the election of a candidate strongly rejected by a majority of the electorate).
Edit intent: clarity
Original:  Assuming that, before an election, successive polls occur to which voters react strategically, we shall exhibit examples showing the possibility of cycles with strong negative properties (in particular, non election of an existing Condorcet winner, or possible election of a candidate strongly rejected by a majority of the electorate).
Revised:  Assuming that, before an election, successive polls occur to which voters react strategically, we shall exhibit examples showing the possibility of cycles with strong negative properties (in particular, non election of an existing Condorcet winner, or possible election of a ''consensual loser'', rejected in all circumstances by a majority of the electorate).
Edit intent: clarity
Original:  In this perspective piece we draw attention to an important and under-addressed source of uncertainty in our predictions --- that of uncertainty in the model structure or the equations themselves.
Revised:  In this perspective piece we draw attention to an important and under-addressed source of uncertainty in our predictions -- that of uncertainty in the model structure or the equations themselves.
Edit intent: fluency
Original:  A network design framework for s-t functions is describe , and the design of temporal neural networks, a form of spiking neural networks, is discussed as an extended case study.
Revised:  A network design framework for s-t functions is described , and the design of temporal neural networks, a form of spiking neural networks, is discussed as an extended case study.
Edit intent: fluency
Original:  Our results shows that subfields impact is an important factor accounting for journals visibility.
Revised:  Our results show that subfields impact is an important factor accounting for journals visibility.
Edit intent: fluency
Original:  In particular, we argue that two approaches, CP-IN and CP-EX,  should be preferred in bibliometric studies because they consider the complete citation distribution.
Revised:  In particular, we introduce two approaches, CP-IN and CP-EX, should be preferred in bibliometric studies because they consider the complete citation distribution.
Edit intent: clarity
Original:  In particular, we argue that two approaches, CP-IN and CP-EX,  should be preferred in bibliometric studies because they consider the complete citation distribution.
Revised:  In particular, we argue that two approaches, CP-IN and CP-EX, that should be preferred in bibliometric studies because they consider the complete citation distribution.
Edit intent: fluency
Original:  However, the increasingly sophisticated uses of typeclasses within proof assistants has exposed two critical problems with existing typeclass resolution procedures : the diamond problem, which causes exponential running times in both theory and practice, and the cycle problem, which causes loops in the presence of cycles and so thwarts many desired uses of typeclasses .
Revised:  However, the increasingly sophisticated uses of typeclasses within proof assistants has exposed two critical problems with existing typeclass resolution procedures : the diamond problem, which causes exponential running times in the presence of diamonds and divergence in the presence of cycles and so thwarts many desired uses of typeclasses .
Edit intent: clarity
Original:  However, the increasingly sophisticated uses of typeclasses within proof assistants has exposed two critical problems with existing typeclass resolution procedures : the diamond problem, which causes exponential running times in both theory and practice, and the cycle problem, which causes loops in the presence of cycles and so thwarts many desired uses of typeclasses .
Revised:  However, the increasingly sophisticated uses of typeclasses within proof assistants has exposed two critical problems with existing typeclass resolution procedures : the diamond problem, which causes exponential running times in both theory and practice, and the cycle problem, which causes loops in the presence of cycles .
Edit intent: coherence
Original:  We present a new typeclass resolution procedure, called tabled typeclass resolution, that solves these problems .
Revised:  We present a new procedure, tabled typeclass resolution, that solves these problems .
Edit intent: clarity
Original:  We have implemented our procedure for the upcoming version (v4) of the LeanTheorem Prover, and we confirm empirically that our implementation is exponentially faster than existing systems in the presence of diamonds.
Revised:  We have implemented our procedure for the upcoming version (v4) of Lean, and have confirmed empirically that our implementation is exponentially faster than existing systems in the presence of diamonds.
Edit intent: clarity
Original:  The adoption of CT changed the trust landscape , with logs too maintaining their own root lists and only logging certificates that chain back to one of their roots.
Revised:  The adoption of CT changed the trust landscape . As a part of this change, CT logs started to maintain their own root lists and only logging certificates that chain back to one of their roots.
Edit intent: coherence
Original:  The adoption of CT changed the trust landscape , with logs too maintaining their own root lists and only logging certificates that chain back to one of their roots.
Revised:  The adoption of CT changed the trust landscape , with logs too maintaining their own root lists and log certificates that chain back to one of their roots.
Edit intent: clarity
Original:  The adoption of CT changed the trust landscape , with logs too maintaining their own root lists and only logging certificates that chain back to one of their roots.
Revised:  The adoption of CT changed the trust landscape , with logs too maintaining their own root lists and only logging certificates that chain back to one of the trusted roots.
Edit intent: clarity
Original:  In this paper, we present a first characterization of this emerging CT root store landscape, as well as the tool that we developed for data collection, visualization, and analysis of the root stores.
Revised:  In this paper, we present the first characterization of this emerging CT root store landscape, as well as the tool that we developed for data collection, visualization, and analysis of the root stores.
Edit intent: fluency
Original:  As part of our characterization, we compare the logs' root stores and quantify their changes with respect to both each other and the root stores of major software vendors, look at evolving vendor CT policies, and show that root store mismanagement may be linked to log misbehavior.
Revised:  We compare the logs' root stores and quantify their changes with respect to both each other and the root stores of major software vendors, look at evolving vendor CT policies, and show that root store mismanagement may be linked to log misbehavior.
Edit intent: clarity
Original:  We obtain a family of VASS in dimension ~ 3 whose shortest reachability witnessing runs are exponential, and we show that the reachability problem is %DIFDELCMD < \np%%% -hard in dimension ~ 7.
Revised:  We obtain a family of VASS in dimension 3 whose shortest reachability witnessing runs are exponential, and we show that the reachability problem is %DIFDELCMD < \np%%% -hard in dimension ~ 7.
Edit intent: fluency
Original:  \ in LICS 2015 and Englert et al.
Revised:  in LICS 2015 and Englert et al.
Edit intent: fluency
Original:  \ in LICS 2016, and contribute a first construction that distinguishes 3-dimensional flat VASS from 2-dimensional VASS.
Revised:  in LICS 2016, and contribute a first construction that distinguishes 3-dimensional flat VASS from 2-dimensional VASS.
Edit intent: clarity
Original:  The smallest dimension for which this was previously known is ~ 14.
Revised:  The smallest dimension for which this was previously known is 14.
Edit intent: clarity
Original: In this paper, we introduce the NER dataset from CLUE organization (CLUENER2020), a well-defined fine-grained dataset for name entity recognition in Chinese.
Revised: In this paper, we introduce the NER dataset from CLUE organization (CLUENER2020), a well-defined fine-grained dataset for named entity recognition in Chinese.
Edit intent: fluency
Original:  Apart from common labels like person, organization  and location, it contains more diverse categories.
Revised:  Apart from common labels like person, organization , and location, it contains more diverse categories.
Edit intent: fluency
Original:  For comparison, we implement several state-of-the-art baselines as sequence labelling tasks and report human performance, as well as its analysis.
Revised:  For comparison, we implement several state-of-the-art baselines as sequence labeling tasks and report human performance, as well as its analysis.
Edit intent: fluency
Original:  To facilitate future work on fine-grained NER for Chinese, we release our dataset, baselines  and leader-board.
Revised:  To facilitate future work on fine-grained NER for Chinese, we release our dataset, baselines , and leader-board.
Edit intent: fluency
Original: The joint bidiagonalization(JBD) process is a useful algorithm for the computation of the generalized singular value decomposition(GSVD) of a matrix pair A,L . However, it always suffers from rounding errors, which causes the Lanczos vectors to loss their mutual orthogonality.
Revised: The joint bidiagonalization(JBD) process is a useful algorithm for the computation of the generalized singular value decomposition(GSVD) of a matrix pair . However, it always suffers from rounding errors, which causes the Lanczos vectors to loss their mutual orthogonality.
Edit intent: coherence
Original:  Our rounding error analysis shows that the JBD process with  semiorthogonalization strategy can ensure that the convergence of the computed quantities is not affected by rounding errors and the final accuracy is high enough.
Revised:  Our rounding error analysis shows that the JBD process with the semiorthogonalization strategy can ensure that the convergence of the computed quantities is not affected by rounding errors and the final accuracy is high enough.
Edit intent: fluency
Original:  In the JBDPRO algorithm, reorthogonalizations occur only when necessary, which saves a big amount of reorthogonalization work compared with the full reorthogonalization method .
Revised:  In the JBDPRO algorithm, reorthogonalizations occur only when necessary, which saves a big amount of reorthogonalization work compared with the full reorthogonalization strategy .
Edit intent: clarity
Original: Assessment of many audio processing tasks relies on subjective evaluation which is time-consuming and expensive.
Revised: Many audio processing tasks relies on subjective evaluation which is time-consuming and expensive.
Edit intent: clarity
Original:  In this work, we construct a differentiable metric by fitting a deep neural network on a newly collected dataset of just-noticeable differences (JND), in which humans annotate whether a pair of audio clips are identical or not .
Revised:  In this work, we construct a metric by fitting a deep neural network on a newly collected dataset of just-noticeable differences (JND), in which humans annotate whether a pair of audio clips are identical or not .
Edit intent: clarity
Original:  In this work, we construct a differentiable metric by fitting a deep neural network on a newly collected dataset of just-noticeable differences (JND), in which humans annotate whether a pair of audio clips are identical or not .
Revised:  In this work, we construct a differentiable metric by fitting a deep neural network to a new large dataset of crowdsourced human judgments. Subjects are prompted to answer a straightforward, objective question: are two recordings identical or not .
Edit intent: clarity
Original:  We find that simply replacing an existing loss  with our metric yields significant improvement in denoising as measured by subjective pairwise comparison.
Revised:  We find that simply replacing an existing loss with our metric yields significant improvement in a denoising network, as measured by subjective pairwise comparison.
Edit intent: clarity
Original: We present an unsupervised approach that enables us to convert the speech input of any one individual to an output set of potentially-infinitely many speakers.
Revised: We present an unsupervised approach that enables us to convert the speech input of potentially-infinitely many speakers.
Edit intent: clarity
Original:  Our approach builds on simple autoencoders that project out-of-sample data to the distribution of the training set (motivated by PCA/linear autoencoders) .
Revised:  Our approach builds on simple autoencoders that project out-of-sample data onto the distribution of the training set (motivated by PCA/linear autoencoders) .
Edit intent: fluency
Original:  Our approach builds on simple autoencoders that project out-of-sample data to the distribution of the training set (motivated by PCA/linear autoencoders) .
Revised:  Our approach builds on simple autoencoders that project out-of-sample data to the distribution of the training set .
Edit intent: coherence
Original:  We use an exemplar autoencoder to learn the voice and specific style (emotions and ambiance) of a target speaker .
Revised:  We use Exemplar Autoencoders to learn the voice and specific style (emotions and ambiance) of a target speaker .
Edit intent: fluency
Original:  We use an exemplar autoencoder to learn the voice and specific style (emotions and ambiance) of a target speaker .
Revised:  We use an exemplar autoencoder to learn the voice , stylistic prosody, and visual appearance of a specific target exemplar speech .
Edit intent: clarity
Original:  We suggest the reader to check out our project webpage for various synthesized examples:{\em   URL
Revised:  We suggest the reader to check out our project webpage for various synthesized examples:{\em any URL
Edit intent: fluency
Original:  Those random variables have some important applications for populations  under some seed bank effects, such as plants and bacteria, and for some cases of structured populations ;
Revised:  Those random variables have important applications for populations under some seed bank effects, such as plants and bacteria, and for some cases of structured populations ;
Edit intent: fluency
Original:  Those random variables have some important applications for populations  under some seed bank effects, such as plants and bacteria, and for some cases of structured populations ;
Revised:  Those random variables have some important applications for populations evolving under some seed bank effects, such as plants and bacteria, and for some cases of structured populations ;
Edit intent: clarity
Original:  Those random variables have some important applications for populations  under some seed bank effects, such as plants and bacteria, and for some cases of structured populations ;
Revised:  Those random variables have some important applications for populations under some seed bank effects, such as plants and bacteria, and for some cases of structured populations like
Edit intent: fluency
Original:  We are also able to give conditional sampling formulas on the random partition and we manage to study the system at the time of the first deactivation of a lineage.
Revised:  We also give conditional sampling formulas on the random partition and we manage to study the system at the time of the first deactivation of a lineage.
Edit intent: coherence
Original:  We are also able to give conditional sampling formulas on the random partition and we manage to study the system at the time of the first deactivation of a lineage.
Revised:  We are also able to give conditional sampling formulas for the random partition and we manage to study the system at the time of the first deactivation of a lineage.
Edit intent: fluency
Original:  We are also able to give conditional sampling formulas on the random partition and we manage to study the system at the time of the first deactivation of a lineage.
Revised:  We are also able to give conditional sampling formulas on the random partition and we study the system at the time of the first deactivation of a lineage.
Edit intent: coherence
Original:  First, the related work and paper contributions are discussed, followed by providing the necessary background on data-driven approaches and machine learning for non-machine learning experts . for non-machine learning experts to understand all discussed techniques.
Revised:  First, the related work and paper contributions are discussed, followed by providing the necessary background on data-driven approaches and machine learning for non-machine learning experts to understand all discussed techniques.
Edit intent: fluency
Original:  Specifically, we develop algorithms that produce confidence intervals for linear forms of individual eigenvectors, based on eigen-decomposition of the asymmetric data matrix followed by a careful de-biasing scheme .
Revised:  Based on eigen-decomposition of the asymmetric data matrix followed by a careful de-biasing scheme .
Edit intent: coherence
Original:  Along the way, we establish  procedures to construct optimal confidence intervals for the eigenvalues of interest .
Revised:  Along the way, we establish optimal procedures to construct optimal confidence intervals for the eigenvalues of interest .
Edit intent: fluency
Original:  Along the way, we establish  procedures to construct optimal confidence intervals for the eigenvalues of interest .
Revised:  Along the way, we establish procedures to construct confidence intervals for the eigenvalues of interest .
Edit intent: clarity