wanyu/IteraTeR_v2 huggingface dataset:
Original:  The main contributions of this paper are a new, bounded form of the%DIFDELCMD < \tt %%% SpAMM product and demonstration of a new, algebraic locality that develops under contractive identity iteration, involving the deflation of volumes onto plane diagonals of the resolvent, and a stronger bound on the \tt SpAMM product .
Revised:  The main contributions of this paper are a new, bounded form of the%DIFDELCMD < \tt %%% SpAMM product and demonstration of a new, algebraic locality that develops under contractive identity iteration, with collapse of the metric-subspace onto the identity's plane diagonal, resulting in a stronger \tt SpAMM product .
Edit intent: clarity
Original:  The main contributions of this paper are a new, bounded form of the%DIFDELCMD < \tt %%% SpAMM product and demonstration of a new, algebraic locality that develops under contractive identity iteration, involving the deflation of volumes onto plane diagonals of the resolvent, and a stronger bound on the \tt SpAMM product .
Revised:  The main contributions of this paper are a new, bounded form of the%DIFDELCMD < \tt %%% SpAMM product and demonstration of a new, algebraic locality that develops under contractive identity iteration, involving the deflation of volumes onto plane diagonals of the resolvent, and a stronger bound on the \tt SpAMM bound .
Edit intent: clarity
Original:  Also, we carry out a first order Fr\"echet analyses for single and dual channel instances of the square root iteration, and look at bifurcations due to ill-conditioning and a too-aggressive \tt SpAMM approximation.
Revised:  Also, we carry out a first order Fr\"echet analyses for single and dual channel instances of the square root iteration, and look at bifurcations due to ill-conditioning and a too aggressive \tt SpAMM approximation.
Edit intent: fluency
Original:  We identify the `` Posner molecule", Ca_9 (PO_4)_6, as the unique molecule that can protect the neural qubits on very long times and thereby serve as a (working) quantum-memory.
Revised:  We identify the " Posner molecule", Ca_9 (PO_4)_6, as the unique molecule that can protect the neural qubits on very long times and thereby serve as a (working) quantum-memory.
Edit intent: fluency
Original:  A mechanism for transporting Posner molecules into presynaptic neurons during a `` kiss and run" exocytosis, which releases neurotransmitters into the synaptic cleft, is proposed.
Revised:  A mechanism for transporting Posner molecules into presynaptic neurons during a " kiss and run" exocytosis, which releases neurotransmitters into the synaptic cleft, is proposed.
Edit intent: fluency
Original:  Specifically, we propose a new approach named energy group-buying with load sharing, in which the two MNOs are aggregated as a single group to make the day-ahead and real-time energy purchase, and their base stations (BSs) share the wireless traffic to maximally turn lightly-loaded BSs into sleep mode.
Revised:  Specifically, we propose a new approach named energy group buying with load sharing, in which the two MNOs are aggregated as a single group to make the day-ahead and real-time energy purchase, and their base stations (BSs) share the wireless traffic to maximally turn lightly-loaded BSs into sleep mode.
Edit intent: fluency
Original:  When the two MNOs belong to the same entity and aim to minimize their total energy cost, we use the two-stage stochastic programming to obtain the optimal day-ahead and real-time energy group-buying associated with wireless load sharing.
Revised:  When the two MNOs belong to the same entity and aim to minimize their total energy cost, we use the two-stage stochastic programming to obtain the optimal day-ahead and real-time energy group buying jointly with wireless load sharing.
Edit intent: clarity
Original:  When the two MNOs belong to different entities and are self-interested in minimizing their individual energy costs, we propose a novel repeated Nash bargaining scheme for them to negotiate and share their energy costs under energy group-buying and load sharing .
Revised:  When the two MNOs belong to different entities and are self-interested in minimizing their individual energy costs, we propose a novel repeated Nash bargaining scheme for them to negotiate and share their energy costs under energy group buying and load sharing .
Edit intent: fluency
Original: An unwanted side effect of reversible color space transformation, usually being a sequence of lifting steps, is that while removing correlation it contaminates transformed components with noise from other components.
Revised: An undesirable side effect of reversible color space transformation, usually being a sequence of lifting steps, is that while removing correlation it contaminates transformed components with noise from other components.
Edit intent: fluency
Original: An unwanted side effect of reversible color space transformation, usually being a sequence of lifting steps, is that while removing correlation it contaminates transformed components with noise from other components.
Revised: An unwanted side effect of reversible color space transformation, which consists of lifting steps, is that while removing correlation it contaminates transformed components with noise from other components.
Edit intent: clarity
Original:  For JPEG-LS, JPEG2000 , and JPEG XR algorithms in a lossless mode,  RDgDb color space transformation and a simple denoising filter , we find that the proposed method is especially effective for images in  optical resolutions of acquisition devices, while for typical images it may lead to increased bitrates  .
Revised:  For JPEG-LS, JPEG 2000 , and JPEG XR algorithms in a lossless mode, RDgDb color space transformation and a simple denoising filter , we find that the proposed method is especially effective for images in optical resolutions of acquisition devices, while for typical images it may lead to increased bitrates .
Edit intent: fluency
Original:  For JPEG-LS, JPEG2000 , and JPEG XR algorithms in a lossless mode,  RDgDb color space transformation and a simple denoising filter , we find that the proposed method is especially effective for images in  optical resolutions of acquisition devices, while for typical images it may lead to increased bitrates  .
Revised:  For JPEG-LS, JPEG2000 , and JPEG XR algorithms in lossless mode, RDgDb color space transformation and a simple denoising filter , we find that the proposed method is especially effective for images in optical resolutions of acquisition devices, while for typical images it may lead to increased bitrates .
Edit intent: fluency
Original:  For JPEG-LS, JPEG2000 , and JPEG XR algorithms in a lossless mode,  RDgDb color space transformation and a simple denoising filter , we find that the proposed method is especially effective for images in  optical resolutions of acquisition devices, while for typical images it may lead to increased bitrates  .
Revised:  For JPEG-LS, JPEG2000 , and JPEG XR algorithms in a lossless mode, RDgDb color space transformation with a simple denoising filter , we find that the proposed method is especially effective for images in optical resolutions of acquisition devices, while for typical images it may lead to increased bitrates .
Edit intent: coherence
Original:  For JPEG-LS, JPEG2000 , and JPEG XR algorithms in a lossless mode,  RDgDb color space transformation and a simple denoising filter , we find that the proposed method is especially effective for images in  optical resolutions of acquisition devices, while for typical images it may lead to increased bitrates  .
Revised:  For JPEG-LS, JPEG2000 , and JPEG XR algorithms in a lossless mode, RDgDb color space transformation and a simple denoising filter is especially effective for images in optical resolutions of acquisition devices, while for typical images it may lead to increased bitrates .
Edit intent: clarity
Original:  For JPEG-LS, JPEG2000 , and JPEG XR algorithms in a lossless mode,  RDgDb color space transformation and a simple denoising filter , we find that the proposed method is especially effective for images in  optical resolutions of acquisition devices, while for typical images it may lead to increased bitrates  .
Revised:  For JPEG-LS, JPEG2000 , and JPEG XR algorithms in a lossless mode, RDgDb color space transformation and a simple denoising filter , we find that the proposed method is especially effective for images in optical resolutions of acquisition devices, but may lead to increased bitrates .
Edit intent: coherence
Original:  For JPEG-LS, JPEG2000 , and JPEG XR algorithms in a lossless mode,  RDgDb color space transformation and a simple denoising filter , we find that the proposed method is especially effective for images in  optical resolutions of acquisition devices, while for typical images it may lead to increased bitrates  .
Revised:  For JPEG-LS, JPEG2000 , and JPEG XR algorithms in a lossless mode, RDgDb color space transformation and a simple denoising filter , we find that the proposed method is especially effective for images in optical resolutions of acquisition devices, while for typical images it may lead to increased bitrates for typical images .
Edit intent: fluency
Original:  For JPEG-LS, JPEG 2000, and JPEG XR  algorithms in lossless mode, we find that the proposed method applied to the RDgDb color space transformation with a simple denoising filter is especially effective for images in the native optical resolutions of acquisition devices , but may lead to increased bitrates for typical images.
Revised:  For JPEG-LS, JPEG 2000, and JPEG XR algorithms in lossless mode, the application of RDLS to the RDgDb color space transformation with a simple denoising filter is especially effective for images in the native optical resolutions of acquisition devices , but may lead to increased bitrates for typical images.
Edit intent: clarity
Original:  For JPEG-LS, JPEG 2000, and JPEG XR  algorithms in lossless mode, we find that the proposed method applied to the RDgDb color space transformation with a simple denoising filter is especially effective for images in the native optical resolutions of acquisition devices , but may lead to increased bitrates for typical images.
Revised:  For JPEG-LS, JPEG 2000, and JPEG XR algorithms in lossless mode, we find that the proposed method applied to the RDgDb color space transformation with simple denoising filters is especially effective for images in the native optical resolutions of acquisition devices , but may lead to increased bitrates for typical images.
Edit intent: fluency
Original:  For JPEG-LS, JPEG 2000, and JPEG XR  algorithms in lossless mode, we find that the proposed method applied to the RDgDb color space transformation with a simple denoising filter is especially effective for images in the native optical resolutions of acquisition devices , but may lead to increased bitrates for typical images.
Revised:  For JPEG-LS, JPEG 2000, and JPEG XR algorithms in lossless mode, we find that the proposed method applied to the RDgDb color space transformation with a simple denoising filter is especially effective for images in the native optical resolution of acquisition devices , but may lead to increased bitrates for typical images.
Edit intent: fluency
Original: Collateralization with daily margining and the so-called OIS-discounting have become a new standard in the post-crisis financial market.
Revised: Collateralization with daily margining has become a new standard in the post-crisis financial market.
Edit intent: coherence
Original: Collateralization with daily margining and the so-called OIS-discounting have become a new standard in the post-crisis financial market.
Revised: Collateralization with daily margining and the so-called OIS-discounting have become a new standard in the post-crisis market.
Edit intent: clarity
Original:  We provide a new formulation of the currency funding spread which is more suitable in the presence of non-zero correlation to the collateral rates.
Revised:  It gives a new formulation of the currency funding spread which is more suitable in the presence of non-zero correlation to the collateral rates.
Edit intent: clarity
Original:  WPCN eliminates the need of frequent manual battery replacement/recharging, and thus significantly improves the performance and cost over conventional battery-powered communication networks in many aspects, such as higher throughput, longer device lifetime, and lower network operating cost.
Revised:  WPCN eliminates the need of frequent manual battery replacement/recharging, and thus significantly improves the performance over conventional battery-powered communication networks in many aspects, such as higher throughput, longer device lifetime, and lower network operating cost.
Edit intent: clarity
Original:  We give a polynomial-time algorithm that either finds that  no stable solution exists , or obtains a stable solution . Previously this result was only known for multiple partners assignment games, which correspond to the case where G is bipartite (Sotomayor, 1992) and for the case where b\equiv 1 (Bir\'o et al. , 2012).
Revised:  We give a polynomial-time algorithm that either finds that no stable solution , or obtains a stable solution . Previously this result was only known for multiple partners assignment games, which correspond to the case where G is bipartite (Sotomayor, 1992) and for the case where b\equiv 1 (Bir\'o et al. , 2012).
Edit intent: clarity
Original:  Here we investigate two competing hypotheses for the origins of non-crossing dependencies .
Revised:  We investigate two competing hypotheses for the origins of non-crossing dependencies .
Edit intent: coherence
Original:  Here we investigate two competing hypotheses for the origins of non-crossing dependencies .
Revised:  Here we investigate two competing explanations .
Edit intent: clarity
Original:  The traditional hypothesis is that the low frequency of dependency crossings arises from an independent principle of syntax that reduces crossings practically to zero.
Revised:  The traditional hypothesis is that this trend arises from an independent principle of syntax that reduces crossings practically to zero.
Edit intent: clarity
Original:  The alternative hypothesis can lead to a more parsimonious theory of syntax .
Revised:  The alternative hypothesis can lead to a more parsimonious theory of language .
Edit intent: clarity
Original:  We further unpack these ideas related to computability, algorithmic information theory and software engineering, in the context of the extent to which biology can be (re)programmed, and with how we may go about doing so in a more systematic way with all the tools and concepts offered by theoretical computer science in an translation exercise from computing to molecular biology and back.
Revised:  Here we further unpack these ideas related to computability, algorithmic information theory and software engineering, in the context of the extent to which biology can be (re)programmed, and with how we may go about doing so in a more systematic way with all the tools and concepts offered by theoretical computer science in an translation exercise from computing to molecular biology and back.
Edit intent: coherence
Original:  Here we further unpack these ideas related to computability, algorithmic information theory and software engineering, in the context of the extent to which biology can be (re)programmed, and with how we may go about doing so in a more systematic way with all the tools and concepts offered by theoretical computer science in an translation exercise from computing to molecular biology and back.
Revised:  Here we further unpack ideas related to computability, algorithmic information theory and software engineering, in the context of the extent to which biology can be (re)programmed, and with how we may go about doing so in a more systematic way with all the tools and concepts offered by theoretical computer science in an translation exercise from computing to molecular biology and back.
Edit intent: clarity
Original:  Here we further unpack these ideas related to computability, algorithmic information theory and software engineering, in the context of the extent to which biology can be (re)programmed, and with how we may go about doing so in a more systematic way with all the tools and concepts offered by theoretical computer science in an translation exercise from computing to molecular biology and back.
Revised:  Here we further unpack these ideas related to computability, algorithmic information theory and software engineering, in the context of the extent to which biology can be (re)programmed, and with how we may go about doing so in a more systematic way with all the tools and concepts offered by theoretical computer science in a translation exercise from computing to molecular biology and back.
Edit intent: fluency
Original:  On the contrary, this approach makes for a more encompassing and integrated view of nature, one that subsumes observer and observed within the same system, and can generate new perspectives and tools with which to view complex diseases like cancer, approaching them afresh from a software-engineering viewpoint that casts evolution in the role of programmer, cells as  computer programs,  the immune system as a program debugging tool, and diseases as a battlefield where these forces deploy.
Revised:  On the contrary, this approach makes for a more encompassing and integrated view of nature, one that subsumes observer and observed within the same system, and can generate new perspectives and tools with which to view complex diseases like cancer, approaching them afresh from a software-engineering viewpoint that casts evolution in the role of programmer, cells as computer programs, the immune system as a software debugging tool, and diseases as a battlefield where these forces deploy.
Edit intent: fluency
Original:  One important phenomenon is that the animal can replay , during both sleep and awake states, sequences of place cells that correspond to the sequences of previously visited locations.
Revised:  Electrophysiological recordings have shown that the animal can replay , during both sleep and awake states, sequences of place cells that correspond to the sequences of previously visited locations.
Edit intent: clarity
Original:  One important phenomenon is that the animal can replay , during both sleep and awake states, sequences of place cells that correspond to the sequences of previously visited locations.
Revised:  One important phenomenon is that the animal can revisit this map mentally , during both sleep and awake states, sequences of place cells that correspond to the sequences of previously visited locations.
Edit intent: clarity
Original:  One important phenomenon is that the animal can replay , during both sleep and awake states, sequences of place cells that correspond to the sequences of previously visited locations.
Revised:  One important phenomenon is that the animal can replay , during both sleep and awake states, reactivating the place cells that correspond to the sequences of previously visited locations.
Edit intent: clarity
Original:  Although it can be argued that consistency of place cell activity during active navigation is  enforced by sensory and proprioceptive inputs, it remains unclear whether a consistent representation of space can be maintained during spontaneous replay.
Revised:  Although it can be argued that consistency of place cell activity during active navigation is enforced by sensory and proprioceptive inputs, it remains unclear how a consistent representation of space can be maintained during spontaneous replay.
Edit intent: clarity
Original:  We propose a model that demonstrates that a spatially-consistent replay is possible, but requires imposing a number of constraints on the hippocampal network which affect its synaptic architecture and the statistics of synaptic connection strengths.
Revised:  We propose a model that can account for this phenomenon and suggests that a spatially consistent replay requires a number of constraints on the hippocampal network which affect its synaptic architecture and the statistics of synaptic connection strengths.
Edit intent: coherence
Original:  We propose a model that demonstrates that a spatially-consistent replay is possible, but requires imposing a number of constraints on the hippocampal network which affect its synaptic architecture and the statistics of synaptic connection strengths.
Revised:  We propose a model that demonstrates that a spatially-consistent replay is possible, but requires imposing a number of constraints on the hippocampal network that affect its synaptic architecture and the statistics of synaptic connection strengths.
Edit intent: fluency
Original:  In this work, we investigate whether Twitter conversations between legislators reveal their real-world position and influence by analyzing multiple Twitter networks that feature different types of link relations between the Members of Parliament (MPs) in the United Kingdom , and an identical dataset for politicians within Ireland.
Revised:  In this work, we investigate whether Twitter conversations between legislators reveal their real-world position and influence by analyzing multiple Twitter networks that feature different types of link relations between the Members of Parliament (MPs) in the United Kingdom and an identical dataset for politicians within Ireland.
Edit intent: fluency
Original:  In this work, we investigate whether Twitter conversations between legislators reveal their real-world position and influence by analyzing multiple Twitter networks that feature different types of link relations between the Members of Parliament (MPs) in the United Kingdom , and an identical dataset for politicians within Ireland.
Revised:  In this work, we investigate whether Twitter conversations between legislators reveal their real-world position and influence by analyzing multiple Twitter networks that feature different types of link relations between the Members of Parliament (MPs) in the United Kingdom , and an identical data set for politicians within Ireland.
Edit intent: clarity
Original:  However  when \sigma(y)=0 and since the price of the option depends on the second Brownian motion in which the volatility is defined, the (1 + 2) evolution is not reduced to the Black-Scholes-Merton equation , the model admits five Lie symmetries, plus the linear symmetry and the infinity number of solution symmetries.
Revised:  However , when \sigma(y)=0 and since the price of the option depends on the second Brownian motion in which the volatility is defined, the (1 + 2) evolution is not reduced to the Black-Scholes-Merton equation , the model admits five Lie symmetries, plus the linear symmetry and the infinity number of solution symmetries.
Edit intent: coherence
Original:  However  when \sigma(y)=0 and since the price of the option depends on the second Brownian motion in which the volatility is defined, the (1 + 2) evolution is not reduced to the Black-Scholes-Merton equation , the model admits five Lie symmetries, plus the linear symmetry and the infinity number of solution symmetries.
Revised:  However when \sigma(y)=0 and as the price of the option depends on the second Brownian motion in which the volatility is defined, the (1 + 2) evolution is not reduced to the Black-Scholes-Merton equation , the model admits five Lie symmetries, plus the linear symmetry and the infinity number of solution symmetries.
Edit intent: coherence
Original:  However  when \sigma(y)=0 and since the price of the option depends on the second Brownian motion in which the volatility is defined, the (1 + 2) evolution is not reduced to the Black-Scholes-Merton equation , the model admits five Lie symmetries, plus the linear symmetry and the infinity number of solution symmetries.
Revised:  However when \sigma(y)=0 and since the price of the option depends upon the second Brownian motion in which the volatility is defined, the (1 + 2) evolution is not reduced to the Black-Scholes-Merton equation , the model admits five Lie symmetries, plus the linear symmetry and the infinity number of solution symmetries.
Edit intent: coherence