wanyu/IteraTeR_v2 huggingface dataset:
Original: Species living in the extreme cold environment fight against the harsh conditions by virtue of antifreeze proteins (AFPs), that manipulates the freezing mechanism of water in more than one way.
Revised: Species living in the extreme cold environment fight against the harsh conditions using antifreeze proteins (AFPs), that manipulates the freezing mechanism of water in more than one way.
Edit intent: clarity
Original:  This amazing nature of AFP turns out to be extremely useful in a number of industrial and medical applications.
Revised:  This amazing nature of AFP turns out to be extremely useful in several industrial and medical applications.
Edit intent: clarity
Original:  The lack of similarity in their structure and sequence makes their prediction an arduous task and identifying them experimentally in the wet-lab is time consuming and expensive.
Revised:  The lack of similarity in their structure and sequence makes their prediction an arduous task and identifying them experimentally in the wet-lab is time-consuming and expensive.
Edit intent: fluency
Original:  A linear model and an over-complete dictionary matrix of known AFPs is used to predict  sparse class-label vector which provides sample-association score.
Revised:  A linear model and an over-complete dictionary matrix of known AFPs are used to predict sparse class-label vector which provides sample-association score.
Edit intent: fluency
Original:  A linear model and an over-complete dictionary matrix of known AFPs is used to predict  sparse class-label vector which provides sample-association score.
Revised:  A linear model and an over-complete dictionary matrix of known AFPs is used to predict a sparse class-label vector which provides sample-association score.
Edit intent: fluency
Original:  A linear model and an over-complete dictionary matrix of known AFPs is used to predict  sparse class-label vector which provides sample-association score.
Revised:  A linear model and an over-complete dictionary matrix of known AFPs is used to predict sparse class-label vector that provides a sample-association score.
Edit intent: fluency
Original:  Delta-rule is applied for the reconstruction of two pseudo-samples using lower and upper parts of  sample-association vector and based on the minimum recovery score, class labels are assigned.
Revised:  Delta-rule is applied for the reconstruction of two pseudo-samples using lower and upper parts of the sample-association vector and based on the minimum recovery score, class labels are assigned.
Edit intent: fluency
Original:  The MATLAB implementation of  proposed method is available at  author's github page URL
Revised:  The MATLAB implementation of the proposed method is available at author's github page URL
Edit intent: fluency
Original:  The MATLAB implementation of  proposed method is available at  author's github page URL
Revised:  The MATLAB implementation of proposed method is available at the author's github page URL
Edit intent: fluency
Original:  The MATLAB implementation of  proposed method is available at  author's github page URL
Revised:  The MATLAB implementation of proposed method is available at author's GitHub page URL
Edit intent: fluency
Original:  They have been proved to lead to high order numerical methods, and the quasi-Trefftz property is critical for the numerical analysisof these methods .
Revised:  They lead to high order numerical methods, and the quasi-Trefftz property is critical for the numerical analysisof these methods .
Edit intent: clarity
Original:  They have been proved to lead to high order numerical methods, and the quasi-Trefftz property is critical for the numerical analysisof these methods .
Revised:  They have been proved to lead to high order numerical methods, and this quasi-Trefftz property is critical for the numerical analysisof these methods .
Edit intent: fluency
Original:  They have been proved to lead to high order numerical methods, and the quasi-Trefftz property is critical for the numerical analysisof these methods .
Revised:  They have been proved to lead to high order numerical methods, and the quasi-Trefftz property is critical for their numerical analysis .
Edit intent: clarity
Original:  The new ansatz is still based on a plane wave function, but it introduces higher order terms in the amplitude rather than the phase of the plane wave as was initially proposed.
Revised:  The new ansatz is introduces higher order terms in the amplitude rather than the phase of the plane wave as was initially proposed.
Edit intent: clarity
Original:  The new ansatz is still based on a plane wave function, but it introduces higher order terms in the amplitude rather than the phase of the plane wave as was initially proposed.
Revised:  The new ansatz is still based on a plane wave function, but it introduces higher order terms in the amplitude rather than the phase of a plane wave as was initially proposed.
Edit intent: fluency
Original:  The new functions' construction and  study of their interpolation properties follow the roadmap proposed in a previous work .
Revised:  The new functions' construction and the study of their interpolation properties follow the roadmap proposed in a previous work .
Edit intent: fluency
Original:  The new functions' construction and  study of their interpolation properties follow the roadmap proposed in a previous work .
Revised:  The new functions' construction and study of their interpolation properties are guided by the roadmap proposed in a previous work .
Edit intent: clarity
Original:  Due to the importance of this process, researchers investigate which members of a social network should be chosen as initiators of influence spread in order to maximise the effect.
Revised:  Due to the importance of this process, researchers investigate which members of a social network should be chosen as initiators of influence spread to maximise the effect.
Edit intent: coherence
Original:  In this work, we follow this direction, develop and evaluate  sequential seeding technique for multilayer networks.
Revised:  In this work, we follow this direction, develop and evaluate the sequential seeding technique for multilayer networks.
Edit intent: fluency
Original:   The results show that sequential seeding outperforms traditional approach by increasing the coverage and allowing to save  seeding budget.
Revised:  The results show that sequential seeding outperforms traditional approach by increasing the coverage and allowing to save the seeding budget.
Edit intent: fluency
Original:  We call this situation regulatory arbitrage , and prove that it cannot be excluded - unless \rho is as conservative as the worst-case risk measure.
Revised:  We call this situation \rho-arbitrage , and prove that it cannot be excluded - unless \rho is as conservative as the worst-case risk measure.
Edit intent: clarity
Original:  We call this situation regulatory arbitrage , and prove that it cannot be excluded - unless \rho is as conservative as the worst-case risk measure.
Revised:  We call this situation regulatory arbitrage , and prove that it cannot be excluded -- unless \rho is as conservative as the worst-case risk measure.
Edit intent: fluency
Original:  After providing a primal characterisation  , we focus our attention on coherent risk measures , and give a necessary and sufficient characterisation for regulatory arbitrage .
Revised:  After providing a primal characterisation of \rho-arbitrage , we focus our attention on coherent risk measures , and give a necessary and sufficient characterisation for regulatory arbitrage .
Edit intent: clarity
Original:  A special case of our result shows that the market does not admit regulatory arbitrage for Expected Shortfall at level \alpha if and only if there exists an EMM Q \approx P such that \Vert \text{dQ}{dP} \Vert _{\infty < \frac{1}{\alpha}.
Revised:  A special case of our result shows that the market does not admit regulatory arbitrage for Expected Shortfall at level \alpha if and only if there exists an EMM Q \approx P such that \Vert \text{dQ}{dP} \Vert _\infty < \frac{1}{\alpha}.
Edit intent: fluency
Original: Purpose. This article explores citing and referencing systems in Social Sciences and Medicine articles from different theoretical and practical perspectives, considering bibliographic references as a facet of descriptive representation.
Revised:  This article explores citing and referencing systems in Social Sciences and Medicine articles from different theoretical and practical perspectives, considering bibliographic references as a facet of descriptive representation.
Edit intent: coherence
Original:  Findings. Reference styles do not fully accomplish with their role of guiding authors and publishers on providing concise and well-structured bibliographic metadata within bibliographic references.
Revised:  Reference styles do not fully accomplish with their role of guiding authors and publishers on providing concise and well-structured bibliographic metadata within bibliographic references.
Edit intent: coherence
Original:  Motivated by this, we introduce the notion of linear Shannon capacity of graphs, which is the largest rate achievable when restricting oneself to linear codes.
Revised:  This motivates the notion of linear Shannon capacity of graphs, which is the largest rate achievable when restricting oneself to linear codes.
Edit intent: coherence
Original:  Motivated by this, we introduce the notion of linear Shannon capacity of graphs, which is the largest rate achievable when restricting oneself to linear codes.
Revised:  Motivated by this, we introduce the notion of linear Shannon capacity of graphs, which is the largest rate achievable when restricting oneself to linear codes.
Edit intent: fluency
Original:  Our method applies more generally to Cayley graphs over the additive group of finite fields F_q  . We compare our bound to the Lov\'asz theta function, showing that they match for self-complementary Cayley graphs (such as C_5), and that our bound is smaller in some cases.
Revised:  Our method applies more generally to Cayley graphs over the additive group of finite fields F_q . We compare this bound to the Lov\'asz theta function, showing that they match for self-complementary Cayley graphs (such as C_5), and that our bound is smaller in some cases.
Edit intent: clarity
Original:  Our method applies more generally to Cayley graphs over the additive group of finite fields F_q  . We compare our bound to the Lov\'asz theta function, showing that they match for self-complementary Cayley graphs (such as C_5), and that our bound is smaller in some cases.
Revised:  Our method applies more generally to Cayley graphs over the additive group of finite fields F_q . We compare our bound to the Lov\'asz theta function, showing that they match for self-complementary Cayley graphs (such as C_5), and that the bound is smaller in some cases.
Edit intent: fluency
Original: Without a cure, vaccine, or proven long-term immunity against SARS-CoV-2, test-trace-and-isolate (TTI) strategies present a promising tool to contain the viral spread.
Revised: Without a cure, vaccine, or proven long-term immunity against SARS-CoV-2, test-trace-and-isolate (TTI) strategies present a promising tool to contain its spread.
Edit intent: clarity
Original:  For any TTI strategy, however, a major challenge arises from pre- and asymptomatic transmission as well as TTI-avoiders, which contribute to hidden , unnoticed infection chains.
Revised:  For any TTI strategy, however, mitigation is challenged by pre- and asymptomatic transmission as well as TTI-avoiders, which contribute to hidden , unnoticed infection chains.
Edit intent: clarity
Original:  For any TTI strategy, however, a major challenge arises from pre- and asymptomatic transmission as well as TTI-avoiders, which contribute to hidden , unnoticed infection chains.
Revised:  For any TTI strategy, however, a major challenge arises from pre- and asymptomatic transmission , TTI-avoiders, which contribute to hidden , unnoticed infection chains.
Edit intent: coherence
Original:  For any TTI strategy, however, a major challenge arises from pre- and asymptomatic transmission as well as TTI-avoiders, which contribute to hidden , unnoticed infection chains.
Revised:  For any TTI strategy, however, a major challenge arises from pre- and asymptomatic transmission as well as TTI-avoiders, which contribute to hidden infection chains.
Edit intent: clarity
Original:  Simulations of the outbreak evolution based on the hypothesis of negligible reinfection probability are performed for France, Ile de France, Puy de Dome and Bouches du Rhone .
Revised:  Basic simulations of the outbreak evolution based on the hypothesis of negligible reinfection probability are performed for France, Ile de France, Puy de Dome and Bouches du Rhone .
Edit intent: clarity
Original:  Simulations of the outbreak evolution based on the hypothesis of negligible reinfection probability are performed for France, Ile de France, Puy de Dome and Bouches du Rhone .
Revised:  Simulations of the outbreak evolution based on the hypothesis of negligible reinfection probability are performed for France, Ile de France, Puy de Dome , Bouches du Rhone .
Edit intent: fluency
Original:  We conclude that Covid-19 is much more spread than previously thought, but its severity became very limited since the end of the first wave .
Revised:  We conclude that Covid-19 is much more spread than previously thought, but its severity became limited since the end of the first wave .
Edit intent: clarity
Original:  In addition, a case study review of emerging new approaches in different regions, using medical literature, academic literature, news articles , and other reliable data sources.
Revised:  In addition, a case study review of emerging new approaches in different regions, using medical literature, academic literature, news articles and other reliable data sources.
Edit intent: fluency
Original: In many applications, such as recommender systems, online advertising, and product search, click-through rate (CTR) prediction is a critical task , because its accuracy has a direct impact on both platform revenue and user experience .
Revised: Click-through rate (CTR) prediction is a critical task , because its accuracy has a direct impact on both platform revenue and user experience .
Edit intent: clarity
Original: In many applications, such as recommender systems, online advertising, and product search, click-through rate (CTR) prediction is a critical task , because its accuracy has a direct impact on both platform revenue and user experience .
Revised: In many applications, such as recommender systems, online advertising, and product search, click-through rate (CTR) prediction is a critical task for many applications, as its accuracy has a direct impact on both platform revenue and user experience .
Edit intent: clarity
Original: In many applications, such as recommender systems, online advertising, and product search, click-through rate (CTR) prediction is a critical task , because its accuracy has a direct impact on both platform revenue and user experience .
Revised: In many applications, such as recommender systems, online advertising, and product search, click-through rate (CTR) prediction is a critical task , because its accuracy has a direct impact on user experience and platform revenue .
Edit intent: clarity
Original:  In recent years, with the prevalence of deep learning, CTR prediction has been widely studied in both academia and industry, resulting in an abundance of deep CTR models.
Revised:  In recent years, CTR prediction has been widely studied in both academia and industry, resulting in an abundance of deep CTR models.
Edit intent: clarity
Original:  In recent years, with the prevalence of deep learning, CTR prediction has been widely studied in both academia and industry, resulting in an abundance of deep CTR models.
Revised:  In recent years, with the prevalence of deep learning, CTR prediction has been widely studied in both academia and industry, resulting in a wide variety of CTR prediction models.
Edit intent: clarity
Original:  Unfortunately, there is still a lack of a standardized benchmark and uniform evaluation protocols for CTR prediction  .
Revised:  Unfortunately, there is still a lack of standardized benchmarks and uniform evaluation protocols for CTR prediction .
Edit intent: fluency
Original:  Unfortunately, there is still a lack of a standardized benchmark and uniform evaluation protocols for CTR prediction  .
Revised:  Unfortunately, there is still a lack of a standardized benchmark and uniform evaluation protocols for CTR prediction research .
Edit intent: clarity
Original:  This leads to the non-reproducible and even inconsistent experimental results among these studies .
Revised:  This leads to non-reproducible and even inconsistent experimental results among these studies .
Edit intent: fluency
Original:  This leads to the non-reproducible and even inconsistent experimental results among these studies .
Revised:  This leads to the non-reproducible or even inconsistent experimental results among these studies .
Edit intent: fluency
Original:  In this paper, we present an open benchmark (namely FuxiCTR) for reproducible research and provide a rigorous comparison of different models for CTR prediction.
Revised:  In this work, we aim to perform open benchmarking for CTR prediction and present a rigorous comparison of different models for CTR prediction.
Edit intent: clarity
Original:  Specifically , we ran over 4,600 experiments for a total of more than 12,000 GPU hours in a uniform framework to re-evaluate 24 existing models on two widely-used datasets, Criteo and Avazu . Surprisingly, our experiments show that many models have smaller differences than expected and sometimes are even inconsistent with what reported in the literature .
Revised:  Specifically , we ran over 4,600 experiments for a total of more than 12,000 GPU hours in total to re-evaluate 24 existing models on two widely-used datasets, Criteo and Avazu . Surprisingly, our experiments show that many models have smaller differences than expected and sometimes are even inconsistent with what reported in the literature .
Edit intent: clarity
Original:  Specifically , we ran over 4,600 experiments for a total of more than 12,000 GPU hours in a uniform framework to re-evaluate 24 existing models on two widely-used datasets, Criteo and Avazu . Surprisingly, our experiments show that many models have smaller differences than expected and sometimes are even inconsistent with what reported in the literature .
Revised:  Specifically , we ran over 4,600 experiments for a total of more than 12,000 GPU hours in a uniform framework to re-evaluate 24 existing models on multiple dataset settings . Surprisingly, our experiments show that many models have smaller differences than expected and sometimes are even inconsistent with what reported in the literature .
Edit intent: clarity
Original:  Specifically , we ran over 4,600 experiments for a total of more than 12,000 GPU hours in a uniform framework to re-evaluate 24 existing models on two widely-used datasets, Criteo and Avazu . Surprisingly, our experiments show that many models have smaller differences than expected and sometimes are even inconsistent with what reported in the literature .
Revised:  Specifically , we ran over 4,600 experiments for a total of more than 12,000 GPU hours in a uniform framework to re-evaluate 24 existing models on two widely-used datasets, Criteo and Avazu . Surprisingly, our experiments show that many models have smaller differences than expected . The results also reveal that making real progress on the modeling of CTR prediction is indeed a very challenging research task .
Edit intent: coherence
Original:  We believe that our benchmark could not only allow researchers to gauge the effectiveness of new models conveniently , but also share some good practices to fairly compare with the state of the arts.
Revised:  We believe that our benchmarking work could not only allow researchers to gauge the effectiveness of new models conveniently , but also share some good practices to fairly compare with the state of the arts.
Edit intent: clarity
Original:  We believe that our benchmark could not only allow researchers to gauge the effectiveness of new models conveniently , but also share some good practices to fairly compare with the state of the arts.
Revised:  We believe that our benchmark could not only allow researchers to gauge the effectiveness of new models conveniently but also make them fairly compare with the state of the arts.
Edit intent: clarity
Original:  We will release all the code and benchmark settings .
Revised:  We have publicly released the benchmarking tools, evaluation protocols, and experimental settings of our work to promote reproducible research in this field .
Edit intent: clarity
Original:  This results in a method for isolating a cluster of zeros of the given system.
Revised:  This leads to a method for isolating a cluster of zeros of the given system.
Edit intent: clarity
Original: We show that, for every set of n points in  d-dimensional unit cube, there is an empty axis-parallel box of volume at least \Omega(d/n) \to .
Revised: We show that, for every set of n points in the d-dimensional unit cube, there is an empty axis-parallel box of volume at least \Omega(d/n) \to .
Edit intent: fluency
Original:  We study the problem of finding a stable many-to-one matching while satisfying fairness among all the agentswith cardinal utilities.
Revised:  We study the problem of finding a stable many-to-one matching while satisfying fairness among the agents, having cardinal utilities.
Edit intent: clarity
Original:  In particular, we focus on leximin optimal fairness and seek leximin optimal many-to-one stable matchings.
Revised:  In particular, we focus on leximin optimal fairness and seek leximin optimality over many-to-one stable matchings.
Edit intent: clarity
Original:  This leads to a novel algorithm, called FaSt, that finds the leximin optimal stable matching under ranked isometric utilities (wherethe utilities from matching are the same across an edge ).
Revised:  This leads to FaSt, a novel and efficient algorithm to compute a leximin optimal stable matching under ranked isometric utilities (wherethe utilities from matching are the same across an edge ).
Edit intent: clarity
Original:  This leads to a novel algorithm, called FaSt, that finds the leximin optimal stable matching under ranked isometric utilities (wherethe utilities from matching are the same across an edge ).
Revised:  This leads to a novel algorithm, called FaSt, that finds the leximin optimal stable matching under ranked isometric valuations (where, for each pair of agents, the valuation of one agent for the other is the same ).
Edit intent: clarity
Original:  Additionally, we provide an efficient algorithm, called FaSt-Gen, that finds the leximin optimal stable matching for ranked but otherwise unconstrained utilities .
Revised:  Building upon FaSt, we present an efficient algorithm, called FaSt-Gen, that finds the leximin optimal stable matching for ranked but otherwise unconstrained utilities .
Edit intent: clarity
Original:  Additionally, we provide an efficient algorithm, called FaSt-Gen, that finds the leximin optimal stable matching for ranked but otherwise unconstrained utilities .
Revised:  Additionally, we provide an efficient algorithm, FaSt-Gen, that finds the leximin optimal stable matching for ranked but otherwise unconstrained utilities .
Edit intent: fluency
Original:  We then establish that, in the absence of rankings, finding a leximin optimal stable matching is NP-Hard, even under isometric utilities .
Revised:  We next establish that, in the absence of rankings, finding a leximin optimal stable matching is NP-Hard, even under isometric utilities .
Edit intent: fluency
Original: This paper presents a density-based topology optimization method for designing  3D  compliant mechanisms and loadbearing structures with design-dependent pressure loading.
Revised: This paper presents a density-based topology optimization method for designing three-dimensional ( 3D compliant mechanisms and loadbearing structures with design-dependent pressure loading.
Edit intent: fluency