wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We extend the PhD algorithm to this multi-sided setting to compute ]  a stable matching in polynomial time, and we discuss its extension to arbitrary quotas. Finally, we illustrate the challenges that arise when not all advisor-co-advisor pairs are compatible, and critically review the statements from 30, 29 .
Revised:  We extend the PhD algorithm to this multi-sided setting to compute ] a stable matching 30, 29 .
Edit intent: coherence
Original:  In this paper, we theoretically analyze when and how clustering may help in obtaining accurate classifiers. We design a simple , efficient, and generic framework called Classification Aware Clustering (CAC), to find clusters that are well suited for being used as training datasets by classifiers for each underlying subpopulation.
Revised:  In this paper, we design a simple , efficient, and generic framework called Classification Aware Clustering (CAC), to find clusters that are well suited for being used as training datasets by classifiers for each underlying subpopulation.
Edit intent: coherence
Original:  Within the model context, the monetary aid, that is, a smaller amounts of help for a larger number of households, makes the economy perform better in terms of production, consumption, reduction of inequality  and maintenance of financial duties.
Revised:  Within the model context, the monetary aid, that is, smaller amounts of help for a larger number of households, makes the economy perform better in terms of production, consumption, reduction of inequality and maintenance of financial duties.
Edit intent: fluency
Original:  Within the model context, the monetary aid, that is, a smaller amounts of help for a larger number of households, makes the economy perform better in terms of production, consumption, reduction of inequality  and maintenance of financial duties.
Revised:  Within the model context, the monetary aid, that is, a smaller amounts of help for a larger number of households, makes the economy perform better in terms of production, consumption, reduction of inequality , and maintenance of financial duties.
Edit intent: fluency
Original:  Our framework leads to the notion of expected marginal contribution (EMC) of an individual with respect to a selection policy as a measure of deviation from meritocracy.
Revised:  When the utility function is defined over sets, this raises the question of how to define meritocracy. We define and analyse an appropriate notion of meritocracy derived from the utility function. We introduce the notion of expected marginal contribution (EMC) of an individual with respect to a selection policy as a measure of deviation from meritocracy.
Edit intent: meaning-changed
Original:  Our framework leads to the notion of expected marginal contribution (EMC) of an individual with respect to a selection policy as a measure of deviation from meritocracy. In order to solve the maximisation problem, we propose to use a policy gradient algorithm. For certain policy structures, the policy gradients are proportional to EMCs of individuals. Consequently, the policy gradient algorithm leads to a locally optimal solution that has zero EMC, and satisfies meritocracy. For uniform policies, EMC reduces to the  Shapley value.
Revised:  Our framework leads to the notion of expected marginal contributions of individuals and analyse its links to the Shapley value.
Edit intent: clarity
Original:  We experimentally analyse the effect of different policy structures  in a simulated college admission setting and compare with ranking and greedy algorithms. Our results verify that separable linear policies achieve high utility while minimising EMCs. We also show that we can design utility functions that successfully promote notions of group fairness, such as diversity .
Revised:  We experimentally analyse the effect of different policy structures in a simulated college admission setting including constraints on statistical parity .
Edit intent: meaning-changed
Original:  We prove that the number of 3-sized hyperedges is bounded by O  (n^2) and that this bound is tight. In addition, we show that the total number of hyperedges is  O(n^3)  .
Revised:  We prove that the number of 3-sized hyperedges is bounded by O (n^2) and that the total number of hyperedges is O(n^3) .
Edit intent: clarity
Original: In this work we present  multi-derivative  implicit-explicit (IMEX)  Runge--Kutta schemes. We derive their order conditions up to third order, and show that such methods can preserve positivity (and more generally strong stability) with a time-step restriction  independent of the stiff term , under mild assumptions on the operators.
Revised: In this work we present multi-derivative implicit-explicit (IMEX) Runge--Kutta schemes where the time-step restriction independent of the stiff term , under mild assumptions on the operators.
Edit intent: coherence
Original:  We derive their order conditions up to third order, and show that such methods can preserve positivity (and more generally strong stability) with a time-step restriction  independent of the stiff term , under mild assumptions on the operators.
Revised:  We derive their order conditions up to third order, and show that such methods can preserve positivity (and more generally strong stability) with a time-step restriction is independent of the stiff term , under mild assumptions on the operators.
Edit intent: clarity
Original:  We derive their order conditions up to third order, and show that such methods can preserve positivity (and more generally strong stability) with a time-step restriction  independent of the stiff term , under mild assumptions on the operators. We present sufficient conditionsunder which such methods are positivity preserving and asymptotic preserving (AP) when applied to a range of problems, including a hyperbolic relaxation system, the Broadwell model, and the Bhatnagar-Gross-Krook (BGK) kinetic equation . Previous efforts to devise such methods have used an IMEX Runge--Kutta framework plus a second derivative final correction.
Revised:  We derive their order conditions up to third order, and show that such methods can preserve positivity (and more generally strong stability) with a time-step restriction independent of the stiff term . The unconditional SSP property for a method of order p>2 is unique among SSP methods, and depends on a backward-in-time assumption on the derivative of the operator. We show that this backward derivative condition is satisfied in many relevant cases where SSP IMEX schemes are desired. We devise unconditionally SSP implicit Runge--Kutta schemes of order up to p=4, and IMEX Runge--Kutta schemes of order up to p=3. For the multi-derivative IMEX schemes, we also derive and present the order conditions, which have not appeared previously. The unconditional SSP condition ensures that these methods are positivity preserving and asymptotic preserving (AP) when applied to a range of problems, including a hyperbolic relaxation system, the Broadwell model, and the Bhatnagar-Gross-Krook (BGK) kinetic equation . Previous efforts to devise such methods have used an IMEX Runge--Kutta framework plus a second derivative final correction.
Edit intent: meaning-changed
Original:  We present sufficient conditionsunder which such methods are positivity preserving and asymptotic preserving (AP) when applied to a range of problems, including a hyperbolic relaxation system, the Broadwell model, and the Bhatnagar-Gross-Krook (BGK) kinetic equation . Previous efforts to devise such methods have used an IMEX Runge--Kutta framework plus a second derivative final correction.
Revised:  We present sufficient conditionsunder which such methods are positivity preserving , and we present sufficient conditions under which such methods are also asymptotic preserving when applied to a range of problems, including a hyperbolic relaxation system, the Broadwell model, and the Bhatnagar-Gross-Krook (BGK) kinetic equation . Previous efforts to devise such methods have used an IMEX Runge--Kutta framework plus a second derivative final correction.
Edit intent: clarity
Original:  We present sufficient conditionsunder which such methods are positivity preserving and asymptotic preserving (AP) when applied to a range of problems, including a hyperbolic relaxation system, the Broadwell model, and the Bhatnagar-Gross-Krook (BGK) kinetic equation . Previous efforts to devise such methods have used an IMEX Runge--Kutta framework plus a second derivative final correction. In this work, we extend this approach to include derivative information at any stage of the computation. This multi-derivative IMEX approach allowed us to find a second order AP and positivity preserving method that improves upon previous work in terms of the allowable time-step size. Furthermore, this approach produces a third order method that is AP and positivity preserving for a time-step independent of the stiff term, a feature not possessed by any of the existing third-order IMEX schemes .
Revised:  We present sufficient conditionsunder which such methods are positivity preserving and asymptotic preserving (AP) when applied to a range of problems, including a hyperbolic relaxation system, the Broadwell model, and the Bhatnagar-Gross-Krook (BGK) kinetic equation .
Edit intent: clarity
Original:  We examine the contact statistics of noninteracting random walkers on a two-dimensional plane  .
Revised: The interaction between individuals in biological populations, dilute components of chemical systems, or particles transported by turbulent flows depends critically on their contact statistics. This work clarifies those statistics under the simplifying assumptions that the underlying motions approximate a Brownian random walk and that the particles can be treated as weakly interacting. We examine the contact statistics of noninteracting random walkers on a two-dimensional plane .
Edit intent: meaning-changed
Original:  We examine the contact statistics of noninteracting random walkers on a two-dimensional plane  .
Revised:  We examine the contact statistics of noninteracting random walkers on a two-dimensional plane , as a function of the population number density, walker radius, and random-walk step size. The mean-free-collision and the ballistic-crossing times are key parameters. The contact-interval is exponentially distributed for times longer than the mean-free-collision time but not for times shorter than that, and the contact duration distribution is strongly peak at the ballistic-crossing time for head-on collisions, when the ballistic-crossing time is short compared to the mean step duration .
Edit intent: meaning-changed
Original:  Further, contact duration depends sensitively on walker radius. For walker radii smaller than both the mean step length and the mean nearest neighbor separation, the probability density of the contact duration is strongly peaked at the ballistic crossing time for head-on collisions. The contact statistics of individuals in biological populations, dilute components of chemical systems , or Lagrangian particles in turbulent flows depends critically on the behavior at close proximity , whether it is attractive, repulsive, or neutral. This work clarifies those statistics for the neutral case, under the assumption that the underlying motions approximate a collection of random walkers, and we suggest it may be useful in understanding contagion in human populations .
Revised:  This leads to a negative duration dependence of the waiting-time interval and over dispersion of the contact-count probability density function for all time intervals. The results presented are most relevant to systems in which particle proximity is critical and contact results in no change (or a low probability of change) in the particles' motions, or to systems in which multiple contact encounters are required before interaction .
Edit intent: clarity
Original: This paper develops an inherently parallelised, fast, approximate learning-based solution to the generic class of Capacitated Vehicle Routing  with Time Windows and Dynamic Routing (CVRP-TWDR).
Revised: This paper develops an inherently parallelised, fast, approximate learning-based solution to the generic class of Capacitated Vehicle Routing Problems with Time Windows and Dynamic Routing (CVRP-TWDR).
Edit intent: meaning-changed
Original:  We show that the solutions produced by this method on standard datasets are significantly faster than exact formulations and state-of-the-art meta-heuristics, while being reasonably close to optimal in terms of solution quality.
Revised:  We show that the solutions produced by this method are significantly faster than exact formulations and state-of-the-art meta-heuristics, while being reasonably close to optimal in terms of solution quality.
Edit intent: clarity
Original:  In this paper, we address a very challenging and previously underexplored version of this domain adaptation problem . In our setup an algorithm is trained on several source domains, and then applied to examples from an unseen domain that is unknown at training time.
Revised:  In this paper, we address a very challenging and previously underexplored version of this domain adaptation problem , where an algorithm is trained on several source domains, and then applied to examples from an unseen domain that is unknown at training time.
Edit intent: coherence
Original:  In experiments with two tasks : Rumour Detection and Multi-Genre Natural Language Inference (MNLI ), for a total of 10 multi-source adaptation scenarios, PADA strongly outperforms state-of-the-art approaches and additional strong baselines.
Revised:  In experiments with 3 tasks (text classification and sequence tagging ), for a total of 10 multi-source adaptation scenarios, PADA strongly outperforms state-of-the-art approaches and additional strong baselines.
Edit intent: meaning-changed
Original:  In experiments with two tasks : Rumour Detection and Multi-Genre Natural Language Inference (MNLI ), for a total of 10 multi-source adaptation scenarios, PADA strongly outperforms state-of-the-art approaches and additional strong baselines.
Revised:  In experiments with two tasks : Rumour Detection and Multi-Genre Natural Language Inference (MNLI ), for a total of 14 multi-source adaptation scenarios, PADA strongly outperforms state-of-the-art approaches and additional strong baselines.
Edit intent: meaning-changed
Original:  In experiments with two tasks : Rumour Detection and Multi-Genre Natural Language Inference (MNLI ), for a total of 10 multi-source adaptation scenarios, PADA strongly outperforms state-of-the-art approaches and additional strong baselines.
Revised:  In experiments with two tasks : Rumour Detection and Multi-Genre Natural Language Inference (MNLI ), for a total of 10 multi-source adaptation scenarios, PADA substantially outperforms strong baselines.
Edit intent: clarity
Original: This study provides an in-depth analysis of a Twitter dataset around AstraZeneca COVID vaccine development released as a part of Grand Challenge, North American Social Network Conference, 2021. In brief, we show : i) the presence of malicious and low credibility information sources shared on Twitter messages in multiple languages , ii) the malicious URLs, often in shortened forms, are increasingly hosted in content delivery networks and shared cloud hosting infrastructures not only to improve reach but also to avoid being detected and blocked , iii) potential signs of coordination to promote both malicious and low credibility URLs on Twitter.
Revised: We investigate the link sharing behavior of Twitter users following the temporary halt of AstraZeneca COVID-19 vaccine development in September 2020. During this period, we show the presence of malicious and low credibility information sources shared on Twitter messages in multiple languages , ii) the malicious URLs, often in shortened forms, are increasingly hosted in content delivery networks and shared cloud hosting infrastructures not only to improve reach but also to avoid being detected and blocked , iii) potential signs of coordination to promote both malicious and low credibility URLs on Twitter.
Edit intent: meaning-changed
Original:  In brief, we show : i) the presence of malicious and low credibility information sources shared on Twitter messages in multiple languages , ii) the malicious URLs, often in shortened forms, are increasingly hosted in content delivery networks and shared cloud hosting infrastructures not only to improve reach but also to avoid being detected and blocked , iii) potential signs of coordination to promote both malicious and low credibility URLs on Twitter.
Revised:  In brief, we show : i) the presence of malicious and low credibility information sources shared on Twitter messages in multiple languages . The malicious URLs, often in shortened forms, are increasingly hosted in content delivery networks and shared cloud hosting infrastructures not only to improve reach but also to avoid being detected and blocked , iii) potential signs of coordination to promote both malicious and low credibility URLs on Twitter.
Edit intent: fluency
Original:  In brief, we show : i) the presence of malicious and low credibility information sources shared on Twitter messages in multiple languages , ii) the malicious URLs, often in shortened forms, are increasingly hosted in content delivery networks and shared cloud hosting infrastructures not only to improve reach but also to avoid being detected and blocked , iii) potential signs of coordination to promote both malicious and low credibility URLs on Twitter.
Revised:  In brief, we show : i) the presence of malicious and low credibility information sources shared on Twitter messages in multiple languages , ii) the malicious URLs, often in shortened forms, are increasingly hosted in content delivery networks and shared cloud hosting infrastructures not only to improve reach but also to avoid being detected and blocked . There are potential signs of coordination to promote both malicious and low credibility URLs on Twitter.
Edit intent: coherence
Original:  Then, based on the three-dimensional (3D) interaction characteristics of VR devices, we propose two vrCAPTCHAs design prototypes (i.e., task-driven and bodily motion-based CAPTCHAs).
Revised:  Then, based on the three-dimensional (3D) interaction characteristics of VR devices, we propose two vrCAPTCHA design prototypes (i.e., task-driven and bodily motion-based CAPTCHAs).
Edit intent: fluency
Original:  Through extensive experimentation, we show that the proposed strategies out-perform the existing state-of-the-art methods on the FLIR-Thermal dataset, improving the mAP up-to 25.2\%.
Revised:  Through extensive experimentation, we show that the proposed strategies outperform the existing state-of-the-art methods on the FLIR-Thermal dataset, improving the mAP up-to 25.2\%.
Edit intent: clarity
Original:  Through extensive experimentation, we show that the proposed strategies out-perform the existing state-of-the-art methods on the FLIR-Thermal dataset, improving the mAP up-to 25.2\%. We also propose a new "r-blended" hybrid depth modality for RGB-D multi-modal detection tasks. Our proposed method also obtained promising results on the SUNRGB-D dataset.
Revised:  Through extensive experimentation, we show that the proposed strategies out-perform the existing state-of-the-art methods on the FLIR-Thermal dataset, obtain promising results on the SUNRGB-D dataset.
Edit intent: coherence
Original:  Efficient fusion strategies for multi-sensor configurations can enhance the robustness of the detection algorithms by exploiting redundancyfrom different sensor streams. In this paper, we propose sensor-aware multi-modal fusion strategiesfor 2D object detection in harsh lighting conditions.
Revised:  Single-modal strategies are insufficient when the sensor fails to acquire information due to malfunction or its design limitations. Multi-sensor configurations are known to provide redundancy, increase reliability, and are crucial in achieving robustness against asymmetric sensor failures. To address the issue of changing lighting conditions and asymmetric sensor degradation in object detection, we develop a multi-modal 2D object detection in harsh lighting conditions.
Edit intent: meaning-changed
Original:  In this paper, we propose sensor-aware multi-modal fusion strategiesfor 2D object detection in harsh lighting conditions. Our network learns to estimate the measurement reliability of each sensor modality in the form of scalar weightsand masks, without prior knowledge of the sensor characteristics. The obtained weights are assigned to the extracted feature maps which are subsequently fused and passed to the transformer encoder-decoder network for object detection . This is critical in the case of asymmetric sensor failures and to prevent any severe consequences .
Revised:  In this paper, we propose sensor-aware multi-modal fusion strategiesfor 2D object detector, and propose deterministic and stochastic sensor-aware feature fusion strategies .
Edit intent: coherence
Original:   We also propose a new "r-blended" hybrid depth modality for RGB-D multi-modal detection tasks .
Revised:  The proposed fusion mechanisms are driven by the estimated sensor measurement reliability values/weights. Reliable object detection in harsh lighting conditions is essential for applications such as self-driving vehicles and human-robot interaction. We also propose a new "r-blended" hybrid depth modality for RGB-D multi-modal detection tasks .
Edit intent: meaning-changed
Original:  Through extensive experimentation, we show that the proposed strategies outperform the existing state-of-the-art methods on the FLIR-Thermal dataset,  obtain promising results on the SUNRGB-D dataset  .
Revised:  Through extensive experimentation, we show that the proposed strategies outperform the existing state-of-the-art methods on the FLIR-Thermal dataset, and obtain promising results on the SUNRGB-D dataset .
Edit intent: coherence
Original:  Through extensive experimentation, we show that the proposed strategies outperform the existing state-of-the-art methods on the FLIR-Thermal dataset,  obtain promising results on the SUNRGB-D dataset  .
Revised:  Through extensive experimentation, we show that the proposed strategies outperform the existing state-of-the-art methods on the FLIR-Thermal dataset, obtain promising results on the SUNRGB-D dataset . We additionally record a new RGB-Infra indoor dataset, namely L515-Indoors, and demonstrate that the proposed object detection methodologies are highly effective for a variety of lighting conditions .
Edit intent: meaning-changed
Original:  Iterative refinement for MAPF is desirable for three reasons: 1)  optimization is intractable, 2)  sub-optimal solutions can be obtained instantly, and 3)  it is anytime planning, desired in online scenarios where time for deliberation is limited.
Revised:  Iterative refinement for MAPF is desirable for three reasons: 1) ~ optimization is intractable, 2) sub-optimal solutions can be obtained instantly, and 3) it is anytime planning, desired in online scenarios where time for deliberation is limited.
Edit intent: fluency
Original:  Iterative refinement for MAPF is desirable for three reasons: 1)  optimization is intractable, 2)  sub-optimal solutions can be obtained instantly, and 3)  it is anytime planning, desired in online scenarios where time for deliberation is limited.
Revised:  Iterative refinement for MAPF is desirable for three reasons: 1) optimization is intractable, 2) ~ sub-optimal solutions can be obtained instantly, and 3) it is anytime planning, desired in online scenarios where time for deliberation is limited.
Edit intent: fluency
Original:  Iterative refinement for MAPF is desirable for three reasons: 1)  optimization is intractable, 2)  sub-optimal solutions can be obtained instantly, and 3)  it is anytime planning, desired in online scenarios where time for deliberation is limited.
Revised:  Iterative refinement for MAPF is desirable for three reasons: 1) optimization is intractable, 2) sub-optimal solutions can be obtained instantly, and 3) ~ it is anytime planning, desired in online scenarios where time for deliberation is limited.
Edit intent: fluency