wanyu/IteraTeR_v2 huggingface dataset:
Original:  The price dependence on the volume (averaged on the granularity)  is found to be a concave power law function <\phi(\omega,g)>_g\sim\omega^\delta with \delta\approx 0.58.
Revised:  The price dependence on the volume (averaged over the granularity) is found to be a concave power law function <\phi(\omega,g)>_g\sim\omega^\delta with \delta\approx 0.58.
Edit intent: fluency
Original:  We can see that\to  , even in intermediate situations of finite liquidity, this effect is indeed very large and it is a natural candidate for understanding the origin of large price fluctuations.
Revised:  We can see that\to , even in intermediate situations of finite liquidity, this effect can be very large and it is a natural candidate for understanding the origin of large price fluctuations.
Edit intent: clarity
Original:  A "proposal of the environment" is a stochastically generated vector of algebraic increments of  capitals.
Revised:  A "proposal of the environment" is a stochastically generated vector of algebraic increments of participants' capitals.
Edit intent: clarity
Original: We prove that two--way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one--way versions (1PFA's and 1QFA's), and two--way nondeterministic automata (2NFA's).
Revised: We prove that two-way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one--way versions (1PFA's and 1QFA's), and two--way nondeterministic automata (2NFA's).
Edit intent: fluency
Original: We prove that two--way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one--way versions (1PFA's and 1QFA's), and two--way nondeterministic automata (2NFA's).
Revised: We prove that two--way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one-way versions (1PFA's and 1QFA's), and two--way nondeterministic automata (2NFA's).
Edit intent: fluency
Original: We prove that two--way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one--way versions (1PFA's and 1QFA's), and two--way nondeterministic automata (2NFA's).
Revised: We prove that two--way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one--way versions (1PFA's and 1QFA's), and two-way nondeterministic finite automata (2NFA's).
Edit intent: fluency
Original:  Our model applies if the cell radius, R, is much smaller than the distance , R_{cs} , up to which carrier sensing is effective.
Revised:  Our model applies if the cell radius, R, is much smaller than the carrier sensing range , R_{cs} , up to which carrier sensing is effective.
Edit intent: clarity
Original:  We develop a scalable cell level model for such WLANs with saturated AP and STA queues as well as for TCP-controlled long file transfers .
Revised:  We develop a scalable cell level model for such WLANs with saturated AP and STA queues as well as for TCP-controlled long file transfers .
Edit intent: fluency
Original:  The accuracy of our model is demonstrated by comparison with ns-2 simulations.
Revised:  The accuracy of our model is demonstrated by comparison with ns-2 simulations.
Edit intent: fluency
Original:  Based on the insights provided by our analytical model, we also propose a simple decentralized algorithm which provides static channel assignments that are Nash equilibria in pure strategies for the objective of maximizing normalized network throughput in as many steps as there are channels.
Revised:  Based on the insights provided by our analytical model, we propose a simple decentralized algorithm which provides static channel assignments that are Nash equilibria in pure strategies for the objective of maximizing normalized network throughput in as many steps as there are channels.
Edit intent: clarity
Original:  Based on the insights provided by our analytical model, we also propose a simple decentralized algorithm which provides static channel assignments that are Nash equilibria in pure strategies for the objective of maximizing normalized network throughput in as many steps as there are channels.
Revised:  Based on the insights provided by our analytical model, we also propose a simple decentralized algorithm which provides static channel assignments that are Nash equilibria in pure strategies for the objective of maximizing normalized network throughput in as many steps as there are channels.
Edit intent: fluency
Original:  Based on the insights provided by our analytical model, we also propose a simple decentralized algorithm which provides static channel assignments that are Nash equilibria in pure strategies for the objective of maximizing normalized network throughput in as many steps as there are channels.
Revised:  Based on the insights provided by our analytical model, we also propose a simple decentralized algorithm which provides static channel assignments that are Nash equilibria in pure strategies for the objective of maximizing in as many steps as there are channels.
Edit intent: clarity
Original:  In contrast to prior work, our approach to channel assignment is based on the throughput metric .
Revised:  In contrast to prior work, our approach to channel assignment is based on the throughput metric .
Edit intent: fluency
Original:  Simplifications of his procedure and relaxations of its restrictions were subsequently exhibited in several publications [Alo91, MR98, CS00, Mos06, Sri08, Mos08a ].
Revised:  Simplifications of his procedure and relaxations of its restrictions were subsequently exhibited in several publications [Alo91, MR98, CS00, Mos06, Sri08, Mos08 ].
Edit intent: clarity
Original: Summary: CLeFAPS, a fast and flexible pairwise structural alignment algorithm based on a rigid-body framework, namely CLePAPS, is proposed.
Revised:  CLeFAPS, a fast and flexible pairwise structural alignment algorithm based on a rigid-body framework, namely CLePAPS, is proposed.
Edit intent: coherence
Original:  Results: We perform a comparison between CLeFAPS and other popular algorithms including rigid-body and flexible on a closely-related protein benchmark (HOMSTRAD) and a distantly-related protein benchmark (SABmark) while the latter is also for the discrimination test, the result shows that CLeFAPS is competitive with or even outperforms other algorithms while the running time is only 1/150 to 1/50 of them.
Revised:  We perform a comparison between CLeFAPS and other popular algorithms including rigid-body and flexible on a closely-related protein benchmark (HOMSTRAD) and a distantly-related protein benchmark (SABmark) while the latter is also for the discrimination test, the result shows that CLeFAPS is competitive with or even outperforms other algorithms while the running time is only 1/150 to 1/50 of them.
Edit intent: coherence
Original:  In this paper, we present a bidirectional quantum associative memory model for the Black-Scholes--like option price evolution, consisting of a pair of coupled NLS equations, one governing the stochastic volatility and the other governing the option price, both self-organizing in an adaptive `market heat potential', trained by continuous Hebbian learning.
Revised:  In this paper, we present a bidirectional quantum associative memory model for the Black--Scholes--like option price evolution, consisting of a pair of coupled NLS equations, one governing the stochastic volatility and the other governing the option price, both self-organizing in an adaptive `market heat potential', trained by continuous Hebbian learning.
Edit intent: fluency
Original: We propose a new generic framework for option price modelling, using quantum neural computation formalism.
Revised: We propose a new cognitive framework for option price modelling, using quantum neural computation formalism.
Edit intent: clarity
Original:  Its more technically challenging , dealing with issues of distributed computing, such as latency, differential resource management, and additional security requirements.
Revised:  It is more technically challenging , dealing with issues of distributed computing, such as latency, differential resource management, and additional security requirements.
Edit intent: fluency
Original:  Its more technically challenging , dealing with issues of distributed computing, such as latency, differential resource management, and additional security requirements.
Revised:  Its more technically challenging to deal with issues of distributed computing, such as latency, differential resource management, and additional security requirements.
Edit intent: fluency
Original:  However, these are not insurmountable challenges, and with the need to retain control over our digital lives and the potential environmental consequences, its one we must pursue.
Revised:  However, these are not insurmountable challenges, and with the need to retain control over our digital lives and the potential environmental consequences, it is a challenge we must pursue.
Edit intent: clarity
Original:  We provide equations for thread extraction, i.e.  C's program semantics , and we distinguish behavioral equivalence and congruence .
Revised:  We provide equations for thread extraction, i.e. , C's program semantics , and we distinguish behavioral equivalence and congruence .
Edit intent: fluency
Original:  We provide equations for thread extraction, i.e.  C's program semantics , and we distinguish behavioral equivalence and congruence .
Revised:  We provide equations for thread extraction, i.e. C's program semantics .
Edit intent: coherence
Original:  Finally we axiomatize structural congruence under which we can exclude chained jumps and discuss some expressiveness results.
Revised:  Finally we discuss some expressiveness results.
Edit intent: coherence
Original:  This phase transition extend the principle of competitive exlusion to open ecosystems and might be relevant for the study of the impact of invasive species in native ecologies.
Revised:  This phase transition extend the principle of competitive exclusion to open ecosystems and might be relevant for the study of the impact of invasive species in native ecologies.
Edit intent: fluency
Original: It is demonstrated that local columnar firings of neocortex, as modeled by a Statistical Mechanics of Neocortical Interactions (SMNI), supports multiple firing regions of multiple oscillatory processing , at frequencies consistent with observed regional electroencephalography (EEG).
Revised: Columnar firings of neocortex, as modeled by a Statistical Mechanics of Neocortical Interactions (SMNI), supports multiple firing regions of multiple oscillatory processing , at frequencies consistent with observed regional electroencephalography (EEG).
Edit intent: clarity
Original: It is demonstrated that local columnar firings of neocortex, as modeled by a Statistical Mechanics of Neocortical Interactions (SMNI), supports multiple firing regions of multiple oscillatory processing , at frequencies consistent with observed regional electroencephalography (EEG).
Revised: It is demonstrated that local columnar firings of neocortex, modeled by a Statistical Mechanics of Neocortical Interactions (SMNI), supports multiple firing regions of multiple oscillatory processing , at frequencies consistent with observed regional electroencephalography (EEG).
Edit intent: clarity
Original: It is demonstrated that local columnar firings of neocortex, as modeled by a Statistical Mechanics of Neocortical Interactions (SMNI), supports multiple firing regions of multiple oscillatory processing , at frequencies consistent with observed regional electroencephalography (EEG).
Revised: It is demonstrated that local columnar firings of neocortex, as modeled by a statistical mechanics of neocortical interactions (SMNI), supports multiple firing regions of multiple oscillatory processing , at frequencies consistent with observed regional electroencephalography (EEG).
Edit intent: fluency
Original: It is demonstrated that local columnar firings of neocortex, as modeled by a Statistical Mechanics of Neocortical Interactions (SMNI), supports multiple firing regions of multiple oscillatory processing , at frequencies consistent with observed regional electroencephalography (EEG).
Revised: It is demonstrated that local columnar firings of neocortex, as modeled by a Statistical Mechanics of Neocortical Interactions (SMNI), are investigated for conditions of oscillatory processing at frequencies consistent with observed regional electroencephalography (EEG).
Edit intent: clarity
Original: It is demonstrated that local columnar firings of neocortex, as modeled by a Statistical Mechanics of Neocortical Interactions (SMNI), supports multiple firing regions of multiple oscillatory processing , at frequencies consistent with observed regional electroencephalography (EEG).
Revised: It is demonstrated that local columnar firings of neocortex, as modeled by a Statistical Mechanics of Neocortical Interactions (SMNI), supports multiple firing regions of multiple oscillatory processing , at frequencies consistent with observed electroencephalography (EEG).
Edit intent: clarity
Original:  equations  of the SMNI Lagrangian , giving most likely states of the system, are performed for three prototypical cases, predominately excitatory columnar firings, predominately inhibitory columnar firings, and in between balanced columnar firings, with and without a centering mechanism ( based on observed changes in stochastic background of presynaptic interactions) which pulls more stable states into the physical firings ranges.
Revised:  equations of the SMNI probability distribution , giving most likely states of the system, are performed for three prototypical cases, predominately excitatory columnar firings, predominately inhibitory columnar firings, and in between balanced columnar firings, with and without a centering mechanism ( based on observed changes in stochastic background of presynaptic interactions) which pulls more stable states into the physical firings ranges.
Edit intent: clarity
Original:  equations  of the SMNI Lagrangian , giving most likely states of the system, are performed for three prototypical cases, predominately excitatory columnar firings, predominately inhibitory columnar firings, and in between balanced columnar firings, with and without a centering mechanism ( based on observed changes in stochastic background of presynaptic interactions) which pulls more stable states into the physical firings ranges.
Revised:  equations of the SMNI Lagrangian , giving most likely states of the system, are performed for three prototypical Cases, dominate excitatory columnar firings, predominately inhibitory columnar firings, and in between balanced columnar firings, with and without a centering mechanism ( based on observed changes in stochastic background of presynaptic interactions) which pulls more stable states into the physical firings ranges.
Edit intent: fluency
Original:  equations  of the SMNI Lagrangian , giving most likely states of the system, are performed for three prototypical cases, predominately excitatory columnar firings, predominately inhibitory columnar firings, and in between balanced columnar firings, with and without a centering mechanism ( based on observed changes in stochastic background of presynaptic interactions) which pulls more stable states into the physical firings ranges.
Revised:  equations of the SMNI Lagrangian , giving most likely states of the system, are performed for three prototypical cases, predominately excitatory columnar firings, dominate inhibitory columnar firings, and in between balanced columnar firings, with and without a centering mechanism ( based on observed changes in stochastic background of presynaptic interactions) which pulls more stable states into the physical firings ranges.
Edit intent: fluency
Original:  equations  of the SMNI Lagrangian , giving most likely states of the system, are performed for three prototypical cases, predominately excitatory columnar firings, predominately inhibitory columnar firings, and in between balanced columnar firings, with and without a centering mechanism ( based on observed changes in stochastic background of presynaptic interactions) which pulls more stable states into the physical firings ranges.
Revised:  equations of the SMNI Lagrangian , giving most likely states of the system, are performed for three prototypical cases, predominately excitatory columnar firings, predominately inhibitory columnar firings, and in-between balanced columnar firings, with and without a centering mechanism ( based on observed changes in stochastic background of presynaptic interactions) which pulls more stable states into the physical firings ranges.
Edit intent: fluency
Original:  equations  of the SMNI Lagrangian , giving most likely states of the system, are performed for three prototypical cases, predominately excitatory columnar firings, predominately inhibitory columnar firings, and in between balanced columnar firings, with and without a centering mechanism ( based on observed changes in stochastic background of presynaptic interactions) which pulls more stable states into the physical firings ranges.
Revised:  equations of the SMNI Lagrangian , giving most likely states of the system, are performed for three prototypical cases, predominately excitatory columnar firings, predominately inhibitory columnar firings, and in between balanced columnar firings, with and without a Centering mechanism (CM) ( based on observed changes in stochastic background of presynaptic interactions) which pulls more stable states into the physical firings ranges.
Edit intent: clarity
Original:  Including the CM with other proposed mechanisms for columnar-glial interactions and for glial-presynaptic background interactions, a path for future investigations is outlined to test for quantum interactions, enhanced by magnetic fields from columnar EEG , that directly support cerebral STM and computation by controlling presynaptic noise .
Revised:  Including the CM with other proposed mechanisms for columnar-glial interactions and for glial-presynaptic background interactions, a path for future investigations is outlined to test for quantum interactions, enhanced by magnetic fields from columnar EEG , that directly support cerebral STM and computation by controlling presynaptic noiseMethod .
Edit intent: clarity
Original:  Including the CM with other proposed mechanisms for columnar-glial interactions and for glial-presynaptic background interactions, a path for future investigations is outlined to test for quantum interactions, enhanced by magnetic fields from columnar EEG , that directly support cerebral STM and computation by controlling presynaptic noise .
Revised:  Including the CM with other proposed mechanisms for columnar-glial interactions and for glial-presynaptic background interactions, a path for future investigations is outlined to test for quantum interactions, enhanced by magnetic fields from columnar EEG , that directly support cerebral STM and computation by controlling presynaptic noiseResults .
Edit intent: clarity
Original:  Including the CM with other proposed mechanisms for columnar-glial interactions and for glial-presynaptic background interactions, a path for future investigations is outlined to test for quantum interactions, enhanced by magnetic fields from columnar EEG , that directly support cerebral STM and computation by controlling presynaptic noise .
Revised:  Including the CM with other proposed mechanisms for columnar-glial interactions and for glial-presynaptic background interactions, a path for future investigations is outlined to test for quantum interactions, enhanced by magnetic fields from columnar EEG , that directly support cerebral STM and computation by controlling presynaptic noiseConclusion .
Edit intent: clarity
Original: The stability of dynamical states characterized by a uniform firing rate ( splay states {\it  ) is analyzed in a network of N globally pulse-coupled rotators (neurons) subject to a generic velocity field.
Revised: The stability of dynamical states characterized by a uniform firing rate ( {\it ) is analyzed in a network of N globally pulse-coupled rotators (neurons) subject to a generic velocity field.
Edit intent: clarity
Original:  In particular, we analyse short-wavelength modes that were known to be marginally stable in the infinite N limit and show that the corresponding Floquet exponent scale as 1/N^2. Moreover, we find that the sign  and thereby the stability  of this spectral component is determined by the sign of the average derivative of the velocity field.
Revised:  In particular, we analyse short-wavelength modes that were known to be marginally stable in the infinite N limit and show that the corresponding Floquet exponent scale as 1/N^2. Moreover, we find that the sign , and thereby the stability of this spectral component is determined by the sign of the average derivative of the velocity field.
Edit intent: fluency
Original:  In particular, we analyse short-wavelength modes that were known to be marginally stable in the infinite N limit and show that the corresponding Floquet exponent scale as 1/N^2. Moreover, we find that the sign  and thereby the stability  of this spectral component is determined by the sign of the average derivative of the velocity field.
Revised:  In particular, we analyse short-wavelength modes that were known to be marginally stable in the infinite N limit and show that the corresponding Floquet exponent scale as 1/N^2. Moreover, we find that the sign and thereby the stability , of this spectral component is determined by the sign of the average derivative of the velocity field.
Edit intent: fluency
Original:  In the intermediate case of continuous velocity fields, the Floquet exponents scale faster than 1/N^2  and we even find strictly neutral directions in a wider class , than the sinusoidal velocity fields considered by Watanabe and Strogatz in {\it Physica D 74 (1994) 197-253 .
Revised:  In the intermediate case of continuous velocity fields, the Floquet exponents scale faster than 1/N^2 and we even find strictly neutral directions in a wider class than the sinusoidal velocity fields considered by Watanabe and Strogatz in {\it Physica D 74 (1994) 197-253 .
Edit intent: fluency
Original:  The experiments show that our algorithm performs comparative to or better than Long Run and Expansion Algorithm, especially on many long sequences.
Revised:  The experiments show that the results of DEA algorithm are better than those of Long Run and Expansion Algorithm, especially on many long sequences.
Edit intent: clarity
Original:  This problem is NP-complete, but because of its importance, many heuristic algorithms have been proposed, such as Long Run algorithm and Expansion Algorithm .
Revised:  This problem is NP-complete, but because of its importance, many heuristic algorithms have been proposed, such as Long Run algorithm and Expansion algorithm .
Edit intent: fluency
Original:  However, the performances of many current heuristic algorithms are not very good, especially on datasets with many long sequences .
Revised:  However, the performance of many current heuristic algorithms are not very good, especially on datasets with many long sequences .
Edit intent: coherence
Original:  However, the performances of many current heuristic algorithms are not very good, especially on datasets with many long sequences .
Revised:  However, the performances of many current heuristic algorithms deteriorates fast when the number of sequences and sequence length increase .
Edit intent: clarity
Original:  The experiments show that the results of DEA algorithm are better than those of Long Run and Expansion Algorithm , especially on many long sequences.
Revised:  The experiments show that the results of DEA algorithm are better than those of Long Run and Expansion algorithm , especially on many long sequences.
Edit intent: fluency