wanyu/IteraTeR_v2 huggingface dataset:
Original:  UB-ANC  is an open software/hardware platform that aims to facilitate rapid testing and repeatable comparative evaluation of various airborne networking and communications protocols at different layers of the network protocol stack.
Revised:  UB-ANC is an open software/hardware platform that aims to facilitate rapid testing and repeatable comparative evaluation of airborne networking and communications protocols at different layers of the network protocol stack.
Edit intent: clarity
Original:  UB-ANC  is an open software/hardware platform that aims to facilitate rapid testing and repeatable comparative evaluation of various airborne networking and communications protocols at different layers of the network protocol stack.
Revised:  UB-ANC is an open software/hardware platform that aims to facilitate rapid testing and repeatable comparative evaluation of various airborne networking and communications protocols at different layers of the protocol stack.
Edit intent: clarity
Original:  In particular, it combines quadcopters capable of autonomous flight with USRP E310 embedded software-defined radios (SDRs), which enable flexible deployment of novel communications and networking protocols , and real-time reconfigurable cognitive radio frequency (RF) links .
Revised:  It combines quadcopters capable of autonomous flight with USRP E310 embedded software-defined radios (SDRs), which enable flexible deployment of novel communications and networking protocols , and real-time reconfigurable cognitive radio frequency (RF) links .
Edit intent: coherence
Original:  In particular, it combines quadcopters capable of autonomous flight with USRP E310 embedded software-defined radios (SDRs), which enable flexible deployment of novel communications and networking protocols , and real-time reconfigurable cognitive radio frequency (RF) links .
Revised:  In particular, it combines quadcopters capable of autonomous flight with USRP E310 embedded software-defined radios (SDRs), which enable flexible deployment of novel communications and networking protocols .
Edit intent: coherence
Original:  This is in contrast to existing airborne network testbeds, which typically rely on inflexible off-the-shelf radios based on fixed standards and protocols , e.g., IEEE 802.11 ( Wi-Fi ) or IEEE 802.15.4 (Zigbee) . UB-ANC  is designed with emphasis on modularity in terms of both hardware and software, which makes it highly customizable.
Revised:  This is in contrast to existing airborne network testbeds, which rely on standard inflexible wireless technologies , e.g., IEEE 802.11 ( Wi-Fi ) or IEEE 802.15.4 (Zigbee) . UB-ANC is designed with emphasis on modularity in terms of both hardware and software, which makes it highly customizable.
Edit intent: clarity
Original:  This is in contrast to existing airborne network testbeds, which typically rely on inflexible off-the-shelf radios based on fixed standards and protocols , e.g., IEEE 802.11 ( Wi-Fi ) or IEEE 802.15.4 (Zigbee) . UB-ANC  is designed with emphasis on modularity in terms of both hardware and software, which makes it highly customizable.
Revised:  This is in contrast to existing airborne network testbeds, which typically rely on inflexible off-the-shelf radios based on fixed standards and protocols , e.g., Wi-Fi ) or IEEE 802.15.4 (Zigbee) . UB-ANC is designed with emphasis on modularity in terms of both hardware and software, which makes it highly customizable.
Edit intent: coherence
Original:  This is in contrast to existing airborne network testbeds, which typically rely on inflexible off-the-shelf radios based on fixed standards and protocols , e.g., IEEE 802.11 ( Wi-Fi ) or IEEE 802.15.4 (Zigbee) . UB-ANC  is designed with emphasis on modularity in terms of both hardware and software, which makes it highly customizable.
Revised:  This is in contrast to existing airborne network testbeds, which typically rely on inflexible off-the-shelf radios based on fixed standards and protocols , e.g., IEEE 802.11 ( Wi-Fi or Zigbee . UB-ANC is designed with emphasis on modularity in terms of both hardware and software, which makes it highly customizable.
Edit intent: coherence
Original:  In this paper, we present the hardware and software architectures underlying UB-ANC, describe the implementation and operation of its most important components, and discuss how these components can be modified to achieve desired behaviors .
Revised:  In this paper, we present the hardware and software architecture .
Edit intent: clarity
Original:  In contrast to the macroscopic similarity between processes spreading on different networks -- confirmed by our simulations, the differences in local connectivity determined by the two definitions of edges result in striking differences between the dynamics at a microscopic level, preventing the dentification of the nodes at risk.
Revised:  In contrast to the macroscopic similarity between processes spreading on different networks - confirmed by our simulations, the differences in local connectivity determined by the two definitions of edges result in striking differences between the dynamics at a microscopic level, preventing the dentification of the nodes at risk.
Edit intent: fluency
Original:  In contrast to the macroscopic similarity between processes spreading on different networks -- confirmed by our simulations, the differences in local connectivity determined by the two definitions of edges result in striking differences between the dynamics at a microscopic level, preventing the dentification of the nodes at risk.
Revised:  In contrast to the macroscopic similarity between processes spreading on different networks -- confirmed by our simulations, the differences in local connectivity determined by the two definitions of edges result in striking differences between the dynamics at a microscopic level, preventing the identification of the nodes at risk.
Edit intent: clarity
Original:  Through computer simulation , we compare infection processes on the resulting networks and show that friendship provides a poor identification of the individuals at risk if the infection is driven by physical encounter.
Revised:  Through computer simulations , we compare infection processes on the resulting networks and show that friendship provides a poor identification of the individuals at risk if the infection is driven by physical encounter.
Edit intent: fluency
Original: The spread of an infection on a real-world social network is determined by the interplay of two processes - the dynamics of the network, whose structure changes over time according to the encounters between individuals, and the dynamics on the network, whose nodes can infect each other after an encounter.
Revised: The spread of an infection on a real-world social network is determined by the interplay of two processes : the dynamics of the network, whose structure changes over time according to the encounters between individuals, and the dynamics on the network, whose nodes can infect each other after an encounter.
Edit intent: fluency
Original:  Physical encounter is the most common vehicle for the spread of infectious diseases, but detailed information about said encounters is often unavailable because expensive, unpractical to collect or privacy sensitive.
Revised:  Physical encounter is the most common vehicle for the spread of infectious diseases, but detailed information about encounters is often unavailable because expensive, unpractical to collect or privacy sensitive.
Edit intent: clarity
Original:  The present work asks whether the friendship ties between the individuals in a social network successfully predict who is at risk.
Revised:  We asks whether the friendship ties between the individuals in a social network successfully predict who is at risk.
Edit intent: clarity
Original:  Using a dataset from a popular online review service, we build a time-varying network that is a proxy of physical encounter between users and a static network based on their reported friendship.
Revised:  Using a dataset from a popular online review service, we build a time-varying network that is a proxy of physical encounter between users and a static network based on reported friendship.
Edit intent: clarity
Original:  Our analyses suggest that such limit is not due to the randomness of the infection process , but to the structural differences of the two networks.
Revised:  Such limit is not due to the randomness of the infection process , but to the structural differences of the two networks.
Edit intent: clarity
Original:  Our analyses suggest that such limit is not due to the randomness of the infection process , but to the structural differences of the two networks.
Revised:  Our analyses suggest that such limit is not due to the randomness of the infection , but to the structural differences of the two networks.
Edit intent: clarity
Original:  In contrast to the macroscopic similarity between processes spreading on different networks - confirmed by our simulations , the differences in local connectivity determined by the two definitions of edges result in striking differences between the dynamics at a microscopic level , preventing the identification of the nodes at risk .
Revised:  In contrast to the macroscopic similarity between processes spreading on different networks , the differences in local connectivity determined by the two definitions of edges result in striking differences between the dynamics at a microscopic level , preventing the identification of the nodes at risk .
Edit intent: coherence
Original: The study of network structure has uncovered organizational principles in complex systems.
Revised: The study of network structure has uncovered signatures of the organization of complex systems.
Edit intent: clarity
Original:  Two recent methodologies suggest that the controllability of complex multivariate systems can be predicted solely from the graph of interactions between variables, without considering variable dynamics: structural controllability and minimum dominating sets.
Revised:  Two recent methodologies suggest that the controllability of complex systems can be predicted solely from the graph of interactions between variables, without considering variable dynamics: structural controllability and minimum dominating sets.
Edit intent: clarity
Original:  Two recent methodologies suggest that the controllability of complex multivariate systems can be predicted solely from the graph of interactions between variables, without considering variable dynamics: structural controllability and minimum dominating sets.
Revised:  Two recent methodologies suggest that the controllability of complex multivariate systems can be predicted solely from the graph of interactions between variables, without considering their dynamics: structural controllability and minimum dominating sets.
Edit intent: clarity
Original:  We demonstrate that  structure-only methods fail to properly characterize controllability in these nonlinear systems;
Revised:  We demonstrate that such structure-only methods fail to properly characterize controllability in these nonlinear systems;
Edit intent: clarity
Original:  Our methodology is also used to characterize critical control variables in three models of biochemical regulation: the Drosophila melanogaster single-cell segment polarity network , the eukaryotic cell cycle of budding yeast Saccharomyces cerevisiae, and the floral organ arrangement in Arabidopsis thaliana.
Revised:  Our methodology is also used to characterize critical control variables in three models of biochemical regulation: the segment polarity network , the eukaryotic cell cycle of budding yeast Saccharomyces cerevisiae, and the floral organ arrangement in Arabidopsis thaliana.
Edit intent: coherence
Original:  Our methodology is also used to characterize critical control variables in three models of biochemical regulation: the Drosophila melanogaster single-cell segment polarity network , the eukaryotic cell cycle of budding yeast Saccharomyces cerevisiae, and the floral organ arrangement in Arabidopsis thaliana.
Revised:  Our methodology is also used to characterize critical control variables in three models of biochemical regulation: the Drosophila melanogaster single-cell segment polarity network in Drosophila melanogaster, the cell cycle of budding yeast Saccharomyces cerevisiae, and the floral organ arrangement in Arabidopsis thaliana.
Edit intent: clarity
Original:  Structure-only methods both undershoot and overshoot the number and which sets of variables actually control these models, highlighting the importance of the  system dynamics in determining control.
Revised:  We demonstrate that structure-only methods both undershoot and overshoot the number and which sets of variables actually control these models, highlighting the importance of the system dynamics in determining control.
Edit intent: clarity
Original:  Structure-only methods both undershoot and overshoot the number and which sets of variables actually control these models, highlighting the importance of the  system dynamics in determining control.
Revised:  Structure-only methods both undershoot and overshoot the number and which sets of critical variables best control the dynamics of these models, highlighting the importance of the system dynamics in determining control.
Edit intent: clarity
Original:  Structure-only methods both undershoot and overshoot the number and which sets of variables actually control these models, highlighting the importance of the  system dynamics in determining control.
Revised:  Structure-only methods both undershoot and overshoot the number and which sets of variables actually control these models, highlighting the importance of the actual system dynamics in determining control.
Edit intent: clarity
Original:  Our analysis further shows that the logic of automata transition functions, namely how canalizing they are, plays a role in the extent to which structure predicts dynamics.
Revised:  Our analysis further shows that the logic of automata transition functions, namely how canalizing they are, plays an important role in the extent to which structure predicts dynamics.
Edit intent: clarity
Original: Distributed systems for storing and processing large graphs have become an increasingly common infrastructure component.
Revised: Graph databases have become an increasingly common infrastructure component.
Edit intent: clarity
Original:  Yet existing systems either operate on offline snapshots, provide poor consistency guaranteesfor dynamically changing graphs, or employ expensive concurrency control techniques that limit performance.
Revised:  Yet existing systems either operate on offline snapshots, provide weak consistency guarantees, or use expensive concurrency control techniques that limit performance.
Edit intent: clarity
Original:  In this paper, we introduce a new distributed graph store , called Weaver, which enables efficient, transactional graph analyses as well as strictly serializable read-write transactions on dynamic graphs.
Revised:  In this paper, we introduce a new distributed graph database , called Weaver, which enables efficient, transactional graph analyses as well as strictly serializable read-write transactions on dynamic graphs.
Edit intent: clarity
Original:  The key insight that enables Weaver to combine strict serializability with horizontal scalability and high performance is a novel request ordering mechanism called refinable timestamps.
Revised:  The key insight that allows Weaver to combine strict serializability with horizontal scalability and high performance is a novel request ordering mechanism called refinable timestamps.
Edit intent: fluency
Original: Boolean factor analysis is the task of decomposing a Binary matrix to the Boolean product of two binary factors.
Revised: Boolean factor analysis is the task of decomposing a binary matrix to the Boolean product of two binary factors.
Edit intent: fluency
Original:  Our empirical study demonstrates that message passing is able to recover low-rank Boolean matrices, in the boundaries of theoretically possible recovery and outperform existing techniques in real-world applications, such as large-scale binary valued collaborative filtering tasks .
Revised:  Our empirical study demonstrates that message passing is able to recover low-rank Boolean matrices, in the boundaries of theoretically possible recovery and outperform existing techniques in real-world applications, such collaborative filtering with large-scale binary valued collaborative filtering tasks .
Edit intent: clarity
Original:  Our empirical study demonstrates that message passing is able to recover low-rank Boolean matrices, in the boundaries of theoretically possible recovery and outperform existing techniques in real-world applications, such as large-scale binary valued collaborative filtering tasks .
Revised:  Our empirical study demonstrates that message passing is able to recover low-rank Boolean matrices, in the boundaries of theoretically possible recovery and outperform existing techniques in real-world applications, such as large-scale Boolean data .
Edit intent: clarity
Original:  This unsupervised data-analysis approach is desirable due to its interpretability, but hard to perform due its NP-hardness.
Revised:  This unsupervised data-analysis methods due to their interpretability, but hard to perform due its NP-hardness.
Edit intent: clarity
Original:  This unsupervised data-analysis approach is desirable due to its interpretability, but hard to perform due its NP-hardness.
Revised:  This unsupervised data-analysis approach is desirable due to its interpretability, but hard to perform due to their NP-hardness.
Edit intent: fluency
Original:  A closely related problem is low-rank Boolean matrix completion from noisy observations.
Edit intent: coherence
Original:  Our empirical study demonstrates that message passing is able to recover low-rank Boolean matrices, in the boundaries of theoretically possible recovery and outperform existing techniques in real-world applications, such collaborative filtering with large-scale Boolean data.
Revised:  Our empirical study demonstrates that message passing is able to recover low-rank Boolean matrices, in the boundaries of theoretically possible recovery and compares favorably with state-of-the-art in real-world applications, such collaborative filtering with large-scale Boolean data.
Edit intent: clarity
Original:  For this problem, it is easily known that any accumulation point of the classical projected gradient (PG) method with a constant stepsize 1/L satisfies the L-stationarity optimality condition that was introduced in [3].
Revised:  For this problem, it is known that any accumulation point of the classical projected gradient (PG) method with a constant stepsize 1/L satisfies the L-stationarity optimality condition that was introduced in [3].
Edit intent: clarity
Original: For a nonnegative integer t, let c_t be the asymptotic density of natural numbers n for which s(n + t) \geq s(n), where s(n) denotes the sum of digits of n in base ~ 2.
Revised: For a nonnegative integer t, let c_t be the asymptotic density of natural numbers n for which s(n + t) \geq s(n), where s(n) denotes the sum of digits of n in base 2.
Edit intent: clarity
Original:  We prove that c_t > 1/2 for t in a set of asymptotic density ~ 1, thus giving a partial solution to a conjecture of T. W. Cusick stating that c_t > 1/2 for all t.
Revised:  We prove that c_t > 1/2 for t in a set of asymptotic density 1, thus giving a partial solution to a conjecture of T. W. Cusick stating that c_t > 1/2 for all t.
Edit intent: clarity
Original:  Interestingly  this problem has several equivalent formulations, for example that the polynomial X(X + 1)\cdots(X + t - 1) has less than 2^t zeros modulo 2^{t+1}  .
Revised:  Interestingly , this problem has several equivalent formulations, for example that the polynomial X(X + 1)\cdots(X + t - 1) has less than 2^t zeros modulo 2^{t+1} .
Edit intent: fluency
Original:  This prohibits their usage on resource limited hardware, including cell phones or other embedded devices.
Revised:  This prohibits their usage on smartphones or other resource limited devices.
Edit intent: clarity
Original: Because of their performance, deep neural networks are increasingly used for object recognition.
Revised: Thanks to their state-of-the-art performance, deep neural networks are increasingly used for object recognition.
Edit intent: clarity
Original:  They are particularly attractive because of their ability to 'absorb' great quantities of labeled data through millions of parameters  .
Revised:  To achieve these results, they use millions of parameters .
Edit intent: clarity
Original:  They are particularly attractive because of their ability to 'absorb' great quantities of labeled data through millions of parameters  .
Revised:  They are particularly attractive because of their ability to 'absorb' great quantities of labeled data through millions of parameters to be trained .
Edit intent: clarity
Original:  We introduce a novel compression method for deep neural networks that performs during the learning phase.
Revised:  We introduce a novel compression method for deep neural networks that is performed during the learning phase.
Edit intent: clarity
Original:  We combine this method with Product Quantization (PQ) of the trained weights for higher savings in memory and storage consumption.
Revised:  We combine this method with Product Quantization (PQ) of the trained weights for higher savings in storage consumption.
Edit intent: clarity
Original:  We evaluate our method on two data sets (MNIST and CIFAR10), on which we achieve significantly larger compression  than state-of-the-art methods.
Revised:  We evaluate our method on two data sets (MNIST and CIFAR10), on which we achieve significantly larger compression rates than state-of-the-art methods.
Edit intent: clarity
Original:  Simulation results show that the energy consumption can be reduced by almost 85\% in the sensor nodes with the highest work load , and we detail the impact of predicting and aggregating the transmissions in the results .
Revised:  Simulation results show that the number of transmissions can be reduced by almost 85\% in the sensor nodes with the highest work load , and we detail the impact of predicting and aggregating the transmissions in the results .
Edit intent: clarity
Original:  Simulation results show that the energy consumption can be reduced by almost 85\% in the sensor nodes with the highest work load , and we detail the impact of predicting and aggregating the transmissions in the results .
Revised:  Simulation results show that the energy consumption can be reduced by almost 85\% in the sensor nodes with the highest workload , and we detail the impact of predicting and aggregating the transmissions in the results .
Edit intent: fluency
Original: Future Internet of Things (IoT) applications will require that billions of wireless sensors devices , including smartphones and home appliances, transmit data to the cloud frequently.
Revised: Future Internet of Things (IoT) applications will require that billions of wireless devices transmit data to the cloud frequently.
Edit intent: clarity
Original:  In this work, we present a sensor network model that uses statistical theorems to describe the expected impact of aggregating and predicting the data generated by sensors in Wireless Sensor Networks (WSNs) .
Revised:  In this work, we present a sensor network model that uses statistical theorems to describe the expected impact of DPSs and data aggregation in WSNs .
Edit intent: clarity
Original:  We aim to provide a foundation for future works by characterizing the theoretical gains of processing the sensed data and conditioning its transmission  .
Revised:  We aim to provide a foundation for future works by characterizing the theoretical gains of processing data in sensors and conditioning its transmission .
Edit intent: clarity