wanyu/IteraTeR_v2 huggingface dataset:
Original:  Both pricing-and-routing schemes are compared to the Congestion Pricing with Uniform Revenue Refunding (CPURR) scheme through extensive simulation experiments where it is shown that OPS and AOPS achieve a much lower expected total travel time and expected total monetary cost  compared to the CPURR scheme for both the users and the transportation network.
Revised:  Both pricing-and-routing schemes are compared to the Congestion Pricing with Uniform Revenue Refunding (CPURR) scheme through extensive simulation experiments where it is shown that OPS and AOPS achieve a much lower expected total travel time and expected total monetary cost for the users compared to the CPURR scheme for both the users and the transportation network.
Edit intent: fluency
Original:  In this work, we propose several acceleration techniques for intrusive methods and study their advantages and shortcomings compared to the non-intrusive stochastic-Collocation method.
Revised:  In this work, we propose several acceleration techniques for intrusive methods and study their advantages and shortcomings compared to the non-intrusive Stochastic Collocation method.
Edit intent: fluency
Original:  Furthermore, using the proposed acceleration techniques, our implementation reaches a given accuracy faster than stochastic-Collocation .
Revised:  Furthermore, using the proposed acceleration techniques, our implementation reaches a given accuracy faster than Stochastic Collocation .
Edit intent: fluency
Original:  This novel auxiliary variable method based on exponential form of nonlinear free energy potential is more effective and applicable than the classical SAV method which is very popular to construct energy stable schemes for phase field models .
Revised:  This novel auxiliary variable method based on exponential form of nonlinear free energy potential is more effective and applicable than the traditional SAV method which is very popular to construct energy stable schemes for phase field models .
Edit intent: clarity
Original:  This novel auxiliary variable method based on exponential form of nonlinear free energy potential is more effective and applicable than the classical SAV method which is very popular to construct energy stable schemes for phase field models .
Revised:  This novel auxiliary variable method based on exponential form of nonlinear free energy potential is more effective and applicable than the classical SAV method which is very popular to construct energy stable schemes .
Edit intent: clarity
Original:  The first contribution is that we remove the bounded below restriction of  nonlinear free energy potential by using the positive property of the exponential functions .
Revised:  The first contribution is that we remove the bounded below restriction of the nonlinear free energy potential by using the positive property of the exponential functions .
Edit intent: fluency
Original:  The first contribution is that we remove the bounded below restriction of  nonlinear free energy potential by using the positive property of the exponential functions .
Revised:  The first contribution is that we remove the bounded below restriction of nonlinear free energy potential .
Edit intent: clarity
Original:  Another contribution is that the computations of \phi and the auxiliary variable r are totally decoupled in the discrete scheme based on E-SAV approach . Such modification is very efficient for fast calculation  .
Revised:  Another contribution is that we can discrete the auxiliary variable combined with the nonlinear term totally explicitly . Such modification is very efficient for fast calculation .
Edit intent: clarity
Original: We propose a quantum algorithm for solving random subset sum instances which play a crucial role in cryptographic constructions.
Revised: Solving random subset sum instances which play a crucial role in cryptographic constructions.
Edit intent: clarity
Original:  In 2013, Bernstein, Jeffery, Lange and Meurer constructed a quantum subset sum algorithm with heuristic time complexity  2^{0.241n} , by enhancing the classical random subset sum algorithm of Howgrave-Graham and Joux with a quantum walk technique  .
Revised:  In 2013, Bernstein, Jeffery, Lange and Meurer constructed a quantum subset sum algorithm with heuristic time complexity ( 2^{0.241n} , by enhancing the classical random subset sum algorithm of Howgrave-Graham and Joux with a quantum walk technique .
Edit intent: fluency
Original:  In 2018, Helm and May improved heuristic running time and memory to  2^{0.226n} by quantizing the classical Becker, Coron and Joux algorithm.
Revised:  In 2018, Helm and May improved heuristic running time and memory to ( 2^{0.226n} by quantizing the classical Becker, Coron and Joux algorithm.
Edit intent: fluency
Original:  In our paper, we get a new quantum algorithm with running time down to O(2^{0.209n}) for all but a negligible fraction of random subset sum instances by combining the classical sampling and quantum walks .
Revised:  In our paper, we get a new quantum algorithm with running time down to O(2^{0.209n}) .
Edit intent: coherence
Original:  SS3 was created to deal with risk detection over text streams and therefore not only supports incremental training and classification but also can visually explain its rationale.
Revised:  SS3 was created to deal with risk detection over text streams and , therefore, not only supports incremental training and classification but also can visually explain its rationale.
Edit intent: fluency
Original:  We believe this could be due to the unavailability of an open-source implementation of SS3. In this work, we introduce PySS3, a package that not only implements SS3 but also comes with visualization tools that allow researchers deploying robust, explainable  and trusty machine learning models for text classification.
Revised:  We believe this could be due to the unavailability of an open-source implementation of SS3. In this work, we introduce PySS3, a package that implements SS3 but also comes with visualization tools that allow researchers deploying robust, explainable and trusty machine learning models for text classification.
Edit intent: fluency
Original:  We believe this could be due to the unavailability of an open-source implementation of SS3. In this work, we introduce PySS3, a package that not only implements SS3 but also comes with visualization tools that allow researchers deploying robust, explainable  and trusty machine learning models for text classification.
Revised:  We believe this could be due to the unavailability of an open-source implementation of SS3. In this work, we introduce PySS3, a package that not only implements SS3 and also comes with visualization tools that allow researchers deploying robust, explainable and trusty machine learning models for text classification.
Edit intent: fluency
Original:  We believe this could be due to the unavailability of an open-source implementation of SS3. In this work, we introduce PySS3, a package that not only implements SS3 but also comes with visualization tools that allow researchers deploying robust, explainable  and trusty machine learning models for text classification.
Revised:  We believe this could be due to the unavailability of an open-source implementation of SS3. In this work, we introduce PySS3, a package that not only implements SS3 but also comes with visualization tools that allow researchers to deploy robust, explainable and trusty machine learning models for text classification.
Edit intent: fluency
Original:  We believe this could be due to the unavailability of an open-source implementation of SS3. In this work, we introduce PySS3, a package that not only implements SS3 but also comes with visualization tools that allow researchers deploying robust, explainable  and trusty machine learning models for text classification.
Revised:  We believe this could be due to the unavailability of an open-source implementation of SS3. In this work, we introduce PySS3, a package that not only implements SS3 but also comes with visualization tools that allow researchers deploying robust, explainable , and trusty machine learning models for text classification.
Edit intent: fluency
Original:  While anisotropic forces cannot be associated with a potential in general and stationary solutions of anisotropic aggregation equations generally cannot be regarded as minimizers of an energy functional , we derive equilibrium conditions for stationary line patterns in the setting of spatially homogeneous tensor fields which can be regarded as the minimizers of a regularised energy functional depending on a scalar potential.
Revised:  Anisotropic forces cannot be associated with a potential in general and stationary solutions of anisotropic aggregation equations generally cannot be regarded as minimizers of an energy functional , we derive equilibrium conditions for stationary line patterns in the setting of spatially homogeneous tensor fields which can be regarded as the minimizers of a regularised energy functional depending on a scalar potential.
Edit intent: coherence
Original:  While anisotropic forces cannot be associated with a potential in general and stationary solutions of anisotropic aggregation equations generally cannot be regarded as minimizers of an energy functional , we derive equilibrium conditions for stationary line patterns in the setting of spatially homogeneous tensor fields which can be regarded as the minimizers of a regularised energy functional depending on a scalar potential.
Revised:  While anisotropic forces cannot be associated with a potential in general and stationary solutions of anisotropic aggregation equations generally cannot be regarded as minimizers of an energy functional . We derive equilibrium conditions for stationary line patterns in the setting of spatially homogeneous tensor fields which can be regarded as the minimizers of a regularised energy functional depending on a scalar potential.
Edit intent: fluency
Original:  While anisotropic forces cannot be associated with a potential in general and stationary solutions of anisotropic aggregation equations generally cannot be regarded as minimizers of an energy functional , we derive equilibrium conditions for stationary line patterns in the setting of spatially homogeneous tensor fields which can be regarded as the minimizers of a regularised energy functional depending on a scalar potential.
Revised:  While anisotropic forces cannot be associated with a potential in general and stationary solutions of anisotropic aggregation equations generally cannot be regarded as minimizers of an energy functional , we derive equilibrium conditions for stationary line patterns in the setting of spatially homogeneous tensor fields . The stationary solutions can be regarded as the minimizers of a regularised energy functional depending on a scalar potential.
Edit intent: clarity
Original:  In particular, this dimension reduction allows us to study the associated one-dimensional problem instead of the two-dimensional setting.
Revised:  A dimension reduction from the two- to the one-dimensional setting allows us to study the associated one-dimensional problem instead of the two-dimensional setting.
Edit intent: clarity
Original:  For spatially homogeneous tensor fields, we show the existence of energy minimisers, establish \Gamma-convergence of the regularised energy functionals as the diffusion coefficient vanishes, and prove the convergence of minimisers of the regularised energy functional to minimisers of the non-regularised energy functional.
Revised:  We establish \Gamma-convergence of the regularised energy functionals as the diffusion coefficient vanishes, and prove the convergence of minimisers of the regularised energy functional to minimisers of the non-regularised energy functional.
Edit intent: clarity
Original: The ability to operate virtually anywhere and carry payload , make Unmanned Aerial Vehicles (UAVs) perfect platforms to carry communications nodes, including Wi-Fi Access Points (APs) and cellular Base Stations (BSs).
Revised: The ability to operate virtually anywhere and carry payload makes Unmanned Aerial Vehicles (UAVs) perfect platforms to carry communications nodes, including Wi-Fi Access Points (APs) and cellular Base Stations (BSs).
Edit intent: fluency
Original:  This is paving the way to the deployment of Flying Networks (FNs) that enable communications to ground users anywhere, anytime . Still, FNs impose significant challenges in order to meet the Quality of Experience expectations.
Revised:  This is paving the way to the deployment of flying networks that enable communications to ground users anywhere, anytime . Still, FNs impose significant challenges in order to meet the Quality of Experience expectations.
Edit intent: clarity
Original:  This is paving the way to the deployment of Flying Networks (FNs) that enable communications to ground users anywhere, anytime . Still, FNs impose significant challenges in order to meet the Quality of Experience expectations.
Revised:  This is paving the way to the deployment of Flying Networks (FNs) that enable communications to ground users anywhere, anytime . Still, flying networks impose significant challenges in order to meet the Quality of Experience expectations.
Edit intent: fluency
Original:  State of the art works addressed these challenges, but have been focused on routing and the placement of the UAVs as APs and BSs serving the users on the ground , overlooking the backhaul network design.
Revised:  State of the art works addressed these challenges, but have been focused on routing and the placement of the UAVs as APs and BSs serving the ground users , overlooking the backhaul network design.
Edit intent: clarity
Original:  The main contribution of this paper is a centralized traffic-aware Gateway UAV Placement (GWP) algorithm for FNs with controlled topology.
Revised:  The main contribution of this paper is a centralized traffic-aware Gateway UAV Placement (GWP) algorithm for flying networks with controlled topology.
Edit intent: clarity
Original:  GWP takes advantage of the knowledge of the offered traffic and the future topologies of the FN to enable backhaul communications paths with high enough capacity.
Revised:  GWP takes advantage of the knowledge of the offered traffic and the future topologies of the flying network to enable backhaul communications paths with high enough capacity.
Edit intent: clarity
Original:  The obtained results demonstrate significant gains regarding aggregate throughput and end-to-end delay.
Revised:  The obtained results demonstrate significant gains regarding aggregate throughput and delay.
Edit intent: clarity
Original: For safety-critical black-box optimization tasks, observations of the constraints and the objective are often noisy and available only inside the feasible set .
Revised: For safety-critical black-box optimization tasks, observations of the constraints and the objective are often noisy and available only for the feasible points .
Edit intent: clarity
Original:  We prove the convergence rate and  safety of our algorithm and demonstrate its performance in an application to an iterative control design problem.
Revised:  We prove the convergence rate and safety of our algorithm . We demonstrate its performance in an application to an iterative control design problem.
Edit intent: coherence
Original:  We propose an approach based on log barriers to find a local solution of a non-convex non-smooth black-box optimization problem \min f^0(x) subject to f^i(x)\leq 0,~ i = 1,\ldots, m, at the same time, guaranteeing constraint satisfaction while learning  with high probability.
Revised:  We propose an approach based on log barriers to find a local solution of a non-convex non-smooth black-box optimization problem \min f^0(x) subject to f^i(x)\leq 0,~ i = 1,\ldots, m, at the same time, guaranteeing constraint satisfaction while learning an optimal solution with high probability.
Edit intent: clarity
Original:  Internet plays a key role in accomplishing many tasks.
Revised: The Internet plays a key role in accomplishing many tasks.
Edit intent: clarity
Original:  We build a machine learning based classifier for distinguishing software engineering related search queries from other queries .
Revised:  To this end, we build a machine learning based classifier for distinguishing software engineering related search queries from other queries .
Edit intent: clarity
Original:  We also analyze 1 million web search sessions to understand how software engineering related queries and sessions differ from other queries and sessions.
Edit intent: coherence
Original:  Finally, we discuss  implications of this work on improving search engine support for developers and providing more effective and contextual assistance to developers using web resources.
Revised:  Finally, we discuss the implications of this work on improving search engine support for developers and providing more effective and contextual assistance to developers using web resources.
Edit intent: fluency
Original:  Similar to other domains, web search is also heavily used in software engineering (SE) to help with various SE specific tasks such as debugging, finding documentation,  installation, etc.
Revised:  Similar to other domains, web search is also heavily used in software engineering (SE) to help with various tasks such as debugging, finding documentation, installation, etc.
Edit intent: clarity
Original:  Similar to other domains, web search is also heavily used in software engineering (SE) to help with various SE specific tasks such as debugging, finding documentation,  installation, etc.
Revised:  Similar to other domains, web search is also heavily used in software engineering (SE) to help with various SE specific tasks such as finding documentation, installation, etc.
Edit intent: coherence
Original:  Similar to other domains, web search is also heavily used in software engineering (SE) to help with various SE specific tasks such as debugging, finding documentation,  installation, etc.
Revised:  Similar to other domains, web search is also heavily used in software engineering (SE) to help with various SE specific tasks such as debugging, finding documentation, debugging, installation, etc.
Edit intent: fluency
Original:  In this paper , we present the first large scale study on how web search is used in software engineering and maintenance.
Revised:  In this work , we present the first large scale study on how web search is used in software engineering and maintenance.
Edit intent: clarity
Original:  We then analyze 1 million web search sessions to understand how software engineering related queries and sessions differ from other queries and sessions.
Revised:  We then perform an analysis on one million search sessions to understand how software engineering related queries and sessions differ from other queries and sessions.
Edit intent: clarity
Original:  Subsequently, we define the taxonomy of intents behind the usage of web search by software engineers.
Revised:  Subsequently, we propose a taxonomy of intents behind the usage of web search by software engineers.
Edit intent: clarity
Original:  We then analyse 6 million SE queries to understand the distribution of intents across various web search metrics and other trend characteristics.
Revised:  We then analyse 6 million SE queries to understand the distribution , search metrics and other trend characteristics.
Edit intent: clarity
Original: We study robust versions of pricing problems where customers choose products according to a general extreme value (GEV) choice model, and the choice parameters are not given exactly but lie in an uncertainty set.
Revised: We study robust versions of pricing problems where customers choose products according to a generalized extreme value (GEV) choice model, and the choice parameters are not given exactly but lie in an uncertainty set.
Edit intent: fluency
Original: We study robust versions of pricing problems where customers choose products according to a general extreme value (GEV) choice model, and the choice parameters are not given exactly but lie in an uncertainty set.
Revised: We study robust versions of pricing problems where customers choose products according to a general extreme value (GEV) choice model, and the choice parameters are not known exactly but lie in an uncertainty set.
Edit intent: clarity
Original:  We show that, when the robust problem is unconstrained and the price sensitivity parameters are homogeneous, the robust optimal prices have a constant markup over products  and we provide formulas that allow to compute this constant markup by binary search.
Revised:  We show that, when the robust problem is unconstrained and the price sensitivity parameters are homogeneous, the robust optimal prices have a constant markup over products , and we provide formulas that allow to compute this constant markup by binary search.
Edit intent: fluency
Original:  We also show that, in the case that the price sensitivity parameters are only homogeneous in each subset of the products  and the uncertainty set is rectangular, the robust problem can be converted into a deterministic pricing problem and the robust optimal prices have a constant markup in each subset, and we also provide explicit formulas to compute them.
Revised:  We also show that, in the case that the price sensitivity parameters are only homogeneous in each partition of the products and the uncertainty set is rectangular, the robust problem can be converted into a deterministic pricing problem and the robust optimal prices have a constant markup in each subset, and we also provide explicit formulas to compute them.
Edit intent: clarity
Original:  We provide numerical results for the logit and nested logit model to illustrate the advantages of our approach .
Revised:  We provide numerical results to illustrate the advantages of our approach .
Edit intent: clarity
Original:  Our results generally hold  for any arbitrary GEV model, including the multinomial logit, nested or cross-nested logit.
Revised:  Our results generally hold and for any arbitrary GEV model, including the multinomial logit, nested or cross-nested logit.
Edit intent: fluency
Original:  The accuracy of the method is demonstrated on a number of examples in two and three spatial dimensions and compared to the commonly used approach of [2].
Revised:  The accuracy of the method is demonstrated on a number of examples in two and three spatial dimensions and compared to the approach of [2].
Edit intent: clarity
Original: The evidence says that liver disease detection using CAD is one of the most efficient techniques but the presence of better organization of studies and the performance parameters to represent the result analysis of the proposed techniques are pointedly missing in most of the recent studies.
Revised: The evidence says that liver disease detection using CAD is one of the most important things that both individuals and companies need. Information plays a huge role in our everyday life and keeping it safe should be our number one priority. Nowadays most of the recent studies.
Edit intent: coherence
Original:  To evaluate the proposed method, we conducted experiments on five different real-world datasets covering various application areas.
Revised:  To evaluate the proposed method, we conducted experiments on different real-world datasets covering various application areas.
Edit intent: clarity
Original: In this paper, we develop a new notion of entropy for uniform hypergraphs , which are generalized from graphs , based on tensor theory.
Revised: In this paper, we develop the notion of entropy for uniform hypergraphs , which are generalized from graphs , based on tensor theory.
Edit intent: clarity
Original: In this paper, we develop a new notion of entropy for uniform hypergraphs , which are generalized from graphs , based on tensor theory.
Revised: In this paper, we develop a new notion of entropy for uniform hypergraphs . Hypergraphs are generalized from graphs , based on tensor theory.
Edit intent: clarity