wanyu/IteraTeR_v2 huggingface dataset:
Original:  A number of trading strategies is considered, e. g. minimization of the trading costs, risk neutral or risk averse agents.
Revised:  A number of trading strategies is used.
Edit intent: clarity
Original:  Especially we show when the optimal trading path coincides with the solution that minimizes transaction costs.
Edit intent: coherence
Original: Clinicians conduct routine diagnosis by scrutinizing  signs and symptoms of patients in treating epidemics .
Revised: Clinicians make routine diagnosis by scrutinizing signs and symptoms of patients in treating epidemics .
Edit intent: clarity
Original:  The success of the therapeutic regimen relies largely on the accuracy of interpretation of such sign-symptoms, based on which the clinician ranks the potent causes of the epidemic and analyzes their interdependence to devise sustainable containment strategies.
Revised:  The success of the therapeutic regime relies largely on the accuracy of interpretation of such sign-symptoms, based on which the clinician ranks the potent causes of the epidemic and analyzes their interdependence to devise sustainable containment strategies.
Edit intent: clarity
Original:  VIRDOC analyzes medical data and then translates these into a vector comprising Multiple Linear Regression (MLR) coefficients to probabilistically predict scores that compare with clinical experience-based assessment.
Revised:  VIRDOC analyzes medical data and translates these into a vector comprising Multiple Linear Regression (MLR) coefficients to probabilistically predict scores that compare with clinical experience-based assessment.
Edit intent: coherence
Original:  The VIRDOC algorithm, risk managed through ANOVA, has been tested on dengue epidemic data (N=100 with 11 weighted sign-symptoms).
Revised:  Risk managed through ANOVA, has been tested on dengue epidemic data (N=100 with 11 weighted sign-symptoms).
Edit intent: clarity
Original:  Results highly encouraging with ca 75\% accurate fatality prediction, compared to 71.4\% from traditional diagnosis .
Revised:  Results highly encouraging with ca 75\% ) than conventional clinical practice (ca 71.4\% from traditional diagnosis .
Edit intent: clarity
Original: Training Automatic Speech Recognition (ASR) models under federated learning (FL) settings has recently attracted considerable attention .
Revised: Training Automatic Speech Recognition (ASR) models under federated learning (FL) settings has attracted a lot of attention recently .
Edit intent: clarity
Original:  Existing resource management approaches essentially optimize makespan minimization on the fixed number of jobs .
Revised:  Existing resource management approaches have been targeting makespan minimization with fixed number of jobs .
Edit intent: clarity
Original:  Although previous researches purport to express breakthrough performances, we alternatively corroborate the job scheduling problem in a more practical scenario where the scheduler (1) aims to minimize average latency in a steady-state condition and (2) assigns varying numbers of tasks to heterogeneous resources . Broadly, these conditions are essential in the System-on-Chip (SoC)application, which developed with high-frequency job generation and operated distributedresources in a parallel .
Revised:  Although previous researches purport to express breakthrough performances, we alternatively corroborate the job scheduling problem in a more practical scenario where the scheduler (1) aims to minimize average latency in a steady-state condition while assigning tasks in the ready queue to heterogeneous resources . Broadly, these conditions are essential in the System-on-Chip (SoC)application, which developed with high-frequency job generation and operated distributedresources in a parallel .
Edit intent: clarity
Original:  We first show that existing DRL-based schedulers developed with the makespan minimization objective are ineffective for the latency-minimization-driven SoC applications due to their characteristics such as high-frequency job workload and distributed/parallel job execution.
Revised:  We first show that the latency-minimization-driven SoC applications due to their characteristics such as high-frequency job workload and distributed/parallel job execution.
Edit intent: coherence
Original:  We first show that existing DRL-based schedulers developed with the makespan minimization objective are ineffective for the latency-minimization-driven SoC applications due to their characteristics such as high-frequency job workload and distributed/parallel job execution.
Revised:  We first show that existing DRL-based schedulers developed with the makespan minimization objective are ineffective for the latency-minimization-driven SoC applications operate high-frequency job workload and distributed/parallel job execution.
Edit intent: clarity
Original:  We then demonstrate that through its EIM technique, SoCRATES successfully addresses the challenge of concurrent observations caused by the task dependency inherent in the latency minimization objective.
Revised:  We then demonstrate SoCRATES successfully addresses the challenge of concurrent observations caused by the task dependency inherent in the latency minimization objective.
Edit intent: clarity
Original:  Extensive tests show that SoCRATES outperforms other existing neural and non-neural schedulers with as high as 38\% gain in latency reduction under a variety of job types , queue length, and incoming rates.
Revised:  Extensive tests show that SoCRATES outperforms other existing neural and non-neural schedulers with as high as 38\% gain in latency reduction under a variety of job types and incoming rates.
Edit intent: clarity
Original:   We use the supra-adjacency matrix as the network representation, which has already been used to generalize eigenvector centrality to temporal and multiplex networks.
Revised:  We use the supra-adjacency matrix as network representation, which has already been used to generalize eigenvector centrality to temporal and multiplex networks.
Edit intent: fluency
Original:  With this representation , the definition of single-layer matrix function-based centrality measures in terms of walks on the networks carries over naturally to the multilayer case.
Revised:  With this representation , the definition of single-layer matrix function-based centrality measures in terms of walks on networks carries over naturally to the multilayer case.
Edit intent: fluency
Original:  The first few values of T_D are T_1 \approx 1.817, T_2 \approx 2.660, T_3 \approx 3.529, T_4 \approx 4.421, T_5 \approx 5.332 (the D =1 case corresponds to the hypercube and replicates the result of Ambainis et al. ) . We then show an implementation of this algorithm with time complexity poly(n)^{\log n} T_D^n, and apply it to the Set Multicover problem.
Revised:  The first few values of T_D are T_1 \approx 1.817, T_2 \approx 2.660, T_3 \approx 3.529, T_4 \approx 4.421, T_5 \approx 5.332 (the D =1 by Ambainis et al. ) . We then show an implementation of this algorithm with time complexity poly(n)^{\log n} T_D^n, and apply it to the Set Multicover problem.
Edit intent: coherence
Original: In this note, we present deterministic algorithms for the Hidden Subgroup Problem.
Revised: We present deterministic algorithms for the Hidden Subgroup Problem.
Edit intent: clarity
Original:  The algorithm for abelian groups  achieves the same asymptotic  query complexity as the optimal randomized algorithm .
Revised:  The first algorithm, for abelian groups achieves the same asymptotic query complexity as the optimal randomized algorithm .
Edit intent: coherence
Original:  The algorithm for abelian groups  achieves the same asymptotic  query complexity as the optimal randomized algorithm .
Revised:  The algorithm for abelian groups , achieves the same asymptotic query complexity as the optimal randomized algorithm .
Edit intent: fluency
Original:  The results show that our proposed redundant Gabor transform outperforms -- in all cases -- Gabor transforms generated by state-of-the-art window vectors of time-frequency analysis .
Revised:  The results show that our proposed redundant Gabor transform outperforms all others, consistently for all signals .
Edit intent: clarity
Original: We propose to assess the fairness of personalized recommender systems in the sense of envy-freeness : every (group of) user (s) should prefer their recommendations to the recommendations of other (groups of) users.
Revised: Recommender systems are facing scrutiny because of their growing impact on the opportunities we have access to. Current audits for fairness are limited to coarse-grained parity assessments at the level of sensitive groups. We propose to audit for envy-freeness : every (group of) user (s) should prefer their recommendations to the recommendations of other (groups of) users.
Edit intent: clarity
Original:  We study, both theoretically and empirically, the trade-offs achieved by this algorithm .
Revised:  We study, both theoretically and empirically, the trade-offs achieved on real-world recommendation datasets .
Edit intent: clarity
Original:  While optogenetic control of polymerization can initiate cell migration by generating protrusion, it is less clear if and how optogenetic control of contraction can also effect cell migration.
Revised:  While optogenetic control of polymerization can initiate cell migration by generating protrusion, it is less clear if and how optogenetic control of contraction can also affect cell migration.
Edit intent: clarity
Original:  The efficacy of the proposed scheme is verified by extensive real-time experiment 1 . The results show that our proposed scheme can provide an average accuracy of 2 cm and the average computational time in low-cost embedded platforms is around 50 ms.
Revised:  The efficacy of the proposed scheme is verified by extensive real-time experiment . The results show that our proposed scheme can provide an average accuracy of 2 cm and the average computational time in low-cost embedded platforms is around 50 ms.
Edit intent: coherence
Original:  Due to the limited accuracy in the matching process of 3D keypoints, the presence of outliers, probably in very large numbers, is common in many real-world applications  .
Revised:  Due to the limited accuracy in the matching process of 3D keypoints, the presence of outliers, probably in very large numbers, among the putative vector or point correspondences in real-world applications .
Edit intent: clarity
Original:  In this paper, we present ICOS (Inlier searching using COmpatible Structures), a novel, efficient and highly robust solution for the correspondence-based  point cloud registration problem .
Revised:  In this paper, we present ICOS (Inlier searching using COmpatible Structures), a novel, efficient and highly robust solution for the correspondence-based point cloud registration problems .
Edit intent: fluency
Original:  In this manner, even with extreme outlier ratios, inliers can be detected and collected for solving the optimal transformation , leading to our robust registration solver ICOS.
Revised:  In this manner, even with extreme outlier ratios, inliers can be sifted out and collected for solving the optimal transformation , leading to our robust registration solver ICOS.
Edit intent: clarity
Original:  In this manner, even with extreme outlier ratios, inliers can be detected and collected for solving the optimal transformation , leading to our robust registration solver ICOS.
Revised:  In this manner, even with extreme outlier ratios, inliers can be detected and collected for solving the optimal transformation , leading to our robust solver ICOS.
Edit intent: clarity
Original: Building ASR models across many language families is a challenging multi-task learning problem due to large language variations and heavily unbalanced data.
Revised: Building ASR models across many languages is a challenging multi-task learning problem due to large language variations and heavily unbalanced data.
Edit intent: clarity
Original: Building ASR models across many language families is a challenging multi-task learning problem due to large language variations and heavily unbalanced data.
Revised: Building ASR models across many language families is a challenging multi-task learning problem due to large variations and heavily unbalanced data.
Edit intent: fluency
Original:  Empirically, we find that (1) scaling the number of model parameters is an effective way to solve the capacity bottleneck - our 500M-param model is already better than monolingual baselines and scaling it to 1B and 10B brought further quality gains;
Revised:  Empirically, we find that (1) scaling the number of model parameters is an effective way to solve the capacity bottleneck - our 500M-param model already outperforms monolingual baselines and scaling it to 1B and 10B brought further quality gains;
Edit intent: clarity
Original:  (3) given a fixed capacity budget, adding depth usually works better than width and large encoders tend to do better than large decoders  .
Revised:  (3) given a fixed capacity budget, adding depth works better than width and large encoders tend to do better than large decoders .
Edit intent: clarity
Original:  (3) given a fixed capacity budget, adding depth usually works better than width and large encoders tend to do better than large decoders  .
Revised:  (3) given a fixed capacity budget, adding depth usually works better than width and large encoders do better than large decoders .
Edit intent: clarity
Original:  It allows for uncertainty in the response of market participants by considering a set of the possible responses to either price or other signals and a measure to sample from these .
Revised:  Finally, it allows for uncertainty in the response of market participants by considering a set of the possible responses to either price or other signals and a measure to sample from these .
Edit intent: coherence
Original:  Recently, with advances in Geographic Data Science and the growing availability of digital mapping products, researchers in this field have developed an interest in quantitative urban morphology, or urban morphometrics, with the potential to overcome such limitations.
Revised:  Recently, advances in Geographic Data Science and the growing availability of digital mapping products, researchers in this field have developed an interest in quantitative urban morphology, or urban morphometrics, with the potential to overcome such limitations.
Edit intent: fluency
Original:  Recently, with advances in Geographic Data Science and the growing availability of digital mapping products, researchers in this field have developed an interest in quantitative urban morphology, or urban morphometrics, with the potential to overcome such limitations.
Revised:  Recently, with advances in Geographic Data Science and the availability of digital mapping products, researchers in this field have developed an interest in quantitative urban morphology, or urban morphometrics, with the potential to overcome such limitations.
Edit intent: clarity
Original:  Recently, with advances in Geographic Data Science and the growing availability of digital mapping products, researchers in this field have developed an interest in quantitative urban morphology, or urban morphometrics, with the potential to overcome such limitations.
Revised:  Recently, with advances in Geographic Data Science and the growing availability of digital mapping products, open the opportunity to overcome such limitations.
Edit intent: clarity
Original:  Hence, we derive homogeneous urban tissue types (or taxa) and, by determining overall morphological similarity between them, generate a hierarchical classification (phenetic taxonomy) of urban form.
Revised:  Hence, we derive homogeneous urban tissue types and, by determining overall morphological similarity between them, generate a hierarchical classification (phenetic taxonomy) of urban form.
Edit intent: clarity
Original:  Hence, we derive homogeneous urban tissue types (or taxa) and, by determining overall morphological similarity between them, generate a hierarchical classification (phenetic taxonomy) of urban form.
Revised:  Hence, we derive homogeneous urban tissue types (or taxa) and, by determining overall morphological similarity between them, generate a hierarchical classification of urban form.
Edit intent: clarity
Original:  To address the latter issue, this paper extends the state of the art , i.e. deterministic and single time period AC security-constrained optimal power flow (SCOPF) , to capture two new dimensions : RES stochasticity and multiple time periods modelling inter-temporal constraints of emerging sources of flexibility such as flexible loads (FL) and energy storage systems (ESS).
Revised:  To address the latter issue, this paper extends the state of the art , i.e. deterministic and single time period AC SCOPF , to capture two new dimensions : RES stochasticity and multiple time periods modelling inter-temporal constraints of emerging sources of flexibility such as flexible loads (FL) and energy storage systems (ESS).
Edit intent: clarity
Original:  To address the latter issue, this paper extends the state of the art , i.e. deterministic and single time period AC security-constrained optimal power flow (SCOPF) , to capture two new dimensions : RES stochasticity and multiple time periods modelling inter-temporal constraints of emerging sources of flexibility such as flexible loads (FL) and energy storage systems (ESS).
Revised:  To address the latter issue, this paper extends the state of the art , i.e. deterministic and single time period AC security-constrained optimal power flow (SCOPF) , to capture two new dimensions , RES stochasticity and multiple time periods modelling inter-temporal constraints of emerging sources of flexibility such as flexible loads (FL) and energy storage systems (ESS).
Edit intent: fluency
Original:  To address the latter issue, this paper extends the state of the art , i.e. deterministic and single time period AC security-constrained optimal power flow (SCOPF) , to capture two new dimensions : RES stochasticity and multiple time periods modelling inter-temporal constraints of emerging sources of flexibility such as flexible loads (FL) and energy storage systems (ESS).
Revised:  To address the latter issue, this paper extends the state of the art , i.e. deterministic and single time period AC security-constrained optimal power flow (SCOPF) , to capture two new dimensions : RES stochasticity and multiple time periods , as well as emerging sources of flexibility such as flexible loads (FL) and energy storage systems (ESS).
Edit intent: clarity
Original:  Another salient feature of this paper is the comprehensive and accurate modelling of AC power flow model for both pre-contingency and post-contingency states, inter-temporal constraints for resources such as FL and ESS in a 24-hours time horizon , and RES uncertainties.
Revised:  Another salient feature of this paper is the comprehensive and accurate modelling , using: AC power flow model for both pre-contingency and post-contingency states, inter-temporal constraints for resources such as FL and ESS in a 24-hours time horizon , and RES uncertainties.
Edit intent: clarity
Original:  Another salient feature of this paper is the comprehensive and accurate modelling of AC power flow model for both pre-contingency and post-contingency states, inter-temporal constraints for resources such as FL and ESS in a 24-hours time horizon , and RES uncertainties.
Revised:  Another salient feature of this paper is the comprehensive and accurate modelling of AC power flow model for both pre-contingency and post-contingency states, inter-temporal constraints for resources such as FL and ESS in a 24-hours time horizon and RES uncertainties.
Edit intent: fluency
Original:  Our approach leverages meta-learning to adapt the system's model at runtime to make accurate predictions about the system's future state.
Revised:  Our approach leverages meta-learning to train a model that is easily adaptable at runtime to make accurate predictions about the system's future state.
Edit intent: clarity
Original:  Finally the desired trajectory is adapted based on future predictions by borrowing robust control logic to make the system track the original and desired path without needing to access the system's controller.
Revised:  Finally the desired trajectory is adapted based on future predictions by borrowing feedback control logic to make the system track the original and desired path without needing to access the system's controller.
Edit intent: clarity
Original:  In this work, we propose a compartmental model to describe the dynamics of transmission of infection and use it to obtain the optimal vaccination control for the Republic of Ireland .
Revised:  In this work, we propose a compartmental model to describe the dynamics of transmission of infection and use it to obtain the optimal vaccination control .
Edit intent: clarity
Original: A resilient multi-vehicle system cooperatively performs tasks by exchanging information, detecting and removing cyber-attacks that have the intent of hijacking or diminishing performance of the entire system.
Revised: A resilient multi-vehicle system cooperatively performs tasks by exchanging information, detecting , and removing cyber attacks that have the intent of hijacking or diminishing performance of the entire system.
Edit intent: fluency
Original:  To discover inconsistent behavior of any vehicle in the network, we consider an approach that monitors the changes in residual sign between the expected and the predicted states of neighbor vehicles, raising an alarm any time the signed behavior does not match with an expectation.
Revised:  To discover inconsistent behavior of any vehicle in the network, we consider an approach that monitors for changes in sign behavior of an inter-vehicle residual that does not match with an expectation.
Edit intent: clarity
Original:  Similarly, to disguise important information and trigger vehicles to switch to different behaviors, we leverage side-channel information on the state of the vehicles and characterize a different spring-damper signature model detectable by neighbor vehicles for consistency checking .
Revised:  Similarly, to disguise important information and trigger vehicles to switch to different behaviors, we leverage side-channel information on the state of the vehicles and characterize a hidden spring-damper signature model detectable by neighbor vehicles for consistency checking .
Edit intent: clarity
Original:  Similarly, to disguise important information and trigger vehicles to switch to different behaviors, we leverage side-channel information on the state of the vehicles and characterize a different spring-damper signature model detectable by neighbor vehicles for consistency checking .
Revised:  Similarly, to disguise important information and trigger vehicles to switch to different behaviors, we leverage side-channel information on the state of the vehicles and characterize a different spring-damper signature model detectable by neighbor vehicles .
Edit intent: coherence
Original:  Our framework is demonstrated in simulation and through experiments on formations of unmanned ground vehicles (UGVs) in the presence of malicious man-in-the-middle (MITM) communication attacks.
Revised:  Our framework is demonstrated in simulation and experiments on formations of unmanned ground vehicles (UGVs) in the presence of malicious man-in-the-middle (MITM) communication attacks.
Edit intent: clarity
Original:  Our framework is demonstrated in simulation and through experiments on formations of unmanned ground vehicles (UGVs) in the presence of malicious man-in-the-middle (MITM) communication attacks.
Revised:  Our framework is demonstrated in simulation and through experiments on formations of unmanned ground vehicles (UGVs) in the presence of malicious man-in-the-middle communication attacks.
Edit intent: clarity