wanyu/IteraTeR_v2 huggingface dataset:
Original:  We overcome this challenge by using ideas from decoupling theory, suprema of chaos processes and the restricted isometry property of random circulant matrices, and recent analysis for alternating minimization methods.
Revised:  We overcome this challenge by using ideas from decoupling theory, suprema of chaos processes and the restricted isometry property of random circulant matrices, and recent analysis of alternating minimization methods.
Edit intent: fluency
Original:  Sufficient conditions are identified that guarantee first, that the associated reservoir computers with linear readouts are causal, time-invariant, and satisfy the fading memory property and second, that a subset of this class is universal in the category of fading memory filters with stochastic almost surely  bounded inputs.
Revised:  Sufficient conditions are identified that guarantee first, that the associated reservoir computers with linear readouts are causal, time-invariant, and satisfy the fading memory property and second, that a subset of this class is universal in the category of fading memory filters with stochastic almost surely uniformly bounded inputs.
Edit intent: clarity
Original: This paper studies the order reduction phenomenon for initial-boundary-value problems that occurs with many Runge-Kutta time-stepping schemes.
Revised: This paper studies the spatial manifestations of order reduction that occur when time-stepping initial-boundary-value problems that occurs with many Runge-Kutta time-stepping schemes.
Edit intent: clarity
Original:  Third, a new condition on the Butcher tableau, called weak stage order, is provided that can recover the full order, and that is compatible with diagonally implicit Runge-Kutta schemes .
Revised:  Third, a new condition on the Butcher tableau, called weak stage order, that is compatible with diagonally implicit Runge-Kutta schemes .
Edit intent: clarity
Original:  And fourth, modified boundary conditions are derived that remedy the order reduction phenomenon .
Revised:  And fourth, modified boundary conditions on the boundary layer theory is analyzed .
Edit intent: clarity
Original:  Results: We present OCOCO , the first online consensus caller, capable to infer SNVs dynamically as read alignments are fed in.
Revised:  Results: We present Ococo , the first online consensus caller, capable to infer SNVs dynamically as read alignments are fed in.
Edit intent: fluency
Original:  Results: We present OCOCO , the first online consensus caller, capable to infer SNVs dynamically as read alignments are fed in.
Revised:  Results: We present OCOCO , the first program capable of inferring variants in a real-time, as read alignments are fed in.
Edit intent: clarity
Original:  OCOCO inputs unsorted alignments from an unsorted SAM/BAM stream and decides about single-nucleotide updates of the current genomic consensus using statistics stored in compact several-bits counters.
Revised:  Ococo inputs unsorted alignments from an unsorted SAM/BAM stream and decides about single-nucleotide updates of the current genomic consensus using statistics stored in compact several-bits counters.
Edit intent: clarity
Original:  OCOCO inputs unsorted alignments from an unsorted SAM/BAM stream and decides about single-nucleotide updates of the current genomic consensus using statistics stored in compact several-bits counters.
Revised:  OCOCO inputs unsorted alignments from a stream and infers single-nucleotide updates of the current genomic consensus using statistics stored in compact several-bits counters.
Edit intent: clarity
Original:  OCOCO inputs unsorted alignments from an unsorted SAM/BAM stream and decides about single-nucleotide updates of the current genomic consensus using statistics stored in compact several-bits counters.
Revised:  OCOCO inputs unsorted alignments from an unsorted SAM/BAM stream and decides about single-nucleotide variants, together with a genomic consensus, using statistics stored in compact several-bits counters.
Edit intent: clarity
Original:  OCOCO provides a fast and memory-efficient alternative to the usual variant calling , particularly advantageous when reads are sequenced or mapped progressively, or when available computational resources are at a premium .
Revised:  OCOCO provides a fast and memory-efficient alternative to the usual variant calling . It is particularly advantageous when reads are sequenced or mapped progressively, or when available computational resources are at a premium .
Edit intent: coherence
Original: This paper presents a sparse denoising autoencoder-based deep neural network ( SDAE-DNN ) for the direction estimation of small unmanned aerial vehicles  .
Revised: This paper presents a sparse denoising autoencoder (SDAE)-based deep neural network ( SDAE-DNN ) for the direction estimation of small unmanned aerial vehicles .
Edit intent: fluency
Original: This paper presents a sparse denoising autoencoder-based deep neural network ( SDAE-DNN ) for the direction estimation of small unmanned aerial vehicles  .
Revised: This paper presents a sparse denoising autoencoder-based deep neural network ( DNN ) for the direction estimation of small unmanned aerial vehicles .
Edit intent: clarity
Original: This paper presents a sparse denoising autoencoder-based deep neural network ( SDAE-DNN ) for the direction estimation of small unmanned aerial vehicles  .
Revised: This paper presents a sparse denoising autoencoder-based deep neural network ( SDAE-DNN ) for the direction finding (DF) of small unmanned aerial vehicles .
Edit intent: clarity
Original: This paper presents a sparse denoising autoencoder-based deep neural network ( SDAE-DNN ) for the direction estimation of small unmanned aerial vehicles  .
Revised: This paper presents a sparse denoising autoencoder-based deep neural network ( SDAE-DNN ) for the direction estimation of small unmanned aerial vehicles (UAVs) .
Edit intent: clarity
Original:  It is motivated by  practical challenges associated with classical direction finding algorithms such as MUSIC and ESPRIT.
Revised:  It is motivated by the practical challenges associated with classical direction finding algorithms such as MUSIC and ESPRIT.
Edit intent: fluency
Original:  It is motivated by  practical challenges associated with classical direction finding algorithms such as MUSIC and ESPRIT.
Revised:  It is motivated by practical challenges associated with classical DF algorithms such as MUSIC and ESPRIT.
Edit intent: clarity
Original:  The proposed scheme is robust and low-complex in the sense that  phase synchronization mechanism, calibration procedure, or any knowledge about the antenna radiation pattern is not required .
Revised:  The proposed DF scheme is practical and low-complex in the sense that phase synchronization mechanism, calibration procedure, or any knowledge about the antenna radiation pattern is not required .
Edit intent: clarity
Original:  The proposed scheme is robust and low-complex in the sense that  phase synchronization mechanism, calibration procedure, or any knowledge about the antenna radiation pattern is not required .
Revised:  The proposed scheme is robust and low-complex in the sense that a phase synchronization mechanism, calibration procedure, or any knowledge about the antenna radiation pattern is not required .
Edit intent: fluency
Original:  The proposed scheme is robust and low-complex in the sense that  phase synchronization mechanism, calibration procedure, or any knowledge about the antenna radiation pattern is not required .
Revised:  The proposed scheme is robust and low-complex in the sense that phase synchronization mechanism, an antenna calibration mechanism, or a profound knowledge about the antenna radiation pattern is not required .
Edit intent: clarity
Original:  The proposed scheme is robust and low-complex in the sense that  phase synchronization mechanism, calibration procedure, or any knowledge about the antenna radiation pattern is not required .
Revised:  The proposed scheme is robust and low-complex in the sense that phase synchronization mechanism, calibration procedure, or any knowledge about the antenna radiation pattern are not essential .
Edit intent: clarity
Original:  The paper validates the proposed architecture experimentally as well.
Revised:  The paper validates the proposed method experimentally as well.
Edit intent: clarity
Original:  The proposed DF scheme is practical and low-complex in the sense that a phase synchronization mechanism, an antenna calibration mechanism, or a profound knowledge about the antenna radiation pattern are not essential.
Revised:  The proposed DF scheme is practical and low-complex in the sense that a phase synchronization mechanism, an antenna calibration mechanism, and the analytical model of the antenna radiation pattern are not essential.
Edit intent: clarity
Original:  Also, the DF can be accomplished using a singlechannel RF receiverimplementation .
Revised:  Also, the proposed DF method can be implemented using a single-channel RF receiver .
Edit intent: clarity
Original: P \not = NP \Leftrightarrow SAT%DIFDELCMD < \not %%% \in P.
Revised: P \not %DIFDELCMD < \not %%% \in P.
Edit intent: coherence
Original:  It turns out that the classical penalty mortar formulation does not pass the patch test, whereas the proposed formulation passes the test without segmentation and refined boundary quadrature.
Revised:  It turns out that the classical penalty mortar formulation does not pass the patch test, whereas the proposed formulation passes the test without using either segmentation or refined boundary quadrature.
Edit intent: clarity
Original: A single-player Memory Game is played with n distinct pairs of cards, with the cards in each pair bearing identical pictures.
Revised: A single-player game of Memory is played with n distinct pairs of cards, with the cards in each pair bearing identical pictures.
Edit intent: clarity
Original:  The cards are laid face-down and a move consists of revealing two cards, chosen adaptively.
Revised:  The cards are laid face-down . A move consists of revealing two cards, chosen adaptively.
Edit intent: coherence
Original:  If these cards match, i.e., they have the same picture, they are removed from play;
Revised:  If these cards match, i.e., they bear the same picture, they are removed from play;
Edit intent: clarity
Original:  otherwise  they are turned back to face down.
Revised:  otherwise , they are turned back to face down.
Edit intent: fluency
Original:  Here , we study the  game in a space-bounded setting.
Revised:  In this work , we study the game in a space-bounded setting.
Edit intent: clarity
Original:  Our main result is that an algorithm (strategy for the player) that clears all cards in T moves , while using at most S bits of memory , must obey the tradeoff ST^2 = Omega (n^3).
Revised:  Our main result is that an algorithm (strategy for the player) that clear all cards in T moves , while using at most S bits of memory , must obey the tradeoff ST^2 = Omega (n^3).
Edit intent: fluency
Original:  Our main result is that an algorithm (strategy for the player) that clears all cards in T moves , while using at most S bits of memory , must obey the tradeoff ST^2 = Omega (n^3).
Revised:  Our main result is that an algorithm (strategy for the player) that clears all cards in T moves while using at most S bits of memory , must obey the tradeoff ST^2 = Omega (n^3).
Edit intent: fluency
Original:  An easy upper bound is that ST = O \widetilde{\Omega} (n^2 log n) , assuming that each picture can be represented in O(log n) bits.
Revised:  An easy upper bound is that ST = \widetilde{\Omega} (n^2 log n) , assuming that each picture can be represented in O(log n) bits.
Edit intent: clarity
Original: Hardware acceleration of Deep Neural Networks (DNNs) aims to tame their enormous compute intensity.
Revised: Fully realizing the potential of acceleration for Deep Neural Networks (DNNs) aims to tame their enormous compute intensity.
Edit intent: clarity
Original:  Fully realizing the potential of acceleration in this domain requires understanding and leveraging algorithmic properties of DNNs . This paper builds upon the algorithmic insight that bitwidth of operations in DNNs can be reduced without compromising their  accuracy.
Revised:  Fully realizing the potential of acceleration in this domain requires understanding and leveraging algorithmic properties . This paper builds upon the algorithmic insight that bitwidth of operations in DNNs can be reduced without compromising their accuracy.
Edit intent: fluency
Original:  Fully realizing the potential of acceleration in this domain requires understanding and leveraging algorithmic properties of DNNs . This paper builds upon the algorithmic insight that bitwidth of operations in DNNs can be reduced without compromising their  accuracy.
Revised:  Fully realizing the potential of acceleration in this domain requires understanding and leveraging algorithmic properties of DNNs . This paper builds upon the algorithmic insight that bitwidth of operations in DNNs can be reduced without compromising their classification accuracy.
Edit intent: clarity
Original:  However, to prevent accuracy loss, the bitwidth varies significantly across DNNs and it may even be adjusted for each layer individually .
Revised:  However, to prevent accuracy loss, the bitwidth varies significantly across DNNs and it may even be adjusted for each layer .
Edit intent: clarity
Original:  Thus, a fixed-bitwidth accelerator would either offer limited benefits to accommodate the worst-case bitwidth , or inevitably lead to a degradation in final accuracy.
Revised:  Thus, a fixed-bitwidth accelerator would either offer limited benefits to accommodate the worst-case bitwidth requirements, or lead to a degradation in final accuracy.
Edit intent: clarity
Original:  This flexibility in the architecture minimizes the computation and the communication at the finest granularity possible with no loss in accuracy.
Revised:  This flexibility in the architecture enables minimizing the computation and the communication at the finest granularity possible with no loss in accuracy.
Edit intent: clarity
Original:  We evaluate the benefits of Bit Fusion using eight real-world feed-forward and recurrent DNNs.
Revised:  We evaluate the benefits of BitFusion using eight real-world feed-forward and recurrent DNNs.
Edit intent: fluency
Original:  Bit Fusion provides 2.4 x speedup and 4.1 x energy reduction over Stripes at 45 nm node when Bit Fusion area and frequency are set to those of Stripes.
Revised:  Bit Fusion provides 2.4 x speedup and 4.1 x energy reduction at 45 nm node when Bit Fusion area and frequency are set to those of Stripes.
Edit intent: clarity
Original:  Bit Fusion provides 2.4 x speedup and 4.1 x energy reduction over Stripes at 45 nm node when Bit Fusion area and frequency are set to those of Stripes.
Revised:  Bit Fusion provides 2.4 x speedup and 4.1 x energy reduction over Stripes at 45 nm node when BitFusion area and frequency are set to those of Stripes.
Edit intent: fluency
Original: A way to measure the community structure of a network is the clustering coefficient.
Revised: A way to measure the community structure is the clustering coefficient.
Edit intent: clarity
Original: In the context of expert systems approach, the problem of community detection can be afford as a clustering model for networks.
Revised: Based on an expert systems approach, the problem of community detection can be afford as a clustering model for networks.
Edit intent: clarity
Original: In the context of expert systems approach, the problem of community detection can be afford as a clustering model for networks.
Revised: In the context of expert systems approach, the issue of community detection can be afford as a clustering model for networks.
Edit intent: clarity
Original: In the context of expert systems approach, the problem of community detection can be afford as a clustering model for networks.
Revised: In the context of expert systems approach, the problem of community detection can be conceptualized as a clustering model for networks.
Edit intent: clarity
Original:  This paper fills this gap by providing a new definition of the clustering coefficient for weighted networks when missing links might be also considered . Specifically,
Revised:  This paper provides a new definition of the clustering coefficient for weighted networks when missing links might be also considered . Specifically,
Edit intent: clarity
Original:  a novel concept of triangles is here introducedby assuming thata strong enough aggregate weight of two arcs sharing a node induces a link between the not common nodes . Beyond the intuitive meaning of such social triangles , we also explore the usefulness of them for gaining insights on the topological structure of the underline network.
Revised:  a novel concept of triangles is introduced, based on the assumption that, should the aggregate weight of two arcs sharing a node induces a link between the not common nodes . Beyond the intuitive meaning of such social triangles , we also explore the usefulness of them for gaining insights on the topological structure of the underline network.
Edit intent: clarity
Original:  a novel concept of triangles is here introducedby assuming thata strong enough aggregate weight of two arcs sharing a node induces a link between the not common nodes . Beyond the intuitive meaning of such social triangles , we also explore the usefulness of them for gaining insights on the topological structure of the underline network.
Revised:  a novel concept of triangles is here introducedby assuming thata strong enough aggregate weight of two arcs sharing a node induces a link between the uncommon nodes can be induced . Beyond the intuitive meaning of such social triangles , we also explore the usefulness of them for gaining insights on the topological structure of the underline network.
Edit intent: clarity
Original:  a novel concept of triangles is here introducedby assuming thata strong enough aggregate weight of two arcs sharing a node induces a link between the not common nodes . Beyond the intuitive meaning of such social triangles , we also explore the usefulness of them for gaining insights on the topological structure of the underline network.
Revised:  a novel concept of triangles is here introducedby assuming thata strong enough aggregate weight of two arcs sharing a node induces a link between the not common nodes . Beyond the intuitive meaning of such generalized triangles in the social context , we also explore the usefulness of them for gaining insights on the topological structure of the underline network.
Edit intent: clarity
Original:  a novel concept of triangles is here introducedby assuming thata strong enough aggregate weight of two arcs sharing a node induces a link between the not common nodes . Beyond the intuitive meaning of such social triangles , we also explore the usefulness of them for gaining insights on the topological structure of the underline network.
Revised:  a novel concept of triangles is here introducedby assuming thata strong enough aggregate weight of two arcs sharing a node induces a link between the not common nodes . Beyond the intuitive meaning of such social triangles , we also explore the usefulness of them for gaining insights into the topological structure of the underline network.
Edit intent: fluency
Original:  a novel concept of triangles is here introducedby assuming thata strong enough aggregate weight of two arcs sharing a node induces a link between the not common nodes . Beyond the intuitive meaning of such social triangles , we also explore the usefulness of them for gaining insights on the topological structure of the underline network.
Revised:  a novel concept of triangles is here introducedby assuming thata strong enough aggregate weight of two arcs sharing a node induces a link between the not common nodes . Beyond the intuitive meaning of such social triangles , we also explore the usefulness of them for gaining insights on the topological structure of the underlying network.
Edit intent: fluency
Original: Medical datasets are often highly imbalanced , over representing common medical problems , and sparsely representing rare problems .
Revised: Medical datasets are often highly imbalanced with over-representation of common medical problems , and sparsely representing rare problems .
Edit intent: clarity
Original: Medical datasets are often highly imbalanced , over representing common medical problems , and sparsely representing rare problems .
Revised: Medical datasets are often highly imbalanced , over representing common medical problems and a paucity of data from rare conditions .
Edit intent: clarity
Original:  Using chest Xrays as a model medical image, we implement a generative adversarial network (GAN) to create artificial images based upon a modest sized labeled dataset.
Revised:  Using chest X-rays as a model medical image, we implement a generative adversarial network (GAN) to create artificial images based upon a modest sized labeled dataset.
Edit intent: fluency
Original: This study uses a 1D fluid dynamics arterial network model to predict pressure and flow dynamics in healthy and hypoxic mice.
Revised: This study uses a one dimensional fluid dynamics arterial network model to predict pressure and flow dynamics in healthy and hypoxic mice.
Edit intent: fluency
Original:  Data for this study include blood flow and pressure measurements from the main pulmonary artery of 7 healthy and 5 hypoxic mice . Representative arterial network dimensions for the 21 largest pulmonary arterial vessels are extracted from micro-CT images from healthy and hypoxic lungs .
Revised:  Data for this study include blood flow and pressure measurements from the main pulmonary artery for 7 healthy and 5 hypoxic mice . Representative arterial network dimensions for the 21 largest pulmonary arterial vessels are extracted from micro-CT images from healthy and hypoxic lungs .
Edit intent: fluency
Original:  Data for this study include blood flow and pressure measurements from the main pulmonary artery of 7 healthy and 5 hypoxic mice . Representative arterial network dimensions for the 21 largest pulmonary arterial vessels are extracted from micro-CT images from healthy and hypoxic lungs .
Revised:  Data for this study include blood flow and pressure measurements from the main pulmonary artery of 7 healthy and 5 hypoxic mice . Representative arterial network dimensions for the 21 vessel network are extracted from micro-CT images from healthy and hypoxic lungs .
Edit intent: clarity
Original:  Data for this study include blood flow and pressure measurements from the main pulmonary artery of 7 healthy and 5 hypoxic mice . Representative arterial network dimensions for the 21 largest pulmonary arterial vessels are extracted from micro-CT images from healthy and hypoxic lungs .
Revised:  Data for this study include blood flow and pressure measurements from the main pulmonary artery of 7 healthy and 5 hypoxic mice . Representative arterial network dimensions for the 21 largest pulmonary arterial vessels are extracted from micro-CT images of lungs from a representative control and hypertensive mouse .
Edit intent: clarity
Original:  Each vessel is represented by its length and radius , and is assumed to taper longitudinally .
Revised:  Each vessel is represented by its length and radius .
Edit intent: clarity
Original:  Fluid dynamic computations are done assuming that the flow is Newtonian, viscous, laminar,  has no swirl , and that the arterial walls are thin .
Revised:  Fluid dynamic computations are done assuming that the flow is Newtonian, viscous, laminar, has no swirl .
Edit intent: coherence
Original:  The system of equations is closed by a constitutive equation relating pressure and area, using either a linear model derived from stress-strain deformation in the circumferential direction or a nonlinear modelof empirical nature .
Revised:  The system of equations is closed by a constitutive equation relating pressure and area, using a linear model derived from stress-strain deformation in the circumferential direction or a nonlinear modelof empirical nature .
Edit intent: coherence