wanyu/IteraTeR_v2 huggingface dataset:
Original:  summation-by-parts and simultaneous-approximation-term operators, and it is as a generalization of previous works on discontinuous interface coupling  and solid wall boundary conditions  . Using the method of line approach , a semi-discrete entropy estimate for the entire domain is obtained when the proposed numerical imposition of boundary conditions are coupled with an entropy conservative or entropy stable discrete interior operator.
Revised:  summation-by-parts and simultaneous-approximation-term operators, and it is as a generalization of previous works on discontinuous interface coupling and solid wall boundary conditions . Using the method of line approach , a semi-discrete entropy estimate for the entire domain is obtained when the proposed numerical imposition of boundary conditions are coupled with an entropy-conservative or entropy-stable discrete interior operator.
Edit intent: fluency
Original:  Discontinuous spectral collocation operators  on high-order unstructured grids  are used for the purpose of demonstrating the robustness and efficacy of the new  boundary conditions.
Revised:  Discontinuous spectral collocation operators on high-order unstructured grids , are used for the purpose of demonstrating the robustness and efficacy of the new boundary conditions.
Edit intent: fluency
Original:  Numerical simulations confirm the non-linear stability and the reliability of the proposed techniques , with applications to three-dimensional subsonic and supersonic flows.
Revised:  Numerical simulations confirm the non-linear stability of the proposed techniques , with applications to three-dimensional subsonic and supersonic flows.
Edit intent: clarity
Original:  Numerical simulations confirm the non-linear stability and the reliability of the proposed techniques , with applications to three-dimensional subsonic and supersonic flows.
Revised:  Numerical simulations confirm the non-linear stability and the reliability of the proposed technique , with applications to three-dimensional subsonic and supersonic flows.
Edit intent: fluency
Original:  The procedure described is compatible with any diagonal norm summation-by-parts spatial operator, including finite element, finite difference, finite volume, discontinuous Galerkin, and flux reconstruction schemes.
Revised:  The procedure described is compatible with any diagonal-norm summation-by-parts spatial operator, including finite element, finite difference, finite volume, discontinuous Galerkin, and flux reconstruction schemes.
Edit intent: fluency
Original:  The procedure relies on the formalism and mimetic properties of diagonal-norm, summation-by-parts  and simultaneous-approximation-term operators, and is a generalization of previous works on discontinuous interface coupling [1] and solid wall boundary conditions [2].
Revised:  The procedure relies on the formalism and mimetic properties of diagonal-norm, summation-by-parts , and simultaneous-approximation-term operators, and is a generalization of previous works on discontinuous interface coupling [1] and solid wall boundary conditions [2].
Edit intent: fluency
Original:  This article explores a criterion for selecting the right parameter value by maximizing the probability of the data, {{with no prior knowledge of the noise variance}}.
Revised:  This article explores a criterion for selecting a good parameter value by maximizing the probability of the data, {{with no prior knowledge of the noise variance}}.
Edit intent: clarity
Original:  We present a general framework where multiple players are given one independent sample each about which they can only provide limited information to a central referee.
Revised:  We present a general framework where multiple players are given one independent sample , about which they can only provide limited information to a central referee.
Edit intent: clarity
Original:  Motivated by important instances of communication and privacy constraints, in our abstraction we allow each player to describe its observed sample to the referee using a channel from a prespecified family of channels %DIFDELCMD < \cal %%% W. This family%DIFDELCMD < \cal %%% W can be instantiated to capture both the communication- and privacy-constrained settings and beyond.
Revised:  Each player is allowed to describe its observed sample to the referee using a channel from a prespecified family of channels %DIFDELCMD < \cal %%% W. This family%DIFDELCMD < \cal %%% W can be instantiated to capture both the communication- and privacy-constrained settings and beyond.
Edit intent: coherence
Original:  Motivated by important instances of communication and privacy constraints, in our abstraction we allow each player to describe its observed sample to the referee using a channel from a prespecified family of channels %DIFDELCMD < \cal %%% W. This family%DIFDELCMD < \cal %%% W can be instantiated to capture both the communication- and privacy-constrained settings and beyond.
Revised:  Motivated by important instances of communication and privacy constraints, in our abstraction we allow each player to describe its observed sample to the referee using a channel from a family of channels %DIFDELCMD < \cal %%% W. This family%DIFDELCMD < \cal %%% W can be instantiated to capture both the communication- and privacy-constrained settings and beyond.
Edit intent: clarity
Original:  Motivated by important instances of communication and privacy constraints, in our abstraction we allow each player to describe its observed sample to the referee using a channel from a prespecified family of channels %DIFDELCMD < \cal %%% W. This family%DIFDELCMD < \cal %%% W can be instantiated to capture both the communication- and privacy-constrained settings and beyond.
Revised:  Motivated by important instances of communication and privacy constraints, in our abstraction we allow each player to describe its observed sample to the referee using a channel from a prespecified family of channels %DIFDELCMD < \cal %%% %DIFDELCMD < \cal %%% W can be instantiated to capture both the communication- and privacy-constrained settings and beyond.
Edit intent: coherence
Original:  The central referee uses the messages from players to solve an inference problem for the unknown underlying distribution that generated samples of the players .
Revised:  The referee uses the messages from players to solve an inference problem for the unknown underlying distribution that generated samples of the players .
Edit intent: clarity
Original:  The central referee uses the messages from players to solve an inference problem for the unknown underlying distribution that generated samples of the players .
Revised:  The central referee uses the messages from players to solve an inference problem for the unknown distribution that generated samples of the players .
Edit intent: clarity
Original:  The central referee uses the messages from players to solve an inference problem for the unknown underlying distribution that generated samples of the players .
Revised:  The central referee uses the messages from players to solve an inference problem for the unknown underlying distribution that generated the samples .
Edit intent: clarity
Original:  Underlying our lower bounds is a quantitative characterization of the contraction in chi-square distances between the observed distributions of the samples when an information constraint is placed.
Revised:  Underlying our bounds is a quantitative characterization of the contraction in chi-square distances between the observed distributions of the samples when an information constraint is placed.
Edit intent: clarity
Original:  Underlying our lower bounds is a quantitative characterization of the contraction in chi-square distances between the observed distributions of the samples when an information constraint is placed.
Revised:  Underlying our lower bounds is a characterization of the contraction in chi-square distances between the observed distributions of the samples when an information constraint is placed.
Edit intent: clarity
Original:  Underlying our lower bounds is a quantitative characterization of the contraction in chi-square distances between the observed distributions of the samples when an information constraint is placed.
Revised:  Underlying our lower bounds is a quantitative characterization of the contraction in chi-square distances between the observed distributions of the samples when information constraints are placed.
Edit intent: fluency
Original:  This contraction is captured in a local neighborhood in terms of chi-square and decoupled chi-square fluctuations of a given channel, two quantities we introduce in this work .
Revised:  This contraction is captured in a local neighborhood in terms of chi-square and decoupled chi-square fluctuations of a given channel, two quantities we introduce .
Edit intent: clarity
Original:  The former captures the average distance between  two product distributions  and the latter the distance of a product distribution to a mixture of product distributions.
Revised:  The former captures the average distance between two product distributions and the latter for a product distribution to a mixture of product distributions.
Edit intent: clarity
Original:  The former captures the average distance between  two product distributions  and the latter the distance of a product distribution to a mixture of product distributions.
Revised:  The former captures the average distance between two product distributions and the latter the distance of a product distribution and a mixture of product distributions.
Edit intent: fluency
Original:  In this work, we present Gumbel Graph Network  , a model-free  deep learning framework for dynamics learning and network reconstruction from the observed time series data.
Revised:  In this work, we introduce Gumbel Graph Network , a model-free deep learning framework for dynamics learning and network reconstruction from the observed time series data.
Edit intent: fluency
Original:  In this work, we introduce  Gumbel Graph Network (GGN),  a model-free, data-driven deep learning framework to accomplish network reconstruction and dynamics simulation .
Revised:  In this work, we introduce a new framework, Gumbel Graph Network (GGN), a model-free, data-driven deep learning framework to accomplish network reconstruction and dynamics simulation .
Edit intent: clarity
Original:  In this work, we introduce  Gumbel Graph Network (GGN),  a model-free, data-driven deep learning framework to accomplish network reconstruction and dynamics simulation .
Revised:  In this work, we introduce Gumbel Graph Network (GGN), which is a model-free, data-driven deep learning framework to accomplish network reconstruction and dynamics simulation .
Edit intent: coherence
Original:  In this work, we introduce  Gumbel Graph Network (GGN),  a model-free, data-driven deep learning framework to accomplish network reconstruction and dynamics simulation .
Revised:  In this work, we introduce Gumbel Graph Network (GGN), a model-free, data-driven deep learning framework to accomplish the reconstruction of both network connections and the dynamics on it .
Edit intent: clarity
Original: The Sinc approximation has shown its high efficiency for numerical methods in many fields.
Revised: The Sinc approximation has shown high efficiency for numerical methods in many fields.
Edit intent: clarity
Original:  an appropriate conformal map should be employed to apply the Sinc approximation in general . Appropriate conformal maps were already proposed for typical cases , but it does not mean that they are optimal.
Revised:  an appropriate conformal map must be employed to apply the Sinc approximation in general . Appropriate conformal maps were already proposed for typical cases , but it does not mean that they are optimal.
Edit intent: clarity
Original:  an appropriate conformal map should be employed to apply the Sinc approximation in general . Appropriate conformal maps were already proposed for typical cases , but it does not mean that they are optimal.
Revised:  an appropriate conformal map should be employed to apply the Sinc approximation . Appropriate conformal maps were already proposed for typical cases , but it does not mean that they are optimal.
Edit intent: coherence
Original:  an appropriate conformal map should be employed to apply the Sinc approximation in general . Appropriate conformal maps were already proposed for typical cases , but it does not mean that they are optimal.
Revised:  an appropriate conformal map should be employed to apply the Sinc approximation in general . Appropriate conformal maps have been proposed for typical cases , but it does not mean that they are optimal.
Edit intent: coherence
Original:  In other words, if one employs another conformal map instead of existing one, the performance of the Sinc approximation may be improved  .
Revised:  In other words, if one employs another conformal map instead of existing one, the performance of the Sinc approximation may be improved by using another conformal map rather than an existing map .
Edit intent: clarity
Original:  Then, we show in both theoretical and numerical ways that the convergence rate is improved by replacing the existing conformal map with the proposed one .
Revised:  Then, we demonstrate in both theoretical and numerical ways that the convergence rate is improved by replacing the existing conformal map with the proposed one .
Edit intent: coherence
Original:  Then, we show in both theoretical and numerical ways that the convergence rate is improved by replacing the existing conformal map with the proposed one .
Revised:  Then, we show in both theoretical and numerical ways that the convergence rate is improved by replacing the existing conformal map with the proposed map .
Edit intent: clarity
Original: Next generation networks are expected to be ultra dense and aim to explore spectrum sharing paradigm that allows users to communicate in licensed, shared as well as unlicensed spectrum.
Revised: Next generation networks are expected to be ultradense and aim to explore spectrum sharing paradigm that allows users to communicate in licensed, shared as well as unlicensed spectrum.
Edit intent: fluency
Original:  To minimize signaling overhead, an ad-hoc approach is being considered for users communicating in an unlicensed and shared spectrum.
Revised:  To minimize signaling overhead, an adhoc approach is being considered for users communicating in an unlicensed and shared spectrum.
Edit intent: fluency
Original:  To minimize signaling overhead, an ad-hoc approach is being considered for users communicating in an unlicensed and shared spectrum.
Revised:  To minimize signaling overhead, an ad-hoc approach is being considered for users communicating in the unlicensed and shared spectrum.
Edit intent: fluency
Original:  A collision occurs when multiple users transmit simultaneously on the same channel, 2) Channel qualities may be heterogeneous, i.e., they are not same across all users, and moreover  are unknown, and 3) The network could be dynamic where users can enter or leave anytime.
Revised:  A collision occurs when multiple users transmit simultaneously on the same channel, 2) Channel qualities may be heterogeneous, i.e., they are not same across all users, and moreover , are unknown, and 3) The network could be dynamic where users can enter or leave anytime.
Edit intent: fluency
Original:  The algorithms aim to achieve stable orthogonal allocation (SOC) in finite time and meet the above three constraints with two novel characteristics: 1) Low complex narrowband radio compared to wideband radio in existing works, and 2) Epoch-less approach for dynamic networks.
Revised:  The algorithms aim to achieve stable orthogonal allocation (SOC) in finite time and meet the above three constraints with two novel characteristics: 1) Low complexity narrowband radio compared to wideband radio in existing works, and 2) Epoch-less approach for dynamic networks.
Edit intent: fluency
Original:  We establish  convergence of our algorithms to SOC and validate via extensive simulation experiments.
Revised:  We establish a convergence of our algorithms to SOC and validate via extensive simulation experiments.
Edit intent: fluency
Original: Recently, a self-embedding fragile watermark scheme based on reference-bits interleaving and adaptive selection of embedding mode is proposed.
Revised: Recently, a self-embedding fragile watermark scheme based on reference-bits interleaving and adaptive selection of embedding mode was proposed.
Edit intent: fluency
Original:  We find this scheme has a feature of block independence of embedding watermark such that it is vulnerable to a collage attack.
Revised:  We find this algorithm has a feature of block independence of embedding watermark such that it is vulnerable to a collage attack.
Edit intent: clarity
Original:  In addition, because the generation of authentication bits via hash function operations is not related to secret keys, we can apply a multiple stego-image attack on this scheme and the cost of acquiring all the permutation relations  (i.e., equivalent permutation keys) of l\cdot b^2 watermark bits of all blocks is about (l\cdot b^2)!
Revised:  In addition, because the generation of authentication bits via hash function operations is not related to secret keys, we analyze this algorithm by a multiple stego-image attack on this scheme and the cost of acquiring all the permutation relations (i.e., equivalent permutation keys) of l\cdot b^2 watermark bits of all blocks is about (l\cdot b^2)!
Edit intent: clarity
Original:  In addition, because the generation of authentication bits via hash function operations is not related to secret keys, we can apply a multiple stego-image attack on this scheme and the cost of acquiring all the permutation relations  (i.e., equivalent permutation keys) of l\cdot b^2 watermark bits of all blocks is about (l\cdot b^2)!
Revised:  In addition, because the generation of authentication bits via hash function operations is not related to secret keys, we can apply a multiple stego-image attack . We find that the cost of acquiring all the permutation relations (i.e., equivalent permutation keys) of l\cdot b^2 watermark bits of all blocks is about (l\cdot b^2)!
Edit intent: coherence
Original:  In addition, because the generation of authentication bits via hash function operations is not related to secret keys, we can apply a multiple stego-image attack on this scheme and the cost of acquiring all the permutation relations  (i.e., equivalent permutation keys) of l\cdot b^2 watermark bits of all blocks is about (l\cdot b^2)!
Revised:  In addition, because the generation of authentication bits via hash function operations is not related to secret keys, we can apply a multiple stego-image attack on this scheme and the cost of obtaining all the permutation relations (i.e., equivalent permutation keys) of l\cdot b^2 watermark bits of all blocks is about (l\cdot b^2)!
Edit intent: fluency
Original:  In addition, because the generation of authentication bits via hash function operations is not related to secret keys, we can apply a multiple stego-image attack on this scheme and the cost of acquiring all the permutation relations  (i.e., equivalent permutation keys) of l\cdot b^2 watermark bits of all blocks is about (l\cdot b^2)!
Revised:  In addition, because the generation of authentication bits via hash function operations is not related to secret keys, we can apply a multiple stego-image attack on this scheme and the cost of acquiring all the permutation relations (i.e., equivalent permutation keys) is about (l\cdot b^2)!
Edit intent: coherence
Original:  Finally, we propose a simple modification to the dynamic equation that can be interpreted as a gradient flow system for the Lyapunov functional.
Edit intent: coherence
Original: Reinforcement learning (RL) algorithms have been around for decades and been employed to solve various sequential decision-making problems.
Revised: Reinforcement learning (RL) algorithms have been around for decades and employed to solve various sequential decision-making problems.
Edit intent: fluency
Original:  This paper addresses an important aspect of deep RL related to situations that demand multiple agents to communicate and cooperate to solve complex tasks.
Revised:  This paper addresses an important aspect of deep RL related to situations that require multiple agents to communicate and cooperate to solve complex tasks.
Edit intent: fluency
Original: Heart transplant patients are followed for up to a year with periodic right heart catheterizations (RHCs) to identify post-transplant complications and guide treatment.
Revised: Heart transplant patients are followed with periodic right heart catheterizations (RHCs) to identify post-transplant complications and guide treatment.
Edit intent: clarity
Original:  Positive outcomes are associated with a steady reduction of right ventricular and pulmonary artery pressure post-transplant toward normal levels of right-side pressure (about 20mmHg) as measured by right heart catheterization.
Revised:  Post-transplant positive outcomes are associated with a steady reduction of right ventricular and pulmonary artery pressure post-transplant toward normal levels of right-side pressure (about 20mmHg) as measured by right heart catheterization.
Edit intent: clarity
Original:  Positive outcomes are associated with a steady reduction of right ventricular and pulmonary artery pressure post-transplant toward normal levels of right-side pressure (about 20mmHg) as measured by right heart catheterization.
Revised:  Positive outcomes are associated with a steady reduction of right ventricular and pulmonary arterial pressures, toward normal levels of right-side pressure (about 20mmHg) as measured by right heart catheterization.
Edit intent: clarity
Original:  The purpose of this study is two-fold : to understand how cardiovascular system models can be used to represent a patient's cardiovascular state  and to use these models on a subset of patients where we have longitudinal RHCs over the span of the first year to track post-transplant recovery and outcome.
Revised:  The purpose of this study is two-fold : to understand how cardiovascular system models can be used to represent a patient's cardiovascular state , and to use these models on a subset of patients where we have longitudinal RHCs over the span of the first year to track post-transplant recovery and outcome.
Edit intent: fluency
Original:  The purpose of this study is two-fold : to understand how cardiovascular system models can be used to represent a patient's cardiovascular state  and to use these models on a subset of patients where we have longitudinal RHCs over the span of the first year to track post-transplant recovery and outcome.
Revised:  The purpose of this study is two-fold : to understand how cardiovascular system models can be used to represent a patient's cardiovascular state and to use these models to track post-transplant recovery and outcome.
Edit intent: coherence
Original:  The cardiovascular systems model used here and its underlying mechanistic parameters are evaluated using sensitivity analysis, parameter subset selection and parameter identifiability to understand what information about the cardiovascular state can be reliably extracted from  RHC data.
Revised:  To obtain reliable parameter estimates comparable within and across datasets, we use sensitivity analysis, parameter subset selection and parameter identifiability to understand what information about the cardiovascular state can be reliably extracted from RHC data.
Edit intent: clarity
Original:  The cardiovascular systems model used here and its underlying mechanistic parameters are evaluated using sensitivity analysis, parameter subset selection and parameter identifiability to understand what information about the cardiovascular state can be reliably extracted from  RHC data.
Revised:  The cardiovascular systems model used here and its underlying mechanistic parameters are evaluated using sensitivity analysis, parameter subset selection and parameter identifiability to understand what information about the cardiovascular state can be reliably extracted from the RHC data.
Edit intent: fluency