wanyu/IteraTeR_v2 huggingface dataset:
Original:  Hyperproperties can express several specifications of interest for cyber-physical systems, such as opacity, robustness, and noninterference, which cannot be expressed using linear time properties.
Revised:  Hyperproperties can express several specifications of interest for cyber-physical systems, such as opacity, robustness, and noninterference, which cannot be expressed using linear-time properties.
Edit intent: fluency
Original:  This paper presents  a discretization-free approach for the formal verification of discrete-time control systems against hyperproperties.
Revised:  This paper presents for the first time a discretization-free approach for the formal verification of discrete-time control systems against hyperproperties.
Edit intent: clarity
Original:  The proposed approach involves decomposition of complex hyperproperties into several verification conditions by exploiting the automata-based structure corresponding to the complement of the original specifications.
Revised:  The proposed approach involves decomposition of complex hyperproperties into several verification conditions by exploiting the automata-based structures corresponding to the complement of the original specifications.
Edit intent: fluency
Original:  The proposed approach involves decomposition of complex hyperproperties into several verification conditions by exploiting the automata-based structure corresponding to the complement of the original specifications.
Revised:  The proposed approach involves decomposition of complex hyperproperties into several verification conditions by exploiting the automata-based structure corresponding to the complements of the original specifications.
Edit intent: fluency
Original:  These verification conditions are then discharged by synthesizing the augmented barrier certificates, which provide certain safety guarantees for the underlying system.
Revised:  These verification conditions are then discharged by synthesizing so-called augmented barrier certificates, which provide certain safety guarantees for the underlying system.
Edit intent: clarity
Original:  For systems with polynomial dynamics, we present a sound procedure to synthesize polynomial-type augmented barrier certificates by reducing the problem to sum-of-squares optimizations.
Revised:  For systems with polynomial-type dynamics, we present a sound procedure to synthesize polynomial-type augmented barrier certificates by reducing the problem to sum-of-squares optimizations.
Edit intent: fluency
Original:  We demonstrate the effectiveness of the proposed approach on two physical case-studies concerning two important hyperproperties: initial-state opacity and initial-state robustness.
Revised:  We demonstrate the effectiveness of our proposed approaches on two physical case-studies concerning two important hyperproperties: initial-state opacity and initial-state robustness.
Edit intent: fluency
Original:  We demonstrate the effectiveness of the proposed approach on two physical case-studies concerning two important hyperproperties: initial-state opacity and initial-state robustness.
Revised:  We demonstrate the effectiveness of the proposed approach on two physical case studies against two important hyperproperties: initial-state opacity and initial-state robustness.
Edit intent: clarity
Original:  An analog statement for general ( non-%DIFDELCMD < \LCL%%%  ) problems is known to be false.
Revised:  An analog statement for general ( %DIFDELCMD < \LCL%%% ) problems is known to be false.
Edit intent: clarity
Original:  At the cost of loosing the full algorithm's simplicity we also provide a O(k\Delta)-coloring algorithm in O(\Delta/k)+\log^* n rounds.
Revised:  At the cost of losing the full algorithm's simplicity we also provide a O(k\Delta)-coloring algorithm in O(\Delta/k)+\log^* n rounds.
Edit intent: fluency
Original:  We find that the different evaluation metrics can give inconsistent results.
Revised:  We find that different evaluation regimes can give inconsistent results.
Edit intent: clarity
Original:  In particular, we find that the use of minimal pairs of phoneme triples as stimuli during evaluation disadvantages larger embeddings , unlike metrics applied to complete utterances  .
Revised:  In particular, we find that the use of minimal pairs of phoneme triples as stimuli disadvantages larger discrete unit inventories , unlike metrics applied to complete utterances .
Edit intent: clarity
Original: This paper introduce StutterNet, a novel deep learning based stuttering detection capable of detecting and identifying various types of disfluencies.
Revised: This paper introduces StutterNet, a novel deep learning based stuttering detection capable of detecting and identifying various types of disfluencies.
Edit intent: fluency
Original:  However, prior arts on graph representation learning heavily rely on the labeling information.
Revised:  However, prior arts on graph representation learning heavily rely on labeling information.
Edit intent: fluency
Original: Explicitly modelling field interactions and correlations in complex documents structures has recently gained popularity in neural document embedding and retrieval tasks.
Revised: Explicitly modelling field interactions and correlations in complex document structures has recently gained popularity in neural document embedding and retrieval tasks.
Edit intent: fluency
Original: We study (coalitional) exchange stability, which Alcalde [ Review of Economic Design, 1995] introduced as an alternative solution concept for matching markets involving property rights, such as assigning persons to two-bed rooms.
Revised: We study (coalitional) exchange stability, which Alcalde [ Economic Design, 1995] introduced as an alternative solution concept for matching markets involving property rights, such as assigning persons to two-bed rooms.
Edit intent: clarity
Original:  For example, we find  ASR encoders lack the global context representation, which is necessary for translation, whereas MT encoders are not designed to deal with long but locally attentive acoustic sequences.
Revised:  For example, we find that ASR encoders lack the global context representation, which is necessary for translation, whereas MT encoders are not designed to deal with long but locally attentive acoustic sequences.
Edit intent: fluency
Original:  Also, we develop an adaptor module to alleviate the representation inconsistency between the pre-trained ASR encoder and MT encoder, and  a multi-teacher knowledge distillation method to preserve the pre-training knowledge.
Revised:  Also, we develop an adaptor module to alleviate the representation inconsistency between the pre-trained ASR encoder and MT encoder, and develop a multi-teacher knowledge distillation method to preserve the pre-training knowledge.
Edit intent: fluency
Original:  Experimental results on the LibriSpeech En-Fr and MuST-C En-De  show that our method achieves the state-of-the-art performance of 18.3 and 25.2 BLEU points .
Revised:  Experimental results on the LibriSpeech En-Fr and MuST-C En-De show that our method achieves state-of-the-art performance of 18.3 and 25.2 BLEU points .
Edit intent: fluency
Original:  Experimental results on the LibriSpeech En-Fr and MuST-C En-De  show that our method achieves the state-of-the-art performance of 18.3 and 25.2 BLEU points .
Revised:  Experimental results on the LibriSpeech En-Fr and MuST-C En-De show that our method achieves the state-of-the-art BLEU scores of 18.3 and 25.2 BLEU points .
Edit intent: clarity
Original:  Experimental results on the LibriSpeech En-Fr and MuST-C En-De  show that our method achieves the state-of-the-art performance of 18.3 and 25.2 BLEU points .
Revised:  Experimental results on the LibriSpeech En-Fr and MuST-C En-De show that our method achieves the state-of-the-art performance of 18.3 and 25.2 .
Edit intent: clarity
Original:  Previous work provides a class of shapes for which constructibility can be decided efficiently, when particles move maximally into the same direction on actuation .
Revised:  Previous work provides a class of shapes for which constructibility can be decided efficiently, when particles move maximally into the same direction induced by a global signal .
Edit intent: clarity
Original:  We further present linear-time algorithms to decide whether  a tree-shape in 2D or 3D is constructible.
Revised:  We further present linear-time algorithms to decide whether or not a tree-shape in 2D or 3D is constructible.
Edit intent: coherence
Original:  If scaling is allowed, we show that the c-scaled copy of every non-degenerate polyomino is constructible , for every c \geq 2.
Revised:  Scaling a shape yields constructibility; in particular we show that the c-scaled copy of every non-degenerate polyomino is constructible , for every c \geq 2.
Edit intent: clarity
Original:  We explore a wide variety of tradeoffs in the complexity of formal frameworks, the performance of defense tools, and the resulting security guarantees.
Revised:  We explore a wide variety of tradeoffs in the expressiveness of formal frameworks, the performance of defense tools, and the resulting security guarantees.
Edit intent: clarity
Original:  We explore a wide variety of tradeoffs in the complexity of formal frameworks, the performance of defense tools, and the resulting security guarantees.
Revised:  We explore a wide variety of tradeoffs in the complexity of formal frameworks, the complexity of defense tools, and the resulting security guarantees.
Edit intent: clarity
Original: While cycle-accurate simulators are essential tools for architecture research, design, and development, their practicality is limited by an extremely long time-to-solution for realistic problems under investigation.
Revised: While cycle-accurate simulators are essential tools for architecture research, design, and development, their practicality is limited by an extremely long time-to-solution for realistic applications under investigation.
Edit intent: clarity
Original:  First, an ML-based instruction latency prediction framework that accounts for both static instruction /architecture properties and dynamic execution context is constructed.
Revised:  First, an ML-based instruction latency prediction framework that accounts for both static instruction properties and dynamic execution context is constructed.
Edit intent: clarity
Original:  First, an ML-based instruction latency prediction framework that accounts for both static instruction /architecture properties and dynamic execution context is constructed.
Revised:  First, an ML-based instruction latency prediction framework that accounts for both static instruction /architecture properties and dynamic processor states is constructed.
Edit intent: clarity
Original:  Prototypical areas of interest include linear heat transfer and linear structural dynamics problems modeled with linear partial differential equations (PDEs).
Revised:  Prototypical areas of interest include linear heat transfer and linear structural dynamics problems modeled with partial differential equations (PDEs).
Edit intent: fluency
Original:  Assuming a set of initial states and input states , the proposed method consists in the construction of a union of sets (flowpipe) that enclose the infinite number of solutions of the spatially discretized PDE.
Revised:  Assuming a set of initial states and inputs , the proposed method consists in the construction of a union of sets (flowpipe) that enclose the infinite number of solutions of the spatially discretized PDE.
Edit intent: clarity
Original:  We present the numerical results obtained in four examples to illustrate the capabilities of the approach, and draw some comparisons with respect to reference numerical integration methods.
Revised:  We present the numerical results obtained in four examples to illustrate the capabilities of our approach, and draw some comparisons with respect to reference numerical integration methods.
Edit intent: fluency
Original:  We present the numerical results obtained in four examples to illustrate the capabilities of the approach, and draw some comparisons with respect to reference numerical integration methods.
Revised:  We present the numerical results obtained in four examples to illustrate the capabilities of the approach, and compare its performance against reference numerical integration methods.
Edit intent: clarity
Original:  Even though these future computers will be incredibly powerful, if they are based on von Neumann type architectures, they will consume between 20 and 30 megawatts of power and will not have intrinsic physically built-in capabilities to learn or deal with complex and unstructured data as our brain does.
Revised:  Even though these future computers will be incredibly powerful, if they are based on von Neumann type architectures, they will consume between 20 and 30 megawatts of power and will not have intrinsic physically built-in capabilities to learn or deal with complex data as our brain does.
Edit intent: clarity
Original:  By taking inspiration from biology, new generation computers could have much lower power consumption than conventional processors , could exploit integrated non-volatile memory and logic, and could be explicitly designed to support dynamic learning in the context of complex and unstructured data .
Revised:  By taking inspiration from biology, new generation computers could have much lower power consumption than conventional processors .
Edit intent: coherence
Original:  On the other hand, sized types enable termination checking of functional programs with complex patterns of recursion in the presence of mixed inductive and coinductive types.
Revised:  On the other hand, sized types enable termination checking of programs with complex patterns of recursion in the presence of mixed inductive and coinductive types.
Edit intent: clarity
Original:  On the other hand, sized types enable termination checking of functional programs with complex patterns of recursion in the presence of mixed inductive and coinductive types.
Revised:  On the other hand, sized types enable termination checking of functional programs with complex patterns of recursion in the presence of mixed inductive-coinductive types.
Edit intent: fluency
Original:  In particular, we extend a core language for persistent shared memory concurrency based on the semi-axiomatic sequent calculus with recursive types and arithmetic refinements to express size indexing.
Revised:  We extend the semi-axiomatic sequent calculus with recursive types and arithmetic refinements to express size indexing.
Edit intent: coherence
Original:  We  demonstrate that, under certain  conditions, FCSA codes are within a factor of 2 optimal when it comes to straggler resilience and simulations demonstrate that our codes achieve even better optimality gaps in practice.
Revised:  We demonstrate that, under certain conditions, FCSA codes are within a factor of two of the optimal solution when it comes to straggler resilience and simulations demonstrate that our codes achieve even better optimality gaps in practice.
Edit intent: clarity
Original:  We  demonstrate that, under certain  conditions, FCSA codes are within a factor of 2 optimal when it comes to straggler resilience and simulations demonstrate that our codes achieve even better optimality gaps in practice.
Revised:  We demonstrate that, under certain conditions, FCSA codes are within a factor of 2 optimal when it comes to straggler resilience ; our simulations demonstrate that our codes achieve even better optimality gaps in practice.
Edit intent: coherence
Original:  In this work we improve the original Ozarov-Wyner-Ziv (OWZ) lower bound on capacity by introducing a new achievability scheme with two advantages over the studied OWZ scheme which is based on peak-power constrained pulse-amplitude modulation.
Revised:  In this work we improve the original Ozarov-Wyner-Ziv (OWZ) lower bound on capacity by introducing new achievability schemes with two advantages over the studied OWZ scheme which is based on peak-power constrained pulse-amplitude modulation.
Edit intent: fluency
Original:  Our scheme achieves a moderately improved information rate and it does so with much less sign transitions of the binary signal.
Revised:  Our schemes achieve a moderately improved information rate and it does so with much less sign transitions of the binary signal.
Edit intent: fluency
Original:  Our scheme achieves a moderately improved information rate and it does so with much less sign transitions of the binary signal.
Revised:  Our scheme achieves a moderately improved information rate and do so with much less sign transitions of the binary signal.
Edit intent: clarity
Original: Rate-Splitting Multiple Access (RSMA) is an emerging flexible and powerful multiple access for downlink multi-antenna networks.
Revised: Rate-Splitting Multiple Access (RSMA) is an emerging flexible and powerful multiple access for downlink multiantenna networks.
Edit intent: fluency
Original:  We design optimal linear precoders that maximize the Weighted Sum Rate (WSR) with Finite Blocklength (FBL) constraints.
Revised:  We design optimal linear precoders that maximize the sum rate with Finite Blocklength (FBL) constraints.
Edit intent: clarity
Original:  The relations between the WSR and blocklength of RSMA are investigated for a wide range of network loads and user deployments.
Revised:  The relations between the sum rate and blocklength of RSMA are investigated for a wide range of network loads and user deployments.
Edit intent: clarity
Original:  This kind of " selfish learning , " however, entails the risk of getting trapped in equilibria that are detrimental to everyone.
Revised:  This kind of " selfish " however, entails the risk of getting trapped in equilibria that are detrimental to everyone.
Edit intent: clarity
Original:  Based on these observations, we explore the dynamics that arise when the two learning rules themselves are subject to evolution.
Revised:  Based on these observations, we explore the dynamics that arises when learning rules themselves are subject to evolution.
Edit intent: clarity
Original:  The analysis shows that the Slovenian tweetosphere is dominated by politics, that the left-wing communities are larger, but that the right-wing communities and users exhibit significantly higher impact.
Revised:  The analysis shows that the Slovenian tweetosphere is dominated by politics, that the left-leaning communities are larger, but that the right-wing communities and users exhibit significantly higher impact.
Edit intent: fluency
Original:  The analysis shows that the Slovenian tweetosphere is dominated by politics, that the left-wing communities are larger, but that the right-wing communities and users exhibit significantly higher impact.
Revised:  The analysis shows that the Slovenian tweetosphere is dominated by politics, that the left-wing communities are larger, but that the right-leaning communities and users exhibit significantly higher impact.
Edit intent: fluency
Original:  An interesting observation is that retweet networks change relatively gradually, despite such events as the emergence of the Covid-19 pandemic or a change of government.
Revised:  An interesting observation is that retweet networks change relatively gradually, despite such events as the emergence of the Covid-19 pandemic or the change of government.
Edit intent: fluency
Original: In this paper, a novel intelligent reflecting surface (IRS)-assisted wireless powered communication network (WPCN) architecture is proposed for low-power Internet-of-Things (IoT)  devices, where the IRS is exploited to improve the performance of WPCN under imperfect channel state information (CSI).
Revised: In this paper, a novel intelligent reflecting surface (IRS)-assisted wireless powered communication network (WPCN) architecture is proposed for power-constrained Internet-of-Things (IoT) devices, where the IRS is exploited to improve the performance of WPCN under imperfect channel state information (CSI).
Edit intent: clarity
Original: In this paper, a novel intelligent reflecting surface (IRS)-assisted wireless powered communication network (WPCN) architecture is proposed for low-power Internet-of-Things (IoT)  devices, where the IRS is exploited to improve the performance of WPCN under imperfect channel state information (CSI).
Revised: In this paper, a novel intelligent reflecting surface (IRS)-assisted wireless powered communication network (WPCN) architecture is proposed for low-power Internet-of-Things (IoT) smart devices, where the IRS is exploited to improve the performance of WPCN under imperfect channel state information (CSI).
Edit intent: clarity
Original: In this paper, a novel intelligent reflecting surface (IRS)-assisted wireless powered communication network (WPCN) architecture is proposed for low-power Internet-of-Things (IoT)  devices, where the IRS is exploited to improve the performance of WPCN under imperfect channel state information (CSI).
Revised: In this paper, a novel intelligent reflecting surface (IRS)-assisted wireless powered communication network (WPCN) architecture is proposed for low-power Internet-of-Things (IoT) devices, where IRS is exploited to improve the performance of WPCN under imperfect channel state information (CSI).
Edit intent: clarity
Original:  We formulate a hybrid access point (HAP) transmission energy minimization problem by a joint design of time allocation, HAP energy beamforming, receiving beamforming, user transmit power allocation, IRS energy reflection coefficient and information reflection coefficient under the imperfect CSI and non-linear energy harvesting model.
Revised:  We formulate a hybrid access point (HAP) transmit energy minimization problem by a joint design of time allocation, HAP energy beamforming, receiving beamforming, user transmit power allocation, IRS energy reflection coefficient and information reflection coefficient under the imperfect CSI and non-linear energy harvesting model.
Edit intent: fluency
Original:  We formulate a hybrid access point (HAP) transmission energy minimization problem by a joint design of time allocation, HAP energy beamforming, receiving beamforming, user transmit power allocation, IRS energy reflection coefficient and information reflection coefficient under the imperfect CSI and non-linear energy harvesting model.
Revised:  We formulate a hybrid access point (HAP) transmission energy minimization problem by jointly optimizing time allocation, HAP energy beamforming, receiving beamforming, user transmit power allocation, IRS energy reflection coefficient and information reflection coefficient under the imperfect CSI and non-linear energy harvesting model.
Edit intent: clarity
Original:  Due to the high coupling of optimization variables, this problem is a non-convex optimization problem , which is difficult to solve directly.
Revised:  On account of the high coupling of optimization variables, this problem is a non-convex optimization problem , which is difficult to solve directly.
Edit intent: coherence
Original:  Due to the high coupling of optimization variables, this problem is a non-convex optimization problem , which is difficult to solve directly.
Revised:  Due to the high coupling of optimization variables, the formulated problem is a non-convex optimization problem , which is difficult to solve directly.
Edit intent: clarity
Original:  Due to the high coupling of optimization variables, this problem is a non-convex optimization problem , which is difficult to solve directly.
Revised:  Due to the high coupling of optimization variables, this problem is a non-convex optimization problem that is difficult to solve directly.
Edit intent: fluency
Original:  In order to solve the above-mentioned challenging problems, the alternating optimization (AO)  is applied to decouple the optimization variables to solve the problem.
Revised:  To address the above-mentioned challenging problems, the alternating optimization (AO) is applied to decouple the optimization variables to solve the problem.
Edit intent: coherence