wanyu/IteraTeR_full_sent huggingface dataset:
Original: We revisit mean-risk portfolio selection in a one-period financial market where risk is quantified by a positively homogeneous risk measure \rho on L^1 . We first show that under mild assumptions, the set of optimal portfolios for a fixed return is nonempty and compact.
Revised: We revisit mean-risk portfolio selection in a one-period financial market where risk is quantified by a positively homogeneous risk measure \rho . We first show that under mild assumptions, the set of optimal portfolios for a fixed return is nonempty and compact.
Edit intent: clarity
Original:  We show that the presence or absence of regulatory arbitrage for \rho is intimately linked to the interplay between the set of equivalent martingale measures (EMMs) for the discounted risky assets and the set of absolutely continuous measures in the dual representation of \rho.
Revised:  We show that the absence of \rho-arbitrage is intimately linked to the interplay between the set of equivalent martingale measures (EMMs) for the discounted risky assets and the set of absolutely continuous measures in the dual representation of \rho.
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 \frac{\text{d}\mathbb{Q}}{\text{d}\mathbb{P}} \Vert _{\infty < \frac{1}{\alpha}.
Revised:  A special case of our result shows that the market does not admit \rho-arbitrage for Expected Shortfall at level \alpha if and only if there exists an EMM Q \approx P such that \Vert \frac{\text{d}\mathbb{Q}}{\text{d}\mathbb{P}} \Vert _{\infty < \frac{1}{\alpha}.
Edit intent: meaning-changed
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 \frac{\text{d}\mathbb{Q}}{\text{d}\mathbb{P}} \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 \frac{\text{d}\mathbb{Q}}{\text{d}\mathbb{P}} \Vert _\infty < \frac{1}{\alpha}.
Edit intent: fluency
Original:  Experimental results show that our proposed method (i) improves overall performance with more than 3\% accuracy points compared to previous state-of-the-art, and with over 18 \% points on a subset of problems that require more complex reasoning, and (ii) outperforms sequential LSTMs by 4\% accuracy points on such more complex problems.
Revised:  Experimental results show that our proposed method (i) improves overall performance with more than 3\% accuracy points compared to previous state-of-the-art, and with over 15 \% points on a subset of problems that require more complex reasoning, and (ii) outperforms sequential LSTMs by 4\% accuracy points on such more complex problems.
Edit intent: meaning-changed
Original:  We demonstrate the technique by collecting commonsense knowledge that surrounds three fairly universal rituals---coming-of-age, marriage, and funerals---across three different national groups: the United States , India, and the Philippines.
Revised:  We demonstrate the technique by collecting commonsense knowledge that surrounds six fairly universal rituals---birth, coming-of-age, marriage, funerals, new year, and birthdays---across two national groups: the United States , India, and the Philippines.
Edit intent: meaning-changed
Original:  We demonstrate the technique by collecting commonsense knowledge that surrounds three fairly universal rituals---coming-of-age, marriage, and funerals---across three different national groups: the United States , India, and the Philippines. Our pilot study expands the different types of relationships identified by existing work in the field of commonsense reasoning for commonplace events, and uses these new types to gather information that distinguishes the knowledge of the different groups.
Revised:  We demonstrate the technique by collecting commonsense knowledge that surrounds three fairly universal rituals---coming-of-age, marriage, and funerals---across three different national groups: the United States and India. Our study expands the different types of relationships identified by existing work in the field of commonsense reasoning for commonplace events, and uses these new types to gather information that distinguishes the knowledge of the different groups.
Edit intent: meaning-changed
Original:  We demonstrate the technique by collecting commonsense knowledge that surrounds six fairly universal rituals---birth , coming-of-age, marriage, funerals, new year, and birthdays---across two national groups: the United States and India.
Revised:  We demonstrate the technique by collecting commonsense knowledge that surrounds six fairly universal rituals -- birth , coming-of-age, marriage, funerals, new year, and birthdays---across two national groups: the United States and India.
Edit intent: fluency
Original:  We demonstrate the technique by collecting commonsense knowledge that surrounds six fairly universal rituals---birth , coming-of-age, marriage, funerals, new year, and birthdays---across two national groups: the United States and India.
Revised:  We demonstrate the technique by collecting commonsense knowledge that surrounds six fairly universal rituals---birth , coming-of-age, marriage, funerals, new year, and birthdays -- across two national groups: the United States and India.
Edit intent: fluency
Original:  Our study expands the different types of relationships identified by existing work in the field of commonsense reasoning for commonplace events, and uses these new types to gather information that distinguishes the knowledge of the different groups .
Revised:  Our study expands the different types of relationships identified by existing work in the field of commonsense reasoning for commonplace events, and uses these new types to gather information that distinguish the identity of the groups providing the knowledge .
Edit intent: clarity
Original: Emergent behavior of particles on a lattice has been analyzed extensively in mathematics with possible analogies to physical phenomena such as clustering in colloidal systems. While there exists a rich pool of interesting results, most are yet to be explored physically due to the lack of experimental validation. Here we show how the individual moves of robotic agents are tightly mapped to a discrete algorithm and the emergent behaviors such as clustering are as predicted by the analysis of this algorithm. Taking advantage of the algorithmic perspective, we further designed robotic controls to manipulate the clustering behavior and show the potential for useful applications such as the transport of obstacles .
Revised: Active matter physics and swarm robotics have provided powerful tools for the study and control of ensembles driven by internal sources. At the macroscale, controlling swarms typically utilizes significant memory, processing power, and coordination unavailable at the microscale, e.g., for colloidal robots, which could be useful for fighting disease, fabricating intelligent textiles, and designing nanocomputers. To develop principles that that can leverage physics of interactions and thus can be utilized across scales, we take a two-pronged approach: a theoretical abstraction of URLanizing particle systems and an experimental robot system of active cohesive granular matter that intentionally lacks digital electronic computation and communication, using minimal (or no) sensing and control, to test theoretical predictions. We consider the problems of aggregation, dispersion, and collective transport. As predicted by the theory, as a parameter representing interparticle attraction increases, the robots transition from a dispersed phase to an aggregated one, forming a dense, compact collective. When aggregated, the collective can transport non-robot "impurities" in their environment, thus performing an emergent task driven by the physics underlying the transition. These results point to a fruitful interplay between algorithm design and active matter robophysics that can result in new nonequilibrium physics and principles for programming collectives without the need for complex algorithms or capabilities .
Edit intent: meaning-changed
Original: Based on a simple analysis of the reports of Sant\'e Public France , we show that the real incidence during the second wave of the Covid-19 outbreak is around 60\% of the mean positivity of virological tests realized week after week in France.
Revised: Large scale virological testing of SARS-Cov2 is implemented since May 2020 in France. We assume that the positivity of asymptomatic people not being contact cases (ANBC) is representative of the positivity of the whole French population, which allows estimating the real incidence. We estimate, using Sant\'e Public France , we show that the real incidence during the second wave of the Covid-19 outbreak is around 60\% of the mean positivity of virological tests realized week after week in France.
Edit intent: meaning-changed
Original: Based on a simple analysis of the reports of Sant\'e Public France , we show that the real incidence during the second wave of the Covid-19 outbreak is around 60\% of the mean positivity of virological tests realized week after week in France.
Revised: Based on a simple analysis of the reports of Sant\'e Public France reports, that the Covid-19 outbreak is around 60\% of the mean positivity of virological tests realized week after week in France.
Edit intent: clarity
Original: Based on a simple analysis of the reports of Sant\'e Public France , we show that the real incidence during the second wave of the Covid-19 outbreak is around 60\% of the mean positivity of virological tests realized week after week in France. The fraction of the French population infected at the beginning of September is about 3\% (2 million people ).
Revised: Based on a simple analysis of the reports of Sant\'e Public France , we show that the real incidence during the second wave of the incidence at the beginning of August was about 0.8\% and rose to about 2.4\% of the total population at the beginning of September is about 3\% (2 million people ).
Edit intent: meaning-changed
Original:  The fraction of the French population infected at the beginning of September is about 3\% (2 million people ). Both intensive care units (ICU) admission and death rate , which dropped by more than one order of magnitude since March, are currently 0.017\% and 0.015 \% respectively.
Revised:  The fraction of the French population infected at the beginning of September . This corresponds to about 1.6 million people simultaneously infected and 230.000 new infections each day. These evaluations allow to deduce that intensive care units (ICU) admission and death rate , which dropped by more than one order of magnitude since March, are currently 0.017\% and 0.015 \% respectively.
Edit intent: meaning-changed
Original:  Both intensive care units (ICU) admission and death rate , which dropped by more than one order of magnitude since March, are currently 0.017\% and 0.015 \% respectively.
Revised:  Both intensive care units (ICU) admission rate and infection fatality rate (IFR) dropped by one order of magnitude since March, are currently 0.017\% and 0.015 \% respectively.
Edit intent: meaning-changed
Original:  Both intensive care units (ICU) admission and death rate , which dropped by more than one order of magnitude since March, are currently 0.017\% and 0.015 \% respectively.
Revised:  Both intensive care units (ICU) admission and death rate , which dropped by more than one order of magnitude since March, and are currently 0.036\% and 0.027 \% respectively.
Edit intent: meaning-changed
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 . The incidence peak of 3.5 \% is expected at week 39 for France.
Revised:  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 and Grand Est. These simulations are using a reproduction rate (R) constant over time ranging from 1.3 to 1.45 (1.15 in Grand Est). They use an estimation of the number of infection which occurred during the first wave. These simulations also use the estimated incidence, which by reducing the susceptible population weeks after weeks induces a saturation of the otherwise exponential growth of the outbreak. An incidence peak of 3.5 \% is expected at week 39 for France.
Edit intent: meaning-changed
Original:  The cumulative incidence over the two waves is computed close to 50 \% for France and 80 \% for Ile de France.
Revised:  The cumulative incidence over the two waves is computed close to 60\% for R=1.3 and 70\% for R=1.4. This suggests that if individual immunity exists, herd immunity is likely to be achieved in France by the end of October 2020.
Edit intent: meaning-changed
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 . The level of spreading raises doubts in the large-scale testing strategy which anyway detects only a few percents of infected people. It also raises doubts in the efficiency of the closing of school classes, where a pupil is tested Covid-positive by chance. Finally, determining the probability of reinfection by making a large-scale testing of persons already found positive several months ago would strongly help to get a better visibility of the future outbreak trajectory .
Revised:  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 .
Edit intent: coherence
Original: This review paper investigates the integration of predictive, preventive and personalised interoperable digital healthcare systems. The second point of interest is the use of new mass surveillance technologies to feed personal data from health professionals to governments, without any comprehensive studies that determine if such new technologies and data policies would address the pandemic crisis.Two approaches were used: A comprehensive bibliographic review with R statistical methods of the COVID-19 pandemic in PubMed literature and Web of Science Core Collection, supported with Google Scholar search.
Revised:  A comprehensive bibliographic review with R statistical methods of the COVID-19 pandemic in PubMed literature and Web of Science Core Collection, supported with Google Scholar search.
Edit intent: coherence
Original:  We are the first in this field to perform an empirical study on women in Bangladesh to see how game-based learning can contribute to learn food calories. We further analyze and report the impact of participants' age, professions and smartphone proficiency levels on their learning experience and progression. Our study also conforms the finding of existing studies that game-based learning can enhance the learning experience.
Revised:  Our study confirms the finding of existing studies that game-based learning can enhance the learning experience.
Edit intent: coherence
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 d-dimensional unit cube, there is an empty axis-parallel box of volume at least \Omega(d/n) \to\infty and d is fixed .
Edit intent: meaning-changed
Original: Matching algorithms have been classically studied with the goal of finding stable solutions. However, in many important societal problems, the degree of fairness in the matching assumes crucial importance, for instance when we have to match COVID-19 patients to care units. We study the problem of finding a stable many-to-one matching while satisfying fairness among all the agentswith cardinal utilities.
Revised: The past few years have seen a surge of work on fairness in social choice literature. A major portion of this work has focused on allocation settings where items must be allocated fairly to agents with diverse preferences. In comparison, fairness in two-sided settings where agents have to be matched to other agents, with preferences on both sides, has received much less attention. In this paper, we explore the problem of finding a stable many-to-one matching while satisfying fairness among all the agentswith cardinal utilities.
Edit intent: meaning-changed
Original:  We consider various fairness definitions from fair allocation literature, such as envy-freeness (EF) and leximin optimal fairness. We find that EF and its weaker versions are incompatible with stability, even under a restricted setting with isometric utilities. We focus on leximin optimal fairness and show that finding such a matching is NP-Hard, even under isometric utilities.
Revised:  In particular, we focus on leximin optimal fairness and show that finding such a matching is NP-Hard, even under isometric utilities.
Edit intent: clarity
Original:  We focus on leximin optimal fairness and show that finding such a matching is NP-Hard, even under isometric utilities. Next, we narrow our focus onto ranked isometric utilities and provide a characterisation for the space of stable matchings.
Revised:  We focus on leximin optimal fairness and seek leximin optimal many-to-one stable matchings. In the special case of ranked utilities where all agents on each side have the same rankings over the agents on the other side (but not necessarily the same utilities), we provide a characterisation for the space of stable matchings.
Edit intent: meaning-changed
Original:  We present a novel and efficient algorithm that finds the leximin optimal stable matching under ranked isometric utilities . To the best of our knowledge, we are the first to address the problem of finding a leximin optimally fair and stable matching .
Revised:  We present a novel and efficient algorithm that finds the leximin optimal stable matching under ranked isometric utilities (where the utilities from matching are the same across an edge). The running time of FaSt is linear in the number of edges. Additionally, we provide an efficient algorithm, called FaSt-Gen, that finds the leximin optimal stable matching for ranked but otherwise unconstrained utilities. The running time of FaSt-Gen is quadratic in the number of edges. We then establish that, in the absence of rankings, finding a leximin optimally fair and stable matching .
Edit intent: meaning-changed
Original:  To the best of our knowledge, we are the first to address the problem of finding a leximin optimally fair and stable matching .
Revised:  To the best of our knowledge, we are the first to address the problem of finding a leximin optimal stable matching is NP-Hard, even under isometric utilities. In fact, when additivity is the only assumption on the utilities, we show that, unless P=NP, no polynomial time approximation is possible .
Edit intent: meaning-changed
Original:  However, there now exists a high cognitive demand on physicians with the increased reliance on intraprocedural imaging. In response, we present a robotic manipulator for AcuNav ICE catheters to alleviate the physician's burden and support applied methods for more automated .
Revised:  However, there now exists a high cognitive demand on physicians who can often serve as interventionalist and imager. We present a robotic manipulator for AcuNav ICE catheters to alleviate the physician's burden and support applied methods for more automated .
Edit intent: meaning-changed
Original:  Herein, we introduce two methods towards these goals: (1) a data-driven method to compensate kinematic model errors due to non-linear elasticity in catheter bending, providing more precise robotic control and (2) an automated image recovery process that allows physicians to bookmark images during intervention and automatically return with the push of a button .
Revised:  Herein, we introduce two application modules towards these goals: (1) a data-driven method to compensate kinematic model errors due to non-linear elasticity in catheter bending, providing more precise robotic control and (2) an automated image recovery process that allows physicians to bookmark images during intervention and automatically return with the push of a button .
Edit intent: meaning-changed
Original:  Herein, we introduce two methods towards these goals: (1) a data-driven method to compensate kinematic model errors due to non-linear elasticity in catheter bending, providing more precise robotic control and (2) an automated image recovery process that allows physicians to bookmark images during intervention and automatically return with the push of a button .
Revised:  Herein, we introduce two methods towards these goals: (1) a view recovery process that allows physicians to bookmark images during intervention and automatically return with the push of a button .
Edit intent: clarity
Original:  Herein, we introduce two methods towards these goals: (1) a data-driven method to compensate kinematic model errors due to non-linear elasticity in catheter bending, providing more precise robotic control and (2) an automated image recovery process that allows physicians to bookmark images during intervention and automatically return with the push of a button .
Revised:  Herein, we introduce two methods towards these goals: (1) a data-driven method to compensate kinematic model errors due to non-linear elasticity in catheter bending, providing more precise robotic control and (2) an automated image recovery process that allows physicians to save views during intervention and automatically return with the push of a button .
Edit intent: clarity
Original:  Herein, we introduce two methods towards these goals: (1) a data-driven method to compensate kinematic model errors due to non-linear elasticity in catheter bending, providing more precise robotic control and (2) an automated image recovery process that allows physicians to bookmark images during intervention and automatically return with the push of a button . To validate our error compensation method, we demonstrate a complex rotation of the ultrasound imaging plane evaluated on benchtop. Automated view recovery is validated by repeated imaging of landmarks on benchtop and in vivo experiments with position- and image-based analysis.
Revised:  Herein, we introduce two methods towards these goals: (1) a data-driven method to compensate kinematic model errors due to non-linear elasticity in catheter bending, providing more precise robotic control and (2) an automated image recovery process that allows physicians to bookmark images during intervention and automatically return with the push of a button and (2) a data-driven approach to compensate kinematic model errors that result from non-linear behaviors in catheter bending, providing more precise control of the catheter tip. View recovery is validated by repeated imaging of landmarks on benchtop and in vivo experiments with position- and image-based analysis.
Edit intent: clarity
Original:   Results support that a robotic-assist system for more autonomous ICE can provide a safe and efficient tool, potentially reducing the execution time and allowing more complex procedures to become common place .
Revised:  We present a simplified calibration approach for error compensation and verify with complex rotation of the catheter in benchtop and phantom experiments under varying realistic curvature conditions. Results support that a robotic-assist system for more autonomous ICE can provide a safe and efficient tool, potentially reducing the execution time and allowing more complex procedures to become common place .
Edit intent: meaning-changed