wanyu/IteraTeR_v2 huggingface dataset:
Original:  Focusing on the middle levels that sit between end users and a centralized governance system, we describe how middle level units, such as subreddits, YouTube channels, and Twitter blocklists,  interact with one another and with levels above and below.
Revised:  Focusing on the middle levels that sit between end users and a centralized governance system, we describe how middle level units, such as subreddits, Twitter blocklists, interact with one another and with levels above and below.
Edit intent: clarity
Original:  Focusing on the middle levels that sit between end users and a centralized governance system, we describe how middle level units, such as subreddits, YouTube channels, and Twitter blocklists,  interact with one another and with levels above and below.
Revised:  Focusing on the middle levels that sit between end users and a centralized governance system, we describe how middle level units, such as subreddits, YouTube channels, and Twitter blocklists, interact with one another and with a centralized governance system above and end users below.
Edit intent: clarity
Original:  As not all aspects of offline institutions translate directly to the onlinerealm , we discuss challenges unique to online governance and lay out a research agenda for the future study of multi-level governance design in online social platforms.
Revised:  As not all aspects of offline institutions translate online , we discuss challenges unique to online governance and lay out a research agenda for the future study of multi-level governance design in online social platforms.
Edit intent: clarity
Original:  As not all aspects of offline institutions translate directly to the onlinerealm , we discuss challenges unique to online governance and lay out a research agenda for the future study of multi-level governance design in online social platforms.
Revised:  As not all aspects of offline institutions translate directly to the onlinerealm , we discuss challenges unique to online governance and conclude with implications for decentralized governance design in online social platforms.
Edit intent: clarity
Original:  We compare ThresholdNet with other different networks for FLOPs and memory usage, and the experiments show that ThresholdNet is 70\% less memory than that of the original DenseNet .
Revised:  We evaluate ThresholdNet and other different networks for FLOPs and memory usage, and the experiments show that ThresholdNet is 70\% less memory than that of the original DenseNet .
Edit intent: clarity
Original:  For the highly symmetric class of Equiangular Tight Frames (ETF), as well as for other "near ETF" frames , we show that the empirical eigenvalue distribution  of a randomly-selected sub-frame  (i)  is asymptotically indistinguishable from Wachter's MANOVA distribution;
Revised:  Within the highly symmetric class of Equiangular Tight Frames (ETF), as well as for other "near ETF" frames , we show that the empirical eigenvalue distribution of a randomly-selected sub-frame (i) is asymptotically indistinguishable from Wachter's MANOVA distribution;
Edit intent: fluency
Original:  For the highly symmetric class of Equiangular Tight Frames (ETF), as well as for other "near ETF" frames , we show that the empirical eigenvalue distribution  of a randomly-selected sub-frame  (i)  is asymptotically indistinguishable from Wachter's MANOVA distribution;
Revised:  For the highly symmetric class of Equiangular Tight Frames (ETF), as well as other "near ETF" frames , we show that the empirical eigenvalue distribution of a randomly-selected sub-frame (i) is asymptotically indistinguishable from Wachter's MANOVA distribution;
Edit intent: fluency
Original:  For the highly symmetric class of Equiangular Tight Frames (ETF), as well as for other "near ETF" frames , we show that the empirical eigenvalue distribution  of a randomly-selected sub-frame  (i)  is asymptotically indistinguishable from Wachter's MANOVA distribution;
Revised:  For the highly symmetric class of Equiangular Tight Frames (ETF), as well as for other "near ETF" families , we show that the empirical eigenvalue distribution of a randomly-selected sub-frame (i) is asymptotically indistinguishable from Wachter's MANOVA distribution;
Edit intent: clarity
Original:  For the highly symmetric class of Equiangular Tight Frames (ETF), as well as for other "near ETF" frames , we show that the empirical eigenvalue distribution  of a randomly-selected sub-frame  (i)  is asymptotically indistinguishable from Wachter's MANOVA distribution;
Revised:  For the highly symmetric class of Equiangular Tight Frames (ETF), as well as for other "near ETF" frames , we show that the empirical eigenvalue distribution of a randomly-selected sub-frame : (i) is asymptotically indistinguishable from Wachter's MANOVA distribution;
Edit intent: fluency
Original:  and (ii) exhibits a universal convergence rate to this limit that is empirically indistinguishable from that of a matrix sequence drawn from MANOVA (Jacobi) ensembles of corresponding dimensions.
Revised:  and (ii) it exhibits a convergence rate to this limit that is empirically indistinguishable from that of a matrix sequence drawn from MANOVA (Jacobi) ensembles of corresponding dimensions.
Edit intent: clarity
Original:  and (ii) exhibits a universal convergence rate to this limit that is empirically indistinguishable from that of a matrix sequence drawn from MANOVA (Jacobi) ensembles of corresponding dimensions.
Revised:  and (ii) exhibits a universal convergence rate to this limit that is indistinguishable from that of a matrix sequence drawn from MANOVA (Jacobi) ensembles of corresponding dimensions.
Edit intent: clarity
Original:  Some of these results are shown via careful statistical analysis of empirical evidence, and some are proved analytically using random matrix theory arguments of independent interest.
Revised:  Some of these results follow from careful statistical analysis of empirical evidence, and some are proved analytically using random matrix theory arguments of independent interest.
Edit intent: clarity
Original:  This result is 6.8\% higher top-1 accuracy and 33\% relatively smaller model size than the current state-of-the-art DNN compression algorithms.
Revised:  This result is 6.8\% higher top-1accuracy and 33\% relatively smaller model size than the current state-of-the-art DNN compression algorithms.
Edit intent: fluency
Original: Event extraction (EE) , the task that identifies event triggers and their arguments in text, is usually formulated as a classification or structured prediction problem.
Revised: Event extraction (EE) aims to identify structured events, including event triggers and their arguments in text, is usually formulated as a classification or structured prediction problem.
Edit intent: clarity
Original:  Data from 9,633 respondents revealed seven Creative Species , or clusters of people with combinations of creative habits that tend to co-occur more than expected by chance.
Revised:  Data from 9,633 respondents revealed seven 'Creative Species' , or clusters of people with combinations of creative habits that tend to co-occur more than expected by chance.
Edit intent: fluency
Original:  The seven Creative Species self-sorted along a primary gradient from those characterized by more deliberate creative habits (e.g., Monotasker, Risk Averse, Routine Seeker, Tenacious, Make it Happen) to those characterized by more open creative habits (e.g. Multitasker, Risk Friendly, Novelty Seeker, Reframer, Let it Happen).
Revised:  The seven Creative Species self-sorted along a primary gradient from those characterized by more 'deliberate' creative habits (e.g., Monotasker, Risk Averse, Routine Seeker, Tenacious, Make it Happen) to those characterized by more open creative habits (e.g. Multitasker, Risk Friendly, Novelty Seeker, Reframer, Let it Happen).
Edit intent: fluency
Original:  The seven Creative Species self-sorted along a primary gradient from those characterized by more deliberate creative habits (e.g., Monotasker, Risk Averse, Routine Seeker, Tenacious, Make it Happen) to those characterized by more open creative habits (e.g. Multitasker, Risk Friendly, Novelty Seeker, Reframer, Let it Happen).
Revised:  The seven Creative Species self-sorted along a primary gradient from those characterized by more deliberate creative habits (e.g., Monotasker, Risk Averse, Routine Seeker, Tenacious, Make it Happen) to those characterized by more 'open' creative habits (e.g. Multitasker, Risk Friendly, Novelty Seeker, Reframer, Let it Happen).
Edit intent: clarity
Original:  More precisely, we construct a bijective transformation (a normalizing flow characterizing by neural networks) between a reference random field (say, a Gaussian random field with the Karhunen-Lo\`eve expansion structure) and the target stochastic field, where the KL expansion coefficients and the invertible networks are trained by maximizing the sum of the log-likelihood on scattered measurements.
Revised:  More precisely, we construct a bijective transformation (a normalizing flow characterizing by neural networks) between a Gaussian random field with the Karhunen-Lo\`eve expansion structure) and the target stochastic field, where the KL expansion coefficients and the invertible networks are trained by maximizing the sum of the log-likelihood on scattered measurements.
Edit intent: clarity
Original:  More precisely, we construct a bijective transformation (a normalizing flow characterizing by neural networks) between a reference random field (say, a Gaussian random field with the Karhunen-Lo\`eve expansion structure) and the target stochastic field, where the KL expansion coefficients and the invertible networks are trained by maximizing the sum of the log-likelihood on scattered measurements.
Revised:  More precisely, we construct a bijective transformation (a normalizing flow characterizing by neural networks) between a reference random field (say, a Gaussian random field with the Karhunen-Lo\`eve (KL) expansion structure and the target stochastic field, where the KL expansion coefficients and the invertible networks are trained by maximizing the sum of the log-likelihood on scattered measurements.
Edit intent: clarity
Original:  We demonstrate the capability of the proposed NFF model for learning Non Gaussian processes , mixed Gaussian processes, and forward inverse stochastic partial differential equations.
Revised:  We demonstrate the capability of the proposed NFF model for learning Non Gaussian processes inverse stochastic partial differential equations.
Edit intent: clarity
Original:  This report is the extended version of a paper with the same title accepted for CALCO 2021.
Revised:  This report is the extended version of a paper with the same title presented at CALCO 2021.
Edit intent: clarity
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], a ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0], ] ..., z ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Edit intent: fluency
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], 1] ..., a[ l ]} and minimal extra-super increasing sequence {z[0], ] ..., z ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Edit intent: fluency
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], ], ..., a[ l ]} and minimal extra-super increasing sequence {z[0], ] ..., z ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Edit intent: fluency
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], ] ..., a[ n ]} and minimal extra-super increasing sequence {z[0], ] ..., z ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Edit intent: fluency
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0], z ] ..., z ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Edit intent: fluency
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0], 1] ..., z ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Edit intent: fluency
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0], ], ..., z ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Edit intent: fluency
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0], ] ..., z ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Edit intent: fluency
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0], ] ..., z n ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Edit intent: fluency
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0], ] ..., z ] }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Edit intent: fluency
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0], ] ..., z ] l }. Find that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Edit intent: fluency
Original: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0],  ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0],  ] ..., z  ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision able to be expressed by computers .
Revised: In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], ] ..., a[ l ]} and minimal extra-super increasing sequence {z[0], ] ..., z ] l }. Discover that there always exists a fit n which makes (z[n] / z[n-1] - a[n] / a[n-1])= PHI, where PHI is the golden ratio conjugate with a finite precision in the range of computer expression .
Edit intent: clarity
Original:  Experiments demonstrate that the approach to radic(5) through a term ratio difference is more smooth and expeditious than through a Taylor power series, and convince the authors that lim  n to infinity  (z[n] / z[n-1] - a[n] / a[n-1]) = PHI holds.
Revised:  Experiments demonstrate that the approach to radic(5) through a term ratio difference is more smooth and expeditious than through a Taylor power series, and convince the authors that lim ( n to infinity (z[n] / z[n-1] - a[n] / a[n-1]) = PHI holds.
Edit intent: fluency
Original:  Experiments demonstrate that the approach to radic(5) through a term ratio difference is more smooth and expeditious than through a Taylor power series, and convince the authors that lim  n to infinity  (z[n] / z[n-1] - a[n] / a[n-1]) = PHI holds.
Revised:  Experiments demonstrate that the approach to radic(5) through a term ratio difference is more smooth and expeditious than through a Taylor power series, and convince the authors that lim n to infinity ) (z[n] / z[n-1] - a[n] / a[n-1]) = PHI holds.
Edit intent: fluency
Original:  Referred to as the Deep Q-Learning Energy-optimized LoS/NLoS (DQLEL) UWB node selection framework, the mobile user is autonomously trained to determine the optimal pair of UWB beacons to be localized based on the 2-D Time Difference of Arrival (TDoA) framework.
Revised:  Referred to as the Deep Q-Learning Energy-optimized LoS/NLoS (DQLEL) UWB node selection framework, the mobile user is autonomously trained to determine the optimal set of UWB beacons to be localized based on the 2-D Time Difference of Arrival (TDoA) framework.
Edit intent: clarity
Original:  Duty cycle methods reduce the energy consumption of wireless sensor networks since the energy consumption declines in the sleep mode.
Revised:  Duty cycle methods reduce the energy consumption of wireless sensor networks since energy consumption declines in the sleep mode.
Edit intent: clarity