wanyu/IteraTeR_full_sent huggingface dataset:
Original: Biological agents still outperform the artificial counterparts in navigating the first-visited environments, even with the advance of deep neural networks nowadays. To bridge this gap, by taking the localization problem as the initial step, we investigate the localization principles in mammalian brains to establish the common localization framework in both biological and artificial systems. Furthermore, inspired by the grid cells discovered in mammalian brains, a localization algorithm with circular representation is proposed. Compatible with bearing-and-distance measurement, the proposed algorithms avoid the linearization inconsistency which remains a severe problem in conventional extended Kalman filter algorithms. As the effectiveness of the proposed algorithms shown in simulation results, this paper indicates a novel localization method that is promising to further tackle the simultaneous localization and mapping (SLAM) problem .
Revised: Extended Kalman filter (EKF) does not guarantee consistent mean and covariance under linearization, even though it is the main framework for robotic localization. While Lie group improves the modeling of the state space in localization, the EKF on Lie group still relies on the arbitrary Gaussian assumption in face of nonlinear models. We instead use von Mises filter for orientation estimation together with the conventional Kalman filter for position estimation, and thus we are able to characterize the first two moments of the state estimates. Since the proposed algorithm holds a solid probabilistic basis, it is fundamentally relieved from the inconsistency problem. Furthermore, we extend the localization algorithm to fully circular representation even for position, which is similar to grid patterns found in mammalian brains and in recurrent neural networks. The applicability of the proposed algorithms shown in simulation results, this paper indicates a novel localization method that is promising to further tackle the simultaneous localization and mapping (SLAM) problem .
Edit intent: meaning-changed
Original:  However, rate coding, one of the techniques used in modeling the SNNs, suffers from long latency due to its inability to transmit sufficient information to a subsequent neuron and this could have a catastrophic effect on a deeper SNN model. Another type of neural coding, called phase coding, also determines the amount of information being transmitted according to a global reference oscillator, and therefore, is inefficient in hidden layers where dynamics of neurons can change .
Revised:  However, most of the previous studies have not achieved satisfactory results in terms of inference speed and energy efficiency .
Edit intent: coherence
Original:  In this paper, we propose a deep SNN model that can transmit information faster, and more efficiently between neurons by adopting a notion of burst spiking. Furthermore, we introduce a novel hybrid neural coding scheme that uses different neural coding schemes for different types of layers .
Revised:  In this paper, we propose a fast and energy-efficient information transmission method with burst spikes and hybrid neural coding scheme that uses different neural coding schemes for different types of layers .
Edit intent: clarity
Original:  Our experimental results for various image classification datasets, such as MNIST, CIFAR-10 and CIFAR-100, showed that the proposed methods can improve inference  efficiency and shorten the latency while preserving high accuracy.
Revised:  Our experimental results for various image classification datasets, such as MNIST, CIFAR-10 and CIFAR-100, showed that the proposed methods can improve inference energy efficiency and shorten the latency while preserving high accuracy.
Edit intent: meaning-changed
Original:  Our experimental results for various image classification datasets, such as MNIST, CIFAR-10 and CIFAR-100, showed that the proposed methods can improve inference  efficiency and shorten the latency while preserving high accuracy. Lastly, we validated the proposed methods through firing pattern analysis .
Revised:  Our experimental results for various image classification datasets, such as MNIST, CIFAR-10 and CIFAR-100, showed that the proposed methods can improve inference efficiency and shorten the latency .
Edit intent: coherence
Original:  Upon comparing the results of our study with the ones obtained by analysing the World Trade Web, important structural differences emerge, in particular, the bipartite representation of the latter is not characterized by a similar block-structure, as the modularity maximization fails in revealing (bipartite) nodes clusters.
Revised:  Important structural differences emerge upon comparing the Colombian firms-products network with the World Trade Web, important structural differences emerge, in particular, the bipartite representation of the latter is not characterized by a similar block-structure, as the modularity maximization fails in revealing (bipartite) nodes clusters.
Edit intent: meaning-changed
Original:  Upon comparing the results of our study with the ones obtained by analysing the World Trade Web, important structural differences emerge, in particular, the bipartite representation of the latter is not characterized by a similar block-structure, as the modularity maximization fails in revealing (bipartite) nodes clusters.
Revised:  Upon comparing the results of our study with the ones obtained by analysing the World Trade Web, in particular, the bipartite representation of the latter is not characterized by a similar block-structure, as the modularity maximization fails in revealing (bipartite) nodes clusters.
Edit intent: clarity
Original:  This points out that economic systems behave differently at different scales: while countries tend to diversify their production - potentially exporting a large number of different products - firms specialize in exporting (substantially very limited) baskets of basically homogeneous products.
Revised:  This points out that economic systems behave differently at different scales: while countries tend to diversify their production --potentially exporting a large number of different products - firms specialize in exporting (substantially very limited) baskets of basically homogeneous products.
Edit intent: fluency
Original:  This points out that economic systems behave differently at different scales: while countries tend to diversify their production - potentially exporting a large number of different products - firms specialize in exporting (substantially very limited) baskets of basically homogeneous products.
Revised:  This points out that economic systems behave differently at different scales: while countries tend to diversify their production - potentially exporting a large number of different products-- firms specialize in exporting (substantially very limited) baskets of basically homogeneous products.
Edit intent: fluency
Original: In this paper, the UNNCyberHeart Database (UNNDB ) of ECG signals is presented for validation of ECG signals delineation algorithms. The database consists of 200  10-second 12-lead ECG signal records representing a wide class of different morphologies of the ECG signal .
Revised: In this paper, the UNNCyberHeart Database (UNNDB ) of ECG signals that contains 200 10-second 12-lead ECG signal records representing a wide class of different morphologies of the ECG signal .
Edit intent: clarity
Original:   In addition, all records have a complex diagnosis. With this database a new algorithm for delineation of the ECG signal was successfully tested, taking into account the set of ECG signal leads and automatically determining the morphologies of the complexes. Earlier this algorithm showed competitive accuracy on QTDB database, which has only 2 leads. All the advantages of the developed algorithm were completely revealed when analyzing the fully annotated 12-lead database presentedin this paper .
Revised:  In addition, all records have an attributed diagnosis. These features make LUDB a promising tool for validating ECG delineation algorithms across a broad range of ECG signal shapes and patient diagnoses. A case study for the recently proposed wavelet-based algorithm is presented .
Edit intent: clarity
Original: We report a new Lobachevsky University database (LUDB) of ECG signals that contains 200 samples of 10-second 12-lead electrocardiograms (ECG) from different subjects.
Revised: We report Lobachevsky University Database (LUDB) of ECG signals that contains 200 samples of 10-second 12-lead electrocardiograms (ECG) from different subjects.
Edit intent: clarity
Original: We report a new Lobachevsky University database (LUDB) of ECG signals that contains 200 samples of 10-second 12-lead electrocardiograms (ECG) from different subjects.
Revised: We report a new Lobachevsky University database (LUDB) of ECG signals that contains 200 recordings of 10-second 12-lead electrocardiograms (ECG) from different subjects.
Edit intent: clarity
Original:  The boundaries of the ECG signal complexes are manually annotated by cardiologists for all samples and independently for each lead . The database is representative of a variety of signal morphologies .
Revised:  The boundaries of the ECG signal complexes are manually annotated by cardiologists for all samples and independently for each lead , and all records received an expert classification by abnormalities. In addition, the database is representative of a variety of signal morphologies .
Edit intent: meaning-changed
Original: We report Lobachevsky University Database (LUDB) of ECG signals that contains 200 recordings of 10-second 12-lead electrocardiograms (ECG) from different subjects  .
Revised: We report Lobachevsky University Database (LUDB) of ECG signals , an open tool for validating ECG delineation algorithms, that is superior to the existing publicly available data bases in several aspects. LUDB contains 200 recordings of 10-second 12-lead electrocardiograms (ECG) from different subjects .
Edit intent: meaning-changed
Original: We report Lobachevsky University Database (LUDB) of ECG signals that contains 200 recordings of 10-second 12-lead electrocardiograms (ECG) from different subjects  .
Revised: We report Lobachevsky University Database (LUDB) of ECG signals that contains 200 recordings of 10-second 12-lead electrocardiograms (ECG) from different subjects , representative of a variety of signal morphologies .
Edit intent: meaning-changed
Original: In this paper , we propose and analyze a class of stochastic N-player games where the original one player game is a two-dimensional stochastic control problem. Three different constraints are considered: pooling, dividing and sharing. The controlled dynamics under the Nash Equilibrium is derived via solving a system of free boundary problems where the boundary is "moving" in the sense that it depends on both the state of the players and the control strategies of other players.
Revised: In this paper , we propose and analyze a class of stochastic N-player games that includes finite fuel stochastic games as a special case. We first derive sufficient conditions for the Nash equilibrium (NE) in the form of a verification theorem, which reveals an essential game component regarding the interaction among players. It is an analytical representation of the conditional optimality condition for NEs, largely missing in the existing literature on stochastic games. The derivation of NEs involves first solving a multi-dimensional free boundary problem and then a Skorokhod problem, where the boundary is "moving" in the sense that it depends on both the state of the players and the control strategies of other players.
Edit intent: meaning-changed
Original:  The controlled dynamics under the Nash Equilibrium is derived via solving a system of free boundary problems where the boundary is "moving" in the sense that it depends on both the state of the players and the control strategies of other players.
Revised:  The controlled dynamics under the Nash Equilibrium is derived via solving a system of free boundary problems where the boundary is "moving" in that it depends on both the state of the players and the control strategies of other players.
Edit intent: clarity
Original:  The controlled dynamics under the Nash Equilibrium is derived via solving a system of free boundary problems where the boundary is "moving" in the sense that it depends on both the state of the players and the control strategies of other players.
Revised:  The controlled dynamics under the Nash Equilibrium is derived via solving a system of free boundary problems where the boundary is "moving" in the sense that it depends on both the changes of the system and the control strategies of other players.
Edit intent: clarity
Original:  Pricing exotic derivatives often involves Monte Carlo simulations, which rely on stochastic processes to model the underlyings . It is thus critical to choose appropriate models and precisely calibrate them, so that they reflect the market scenario.
Revised:  Pricing exotic derivatives often involves Monte Carlo simulations, which rely on stochastic processes to model the underlyings : it is thus critical to choose appropriate models and precisely calibrate them, so that they reflect the market scenario.
Edit intent: fluency
Original:  This paper presents a simple and general method to compute the covariance matrix of the state though a matrix Lyapunov differential equation, and discusses its numerical and analytical solutions . In terms of computational speed, the latter is found to be 30 to 40 times faster .
Revised:  This paper presents a simple and general method to compute the covariance matrix of the state though a matrix Lyapunov differential equation, and discusses its numerical and analytical solutions .
Edit intent: coherence
Original: Deregulation of energy markets in the 90s boosted the interest in energy derivatives. Over the last two decades, more and more complex financial instruments were developed. Pricing exotic derivatives often involves Monte Carlo simulations, which rely on stochastic processes to model the underlyings: it is thus critical to choose appropriate models and precisely calibrate them, so that they reflect the market scenario. Several models have been proposed in the literature , from the simple geometric Brownian motion to more complex mean-reverting, multi-factor models. To enable their calibration against listed vanilla options, it is required to compute the variance of their states. This paper presents a simple and general method to compute the covariance matrix of the state though a matrix Lyapunov differential equation , and discusses its numerical and analytical solutions .
Revised: A general method is presented to compute the variance of a linear stochastic process through a matrix Lyapunov differential equation. This approach, adopted from control theory, is alternative and easier with respect to the classical arguments found in quantitative finance literature and can be readily applied to high-dimensional models. Both analytical and numerical methods to solve the Lyapunov equation are discussed and compared in terms of computational efficiency. A practical application is presented, where numerical and analytical solutions .
Edit intent: coherence
Original:  This paper presents a simple and general method to compute the covariance matrix of the state though a matrix Lyapunov differential equation , and discusses its numerical and analytical solutions . The availability of an analytical solution paves the way to an efficient market calibration of model parameters .
Revised:  This paper presents a simple and general method to compute the covariance matrix of the state though a matrix Lyapunov differential equation , and discusses its numerical and analytical solutions for the variance of a two-factor mean-reverting model are embedded into the Black pricing framework and market calibration of model parameters .
Edit intent: meaning-changed
Original:  The availability of an analytical solution paves the way to an efficient market calibration of model parameters . As case studies, EEX German electricity and TTF Dutch gas markets were considered. Two different single-factor models and a two-factor one were calibrated against market prices: out-of-sample validation showed that a two-factor model outperforms the other two approaches .
Revised:  The availability of an analytical solution paves the way to an efficient market calibration of model parameters is performed. It is shown that the availability of an analytical formula for the variance makes the calibration 14 times faster, thus proving the practical value of tractable and general methods to derive it .
Edit intent: meaning-changed
Original: A general method is presented to compute the variance of a linear stochastic process through a matrix Lyapunov differential equation.
Revised: Energy companies need efficient procedures to perform market calibration of stochastic models for commodities. If the Black framework is chosen for option pricing, the bottleneck of market calibration is the computation of the variance of the asset. For energy commodities, it is common to adopt multi-factor linear models, whose variance obeys a matrix Lyapunov differential equation.
Edit intent: meaning-changed
Original:  This approach, adopted from control theory, is alternative and easier with respect to the classical arguments found in quantitative finance literature and can be readily applied to high-dimensional models. Both analytical and numerical methods to solve the Lyapunov equation are discussed and compared in terms of computational efficiency.
Revised:  In this paper, both analytical and numerical methods to solve the Lyapunov equation are discussed and compared in terms of computational efficiency.
Edit intent: coherence
Original:  A practical application is presented, where numerical and analytical solutions for the variance of a two-factor mean-reverting model are embedded into the Black pricing framework and market calibration of model parameters is performed.
Revised:  The Lyapunov approach illustrated herein is more straightforward than ad-hoc derivations found in the quantitative finance literature and can be readily extended by a practitioner to higher-dimensional models. A practical case study is presented, where numerical and analytical solutions for the variance of a two-factor mean-reverting model are embedded into the Black pricing framework and market calibration of model parameters is performed.
Edit intent: meaning-changed
Original:  A practical application is presented, where numerical and analytical solutions for the variance of a two-factor mean-reverting model are embedded into the Black pricing framework and market calibration of model parameters is performed. It is shown that the availability of an analytical formula for the variance makes the calibration 14 times faster , thus proving the practical value of tractable and general methods to derive it .
Revised:  A practical application is presented, where numerical and analytical solutions for the variance of a two-factor mean-reverting model are embedded into the Black formulae and the model parameters are then calibrated against listed options. In particular, the analytical and numerical method are compared, showing that the former makes the calibration 14 times faster , thus proving the practical value of tractable and general methods to derive it .
Edit intent: clarity
Original:  In this paper, both analytical and numerical methods to derive the variance through a Lyapunov equation are discussedand compared in terms of computational efficiency. The Lyapunov approach illustrated herein is more straightforward than ad-hoc derivations found in the quantitative finance literature and can be readily extended by a practitioner to higher-dimensional models.
Revised:  In this paper, both analytical and numerical methods to derive the variance are discussed: the Lyapunov approach is shown to be more straightforward than ad-hoc derivations found in the quantitative finance literature and can be readily extended by a practitioner to higher-dimensional models.
Edit intent: clarity
Original:  In the case of enzyme catalyzed reaction , it is often overlooked that the characteristic timescales used for the scaling of reaction rates are not ideal for determining when concentrations and production rates reach their maximum values.
Revised:  In the case of enzyme catalyzed reactions , it is often overlooked that the characteristic timescales used for the scaling of reaction rates are not ideal for determining when concentrations and production rates reach their maximum values.
Edit intent: fluency
Original:  In the case of enzyme catalyzed reaction , it is often overlooked that the characteristic timescales used for the scaling of reaction rates are not ideal for determining when concentrations and production rates reach their maximum values.
Revised:  In the case of enzyme catalyzed reaction , it is often overlooked that the characteristic timescales used for the scaling the rate equations are not ideal for determining when concentrations and production rates reach their maximum values.
Edit intent: clarity
Original:  In the case of enzyme catalyzed reaction , it is often overlooked that the characteristic timescales used for the scaling of reaction rates are not ideal for determining when concentrations and production rates reach their maximum values.
Revised:  In the case of enzyme catalyzed reaction , it is often overlooked that the characteristic timescales used for the scaling of reaction rates are not ideal for determining when concentrations and reaction rates reach their maximum values.
Edit intent: clarity
Original: We consider a scale-free network of inhibitory Hindmarsh-Rose (HR) bursting neurons, and investigate coupling-induced  burst synchronization by varying the average coupling strength J_0. When passing a lower threshold J^*_l  , a transition from desynchronization to 3-cluster burst synchronization occurs due to a constructive role of  inhibition to favor the cluster burst synchronization.
Revised: We consider a scale-free network of inhibitory Hindmarsh-Rose (HR) bursting neurons, and investigate coupling-induced cluster burst synchronization by varying the average coupling strength J_0. When passing a lower threshold J^*_l , a transition from desynchronization to 3-cluster burst synchronization occurs due to a constructive role of inhibition to favor the cluster burst synchronization.
Edit intent: fluency
Original: We consider a scale-free network of inhibitory Hindmarsh-Rose (HR) bursting neurons, and investigate coupling-induced  burst synchronization by varying the average coupling strength J_0. When passing a lower threshold J^*_l  , a transition from desynchronization to 3-cluster burst synchronization occurs due to a constructive role of  inhibition to favor the cluster burst synchronization.
Revised: We consider a scale-free network of inhibitory Hindmarsh-Rose (HR) bursting neurons, and investigate coupling-induced burst synchronization by varying the average coupling strength J_0. For sufficiently small J_0, non-cluster desynchronized states exist. However, when passing a critical point J^*_c~(\simeq 0.16), the whole population is segregated into 3 clusters via a constructive role of synaptic inhibition to stimulate dynamical clustering between individual burstings, and thus 3-cluster desynchronized states appear. As J_0 is further increased and passes a lower threshold J^*_l , a transition from desynchronization to 3-cluster burst synchronization occurs due to a constructive role of inhibition to favor the cluster burst synchronization.
Edit intent: meaning-changed