wanyu/IteraTeR_v2 huggingface dataset:
Original:  Although several studies have taken advantage of the novel architecture of HMC, they have not fully explored either its characteristics in terms of latency and bandwidth or their correlation with temperature and power consumption  .
Revised:  Although several studies have taken advantage of the novel architecture of HMC, they have not fully explored either its characteristics in terms of latency and bandwidth or their correlation with temperature and power consumption have not been fully explored .
Edit intent: clarity
Original:  Moreover,  we deconstruct factors that contribute to access latency and reveal their sources for high- and low-load accesses.
Revised:  Moreover, we deconstruct factors that contribute to latency and reveal their sources for high- and low-load accesses.
Edit intent: fluency
Original:  The results and observations of this work should provide constructive information for high-performance-computing (HPC) research .
Revised:  The results of this paper demonstrates essential behaviors and performance bottlenecks for future explorations of packet-switched and 3D-stacked memories .
Edit intent: clarity
Original:  We allow a user to place a texture patch on a sketch at arbitrary location and scale to control the desired output texture.
Revised:  We allow a user to place a texture patch on a sketch at arbitrary locations and scales to control the desired output texture.
Edit intent: fluency
Original:  The new local texture loss can improve generated texture quality without knowing the patch location and size in advance.
Edit intent: coherence
Original: We establish global convergence of the (1+1) -ES algorithm , i.e., convergence to a critical point independent of the initial state.
Revised: We establish global convergence of the (1+1) evolution strategy , i.e., convergence to a critical point independent of the initial state.
Edit intent: clarity
Original: Deep convolutional neural networks are being actively investigated in a wide range of speech and audio processing applications including speech recognition, audio event detection and computational paralinguistics, owing to their ability to reduce factors of variations, such as speaker and environment information in signals, for speech recognition .
Revised: Deep convolutional neural networks are being actively investigated in a wide range of speech and audio processing applications including speech recognition, audio event detection and computational paralinguistics, owing to their ability to reduce factors of variations, for learning from speech .
Edit intent: clarity
Original:  Here we investigate another  aspect of this interaction, which is whether Hebbian associative properties can also emerge as a network effect from a plasticity rule based on homeostatic principles on the neuronal level .
Revised:  Here we investigate another , new aspect of this interaction, which is whether Hebbian associative properties can also emerge as a network effect from a plasticity rule based on homeostatic principles on the neuronal level .
Edit intent: clarity
Original:  Here we investigate another  aspect of this interaction, which is whether Hebbian associative properties can also emerge as a network effect from a plasticity rule based on homeostatic principles on the neuronal level .
Revised:  Here we investigate another aspect of this dichotomy: Can Hebbian associative properties can also emerge as a network effect from a plasticity rule based on homeostatic principles on the neuronal level .
Edit intent: clarity
Original:  Here we investigate another  aspect of this interaction, which is whether Hebbian associative properties can also emerge as a network effect from a plasticity rule based on homeostatic principles on the neuronal level .
Revised:  Here we investigate another aspect of this interaction, which is whether Hebbian associative properties also emerge as a network effect from a plasticity rule based on homeostatic principles on the neuronal level .
Edit intent: clarity
Original:  Our results show that feature specific connectivity, similar to what has been experimentally observed in rodent visual cortex, can emerge out of a random balanced network of LIF neurons with a plasticity rulethat is not explicitly dependent on correlations between pre- and postsynaptic neuronal activity.
Revised:  Our results show that feature specific connectivity, similar to what has been observed in rodent visual cortex, can emerge out of a random balanced network of LIF neurons with a plasticity rulethat is not explicitly dependent on correlations between pre- and postsynaptic neuronal activity.
Edit intent: clarity
Original:  The experience dependent structural changes that are triggered by simulation are long lasting and decay only slowly when the neurons are exposed again to non modulated external input .
Revised:  The experience dependent structural changes that are triggered by simulation are long lasting and decay only slowly when the neurons are exposed again to unspecific external inputs .
Edit intent: clarity
Original:  Further, in a more specific linear-quadratic model where two interacting Principals hire one common Agent , we are able to calculate the optimal effort by the Agent for both Principals .
Revised:  Further, in a more specific linear-quadratic model where two interacting Principals hire one common Agent .
Edit intent: clarity
Original: Development of new medications is a  lengthy and costly process.
Revised: Development of new medications is a very lengthy and costly process.
Edit intent: clarity
Original:  In this study, we develop a general framework for drug discovery or repositioning by predicting indication for a particular disease based on expression profiles of the drugs . Drugs that are not originally indicated for the disease but with high predicted probabilities serve as good candidates for repurposing.
Revised:  In this study, we present an approach to drug discovery or repositioning by predicting indication for a particular disease based on expression profiles of the drugs . Drugs that are not originally indicated for the disease but with high predicted probabilities serve as good candidates for repurposing.
Edit intent: clarity
Original:  The method is also highly flexible as virtually any supervised learning algorithms can be used.
Revised:  It is also highly flexible as virtually any supervised learning algorithms can be used.
Edit intent: clarity
Original:  We applied a variety of state-of-the-art machine learning  approaches for prediction, including  support vector machines (SVM), deep neural networks (DNN), elastic netregression (EN) , random forest (RF) and gradient boosted machines (GBM).
Revised:  We applied various state-of-the-art machine learning approaches for prediction, including support vector machines (SVM), deep neural networks (DNN), elastic netregression (EN) , random forest (RF) and gradient boosted machines (GBM).
Edit intent: clarity
Original:  We applied a variety of state-of-the-art machine learning  approaches for prediction, including  support vector machines (SVM), deep neural networks (DNN), elastic netregression (EN) , random forest (RF) and gradient boosted machines (GBM).
Revised:  We applied a variety of state-of-the-art machine learning (ML) approaches for prediction, including support vector machines (SVM), deep neural networks (DNN), elastic netregression (EN) , random forest (RF) and gradient boosted machines (GBM).
Edit intent: clarity
Original:  We applied a variety of state-of-the-art machine learning  approaches for prediction, including  support vector machines (SVM), deep neural networks (DNN), elastic netregression (EN) , random forest (RF) and gradient boosted machines (GBM).
Revised:  We applied a variety of state-of-the-art machine learning approaches for prediction, including support vector machines (SVM), elastic net , random forest (RF) and gradient boosted machines (GBM).
Edit intent: clarity
Original:  We applied a variety of state-of-the-art machine learning  approaches for prediction, including  support vector machines (SVM), deep neural networks (DNN), elastic netregression (EN) , random forest (RF) and gradient boosted machines (GBM).
Revised:  We applied a variety of state-of-the-art machine learning approaches for prediction, including support vector machines (SVM), deep neural networks (DNN), elastic netregression (EN) , random forest and gradient boosted machines (GBM).
Edit intent: clarity
Original:  We found that SVM performed the best overall, followed by EN and DNN .  As a further validation of our approach, we observed that the repositioning hits are enriched for psychiatric medications considered in clinical trials.
Revised:  We found that SVM performed the best overall, followed by EN and DNN . As a further validation , we showed that the repositioning hits are enriched for psychiatric medications considered in clinical trials.
Edit intent: clarity
Original:  Many top repositioning hits are also supported by previous animal or clinical studies.
Revised:  Notably, many top repositioning hits are also supported by previous animal or clinical studies.
Edit intent: coherence
Original:  Many top repositioning hits are also supported by previous animal or clinical studies.
Revised:  Many top repositioning hits are supported by previous animal or clinical studies.
Edit intent: clarity
Original:  Many top repositioning hits are also supported by previous animal or clinical studies.
Revised:  Many top repositioning hits are also supported by previous preclinical or clinical studies.
Edit intent: clarity
Original:  Interestingly, despite slightly lower predictive accuracy, DNN and EN revealed several literature-supported repositioning candidates that are of different mechanisms of actions from the SVM top results .
Revised:  Finally, we propose that ML approaches may provide a new avenue to explore drug mechanisms via examining the variable importance of gene features .
Edit intent: clarity
Original:  We also investigate the effect of punishment on cooperation and find that punishment acts like a magnetic field that leads to an "alignment" between players, thus encouraging cooperation.
Revised:  We then investigate the effect of punishment on cooperation and find that punishment acts like a magnetic field that leads to an "alignment" between players, thus encouraging cooperation.
Edit intent: coherence
Original:  We also investigate the effect of punishment on cooperation and find that punishment acts like a magnetic field that leads to an "alignment" between players, thus encouraging cooperation.
Revised:  We also investigate the effect of punishment on cooperation and find that punishment plays the role of a magnetic field that leads to an "alignment" between players, thus encouraging cooperation.
Edit intent: clarity
Original:  Our approach relies on establishing that the differential of the nonlinear dynamics (under suitable analyticity conditions) is contractive in the \ell_1 metric .
Revised:  Our approach relies on establishing that the differential of the nonlinear evolution in the \ell_1 metric .
Edit intent: clarity
Original:  Our approach relies on establishing that the differential of the nonlinear dynamics (under suitable analyticity conditions) is contractive in the \ell_1 metric .
Revised:  Our approach relies on establishing that the differential of the nonlinear dynamics (under suitable analyticity conditions) is contractive in the \ell_1 -metric .
Edit intent: clarity
Original: We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless sensor communication network . Given an edge-weighted n-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph.
Revised: We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless sensor communication network : Given an edge-weighted n-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph.
Edit intent: fluency
Original: We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless sensor communication network: Given an edge-weighted n-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph.
Revised: We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless communication network: Given an edge-weighted n-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph.
Edit intent: clarity
Original:  In experiments, the algorithm solves instances with four such connected components and about 8 000 vertices in five minutes, outperforming CPLEX with known ILP formulations for the problem .
Revised:  In experiments, the algorithm outperforms CPLEX with known ILP formulations for the problem .
Edit intent: clarity
Original: We show that, up to renaming of the letters, the only infinite ternary words avoiding the formula ABCAB.
Revised: We obtain the following results about the avoidance of ternary formulas. Up to renaming of the letters, the only infinite ternary words avoiding the formula ABCAB.
Edit intent: clarity
Original:  Also, we show that the formula ABAC.
Revised:  The formula ABAC.
Edit intent: coherence
Original:  In addition, this paper also shows that this class of group-server queues are often encountered in  other practical areas including communication networks, manufacturing systems, transportation networks, financial networks and healthcare systems.
Revised:  In addition, this paper also shows that this class of group-server queues are often encountered in many other practical areas including communication networks, manufacturing systems, transportation networks, financial networks and healthcare systems.
Edit intent: clarity
Original:  This leads to that the large-scale service system  is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and various service resources, which makes that the middle layer of this service system can more effectively be managed and strengthened under a dynamically , real-time and even reward  framework.
Revised:  This leads to the large-scale service system is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and various service resources, which makes that the middle layer of this service system can more effectively be managed and strengthened under a dynamically , real-time and even reward framework.
Edit intent: fluency
Original:  This leads to that the large-scale service system  is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and various service resources, which makes that the middle layer of this service system can more effectively be managed and strengthened under a dynamically , real-time and even reward  framework.
Revised:  This leads to that the large-scale service system that is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and various service resources, which makes that the middle layer of this service system can more effectively be managed and strengthened under a dynamically , real-time and even reward framework.
Edit intent: fluency
Original:  This leads to that the large-scale service system  is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and various service resources, which makes that the middle layer of this service system can more effectively be managed and strengthened under a dynamically , real-time and even reward  framework.
Revised:  This leads to that the large-scale service system is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and regrouping of service resources, which makes that the middle layer of this service system can more effectively be managed and strengthened under a dynamically , real-time and even reward framework.
Edit intent: clarity
Original:  This leads to that the large-scale service system  is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and various service resources, which makes that the middle layer of this service system can more effectively be managed and strengthened under a dynamically , real-time and even reward  framework.
Revised:  This leads to that the large-scale service system is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and various service resources, which make the middle layer of this service system can more effectively be managed and strengthened under a dynamically , real-time and even reward framework.
Edit intent: fluency
Original:  This leads to that the large-scale service system  is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and various service resources, which makes that the middle layer of this service system can more effectively be managed and strengthened under a dynamically , real-time and even reward  framework.
Revised:  This leads to that the large-scale service system is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and various service resources, which makes that the middle layer of this service system more effectively managed and strengthened under a dynamically , real-time and even reward framework.
Edit intent: clarity
Original:  This leads to that the large-scale service system  is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and various service resources, which makes that the middle layer of this service system can more effectively be managed and strengthened under a dynamically , real-time and even reward  framework.
Revised:  This leads to that the large-scale service system is divided into several adaptive and self-organizing subsystems through scheduling of batch customers and various service resources, which makes that the middle layer of this service system can more effectively be managed and strengthened under a dynamic , real-time and even reward framework.
Edit intent: fluency
Original:  Therefore, not only is analysis of group-server queues  regarded as a new interesting research direction, but it also exists many theoretic challenging , basic difficulties and open problems in the area of queueing networks.
Revised:  Therefore, not only analysis of group-server queues regarded as a new interesting research direction, but it also exists many theoretic challenging , basic difficulties and open problems in the area of queueing networks.
Edit intent: coherence
Original:  Therefore, not only is analysis of group-server queues  regarded as a new interesting research direction, but it also exists many theoretic challenging , basic difficulties and open problems in the area of queueing networks.
Revised:  Therefore, not only is analysis of group-server queues regarded as a new interesting research direction, but it also exists many theoretical challenges , basic difficulties and open problems in the area of queueing networks.
Edit intent: fluency
Original:  Models for nodes interacting over such signed networks, where two  types of interactions are defined along the positive and negative links, respectively, arise from various biological, social, political, and economical systems.
Revised:  Models for nodes interacting over such signed networks, where two types of interactions take place along the positive and negative links, respectively, arise from various biological, social, political, and economical systems.
Edit intent: clarity
Original:  Models for nodes interacting over such signed networks, where two  types of interactions are defined along the positive and negative links, respectively, arise from various biological, social, political, and economical systems.
Revised:  Models for nodes interacting over such signed networks, where two types of interactions are defined along the positive and negative links, respectively, arise from various biological, social, political, and economic systems.
Edit intent: fluency
Original:  As modifications to the conventional DeGroot dynamics for positive links, two basic types of negative interactions along negative links, namely the opposing rule and the repelling rule, have been proposed and extensively studied .
Revised:  As modifications to the conventional DeGoot dynamics for positive links, two basic types of negative interactions along negative links, namely the opposing rule and the repelling rule, have been proposed and extensively studied .
Edit intent: fluency
Original:  As modifications to the conventional DeGroot dynamics for positive links, two basic types of negative interactions along negative links, namely the opposing rule and the repelling rule, have been proposed and extensively studied .
Revised:  As modifications to the conventional DeGroot dynamics for positive links, two basic types of negative interactions along negative links, namely the opposing rule and the repelling rule, have been proposed and studied in the literature .
Edit intent: clarity
Original:  This paper reviews some fundamental convergence results that appeared recently in the literature for dynamics over deterministic or random signed networks under a unified algebraic-graphical method.
Revised:  This paper reviews a few fundamental convergence results that appeared recently in the literature for dynamics over deterministic or random signed networks under a unified algebraic-graphical method.
Edit intent: fluency
Original:  This paper reviews some fundamental convergence results that appeared recently in the literature for dynamics over deterministic or random signed networks under a unified algebraic-graphical method.
Revised:  This paper reviews some fundamental convergence results for such dynamics over deterministic or random signed networks under a unified algebraic-graphical method.
Edit intent: clarity
Original:  As modifications to the conventional DeGoot dynamics for positive links, two basic types of negative interactions along negative links, namely the opposing rule and the repelling rule, have been proposed and studied in the literature.
Revised:  As modifications to the conventional DeGroot dynamics for positive links, two basic types of negative interactions along negative links, namely the opposing rule and the repelling rule, have been proposed and studied in the literature.
Edit intent: fluency
Original: We introduce the open source parameter estimation tool awkt .
Revised: We present a computational parameter estimation tool awkt .
Edit intent: clarity
Original:  The program untangles a proteins' charge-to-size ratio by applying nonlinear least-squares optimization to a particular closed-form solution of the Nernst-Planck equation .
Revised:  The program untangles a proteins' charge-to-size ratio by applying nonlinear least-squares optimization to a specific closed-form solution of the Nernst-Planck equation .
Edit intent: clarity
Original:  We develop the first efficient single pass streaming algorithm, Streaming Local Search, with constant factor (4p-1) / 4p(8p \big( + 2d-1)+1/\alpha +2d(1+\alpha)}\big) approximation guarantee for maximizing a non-monotone submodular function under a p-system and d knapsack constraints , with a memory independent of data size.
Revised:  We develop the first efficient single pass streaming algorithm, Streaming Local Search, with constant factor (4p-1) / \big( + 2d-1)+1/\alpha +2d(1+\alpha)}\big) approximation guarantee for maximizing a non-monotone submodular function under a p-system and d knapsack constraints , with a memory independent of data size.
Edit intent: clarity