wanyu/IteraTeR_v2 huggingface dataset:
Original:  Hence, this extension allows the decision makers to determine the inconsistency for sets of paired comparisons the result of which may also be "equal."
Revised:  Hence, this extension allows the decision makers to determine the inconsistency for sets of paired comparisons , where the result may also be "equal."
Edit intent: clarity
Original:  The article contains  definition and analysis of the most inconsistent set of pairwise comparisons with and without ties.
Revised:  The article contains a definition and analysis of the most inconsistent set of pairwise comparisons with and without ties.
Edit intent: fluency
Original: In this letter, we consider a simple scenario of a wireless caching system that consists of a caching helper in proximity to the user to be served and a data center with large content storage .
Revised: In this letter, we consider a simple scenario of a wireless caching system that consists of a caching helper with a dedicated user in proximity and another non-dedicated user whose requests shall be served either by the caching helper or by a data center with large content storage .
Edit intent: clarity
Original: In this letter, we consider a simple scenario of a wireless caching system that consists of a caching helper in proximity to the user to be served and a data center with large content storage .
Revised: In this letter, we consider a simple scenario of a wireless caching system that consists of a caching helper in proximity to the user to be served and a data center .
Edit intent: clarity
Original:  Assuming bursty packet arrivals at the caching helper  , its availability  is affected by the packet arrival rate, which also affects the system throughput  .
Revised:  Assuming bursty request arrivals at the caching helper , its availability is affected by the packet arrival rate, which also affects the system throughput .
Edit intent: clarity
Original:  Assuming bursty packet arrivals at the caching helper  , its availability  is affected by the packet arrival rate, which also affects the system throughput  .
Revised:  Assuming bursty packet arrivals at the caching helper , its availability is affected by the packet arrival rate, which will further affect the system throughput .
Edit intent: clarity
Original:  More explicitly, we consider a simple yet general system consisting of a caching helper with a dedicated user in proximity and another non-dedicated user whose requests shall be served either by the caching helper or by a  data center.
Revised:  More explicitly, we consider a general system consisting of a caching helper with a dedicated user in proximity and another non-dedicated user whose requests shall be served either by the caching helper or by a data center.
Edit intent: clarity
Original:  More explicitly, we consider a simple yet general system consisting of a caching helper with a dedicated user in proximity and another non-dedicated user whose requests shall be served either by the caching helper or by a  data center.
Revised:  More explicitly, we consider a simple yet general system consisting of a caching helper with its dedicated user in proximity and another non-dedicated user whose requests shall be served either by the caching helper or by a data center.
Edit intent: clarity
Original:  More explicitly, we consider a simple yet general system consisting of a caching helper with a dedicated user in proximity and another non-dedicated user whose requests shall be served either by the caching helper or by a  data center.
Revised:  More explicitly, we consider a simple yet general system consisting of a caching helper with a dedicated user in proximity and another non-dedicated user whose requests shall be served either by the caching helper or by a large data center.
Edit intent: clarity
Original: Many contemporary statistical learning methods assume a Euclidean feature space , however, the "curse of dimensionality" associated with high feature dimensions is particularly severe for the Euclidean distance .
Revised: Many contemporary statistical learning methods assume a Euclidean feature space .
Edit intent: coherence
Original:  Specifically, the idea of using heat diffusion on a hypersphere to measure similarity has been proposed and tested by \mbox{ Lafferty:2015uy , demonstrating promising results based on an approximate heat kernel , however, the exact hyperspherical heat kernel hitherto remains unknown.
Revised:  Specifically, the idea of using heat diffusion on a hypersphere to measure similarity has been previously proposed , demonstrating promising results based on an approximate heat kernel , however, the exact hyperspherical heat kernel hitherto remains unknown.
Edit intent: clarity
Original:  Specifically, the idea of using heat diffusion on a hypersphere to measure similarity has been proposed and tested by \mbox{ Lafferty:2015uy , demonstrating promising results based on an approximate heat kernel , however, the exact hyperspherical heat kernel hitherto remains unknown.
Revised:  Specifically, the idea of using heat diffusion on a hypersphere to measure similarity has been proposed and tested by \mbox{ Lafferty:2015uy , demonstrating promising results based on an approximate heat kernel , however, the exact hyperspherical heat kernel remains unknown.
Edit intent: clarity
Original: This paper proposes a method of real-time voltage stability assessment for load areas, in which the proximity to voltage collapse point at each bus can be accurately evaluated.
Revised: This paper proposes a method of real-time voltage stability assessment scheme to evaluate the proximity to voltage collapse point at each bus can be accurately evaluated.
Edit intent: clarity
Original: This paper proposes a method of real-time voltage stability assessment for load areas, in which the proximity to voltage collapse point at each bus can be accurately evaluated.
Revised: This paper proposes a method of real-time voltage stability assessment for load areas, in which the proximity to voltage collapse at each bus can be accurately evaluated.
Edit intent: clarity
Original:  Therefore, the voltage stability margin can be evaluated by plugging a value into the embedded complex variable of the power series .
Revised:  Therefore, the voltage stability margin considering load variations in the next period .
Edit intent: clarity
Original:  The proposed method is illustrated in detail on a 4-bus test system and then demonstrated on a load area of  Northeast Power Coordinating Council  48-geneartor, 140-bus power system.
Revised:  The proposed method is illustrated in detail on a 4-bus test system and then demonstrated on a load area of the Northeast Power Coordinating Council 48-geneartor, 140-bus power system.
Edit intent: fluency
Original:  The proposed method is illustrated in detail on a 4-bus test system and then demonstrated on a load area of  Northeast Power Coordinating Council  48-geneartor, 140-bus power system.
Revised:  The proposed method is illustrated in detail on a 4-bus test system and then demonstrated on a load area of Northeast Power Coordinating Council (NPCC) 48-geneartor, 140-bus power system.
Edit intent: clarity
Original:  In this review, we focus on the inverse Ising problem and closely related problems, namely how to infer the interactions between spins given observed spin correlations, magnetisations, or other data.
Revised:  In this review, we focus on the inverse Ising problem and closely related problems, namely how to infer the coupling strengths between spins given observed spin correlations, magnetisations, or other data.
Edit intent: clarity
Original:  We review applications of the inverse Ising problem, including the reconstruction of neural interactions , protein structure determination, and the inference of gene regulatory networks.
Revised:  We review applications of the inverse Ising problem, including the reconstruction of neural connections , protein structure determination, and the inference of gene regulatory networks.
Edit intent: fluency
Original: This paper presents a realization of the approach to spatial three Dimension stereo of visualization of three Dimension images with use parallel Graphics processing unit (GPU).
Revised: This paper presents a realization of the approach to spatial 3D stereo of visualization of three Dimension images with use parallel Graphics processing unit (GPU).
Edit intent: fluency
Original: This paper presents a realization of the approach to spatial three Dimension stereo of visualization of three Dimension images with use parallel Graphics processing unit (GPU).
Revised: This paper presents a realization of the approach to spatial three Dimension stereo of visualization of 3D images with use parallel Graphics processing unit (GPU).
Edit intent: fluency
Original:  The experiments of realization of synthesis of images of a 3D stage by a method of trace of beams on GPU with Compute Unified Device Architecture  have shown that 60 \% of the time is spent for the decision of a computing problem approximately, the major part of time (40 \%) is spent for transfer of data between the central processing unit and GPU for calculations and the organization process of visualization.
Revised:  The experiments of realization of synthesis of images of a 3D stage by a method of trace of beams on GPU with Compute Unified Device Architecture (CUDA) have shown that 60 \% of the time is spent for the decision of a computing problem approximately, the major part of time (40 \%) is spent for transfer of data between the central processing unit and GPU for calculations and the organization process of visualization.
Edit intent: clarity
Original:  The experiments of realization of synthesis of images of a 3D stage by a method of trace of beams on GPU with Compute Unified Device Architecture  have shown that 60 \% of the time is spent for the decision of a computing problem approximately, the major part of time (40 \%) is spent for transfer of data between the central processing unit and GPU for calculations and the organization process of visualization.
Revised:  The experiments of realization of synthesis of images of a 3D stage by a method of trace of beams on GPU with Compute Unified Device Architecture have shown that 60 \% of the time is spent for the decision of a computing problem approximately, the major part of time (40 \%) is spent for transfer of data between the central processing unit and GPU for computations and the organization process of visualization.
Edit intent: fluency
Original:  The study of the influence of increase in the size of the GPU network at the speed of calculations showed importance of the correct task of structure of formation of the parallel computer network and general mechanism of parallelization.
Revised:  The study of the influence of increase in the size of the GPU network at the speed of computations showed importance of the correct task of structure of formation of the parallel computer network and general mechanism of parallelization.
Edit intent: fluency
Original:  Keywords: Volumetric three Dimension visualization, stereo three Dimension visualization, Ray tracing, parallel computing on GPU, Compute Unified Device Architecture.
Revised:  Keywords: Volumetric 3D visualization, stereo three Dimension visualization, Ray tracing, parallel computing on GPU, Compute Unified Device Architecture.
Edit intent: fluency
Original:  Keywords: Volumetric three Dimension visualization, stereo three Dimension visualization, Ray tracing, parallel computing on GPU, Compute Unified Device Architecture.
Revised:  Keywords: Volumetric three Dimension visualization, stereo 3D visualization, ray tracing, parallel computing on GPU, Compute Unified Device Architecture.
Edit intent: fluency
Original:  Recently, the Partial Information Decomposition (PID) framework was proposed to decompose mutual information  about a target variable within a set of predictor variables into components which are redundant, unique and synergistic within different subsets of predictors.
Revised:  Recently, the Partial Information Decomposition (PID) was proposed to decompose mutual information about a target variable within a set of predictor variables into components which are redundant, unique and synergistic within different subsets of predictors.
Edit intent: clarity
Original:  Recently, the Partial Information Decomposition (PID) framework was proposed to decompose mutual information  about a target variable within a set of predictor variables into components which are redundant, unique and synergistic within different subsets of predictors.
Revised:  Recently, the Partial Information Decomposition (PID) framework was proposed to decompose mutual information (MI) about a target variable within a set of predictor variables into components which are redundant, unique and synergistic within different subsets of predictors.
Edit intent: clarity
Original:  Recently, the Partial Information Decomposition (PID) framework was proposed to decompose mutual information  about a target variable within a set of predictor variables into components which are redundant, unique and synergistic within different subsets of predictors.
Revised:  Recently, the Partial Information Decomposition (PID) framework was proposed to decompose mutual information about a target variable into components which are redundant, unique and synergistic within different subsets of predictors.
Edit intent: clarity
Original:  a natural definition which is closely related to the definition of mutual information .
Revised:  a natural definition which is closely related to the definition of MI .
Edit intent: clarity
Original:  The entropy perspective also shows that misinformation is synergistic entropy and hence that mutual information itself includes both redundant and synergistic effects.
Revised:  The entropy perspective also shows that misinformation is synergistic entropy and hence that MI itself includes both redundant and synergistic effects.
Edit intent: clarity
Original:  We show the relationships between the PED and mutual information in two predictors, and derive two alternative information decompositions , which we illustrate on several example systems.
Revised:  We show the relationships between the PED and MI in two predictors, and derive two alternative information decompositions , which we illustrate on several example systems.
Edit intent: clarity
Original:  We show the relationships between the PED and mutual information in two predictors, and derive two alternative information decompositions , which we illustrate on several example systems.
Revised:  We show the relationships between the PED and mutual information in two predictors, and derive two alternative information decompositions which we illustrate on several example systems.
Edit intent: fluency
Original:  The new perspective provided by these developments helps to clarify some of the difficulties encountered with the PID approach and the resulting decompositions provide useful tools for practical data analysis across a  range of application areas.
Revised:  The new perspective provided by the PED helps to clarify some of the difficulties encountered with the PID approach and the resulting decompositions provide useful tools for practical data analysis across a range of application areas.
Edit intent: clarity
Original:  The new perspective provided by these developments helps to clarify some of the difficulties encountered with the PID approach and the resulting decompositions provide useful tools for practical data analysis across a  range of application areas.
Revised:  The new perspective provided by these developments helps to clarify some of the difficulties encountered with the PID approach and the resulting decompositions provide useful tools for practical data analysis across a wide range of application areas.
Edit intent: clarity
Original: The 70 kDa Heat Shock Proteins Hsp70 have several essential functions in living systems, such as protecting proteins against protein aggregation, assisting protein folding, remodeling protein complexes and driving the translocation into organelles.
Revised: The 70 kDa Heat Shock Proteins Hsp70 have several essential functions in living systems, such as protecting cells against protein aggregation, assisting protein folding, remodeling protein complexes and driving the translocation into organelles.
Edit intent: clarity
Original: This paper studies the complexity of estimating Renyi divergences of a distribution p observed from samples , with respect to a baseline distribution q known a priori.
Revised: This paper studies the complexity of estimating Renyi divergences of a distribution p observed from samples and the baseline distribution q known a priori.
Edit intent: clarity
Original: The correspondence between various monoidal categories and graphical languages of diagrams has been studied extensively, leading to applications in quantum computing and communication, systems theory, circuit design and more.
Revised: The correspondence between monoidal categories and graphical languages of diagrams has been studied extensively, leading to applications in quantum computing and communication, systems theory, circuit design and more.
Edit intent: clarity
Original:  From the categorical perspectives , diagrams can be specified using (name-free) combinators which enjoy elegant equational properties.
Revised:  From the categorical perspective , diagrams can be specified using (name-free) combinators which enjoy elegant equational properties.
Edit intent: fluency
Original:  However, established notations for diagrammatic structures, such as hardware description languages (VHDL, Verilog) or graph languages (Dot), use a different style, which is flat, relational, and reliant on extensive use of names (labels).
Revised:  However, conventional notations for diagrammatic structures, such as hardware description languages (VHDL, Verilog) or graph languages (Dot), use a different style, which is flat, relational, and reliant on extensive use of names (labels).
Edit intent: clarity
Original:  However, since they make it relatively easy to specify (and modify) arbitrary diagrammatic structures they are much more popular than the combinator-style specifications.
Revised:  However, since they make it relatively easy to specify (and modify) arbitrary diagrammatic structures they are more popular than the combinator-style specifications.
Edit intent: clarity
Original:  In this paper we show how the two approaches to diagram syntax can be reconciled and unified in a way that does not change the original categorical semantics and the existing (categorical) equational theory.
Revised:  In this paper we show how the two approaches to diagram syntax can be reconciled and unified in a way that does not change the semantics and the existing (categorical) equational theory.
Edit intent: clarity
Original:  In this paper we show how the two approaches to diagram syntax can be reconciled and unified in a way that does not change the original categorical semantics and the existing (categorical) equational theory.
Revised:  In this paper we show how the two approaches to diagram syntax can be reconciled and unified in a way that does not change the original categorical semantics and the existing equational theory.
Edit intent: coherence
Original:  We also give sound and complete equational theories for the combined syntax.
Revised:  Additionally, we give sound and complete equational theories for the combined syntax.
Edit intent: coherence
Original:  We show analytically that the interest rate can be either increasing or decreasing in the transaction costs depending on the agents' risk parameters .
Revised:  We analyze the impact of transaction costs on the equilibrium interest rate and welfare levels .
Edit intent: clarity
Original: Researchers in fields such as sociology, demography and public health, have used data from social media to explore a diversity of questions.
Revised: The wide use of social media sites and other digital technologies have resulted in an unprecedented availability of digital data that are being used to study human behavior across research domains. Although unsolicited opinions and sentiments are available on these platforms, demographic details are usually missing. Demographic information is pertinent in fields such as sociology, demography and public health, have used data from social media to explore a diversity of questions.
Edit intent: coherence
Original: Researchers in fields such as sociology, demography and public health, have used data from social media to explore a diversity of questions.
Revised: Researchers in fields such as demography and public health, have used data from social media to explore a diversity of questions.
Edit intent: clarity
Original:  Several studies have proposed methods for automated detection of social media users ' demographic characteristics.
Revised:  Several studies have proposed methods for inferring the demographics of social media users ' demographic characteristics.
Edit intent: clarity
Original:  In this paper, we propose a novel model, Dynamic Influence Propagation (DIP), that allows propagation rate to change during the diffusion , based on which we define a new  problem: Threshold Activation Problem under DIP (TAP-DIP) , which adds another layer of complexity over the already \# P-Hard TAP problem.
Revised:  In this paper, we propose a novel model, Dynamic Influence Propagation (DIP), which allows propagation rates to change during the diffusion , based on which we define a new problem: Threshold Activation Problem under DIP (TAP-DIP) , which adds another layer of complexity over the already \# P-Hard TAP problem.
Edit intent: fluency
Original:  In this paper, we propose a novel model, Dynamic Influence Propagation (DIP), that allows propagation rate to change during the diffusion , based on which we define a new  problem: Threshold Activation Problem under DIP (TAP-DIP) , which adds another layer of complexity over the already \# P-Hard TAP problem.
Revised:  In this paper, we propose a novel model, Dynamic Influence Propagation (DIP), that allows propagation rate to change during the diffusion , based on which we define a new problem: Threshold Activation Problem under DIP (TAP-DIP) , which adds another layer of complexity over the already \# P-hard TAP problem.
Edit intent: fluency
Original:  Despite the hardnessof TAP-DIP , we are able to design a Lipschitz Optimization scheme (LOS) that can solve TAP-DIP with O(\log|V|) ratio where V is the set of nodes in the OSN.
Revised:  Despite it hardness , we are able to design a Lipschitz Optimization scheme (LOS) that can solve TAP-DIP with O(\log|V|) ratio where V is the set of nodes in the OSN.
Edit intent: fluency
Original:  Despite the hardnessof TAP-DIP , we are able to design a Lipschitz Optimization scheme (LOS) that can solve TAP-DIP with O(\log|V|) ratio where V is the set of nodes in the OSN.
Revised:  Despite the hardnessof TAP-DIP , we are able to approximate TAP-DIP with O(\log|V|) ratio where V is the set of nodes in the OSN.
Edit intent: clarity
Original:  Using various real OSN datasets, we experimentally demonstrate that LOS not only generates high-quality yet much smaller seed sets when being aware of the rate increase, but also scalable .
Revised:  Using various real OSN datasets, and demonstrate that our solution not only generates high-quality yet much smaller seed sets when being aware of the rate increase, but also scalable .
Edit intent: clarity
Original: A tight lower bound for required I/O when computing a matrix-matrix multiplication on a processor with two layers of memory is established.
Revised: A tight lower bound for required I/O when computing an ordinary matrix-matrix multiplication on a processor with two layers of memory is established.
Edit intent: clarity