wanyu/IteraTeR_v2 huggingface dataset:
Original: This work proposes a thermal finite element model for the simulation of metal powder bed fusion additive manufacturing processes on macroscale with a focus on phase change and latent heat effects . Specifically,  two well-known existing schemes for the numerical treatment of phase change and latent heat, namely the apparent capacity and the so-called heat integration scheme, are critically reviewed and compared with respect to numerical efficiency and overall accuracy.
Revised: This work proposes a thermal finite element model for the simulation of metal powder bed fusion additive manufacturing processes on macroscale with a focus on phase change and latent heat effects . Specifically, two well-known schemes for the numerical treatment of phase change and latent heat, namely the apparent capacity and the so-called heat integration scheme, are critically reviewed and compared with respect to numerical efficiency and overall accuracy.
Edit intent: clarity
Original: This work proposes a thermal finite element model for the simulation of metal powder bed fusion additive manufacturing processes on macroscale with a focus on phase change and latent heat effects . Specifically,  two well-known existing schemes for the numerical treatment of phase change and latent heat, namely the apparent capacity and the so-called heat integration scheme, are critically reviewed and compared with respect to numerical efficiency and overall accuracy.
Revised: This work proposes a thermal finite element model for the simulation of metal powder bed fusion additive manufacturing processes on macroscale with a focus on phase change and latent heat effects . Specifically, two well-known existing schemes for the numerical treatment of latent heat, namely the apparent capacity and the so-called heat integration scheme, are critically reviewed and compared with respect to numerical efficiency and overall accuracy.
Edit intent: fluency
Original:  Moreover , a novel variant of the heat integration scheme is proposed , which allows for improved efficiency and accuracy  as compared to the original method.
Revised:  Eventually , a novel variant of the heat integration scheme is proposed , which allows for improved efficiency and accuracy as compared to the original method.
Edit intent: coherence
Original: We develop a framework for designing tractable heuristics for Markov Decision Processes (MDP), and use it to obtain constant regret policies for a variety of online allocation problems, including online packing, budget-constrained probing, dynamic pricing, and online contextual bandits with knapsacks.
Revised: We develop a framework for designing simple and efficient policies for a variety of online allocation problems, including online packing, budget-constrained probing, dynamic pricing, and online contextual bandits with knapsacks.
Edit intent: clarity
Original: We develop a framework for designing tractable heuristics for Markov Decision Processes (MDP), and use it to obtain constant regret policies for a variety of online allocation problems, including online packing, budget-constrained probing, dynamic pricing, and online contextual bandits with knapsacks.
Revised: We develop a framework for designing tractable heuristics for Markov Decision Processes (MDP), and use it to obtain constant regret policies for a family of online allocation problems, including online packing, budget-constrained probing, dynamic pricing, and online contextual bandits with knapsacks.
Edit intent: clarity
Original: We develop a framework for designing tractable heuristics for Markov Decision Processes (MDP), and use it to obtain constant regret policies for a variety of online allocation problems, including online packing, budget-constrained probing, dynamic pricing, and online contextual bandits with knapsacks.
Revised: We develop a framework for designing tractable heuristics for Markov Decision Processes (MDP), and use it to obtain constant regret policies for a variety of online allocation and pricing problems, that includes online packing, budget-constrained probing, dynamic pricing, and online contextual bandits with knapsacks.
Edit intent: clarity
Original:  In this paper, we shall study a unified framework of robust submodular optimization.
Revised: Robust optimization is becoming increasingly important in machine learning applications. In this paper, we shall study a unified framework of robust submodular optimization.
Edit intent: coherence
Original:  In this paper, we shall study a unified framework of robust submodular optimization.
Revised:  In this paper, we study a unified framework of robust submodular optimization.
Edit intent: coherence
Original:  We do this under a broad range of combinatorial constraints including cardinality, knapsack, matroid as well as graph based constraints such as cuts, paths, matchings and trees.
Revised:  We do this under a broad range of combinatorial constraints including cardinality, knapsack, matroid as well as graph-based constraints such as cuts, paths, matchings and trees.
Edit intent: fluency
Original:  According to these models, facial mimicry may contribute to the visual perceptual processing of facial expressions by influencing early stages of face processing, thus playing a crucial role in understanding the observed emotion .
Revised:  According to these models, facial mimicry may contribute to the visual processing of facial expressions by influencing early stages of face processing, thus playing a crucial role in understanding the observed emotion .
Edit intent: clarity
Original:  According to these models, facial mimicry may contribute to the visual perceptual processing of facial expressions by influencing early stages of face processing, thus playing a crucial role in understanding the observed emotion .
Revised:  According to these models, facial mimicry may contribute to the visual perceptual processing of facial expressions by influencing early stages .
Edit intent: coherence
Original:  The aim of the present study was to assess whether and how early sensorimotor simulation influences face structural encoding/ processing.
Revised:  The aim of the present study was to assess whether / how early sensorimotor simulation influences face structural encoding/ processing.
Edit intent: fluency
Original:  The aim of the present study was to assess whether and how early sensorimotor simulation influences face structural encoding/ processing.
Revised:  The aim of the present study was to assess whether and how early sensorimotor simulation influences early stages of face processing.
Edit intent: clarity
Original:  A secondary aim was to investigate whether there is a relationship between alexithymic traits and sensorimotor simulation as a mechanism for fine facial expression discrimination.
Revised:  A secondary aim was to investigate the relationship between alexithymic traits and sensorimotor simulation as a mechanism for fine facial expression discrimination.
Edit intent: clarity
Original:  An animal discrimination task was implemented as a control condition.
Revised:  An animal discrimination task as control condition.
Edit intent: clarity
Original:  In half of the experiment, participants could freely use their facial mimicry whereas , in the other half, they had their facial mimicry blocked by a gel.
Revised:  In half of the experiment, participants could freely use their facial mimicry whereas in the other half, they had their facial mimicry blocked by a gel.
Edit intent: fluency
Original:  This paper presents GDTL, a gradual dependently-typed language , with an emphasis on pragmatic dependently-typed programming.
Revised:  This paper presents GDTL, a gradual dependently-typed language that emphasizes pragmatic dependently-typed programming.
Edit intent: clarity
Original:  This problem can be solved by employing network coding technique which allows intermediate nodes to perform the coding operation instead of  store and forward the received data.
Revised:  This problem can be solved by employing network coding technique which allows intermediate nodes to perform the coding operation instead of conventional store and forward the received data.
Edit intent: clarity
Original:  A new NCMP model  which considers both minimize the resources needed to perform coding operation and dynamic change in network topology due to disconnection is proposed . Based on this new NCMP model, an effective and novel GA is proposed by implementing problem specific GA operators into the evolutionary process.
Revised:  A new NCMP model is proposed which considers both minimize the resources needed to perform coding operation and dynamic change in network topology due to disconnection is proposed . Based on this new NCMP model, an effective and novel GA is proposed by implementing problem specific GA operators into the evolutionary process.
Edit intent: fluency
Original:  A new NCMP model  which considers both minimize the resources needed to perform coding operation and dynamic change in network topology due to disconnection is proposed . Based on this new NCMP model, an effective and novel GA is proposed by implementing problem specific GA operators into the evolutionary process.
Revised:  A new NCMP model which considers both minimize the resources needed to perform coding operation and dynamic change in network topology due to disconnection . Based on this new NCMP model, an effective and novel GA is proposed by implementing problem specific GA operators into the evolutionary process.
Edit intent: fluency
Original:  We then solve numerically the dual problem, which involves a fully nonlinear Hamilton--Jacobi--Bellman equation.
Revised:  Then we solve numerically the dual problem, which involves a fully nonlinear Hamilton--Jacobi--Bellman equation.
Edit intent: coherence
Original:  We then solve numerically the dual problem, which involves a fully nonlinear Hamilton--Jacobi--Bellman equation.
Revised:  We then solve numerically the dual problem, which involves a fully non-linear Hamilton-Jacobi-Bellman equation.
Edit intent: fluency
Original:  Cournot game is the essential market model for many socio-economic systems where players learn and compete without the full knowledge of the system or  each other.
Revised:  Cournot game is the essential model for many socio-economic systems where players learn and compete without the full knowledge of the system or each other.
Edit intent: clarity
Original:  Cournot game is the essential market model for many socio-economic systems where players learn and compete without the full knowledge of the system or  each other.
Revised:  Cournot game is the essential market model for many socio-economic systems where players learn and compete without the full knowledge of the system or of each other.
Edit intent: fluency
Original:  In this  setting, it becomes important to understand the dynamics and limiting behavior of the players.
Revised:  In this limited information setting, it becomes important to understand the dynamics and limiting behavior of the players.
Edit intent: clarity
Original:  We consider concave Cournot games and two widely used learning strategies in the form of no-regret algorithms and policy gradient.
Revised:  Specifically, we assume players follow strategies such that in hindsight their payoffs are not exceeded by any single deviating action. Given this no-regret algorithms and policy gradient.
Edit intent: clarity
Original:   Together, our work presents significantly sharper convergence results and shows how exploiting the structure of the game can lead to much faster convergence rates.
Revised:  Together, our work presents significantly sharper convergence results and shows how exploiting the game information feedback can influence the convergence rates.
Edit intent: clarity
Original:  Given this no-regret guarantee, we prove that under standard assumptions, the players' joint action (both in the sense of time average and final iteration convergence) converges to the unique Nash equilibrium.
Revised:  Given this no-regret guarantee, we prove that under standard assumptions, the players' actual sequence of action converges to the unique Nash equilibrium.
Edit intent: clarity
Original:  In addition, our results naturally extend the existing regret analysis on time average convergence to obtain final iteration convergence rates.
Revised:  In addition, our results naturally extend the no-regret learning algorithms' time-average regret bounds to obtain the final-iteration convergence rates.
Edit intent: clarity
Original: The Trusted Platform Module (TPM) version 2.0 , which has been demonstrated as a key element of Industry 4.0, presents a two-phase key exchange primitive for secure communications between Industry 4.0 components.
Revised: The Trusted Platform Module (TPM) version 2.0 provides a two-phase key exchange primitive for secure communications between Industry 4.0 components.
Edit intent: clarity
Original:  To make TPM 2.0 applicable to real-world networks, we present a revision of the key exchange primitive of TPM 2.0, which can keep secure without the limiting conditions.
Revised:  To make TPM 2.0 applicable to real-world networks, we present a revision of the key exchange primitive of TPM 2.0, which can be secure without the limiting conditions.
Edit intent: clarity
Original:  Parareal and multigrid-reduction-in-time (MGRIT) are two popular parallel-in-time algorithms .
Revised:  Parareal and multigrid-reduction-in-time (MGRIT) parallel-in-time algorithms .
Edit intent: clarity
Original:  On the other hand, some schemes do not obtain h-optimal convergence, and two-level convergence is restricted to certain parameter regimes.
Revised:  On the other hand, some schemes do not obtain h-optimal convergence, and two-level convergence is restricted to certain regimes.
Edit intent: clarity
Original:   Numerical results confirm the analysis in the practical setting and , in particular, emphasize the importance of a priori analysis in choosing an effective coarse-grid scheme and coarsening factor.
Revised:  Numerical results confirm the analysis in practice and emphasize the importance of a priori analysis in choosing an effective coarse-grid scheme and coarsening factor.
Edit intent: clarity
Original: Life science today involves computational analysis of a large amount and variety of data, such as volumetric data acquired by state-of-the-art microscopes, or mesh data resulting from analysis of such data or simulations.
Revised: Life science today involves computational analysis of a large amount and variety of data, such as volumetric data acquired by state-of-the-art microscopes, or mesh data from analysis of such data or simulations.
Edit intent: clarity
Original:  Visualisation is often the first step in making sense of the data, and a crucial part of building and debugging analysis pipelines.
Revised:  Visualization is often the first step in making sense of the data, and a crucial part of building and debugging analysis pipelines.
Edit intent: fluency
Original:  Visualisation is often the first step in making sense of the data, and a crucial part of building and debugging analysis pipelines.
Revised:  Visualisation is often the first step in making sense of data, and a crucial part of building and debugging analysis pipelines.
Edit intent: fluency
Original:  It is therefore important that visualisations can be quickly prototyped, as well as developed or embedded into full applications.
Revised:  It is therefore important that visualizations can be quickly prototyped, as well as developed or embedded into full applications.
Edit intent: fluency
Original:  In this work we introduce scenery, a flexible VR/AR visualisation framework for the Java VM that can handle mesh and arbitrarily large volumetric data, containing multiple views, timepoints, and color channels. scenery is free and open-source software, works on all major platforms  and uses the Vulkan or OpenGL rendering APIs.
Revised:  In this work we introduce scenery, a flexible VR/AR visualization framework for the Java VM that can handle mesh and arbitrarily large volumetric data, containing multiple views, timepoints, and color channels. scenery is free and open-source software, works on all major platforms and uses the Vulkan or OpenGL rendering APIs.
Edit intent: fluency
Original:  In this work we introduce scenery, a flexible VR/AR visualisation framework for the Java VM that can handle mesh and arbitrarily large volumetric data, containing multiple views, timepoints, and color channels. scenery is free and open-source software, works on all major platforms  and uses the Vulkan or OpenGL rendering APIs.
Revised:  In this work we introduce scenery, a flexible VR/AR visualisation framework for the Java VM that can handle mesh and large volumetric data, containing multiple views, timepoints, and color channels. scenery is free and open-source software, works on all major platforms and uses the Vulkan or OpenGL rendering APIs.
Edit intent: clarity
Original:  In this work we introduce scenery, a flexible VR/AR visualisation framework for the Java VM that can handle mesh and arbitrarily large volumetric data, containing multiple views, timepoints, and color channels. scenery is free and open-source software, works on all major platforms  and uses the Vulkan or OpenGL rendering APIs.
Revised:  In this work we introduce scenery, a flexible VR/AR visualisation framework for the Java VM that can handle mesh and arbitrarily large volumetric data, containing multiple views, timepoints, and color channels. scenery is free and open-source software, works on all major platforms , and uses the Vulkan or OpenGL rendering APIs.
Edit intent: fluency
Original:  We introduce scenery's main features and detail example applications, such as its use in  the biomedical image analysis software Fiji, or for visualising agent-based simulations.
Revised:  We introduce scenery's main features and example applications, such as its use in the biomedical image analysis software Fiji, or for visualising agent-based simulations.
Edit intent: clarity
Original:  We introduce scenery's main features and detail example applications, such as its use in  the biomedical image analysis software Fiji, or for visualising agent-based simulations.
Revised:  We introduce scenery's main features and detail example applications, such as its use in the biomedical image analysis software Fiji, or for visualizing agent-based simulations.
Edit intent: fluency
Original: In this paper, we propose the Isogeometric Residual Minimization (iGRM) with direction splitting .
Revised: In this paper, we introduce the isoGeometric Residual Minimization (iGRM) with direction splitting .
Edit intent: clarity
Original: In this paper, we propose the Isogeometric Residual Minimization (iGRM) with direction splitting .
Revised: In this paper, we propose the Isogeometric Residual Minimization (iGRM) method .
Edit intent: clarity
Original:  The resulting method is not restricted to a Kronecker product structure of the diffusion or advection data .
Revised:  The iGRM method delivers similar quality solutions as the DPG method, it uses smaller grids, it does not require breaking of the spaces, but it is limited to tensor-product meshes. The computational cost of the iGRM is higher than for SUPG, but it does not require the determination of problem specific parameters .
Edit intent: coherence
Original:  In this article, we provide a brief survey of existing and emerging problem variants.
Revised:  In this article, we provide a concise overview of existing and emerging problem variants.
Edit intent: clarity
Original: Noise suppression systems generally produce output speech with copromised quality.
Revised: Noise suppression systems generally produce output speech with compromised quality.
Edit intent: fluency
Original:  In this work , we examine a different fidelity term, which has been implicitly used by the recently proposed iterative denoising and backward projections (IDBP) framework.
Revised:  In this paper , we examine a different fidelity term, which has been implicitly used by the recently proposed iterative denoising and backward projections (IDBP) framework.
Edit intent: clarity
Original:  The goal of this article is to develop and analyze an MGRIT algorithm, using FCF-relaxation with time-dependent time-grid propagators, to seek the finite element approximations of two-dimensional unsteady fractional Laplacian problems.
Revised:  The goal of this article is to develop and analyze a MGRIT algorithm, using FCF-relaxation with time-dependent time-grid propagators, to seek the finite element approximations of two-dimensional unsteady fractional Laplacian problems.
Edit intent: fluency
Original:  The goal of this article is to develop and analyze an MGRIT algorithm, using FCF-relaxation with time-dependent time-grid propagators, to seek the finite element approximations of two-dimensional unsteady fractional Laplacian problems.
Revised:  The goal of this article is to develop and analyze an MGRIT algorithm, using FCF-relaxation with time-dependent time-grid propagators, to seek the finite element approximations of unsteady fractional Laplacian problems.
Edit intent: clarity
Original:  Appl. 40 (2019) , pp. 564-608 ], we provide a new temporal eigenvalue approximation property and then deduce a generalized two-level convergence theory which removes the previous unitary diagonalization assumption on the fine and coarse time-grid propagators   . Numerical computations are included to confirm  theoretical predictions and demonstrate the sharpness of the derived convergence upper bound.
Revised:  Appl. 40 (2019) 564--608 ], we provide a new temporal eigenvalue approximation property and then deduce a generalized two-level convergence theory which removes the previous unitary diagonalization assumption on the fine and coarse time-grid propagators . Numerical computations are included to confirm theoretical predictions and demonstrate the sharpness of the derived convergence upper bound.
Edit intent: coherence
Original:  Appl. 40 (2019) , pp. 564-608 ], we provide a new temporal eigenvalue approximation property and then deduce a generalized two-level convergence theory which removes the previous unitary diagonalization assumption on the fine and coarse time-grid propagators   . Numerical computations are included to confirm  theoretical predictions and demonstrate the sharpness of the derived convergence upper bound.
Revised:  Appl. 40 (2019) , pp. 564-608 ], we provide a new temporal eigenvalue approximation property and then deduce a generalized two-level convergence theory which removes the previous unitary diagonalization assumption on the fine and coarse time-grid propagators . Numerical computations are included to confirm the theoretical predictions and demonstrate the sharpness of the derived convergence upper bound.
Edit intent: fluency
Original:  The main idea is to identify a ``core'' of an MDP, i.e., a subsystem where we provably remain with high probability, and to avoid computation on the less relevant rest of the state space.
Revised:  The main idea is to identify a "core" of an MDP, i.e., a subsystem where we provably remain with high probability, and to avoid computation on the less relevant rest of the state space.
Edit intent: fluency
Original:  By bringing this unifying invariance approach into ecology, one can see that the log series pattern of species abundances dominates when the consequences of density dependent processes are invariant to  addition or multiplication  .
Revised:  By bringing this unifying invariance approach into ecology, we show that the log series pattern of species abundances dominates when the consequences of density dependent processes are invariant to addition or multiplication .
Edit intent: clarity
Original:  By bringing this unifying invariance approach into ecology, one can see that the log series pattern of species abundances dominates when the consequences of density dependent processes are invariant to  addition or multiplication  .
Revised:  By bringing this unifying invariance approach into ecology, one can see that the log series pattern dominates when the consequences of density dependent processes are invariant to addition or multiplication .
Edit intent: clarity