wanyu/IteraTeR_v2 huggingface dataset:
Original:  We show that both methods preserve numerically the invariants like energy, the Casimirs like the enstrophy, mass, and circulation  over a long time.
Revised:  We show that both methods preserve numerically the invariants like energy, the Casimirs like the enstrophy, mass, and circulation are preserved over a long time.
Edit intent: clarity
Original:  The accuracy and computational efficiency of the ROMs are shown by numerical test problem.
Revised:  The accuracy and computational efficiency of the reduced solutions by a numerical test problem.
Edit intent: clarity
Original: The  p-Willmore functional introduced by Gruber et al. unifies and extends important geometric functionals which measure the area , total mean curvature, and Willmore energy of immersed surfaces.
Revised: The unsigned p-Willmore functional introduced by Gruber et al. unifies and extends important geometric functionals which measure the area , total mean curvature, and Willmore energy of immersed surfaces.
Edit intent: fluency
Original: The  p-Willmore functional introduced by Gruber et al. unifies and extends important geometric functionals which measure the area , total mean curvature, and Willmore energy of immersed surfaces.
Revised: The p-Willmore functional introduced by Gruber et al. unifies and extends important geometric functionals which measure the area and Willmore energy of immersed surfaces.
Edit intent: clarity
Original:  Techniques of Dziuk and Elliott are adapted to compute the first variation of the p-Willmore functional , which is then used to develop a finite-element model for the p-Willmore flow of closed surfaces in R^3 that is amenable to constraints on surface area and enclosed volume .
Revised:  Techniques of Dziuk and Elliott are adapted to compute the first variation of the p-Willmore functional , which is then used to develop a model for the p-Willmore flow of closed surfaces in R^3 that is amenable to constraints on surface area and enclosed volume .
Edit intent: clarity
Original:  Techniques of Dziuk and Elliott are adapted to compute the first variation of the p-Willmore functional , which is then used to develop a finite-element model for the p-Willmore flow of closed surfaces in R^3 that is amenable to constraints on surface area and enclosed volume .
Revised:  Techniques of Dziuk and Elliott are adapted to compute the first variation of the p-Willmore functional , which is then used to develop a finite-element model for the p-Willmore flow of closed surfaces in R^3 . This model is amenable to constraints on surface area and enclosed volume .
Edit intent: clarity
Original: \hspace{0pt} } , this procedure is generally-applicable to all 2-D meshes and ensures that a given surface mesh remains nearly conformal as it evolves , at the expense of first-order accuracy in the flow.
Revised: \hspace{0pt} } , this procedure encourages angle-preservation in a closed and oriented surface immersion as it evolves , at the expense of first-order accuracy in the flow.
Edit intent: clarity
Original:  Finally, discretization of the p-Willmore flow is discussed, where some basic results on consistency and numerical stability are demonstrated and a fully-automated algorithm is presentedfor implementing the closed surface p-Willmore flow with mesh regularization .
Revised:  Finally, discretization of the p-Willmore flow is discussed, and an application to mesh editing is presented .
Edit intent: clarity
Original: I revisit two theories of cell differentiation in multicellular organisms published a half-century ago, Stuart Kauffman's global gene regulatory dynamics ( GRGD ) model and Roy Britten's and Eric Davidson's modular gene regulatory network (MGRN) model, in light of newer knowledge of mechanisms of gene regulation in the metazoans (animals).
Revised: I revisit two theories of cell differentiation in multicellular organisms published a half-century ago, Stuart Kauffman's global gene regulatory dynamics ( GGRD ) model and Roy Britten's and Eric Davidson's modular gene regulatory network (MGRN) model, in light of newer knowledge of mechanisms of gene regulation in the metazoans (animals).
Edit intent: fluency
Original:  Instead, we explore sequencerless designs where all p-bits are allowed to flip autonomously and demonstrate that such designs can allow ultrafast operation unconstrained by available clock speeds without compromising the solution's fidelity.
Revised:  Instead, we explore sequencerless designs where all p-bits are allowed to flip autonomously and demonstrate that such designs can allow ultrafast operation unconstrained by available clock speeds without compromising the solution's fidelity.
Edit intent: fluency
Original: Quantitative analyses of cells' nuclei in microscopical images is an essential yet still challenging step for further biological and pathological information.
Revised: Quantitative analysis of cell nuclei in microscopic images is an essential yet still challenging step for further biological and pathological information.
Edit intent: fluency
Original: Quantitative analyses of cells' nuclei in microscopical images is an essential yet still challenging step for further biological and pathological information.
Revised: Quantitative analyses of cells' nuclei in microscopical images is an essential yet still challenging source of biological and pathological information.
Edit intent: clarity
Original:  Accurate detection and segmentation of densely-packed nuclei in images acquired under a variety of conditions is the major challenge.
Revised:  The major challenge is accurate detection and segmentation of densely-packed nuclei in images acquired under a variety of conditions is the major challenge.
Edit intent: coherence
Original:  Accurate detection and segmentation of densely-packed nuclei in images acquired under a variety of conditions is the major challenge.
Revised:  Accurate detection and segmentation of densely packed nuclei in images acquired under a variety of conditions is the major challenge.
Edit intent: fluency
Original:  With a sufficient number of training examples, Mask R-CNN based methods have achieved state-of-the-art results on nuclei segmentation.
Revised:  With a sufficient number of training examples, Mask R-CNN-based methods have achieved state-of-the-art results on nuclei segmentation.
Edit intent: fluency
Original:  With a sufficient number of training examples, Mask R-CNN based methods have achieved state-of-the-art results on nuclei segmentation.
Revised:  With a sufficient number of training examples, Mask R-CNN based methods have achieved state-of-the-art nucleus segmentation.
Edit intent: clarity
Original:  However, the current pipeline requires fully-annotated training images, which are time-consuming to create and sometimes infeasible because of the noisy nature of microscopical images.
Revised:  However, the current pipeline requires fully annotated training images, which are time-consuming to create and sometimes infeasible because of the noisy nature of microscopical images.
Edit intent: fluency
Original:  However, the current pipeline requires fully-annotated training images, which are time-consuming to create and sometimes infeasible because of the noisy nature of microscopical images.
Revised:  However, the current pipeline requires fully-annotated training images, which are time consuming to create and sometimes infeasible because of the noisy nature of microscopical images.
Edit intent: fluency
Original:  On the other hand , nuclei often have similar appearances within the same image - this could be utilized to segment nuclei with only partially labeled training examples.
Revised:  On the other hand , nuclei often have similar appearances within the same image ; this similarity could be utilized to segment nuclei with only partially labeled training examples.
Edit intent: clarity
Original:  We propose a simple , yet effective region proposal module for the current Mask R-CNN pipeline to perform few exemplar learning.
Revised:  We propose a simple yet effective region proposal module for the current Mask R-CNN pipeline to perform few exemplar learning.
Edit intent: fluency
Original:  We propose a simple , yet effective region proposal module for the current Mask R-CNN pipeline to perform few exemplar learning.
Revised:  We propose a simple , yet effective region proposal module for the current Mask R-CNN pipeline to perform few-exemplar learning.
Edit intent: fluency
Original:  To capture the similarities between the unlabeled image regions and labeled nuclei, we apply decomposed self-attention to the learned image features.
Revised:  To capture the similarities between the unlabeled regions and labeled nuclei, we apply decomposed self-attention to the learned image features.
Edit intent: fluency
Original:  Moreover, our method can be used as a bootstrapping step to create  full annotation of a dataset, where annotations are iteratively generated and corrected until the predetermined coverage and accuracy has been reached.
Revised:  Moreover, our method can serve as a bootstrapping step to create full annotation of a dataset, where annotations are iteratively generated and corrected until the predetermined coverage and accuracy has been reached.
Edit intent: clarity
Original:  Moreover, our method can be used as a bootstrapping step to create  full annotation of a dataset, where annotations are iteratively generated and corrected until the predetermined coverage and accuracy has been reached.
Revised:  Moreover, our method can be used as a bootstrapping step to create a full annotation of a dataset, where annotations are iteratively generated and corrected until the predetermined coverage and accuracy has been reached.
Edit intent: fluency
Original: Quantitative analysis of cell nuclei in microscopic images is an essential yet still challenging source of biological and pathological information.
Revised: Quantitative analysis of cell nuclei in microscopic images is an essential yet challenging source of biological and pathological information.
Edit intent: clarity
Original:  With sufficient training examples, Mask R-CNN-based methods have achieved state-of-the-art nucleus segmentation.
Revised:  Mask R-CNN-based methods have achieved state-of-the-art nucleus segmentation.
Edit intent: clarity
Original:  However, the current pipeline requires fully annotated training images, which are time consuming to create and sometimes infeasible because of the noisynature of microscopic images .
Revised:  However, the current pipeline requires fully annotated training images, which are time consuming to create and sometimes noisy .
Edit intent: clarity
Original:  Importantly, nuclei often have similar appearances within the same image ;
Revised:  Importantly, nuclei often appear similar within the same image ;
Edit intent: fluency
Original:  We propose a simple yet effective region proposal module for the current Mask R-CNN pipeline to perform few-exemplar learning.
Revised:  We propose a simple yet effective region-proposal module for the current Mask R-CNN pipeline to perform few-exemplar learning.
Edit intent: fluency
Original:  To capture the similarities between the unlabeled regions and labeled nuclei, we apply decomposed self-attention to the learned features.
Revised:  To capture the similarities between unlabeled regions and labeled nuclei, we apply decomposed self-attention to the learned features.
Edit intent: fluency
Original:  To capture the similarities between the unlabeled regions and labeled nuclei, we apply decomposed self-attention to the learned features.
Revised:  To capture the similarities between the unlabeled regions and labeled nuclei, we apply decomposed self-attention to learned features.
Edit intent: fluency
Original:  On the self-attention map, we observe strong activation at the centers and edges of all nuclei, including the unlabeled ones .
Revised:  On the self-attention map, we observe strong activation at the centers and edges of all nuclei, including unlabeled nuclei .
Edit intent: clarity
Original:  On this basis, our region proposal module propagates the partial annotations to the whole image and then proposes effective bounding boxes for the bounding box regression and binary mask generation modules.
Revised:  On this basis, our region-proposal module propagates partial annotations to the whole image and then proposes effective bounding boxes for the bounding box regression and binary mask generation modules.
Edit intent: fluency
Original:  On this basis, our region proposal module propagates the partial annotations to the whole image and then proposes effective bounding boxes for the bounding box regression and binary mask generation modules.
Revised:  On this basis, our region proposal module propagates the partial annotations to the whole image and proposes effective bounding boxes for the bounding box regression and binary mask generation modules.
Edit intent: coherence
Original:  When trained with only 1/4 of the nuclei annotated, the baseline pipeline gives frequent false negatives, while our approach retains  detection accuracy comparable to that of training with the fully annotated data.
Revised:  When trained with only 1/4 of the nuclei annotated, our approach retains detection accuracy comparable to that of training with the fully annotated data.
Edit intent: coherence
Original:  Moreover, our method can serve as a bootstrapping step to create a full annotation of a dataset, where annotations are iteratively generated and corrected until the predetermined coverage and accuracy are reached.
Revised:  Moreover, our method can serve as a bootstrapping step to create full annotations of datasets, iteratively generating and correcting annotations until a predetermined coverage and accuracy are reached.
Edit intent: clarity
Original:  In this paper, we propose a machine learning method to optimally manage several types of buyback contracts .
Revised:  In this paper, we propose a machine learning method to optimally manage several types of buyback contract .
Edit intent: fluency
Original:  In particular, in the isogeometric setting, since the projection operator is not Lagrangian (i.e., interpolatory) a special construction is neeeded in order to guarantee that recovery sequences take values in [0,1];
Revised:  In particular, in the isogeometric setting, since the projection operator is not Lagrangian (i.e., interpolatory) a special construction is needed in order to guarantee that recovery sequences take values in [0,1];
Edit intent: fluency
Original:  This work is under consideration for publication in Theory and Practices of Logic Programming .
Revised:  This paper is under consideration for publication in Theory and Practices of Logic Programming .
Edit intent: clarity
Original:  This work is under consideration for publication in Theory and Practices of Logic Programming .
Revised:  This work is under consideration for acceptance in TPLP .
Edit intent: clarity
Original: Trusted execution environments (TEEs) are becoming a requirement across a wide range of platforms, from embedded sensors to cloud servers , which encompass a wide range of cost and power constraintsas well as security threat models.
Revised: Trusted execution environments (TEEs) are being used in all the devices from embedded sensors to cloud servers , which encompass a wide range of cost and power constraintsas well as security threat models.
Edit intent: clarity
Original: Trusted execution environments (TEEs) are becoming a requirement across a wide range of platforms, from embedded sensors to cloud servers , which encompass a wide range of cost and power constraintsas well as security threat models.
Revised: Trusted execution environments (TEEs) are becoming a requirement across a wide range of platforms, from embedded sensors to cloud servers and encompass a range of cost and power constraintsas well as security threat models.
Edit intent: coherence
Original:  Unfortunately , each of the current vendor-specific TEEs makes a fixed choice in each of the design dimensions of deployability, trusted computing base (TCB), and threat model, with little room for customization and experimentation.
Revised:  Unfortunately , each of the current vendor-specific TEEs makes a fixed set of trade-offs with little room for customization and experimentation.
Edit intent: clarity
Original:  Keystone uses a simple abstraction of memory isolation together with a programmable layer that sits underneath untrusted components , such as the OS.
Revised:  Keystone uses a simple abstraction of memory isolation together with a programmable layer underneath untrusted components , such as the OS.
Edit intent: clarity
Original:  We demonstrate that this is sufficient to build reusable TEE core primitives , separate from platform-specific modifications and required application features.
Revised:  We demonstrate that this is sufficient to build reusable TEE core primitives , separate from platform-specific modifications and application features.
Edit intent: clarity
Original:  We showcase the benefits of our design in executing standard benchmarks, applications, and kernelson various deployment platforms .
Revised:  We showcase the benefits of our design in executing standard benchmarks, applications, kernels, and deployment models .
Edit intent: clarity
Original: A resistive memory device-based computing architecture is one of the promising platforms for energy-efficient Deep Neural Network (DNN)  accelerators.
Revised: A resistive memory device-based computing architecture is one of the promising platforms for energy-efficient Deep Neural Network (DNN) training accelerators.
Edit intent: clarity
Original:  The key technical challenge in realizing neural network training accelerator with resistive memory devices is to accumulate the gradient information in an unbiased way.
Revised:  The key technical challenge in realizing such accelerators is to accumulate the gradient information in an unbiased way.
Edit intent: clarity
Original:  Therefore, the device switching characteristics play a critical role in determining the training performance of DNNs . Unlike the digital numbers in software which can be assigned and accessed with desired accuracy, numbers stored in resistive memory devices in the form of resistance can only be manipulated following by the physics of the device  .
Revised:  Therefore, the device switching characteristics play a critical role in determining the training performance of DNNs . Unlike the digital numbers in software which can be assigned and accessed with desired accuracy, numbers stored in resistive memory devices can only be manipulated following by the physics of the device .
Edit intent: clarity
Original:  Therefore, the device switching characteristics play a critical role in determining the training performance of DNNs . Unlike the digital numbers in software which can be assigned and accessed with desired accuracy, numbers stored in resistive memory devices in the form of resistance can only be manipulated following by the physics of the device  .
Revised:  Therefore, the device switching characteristics play a critical role in determining the training performance of DNNs . Unlike the digital numbers in software which can be assigned and accessed with desired accuracy, numbers stored in resistive memory devices in the form of resistance can only be manipulated following the physics of the device .
Edit intent: fluency
Original:  Therefore, additional techniques and algorithm-level remedies are required to achieve the best possible performance in resistive memory device-based DNN accelerators.
Revised:  Therefore, additional techniques and algorithm-level remedies are required to achieve the best possible performance in resistive memory device-based accelerators.
Edit intent: clarity
Original:  We introduce a concept of symmetry point and propose a zero-shifting technique which is a method to compensate imbalance by programming the reference device and changing the zero value point of the weight.
Revised:  We introduce a concept of symmetry point and propose a zero-shifting technique which can compensate imbalance by programming the reference device and changing the zero value point of the weight.
Edit intent: clarity
Original: Outcomes of propagating pulse collisions are of fundamental importance in many fields , ranging from physiology to industrial devices.
Revised: Excitable pulses are among the most widespread dynamical patterns that occur in many different systems , ranging from physiology to industrial devices.
Edit intent: clarity
Original:  As such, collisions can be considered as organizing centers, for example, in intracellular actin waves .
Revised:  We exemplify our findings based on a model of intracellular actin waves. As biological cells are inherently mass-conserved systems, our results provide a key concept to understand the ubiquitous occurrence of actin waves in cells, explaining why they are so common, and why their dynamics is robust and long-lived .
Edit intent: coherence
Original:  Traditionally,  mutual annihilation of two colliding pulses is regarded as their prototypical signature.
Revised:  Traditionally, the mutual annihilation of two colliding pulses is regarded as their prototypical signature.
Edit intent: fluency
Original:  We exemplify our findings based on a model of intracellular actin waves .
Revised:  We demonstrate our findings using a model of intracellular actin waves .
Edit intent: clarity
Original: Recent work has demonstrated that by monitoring the Real Time Bidding (RTB) protocol , one can estimate the monetary worth of different users for the programmatic advertising ecosystem, even when the so-called winning bids are encrypted .
Revised: The Real Time Bidding (RTB) protocol , one can estimate the monetary worth of different users for the programmatic advertising ecosystem, even when the so-called winning bids are encrypted .
Edit intent: clarity
Original: For the computation of the generalized singular value decomposition (GSVD) of a  matrix pair (A,B) of full column rank, the GSVD is commonly formulated as two mathematically equivalent generalized eigenvalue problems, so that a generalized eigensolver can be applied to one of them and the desired GSVD components are then recovered from the computed generalized eigenpairs.
Revised: For the computation of the generalized singular value decomposition (GSVD) of a large matrix pair (A,B) of full column rank, the GSVD is commonly formulated as two mathematically equivalent generalized eigenvalue problems, so that a generalized eigensolver can be applied to one of them and the desired GSVD components are then recovered from the computed generalized eigenpairs.
Edit intent: fluency
Original:  A detailed perturbation analysis is made on the two formulations and show how to make a suitable choice between them.
Revised:  We make a detailed perturbation analysis is made on the two formulations and show how to make a suitable choice between them.
Edit intent: clarity
Original:  A detailed perturbation analysis is made on the two formulations and show how to make a suitable choice between them.
Revised:  A detailed perturbation analysis on the two formulations and show how to make a suitable choice between them.
Edit intent: clarity
Original:  Numerical experiments illustrate the obtained results .
Revised:  Numerical experiments illustrate the results obtained .
Edit intent: fluency
Original:  In this paper, we present a linear time algorithm for computing medians of median graphs, improving over the existing quadratic time algorithm.
Revised:  In this paper, we present a linear time algorithm to compute medians in median graphs, improving over the existing quadratic time algorithm.
Edit intent: clarity
Original:   Median graphs constitute the principal class of graphs investigated in metric graph theory  , due to their bijections with other discrete and geometric structures ( CAT(0) cube complexes , domains of event structures , and solution sets of 2-SAT formulas) .
Revised:  Median graphs constitute the principal class of graphs investigated in metric graph theory , due to their bijections with CAT(0) cube complexes , domains of event structures , and solution sets of 2-SAT formulas) .
Edit intent: clarity