wanyu/IteraTeR_v2 huggingface dataset:
Original:  This includes scaling limits of localization reliability in terms of measurement numbers and the precise characterization of a geometric error.
Revised:  This framework results in characterization of scaling limits of localization reliability in terms of measurement numbers and the precise characterization of a geometric error.
Edit intent: clarity
Original:  The main quantity that encapsulates this information is shown to be the Kullback-Leibler (KL) divergence between probability distributions of a selected feature for fingerprinting at different locations .
Revised:  The main quantity that encapsulates this information is shown to be the Kullback-Leibler (KL) divergence between probability distributions of selected feature for fingerprinting at different locations .
Edit intent: fluency
Original:  The framework is instantiated for Received Signal Strength (RSS) -based algorithms, where the effect of various parameters on the performance of fingerprinting algorithms is discussed, including path loss and fading characteristics, number of measurements  , number of anchors and their locations and placement of training points.
Revised:  The framework is instantiated for Received Signal Strength (RSS) - based algorithm. The effect of various parameters on the performance of fingerprinting algorithms is discussed, including path loss and fading characteristics, number of measurements , number of anchors and their locations and placement of training points.
Edit intent: coherence
Original:  The framework is instantiated for Received Signal Strength (RSS) -based algorithms, where the effect of various parameters on the performance of fingerprinting algorithms is discussed, including path loss and fading characteristics, number of measurements  , number of anchors and their locations and placement of training points.
Revised:  The framework is instantiated for Received Signal Strength (RSS) -based algorithms, where the effect of various parameters on the performance of fingerprinting algorithms is discussed, which includes path loss and fading characteristics, number of measurements , number of anchors and their locations and placement of training points.
Edit intent: coherence
Original:  The framework is instantiated for Received Signal Strength (RSS) -based algorithms, where the effect of various parameters on the performance of fingerprinting algorithms is discussed, including path loss and fading characteristics, number of measurements  , number of anchors and their locations and placement of training points.
Revised:  The framework is instantiated for Received Signal Strength (RSS) -based algorithms, where the effect of various parameters on the performance of fingerprinting algorithms is discussed, including path loss and fading characteristics, number of measurements at each point , number of anchors and their locations and placement of training points.
Edit intent: clarity
Original:  The framework is instantiated for Received Signal Strength (RSS) -based algorithms, where the effect of various parameters on the performance of fingerprinting algorithms is discussed, including path loss and fading characteristics, number of measurements  , number of anchors and their locations and placement of training points.
Revised:  The framework is instantiated for Received Signal Strength (RSS) -based algorithms, where the effect of various parameters on the performance of fingerprinting algorithms is discussed, including path loss and fading characteristics, number of measurements , number of anchors and their position, and placement of training points.
Edit intent: clarity
Original:  Simulations and experimental results characterize numerically the findings of the theoretical framework and demonstrate its consistency with realistic localization scenarios .
Revised:  Representative simulations and experimentation are used to verify validity of the theoretical framework and demonstrate its consistency with realistic localization scenarios .
Edit intent: clarity
Original:  Simulations and experimental results characterize numerically the findings of the theoretical framework and demonstrate its consistency with realistic localization scenarios .
Revised:  Simulations and experimental results characterize numerically the findings of the theoretical frameworks in realistic setups .
Edit intent: clarity
Original:  In this method, states zoneout (maintain their previous value rather than updating), when the suprisal (discrepancy between the last state's prediction and target) is small.
Revised:  In this method, states zoneout (maintain their previous value rather than updating), when the suprisal (discrepancy between the last state's prediction and target) is small.
Edit intent: fluency
Original:  We define the operator of differentiation on programming spaces and implement higher order derivatives as well as  generalized shift operator in terms of its powers.
Revised:  We define the operator of differentiation on programming spaces and implement higher order derivatives as well as a generalized shift operator in terms of its powers.
Edit intent: fluency
Original:  We define the operator of differentiation on programming spaces and implement higher order derivatives as well as a generalized shift operator in terms of its powers.
Revised:  We define the operator of differentiation on programming spaces and implement a generalized shift operator in terms of its powers.
Edit intent: clarity
Original:  We present an abstract computing machine that models automatically differentiable computer programs . Computer programs are viewed as maps on a finite dimensional vector space called virtual memory space , which we extend by the tensor algebra of its dual to accommodate derivatives.
Revised:  We present an abstract computing machine that models automatically differentiable computer programs . Computer programs are viewed as maps from the virtual memory space , which we extend by the tensor algebra of its dual to accommodate derivatives.
Edit intent: clarity
Original:  The extended virtual memory is by itself an algebra of programs, a data structure one can calculate with , and its elements give the expansion of the original program as an infinite tensor series at program's input values .
Revised:  The extended virtual memory is by itself an algebra of programs, an algebraic data structure one can calculate with , and its elements give the expansion of the original program as an infinite tensor series at program's input values .
Edit intent: clarity
Original:  The extended virtual memory is by itself an algebra of programs, a data structure one can calculate with , and its elements give the expansion of the original program as an infinite tensor series at program's input values .
Revised:  The extended virtual memory is by itself an algebra of programs, a data structure one can calculate with .
Edit intent: clarity
Original:  We present an algebraic language that enables both implementations and analysis of differentiable programs by way of operational calculus.
Revised:  We construct an algebraic language that enables both implementations and analysis of differentiable programs by way of operational calculus.
Edit intent: clarity
Original:  In the model , programs are elements of programming spaces and are viewed as maps from the virtual memory space to itself.
Revised:  In the model , programs are elements of programming spaces and viewed as maps from the virtual memory space to itself.
Edit intent: fluency
Original:  We demonstrate our models algebraic power over analytic properties of differentiable programs by analysing iterators, considering fractional iterations and their iterating velocities .
Revised:  We demonstrate our models usefulness in differentiable programming by using it to analyse iterators, deriving fractional iterations and their iterating velocities .
Edit intent: clarity
Original: We develop an efficient method for solving dynamic portfolio selection problems in the presence of transaction cost, liquidity cost and market impact.
Revised: We develop an efficient method for solving dynamic portfolio allocation problems in the presence of transaction cost, liquidity cost and market impact.
Edit intent: clarity
Original: Topic modeling  is an increasingly important component of Big Data analytics, enabling the sense-making of highly dynamic and diverse streams of text data.
Revised: Topic modeling is an increasingly important component of the design of intelligent systems enabling the sense-making of highly dynamic and diverse streams of text data.
Edit intent: clarity
Original:  Traditional methods such as Dynamic Topic Modeling (DTM) , while mathematically elegant, do not lend themselves well to direct parallelization because of dependencies from one time step to another.
Revised:  Traditional methods such as Dynamic Topic Modeling (DTM) do not lend themselves well to direct parallelization because of dependencies from one time step to another.
Edit intent: coherence
Original:  Decidability of average-energy games with a lower-bound constraint on the energy level (but no upper bound) is an openproblem ;
Revised:  Decidability of average-energy games with a lower-bound constraint on the energy level (but no upper bound) remained open ;
Edit intent: clarity
Original:  in particular, there is no known upper bound on the memory that is required for winning strategies.
Revised:  in particular, so far there was no known upper bound on the memory that is required for winning strategies.
Edit intent: clarity
Original:  By reducing average-energy games with lower-bounded energy to infinite-state mean-payoff games and analyzing the frequency of low-energy configurations, we show an almost tight doubly-exponential upper bound on the necessary memory, and that the winner of average-energy games with lower-bounded energy can be determined in doubly-exponential time.
Revised:  By reducing average-energy games with lower-bounded energy to infinite-state mean-payoff games and analyzing the density of low-energy configurations, we show an almost tight doubly-exponential upper bound on the necessary memory, and that the winner of average-energy games with lower-bounded energy can be determined in doubly-exponential time.
Edit intent: clarity
Original:  In this work, we prove that only very simple shapes can indeed be programmed, whereas exactly one known result (SODA 2014) showed a restriction on the assemblies general non-cooperative self-assembly could achieve, without any implication on its computational expressiveness.
Revised:  Previously, exactly one known result (SODA 2014) showed a restriction on the assemblies general non-cooperative self-assembly could achieve, without any implication on its computational expressiveness.
Edit intent: coherence
Original:  Then we define a new metric for C-like languages, called ACPATH, that allows to quickly compute an very good estimation of the number of acyclic execution paths through the given function.
Revised:  Then we define a new metric for C-like languages, called ACPATH, that allows to quickly compute a very good estimation of the number of acyclic execution paths through the given function.
Edit intent: fluency
Original: Pok\'emon Go has received unprecedented media coverage for a location-based game that uses augmented reality techniques .
Revised: Pok\'emon Go , a location-based game that uses augmented reality techniques .
Edit intent: clarity
Original:  In this paper  we perform a natural experiment using data from mobile  networks to evaluate the effect of Pok\'emon Go on the pulse of a big city: Santiago  of Chile.
Revised:  In this paper , we perform a natural experiment using data from mobile networks to evaluate the effect of Pok\'emon Go on the pulse of a big city: Santiago of Chile.
Edit intent: fluency
Original:  In this paper  we perform a natural experiment using data from mobile  networks to evaluate the effect of Pok\'emon Go on the pulse of a big city: Santiago  of Chile.
Revised:  In this paper we perform a natural experiment using data from mobile phone networks to evaluate the effect of Pok\'emon Go on the pulse of a big city: Santiago of Chile.
Edit intent: clarity
Original:  We found a significant effect of Pok\'emon Go on the floating population of Santiago : up to 13.8\\%DIF < more people being %DIF > more people spent  outside at certain times  , even if they do not seem to go out of their usual way.
Revised:  We found significant effects of the game on the floating population of Santiago : up to 13.8\\%DIF < more people being %DIF > more people spent outside at certain times , even if they do not seem to go out of their usual way.
Edit intent: clarity
Original:  We found a significant effect of Pok\'emon Go on the floating population of Santiago : up to 13.8\\%DIF < more people being %DIF > more people spent  outside at certain times  , even if they do not seem to go out of their usual way.
Revised:  We found a significant effect of Pok\'emon Go on the floating population of Santiago : up to 13.8\\%DIF < more %DIF > more people spent outside at certain times , even if they do not seem to go out of their usual way.
Edit intent: clarity
Original:  We found a significant effect of Pok\'emon Go on the floating population of Santiago : up to 13.8\\%DIF < more people being %DIF > more people spent  outside at certain times  , even if they do not seem to go out of their usual way.
Revised:  We found a significant effect of Pok\'emon Go on the floating population of Santiago : up to 13.8\\%DIF < more people being %DIF > more people spent time outside at certain times , even if they do not seem to go out of their usual way.
Edit intent: clarity
Original:  We found a significant effect of Pok\'emon Go on the floating population of Santiago : up to 13.8\\%DIF < more people being %DIF > more people spent  outside at certain times  , even if they do not seem to go out of their usual way.
Revised:  We found a significant effect of Pok\'emon Go on the floating population of Santiago : up to 13.8\\%DIF < more people being %DIF > more people spent outside at certain times of the day , even if they do not seem to go out of their usual way.
Edit intent: clarity
Original:  These effects at specific times were found by performing several regressions using count models over snapshots of the cell phone network .
Revised:  These effects were found by performing several regressions using count models over snapshots of the cell phone network .
Edit intent: clarity
Original:  These effects at specific times were found by performing several regressions using count models over snapshots of the cell phone network .
Revised:  These effects at specific times were found by performing regressions using count models over snapshots of the cell phone network .
Edit intent: clarity
Original:  Particularly, we found that, in business days, there is more people on the street at commuting times, meaning that people did not change their daily routines but slightly adapted them to play the game.
Revised:  Our results indicate that, on business days, there is more people on the street at commuting times, meaning that people did not change their daily routines but slightly adapted them to play the game.
Edit intent: clarity
Original:  Particularly, we found that, in business days, there is more people on the street at commuting times, meaning that people did not change their daily routines but slightly adapted them to play the game.
Revised:  Particularly, we found that, in business days, there are more people on the street at commuting times, meaning that people did not change their daily routines but slightly adapted them to play the game.
Edit intent: fluency
Original:  Conversely, on Saturday and Sunday night, people indeed went out to play to places nearby their homes .
Revised:  Conversely, on Saturday and Sunday night, people indeed went out to play , but favored places close to where they live .
Edit intent: clarity
Original:  This is important, because results like these are expected to inform long-term infrastructure investments by city officials, jointly with public policies aimed at , for example, stimulating pedestrian traffic or suggesting alternative routes.
Revised:  This is important, because results like these are expected to inform long-term infrastructure investment by city officials, jointly with public policies aimed at , for example, stimulating pedestrian traffic or suggesting alternative routes.
Edit intent: fluency
Original:  This is important, because results like these are expected to inform long-term infrastructure investments by city officials, jointly with public policies aimed at , for example, stimulating pedestrian traffic or suggesting alternative routes.
Revised:  This is important, because results like these are expected to inform long-term infrastructure investments by city officials, and on the drafting of public policies aimed at , for example, stimulating pedestrian traffic or suggesting alternative routes.
Edit intent: clarity
Original:  This is important, because results like these are expected to inform long-term infrastructure investments by city officials, jointly with public policies aimed at , for example, stimulating pedestrian traffic or suggesting alternative routes.
Revised:  This is important, because results like these are expected to inform long-term infrastructure investments by city officials, jointly with public policies aimed at stimulating pedestrian traffic or suggesting alternative routes.
Edit intent: coherence
Original:  Originally formulated in discrete time,  we provide a framework for considering transfer entropy in continuous time systems .
Revised:  While transfer entropy was originally formulated in discrete time, we provide a framework for considering transfer entropy in continuous time systems .
Edit intent: clarity
Original:  Originally formulated in discrete time,  we provide a framework for considering transfer entropy in continuous time systems .
Revised:  Originally formulated in discrete time, in this paper we provide a framework for considering transfer entropy in continuous time systems .
Edit intent: clarity
Original:  We contrast our approach with previous attempts to formulate information flow between continuous time point processes within a discrete time framework, which incur issues that our continuous time approach naturally avoids.
Edit intent: coherence
Original:  Finally, we present two synthetic spiking neuron model examples to exhibit the pertinent features of our formalism, namely  that the information flow for point processes consists of discontinuous jump contributions (at spikes in the target) interrupting a continuously varying contribution (relating to waiting times between target spikes)  .
Revised:  Finally, we present two synthetic spiking neuron model examples to exhibit the pertinent features of our formalism, namely , that the information flow for point processes consists of discontinuous jump contributions (at spikes in the target) interrupting a continuously varying contribution (relating to waiting times between target spikes) .
Edit intent: fluency
Original:  Similarly, ingredients, flavors, and nutrition information are strong signals of the taste preferences of individuals from various parts of the world.
Revised:  Similarly, ingredients, flavors, and nutrition information become strong signals of the taste preferences of individuals from various parts of the world.
Edit intent: coherence
Original:  In this paper, we present a large-scale study of recipes published on the Web and their content, aiming to understand cuisines and culinary habits around the world.
Revised:  In this paper, we present a large-scale study of recipes published on the web and their content, aiming to understand cuisines and culinary habits around the world.
Edit intent: fluency
Original: As food and nutrition occupy an increasingly prevalent space on the web,  dishes and recipes shared online provide an invaluable mirror into culinary cultures and attitudes around the world.
Revised: Food and nutrition occupy an increasingly prevalent space on the web, dishes and recipes shared online provide an invaluable mirror into culinary cultures and attitudes around the world.
Edit intent: clarity
Original: As food and nutrition occupy an increasingly prevalent space on the web,  dishes and recipes shared online provide an invaluable mirror into culinary cultures and attitudes around the world.
Revised: As food and nutrition occupy an increasingly prevalent space on the web, and dishes and recipes shared online provide an invaluable mirror into culinary cultures and attitudes around the world.
Edit intent: coherence
Original:  Ingredients, flavors, and nutrition information become strong signals of the taste preferences of individuals and civilizations.
Revised:  More specifically, ingredients, flavors, and nutrition information become strong signals of the taste preferences of individuals and civilizations.
Edit intent: clarity
Original:  Our results confirm the strong effects of geographical and cultural similarities on recipes, health indicators, and culinary preferences between countries around the world .
Revised:  Our results confirm the strong effects of geographical and cultural similarities on recipes, health indicators, and culinary preferences across the globe .
Edit intent: clarity
Original:  The Fragmentation Index classified low versus high scores of PANSS negative subscale with 93\% accuracy (AUC=1), and predicted Schizophrenia diagnosis with 89\% accuracy (AUC=0.89)  . Interpretation: The structural randomness of speech graph connectedness is increased in Schizophrenia.
Revised:  The Fragmentation Index classified low versus high scores of PANSS negative subscale with 93\% accuracy (AUC=1), predicted Schizophrenia diagnosis with 89\% accuracy (AUC=0.89) . Interpretation: The structural randomness of speech graph connectedness is increased in Schizophrenia.
Edit intent: coherence
Original: Motivation: The investigation of topological modifications of the gene interaction networks in cancer cells is essential for understanding the desease.
Revised: Investigations of topological uniqueness of gene interaction networks in cancer cells is essential for understanding the desease.
Edit intent: clarity
Original: Motivation: The investigation of topological modifications of the gene interaction networks in cancer cells is essential for understanding the desease.
Revised: Motivation: The investigation of topological modifications of the gene interaction networks in cancer cells are essential for understanding the desease.
Edit intent: fluency
Original: Investigations of topological uniqueness of gene interaction networks in cancer cells are essential for understanding the disease.
Revised: Investigations of topological uniqueness of gene interaction networks in cancer cells are essential for understanding this disease.
Edit intent: clarity
Original:  The interaction matrices are formed using the Cancer Network Galaxy (TCNG) database, which is a repository of gene interactions inferred by a Bayesian network model.
Revised:  The interaction matrices are computed using the Cancer Network Galaxy (TCNG) database, which is a repository of gene interactions inferred by a Bayesian network model.
Edit intent: clarity
Original:  In TCNG database, 256 NCBI GEO entries regarding gene expressions in human cancer cells were selected for the Bayesian network calculations  .
Revised:  256 NCBI GEO entries regarding gene expressions in human cancer cells were selected for the Bayesian network calculations .
Edit intent: clarity
Original:  In TCNG database, 256 NCBI GEO entries regarding gene expressions in human cancer cells were selected for the Bayesian network calculations  .
Revised:  In TCNG database, 256 NCBI GEO entries regarding gene expressions in human cancer cells have been selected for the Bayesian network calculations .
Edit intent: clarity
Original:  In the opposite case, when the networks have small numbers of edges,  P(s) becomes the Poisson distribution.
Revised:  In the opposite case, when the networks have smaller numbers of edges, P(s) becomes the Poisson distribution.
Edit intent: fluency