wanyu/IteraTeR_full_sent huggingface dataset:
Original:  The main contribution of this paper is to provide a high-level overview of major categories of collision detection, provide insight into the need for accurate and computationally efficient collision detection, and provide methods of collision detection and anticipatory collision avoidance  that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections . Supplementary reference for mathematics behind collision detection .
Revised:  The main contribution of this paper is to provide a high-level overview of major categories of collision detection, provide insight into the need for accurate and computationally efficient collision detection, and provide methods of collision detection and anticipatory collision avoidance for agents that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections . Supplementary reference for mathematics behind collision detection .
Edit intent: clarity
Original:  The main contribution of this paper is to provide a high-level overview of major categories of collision detection, provide insight into the need for accurate and computationally efficient collision detection, and provide methods of collision detection and anticipatory collision avoidance  that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections . Supplementary reference for mathematics behind collision detection .
Revised:  The main contribution of this paper is to provide a high-level overview of major categories of collision detection, provide insight into the need for accurate and computationally efficient collision detection, and provide methods of collision detection and anticipatory collision avoidance that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections .
Edit intent: coherence
Original:  The main contributions of this paper are to provide a high-level overview of major categories of collision detection, and provide methods of collision detection and anticipatory collision avoidance for agents that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections .
Revised:  The main contribution of this technical report is to provide a high-level overview of major categories of collision detection, and provide methods of collision detection and anticipatory collision avoidance for agents that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections .
Edit intent: clarity
Original:  The main contributions of this paper are to provide a high-level overview of major categories of collision detection, and provide methods of collision detection and anticipatory collision avoidance for agents that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections .
Revised:  The main contributions of this paper are to provide a high-level overview of major categories of collision detection, along with methods of collision detection and anticipatory collision avoidance for agents that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections .
Edit intent: clarity
Original:  The main contributions of this paper are to provide a high-level overview of major categories of collision detection, and provide methods of collision detection and anticipatory collision avoidance for agents that are both computationally efficient and exact -- that is, they will never yield false negative or false positive detections .
Revised:  The main contributions of this paper are to provide a high-level overview of major categories of collision detection, and provide methods of collision detection and anticipatory collision avoidance for agents that are both computationally efficient and highly accurate .
Edit intent: clarity
Original:  We hypothesize that users' consent decision is influenced by (1) the number of options, connecting to the theory of choice proliferation, and (2) the presence of a highlighted default button ( "select all" ), connecting to theories of social norms and deception in consumer research.
Revised:  We hypothesize that users' consent decision is influenced by (1) the number of options, connecting to the theory of choice proliferation, and (2) the presence of a highlighted default button ( ``select all'' ), connecting to theories of social norms and deception in consumer research.
Edit intent: fluency
Original:  Here, we introduce a new data visualization and exploration method, TMAP (tree-map), which exploits locality sensitive hashing, Kruskal's minimum-spanning-tree algorithm, and a multilevel multipole-based graph layout algorithm to represent large and high dimensional data sets as a tree structure, which is readily understandable and explorable.
Revised: The chemical sciences are producing an unprecedented amount of large, high-dimensional data sets containing chemical structures and associated properties. However, there are currently no algorithms to visualize such data while preserving both global and local features with a sufficient level of detail to allow for human inspection and interpretation. Here, we introduce a new data visualization and exploration method, TMAP (tree-map), which exploits locality sensitive hashing, Kruskal's minimum-spanning-tree algorithm, and a multilevel multipole-based graph layout algorithm to represent large and high dimensional data sets as a tree structure, which is readily understandable and explorable.
Edit intent: meaning-changed
Original:  Here, we introduce a new data visualization and exploration method, TMAP (tree-map), which exploits locality sensitive hashing, Kruskal's minimum-spanning-tree algorithm, and a multilevel multipole-based graph layout algorithm to represent large and high dimensional data sets as a tree structure, which is readily understandable and explorable.
Revised:  Here, we propose a solution to this problem with a new data visualization and exploration method, TMAP (tree-map), which exploits locality sensitive hashing, Kruskal's minimum-spanning-tree algorithm, and a multilevel multipole-based graph layout algorithm to represent large and high dimensional data sets as a tree structure, which is readily understandable and explorable.
Edit intent: coherence
Original:  Here, we introduce a new data visualization and exploration method, TMAP (tree-map), which exploits locality sensitive hashing, Kruskal's minimum-spanning-tree algorithm, and a multilevel multipole-based graph layout algorithm to represent large and high dimensional data sets as a tree structure, which is readily understandable and explorable.
Revised:  Here, we introduce a new data visualization method, TMAP (tree-map), which exploits locality sensitive hashing, Kruskal's minimum-spanning-tree algorithm, and a multilevel multipole-based graph layout algorithm to represent large and high dimensional data sets as a tree structure, which is readily understandable and explorable.
Edit intent: clarity
Original:  Here, we introduce a new data visualization and exploration method, TMAP (tree-map), which exploits locality sensitive hashing, Kruskal's minimum-spanning-tree algorithm, and a multilevel multipole-based graph layout algorithm to represent large and high dimensional data sets as a tree structure, which is readily understandable and explorable. Compared to other data visualization methods such as t-SNE or UMAP , TMAP increases the size of data sets that can be visualized due to its significantly lower memory requirements and running time and should find broad applicability in the age of big data.
Revised:  Here, we introduce a new data visualization and exploration method, TMAP , capable of representing data sets of up to millions of data points and arbitrary high dimensionality as a two-dimensional tree URL Visualizations based on TMAP are better suited than t-SNE or UMAP , TMAP increases the size of data sets that can be visualized due to its significantly lower memory requirements and running time and should find broad applicability in the age of big data.
Edit intent: meaning-changed
Original:  Compared to other data visualization methods such as t-SNE or UMAP , TMAP increases the size of data sets that can be visualized due to its significantly lower memory requirements and running time and should find broad applicability in the age of big data. We exemplify TMAP in the area of cheminformatics with interactive maps for 1.16 million drug-like molecules from ChEMBL, 10.1 million small molecule fragments from FDB17,  and 131 thousand 3D- structures of biomolecules from the PDB Databank, and to visualize data from literature (GUTENBERG data set), cancer biology(PANSCAN data set) and particle physics(MiniBooNE data set).
Revised:  Compared to other data visualization methods such as t-SNE or UMAP for the exploration and interpretation of large data sets due to their tree-like nature, increased local and global neighborhood and structure preservation, and the transparency of the methods the algorithm is based on. We apply TMAP to the most used chemistry data sets including databases of molecules such as ChEMBL, FDB17, and 131 thousand 3D- structures of biomolecules from the PDB Databank, and to visualize data from literature (GUTENBERG data set), cancer biology(PANSCAN data set) and particle physics(MiniBooNE data set).
Edit intent: coherence
Original:  We exemplify TMAP in the area of cheminformatics with interactive maps for 1.16 million drug-like molecules from ChEMBL, 10.1 million small molecule fragments from FDB17,  and 131 thousand 3D- structures of biomolecules from the PDB Databank, and to visualize data from literature (GUTENBERG data set), cancer biology(PANSCAN data set) and particle physics(MiniBooNE data set).
Revised:  We exemplify TMAP in the area of cheminformatics with interactive maps for 1.16 million drug-like molecules from ChEMBL, 10.1 million small molecule fragments from FDB17, the Natural Products Atlas, DSSTox, DrugBank, as well as to the MoleculeNet benchmark collection of data sets. We also show its broad applicability with further examples from biology, particle physics, and 131 thousand 3D- structures of biomolecules from the PDB Databank, and to visualize data from literature (GUTENBERG data set), cancer biology(PANSCAN data set) and particle physics(MiniBooNE data set).
Edit intent: meaning-changed
Original:  We exemplify TMAP in the area of cheminformatics with interactive maps for 1.16 million drug-like molecules from ChEMBL, 10.1 million small molecule fragments from FDB17,  and 131 thousand 3D- structures of biomolecules from the PDB Databank, and to visualize data from literature (GUTENBERG data set), cancer biology(PANSCAN data set) and particle physics(MiniBooNE data set). TMAP is available as a Python package. Installation, usage instructions and application examples can be found at URL
Revised:  We exemplify TMAP in the area of cheminformatics with interactive maps for 1.16 million drug-like molecules from ChEMBL, 10.1 million small molecule fragments from FDB17, and literature.
Edit intent: coherence
Original:  We apply TMAP to the most used chemistry data sets including databases of molecules such as ChEMBL, FDB17, the Natural Products Atlas, DSSTox, DrugBank, as well as to the MoleculeNet benchmark collection of data sets.
Revised:  We apply TMAP to the most used chemistry data sets including databases of molecules such as ChEMBL, FDB17, the Natural Products Atlas, DSSTox, as well as to the MoleculeNet benchmark collection of data sets.
Edit intent: clarity
Original:  However, clinically available control strategies fail to provide users with intuitive, independent and proportional control over multiple degrees of freedom (DOFs) in real time. Here, we detail the use of a modified Kalman filter  to provide intuitive, independent and proportional real-time control over six-DOF prosthetic hands such as the DEKA LUKE Arm.
Revised:  However, clinically available control strategies fail to provide users with intuitive, independent and proportional control over multiple degrees of freedom (DOFs) in real-time. New Method: We detail the use of a modified Kalman filter to provide intuitive, independent and proportional real-time control over six-DOF prosthetic hands such as the DEKA LUKE Arm.
Edit intent: coherence
Original:  Here, we detail the use of a modified Kalman filter  to provide intuitive, independent and proportional real-time control over six-DOF prosthetic hands such as the DEKA LUKE Arm.
Revised:  Here, we detail the use of a modified Kalman filter (MKF) to provide intuitive, independent and proportional real-time control over six-DOF prosthetic hands such as the DEKA LUKE Arm.
Edit intent: meaning-changed
Original:  Here, we detail the use of a modified Kalman filter  to provide intuitive, independent and proportional real-time control over six-DOF prosthetic hands such as the DEKA LUKE Arm.
Revised:  Here, we detail the use of a modified Kalman filter to provide intuitive, independent and proportional control over six-DOF prosthetic hands such as the DEKA LUKE Arm.
Edit intent: clarity
Original:  Here, we detail the use of a modified Kalman filter  to provide intuitive, independent and proportional real-time control over six-DOF prosthetic hands such as the DEKA LUKE Arm.
Revised:  Here, we detail the use of a modified Kalman filter to provide intuitive, independent and proportional real-time control over six-DOF prostheses such as the DEKA LUKE Arm.
Edit intent: clarity
Original:  Here, we detail the use of a modified Kalman filter  to provide intuitive, independent and proportional real-time control over six-DOF prosthetic hands such as the DEKA LUKE Arm.
Revised:  Here, we detail the use of a modified Kalman filter to provide intuitive, independent and proportional real-time control over six-DOF prosthetic hands such as the DEKA "LUKE" Arm.
Edit intent: clarity
Original:   In contrast to traditional pattern recognitioncontrol schemes, the modified Kalman filter allows users to continuously modulate their force output, which is critical for fine dexterity.
Revised:  Using a portable take-home system, participants performed various activities of daily living. Comparison with Existing Methods: In contrast to traditional pattern recognitioncontrol schemes, the modified Kalman filter allows users to continuously modulate their force output, which is critical for fine dexterity.
Edit intent: meaning-changed
Original:  In less than five minutes of training, amputees were able to successfully control in real time a multi-articulate prosthetic arm (hand and wrist) to perform various activities of daily living.
Revised:  The MKF is also computationally efficient and can be trained in less than five minutes of training, amputees were able to successfully control in real time a multi-articulate prosthetic arm (hand and wrist) to perform various activities of daily living.
Edit intent: meaning-changed
Original:  In less than five minutes of training, amputees were able to successfully control in real time a multi-articulate prosthetic arm (hand and wrist) to perform various activities of daily living. Preliminary implementation of the modified Kalman filter onto a portable, take-home system further demonstrates feasibility of the algorithm as a way to explore the functional and psychological benefits associated with long-term, at-home control of dexterous prosthetic hands.
Revised:  In less than five minutes . Conclusions: The MKF can be used to explore the functional and psychological benefits associated with long-term, at-home control of dexterous prosthetic hands.
Edit intent: clarity
Original:  Using results on the rate of convergence of supermartingales  we show that whenever the two experts' advice are sufficiently distinct  the proposed test will detect the informed expert in any desired degree of precision in some fixed finite time.
Revised:  Furthermore, using results on the rate of convergence of supermartingales we show that whenever the two experts' advice are sufficiently distinct the proposed test will detect the informed expert in any desired degree of precision in some fixed finite time.
Edit intent: coherence
Original:  Using results on the rate of convergence of supermartingales  we show that whenever the two experts' advice are sufficiently distinct  the proposed test will detect the informed expert in any desired degree of precision in some fixed finite time.
Revised:  Using results on the rate of convergence of supermartingales , we show that whenever the two experts' advice are sufficiently distinct the proposed test will detect the informed expert in any desired degree of precision in some fixed finite time.
Edit intent: fluency
Original:  Using results on the rate of convergence of supermartingales  we show that whenever the two experts' advice are sufficiently distinct  the proposed test will detect the informed expert in any desired degree of precision in some fixed finite time.
Revised:  Using results on the rate of convergence of supermartingales we show that whenever the two experts' advice are sufficiently distinct , the proposed test will detect the informed expert in any desired degree of precision in some fixed finite time.
Edit intent: fluency
Original:  It establishes the existence of the solution when controls are of bounded velocity, solves explicitly the game when controls are of finite variation, and presents sensitivity analysis to compare the single-player game with the MFG . Our analysis shows that MFGs, when appropriately formulated, can demonstrate genuine gameeffects even without heterogeneity among players and additional common noise\left({\sqrt N}}\right) .
Revised:  It provides an explicit solution for the mean-field game (MFG) and presents sensitivity analysis to compare the single-player game with the MFG . Our analysis shows that MFGs, when appropriately formulated, can demonstrate genuine gameeffects even without heterogeneity among players and additional common noise\left({\sqrt N}}\right) .
Edit intent: clarity
Original:  It establishes the existence of the solution when controls are of bounded velocity, solves explicitly the game when controls are of finite variation, and presents sensitivity analysis to compare the single-player game with the MFG . Our analysis shows that MFGs, when appropriately formulated, can demonstrate genuine gameeffects even without heterogeneity among players and additional common noise\left({\sqrt N}}\right) .
Revised:  It establishes the existence of the solution when controls are of bounded velocity, solves explicitly the game when controls are of finite variation, and presents sensitivity analysis to compare the solution for the MFG with that for the single-agent control problem. It shows that in the MFG, model parameters not only affect the optimal strategies as in the single-agent case, but also influence the equilibrium price. It then establishes that the solution to the MFG is an \epsilon-Nash Equilibrium to the corresponding N-player game, with \epsilon=O\left({\sqrt N}}\right) .
Edit intent: meaning-changed
Original:  It establishes the existence of the solution when controls are of bounded velocity, solves explicitly the game when controls are of finite variation, and presents sensitivity analysis to compare the single-player game with the MFG . Our analysis shows that MFGs, when appropriately formulated, can demonstrate genuine gameeffects even without heterogeneity among players and additional common noise\left({\sqrt N}}\right) .
Revised:  It establishes the existence of the solution when controls are of bounded velocity, solves explicitly the game when controls are of finite variation, and presents sensitivity analysis to compare the single-player game with the MFG . Our analysis shows that MFGs, when appropriately formulated, can demonstrate genuine gameeffects even without heterogeneity among players and additional common noise\left(\frac{1{\sqrt N}}\right) .
Edit intent: meaning-changed
Original:  In this paper we explore the effect of various perturbation methods on a typical neuroimaging pipeline through the use of i) near-epsilon noise injections, ii) Monte Carlo Arithmetic, and iii) varying operating systems to identify the quality and severity of their impact.
Revised:  In this paper we explore the effect of various perturbation methods on a typical neuroimaging pipeline through the use of i) targeted noise injections, ii) Monte Carlo Arithmetic, and iii) varying operating systems to identify the quality and severity of their impact.
Edit intent: meaning-changed
Original:  We derived equations for the secretion probability of citrate and the contribution of pyruvate dehydrogenase complex (PDC) versus the anaplerotic pyruvate carboxylase (PC) pathways in supplying the Krebs cycle with carbons from pyruvate for the production of citrate.
Revised:  We derived equations for the secretion fraction of citrate and the contribution of pyruvate dehydrogenase complex (PDC) versus the anaplerotic pyruvate carboxylase (PC) pathways in supplying the Krebs cycle with carbons from pyruvate for the production of citrate.
Edit intent: clarity
Original:  We propose that these equations can be used to distinguish between citrate metabolism in healthy prostate tissue cells and in malignant cells, or they can be used to follow changes in citrate metabolism during the process towards malignancy .
Revised:  We propose use of these equations to distinguish between citrate metabolism in healthy prostate tissue cells and in malignant cells, or they can be used to follow changes in citrate metabolism during the process towards malignancy .
Edit intent: style
Original: The APBS software was developed to solve the equations of continuum electrostatics for large biomolecular assemblages.
Revised: Virtual reality is a powerful tool with the ability to immerse a user within a completely external environment. This immersion is particularly useful when visualizing and analyzing interactions between URLanic molecules, molecular URLanic complexes, and biomolecular systems such as redox proteins and enzymes. A common tool used in the biomedical community to analyze such interactions is the APBS software, which was developed to solve the equations of continuum electrostatics for large biomolecular assemblages.
Edit intent: meaning-changed
Original:  APBS has enjoyed widespread adoption throughout the biomedical community and is used in numerous applications involving biomolecular structures. However, visualization of complex biomolecular electrostatic properties can be challenging for two-dimensional graphics systems.
Revised:  APBS has enjoyed widespread adoption throughout the biomedical community . Currently, typical use of the full APBS toolset is completed via the command line followed by visualization using a variety of two-dimensional external molecular visualization software. This process has inherent limitations: visualization of complex biomolecular electrostatic properties can be challenging for two-dimensional graphics systems.
Edit intent: meaning-changed
Original:  However, visualization of complex biomolecular electrostatic properties can be challenging for two-dimensional graphics systems. Therefore, advanced visualization and manipulation capabilities have been incorporated. In particular, APBS tools have been integrated with the UnityMol-APBS virtual reality platform to provide an immersive experiencefor preparing biomolecular systems for calculations as well as visualizing and comparing calculated results  .
Revised:  However, visualization of complex biomolecular electrostatic properties can be challenging for two-dimensional interface masks important information within the depth component. Herein, we have developed a single application, UnityMol-APBS virtual reality platform to provide an immersive experiencefor preparing biomolecular systems for calculations as well as visualizing and comparing calculated results .
Edit intent: meaning-changed