wanyu/IteraTeR_full_sent huggingface dataset:
Original:  However, for datacenter (in short, DC) computing workloads, such as Internet services or big data analytics, previous work reports that they have extremely low floating point operation intensity , and the average FLOPS efficiency  is only 0.1\% , while the average IPC is 1.3 (the theoretic IPC is 4 on the Intel Xeon E5600 platform). Furthermore, we reveal that the traditional FLOPS based Roofline performance model is not suitable for modern DC workloads , and gives misleading information for system optimization .
Revised:  However, for datacenter (in short, DC) computing workloads, such as Internet services or big data analytics, previous work reports that they have extremely low floating point operation intensity , and the average FLOPS efficiency is only 0.1\% . The FLOPS gap is 12X between the two systems equipped with Intel Xeon or Intel Atom processors, but the average user-perceived performance gap of the DC workloads is only 7.4X between them .
Edit intent: meaning-changed
Original:  To address the above issue, we propose a new computation-centric metric BOPs (Basic OPerations ) that measures the efficient work defined by the source code, includes floating-point operations and the arithmetic, logical, comparing , and array addressing parts of integer operations.
Revised:  To address the above issue, we propose BOPS (Basic OPerations ) that measures the efficient work defined by the source code, includes floating-point operations and the arithmetic, logical, comparing , and array addressing parts of integer operations.
Edit intent: clarity
Original:  To address the above issue, we propose a new computation-centric metric BOPs (Basic OPerations ) that measures the efficient work defined by the source code, includes floating-point operations and the arithmetic, logical, comparing , and array addressing parts of integer operations.
Revised:  To address the above issue, we propose a new computation-centric metric BOPs (Basic OPerations per Second), which is the average number of BOPs (Basic OPerations) completed per second, as a new computation-centric metric. BOPs include the integer and floating point computations of arithmetic, logical, comparing , and array addressing parts of integer operations.
Edit intent: meaning-changed
Original:  To address the above issue, we propose a new computation-centric metric BOPs (Basic OPerations ) that measures the efficient work defined by the source code, includes floating-point operations and the arithmetic, logical, comparing , and array addressing parts of integer operations.
Revised:  To address the above issue, we propose a new computation-centric metric BOPs (Basic OPerations ) that measures the efficient work defined by the source code, includes floating-point operations and the arithmetic, logical, comparing and array addressing parts of integer operations.
Edit intent: fluency
Original:  To address the above issue, we propose a new computation-centric metric BOPs (Basic OPerations ) that measures the efficient work defined by the source code, includes floating-point operations and the arithmetic, logical, comparing , and array addressing parts of integer operations. We define BOPS as the average number of BOPs per second, and propose replacing FLOPS with BOPS to measure DC computer systems.
Revised:  To address the above issue, we propose a new computation-centric metric BOPs (Basic OPerations ) that measures the efficient work defined by the source code, includes floating-point operations and the arithmetic, logical, comparing , and array addressing . The number of BOPs per second, and propose replacing FLOPS with BOPS to measure DC computer systems.
Edit intent: coherence
Original:  We define BOPS as the average number of BOPs per second, and propose replacing FLOPS with BOPS to measure DC computer systems. On the basis of BOPS, we propose a new Roofline performance model for DC computing , which we call DC-Roofline model, with which we optimize DC workloads with the improvement varying from 119\% to 325\% .
Revised:  We define BOPS as the average number of BOPs is independent of the underlying system and hardware implementation, and can be calculated through automatically analyzing the source code of the workload. Based on the BOPS metric, an upper bound performance model, named DC-Roofline, is proposed for DC computing , which we call DC-Roofline model, with which we optimize DC workloads with the improvement varying from 119\% to 325\% .
Edit intent: meaning-changed
Original:  On the basis of BOPS, we propose a new Roofline performance model for DC computing , which we call DC-Roofline model, with which we optimize DC workloads with the improvement varying from 119\% to 325\% .
Revised:  On the basis of BOPS, we propose a new Roofline performance model for DC computing . In our experiments, three typical systems equipped with different Intel processors are evaluated using 17 typical DC workloads. The bias between the BOPS gap and the average user-perceived performance gap is no more than 11\%, and the BOPS efficiency of the Sort workload achieves 32\%. We optimize the typical DC kernel workloads under the guidance of the DC-Roofline model, with which we optimize DC workloads with the improvement varying from 119\% to 325\% .
Edit intent: meaning-changed
Original:  On the basis of BOPS, we propose a new Roofline performance model for DC computing , which we call DC-Roofline model, with which we optimize DC workloads with the improvement varying from 119\% to 325\% .
Revised:  On the basis of BOPS, we propose a new Roofline performance model for DC computing , which we call DC-Roofline model, and all workloads have achieved performance improvements ranging from 1.1X to 4.4X. Furthermore, as the real DC workload always has million lines of codes and tens of thousands of functions, it is not easy to use the DC-Roofline model directly. We propose an optimization methodology for the real-world DC workloads. Under the guidance of the proposed methodology, we optimize Redis by 1.2X .
Edit intent: meaning-changed
Original:  The approach constructs a multimodal graph of protein-protein interactions, drug-protein  interactions, and the polypharmacy side effects, which are represented as drug-drug interactions, where each side effect is an edge of a different type.
Revised:  The approach constructs a multimodal graph of protein-protein interactions, drug-protein target interactions, and the polypharmacy side effects, which are represented as drug-drug interactions, where each side effect is an edge of a different type.
Edit intent: meaning-changed
Original:   Furthermore, Decagon models particularly well side effects that have a strong molecular basis, while on predominantly non-molecular side effects, it achieves good performance because of effective sharing of model parameters across edge types.
Revised:  We find that it automatically learns representations of side effects indicative of co-occurrence of polypharmacy in patients. Furthermore, Decagon models particularly well side effects that have a strong molecular basis, while on predominantly non-molecular side effects, it achieves good performance because of effective sharing of model parameters across edge types.
Edit intent: meaning-changed
Original:  Then we use a modified KD-system in epistemic logic  to describe a player's knowledge, decision-making criterion, and reasoning process;
Revised:  Then we use a modified KD-system in epistemic logic , which can be regarded as a counterpart of the model for non-cooperative games in Bonanno (2008), (2015), to describe a player's knowledge, decision-making criterion, and reasoning process;
Edit intent: meaning-changed
Original:  Based on that result, we discuss an epistemic inconsistency behind Debreu-Scarf Theorem, that is, the increase of the number of replicas , on one hand, has constant require- ment on each participator 's knowledge in the competitive market, while , on the other hand, requires unbounded epistemic ability for at least one player in the cooperative situation .
Revised:  Based on that result, we discuss an epistemic inconsistency behind Debreu-Scarf Theorem, that is, the increase of the number of replicas has invariant requirement on each participant 's knowledge in the competitive market, while , on the other hand, requires unbounded epistemic ability for at least one player in the cooperative situation .
Edit intent: clarity
Original:  Based on that result, we discuss an epistemic inconsistency behind Debreu-Scarf Theorem, that is, the increase of the number of replicas , on one hand, has constant require- ment on each participator 's knowledge in the competitive market, while , on the other hand, requires unbounded epistemic ability for at least one player in the cooperative situation .
Revised:  Based on that result, we discuss an epistemic inconsistency behind Debreu-Scarf Theorem, that is, the increase of the number of replicas , on one hand, has constant require- ment on each participator 's knowledge from the aspect of competitive market, while , on the other hand, requires unbounded epistemic ability for at least one player in the cooperative situation .
Edit intent: clarity
Original:  Based on that result, we discuss an epistemic inconsistency behind Debreu-Scarf Theorem, that is, the increase of the number of replicas , on one hand, has constant require- ment on each participator 's knowledge in the competitive market, while , on the other hand, requires unbounded epistemic ability for at least one player in the cooperative situation .
Revised:  Based on that result, we discuss an epistemic inconsistency behind Debreu-Scarf Theorem, that is, the increase of the number of replicas , on one hand, has constant require- ment on each participator 's knowledge in the competitive market, while requires unbounded epistemic ability for at least one player in the cooperative situation .
Edit intent: coherence
Original:  Based on that result, we discuss an epistemic inconsistency behind Debreu-Scarf Theorem, that is, the increase of the number of replicas , on one hand, has constant require- ment on each participator 's knowledge in the competitive market, while , on the other hand, requires unbounded epistemic ability for at least one player in the cooperative situation .
Revised:  Based on that result, we discuss an epistemic inconsistency behind Debreu-Scarf Theorem, that is, the increase of the number of replicas , on one hand, has constant require- ment on each participator 's knowledge in the competitive market, while , on the other hand, requires unbounded epistemic ability players from the aspect of cooperative game .
Edit intent: clarity
Original: We provide  adaptive inference methods, based on l1 regularizationmethods , for regular (semi-parametric) and non-regular (nonparametric) linear functionals of the conditional expectation function.
Revised: We provide novel adaptive inference methods, based on l1 regularizationmethods , for regular (semi-parametric) and non-regular (nonparametric) linear functionals of the conditional expectation function.
Edit intent: meaning-changed
Original: We provide  adaptive inference methods, based on l1 regularizationmethods , for regular (semi-parametric) and non-regular (nonparametric) linear functionals of the conditional expectation function.
Revised: We provide adaptive inference methods, based on \ell_1 regularization , for regular (semi-parametric) and non-regular (nonparametric) linear functionals of the conditional expectation function.
Edit intent: meaning-changed
Original:  Examples of non-regular functionals include the local linear functionals defined as local averages that approximate perfectly localized quantities: average treatment , average policy effects, and average derivatives , conditional on a covariate subvector fixed at a point.
Revised:  Examples of non-regular functionals include localized quantities: average treatment , average policy effects, and average derivatives , conditional on a covariate subvector fixed at a point.
Edit intent: coherence
Original:  Examples of non-regular functionals include the local linear functionals defined as local averages that approximate perfectly localized quantities: average treatment , average policy effects, and average derivatives , conditional on a covariate subvector fixed at a point.
Revised:  Examples of non-regular functionals include the local linear functionals defined as local averages that approximate perfectly localized quantities: average treatment effects, policy effects, and average derivatives , conditional on a covariate subvector fixed at a point.
Edit intent: fluency
Original:  Examples of non-regular functionals include the local linear functionals defined as local averages that approximate perfectly localized quantities: average treatment , average policy effects, and average derivatives , conditional on a covariate subvector fixed at a point.
Revised:  Examples of non-regular functionals include the local linear functionals defined as local averages that approximate perfectly localized quantities: average treatment , average policy effects, and derivatives conditional on a covariate subvector fixed at a point.
Edit intent: fluency
Original:  We use l1-regularized methods to learn approximations to the regression function and the linear representer, in settings where dimension of (possibly overcomplete) dictionary of basis functions P is much larger than N. We then estimate the linear functional by the solution to the empirical analog of the orthogonal equations. Our key result is that under weak assumptions the estimator of the functional concentrates in a L/ root(n) neighborhood of the target with deviations controlled by the Gaussian law , provided L/root(n)%DIFDELCMD < \to %%% 0;
Revised:  Under weak assumptions, the estimator of the functional concentrates in a L/ root(n) neighborhood of the target with deviations controlled by the Gaussian law , provided L/root(n)%DIFDELCMD < \to %%% 0;
Edit intent: coherence
Original:  Our key result is that under weak assumptions the estimator of the functional concentrates in a L/ root(n) neighborhood of the target with deviations controlled by the Gaussian law , provided L/root(n)%DIFDELCMD < \to %%% 0;
Revised:  Our key result is that under weak assumptions the estimator of the functional concentrates in a L/ \sqrt{n neighborhood of the target with deviations controlled by the Gaussian law , provided L/root(n)%DIFDELCMD < \to %%% 0;
Edit intent: meaning-changed
Original:  Our key result is that under weak assumptions the estimator of the functional concentrates in a L/ root(n) neighborhood of the target with deviations controlled by the Gaussian law , provided L/root(n)%DIFDELCMD < \to %%% 0;
Revised:  Our key result is that under weak assumptions the estimator of the functional concentrates in a L/ root(n) neighborhood of the target with deviations controlled by the Gaussian law %DIFDELCMD < \to %%% 0;
Edit intent: coherence
Original:  Our key result is that under weak assumptions the estimator of the functional concentrates in a L/ root(n) neighborhood of the target with deviations controlled by the Gaussian law , provided L/root(n)%DIFDELCMD < \to %%% 0; L is the operator norm  of the functional , measuring the degree of its non-regularity, with L diverging for local functionals (or under weak identification of the global functionals) .
Revised:  Our key result is that under weak assumptions the estimator of the functional concentrates in a L/ root(n) neighborhood of the target with deviations controlled by the Gaussian law , provided L/root(n)%DIFDELCMD < \to %%% . We require that the operator norm of the functional , measuring the degree of its non-regularity, with L diverging for local functionals (or under weak identification of the global functionals) .
Edit intent: coherence
Original: The occurrence of drug-drug-interactions (DDI) from multiple drug prescriptions is a serious problem, both for individuals and health-care systems, since patients with complications due to DDI are likely to re-enter the system at a costlier level.
Revised: The occurrence of drug-drug-interactions (DDI) from multiple drug dispensations is a serious problem, both for individuals and health-care systems, since patients with complications due to DDI are likely to re-enter the system at a costlier level.
Edit intent: clarity
Original:  We present a large-scale longitudinal study  of the DDI phenomenon at the primary- and secondary-care level using electronic health records  from the city of Blumenau in Southern Brazil (pop. ~340,000).
Revised:  We present a large-scale longitudinal study (18 months) of the DDI phenomenon at the primary- and secondary-care level using electronic health records from the city of Blumenau in Southern Brazil (pop. ~340,000).
Edit intent: meaning-changed
Original:  We present a large-scale longitudinal study  of the DDI phenomenon at the primary- and secondary-care level using electronic health records  from the city of Blumenau in Southern Brazil (pop. ~340,000).
Revised:  We present a large-scale longitudinal study of the DDI phenomenon at the primary- and secondary-care level using electronic health records (EHR) from the city of Blumenau in Southern Brazil (pop. ~340,000).
Edit intent: clarity
Original:  Further, 4\% of the patients were dispensed major DDI combinations, likely to result in very serious adverse reactions and costs we estimate to be larger than previously reported  . DDI results are integrated into associative networks for inference and visualization, revealing key medications and interactions  . Analysis reveals that women have a 60\% increased risk of DDI as compared to men;
Revised:  Further, 4\% of the patients were dispensed DDI combinations, likely to result in very serious adverse reactions and costs we estimate to be larger than previously reported . DDI results are integrated into associative networks for inference and visualization, revealing key medications and interactions . Analysis reveals that women have a 60\% increased risk of DDI as compared to men;
Edit intent: clarity
Original:  Further, 4\% of the patients were dispensed major DDI combinations, likely to result in very serious adverse reactions and costs we estimate to be larger than previously reported  . DDI results are integrated into associative networks for inference and visualization, revealing key medications and interactions  . Analysis reveals that women have a 60\% increased risk of DDI as compared to men;
Revised:  Further, 4\% of the patients were dispensed major DDI combinations, likely to result in major adverse reactions with costs estimated to be larger than previously reported . DDI results are integrated into associative networks for inference and visualization, revealing key medications and interactions . Analysis reveals that women have a 60\% increased risk of DDI as compared to men;
Edit intent: clarity
Original:  Further, 4\% of the patients were dispensed major DDI combinations, likely to result in very serious adverse reactions and costs we estimate to be larger than previously reported  . DDI results are integrated into associative networks for inference and visualization, revealing key medications and interactions  . Analysis reveals that women have a 60\% increased risk of DDI as compared to men;
Revised:  Further, 4\% of the patients were dispensed major DDI combinations, likely to result in very serious adverse reactions and costs we estimate to be larger than previously reported in smaller studies . DDI results are integrated into associative networks for inference and visualization, revealing key medications and interactions . Analysis reveals that women have a 60\% increased risk of DDI as compared to men;
Edit intent: meaning-changed
Original:  Further, 4\% of the patients were dispensed major DDI combinations, likely to result in very serious adverse reactions and costs we estimate to be larger than previously reported  . DDI results are integrated into associative networks for inference and visualization, revealing key medications and interactions  . Analysis reveals that women have a 60\% increased risk of DDI as compared to men;
Revised:  Further, 4\% of the patients were dispensed major DDI combinations, likely to result in very serious adverse reactions and costs we estimate to be larger than previously reported . DDI results are integrated into associative networks for inference and visualization, revealing key medications and interactions involved in the DDI phenomenon . Analysis reveals that women have a 60\% increased risk of DDI as compared to men;
Edit intent: clarity
Original:  Finally, we demonstrate that machine learning classifiers accurately predict patients likely to be administered DDI given their history of prescribed drugs, gender , and age (MCC=.7, AUC=.97). These results demonstrate that accurate warning systems for known DDI can be devised for health-care systems leading to substantial reduction of DDI-related adverse reactions and health-care savings .
Revised:  These results demonstrate that considerable gender and age biases exist, but that accurate warning systems for known DDI can be devised for health-care systems leading to substantial reduction of DDI-related adverse reactions and health-care savings .
Edit intent: clarity
Original: Updating an abstract Voronoi diagram in linear time, after deletion of one site , has been an open problemfor a long time. Similarly for various concrete Voronoi diagrams of generalized sites, other than points .
Revised: Updating an abstract Voronoi diagram in linear time, after deletion of one site in linear time has been a well-known open problem; similarly, for concrete Voronoi diagrams of generalized sites, other than points .
Edit intent: clarity
Original:  We introduce the concept of a Voronoi-like diagram, a relaxed version of a Voronoi construct that has a structure similar to an abstract Voronoi diagram, without however being one.
Revised:  We introduce the concept of a Voronoi-like diagram, a relaxed version of an abstract Voronoi construct that has a structure similar to an abstract Voronoi diagram, without however being one.
Edit intent: fluency
Original:  We introduce the concept of a Voronoi-like diagram, a relaxed version of a Voronoi construct that has a structure similar to an abstract Voronoi diagram, without however being one.
Revised:  We introduce the concept of a Voronoi-like diagram, a relaxed version of a Voronoi construct that has a structure similar to an ordinary Voronoi diagram, without however being one.
Edit intent: clarity
Original:  We introduce the concept of a Voronoi-like diagram, a relaxed version of a Voronoi construct that has a structure similar to an abstract Voronoi diagram, without however being one.
Revised:  We introduce the concept of a Voronoi-like diagram, a relaxed version of a Voronoi construct that has a structure similar to an abstract Voronoi diagram, without , however, being one.
Edit intent: fluency
Original:  We formalize the concept  and prove that it is robust under an insertionoperation, thus ,  enabling its use in incremental constructions  .
Revised:  We formalize the concept and prove that it is robust under an insertionoperation, thus , enabling its use in incremental constructions . The time-complexity analysis of the resulting simple randomized incremental construction is non-standard, and interesting in its own right, because the intermediate Voronoi-like structures are order-dependent. We further extend the approach to compute the following structures in expected linear time: the order-(k+1) subdivision within an order-k Voronoi region, and the farthest abstract Voronoi diagram after the order of its regions at infinity is known .
Edit intent: meaning-changed