wanyu/IteraTeR_v2 huggingface dataset:
Original:  When cross currency basis spreads collapse to zero , this method  converges to the well established single currency setting in which each leg is funded in its own currency.
Revised:  When cross currency basis spreads collapse to zero , this method naturally converges to the well established single currency setting in which each leg is funded in its own currency.
Edit intent: clarity
Original:  A worked example tests the quality of the method .
Revised:  A worked example compares this approach with a benchmark .
Edit intent: clarity
Original: Supervised recursive neural network models (RNNs) for sentence meaning have been successful in an array of sophisticated language tasks, but it remains an open question whether they can learn compositional semantic grammars that support logical deduction.
Revised: Recursive neural networks (RNNs) for sentence meaning have been successful in an array of sophisticated language tasks, but it remains an open question whether they can learn compositional semantic grammars that support logical deduction.
Edit intent: clarity
Original: Supervised recursive neural network models (RNNs) for sentence meaning have been successful in an array of sophisticated language tasks, but it remains an open question whether they can learn compositional semantic grammars that support logical deduction.
Revised: Supervised recursive neural network models (RNNs) for sentence meaning have been successful for many tasks, but it remains an open question whether they can learn compositional semantic grammars that support logical deduction.
Edit intent: clarity
Original: Supervised recursive neural network models (RNNs) for sentence meaning have been successful in an array of sophisticated language tasks, but it remains an open question whether they can learn compositional semantic grammars that support logical deduction.
Revised: Supervised recursive neural network models (RNNs) for sentence meaning have been successful in an array of sophisticated language tasks, but it remains an open question whether they can learn compositional semantic representations that support logical deduction.
Edit intent: clarity
Original:  We address this question directly by for the first time evaluating whether each of two classes of neural model --- plain RNNs and recursive neural tensor networks (RNTNs) --- can correctly learn relationships such as entailment and contradiction between pairs of sentences, where we have generated controlled data sets of sentences from a logical grammar .
Revised:  We pursue this question by evaluating whether two such models---plain RNNs and recursive neural tensor networks (RNTNs) --- can correctly learn relationships such as entailment and contradiction between pairs of sentences, where we have generated controlled data sets of sentences from a logical grammar .
Edit intent: clarity
Original:  We address this question directly by for the first time evaluating whether each of two classes of neural model --- plain RNNs and recursive neural tensor networks (RNTNs) --- can correctly learn relationships such as entailment and contradiction between pairs of sentences, where we have generated controlled data sets of sentences from a logical grammar .
Revised:  We address this question directly by for the first time evaluating whether each of two classes of neural model --- plain RNNs and recursive neural tensor networks (RNTNs) ---can correctly learn to identify logical relationships such as entailment and contradiction between pairs of sentences, where we have generated controlled data sets of sentences from a logical grammar .
Edit intent: clarity
Original:  We address this question directly by for the first time evaluating whether each of two classes of neural model --- plain RNNs and recursive neural tensor networks (RNTNs) --- can correctly learn relationships such as entailment and contradiction between pairs of sentences, where we have generated controlled data sets of sentences from a logical grammar .
Revised:  We address this question directly by for the first time evaluating whether each of two classes of neural model --- plain RNNs and recursive neural tensor networks (RNTNs) --- can correctly learn relationships such as entailment and contradiction . In our first set of experiments, we generate artificial data from a logical grammar .
Edit intent: clarity
Original:  We find that the plain RNN achieves only mixed results on all three experiments , whereas the stronger RNTN model generalizes well in every setting and appears capable of learning suitable representations for natural language logical inference .
Revised:  We find that the plain RNN achieves only mixed results on all three experiments on simulated data, suggesting that they can learn suitable representations for natural language logical inference .
Edit intent: clarity
Original:  We find that the plain RNN achieves only mixed results on all three experiments , whereas the stronger RNTN model generalizes well in every setting and appears capable of learning suitable representations for natural language logical inference .
Revised:  We find that the plain RNN achieves only mixed results on all three experiments , whereas the stronger RNTN model generalizes well in every setting and appears capable of learning suitable representations for logical inference in natural language .
Edit intent: clarity
Original: Recursive neural networks ( RNNs ) for sentence meaning have been successful for many tasks , but it remains an open question whether they can learn compositional semantic representations that support logical deduction.
Revised: Recursive neural networks ( RNNs ) for sentence meaning have been successful for many applications , but it remains an open question whether they can learn compositional semantic representations that support logical deduction.
Edit intent: clarity
Original:  We pursue this question by evaluating whether two such models---plain RNNs and recursive neural tensor networks ( RNTNs )---can correctly learn to identify logical relationships such as entailment and contradiction  .
Revised:  We pursue this question by evaluating whether two such models---plain RNNs and recursive neural tensor networks ( RNTNs )---can correctly learn to identify logical relationships such as entailment and contradiction using these representations .
Edit intent: clarity
Original:  Some of them simplify or are reminiscent of certain results that are recently being developed in wireless networks literature.
Revised:  Some of them simplify or are akin to certain results that are recently being developed in wireless networks literature.
Edit intent: clarity
Original:  By storing m directions, this algorithm can be generalized to a family of low memory schemes, with complexity \Theta(mn) per iteration  .
Revised:  This algorithm can be generalized to a family of low memory schemes, with complexity \Theta(mn) per iteration .
Edit intent: clarity
Original:  We demonstrate the approaches on several datasets, including large scale experiments on the ImageNet classification benchmark , showing how additional noisy data can improve state-of-the-art recognition models .
Revised:  We demonstrate the approaches on several datasets, including large scale experiments on the ImageNet classification benchmark .
Edit intent: clarity
Original: This paper focuses on computational approaches for trend filtering, using the alternating direction method of multipliers (ADMM).
Revised: This paper presents a fast and robust algorithm for trend filtering, using the alternating direction method of multipliers (ADMM).
Edit intent: clarity
Original:  Software for our method will be made freely available, written in C++ (see URL and also in R(see the%DIFDELCMD < {\tt %%% trendfilter function in the R package%DIFDELCMD < {\tt %%% genlasso ) .
Revised:  Software for our method will be made freely available, both in C++ (see URL and also in R(see the%DIFDELCMD < {\tt %%% trendfilter function in the R package%DIFDELCMD < {\tt %%% genlasso ) .
Edit intent: clarity
Original:  Software for our method will be made freely available, written in C++ (see URL and also in R(see the%DIFDELCMD < {\tt %%% trendfilter function in the R package%DIFDELCMD < {\tt %%% genlasso ) .
Revised:  Software for our method will be made freely available, written in C++ %DIFDELCMD < {\tt %%% trendfilter function in the R package%DIFDELCMD < {\tt %%% genlasso ) .
Edit intent: coherence
Original:  Software for our method will be made freely available, written in C++ (see URL and also in R(see the%DIFDELCMD < {\tt %%% trendfilter function in the R package%DIFDELCMD < {\tt %%% genlasso ) .
Revised:  Software for our method will be made freely available, written in C++ (see URL and also in R(see the%DIFDELCMD < {\tt %%% trendfilter %DIFDELCMD < {\tt %%% genlasso ) .
Edit intent: coherence
Original:  Software for our method will be made freely available, written in C++ (see URL and also in R(see the%DIFDELCMD < {\tt %%% trendfilter function in the R package%DIFDELCMD < {\tt %%% genlasso ) .
Revised:  Software for our method will be made freely available, written in C++ (see URL and also in R(see the%DIFDELCMD < {\tt %%% trendfilter function in the R package%DIFDELCMD < {\tt %%% genlasso and in R .
Edit intent: coherence
Original:  Software for our method will be made freely available, both in C++ and in R .
Revised:  Software for our method is freely available, both in C++ and in R .
Edit intent: clarity
Original:  Software for our method will be made freely available, both in C++ and in R .
Revised:  Software for our method will be made freely available, in both the C and R languages .
Edit intent: clarity
Original:  This result generalizes the polynomial partitioning theorem on the Euclidean space of Guth and Katz, and its extension to hypersurfaces by Zahl and by Kaplan, Matou \v{s ek, Sharir and Safernov\'a.
Revised:  This result generalizes the polynomial partitioning theorem on the Euclidean space of Guth and Katz, and its extension to hypersurfaces by Zahl and by Kaplan, Matou \v{s ek, Sharir and Safernov\'a.
Edit intent: fluency
Original: We present a polynomial partitioning theorem for finite sets of points in the real locus of a complex algebraic variety of codimension at most two.
Revised: We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two.
Edit intent: clarity
Original: Recovering and reconstructing incomplete networks by accurately identifying missing  links is a vital task in the domain of network analysis and mining.
Revised: Recovering and reconstructing networks by accurately identifying missing links is a vital task in the domain of network analysis and mining.
Edit intent: clarity
Original:  In this article, by studying a specific local structure, namely a degree block having a node and its all immediate neighbors, we find it contains important statistical features of link formation in complex networks.
Revised:  In this article, by studying a specific local structure, namely a degree block having a node and its all immediate neighbors, we find it contains important statistical features of link formation for complex networks.
Edit intent: clarity
Original:  We therefore propose a  local blocking (LB) predictor to quantitatively identify missing links in given networks via local link density calculations.
Revised:  We therefore propose a local blocking (LB) predictor to quantitatively detect link formation in given networks via local link density calculations.
Edit intent: clarity
Original:  The promising experimental results performed on six real-world networks suggest that the new index can substantially outperform other traditional local similarity-based methods  . After further analyzing the correlations between the LB scores and those given by two other methods,
Revised:  The promising experimental results performed on six real-world networks suggest that the new index can outperform other traditional local similarity-based methods . After further analyzing the correlations between the LB scores and those given by two other methods,
Edit intent: clarity
Original:  The promising experimental results performed on six real-world networks suggest that the new index can substantially outperform other traditional local similarity-based methods  . After further analyzing the correlations between the LB scores and those given by two other methods,
Revised:  The promising experimental results performed on six real-world networks suggest that the new index can substantially outperform other traditional local similarity-based methods . After further analyzing the scores' correlations between LB and two other methods,
Edit intent: clarity
Original:  we find that the features of LB index are analogous to those of both PA index and short path based index, which empirically verify that the two aspects simultaneously captured by the LB index are jointly driving link formation in complex networks.
Revised:  we find that the features of LB index are analogous to those of both PA index and short-path-based index, which empirically verify that the two aspects simultaneously captured by the LB index are jointly driving link formation in complex networks.
Edit intent: fluency
Original:  To satisfy certain quality of service requirements, users share time slot durations and frequency bandwidths . Moreover, the secondary user (SU) may leverage the primary feedback signal.
Revised:  To satisfy certain quality of service requirements, users share time slot duration and frequency bandwidth . Moreover, the secondary user (SU) may leverage the primary feedback signal.
Edit intent: fluency
Original: This paper considers a network in which a primary user (PU) may cooperate with a cognitive radio (CR) user for transmission of its data packets.
Revised: We investigate a cognitive radio network in which a primary user (PU) may cooperate with a cognitive radio (CR) user for transmission of its data packets.
Edit intent: clarity
Original:  The PU is assumed to be a buffered terminal operating in a time-slotted fashion  .
Revised:  The PU is assumed to be a buffered node operating in a time-slotted fashion .
Edit intent: clarity
Original:  We develop two protocols which involve cooperation between primary and secondary users.
Revised:  We develop two schemes which involve cooperation between primary and secondary users.
Edit intent: clarity
Original:  To satisfy certain quality of service  requirements, users share time slot duration and  frequency bandwidth.
Revised:  To satisfy certain quality of service (QoS) requirements, users share time slot duration and frequency bandwidth.
Edit intent: clarity
Original:  Moreover, the secondary user (SU ) may leverage the primary feedback signal .
Revised:  Moreover, the SU may leverage the primary feedback signal .
Edit intent: clarity
Original:  The proposed protocols are designed such that the secondary rate is maximized and the primary queueing delay is maintained less than the  queueing delay in case of non-cooperative PU.
Revised:  The proposed cooperative schemes are designed such that the secondary rate is maximized and the primary queueing delay is maintained less than the queueing delay in case of non-cooperative PU.
Edit intent: clarity
Original:  The proposed protocols are designed such that the secondary rate is maximized and the primary queueing delay is maintained less than the  queueing delay in case of non-cooperative PU.
Revised:  The proposed protocols are designed such that the secondary rate is maximized and the primary queueing delay is maintained less than the average queueing delay in case of non-cooperative PU.
Edit intent: clarity
Original:  In addition, the proposed protocols guarantee the stability of the primary queue and maintain the average energy emitted by the CR user below a certain value.
Revised:  In addition, the proposed schemes guarantee the stability of the primary queue and maintain the average energy emitted by the CR user below a certain value.
Edit intent: clarity
Original:  In addition, the proposed protocols guarantee the stability of the primary queue and maintain the average energy emitted by the CR user below a certain value.
Revised:  In addition, the proposed protocols guarantee the stability of the PU queue and maintain the average energy emitted by the CR user below a certain value.
Edit intent: clarity
Original:  In addition, the proposed protocols guarantee the stability of the primary queue and maintain the average energy emitted by the CR user below a certain value.
Revised:  In addition, the proposed protocols guarantee the stability of the primary queue and maintain the average energy emitted by the SU below a certain value.
Edit intent: clarity
Original:  The proposed protocols also provide more robust and potentially continuous service for SUs compared to the conventional practice in cognitive networks where SUs transmit in the spectrum holes and silence sessions of the PUs.
Revised:  The proposed schemes also provide more robust and potentially continuous service for SUs compared to the conventional practice in cognitive networks where SUs transmit in the spectrum holes and silence sessions of the PUs.
Edit intent: clarity
Original:  Numerical results show the beneficial gains of the cooperative protocols in terms of secondary rate and primary throughput, queueing delay, and average  energy savings.
Revised:  Numerical results show the beneficial gains of the cooperative schemes in terms of secondary rate and primary throughput, queueing delay, and average energy savings.
Edit intent: clarity
Original:  Numerical results show the beneficial gains of the cooperative protocols in terms of secondary rate and primary throughput, queueing delay, and average  energy savings.
Revised:  Numerical results show the beneficial gains of the cooperative protocols in terms of secondary rate and primary throughput, queueing delay, and average PU energy savings.
Edit intent: fluency
Original: Runge-Kutta methods are the classic family of solvers for ordinary differential equations (ODEs), and the basis for the state-of-the-art . Like most numerical methods, they return point estimates.
Revised: Runge-Kutta methods are the classic family of solvers for ordinary differential equations (ODEs), and the basis for the state of the art . Like most numerical methods, they return point estimates.
Edit intent: fluency
Original: The determination of intracellular concentrations with experiments in situ or by endogenous reading mechanisms suffers the same type of physical limitations .
Revised: Information transmission in cells occurs quite accurately even when concentration changes are "read" by individual target molecules .
Edit intent: clarity
Original: } We  prove constructively that if \alpha(Q) \geq 4n/10, then the answer is affirmative for \lfloor n / 3 \rfloor \leq k \leq \alpha( G ).
Revised: } We prove constructively that if \alpha(Q) \geq 4n/10, then the answer is affirmative for \lfloor n / 3 \rfloor \leq k \leq \alpha( Q ).
Edit intent: clarity
Original:  We show that this problem with \alpha(Q)\geq 4n/10 \lfloor \rfloor  can be related to semi-equitable graph 3-coloring, where one color class is of size k, %DIFDELCMD < \lfloor %DIFDELCMD < %%% n/3%DIFDELCMD < \rfloor %%% \leq k \leq \alpha(G), and the subgraph induced by the remaining vertices is equitably 2-colored.
Revised:  Next, we show that this problem with \alpha(Q)\geq 4n/10 \lfloor \rfloor can be related to semi-equitable graph 3-coloring, where one color class is of size k, %DIFDELCMD < \lfloor %DIFDELCMD < %%% n/3%DIFDELCMD < \rfloor %%% \leq k \leq \alpha(G), and the subgraph induced by the remaining vertices is equitably 2-colored.
Edit intent: fluency
Original:  We show that this problem with \alpha(Q)\geq 4n/10 \lfloor \rfloor  can be related to semi-equitable graph 3-coloring, where one color class is of size k, %DIFDELCMD < \lfloor %DIFDELCMD < %%% n/3%DIFDELCMD < \rfloor %%% \leq k \leq \alpha(G), and the subgraph induced by the remaining vertices is equitably 2-colored.
Revised:  We show that this problem with \alpha(Q)\geq 4n/10 \lfloor \rfloor \leq k \leq \alpha(Q) can be related to semi-equitable graph 3-coloring, where one color class is of size k, %DIFDELCMD < \lfloor %DIFDELCMD < %%% n/3%DIFDELCMD < \rfloor %%% \leq k \leq \alpha(G), and the subgraph induced by the remaining vertices is equitably 2-colored.
Edit intent: fluency
Original:  We show that this problem with \alpha(Q)\geq 4n/10 \lfloor \rfloor  can be related to semi-equitable graph 3-coloring, where one color class is of size k, %DIFDELCMD < \lfloor %DIFDELCMD < %%% n/3%DIFDELCMD < \rfloor %%% \leq k \leq \alpha(G), and the subgraph induced by the remaining vertices is equitably 2-colored.
Revised:  We show that this problem with \alpha(Q)\geq 4n/10 \lfloor \rfloor can be related to semi-equitable graph 3-coloring, where one color class is of size k, %DIFDELCMD < \lfloor %DIFDELCMD < %%% n/3%DIFDELCMD < \rfloor %%% and the subgraph induced by the remaining vertices is equitably 2-colored.
Edit intent: coherence
Original:  This means that Q has a coloring of type (k, %DIFDELCMD < \lfloor %%% \lceil (n-k)/2 %DIFDELCMD < \rfloor%%% ,%DIFDELCMD < \lceil%%% \rceil\lfloor (n-k)/2 %DIFDELCMD < \rceil%%% \rfloor ).
Revised:  This means that Q has a coloring of type (k, %DIFDELCMD < \lfloor %%% \lceil (n-k)/2 %DIFDELCMD < \rfloor%%% %DIFDELCMD < \lceil%%% \rceil\lfloor (n-k)/2 %DIFDELCMD < \rceil%%% \rfloor ).
Edit intent: fluency
Original:  This means that Q has a coloring of type (k, %DIFDELCMD < \lfloor %%% \lceil (n-k)/2 %DIFDELCMD < \rfloor%%% ,%DIFDELCMD < \lceil%%% \rceil\lfloor (n-k)/2 %DIFDELCMD < \rceil%%% \rfloor ).
Revised:  This means that Q has a coloring of type (k, %DIFDELCMD < \lfloor %%% \lceil (n-k)/2 %DIFDELCMD < \rfloor%%% ,%DIFDELCMD < \lceil%%% \rceil,\lfloor (n-k)/2 %DIFDELCMD < \rceil%%% \rfloor ).
Edit intent: fluency
Original: The detection of an epidemic source or the patient zero is an important practical problem that can help in developing the epidemic control strategies .
Revised: Detection of patient-zero can give new insights to the epidemiologists about the nature of first transmissions into a population .
Edit intent: clarity
Original:  In this paper, we study the statistical inference problem of detecting the source of epidemics from a snapshot of a contagion spreading process at some time on an arbitrary network structure.
Revised:  In this paper, we study the statistical inference problem of detecting the source of epidemics from a snapshot of spreading on an arbitrary network structure.
Edit intent: clarity
Original:  By using exact analytic calculations and Monte Carlo simulations , we demonstrate the detectability limits for the SIR model, which primarily depend on the spreading process characteristics.
Revised:  By using exact analytic calculations and Monte Carlo estimators , we demonstrate the detectability limits for the SIR model, which primarily depend on the spreading process characteristics.
Edit intent: clarity
Original:  We introduce an efficient Bayesian Monte Carlo source probability estimator and compare its performance against state-of-the-art approaches.
Edit intent: coherence
Original:  Finally, we demonstrate the applicability of the approach in a realistic setting of an epidemic spreading over an empirical temporal network of sexual interactions.
Revised:  Finally, we demonstrate the applicability of the approach in a case of a simulated sexually transmitted infection spreading over an empirical temporal network of sexual interactions.
Edit intent: clarity
Original: Noise induced excitability is studied in type I and II Morris--Lecar neurons subject to constant sub threshold input, where fluctuations arise from sodium and potassium ion channels.
Revised: Noise induced excitability is studied in type I and II Morris-Lecar neurons subject to constant sub threshold input, where fluctuations arise from sodium and potassium ion channels.
Edit intent: fluency