wanyu/IteraTeR_v2 huggingface dataset:
Original:  We go over quaternion convolutions, present a quaternion weight initialization scheme, and present algorithms for quaternion batch-normalization.
Revised:  We go over quaternion convolutions, present a quaternion weight initialization scheme, and developing novel algorithms for quaternion batch-normalization.
Edit intent: clarity
Original:  The quaternion networks show improved convergence compared to real-valued and complex-valued networks, especially on the segmentation task .
Revised:  These quaternion networks show improved convergence compared to real-valued and complex-valued networks, especially on the segmentation task .
Edit intent: fluency
Original: Frustration index is a key measure for analysing signed networks that has been underused due to its computational complexity.
Revised: The frustration index is a key measure for analysing signed networks that has been underused due to its computational complexity.
Edit intent: fluency
Original: Frustration index is a key measure for analysing signed networks that has been underused due to its computational complexity.
Revised: Frustration index is a key measure for analysing signed networks , which has been underused due to its computational complexity.
Edit intent: fluency
Original:  We provide exact numerical results on social and biological signed networks as well as networks of formal alliances and antagonisms between countries  and financial portfolio networks.
Revised:  We provide exact numerical results on social and biological signed networks , networks of formal alliances and antagonisms between countries and financial portfolio networks.
Edit intent: coherence
Original:  We provide exact numerical results on social and biological signed networks as well as networks of formal alliances and antagonisms between countries  and financial portfolio networks.
Revised:  We provide exact numerical results on social and biological signed networks as well as networks of formal alliances and antagonisms between countries , and financial portfolio networks.
Edit intent: fluency
Original:  Finallysome numerical results showing efficiency of the proposed approach are presented.
Revised:  Finallysome numerical results showing efficiency of the proposed approach is presented.
Edit intent: fluency
Original:  Finally, a simulation study showing the numerical efficiency of the proposed approach is presented.
Revised:  Finally, a simulation study showing numerical efficiency of the proposed approach is presented.
Edit intent: fluency
Original:  We discuss several possibilities of constructing zero mean control functionals and present non-asymptotic error bounds for the variance reduced Monte Carlo estimates.
Revised:  We discuss several possibilities of constructing zero mean control functionals and present non-asymptotic bounds for the variance reduced Monte Carlo estimates.
Edit intent: clarity
Original: This paper proposes XML-Defined Network policies (XDNP) a new high level language based on XML notation  to describe network control rules in Software Defined Network environments.
Revised: This paper proposes XML-Defined Network policies (XDNP) , a new high-level language based on XML notation to describe network control rules in Software Defined Network environments.
Edit intent: fluency
Original: This paper proposes XML-Defined Network policies (XDNP) a new high level language based on XML notation  to describe network control rules in Software Defined Network environments.
Revised: This paper proposes XML-Defined Network policies (XDNP) a new high level language based on XML notation , to describe network control rules in Software Defined Network environments.
Edit intent: fluency
Original: A unified treatment for fast and spectrally accurate evaluation of electrostatic potentials subject to periodic boundary conditions in any or none of the three space dimensions is presented.
Revised: A unified treatment for fast and spectrally accurate evaluation of electrostatic potentials subject to periodic boundary conditions in any or none of the three spatial dimensions is presented.
Edit intent: fluency
Original:  Ewald decomposition is used to split the problem into a real space and a Fourier space part, and the FFT based Spectral Ewald (SE) method is used to accelerate the computation of the latter.
Revised:  Ewald decomposition is used to split the problem into a real-space and a Fourier-space part, and the FFT based Spectral Ewald (SE) method is used to accelerate the computation of the latter.
Edit intent: fluency
Original:  Ewald decomposition is used to split the problem into a real space and a Fourier space part, and the FFT based Spectral Ewald (SE) method is used to accelerate the computation of the latter.
Revised:  Ewald decomposition is used to split the problem into a real space and a Fourier space part, and the FFT-based Spectral Ewald (SE) method is used to accelerate the computation of the latter.
Edit intent: fluency
Original:  A key component in the unified treatment is an FFT based solution technique for the free-space Poisson problem in three, two or one dimensions, depending on the number of non-periodic directions.
Revised:  A key component in the unified treatment is an FFT-based solution technique for the free-space Poisson problem in three, two or one dimensions, depending on the number of non-periodic directions.
Edit intent: fluency
Original:  The cost of calculations is furthermore reduced by employing an adaptive FFT for the doubly and singly periodic cases, allowing for different local upsampling rates .
Revised:  The computational cost is furthermore reduced by employing an adaptive FFT for the doubly and singly periodic cases, allowing for different local upsampling rates .
Edit intent: clarity
Original:  The cost of calculations is furthermore reduced by employing an adaptive FFT for the doubly and singly periodic cases, allowing for different local upsampling rates .
Revised:  The cost of calculations is furthermore reduced by employing an adaptive FFT for the doubly and singly periodic cases, allowing for different local upsampling factors .
Edit intent: clarity
Original:  The SE method will always be most efficient for the triply periodic case as the cost for computing FFTs will  be the smallest, whereas the computational cost for the rest of the algorithm is essentially independent of the periodicity.
Revised:  The SE method will always be most efficient for the triply periodic case as the cost of computing FFTs will be the smallest, whereas the computational cost for the rest of the algorithm is essentially independent of the periodicity.
Edit intent: fluency
Original:  The SE method will always be most efficient for the triply periodic case as the cost for computing FFTs will  be the smallest, whereas the computational cost for the rest of the algorithm is essentially independent of the periodicity.
Revised:  The SE method will always be most efficient for the triply periodic case as the cost for computing FFTs will be the smallest, whereas the computational cost of the rest of the algorithm is essentially independent of the periodicity.
Edit intent: fluency
Original:  The SE method will always be most efficient for the triply periodic case as the cost for computing FFTs will  be the smallest, whereas the computational cost for the rest of the algorithm is essentially independent of the periodicity.
Revised:  The SE method will always be most efficient for the triply periodic case as the cost for computing FFTs will be the smallest, whereas the computational cost for the rest of the algorithm is essentially independent of periodicity.
Edit intent: fluency
Original:  We show that the cost of removing periodic boundary conditions from one or two directions out of three will only marginally increase the total run time .
Revised:  We show that the cost of removing periodic boundary conditions from one or two directions out of three will only moderately increase the total run time .
Edit intent: clarity
Original:  We show that the cost of removing periodic boundary conditions from one or two directions out of three will only marginally increase the total run time .
Revised:  We show that the cost of removing periodic boundary conditions from one or two directions out of three will only marginally increase the total runtime .
Edit intent: clarity
Original:  Our comparisons also show that the computational cost of the SE method for the free-space case is typically about four times more expensive as compared to the triply periodic case.
Revised:  Our comparisons also show that the computational cost of the SE method in the free-space case is typically about four times more expensive as compared to the triply periodic case.
Edit intent: fluency
Original:  Our comparisons also show that the computational cost of the SE method for the free-space case is typically about four times more expensive as compared to the triply periodic case.
Revised:  Our comparisons also show that the computational cost of the SE method for the free-space case is around four times that of the triply periodic case.
Edit intent: clarity
Original:  The Gaussian window function previously used in the SE method, is here compared to an approximation of the Kaiser-Bessel window function , recently introduced .
Revised:  The Gaussian window function previously used in the SE method, is here compared to an approximation of the Kaiser-Bessel window function .
Edit intent: clarity
Original:  In particular the framework facilitates assembling several long-running computations and producing various plots as a result of these computations.
Revised:  In particular the framework facilitates assembling several long-running computations and producing various plots from the data produced by these computations.
Edit intent: clarity
Original:  The framework has been used to write a research paper in the area of numerical computing.
Revised:  The framework has been used to write research papers in numerical computing.
Edit intent: clarity
Original:  This paper discusses the benefits of such a system both for the researcher and to the research area in general .
Revised:  This paper discusses the design of the framework, and the benefits of using it. The ideas presented are general and should help researchers organize their computations for better reproducibility .
Edit intent: coherence
Original:  For increasingly common large network data sets, global community detection is prohibitively expensive, and attention has shifted to methods that mine local communities, i.e. methods that identify all latent members of a particular community from a few labeled seed members.
Revised:  For increasingly common large network data sets, global community detection is prohibitively expensive, and attention has shifted to methods that mine local communities, i.e. identifying all latent members of a particular community from a few labeled seed members.
Edit intent: fluency
Original:  To address this semi-supervised mining task, we propose a local spectral subspace-based community detection method, called LOSP.
Revised:  To address such semi-supervised mining task, we propose a local spectral subspace-based community detection method, called LOSP.
Edit intent: clarity
Original:  To address this semi-supervised mining task, we propose a local spectral subspace-based community detection method, called LOSP.
Revised:  To address this semi-supervised mining task, we systematically develop a local spectral subspace-based community detection method, called LOSP.
Edit intent: clarity
Original:  Variants of LOSP depend on types of random walks with different diffusion speeds, regular random walk or inverse random walk , dimension of the local spectral subspace and steps of diffusions.
Revised:  Variants of LOSP depend on type of random walks with different diffusion speeds, regular random walk or inverse random walk , dimension of the local spectral subspace and steps of diffusions.
Edit intent: fluency
Original:  Variants of LOSP depend on types of random walks with different diffusion speeds, regular random walk or inverse random walk , dimension of the local spectral subspace and steps of diffusions.
Revised:  Variants of LOSP depend on types of random walks with different diffusion speeds, type of random walks , dimension of the local spectral subspace and steps of diffusions.
Edit intent: clarity
Original:  Variants of LOSP depend on types of random walks with different diffusion speeds, regular random walk or inverse random walk , dimension of the local spectral subspace and steps of diffusions.
Revised:  Variants of LOSP depend on types of random walks with different diffusion speeds, regular random walk or inverse random walk , dimension of the local spectral subspace and step of diffusions.
Edit intent: fluency
Original:  The effectiveness of the proposed LOSP approach is theoretically analyzed based on Rayleigh quotients, and  is experimentally verified on a wide variety of real-world networks across social, production and biological domains, as well as on an extensive set of synthetic LFR benchmark datasets.
Revised:  The effectiveness of the proposed LOSP approach is theoretically analyzed based on Rayleigh quotients, and it is experimentally verified on a wide variety of real-world networks across social, production and biological domains, as well as on an extensive set of synthetic LFR benchmark datasets.
Edit intent: coherence
Original:  It is known that there is no pseudo-polynomial algorithm for Strip Packing with a ratio better than 5/4 unless P = NP . The best algorithm so far has a ratio of  4/3 + \varepsilon  .
Revised:  It is known that there is no pseudo-polynomial algorithm for Strip Packing with a ratio better than 5/4 unless P = NP . The best algorithm so far has a ratio of ( 4/3 + \varepsilon .
Edit intent: fluency
Original:  It is known that there is no pseudo-polynomial algorithm for Strip Packing with a ratio better than 5/4 unless P = NP . The best algorithm so far has a ratio of  4/3 + \varepsilon  .
Revised:  It is known that there is no pseudo-polynomial algorithm for Strip Packing with a ratio better than 5/4 unless P = NP . The best algorithm so far has a ratio of 4/3 + \varepsilon ) .
Edit intent: fluency
Original:  In this paper, we close this gap : We present an algorithm with approximation ratio  5/4 + \varepsilon .
Revised:  In this paper, we close this gap : We present an algorithm with approximation ratio ( 5/4 + \varepsilon .
Edit intent: fluency
Original:  This structural result applies to other problem settings as well , which enabled us to present algorithms with approximation ratio 5/4 + \varepsilon for Strip Packing with rotations (90 degrees) and Contiguous Moldable Task Scheduling  .
Revised:  This structural result applies to other problem settings as well for example to Strip Packing with rotations (90 degrees) and Contiguous Moldable Task Scheduling .
Edit intent: coherence
Original:  In stark contrast, Maximum Clique on intersection graph of filled ellipses or filled triangles is unlikely to have such algorithms, even when the ellipses are close to unit disks.
Revised:  In stark contrast, Maximum Clique on intersection graphs of filled ellipses or filled triangles is unlikely to have such algorithms, even when the ellipses are close to unit disks.
Edit intent: fluency
Original: In this paper, we consider the problem of computing the minimum area triangle that circumscribes a given n-sided convex polygon touching edge-to-edge.
Revised: We study the problem of computing the minimum area triangle that circumscribes a given n-sided convex polygon touching edge-to-edge.
Edit intent: clarity
Original:  Previously, O(n\log n) time algorithms were known which are based on the technique for computing the minimum weight k-link path given in \mbox{ kgon94,kgon95soda  By applying the new technique proposed in Jin's recent work for the dual problem of computing the maximum area triangle inside a convex polygon, we solve the problem at hand in O(n) time, thus justify Jin's claim that his technique may find applications in other polygonal inclusion problems.
Revised:  Previously, O(n\log n) time algorithms were known which are based on the technique for computing the minimum weight k-link path given in \mbox{ kgon94,kgon95soda . By applying the new technique proposed in Jin's recent work for the dual problem of computing the maximum area triangle inside a convex polygon, we solve the problem at hand in O(n) time, thus justify Jin's claim that his technique may find applications in other polygonal inclusion problems.
Edit intent: fluency
Original:  Previously, O(n\log n) time algorithms were known which are based on the technique for computing the minimum weight k-link path given in \mbox{ kgon94,kgon95soda  By applying the new technique proposed in Jin's recent work for the dual problem of computing the maximum area triangle inside a convex polygon, we solve the problem at hand in O(n) time, thus justify Jin's claim that his technique may find applications in other polygonal inclusion problems.
Revised:  Previously, O(n\log n) time algorithms were known which are based on the technique for computing the minimum weight k-link path given in \mbox{ kgon94,kgon95soda By applying the new technique proposed in Jin's recent work for the dual problem of computing the maximum area triangle inside a convex polygon, we solve the problem at hand in O(n) time, thus justify Jin's claim that his technique may find applications in other polygon inclusion problems.
Edit intent: clarity
Original:  Previously, } O(n  \log n) time algorithms were known which are based on the technique for computing the minimum weight k-link path given in [A. Aggarwal et. al. DCG94;
Revised:  Previously, } O(n \log n) time algorithms given in [A. Aggarwal et. al. DCG94;
Edit intent: coherence
Original:  Our algorithm actually computes all the local minimal area circumscribing triangles touching edge-to-edge.
Revised:  Our algorithm actually computes all the locally minimal area circumscribing triangles touching edge-to-edge.
Edit intent: fluency
Original:  This paperanalyzes the deficiencies of the state- of-the-arts algorithms and proposes a novel sub-frame-based algorithm with an adaptive frame size adjustment policy to reduce the identification time for EPCglobal C1 Gen2 UHF RFID standard  . By observing the slot statistics in a sub-frame, the tag quantity is estimated by the reader, which afterwards efficiently calculates an optimal frame size to fit the unread tags.
Revised:  This paperanalyzes the deficiencies of the state- of-the-arts algorithms and proposes a novel sub-frame-based algorithm with a time-efficient frame size adjustment policy to reduce the identification time for EPCglobal C1 Gen2 UHF RFID standard . By observing the slot statistics in a sub-frame, the tag quantity is estimated by the reader, which afterwards efficiently calculates an optimal frame size to fit the unread tags.
Edit intent: clarity
Original:  This paperanalyzes the deficiencies of the state- of-the-arts algorithms and proposes a novel sub-frame-based algorithm with an adaptive frame size adjustment policy to reduce the identification time for EPCglobal C1 Gen2 UHF RFID standard  . By observing the slot statistics in a sub-frame, the tag quantity is estimated by the reader, which afterwards efficiently calculates an optimal frame size to fit the unread tags.
Revised:  This paperanalyzes the deficiencies of the state- of-the-arts algorithms and proposes a novel sub-frame-based algorithm with an adaptive frame size adjustment strategy to reduce the identification time for EPCglobal C1 Gen2 UHF RFID standard . By observing the slot statistics in a sub-frame, the tag quantity is estimated by the reader, which afterwards efficiently calculates an optimal frame size to fit the unread tags.
Edit intent: clarity
Original:  This paperanalyzes the deficiencies of the state- of-the-arts algorithms and proposes a novel sub-frame-based algorithm with an adaptive frame size adjustment policy to reduce the identification time for EPCglobal C1 Gen2 UHF RFID standard  . By observing the slot statistics in a sub-frame, the tag quantity is estimated by the reader, which afterwards efficiently calculates an optimal frame size to fit the unread tags.
Revised:  This paperanalyzes the deficiencies of the state- of-the-arts algorithms and proposes a novel sub-frame-based algorithm with an adaptive frame size adjustment policy to reduce the time complexity for EPCglobal C1 Gen2 UHF RFID standard . By observing the slot statistics in a sub-frame, the tag quantity is estimated by the reader, which afterwards efficiently calculates an optimal frame size to fit the unread tags.
Edit intent: clarity
Original:  This paperanalyzes the deficiencies of the state- of-the-arts algorithms and proposes a novel sub-frame-based algorithm with an adaptive frame size adjustment policy to reduce the identification time for EPCglobal C1 Gen2 UHF RFID standard  . By observing the slot statistics in a sub-frame, the tag quantity is estimated by the reader, which afterwards efficiently calculates an optimal frame size to fit the unread tags.
Revised:  This paperanalyzes the deficiencies of the state- of-the-arts algorithms and proposes a novel sub-frame-based algorithm with an adaptive frame size adjustment policy to reduce the identification time for EPCglobal C1 Gen2 UHF RFID standard is proposed . By observing the slot statistics in a sub-frame, the tag quantity is estimated by the reader, which afterwards efficiently calculates an optimal frame size to fit the unread tags.
Edit intent: clarity
Original:  Only when the expected time efficiency in the calculated frame size is higher than that in the previous frame size , the reader starts the new  frame.
Revised:  Only when the expected time efficiency in the oncoming frame is higher than that in the previous frame size , the reader starts the new frame.
Edit intent: clarity
Original:  Only when the expected time efficiency in the calculated frame size is higher than that in the previous frame size , the reader starts the new  frame.
Revised:  Only when the expected time efficiency in the calculated frame size is higher than that in the previous frame , the reader starts the new frame.
Edit intent: fluency
Original:  We further propose improvements to the model that are likely to improve its performance.
Revised:  We further discuss improvements to the model that are likely to improve its performance.
Edit intent: clarity
Original: In recent years, neural networks have been used to generate music pieces, especially symbolic melody .
Revised: In recent years, neural networks have been used to generate symbolic melodies .
Edit intent: clarity
Original:  In this paper, we present a hierarchical recurrent neural network for melody generation, which consists of three Long-Short-Term-Memory (LSTM) subnetworks working in a coarse-to-fine manner  . Specifically, the three subnetworks generate bar profiles, beat profiles and notes in turn, and the output of the high-level subnetworks are fed into the low-level subnetworks, serving as guidance for generating the finer time-scale melody components  .
Revised:  In this paper, we present a hierarchical recurrent neural network for melody generation, which consists of three Long-Short-Term-Memory (LSTM) subnetworks working in a coarse-to-fine manner along time . Specifically, the three subnetworks generate bar profiles, beat profiles and notes in turn, and the output of the high-level subnetworks are fed into the low-level subnetworks, serving as guidance for generating the finer time-scale melody components .
Edit intent: clarity