wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our predictions indicate that the first 1000 nucleotides in the 5 prime end interact with Double-stranded RNA-specific Editase 1 ADARB1 , 2-5A-dependent Ribonuclease RNASEL, ATP-dependent RNA Helicase DDX1 and A-kinase anchor protein 8-like AKAP8L, in addition to >20 high-confidence candidate partners.
Revised:  Our predictions indicate that the first 1000 nucleotides in the 5 prime end can interact with proteins involved in viral RNA processing such as double-stranded RNA specific editases and ATP-dependent RNA-helicases , 2-5A-dependent Ribonuclease RNASEL, ATP-dependent RNA Helicase DDX1 and A-kinase anchor protein 8-like AKAP8L, in addition to >20 high-confidence candidate partners.
Edit intent: clarity
Original:  Our predictions indicate that the first 1000 nucleotides in the 5 prime end interact with Double-stranded RNA-specific Editase 1 ADARB1 , 2-5A-dependent Ribonuclease RNASEL, ATP-dependent RNA Helicase DDX1 and A-kinase anchor protein 8-like AKAP8L, in addition to >20 high-confidence candidate partners.
Revised:  Our predictions indicate that the first 1000 nucleotides in the 5 prime end interact with Double-stranded RNA-specific Editase 1 ADARB1 , in addition to >20 high-confidence candidate partners.
Edit intent: coherence
Original:  Our predictions indicate that the first 1000 nucleotides in the 5 prime end interact with Double-stranded RNA-specific Editase 1 ADARB1 , 2-5A-dependent Ribonuclease RNASEL, ATP-dependent RNA Helicase DDX1 and A-kinase anchor protein 8-like AKAP8L, in addition to >20 high-confidence candidate partners.
Revised:  Our predictions indicate that the first 1000 nucleotides in the 5 prime end interact with Double-stranded RNA-specific Editase 1 ADARB1 , 2-5A-dependent Ribonuclease RNASEL, ATP-dependent RNA Helicase DDX1 and A-kinase anchor protein 8-like AKAP8L, in addition to other high-confidence candidate partners.
Edit intent: clarity
Original:  These interactions,  also implicated in HIV replication, provide clues on host-virus interaction mechanisms .
Revised:  These interactions, also implicated in HIV , reveal important information on host-virus interaction mechanisms .
Edit intent: clarity
Original:  These interactions,  also implicated in HIV replication, provide clues on host-virus interaction mechanisms .
Revised:  These interactions, also implicated in HIV replication, provide clues on host-virus interactions .
Edit intent: clarity
Original:  The list of transcriptional and post-transcriptional elements recruited by SARS-CoV-2 genome is useful to identify which biological pathways are associated with gene expression changes in human cells.
Revised:  The list of transcriptional and post-transcriptional elements recruited by SARS-CoV-2 genome provides clues on the biological pathways associated with gene expression changes in human cells.
Edit intent: clarity
Original:  These groups are nilpotent groups of class 2 and exponent ~ p, they agree in many combinatorial properties such as the combinatorics of their conjugacy classes and have highly similar commuting graphs.
Revised:  These groups are nilpotent groups of class 2 and exponent p, they agree in many combinatorial properties such as the combinatorics of their conjugacy classes and have highly similar commuting graphs.
Edit intent: clarity
Original:  Since CFLA+ inherits the limitations of CFLA, we also develop a novel algorithm to solve the CFSTP, the first to be both anytime and efficient, which we call Clustered-based Coalition Formation (CCF).
Revised:  Since CFLA+ inherits the limitations of CFLA, we also develop a novel algorithm to solve the CFSTP, the first to be both anytime and efficient, which we call Cluster-based Coalition Formation (CCF).
Edit intent: fluency
Original: The Coalition Formation with Spatial and Temporal constraints Problem (CFSTP) is a multi-agent task allocation problem where the agents are cooperative and few, the tasks are many, spatially distributed, with deadlines and workloads, and the objective is to find a schedule that maximises the number of completed tasks.
Revised: The Coalition Formation with Spatial and Temporal constraints Problem (CFSTP) is a multi-agent task scheduling problem where the agents are cooperative and few, the tasks are many, spatially distributed, with deadlines and workloads, and the objective is to find a schedule that maximises the number of completed tasks.
Edit intent: clarity
Original: The Coalition Formation with Spatial and Temporal constraints Problem (CFSTP) is a multi-agent task allocation problem where the agents are cooperative and few, the tasks are many, spatially distributed, with deadlines and workloads, and the objective is to find a schedule that maximises the number of completed tasks.
Revised: The Coalition Formation with Spatial and Temporal constraints Problem (CFSTP) is a multi-agent task allocation problem where the tasks are spatially distributed, with deadlines and workloads, and the objective is to find a schedule that maximises the number of completed tasks.
Edit intent: coherence
Original:  First, its time complexity is quadratic with the number of tasks and exponential with the number of agents , which makes it not efficient .
Revised:  First, its time complexity is exponential with the number of agents , which makes it not efficient .
Edit intent: clarity
Original:  First, its time complexity is quadratic with the number of tasks and exponential with the number of agents , which makes it not efficient .
Revised:  First, its time complexity is quadratic with the number of tasks and exponential with the number of agents .
Edit intent: coherence
Original:  Second,  its look-ahead technique is not effective in real-world scenarios, such as open multi-agent systems, where new tasks can appear at any time.
Revised:  Second, as we show, its look-ahead technique is not effective in real-world scenarios, such as open multi-agent systems, where new tasks can appear at any time.
Edit intent: clarity
Original:  Motivated by this , we propose an extensionof CFLA, which we call Coalition Formation with Improved Look-Ahead ( CFLA+).
Revised:  Motivated by this , called Coalition Formation with Improved Look-Ahead ( CFLA+).
Edit intent: clarity
Original:  Our results affirm CCF as the new state-of-the-art CFSTP solver .
Revised:  Our results affirm CCF as the new state-of-the-art algorithm to solve the CFSTP .
Edit intent: clarity
Original:  PDRA enables autonomous  agents to share computational resources for computationally expensive tasks such as localization and path planning.
Revised:  PDRA enables autonomous robotic agents to share computational resources for computationally expensive tasks such as localization and path planning.
Edit intent: clarity
Original:  It sits between an existing single-agent planner/executor and existing computational resources (e.g. ROS packages), intercepts the executor's requests and, if needed, transparently routes them to other nodes for execution.
Revised:  It sits between an existing single-agent planner/executor and existing computational resources (e.g. ROS packages), intercepts the executor's requests and, if needed, transparently routes them to other robots for execution.
Edit intent: clarity
Original:  Task allocation decisions are performed by a mixed-integer programming algorithm, solved in a shared-world fashion, that models CPU resources, network bandwidth, and latency requirements, and minimizes overall energy usage or maximizes reward for completing optional tasks.
Revised:  Task allocation decisions are performed by a mixed-integer programming algorithm, solved in a shared-world fashion, that models CPU resources, latency requirements, and minimizes overall energy usage or maximizes reward for completing optional tasks.
Edit intent: clarity
Original:  Task allocation decisions are performed by a mixed-integer programming algorithm, solved in a shared-world fashion, that models CPU resources, network bandwidth, and latency requirements, and minimizes overall energy usage or maximizes reward for completing optional tasks.
Revised:  Task allocation decisions are performed by a mixed-integer programming algorithm, solved in a shared-world fashion, that models CPU resources, network bandwidth, and latency requirements, and minimizes overall energy usage or maximize the reward for completing optional tasks.
Edit intent: fluency
Original:  But both of these problems  suffer from relatively small training sets, creating the need for statistically efficient methods to learn 3D shape representations.
Revised:  Both of these problems suffer from relatively small training sets, creating the need for statistically efficient methods to learn 3D shape representations.
Edit intent: coherence
Original:  But both of these problems  suffer from relatively small training sets, creating the need for statistically efficient methods to learn 3D shape representations.
Revised:  But both of these problems , however, suffer from relatively small training sets, creating the need for statistically efficient methods to learn 3D shape representations.
Edit intent: coherence
Original:  In this work , we investigate the use of Approximate Convex Decompositions (ACD) as a self-supervisory signal for label-efficient learning of point cloud representations.
Revised:  In this paper , we investigate the use of Approximate Convex Decompositions (ACD) as a self-supervisory signal for label-efficient learning of point cloud representations.
Edit intent: clarity
Original:  In this paper, we show that using the results of ACD to approximate a ground truth segmentation provides excellent self-supervision for learning 3D point cloud representations that are highly effective on downstream tasks.
Revised:  In this paper, we show that using ACD to approximate a ground truth segmentation provides excellent self-supervision for learning 3D point cloud representations that are highly effective on downstream tasks.
Edit intent: clarity
Original:  In this paper, we show that using the results of ACD to approximate a ground truth segmentation provides excellent self-supervision for learning 3D point cloud representations that are highly effective on downstream tasks.
Revised:  In this paper, we show that using the results of ACD to approximate ground truth segmentation provides excellent self-supervision for learning 3D point cloud representations that are highly effective on downstream tasks.
Edit intent: fluency
Original:  We report improvements over the state-of-theart in unsupervised representation learning on the ModelNet40 shape classification dataset and significant gains in few-shot part segmentation on the ShapeNetPart dataset.
Revised:  We report improvements over the state-of-the-art for unsupervised representation learning on the ModelNet40 shape classification dataset and significant gains in few-shot part segmentation on the ShapeNetPart dataset.
Edit intent: clarity
Original:  We study an ad auction setting where users arrive in an online fashion , k advertisers submit bids for each user, and the auction assigns a distribution over ads to the user.
Revised:  We study an ad auction setting where users arrive one at a time , k advertisers submit bids for each user, and the auction assigns a distribution over ads to the user.
Edit intent: clarity
Original:  We study an ad auction setting where users arrive in an online fashion , k advertisers submit bids for each user, and the auction assigns a distribution over ads to the user.
Revised:  We study an ad auction setting where users arrive in an online fashion , k advertisers submit values for each user, and the auction assigns a distribution over ads to the user.
Edit intent: clarity
Original:  We study an ad auction setting where users arrive in an online fashion , k advertisers submit bids for each user, and the auction assigns a distribution over ads to the user.
Revised:  We study an ad auction setting where users arrive in an online fashion , k advertisers submit bids for each user, and the auction assigns a distribution over ads to each user.
Edit intent: fluency
Original:  In terms of social welfare, inverse-proportional allocation achieves a constant factor approximation in social welfare against the optimal ( unfair) allocation, independent of the number of advertisers in the system.
Revised:  In terms of social welfare, inverse-proportional allocation achieves a constant factor approximation to the optimal ( unfair) allocation, independent of the number of advertisers in the system.
Edit intent: clarity
Original:  In terms of social welfare, inverse-proportional allocation achieves a constant factor approximation in social welfare against the optimal ( unfair) allocation, independent of the number of advertisers in the system.
Revised:  In terms of social welfare, inverse-proportional allocation achieves a constant factor approximation in social welfare against the optimal ( unconstrained) social welfare. In particular, the approximation ratio is independent of the number of advertisers in the system.
Edit intent: clarity
Original: We study the tradeoff between social welfare maximization and fairness in the context of ad auctions .
Revised: Recent empirical work demonstrates that online advertisement can exhibit bias in the delivery of ads across users even when all advertisers bid in a non-discriminatory manner .
Edit intent: clarity
Original:  We study an ad auction setting where users arrive one at a time, k advertisers submit values for each user, and the auction assigns a distribution over ads to each user . Following the works of Dwork and Ilvento (2019) and Chawla et al. (2020), our goal is to design a truthful auction that satisfies "individual fairness" in its outcomes: informally speaking, users that are similar to each other should obtain similar allocations of ads.
Revised:  We study the design of ad auctions that, given fair bids, are guaranteed to produce fair outcomes . Following the works of Dwork and Ilvento (2019) and Chawla et al. (2020), our goal is to design a truthful auction that satisfies "individual fairness" in its outcomes: informally speaking, users that are similar to each other should obtain similar allocations of ads.
Edit intent: clarity
Original:  We study an ad auction setting where users arrive one at a time, k advertisers submit values for each user, and the auction assigns a distribution over ads to each user . Following the works of Dwork and Ilvento (2019) and Chawla et al. (2020), our goal is to design a truthful auction that satisfies "individual fairness" in its outcomes: informally speaking, users that are similar to each other should obtain similar allocations of ads.
Revised:  We study an ad auction setting where users arrive one at a time, k advertisers submit values for each user, and the auction assigns a distribution over ads to each user . Following the works of Dwork and Ilvento (2019) and Chawla et al. (2020), our goal is to design a truthful auction that satisfies ``individual fairness'' in its outcomes: informally speaking, users that are similar to each other should obtain similar allocations of ads.
Edit intent: fluency
Original:  This value stability constraint is expressed as a function that maps the multiplicative distance between value vectors to the maximum allowable \ell _\infty distance between the corresponding allocations.
Revised:  This value stability constraint is expressed as a function that maps the multiplicative distance between value vectors to the maximum allowable \ell _{\infty distance between the corresponding allocations.
Edit intent: fluency
Original:  Our main contribution is a new class of allocation algorithms called Inverse Proportional Allocation that achieve value stability with respect to an expressive class of  stability conditions.
Revised:  Second, we introduce a new class of allocation algorithms called Inverse Proportional Allocation that achieve value stability with respect to an expressive class of stability conditions.
Edit intent: clarity
Original:  Our main contribution is a new class of allocation algorithms called Inverse Proportional Allocation that achieve value stability with respect to an expressive class of  stability conditions.
Revised:  Our main contribution is a new class of allocation algorithms called Inverse Proportional Allocation that achieve value stability with respect to an expressive class of value stability conditions.
Edit intent: fluency
Original:  However, in order to satisfy the needs of  citizens, the strictest containment measures can be only executed for short period.
Revised:  However, in order to satisfy the needs of its citizens, the strictest containment measures can be only executed for short period.
Edit intent: fluency
Original:  When to implement the strictest measures is also of interest.
Revised:  When to implement the strictest measure is also of interest.
Edit intent: fluency
Original:  As an example, a county with 2.8 million population with initial 200  infectious cases is considered , where about 0.15\% people died during the pandemic.
Revised:  As an example, a county with 2.8 million and 200 infectious cases is considered , where about 0.15\% people died during the pandemic.
Edit intent: clarity
Original:  Compared with a constant containment strategy, adaptive containment strategies shorten the outbreak length and executing the strictest measures earlier will cause less mortality.
Revised:  Compared with a constant containment strategy, adaptive containment strategies shorten the outbreak length and executing the strictest measures early will cause less mortality.
Edit intent: fluency
Original: Since instances of coronavirus disease 2019 (COVID-19) community spread emerged in the United States , federal and local governments have implemented multiple containment measures.
Revised: The emergence of coronavirus disease 2019 (COVID-19) community spread emerged in the United States , federal and local governments have implemented multiple containment measures.
Edit intent: clarity
Original: Since instances of coronavirus disease 2019 (COVID-19) community spread emerged in the United States , federal and local governments have implemented multiple containment measures.
Revised: Since instances of coronavirus disease 2019 (COVID-19) in the United States , federal and local governments have implemented multiple containment measures.
Edit intent: clarity
Original: Since instances of coronavirus disease 2019 (COVID-19) community spread emerged in the United States , federal and local governments have implemented multiple containment measures.
Revised: Since instances of coronavirus disease 2019 (COVID-19) community spread emerged in the United States has forced federal and local governments have implemented multiple containment measures.
Edit intent: clarity
Original: Since instances of coronavirus disease 2019 (COVID-19) community spread emerged in the United States , federal and local governments have implemented multiple containment measures.
Revised: Since instances of coronavirus disease 2019 (COVID-19) community spread emerged in the United States , federal and local governments to implement containment measures.
Edit intent: clarity
Original:  As an example, a region with population 2.8 million and 200 initial infectious cases is considered assuming a 4\% mortality rate .
Revised:  As an example, a region with population 2.8 million and 200 initial infectious cases assuming a 4\% mortality rate .
Edit intent: clarity
Original:  Our experiments show that although convolutional networks have achieved superhuman performance in many visual learning tasks, their spatial reasoning performance in SPARE3D is almost equal to random guesses.
Revised:  Our experiments show that although convolutional networks have achieved superhuman performance in many visual learning tasks, their spatial reasoning performance on SPARE3D is almost equal to random guesses.
Edit intent: clarity
Original:  A nonlinear and nonlocal coupling between markers , as in the case of ion cyclotron resonance heating, is permitted.
Revised:  These schemes can also be applied in the presence of nonlinear and nonlocal coupling between markers , as in the case of ion cyclotron resonance heating, is permitted.
Edit intent: clarity
Original:  The amplitude of Monte Carlo noise for 2 MeV ions can be reduced by a factor of 18, what would normally take over 350 times as many markers .
Revised:  The amplitude of Monte Carlo noise for 2 MeV ions can be reduced at least of one order of magnitude without increasing the computational effort .
Edit intent: clarity
Original: An innovative approach which can promote cognitive functions effectively and efficiently is an urgent need for healthy elderly and patients with cognitive impairment .
Revised: An innovative approach which can promote cognitive functions effectively and efficiently .
Edit intent: clarity
Original:  Frontoparietal FC was significantly increased in the tested group (p = 0.005) and the cognitive functions (memory and attention) were significantly promoted compared to the NC group .
Revised:  Frontoparietal FC was significantly increased in the test group (p = 0.005) and the cognitive functions (memory and attention) were significantly promoted compared to the NC group .
Edit intent: fluency
Original:  The proposed method shows great potential to be developed as a fast, effective  and widespread training approach for cognitive functions enhancementand rehabilitation applications .
Revised:  The proposed method shows great potential to be developed as a fast, effective , and widespread training approach for cognitive functions enhancementand rehabilitation applications .
Edit intent: fluency
Original:  The proposed method shows great potential to be developed as a fast, effective  and widespread training approach for cognitive functions enhancementand rehabilitation applications .
Revised:  The proposed method shows great potential to be developed as a fast, effective and widespread training approach for cognitive function enhancement .
Edit intent: clarity
Original:  Furthermore, these policies are learnt automatically by the proposed algorithm, as a function of disease parameters (infectiousness, gestation period, duration of symptoms, probability of death) and population characteristics (density, movement propensity).
Revised:  Furthermore, these policies are learnt automatically by the proposed algorithm, as a function of disease parameters (infectiousness, gestation period, duration of symptoms, probability of death) and population characteristics (density, movement propensity).
Edit intent: fluency
Original: With the rapid development of quantum key distribution (QKD) technology, more various types of QKD protocols are being proposed.
Revised: With the growing complexity of quantum key distribution (QKD) technology, more various types of QKD protocols are being proposed.
Edit intent: clarity
Original:  Considering the variety of QKD protocols , the exclusivity of quantum channels, the limitation of key generation capability, and the necessity of credibility control, it is a crucial taskto explore the cost-effective construction of hybrid QKD networks .
Revised:  Considering the variety of QKD protocols , the exclusivity of quantum channels, the limitation of key generation capabilities, the variety of QKD protocols and the necessity of credibility control, it is a crucial taskto explore the cost-effective construction of hybrid QKD networks .
Edit intent: fluency
Original:  Considering the variety of QKD protocols , the exclusivity of quantum channels, the limitation of key generation capability, and the necessity of credibility control, it is a crucial taskto explore the cost-effective construction of hybrid QKD networks .
Revised:  Considering the variety of QKD protocols , the exclusivity of quantum channels, the limitation of key generation capability, and the necessity of untrusted-relay selection, make the optimal topology design a very complicated task .
Edit intent: clarity