wanyu/IteraTeR_v2 huggingface dataset:
Original: A Fog Radio Access Network (F-RAN) is a cellular wireless system that enables content delivery via edge caching , i.e., storage of popular content at the edge nodes (ENs) , and cloud processing.
Revised: A Fog Radio Access Network (F-RAN) is a cellular wireless system that enables content delivery via edge caching , i.e., storage of popular content at edge nodes (ENs) , and cloud processing.
Edit intent: fluency
Original: A Fog Radio Access Network (F-RAN) is a cellular wireless system that enables content delivery via edge caching , i.e., storage of popular content at the edge nodes (ENs) , and cloud processing.
Revised: A Fog Radio Access Network (F-RAN) is a cellular wireless system that enables content delivery via edge caching , i.e., storage of popular content at the edge nodes (ENs) and cloud processing.
Edit intent: fluency
Original:  The existing information-theoretic analyses of F-RAN systems, and special cases thereof, make the assumption that all files in the content library are equally relevant, and hence all users' requests should be guaranteed the same delivery latency (i.e., transmission time) .
Revised:  The existing information-theoretic analyses of F-RAN systems, and special cases thereof, make the assumption that all requests should be guaranteed the same delivery latency (i.e., transmission time) .
Edit intent: coherence
Original:  For the case with two ENs and two users, the latency region is characterized in the high-SNR regime in terms of the Normalized Delivery Time (NDT) metric , introduced in prior work .
Revised:  For the case with two ENs and two users, the optimal latency trade-off is characterized in the high-SNR regime in terms of the Normalized Delivery Time (NDT) metric , introduced in prior work .
Edit intent: clarity
Original: In this manuscript, we show how higher-order graphical models can be applied to study the controllability of networked systems with dynamic topologies.
Revised: The control of complex networks is a significant challenge, especially when the network topology of the system to be controlled is dynamic. Addressing this challenge, here we introduce a novel approach which allows exploring the controllability of networked systems with dynamic topologies.
Edit intent: coherence
Original:  Studying empirical data on temporal networks, we specifically show that the order correlations in the activation sequence of links can both increase or reduce the time needed to achieve full controllability.
Revised:  Studying empirical data on temporal networks, we specifically show that the order correlations in the sequence of interactions can both increase or reduce the time needed to achieve full controllability.
Edit intent: clarity
Original:  Studying empirical data on temporal networks, we specifically show that the order correlations in the activation sequence of links can both increase or reduce the time needed to achieve full controllability.
Revised:  Studying empirical data on temporal networks, we specifically show that the order correlations in the activation sequence of links can both increase or decrease the time needed to achieve full controllability.
Edit intent: clarity
Original:  We then demonstrate how spectral properties of higher-order graphical models can be used to analytically explain the effect of order correlations on controllability in temporal networks .
Revised:  We then demonstrate how spectral properties of higher-order network topologies can be used to analytically explain the effect of order correlations on controllability in temporal networks .
Edit intent: clarity
Original:  We then demonstrate how spectral properties of higher-order graphical models can be used to analytically explain the effect of order correlations on controllability in temporal networks .
Revised:  We then demonstrate how spectral properties of higher-order graphical models can be used to analytically explain this phenomenon .
Edit intent: clarity
Original:  Building on the higher-order graphical modeling framework introduced in recent works, we further demonstrate that spectral properties of higher-order network topologies can be used to analytically explain this phenomenon .
Revised:  Building on the higher-order network models are a powerful tool to understand the temporal-topological characteristics of empirical systems .
Edit intent: clarity
Original:  Many useful closure properties and plenty of applications make weighted counting problems interesting.
Revised:  Useful closure properties and plenty of applications make weighted counting problems interesting.
Edit intent: coherence
Original:  Using the weighted counting terminology and our results, we are able to greatly simplify and answer some open questions in those fields.
Revised:  Using the weighted counting terminology and our results, we are able to simplify and answer some open questions in those fields.
Edit intent: clarity
Original: High-performance computing systems are moving toward 2.5D as in High Bandwidth Memory (HBM) and 3D integration of memory and logic as in Hybrid Memory Cube (HMC) to mitigate the main memory bottlenecks.
Revised: High-performance computing systems are moving toward 2.5D as in High Bandwidth Memory (HBM) and Hybrid Memory Cube (HMC) to mitigate the main memory bottlenecks.
Edit intent: clarity
Original:  Our codesign approach consists of a network of Smart Memory Cubes (modular extensions to the standard HMC) each augmented with a many-core PIM platform called NeuroCluster.
Revised:  Our co-design approach consists of a network of Smart Memory Cubes (modular extensions to the standard HMC) each augmented with a many-core PIM platform called NeuroCluster.
Edit intent: fluency
Original:  Our codesign approach consists of a network of Smart Memory Cubes (modular extensions to the standard HMC) each augmented with a many-core PIM platform called NeuroCluster.
Revised:  Our codesign approach consists of a network of Smart Memory Cubes (modular extensions to the standard HMC) each augmented with a manycore PIM platform called NeuroCluster.
Edit intent: fluency
Original:  NeuroClusters have a modular design based on NeuroStream floating-point (FP) co-processors (for Convolution-intensive computations) and general-purpose RISC-V cores.
Revised:  NeuroClusters have a modular design based on NeuroStream co-processors (for Convolution-intensive computations) and general-purpose RISC-V cores.
Edit intent: clarity
Original:  In addition, a DRAM-friendly tiling mechanism and a scalable programming paradigm are presented to efficiently harness this computational capability with a very low programming effort.
Revised:  In addition, a DRAM-friendly tiling mechanism and a scalable computation paradigm are presented to efficiently harness this computational capability with a very low programming effort.
Edit intent: fluency
Original:  The minor increase in system-level power and the negligible area increase make our PIM system a cost effective and energy efficient solution, easily scalable to 955 GFLOPS with a network of four SMCs.
Revised:  The minor increase in system-level power and the negligible area increase make our PIM system a cost-effective and energy efficient solution, easily scalable to 955 GFLOPS with a network of four SMCs.
Edit intent: fluency
Original:  The minor increase in system-level power and the negligible area increase make our PIM system a cost effective and energy efficient solution, easily scalable to 955 GFLOPS with a network of four SMCs.
Revised:  The minor increase in system-level power and the negligible area increase make our PIM system a cost effective and energy efficient solution, easily scalable to 955 GFLOPS with a small network of just four SMCs.
Edit intent: clarity
Original: High-performance computing systems are moving toward 2.5D  memory hierarchies, based on High-bandwidth memory (HBM) and Hybrid Memory Cube (HMC) to mitigate the main memory bottlenecks.
Revised: High-performance computing systems are moving towards 2.5D memory hierarchies, based on High-bandwidth memory (HBM) and Hybrid Memory Cube (HMC) to mitigate the main memory bottlenecks.
Edit intent: fluency
Original: High-performance computing systems are moving toward 2.5D  memory hierarchies, based on High-bandwidth memory (HBM) and Hybrid Memory Cube (HMC) to mitigate the main memory bottlenecks.
Revised: High-performance computing systems are moving toward 2.5D memory hierarchies, based on High Bandwidth Memory (HBM) and Hybrid Memory Cube (HMC) to mitigate the main memory bottlenecks.
Edit intent: fluency
Original:  Our co-design approach consists of a network of Smart Memory Cubes (modular extensions to the standard HMC) each augmented with a manycore PIM platform called NeuroCluster.
Revised:  Our codesign approach consists of a network of Smart Memory Cubes (modular extensions to the standard HMC) each augmented with a manycore PIM platform called NeuroCluster.
Edit intent: clarity
Original:  Our co-design approach consists of a network of Smart Memory Cubes (modular extensions to the standard HMC) each augmented with a manycore PIM platform called NeuroCluster.
Revised:  Our co-design approach consists of a network of Smart Memory Cubes (modular extensions to the standard HMC) each augmented with a many-core PIM platform called NeuroCluster.
Edit intent: fluency
Original:  NeuroClusters have a modular design based on NeuroStream co-processors (for Convolution-intensive computations) and general-purpose RISCV cores.
Revised:  NeuroClusters have a modular design based on NeuroStream coprocessors (for Convolution-intensive computations) and general-purpose RISCV cores.
Edit intent: fluency
Original:  The proposed damage identification strategy relies on the solution of an optimisation problem, by means of a genetic algorithm, which exploits the closed form solution based on the distribution theory of multi-cracked beamssubjected to static loads.
Revised:  The proposed identification procedure makes use of energy measurements and is based on the application of a closed form solution based on the distribution theory of multi-cracked beamssubjected to static loads.
Edit intent: clarity
Original: High order cumulants carry information about statistics of non--normally distributed multivariate data.
Revised: High order cumulant tensors carry information about statistics of non--normally distributed multivariate data.
Edit intent: clarity
Original: High order cumulants carry information about statistics of non--normally distributed multivariate data.
Revised: High order cumulants carry information about statistics of non-normally distributed multivariate data.
Edit intent: fluency
Original:  Such cumulants are utilised in extreme events analysis, small target detection or outliers detection.
Edit intent: coherence
Original:   To present an application of the algorithm, we propose a measure of non-normality of data stream based on tensor norms of high order cumulant tensors.
Revised:  To present an application of this algorithm, we propose a measure of non-normality of data stream based on tensor norms of high order cumulant tensors.
Edit intent: clarity
Original:   To present an application of the algorithm, we propose a measure of non-normality of data stream based on tensor norms of high order cumulant tensors.
Revised:  To present an application of the algorithm, we propose a measure of non-normality of data stream based on the norms of high-order cumulant tensors.
Edit intent: clarity
Original:  We study how these properties affect random walks processes unfolding on the network when the time scales describing the process and the network evolution are comparable.
Revised:  We study how these properties affect random walk processes unfolding on the network when the time scales describing the process and the network evolution are comparable.
Edit intent: fluency
Original: Proof by coupling is a powerful technique for proving probabilistic properties of two probabilistic processes, like stochastic dominance and rapid mixing of Markov chains.
Revised: Proof by coupling is a classical proof technique for establishing probabilistic properties of two probabilistic processes, like stochastic dominance and rapid mixing of Markov chains.
Edit intent: clarity
Original:  Couplings have also proved to be a useful abstraction for formal reasoning about relational properties of probabilistic programs, in particular for modeling reduction-based cryptographic proofs and for verifying differential privacy.
Revised:  More recently, couplings have been investigated as a useful abstraction for formal reasoning about relational properties of probabilistic programs, in particular for modeling reduction-based cryptographic proofs and for verifying differential privacy.
Edit intent: clarity
Original:  In this paper, we demonstrate that probabilistic couplings can be also used for verifying non-relational probabilistic properties.
Revised:  In this paper, we demonstrate that probabilistic couplings can be used for verifying non-relational probabilistic properties.
Edit intent: clarity
Original:  Specifically, we show that the program logic pRHL---whose proofs correspond to proofs by coupling---can be used for proving uniformity and probabilistic independence.
Revised:  Specifically, we show that the program logic pRHL---whose proofs correspond to proofs by coupling---can be used for formalizing uniformity and probabilistic independence.
Edit intent: clarity
Original: The  rapid development of wireless network shows a trend of increasing complexity of structure and multi-dimensional network resources.
Revised: The energy efficiency of future networks is becoming a significant and urgent issue, calling for greener network designs. At the same time, rapid development of wireless network shows a trend of increasing complexity of structure and multi-dimensional network resources.
Edit intent: coherence
Original: The  rapid development of wireless network shows a trend of increasing complexity of structure and multi-dimensional network resources.
Revised: The rapid development of wireless networks shows a trend of increasing complexity of structure and multi-dimensional network resources.
Edit intent: fluency
Original:   In this paper, we develop a joint optimization of scheduling and power control with multi-dimensional modeling.
Revised:  However, the coupled resource dimensions and growing problem scales bring great challenges in obtaining the optimal solutions. In this paper, we develop a joint optimization of scheduling and power control with multi-dimensional modeling.
Edit intent: coherence
Original:   In this paper, we develop a joint optimization of scheduling and power control with multi-dimensional modeling.
Revised:  In this paper, we develop a multi-dimensional modeling.
Edit intent: clarity
Original:  With this framework, transmission scheduling , routing, power control, radio and channel assignment will be jointly optimized to minimize energy consumption while guaranteeing flow demands of multiple commodities .
Revised:  With this framework, transmission scheduling , routing, power control, radio and channel assignment .
Edit intent: clarity
Original:  In order to tackle the complexity issues raised from coupled resource dimensions and obtain a joint solution , we propose a novel decomposed approach.
Revised:  In order to tackle the complexity issues raised from coupled resource dimensions , we propose a novel decomposed approach.
Edit intent: coherence
Original: This paper describes a Research Prototype, WebSelect, designed to assist online media planners is deciding which websites to target for a media campaign.
Revised: This paper describes a Research Prototype, WebSelect, designed to assist online media planners in deciding which websites to target for a media campaign.
Edit intent: fluency
Original: During last ten years, the number of smartphones and mobile applications have been constantly growing.
Revised: During last ten years, the number of smartphones and mobile applications has been constantly growing.
Edit intent: fluency
Original:  Android, iOS and Windows Mobile , are three mobile platforms that cover almost all smartphones in the world in 2017.
Revised:  Android, iOS and Windows Mobile are three mobile platforms that cover almost all smartphones in the world in 2017.
Edit intent: fluency
Original:  Developing a mobile app involves first to choose the platforms the app will run, and then to develop specific solutions (i.e., native apps) for each chosen platform using platform-related toolkits such as Android SDK. A cross-platform mobile application is an app that runs on two or more mobile platforms.
Revised:  Developing a mobile app involves first to choose the platforms the app will run, and then to develop specific solutions (i.e., native apps) for each chosen platform using platform-related toolkits such as AndroidSDK. Across-platform mobile application is an app that runs on two or more mobile platforms.
Edit intent: coherence
Original:  Several frameworks has been proposed to simplify the development of cross-platform mobile applications with the goal for reducing development and maintenance costs.
Revised:  Several frameworks have been proposed to simplify the development of cross-platform mobile applications with the goal for reducing development and maintenance costs.
Edit intent: fluency
Original:  Several frameworks has been proposed to simplify the development of cross-platform mobile applications with the goal for reducing development and maintenance costs.
Revised:  Several frameworks has been proposed to simplify the development of cross-platform mobile applications and to reduce development and maintenance costs.
Edit intent: clarity
Original:  Our main goal is to first empirical study the process of development and maintenance of mobile applications built using cross-platform mobile app development frameworks, focusing particularly on the bug-fixing activity.
Revised:  Our main goal is to first study the processes of development and maintenance of mobile applications built using cross-platform mobile app development frameworks, focusing particularly on the bug-fixing activity.
Edit intent: clarity
Original:   We show that if we allow more general initial conditions that previously considered, the two factions give rise to twoadditional factions.
Revised:  We show that for general initial conditions that previously considered, the two factions give rise to twoadditional factions.
Edit intent: clarity
Original: We present a stable test for determining if a substochastic matrix is convergent.
Revised: We present a test for determining if a substochastic matrix is convergent.
Edit intent: clarity
Original:  Depending only on the structure of the matrix, the test is unconditionally stable.
Edit intent: coherence
Original:  Our approach is based on tapping on the RTB protocol to collect cleartext and encrypted prices for winning bids .
Revised:  Our approach is based on tapping on the Real Time Bidding (RTB) protocol to collect cleartext and encrypted prices for winning bids .
Edit intent: clarity
Original: Online advertising is progressively moving towards a programmatic model in which ads are matched to actual interests of individuals collected as they navigate the web.
Revised: Online advertising is progressively moving towards a programmatic model in which ads are matched to actual interests of individuals collected as they browse the web.
Edit intent: clarity
Original:  Letting the huge debate around privacy aside, a very important question in this area, for which very little is known, is: How much do advertisers pay for an individual's personal data ?
Revised:  Letting the huge debate around privacy aside, a very important question in this area, for which little is known, is: How much do advertisers pay for an individual's personal data ?
Edit intent: fluency
Original:  Letting the huge debate around privacy aside, a very important question in this area, for which very little is known, is: How much do advertisers pay for an individual's personal data ?
Revised:  Letting the huge debate around privacy aside, a very important question in this area, for which very little is known, is: How much do advertisers pay to reach an individual ?
Edit intent: clarity
Original:  In this study, we develop a first of its kind methodology for computing exactly that - the price paid for one's privacy - and we do that in real time.
Revised:  In this study, we develop a first of its kind methodology for computing exactly that -- the price paid for one's privacy - and we do that in real time.
Edit intent: fluency
Original:  We implement our methodology through a browser addon and a back-end server that provides it with fresh models for encrypted bids.
Revised:  We design our methodology through a browser addon and a back-end server that provides it with fresh models for encrypted bids.
Edit intent: clarity
Original:  We implement our methodology through a browser addon and a back-end server that provides it with fresh models for encrypted bids.
Revised:  We implement our methodology through a browser extension and a back-end server that provides it with fresh models for encrypted bids.
Edit intent: fluency
Original: Critical infrastructures like power and communication networks are highly interconnected.
Revised: The power and communication networks are highly interconnected.
Edit intent: clarity
Original:  Some limitations of the existing models were addressed by the Implicative Interdependency Model  which uses Boolean Logic to represent these interdependencies.
Revised:  Some limitations of the aforementioned models have been overcome by the Implicative Interdependency Model which uses Boolean Logic to represent these interdependencies.
Edit intent: clarity
Original:  Some limitations of the existing models were addressed by the Implicative Interdependency Model  which uses Boolean Logic to represent these interdependencies.
Revised:  Some limitations of the existing models were addressed by the Implicative Interdependency Model , which uses Boolean Logic to represent these interdependencies.
Edit intent: fluency
Original:  An Integer Linear program is provided to obtain the optimal solution.
Revised:  An Integer Linear Program (ILP) has been devised to find the optimal solution.
Edit intent: clarity
Original:  A heuristic is proposed whose efficacy is judged by comparing it with the optimal solution using real world data.
Revised:  A heuristic has been described whose accuracy is found by comparing its performance with the optimal solution using real world data.
Edit intent: clarity
Original:  Our theory allows , without additional effort, the investigation of systems that do not exhibit a pointwise convergence to the mean-field limit.
Revised:  Our theory allows , without additional effort, the investigation of systems for which a deterministic mean-field limit.
Edit intent: clarity
Original:  In particular , we uncover a novel dynamic state in which a system with inhomogeneous micro-structures in the network connectivity , along with an asynchronous behavior, also exhibits stochastic synchronization.
Revised:  In particular , we uncover a novel dynamic state in which a recurrent network of binary units with statistically inhomogeneous interactions , along with an asynchronous behavior, also exhibits stochastic synchronization.
Edit intent: clarity
Original:  As using this information for importance sampling includes information about visibility, too, the number of light transport paths with non-zero contribution is dramatically increased , resulting in much less noisy images within a fixed time budget.
Revised:  As using this information for importance sampling includes information about visibility, too, the number of light transport paths with zero contribution is dramatically increased , resulting in much less noisy images within a fixed time budget.
Edit intent: clarity