wanyu/IteraTeR_v2 huggingface dataset:
Original:  Finally, when we consider different body shadowing scenarios, our network design will optimize coverage and area spectral efficiency performance towards either devices held in hand or worn directly against the body, as each of the scenarios requires mutually exclusive settings of access point density and beamwidth.
Revised:  Finally, when we consider different body shadowing scenarios, our network design optimizes coverage or area spectral efficiency performance towards either devices held in hand or worn directly against the body, as each of the scenarios requires mutually exclusive settings of access point density and beamwidth.
Edit intent: clarity
Original:  There are many models of accepting devices for which there is no difference with these problems between deterministic and nondeterministic versions, i.e., the membership problem for both versions are either decidable or undecidable, and the same holds for the emptiness problem.
Revised:  There are many models of accepting devices for which there is no difference with these problems between deterministic and nondeterministic versions, and the same holds for the emptiness problem.
Edit intent: clarity
Original:  As far as we know, this setup suggests both a new paradigm for modeling heterogeneous agent systems and a novel blueprint for understanding model misspecification risks in the context of optimal execution.
Edit intent: coherence
Original: Structural and topological information play a key role in modeling of flow through fractured rock  . Discrete fracture network (DFN) computational suites such as dfnWorks are designed to simulate flow and transport in such media.
Revised: Structural and topological information play a key role in modeling flow and transport through fractured rock . Discrete fracture network (DFN) computational suites such as dfnWorks are designed to simulate flow and transport in such media.
Edit intent: clarity
Original:  Transport calculations that use a particle tracking method reveal that a small backbone of fractures exists where most transport occurs providing a significant reduction in the effective size of the flowing fracture network .
Revised:  Transport calculations that use a particle tracking method reveal that a small backbone of fractures exists , where most flow and transport occurs. Restricting the flowing fracture network to this backbone provides a significant reduction in the effective size of the flowing fracture network .
Edit intent: clarity
Original:  Transport calculations that use a particle tracking method reveal that a small backbone of fractures exists where most transport occurs providing a significant reduction in the effective size of the flowing fracture network .
Revised:  Transport calculations that use a particle tracking method reveal that a small backbone of fractures exists where most transport occurs providing a significant reduction in the network's effective size .
Edit intent: clarity
Original:  However, the simulations needed for particle tracking are computationally intensive , and may not be scalable to large systems or for robust uncertainty quantification of fracture networks  where thousands of forward simulations are needed to bound system behavior.
Revised:  However, the simulations needed for particle tracking are computationally intensive . Such methods may be impractical for large systems or for robust uncertainty quantification of fracture networks where thousands of forward simulations are needed to bound system behavior.
Edit intent: clarity
Original:  However, the simulations needed for particle tracking are computationally intensive , and may not be scalable to large systems or for robust uncertainty quantification of fracture networks  where thousands of forward simulations are needed to bound system behavior.
Revised:  However, the simulations needed for particle tracking are computationally intensive , and may not be scalable to large systems or for robust uncertainty quantification of fracture networks , where thousands of forward simulations are needed to bound system behavior.
Edit intent: fluency
Original:  Using supervised learning techniques, random forest and support vector machines, that train on particle-tracking backbone paths found by dfnWorks, we predict whether or not fractures conduct significant flow , based primarily on node centrality features in the graph.
Revised:  Using random forest and support vector machines, that train on particle-tracking backbone paths found by dfnWorks, we predict whether or not fractures conduct significant flow , based primarily on node centrality features in the graph.
Edit intent: clarity
Original:  Our methods run in negligible time compared to particle-tracking simulations.
Revised:  Our methods run in negligible time compared to those simulations.
Edit intent: clarity
Original:  We find that our predicted backbone can reduce the network to approximately 20\% of its original size, while still generating breakthrough curves resembling those of the full network.
Revised:  We find that our predictions can reduce the network to approximately 20\% of its original size, while still generating breakthrough curves resembling those of the full network.
Edit intent: clarity
Original:  We find that our predicted backbone can reduce the network to approximately 20\% of its original size, while still generating breakthrough curves resembling those of the full network.
Revised:  We find that our predicted backbone can reduce the network to approximately 20\% of its original size, while still generating breakthrough curves consistent with those of the full network.
Edit intent: clarity
Original:  We find that our predicted backbone can reduce the network to approximately 20\% of its original size, while still generating breakthrough curves resembling those of the full network.
Revised:  We find that our predicted backbone can reduce the network to approximately 20\% of its original size, while still generating breakthrough curves resembling those of the original network.
Edit intent: clarity
Original: The minimization of the length of syntactic dependencies is a well-stablished principle of word order and the basis of a mathematical theory of word order.
Revised: The minimization of the length of syntactic dependencies is a well-established principle of word order and the basis of a mathematical theory of word order.
Edit intent: fluency
Original:  The present research bridges the gap between the theory and practice of artifact verification with the implementation of VERIFAS, a full-fledged and efficient artifact verifier for verifying LTL-FO properties of workflows specified in a variant of the Hierarchical Artifact System (HAS) model presented in 16 . Compared to a nontrivial Spin-based verifier implemented in our previous work 29%DIFDELCMD < ]%%% , VERIFAS applies to a much broader class of artifacts.
Revised:  The present research bridges the gap between the theory and practice of artifact verification with the implementation of 16 . Compared to a nontrivial Spin-based verifier implemented in our previous work 29%DIFDELCMD < ]%%% , VERIFAS applies to a much broader class of artifacts.
Edit intent: coherence
Original:  The present research bridges the gap between the theory and practice of artifact verification with the implementation of VERIFAS, a full-fledged and efficient artifact verifier for verifying LTL-FO properties of workflows specified in a variant of the Hierarchical Artifact System (HAS) model presented in 16 . Compared to a nontrivial Spin-based verifier implemented in our previous work 29%DIFDELCMD < ]%%% , VERIFAS applies to a much broader class of artifacts.
Revised:  The present research bridges the gap between the theory and practice of artifact verification with the implementation of VERIFAS, a full-fledged and efficient artifact verifier for verifying LTL-FO properties of workflows specified in a variant of the Hierarchical Artifact System (HAS) model presented in 16 . Compared to 29%DIFDELCMD < ]%%% , VERIFAS applies to a much broader class of artifacts.
Edit intent: coherence
Original:  The present research bridges the gap between the theory and practice of artifact verification with the implementation of VERIFAS, a full-fledged and efficient artifact verifier for verifying LTL-FO properties of workflows specified in a variant of the Hierarchical Artifact System (HAS) model presented in 16 . Compared to a nontrivial Spin-based verifier implemented in our previous work 29%DIFDELCMD < ]%%% , VERIFAS applies to a much broader class of artifacts.
Revised:  The present research bridges the gap between the theory and practice of artifact verification with the implementation of VERIFAS, a full-fledged and efficient artifact verifier for verifying LTL-FO properties of workflows specified in a variant of the Hierarchical Artifact System (HAS) model presented in 16 . Compared to a nontrivial Spin-based verifier implemented in our previous work %DIFDELCMD < ]%%% , VERIFAS applies to a much broader class of artifacts.
Edit intent: coherence
Original:  The significantly improved performance is due to a novel symbolic representation approach and a family of specialized optimizations to the classic Karp-Miller algorithm .
Revised:  The significantly improved performance is due to a novel symbolic representation approach and a family of specialized optimizations .
Edit intent: clarity
Original:  This paper presents a  method for quantifying this uncertainty in solvation energies using surrogate models based on generalized polynomial chaos (gPC) expansions.
Revised:  This paper presents a new method for quantifying this uncertainty in solvation energies using surrogate models based on generalized polynomial chaos (gPC) expansions.
Edit intent: clarity
Original:  therefore, construction of surrogate models for the charge parameter space required compressed sensing combined with an iterative rotation method to enhance problem sparsity.
Revised:  therefore, construction of surrogate models for the charge parameter space requires compressed sensing combined with an iterative rotation method to enhance problem sparsity.
Edit intent: fluency
Original:  We present results for the uncertainty in small molecule solvation energies based on these approaches.
Revised:  We demonstrate the application of the method by presenting results for the uncertainty in small molecule solvation energies based on these approaches.
Edit intent: clarity
Original:  We present results for the uncertainty in small molecule solvation energies based on these approaches.
Revised:  We present results for the uncertainties in small molecule solvation energies based on these approaches.
Edit intent: fluency
Original:  Additionally, we explore the correlation between uncertainties due to radii and charges which motivates the need for future work in uncertainty quantification methods for high-dimensional parameter spaces.
Edit intent: coherence
Original:  We consider the convex hull \psi_n of the set of tensors x\otimes x, x \in P_n . We show that \psi_n is a face of the Boolean quadratic polytope BQP(n^2).
Revised:  We consider the convex hull of the set of tensors x\otimes x, x \in P_n . We show that \psi_n is a face of the Boolean quadratic polytope BQP(n^2).
Edit intent: fluency
Original:  The convex hull \phi_n of all such matrices is an example of the Young polytope P((n-2,2)).
Revised:  The Young polytope P((n-2,2)) is the convex hull of all such matrices is an example of the Young polytope P((n-2,2)).
Edit intent: clarity
Original:   We show that \phi_n and \psi_n are not isomorphic , but \phi_n is a projection of \psi_n . Also, we show that BQP (n) is a face of \phi_{2n .
Revised:  We show that \phi_n and \psi_n are not isomorphic . Also, we show that BQP (n) is a face of \phi_{2n .
Edit intent: coherence
Original:  Work has been done to use implicit distributions, i.e., distributions without tractable likelihoods as the variational posterior.
Revised:  One promising direction is to use implicit distributions, i.e., distributions without tractable likelihoods as the variational posterior.
Edit intent: clarity
Original:  However, existing methods on implicit posteriors still face challenges of noisy estimation and can hardly scale to high-dimensional latent variable models .
Revised:  However, existing methods on implicit posteriors still face challenges of noisy estimation and computational infeasibility when applied to models with high-dimensional latent variable models .
Edit intent: clarity
Original:  However, existing methods on implicit posteriors still face challenges of noisy estimation and can hardly scale to high-dimensional latent variable models .
Revised:  However, existing methods on implicit posteriors still face challenges of noisy estimation and can hardly scale to high-dimensional latent variables .
Edit intent: clarity
Original:  In this paper, we present an implicit variational inference approach with kernel density ratio fitting that addresses these challenges.
Revised:  In this paper, we present a new approach named Kernel Implicit Variational Inference that addresses these challenges.
Edit intent: clarity
Original: Inspired by previous work on emergent language in referential games, we propose a novel multi-modal, multi-step referential game, where the sender and receiver have access to distinct modalities of an object, and their information exchange is bidirectional and of arbitrary duration.
Revised: Inspired by previous work on emergent communication in referential games, we propose a novel multi-modal, multi-step referential game, where the sender and receiver have access to distinct modalities of an object, and their information exchange is bidirectional and of arbitrary duration.
Edit intent: clarity
Original:  The multi-modal multi-step setting allows agents to develop an internal language significantly closer to natural language, in that they share a single set of messages, and that the length of the conversation may vary according to the difficulty of the task.
Revised:  The multi-modal multi-step setting allows agents to develop an internal communication significantly closer to natural language, in that they share a single set of messages, and that the length of the conversation may vary according to the difficulty of the task.
Edit intent: clarity
Original: In order to support communication and computation cooperation, we propose mobile cloud-radio access network ( MC-RAN ) architecture, which consists of mobile cloud (MC) as the computing resource provision platform and radio access network (RAN) as the communication transmission interface.
Revised: In order to support communication and computation cooperation, we propose MC-RAN ) architecture, which consists of mobile cloud (MC) as the computing resource provision platform and radio access network (RAN) as the communication transmission interface.
Edit intent: coherence
Original: In order to support communication and computation cooperation, we propose mobile cloud-radio access network ( MC-RAN ) architecture, which consists of mobile cloud (MC) as the computing resource provision platform and radio access network (RAN) as the communication transmission interface.
Revised: In order to support communication and computation cooperation, we propose mobile cloud-radio access network ( MC-RAN architecture, which consists of mobile cloud (MC) as the computing resource provision platform and radio access network (RAN) as the communication transmission interface.
Edit intent: fluency
Original: In order to support communication and computation cooperation, we propose mobile cloud-radio access network ( MC-RAN ) architecture, which consists of mobile cloud (MC) as the computing resource provision platform and radio access network (RAN) as the communication transmission interface.
Revised: In order to support communication and computation cooperation, we propose mobile cloud-radio access network ( MC-RAN ) architecture, which consists of mobile cloud (MC) as the computation provision platform and radio access network (RAN) as the communication transmission interface.
Edit intent: clarity
Original: In order to support communication and computation cooperation, we propose mobile cloud-radio access network ( MC-RAN ) architecture, which consists of mobile cloud (MC) as the computing resource provision platform and radio access network (RAN) as the communication transmission interface.
Revised: In order to support communication and computation cooperation, we propose mobile cloud-radio access network ( MC-RAN ) architecture, which consists of mobile cloud (MC) as the computing resource provision platform and radio access network (RAN) as the communication interface.
Edit intent: clarity
Original:  The MC-RAN aims to undertake the following tasks: (1) to increase user equipments' (UEs') computing capacity by triggering offloading action, especially for those UEs which cannot complete the computations locally;
Revised:  The MC-RAN aims to undertake the following tasks: (1) to increase user equipments' computing capacity by triggering offloading action, especially for those UEs which cannot complete the computations locally;
Edit intent: clarity
Original:  (2) to reduce the energy consumption for all the UEs by considering the practical system limitations of MC-RAN, i.e., limited computing resource and communication resource ;
Revised:  (2) to reduce the energy consumption for all the UEs by considering limited computing and communication resources ;
Edit intent: clarity
Original:  Then, centralized access control algorithm (CACA) is conducted by MC-RAN with the globe information to decide the offloading set.
Revised:  Then, centralized access control algorithm (CACA) is conducted by MC-RAN with the global information to decide the offloading set.
Edit intent: fluency
Original:  Based on the offloading set, centralized resource allocation algorithm (CRAA) is employed to optimize the offloading power of each UE, corresponding receiving beamforming vectors in MC-RAN and the active RRH and fronthaul pairs, with the objective of minimizing the energy consumption of the whole system including the MC-RAN and all the offloading UEs.
Revised:  Based on the offloading set, centralized resource allocation algorithm (CRAA) is employed to optimize the offloading power of each UE, corresponding receive beamforming vectors in MC-RAN and the active RRH and fronthaul pairs, with the objective of minimizing the energy consumption of the whole system including the MC-RAN and all the offloading UEs.
Edit intent: fluency
Original:  Based on the offloading set, centralized resource allocation algorithm (CRAA) is employed to optimize the offloading power of each UE, corresponding receiving beamforming vectors in MC-RAN and the active RRH and fronthaul pairs, with the objective of minimizing the energy consumption of the whole system including the MC-RAN and all the offloading UEs.
Revised:  Based on the offloading set, centralized resource allocation algorithm (CRAA) is employed to optimize the offloading power of each UE, corresponding receiving beamforming vectors in MC-RAN and the active RRH and fronthaul pairs, with the objective of minimizing the energy consumption of the whole system including MC-RAN and all the offloading UEs.
Edit intent: fluency
Original:  Based on the offloading set, centralized resource allocation algorithm (CRAA) is employed to optimize the offloading power of each UE, corresponding receiving beamforming vectors in MC-RAN and the active RRH and fronthaul pairs, with the objective of minimizing the energy consumption of the whole system including the MC-RAN and all the offloading UEs.
Revised:  Based on the offloading set, centralized resource allocation algorithm (CRAA) is employed to optimize the offloading power of each UE, corresponding receiving beamforming vectors in MC-RAN and the active RRH and fronthaul pairs, with the objective of minimizing the energy consumption of the whole system including the MC-RAN and UEs.
Edit intent: clarity
Original:  The MC-RAN aims to undertake the following tasks: (1) to increase user equipments' computing capacity by triggering offloading action, especially for those UEs which cannot complete the computations locally;
Revised:  Cooperative offloading framework is proposed to achieve the following tasks: (1) to increase user equipments' computing capacity by triggering offloading action, especially for those UEs which cannot complete the computations locally;
Edit intent: clarity
Original:  (2) to reduce the energy consumption for all the UEs by considering limited computing and communication resources ;
Revised:  (2) to reduce the power consumption for all the UEs by considering limited computing and communication resources ;
Edit intent: clarity
Original:  To reduce the signaling between UE and MC-RAN, decentralized local decision algorithm (DLDA) is firstly proposed for each UE to estimate the local execution and offloading energy and decide if offloading is in its interest.
Revised:  To reduce the signaling between UE and MC-RAN, decentralized local decision algorithm (DLDA) is proposed for each UE to estimate the local execution and offloading energy and decide if offloading is in its interest.
Edit intent: coherence
Original:  To reduce the signaling between UE and MC-RAN, decentralized local decision algorithm (DLDA) is firstly proposed for each UE to estimate the local execution and offloading energy and decide if offloading is in its interest.
Revised:  To reduce the signaling between UE and MC-RAN, decentralized local decision algorithm (DLDA) is firstly proposed for each UE to estimate the possible local resource consumption and decide if offloading is in its interest.
Edit intent: clarity
Original:  Cooperative offloading framework is proposed to achieve the following tasks: (1) to increase user equipments' computing capacity by triggering offloading action, especially for those UEs which cannot complete the computations locally;
Revised:  Cooperative offloading framework is proposed to achieve the following tasks: (1) to increase user equipment' (UE') computing capacity by triggering offloading action, especially for those UEs which cannot complete the computations locally;
Edit intent: clarity
Original:  Cooperative offloading framework is proposed to achieve the following tasks: (1) to increase user equipments' computing capacity by triggering offloading action, especially for those UEs which cannot complete the computations locally;
Revised:  Cooperative offloading framework is proposed to achieve the following tasks: (1) to increase user equipments' computing capacity by triggering offloading action, especially for the UE which cannot complete the computations locally;
Edit intent: clarity
Original:  Cooperative offloading framework is proposed to achieve the following tasks: (1) to increase user equipments' computing capacity by triggering offloading action, especially for those UEs which cannot complete the computations locally;
Revised:  Cooperative offloading framework is proposed to achieve the following tasks: (1) to increase user equipments' computing capacity by triggering offloading action, especially for those UEs which cannot complete the computation locally;
Edit intent: fluency
Original:  (2) to reduce the power consumption for all the UEs by considering limited computing and communication resources.
Revised:  (2) to reduce the energy consumption for all the UEs by considering limited computing and communication resources.
Edit intent: clarity
Original:  Based on above objectives, we formulate the power minimization problem, which is shown to be a non-convex mix-integer programming.
Revised:  Based on above objectives, we formulate the power minimization problem, which is shown to be a non-convex mixed-integer programming.
Edit intent: fluency
Original:  Simulations show that the performance of  proposed algorithms is very close to the exhaustive search but with much less complexity.
Revised:  Simulations show that the performance of the proposed algorithms is very close to the exhaustive search but with much less complexity.
Edit intent: fluency