wanyu/IteraTeR_v2 huggingface dataset:
Original:  K-TanH consists of a sequence of parameterized bit/ integer operations, such as, masking, shift and add/subtract (no floating point operation needed) where parameters are stored in a very small look-up table (bit-masking step can be eliminated).
Revised:  K-TanH consists of a sequence of parameterized bit/ integer operations, such as, shift and add/subtract (no floating point operation needed) where parameters are stored in a very small look-up table (bit-masking step can be eliminated).
Edit intent: clarity
Original:  K-TanH consists of a sequence of parameterized bit/ integer operations, such as, masking, shift and add/subtract (no floating point operation needed) where parameters are stored in a very small look-up table (bit-masking step can be eliminated).
Revised:  K-TanH consists of a sequence of parameterized bit/ integer operations, such as, masking, shift and add/subtract (no floating point operation needed) where parameters are stored in very small look-up table (bit-masking step can be eliminated).
Edit intent: fluency
Original:  The design of K-TanH is flexible enough to deal with multiple numerical formats, such as, FP32 and BFloat16.
Revised:  The design of K-TanH can work on various numerical formats, such as, FP32 and BFloat16.
Edit intent: clarity
Original:  The design of K-TanH is flexible enough to deal with multiple numerical formats, such as, FP32 and BFloat16.
Revised:  The design of K-TanH is flexible enough to deal with multiple numerical formats, such as, Float32 and BFloat16.
Edit intent: clarity
Original:  Experimental results for low-precision BFloat16 training of language translation model GNMT on WMT16 data sets with approximate Tanh and Sigmoid obtained via K-TanH achieve similar accuracy and convergence as training with exact Tanh and Sigmoid .
Revised:  Experimental results for low-precision BFloat16 training of language translation model GNMT on WMT16 data sets with approximate TanH obtained via K-TanH achieve similar accuracy and convergence as training with exact Tanh and Sigmoid .
Edit intent: fluency
Original:  Experimental results for low-precision BFloat16 training of language translation model GNMT on WMT16 data sets with approximate Tanh and Sigmoid obtained via K-TanH achieve similar accuracy and convergence as training with exact Tanh and Sigmoid .
Revised:  Experimental results for low-precision BFloat16 training of language translation model GNMT on WMT16 data sets with approximate Tanh and Sigmoid obtained via K-TanH on BFloat16 inputs .
Edit intent: clarity
Original: This paper addresses the implementation of conflict graph-based routines into the COIN-OR Branch-and-Cut (CBC) solver, including: (i) a conflict graph infrastructure with an improved version of a state-of-the-art conflict detection algorithm to quickly build conflict graphs;
Revised: This paper addresses the development of conflict graph-based routines into the COIN-OR Branch-and-Cut (CBC) solver, including: (i) a conflict graph infrastructure with an improved version of a state-of-the-art conflict detection algorithm to quickly build conflict graphs;
Edit intent: clarity
Original: This paper addresses the implementation of conflict graph-based routines into the COIN-OR Branch-and-Cut (CBC) solver, including: (i) a conflict graph infrastructure with an improved version of a state-of-the-art conflict detection algorithm to quickly build conflict graphs;
Revised: This paper addresses the implementation of conflict graph-based algorithms and data structures into the COIN-OR Branch-and-Cut (CBC) solver, including: (i) a conflict graph infrastructure with an improved version of a state-of-the-art conflict detection algorithm to quickly build conflict graphs;
Edit intent: clarity
Original:  (ii) a preprocessing routine based on a clique-strengthening scheme that can both reduce the number of nonzeros in the constraint matrix and also produce stronger formulations;
Revised:  (ii) a preprocessing routine based on a clique strengthening scheme that can both reduce the number of nonzeros in the constraint matrix and also produce stronger formulations;
Edit intent: fluency
Original:  (ii) a preprocessing routine based on a clique-strengthening scheme that can both reduce the number of nonzeros in the constraint matrix and also produce stronger formulations;
Revised:  (ii) a preprocessing routine based on a clique-strengthening scheme that can both reduce the number of constraints and produce stronger formulations;
Edit intent: clarity
Original:  (iii) a clique cut separator capable of obtaining dual bounds at the root node that are 26 \\%DIF < stronger than the ones provided %DIF > stronger than those provided by the equivalent cut generator of a state-of-the-art commercial solver, 467%DIFDELCMD < \\%%% %DIF < stronger than those attained by the clique cut separator of the  GLPK solver and 500%DIFDELCMD < \\%%% %DIF < stronger than the dual bounds obtained by the clique  separation routine of the COIN-OR Cut Generation Library;
Revised:  (iii) a clique cut separator capable of obtaining dual bounds at the root node that are 26 \\%DIF < stronger than the ones %DIF > stronger than those provided by the equivalent cut generator of a state-of-the-art commercial solver, 467%DIFDELCMD < \\%%% %DIF < stronger than those attained by the clique cut separator of the GLPK solver and 500%DIFDELCMD < \\%%% %DIF < stronger than the dual bounds obtained by the clique separation routine of the COIN-OR Cut Generation Library;
Edit intent: fluency
Original:  (iii) a clique cut separator capable of obtaining dual bounds at the root node that are 26 \\%DIF < stronger than the ones provided %DIF > stronger than those provided by the equivalent cut generator of a state-of-the-art commercial solver, 467%DIFDELCMD < \\%%% %DIF < stronger than those attained by the clique cut separator of the  GLPK solver and 500%DIFDELCMD < \\%%% %DIF < stronger than the dual bounds obtained by the clique  separation routine of the COIN-OR Cut Generation Library;
Revised:  (iii) a clique cut separator capable of obtaining dual bounds at the root node that are 26 \\%DIF < stronger than the ones provided %DIF > stronger than those provided by the equivalent cut generator of a state-of-the-art commercial solver, %DIFDELCMD < \\%%% %DIF < stronger than those attained by the clique cut separator of the GLPK solver and 500%DIFDELCMD < \\%%% %DIF < stronger than the dual bounds obtained by the clique separation routine of the COIN-OR Cut Generation Library;
Edit intent: clarity
Original:  (iii) a clique cut separator capable of obtaining dual bounds at the root node that are 26 \\%DIF < stronger than the ones provided %DIF > stronger than those provided by the equivalent cut generator of a state-of-the-art commercial solver, 467%DIFDELCMD < \\%%% %DIF < stronger than those attained by the clique cut separator of the  GLPK solver and 500%DIFDELCMD < \\%%% %DIF < stronger than the dual bounds obtained by the clique  separation routine of the COIN-OR Cut Generation Library;
Revised:  (iii) a clique cut separator capable of obtaining dual bounds at the root node that are 26 \\%DIF < stronger than the ones provided %DIF > stronger than those provided by the equivalent cut generator of a state-of-the-art commercial solver, 467%DIFDELCMD < \\%%% %DIF < stronger than those attained by the clique cut separator of the GLPK solver and %DIFDELCMD < \\%%% %DIF < stronger than the dual bounds obtained by the clique separation routine of the COIN-OR Cut Generation Library;
Edit intent: clarity
Original:  (iv) an odd-cycle cut separator with a  lifting module to produce valid odd-wheel inequalities.
Revised:  (iv) an odd-cycle cut separator with a new lifting module to produce valid odd-wheel inequalities.
Edit intent: clarity
Original:  This new version of CBC obtained an average gap closed that is 26 \\%DIF < better than the previous one and solved 27%DIFDELCMD < \\%%% %DIF < more instances.
Revised:  The average gap closed by this new version of CBC obtained an average gap closed that is 26 \\%DIF < better than the previous one and solved 27%DIFDELCMD < \\%%% %DIF < more instances.
Edit intent: clarity
Original:  This new version of CBC obtained an average gap closed that is 26 \\%DIF < better than the previous one and solved 27%DIFDELCMD < \\%%% %DIF < more instances.
Revised:  This new version of CBC obtained an average gap closed that is 26 \\%DIF < better %DIFDELCMD < \\%%% %DIF < more instances.
Edit intent: coherence
Original:   (iv) an odd-cycle cut separator with a new lifting module to produce valid odd-wheel inequalities.
Revised:  and (iv) an odd-cycle cut separator with a new lifting module to produce valid odd-wheel inequalities.
Edit intent: fluency
Original:  The second component, Porthos, is an improved semi-honest 3-party protocol that provides significant speedups for Tensorflow like applications.
Revised:  The second component, Porthos, is an improved semi-honest 3-party protocol that provides significant speedups for TensorFlow like applications.
Edit intent: fluency
Original:  The  security of the protocols output by Aramis relies on hardware for integrity and MPC for confidentiality .
Revised:  The security of the protocols output by Aramis relies on integrity of the hardware and semi-honest security of MPC .
Edit intent: clarity
Original:  Moreover, our system , through the use of a new float-to-fixed compiler, matches the inference accuracy over the plaintext floating-point counterparts of these networks .
Revised:  Moreover, our system matches the inference accuracy over the plaintext floating-point counterparts of these networks .
Edit intent: coherence
Original:  Moreover, our system , through the use of a new float-to-fixed compiler, matches the inference accuracy over the plaintext floating-point counterparts of these networks .
Revised:  Moreover, our system , through the use of a new float-to-fixed compiler, matches the inference accuracy of plaintext TensorFlow .
Edit intent: clarity
Original:  We experimentally demonstrate the power of our system by showing the secure inference of real-world neural networks such as ResNet50 , DenseNet121 , and SqueezeNet over the ImageNet dataset with running times of about 30 seconds for semi-honest security and under two minutes for malicious security.
Revised:  We experimentally demonstrate the power of our system by showing the secure inference of real-world neural networks such as ResNet50 and DenseNet121 , and SqueezeNet over the ImageNet dataset with running times of about 30 seconds for semi-honest security and under two minutes for malicious security.
Edit intent: coherence
Original:  We experimentally demonstrate the power of our system by showing the secure inference of real-world neural networks such as ResNet50 , DenseNet121 , and SqueezeNet over the ImageNet dataset with running times of about 30 seconds for semi-honest security and under two minutes for malicious security.
Revised:  We experimentally demonstrate the power of our system by showing the secure inference of real-world neural networks such as ResNet50 , DenseNet121 over the ImageNet dataset with running times of about 30 seconds for semi-honest security and under two minutes for malicious security.
Edit intent: clarity
Original:  Prior work in the area of secure inference (SecureML, MiniONN, HyCC, ABY3, CHET, EzPC, Gazelle, and SecureNN) has been limited to semi-honest security of toy networks with 3--4 layers over tiny datasets such as MNIST or CIFAR which have 10 classes.
Revised:  Prior work in the area of secure inference has been limited to semi-honest security of toy networks with 3--4 layers over tiny datasets such as MNIST or CIFAR which have 10 classes.
Edit intent: coherence
Original:  Prior work in the area of secure inference (SecureML, MiniONN, HyCC, ABY3, CHET, EzPC, Gazelle, and SecureNN) has been limited to semi-honest security of toy networks with 3--4 layers over tiny datasets such as MNIST or CIFAR which have 10 classes.
Revised:  Prior work in the area of secure inference (SecureML, MiniONN, HyCC, ABY3, CHET, EzPC, Gazelle, and SecureNN) has been limited to semi-honest security of small networks over tiny datasets such as MNIST or CIFAR which have 10 classes.
Edit intent: clarity
Original:  To adapt the complex computing environment in data centers, we proposed an innovative Advantage Actor-Critic (A2C) deep reinforcement learning based approach called DeepScheduler for job scheduling.
Revised:  To adapt the complex computing environment in data centers, we proposed an innovative Advantage Actor-Critic (A2C) deep reinforcement learning based approach called A2cScheduler for job scheduling.
Edit intent: fluency
Original: We design three continuous-time models in finite horizon of a commodity price, whose dynamics can be affected by the actions of a representative risk--neutral producer and a representative risk-neutral trader.
Revised: We design three continuous--time models in finite horizon of a commodity price, whose dynamics can be affected by the actions of a representative risk--neutral producer and a representative risk-neutral trader.
Edit intent: fluency
Original: We design three continuous-time models in finite horizon of a commodity price, whose dynamics can be affected by the actions of a representative risk--neutral producer and a representative risk-neutral trader.
Revised: We design three continuous-time models in finite horizon of a commodity price, whose dynamics can be affected by the actions of a representative risk--neutral producer and a representative risk--neutral trader.
Edit intent: fluency
Original:  We solve all three models semi-explicitly and give closed-form expressions of the derivative price over a small time horizon, preventing arbitrage opportunities to arise.
Revised:  We solve all three models semi--explicitly and give closed--form expressions of the derivative price over a small time horizon, preventing arbitrage opportunities to arise.
Edit intent: fluency
Original:  MBT is a natural generalization of the well-studied longest path problem, since both can be viewed as finding a maximum-sized tree of bounded degree in a given graph.
Revised:  MBT is a natural variant of the well-studied longest path problem, since both can be viewed as finding a maximum-sized tree of bounded degree in a given graph.
Edit intent: clarity
Original:  We also show constant-factor inapproximability assuming \mathbf{P \neq NP.
Revised:  We also show constant-factor inapproximability \neq NP.
Edit intent: clarity
Original:  Furthermore, motivated }  by the longest heapable subsequence problem ( introduced by Byers, Heeringa, Mitzenmacher, and Zervas , ANALCO '11 ), which is equivalent to MBT in permutation DAGs, we study MBT in restricted graph families.
Revised:  Furthermore, motivated } by the longest heapable subsequence problem , introduced by Byers, Heeringa, Mitzenmacher, and Zervas , ANALCO '11 ), which is equivalent to MBT in permutation DAGs, we study MBT in restricted graph families.
Edit intent: fluency
Original:  Furthermore, motivated }  by the longest heapable subsequence problem ( introduced by Byers, Heeringa, Mitzenmacher, and Zervas , ANALCO '11 ), which is equivalent to MBT in permutation DAGs, we study MBT in restricted graph families.
Revised:  Furthermore, motivated } by the longest heapable subsequence problem ( introduced by Byers, Heeringa, Mitzenmacher, and Zervas (ANALCO 2011 ), which is equivalent to MBT in permutation DAGs, we study MBT in restricted graph families.
Edit intent: clarity
Original:  We show that MBT admits efficient algorithms in two graph families: bipartite permutation graphs and bounded treewidth graphs.
Revised:  We design efficient algorithms for two graph families: bipartite permutation graphs and bounded treewidth graphs.
Edit intent: clarity
Original:  Our algorithm also allows the followers to track the sampled state of the leader with a locally chosen offset , which enables them to form a formation about the  state of the leader .
Revised:  Our algorithm also allows the followers to track the sampled state of the leader with a locally chosen offset , which enables them to form a formation about the sampled state of the leader .
Edit intent: fluency
Original: Non-orthogonal multiple access (NOMA ) schemes serve more than one user in the same resource block by multiplexing users in other domains than frequency and time.
Revised: The ambitious high data rate applications in the envisioned future B5G wireless networks require new solutions, including the advent of more advanced architectures than the ones already used in 5G networks, and the coalition of different communications schemes and technologies to enable these applications requirements. Among the candidate communications schemes for future wireless networks are NOMA schemes that allow serving more than one user in the same resource block by multiplexing users in other domains than frequency and time.
Edit intent: clarity
Original: Non-orthogonal multiple access (NOMA ) schemes serve more than one user in the same resource block by multiplexing users in other domains than frequency and time.
Revised: Non-orthogonal multiple access (NOMA ) schemes serve more than one user in the same resource block by multiplexing users in other domains than frequency or time.
Edit intent: fluency
Original:  In this way, NOMA schemes  offer several advantages over orthogonal multiple access (OMA ) schemes such as improved user fairness and spectral efficiency, higher cell-edge throughput, massive connectivity support, and low transmission latency.
Revised:  In this way, NOMA schemes tend to offer several advantages over orthogonal multiple access (OMA ) schemes such as improved user fairness and spectral efficiency, higher cell-edge throughput, massive connectivity support, and low transmission latency.
Edit intent: clarity
Original:  In this way, NOMA schemes  offer several advantages over orthogonal multiple access (OMA ) schemes such as improved user fairness and spectral efficiency, higher cell-edge throughput, massive connectivity support, and low transmission latency.
Revised:  In this way, NOMA schemes offer several advantages over OMA schemes such as improved user fairness and spectral efficiency, higher cell-edge throughput, massive connectivity support, and low transmission latency.
Edit intent: clarity
Original:  With these merits, NOMA transmission schemes are being increasingly looked at as a promising multiple access scheme for future wireless networks.
Revised:  With these merits, NOMA schemes are being increasingly looked at as a promising multiple access scheme for future wireless networks.
Edit intent: clarity
Original:  With these merits, NOMA transmission schemes are being increasingly looked at as a promising multiple access scheme for future wireless networks.
Revised:  With these merits, NOMA transmission schemes are being increasingly looked at as promising multiple access scheme for future wireless networks.
Edit intent: fluency
Original:  With these merits, NOMA transmission schemes are being increasingly looked at as a promising multiple access scheme for future wireless networks.
Revised:  With these merits, NOMA transmission schemes are being increasingly looked at as a promising multiple access schemes for future wireless networks.
Edit intent: fluency
Original:  When the power domain is used to multiplex  users, it is referred to as the power domain NOMA (PDNOMA) scheme .
Revised:  When the power domain is used to multiplex the users, it is referred to as the power domain NOMA (PDNOMA) scheme .
Edit intent: fluency
Original:  When the power domain is used to multiplex  users, it is referred to as the power domain NOMA (PDNOMA) scheme .
Revised:  When the power domain is used to multiplex users, it is referred to as the PD-NOMA .
Edit intent: clarity
Original:  In this paper, we survey the integration of the PD-NOMA scheme with other upcoming communication schemes and technologies that  satisfy the requirements of 5G and beyond 5G ( B5G ) networks.
Revised:  In this paper, we survey the integration of PD-NOMA scheme with other upcoming communication schemes and technologies that satisfy the requirements of 5G and beyond 5G ( B5G ) networks.
Edit intent: fluency
Original:  In this paper, we survey the integration of the PD-NOMA scheme with other upcoming communication schemes and technologies that  satisfy the requirements of 5G and beyond 5G ( B5G ) networks.
Revised:  In this paper, we survey the integration of the PD-NOMA with the other enabling communication schemes and technologies that satisfy the requirements of 5G and beyond 5G ( B5G ) networks.
Edit intent: clarity
Original:  In this paper, we survey the integration of the PD-NOMA scheme with other upcoming communication schemes and technologies that  satisfy the requirements of 5G and beyond 5G ( B5G ) networks.
Revised:  In this paper, we survey the integration of the PD-NOMA scheme with other upcoming communication schemes and technologies that are expected to satisfy the requirements of 5G and beyond 5G ( B5G ) networks.
Edit intent: clarity
Original:  In this paper, we survey the integration of the PD-NOMA scheme with other upcoming communication schemes and technologies that  satisfy the requirements of 5G and beyond 5G ( B5G ) networks.
Revised:  In this paper, we survey the integration of the PD-NOMA scheme with other upcoming communication schemes and technologies that satisfy the requirements of B5G ) networks.
Edit intent: clarity
Original:  In this paper, we survey the integration of the PD-NOMA scheme with other upcoming communication schemes and technologies that  satisfy the requirements of 5G and beyond 5G ( B5G ) networks.
Revised:  In this paper, we survey the integration of the PD-NOMA scheme with other upcoming communication schemes and technologies that satisfy the requirements of 5G and beyond 5G ( B5G networks.
Edit intent: fluency
Original:  In particular, this paper surveys the rate optimization schemes studied in the literature when the PD-NOMA scheme is combined with MIMO and massive MIMO (mMIMO), millimeter wave (mmWave ) communications, coordinated multi-point (CoMP) transmission and reception, cooperative communications, cognitive radio (CR), visible light communications (VLC), and unmanned aerial vehicle (UAV ) assisted communications .
Revised:  In particular, this paper surveys the different rate optimization scenarios studied in the literature when the PD-NOMA scheme is combined with MIMO and massive MIMO (mMIMO), millimeter wave (mmWave ) communications, coordinated multi-point (CoMP) transmission and reception, cooperative communications, cognitive radio (CR), visible light communications (VLC), and unmanned aerial vehicle (UAV ) assisted communications .
Edit intent: clarity
Original:  In particular, this paper surveys the rate optimization schemes studied in the literature when the PD-NOMA scheme is combined with MIMO and massive MIMO (mMIMO), millimeter wave (mmWave ) communications, coordinated multi-point (CoMP) transmission and reception, cooperative communications, cognitive radio (CR), visible light communications (VLC), and unmanned aerial vehicle (UAV ) assisted communications .
Revised:  In particular, this paper surveys the rate optimization schemes studied in the literature when PD-NOMA scheme is combined with MIMO and massive MIMO (mMIMO), millimeter wave (mmWave ) communications, coordinated multi-point (CoMP) transmission and reception, cooperative communications, cognitive radio (CR), visible light communications (VLC), and unmanned aerial vehicle (UAV ) assisted communications .
Edit intent: fluency