wanyu/IteraTeR_v2 huggingface dataset:
Original:  In particular, we show that semantic acyclicity is undecidable in  presence of full tgds (i.e., Datalog rules).
Revised:  In particular, we show that semantic acyclicity is undecidable in the presence of full tgds (i.e., Datalog rules).
Edit intent: fluency
Original:  In the case of egds, we show that semantic acyclicity is undecidable even over unary and binary predicates .
Revised:  In the case of egds, we show that for keys over unary and binary predicates .
Edit intent: clarity
Original:  When restricted to keys the problem becomes decidable (NP-complete) over such schemas .
Revised:  When restricted to keys the problem becomes decidable (NP-complete) .
Edit intent: clarity
Original:  It is shown that for any family of paracontractions M_i, i \in \{1,2,\ldots,m\} which has at least one common fixed point, and any sequence of strongly connected neighbor graphs N(t), t=1,2,\ldots, the algorithm causes all agent estimates to converge  a common fixed point.
Revised:  It is shown that for any family of paracontractions M_i, i \in \{1,2,\ldots,m\} which has at least one common fixed point, and any sequence of strongly connected neighbor graphs N(t), t=1,2,\ldots, the algorithm causes all agent estimates to converge to a common fixed point.
Edit intent: fluency
Original: State-of-the art deep neural networks (DNNs) have hundreds of millions of connections and are both computationally and memory intensive, making them difficult to deploy on embedded systems with limited hardware resources and power budgets.
Revised: State-of-the-art deep neural networks (DNNs) have hundreds of millions of connections and are both computationally and memory intensive, making them difficult to deploy on embedded systems with limited hardware resources and power budgets.
Edit intent: fluency
Original:  While custom hardware can help the computation, fetching the weights from DRAM can be as much as two orders of magnitude more expansive than ALU operation , and dominates the required power.
Revised:  While custom hardware helps the computation, fetching the weights from DRAM can be as much as two orders of magnitude more expansive than ALU operation , and dominates the required power.
Edit intent: clarity
Original:  While custom hardware can help the computation, fetching the weights from DRAM can be as much as two orders of magnitude more expansive than ALU operation , and dominates the required power.
Revised:  While custom hardware can help the computation, fetching weights from DRAM can be as much as two orders of magnitude more expansive than ALU operation , and dominates the required power.
Edit intent: fluency
Original:  While custom hardware can help the computation, fetching the weights from DRAM can be as much as two orders of magnitude more expansive than ALU operation , and dominates the required power.
Revised:  While custom hardware can help the computation, fetching the weights from DRAM is two orders of magnitude more expansive than ALU operation , and dominates the required power.
Edit intent: clarity
Original:  While custom hardware can help the computation, fetching the weights from DRAM can be as much as two orders of magnitude more expansive than ALU operation , and dominates the required power.
Revised:  While custom hardware can help the computation, fetching the weights from DRAM can be as much as two orders of magnitude more expensive than ALU operations , and dominates the required power.
Edit intent: clarity
Original:  Previously proposed compression makes it possible to fit state-of-the-art DNNs (AlexNet with 60 million parameters, VGG-16 with 130 million parameters ) fully in on-chip SRAM.
Revised:  Previously proposed compression makes it possible to fit large DNNs (AlexNet with 60 million parameters, VGG-16 with 130 million parameters ) fully in on-chip SRAM.
Edit intent: clarity
Original:  We propose an energy efficient inference engine (EIE) that performs inference on this compressed network model and accelerates the inherent modified sparse matrix-vector multiplication  .
Revised:  We propose an energy efficient inference engine (EIE) that performs inference on this compressed network model and accelerates the resulting sparse matrix-vector multiplication .
Edit intent: clarity
Original:  Evaluated on nine DNN benchmarks, EIE is 189x and 13x faster when compared to CPU and GPU implementations of the  DNN without compression.
Revised:  Evaluated on nine DNN benchmarks, EIE is 189x and 13x faster when compared to CPU and GPU implementations of the same DNN without compression.
Edit intent: clarity
Original:  EIE with processing power of 102~GOPS at only 600mW is also 24,000x and 3, 000x more energy efficient than a CPU and GPU respectively.
Revised:  EIE has a processing power of 102~GOPS at only 600mW is also 24,000x and 3, 000x more energy efficient than a CPU and GPU respectively.
Edit intent: fluency
Original:  EIE with processing power of 102~GOPS at only 600mW is also 24,000x and 3, 000x more energy efficient than a CPU and GPU respectively.
Revised:  EIE with processing power of 102~GOPS at only 600mW . It is 24,000x and 3, 000x more energy efficient than a CPU and GPU respectively.
Edit intent: coherence
Original:  We then propose an alternative model that is based on the idea that workers evaluate potential jobs based on a quality aspect and that workers search for jobs sequentially across space.
Revised:  We propose an alternative model that is based on the idea that workers evaluate potential jobs based on a quality aspect and that workers search for jobs sequentially across space.
Edit intent: coherence
Original:  We  assume that the density of potential jobs depends on the skills of the worker and decreases with the wage.
Revised:  We also assume that the density of potential jobs depends on the skills of the worker and decreases with the wage.
Edit intent: coherence
Original:  The predicted distribution of commuting distances decays as 1/r ^3 and is independent of the distribution of the quality of jobs.
Revised:  The predicted distribution of commuting distances decays as 1/r ^{3 and is independent of the distribution of the quality of jobs.
Edit intent: fluency
Original:  This type of approach opens new perspectives for the modeling of urban phenomena .
Revised:  This type of approach opens new perspectives for the modeling of mobility .
Edit intent: clarity
Original:  It is shown that\left(\left|  }\right| \left|  }\right| \right)  the fast-wave slow-wave SDC (FWSW-SDC) iteration will converge for small enough time steps and that in the limit of infinitely fast waves the convergence rate of the non-split version is retained.
Revised:  It is shown that\left(\left| }\right| \left| }\right| \right) the fast-wave slow-wave SDC (FWSW-SDC) iteration to converge and that in the limit of infinitely fast waves the convergence rate of the non-split version is retained.
Edit intent: clarity
Original: Inventor name disambiguation is a task that distinguishes each unique inventor from all other inventor records in patent database.
Revised: Inventor name disambiguation is a task that distinguishes each unique person from all other inventor records in patent database.
Edit intent: clarity
Original:  Evaluation is on labeled datasets from USPTO PatentsView inventor name disambiguation competition and showed our algorithm outperforms all algorithms submitted to the competition.
Revised:  Evaluation on datasets from USPTO PatentsView inventor name disambiguation competition and showed our algorithm outperforms all algorithms submitted to the competition.
Edit intent: clarity
Original:  Evaluation is on labeled datasets from USPTO PatentsView inventor name disambiguation competition and showed our algorithm outperforms all algorithms submitted to the competition.
Revised:  Evaluation is on labeled datasets from USPTO PatentsView inventor name disambiguation competition shows our algorithm outperformed all algorithms in the competition.
Edit intent: clarity
Original:  A random forest was selected for the pairwise linking classifier since they outperformed Naive Bayes, Logistic Regression, Support Vector Machines (SVM), Conditional Inference Tree, and Decision Trees.
Revised:  A random forest was selected for the pairwise linking classifier since they outperform Naive Bayes, Logistic Regression, Support Vector Machines (SVM), Conditional Inference Tree, and Decision Trees.
Edit intent: fluency
Original:  Tests on the USPTO patent database show that our method successfully disambiguated 12 million inventor mentions in 6.5 hours.
Revised:  Tests on the USPTO patent database show that our method successfully disambiguated 12 million inventor mentions within 6.5 hours.
Edit intent: clarity
Original:  Evaluation on datasets from USPTO PatentsView inventor name disambiguation competition shows our algorithm outperformed all algorithms in the competition.
Revised:  Evaluation on datasets from USPTO PatentsView inventor name disambiguation competition shows our algorithm outperforms all algorithms in the competition.
Edit intent: fluency
Original:  Far less attention has been dedicated to the predictability of performance-how often individual transactions exhibit execution latency far from the mean . Performance predictability is vital when transaction processing lies on the critical path of  an interactive web service, or in emerging market segments that offer transaction processing as a service to customers who contract for guaranteed levels of performance.
Revised:  However, significantly less attention has been dedicated to the predictability of performance-how often individual transactions exhibit execution latency far from the mean . Performance predictability is vital when transaction processing lies on the critical path of an interactive web service, or in emerging market segments that offer transaction processing as a service to customers who contract for guaranteed levels of performance.
Edit intent: clarity
Original:  Far less attention has been dedicated to the predictability of performance-how often individual transactions exhibit execution latency far from the mean . Performance predictability is vital when transaction processing lies on the critical path of  an interactive web service, or in emerging market segments that offer transaction processing as a service to customers who contract for guaranteed levels of performance.
Revised:  Far less attention has been dedicated to the predictability of performance: how often individual transactions exhibit execution latency far from the mean . Performance predictability is vital when transaction processing lies on the critical path of an interactive web service, or in emerging market segments that offer transaction processing as a service to customers who contract for guaranteed levels of performance.
Edit intent: clarity
Original:  Far less attention has been dedicated to the predictability of performance-how often individual transactions exhibit execution latency far from the mean . Performance predictability is vital when transaction processing lies on the critical path of  an interactive web service, or in emerging market segments that offer transaction processing as a service to customers who contract for guaranteed levels of performance.
Revised:  Far less attention has been dedicated to the predictability of performance-how often individual transactions exhibit execution latency far from the mean ? Performance predictability is vital when transaction processing lies on the critical path of an interactive web service, or in emerging market segments that offer transaction processing as a service to customers who contract for guaranteed levels of performance.
Edit intent: fluency
Original:  Far less attention has been dedicated to the predictability of performance-how often individual transactions exhibit execution latency far from the mean . Performance predictability is vital when transaction processing lies on the critical path of  an interactive web service, or in emerging market segments that offer transaction processing as a service to customers who contract for guaranteed levels of performance.
Revised:  Far less attention has been dedicated to the predictability of performance-how often individual transactions exhibit execution latency far from the mean . Performance predictability is vital when transaction processing lies on the critical path of an interactive web service, as well as in emerging database-as-a-service markets where customers contract for guaranteed levels of performance.
Edit intent: clarity
Original:  VProfiler works by deconstructing overall transaction latency variance into variances and covariances of the execution time of individual functions, which  provide insight into the root causes of variance.
Revised:  VProfiler works by deconstructing overall transaction latency variance into variances and covariances of the execution time of individual functions, which in turn provide insight into the root causes of variance.
Edit intent: clarity
Original:  We additionally propose enhancements to the buffer pool replacement policy and identify MySQL parameters that can be tuned to reduce variance based on the output of VProfiler .
Revised:  We additionally propose enhancements to the buffer pool replacement policy and identify MySQL parameters that can reduce variance significantly .
Edit intent: clarity
Original:  However this modern tool is labor intensive, has a high cost per cell, and  most importantly, does not provide information on spatial distribution of cell types in specific regions of the brain.
Revised:  However this modern tool is labor intensive, have a high cost per cell, and most importantly, does not provide information on spatial distribution of cell types in specific regions of the brain.
Edit intent: fluency
Original:  However this modern tool is labor intensive, has a high cost per cell, and  most importantly, does not provide information on spatial distribution of cell types in specific regions of the brain.
Revised:  However this modern tool is labor intensive, has a high cost per cell, and , most importantly, does not provide information on spatial distribution of cell types in specific regions of the brain.
Edit intent: fluency
Original:  However this modern tool is labor intensive, has a high cost per cell, and  most importantly, does not provide information on spatial distribution of cell types in specific regions of the brain.
Revised:  However this modern tool is labor intensive, has a high cost per cell, and most importantly, do not provide information on spatial distribution of cell types in specific regions of the brain.
Edit intent: fluency
Original:  We propose a computational method for inferring the cell types and their gene expression profiles through computational analysis of brain-wide single-cell resolution in situ hybridization (ISH) imagery contained in the Allen Brain Atlas (ABA).
Revised:  We propose a computational method for inferring the cell types and their gene expression profiles through analysis of brain-wide single-cell resolution in situ hybridization (ISH) imagery contained in the Allen Brain Atlas (ABA).
Edit intent: fluency
Original:  By fitting a point process mixture model jointly to the ISH images for about two thousand genes , we infer both the spatial point process distribution for each cell type and their gene expression profile.
Revised:  By fitting a point process mixture model jointly to the ISH images , we infer both the spatial point process distribution for each cell type and their gene expression profile.
Edit intent: clarity
Original: We present a distributed method for the estimation of the kinematic parameters, the dynamic parameters, and the kinematic state of an unknown  body manipulated by a decentralized team of mobile ground (planar) robots .
Revised: We present a distributed method for the estimation of the kinematic parameters, the dynamic parameters, and the kinematic state of an unknown planar body manipulated by a decentralized team of mobile ground (planar) robots .
Edit intent: fluency
Original: We present a distributed method for the estimation of the kinematic parameters, the dynamic parameters, and the kinematic state of an unknown  body manipulated by a decentralized team of mobile ground (planar) robots .
Revised: We present a distributed method for the estimation of the kinematic parameters, the dynamic parameters, and the kinematic state of an unknown body manipulated by a decentralized multi-agent system .
Edit intent: clarity
Original:  The proposed approach relies on the geometry of the rigid body kinematics , the rigid body dynamics, on nonlinear observation  , and on consensus algorithms.
Revised:  The proposed approaches rely on the rigid body kinematics , the rigid body dynamics, on nonlinear observation , and on consensus algorithms.
Edit intent: clarity
Original:  The proposed approach relies on the geometry of the rigid body kinematics , the rigid body dynamics, on nonlinear observation  , and on consensus algorithms.
Revised:  The proposed approach relies on the geometry of the rigid body kinematics and dynamics, on nonlinear observation , and on consensus algorithms.
Edit intent: clarity
Original:  The proposed approach relies on the geometry of the rigid body kinematics , the rigid body dynamics, on nonlinear observation  , and on consensus algorithms.
Revised:  The proposed approach relies on the geometry of the rigid body kinematics , the rigid body dynamics, on nonlinear observation theory , and on consensus algorithms.
Edit intent: clarity
Original:  The only three requirements are that each robot is able to control the 2D wrench exerted locally on the load, it can measure the velocity of its contact point, and  the communication graph is connected.
Revised:  The only three requirements are that each agent can exert a 2D wrench exerted locally on the load, it can measure the velocity of its contact point, and the communication graph is connected.
Edit intent: clarity
Original:  The only three requirements are that each robot is able to control the 2D wrench exerted locally on the load, it can measure the velocity of its contact point, and  the communication graph is connected.
Revised:  The only three requirements are that each robot is able to control the 2D wrench on the load, it can measure the velocity of its contact point, and the communication graph is connected.
Edit intent: clarity
Original:  The only three requirements are that each robot is able to control the 2D wrench exerted locally on the load, it can measure the velocity of its contact point, and  the communication graph is connected.
Revised:  The only three requirements are that each robot is able to control the 2D wrench exerted locally on the load, it can measure the velocity of its contact point, and that the communication graph is connected.
Edit intent: fluency
Original:  A non-cooperative Tullock-like game model is formulated that consists of a finite amount of benign agents and onemalicious agent.
Revised:  A non-cooperative game consisting of a finite amount of benign agents and onemalicious agent.
Edit intent: clarity
Original:  A non-cooperative Tullock-like game model is formulated that consists of a finite amount of benign agents and onemalicious agent.
Revised:  A non-cooperative Tullock-like game model is formulated that consists of a finite amount of agents and onemalicious agent.
Edit intent: clarity
Original:  A non-cooperative Tullock-like game model is formulated that consists of a finite amount of benign agents and onemalicious agent.
Revised:  A non-cooperative Tullock-like game model is formulated that consists of a finite amount of benign malicious agent.
Edit intent: fluency
Original:  A non-cooperative Tullock-like game model is formulated that consists of a finite amount of benign agents and onemalicious agent.
Revised:  A non-cooperative Tullock-like game model is formulated that consists of a finite amount of benign agents and one agent.
Edit intent: fluency
Original:  We derive the upper and the lower bounds of six fundamental measures with regard to the total utility and the total net utility of benign agents and the OSN's revenue under three different scenarios: with and without the malicious agent , and the maximum.
Revised:  We derive the upper and the lower bounds of six fundamental measures with regard to the total utility and the total net utility of benign users, and the revenue of network operator under three different scenarios: with and without the malicious agent , and the maximum.
Edit intent: clarity
Original:  We derive the upper and the lower bounds of six fundamental measures with regard to the total utility and the total net utility of benign agents and the OSN's revenue under three different scenarios: with and without the malicious agent , and the maximum.
Revised:  We derive the upper and the lower bounds of six fundamental measures with regard to the total utility and the total net utility of benign agents and the OSN's revenue under three different scenarios: with and without the misbehaving user , and the maximum.
Edit intent: clarity
Original:  They capture the worst and the best performances of the benign agents as well as the OSN . Our study reveals two important insights: i) the performance bounds are very sensitive to the malicious agent 's willingness to pay at certain ranges;
Revised:  They capture the worst and the best performances of the benign agents as well as the OSN . Our study reveals two important insights: i) the performance bounds are very sensitive to the misbehaving user 's willingness to pay at certain ranges;
Edit intent: clarity
Original:  ii) the OSN acquires more revenues from this malicious action .
Revised:  ii) the network operator acquires more revenues from this malicious action .
Edit intent: clarity
Original:  ii) the OSN acquires more revenues from this malicious action .
Revised:  ii) the OSN acquires more revenues in the presence of the misbehaving user which might disincentivize his countermeasures against the misbehaving actions .
Edit intent: clarity
Original:  We demonstrate the features of the tool by analyzing--as an example--the references in documents published in the journal <i> Philosophy of Science </i> .
Revised:  We demonstrate the features of the tool by analyzing--as an example--the references in documents published in the journal Philosophy of Science </i> .
Edit intent: fluency
Original:  We demonstrate the features of the tool by analyzing--as an example--the references in documents published in the journal <i> Philosophy of Science </i> .
Revised:  We demonstrate the features of the tool by analyzing--as an example--the references in documents published in the journal <i> Philosophy of Science .
Edit intent: clarity
Original:  These parameters are similar to partition functions of vertex models, as introduced by de la Harpe and Jones, [P. de la Harpe, V.F.R. Jones, Graph invariants related to statistical mechanical models: examples and problems, %DIFDELCMD < {\sl %%% Journal of Combinatorial Theory , Series B %DIFDELCMD < {\bf %%% 57 (1993) 207--227 ].
Revised:  These parameters are similar to partition functions of vertex models, as introduced by de la Harpe and Jones, [P. de la Harpe, V.F.R. Jones, Graph invariants related to statistical mechanical models: examples and problems, %DIFDELCMD < {\sl %%% Journal of Combinatorial Theory , Series B %DIFDELCMD < {\bf %%% 57 (1993) 207-227 ].
Edit intent: fluency
Original:  We moreover show that certain evaluations of the cycle partition polynomial  ] give examples of graph parameters that can be obtained this way.
Revised:  We moreover show that certain evaluations of the cycle partition polynomial ], give examples of graph parameters that can be obtained this way.
Edit intent: fluency
Original:  There are algebraic analogues of this Perron vector in terms of probability transition tensors of higher-order Markov chains.
Revised:  There are algebraic analogues of this Perron vector in terms of transition probability tensors of higher-order Markov chains.
Edit intent: fluency