wanyu/IteraTeR_v2 huggingface dataset:
Original:  In a nutshell, using our API the input is viewed as partially ordered, and the program consists of a set of parallelization constructs which are applied to decompose the partial order and process events independently.
Revised:  In the proposed model, the input is viewed as partially ordered, and the program consists of a set of parallelization constructs which are applied to decompose the partial order and process events independently.
Edit intent: clarity
Original:  Our API maps to an execution model called synchronization plans which supports synchronization between parallel nodes.
Revised:  Our API maps to an execution model called *synchronization plans* which supports synchronization between parallel nodes.
Edit intent: fluency
Original:  Our evaluation shows that APIs offered by two widely used systems ( Flink and Timely Dataflow ) cannot suitably expose parallelism in some representative applications.
Revised:  Our evaluation shows that APIs offered by two widely used systems -- Flink and Timely Dataflow ) cannot suitably expose parallelism in some representative applications.
Edit intent: fluency
Original:  Our evaluation shows that APIs offered by two widely used systems ( Flink and Timely Dataflow ) cannot suitably expose parallelism in some representative applications.
Revised:  Our evaluation shows that APIs offered by two widely used systems ( Flink and Timely Dataflow -- cannot suitably expose parallelism in some representative applications.
Edit intent: fluency
Original:  In contrast, DGS enables implementations which scale automatically , the resulting synchronization plans offer throughput improvements when implemented  in existing systems, and the programming overhead is small compared to writing sequential code.
Revised:  In contrast, DGS enables implementations with scalable performance , the resulting synchronization plans offer throughput improvements when implemented in existing systems, and the programming overhead is small compared to writing sequential code.
Edit intent: clarity
Original: Securing a safe-driving circumstance for connected and autonomous vehicles (CAVs) continues to be a widespread concern despite various sophisticated functions delivered by artificial intelligence for in-vehicle devices.
Revised: Securing safe-driving circumstance for connected and autonomous vehicles (CAVs) continues to be a widespread concern despite various sophisticated functions delivered by artificial intelligence for in-vehicle devices.
Edit intent: fluency
Original: Securing a safe-driving circumstance for connected and autonomous vehicles (CAVs) continues to be a widespread concern despite various sophisticated functions delivered by artificial intelligence for in-vehicle devices.
Revised: Securing a safe-driving for connected and autonomous vehicles (CAVs) continues to be a widespread concern despite various sophisticated functions delivered by artificial intelligence for in-vehicle devices.
Edit intent: clarity
Original:  Combined with another fact that CAVs are now limited in handling intensive computation tasks , it thus renders a pressing demand of designing an efficient assessment system to guarantee autonomous driving safety without compromising data security.
Revised:  Combined with the fact that the capability of existing CAVs in handling intensive computation tasks , it thus renders a pressing demand of designing an efficient assessment system to guarantee autonomous driving safety without compromising data security.
Edit intent: clarity
Original:  Combined with another fact that CAVs are now limited in handling intensive computation tasks , it thus renders a pressing demand of designing an efficient assessment system to guarantee autonomous driving safety without compromising data security.
Revised:  Combined with another fact that CAVs are now limited in handling intensive computation tasks is limited, this implies a need for designing an efficient assessment system to guarantee autonomous driving safety without compromising data security.
Edit intent: clarity
Original:  Specifically, a promising solution of exploiting a long short-term memory algorithm is first introduced in detail for an intElligent Safe-driving assessmenT (EST) scheme.
Revised:  Specifically, a promising solution that exploits a long short-term memory algorithm is first introduced in detail for an intElligent Safe-driving assessmenT (EST) scheme.
Edit intent: clarity
Original:  Moreover, several challenges and discussions regarding the future research of this BEST architecture are presented .
Revised:  Simulation results demonstrate that our presented BEST gains better data credibility with a higher prediction accuracy for vehicular safety assessment when compared with existing schemes. Finally, we discuss several open challenges that need to be addressed in future CAV networks .
Edit intent: clarity
Original: In this paper  we present a novel approach to the Audio-visual video parsing task that takes into cognizance how event categories bind to audio and visual modalities.
Revised: In this paper , we present a novel approach to the Audio-visual video parsing task that takes into cognizance how event categories bind to audio and visual modalities.
Edit intent: fluency
Original: In this paper  we present a novel approach to the Audio-visual video parsing task that takes into cognizance how event categories bind to audio and visual modalities.
Revised: In this paper we present a novel approach to the audio-visual video parsing (AVVP) task that demarcates events from a video separately for audio and visual modalities.
Edit intent: clarity
Original:  This task can be naturally formulated as a Multimodal Multiple Instance Learning (MMIL) problem.
Edit intent: coherence
Original:  We show how the MMIL task can benefit from the following techniques geared toward self and cross modal learning: (i) self-supervised pre-training based on highly aligned task audio-video grounding, (ii) global context aware attention and  (iii) adversarial training.
Revised:  We show how the MMIL task can benefit from the following techniques geared towards effective cross-modal learning: (i) self-supervised pre-training based on highly aligned task audio-video grounding, (ii) global context aware attention and (iii) adversarial training.
Edit intent: clarity
Original:  We show how the MMIL task can benefit from the following techniques geared toward self and cross modal learning: (i) self-supervised pre-training based on highly aligned task audio-video grounding, (ii) global context aware attention and  (iii) adversarial training.
Revised:  We show how the MMIL task can benefit from the following techniques geared toward self and cross modal learning: (i) self-supervised pre-training based on highly aligned task audio-video grounding, (ii) global context aware attention and , (iii) adversarial training.
Edit intent: fluency
Original:  As for pre-training, we boostrap on the Uniter (style) \% transformer architecture using a self-supervised objective audio-video grounding over the relatively large AudioSet dataset.
Revised:  As for pre-training, we boostrap on the Uniter (style) \% self-supervised objective audio-video grounding over the relatively large AudioSet dataset.
Edit intent: clarity
Original:  As for pre-training, we boostrap on the Uniter (style) \% transformer architecture using a self-supervised objective audio-video grounding over the relatively large AudioSet dataset.
Revised:  As for pre-training, we boostrap on the Uniter (style) \% transformer architecture using a self-supervised pretraining using an audio-video grounding over the relatively large AudioSet dataset.
Edit intent: clarity
Original:  We present extensive experimental evaluations on the Look, Listen, and Parse (LLP) dataset and compare it against HAN . We also present several ablation tests to validate the effect of pre-training, attention and adversarial training.
Revised:  We present extensive experimental evaluations on the Look, Listen, and Parse (LLP) dataset and compare it against HAN . We also present several ablations to validate the effect of pre-training, attention and adversarial training.
Edit intent: clarity
Original:  We present extensive experimental evaluations on the Look, Listen, and Parse (LLP) dataset and compare it against HAN . We also present several ablation tests to validate the effect of pre-training, attention and adversarial training.
Revised:  We present extensive experimental evaluations on the Look, Listen, and Parse (LLP) dataset and compare it against HAN . We also present several ablation tests to validate the effect of pretraining, global attention and adversarial training.
Edit intent: clarity
Original: We focus on the problem of developing  efficient controllers for quadrupedal robots.
Revised: We focus on the problem of developing energy efficient controllers for quadrupedal robots.
Edit intent: clarity
Original: In this paper, we extend a dual-mixed formulation for a nonlinear generalized Stokes problem to a Huber regularization of the Herschel-Bulkey flowproblem.
Revised: In this paper, we propose a dual-mixed formulation for a nonlinear generalized Stokes problem to a Huber regularization of the Herschel-Bulkey flowproblem.
Edit intent: clarity
Original:  The present approach is based on a  two-fold saddle point nonlinear operator equation for the corresponding weak formulation.
Revised:  The present approach is based on a two-fold saddle point nonlinear operator equation for the resulting weak formulation.
Edit intent: clarity
Original:  The discretization scheme yields a system of Newton differentiable nonlinear equations, for which a semismooth Newton algorithm is proposed and implemented.
Revised:  The discretization scheme yields a system of slantly differentiable nonlinear equations, for which a semismooth Newton algorithm is proposed and implemented.
Edit intent: fluency
Original:  Part of this technology ships as an Auto-Tag feature in\textsc{Microsoft Azure Purview .
Revised:  Part of this technology ships as an Auto-Tag \textsc{Microsoft Azure Purview .
Edit intent: clarity
Original:  Part of this technology ships as an Auto-Tag feature in\textsc{Microsoft Azure Purview .
Revised:  Part of this technology ships as an Auto-Tag feature in\textsc{Auto-Tag feature in Microsoft Azure Purview .
Edit intent: fluency
Original: Continuous integrate-and-fire (CIF) based models, which use a soft and monotonic alignment mechanism, have been well applied in non-autoregressive (NAR) speech recognition and achieved competitive performance compared with other NAR methods.
Revised: Continuous integrate-and-fire (CIF) based models, which use a soft and monotonic alignment mechanism, have been well applied in non-autoregressive (NAR) speech recognition with competitive performance compared with other NAR methods.
Edit intent: coherence
Original:  However, such an alignment learning strategy may also result in inaccurate acoustic boundary estimation and deceleration in convergence speed .
Revised:  However, such an alignment learning strategy may suffer from an erroneous acoustic boundary estimation and deceleration in convergence speed .
Edit intent: clarity
Original:  Specifically, we use the CTC spike information to guide the leaning of acoustic boundary and adopt a new contextual decoder to capture the linguistic dependencies within a sentence in the conventional CIF model.
Revised:  Specifically, we use the CTC spike information to guide the learning of acoustic boundaries in the CIF. Besides, an additional contextual decoder is introduced behind the CIF decoder, aiming to capture the linguistic dependencies within a sentence in the conventional CIF model.
Edit intent: coherence
Original:  Besides, a recently proposed Conformer architecture is also employed to model both local and global acoustic dependencies . Experiments on the open-source Mandarin corpora AISHELL-1  show that the proposed method achieves a comparable character error rate (CER ) of 4.9\% with only 1/24 latency compared with a state-of-the-art autoregressive (AR) Conformer model  .
Revised:  Besides, a recently proposed Conformer architecture to improve the capacity of acoustic modeling . Experiments on the open-source Mandarin corpora AISHELL-1 show that the proposed method achieves a comparable character error rate (CER ) of 4.9\% with only 1/24 latency compared with a state-of-the-art autoregressive (AR) Conformer model .
Edit intent: clarity
Original:  Besides, a recently proposed Conformer architecture is also employed to model both local and global acoustic dependencies . Experiments on the open-source Mandarin corpora AISHELL-1  show that the proposed method achieves a comparable character error rate (CER ) of 4.9\% with only 1/24 latency compared with a state-of-the-art autoregressive (AR) Conformer model  .
Revised:  Besides, a recently proposed Conformer architecture is also employed to model both local and global acoustic dependencies . Experiments on the open-source Mandarin AISHELL-1 show that the proposed method achieves a comparable character error rate (CER ) of 4.9\% with only 1/24 latency compared with a state-of-the-art autoregressive (AR) Conformer model .
Edit intent: clarity
Original:  Besides, a recently proposed Conformer architecture is also employed to model both local and global acoustic dependencies . Experiments on the open-source Mandarin corpora AISHELL-1  show that the proposed method achieves a comparable character error rate (CER ) of 4.9\% with only 1/24 latency compared with a state-of-the-art autoregressive (AR) Conformer model  .
Revised:  Besides, a recently proposed Conformer architecture is also employed to model both local and global acoustic dependencies . Experiments on the open-source Mandarin corpora AISHELL-1 corpus show that the proposed method achieves a comparable character error rate (CER ) of 4.9\% with only 1/24 latency compared with a state-of-the-art autoregressive (AR) Conformer model .
Edit intent: clarity
Original:  Besides, a recently proposed Conformer architecture is also employed to model both local and global acoustic dependencies . Experiments on the open-source Mandarin corpora AISHELL-1  show that the proposed method achieves a comparable character error rate (CER ) of 4.9\% with only 1/24 latency compared with a state-of-the-art autoregressive (AR) Conformer model  .
Revised:  Besides, a recently proposed Conformer architecture is also employed to model both local and global acoustic dependencies . Experiments on the open-source Mandarin corpora AISHELL-1 show that the proposed method achieves a comparable character error rates (CERs ) of 4.9\% with only 1/24 latency compared with a state-of-the-art autoregressive (AR) Conformer model .
Edit intent: clarity
Original:  Using classical proof complexity results about reflection principles we prove that a time-optimal proof search algorithm exists w.r.t. all proof systems iff a p-optimal proof system exists.
Revised:  Using classical proof complexity results about reflection principles we prove that a time-optimal proof search algorithm exists without restricting proof systems iff a p-optimal proof system exists.
Edit intent: clarity
Original:  We isolate and motivate the problem to establish %DIFDELCMD < {\em %%% unconditional super-logarithmic lower bounds for i_P(\tau) where no super-polynomial size lower bounds are known.
Revised:  We isolate and motivate the problem to establish %DIFDELCMD < {\em %%% unconditional super-logarithmic lower bounds for i_P(\tau) where no super-polynomial size lower bounds are known.
Edit intent: fluency
Original:  \%From the information in a computed embedding, an implementation can be generated.
Edit intent: coherence
Original: The success of Deep Artificial Neural Networks (DNNs) in many domains created a rich body of research concerned with hardware accelerators for compute-intensive DNN operators.
Revised: The success of Deep Artificial Neural Networks (DNNs) in many domains created a rich body of research concerned with hardwareaccelerators for compute-intensive DNN operators.
Edit intent: fluency
Original:  Solving this task often requires complex program and memory layout transformations .
Revised:  Solving this task often requires joint program and data layouttransformations .
Edit intent: clarity
Original:  We have created a bottom-up method that allows the direct generation of implementations based on an accelerator's instruction set .
Revised:  We created a bottom-up method that allows the direct generation of implementations based on an accelerator's instruction set .
Edit intent: coherence
Original:  By formulating the embedding as a constraint satisfaction problem over the scalar dataflow, every possible embedding solution is contained in the search space.
Revised:  By formulating the embedding as a constraint satisfaction problemover the scalar dataflow, every possible embedding solution is contained in the search space.
Edit intent: fluency
Original: The success of Deep Artificial Neural Networks (DNNs) in many domains created a rich body of research concerned with hardwareaccelerators for compute-intensive DNN operators.
Revised: The success of Deep Artificial Neural Networks (DNNs) in many domains created a rich body of research concerned with hardware accelerators for compute-intensive DNN operators.
Edit intent: fluency
Original:  However, implementing such operators efficiently with complex hardwareintrinsics such as matrix multiply is a task not yet automated gracefully.
Revised:  However, implementing such operators efficiently with complex hardware intrinsics such as matrix multiply is a task not yet automated gracefully.
Edit intent: fluency
Original:  Solving this task often requires joint program and data layouttransformations .
Revised:  Solving this task often requires joint program and data layout transformations .
Edit intent: fluency
Original:  First solutions to this problem have been proposed, such as TVM, UNIT or ISAMIR, which work on a loop-levelrepresentation of operators and specify data layout and possible program transformations before the embedding into the operator isperformed .
Revised:  First solutions to this problem have been proposed, such as TVM, UNIT or ISAMIR, which work on a loop-level representation of operators and specify data layout and possible program transformations before the embedding into the operator isperformed .
Edit intent: fluency
Original:  First solutions to this problem have been proposed, such as TVM, UNIT or ISAMIR, which work on a loop-levelrepresentation of operators and specify data layout and possible program transformations before the embedding into the operator isperformed .
Revised:  First solutions to this problem have been proposed, such as TVM, UNIT or ISAMIR, which work on a loop-levelrepresentation of operators and specify data layout and possible program transformations before the embedding into the operator is performed .
Edit intent: fluency
Original:  This top-down approach creates a tension between exploration range and search space complexity, especially when alsoexploring data layout transformations such as im2col, channel packing or padding.
Revised:  This top-down approach creates a tension between exploration range and search space complexity, especially when also exploring data layout transformations such as im2col, channel packing or padding.
Edit intent: fluency
Original:  We created a bottom-up method that allows the joint transformation ofboth compuation and data layout based on the found embedding.
Revised:  We created a bottom-up method that allows the joint transformation of both compuation and data layout based on the found embedding.
Edit intent: fluency
Original:  By formulating the embedding as a constraint satisfaction problemover the scalar dataflow, every possible embedding solution is contained in the search space.
Revised:  By formulating the embedding as a constraint satisfaction problem over the scalar dataflow, every possible embedding solution is contained in the search space.
Edit intent: fluency
Original:  Adding additional constraints andoptmization targets to the solver generates the subset of preferable solutions.
Revised:  Adding additional constraints and optmization targets to the solver generates the subset of preferable solutions.
Edit intent: fluency
Original:  An evaluation using the VTA hardware accelerator with the Baidu DeepBench inference benchmark shows that our approach canautomatically generate code competitive to reference implementations.
Revised:  An evaluation using the VTA hardware accelerator with the Baidu DeepBench inference benchmark shows that our approach can automatically generate code competitive to reference implementations.
Edit intent: fluency
Original:  Further, we show that dynamically determining the data layoutbased on intrinsic and workload is beneficial for hardware utilization and performance.
Revised:  Further, we show that dynamically determining the data layout based on intrinsic and workload is beneficial for hardware utilization and performance.
Edit intent: fluency
Original:  In cases where the reference implementationhas low hardware utilization due to its fixed deployment strategy, we achieve a geomean speedup of up to x2.813, while individualoperators can improve as much as x170.
Revised:  In cases where the reference implementation has low hardware utilization due to its fixed deployment strategy, we achieve a geomean speedup of up to x2.813, while individualoperators can improve as much as x170.
Edit intent: fluency
Original:  In cases where the reference implementationhas low hardware utilization due to its fixed deployment strategy, we achieve a geomean speedup of up to x2.813, while individualoperators can improve as much as x170.
Revised:  In cases where the reference implementationhas low hardware utilization due to its fixed deployment strategy, we achieve a geomean speedup of up to x2.813, while individual operators can improve as much as x170.
Edit intent: fluency
Original: We study the shape reconstruction of a dielectric inclusion from the faraway measurement of the associated electric field.
Revised: We study the shape reconstruction of an inclusion from the faraway measurement of the associated electric field.
Edit intent: clarity
Original: We study the shape reconstruction of a dielectric inclusion from the faraway measurement of the associated electric field.
Revised: We study the shape reconstruction of a dielectric inclusion from the faraway measurement of the associated electric field.
Edit intent: fluency
Original:  By incorporating Drude's model of the dielectric parameter, we propose a novel reconstruction scheme by using the plasmon resonance with a significantly enhanced resonant field.
Revised:  By incorporating Drude's model of the permittivity parameter, we propose a novel reconstruction scheme by using the plasmon resonance with a significantly enhanced resonant field.
Edit intent: clarity
Original:  Indeed, such solvers can be highly tailored to the given problem structure and to the hardware platform on which the problem will be solved.
Revised:  Moreover, in order to achieve high-performance, such solvers must often be adapted to the given problem structure and to the hardware platform on which the problem will be solved.
Edit intent: clarity
Original:  However, whether such tailored solvers will converge to a solution is unclear.
Revised:  Unfortunately, determining whether such adapted solvers will converge to a solution is unclear.
Edit intent: clarity
Original:  Our objective is to sequentially select a group of items to maximize the expected utility subject to a knapsack constraint .
Revised:  Our objective is to sequentially select a group of items to maximize the expected utility .
Edit intent: clarity
Original:  We fill this gap by proposing the first constant approximation solution.
Revised:  It fact, it has only been settled given the additional assumption of pointwise submodularity. In this paper, we remove the common assumption on pointwise submodularity and propose the first constant approximation solution.
Edit intent: coherence