wanyu/IteraTeR_v2 huggingface dataset:
Original: Among various optimization algorithms, ADAM can achieve outstanding performance and has been widely used in model learning.
Revised: Among various optimization algorithms, ADAM can achieve outstanding performance and have been widely used in model learning.
Edit intent: fluency
Original:  ADAM has the advantages of fast convergence with both momentum and adaptive learning rate.
Revised:  ADAM has the advantages of fast convergence with both the momentum term and the adaptive learning rate.
Edit intent: clarity
Original:  For deep neural network learning problems, since their objective functions are nonconvex, ADAM can also get stuck in local optima easily.
Revised:  However, since the loss functions of most deep neural networks are non-convex, ADAM also shares the drawback of getting stuck in local optima easily.
Edit intent: clarity
Original:  We will show that after adding the boosting strategy to the GADAM model , it can help unit models jump out the local optima and converge to better solutions.
Revised:  We will show that adding the boosting strategy to the GADAM model , it can help unit models jump out the local optima and converge to better solutions.
Edit intent: coherence
Original:  We will show that after adding the boosting strategy to the GADAM model , it can help unit models jump out the local optima and converge to better solutions.
Revised:  We will show that after adding the boosting strategy into the BGADAM model can help models jump out the local optima and converge to better solutions.
Edit intent: clarity
Original:  In this paper, we consider graph embeddings with an error-free (errorless) associative learning update rule, which models the embedding vector of node as a non-convex Gaussian mixture of the embeddings of the nodes in its immediate vicinity with some constant variance that is reduced as iterations progress.
Revised:  In this paper, we consider graph embeddings with an error-free associative learning update rule, which models the embedding vector of node as a non-convex Gaussian mixture of the embeddings of the nodes in its immediate vicinity with some constant variance that is reduced as iterations progress.
Edit intent: clarity
Original:  We study the efficacy of proposed method on several benchmark data sets in 1 and favorably compare with state of the art methods.
Revised:  We study the efficacy of proposed method on several benchmark data sets 1 and favorably compare with state of the art methods.
Edit intent: fluency
Original:  We study the efficacy of proposed method on several benchmark data sets in 1 and favorably compare with state of the art methods.
Revised:  We study the efficacy of proposed method on several benchmark data sets in and favorably compare with state of the art methods.
Edit intent: fluency
Original:  For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and prune and regraft (PR) ( resp. subtree prune and regraft (SPR) on trees).
Revised:  For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and prune and regraft (PR) ( called subtree prune and regraft (SPR) on trees).
Edit intent: fluency
Original:  The utility of these different metrics or set of metrics depend on the context and application, and whether a predictive mechanistic model exists.
Revised:  The utility of these different metrics or sets of metrics depend on the context and application, and whether a predictive mechanistic model exists.
Edit intent: fluency
Original:  In this topical review, we outline the various definitions of "diversity" and provide examples of scientific topics in which its quantification plays an important role.
Revised:  In this topical review, we outline the various definitions of `diversity' and providing examples of scientific topics in which its quantification plays an important role.
Edit intent: fluency
Original:  We  review how diversity is a ubiquitous concept across multiple fields including ecology, immunology, cellular barcoding studies, and social economic studies.
Revised:  We then review how diversity is a ubiquitous concept across multiple fields including ecology, immunology, cellular barcoding studies, and social economic studies.
Edit intent: coherence
Original:  We  review how diversity is a ubiquitous concept across multiple fields including ecology, immunology, cellular barcoding studies, and social economic studies.
Revised:  We review how diversity has been a ubiquitous concept across multiple fields including ecology, immunology, cellular barcoding studies, and social economic studies.
Edit intent: fluency
Original:  We  review how diversity is a ubiquitous concept across multiple fields including ecology, immunology, cellular barcoding studies, and social economic studies.
Revised:  We review how diversity is a ubiquitous concept across multiple fields including ecology, immunology, cellular barcoding experiments, and socioeconomic studies.
Edit intent: clarity
Original: A general framework, known as extended Galerkin method, is presented in this paper for the derivation and analysis of many different types of finite element methods (including various discontinuous Galerkin methods).
Revised: A general analysis framework is presented in this paper for the derivation and analysis of many different types of finite element methods (including various discontinuous Galerkin methods).
Edit intent: clarity
Original: A general framework, known as extended Galerkin method, is presented in this paper for the derivation and analysis of many different types of finite element methods (including various discontinuous Galerkin methods).
Revised: A general framework, known as extended Galerkin method, is presented in this paper for many different types of finite element methods (including various discontinuous Galerkin methods).
Edit intent: clarity
Original:  As a result, most existing finite element and discontinuous Galerkin methods can be derived and analyzed using this general theory by making appropriate choices of discretization spaces and penalization parameters.
Revised:  As a result, most existing finite element and discontinuous Galerkin methods can be analyzed using this general theory by making appropriate choices of discretization spaces and penalization parameters.
Edit intent: clarity
Original:  As a result, most existing finite element and discontinuous Galerkin methods can be derived and analyzed using this general theory by making appropriate choices of discretization spaces and penalization parameters.
Revised:  As a result, most existing finite element and discontinuous Galerkin methods can be derived and analyzed using this general framework by making appropriate choices of discretization spaces and penalization parameters.
Edit intent: clarity
Original:  Most research has focused on problems in 2d, but 3d contact representations have also been investigated, mostly concerning fully-dimensional geometric objects such as spheres or cubes.
Revised:  Most research has focused on problems in 2D, but 3D contact representations have also been investigated, mostly concerning fully-dimensional geometric objects such as spheres or cubes.
Edit intent: fluency
Original:  In this paper we study contact representations with convex polygons in 3d .
Revised:  In this paper we study contact representations with convex polygons in 3D .
Edit intent: fluency
Original:  First, we present a nonlinear formulation of the finite element heterogeneous multiscale method FE-HMM in a Lagrangean formulation that covers geometrical nonlinearity and, more generally , hyperelasticity.
Revised:  First, we present a nonlinear formulation of the finite element heterogeneous multiscale method FE-HMM in a Lagrangean formulation that covers geometrical nonlinearity and, more general , hyperelasticity.
Edit intent: fluency
Original:  Second,  we revise the standard solution algorithm of FE^2 which is a staggered scheme in terms of a nested loop embedding the full solution of the micro-problem into one macro-solution iteration step.
Revised:  Second, we revise the standard solution algorithm of FE^2 which is a staggered scheme in terms of a nested loop embedding the full solution of the micro problem into one macro solution iteration step.
Edit intent: fluency
Original:  We demonstrate that suchlike staggered scheme, which is typically realized by a nested two-level Newton algorithm, can safely and efficiently be replaced by direct alternations between micro- and macro iterations.
Revised:  We demonstrate that suchlike staggered scheme, which is typically realized by a nested two-level Newton algorithm, can safely and efficiently be replaced by direct alternations between micro and macro iterations.
Edit intent: fluency
Original:  The novel algorithmic structure is exemplarily detailed for the proposed nonlinear FE-HMM, its efficiency is substantiated by a considerable speed-up in numerical tests .
Revised:  The novel algorithmic structure is exemplarily detailed for the proposed nonlinear FE-HMM, its efficiency is substantiated by a considerable speedup in numerical tests .
Edit intent: fluency
Original: This paper studies the problem of strategic choice of arrival time to a single-server queue with opening and closing times when there is uncertainty regarding service speed.
Revised: We study the problem of strategic choice of arrival time to a single-server queue with opening and closing times when there is uncertainty regarding service speed.
Edit intent: clarity
Original:  A Poisson population of customers need to arrive during a specified acceptance period and are served on a first-come first-served basis.
Revised:  A Poisson population of customers choose their arrival time with the goal of minimizing their expected waiting times and are served on a first-come first-served basis.
Edit intent: clarity
Original:  We assume there are two types of customers that differ in their beliefs regarding the service time distribution.
Revised:  There are two types of customers that differ in their beliefs regarding the service time distribution.
Edit intent: coherence
Original:  Assuming that customers are aware of the two types of customers with differing beliefs , we characterize the Nash equilibrium arrival profiles for exponentially distributed service times and  provide an explicit solution for a fluid approximation of this game.
Revised:  Assuming that customers are aware of the two types of populations with differing beliefs , we characterize the Nash equilibrium arrival profiles for exponentially distributed service times and provide an explicit solution for a fluid approximation of this game.
Edit intent: clarity
Original:  Assuming that customers are aware of the two types of customers with differing beliefs , we characterize the Nash equilibrium arrival profiles for exponentially distributed service times and  provide an explicit solution for a fluid approximation of this game.
Revised:  Assuming that customers are aware of the two types of customers with differing beliefs . We characterize the Nash equilibrium arrival profiles for exponentially distributed service times and provide an explicit solution for a fluid approximation of this game.
Edit intent: fluency
Original:  Assuming that customers are aware of the two types of customers with differing beliefs , we characterize the Nash equilibrium arrival profiles for exponentially distributed service times and  provide an explicit solution for a fluid approximation of this game.
Revised:  Assuming that customers are aware of the two types of customers with differing beliefs , we characterize the Nash equilibrium dynamics for exponentially distributed service times and provide an explicit solution for a fluid approximation of this game.
Edit intent: clarity
Original:  Assuming that customers are aware of the two types of customers with differing beliefs , we characterize the Nash equilibrium arrival profiles for exponentially distributed service times and  provide an explicit solution for a fluid approximation of this game.
Revised:  Assuming that customers are aware of the two types of customers with differing beliefs , we characterize the Nash equilibrium arrival profiles for exponentially distributed service times and provide an explicit solution for a fluid approximation of the game.
Edit intent: clarity
Original:  Furthermore, we present a dynamic learning model in which customers make joining decisions based  on their signals and past experience.
Revised:  Furthermore, we present a dynamic learning model in which customers make joining decisions based solely on their signals and past experience.
Edit intent: clarity
Original:  The learning model assumes customers do not know all of the system and uncertainty parameters, or are unable to correctly compute the respective posterior expected waiting times.
Edit intent: coherence
Original:  (2) DQO can be used to precompute and synthesise database operators and any other database component as  Algorithmic Views ( AVs ). (3) We identify the Algorithmic View Selection Problem (AVSP), i.e. which AVs should be materialized when?
Revised:  (2) DQO can be used to precompute and synthesise database operators and any other database component as Algorithmic Views ( AVs ). (3) We identify the Algorithmic View Selection Problem (AVSP), i.e. which MAVs should be materialised when?
Edit intent: clarity
Original: Many engineering systems contain cables as subsystems including suspension lines for parachutes, cables in suspended bridges, risers in offshore platforms, airborne refueling systems , and so on . However, the interactions between fluid and cable subsystems receive little attention in the  open literature.
Revised: Many engineering systems contain cables as subsystems including suspension lines for parachutes, cables in suspended bridges, risers in offshore platforms, airborne refueling systems , and so on . However, the nature and consequences of such Fluid-Structure Interactions (FSI) have received relatively little attention in the open literature.
Edit intent: clarity
Original:  This work proposes an embedded surface approach , in which the dynamics of the  cable is captured by beam elements typically found in finite element structural models, and the geometry of the cable is represented by an embedded surface.
Revised:  This work proposes an embedded surface approach , in which the dynamics of the cable is captured by beam elements typically found in finite element structural codes, while the geometry of the cable is represented by an embedded surface.
Edit intent: coherence
Original:  It is built on: master/slave kinematics between beam elements  (master) , and the embedded surface  (slave);
Revised:  It is built on: master/slave kinematics between beam elements ~ (master) , and the embedded surface (slave);
Edit intent: fluency
Original:  It is built on: master/slave kinematics between beam elements  (master) , and the embedded surface  (slave);
Revised:  It is built on: master/slave kinematics between beam elements (master) and the embedded surface (slave);
Edit intent: fluency
Original:  It is built on: master/slave kinematics between beam elements  (master) , and the embedded surface  (slave);
Revised:  It is built on: master/slave kinematics between beam elements (master) , and the embedded surface ~ (slave);
Edit intent: fluency
Original:  and an energy-conserving method for transferring distributed forces and moments acting on the nodes of the discrete surface to  beam elements.
Revised:  and an energy-conserving method for transferring distributed forces and moments acting on the nodes of the discrete surface to the beam elements.
Edit intent: fluency
Original:  Hence, both  flow-induced forces on the cable and  effect of the structural dynamic response of the cable on the nearby flow are taken into account.
Revised:  Hence, both the flow-induced forces on the cable and effect of the structural dynamic response of the cable on the nearby flow are taken into account.
Edit intent: fluency
Original:  Hence, both  flow-induced forces on the cable and  effect of the structural dynamic response of the cable on the nearby flow are taken into account.
Revised:  Hence, both flow-induced forces on the cable and the effect of the structural dynamic response of the cable on the nearby flow are taken into account.
Edit intent: fluency
Original:  Moreover, the proposed model can be easily incorporated in the Eulerian computation framework, which enables handling  large deformations of the cable subsystem.
Revised:  Moreover, the proposed model can be readily incorporated into the Eulerian computational framework, which enables handling large deformations of the cable subsystem.
Edit intent: clarity
Original:  Moreover, the proposed model can be easily incorporated in the Eulerian computation framework, which enables handling  large deformations of the cable subsystem.
Revised:  Moreover, the proposed model can be easily incorporated in the Eulerian computation framework, which enables handling of the large deformations of the cable subsystem.
Edit intent: fluency
Original:  Finally, the effectiveness of the proposed model is demonstrated using a model airborne refueling system and a challenging supersonic parachute inflation problem.
Revised:  The effectiveness of the proposed model is demonstrated using a model airborne refueling system and a challenging supersonic parachute inflation problem.
Edit intent: coherence
Original:  Finally, the effectiveness of the proposed model is demonstrated using a model airborne refueling system and a challenging supersonic parachute inflation problem.
Revised:  Finally, the effectiveness of the proposed approach is demonstrated using a model airborne refueling system and a challenging supersonic parachute inflation problem.
Edit intent: clarity
Original:  Finally, the effectiveness of the proposed model is demonstrated using a model airborne refueling system and a challenging supersonic parachute inflation problem.
Revised:  Finally, the effectiveness of the proposed model is demonstrated using a model aerial refueling system and a challenging supersonic parachute inflation problem.
Edit intent: fluency
Original: Cable subsystems characterized by one or more extremely long, slender  and flexible structural elements are featured in numerous engineering systems including parachutes, suspension bridges, marine drilling risers, and aerial refueling equipment .
Revised: Cable subsystems characterized by long, slender and flexible structural elements are featured in numerous engineering systems including parachutes, suspension bridges, marine drilling risers, and aerial refueling equipment .
Edit intent: clarity
Original: Cable subsystems characterized by one or more extremely long, slender  and flexible structural elements are featured in numerous engineering systems including parachutes, suspension bridges, marine drilling risers, and aerial refueling equipment .
Revised: Cable subsystems characterized by one or more extremely long, slender , and flexible structural elements are featured in numerous engineering systems including parachutes, suspension bridges, marine drilling risers, and aerial refueling equipment .
Edit intent: fluency
Original: Cable subsystems characterized by one or more extremely long, slender  and flexible structural elements are featured in numerous engineering systems including parachutes, suspension bridges, marine drilling risers, and aerial refueling equipment .
Revised: Cable subsystems characterized by one or more extremely long, slender and flexible structural elements are featured in numerous engineering systems .
Edit intent: coherence
Original:  In each one of these systems , interaction between the cable and its surrounding fluid is inevitable.
Revised:  In each of them , interaction between the cable and its surrounding fluid is inevitable.
Edit intent: clarity
Original:  In each one of these systems , interaction between the cable and its surrounding fluid is inevitable.
Revised:  In each one of these systems , interaction between an individual cable and the surrounding fluid is inevitable.
Edit intent: clarity
Original:  However, the nature and consequences of such Fluid-Structure Interactions (FSI) have received relatively little attention in the computational mechanics open literature.
Revised:  Such a Fluid-Structure Interactions (FSI) have received relatively little attention in the computational mechanics open literature.
Edit intent: clarity
Original:  However, the nature and consequences of such Fluid-Structure Interactions (FSI) have received relatively little attention in the computational mechanics open literature.
Revised:  However, the nature and consequences of such Fluid-Structure Interaction (FSI) have received relatively little attention in the computational mechanics open literature.
Edit intent: fluency
Original:  However, the nature and consequences of such Fluid-Structure Interactions (FSI) have received relatively little attention in the computational mechanics open literature.
Revised:  However, the nature and consequences of such Fluid-Structure Interactions (FSI) has received little attention in the computational mechanics open literature.
Edit intent: clarity
Original:  This work proposes an embedded boundary approach for simulating the FSI of cable subsystems, in which the dynamics of the solid cable is captured by a discretization of the cable centerline using conventional beam elements which are typically available in commercial and open source finite element structural codes, while the geometry of the cable is represented within the fluid domain using a discrete -- for instance, triangulated -- embedded surface .
Revised:  This work proposes an embedded boundary approach for filling this gap, where the dynamics of the solid cable is captured by a discretization of the cable centerline using conventional beam elements which are typically available in commercial and open source finite element structural codes, while the geometry of the cable is represented within the fluid domain using a discrete -- for instance, triangulated -- embedded surface .
Edit intent: clarity
Original:  This work proposes an embedded boundary approach for simulating the FSI of cable subsystems, in which the dynamics of the solid cable is captured by a discretization of the cable centerline using conventional beam elements which are typically available in commercial and open source finite element structural codes, while the geometry of the cable is represented within the fluid domain using a discrete -- for instance, triangulated -- embedded surface .
Revised:  This work proposes an embedded boundary approach for simulating the FSI of cable subsystems, in which the dynamics of the cable are captured by a discretization of the cable centerline using conventional beam elements which are typically available in commercial and open source finite element structural codes, while the geometry of the cable is represented within the fluid domain using a discrete -- for instance, triangulated -- embedded surface .
Edit intent: clarity
Original:  This work proposes an embedded boundary approach for simulating the FSI of cable subsystems, in which the dynamics of the solid cable is captured by a discretization of the cable centerline using conventional beam elements which are typically available in commercial and open source finite element structural codes, while the geometry of the cable is represented within the fluid domain using a discrete -- for instance, triangulated -- embedded surface .
Revised:  This work proposes an embedded boundary approach for simulating the FSI of cable subsystems, in which the dynamics of the solid cable is captured by a standard finite element representation \mathcal C of its centerline, while its geometry is represented by a discrete surface \Sigma_h that is embedded in the fluid mesh .
Edit intent: clarity