wanyu/IteraTeR_v2 huggingface dataset:
Original:  Multiple system flows and associated storages transmitted  from one compartment directly or indirectly to any other or along a given flow path are then analytically characterized, systematically classified, and mathematically formulated.
Revised:  Multiple system flows and associated storages transmitted from one compartment directly or indirectly to any other are then analytically characterized, systematically classified, and mathematically formulated.
Edit intent: clarity
Original:  This theory is based on the novel mutually exclusive and exhaustive  system and subsystem decomposition methodologies.
Revised:  This theory is based on the mutually exclusive and exhaustive system and subsystem decomposition methodologies.
Edit intent: clarity
Original:  The dynamic method enables tracking the evolution of all initial stocks, external inputs, and arbitrary intercompartmental flows  as well as the associated storages derived from these stocks, inputs, and flows individually and separately within the system.
Revised:  The dynamic method enables tracking the evolution of all initial stocks, external inputs, and arbitrary intercompartmental flows , as well as the associated storages derived from these stocks, inputs, and flows individually and separately within the system.
Edit intent: fluency
Original:  The transient and the dynamic direct, indirect, acyclic, cycling, and transfer (diact) flows and associated storages transmitted along a given flow path or from one compartment--directly or indirectly--to any other are then analytically characterized, systematically classified, and mathematically formulated.
Revised:  The transient and the dynamic direct, indirect, acyclic, cycling, and transfer (diact) flows and associated storages transmitted along a particular flow path or from one compartment--directly or indirectly--to any other are then analytically characterized, systematically classified, and mathematically formulated.
Edit intent: clarity
Original: In this work we explore the power of the hybrid model of differential privacy (DP) proposed by Avent et al., where some users desire the guarantees of the local model of DP and others are content with receiving the trusted curator model guarantees.
Revised: We explore the power of the hybrid model of differential privacy (DP) proposed by Avent et al., where some users desire the guarantees of the local model of DP and others are content with receiving the trusted curator model guarantees.
Edit intent: clarity
Original: In this work we explore the power of the hybrid model of differential privacy (DP) proposed by Avent et al., where some users desire the guarantees of the local model of DP and others are content with receiving the trusted curator model guarantees.
Revised: In this work we explore the power of the hybrid model of differential privacy (DP) , in which some users desire the guarantees of the local model of DP and others are content with receiving the trusted curator model guarantees.
Edit intent: clarity
Original: In this work we explore the power of the hybrid model of differential privacy (DP) proposed by Avent et al., where some users desire the guarantees of the local model of DP and others are content with receiving the trusted curator model guarantees.
Revised: In this work we explore the power of the hybrid model of differential privacy (DP) proposed by Avent et al., where some users desire the guarantees of the local model of DP and others are content with receiving the trusted-curator model guarantees.
Edit intent: fluency
Original:  In particular, we study the accuracy of mean estimation algorithms for arbitrary distributions in bounded support.
Revised:  In particular, we study the utility of hybrid model estimators that compute the mean of arbitrary real-valued distributions with bounded support.
Edit intent: clarity
Original:  Second, there has been increasing interest in developing application-specific platforms for CNNs that provide improved inference performance and energy consumption as compared to GPUs.
Revised:  Second, there has been increasing interest in developing application-specific platforms for CNNs that provide improved inference performance and energy consumption compared to GPUs.
Edit intent: coherence
Original:  Embedded deep learning platforms differ in the amount of compute resources and memory-access bandwidth, which would affect performance and energy consumption of CNNs.
Revised:  Such embedded deep learning platforms differ in the amount of compute resources and memory-access bandwidth, which would affect performance and energy consumption of CNNs.
Edit intent: clarity
Original:  Given a graph  with a partition of its vertex set into clusters, the aim of the selective graph coloring problem is to pick exactly one vertex per cluster so that , among all possible selections, the number of colors necessary to color the vertices in the selection is minimized.
Revised:  Given a graph with a partition of its vertex set into clusters, we want to choose exactly one vertex per cluster so that , among all possible selections, the number of colors necessary to color the vertices in the selection is minimized.
Edit intent: clarity
Original:  Given a graph  with a partition of its vertex set into clusters, the aim of the selective graph coloring problem is to pick exactly one vertex per cluster so that , among all possible selections, the number of colors necessary to color the vertices in the selection is minimized.
Revised:  Given a graph with a partition of its vertex set into clusters, the aim of the selective graph coloring problem is to pick exactly one vertex per cluster so that the number of colors necessary to color the vertices in the selection is minimized.
Edit intent: clarity
Original:  Given a graph  with a partition of its vertex set into clusters, the aim of the selective graph coloring problem is to pick exactly one vertex per cluster so that , among all possible selections, the number of colors necessary to color the vertices in the selection is minimized.
Revised:  Given a graph with a partition of its vertex set into clusters, the aim of the selective graph coloring problem is to pick exactly one vertex per cluster so that , among all possible selections, the number of colors needed to color the vertices in the selection is minimized.
Edit intent: fluency
Original:  Given a graph  with a partition of its vertex set into clusters, the aim of the selective graph coloring problem is to pick exactly one vertex per cluster so that , among all possible selections, the number of colors necessary to color the vertices in the selection is minimized.
Revised:  Given a graph with a partition of its vertex set into clusters, the aim of the selective graph coloring problem is to pick exactly one vertex per cluster so that , among all possible selections, the number of colors necessary to color the selected set of vertices is minimized.
Edit intent: clarity
Original:  This study focuses on an exact cutting plane algorithm for selective  coloring in perfect graphs , where the selective coloring problem is known to be NP-hard . Since there exists no suite of perfect graph instances to the best of our knowledge, we also propose an algorithm to randomly  generate perfect graphs  and provide a large collection of instances available online.
Revised:  This problem is known to be NP-hard. In this study, we focus on an exact cutting plane algorithm for selective coloring in perfect graphs , where the selective coloring problem is known to be NP-hard . Since there exists no suite of perfect graph instances to the best of our knowledge, we also propose an algorithm to randomly generate perfect graphs and provide a large collection of instances available online.
Edit intent: coherence
Original:  This study focuses on an exact cutting plane algorithm for selective  coloring in perfect graphs , where the selective coloring problem is known to be NP-hard . Since there exists no suite of perfect graph instances to the best of our knowledge, we also propose an algorithm to randomly  generate perfect graphs  and provide a large collection of instances available online.
Revised:  This study focuses on an exact cutting plane algorithm for selective graph coloring in perfect graphs , where the selective coloring problem is known to be NP-hard . Since there exists no suite of perfect graph instances to the best of our knowledge, we also propose an algorithm to randomly generate perfect graphs and provide a large collection of instances available online.
Edit intent: fluency
Original:  This study focuses on an exact cutting plane algorithm for selective  coloring in perfect graphs , where the selective coloring problem is known to be NP-hard . Since there exists no suite of perfect graph instances to the best of our knowledge, we also propose an algorithm to randomly  generate perfect graphs  and provide a large collection of instances available online.
Revised:  This study focuses on an exact cutting plane algorithm for selective coloring in perfect graphs . Since there exists no suite of perfect graph instances to the best of our knowledge, we also propose an algorithm to randomly generate perfect graphs and provide a large collection of instances available online.
Edit intent: coherence
Original:  This study focuses on an exact cutting plane algorithm for selective  coloring in perfect graphs , where the selective coloring problem is known to be NP-hard . Since there exists no suite of perfect graph instances to the best of our knowledge, we also propose an algorithm to randomly  generate perfect graphs  and provide a large collection of instances available online.
Revised:  This study focuses on an exact cutting plane algorithm for selective coloring in perfect graphs , where the selective coloring problem is known to be NP-hard . Since there exists no suite of perfect graph instances to the best of our knowledge, we also propose an algorithm to randomly generate perfect graphs , and provide a large collection of instances available online.
Edit intent: fluency
Original:  We  test our method on graphs with different size and densities, present computational results and compare them with an integer programming formulation of the problem solved by CPLEX, and a state-of-the art algorithm from the literature.
Revised:  We conduct computational experiments to test our method on graphs with different size and densities, present computational results and compare them with an integer programming formulation of the problem solved by CPLEX, and a state-of-the art algorithm from the literature.
Edit intent: clarity
Original:  We  test our method on graphs with different size and densities, present computational results and compare them with an integer programming formulation of the problem solved by CPLEX, and a state-of-the art algorithm from the literature.
Revised:  We test our method on graphs with varying size and densities, present computational results and compare them with an integer programming formulation of the problem solved by CPLEX, and a state-of-the art algorithm from the literature.
Edit intent: fluency
Original:  We  test our method on graphs with different size and densities, present computational results and compare them with an integer programming formulation of the problem solved by CPLEX, and a state-of-the art algorithm from the literature.
Revised:  We test our method on graphs with different size and densities, and compare our results with a state-of-the-art algorithm from the literature and with solving an integer programming formulation of the problem solved by CPLEX, and a state-of-the art algorithm from the literature.
Edit intent: clarity
Original:  Our computational experiments indicate that our approach significantly improves the solution performance .
Revised:  Our computational experiments indicate that our approach significantly improves the solvability of the problem .
Edit intent: clarity
Original:  In cases where multiple types of connectivity patterns exist for the  set of nodes, commonly modeled as multilayer graphs, new strategies are required to model the inter-layer dependencies in order to perform effective inferencing .
Revised:  In cases where multiple types of relationships exist for the set of nodes, commonly modeled as multilayer graphs, new strategies are required to model the inter-layer dependencies in order to perform effective inferencing .
Edit intent: clarity
Original:  In cases where multiple types of connectivity patterns exist for the  set of nodes, commonly modeled as multilayer graphs, new strategies are required to model the inter-layer dependencies in order to perform effective inferencing .
Revised:  In cases where multiple types of connectivity patterns exist for the same set of nodes, commonly modeled as multilayer graphs, new strategies are required to model the inter-layer dependencies in order to perform effective inferencing .
Edit intent: clarity
Original:  In cases where multiple types of connectivity patterns exist for the  set of nodes, commonly modeled as multilayer graphs, new strategies are required to model the inter-layer dependencies in order to perform effective inferencing .
Revised:  In cases where multiple types of connectivity patterns exist for the set of nodes, it is crucial to exploit the information shared between layers, in addition to the distinct aspects of each layer .
Edit intent: clarity
Original:  Here, we construct a vast heterogeneous information network that covers the necessary information surrounding each firm, which is assembled using seven professionally curated datasets and two open datasets, resulting in about 50 million nodes and 400 million edges in total.
Revised:  Here, we construct a vast heterogeneous information network that covers the necessary information surrounding each firm, which is assembled using seven professionally curated datasets and two open datasets, which results in approximately 50 million nodes and 400 million edges in total.
Edit intent: coherence
Original:  Exploiting this  heterogeneous information network, we propose a model that can learn from past adverse media coverage patterns and predict the occurrence of futureadverse media coverage events on the whole universe of firms .
Revised:  Exploiting this vast heterogeneous information network, we propose a model that can learn from past adverse media coverage patterns and predict the occurrence of futureadverse media coverage events on the whole universe of firms .
Edit intent: clarity
Original:  Our approach is tested using the adverse media coverage data of more than 35,000 firms worldwide from January 2012 to May 2018.
Revised:  Our approach is tested using the negative news blacklist data of more than 35,000 firms worldwide from January 2012 to May 2018.
Edit intent: clarity
Original:  Comparing with  state-of-the-art methods with and without the network, we show that the predictive accuracy is substantially improved when using the heterogeneous information network.
Revised:  Comparing with the state-of-the-art methods with and without the network, we show that the predictive accuracy is substantially improved when using the heterogeneous information network.
Edit intent: fluency
Original:  This work suggests new ways to consolidate the diffuse information contained in big data in order to monitor dominant institutions on a global scale for  more socially responsible investment, better risk management, and the surveillance of powerful institutions .
Revised:  This work suggests new ways to consolidate the diffuse information contained in big data to monitor dominant institutions on a global scale for more socially responsible investment, better risk management, and the surveillance of powerful institutions .
Edit intent: coherence
Original:  This work suggests new ways to consolidate the diffuse information contained in big data in order to monitor dominant institutions on a global scale for  more socially responsible investment, better risk management, and the surveillance of powerful institutions .
Revised:  This work suggests new ways to consolidate the diffuse information contained in big data in order to monitor dominant institutions on a global scale for better risk management, more socially responsible investment, better risk management, and the surveillance of powerful institutions .
Edit intent: fluency
Original:  This work suggests new ways to consolidate the diffuse information contained in big data in order to monitor dominant institutions on a global scale for  more socially responsible investment, better risk management, and the surveillance of powerful institutions .
Revised:  This work suggests new ways to consolidate the diffuse information contained in big data in order to monitor dominant institutions on a global scale for more socially responsible investment, and the surveillance of powerful institutions .
Edit intent: clarity
Original:  This work suggests new ways to consolidate the diffuse information contained in big data in order to monitor dominant institutions on a global scale for  more socially responsible investment, better risk management, and the surveillance of powerful institutions .
Revised:  This work suggests new ways to consolidate the diffuse information contained in big data in order to monitor dominant institutions on a global scale for more socially responsible investment, better risk management, and the surveillance of dominant firms .
Edit intent: clarity
Original: Blacklists are widely used in society to avoid interactions with inappropriate entities.
Revised: Negative screening is one method to avoid interactions with inappropriate entities.
Edit intent: clarity
Original:  They create their blacklists by gathering information from various news sources to keep their portfolios profitable as well as green.
Revised:  They create their investment exclusion lists by gathering information from various news sources to keep their portfolios profitable as well as green.
Edit intent: clarity
Original:   In the present paper, we focus on the prediction of blacklists in the finance domain.
Revised:  In the present paper, we focus on the prediction of investment exclusion lists in the finance domain.
Edit intent: clarity
Original:  Comparing with the state-of-the-art methods with and without  the network, we show that the predictive accuracy is substantially improved when using the  heterogeneous information network.
Revised:  Comparing with the state-of-the-art methods with and without using the network, we show that the predictive accuracy is substantially improved when using the heterogeneous information network.
Edit intent: fluency
Original:  Comparing with the state-of-the-art methods with and without  the network, we show that the predictive accuracy is substantially improved when using the  heterogeneous information network.
Revised:  Comparing with the state-of-the-art methods with and without the network, we show that the predictive accuracy is substantially improved when using the vast information stored in the heterogeneous information network.
Edit intent: clarity
Original:  This work suggests new ways to consolidate the diffuse information contained in big data to monitor dominant firms on a global scale for better risk management , more socially responsible investment , and the surveillance of dominant firms .
Revised:  This work suggests new ways to consolidate the diffuse information contained in big data to monitor dominant firms on a global scale for better risk management and more socially responsible investment , and the surveillance of dominant firms .
Edit intent: clarity
Original:  This work suggests new ways to consolidate the diffuse information contained in big data to monitor dominant firms on a global scale for better risk management , more socially responsible investment , and the surveillance of dominant firms .
Revised:  This work suggests new ways to consolidate the diffuse information contained in big data to monitor dominant firms on a global scale for better risk management , more socially responsible investment .
Edit intent: coherence
Original:  However, with the next generation of fast RDMA-enabled networks, this assumption is no longer valid.
Revised:  However, with the new generation of fast RDMA-enabled networks, this assumption is no longer valid.
Edit intent: coherence
Original:  We then present Chiller, a new approach to data partitioning and transaction execution, which minimizes data contention for both local and distributed transactions.
Revised:  We then present Chiller, a new approach to data partitioning and transaction execution, which aims to minimize data contention for both local and distributed transactions.
Edit intent: clarity
Original:  Finally, we evaluate Chiller using TPC-C and a real-world workload , and show that our partitioning and execution strategy outperforms traditional partitioning techniques which try to avoid distributed transactions, by up to a factor of 2 under the same conditions.
Revised:  Finally, we evaluate Chiller using various workloads , and show that our partitioning and execution strategy outperforms traditional partitioning techniques which try to avoid distributed transactions, by up to a factor of 2 under the same conditions.
Edit intent: clarity
Original:  Finally, we evaluate Chiller using TPC-C and a real-world workload , and show that our partitioning and execution strategy outperforms traditional partitioning techniques which try to avoid distributed transactions, by up to a factor of 2 under the same conditions.
Revised:  Finally, we evaluate Chiller using TPC-C and a real-world workload , and show that our partitioning and execution strategy outperforms traditional partitioning techniques which try to avoid distributed transactions, by up to a factor of 2.
Edit intent: clarity
Original:  Some recent studies hint to a more important role of image textures.
Revised:  Some recent studies suggest a more important role of image textures.
Edit intent: clarity
Original: The normative interplay between circadian and reward function is well understood in animal models, and is of growing interest as an aetiological explanation in psychopathologies.
Revised: The interplay between circadian and reward function is well understood in animal models, and is of growing interest as an aetiological explanation in psychopathologies.
Edit intent: clarity
Original:  While circadian modulation of reward function has been demonstrated in human behavioural data, a key gap is lack information at the neural level  .
Revised:  Circadian modulation of reward function has been demonstrated in human behavioural data, a key gap is lack information at the neural level .
Edit intent: clarity
Original:  While circadian modulation of reward function has been demonstrated in human behavioural data, a key gap is lack information at the neural level  .
Revised:  While circadian modulation of reward function has been demonstrated in human behavioural data, but understanding at the neural level .
Edit intent: clarity
Original:  In 2017, we published results of a first step in addressing this lacuna , demonstrating a diurnal rhythm in fMRI-measured reward activation.
Revised:  In 2017, our group published results of a first step in addressing this lacuna , demonstrating a diurnal rhythm in fMRI-measured reward activation.
Edit intent: clarity
Original:  In 2017, we published results of a first step in addressing this lacuna , demonstrating a diurnal rhythm in fMRI-measured reward activation.
Revised:  In 2017, we published results of a first step in addressing this deficit , demonstrating a diurnal rhythm in fMRI-measured reward activation.
Edit intent: clarity