wanyu/IteraTeR_v2 huggingface dataset:
Original:  With order increasing , our method can even possess better performances than conforming finite element methods, which are traditionally the  choice to solve problems with high regularities.
Revised:  With order increasing , our method can even possess better performances than conforming finite element methods, which are traditionally the methods of choice to solve problems with high regularities.
Edit intent: clarity
Original:  However, Bloom Matrix does not meet the theoretical false positive rate of less than 10^{-2} for LOOKUP operations if the represented data is not uniformly distributed among  multiple sets.
Revised:  However, Bloom Matrix does not meet the theoretical false positive rate of less than 10^{-2} for LOOKUP operations if the represented data is not uniformly distributed among the multiple sets.
Edit intent: fluency
Original:  Galo is a novel system that automates this process.
Revised:  GALO is a novel system that automates this process.
Edit intent: clarity
Original:  Galo 's knowledge base is built on RDF and SPARQL, W3C graph database standards, which is well suited for manipulating and querying over SQL query plans, which are graphs themselves.
Revised:  GALO 's knowledge base is built on RDF and SPARQL, W3C graph database standards, which is well suited for manipulating and querying over SQL query plans, which are graphs themselves.
Edit intent: fluency
Original:  Galo acts as a third-tier of optimization , after query rewrite and cost-based optimization, as a query-plan rewrite.
Revised:  GALO acts as a third-tier of optimization , after query rewrite and cost-based optimization, as a query-plan rewrite.
Edit intent: fluency
Original:  Galo acts as a third-tier of optimization , after query rewrite and cost-based optimization, as a query-plan rewrite.
Revised:  Galo acts as a third-tier of re-optimization , after query rewrite and cost-based optimization, as a query-plan rewrite.
Edit intent: clarity
Original:  Galo 's knowledge base is also an invaluable tool for database experts to debug query performance issues by tracking to known issues and solutions as well as refining the optimizer with new and better tunned techniques by the development team.
Revised:  Galo 's knowledge base is also an invaluable tool for database experts to debug query performance issues by tracking to known issues and solutions as well as refining the optimizer with new tuned techniques by the development team.
Edit intent: clarity
Original:  Motivated by such a challenge in terms of algorithm design, we propose a novel algorithm inspired by Shapley value---a cooperative game-theoretic concept--- that is able to leverage the strong interdependencies in the effects of edge removals in the search space.
Revised:  Motivated by such a challenge in terms of algorithm design, we propose a novel algorithm inspired by Shapley value -- a cooperative game-theoretic concept--- that is able to leverage the strong interdependencies in the effects of edge removals in the search space.
Edit intent: fluency
Original:  Motivated by such a challenge in terms of algorithm design, we propose a novel algorithm inspired by Shapley value---a cooperative game-theoretic concept--- that is able to leverage the strong interdependencies in the effects of edge removals in the search space.
Revised:  Motivated by such a challenge in terms of algorithm design, we propose a novel algorithm inspired by Shapley value---a cooperative game-theoretic concept -- that is able to leverage the strong interdependencies in the effects of edge removals in the search space.
Edit intent: fluency
Original:  The estimation of the transfer time using solar sail between two arbitrary orbits is difficult and usually necessary to solve an optimal control problem.
Revised:  The estimation of the transfer time using solar sail between two arbitrary orbits is difficult and usually requires to solve an optimal control problem.
Edit intent: clarity
Original:  Furthermore, the Monte Carlo Tree Search method is investigated and used to search the optimal sequence for the multi-asteroid exploration problem.
Revised:  Furthermore, the Monte Carlo Tree Search method is investigated and used to search the optimal sequence considering a multi-asteroid exploration problem.
Edit intent: clarity
Original:  The sequences obtained by preliminary design will be solved and verified by sequentially solving the optimal control problem.
Revised:  The obtained sequences from preliminary design will be solved and verified by sequentially solving the optimal control problem.
Edit intent: clarity
Original:  They are applied in experiments of equivalence checking of quantum circuits.
Revised:  As an application, they are used in equivalence checking of quantum circuits.
Edit intent: clarity
Original:  Moreover, it is shown that the minimisation problem is proved to be in PSPACE.
Revised:  Moreover, the minimisation problem is proved to be in PSPACE.
Edit intent: coherence
Original:  The design and implementation of synthetic molecular communication systems at nano- and microscale are very challenging.
Revised:  The design and implementation of synthetic MC systems (MCSs) at nano- and microscale are very challenging.
Edit intent: clarity
Original:  The design and implementation of synthetic molecular communication systems at nano- and microscale are very challenging.
Revised:  The design and implementation of synthetic molecular communication systems at nano- and microscale is very challenging.
Edit intent: fluency
Original:  Furthermore, we outline the possible challenges arising in the implementation of the proposed transmitter and receiver architectures and options for intersymbol interference mitigation for the considered signaling particles .
Revised:  Furthermore, we outline the possible challenges arising in the implementation of the proposed transmitter and receiver architectures .
Edit intent: clarity
Original: Symmetry-preserving (mimetic) discretizations exhibit the same properties as the corresponding continuous differential operator  .
Revised: Symmetry-preserving (mimetic) discretization aims to preserve certain properties of a continuous differential operator .
Edit intent: clarity
Original:  and the method can be applied to a wide variety of continuous operators, including chain rules and advection operators , as illustrated by the shallow-water equations  .
Revised:  and the method can be applied to a wide variety of continuous operators, involving chain rules and advection operators , as illustrated by the shallow-water equations .
Edit intent: clarity
Original:  However, reactivation of a consolidated memory can temporarily return it to a hippocampus-dependent state .
Revised:  However, reactivation of a consolidated memory can induce a brief period of temporary hippocampus-dependence, followed by return to hippocampus-independence .
Edit intent: clarity
Original:  Here we present a computational model that uses a simulation of recently described mechanisms of synaptic plasticity to account for findings from the  consolidation/reconsolidation literature and to make predictions for future research.
Revised:  Here we present a computational model that uses simulation of recently described mechanisms of synaptic plasticity to account for findings from the consolidation/reconsolidation literature and to make predictions for future research.
Edit intent: fluency
Original: Recent work shows that people are not solely motivated by the economic consequences of the available actions, but they also have moral preferences for ` doing the right thing ' , independently of its economic consequences.
Revised: Recent work suggests that people are not solely motivated by the economic consequences of the available actions, but they also have moral preferences for ` doing the right thing ' , independently of its economic consequences.
Edit intent: clarity
Original: Recent work shows that people are not solely motivated by the economic consequences of the available actions, but they also have moral preferences for ` doing the right thing ' , independently of its economic consequences.
Revised: Recent work shows that people are not solely motivated by the economic consequences of the available actions, but they also have moral preferences for " doing the right thing ' , independently of its economic consequences.
Edit intent: fluency
Original: Recent work shows that people are not solely motivated by the economic consequences of the available actions, but they also have moral preferences for ` doing the right thing ' , independently of its economic consequences.
Revised: Recent work shows that people are not solely motivated by the economic consequences of the available actions, but they also have moral preferences for ` doing the right thing " , independently of its economic consequences.
Edit intent: fluency
Original:  As predicted, we find that the connotation of the word has a U-shaped effect on pro-sociality .
Revised:  As predicted, we find that the rate of pro-sociality .
Edit intent: clarity
Original:  In Study 2 (N=413, pre-registered) we make a step forward and we collect the self-reported moral judgment and feeling associated to each of the six words used in Study 1.
Revised:  In Study 2 (N=413, pre-registered) we collect the self-reported moral judgment and feeling associated to each of the six words used in Study 1.
Edit intent: clarity
Original:  We show that the rate of pro-sociality in Study 1 can be predicted from the moral judgments and the feelings in Study 2 via Krupka \& Weber's utility function.
Revised:  We show that these moral judgments and the feelings in Study 2 via Krupka \& Weber's utility function.
Edit intent: clarity
Original:  Here we shed light on this point with two experiments.
Revised:  Here we contribute to this debate with two experiments.
Edit intent: clarity
Original:  We experimentally manipulate the words describing the available actions using six words , from very negative (e.g., stealing) to very positive (e.g., donating) connotations.
Revised:  We experimentally manipulate the words describing the available actions using six terms , from very negative (e.g., stealing) to very positive (e.g., donating) connotations.
Edit intent: fluency
Original:  As we predicted, we find that the rate of pro-sociality is affected by the words used to describe the available actions.
Revised:  We find that the rate of pro-sociality is affected by the words used to describe the available actions.
Edit intent: coherence
Original:  In Study 2 (N= 413, pre-registered) we collect the self-reported moral judgment and feeling associated to each of the six words used in Study 1.
Revised:  In Study 2 (N= 413, pre-registered) we collect the self-reported moral judgment and feeling associated to each of the words used in Study 1.
Edit intent: clarity
Original:  We show that these moral judgments and feelings can explain the framing effects in Study 1.
Revised:  We show that these moral judgments explain the framing effects in Study 1.
Edit intent: clarity
Original:  We show that these moral judgments and feelings can explain the framing effects in Study 1.
Revised:  We show that these moral judgments and feelings can explain the framing effect in Study 1.
Edit intent: fluency
Original:  In sum, we find that changing only one word in the instructions of an extreme Dictator game can alter people's behavior, and that behavioral changes can be explained using moral judgments and feelings associated to these words .
Revised:  In sum, our studies provide evidence that framing effects in an extreme Dictator game can alter people's behavior, and that behavioral changes can be explained using moral judgments and feelings associated to these words .
Edit intent: clarity
Original:  In sum, we find that changing only one word in the instructions of an extreme Dictator game can alter people's behavior, and that behavioral changes can be explained using moral judgments and feelings associated to these words .
Revised:  In sum, we find that changing only one word in the instructions of an extreme Dictator game can be generated using morally loaded language .
Edit intent: clarity
Original: Understanding network topology is a fundamental aspect of network science that allows us to gather insights into the complicated relational architectures of the world we inhabit.
Revised: Network topology is a fundamental aspect of network science that allows us to gather insights into the complicated relational architectures of the world we inhabit.
Edit intent: clarity
Original:  Particularly, we consider how to explicitly characterise important physical concepts such as symmetry, organisation and complexity in neighbourhood degree sequences  .
Revised:  Particularly, we consider how to explicitly characterise important physical concepts such as symmetry, heterogeneity and organisation in neighbourhood degree sequences .
Edit intent: clarity
Original:  We find that these indices are neither highly correlated with each other nor with classical network indices, revealing a rich, new area of analysis in network topology.
Revised:  We find that these indices are neither highly correlated with each other nor with classical network indices, indicating a rich, new area of analysis in network topology.
Edit intent: clarity
Original:  Notably, social and biological networks show consistently higher levels of neighbourhood organisation than expected by random chance, while only the former shows consistent hierarchical complexity.
Revised:  Notably, while biological, social and technological networks all showed consistently large neighbourhood symmetry and organisation, only technological networks showed a small amount of hierarchical complexity.
Edit intent: clarity
Original:  The versatility of this newly recognised topologically descriptive tool shows potential for describing the unique characteristics of complex networks.
Revised:  The versatility of this newly recognised topologically descriptive tool shows potential for describing unique and important characteristics of complex networks.
Edit intent: clarity
Original:  We consider how to explicitly characterise important physical concepts such as symmetry , heterogeneity and organisation in neighbourhood degree sequences, as well as updating the notion of hierarchical complexity to reflect previously unnoticed organisational principles.
Revised:  We consider how to explicitly characterise important physical concepts such as similarity , heterogeneity and organisation in neighbourhood degree sequences, as well as updating the notion of hierarchical complexity to reflect previously unnoticed organisational principles.
Edit intent: clarity
Original:  We consider how to explicitly characterise important physical concepts such as symmetry , heterogeneity and organisation in neighbourhood degree sequences, as well as updating the notion of hierarchical complexity to reflect previously unnoticed organisational principles.
Revised:  We consider how to explicitly characterise important physical concepts such as symmetry , heterogeneity and organisation in these sequences, as well as updating the notion of hierarchical complexity to reflect previously unnoticed organisational principles.
Edit intent: clarity
Original:  Neighbourhood degree sequences of a wide variety of real world networks are found to be more symmetric, organised and complex than is expected for networks of their given degree distributions.
Revised:  Neighbourhood degree sequences of a wide variety of real world networks are found to have greater similarity and organisation than is expected for networks of their given degree distributions.
Edit intent: clarity
Original:  Notably, while biological, social and technological networks all showed consistently large neighbourhood symmetry and organisation, only technological networks showed a small amount of hierarchical complexity . Particularly, no statistical difference in hierarchical complexity was found between connectomes of different animal species and their configuration models.
Revised:  Notably, while biological, social and technological networks all showed consistently large neighbourhood similarity and organisation, only technological networks showed a small amount of hierarchical complexity . Particularly, no statistical difference in hierarchical complexity was found between connectomes of different animal species and their configuration models.
Edit intent: clarity
Original:  The cooling of molten metal inside the mold is achieved by passing a coolant, typically water through the cooling lines in the die.
Revised:  The cooling of molten metal inside the mold is achieved typically by passing water through the cooling lines in the die.
Edit intent: clarity
Original:  The non-dominated sorting genetic algorithm ( NSGA--II) which is popular for solving multi-objective optimization problems is used .
Revised:  The non-dominated sorting genetic algorithm ( NSGA-II) is used for multi-objective optimization problems is used .
Edit intent: clarity
Original:  The non-dominated sorting genetic algorithm ( NSGA--II) which is popular for solving multi-objective optimization problems is used .
Revised:  The non-dominated sorting genetic algorithm ( NSGA--II) which is popular for solving multi-objective optimization in this work .
Edit intent: clarity
Original:  The number of function evaluations required for NSGA--II can be of the order of millions and hence, the finite volume solver cannot be used directly for optimization.
Revised:  The number of function evaluations required for NSGA-II can be of the order of millions and hence, the finite volume solver cannot be used directly for optimization.
Edit intent: fluency
Original:  Simplified versions of the actual problem are designed to  verify results of the genetic algorithm.
Revised:  As an assessment, simplified versions of the actual problem are designed to verify results of the genetic algorithm.
Edit intent: clarity
Original:  Simplified versions of the actual problem are designed to  verify results of the genetic algorithm.
Revised:  Simplified versions of the actual problem are designed to first verify results of the genetic algorithm.
Edit intent: coherence
Original:  An innovative local sensitivity based approach is  used to rank the final Pareto optimal solutions and choose a single best design.
Revised:  An innovative local sensitivity based approach is then used to rank the final Pareto optimal solutions and choose a single best design.
Edit intent: coherence
Original:  An innovative local sensitivity based approach is  used to rank the final Pareto optimal solutions and choose a single best design.
Revised:  An innovative local sensitivity based approach is used to rank the final Pareto optimal solutions and select a single best design.
Edit intent: fluency
Original: Imitation learning is a control design paradigm that seeks to learn a control policy reproducing demonstrations from experts .
Revised: Imitation learning is a control design paradigm that seeks to learn a control policy reproducing demonstrations from expert agents .
Edit intent: clarity
Original:  By substituting expert 's demonstrations for optimal behaviours, the same paradigm leads to the design of control policies closely approximating the optimal state-feedback.
Revised:  By substituting expert demonstrations for optimal behaviours, the same paradigm leads to the design of control policies closely approximating the optimal state-feedback.
Edit intent: fluency
Original:  We have shown in previous work that, when restricted to relatively low-dimensional state and control spaces, this approach is very successful in several deterministic, non-linear problems in continuous-time.
Revised:  We have shown in previous work that, when restricted to low-dimensional state and control spaces, this approach is very successful in several deterministic, non-linear problems in continuous-time.
Edit intent: clarity
Original:  In this work, we refine our previous studies using as  test case a simple quadcopter model with quadratic and time-optimal objective functions.
Revised:  In this work, we refine our previous studies using as a test case a simple quadcopter model with quadratic and time-optimal objective functions.
Edit intent: fluency
Original:  We describe in detail the best learning pipeline we have developed and that is able to approximate via deep neural networks the state-feedback map to a very high accuracy.
Revised:  We describe in detail the best learning pipeline we have developed , that is able to approximate via deep neural networks the state-feedback map to a very high accuracy.
Edit intent: fluency
Original:  With respect to these metrics, we show that improvements in the mean average error do not necessarily correspond to significant improvements .
Revised:  With respect to these metrics, we show that improvements in the mean average error do not necessarily correspond to better policies .
Edit intent: clarity
Original:  In this paper we present a simple alternative  which, instead of rewiring, draws edges between pairs of nodes with a distance-based connection probability.
Revised:  In this paper we revisit a simple alternative which, instead of rewiring, draws edges between pairs of nodes with a distance-based connection probability.
Edit intent: clarity
Original:  In this paper we revisit a simple alternative  by Song and Wang, which, instead of rewiring, draws edges between pairs of nodes with a distance-based connection probability.
Revised:  In this paper we discuss a simple alternative by Song and Wang, which, instead of rewiring, draws edges between pairs of nodes with a distance-based connection probability.
Edit intent: clarity
Original:  In this paper we revisit a simple alternative  by Song and Wang, which, instead of rewiring, draws edges between pairs of nodes with a distance-based connection probability.
Revised:  In this paper we revisit a simple alternative by Song and Wang, where instead of rewiring, draws edges between pairs of nodes with a distance-based connection probability.
Edit intent: coherence
Original:  In this paper we revisit a simple alternative  by Song and Wang, which, instead of rewiring, draws edges between pairs of nodes with a distance-based connection probability.
Revised:  In this paper we revisit a simple alternative by Song and Wang, which, instead of rewiring, edges are drawn between pairs of nodes with a distance-based connection probability.
Edit intent: clarity
Original:  We show that this model is simpler to analyze and approaches the true Erd\H{os-R\'enyi }  random graph model in the corresponding limit.
Revised:  We show that this model is simpler to analyze , approaches the true Erd\H{os-R\'enyi } random graph model in the corresponding limit.
Edit intent: fluency
Original:  Consequently , the small-world effect is illustrated by showing that the clustering coefficient decreases much slower than an upper bound on the message delivery time with increasing long-range connection probability .
Revised:  Subsequently , the small-world effect is illustrated by showing that the clustering coefficient decreases much slower than an upper bound on the message delivery time with increasing long-range connection probability .
Edit intent: coherence
Original:  We propose this model as an alternative reference model for studying the influence of small-world topology on dynamic systems as well as a simple model to introduce numerous topics when teaching network science.
Revised:  We propose this model as an alternative reference model for studying the influence of small-world topologies on dynamic systems as well as a simple model to introduce numerous topics when teaching network science.
Edit intent: fluency
Original: We study clustering problems under the lens of%DIFDELCMD < {\em %%% algorithmic fairness inspired by the disparate impact doctrine.
Revised: We study %DIFDELCMD < {\em %%% algorithmic fairness inspired by the disparate impact doctrine.
Edit intent: clarity
Original: We study clustering problems under the lens of%DIFDELCMD < {\em %%% algorithmic fairness inspired by the disparate impact doctrine.
Revised: We study clustering problems under the lens of%DIFDELCMD < {\em %%% inspired by the disparate impact doctrine.
Edit intent: clarity