wanyu/IteraTeR_v2 huggingface dataset:
Original:  We introduce a novel MF framework, named meta matrix factorization (MetaMF) , that generates private item embeddings and RP models . Given a vector representing a user, we first obtain a collaborative vector by collecting useful information from all users with a collaborative memory (CM) module.
Revised:  We introduce a novel MF framework, named meta matrix factorization (MetaMF) , that generates private item embeddings and RP models . Given a vector representing a user, we first obtain a collaborative vector by collecting useful information from all users with a collaborative memory module.
Edit intent: clarity
Original:  Then, we employ a meta recommender (MR) module to generate private item embeddings and a RP model based on the collaborative vector  .
Revised:  Then, we employ a meta recommender module to generate private item embeddings and a RP model based on the collaborative vector .
Edit intent: clarity
Original:  To address the challenge of generating a large number of high-dimensional item embeddings, we devise a rise-dimensional generation (RG) strategy that first generates a low-dimensional item embedding matrix and a rise-dimensional matrix, and then multiply them to obtain high-dimensional embeddings.
Revised:  To address the challenge of generating a large number of high-dimensional item embeddings, we devise a rise-dimensional generation strategy that first generates a low-dimensional item embedding matrix and a rise-dimensional matrix, and then multiply them to obtain high-dimensional embeddings.
Edit intent: clarity
Original:  Finally, we use the generated model to produce private RPs for a given user . Experiments on two benchmark datasets show that MetaMF outperforms state-of-the-art MF methods .
Revised:  We use the generated model to produce private RPs for a given user . Experiments on two benchmark datasets show that MetaMF outperforms state-of-the-art MF methods .
Edit intent: coherence
Original:  MetaMF generates similar / dissimilar item embeddings and models for different users to flexibly exploit collaborative filtering (CF), demonstrating the benefits of MetaMF .
Revised:  MetaMF generates similar / devices .
Edit intent: clarity
Original:  Some commonly  adversarial attacks to images have been applied to Mel-frequency and short-time Fourier transform spectrograms  and such perturbed spectrograms are able to fool a 2D convolutional neural network (CNN) for music genre classification with a high fooling rate and high confidence .
Revised:  Some commonly used adversarial attacks to images have been applied to Mel-frequency and short-time Fourier transform spectrograms and such perturbed spectrograms are able to fool a 2D convolutional neural network (CNN) for music genre classification with a high fooling rate and high confidence .
Edit intent: clarity
Original:  Some commonly  adversarial attacks to images have been applied to Mel-frequency and short-time Fourier transform spectrograms  and such perturbed spectrograms are able to fool a 2D convolutional neural network (CNN) for music genre classification with a high fooling rate and high confidence .
Revised:  Some commonly adversarial attacks to images have been applied to Mel-frequency and short-time Fourier transform spectrograms , and such perturbed spectrograms are able to fool a 2D convolutional neural network (CNN) for music genre classification with a high fooling rate and high confidence .
Edit intent: fluency
Original:  Some commonly  adversarial attacks to images have been applied to Mel-frequency and short-time Fourier transform spectrograms  and such perturbed spectrograms are able to fool a 2D convolutional neural network (CNN) for music genre classification with a high fooling rate and high confidence .
Revised:  Some commonly adversarial attacks to images have been applied to Mel-frequency and short-time Fourier transform spectrograms and such perturbed spectrograms are able to fool a 2D convolutional neural network (CNN) .
Edit intent: clarity
Original:   Experimental results on a dataset of western music have shown that the 2D CNN achieves up to 81.87\% of mean accuracy on legitimate examples and such a performance drops to 12.09\% on adversarial examples.
Revised:  Experimental results on a dataset of western music have shown that the 2D CNN achieves up to 81.87\% of mean accuracy on legitimate examples and such performance drops to 12.09\% on adversarial examples.
Edit intent: fluency
Original:  Furthermore, the audio signals reconstructed from the adversarial spectrograms produce audio waveforms that perceptually resemble the legitimate audio .
Revised:  Furthermore, the audio waveforms reconstructed from the perturbed spectrograms .
Edit intent: clarity
Original:  The term SMD originates from the related notion of metric dimension (MD), which can be defined the same way as the SMD, except that the player must choose all queries before any of the distances are revealed .
Revised:  The term SMD originates from the related notion of metric dimension (MD), which can be defined the same way as the SMD, except that the player 's queries are non-adaptive .
Edit intent: clarity
Original:  In this work, we extend the results of arXiv:1208.3801 on the MD of Erdos-R\'enyi graphs to the SMD. We find that, in fully connected Erdos-R\'enyi graphs, the MD and the SMD are a constant factor apart.
Revised:  In this work, we extend the results of arXiv:1208.3801 on the MD of Erdos-R\'enyi graphs to the SMD. We find that, in connected Erdos-R\'enyi graphs, the MD and the SMD are a constant factor apart.
Edit intent: clarity
Original:  Connections with source localization, binary search on graphs and the birthday paradox are discussed.
Revised:  Connections with source localization, binary search on graphs and the birthday problem are discussed.
Edit intent: clarity
Original:  Qualitative properties of these solution are investigated, both theoretically and numerically.
Revised:  Qualitative properties of these solutions are investigated, both theoretically and numerically.
Edit intent: fluency
Original: Genetic data are often used to infer history, demographic changes or detect genes under selection.
Revised: Genetic data are often used to infer demographic history and changes or detect genes under selection.
Edit intent: clarity
Original:  In this paper, we present a stochastic birth death model with competitive interaction to describe an asexual population, and we develop an inferential procedure for ecological, demographic and genetical parameters.
Revised:  In this paper, we present a stochastic birth-death model with competitive interaction to describe an asexual population, and we develop an inferential procedure for ecological, demographic and genetical parameters.
Edit intent: fluency
Original:  In this paper, we present a stochastic birth death model with competitive interaction to describe an asexual population, and we develop an inferential procedure for ecological, demographic and genetical parameters.
Revised:  In this paper, we present a stochastic birth death model with competitive interactions and asexual reproduction. We develop an inferential procedure for ecological, demographic and genetical parameters.
Edit intent: clarity
Original:  In this paper, we present a stochastic birth death model with competitive interaction to describe an asexual population, and we develop an inferential procedure for ecological, demographic and genetical parameters.
Revised:  In this paper, we present a stochastic birth death model with competitive interaction to describe an asexual population, and we develop an inferential procedure for ecological, demographic and genetic parameters.
Edit intent: fluency
Original:  {This leads us to propose an original model of phylogenies, with trait structure and interactions, that allows multiple mergings }.
Revised:  {This leads us to propose an original model of phylogenies, with trait structure and interactions, that allows multiple merging }.
Edit intent: fluency
Original:  Then, we present a novel approach to randomly choose target-oriented deceptive trajectories in an adaptive manner to deceive humans in the long run .
Revised:  We then present a novel approach to randomly choose target-oriented deceptive trajectories in an adaptive manner to deceive humans in the long run .
Edit intent: coherence
Original:  Then, we present a novel approach to randomly choose target-oriented deceptive trajectories in an adaptive manner to deceive humans in the long run .
Revised:  Then, we present a novel approach to adaptively choose target-oriented deceptive trajectories in an adaptive manner to deceive humans in the long run .
Edit intent: clarity
Original:  Then, we present a novel approach to randomly choose target-oriented deceptive trajectories in an adaptive manner to deceive humans in the long run .
Revised:  Then, we present a novel approach to randomly choose target-oriented deceptive trajectories to deceive humans in the long run .
Edit intent: clarity
Original:  Additionally, we propose a new metric to evaluate deception in the data collected from the users when interacting with the mobile robot simulator.
Revised:  Additionally, we propose a new metric to evaluate deception on data collected from the users when interacting with the mobile robot simulator.
Edit intent: clarity
Original:  The statistical evaluation of these studies showed that the proposed adaptive deceptive algorithm did deceive humans in the long run and it is more effective than a random choice of deceptive strategies.
Revised:  The statistical evaluation of these studies showed that the proposed adaptive deceptive algorithm did deceive humans in the long run and it is more effective than random choice of deceptive strategies.
Edit intent: fluency
Original: While significant advances have been made in recent years in the separation of overlapping speech signals, studies have been largely constrained to mixtures of clean, near-field speech, not representative of many real-world scenarios.
Revised: While significant advances have been made with respect to the separation of overlapping speech signals, studies have been largely constrained to mixtures of clean, near-field speech, not representative of many real-world scenarios.
Edit intent: clarity
Original:  Although the WHAM! dataset introduced noise to the ubiquitous wsj0-2mix dataset, it did not include the addition of reverberation, generally present in indoor recordings outside of recording studios.
Revised:  Although the WHAM! dataset introduced noise to the ubiquitous wsj0-2mix dataset, it did not include reverberation, which is generally present in indoor recordings outside of recording studios.
Edit intent: clarity
Original:  We find that the use of such intermediate losses significantly improves performance by itself, as well as enabling input feature re-use.
Revised:  We find that the use of such iterated loss significantly improves performance by itself, as well as enabling input feature re-use.
Edit intent: clarity
Original:  The current diagnosis involves the measurement of heart rate (HR) and blood pressure (BP) during head-up tilt (HUT) or sit-to-stand test.
Revised:  The current diagnosis involves the measurement of heart rate (HR) and blood pressure (BP) during head-up tilt (HUT) or active standing test.
Edit intent: clarity
Original:  This study examines 0.1 Hz oscillations in heart rate and blood pressure providing new metrics characterizing the efficacy of the baroreflex.
Revised:  This study examines 0.1 Hz oscillations in systolic arterial blood pressure (SBP) and HR signals providing additional metrics characterizing the efficacy of the baroreflex.
Edit intent: clarity
Original:  Postural Orthostatic Tachycardia Syndrome (POTS) is associated with the onset of tachycardia upon postural change.
Revised: Objective: Postural Orthostatic Tachycardia Syndrome (POTS) is associated with the onset of tachycardia upon postural change.
Edit intent: clarity
Original:  This study examines 0.1 Hz oscillations in systolic arterial blood pressure (SBP) and HR signals providing additional metrics characterizing the efficacy of the baroreflex.
Revised:  This study examines 0.1 Hz oscillations in systolic arterial blood pressure (SBP) and HR signals providing additional metrics characterizing the dynamics of the baroreflex.
Edit intent: clarity
Original:   We analyze data from 28 control subjects and 28 POTS patients who underwent HUT.
Revised:  Methods: We analyze data from 28 control subjects and 28 POTS patients who underwent HUT.
Edit intent: fluency
Original:   POTS is associated with an increase in the amplitude of SBP and HR 0.1 Hz oscillation and a shortening of the phase between the two signals.
Revised:  Conclusion: POTS is associated with an increase in the amplitude of SBP and HR 0.1 Hz oscillation and a shortening of the phase between the two signals.
Edit intent: coherence
Original:   The 0.1 Hz phase response and oscillation amplitude metrics provide new markers that can improve POTS diagnostic augmenting the existing diagnosis protocol only analyzing the change in heart rate.
Revised:  Significance: The 0.1 Hz phase response and oscillation amplitude metrics provide new markers that can improve POTS diagnostic augmenting the existing diagnosis protocol only analyzing the change in heart rate.
Edit intent: coherence
Original:  The key idea is to provide meta constraints , support the use of uncertain information in the form of either undefined values or possible combinations of values, and promote the use of knowledge units that can be instantiated by any new predicates, including predicates with additional arguments.
Revised:  The key idea is to provide meta-constraints , support the use of uncertain information in the form of either undefined values or possible combinations of values, and promote the use of knowledge units that can be instantiated by any new predicates, including predicates with additional arguments.
Edit intent: fluency
Original:  The key idea is to provide meta-constraints, support the use of uncertain information in the form of either undefined values or possible combinations of values  , and promote the use of knowledge units that can be instantiated by any new predicates, including predicates with additional arguments.
Revised:  The key idea is to provide meta-constraints, supports the use of uncertain information in the form of either undefined values or possible combinations of values , and promote the use of knowledge units that can be instantiated by any new predicates, including predicates with additional arguments.
Edit intent: fluency
Original:  We introduce a method of simplification for emanation graphs of grade k= 2 , which makes it a competent spanner for many possible use cases such as network visualizationand geometric routing.
Revised:  Emanation graphs of grade k= 2 , which makes it a competent spanner for many possible use cases such as network visualizationand geometric routing.
Edit intent: coherence
Original:  Motivated by previous work on dually chordal graphs and graphs of bounded distance VC-dimension (with the former being a subclass of Helly graphs and the latter being a particular case of graphs of bounded fractional Helly number, respectively) we prove several new results on the complexity of computing the diameter and the radius on Helly graphs and related graph classes.
Revised:  Motivated by previous work on dually chordal graphs and graphs of bounded distance VC-dimension we prove several new results on the complexity of computing the diameter and the radius on Helly graphs and related graph classes.
Edit intent: clarity
Original:  * First, we present an algorithm which given an n-vertex m-edge Helly graph G as input, computes w.h.p. rad(G) in time \tilde{\cal O}(mn).
Revised:  * First, we present algorithms which given an n-vertex m-edge Helly graph G as input, computes w.h.p. rad(G) in time \tilde{\cal O}(mn).
Edit intent: fluency
Original:  * First, we present an algorithm which given an n-vertex m-edge Helly graph G as input, computes w.h.p. rad(G) in time \tilde{\cal O}(mn).
Revised:  * First, we present an algorithm which given an n-vertex m-edge Helly graph G as input, compute w.h.p. rad(G) in time \tilde{\cal O}(mn).
Edit intent: fluency
Original:  Therefore, split graphs are in some sense the only {\em  hard instances for diameter computation on chordal graphs.
Revised:  Therefore, split graphs are in some sense the {\em hard instances for diameter computation on chordal graphs.
Edit intent: clarity
Original:  As a byproduct of our reduction we get that{\cal   on any subclass of chordal graphs with constant VC-dimension the diameter can be computed in truly subquadratic time.
Revised:  As a byproduct of our reduction we get that{\cal O on any subclass of chordal graphs with constant VC-dimension the diameter can be computed in truly subquadratic time.
Edit intent: fluency
Original:  Furthermore, the deviation of multipath beamforming gain from single ray beamforming gain is analyzed and a regression curve is obtained to be used in the system level simulations.
Revised:  Furthermore, the deviation of multipath beamforming gain from single ray beamforming gain is analyzed and a regression curve is obtained to be used in the system-level simulations.
Edit intent: fluency
Original:  We show through simulations that the proposed Simplified channel model leads to comparable mobility results to Jakes model for high path diversity.
Revised:  We show through simulations that the proposed simplified channel model leads to comparable mobility results to Jakes model for high path diversity.
Edit intent: fluency
Original:  We show through simulations that the proposed Simplified channel model leads to comparable mobility results to Jakes model for high path diversity.
Revised:  We show through simulations that the proposed Simplified channel model leads to mobility results comparable to Jakes model for high path diversity.
Edit intent: fluency
Original:  Trace-driven evaluation in software shows that MV-Sketch achieves higher accuracy than existing invertible sketches, with up to 3.38 X throughput gain.
Revised:  Trace-driven evaluation in software shows that MV-Sketch achieves higher accuracy than existing invertible sketches, with up to 3.38 x throughput gain.
Edit intent: fluency
Original: In  dominant livestock systems of Sahelian countries herds have to move across the territories.
Revised: In the dominant livestock systems of Sahelian countries herds have to move across the territories.
Edit intent: fluency
Original: In  dominant livestock systems of Sahelian countries herds have to move across the territories.
Revised: In dominant livestock systems of Sahelian countries herds have to move across territories.
Edit intent: fluency
Original:  Their mobility is often  source of conflict with farmers of the crossed areas , and engender the spread of diseases such as Rift Valley Fever.
Revised:  Their mobility is often a source of conflict with farmers of the crossed areas , and engender the spread of diseases such as Rift Valley Fever.
Edit intent: fluency
Original:  Their mobility is often  source of conflict with farmers of the crossed areas , and engender the spread of diseases such as Rift Valley Fever.
Revised:  Their mobility is often source of conflict with farmers in the areas crossed, and helps spread diseases such as Rift Valley Fever.
Edit intent: clarity
Original:  Knowledge of the routes followed by herds is therefore central to guide the implementation of preventive and control measures for transboundary animal diseases, land use planning and conflict management.
Revised:  Knowledge of the routes followed by herds is therefore core to guiding the implementation of preventive and control measures for transboundary animal diseases, land use planning and conflict management.
Edit intent: clarity
Original:  However, the lack of quantitative data on livestock movements, together with the high temporal and spatial variability of herd movements, has so far hampered the production of fine resolution maps of passage of animals .
Revised:  However, the lack of quantitative data on livestock movements, together with the high temporal and spatial variability of herd movements, has so far hampered the production of fine resolution maps of animal movements .
Edit intent: clarity
Original:  This paper proposes a general framework for mapping potential paths for livestock movements and identify areas of high potential of animal passage for these movements.
Revised:  This paper proposes a general framework for mapping potential paths for livestock movements and identifying areas of high potential of animal passage for these movements.
Edit intent: fluency
Original:  This paper proposes a general framework for mapping potential paths for livestock movements and identify areas of high potential of animal passage for these movements.
Revised:  This paper proposes a general framework for mapping potential paths for livestock movements and identify areas of high animal passage potential for those movements.
Edit intent: clarity
Original:  The method consists in coupling the information contained in livestock mobility network with landscape connectivity  based on different mobility conductance layers.
Revised:  The method consists in combining the information contained in livestock mobility network with landscape connectivity based on different mobility conductance layers.
Edit intent: fluency
Original:  The method consists in coupling the information contained in livestock mobility network with landscape connectivity  based on different mobility conductance layers.
Revised:  The method consists in coupling the information contained in livestock mobility networks with landscape connectivity based on different mobility conductance layers.
Edit intent: fluency
Original:  The method consists in coupling the information contained in livestock mobility network with landscape connectivity  based on different mobility conductance layers.
Revised:  The method consists in coupling the information contained in livestock mobility network with landscape connectivity , based on different mobility conductance layers.
Edit intent: fluency
Original:  We illustrate our approach with a livestock mobility network in Senegal and Mauritania in  dry and wet seasons in 2014.
Revised:  We illustrate our approach with a livestock mobility network in Senegal and Mauritania in dry and wet seasons .
Edit intent: clarity
Original: Job titles are the most fundamental building blocks for occupational data mining tasks, such as Career Modelling and Job Recommendation.
Revised: Occupational data mining and analysis is an important task in understanding today's industry and job market. Various machine learning techniques are proposed and gradually deployed to improve companies' operations for upstream tasks, such as Career Modelling and Job Recommendation.
Edit intent: coherence
Original:  In this work, we present the Industrial and Professional Occupations Dataset (IPOD), which is a comprehensive corpus that consists of over 190,000 job titles crawled from over 56,000 profiles from Linkedin.
Revised:  In this work, we present the Industrial and Professional Occupations Dataset (IPOD), which consists of over 190,000 job titles crawled from over 56,000 profiles from Linkedin.
Edit intent: clarity
Original:  Finally, We develop 4 baseline models for the dataset on NER task with several models, including Linear Regression, CRF, LSTM and the state-of-the-art bi-directional LSTM-CRF  . Both CRF and LSTM-CRF outperform human  in both exact-match accuracy and f1 scores.
Revised:  Finally, We develop 4 baseline models for the dataset on NER task with several models, including Linear Regression, CRF, LSTM and the state-of-the-art bi-directional LSTM-CRF ) . Both CRF and LSTM-CRF outperform human in both exact-match accuracy and f1 scores.
Edit intent: fluency