wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this article, we present parallel algorithms, distributed data structures, and communication routines that extend the software framework waLBerla in order to support large-scale, massively parallel lattice Boltzmann-based simulations on non-uniform grids.
Revised:  In this article, we present parallel algorithms, distributed data structures, and communication routines that are implemented in the software framework waLBerla in order to support large-scale, massively parallel lattice Boltzmann-based simulations on non-uniform grids.
Edit intent: clarity
Original:  On an Intel-based system, strong scaling a simulation with refined grids and a total of more than 8.5 million cells is demonstrated to reach a performance of less than one millisecond per time step.
Revised:  On an Intel-based system, the strong scaling of a simulation with refined grids and a total of more than 8.5 million cells is demonstrated to reach a performance of less than one millisecond per time step.
Edit intent: fluency
Original:  This asymmetry allows us to assign nodes to communities with better-than- random success by examining their their local neighborhoods.
Revised:  This asymmetry allows us to assign nodes to communities with better-than- random success by examining their local neighborhoods.
Edit intent: fluency
Original:  This yields a significant improvement over the earlier algorithm of  [DIMV14] which used exponentially larger number of passes.
Revised:  This yields a significant improvement over the earlier algorithm of [DIMV14] that uses exponentially larger number of passes.
Edit intent: fluency
Original:  We complement this result by showing that the tradeoff between the number of passes and space exhibited by our algorithm is in fact tight, at least when the approximation factor is equal to 1. Specifically, we show that any algorithm that computes set cover exactly using ({1 \over 2\delta}-1) passes must use \Omega( m n^{\delta  .
Revised:  We complement this result by showing that the tradeoff between the number of passes and space exhibited by our algorithm is tight, at least when the approximation factor is equal to 1. Specifically, we show that any algorithm that computes set cover exactly using ({1 \over 2\delta}-1) passes must use \Omega( m n^{\delta .
Edit intent: clarity
Original:  We complement this result by showing that the tradeoff between the number of passes and space exhibited by our algorithm is in fact tight, at least when the approximation factor is equal to 1. Specifically, we show that any algorithm that computes set cover exactly using ({1 \over 2\delta}-1) passes must use \Omega( m n^{\delta  .
Revised:  We complement this result by showing that the tradeoff between the number of passes and space exhibited by our algorithm is in fact tight, at least when the approximation factor is equal to 1. Specifically, we show that any algorithm that computes set cover exactly using ({1 \over 2\delta}-1) passes must use \Omega( mn^{\delta .
Edit intent: fluency
Original:  The only previous randomizedlower bound for Set Cover, due to Nisan02%DIFDELCMD < ]%%% , provided only a sub-linear lower bound of \Omega(m) . This indicates that using multiple passes might be necessary in order to achieve sub-linear space bounds for this problem while guaranteeing small approximation factors.
Revised:  Nisan02%DIFDELCMD < ]%%% , provided only a sub-linear lower bound of \Omega(m) . This indicates that using multiple passes might be necessary in order to achieve sub-linear space bounds for this problem while guaranteeing small approximation factors.
Edit intent: coherence
Original:  Thus, the proposed schema framework provides a differentiation between the cognitive aspect of spatial learning and the physiological aspect at the neural network level.
Revised:  Thus, the proposed schema framework differentiates between the cognitive aspect of spatial learning and the physiological aspect at the neural network level.
Edit intent: clarity
Original: Pure morphic sequences are infinite fixed points of morphisms ( under the concatenation operation ) on finite sets . Changing the elements of the finite set does not essentially change the pure morphic sequence .
Revised: Morphisms are homomorphisms under the concatenation operation ) on finite sets . Changing the elements of the finite set does not essentially change the pure morphic sequence .
Edit intent: clarity
Original: Pure morphic sequences are infinite fixed points of morphisms ( under the concatenation operation ) on finite sets . Changing the elements of the finite set does not essentially change the pure morphic sequence .
Revised: Pure morphic sequences are infinite fixed points of morphisms ( under the concatenation operation ) on finite sets . Changing the elements of the finite set does not essentially change the morphism .
Edit intent: fluency
Original:  We propose a way to select a unique representing member out of all these sequences .
Revised:  We propose a way to select a unique representing member out of all these morphisms .
Edit intent: clarity
Original:  This has applications to the classification of the shift dynamical systems generated by pure morphic sequences, and to the storing of pure morphic sequences in databases, like the The On-Line Encyclopedia of Integer Sequences  .
Revised:  This has applications to the classification of the shift dynamical systems generated by pure morphic sequences, and to the storing of pure morphic sequences in databases, like The On-Line Encyclopedia of Integer Sequences .
Edit intent: fluency
Original: Nefarious Internet activity (e.g. distributed denial of service (DDoS)attacks) has been rapidly growing both in frequency of occurrence and magnitude .
Revised: The Internet, as a global system of interconnected networks, carries an extensive array of information resources and services. Key requirements include good quality-of-service and protection of the infrastructure from nefarious activity (e.g. distributed denial of service (DDoS)attacks) has been rapidly growing both in frequency of occurrence and magnitude .
Edit intent: coherence
Original: Nefarious Internet activity (e.g. distributed denial of service (DDoS)attacks) has been rapidly growing both in frequency of occurrence and magnitude .
Revised: Nefarious Internet activity (e.g. distributed denial of service--DDoS--attacks) .
Edit intent: clarity
Original:  Network monitoring and traffic analysis at the time-of-onset of anomalies or attacks is essential to their prevention and mitigation.
Revised:  Network monitoring is essential to their prevention and mitigation.
Edit intent: clarity
Original:  We developed an open source architecture, referred to as AMON (All-packet MONitor), for online monitoring and analysis of multi-gigabit network streams.
Revised:  We developed an open source architecture, AMON (All-packet MONitor), for online monitoring and analysis of multi-gigabit network streams.
Edit intent: coherence
Original:  It utilizes the high-performance packet monitor PF RING in zero-copy mode and is readily deployable on commodity hardware.
Revised:  It leverages the high-performance packet monitor PF RING in zero-copy mode and is readily deployable on commodity hardware.
Edit intent: fluency
Original:  It utilizes the high-performance packet monitor PF RING in zero-copy mode and is readily deployable on commodity hardware.
Revised:  It utilizes the high-performance packet monitor PF RING and is readily deployable on commodity hardware.
Edit intent: clarity
Original:  AMON examines all packets passing through the interface , partitions traffic into sub-streams by using rapid hashing and computes certain real-time statistical summaries for each sub-stream .
Revised:  AMON examines all packets , partitions traffic into sub-streams by using rapid hashing and computes certain real-time statistical summaries for each sub-stream .
Edit intent: clarity
Original:  AMON examines all packets passing through the interface , partitions traffic into sub-streams by using rapid hashing and computes certain real-time statistical summaries for each sub-stream .
Revised:  AMON examines all packets passing through the interface , partitions traffic into sub-streams by using rapid hashing and computes certain real-time data products .
Edit intent: clarity
Original:  The resulting data structures provide views of the intensity and connectivity structure of the network traffic at the time-scale of routing.
Revised:  The resulting data structures provide views of the intensity and connectivity structure of network traffic at the time-scale of routing.
Edit intent: fluency
Original:  We demonstrate our framework in the context of detection/ identification of heavy-hitters as well as the visualization and statistical detection of high-connectivity events such as DDoS.
Revised:  The proposed integrated framework includes modules for the identification of heavy-hitters as well as the visualization and statistical detection of high-connectivity events such as DDoS.
Edit intent: clarity
Original:  We demonstrate our framework in the context of detection/ identification of heavy-hitters as well as the visualization and statistical detection of high-connectivity events such as DDoS.
Revised:  We demonstrate our framework in the context of detection/ identification of heavy-hitters as well as for visualization and statistical detection of high-connectivity events such as DDoS.
Edit intent: fluency
Original:  This allows network operators to quickly visualize and detect network attacks and limit offline and time-consuming post-mortem analysis.
Revised:  This allows operators to quickly visualize and detect network attacks and limit offline and time-consuming post-mortem analysis.
Edit intent: clarity
Original:  This allows network operators to quickly visualize and detect network attacks and limit offline and time-consuming post-mortem analysis.
Revised:  This allows network operators to quickly visualize and diagnose attacks, and limit offline and time-consuming post-mortem analysis.
Edit intent: clarity
Original:  This allows network operators to quickly visualize and detect network attacks and limit offline and time-consuming post-mortem analysis.
Revised:  This allows network operators to quickly visualize and detect network attacks and limit offline and time consuming post-mortem analysis.
Edit intent: fluency
Original:  It is extensible and allows the addition of further data products, statistical , and filtering modules for real-time forensics.
Revised:  It is extensible and allows the addition of further statistical and filtering modules for real-time forensics.
Edit intent: clarity
Original: Our paper aims to model and forecast the electricity price in a completely new and promising style .
Revised: Our paper aims to model and forecast the electricity price by taking a completely new and promising style .
Edit intent: clarity
Original:  Taking full advantages of above two cloud-based techniques, C-RAN with MCC systems are presented in this paper to enhance both performance and energy efficiencies.
Revised:  Taking full advantages of above two cloud-based techniques, C-RAN with MCC are presented in this paper to enhance both performance and energy efficiencies.
Edit intent: clarity
Original:  In particular, this paper studies the joint energy minimization and resource allocation in C-RAN with MMC under the time constraints of the given tasks.
Revised:  In particular, this paper studies the joint energy minimization and resource allocation in C-RAN with MCC under the time constraints of the given tasks.
Edit intent: clarity
Original:  We first give the computational model and network model with the energy and time cost .
Revised:  We first review the energy and time cost .
Edit intent: clarity
Original:  We first give the computational model and network model with the energy and time cost .
Revised:  We first give the computational model and network model with the energy and time model of the computation and communication .
Edit intent: clarity
Original:  An equivalent convex feasibility problem is reformulated and the iterative algorithm based on weighted minimum mean square error (WMMSE) is given to deal with the non-convexity .
Revised:  An equivalent convex feasibility problem is reformulated and the iterative algorithm based on weighted minimum mean square error (WMMSE) . The iterative algorithm is finally given to deal with the non-convexity .
Edit intent: clarity
Original: Vehicular networks allow vehicles to constantly share information with each other and their surrounding, and are expected to be an integral part in future intelligent transportation system (ITS).
Revised: Vehicular networks allow vehicles to share information and are expected to be an integral part in future intelligent transportation system (ITS).
Edit intent: clarity
Original:  We provide an overview of the salient properties of vehicular communication systems near intersections and show how the procedure can be used to model signal propagation conditions typical to different environments of practical relevance , for instance rural and urban scenarios.
Revised:  We provide an overview of the salient properties of vehicular communication systems near intersections and show how the procedure can be used to model different propagation environments of practical relevance , for instance rural and urban scenarios.
Edit intent: clarity
Original:  The results indicate that the procedure is sufficiently general and flexible to deal with a variety of scenarios , and can thus serve as a useful design tool for communication system engineers, complementing simulations and experiments  .
Revised:  The results indicate that the procedure is general and flexible to deal with a variety of scenarios , and can thus serve as a useful design tool for communication system engineers, complementing simulations and experiments .
Edit intent: clarity
Original:  The results indicate that the procedure is sufficiently general and flexible to deal with a variety of scenarios , and can thus serve as a useful design tool for communication system engineers, complementing simulations and experiments  .
Revised:  The results indicate that the procedure is sufficiently general and flexible to deal with a variety of scenarios . Thus, it can serve as a useful design tool for communication system engineers, complementing simulations and experiments .
Edit intent: coherence
Original:  We find that the correlation between true and predicted values decays approximately linearly with respect to either Fst \F or mean kinship between the training and the target populations.
Revised:  We find that the correlation between true and predicted values decays approximately linearly with respect to either \F or mean kinship between the training and the target populations.
Edit intent: clarity
Original: The identification of communities in large-scale networks is a challenging task to existing searching schemes when the communitiesoverlap significantly among their members, as often the case in large-scale social networks.
Revised: Detecting communities in large-scale networks is a challenging task to existing searching schemes when the communitiesoverlap significantly among their members, as often the case in large-scale social networks.
Edit intent: clarity
Original: The identification of communities in large-scale networks is a challenging task to existing searching schemes when the communitiesoverlap significantly among their members, as often the case in large-scale social networks.
Revised: The identification of communities in large-scale networks is a challenging task when each vertex may belong to multiple communities, as is often the case in large-scale social networks.
Edit intent: clarity
Original: The identification of communities in large-scale networks is a challenging task to existing searching schemes when the communitiesoverlap significantly among their members, as often the case in large-scale social networks.
Revised: The identification of communities in large-scale networks is a challenging task to existing searching schemes when the communitiesoverlap significantly among their members, as often the case in social networks.
Edit intent: fluency
Original:  We propose a detection scheme based on properly merging the partial communities revealed by the ego networks of each vertex.
Revised:  We propose a detection scheme based on properly reassembling partial information of communities revealed in ego networks of each vertex.
Edit intent: clarity
Original:  The multiple memberships of a vertex, in turn, illustrates the significant overlaps between communities that calls for the  need of a novel and efficient algorithm such as PCMA  .
Revised:  The multiple memberships of a vertex, in turn, illustrates the significant overlaps between communities that calls for the need of new algorithms, such as PCMA .
Edit intent: clarity
Original: We present an end-to-end, domain-independent neural encoder-aligner-decoder model for selective generation, i.e., the joint task of content selection and surface realization.
Revised: We propose an end-to-end, domain-independent neural encoder-aligner-decoder model for selective generation, i.e., the joint task of content selection and surface realization.
Edit intent: clarity
Original:  Our model first encodes the full set of over-determined database event records (e.g., in weather forecasting and sportscasting) via a memory-based recurrent neural network (LSTM) , then utilizes a novel coarse-to-fine (hierarchical), multi-input aligner to identify the small subset of salient records to talk about, and finally employs a decoder to generate free-form descriptions of the aligned, selected records.
Revised:  Our model first encodes a full set of over-determined database event records (e.g., in weather forecasting and sportscasting) via a memory-based recurrent neural network (LSTM) , then utilizes a novel coarse-to-fine (hierarchical), multi-input aligner to identify the small subset of salient records to talk about, and finally employs a decoder to generate free-form descriptions of the aligned, selected records.
Edit intent: fluency
Original:  Our model first encodes the full set of over-determined database event records (e.g., in weather forecasting and sportscasting) via a memory-based recurrent neural network (LSTM) , then utilizes a novel coarse-to-fine (hierarchical), multi-input aligner to identify the small subset of salient records to talk about, and finally employs a decoder to generate free-form descriptions of the aligned, selected records.
Revised:  Our model first encodes the full set of over-determined database event records via an LSTM-based recurrent neural network (LSTM) , then utilizes a novel coarse-to-fine (hierarchical), multi-input aligner to identify the small subset of salient records to talk about, and finally employs a decoder to generate free-form descriptions of the aligned, selected records.
Edit intent: clarity
Original:  Our model first encodes the full set of over-determined database event records (e.g., in weather forecasting and sportscasting) via a memory-based recurrent neural network (LSTM) , then utilizes a novel coarse-to-fine (hierarchical), multi-input aligner to identify the small subset of salient records to talk about, and finally employs a decoder to generate free-form descriptions of the aligned, selected records.
Revised:  Our model first encodes the full set of over-determined database event records (e.g., in weather forecasting and sportscasting) via a memory-based recurrent neural network , then utilizes a novel coarse-to-fine (hierarchical), multi-input aligner to identify the small subset of salient records to talk about, and finally employs a decoder to generate free-form descriptions of the aligned, selected records.
Edit intent: clarity
Original:  Finally, we also demonstrate the generalizability of our method on the RoboCup dataset, where it gets results that are competitive with  state-of-the-art, despite being severely data-starved.
Revised:  Finally, we also demonstrate the generalizability of our model on the RoboCup dataset, where it gets results that are competitive with state-of-the-art, despite being severely data-starved.
Edit intent: clarity
Original:  Finally, we also demonstrate the generalizability of our method on the RoboCup dataset, where it gets results that are competitive with  state-of-the-art, despite being severely data-starved.
Revised:  Finally, we also demonstrate the generalizability of our method on the RoboCup dataset, and get results that are competitive with state-of-the-art, despite being severely data-starved.
Edit intent: coherence
Original: Cellular processes do not follow deterministic rules , even in identical environments genetically identical cells can make random choices leading to different phenotypes.
Revised: Cellular processes do not follow deterministic rules ; even in identical environments genetically identical cells can make random choices leading to different phenotypes.
Edit intent: fluency
Original:  Here  we develop an analytical formalism that allows for calculation of the effect of extrinsic noise on gene expression motifs.
Revised:  Here , we develop an analytical formalism that allows for calculation of the effect of extrinsic noise on gene expression motifs.
Edit intent: fluency
Original:  We introduce a new method for modeling bounded EN as an auxiliary species in the master equation.
Revised:  We introduce a method for modeling bounded EN as an auxiliary species in the master equation.
Edit intent: clarity
Original:  We focus our study on motifs that can be viewed as the building blocks of genetic switches: a non-regulated gene, a self-inhibiting gene, and a self-promoting gene.
Revised:  We focus our study on motifs that can be viewed as the building blocks of genetic switches: a nonregulated gene, a self-inhibiting gene, and a self-promoting gene.
Edit intent: fluency
Original:  This has the undesirable consequence of increasing insurance costs , in a way that is independent of a customer's contribution to the causes of climate change.
Revised:  This will increase insurance premiums , in a way that is independent of a customer's contribution to the causes of climate change.
Edit intent: clarity
Original:  This is unfortunate because insurance provides a financial mechanism that mitigates some of the consequences of climate change, allowing damage from increasingly frequent events to be repaired.
Revised:  Insurance provides a financial mechanism that mitigates some of the consequences of climate change, allowing damage from increasingly frequent events to be repaired.
Edit intent: coherence
Original:  In the first scenario, the average coverage probability and the average sum-rate for the users in the area are derived as a function of the UAV altitude and the number of D2D users.
Revised:  In the first scenario, the average coverage probability and the system sum-rate for the users in the area are derived as a function of the UAV altitude and the number of D2D users.
Edit intent: clarity
Original:   Simulation and analytical results show that, depending on the density of D2D users, optimal values for the UAV altitude exist for which the average sum-rate and the coverage probability are maximized.
Revised:  Simulation and analytical results show that, depending on the density of D2D users, optimal values for the UAV altitude exist for which the system sum-rate and the coverage probability are maximized.
Edit intent: clarity
Original:  We describe highly optimized open source software in C++ for both HierNMF2 and FlatNMF2 for hierarchical and partitional clustering/topic modeling of document data sets.
Revised:  We implement highly optimized open source software in C++ for both HierNMF2 and FlatNMF2 for hierarchical and partitional clustering/topic modeling of document data sets.
Edit intent: clarity
Original:  Moreover, this emulation mechanism mitigates the decrease in trading volumes, which is a typical drawback of Tobin-like taxes .
Revised:  Moreover, this emulation mechanism mitigates the decrease in trading volumes, which is a typical drawback of TTs .
Edit intent: clarity