wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Higher \psi is found in highly disassortative networks, which provides an explanation on why disassortative networks may be better at suppressing epidemics. Furthermore, We find that \psi has a monotonically decreasing relationship with cumulative incidence, indicating that higher \psi corresponds to lower cumulative incidence .
Revised:  Higher \psi is found in highly disassortative networks, however, the suppression effect diminishes over time due to scattering of non-vaccinating nodes, and frequent switching between the predominantly vaccinating and non-vaccinating phases of the dynamics .
Edit intent: meaning-changed
Original: This article describes a simple model of market microstructure which explains a concave price impact . In the proposed model , the local relationship between the order flow and the fundamental price (i.e. the local price impact) is linear,  which makes the model dynamically consistent.
Revised: This article provides a simple explanation of the asymptotic concavity of the price impact of a meta-order via the microstructural properties of the market. This explanation is made more precise by a model in which the local relationship between the order flow and the fundamental price (i.e. the local price impact) is linear, which makes the model dynamically consistent.
Edit intent: meaning-changed
Original:  We find that, in repeated call auctions , nonstrategic bidding leads to a sequence of allocations that converges to individually rational Pareto allocations.
Revised:  We find that, under nonstrategic bidding, the double auction clears with zero trades precisely when the agents' current holdings are on the Pareto frontier. More interestingly, the double auctions implement Adam Smith's "invisible hand" in the sense that, when starting from disequilibrium, repeated double auctions lead to a sequence of allocations that converges to individually rational Pareto allocations.
Edit intent: meaning-changed
Original:  This model allows us to obtain semi-explicit solutions for the insurance contract and is applied to the context of fuel poverty  .
Revised:  This model allows us to obtain semi-explicit solutions for the insurance contract and is applied to the context of fuel poverty . For this application, our model allows to conclude that, even in the least efficient scenario from the households point of view, i.e., when the insurance is provided by a monopoly, this mechanism improves significantly the living conditions of the riskiest households by ensuring them a sufficient consumption of energy .
Edit intent: meaning-changed
Original:  For this application, our model allows to conclude that, even in the least efficient scenario from the households point of view, i.e., when the insurance is provided by a monopoly, this mechanism improves significantly the living conditions of the riskiest households by ensuring them a sufficient consumption of energy  .
Revised:  For this application, our model allows to conclude that, even in the least efficient scenario from the households point of view, i.e., when the insurance is provided by a monopoly, this mechanism decreases significantly the risk of fuel poverty of households by ensuring them a sufficient consumption of energy .
Edit intent: meaning-changed
Original:  For this application, our model allows to conclude that, even in the least efficient scenario from the households point of view, i.e., when the insurance is provided by a monopoly, this mechanism improves significantly the living conditions of the riskiest households by ensuring them a sufficient consumption of energy  .
Revised:  For this application, our model allows to conclude that, even in the least efficient scenario from the households point of view, i.e., when the insurance is provided by a monopoly, this mechanism improves significantly the living conditions of the riskiest households by ensuring them a sufficient consumption of energy . The effectiveness of in-kind insurance is highlighted through a comparison with income insurance, but our results nevertheless underline the need to regulate such insurance market .
Edit intent: meaning-changed
Original:  Although bus ridership is declining across neighborhood characteristics, these results suggest that the underlying cause  must be primarily affecting the travel behavior of white bus riders . Shifts in neighborhood socio-demographics, however, were found to be modest and unlikely to be causing the nation-wide ridership crisis.
Revised:  Although bus ridership is declining across neighborhood characteristics, these results suggest that the underlying cause of bus ridership decline must be primarily affecting the travel behavior of white bus riders . Shifts in neighborhood socio-demographics, however, were found to be modest and unlikely to be causing the nation-wide ridership crisis.
Edit intent: clarity
Original:  Although bus ridership is declining across neighborhood characteristics, these results suggest that the underlying cause  must be primarily affecting the travel behavior of white bus riders . Shifts in neighborhood socio-demographics, however, were found to be modest and unlikely to be causing the nation-wide ridership crisis. Only in Miami is the proportion of white residents near the most frequent parts of the bus network increasing. There, demographic shifts may be contributing to the overall decline in bus ridership .
Revised:  Although bus ridership is declining across neighborhood characteristics, these results suggest that the underlying cause must be primarily affecting the travel behavior of white bus riders .
Edit intent: coherence
Original:  Here, we examine and explain some non-straight-line walking phenomena from an energy minimization perspective. Using human subject experiments, we show that the metabolic rate while walking in circles increases with decreasing radius for fixed speed.
Revised:  Here, we examine and explain some non-straight-line walking phenomena are predicted by including an energy cost for turning. We quantified the cost of turning in humans, showing that the metabolic rate while walking in circles increases with decreasing radius for fixed speed.
Edit intent: meaning-changed
Original:  We show that this increase in energy cost for turning has behavioral implications, specifically explaining a variety of human : to save energy, we predict that humans should walk slower in smaller circles, slow down when path curvature increases when traveling along more complex curves, turn in placearound a particular optimal angular speed, and avoid sharp turns but use smooth gentle turns while navigating around obstacles or while needing to turnwhile walking . We then tested these behavioral predictions against additional behavioral experiments we performed and existing movement data from previous studies, finding that human behavior in these experiments are consistent with minimizing, at least approximately , the energy cost of locomotion subject to the relevant task constraints .
Revised:  We then used this metabolic cost to mathematically predict energy-optimal movement patterns for five tasks of varying complexity: walking in circles, turning in place, walking through an angled corridor, walking freely from point to point while having to turn, and walking through doors while maneuvering around obstacles. In these tasks, humans moved at speeds and paths approximately predicted by energy optima. Thus, we provide a unified theoretical account that predicts diverse curvilinear locomotor phenomena .
Edit intent: clarity
Original:  We also derive how volatility swaps can be hedged using  only variance swaps without making use of a specific stochastic volatility model .
Revised:  We also derive how volatility swaps can be hedged using a strip of vanilla options with weights that are directly related to trading intuition. Additionally, we derive first and second order hedges for volatility swaps using only variance swaps without making use of a specific stochastic volatility model .
Edit intent: meaning-changed
Original:  We assume that the convergence of the two methods can complement with each other, so that the model could be trained more accurately with less labelled data, and active learning method could enhance transfer learning method to accurately select the minimum data samples for iterative learning. However, in real applications we found this approach is challenging because the sample selectionof traditional active learning strategy merely depends on the final probability value of its model output, and this makes it quite difficult to evaluate the quality of the selected data samples .
Revised:  In real applications we found existing uncertainty-based active learning strategies have two shortcomings. Firstly, these strategies prefer to choose long sequence explicitly or implicitly, which increase the annotation burden of annotators. Secondly, some strategies need to invade the model and modify to generate some additional information for sample selection, which will increase the workload of the developer and increase the training/prediction time of the model .
Edit intent: meaning-changed
Original:  Then we propose an uncertainty-based active learning strategy called Lowest Token Probability (LTP) which considers not only the final output but also the intermediate results .
Revised:  Then we propose an uncertainty-based active learning strategy called Lowest Token Probability (LTP) which combines the input and output of CRF to select informative instance. LTP is simple and powerful strategy that does not favor long sequences and does not need to invade the model .
Edit intent: meaning-changed
Original:  We test LTP on multiple datasets, and the experiments show that LTP performs  better than traditional strategies (incluing LC and NLC) on both token-level F_1 and sentence-level accuracy , especially in complex imbalanced datasets.
Revised:  We test LTP on multiple datasets, and the experiments show that LTP performs slightly better than traditional strategies (incluing LC and NLC) on both token-level F_1 and sentence-level accuracy , especially in complex imbalanced datasets.
Edit intent: meaning-changed
Original:  We test LTP on multiple datasets, and the experiments show that LTP performs  better than traditional strategies (incluing LC and NLC) on both token-level F_1 and sentence-level accuracy , especially in complex imbalanced datasets.
Revised:  We test LTP on multiple datasets, and the experiments show that LTP performs better than traditional strategies with obviously less annotation tokens on both sentence-level accuracy , especially in complex imbalanced datasets.
Edit intent: meaning-changed
Original:  We test LTP on multiple datasets, and the experiments show that LTP performs  better than traditional strategies (incluing LC and NLC) on both token-level F_1 and sentence-level accuracy , especially in complex imbalanced datasets.
Revised:  We test LTP on multiple datasets, and the experiments show that LTP performs better than traditional strategies (incluing LC and NLC) on both token-level F_1 and sentence-level accuracy and entity-level F1-score. Related code have been release on URL
Edit intent: meaning-changed
Original:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies  such as cyclic  exhaustive, gated andl -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Revised:  We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies such as cyclic exhaustive, gated andl -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Edit intent: meaning-changed
Original:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies  such as cyclic  exhaustive, gated andl -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Revised:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies in the queueing literature, such as cyclic exhaustive, gated andl -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Edit intent: meaning-changed
Original:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies  such as cyclic  exhaustive, gated andl -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Revised:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies such as cyclic policies with exhaustive, gated andl -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Edit intent: clarity
Original:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies  such as cyclic  exhaustive, gated andl -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Revised:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies such as cyclic exhaustive, gated l -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Edit intent: fluency
Original:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies  such as cyclic  exhaustive, gated andl -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Revised:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies such as cyclic exhaustive, gated and -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Edit intent: fluency
Original:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies  such as cyclic  exhaustive, gated andl -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Revised:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies such as cyclic exhaustive, gated andl or l-limited service disciplines for polling systems .
Edit intent: clarity
Original:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies  such as cyclic  exhaustive, gated andl -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems . We show that any policy with (1) purely static, (2) queue-length based or (3) job-processing-time based routing discipline does not have a competitive ratio smaller than k, where k is the number of queues. Finally, a mixed strategy is provided for a practical scenario where setup time is large but bounded .
Revised:  We provide conditions for the existence of constant competitive ratio for this system, and also the competitive ratios for several well-studied policies such as cyclic exhaustive, gated andl -limited policies, Stochastic Largest Queue policy, One Machine policy and Gittins Index policy for polling systems .
Edit intent: coherence
Original:  We perform a 5-month long experiment dubbed "smartSDH" (carried out in 27 employees' office space) where users report their preferences for the brightness of overhead lighting. smartSDH implements a modified Vickrey-Clarke-Groves (VCG) mechanism;
Revised:  We perform a 5-month long experiment dubbed 'smartSDH' (carried out in 27 employees' office space) where users report their preferences for the brightness of overhead lighting. smartSDH implements a modified Vickrey-Clarke-Groves (VCG) mechanism;
Edit intent: fluency
Original:  assuming users are rational, it incentivizes truthful reporting, implements the socially desirable outcome, and compensates participants to ensure higher payoffs under smartSDH when compared with the default outside option . smartSDH assesses the feasibility of the VCG mechanism in the context of smart building control and evaluated smartSDH's effect using metrics such as light level satisfaction, incentive satisfaction, and energy consumption.
Revised:  assuming users are rational, it incentivizes truthful reporting, implements the socially desirable outcome, and compensates participants to ensure higher payoffs under smartSDH when compared with the default outside option (i.e., the option chosen in the absence of such a mechanism). smartSDH assesses the feasibility of the VCG mechanism in the context of smart building control and evaluated smartSDH's effect using metrics such as light level satisfaction, incentive satisfaction, and energy consumption.
Edit intent: meaning-changed
Original:  While there exist a multitude of methods for trajectory forecasting, many of them have only been evaluated with one semantic class of agents and only use prior trajectory information , ignoring a plethora of information available online to autonomous systems from common sensors .
Revised:  While there exist many methods for trajectory forecasting, many of them have only been evaluated with one semantic class of agents and only use prior trajectory information , ignoring a plethora of information available online to autonomous systems from common sensors .
Edit intent: fluency
Original:  Towards this end, we present Trajectron++, a modular, graph-structured recurrent model that forecasts the trajectories of a general number of agents with distinct semantic classes while incorporating heterogeneous data (e.g. semantic maps and camera images).
Revised:  Towards this end, we present Trajectron++, a modular, graph-structured recurrent model that forecasts the trajectories of a general number of diverse agents while incorporating agent dynamics and heterogeneous data (e.g. semantic maps and camera images).
Edit intent: clarity
Original:  Towards this end, we present Trajectron++, a modular, graph-structured recurrent model that forecasts the trajectories of a general number of agents with distinct semantic classes while incorporating heterogeneous data (e.g. semantic maps and camera images). Our model is designed to be tightly integrated with robotic planning and control frameworks;
Revised:  Towards this end, we present Trajectron++, a modular, graph-structured recurrent model that forecasts the trajectories of a general number of agents with distinct semantic classes while incorporating heterogeneous data (e.g. , semantic maps). Trajectron++ is designed to be tightly integrated with robotic planning and control frameworks;
Edit intent: coherence
Original:  Yet the discrete metric structure of shortest path lengths in a network , known as chemical distances, is definitely not the only reservoir of geometric distances that characterize many networks. The other forms of network-related geometries are the geometry of continuous latent spaces underlying many networks, and the effective geometry induced by dynamical processes in networks.
Revised:  Yet the discrete metric structure of shortest path lengths in a network , known as chemical distances, is definitely not its only geometry. Other forms of network geometry are the geometry of continuous latent spaces underlying many networks, and the effective geometry induced by dynamical processes in networks.
Edit intent: clarity
Original:  A solid and rapidly growing amount of evidence shows that the three approaches are intimately related. Network geometry is immensely efficient in discovering hidden symmetries, such as scale-invariance, and other fundamental physical and mathematical properties of networks, as well as in a variety of practical applications, ranging from the understanding how the brain works, to routing in the Internet.
Revised:  These three approaches to network geometry are all intimately related, and all three of them have been found to be exceptionally efficient in discovering hidden symmetries, such as scale-invariance, and other fundamental physical and mathematical properties of networks, as well as in a variety of practical applications, ranging from the understanding how the brain works, to routing in the Internet.
Edit intent: clarity
Original:  Network geometry is immensely efficient in discovering hidden symmetries, such as scale-invariance, and other fundamental physical and mathematical properties of networks, as well as in a variety of practical applications, ranging from the understanding how the brain works, to routing in the Internet.
Revised:  Network geometry is immensely efficient in discovering fractality, scale-invariance, and other fundamental physical and mathematical properties of networks, as well as in a variety of practical applications, ranging from the understanding how the brain works, to routing in the Internet.
Edit intent: meaning-changed
Original:  Network geometry is immensely efficient in discovering hidden symmetries, such as scale-invariance, and other fundamental physical and mathematical properties of networks, as well as in a variety of practical applications, ranging from the understanding how the brain works, to routing in the Internet.
Revised:  Network geometry is immensely efficient in discovering hidden symmetries, such as scale-invariance, self-similarity, and other forms of fundamental symmetries in networks. Network geometry is also of great utility in a variety of practical applications, ranging from the understanding how the brain works, to routing in the Internet.
Edit intent: clarity
Original:  However, they fail to account for another fundamental aspect of human language: Because languages are transmitted from generation to generation, they have to be learnable by new language users, which makes them subject to cultural evolution.
Revised:  However, they do not take into account a second constraint considered to be fundamental for the shape of human language: Because languages are transmitted from generation to generation, they have to be learnable by new language users, which makes them subject to cultural evolution.
Edit intent: clarity
Original:  However, they fail to account for another fundamental aspect of human language: Because languages are transmitted from generation to generation, they have to be learnable by new language users, which makes them subject to cultural evolution. Recent work has shown that incorporating cultural evolution in referential game results in considerable improvements in the properties of the languages that emerge in the game .
Revised:  However, they fail to account for another fundamental aspect of human language: Because languages are transmitted from generation to generation, they have to be learnable by new language learners. Cogswell et al. (2019) introduced cultural transmission within referential games through a changing population of agents to constrain the emerging language to be learnable. However, the resulting languages remain inherently biased by the agents' underlying capabilities .
Edit intent: clarity