wanyu/IteraTeR_full_sent huggingface dataset:
Original:  In our non-concave optimization problem, we find that with a not too strict regulation for any VaR-constraint with an arbitrary risk level, there exists an ES-constraint leading to the same investment strategy, which shows on some level the ineffectiveness of the ES-based  regulation  .
Revised:  In our non-concave optimization problem, we find that with a not too strict regulation for any VaR-constraint with an arbitrary risk level, there exists an ES-constraint leading to the same investment strategy, which shows on some level the ineffectiveness of the ES-based regulation can induce the same optimal portfolio choice for a surplus-driven financial institution .
Edit intent: meaning-changed
Original:  This differs from the conclusion drawn in Basak and Shapiro ( 2001 ) for the concave optimization problem, where VaR and ES lead to different solutions and ES provides a better loss protection.
Revised:  This differs from the conclusion drawn in Basak and Shapiro 2001 ) for the concave optimization problem, where VaR and ES lead to different solutions and ES provides a better loss protection.
Edit intent: fluency
Original:  This differs from the conclusion drawn in Basak and Shapiro ( 2001 ) for the concave optimization problem, where VaR and ES lead to different solutions and ES provides a better loss protection.
Revised:  This differs from the conclusion drawn in Basak and Shapiro ( 2001 where the financial institution aims at maximizing the expected utility of the total assets, and ES provides better loss protection.
Edit intent: meaning-changed
Original:  The graph \mathcal{H matching edges that span an empty quadrilateral with the other two edges of the quadrilateral, provided that the quadrilateral contains the center of the unit circle.
Revised:  A flip operation on such a matching replaces two matching edges that span an empty quadrilateral with the other two edges of the quadrilateral, provided that the quadrilateral contains the center of the unit circle.
Edit intent: meaning-changed
Original:  The graph \mathcal{H matching edges that span an empty quadrilateral with the other two edges of the quadrilateral, provided that the quadrilateral contains the center of the unit circle.
Revised:  The graph \mathcal{H matching edges that span an empty quadrilateral with the other two edges of the quadrilateral, and the flip is called centered if the quadrilateral contains the center of the unit circle.
Edit intent: meaning-changed
Original:   We show that the graph H_n is connected for odd n, but has exponentially many small connected components for even n, which we characterize and count via Catalan and generalized Narayana numbers.
Revised:  The graph \mathcal{G We show that the graph H_n is connected for odd n, but has exponentially many small connected components for even n, which we characterize and count via Catalan and generalized Narayana numbers.
Edit intent: meaning-changed
Original:  Our results imply the non-existence of certain rainbow cycles  , and they answer several open questions and conjectures raised in a recent paper by Felsner, Kleist, M\"utze, and Sering.
Revised:  Our results imply the non-existence of certain rainbow cycles in \mathcal{G , and they answer several open questions and conjectures raised in a recent paper by Felsner, Kleist, M\"utze, and Sering.
Edit intent: meaning-changed
Original:  Our results imply the non-existence of certain rainbow cycles  , and they answer several open questions and conjectures raised in a recent paper by Felsner, Kleist, M\"utze, and Sering.
Revised:  Our results imply the non-existence of certain rainbow cycles , and they resolve several open questions and conjectures raised in a recent paper by Felsner, Kleist, M\"utze, and Sering.
Edit intent: clarity
Original: Logic-based systems for query answering over knowledge graphs return only answers that rely on information explicitly represented in the graph. To improve recall, recent works have proposed the use of embeddings to predict additional information like missing links, or labels. These embeddings enable scoring entities in the graph as the answer a query, without being fully dependent on the graph structure. In its simplest case, answering a query in such a setting requires predicting a link between two entities. However, link prediction is not sufficient to address complex queries that involve multiple entities and variables. To solve this task, we propose to apply a message passing mechanism to a  graph representation of the query, where nodes correspond to variables and entities .
Revised: Recent works on representation learning for Knowledge Graphs have moved beyond the problem of link prediction, to answering queries of an arbitrary structure. Existing methods are based on ad-hoc mechanisms that require training with a diverse set of query structures. We propose a graph representation of the query, where nodes correspond to variables and entities .
Edit intent: clarity
Original:  To solve this task, we propose to apply a message passing mechanism to a  graph representation of the query, where nodes correspond to variables and entities . This results in an embedding of the query, such that answering entities are close to it in the embedding space. The general formulation of our method allows it to encode a more diverse set of query types in comparison to previous work.
Revised:  To solve this task, we propose to apply a message passing mechanism to a graph representation of the query, where nodes correspond to entities and variables. The generality of our method allows it to encode a more diverse set of query types in comparison to previous work.
Edit intent: clarity
Original:  We evaluate our method by answering queries that rely on edges not seen during training, obtaining competitive performance . In contrast with previous work, we show that our method can generalize from training for the single-hop, link prediction task, to answering queries with more complex structures. A qualitative analysis reveals that the learned embeddings successfully capture the notion of different entity types .
Revised:  Our method shows competitive performance against previous models for complex queries, and in contrast with these models, it can answer complex queries when trained for link prediction only. We show that the model learns entity embeddings that capture the notion of different entity types .
Edit intent: clarity
Original:  A Poisson fixed-effects model is developed to evaluate the ridership elasticity to frequency  using passenger count data from Portland, Miami, Minneapolis/St-Paul, and Atlanta between 2012 and 2018.
Revised:  A Poisson fixed-effects model is developed to evaluate the ridership elasticity to frequency on weekdays using passenger count data from Portland, Miami, Minneapolis/St-Paul, and Atlanta between 2012 and 2018.
Edit intent: meaning-changed
Original:  We identify a structural property called one-endedness, which is desirable in any blockchain system . We prove that whenever the blockchain network model is stochastically stable, then a blockchain is one-ended .
Revised:  We identify a structural property called one-endedness, which is desirable in any blockchain system as it is directly related to distributed consensus among the peers. We show that the stochastic stability of the network is one-ended .
Edit intent: meaning-changed
Original:  In this paper, we analyse the structure of the BLN over a period of 18 months, ranging from 14th January 2018 to 13th July 2019, at the end of which the network has reached 8.216 users, 122.517 active channels and 2.732,5 transacted bitcoins.
Revised:  In this paper, we analyse the structure of the BLN over a period of 18 months, ranging from 12th January 2018 to 13th July 2019, at the end of which the network has reached 8.216 users, 122.517 active channels and 2.732,5 transacted bitcoins.
Edit intent: meaning-changed
Original:  In this paper, we analyse the structure of the BLN over a period of 18 months, ranging from 14th January 2018 to 13th July 2019, at the end of which the network has reached 8.216 users, 122.517 active channels and 2.732,5 transacted bitcoins.
Revised:  In this paper, we analyse the structure of the BLN over a period of 18 months, ranging from 14th January 2018 to 17th July 2019.
Edit intent: meaning-changed
Original:  however, despite the huge activity characterising the BLN, the bitcoins distribution is very unequal: the average Gini coefficient of the node strengths is approximately 0.88 causing  10\% (50\%) the of the nodes to hold the 80\% (99\%) of the bitcoins at stake in the BLN (on average, across the entire period)  .
Revised:  however, despite the huge activity characterising the BLN, the bitcoins distribution is very unequal: the average Gini coefficient of the node strengths (computed across the entire history of the Bitcoin Lightning Network) is, in fact, ~ 0.88 causing 10\% (50\%) the of the nodes to hold the 80\% (99\%) of the bitcoins at stake in the BLN (on average, across the entire period) .
Edit intent: meaning-changed
Original:  however, despite the huge activity characterising the BLN, the bitcoins distribution is very unequal: the average Gini coefficient of the node strengths is approximately 0.88 causing  10\% (50\%) the of the nodes to hold the 80\% (99\%) of the bitcoins at stake in the BLN (on average, across the entire period)  .
Revised:  however, despite the huge activity characterising the BLN, the bitcoins distribution is very unequal: the average Gini coefficient of the node strengths is approximately 0.88 causing the 10\% (50\%) the of the nodes to hold the 80\% (99\%) of the bitcoins at stake in the BLN (on average, across the entire period) .
Edit intent: fluency
Original:  however, despite the huge activity characterising the BLN, the bitcoins distribution is very unequal: the average Gini coefficient of the node strengths is approximately 0.88 causing  10\% (50\%) the of the nodes to hold the 80\% (99\%) of the bitcoins at stake in the BLN (on average, across the entire period)  .
Revised:  however, despite the huge activity characterising the BLN, the bitcoins distribution is very unequal: the average Gini coefficient of the node strengths is approximately 0.88 causing 10\% (50\%) of the nodes to hold the 80\% (99\%) of the bitcoins at stake in the BLN (on average, across the entire period) .
Edit intent: clarity
Original:  however, despite the huge activity characterising the BLN, the bitcoins distribution is very unequal: the average Gini coefficient of the node strengths is approximately 0.88 causing  10\% (50\%) the of the nodes to hold the 80\% (99\%) of the bitcoins at stake in the BLN (on average, across the entire period)  .
Revised:  however, despite the huge activity characterising the BLN, the bitcoins distribution is very unequal: the average Gini coefficient of the node strengths is approximately 0.88 causing 10\% (50\%) the of the nodes to hold the 80\% (99\%) of the bitcoins at stake in the BLN (on average, across the entire period) . This concentration brings up the question of which minimalist network model allows us to explain the network topological structure .
Edit intent: meaning-changed
Original:  In this way, our approach brings a deeper level of interaction between the original and compact models , and smooths the training process . Compared to the previous knowledge distillation approaches for BERT compression, our approach leverages only one loss functionand one hyper-parameter, liberating human effort from hyper-parameter tuning .
Revised:  In this way, our approach brings a deeper level of interaction between the original and compact models . Compared to the previous knowledge distillation approaches for BERT compression, our approach leverages only one loss functionand one hyper-parameter, liberating human effort from hyper-parameter tuning .
Edit intent: coherence
Original:  In this way, our approach brings a deeper level of interaction between the original and compact models , and smooths the training process . Compared to the previous knowledge distillation approaches for BERT compression, our approach leverages only one loss functionand one hyper-parameter, liberating human effort from hyper-parameter tuning .
Revised:  In this way, our approach brings a deeper level of interaction between the original and compact models , and smooths the training process . Compared to the previous knowledge distillation approaches for BERT compression, our approach does not introduce any additional loss function .
Edit intent: meaning-changed
Original:  Unlike previous masked language models or the Insertion Transformer, BLM uses blanks to control which part of the sequence to expand . This fine-grained control of generation is ideal for a variety of text editing and rewriting tasks.
Revised:  Unlike previous masked language models or the Insertion Transformer, BLM uses blanks to control which part of the sequence to expand , making BLM ideal for a variety of text editing and rewriting tasks.
Edit intent: clarity
Original:  However, MCS computation is NP-hard, and state-of-the-art exact MCS solvers do not have worst-case time complexity guarantee and cannot handle large graphs in practice . Designing learning based models to find the MCS between two graphs in an approximate yet accurate way while utilizing as few labeled MCS instances as possible remains to be a challenging task. Here we propose RLMCS , a Graph Neural Network based model for MCS detection through reinforcement learning .
Revised:  However, MCS computation is NP-hard, and state-of-the-art MCS solvers rely on heuristic search algorithms which in practice cannot find good solution for large graph pairs given a limited computation budget. We propose GLSearch , a Graph Neural Network based model for MCS detection through reinforcement learning .
Edit intent: clarity
Original:  Our model uses an exploration tree to extract subgraphs in two graphs one node pair at a time , and is trained to optimize subgraph extraction rewards via Deep Q-Networks. A novel graph embedding method is proposed to generate state representations for nodes and extracted subgraphs jointly at each step . Experiments on real graph datasets demonstrate that our model performs favorably to exact MCS solvers and supervised neural graph matching network models in terms of accuracy and efficiency .
Revised:  Our model uses an exploration tree to extract subgraphs in two graphs one node pair at a time . Instead of using heuristics, we propose a novel GNN-based Deep Q-Network (DQN) to select the node pair, allowing the search process faster and more adaptive. To further enhance the training of DQN, we leverage the search process to provide supervision in a pre-training stage and guide our agent during an imitation learning stage . Experiments on real graph datasets demonstrate that our model performs favorably to exact MCS solvers and supervised neural graph matching network models in terms of accuracy and efficiency .
Edit intent: coherence
Original:  A novel graph embedding method is proposed to generate state representations for nodes and extracted subgraphs jointly at each step . Experiments on real graph datasets demonstrate that our model performs favorably to exact MCS solvers and supervised neural graph matching network models in terms of accuracy and efficiency .
Revised:  A novel graph embedding method is proposed to generate state representations for nodes and extracted subgraphs jointly at each step . Experiments on synthetic and real-world large graph pairs demonstrate that our model performs favorably to exact MCS solvers and supervised neural graph matching network models in terms of accuracy and efficiency .
Edit intent: meaning-changed
Original:  A novel graph embedding method is proposed to generate state representations for nodes and extracted subgraphs jointly at each step . Experiments on real graph datasets demonstrate that our model performs favorably to exact MCS solvers and supervised neural graph matching network models in terms of accuracy and efficiency .
Revised:  A novel graph embedding method is proposed to generate state representations for nodes and extracted subgraphs jointly at each step . Experiments on real graph datasets demonstrate that our model learns a search strategy that is able to detect significantly larger common subgraphs given the same computation budget. Our GLSearch can be potentially extended to solve many other combinatorial problems with constraints on graphs .
Edit intent: meaning-changed
Original: With more than 1.3 Billion in the cumulative number of downloads reported, the top six applications compete in the niche of Wi-Fi Direct D2D file sharing on Android. With the highest userbase in India and Indonesia, ShareIT itself reports the number of active users of their application on desktop and mobile devices exceeding 1.8 billion , ranked top 7 globally by the number of downloads on Google Play and Apple App Store in 2018.
Revised: With more than 1.3 Billion in the cumulative number of downloads reported, the top six applications compete in the niche of Wi-Fi Direct Device-to-Device file sharing applications on Android has exceeded 1.8 billion , ranked top 7 globally by the number of downloads on Google Play and Apple App Store in 2018.
Edit intent: clarity
Original:  With the highest userbase in India and Indonesia, ShareIT itself reports the number of active users of their application on desktop and mobile devices exceeding 1.8 billion , ranked top 7 globally by the number of downloads on Google Play and Apple App Store in 2018.
Revised:  With the highest userbase in India and Indonesia, ShareIT itself reports the number of active users of their application on desktop and mobile devices exceeding 1.8 billion .
Edit intent: coherence
Original:  For its end users, such type of direct file transfer does not result in cellular data charges and allows to keep their primary Wi-Fi interface up concurrently with a dedicated Wi-Fi P2P interface, which is commonly provided by the default wireless module of the mobile phone .
Revised:  For its end users, such type of direct file transfer does not incur cellular data charges and allows to keep their primary Wi-Fi interface up concurrently with a dedicated Wi-Fi P2P interface, which is commonly provided by the default wireless module of the mobile phone .
Edit intent: clarity
Original:  However, despite the popularity of these solutions demonstrated by Google Play download statistics , we observe that the software vendors tend to prioritize the ease of user flow over the security of the implementation, introducing serious security flaws.
Revised:  However, despite the popularity of these solutions demonstrated by Google Play download statistics , we observe that the software vendors tend to prioritize the ease of user flow over the security in their implementations, which leads to serious security flaws.
Edit intent: clarity
Original:  We perform a comprehensive security analysis in the context of security and usability behind the identified flaws and report our findings in the form of 16 Common Vulnerabilities and Exposures (CVE) , disclosed to the corresponding vendors.
Revised:  We perform a comprehensive security analysis in the context of security and usability and report our findings in the form of 16 Common Vulnerabilities and Exposures (CVE) , disclosed to the corresponding vendors.
Edit intent: clarity
Original:  We perform a comprehensive security analysis in the context of security and usability behind the identified flaws and report our findings in the form of 16 Common Vulnerabilities and Exposures (CVE) , disclosed to the corresponding vendors.
Revised:  We perform a comprehensive security analysis in the context of security and usability behind the identified flaws and report our findings in the form of 17 Common Vulnerabilities and Exposures (CVE) , disclosed to the corresponding vendors.
Edit intent: meaning-changed
Original:  We perform a comprehensive security analysis in the context of security and usability behind the identified flaws and report our findings in the form of 16 Common Vulnerabilities and Exposures (CVE) , disclosed to the corresponding vendors.
Revised:  We perform a comprehensive security analysis in the context of security and usability behind the identified flaws and report our findings in the form of 16 Common Vulnerabilities and Exposures (CVE) which have been disclosed to the corresponding vendors.
Edit intent: coherence
Original:  To address the similar flaws at the early stage of the application design, we propose a joint consideration of Security and Usability for such applications and their protocols that can be visualized in form of a  User Journey Map (UJM).
Revised:  To address the similar flaws at the early stage of the application design, we propose a joint consideration of security and usability for such applications and their protocols that can be visualized in form of a User Journey Map (UJM).
Edit intent: fluency
Original:  To address the similar flaws at the early stage of the application design, we propose a joint consideration of Security and Usability for such applications and their protocols that can be visualized in form of a  User Journey Map (UJM).
Revised:  To address the similar flaws at the early stage of the application design, we propose a joint consideration of Security and Usability for such applications and their protocols that can be visualized in form of a customised User Journey Map (UJM).
Edit intent: clarity
Original:  In this paper, we introduce Time-aware Large Kernel (TaLK) Convolutions, a novel adaptive convolution operation that learns to predict the size of a summation kernel instead of using the fixed-sized kernel matrix.
Revised:  In this paper, we introduce Time-aware Large Kernel (TaLK) Convolutions, a novel adaptive convolution operation that learns to predict the size of a summation kernel instead of using a fixed-sized kernel matrix.
Edit intent: fluency
Original:  Using an asymptotic fluid analysis of the two-dimensional Markov process of buyers and sellers, we show that when the matching utility distribution is light-tailed, \% (i.e., the expected value of the maximum of many random variables is a regularly varying function with \alpha=0) the population threshold policy with threshold n{\ln n} is asymptotically optimal among all policies that make matches only at agent arrival epochs.
Revised:  Using a fluid analysis of the two-dimensional Markov process of buyers and sellers, we show that when the matching utility distribution is light-tailed, \% (i.e., the expected value of the maximum of many random variables is a regularly varying function with \alpha=0) the population threshold policy with threshold n{\ln n} is asymptotically optimal among all policies that make matches only at agent arrival epochs.
Edit intent: clarity
Original:  Using an asymptotic fluid analysis of the two-dimensional Markov process of buyers and sellers, we show that when the matching utility distribution is light-tailed, \% (i.e., the expected value of the maximum of many random variables is a regularly varying function with \alpha=0) the population threshold policy with threshold n{\ln n} is asymptotically optimal among all policies that make matches only at agent arrival epochs.
Revised:  Using an asymptotic fluid analysis of the two-dimensional Markov process of buyers and sellers, we show that when the matching utility distribution is light-tailed, the population threshold policy with threshold n{\ln n} is asymptotically optimal among all policies that make matches only at agent arrival epochs.
Edit intent: coherence