wanyu/IteraTeR_v2 huggingface dataset:
Original:  (2) centers students in culturally responsive-sustaining pedagogies to resist dominant computing culture and value Indigenous ways of living in nature ;
Revised:  (2) identity: draws on culturally responsive-sustaining pedagogies to resist dominant computing culture and value Indigenous ways of living in nature ;
Edit intent: clarity
Original:  Through a case study of this Critical Comparative Data Structures and Algorithms pedagogy, we argue that justice-centered approaches to higher CS education can help  students not only critique the ethical implications of nominally technical concepts, but also develop greater respect for diverse epistemologies, cultures, and narratives around computing that can help all of us realize the socially-just worlds we need.
Revised:  Through a case study of this Critical Comparative Data Structures and Algorithms pedagogy, we argue that justice-centered approaches to higher CS education can help all computing students not only critique the ethical implications of nominally technical concepts, but also develop greater respect for diverse epistemologies, cultures, and narratives around computing that can help all of us realize the socially-just worlds we need.
Edit intent: clarity
Original:  Through a case study of this Critical Comparative Data Structures and Algorithms pedagogy, we argue that justice-centered approaches to higher CS education can help  students not only critique the ethical implications of nominally technical concepts, but also develop greater respect for diverse epistemologies, cultures, and narratives around computing that can help all of us realize the socially-just worlds we need.
Revised:  Through a case study of this Critical Comparative Data Structures and Algorithms pedagogy, we argue that justice-centered approaches to higher CS education can help students not only learn about the ethical implications of nominally technical concepts, but also develop greater respect for diverse epistemologies, cultures, and narratives around computing that can help all of us realize the socially-just worlds we need.
Edit intent: clarity
Original:  Through a case study of this Critical Comparative Data Structures and Algorithms pedagogy, we argue that justice-centered approaches to higher CS education can help  students not only critique the ethical implications of nominally technical concepts, but also develop greater respect for diverse epistemologies, cultures, and narratives around computing that can help all of us realize the socially-just worlds we need.
Revised:  Through a case study of this Critical Comparative Data Structures and Algorithms pedagogy, we argue that justice-centered approaches to higher CS education can help students not only critique the ethical implications of nominally technical concepts, but also develop greater respect for diverse epistemologies, cultures, and experiences surrounding computing that are necessary to create the socially-just worlds we need.
Edit intent: clarity
Original:  On the contrary, for 2-SAT, such a phenomena is absent at SAT-UNSAT phase transition and the success probability is unity for a reasonable circuit depth  .
Revised:  On the contrary, for 2-SAT, such a phenomenon is absent at SAT-UNSAT phase transition and the success probability is unity for a reasonable circuit depth .
Edit intent: fluency
Original:  As QAOA seems only capable of solving optimization problems, there is a folklore that QAOA cannot see the difference between easy problems such as 2-SAT and hard problems such as 3-SAT -- although 2-SAT is in the polynomial-time (P) class, its optimization version is also nondeterministic polynomial-time (NP)-hard.
Revised:  To search for such a quantum advantage in solving any problem, it is crucial to first understand the difference between easy problems such as 2-SAT and hard problems such as 3-SAT -- although 2-SAT is in the polynomial-time (P) class, its optimization version is also nondeterministic polynomial-time (NP)-hard.
Edit intent: clarity
Original:  We find a computational phase transition in QAOA when solving a variant of 3-SAT -- the amplitude of gradient and the success probability achieve their minimum at the well-known SAT-UNSAT phase transition .
Revised:  We find a computational phase transition of QAOA when solving a variant of 3-SAT -- the amplitude of gradient and the success probability achieve their minimum at the well-known SAT-UNSAT phase transition .
Edit intent: clarity
Original: Intelligent data-driven fault diagnosis methods have been widely applied, but most of these methods need a large number of high-quality labeled samples.
Revised: Although data-driven fault diagnosis methods have been widely applied, but most of these methods need a large number of high-quality labeled samples.
Edit intent: coherence
Original:  In the first stage, a skip-connection based convolutional auto-encoder (SCCAE)  is proposed and pre-trained to automatically learn low-dimensional representations .
Revised:  In the first stage, a skip-connection-based convolutional auto-encoder (SCCAE) is proposed and pre-trained to automatically learn low-dimensional representations .
Edit intent: fluency
Original:  In the second stage, a semi-supervised improved deep embedded clustering (SSIDEC) model that integrates the pre-trained auto-encoder with a clustering layer is proposed for deep clustering.
Revised:  In the second stage, a semi-supervised improved deep embedded clustering (SSIDEC) network is proposed for deep clustering.
Edit intent: clarity
Original:  Additionally , virtual adversarial training (VAT) is introduced as a regularization term to overcome the overfitting in the model's training .
Revised:  Additionally , virtual adversarial training (VAT) is introduced as a regularization term in this stage .
Edit intent: clarity
Original:  The labeled dataset is augmented by those pseudo-labeled samples and used to train a bearing fault discriminative model.
Revised:  The labeled dataset can be augmented by these pseudo-labeled samples and used to train a bearing fault discriminative model.
Edit intent: clarity
Original:  The labeled dataset is augmented by those pseudo-labeled samples and used to train a bearing fault discriminative model.
Revised:  The labeled dataset is augmented by those pseudo-labeled data and then leveraged to train a bearing fault discriminative model.
Edit intent: clarity
Original:  This method provides a new research idea for fault diagnosis with limited labeled samples by effectively using unsupervised data.
Revised:  This method provides a new approach for fault diagnosis with limited labeled samples by effectively using unsupervised data.
Edit intent: clarity
Original:  This method provides a new research idea for fault diagnosis with limited labeled samples by effectively using unsupervised data.
Revised:  This method provides a new research idea for fault diagnosis under the situation of limited labeled samples by effectively using unsupervised data.
Edit intent: clarity
Original:  This method provides a new research idea for fault diagnosis with limited labeled samples by effectively using unsupervised data.
Revised:  This method provides a new research idea for fault diagnosis with limited labeled samples by effectively exploring unsupervised data.
Edit intent: clarity
Original:  In the children's category, iOS apps used much fewer advertising-related tracking than their Android counterparts, but could more often access children's location (by a factor of 7) .
Revised:  In the children's category, iOS apps tended to use fewer advertising-related tracking than their Android counterparts, but could more often access children's location (by a factor of 7) .
Edit intent: clarity
Original:  In the children's category, iOS apps used much fewer advertising-related tracking than their Android counterparts, but could more often access children's location (by a factor of 7) .
Revised:  In the children's category, iOS apps used much fewer advertising-related tracking than their Android counterparts, but could more often access children's location .
Edit intent: clarity
Original:  the use of third-party tracking without user consent, 2) the lack of parental consent before sharing PII with third-parties in children's apps, 3) the non-data-minimising configuration of tracking libraries, 4) the sending of personal data to countries without an adequate level of data protection, and 5) the continued absence of transparency around tracking, partly due to design decisions by Apple and Google.
Revised:  the use of third-party tracking without user consent, 2) the lack of parental consent before sharing personally identifiable information (PII) with third-parties in children's apps, 3) the non-data-minimising configuration of tracking libraries, 4) the sending of personal data to countries without an adequate level of data protection, and 5) the continued absence of transparency around tracking, partly due to design decisions by Apple and Google.
Edit intent: clarity
Original:  Previous SSR systems also have limited performance in  speech restoration tasks such as speech super-resolution.
Revised:  In addition, previous SSR systems show limited performance in speech restoration tasks such as speech super-resolution.
Edit intent: clarity
Original:  Previous SSR systems also have limited performance in  speech restoration tasks such as speech super-resolution.
Revised:  Previous SSR systems also have limited performance in some speech restoration tasks such as speech super-resolution.
Edit intent: clarity
Original:  Furthermore, we propose VoiceFixer, a generative framework to address the GSR tasks . VoiceFixer consists of an analysis stage and a synthesis stage to mimic the speech analysis and comprehension of the human auditory system.
Revised:  Furthermore, we propose VoiceFixer, a generative framework to address the GSR task . VoiceFixer consists of an analysis stage and a synthesis stage to mimic the speech analysis and comprehension of the human auditory system.
Edit intent: fluency
Original:  We employ a ResUNet to model the analysis module and a neural vocoder to model the synthesis module .
Revised:  We employ a ResUNet to model the analysis stage and a neural vocoder to model the synthesis module .
Edit intent: clarity
Original:  We employ a ResUNet to model the analysis module and a neural vocoder to model the synthesis module .
Revised:  We employ a ResUNet to model the analysis module and a neural vocoder to model the synthesis stage .
Edit intent: clarity
Original:  In addition , we observe that VoiceFixer generalizes well to severely degraded real speech recordings, indicating its potential in restoring old movies and historical speeches.
Revised:  Moreover , we observe that VoiceFixer generalizes well to severely degraded real speech recordings, indicating its potential in restoring old movies and historical speeches.
Edit intent: coherence
Original: A recent peer reviewed  meta-analysis evaluating ivermectin (Bryant et al, 2021) concluded that this antiparasitic drug is a cheap and effective treatment for reducing Covid-19 deaths .
Revised: A recent peer reviewed meta-analysis evaluating ivermectin (Bryant et al, 2021) concluded that ivermectin was effective for reducing Covid-19 deaths .
Edit intent: clarity
Original:  We show  there is strong evidence to support a causal link between ivermectin, Covid-19 severity and mortality, and: i) for severe Covid-19 there is a 90.7\% probability the risk ratio favours ivermectin;
Revised:  We show that there is strong evidence to support a causal link between ivermectin, Covid-19 severity and mortality, and: i) for severe Covid-19 there is a 90.7\% probability the risk ratio favours ivermectin;
Edit intent: fluency
Original:  Also, from the Bayesian meta-analysis for patients with severe Covid-19, the mean probability of death without ivermectin treatment is 22.9\%, whilst with the application of ivermectin treatment it is 11.7\%.
Edit intent: coherence
Original:  In the worst case, where  Elgazzar 2020  is removed, the results remain robust  .
Revised:  In the worst case, where ( Elgazzar 2020 is removed, the results remain robust .
Edit intent: fluency
Original:  In the worst case, where  Elgazzar 2020  is removed, the results remain robust  .
Revised:  In the worst case, where Elgazzar 2020 ) is removed, the results remain robust .
Edit intent: fluency
Original: In this paper  we propose a combined Online Feedback Optimization (OFO) and dynamic estimation approach for a real-time power grid operation under time-varying conditions.
Revised: In this paper , we propose a combined Online Feedback Optimization (OFO) and dynamic estimation approach for a real-time power grid operation under time-varying conditions.
Edit intent: fluency
Original:  A dynamic estimation uses grid measurements to generate the information required by an OFO controller, that incrementally steers the controllable power injections set-points towards the solutions of a time-varying AC Optimal Power Flow (AC-OPF)  . More concretely, we propose a quadratic-programming-based OFO that guarantees satisfying the grid operational constraints, like admissible voltage limits.
Revised:  A dynamic estimation uses grid measurements to generate the information required by an OFO controller, that incrementally steers the controllable power injections set-points towards the solutions of a time-varying AC Optimal Power Flow (AC-OPF) problem . More concretely, we propose a quadratic-programming-based OFO that guarantees satisfying the grid operational constraints, like admissible voltage limits.
Edit intent: clarity
Original:  A dynamic estimation uses grid measurements to generate the information required by an OFO controller, that incrementally steers the controllable power injections set-points towards the solutions of a time-varying AC Optimal Power Flow (AC-OPF)  . More concretely, we propose a quadratic-programming-based OFO that guarantees satisfying the grid operational constraints, like admissible voltage limits.
Revised:  A dynamic estimation uses grid measurements to generate the information required by an OFO controller, that incrementally steers the controllable power injections set-points towards the solutions of a time-varying AC Optimal Power Flow (AC-OPF) . More concretely, we propose a quadratic programming-based OFO that guarantees satisfying the grid operational constraints, like admissible voltage limits.
Edit intent: fluency
Original:  \r{Within the estimation, we design an online power flow solver that efficiently computes power flow approximations in real time.
Revised:  Within the estimation, we design an online power flow solver that efficiently computes power flow approximations in real time.
Edit intent: fluency
Original:  We demonstrate that the FR facilitates  the selection of efficient paths to desired states, allows the agent, under certain conditions, to plan provably optimal trajectories defined by a sequence of subgoals, and induces similar behavior to animals avoiding threatening stimuli.
Revised:  We demonstrate that the FR facilitates exploration, the selection of efficient paths to desired states, allows the agent, under certain conditions, to plan provably optimal trajectories defined by a sequence of subgoals, and induces similar behavior to animals avoiding threatening stimuli.
Edit intent: clarity
Original:  We present four problems ready for research, namely withstanding hazards ("Robustness"), identifying hazards ("Monitoring"), steering ML systems ("Alignment"), and reducing risks to how ML systems are handled ("External Safety").
Revised:  We present four problems ready for research, namely withstanding hazards ("Robustness"), identifying hazards ("Monitoring"), steering ML systems ("Alignment"), and reducing hazards in deployment ("External Safety").
Edit intent: clarity
Original: Unlike other metaheuristics, differential Evolution (DE) employs a crossover operation filtering variables to be mutated , which contributes to its successful applications in a variety of complicated optimization problems.
Revised: In differential Evolution (DE) employs a crossover operation filtering variables to be mutated , which contributes to its successful applications in a variety of complicated optimization problems.
Edit intent: clarity
Original: Unlike other metaheuristics, differential Evolution (DE) employs a crossover operation filtering variables to be mutated , which contributes to its successful applications in a variety of complicated optimization problems.
Revised: Unlike other metaheuristics, differential Evolution (DE) algorithms, a crossover operation filtering variables to be mutated , which contributes to its successful applications in a variety of complicated optimization problems.
Edit intent: clarity
Original:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA and its variants, the (1+1)EA_{ C } and the (1+1)EA _{CM . Generally, the introduction of the binomial crossover contributes to the enhancement of the exploration ability as well as degradation of the exploitation ability, and under some conditions, leads to the dominance of the transition matrix for binary optimization problems .
Revised:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA _{C the (1+1)EA_{ C } and the (1+1)EA _{CM . Generally, the introduction of the binomial crossover contributes to the enhancement of the exploration ability as well as degradation of the exploitation ability, and under some conditions, leads to the dominance of the transition matrix for binary optimization problems .
Edit intent: clarity
Original:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA and its variants, the (1+1)EA_{ C } and the (1+1)EA _{CM . Generally, the introduction of the binomial crossover contributes to the enhancement of the exploration ability as well as degradation of the exploitation ability, and under some conditions, leads to the dominance of the transition matrix for binary optimization problems .
Revised:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA and its variants, the (1+1)EA_{ CM } and the (1+1)EA _{CM . Generally, the introduction of the binomial crossover contributes to the enhancement of the exploration ability as well as degradation of the exploitation ability, and under some conditions, leads to the dominance of the transition matrix for binary optimization problems .
Edit intent: fluency
Original:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA and its variants, the (1+1)EA_{ C } and the (1+1)EA _{CM . Generally, the introduction of the binomial crossover contributes to the enhancement of the exploration ability as well as degradation of the exploitation ability, and under some conditions, leads to the dominance of the transition matrix for binary optimization problems .
Revised:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA and its variants, the (1+1)EA_{ C } and the (1+1)EA that incorporate the binomial crossover operator . Generally, the introduction of the binomial crossover contributes to the enhancement of the exploration ability as well as degradation of the exploitation ability, and under some conditions, leads to the dominance of the transition matrix for binary optimization problems .
Edit intent: clarity
Original:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA and its variants, the (1+1)EA_{ C } and the (1+1)EA _{CM . Generally, the introduction of the binomial crossover contributes to the enhancement of the exploration ability as well as degradation of the exploitation ability, and under some conditions, leads to the dominance of the transition matrix for binary optimization problems .
Revised:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA and its variants, the (1+1)EA_{ C } and the (1+1)EA _{CM . Generally, the binomial crossover results in the enhancement of the exploration ability as well as degradation of the exploitation ability, and under some conditions, leads to the dominance of the transition matrix for binary optimization problems .
Edit intent: clarity
Original:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA and its variants, the (1+1)EA_{ C } and the (1+1)EA _{CM . Generally, the introduction of the binomial crossover contributes to the enhancement of the exploration ability as well as degradation of the exploitation ability, and under some conditions, leads to the dominance of the transition matrix for binary optimization problems .
Revised:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA and its variants, the (1+1)EA_{ C } and the (1+1)EA _{CM . Generally, the introduction of the binomial crossover contributes to the enhancement of exploration and the dominance of the transition matrix for binary optimization problems .
Edit intent: clarity
Original:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA and its variants, the (1+1)EA_{ C } and the (1+1)EA _{CM . Generally, the introduction of the binomial crossover contributes to the enhancement of the exploration ability as well as degradation of the exploitation ability, and under some conditions, leads to the dominance of the transition matrix for binary optimization problems .
Revised:  In this paper, we try to reveal the influence of the binomial crossover by performing a theoretical comparison between the (1+1)EA and its variants, the (1+1)EA_{ C } and the (1+1)EA _{CM . Generally, the introduction of the binomial crossover contributes to the enhancement of the exploration ability as well as degradation of the exploitation ability, and under some conditions, leads to the dominance of transition matrices under some conditions .
Edit intent: clarity
Original:  Finally, we perform  exploration analysis by investigating probabilities to transfer from non-optimal statuses to the optimal status of the Deceptive problem, inspired by which adaptive strategies are proposed to improve the ability of global exploration .
Revised:  Finally, we perform an exploration analysis by investigating probabilities to transfer from non-optimal statuses to the optimal status of the Deceptive problem, inspired by which adaptive strategies are proposed to improve the ability of global exploration .
Edit intent: fluency
Original:  It suggests that incorporation of the binomial crossover could be a feasible strategy to improve the performances of randomized search heuristics .
Revised:  It suggests that incorporation of the binomial crossover could be a feasible strategy to improve the performances of EAs .
Edit intent: clarity
Original:  Since the local regions which similar to infrared small-dim targets spread over the whole background, exploring the interaction information amongst image features in large-range dependencies to mine the difference between the target and background is crucial for robust detection.
Revised:  Since the local regions similar to infrared small-dim targets spread over the whole background, exploring the interaction information amongst image features in large-range dependencies to mine the difference between the target and background is crucial for robust detection.
Edit intent: fluency