wanyu/IteraTeR_v2 huggingface dataset:
Original:  Based on the likelihood of all possible crossbreeding patterns, our model enables  to infer and to quantify the whole potential genealogies in the population.
Revised:  Based on the likelihood of all possible crossbreeding patterns, our model enables us to infer and to quantify the whole potential genealogies in the population.
Edit intent: fluency
Original:  Then we build an ad hoc penalized likelihood to compare genealogies and to decide whether a particular individual brings a sufficient information to be included in the taken genealogy.
Revised:  Then we build an ad hoc penalized likelihood to compare genealogies and to decide whether a particular individual brings a sufficient information to be included in the taken genealogy.
Edit intent: fluency
Original:  Then we build an ad hoc penalized likelihood to compare genealogies and to decide whether a particular individual brings a sufficient information to be included in the taken genealogy.
Revised:  Then we build an ad hoc penalized likelihood to compare genealogies and to decide whether a particular individual brings sufficient information to be included in the taken genealogy.
Edit intent: fluency
Original:  Most of the methodology relies on the maximum likelihood principle and on the graph theory.
Revised:  Most of the methodology relies on the maximum likelihood principle and on graph theory.
Edit intent: fluency
Original:  Moreover, the optimal dividends' distribution strategy is also triggered by the moving boundary of the associated stopping problem.
Revised:  Moreover, the optimal dividend strategy is also triggered by the moving boundary of the associated stopping problem.
Edit intent: clarity
Original:  While an exact solution to this decision problem is combinatorial in the feedback delay , we exploit ideas from queueing theory to derive scheduling policies  that, while suboptimal, can be efficiently implemented and offer substantially better performance than state of the art approaches to making use of delayed feedback .
Revised:  While an exact solution to this decision problem is challenging , we exploit ideas from queueing theory to derive scheduling policies that, while suboptimal, can be efficiently implemented and offer substantially better performance than state of the art approaches to making use of delayed feedback .
Edit intent: clarity
Original:  While an exact solution to this decision problem is combinatorial in the feedback delay , we exploit ideas from queueing theory to derive scheduling policies  that, while suboptimal, can be efficiently implemented and offer substantially better performance than state of the art approaches to making use of delayed feedback .
Revised:  While an exact solution to this decision problem is combinatorial in the feedback delay , we exploit ideas from queueing theory to derive scheduling policies that, while suboptimal, can be efficiently implemented and offer substantially better performance than state of the art approaches .
Edit intent: clarity
Original: This paper considers the assignment of multiple mobile robots to goal locations under uncertain travel time estimates .
Revised: This paper considers the problem of assigning multiple mobile robots to goal locations under uncertain travel time estimates .
Edit intent: clarity
Original: This paper considers the assignment of multiple mobile robots to goal locations under uncertain travel time estimates .
Revised: This paper considers the assignment of multiple mobile robots to goals on transport networks with uncertain information about travel times .
Edit intent: clarity
Original:  Since solving the redundant assignment problem  is strongly NP-hard  , we exploit structural properties of our problem to propose a polynomial-time, near-optimal solution.
Revised:  Since solving the redundant assignment problem is strongly NP-hard . Hence , we exploit structural properties of our problem to propose a polynomial-time, near-optimal solution.
Edit intent: coherence
Original:  A comparison with the baseline non-redundant assignment shows that redundant assignment reduces the waiting time at goals, and that this performance gap increases as noise increases .
Revised:  A comparison with the baseline non-redundant assignment .
Edit intent: clarity
Original: {\em  {\em   Random geometric graphs are the simplest, and perhaps the earliest possible random graph model of spatial networks, introduced by Gilbert in 1961.
Revised: {\em or{\em Random geometric graphs are the simplest, and perhaps the earliest possible random graph model of spatial networks, introduced by Gilbert in 1961.
Edit intent: clarity
Original: {\em  {\em   Random geometric graphs are the simplest, and perhaps the earliest possible random graph model of spatial networks, introduced by Gilbert in 1961.
Revised: {\em {\em Random geometric graphs (RGG) are one of the most basic models of random graphs for spatial networks proposed by Gilbert in 1961.
Edit intent: clarity
Original:  Formally, generalizing random geometric graphs, we define a random annulus graph G(n, }%DIFDELCMD < [%%% r_1, r_2 ), r_1 <r_2 with n vertices.
Revised:  Formally, generalizing random geometric graphs, we define a random annulus graph G(n, }%DIFDELCMD < [%%% ), r_1 <r_2 with n vertices.
Edit intent: coherence
Original:  We provide a simple and efficient algorithm that can recover communities in GBM exactly } with high probability if and only if a -b > \frac{1 0,\frac{0.99\log n{n}}%DIFDELCMD < ]%%% ) is not connected but G(n, \frac{0.50 \log n{n},\frac{1+\epsilon \log n}{n}}%DIFDELCMD < ]%%% ) is.
Revised:  We provide a simple and efficient algorithm that can recover communities in GBM exactly } with high probability 0,\frac{0.99\log n{n}}%DIFDELCMD < ]%%% ) is not connected but G(n, \frac{0.50 \log n{n},\frac{1+\epsilon \log n}{n}}%DIFDELCMD < ]%%% ) is.
Edit intent: clarity
Original: Reactive synthesis has become a widely-used paradigm for automatically building correct-by-construction systems that interact with an unknown or adversarial environment.
Revised: Reactive synthesis is a paradigm for automatically building correct-by-construction systems that interact with an unknown or adversarial environment.
Edit intent: clarity
Original:  Such systems can be useful, for example  a network protocol fuzz tester whose output should be varied, or a planner for a surveillance robot whose route should be unpredictable.
Revised:  Randomness can be useful, for example a network protocol fuzz tester whose output should be varied, or a planner for a surveillance robot whose route should be unpredictable.
Edit intent: clarity
Original:  Such systems can be useful, for example  a network protocol fuzz tester whose output should be varied, or a planner for a surveillance robot whose route should be unpredictable.
Revised:  Such systems can be useful, for example , in a network protocol fuzz tester whose output should be varied, or a planner for a surveillance robot whose route should be unpredictable.
Edit intent: clarity
Original:  Towards this end, we introduce a notion of randomized reactive synthesis based on the recently-proposed framework of control improvisation (CI) . This framework provides a natural way to integrate a randomness requirement with the usual functional specifications of reactive synthesis .
Revised:  Towards this end, we generalize the recently-proposed framework of control improvisation (CI) . This framework provides a natural way to integrate a randomness requirement with the usual functional specifications of reactive synthesis .
Edit intent: clarity
Original:  For specifications given by reachability / safety games or  deterministic finite automata, our method yields a polynomial-time synthesis algorithm.
Revised:  For specifications given by reachability or safety games or deterministic finite automata, our method yields a polynomial-time synthesis algorithm.
Edit intent: fluency
Original:  For specifications given by reachability / safety games or  deterministic finite automata, our method yields a polynomial-time synthesis algorithm.
Revised:  For specifications given by reachability / safety games or by deterministic finite automata, our method yields a polynomial-time synthesis algorithm.
Edit intent: fluency
Original:  In all of these cases, we show that randomized reactive synthesis is no harder in a complexity-theoretic sense than ordinary reactive synthesis .
Revised:  We show that all of these cases, we show that randomized reactive synthesis is no harder in a complexity-theoretic sense than ordinary reactive synthesis .
Edit intent: coherence
Original:  In all of these cases, we show that randomized reactive synthesis is no harder in a complexity-theoretic sense than ordinary reactive synthesis .
Revised:  In all of these randomized variants of reactive synthesis are no harder in a complexity-theoretic sense than ordinary reactive synthesis .
Edit intent: clarity
Original:  In all of these cases, we show that randomized reactive synthesis is no harder in a complexity-theoretic sense than ordinary reactive synthesis .
Revised:  In all of these cases, we show that randomized reactive synthesis is no harder in a complexity-theoretic sense than their non-randomized counterparts .
Edit intent: clarity
Original:  Taking modularity into consideration, GroupSense can efficiently eliminate incorrect groups, as well as adapt the mechanism depending on the role played by the proximity and the acoustic context in a specific scenario.
Revised:  Taking modularity into consideration, MeetSense can efficiently eliminate incorrect groups, as well as adapt the mechanism depending on the role played by the proximity and the acoustic context in a specific scenario.
Edit intent: clarity
Original:  The proposed method has been implemented and tested under many real-life scenarios in an academic institute environment, and we observe that GroupSense can identify user groups with close to 90 %DIFDELCMD < \\%%% %DIF < accuracy even in a noisy  environment.
Revised:  The proposed method has been implemented and tested under many real-life scenarios in an academic institute environment, and we observe that MeetSense can identify user groups with close to 90 %DIFDELCMD < \\%%% %DIF < accuracy even in a noisy environment.
Edit intent: clarity
Original:  We consider uplink communications from a set of eMBB, mMTC and URLLC devices to a common base station.
Revised:  Service heterogeneity can be accommodated by network slicing, through which each service is allocated resources to provide performance guarantees and isolation from the other services. Slicing of the Radio Access Network (RAN) is typically done by means of orthogonal resource allocation among the services. This work studies the potential advantages of allowing for non-orthogonal sharing of RAN resources in uplink communications from a set of eMBB, mMTC and URLLC devices to a common base station.
Edit intent: clarity
Original:  A communication-theoretic model is proposed that accounts for the heterogeneous requirements and characteristics of the three services.
Revised:  A communication-theoretic model that accounts for the heterogeneous requirements and characteristics of the three services.
Edit intent: clarity
Original:  For non-orthogonal slicing, different decoding architectures are considered, such as puncturing and successive interference cancellation.
Edit intent: coherence
Original:  The concept of reliability diversity is introduced here as a design principle that takes advantage of the vastly different reliability requirements across the services  .
Revised:  The concept of reliability diversity is introduced as a design principle that takes advantage of the vastly different reliability requirements across the services .
Edit intent: coherence
Original:  The concept of reliability diversity is introduced here as a design principle that takes advantage of the vastly different reliability requirements across the services  .
Revised:  The concept of reliability diversity is introduced here as a design principle that leverages the different reliability requirements across the services .
Edit intent: clarity
Original:  This study reveals that non-orthogonal slicing can lead, in some regimes, to significant gains in terms of performance trade-offs among the three generic services  compared to orthogonal slicing.
Revised:  This study reveals that non-orthogonal slicing can lead, in some regimes, to significant gains in terms of performance trade-offs among the three generic services as compared to orthogonal slicing.
Edit intent: clarity
Original: We study the optimal design of numerical integrators for dissipative systems, for which there exists an underlying thermodynamic structure known as GENERIC ( General Equation for the NonEquilibrium Reversible-Irreversible Coupling ).
Revised: We study the optimal design of numerical integrators for dissipative systems, for which there exists an underlying thermodynamic structure known as GENERIC ( general equation for the nonequilibrium reversible-irreversible coupling ).
Edit intent: fluency
Original:  We present a framework to construct structure-preserving integrators for linearly damped systems by splitting the system into reversible and irreversible parts .
Revised:  We present a frame-work to construct structure-preserving integrators for linearly damped systems by splitting the system into reversible and irreversible parts .
Edit intent: clarity
Original:  We present a framework to construct structure-preserving integrators for linearly damped systems by splitting the system into reversible and irreversible parts .
Revised:  We present a framework to construct structure-preserving integrators for linearly damped systems by splitting the system into reversible and irreversible dynamics .
Edit intent: clarity
Original:  The modified Hamiltonian is then used to adjust the irreversible part in such a way that the modified total energy for the whole system can be conserved .
Revised:  The modified energy is then used to adjust the irreversible part in such a way that the modified total energy for the whole system can be conserved .
Edit intent: clarity
Original:  Our findings are verified by various numerical experiments, demonstrating the superiority of structure-preserving integrators over alternative schemes in terms of  the accuracy control of both energy conservation and entropy production as well as the preservation of the dissipation rate .
Revised:  Our findings are verified by various numerical experiments, demonstrating the superiority of structure-preserving integrators over alternative schemes in terms of not only the accuracy control of both energy conservation and entropy production as well as the preservation of the dissipation rate .
Edit intent: clarity
Original:  Our findings are verified by various numerical experiments, demonstrating the superiority of structure-preserving integrators over alternative schemes in terms of  the accuracy control of both energy conservation and entropy production as well as the preservation of the dissipation rate .
Revised:  Our findings are verified by various numerical experiments, demonstrating the superiority of structure-preserving integrators over alternative schemes in terms of the accuracy control of both energy conservation and entropy production but also the preservation of the dissipation rate .
Edit intent: coherence
Original:  This algorithm is suitable for large-scale problems in computational physics where little or no information about the spectrum or norm of the Jacobian matrix is known a priori .
Revised:  This algorithm is suitable for large-scale problems in computational physics where little or no information about the spectrum or norm of the Jacobian matrix is known a priori .
Edit intent: fluency
Original:  Our numerical experiments demonstrate that KIOPS outperforms the current state-of-the-art adaptive Krylov algorithm phipm .
Revised:  Our numerical experiments demonstrate that KIOPS outperforms the current state-of-the-art adaptive Krylov algorithm phipm .
Edit intent: fluency
Original: Network embedding has been a central topic of information network mining in the last couple of years .
Revised: Analysis and visualization of an information network can be facilitated better using an appropriate embedding of the network .
Edit intent: clarity
Original:  Network embedding learns a compact lower dimensional vector representation for each node of the network, and uses this lower dimensional representation for different machine learning and mining applications.
Revised:  Network embedding learns a compact low-dimensional vector representation for each node of the network, and uses this lower dimensional representation for different machine learning and mining applications.
Edit intent: fluency
Original:  It is not straightforward to integrate the content of each node in the  state-of-the-art network embedding methods.
Revised:  It is not straightforward to integrate the content of each node in the current state-of-the-art network embedding methods.
Edit intent: clarity
Original:  In this work , we propose a nonnegative matrix factorization based optimization framework, namely FSCNMF which considers both the network structure and the content of the nodes while learning a lower dimensional vector representation of each node in the network.
Revised:  In this paper , we propose a nonnegative matrix factorization based optimization framework, namely FSCNMF which considers both the network structure and the content of the nodes while learning a lower dimensional vector representation of each node in the network.
Edit intent: clarity
Original:  In this work , we propose a nonnegative matrix factorization based optimization framework, namely FSCNMF which considers both the network structure and the content of the nodes while learning a lower dimensional vector representation of each node in the network.
Revised:  In this work , we propose a nonnegative matrix factorization based optimization framework, namely FSCNMF which considers both the network structure and the content of the nodes while learning a lower dimensional representation of each node in the network.
Edit intent: clarity
Original:  Our approach systematically exploits the consistency of the network structure and the content of the nodes .
Revised:  Our approach systematically regularizes structure based on content and vice versa to exploit the consistency between the structure and content to the best possible extent .
Edit intent: clarity
Original: Wi-Fi positioning is currently the mainstream indoor positioning method, and the construction of fingerprint database is crucial to Wi-Fi based localization system .
Revised: With widely deployed WiFi network and the uniqueness feature (fingerprint) of wireless channel information, fingerprinting based WiFi positioning is currently the mainstream indoor positioning method, and the construction of fingerprint database is crucial to Wi-Fi based localization system .
Edit intent: coherence
Original: Wi-Fi positioning is currently the mainstream indoor positioning method, and the construction of fingerprint database is crucial to Wi-Fi based localization system .
Revised: Wi-Fi positioning is currently the mainstream indoor positioning method, in which fingerprint database construction is crucial .
Edit intent: clarity
Original:  However, the accuracyrequirement needs to sample enough data at many reference points, which consumes significant manpower and time.
Revised:  However, for accuracy, this approach requires enough data to be sampled at many reference points, which consumes significant manpower and time.
Edit intent: clarity
Original:  However, the accuracyrequirement needs to sample enough data at many reference points, which consumes significant manpower and time.
Revised:  However, the accuracyrequirement needs to sample enough data at many reference points, which consumes excessive efforts and time.
Edit intent: clarity
Original:  In this paper, we convert the CSIdata collected at reference points  into amplitude feature maps and then extend the fingerprint database using the proposed Amplitude Feature Deep Convolutional Generative Adversarial Network (AF-DCGAN) model.
Revised:  In this paper, we convert the CSIdata collected at reference points into amplitude feature maps and extend the fingerprint database using the proposed Amplitude Feature Deep Convolutional Generative Adversarial Network (AF-DCGAN) model.
Edit intent: coherence
Original:  In this paper, we convert the CSIdata collected at reference points  into amplitude feature maps and then extend the fingerprint database using the proposed Amplitude Feature Deep Convolutional Generative Adversarial Network (AF-DCGAN) model.
Revised:  In this paper, we convert the CSIdata collected at reference points into amplitude feature maps and then extend the fingerprint database using the proposed Amplitude-Feature Deep Convolutional Generative Adversarial Network (AF-DCGAN) model.
Edit intent: clarity
Original:  Using this model, the convergence process in the training phase can be accelerated, and the diversity of the CSI amplitude feature maps can be increased significantly.
Revised:  The use of AF-DCGAN accelerates convergence during the training phase can be accelerated, and the diversity of the CSI amplitude feature maps can be increased significantly.
Edit intent: clarity
Original:  Using this model, the convergence process in the training phase can be accelerated, and the diversity of the CSI amplitude feature maps can be increased significantly.
Revised:  Using this model, the convergence process in the training phase , and substantially increases the diversity of the CSI amplitude feature maps can be increased significantly.
Edit intent: coherence
Original:  Based on the extended fingerprint database , the accuracy of indoor localization system can be improved with reduced human effort .
Revised:  Based on the extended fingerprint database , the accuracy of indoor localization system , as demonstrated in the experiments .
Edit intent: coherence
Original:  The intertrochanteric fracture can contain high dimensional information including complicated 3D fracture lines, which often make it difficult to visualize or to obtain valuable statistics for clinical diagnosis and prognosis applications.
Revised:  The intertrochanteric fracture can contain high-dimensional information including complicated 3D fracture lines, which often make it difficult to visualize or to obtain valuable statistics for clinical diagnosis and prognosis applications.
Edit intent: fluency
Original:  This paper proposed a map projection technique to map the high dimensional information into a 2D parametric space.
Revised:  This paper proposed a map projection technique to map the high-dimensional information into a 2D parametric space.
Edit intent: fluency
Original: In this paper we develop a deep learning method for optimal stopping problems which directly learns the optimal stopping rule from Monte Carlo samples.
Revised: We develop a deep learning method for optimal stopping problems which directly learns the optimal stopping rule from Monte Carlo samples.
Edit intent: clarity
Original:  We test the approach on two benchmark problems: the pricing of a Bermudan max-call option on different underlying assets and the problem of optimally stopping a fractional Brownian motion.
Revised:  We test the approach on three problems: the pricing of a Bermudan max-call option on different underlying assets and the problem of optimally stopping a fractional Brownian motion.
Edit intent: clarity
Original:  In both cases it produces very accurate results in high-dimensional situations with short computing times.
Revised:  In all three cases it produces very accurate results in high-dimensional situations with short computing times.
Edit intent: clarity
Original: We develop a deep learning method for optimal stopping problems which directly learns the optimal stopping rule from Monte Carlo samples.
Revised: In this paper we develop a deep learning method for optimal stopping problems which directly learns the optimal stopping rule from Monte Carlo samples.
Edit intent: clarity