wanyu/IteraTeR_full_sent huggingface dataset:
Original:  These signals originate in highly invariant neurons, which uniquely respond to some specific stimuli , e.g. image of a cat , and travel backwards to reactivate the same populations of neurons that usually uniquely activate in the actual presence of such specific stimuli , thus creating offline an experience that is similar.
Revised:  These signals originate in highly invariant neurons, which uniquely respond to some specific stimuli , e.g. image of a cat ). They then travel backwards to reactivate the same populations of neurons that usually uniquely activate in the actual presence of such specific stimuli , thus creating offline an experience that is similar.
Edit intent: coherence
Original:  These signals originate in highly invariant neurons, which uniquely respond to some specific stimuli , e.g. image of a cat , and travel backwards to reactivate the same populations of neurons that usually uniquely activate in the actual presence of such specific stimuli , thus creating offline an experience that is similar.
Revised:  These signals originate in highly invariant neurons, which uniquely respond to some specific stimuli , e.g. image of a cat , and travel backwards to reactivate the same populations of neurons that uniquely respond to this specific stimuli during perception, thus recreating "offline" an experience that is similar.
Edit intent: clarity
Original:  We apply the proposed method in  a dynamic portfolio allocation problem, where the investor is able to learn the contemporaneous relations among different currencies . We show that our approach generates not just significant statistical improvements, but also huge economic gains for a mean-variance investor relative to the Random Walk benchmark and using fixed orders over time.
Revised:  We apply the proposed method in a dynamic portfolio allocation problem, where the investor is able to learn the contemporaneous relations among different currencies improving final decisions and economic performance. The second is a macroeconomic application, where the econometrician can adapt sequentially to new economic environments, switching the contemporaneous relations among macroeconomic variables over time.
Edit intent: meaning-changed
Original:  Our main contributions in this work are the creation of a framework based on dynamic undirected graphs that represent the data association problem over multiple timesteps, and a message passing graph neural network ( GNN ) that operates on these graphs to produce the desired likelihood for every association therein.
Revised:  Our main contributions in this work are the creation of a framework based on dynamic undirected graphs that represent the data association problem over multiple timesteps, and a message passing graph neural network ( MPNN ) that operates on these graphs to produce the desired likelihood for every association therein.
Edit intent: meaning-changed
Original:  We further provide solutions and propositions for the computational problems that need to be addressed to create a memory-efficient, real-time, online algorithm that can reason over multiple timesteps, correct previous mistakes, update beliefs, possess long-term memory, and handle missed/false detections.
Revised:  We also provide solutions and propositions for the computational problems that need to be addressed to create a memory-efficient, real-time, online algorithm that can reason over multiple timesteps, correct previous mistakes, update beliefs, possess long-term memory, and handle missed/false detections.
Edit intent: clarity
Original:  We further provide solutions and propositions for the computational problems that need to be addressed to create a memory-efficient, real-time, online algorithm that can reason over multiple timesteps, correct previous mistakes, update beliefs, possess long-term memory, and handle missed/false detections.
Revised:  We further provide solutions and propositions for the computational problems that need to be addressed to create a memory-efficient, real-time, online algorithm that can reason over multiple timesteps, correct previous mistakes, update beliefs, and handle missed/false detections.
Edit intent: clarity
Original: We consider the problem of assigning agents to programs in the presence of two-sided preferences . Each agent has to be assigned to at most one program and each program can accommodate multiple agents. However unlike the standard setting of school choice, we do not have fixed upper quotas with programs as an input -- instead we abstract it as a cost associated with every program .
Revised: We consider the problem of assigning agents to programs in the presence of two-sided preferences , commonly known as the Hospital Residents problem. In the standard setting of school choice, we do not have fixed upper quotas with programs as an input -- instead we abstract it as a cost associated with every program .
Edit intent: clarity
Original:  However unlike the standard setting of school choice, we do not have fixed upper quotas with programs as an input -- instead we abstract it as a cost associated with every program .
Revised:  However unlike the standard setting each program has a rigid upper quota which cannot be violated. Motivated by applications where quotas may be flexible, we propose and study the problem of computing stable matchings under flexible quotas -- instead we abstract it as a cost associated with every program .
Edit intent: meaning-changed
Original:  However unlike the standard setting of school choice, we do not have fixed upper quotas with programs as an input -- instead we abstract it as a cost associated with every program . This setting enables the programs to control the number of agents assigned to them and is also applicable in the two-round setting (Gajulapalli et al. , FSTTCS 2020) where largest stable extension is computed. In this setting, our goal is to compute a min-cost stable matching that matches all the agents .
Revised:  However unlike the standard setting of school choice, we do not have fixed upper quotas with programs as an input -- instead we abstract it as a cost associated with every program and these costs control the quotas. Our goal is to compute a min-cost stable matching that matches all the agents .
Edit intent: clarity
Original:  In this setting, our goal is to compute a min-cost stable matching that matches all the agents . We show that the problem is NP-hard even under very severe restrictions on the instance. We complement our negative results by presenting approximation algorithms for general case and a fast exponential algorithm for a special case .
Revised:  In this setting, our goal is to compute a min-cost stable matching that matches all agents and is optimal with respect to the cost criteria. We study two optimization problems with respect to the costs and show that there is a sharp contrast in the complexity status of the two optimization criteria. We also establish the connection of our model with the stable extension problem in an apparently different two-round setting of the stable matching problem. We show that our results in the SMFQ setting generalize the stable extension problem .
Edit intent: meaning-changed
Original: By generating control policies that create natural search behaviors in autonomous systems , ergodic control provides a principled solution to address tasks that require exploration. A large class of ergodic control algorithms relies on spectral analysis, which suffers from the curse of dimensionality, both in storage and computation. This drawback has prohibited the application of ergodic control in robot manipulation since it often requires exploration in state space with more than 2 dimensions.
Revised: By generating control policies that create natural search behaviors in autonomous systems , ergodic control extends the tracking principle by specifying a probability distribution over an area to cover instead of a trajectory to track. The original problem is formulated as a spectral multiscale coverage problem, typically requiring the spatial distribution to be decomposed as Fourier series. This approach does not scale well to control problems requiring exploration in search space of more than 2 dimensions.
Edit intent: meaning-changed
Original:  Indeed, the original ergodic control formulation will typically not allow exploratory behaviors to be generated for a complete 6D end-effector pose. In this paper , we propose a solution for ergodic exploration based on the spectral analysis in multidimensional spaces using low-rank tensor approximation techniques.
Revised:  To address this issue , we propose a solution for ergodic exploration based on the spectral analysis in multidimensional spaces using low-rank tensor approximation techniques.
Edit intent: clarity
Original:  In this paper , we propose a solution for ergodic exploration based on the spectral analysis in multidimensional spaces using low-rank tensor approximation techniques. We rely on tensor train decomposition , a recent approach from multilinear algebra for low-rank approximation and efficient computation of multidimensional arrays .
Revised:  In this paper , we propose the use of tensor trains , a recent approach from multilinear algebra for low-rank approximation and efficient computation of multidimensional arrays .
Edit intent: coherence
Original:  The approach is applied to a peg-in-hole insertion task using a 7-axis Franka Emika Panda robot , where ergodic exploration allows the task to be achieved without requiring the use of force/torque sensors.
Revised:  The approach is applied to a peg-in-hole insertion task requiring full 6D end-effector poses, implemented with a 7-axis Franka Emika Panda robot , where ergodic exploration allows the task to be achieved without requiring the use of force/torque sensors.
Edit intent: meaning-changed
Original:  The approach is applied to a peg-in-hole insertion task using a 7-axis Franka Emika Panda robot , where ergodic exploration allows the task to be achieved without requiring the use of force/torque sensors.
Revised:  The approach is applied to a peg-in-hole insertion task using a 7-axis Franka Emika Panda robot . In this experiment, ergodic exploration allows the task to be achieved without requiring the use of force/torque sensors.
Edit intent: clarity
Original: This work shares unexpected findings obtained from the use of the Amazon Mechanical Turk platform as a source of participants for the study of technology adoption. Expressly,of the 564 participants from the United States , 126 ( 22.34\%) failed at least one of  three forms of attention check (logic, honesty, and time).
Revised: This work shares unexpected findings obtained from the use of the Amazon Mechanical Turk (MTurk), thereby discovering a significant level of inattentiveness amongst the platform's top crowd workers (those classified as 'Master', with an 'Approval Rate' of 98\% or more, and a 'Number of HITS approved' value of 1,000 or more). A total of 564 participants from the United States , 126 ( 22.34\%) failed at least one of three forms of attention check (logic, honesty, and time).
Edit intent: meaning-changed
Original:  Expressly,of the 564 participants from the United States , 126 ( 22.34\%) failed at least one of  three forms of attention check (logic, honesty, and time).
Revised:  Expressly,of the 564 individuals from the United States , 126 ( 22.34\%) failed at least one of three forms of attention check (logic, honesty, and time).
Edit intent: clarity
Original:  Expressly,of the 564 participants from the United States , 126 ( 22.34\%) failed at least one of  three forms of attention check (logic, honesty, and time).
Revised:  Expressly,of the 564 participants from the United States participated in our experiment. They were asked to read a vignette outlining one of four hypothetical technology products and then complete a related survey. Three forms of attention check (logic, honesty, and time) were used to assess attentiveness. Through this experiment we determined that a total of 126 ( 22.34\%) failed at least one of three forms of attention check (logic, honesty, and time).
Edit intent: meaning-changed
Original:  Expressly,of the 564 participants from the United States , 126 ( 22.34\%) failed at least one of  three forms of attention check (logic, honesty, and time).
Revised:  Expressly,of the 564 participants from the United States , 126 ( 22.3\%) participants failed at least one of three forms of attention check (logic, honesty, and time).
Edit intent: meaning-changed
Original:  Expressly,of the 564 participants from the United States , 126 ( 22.34\%) failed at least one of  three forms of attention check (logic, honesty, and time).
Revised:  Expressly,of the 564 participants from the United States , 126 ( 22.34\%) failed at least one of the three forms of attention check (logic, honesty, and time).
Edit intent: fluency
Original:  Expressly,of the 564 participants from the United States , 126 ( 22.34\%) failed at least one of  three forms of attention check (logic, honesty, and time). We also examined whether characteristics such as gender, age, education, and income affected participant attention. Amongst all characteristics assessed, only prior experience with the technology being studied was found to be related to attentiveness. We conclude this work by reaffirming the need for multiple forms of attention checks to gauge participant attention .
Revised:  Expressly,of the 564 participants from the United States , 126 ( 22.34\%) failed at least one of three forms of attention check , with most (94) failing the honesty check - followed by the logic check (31), and the time check (27). Thus, we established that significant levels of inattentiveness exist even among the most elite MTurk workers. The study concludes by reaffirming the need for multiple forms of attention checks to gauge participant attention .
Edit intent: meaning-changed
Original:  In this article, we propose an integrated detection-estimation-forecasting framework that, using publicly available data published by the national authorities , is designed to: (i) learn relevant features of the epidemic (e.g., the infection rate);
Revised:  In this article, we propose an integrated detection-estimation-forecasting framework that, using publicly available data , is designed to: (i) learn relevant features of the epidemic (e.g., the infection rate);
Edit intent: clarity
Original:  In this article, we propose an integrated detection-estimation-forecasting framework that, using publicly available data published by the national authorities , is designed to: (i) learn relevant features of the epidemic (e.g., the infection rate);
Revised:  In this article, we propose an integrated detection-estimation-forecasting framework that, using publicly available data published by the national authorities , is designed to: (i) learn relevant features of the pandemic (e.g., the infection rate);
Edit intent: clarity
Original:  Armed with such activation functions, deep neural networks can reproduce traditional approximation tools and, therefore, approximate target functions with a smaller number of parameters than traditional neural networks. In terms of trainingdynamics of deep learning, reproducing activation functions can generate neural tangent kernels  with a better condition number than traditional activation functions lessening the spectral bias of deep learning.
Revised:  Armed with such activation functions, deep neural networks can reproduce traditional approximation tools and, therefore, approximate target functions with a smaller number of parameters than traditional NNs. In NN training, RAFs can generate neural tangent kernels with a better condition number than traditional activation functions lessening the spectral bias of deep learning.
Edit intent: clarity
Original:  In terms of trainingdynamics of deep learning, reproducing activation functions can generate neural tangent kernels  with a better condition number than traditional activation functions lessening the spectral bias of deep learning.
Revised:  In terms of trainingdynamics of deep learning, reproducing activation functions can generate neural tangent kernels (NTKs) with a better condition number than traditional activation functions lessening the spectral bias of deep learning.
Edit intent: clarity
Original:  As demonstrated by extensive numerical tests, the proposed activation function can facilitate the convergence of deep learning optimization for a solution with higher accuracy than existing deep learning solvers for audio/image/video reconstruction, PDEs, and eigenvalue problems  .
Revised:  As demonstrated by extensive numerical tests, the proposed RAFs can facilitate the convergence of deep learning optimization for a solution with higher accuracy than existing deep learning solvers for audio/image/video reconstruction, PDEs, and eigenvalue problems .
Edit intent: clarity
Original:  As demonstrated by extensive numerical tests, the proposed activation function can facilitate the convergence of deep learning optimization for a solution with higher accuracy than existing deep learning solvers for audio/image/video reconstruction, PDEs, and eigenvalue problems  .
Revised:  As demonstrated by extensive numerical tests, the proposed activation function can facilitate the convergence of deep learning optimization for a solution with higher accuracy than existing deep learning solvers for audio/image/video reconstruction, PDEs, and eigenvalue problems . With RAFs, the errors of audio/video reconstruction, PDEs, and eigenvalue problems are decreased by over 14\%, 73\%, 99\%, respectively, compared with baseline, while the performance of image reconstruction increases by 58\% .
Edit intent: meaning-changed
Original: In this series of papers we present a novel arbitrary-order discrete de Rham (DDR) complex on general polyhedral meshes based on the decomposition of polynomial spaces into the ranges of vector calculus operators and complements linked to the spaces in the Koszul complex.
Revised: In this paper we present a novel arbitrary-order discrete de Rham (DDR) complex on general polyhedral meshes based on the decomposition of polynomial spaces into the ranges of vector calculus operators and complements linked to the spaces in the Koszul complex.
Edit intent: clarity
Original:  We prove a complete panel of results required for the analysis of discretisation schemes for partial differential equations based on this complex: exactness properties, uniform Poincar\'e inequalities, as well as primal and adjoint consistency.
Revised:  We prove a complete panel of results for the analysis of discretisation schemes for partial differential equations based on this complex: exactness properties, uniform Poincar\'e inequalities, as well as primal and adjoint consistency.
Edit intent: clarity
Original:  Adding additional absolute sensors such as Global Navigation Satellite Systems (GNSS) has the potential to expand the domain of VT R to environments where the ability to visually localize is not guaranteed.
Revised:  Adding additional absolute sensors such as Global Navigation Satellite Systems (GNSS) has the potential to expand the domain of VT Visual Teach and Repeat to environments where the ability to visually localize is not guaranteed.
Edit intent: meaning-changed
Original:  The goal of this review is to synthesize the numerous and disparate observations on the membrane trafficking of the five major junction transmembrane proteins accumulated to date to comprehend the current state of the art, to highlight differences and similarities among the trafficking pathways, and to identify topics that are not fully understood.
Revised:  The goal of this review is to synthesize studies published mostly in the last 25 years on the membrane trafficking of the five major junction transmembrane proteins accumulated to date to comprehend the current state of the art, to highlight differences and similarities among the trafficking pathways, and to identify topics that are not fully understood.
Edit intent: meaning-changed
Original:  The goal of this review is to synthesize the numerous and disparate observations on the membrane trafficking of the five major junction transmembrane proteins accumulated to date to comprehend the current state of the art, to highlight differences and similarities among the trafficking pathways, and to identify topics that are not fully understood.
Revised:  The goal of this review is to synthesize the numerous and disparate observations on the membrane trafficking of the five major junction transmembrane proteins : claudins, occludin, and junction adhesion molecules (JAMs) in tight junctions; cadherins and nectins in adherens junctions, to comprehend the current state of the art, to highlight differences and similarities among the trafficking pathways, and to identify topics that are not fully understood.
Edit intent: meaning-changed
Original:  The goal of this review is to synthesize studies published mostly in the last 25 years on the membrane trafficking of the five major junction transmembrane proteins: claudins, occludin, and junction adhesion molecules (JAMs) in tight junctions;
Revised:  The goal of this review is to synthesize published studies on the membrane trafficking of the five major junction transmembrane proteins: claudins, occludin, and junction adhesion molecules (JAMs) in tight junctions;
Edit intent: clarity
Original:  cadherins and nectins in adherens junctions , to comprehend the current state of the art, to highlight differences and similarities among the trafficking pathways, and to identify topics that are not fully understood . Clathrin-mediated endocytosis appears to be the main, but not exclusive, mode of internalization.
Revised:  cadherins and nectins in adherens junctions ; to identify underlying common mechanisms; to highlight their functional consequences on barrier function; and to identify knowledge gaps . Clathrin-mediated endocytosis appears to be the main, but not exclusive, mode of internalization.
Edit intent: clarity
Original:  In order to obtain these results, we use the vertex separator of these graphs effectively, and design space-efficient algorithms to find such separators. The constructions of the separators presented here can be of independent interest\log n) space, where n is the number of Jordan regions, and m is the total number of crossings among the regions.
Revised:  In order to obtain these results, we use the vertex separator of these graphs effectively, and design space-efficient manner and use it to solve the Reachability in polynomial time and O(m^{1/2\log n) space, where n is the number of Jordan regions, and m is the total number of crossings among the regions.
Edit intent: meaning-changed
Original:   By integrating the results of our 1D and 2D touch-pointing experiments and reanalyses of previous studies' data, we examined the advantages and disadvantages of each approach to compute sigma_a, and we found that there is no optimal choice to maximize the prediction accuracy of FFitts law .
Revised:  This inconsistency could be harmful to HCI studies such as evaluating pointing techniques and comparing user groups. By integrating the results of our 1D and 2D touch-pointing experiments and reanalyses of previous studies' data, we examined the advantages and disadvantages of each approach to compute sigma_a, and we found that there is no optimal choice to maximize the prediction accuracy of FFitts law .
Edit intent: meaning-changed
Original:   By integrating the results of our 1D and 2D touch-pointing experiments and reanalyses of previous studies' data, we examined the advantages and disadvantages of each approach to compute sigma_a, and we found that there is no optimal choice to maximize the prediction accuracy of FFitts law .
Revised:  By integrating the results of our 1D and 2D touch-pointing experiments and reanalyses of previous studies' data, we examined the advantages and disadvantages of each approach to compute sigma_a, and we found that using the parameter optimization method has overall the best prediction performance .
Edit intent: meaning-changed