wanyu/IteraTeR_v2 huggingface dataset:
Original:  Intuitively, this method uses differential equations to approximate the time-evolution/dynamics of random processes and algorithms.
Revised:  This powerful method uses differential equations to approximate the time-evolution/dynamics of random processes and algorithms.
Edit intent: clarity
Original: Matrix Factorization is a popular non-convex objective , for which alternating minimization schemes are mostly used.
Revised: Matrix Factorization is a popular non-convex optimization problem , for which alternating minimization schemes are mostly used.
Edit intent: clarity
Original:  A recently developed remedy relies on the concept of Bregman distances, which generalizes the standard Euclidean distance.
Revised:  A recently developed approach relies on the concept of Bregman distances, which generalizes the standard Euclidean distance.
Edit intent: clarity
Original:  Using NTP, a deep learning researcher can quickly establish baselines needed to understand performance of an end-to-end neural network topology and make high level architectural decisions based on optimization techniques like layer sizing, quantization, pruning etc .
Revised:  Using NTP, a deep learning researcher can quickly establish baselines needed to understand performance of an end-to-end neural network topology and make high level architectural decisions .
Edit intent: clarity
Original: A limitation of the Graph Convolutional Networks ( GCN ) is that it assumes at a particular l^{th} layer of the neural network model only the l^{th} order neighbourhood nodes of a social network are influential.
Revised: A limitation of the Graph Convolutional Networks ( GCNs ) is that it assumes at a particular l^{th} layer of the neural network model only the l^{th} order neighbourhood nodes of a social network are influential.
Edit intent: fluency
Original:  In practice, reentrant corners and misalignment of singularities lead to small regions and limit cycles, negating some of the benefits a quad layout can provide in quad meshing.
Revised:  In practice, re-entrant corners and misalignment of singularities lead to small regions and limit cycles, negating some of the benefits a quad layout can provide in quad meshing.
Edit intent: fluency
Original: The framework of inner product norm preserving relaxation Runge-Kutta methods (David I. Ketcheson, Relaxation Runge-Kutta Methods: Conservation and Stability for Inner-Product Norms, 2019. arXiv: 1905.09847 math.
Revised: The framework of inner product norm preserving relaxation Runge-Kutta methods (David I. Ketcheson, math.
Edit intent: coherence
Original:  Conservation, dissipation, or other solution properties with respect to any convex functional are enforced by the addition of a relaxation parameter {\em  that multiplies the Runge-Kutta update at each step.
Revised:  Conservation, dissipation, or other solution properties with respect to any convex functional are enforced by the addition of a {\em that multiplies the Runge-Kutta update at each step.
Edit intent: clarity
Original: Many real-world systems ranging from social , biological to infrastructures can be modeled by multilayer networks.
Revised: Real-world systems, ranging from social , biological to infrastructures can be modeled by multilayer networks.
Edit intent: clarity
Original: Many real-world systems ranging from social , biological to infrastructures can be modeled by multilayer networks.
Revised: Many real-world systems ranging from social and biological to infrastructural, can be modeled by multilayer networks.
Edit intent: fluency
Original:  Promoting information spreading on multilayer networks has significant contributions in conducting advertisements for e-commercial products and predicting popular scientific publications.
Revised:  Promoting spreading dynamics in multilayer networks may significantly facilitate electronic advertising and predicting popular scientific publications.
Edit intent: clarity
Original:  In this paper , we propose an optimal strategy to promote spreading via adding one interconnecting edge between two isolated networks.
Revised:  In this study , we propose an optimal strategy to promote spreading via adding one interconnecting edge between two isolated networks.
Edit intent: clarity
Original:  Basing on a perturbation theory of the discrete Markovian chain approach, we deviate an index that evaluating the spreading prevalence in the interconnected network approximately .
Revised:  By applying a perturbation method to the discrete Markovian chain approach, we deviate an index that evaluating the spreading prevalence in the interconnected network approximately .
Edit intent: clarity
Original:  Basing on a perturbation theory of the discrete Markovian chain approach, we deviate an index that evaluating the spreading prevalence in the interconnected network approximately .
Revised:  Basing on a perturbation theory of the discrete Markovian chain approach, we derive an index that evaluating the spreading prevalence in the interconnected network approximately .
Edit intent: fluency
Original:  Basing on a perturbation theory of the discrete Markovian chain approach, we deviate an index that evaluating the spreading prevalence in the interconnected network approximately .
Revised:  Basing on a perturbation theory of the discrete Markovian chain approach, we deviate an index that estimates the spreading prevalence in the interconnected network approximately .
Edit intent: clarity
Original:  Basing on a perturbation theory of the discrete Markovian chain approach, we deviate an index that evaluating the spreading prevalence in the interconnected network approximately .
Revised:  Basing on a perturbation theory of the discrete Markovian chain approach, we deviate an index that evaluating the spreading prevalence in the interconnected network .
Edit intent: clarity
Original:  Those weights will enhance the edges that lowly infected in one end and its neighborhood , while highly infected in the other .
Revised:  Edges that are less infected at one end and its neighborhood , while highly infected in the other .
Edit intent: clarity
Original:  Those weights will enhance the edges that lowly infected in one end and its neighborhood , while highly infected in the other .
Revised:  Those weights will enhance the edges that lowly infected in one end and its neighborhood but highly infected at the other will have larger weights .
Edit intent: clarity
Original:  We verify the effectiveness of the  strategy on small networks by exhaustively examining all latent edges and find it gives optimal or close to optimal performance .
Revised:  We verify the effectiveness of the proposed strategy on small networks by exhaustively examining all latent edges and find it gives optimal or close to optimal performance .
Edit intent: clarity
Original:  We verify the effectiveness of the  strategy on small networks by exhaustively examining all latent edges and find it gives optimal or close to optimal performance .
Revised:  We verify the effectiveness of the strategy on small networks by exhaustively examining all latent edges and demonstrate that performance is optimal or near-optimal .
Edit intent: clarity
Original:  For large synthetic and real world networks, it always outperforms some other heuristic strategies like connecting nodes with highest degrees or eigenvector centralities .
Revised:  For large synthetic and real world networks, it always outperforms some other heuristic strategies like connecting nodes with the highest degree or eigenvector centrality .
Edit intent: fluency
Original: To solve positive and conservative production-destruction systems (PDS) of ordinary differential equations , so called modified Patankar-Runge-Kutta (MPRK) schemes are usually applied to guarantee these properties .
Revised: Production-destruction systems (PDS) of ordinary differential equations , so called modified Patankar-Runge-Kutta (MPRK) schemes are usually applied to guarantee these properties .
Edit intent: coherence
Original: To solve positive and conservative production-destruction systems (PDS) of ordinary differential equations , so called modified Patankar-Runge-Kutta (MPRK) schemes are usually applied to guarantee these properties .
Revised: To solve positive and conservative production-destruction systems (PDS) of ordinary differential equations , so called modified Patankar-Runge-Kutta (MPRK) schemes are often used in this context .
Edit intent: clarity
Original:  However, up to our knowledge, families of MPRK are only developed up to third order of accuracy.
Revised:  However, up to our knowledge, the family of MPRK has been only developed up to third order of accuracy.
Edit intent: clarity
Original:  In this work, we also solve PDS , but using as time integration methods the Deferred Correction (DeC) process  . Applying the modified Patankar approach to the DeC scheme results in provable conservative and positivity preserving methods.
Revised:  In this work, we propose a method to solve PDS problems , but using as time integration methods the Deferred Correction (DeC) process . Applying the modified Patankar approach to the DeC scheme results in provable conservative and positivity preserving methods.
Edit intent: clarity
Original:  In this work, we also solve PDS , but using as time integration methods the Deferred Correction (DeC) process  . Applying the modified Patankar approach to the DeC scheme results in provable conservative and positivity preserving methods.
Revised:  In this work, we also solve PDS , but using the Deferred Correction (DeC) process . Applying the modified Patankar approach to the DeC scheme results in provable conservative and positivity preserving methods.
Edit intent: clarity
Original:  At the end of the paper , we validate our theoretical analysis through numerical simulations.
Revised:  Finally , we validate our theoretical analysis through numerical simulations.
Edit intent: clarity
Original: Users typically interact with a database by asking queries and examining results provided by the database system .
Revised: Users typically interact with a database by asking queries and examining the results .
Edit intent: clarity
Original:  We refer to the user examining the results of a query and asking follow-up questions as query result exploration.
Revised:  We refer to the user examining the query results and asking follow-up questions as query result exploration.
Edit intent: clarity
Original:  Further, three approaches for computing provenance have been described in the literature: (a) in the lazyapproach, no additional data is materialized and provenance is computed from the base tables as needed;
Revised:  Three approaches for computing provenance have been described in the literature: (a) in the lazyapproach, no additional data is materialized and provenance is computed from the base tables as needed;
Edit intent: coherence
Original:  In this paper, we investigate lazy and eager approaches that utilize constraints  in the context of query result exploration, as well as novel hybrid approaches , where the keys for some of the base tables are materialized as selected by a cost model .
Revised:  In this paper, we investigate lazy and eager approaches that utilize constraints in the context of query result exploration, as well as novel hybrid approaches .
Edit intent: coherence
Original:  For the TPC-H benchmark, we find that the constraints that we identify are applicable to 19 out of the 22 queries, and result in a better performance of the lazy approach for 7 out of these 19 queries .
Revised:  For the TPC-H benchmark, these constraints are applicable to 19 out of the 22 queries, and result in a better performance of the lazy approach for 7 out of these 19 queries .
Edit intent: clarity
Original:  Further , the performance benefit from our approaches are significant, sometimes several orders of magnitude , compared to previous research .
Revised:  Further , the performance benefits from our approaches are significant, sometimes several orders of magnitude , compared to previous research .
Edit intent: fluency
Original:  Further , the performance benefit from our approaches are significant, sometimes several orders of magnitude , compared to previous research .
Revised:  Further , the performance benefit from our approaches are significant, sometimes several orders of magnitude .
Edit intent: clarity
Original:  This work improves sub-mm recording mote depth by >2.5x, resulting in the highest measured depth/volume ratio by ~3x \sim3x .
Revised:  This work improves sub-mm recording mote depth by >2.5x, resulting in the highest measured depth/volume ratio by \sim3x .
Edit intent: clarity
Original:  As the size and complexity of the simulations grow, so does the need for computational power and time.
Edit intent: coherence
Original:  While traditionally done on CPU , unlocking the massive number of computational cores on GPU is highly desirable.
Revised:  While traditionally done on CPUs , unlocking the massive number of computational cores on GPU is highly desirable.
Edit intent: fluency
Original:  While traditionally done on CPU , unlocking the massive number of computational cores on GPU is highly desirable.
Revised:  While traditionally done on CPU , unlocking the massive number of computational cores on GPUs is highly desirable.
Edit intent: fluency
Original:  However, solving arbitrary boolean combinations of set constraints is NEXPTIME-complete .
Revised:  However, solving arbitrary boolean combinations of set constraints is \mathsf{NEXPTIME .
Edit intent: clarity
Original:  Moreover, while theoretical algorithms to solve arbitrary set constraints exist, they are either too complex to implement , or too slow to ever run.
Revised:  Moreover, while theoretical algorithms to solve arbitrary set constraints exist, they are either too complex to implement or too slow to ever run.
Edit intent: fluency
Original:  Our technique allows for arbitrary boolean combinations of positive or negative set constraints, and leverages the performance of modern solvers such as Z3 . To show the usefulness of unrestricted set constraints, we use them to devise a pattern match analysis for functional languages .
Revised:  Our technique allows for arbitrary boolean combinations of set constraints, and leverages the performance of modern solvers such as Z3 . To show the usefulness of unrestricted set constraints, we use them to devise a pattern match analysis for functional languages .
Edit intent: clarity
Original:  Our technique allows for arbitrary boolean combinations of positive or negative set constraints, and leverages the performance of modern solvers such as Z3 . To show the usefulness of unrestricted set constraints, we use them to devise a pattern match analysis for functional languages .
Revised:  Our technique allows for arbitrary boolean combinations of positive or negative set constraints, and leverages the performance of modern SMT solvers . To show the usefulness of unrestricted set constraints, we use them to devise a pattern match analysis for functional languages .
Edit intent: clarity
Original:  However, solving arbitrary boolean combinations of set constraints is \mathsf{NEXPTIME . Moreover, while theoretical algorithms to solve arbitrary set constraints exist, they are either too complex to  implement or too slow to ever run.
Revised:  However, solving arbitrary boolean combinations of set constraints is NEXPTIME-hard . Moreover, while theoretical algorithms to solve arbitrary set constraints exist, they are either too complex to implement or too slow to ever run.
Edit intent: clarity
Original:  We implement our analysis in the Elm compiler and show that the our translation is fast enough to be used in practical verification.
Revised:  We implement our analysis in the Elm compiler and show that our translation is fast enough to be used in practical verification.
Edit intent: fluency
Original:  We perform a rigorous analysis of the different factors such as channel length modulation (CLM), drain-induced barrier lowering (DIBL), capacitive coupling, etc which may degrade the compute precision of the proposed VMM approach.
Revised:  We perform a rigorous analysis of the different factors which may degrade the compute precision of the proposed VMM approach.
Edit intent: coherence
Original:  We perform a rigorous analysis of the different factors such as channel length modulation (CLM), drain-induced barrier lowering (DIBL), capacitive coupling, etc which may degrade the compute precision of the proposed VMM approach.
Revised:  We perform a rigorous analysis of the different factors such as channel length modulation (CLM), drain-induced barrier lowering (DIBL), capacitive coupling, etc which may degrade the compute precision of the proposed approach.
Edit intent: clarity
Original:  Therefore, we also provide the necessary design guidelines for optimizing the performance of this implementation .
Revised:  Therefore, we also provide the necessary design guidelines for optimizing the performance .
Edit intent: clarity
Original:  The preliminary results show that an effective compute precision greater than 8-bits is achievable owing to the inherent compensation effect with an energy efficiency of ~ 323.5 TOps /J and a throughput of 1.25 TOps/s considering the input/output (I/O) circuitry for a 200x200 VMM utilizing the proposed approach .
Revised:  The preliminary results show that an effective compute precision greater than 8-bits is achievable owing to the inherent compensation effect with an energy efficiency of ~ 1.5 POps /J and a throughput of 1.25 TOps/s considering the input/output (I/O) circuitry for a 200x200 VMM utilizing the proposed approach .
Edit intent: style
Original:  The preliminary results show that an effective compute precision greater than 8-bits is achievable owing to the inherent compensation effect with an energy efficiency of ~ 323.5 TOps /J and a throughput of 1.25 TOps/s considering the input/output (I/O) circuitry for a 200x200 VMM utilizing the proposed approach .
Revised:  The preliminary results show that an effective compute precision greater than 8-bits is achievable owing to the inherent compensation effect with an energy efficiency of ~ 323.5 TOps /J and a throughput of 1.25 TOps/s while considering the contribution due to the input/output (I/O) circuitry for a 200x200 VMM utilizing the proposed approach .
Edit intent: clarity
Original:  The preliminary results show that an effective compute precision greater than 8-bits is achievable owing to the inherent compensation effect with an energy efficiency of ~ 323.5 TOps /J and a throughput of 1.25 TOps/s considering the input/output (I/O) circuitry for a 200x200 VMM utilizing the proposed approach .
Revised:  The preliminary results show that an effective compute precision greater than 8-bits is achievable owing to the inherent compensation effect with an energy efficiency of ~ 323.5 TOps /J and a throughput of 1.25 TOps/s considering the input/output (I/O) circuitry .
Edit intent: clarity
Original:  Therefore, compact and power-efficient VMM blocks are required to perform resource-intensive  computations.
Revised:  Therefore, there is a critical need for compact and ultralow-power VMM blocks to perform resource-intensive computations.
Edit intent: clarity
Original:  To this end, in this work, for the first time, we propose a time-domain mixed-signal VMM exploiting a modified configuration of 1 MOSFET-1 RRAM (1T-1R) array which overcomes the energy inefficiency of the current-mode VMM approaches based on RRAMs. In the proposed approach, the inputs and outputs are encoded in the digital domain as the duration of the pulses while the weights are realized as programmable current sinks utilizing the modified 1T-1R blocks in the analog domain.
Revised:  To this end, in this work, for the first time, we propose a time-domain mixed-signal VMM exploiting a modified configuration of 1MOSFET-1RRAM (1T-1R) array which overcomes the energy inefficiency of the current-mode VMM approaches based on RRAMs. In the proposed approach, the inputs and outputs are encoded in the digital domain as the duration of the pulses while the weights are realized as programmable current sinks utilizing the modified 1T-1R blocks in the analog domain.
Edit intent: fluency
Original:  To this end, in this work, for the first time, we propose a time-domain mixed-signal VMM exploiting a modified configuration of 1 MOSFET-1 RRAM (1T-1R) array which overcomes the energy inefficiency of the current-mode VMM approaches based on RRAMs. In the proposed approach, the inputs and outputs are encoded in the digital domain as the duration of the pulses while the weights are realized as programmable current sinks utilizing the modified 1T-1R blocks in the analog domain.
Revised:  To this end, in this work, for the first time, we propose a time-domain mixed-signal VMM exploiting a modified configuration of 1 MOSFET-1 RRAM (1T-1R) array . The proposed VMM overcomes the energy inefficiency of the current-mode VMM approaches based on RRAMs. In the proposed approach, the inputs and outputs are encoded in the digital domain as the duration of the pulses while the weights are realized as programmable current sinks utilizing the modified 1T-1R blocks in the analog domain.
Edit intent: coherence
Original:  We show that there exists a trade-off between the compute precision, dynamic range and the area and energy efficiency of the proposed VMM implementation .
Revised:  We show that there exists a trade-off between the computational precision, dynamic range and the area and energy efficiency of the proposed VMM implementation .
Edit intent: fluency
Original:  We show that there exists a trade-off between the compute precision, dynamic range and the area and energy efficiency of the proposed VMM implementation .
Revised:  We show that there exists a trade-off between the compute precision, dynamic range , and the area- and energy-efficiency of the proposed VMM implementation .
Edit intent: fluency
Original:  We show that there exists a trade-off between the compute precision, dynamic range and the area and energy efficiency of the proposed VMM implementation .
Revised:  We show that there exists a trade-off between the compute precision, dynamic range and the area and energy efficiency of the proposed VMM approach .
Edit intent: clarity
Original:  Therefore, we also provide the necessary design guidelines for optimizing the performance.
Revised:  Therefore, we provide the necessary design guidelines for optimizing the performance.
Edit intent: coherence
Original:  The preliminary results show that an effective compute precision of 6-bits is achievable owing to the inherent compensation effect . A 4-bit 200x200 VMM utilizing the proposed approach exhibits a significantly high energy efficiency of ~1.5 POps/J and a throughput of 2.5 TOps/s while considering the contribution due to the input/output (I/O) circuitry.
Revised:  Our preliminary results show that an effective compute precision of 6-bits is achievable owing to the inherent compensation effect . A 4-bit 200x200 VMM utilizing the proposed approach exhibits a significantly high energy efficiency of ~1.5 POps/J and a throughput of 2.5 TOps/s while considering the contribution due to the input/output (I/O) circuitry.
Edit intent: fluency
Original:  The preliminary results show that an effective compute precision of 6-bits is achievable owing to the inherent compensation effect . A 4-bit 200x200 VMM utilizing the proposed approach exhibits a significantly high energy efficiency of ~1.5 POps/J and a throughput of 2.5 TOps/s while considering the contribution due to the input/output (I/O) circuitry.
Revised:  The preliminary results show that an effective computational precision of 6-bits is achievable owing to the inherent compensation effect . A 4-bit 200x200 VMM utilizing the proposed approach exhibits a significantly high energy efficiency of ~1.5 POps/J and a throughput of 2.5 TOps/s while considering the contribution due to the input/output (I/O) circuitry.
Edit intent: fluency