wanyu/IteraTeR_v2 huggingface dataset:
Original:  Taken together, this work represents an important first step at  identifying critical transitions/events in team communication and interaction patterns that form the basis for many promising future studies focused on optimizing team performance and well-being .
Revised:  Taken together, this work represents an important first step at optimizing team effectiveness by identifying critical transitions/events in team communication and interaction patterns that form the basis for many promising future studies focused on optimizing team performance and well-being .
Edit intent: clarity
Original:  Taken together, this work represents an important first step at  identifying critical transitions/events in team communication and interaction patterns that form the basis for many promising future studies focused on optimizing team performance and well-being .
Revised:  Taken together, this work represents an important first step at identifying critical transitions/events in team communication and interaction patterns .
Edit intent: clarity
Original: It is well recognized that data are invaluable.
Revised: Data are invaluable.
Edit intent: clarity
Original:  We cover both digital products and data products.
Revised:  We discuss both digital products and data products.
Edit intent: clarity
Original:  Last, we discuss a series of challenges and directions for future work.
Revised:  We also consider a series of challenges and directions for future work.
Edit intent: clarity
Original: Timely completion of design cycles for multiscale and multiphysics systems ranging from consumer electronics to hypersonic vehicles relies on rapid simulation-based prototyping.
Revised: Timely completion of design cycles for complex systems ranging from consumer electronics to hypersonic vehicles relies on rapid simulation-based prototyping.
Edit intent: clarity
Original:  The latter typically involves high-dimensional spaces of possibly correlated control variables (CVs) and quantities of interest (QoIs) with non-Gaussian and /or multimodal distributions.
Revised:  The latter typically involves high-dimensional spaces of possibly correlated control variables (CVs) and quantities of interest (QoIs) with non-Gaussian and possibly multimodal distributions.
Edit intent: fluency
Original: Deep learning applications are usually very compute-intensive and require a long runtime for training and inference.
Revised: Deep learning applications are usually very compute-intensive and require a long run time for training and inference.
Edit intent: clarity
Original:  UAS traffic management (UTM) system for low-altitude airspace is therefore immediately necessary for its safe and high-density use.
Revised:  UAS traffic management (UTM) is necessary for automated safe and efficient low-altitude airspace is therefore immediately necessary for its safe and high-density use.
Edit intent: clarity
Original:  We formalize FAA's notion of operation volumes (OVs) that express aircraft intent in terms of 4D blocks of airspace and associated real-time deadlines.
Revised:  We formalize FAA's notion of operation volumes that express aircraft intent in terms of 4D blocks of airspace and associated real-time deadlines.
Edit intent: clarity
Original:  We present a prototype coordination protocol using OVs , involving participating aircraft and an airspace manager.
Revised:  We present an executable prototype coordination protocol using OVs , involving participating aircraft and an airspace manager.
Edit intent: clarity
Original:  The experiments also delineate the trade-off between performance , workload, and violation rate across different strategies for generating OVs.
Revised:  The experiments also delineate the trade-off between performance and workload across different strategies for generating OVs.
Edit intent: clarity
Original:  We present an executable prototype coordination protocolusing operation volumes, involving participating aircraft and an airspace manager . Next, we show how to use an ensemble of existing simulation and formal verification tools to analyze the protocol including (1)
Revised:  We present an executable prototype coordination protocolusing operation volumes, involving participating aircraft and an airspace manager for traffic routing. We show how existing formal verification tools to analyze the protocol including (1)
Edit intent: clarity
Original:  Our experiments also delineate the trade-off between performance and workload across different strategies for generating operation volumes .
Revised:  Our experiments delineate the trade-off between performance and workload across different strategies for generating operation volumes .
Edit intent: clarity
Original:  Our experiments also delineate the trade-off between performance and workload across different strategies for generating operation volumes .
Revised:  Our experiments also delineate the trade-off between performance and workload across different strategies for generating OVs .
Edit intent: clarity
Original:  Among others, they show promising results in developing multi-objective recommender systems with both correlated and uncorrelated objectives.
Revised:  Among others, they show promising results in developing multi-objective recommender systems with both correlated and conflicting objectives.
Edit intent: clarity
Original:  In this work, we create a multi-objective  Adamize method that leverage the benefits of the Adam optimizer in single-objective problems.
Revised:  In this work, we create a multi-objective Adamize method that leverages the benefits of the Adam optimizer in single-objective problems.
Edit intent: fluency
Original:  We evaluate the benefits of Multi-objective Adamize on two multi-objective recommender systems and for three different objective combinations, both correlated or uncorrelated .
Revised:  We evaluate the benefits of multi-objective Adamize on two multi-objective recommender systems and for three different objective combinations, both correlated or uncorrelated .
Edit intent: fluency
Original:  We evaluate the benefits of Multi-objective Adamize on two multi-objective recommender systems and for three different objective combinations, both correlated or uncorrelated .
Revised:  We evaluate the benefits of Multi-objective Adamize on two multi-objective recommender systems and for three different objective combinations, both correlated or conflicting .
Edit intent: clarity
Original:  Classic multi-gradient  descent usually relies on the combination of the gradients, not including the computation of first and second moments of the gradients.
Revised:  Classic multi-gradient ~ descent usually relies on the combination of the gradients, not including the computation of first and second moments of the gradients.
Edit intent: fluency
Original:  This corrects and stabilizes the gradients of every objective before calculating a common gradient descent vector that optimizes all the objectives simultaneously.
Revised:  This corrects and stabilizes ~the~ gradients of every objective before calculating a common gradient descent vector that optimizes all the objectives simultaneously.
Edit intent: clarity
Original:  We evaluate the benefits of multi-objective Adamize on two multi-objective recommender systems and for three different objective combinations, both correlated or conflicting.
Revised:  We evaluate the benefits of Multi-objective Adamize on two multi-objective recommender systems and for three different objective combinations, both correlated or conflicting.
Edit intent: fluency
Original:  Finally, we show that the Adamized Pareto front strictly dominates the previous one on multiple objective pairs.
Revised:  Finally, we show that the Adamized Pareto front strictly dominates the previous one on multiple objective pairs.
Edit intent: fluency
Original:  According to the results of computational experiments for undirected multigraphs, both backtracking algorithms lost to the known heuristic general variable neighborhood search algorithm.
Revised:  According to the results of computational experiments for undirected multigraphs, both backtracking algorithms lost to the known general variable neighborhood search algorithm.
Edit intent: clarity
Original:  Using stochastic control theory  we identify the optimal strategies of agents with market impact and exhibit the Nash equilibrium in closed form for a finite number of agents as well as in the asymptotic framework of mean field games.
Revised:  Using stochastic control theory , we identify the optimal strategies of agents with market impact and exhibit the Nash equilibrium in closed form for a finite number of agents as well as in the asymptotic framework of mean field games.
Edit intent: fluency
Original: Sparse polynomial chaos expansions ( PCEs ) are an efficient and widely used surrogate modeling method in uncertainty quantification  .
Revised: Sparse polynomial chaos expansions ( PCE ) are an efficient and widely used surrogate modeling method in uncertainty quantification .
Edit intent: fluency
Original:  We investigate the synergies between sparse regression solvers and basis adaptivity schemes, and provide recommendations on which of them are most promising for specific classes of problems.
Revised:  Investigating the synergies between sparse regression solvers and basis adaptivity schemes, and provide recommendations on which of them are most promising for specific classes of problems.
Edit intent: coherence
Original:  We demonstrate that this meta-selection procedure provides close-to-optimal results in terms of accuracy, and significantly more robust solutions, while being more general than the case-by-case recommendations obtained by the benchmark.
Revised:  We demonstrate that this automatic selection procedure provides close-to-optimal results in terms of accuracy, and significantly more robust solutions, while being more general than the case-by-case recommendations obtained by the benchmark.
Edit intent: clarity
Original:  We correlate the COVID-19 prevalence and death rate with data from the US Census Bureau and point out how the spreading patterns of the disease show asymmetries in urban and rural areas separately and is preferentially affecting the counties where a large fraction of the population is non-white.
Revised:  We correlate the COVID-19 prevalence and death rate with data from the US Census Bureau and point out how the spreading patterns of the disease show asymmetries in urban and rural areas separately and are preferentially affecting the counties where a large fraction of the population is non-white.
Edit intent: fluency
Original: In this paper we introduce and describe an implementation of curved surface geometries within the Dune framework for grid-based discretizations.
Revised: In this paper we introduce and describe an implementation of curved (surface) geometries within the Dune framework for grid-based discretizations.
Edit intent: coherence
Original:  In order to help users to find the right and relevant content, news recommender systems (NRS) are developed to relieve the information overload problem and suggest news items that users might be in-terested in.
Revised:  In order to help users to find the right and relevant content, news recommender systems (NRS) are developed to relieve the information overload problem and suggest news items that users might be interested in.
Edit intent: fluency
Original:  In this paper, we highlight the major challenges faced by the news recommen-dation domain and identify the possible solutions from the state-of-the-art.
Revised:  In this paper, we highlight the major challenges faced by the news recommendation domain and identify the possible solutions from the state-of-the-art.
Edit intent: fluency
Original:  Due to the rapid growth of building recommender systems using deep learning models, we divide our dis-cussion in two parts.
Revised:  Due to the rapid growth of building recommender systems using deep learning models, we divide our discussion in two parts.
Edit intent: fluency
Original:  In the first part, we present an overview of the conventional recom-mendation solutions, datasets, evaluation criteria beyond accuracy and recommendation platforms being used in NRS.
Revised:  In the first part, we present an overview of the conventional recommendation solutions, datasets, evaluation criteria beyond accuracy and recommendation platforms being used in NRS.
Edit intent: fluency
Original:  In the second part, we explain  deep learning-based recom-mendation solutions applied in NRS. Different from previous surveys, we also study the effects of news recommendations on user behavior and try to suggest the possible reme-dies to mitigate these effects.
Revised:  In the second part, we explain the deep learning-based recom-mendation solutions applied in NRS. Different from previous surveys, we also study the effects of news recommendations on user behavior and try to suggest the possible reme-dies to mitigate these effects.
Edit intent: fluency
Original:  In the second part, we explain  deep learning-based recom-mendation solutions applied in NRS. Different from previous surveys, we also study the effects of news recommendations on user behavior and try to suggest the possible reme-dies to mitigate these effects.
Revised:  In the second part, we explain deep learning-based recommendation solutions applied in NRS. Different from previous surveys, we also study the effects of news recommendations on user behavior and try to suggest the possible reme-dies to mitigate these effects.
Edit intent: fluency
Original:  In the second part, we explain  deep learning-based recom-mendation solutions applied in NRS. Different from previous surveys, we also study the effects of news recommendations on user behavior and try to suggest the possible reme-dies to mitigate these effects.
Revised:  In the second part, we explain deep learning-based recom-mendation solutions applied in NRS. Different from previous surveys, we also study the effects of news recommendations on user behavior and try to suggest the possible remedies to mitigate these effects.
Edit intent: fluency
Original:  It also sheds light on potential new directions .
Revised:  It also sheds light on potential new directions 
Edit intent: fluency
Original:  The evidence shows that the index captures well the different phases of financial time series  .
Revised:  The evidence shows that the index captures the different phases of financial time series .
Edit intent: clarity
Original:  An experimental analysis demonstrates that our algorithms require fewer queries (often substantially less than n) to achieve better objective value than the current state-of-the-art  algorithms.
Revised:  An empirical analysis demonstrates that our algorithms require fewer queries (often substantially less than n) to achieve better objective value than the current state-of-the-art algorithms.
Edit intent: clarity
Original:  An experimental analysis demonstrates that our algorithms require fewer queries (often substantially less than n) to achieve better objective value than the current state-of-the-art  algorithms.
Revised:  An experimental analysis demonstrates that our algorithms require fewer queries (often substantially less than n) yet still achieve better objective value than the current state-of-the-art algorithms.
Edit intent: clarity
Original:  Modeling the connectivity structure of a given problem instance thus necessitates the computation of a minor embedding of the variables in the problem specification onto  logical qubits, which consist of several physical qubits "chained" together to act as a logical one.
Revised:  Modeling the connectivity structure of a given problem instance thus necessitates the computation of a minor embedding of the variables in the problem specification onto the logical qubits, which consist of several physical qubits "chained" together to act as a logical one.
Edit intent: fluency
Original:  Within the (generally optimistic) assumptions of our model, including the key assumption that exponential progress in qubit count and gate fidelity will continue, we estimate that that proof-of-concept fault-tolerant computation based onsuperconductor technology is unlikely (<5\% confidence) to be exhibited before 2026, and that quantum devices capable of factoring RSA-2048 are unlikely (<5\% confidence) to exist before 2039.
Revised:  Within the (generally optimistic) assumptions of our model, including the key assumption that exponential progress in qubit count and gate fidelity will continue, we estimate that that proof-of-concept fault-tolerant computation based on superconductor technology is unlikely (<5\% confidence) to be exhibited before 2026, and that quantum devices capable of factoring RSA-2048 are unlikely (<5\% confidence) to exist before 2039.
Edit intent: fluency
Original:  We generated processed audio signals by combining left- and right-channel audio signals in a few different ways and then extracted embedded features (also called d-vectors) from those processed audio signals.
Revised:  Processed audio signals were generated by combining left- and right-channel audio signals in a few different ways and then extracted embedded features (also called d-vectors) from those processed audio signals.
Edit intent: clarity
Original:  We applied the Gaussian mixture model (GMM) for supervised utterance clustering.
Revised:  This study applied the Gaussian mixture model (GMM) for supervised utterance clustering.
Edit intent: clarity
Original:  We applied the Gaussian mixture model (GMM) for supervised utterance clustering.
Revised:  We applied the Gaussian mixture model for supervised utterance clustering.
Edit intent: clarity
Original:  In the training phase, we used a parameter sharing GMM to train the model for each speaker.
Revised:  In the training phase, a parameter sharing GMM to train the model for each speaker.
Edit intent: coherence
Original:  In the testing phase, we selected the speaker with the maximum likelihood  as the detected speaker.
Revised:  In the testing phase, the speaker with the maximum likelihood as the detected speaker.
Edit intent: clarity
Original:  In the testing phase, we selected the speaker with the maximum likelihood  as the detected speaker.
Revised:  In the testing phase, we selected the speaker with the maximum likelihood was selected as the detected speaker.
Edit intent: clarity
Original:  Results of experiments with real audio recordings of multi-person discussion sessions showed that our proposed method that used multichannel audio signals achieved significantly better performance than a conventional method with mono audio signals  .
Revised:  Results of experiments with real audio recordings of multi-person discussion sessions showed that the proposed method that used multichannel audio signals achieved significantly better performance than a conventional method with mono audio signals .
Edit intent: clarity
Original:  We first show that maximizing the consensus time subject to removing limited network edges  can be cast as an effective resistance interdiction problem  .
Revised:  We first show that maximizing the consensus time subject to removing limited network edges , can be cast as an effective resistance interdiction problem .
Edit intent: fluency
Original:  We then show that the effective resistance interdiction problem is strongly NP-hard, even for three types of resistors in the network , hence correcting some claims in the existing literature.
Revised:  We then show that ERIP is strongly NP-hard, even for three types of resistors in the network , hence correcting some claims in the existing literature.
Edit intent: clarity
Original:  Finally, we provide a quadratic program formulation  to find a local optimum solution to the consensus interdiction problem .
Revised:  Finally, we provide a quadratic program formulation to find a local optimum for the CIP .
Edit intent: clarity
Original:  We first show that the consensus interdiction problem (CIP), in which the goal is to maximize the convergence time of consensus dynamics subject to removing limited network edges, can be cast as an effective resistance interdiction problem (ERIP) .
Revised:  We first show that the consensus interdiction problem (CIP), in which the goal is to maximize the convergence time of consensus dynamics subject to removing a limited number of network edges. We first show that CIP can be cast as an effective resistance interdiction problem (ERIP) .
Edit intent: clarity
Original:  We then show that ERIP is strongly NP-hard, even for bipartite graphs of diameter three with fixed  source/sink edges .
Revised:  We then show that ERIP is strongly NP-hard, even for bipartite graphs of diameter three with fixed edges incident to the source/sink edges .
Edit intent: clarity
Original:  We then show that ERIP is strongly NP-hard, even for bipartite graphs of diameter three with fixed  source/sink edges .
Revised:  We then show that ERIP is strongly NP-hard, even for bipartite graphs of diameter three with fixed source/sink .
Edit intent: clarity
Original:  We establish the same hardness result for the CIP, hence correcting some claims in the existing literature.
Revised:  We establish the same hardness result for the CIP, hence correcting some claims in the past literature.
Edit intent: clarity
Original:  We then show that both ERIP and CIP do not admit a polynomial-time approximation scheme , and moreover, they cannot be approximated up to a (nearly) polynomial factor assuming exponential time hypothesis.
Revised:  We then show that both ERIP and CIP do not admit polynomial-time approximation scheme , and moreover, they cannot be approximated up to a (nearly) polynomial factor assuming exponential time hypothesis.
Edit intent: fluency
Original:  We then show that both ERIP and CIP do not admit a polynomial-time approximation scheme , and moreover, they cannot be approximated up to a (nearly) polynomial factor assuming exponential time hypothesis.
Revised:  We then show that both ERIP and CIP do not admit a polynomial-time approximation schemes , and moreover, they cannot be approximated up to a (nearly) polynomial factor assuming exponential time hypothesis.
Edit intent: fluency
Original:  Finally, using a quadratic program formulation, we devise a polynomial-time n^4-approximation algorithm for ERIP that only depends on the number of nodes n and  is independent of the size of edge resistances.
Revised:  Subsequently, we devise a polynomial-time n^4-approximation algorithm for ERIP that only depends on the number of nodes n and is independent of the size of edge resistances.
Edit intent: coherence
Original:  We also develop an iterative heuristic approximation algorithm to find a local optimum for the CIP.
Revised:  We also develop an iterative heuristic approximation algorithm to find a local optimal solution for the CIP.
Edit intent: clarity
Original:  We show that ERIP is strongly NP-hard, even for bipartite graphs of diameter three with fixed edges incident to the source/sink .
Revised:  We show that ERIP is strongly NP-hard, even for bipartite graphs of diameter three with fixed source/sink .
Edit intent: clarity
Original:  We establish the same hardness result for the CIP , hence correcting some claims in the past literature .
Revised:  We establish the same hardness result for the CIP .
Edit intent: coherence
Original:  We then show that both ERIP and CIP do not admit polynomial-time approximation schemes, and moreover, they cannot be approximated up to a (nearly) polynomial factor assuming exponential time hypothesis.
Revised:  We then show that both ERIP and CIP cannot be approximated up to a (nearly) polynomial factor assuming exponential time hypothesis.
Edit intent: clarity
Original:  It discusses the extension of the Empirical Roofline Toolkit for more data precision support and Tensor Core support and introduces an Nsight Compute based method to accurately collect application performance information.
Revised:  It discusses the extension of the Empirical Roofline Toolkit for more data precision support and Tensor Core support and introduces a Nsight Compute based method to accurately collect application performance information.
Edit intent: fluency