wanyu/IteraTeR_v2 huggingface dataset:
Original:  From the feature mapping of several widely used activation functions made by Hermite polynomials, We found sharp declines or even saddle points in the feature space, which stagnate the information transfer in deep neural networks, then present an activation function design based on the Hermite polynomials for better utilization of spatial representation.
Revised:  From the feature mapping of several widely used activation functions made by Hermite polynomials, We found sharp declines or even saddle points in the feature space, which stagnate the information transfer in DNNs. We then present a new activation function design based on the Hermite polynomials for better utilization of spatial representation.
Edit intent: clarity
Original:  Moreover, we analyze the information transfer of deep neural networks , emphasizing the convergence problem caused by the mismatch between input and topological structure.
Revised:  Moreover, we analyze the information transfer of DNNs , emphasizing the convergence problem caused by the mismatch between input and topological structure.
Edit intent: clarity
Original:  Our theoretical analysis reveals that deep neural networks use spatial domains for information representation and evolve to the edge of chaos as depth increases.
Revised:  Our theoretical analysis reveals that DNNs use spatial domains for information representation and evolve to the edge of chaos as depth increases.
Edit intent: clarity
Original: The shear shallow water model provides a higher order approximation for shallow water flows by including the effect of vertical shear in the model.
Revised: The shear shallow water model provides an approximation for shallow water flows by including the effect of vertical shear in the model.
Edit intent: clarity
Original: We study the learning of an external signal by a neural network and the time to forget it when this network is submitted to other signals considered as noise.
Revised: We study the learning of an external signal by a neural network and the time to forget it when this network is submitted to noise.
Edit intent: clarity
Original:  The presentation of an external stimulus changes the state of the synapses in a network of binary neurons  .
Revised:  The presentation of an external stimulus to the recurrent network of binary neurons .
Edit intent: clarity
Original:  The presentation of an external stimulus changes the state of the synapses in a network of binary neurons  .
Revised:  The presentation of an external stimulus changes the state of the synapses in a network of binary neurons may change the state of the synapses .
Edit intent: clarity
Original:  Then, the presentation of other signals also changes the synaptic weight (during the forgetting time).
Revised:  Then, during the forgetting time, the presentation of other signals also changes the synaptic weight (during the forgetting time).
Edit intent: clarity
Original:  We study mathematically these Markov chains and obtain a lower bound on the number of external stimulus that the network can receive before the initial signal is forgotten .
Revised:  We study the dynamics of these Markov chains and obtain a lower bound on the number of external stimulus that the network can receive before the initial signal is forgotten .
Edit intent: clarity
Original:  We study mathematically these Markov chains and obtain a lower bound on the number of external stimulus that the network can receive before the initial signal is forgotten .
Revised:  We study mathematically these Markov chains and obtain a lower bound on the number of external stimuli that the network can receive before the initial signal is forgotten .
Edit intent: fluency
Original:  They are based on a finite time analysis rather than large time asymptotic.
Revised:  Our results are based on a finite time analysis rather than large time asymptotic.
Edit intent: fluency
Original:  We take an alternate approach, motivated by the commercial availability of very low latency non-volatile memory (NVM) . By colocating computation and NVM storage, we can provide applications much higher I/O performance, sub-second application failover, and strong consistency.
Revised:  We take an alternate approach, motivated by the commercial availability of very low latency non-volatile memory (NVM) . By colocating computation and PMM storage, we can provide applications much higher I/O performance, sub-second application failover, and strong consistency.
Edit intent: clarity
Original:  To demonstrate this, we built the Assise distributed file system, based on a persistent, replicated cache coherence protocol for managing a set of colocated NVM storage devices as a layer.
Revised:  To demonstrate this, we built the Assise distributed file system, based on a persistent, replicated coherence protocol for managing a set of colocated NVM storage devices as a layer.
Edit intent: clarity
Original:  Instead, remote NVM serves as an intermediate, byte-addressable cache between colocated NVM and slower storage, such as SSDs.  We compare Assise to Ceph/Bluestore, NFS, and Octopus on a cluster with Intel Optane DC persistent memory modules and SSDs for common cloud applications and benchmarks, such as LevelDB, Postfix, MinuteSort, and FileBench.
Revised:  Instead, remote NVM serves as an intermediate, byte-addressable cache between colocated NVM and slower storage, such as SSDs. We compare Assise to Ceph/Bluestore, NFS, and Octopus on a cluster with Intel Optane DC PMMs and SSDs for common cloud applications and benchmarks, such as LevelDB, Postfix, MinuteSort, and FileBench.
Edit intent: clarity
Original:  We find that Assise improves write latency up to 22x, throughput up to 56x, fail-over time up to 103x, and scales up to 6x better than Ceph , while providing stronger consistency semantics  .
Revised:  We find that Assise improves write latency up to 22x, throughput up to 56x, fail-over time up to 103x, and scales up to 6x better than its counterparts , while providing stronger consistency semantics .
Edit intent: clarity
Original: In this work, we study peak-age-optimal scheduling with stability constraints in a multiple access channel (MAC) with two heterogeneous source nodes transmitting to a common destination.
Revised: In this work, we study age-optimal scheduling with stability constraints in a multiple access channel (MAC) with two heterogeneous source nodes transmitting to a common destination.
Edit intent: clarity
Original: In this work, we study peak-age-optimal scheduling with stability constraints in a multiple access channel (MAC) with two heterogeneous source nodes transmitting to a common destination.
Revised: In this work, we study peak-age-optimal scheduling with stability constraints in a multiple access channel with two heterogeneous source nodes transmitting to a common destination.
Edit intent: clarity
Original:  The first node has randomly arriving data packets and it is connected to a power grid  .
Revised:  The first node is connected to a power grid .
Edit intent: clarity
Original:  The first node has randomly arriving data packets and it is connected to a power grid  .
Revised:  The first node has randomly arriving data packets and it is connected to a power grid and it has randomly arriving data packets .
Edit intent: coherence
Original:  Another energy harvesting (EH) sensor node monitors the environment and sends status updates to the destination.
Revised:  Another energy harvesting (EH) sensor monitors a stochastic process and sends status updates to the destination.
Edit intent: clarity
Original:  The dynamic policy is developed by using   Lyapunov optimization theory with the help of virtual queues . Simulation results show that the dynamic scheduling policy achieves lower average peak AoI compared to the stationary one , especially when the destination node have low multi-packet reception (MPR) capability.
Revised:  The dynamic policy is developed by using Lyapunov optimization theory . Simulation results show that the dynamic scheduling policy achieves lower average peak AoI compared to the stationary one , especially when the destination node have low multi-packet reception (MPR) capability.
Edit intent: clarity
Original:  The dynamic policy is developed by using   Lyapunov optimization theory with the help of virtual queues . Simulation results show that the dynamic scheduling policy achieves lower average peak AoI compared to the stationary one , especially when the destination node have low multi-packet reception (MPR) capability.
Revised:  The dynamic policy is developed by using Lyapunov optimization theory with the help of virtual queues . Simulation results show that the dynamic scheduling policy achieves lower average peak AoI compared to the stationary one , especially when the destination node has low multi-packet reception (MPR) capability.
Edit intent: fluency
Original:  First, we consider a stationary randomized (SR ) policy where both nodes make independent transmission decisions based on some fixed probability distributions.
Revised:  First, we consider a (SR ) policy where both nodes make independent transmission decisions based on some fixed probability distributions.
Edit intent: clarity
Original:  Furthermore, we consider a Drift-Plus-Penalty (DPP) policy and develop AoI-optimal and peak-AoI-optimal scheduling algorithms using the Lyapunov optimization theory.
Revised:  Furthermore, we consider a Drift-Plus-Penalty (DPP) policy and develop AoI-optimal and peak-AoI-optimal scheduling algorithms using the Lyapunov optimization theory.
Edit intent: fluency
Original: Our team has recently demonstrated that clan decompositions of generalized Gaifman graphs provide advantageous hierarchical visualizations of co-occurrence patterns in data.
Revised: We argue that the existing knowledge about modular decomposition of graphs and clan decomposition of 2-structures can be put to use advantageously in a context of data analysis. We show how to obtain visual descriptions of co-occurrence patterns in data.
Edit intent: clarity
Original: Learned representations of source codeenable various software developer tools , e.g., to detect bugs or to predict program properties .
Revised: Identifier names convey useful information about the intended semantics of code. Name-based program analyses use this information , e.g., to detect bugs or to predict program properties .
Edit intent: clarity
Original:  The benchmark is based on thousands of ratings gathered by surveying 500 software developers.
Revised:  The benchmark is based on thousands of ratings by 500 software developers.
Edit intent: clarity
Original:  We use IdBench to evaluate state-of-the-art embedding techniques proposed for natural language, an embedding technique specifically designed for source code, and lexical string distance functions , as these are often used in current developer tools .
Revised:  We use IdBench to study state-of-the-art embedding techniques proposed for natural language, an embedding technique specifically designed for source code, and lexical string distance functions , as these are often used in current developer tools .
Edit intent: clarity
Original:  We use IdBench to evaluate state-of-the-art embedding techniques proposed for natural language, an embedding technique specifically designed for source code, and lexical string distance functions , as these are often used in current developer tools .
Revised:  We use IdBench to evaluate state-of-the-art embedding techniques proposed for natural language, an embedding technique specifically designed for source code, and lexical string distance functions .
Edit intent: coherence
Original:  Our results show that the effectiveness of embeddings varies significantly across different embedding techniques and that the best available embeddings successfully represent semantic relatedness.
Revised:  Our results show that the effectiveness of semantic representations varies significantly and that the best available embeddings successfully represent semantic relatedness.
Edit intent: clarity
Original:  On the downside, no existing embedding provides a satisfactory representation of semantic similarities, e.g., because embeddings consider identifiers with opposing meanings as similar, which may lead to fatal mistakes in downstream developer tools.
Revised:  On the downside, no existing technique provides a satisfactory representation of semantic similarities, e.g., because embeddings consider identifiers with opposing meanings as similar, which may lead to fatal mistakes in downstream developer tools.
Edit intent: clarity
Original:  On the downside, no existing embedding provides a satisfactory representation of semantic similarities, e.g., because embeddings consider identifiers with opposing meanings as similar, which may lead to fatal mistakes in downstream developer tools.
Revised:  On the downside, no existing embedding provides a satisfactory representation of semantic similarities, among other reasons because identifiers with opposing meanings as similar, which may lead to fatal mistakes in downstream developer tools.
Edit intent: coherence
Original:  On the downside, no existing embedding provides a satisfactory representation of semantic similarities, e.g., because embeddings consider identifiers with opposing meanings as similar, which may lead to fatal mistakes in downstream developer tools.
Revised:  On the downside, no existing embedding provides a satisfactory representation of semantic similarities, e.g., because embeddings consider identifiers with opposing meanings are incorrectly considered to be similar, which may lead to fatal mistakes in downstream developer tools.
Edit intent: clarity
Original: Vehicle platooning is a new driving technology that enables vehicles to form a road train autonomously.
Revised: Vehicle platooning is an automated driving technology that enables vehicles to form a road train autonomously.
Edit intent: clarity
Original:  A novel concept called Virtual Leader  is developed to effectively manage a long platoon;
Revised:  We introduce a novel concept called Virtual Leader is developed to effectively manage a long platoon;
Edit intent: coherence
Original:  a distributed algorithm based on a novel model called the Virtual Leader Quality Index (VLQI) is designed to effectively extend the coverage of the platoon leaderand to support the vehicle join and leave maneuvers  for a long platoon.
Revised:  a distributed algorithm based on a novel model called the Virtual Leader Quality Index (VLQI) is designed to effectively extend the coverage of the platoon leaderand to support the vehicle join and leave maneuvers specifically for a long platoon.
Edit intent: clarity
Original:  Extensive simulation is performed using combination of Veins (Plexe) and SUMO . The results demonstrate that L-Platooning enables vehicles to form a long platoon rapidly and reliably, maintain the desired inter-vehicle distances precisely, and handles elegantly the vehicle join and leave maneuvers  .
Revised:  Through extensive simulations using the combination of Veins (Plexe) and SUMO . The results demonstrate that L-Platooning enables vehicles to form a long platoon rapidly and reliably, maintain the desired inter-vehicle distances precisely, and handles elegantly the vehicle join and leave maneuvers .
Edit intent: clarity
Original:  Extensive simulation is performed using combination of Veins (Plexe) and SUMO . The results demonstrate that L-Platooning enables vehicles to form a long platoon rapidly and reliably, maintain the desired inter-vehicle distances precisely, and handles elegantly the vehicle join and leave maneuvers  .
Revised:  Extensive simulation is performed using combination of Veins (Plexe) and SUMO , we demonstrate that L-Platooning enables vehicles to form a long platoon rapidly and reliably, maintain the desired inter-vehicle distances precisely, and handles elegantly the vehicle join and leave maneuvers .
Edit intent: clarity
Original:  Extensive simulation is performed using combination of Veins (Plexe) and SUMO . The results demonstrate that L-Platooning enables vehicles to form a long platoon rapidly and reliably, maintain the desired inter-vehicle distances precisely, and handles elegantly the vehicle join and leave maneuvers  .
Revised:  Extensive simulation is performed using combination of Veins (Plexe) and SUMO . The results demonstrate that L-Platooning enables vehicles to form a long platoon rapidly and reliably, maintain the desired inter-vehicle distance precisely. We also show that L-Platooning handles seamlessly the vehicle join and leave maneuvers .
Edit intent: coherence
Original:  Extensive simulation is performed using combination of Veins (Plexe) and SUMO . The results demonstrate that L-Platooning enables vehicles to form a long platoon rapidly and reliably, maintain the desired inter-vehicle distances precisely, and handles elegantly the vehicle join and leave maneuvers  .
Revised:  Extensive simulation is performed using combination of Veins (Plexe) and SUMO . The results demonstrate that L-Platooning enables vehicles to form a long platoon rapidly and reliably, maintain the desired inter-vehicle distances precisely, and handles elegantly the vehicle join and leave maneuvers for a long platoon .
Edit intent: clarity
Original:  We focus on switching between a lower (e.g.  3.5 GHz) band and a millimeter wave band (e.g.  28 GHz), and design and evaluate two classification models that are trained on a ray-tracing dataset.
Revised:  We focus on switching between a lower (e.g. , 3.5 GHz) band and a millimeter wave band (e.g. 28 GHz), and design and evaluate two classification models that are trained on a ray-tracing dataset.
Edit intent: fluency
Original:  We focus on switching between a lower (e.g.  3.5 GHz) band and a millimeter wave band (e.g.  28 GHz), and design and evaluate two classification models that are trained on a ray-tracing dataset.
Revised:  We focus on switching between a lower (e.g. 3.5 GHz) band and a millimeter wave band (e.g. , 28 GHz), and design and evaluate two classification models that are trained on a ray-tracing dataset.
Edit intent: fluency
Original:  We propose a band switching approach based on machine learning that does not require any measurement gap.
Revised:  We propose a band switching approach that does not require any measurement gap.
Edit intent: clarity
Original:  Our proposed machine learning-based policies achieve roughly 30\% improvement in mean effective rates over those of the industry standard policy, while achieving misclassification errors well below 0.5\%  .
Revised:  Our proposed machine learning based policies achieve roughly 30\% improvement in mean effective rates over those of the industry standard policy, while achieving misclassification errors well below 0.5\% .
Edit intent: fluency
Original:  Although VANET connectivity has been intensively studied and investigated under channel models without fading for their simplicity, the connectivity probability provided by these studies does not mimic the real-world scenarios that suffer from channel impairments.
Revised:  Although VANET connectivity has been intensively studied and investigated under no-fading channel models for their simplicity, the connectivity probability provided by these studies does not mimic the real-world scenarios that suffer from channel impairments.
Edit intent: clarity
Original:  Although VANET connectivity has been intensively studied and investigated under channel models without fading for their simplicity, the connectivity probability provided by these studies does not mimic the real-world scenarios that suffer from channel impairments.
Revised:  Although VANET connectivity has been intensively studied and investigated under channel models without fading for their simplicity, these models do not represent real-world scenarios that suffer from channel impairments.
Edit intent: clarity
Original:  Although VANET connectivity has been intensively studied and investigated under channel models without fading for their simplicity, the connectivity probability provided by these studies does not mimic the real-world scenarios that suffer from channel impairments.
Revised:  Although VANET connectivity has been intensively studied and investigated under channel models without fading for their simplicity, the connectivity probability provided by these studies does not mimic the real-world scenarios that suffer channel impairments.
Edit intent: fluency
Original:  However, the connectivity probability was too challenging to be caught by a closed formula due to the emerging complexity associated with the randomness in a fading channel.
Revised:  The connectivity probability in a multipath propagation environment is too challenging to be caught by a closed formula due to the emerging complexity associated with the randomness in a fading channel.
Edit intent: clarity
Original:   In this paper, we precisely estimate the connectivity probability using a proposed graph-based algorithm .
Revised:  In this paper, we numerically estimate the connectivity probability using a proposed graph-based algorithm .
Edit intent: clarity
Original:   In this paper, we precisely estimate the connectivity probability using a proposed graph-based algorithm .
Revised:  In this paper, we precisely estimate the connectivity probability using graph-based algorithm .
Edit intent: clarity
Original:  The results prove that Rayleigh-fading channels reinforce the connectivity compared to no-fading models at the same level of transmitting power and vehicle densities.
Revised:  The results show that Rayleigh-fading channels reinforce the connectivity compared to no-fading models at the same level of transmitting power and vehicle densities.
Edit intent: coherence
Original:  An individual-based model allows us to investigate the front behaviour for one or a small number of regions in which dispersal or growth of individuals is reduced to zero (obstacles) or increased above the background (hotspots), respectively.
Revised:  We use an individual-based model allows us to investigate the front behaviour for one or a small number of regions in which dispersal or growth of individuals is reduced to zero (obstacles) or increased above the background (hotspots), respectively.
Edit intent: coherence
Original:  An individual-based model allows us to investigate the front behaviour for one or a small number of regions in which dispersal or growth of individuals is reduced to zero (obstacles) or increased above the background (hotspots), respectively.
Revised:  An individual-based model to investigate the front behaviour for one or a small number of regions in which dispersal or growth of individuals is reduced to zero (obstacles) or increased above the background (hotspots), respectively.
Edit intent: clarity
Original:  An individual-based model allows us to investigate the front behaviour for one or a small number of regions in which dispersal or growth of individuals is reduced to zero (obstacles) or increased above the background (hotspots), respectively.
Revised:  An individual-based model allows us to investigate the front dynamics for a region in which dispersal or growth of individuals is reduced to zero (obstacles) or increased above the background (hotspots), respectively.
Edit intent: clarity
Original:  In a regime in which front dynamics is determined by a local front speed , irrespective of the microscopic origin, we (i) describe the effect of multiple inhomogeneities in the light of an event-based solution, (ii) find a slow-down due to obstacles that is dominated by the number density and width of obstacles, but not by their precise shape , and (iii) characterize a speedupand its dependence on hotspot strength and density.
Revised:  In a regime where front dynamics is determined by a local front speed , irrespective of the microscopic origin, we (i) describe the effect of multiple inhomogeneities in the light of an event-based solution, (ii) find a slow-down due to obstacles that is dominated by the number density and width of obstacles, but not by their precise shape , and (iii) characterize a speedupand its dependence on hotspot strength and density.
Edit intent: fluency