wanyu/IteraTeR_v2 huggingface dataset:
Original:  Polypharmacy side effects emerge because of drug interactions, in which activity of one drug may change , favorably or unfavorably, if taken with another drug.
Revised:  Polypharmacy side effects emerge because of drug-drug interactions, in which activity of one drug may change , favorably or unfavorably, if taken with another drug.
Edit intent: clarity
Original:  Polypharmacy side effects emerge because of drug interactions, in which activity of one drug may change , favorably or unfavorably, if taken with another drug.
Revised:  Polypharmacy side effects emerge because of drug interactions, in which activity of one drug may change if taken with another drug.
Edit intent: clarity
Original:  The knowledge of drug interactions is limited because these complex relationships are  usually not observed in  small clinical testing.
Revised:  The knowledge of drug interactions is limited because these complex relationships are usually not observed in relatively small clinical testing.
Edit intent: clarity
Original:  Discovering polypharmacy side effects thus remains a challenge with significant implications for patient mortality and morbidity.
Revised:  Discovering polypharmacy side effects thus remains an important challenge with significant implications for patient mortality and morbidity.
Edit intent: clarity
Original:  Unlike approaches limited to predicting simple drug-drug interaction values, Decagon can predict the exact side effect, if any, through which a given drug combination manifests clinically.
Revised:  Decagon predicts the exact side effect, if any, through which a given drug combination manifests clinically.
Edit intent: clarity
Original:   Furthermore, Decagon models particularly well side effects that have a strong molecular basis, while on predominantly non-molecular side effects, it achieves good performance because of effective sharing of model parameters across edge types.
Revised:  Furthermore, Decagon models particularly well side effects with a strong molecular basis, while on predominantly non-molecular side effects, it achieves good performance because of effective sharing of model parameters across edge types.
Edit intent: clarity
Original:  Decagon creates an opportunity to use large molecular and patient population data to flag and prioritize polypharmacy side effects for follow-up analysis via formal pharmacological studies .
Revised:  Decagon creates opportunities to use large molecular and patient population data to flag and prioritize polypharmacy side effects for follow-up analysis via formal pharmacological studies .
Edit intent: fluency
Original:  Decagon creates an opportunity to use large molecular and patient population data to flag and prioritize polypharmacy side effects for follow-up analysis via formal pharmacological studies .
Revised:  Decagon creates an opportunity to use large pharmacogenomic and patient data to flag and prioritize polypharmacy side effects for follow-up analysis via formal pharmacological studies .
Edit intent: clarity
Original:  Decagon creates an opportunity to use large molecular and patient population data to flag and prioritize polypharmacy side effects for follow-up analysis via formal pharmacological studies .
Revised:  Decagon creates an opportunity to use large molecular and patient population data to flag and prioritize side effects for follow-up analysis via formal pharmacological studies .
Edit intent: clarity
Original:  Decagon creates an opportunity to use large molecular and patient population data to flag and prioritize polypharmacy side effects for follow-up analysis via formal pharmacological studies .
Revised:  Decagon creates an opportunity to use large molecular and patient population data to flag and prioritize polypharmacy side effects for follow-up analysis .
Edit intent: clarity
Original: In this paper, we analyze a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in d dimensions, where d can be arbitrary.
Revised: In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in d dimensions, where d can be arbitrary.
Edit intent: clarity
Original:  Numerical computations with frames present potential difficulties, due to the near-linear dependence of the finite approximation system.
Revised:  Numerical computations with frames present potential difficulties, due to the near-linear dependence of the truncated approximation system.
Edit intent: clarity
Original:  Nevertheless, well-conditioned approximations can be obtained via regularization ;
Revised:  Nevertheless, well-conditioned approximations can be obtained via regularization ,
Edit intent: fluency
Original:  We also analyze the sample complexity of the approximation for sample points chosen randomly according to a probability measure, providing estimates in terms of the Nikolskii-type inequality for the domain.
Revised:  We also analyze the sample complexity of the approximation for sample points chosen randomly according to a probability measure, providing estimates in terms of the corresponding for the domain.
Edit intent: clarity
Original:  For a large class of nontrivial domains , we show that the sample complexity for points drawn from the uniform measure is quadratic  in the dimension of the polynomial space, independently of d  .
Revised:  In particular , we show that the sample complexity for points drawn from the uniform measure is quadratic in the dimension of the polynomial space, independently of d .
Edit intent: clarity
Original:  We then describe two different ways of clustering the space of supersequences and prove that their cardinality depends only on the length of the received subsequence and its Hamming weight, but not its exact form.
Revised:  We then describe methods for clustering the space of supersequences and prove that their cardinality depends only on the length of the received subsequence and its Hamming weight, but not its exact form.
Edit intent: clarity
Original:  We then describe two different ways of clustering the space of supersequences and prove that their cardinality depends only on the length of the received subsequence and its Hamming weight, but not its exact form.
Revised:  We then describe two different ways of clustering the space of supersequences such that the cardinality of the resulting sets depends only on the length of the received subsequence and its Hamming weight, but not its exact form.
Edit intent: clarity
Original: Recent advances in the areas of Internet of Things (IoT), cloud computing and big data have attributed to the rise of  growing number of complex and useful applications.
Revised: Recent advances in the areas of Internet of Things (IoT), cloud computing and big data have attributed to the rise of a growing number of complex and useful applications.
Edit intent: fluency
Original:  Ensuring Quality of Service (QoS) in terms of bandwidth and low-latency for these applications is essential , and fog computing has been seen as one of the main enablers for satisfying these QoS requirements.
Revised:  Ensuring Quality of Service (QoS) for delay-sensitive applications is a must , and fog computing has been seen as one of the main enablers for satisfying these QoS requirements.
Edit intent: clarity
Original:  Ensuring Quality of Service (QoS) in terms of bandwidth and low-latency for these applications is essential , and fog computing has been seen as one of the main enablers for satisfying these QoS requirements.
Revised:  Ensuring Quality of Service (QoS) in terms of bandwidth and low-latency for these applications is essential , and fog computing is seen as one of the main enablers for satisfying these QoS requirements.
Edit intent: coherence
Original:  Ensuring Quality of Service (QoS) in terms of bandwidth and low-latency for these applications is essential , and fog computing has been seen as one of the main enablers for satisfying these QoS requirements.
Revised:  Ensuring Quality of Service (QoS) in terms of bandwidth and low-latency for these applications is essential , and fog computing has been seen as one of the primary enablers for satisfying these QoS requirements.
Edit intent: clarity
Original:  In this paper, we first introduce the Dynamic Fog Service Provisioning problem, which is the problem of dynamically deploying new fog services (applications) on fog nodes, or releasing the services that are already deployed on fog nodes, in order to meet QoS constraints.
Revised:  In this paper, we first introduce the Dynamic Fog Service Provisioning (QDFSP). QDFSP concerns the dynamic deployment of application services on fog nodes, or releasing the services that are already deployed on fog nodes, in order to meet QoS constraints.
Edit intent: clarity
Original:  In this paper, we first introduce the Dynamic Fog Service Provisioning problem, which is the problem of dynamically deploying new fog services (applications) on fog nodes, or releasing the services that are already deployed on fog nodes, in order to meet QoS constraints.
Revised:  In this paper, we first introduce the Dynamic Fog Service Provisioning problem, which is the problem of dynamically deploying new fog services (applications) on fog nodes, or the release of application services that have previously been deployed on fog nodes, in order to meet QoS constraints.
Edit intent: clarity
Original:  Finally, the heuristics are evaluated using a simulation based on the real- world traffic traces, and mobile augmented reality as the IoT application .
Revised:  Finally, the heuristics are evaluated using a simulation based on real-world traffic traces .
Edit intent: coherence
Original: Biological and Medical science is increasingly acknowledging the use of gene co-expression networks for the analysis of complex systems or diseases.
Revised: Biomedical sciences are increasingly recognising the relevance of gene co-expression-networks for analysing complex-systems, phenotypes or diseases.
Edit intent: clarity
Original:  In many studies, the goal is not only to describe a network, but to investigate how this network is changing under different conditions, with respect to certain diseases, or between different species.
Revised:  When the goal is not only to describe a network, but to investigate how this network is changing under different conditions, with respect to certain diseases, or between different species.
Edit intent: clarity
Original:  Here we present a method for the  comparison of an unlimited number of networks: Co-expression Differential Network Analysis (CoDiNA) .
Revised:  Here we present a method for the systematic comparison of an unlimited number of networks: Co-expression Differential Network Analysis (CoDiNA) .
Edit intent: clarity
Original: Multiagent systems where the agents interact among themselves and with an stochastic environment can be formalized as stochastic games.
Revised: Multiagent systems where agents interact among themselves and with an stochastic environment can be formalized as stochastic games.
Edit intent: clarity
Original: Multiagent systems where the agents interact among themselves and with an stochastic environment can be formalized as stochastic games.
Revised: Multiagent systems where the agents interact among themselves and with a stochastic environment can be formalized as stochastic games.
Edit intent: fluency
Original:  We study a subclass , named Markov potential games (MPGs) , that appear often in economic and engineering applications when the agents share some common resource.
Revised:  We study a subclass named Markov potential games (MPGs) , that appear often in economic and engineering applications when the agents share some common resource.
Edit intent: fluency
Original:  We study a subclass , named Markov potential games (MPGs) , that appear often in economic and engineering applications when the agents share some common resource.
Revised:  We study a subclass , named Markov potential games (MPGs) that appear often in economic and engineering applications when the agents share some common resource.
Edit intent: fluency
Original:  We study a subclass , named Markov potential games (MPGs) , that appear often in economic and engineering applications when the agents share some common resource.
Revised:  We study a subclass , named Markov potential games (MPGs) , that appear often in economic and engineering applications when the agents share a common resource.
Edit intent: clarity
Original:  We present a closed-loop (CL) analysis for MPGs and consider parametric policies that depend on the current state and where agents adapt to stochastic transitions .
Revised:  We present a closed-loop (CL) analysis for MPGs and consider parametric policies that depend on the current state .
Edit intent: coherence
Original:  We provide  verifiable, sufficient and necessary conditions for a stochastic game to be an MPG, even for complex parametric functions (e.g., deep neural networks);
Revised:  We provide easily verifiable, sufficient and necessary conditions for a stochastic game to be an MPG, even for complex parametric functions (e.g., deep neural networks);
Edit intent: clarity
Original:  and show that a CL Nash equilibrium (NE) can be found (or at least approximated) by solving a related optimal control problem (OCP).
Revised:  and show that a closed-loop Nash equilibrium (NE) can be found (or at least approximated) by solving a related optimal control problem (OCP).
Edit intent: clarity
Original:  This is useful since solving an OCP---a single-objective problem---is usually much simpler than solving the original set of coupled OCPs that form the game---a multiobjective control problem.
Revised:  This is useful since solving an OCP---a single-objective problem--is usually much simpler than solving the original set of coupled OCPs that form the game---a multiobjective control problem.
Edit intent: fluency
Original:  This is useful since solving an OCP---a single-objective problem---is usually much simpler than solving the original set of coupled OCPs that form the game---a multiobjective control problem.
Revised:  This is useful since solving an OCP---a single-objective problem---is usually much simpler than solving the original set of coupled OCPs that form the game--which is a multiobjective control problem.
Edit intent: coherence
Original:  This is a considerable improvement over  previously standard approach  .
Revised:  This is a considerable improvement over the previously standard approach .
Edit intent: fluency
Original: This note proposes two equilibrium selection methods and applies them to the power allocation game (PAG) developed in allocation .
Revised: This note proposes two equilibrium selection methods and applies them to the power allocation game developed in allocation .
Edit intent: clarity
Original:  The first method has the game take place on a sequence of time-varying graphs, which redefines the PAG in an extensive form game framework, and selects the subgame perfect Nash equilibria .
Revised:  The first method has the game take place on a sequence of time-varying graphs, which redefines the PAG in an extensive form . Results about the subgame perfect Nash equilibria .
Edit intent: clarity
Original:  Based on recent advances in the field we specifically look at memory-augmented neural networks (MANN) s and adapt the latest model to date, namely the Differential Neural Computer.
Revised:  Based on recent advances in the field we specifically look at memory-augmented neural network (MANN) s and adapt the latest model to date, namely the Differential Neural Computer.
Edit intent: fluency
Original: Leading nations can be distinguished in terms of whether domestic or international research is cited.
Revised: Nations can be distinguished in terms of whether domestic or international research is cited.
Edit intent: clarity
Original:  We analyzed the research output  of three leading European research economies (Germany, the Netherlands, and  UK) and ask where their researchers look for the knowledge that underpins their most highly-cited papers.
Revised:  We analyzed the research output of three leading European research economies (Germany, the Netherlands, and the UK) and ask where their researchers look for the knowledge that underpins their most highly-cited papers.
Edit intent: fluency
Original:  Is one internationally oriented or is citation restricted to national resources?
Revised:  Is one internationally oriented or is citation limited to national resources?
Edit intent: fluency
Original:  The results show that articles co-authored by researchers from one of the three respective countries are less likely to be among the globally most highly-cited articles if they also cite 'domestic' research (i.e. research authored by authors from the same country).
Revised:  The results show that articles co-authored by researchers from one of the three respective countries are less likely to be among the globally most highly-cited articles if they also cite "domestic" research (i.e. research authored by authors from the same country).
Edit intent: fluency
Original: We describe the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions of Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule.
Revised: We develop the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions of Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule.
Edit intent: clarity
Original: We describe the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions of Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule.
Revised: We describe the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions to Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule.
Edit intent: fluency
Original: Collective entity disambiguation , or collective entity linking aims to jointly resolve multiple mentions by linking them to their associated entities in a knowledge base.
Revised: Collective entity disambiguation aims to jointly resolve multiple mentions by linking them to their associated entities in a knowledge base.
Edit intent: clarity
Original:  Previous works largely based on the underlying assumption that entities within the same document are highly related.
Revised:  Previous works are primarily based on the underlying assumption that entities within the same document are highly related.
Edit intent: clarity
Original:  For the first time, this paper shows that the semantic relationships between mentioned entities within documents are in fact less dense than expected.
Revised:  For the first time, we show that the semantic relationships between mentioned entities within documents are in fact less dense than expected.
Edit intent: clarity
Original:  For the first time, this paper shows that the semantic relationships between mentioned entities within documents are in fact less dense than expected.
Revised:  For the first time, this paper shows that the semantic relationships between the mentioned entities are in fact less dense than expected.
Edit intent: clarity
Original:  As a remedy, we introduces MINTREE, a new tree-based objective for the problem of entity disambiguation .
Revised:  As a remedy, we introduce MINTREE, a new tree-based objective for the problem of entity disambiguation .
Edit intent: fluency
Original:  As a remedy, we introduces MINTREE, a new tree-based objective for the problem of entity disambiguation .
Revised:  As a remedy, we introduces MINTREE, a new tree-based objective for the entity disambiguation problem .
Edit intent: fluency
Original:  Based on this new objective, we devise a novel iterative solution for MINTREE optimization problem which we call Pair-Linking.
Revised:  Based on this new objective, we design a novel entity disambiguation algorithms which we call Pair-Linking.
Edit intent: clarity
Original:  The idea of Pair-Linking is simple: instead of considering all the given mentions, Pair-Linking iteratively selects the pair with highest confidence at each step for decision making.
Revised:  Instead of considering all the given mentions, Pair-Linking iteratively selects the pair with highest confidence at each step for decision making.
Edit intent: coherence
Original:  The idea of Pair-Linking is simple: instead of considering all the given mentions, Pair-Linking iteratively selects the pair with highest confidence at each step for decision making.
Revised:  The idea of Pair-Linking is simple: instead of considering all the given mentions, Pair-Linking iteratively selects a pair with the highest confidence at each step for decision making.
Edit intent: fluency
Original:  Via extensive experiments on 8 publicly available benchmark datasets , we show that our approach is not only more accurate but also surprisingly faster than many state-of-the-art collective linking algorithms.
Revised:  Via extensive experiments , we show that our approach is not only more accurate but also surprisingly faster than many state-of-the-art collective linking algorithms.
Edit intent: clarity
Original:  Here, we study the terrorist attack incidents which occurred in the last half century across the globe from the open source, Global terrorism database , and develop a view on their spatio-temporal dynamics.
Revised:  Here, we study the terrorist attack incidents which occurred in the last half-century across the globe from the open source, Global terrorism database , and develop a view on their spatio-temporal dynamics.
Edit intent: fluency
Original:  Here, we study the terrorist attack incidents which occurred in the last half century across the globe from the open source, Global terrorism database , and develop a view on their spatio-temporal dynamics.
Revised:  Here, we study the terrorist attack incidents which occurred in the last half century across the globe from the open source, Global Terrorism Database , and develop a view on their spatio-temporal dynamics.
Edit intent: fluency
Original:  We study the resilience of the network against targeted attacks and random failures, which could guide the counter-terrorist outfits in designing strategies to fight terrorism.
Revised:  We study the network resilience against targeted attacks and random failures, which could guide the counter-terrorist outfits in designing strategies to fight terrorism.
Edit intent: clarity
Original:  We study the resilience of the network against targeted attacks and random failures, which could guide the counter-terrorist outfits in designing strategies to fight terrorism.
Revised:  We study the resilience of the network against targeted attacks and random failures, which could guide the counterterrorist outfits in designing strategies to fight terrorism.
Edit intent: fluency
Original:  We then use a disparity filter method to isolate the backbone of the giant component , and identify the terror hubs and vulnerable motifs of global terrorism.
Revised:  We then use a disparity filter method to isolate backbone of the giant component , and identify the terror hubs and vulnerable motifs of global terrorism.
Edit intent: fluency
Original:  We then use a disparity filter method to isolate the backbone of the giant component , and identify the terror hubs and vulnerable motifs of global terrorism.
Revised:  We then use a disparity filter method to isolate the backbone of the network , and identify the terror hubs and vulnerable motifs of global terrorism.
Edit intent: clarity
Original:  We also examine the evolution of the hubs and motifs in a few exemplary cases like Afghanistan, Colombia, Israel, Peru and United Kingdom.
Revised:  We also examine evolution of the hubs and motifs in a few exemplary cases like Afghanistan, Colombia, Israel, Peru and United Kingdom.
Edit intent: fluency