wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this work, a discontinuous Galerkin (DG) method-based unit-cell scheme for efficient simulation of PCDs with periodic nanostructures is proposed.
Revised:  In this work, a discontinuous Galerkin (DG) -based unit-cell scheme for efficient simulation of PCDs with periodic nanostructures is proposed.
Edit intent: clarity
Original:  The resulting DG-based unit-cell scheme is significantly faster than the DG scheme that takes into account the whole device .
Revised:  Numerical results demonstrate that the proposed DG-based unit-cell scheme is significantly faster than the DG scheme that takes into account the whole device .
Edit intent: clarity
Original:  The resulting DG-based unit-cell scheme is significantly faster than the DG scheme that takes into account the whole device .
Revised:  The resulting DG-based unit-cell scheme has the same accuracy in predicting the THz photocurrent as the DG framework that takes into account the whole device .
Edit intent: clarity
Original:  We also apply  METASET to eliminate inherent overlaps in a dataset of 3D unit cells created with symmetry rules, distilling it down to the most unique families  .
Revised:  We also apply METASET to eliminate inherent overlaps in a dataset of 3D unit cells created with symmetry rules, illustrating that our flexible method can distill the most unique families .
Edit intent: clarity
Original:  However, the dependence on data induces a unique challenge: An imbalanced dataset containing more of certain shapes or physical properties than others can be detrimental to the efficacy of the approachesand any models built on those sets .
Revised:  However, the dependence on data induces a unique challenge: An imbalanced dataset containing more of certain shapes or physical properties can be detrimental to the efficacy of the approachesand any models built on those sets .
Edit intent: clarity
Original:  However, the dependence on data induces a unique challenge: An imbalanced dataset containing more of certain shapes or physical properties than others can be detrimental to the efficacy of the approachesand any models built on those sets .
Revised:  However, the dependence on data induces a unique challenge: An imbalanced dataset containing more of certain shapes or physical properties than others can be detrimental to the efficacy of data-driven approaches .
Edit intent: clarity
Original:  We also apply different shape similarity metrics within METASET to eliminate inherent overlaps in a dataset of 3D unit cells created with symmetry rules, illustrating that our flexible method can distill the most unique families regardless of the metric employed.
Revised:  By eliminating inherent overlaps in a dataset of 3D unit cells created with symmetry rules, illustrating that our flexible method can distill the most unique families regardless of the metric employed.
Edit intent: coherence
Original:  We also apply different shape similarity metrics within METASET to eliminate inherent overlaps in a dataset of 3D unit cells created with symmetry rules, illustrating that our flexible method can distill the most unique families regardless of the metric employed.
Revised:  We also apply different shape similarity metrics within METASET to eliminate inherent overlaps in a dataset of 3D unit cells created with symmetry rules, we also illustrate that our flexible method can distill the most unique families regardless of the metric employed.
Edit intent: coherence
Original:  We also apply different shape similarity metrics within METASET to eliminate inherent overlaps in a dataset of 3D unit cells created with symmetry rules, illustrating that our flexible method can distill the most unique families regardless of the metric employed.
Revised:  We also apply different shape similarity metrics within METASET to eliminate inherent overlaps in a dataset of 3D unit cells created with symmetry rules, illustrating that our flexible method can distill unique subsets regardless of the metric employed.
Edit intent: clarity
Original:  In Japan, in addition to affordable wide coverage health insurance systems, no medical collapse was observed , making accurate comparisons between prefectures possible.
Revised:  During the pandemic, affordable healthcare was widely available in Japan and the medical system did not suffer a collapse , making accurate comparisons between prefectures possible.
Edit intent: clarity
Original:  Experimental results of disease transmission confirms that contact tracing requires both significant visibility (at least 60 %DIFDELCMD < \\%%% %DIF < ) into the proximity graph and the ability to place half of the  population under isolation , in order to stop the disease .
Revised:  Experimental results of disease transmission confirms that contact tracing requires both significant visibility (at least 60 %DIFDELCMD < \\%%% %DIF < ) into the proximity graph and the ability to place half of the population under isolation .
Edit intent: coherence
Original:  We find that pro-actively isolating super-links -- key proximity encounters -- has significant benefits -- targeted isolation of a fourth of the population based on 35 %DIFDELCMD < \\%%% %DIF < visibility into the proximity graph prevents an epidemic outbreak.
Revised:  We find that pro-actively isolating super-links -- key proximity encounters -- has significant benefits : targeted isolation of a fourth of the population based on 35 %DIFDELCMD < \\%%% %DIF < visibility into the proximity graph prevents an epidemic outbreak.
Edit intent: fluency
Original:  Incorrect orthology assignments therefore are always false positives in the Reciprocal Best Match Graph .
Revised:  Incorrect orthology assignments therefore are always false positives in the reciprocal best match graph .
Edit intent: fluency
Original: In this paper, we consider the Cahn-Hilliard equation on evolving surfaces with prescribed velocity and a general non-linear potential  .
Revised: In this paper, we consider the Cahn--Hilliard equation on evolving surfaces with prescribed velocity and a general non-linear potential .
Edit intent: fluency
Original:  High-order evolving surface finite elements are used to discretise the weak equation system in space, and a modified matrix-vector formulation for the semi-discrete problem is derived.
Revised:  High-order evolving surface finite elements are used to discretise the weak equation system in space, and a modified matrix--vector formulation for the semi-discrete problem is derived.
Edit intent: fluency
Original:  The anti-symmetric structure of the weak equation system is preserved by the matrix-vector formulation and it is utilised to prove optimal-order and uniform-in-time error estimates.
Revised:  The anti-symmetric structure of the equation system is preserved by the matrix-vector formulation and it is utilised to prove optimal-order and uniform-in-time error estimates.
Edit intent: clarity
Original:  An extension of the  convergence results is given for general non-linear Cahn-Hilliard equations on evolving surfaces.
Revised:  An extension of the convergence results is given for generalised non-linear Cahn-Hilliard equations on evolving surfaces.
Edit intent: clarity
Original:  An extension of the  convergence results is given for general non-linear Cahn-Hilliard equations on evolving surfaces.
Revised:  An extension of the convergence results is given for general non-linear Cahn--Hilliard-type equations on evolving surfaces.
Edit intent: clarity
Original:  With that results, we then study the optimum level of redundancy from the perspective of average job compute time and compute time predictability.
Revised:  We next show that this balanced assignment of non-overlapping batches achieves lower average job compute time and compute time predictability.
Edit intent: clarity
Original:  We derive the efficient redundancy level as a function of tasks' service time distribution .
Revised:  We derive the efficient redundancy level as a function of the service time distribution .
Edit intent: clarity
Original:  Finally, by running experiments on Google cluster traces, we show that a careful planning of redundancy according to the tasks' service time distribution can speed up the computing job by an order of magnitude  .
Revised:  Finally, by running experiments on Google cluster traces, we observe that redundancy can reduce the compute time of the jobs in Google clusters by an order of magnitude .
Edit intent: clarity
Original: While many approaches exist in the literature to learn  representations for data collections in multiple modalities, the generalizability of the learnt representations to previously unseen data is a largely overlooked subject.
Revised: While many approaches exist in the literature to learn representations for data collections in multiple modalities, the generalizability of the learnt representations to previously unseen data is a rather overlooked subject.
Edit intent: clarity
Original:  In particular, we obtain guarantees for deep CNNs , deep ffNN, and universal Gaussian processes .
Revised:  In particular, we obtain guarantees for deep CNNs and deep feed-forward networks .
Edit intent: clarity
Original:  By using that interpretation, it is also proved that IEL^{-} has good proof-theoretical properties.
Revised:  By using that interpretation, it is also proved that IEL^{-} has good proof-theoretic properties.
Edit intent: clarity
Original:  The correspondence between deductions and typed terms is then extended to a categorial semantics for identity of proofs in IEL^{-} showing the general structure of such a modality for belief in an intuitionistic framework.
Revised:  The correspondence between deductions and typed terms is then extended to a categorical semantics for identity of proofs in IEL^{-} showing the general structure of such a modality for belief in an intuitionistic framework.
Edit intent: fluency
Original:  [ STOC1992 ];
Revised:  [ STOC'1992 ];
Edit intent: fluency
Original:  We obtain new bounds on the cover and hitting times and make progress towards resolving a conjecture of Azar et al. on maximising values of the stationary distribution .
Revised:  We obtain new bounds on the cover and hitting times . Azar et al. on maximising values of the stationary distribution .
Edit intent: clarity
Original:  This allows us to analyze the full space of maps and extract multiple diverse and accurate solutions, rather than optimizing for a single optimal correspondence as done in  previous approaches.
Revised:  This allows us to analyze the full space of maps and extract multiple diverse and accurate solutions, rather than optimizing for a single optimal correspondence as done in most previous approaches.
Edit intent: clarity
Original: The perfectly matched layer (PML) is one of the most popular domain truncation techniques used in differential-equation based wave-type equation solvers.
Revised: Wrapping a computation domain with a perfectly matched layer (PML) is one of the most popular domain truncation techniques used in differential-equation based wave-type equation solvers.
Edit intent: clarity
Original:  First, this paper demonstrates oracle experiments to show that a straightforward online extension, in which SA-EEND is performed independently for each chunked recording, results in degrading the diarization error rate (DER) due to the speaker permutation inconsistency across the chunk .
Revised:  First, this paper demonstrates oracle experiments to show that a straightforward online extension, in which SA-EEND is performed independently for each chunked recording, results in degrading the diarization error rate (DER) due to the possibility to assign speaker regions incorrectly across the recording .
Edit intent: clarity
Original:  To circumvent this inconsistency issue, our proposed method, called speaker-tracing buffer , maintains the speaker permutation information determined in previous chunks within the self-attention mechanism for correct speaker-tracing.
Revised:  To circumvent this inconsistency , we proposed a speaker-tracing buffer , maintains the speaker permutation information determined in previous chunks within the self-attention mechanism for correct speaker-tracing.
Edit intent: coherence
Original:  For MMMOPs, it is important to discover equivalent solutions associated with each point in the Pareto-Front for allowing end-users to make informed decisions . Prevalent multi-objective evolutionary algorithms are incapable of searching for multiple solution subsets, whereas, algorithms designed for MMMOPs demonstrate degraded performance in the objective space.
Revised:  For MMMOPs, it is important to discover equivalent solutions associated with each point in the Pareto-Front . Prevalent multi-objective evolutionary algorithms are incapable of searching for multiple solution subsets, whereas, algorithms designed for MMMOPs demonstrate degraded performance in the objective space.
Edit intent: clarity
Original:  For MMMOPs, it is important to discover equivalent solutions associated with each point in the Pareto-Front for allowing end-users to make informed decisions . Prevalent multi-objective evolutionary algorithms are incapable of searching for multiple solution subsets, whereas, algorithms designed for MMMOPs demonstrate degraded performance in the objective space.
Revised:  For MMMOPs, it is important to discover equivalent solutions associated with each point in the Pareto-Front for allowing end-users to make informed decisions . Prevalent multi-objective evolutionary algorithms are not purely designed to search for multiple solution subsets, whereas, algorithms designed for MMMOPs demonstrate degraded performance in the objective space.
Edit intent: clarity
Original:  The present work highlights the disadvantage of using crowding distance in the decision space when solving MMMOPs . Subsequently, an evolutionary framework, called graph Laplacian based Optimization using Reference vector assisted Decomposition (LORD), is proposed, which is the first algorithm to use decomposition in both objective and decision space for dealing with MMMOPs.
Revised:  The present work highlights the disadvantage of using crowding distance in the decision space when solving MMMOPs . Subsequently, an evolutionary framework, called graph Laplacian based Optimization using Reference vector assisted Decomposition (LORD), is proposed, which uses decomposition in both objective and decision space for dealing with MMMOPs.
Edit intent: clarity
Original:  The efficacy of the frameworks are established by comparing their performance on 34 test instances (obtained from the CEC 2019 multi-modal multi-objective test suite ) with the state-of-the-art algorithms for MMMOPs and other multi- and many-objective evolutionary algorithms.
Revised:  The efficacy of the frameworks are established by comparing their performance on test instances from the CEC 2019 multi-modal multi-objective test suite ) with the state-of-the-art algorithms for MMMOPs and other multi- and many-objective evolutionary algorithms.
Edit intent: clarity
Original:  The efficacy of the frameworks are established by comparing their performance on test instances from the CEC 2019 multi-modal multi-objective test suite and polygon problems with the state-of-the-art algorithms for MMMOPs and other multi- and many-objective evolutionary algorithms.
Revised:  The efficacies of the frameworks are established by comparing their performance on test instances from the CEC 2019 multi-modal multi-objective test suite and polygon problems with the state-of-the-art algorithms for MMMOPs and other multi- and many-objective evolutionary algorithms.
Edit intent: fluency
Original:  The manuscript is concluded  mentioning the limitations of the proposed frameworks and future directions to design still better algorithms for MMMOPs.
Revised:  The manuscript is concluded by mentioning the limitations of the proposed frameworks and future directions to design still better algorithms for MMMOPs.
Edit intent: fluency
Original: For the problem of nonlinear equations, the homotopy methods (continuation methods) are popular in engineering fields since their convergence regions are large and they are fairly reliable to find a solution.
Revised: For nonlinear equations, the homotopy methods (continuation methods) are popular in engineering fields since their convergence regions are large and they are fairly reliable to find a solution.
Edit intent: clarity
Original: For the problem of nonlinear equations, the homotopy methods (continuation methods) are popular in engineering fields since their convergence regions are large and they are fairly reliable to find a solution.
Revised: For the problem of nonlinear equations, the homotopy methods (continuation methods) are popular in engineering fields since their convergence regions are large and they are quite reliable to find a solution.
Edit intent: coherence
Original:  The disadvantage of the classical homotopy methods is that their consumed time is heavy since they need to solve many auxiliary systems of nonlinear equations during the intermediate continuation processes .
Revised:  The disadvantage of the classical homotopy methods is that their consumed time is heavy since they need to solve many auxiliary nonlinear systems during the intermediate continuation processes .
Edit intent: clarity
Original:  The disadvantage of the classical homotopy methods is that their consumed time is heavy since they need to solve many auxiliary systems of nonlinear equations during the intermediate continuation processes .
Revised:  The disadvantage of the classical homotopy methods is that their consumed time is heavy since they need to solve many auxiliary systems of nonlinear equations during the intermediate continuation process .
Edit intent: fluency
Original:  In order to overcome this shortcoming, we consider the special continuation method based on the Newton flow and follow its trajectory with the new time-stepping scheme based on the trust-region technique.
Revised:  In order to overcome this shortcoming, we consider the special explicit continuation Newton method with the new time-stepping scheme based on the trust-region technique.
Edit intent: clarity
Original:  Finally, the promising numerical results of the new method for some real-world problems are also reported, with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{ MATLAB,More1978 ) and the classical homotopy continuation methods (HOMPACK90 \mbox{ WSMMW19970pt and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{ ZL2013}0pt )}  .
Revised:  Finally, the promising numerical results of the new method for some real-world problem than the traditional optimization method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{ MATLAB,More1978 ) and the classical homotopy continuation methods (HOMPACK90 \mbox{ WSMMW19970pt and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{ ZL2013}0pt )} .
Edit intent: clarity
Original:  Finally, the promising numerical results of the new method for some real-world problems are also reported, with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{ MATLAB,More1978 ) and the classical homotopy continuation methods (HOMPACK90 \mbox{ WSMMW19970pt and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{ ZL2013}0pt )}  .
Revised:  Finally, the promising numerical results of the new method for some real-world problems are also reported, with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment ) and the classical homotopy continuation methods (HOMPACK90 \mbox{ WSMMW19970pt and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{ ZL2013}0pt )} .
Edit intent: coherence
Original:  Finally, the promising numerical results of the new method for some real-world problems are also reported, with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{ MATLAB,More1978 ) and the classical homotopy continuation methods (HOMPACK90 \mbox{ WSMMW19970pt and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{ ZL2013}0pt )}  .
Revised:  Finally, the promising numerical results of the new method for some real-world problems are also reported, with comparison to the traditional trust-region method (the built-in subroutine fsolve.m of the MATLAB environment \mbox{ MATLAB,More1978 ) and the homotopy continuation methods (HOMPACK90 \mbox{ WSMMW19970pt and the built-in subroutines psolve. m for polynomial systems, GaussNewton.m for non-polynomial systems of the NAClab environment \mbox{ ZL2013}0pt )} .
Edit intent: coherence
Original:  The disadvantage of the classical homotopy methods is that their consumed time is heavy since they need to solve many auxiliary nonlinear systems during the intermediate continuation process .
Revised:  The disadvantage of the classical homotopy methods is that their computational time is heavy since they need to solve many auxiliary nonlinear systems during the intermediate continuation process .
Edit intent: clarity
Original:  The disadvantage of the classical homotopy methods is that their consumed time is heavy since they need to solve many auxiliary nonlinear systems during the intermediate continuation process .
Revised:  The disadvantage of the classical homotopy methods is that their consumed time is heavy since they need to solve many auxiliary nonlinear systems during the intermediate continuation processes .
Edit intent: fluency
Original:  In order to overcome this shortcoming, we consider the special explicit continuation Newton method with the new time-stepping scheme for nonlinear equations .
Revised:  In order to overcome this shortcoming, we consider the special explicit continuation Newton method with the new time-stepping scheme for this problem .
Edit intent: clarity
Original:  The proposed method utilizes each individual spike more effectively by shifting spike timings as in the timing-based methods as wells as generating and removing spikes as in the activation-based methods.
Revised:  The proposed method utilizes each individual spike more effectively by shifting spike timings as in the timing-based methods as well as generating and removing spikes as in the activation-based methods.
Edit intent: fluency
Original:  Due to the diverse nature of datasets, document retrieval models often do not work as efficiently for retrieving datasets.
Revised:  Our assumption is that due to the diverse nature of datasets, document retrieval models often do not work as efficiently for retrieving datasets.
Edit intent: clarity
Original:  Previous studies reported a way of discerning queries between document of dataset search by query length.
Revised:  Previous studies reported a way of discerning queries between document search and dataset search by query length.
Edit intent: clarity
Original:  In this paper, we argue the claim and report our findings of  indistinguishability of queries, whether aiming for  dataset or a document.
Revised:  In this paper, we argue the claim and report our findings of an indistinguishability of queries, whether aiming for dataset or a document.
Edit intent: fluency
Original:  In this paper, we argue the claim and report our findings of  indistinguishability of queries, whether aiming for  dataset or a document.
Revised:  In this paper, we argue the claim and report our findings of indistinguishability of queries, whether aiming for a dataset or a document.
Edit intent: fluency