wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this survey , we give an overview about deep reinforcement learning for search, recommendations, and advertising from methodologies to applications, review representative algorithms, and discuss some appealing research directions.
Revised:  In this survey , we give an overview about deep reinforcement learning for search, recommendation, and online advertising from methodologies to applications, review representative algorithms, and discuss some appealing research directions.
Edit intent: clarity
Original:  In this paper, we study elliptic PDEs in domains with boundaries comprised of both deterministic and random parts , and apply the method of modified potentials with Green's kernels defined on the deterministic part of the domain.
Revised:  In this paper, we study elliptic PDEs in domains with boundaries comprised of a deterministic part and random apertures , and apply the method of modified potentials with Green's kernels defined on the deterministic part of the domain.
Edit intent: clarity
Original:  This approach allows to reduce the dimension of the original differential problem by reformulating it as a boundary integral equation posed on the random part of the boundary only.
Revised:  This approach allows to reduce the dimension of the original differential problem by reformulating it as a boundary integral equation posed on the random apertures only.
Edit intent: clarity
Original:  In our previous paper, we reported that the collective motions were classified into the six phases on a phase diagram with the two parameters,  the reduced cell length \lambda \ and the cell density \rho.
Revised:  In our previous paper, we reported that the collective motions were classified into six phases on a phase diagram with the two parameters, the reduced cell length \lambda \ and the cell density \rho.
Edit intent: fluency
Original:  In our previous paper, we reported that the collective motions were classified into the six phases on a phase diagram with the two parameters,  the reduced cell length \lambda \ and the cell density \rho.
Revised:  In our previous paper, we reported that the collective motions were classified into the six phases on a phase diagram with two parameters, the reduced cell length \lambda \ and the cell density \rho.
Edit intent: fluency
Original:  In our previous paper, we reported that the collective motions were classified into the six phases on a phase diagram with the two parameters,  the reduced cell length \lambda \ and the cell density \rho.
Revised:  In our previous paper, we reported that the collective motions were classified into the six phases on a phase diagram with the two parameters, namely, the reduced cell length \lambda \ and the cell density \rho.
Edit intent: clarity
Original:  In our previous paper, we reported that the collective motions were classified into the six phases on a phase diagram with the two parameters,  the reduced cell length \lambda \ and the cell density \rho.
Revised:  In our previous paper, we reported that the collective motions were classified into the six phases on a phase diagram with the two parameters, the reduced cell length \lambda and the cell density \rho.
Edit intent: fluency
Original:  Based on the detailed observations of single-cell trajectories in a pool, we verified that the effect of cell-noise interactions was widely distributed.
Revised:  On the basis of the detailed observations of single-cell trajectories in a pool, we verified that the effect of cell-noise interactions was widely distributed.
Edit intent: fluency
Original:  We conclude that, even in such random environment,  sharp transitions of collective motions were caused by the cell-cell interactions at \lambda=\rm C1.
Revised:  We conclude that, even in such random environment, the sharp transitions of collective motions were caused by the cell-cell interactions at \lambda=\rm C1.
Edit intent: fluency
Original:  In this paper, we propose to perform speaker diarization within dialogue scenes of TV series by combining the audio and video modalities: speaker diarization is first performed by using each modality ;
Revised:  In this paper, we propose to perform speaker diarization within dialogue scenes of TV series by combining the audio and video modalities: speaker diarization is first performed by using each modality ,
Edit intent: fluency
Original: High-utility Itemset Mining (HUIM) finds itemsets from a transaction database with utility no less than a user-defined threshold where the utility of an itemset is defined as the sum of the utilities of its items .
Revised: High-utility Itemset Mining (HUIM) finds itemsets from a transaction database with utility no less than a user-defined threshold where the utility of an itemset is defined as the sum of the item-wise utilities .
Edit intent: clarity
Original:  In this paper, we introduce the notion of generalized utility functions that need not be the sum of individual utilities.
Revised:  In this paper, we generalize this notion to utility functions that need not be the sum of individual utilities.
Edit intent: clarity
Original:  In this paper, we introduce the notion of generalized utility functions that need not be the sum of individual utilities.
Revised:  In this paper, we introduce the notion of generalized utility functions that need not be a simple sum of individual utilities.
Edit intent: clarity
Original:  Moving on to HUIM algorithms , the existing algorithms  use upper-bounds like ` Transaction Weighted Utility ' and ` Exact-Utility, Remaining Utility' for efficient search-space exploration.
Revised:  Moving on to HUIM algorithms , the existing algorithms use upper-bounds like " Transaction Weighted Utility ' and ` Exact-Utility, Remaining Utility' for efficient search-space exploration.
Edit intent: fluency
Original:  Moving on to HUIM algorithms , the existing algorithms  use upper-bounds like ` Transaction Weighted Utility ' and ` Exact-Utility, Remaining Utility' for efficient search-space exploration.
Revised:  Moving on to HUIM algorithms , the existing algorithms use upper-bounds like ` Transaction Weighted Utility " and " Exact-Utility, Remaining Utility' for efficient search-space exploration.
Edit intent: fluency
Original:  Moving on to HUIM algorithms , the existing algorithms  use upper-bounds like ` Transaction Weighted Utility ' and ` Exact-Utility, Remaining Utility' for efficient search-space exploration.
Revised:  Moving on to HUIM algorithms , the existing algorithms use upper-bounds like ` Transaction Weighted Utility ' and ` Exact-Utility, Remaining-Utility" for efficient search-space exploration.
Edit intent: fluency
Original:  We derive analogous and tighter upper-bounds for SM utility functions and explain how existing HUIM algorithms of different classes can be adapted using our upper bound .
Revised:  We derive analogous and tighter upper-bounds for SM utility functions and explain how existing HUIM algorithms of different classes can be adapted using these bounds .
Edit intent: clarity
Original:  We experimentally compared adaptations of some of the latest  algorithms and point out some caveats that should be kept in mind while handling general utility functions .
Revised:  We experimentally compare adaptations of some of the latest algorithms and point out some caveats that should be kept in mind while handling general utility functions .
Edit intent: fluency
Original: Speaker diarization, usually denoted as the ' who spoke when ' task, turns out to be particularly challenging when applied to fictional films, where many characters talk in various acoustic conditions (background music, sound effects...).
Revised: Speaker diarization, usually denoted as the '' who spoke when ' task, turns out to be particularly challenging when applied to fictional films, where many characters talk in various acoustic conditions (background music, sound effects...).
Edit intent: fluency
Original: Speaker diarization, usually denoted as the ' who spoke when ' task, turns out to be particularly challenging when applied to fictional films, where many characters talk in various acoustic conditions (background music, sound effects...).
Revised: Speaker diarization, usually denoted as the ' who spoke when '' task, turns out to be particularly challenging when applied to fictional films, where many characters talk in various acoustic conditions (background music, sound effects...).
Edit intent: fluency
Original:  We identify three steps that are carried out separately in time, and possibly on different devices : (i) the production of high-fidelity solutions by a commercial software, (ii) the offline stage of the model reduction and (iii) the online stage where the reduced order model is exploited.
Revised:  Three steps are carried out separately in time, and possibly on different devices : (i) the production of high-fidelity solutions by a commercial software, (ii) the offline stage of the model reduction and (iii) the online stage where the reduced order model is exploited.
Edit intent: clarity
Original:  We identify three steps that are carried out separately in time, and possibly on different devices : (i) the production of high-fidelity solutions by a commercial software, (ii) the offline stage of the model reduction and (iii) the online stage where the reduced order model is exploited.
Revised:  We identify three steps that are carried out : (i) the production of high-fidelity solutions by a commercial software, (ii) the offline stage of the model reduction and (iii) the online stage where the reduced order model is exploited.
Edit intent: clarity
Original:  We identify three steps that are carried out separately in time, and possibly on different devices : (i) the production of high-fidelity solutions by a commercial software, (ii) the offline stage of the model reduction and (iii) the online stage where the reduced order model is exploited.
Revised:  We identify three steps that are carried out separately in time, and possibly on different devices : (i) the production of high-fidelity solutions by commercial software, (ii) the offline stage of the model reduction and (iii) the online stage where the reduced order model is exploited.
Edit intent: fluency
Original:  The nonintrusivity assumes that only the displacement field solution is known, and relies on operations on simulation data during the offline phaseby using an in-house code  .
Revised:  The nonintrusivity assumes that only the displacement field solution is known, and the proposed framework carries-out operations on these simulation data during the offline phaseby using an in-house code .
Edit intent: clarity
Original:  The nonintrusivity assumes that only the displacement field solution is known, and relies on operations on simulation data during the offline phaseby using an in-house code  .
Revised:  The nonintrusivity assumes that only the displacement field solution is known, and relies on operations on simulation data during the offline .
Edit intent: clarity
Original:  The nonintrusivity assumes that only the displacement field solution is known, and relies on operations on simulation data during the offline phaseby using an in-house code  .
Revised:  The nonintrusivity assumes that only the displacement field solution is known, and relies on operations on simulation data during the offline phaseby using an in-house code phase .
Edit intent: clarity
Original:  The compatibility with a new commercial code only needs the implementation of a routine converting the mesh and result format into our in-house data format.
Revised:  The compatibility with a new commercial code only needs the implementation of a routine converting the discretized solution into our in-house data format.
Edit intent: clarity
Original:  The nonintrusive capabilities of the framework are demonstrated on numerical experiments using commercial versions of the finite element softwares Zset and Ansys Mechanical.
Revised:  The nonintrusive capabilities of the framework are demonstrated on numerical experiments using commercial versions of Z-set and Ansys Mechanical.
Edit intent: clarity
Original:  The nonlinear constitutive equations are evaluated by using the same external plugins as for Zset or Ansys Mechanical .
Revised:  The nonlinear constitutive equations are evaluated by using an external plugin .
Edit intent: clarity
Original:  The features and performances of the framework are evaluated on two numerical applications involving elastoviscoplastic materials: the second one involves a model of high-pressure blade, where the framework is used to extrapolate cyclic loadings in 6.5 hours, whereas the reference high-fidelity computation would take 9.5 days 
Revised:  The features and performances of the framework are evaluated on two numerical applications involving elastoviscoplastic materials: the second one involves a model of high-pressure blade, where the framework is used to extrapolate cyclic loadings in 6.5 hours, whereas the reference high-fidelity computation would take 9.5 days .
Edit intent: fluency
Original:  Three steps are carried out  : (i) the production of high-fidelity solutions by  commercial software, (ii) the offline stage of the model reduction and (iii) the online stage where the reduced order model is exploited.
Revised:  Three steps are carried out : (i) the production of high-fidelity solutions by a commercial software, (ii) the offline stage of the model reduction and (iii) the online stage where the reduced order model is exploited.
Edit intent: fluency
Original:  The nonintrusivity assumes that only the displacement field solution is known, and the proposed framework carries-out operations on these simulation data during the offline phase .
Revised:  The nonintrusivity assumes that only the displacement field solution is known, and relies on operations on simulation data during the offline phase .
Edit intent: clarity
Original:  The nonintrusivity assumes that only the displacement field solution is known, and the proposed framework carries-out operations on these simulation data during the offline phase .
Revised:  The nonintrusivity assumes that only the displacement field solution is known, and the proposed framework carries-out operations on these simulation data during the phase .
Edit intent: clarity
Original: The comparison of the behaviours of software systems is an important concern in software engineering research.
Revised: The behavioural comparison of systems is an important concern in software engineering research.
Edit intent: fluency
Original: The comparison of the behaviours of software systems is an important concern in software engineering research.
Revised: The comparison of the behaviours of software systems is an important concern of software engineering research.
Edit intent: clarity
Original:  For example, in the areas of specification discovery and specification mining , it is important to measure the consistency between a collection of execution traces and the program specificationthat was automatically constructed from these traces .
Revised:  For example, the areas of specification discovery and specification mining , it is important to measure the consistency between a collection of execution traces and the program specificationthat was automatically constructed from these traces .
Edit intent: fluency
Original:  For example, in the areas of specification discovery and specification mining , it is important to measure the consistency between a collection of execution traces and the program specificationthat was automatically constructed from these traces .
Revised:  For example, in the areas of specification discovery and specification mining are concerned with measuring the consistency between a collection of execution traces and the program specificationthat was automatically constructed from these traces .
Edit intent: clarity
Original:  For example, in the areas of specification discovery and specification mining , it is important to measure the consistency between a collection of execution traces and the program specificationthat was automatically constructed from these traces .
Revised:  For example, in the areas of specification discovery and specification mining , it is important to measure the consistency between a collection of execution traces and a program specification .
Edit intent: clarity
Original:  This problem is also tackled in process mining , where for almost two decades researchers propose measures to assess the quality of process specifications automatically discovered from execution logs of information systems .
Revised:  This problem is also tackled in process mining with the help of measures that describe the quality of process specifications automatically discovered from execution logs of information systems .
Edit intent: clarity
Original:  This problem is also tackled in process mining , where for almost two decades researchers propose measures to assess the quality of process specifications automatically discovered from execution logs of information systems .
Revised:  This problem is also tackled in process mining , where for almost two decades researchers propose measures to assess the quality of a process specification automatically discovered from execution logs of information systems .
Edit intent: style
Original:  This problem is also tackled in process mining , where for almost two decades researchers propose measures to assess the quality of process specifications automatically discovered from execution logs of information systems .
Revised:  This problem is also tackled in process mining , where for almost two decades researchers propose measures to assess the quality of process specifications automatically discovered from execution logs .
Edit intent: clarity
Original:  Though various measures have been proposed, it was recently observed that none of them fulfils essential properties, such as monotonicity .
Revised:  Though various measures have been proposed, it was recently demonstrated that they neither fulfil essential properties, such as monotonicity .
Edit intent: clarity
Original:  We demonstrate the application of the quotients to capture precision and recall  between a collection of recorded executions of a system and a system specification , i. e., between the recorded and specified behaviours of a system.
Revised:  We demonstrate the application of the quotients for capturing precision and recall between a collection of recorded executions of a system and a system specification , i. e., between the recorded and specified behaviours of a system.
Edit intent: fluency
Original:  We demonstrate the application of the quotients to capture precision and recall  between a collection of recorded executions of a system and a system specification , i. e., between the recorded and specified behaviours of a system.
Revised:  We demonstrate the application of the quotients to capture precision and recall measures between a collection of recorded executions of a system and a system specification , i. e., between the recorded and specified behaviours of a system.
Edit intent: clarity
Original:  We demonstrate the application of the quotients to capture precision and recall  between a collection of recorded executions of a system and a system specification , i. e., between the recorded and specified behaviours of a system.
Revised:  We demonstrate the application of the quotients to capture precision and recall between a collection of recorded executions and a system specification , i. e., between the recorded and specified behaviours of a system.
Edit intent: fluency
Original: Electrocardiogram (ECG) signal is a common and powerful tool to study heart function and diagnose several abnormal arrhythmia .
Revised: Electrocardiogram (ECG) signal is a common and powerful tool to study heart function and diagnose several abnormal arrhythmias .
Edit intent: fluency
Original:  While there have been remarkable improvements in cardiac arrhythmia classification methods, they still cannot offer an acceptable performance in detecting different heart conditions, especially when dealing with imbalanced datasets.
Revised:  While there have been remarkable improvements in cardiac arrhythmia classification methods, they still cannot offer acceptable performance in detecting different heart conditions, especially when dealing with imbalanced datasets.
Edit intent: fluency
Original:  In addition, this combination significantly improves the performance of the atrial fibrillation detection (achieved a sensitivity of 99.53\%, specificity of 99.26\% and accuracy of 99.40\% on the MIT-BIH atrial fibrillation database with 5-s ECG segments.) .
Revised:  In addition, this combination significantly improves the performance of the atrial fibrillation detection (achieved a sensitivity of 99.53\%, specificity of 99.26\% and accuracy of 99.40\% on the MIT-BIH atrial fibrillation database with 5-s ECG segments.) 
Edit intent: fluency
Original:  We present a  method to compute an effective  heuristic for the fastest path travel time between two points on a road map, which can be used to significantly accelerate the classical A* algorithm when computing fastest paths.
Revised:  We present a novel method to compute an effective heuristic for the fastest path travel time between two points on a road map, which can be used to significantly accelerate the classical A* algorithm when computing fastest paths.
Edit intent: clarity
Original:  We present a  method to compute an effective  heuristic for the fastest path travel time between two points on a road map, which can be used to significantly accelerate the classical A* algorithm when computing fastest paths.
Revised:  We present a method to compute an effective heuristic for the fastest-path travel time between two points on a road map, which can be used to significantly accelerate the classical A* algorithm when computing fastest paths.
Edit intent: fluency
Original:  Our method is based on two hierarchical sets of separators of the map represented by two binary trees . A preprocessing step computes a short vector of values per road junction based on the separator trees , which is then stored with the map and used to efficiently compute the heuristic at the online query stage.
Revised:  Our method is based on two hierarchical sets of separators of the map represented by two binary trees . A preprocessing step computes a short vector of values per road junction based on the separator tree , which is then stored with the map and used to efficiently compute the heuristic at the online query stage.
Edit intent: fluency
Original:  We demonstrate experimentally that this method scales well to any map size, providing a better quality heuristic, thus more efficient A* search, for fastest path queries between points at all distances - especially small and medium range - relative to other known heuristics .
Revised:  We demonstrate experimentally that this method scales well to any map size, providing a high-quality heuristic, thus more efficient A* search, for fastest path queries between points at all distances - especially small and medium range - relative to other known heuristics .
Edit intent: clarity
Original:  We demonstrate experimentally that this method scales well to any map size, providing a better quality heuristic, thus more efficient A* search, for fastest path queries between points at all distances - especially small and medium range - relative to other known heuristics .
Revised:  We demonstrate experimentally that this method scales well to any map size, providing a better quality heuristic, thus very efficient A* search, for fastest path queries between points at all distances - especially small and medium range - relative to other known heuristics .
Edit intent: clarity