wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this study, we develop a software defined networking (SDN) based in-vehicle networking framework for security against false information attacks on CAN frames .
Revised:  In this study, we develop a software defined networking (SDN) based in-vehicle networking framework for security against false information attacks .
Edit intent: clarity
Original:  We introduce a novel concept of compositional symbolic memory and formally prove its relevant properties.
Revised:  We introduce a novel concept of compositional symbolic memory and its relevant properties.
Edit intent: clarity
Original:  An operator observes a plant through an observation mask that does not allow him to detect the occurrence of certain events (silent events).
Revised:  An operator observes a plant through an observation mask that hides the occurrence of certain events (silent events).
Edit intent: clarity
Original:  The attacker corrupts the observation with the aim of preventing the operator to verify when an interesting state has been reached .
Revised:  The attacker corrupts the observation with the aim of thwarting the effort of the operator .
Edit intent: clarity
Original:  Furthermore, the attacker wants to remain stealthy, namely he wants the operator does not realize that someone is corrupting his observation .
Revised:  Furthermore, the attacker wants to remain stealthy, namely the operator should not realize that someone is corrupting his observation .
Edit intent: clarity
Original:  Furthermore, the attacker wants to remain stealthy, namely he wants the operator does not realize that someone is corrupting his observation .
Revised:  Furthermore, the attacker wants to remain stealthy, namely he wants the operator does not realize that its observation has been corrupted .
Edit intent: clarity
Original:  An automaton, called attack structure is proposed, which supports the attacker in defining an effective attack .
Revised:  An automaton, called attack structure , is defined to describe the set of all possible attacks .
Edit intent: clarity
Original:  In more detail , first, the unbounded attack structure is obtained by doing the concurrent composition of two state observers, the attacker observer and the operator observer.
Revised:  In more details , first, the unbounded attack structure is obtained by doing the concurrent composition of two state observers, the attacker observer and the operator observer.
Edit intent: fluency
Original:  In more detail , first, the unbounded attack structure is obtained by doing the concurrent composition of two state observers, the attacker observer and the operator observer.
Revised:  In more detail , first, an unbounded attack structure is obtained by doing the concurrent composition of two state observers, the attacker observer and the operator observer.
Edit intent: fluency
Original:  In more detail , first, the unbounded attack structure is obtained by doing the concurrent composition of two state observers, the attacker observer and the operator observer.
Revised:  In more detail , first, the unbounded attack structure is obtained by concurrent composition of two state observers, the attacker observer and the operator observer.
Edit intent: clarity
Original:  Then, the n-bounded attack structure, for a given integer value of n, is obtained by doing the concurrent composition of the unbounded attack structure and an n-bounded attack automaton.
Revised:  Then, an n-bounded attack structure, for a given integer value of n, is obtained by doing the concurrent composition of the unbounded attack structure and an n-bounded attack automaton.
Edit intent: fluency
Original:  Then, the n-bounded attack structure, for a given integer value of n, is obtained by doing the concurrent composition of the unbounded attack structure and an n-bounded attack automaton.
Revised:  Then, the n-bounded attack structure, for a given integer value of n, is obtained by concurrent composition of the unbounded attack structure and an n-bounded attack automaton.
Edit intent: clarity
Original:  A stealthy attacker can elaborate his strategy looking at the supremal stealthy attack substructure and may result in different degrees of effectiveness : strong, weak or vain .
Revised:  A stealthy attacker can elaborate his strategy looking at the supremal stealthy attack substructure and may achieve different degrees of effectiveness : strong, weak or vain .
Edit intent: clarity
Original:  The proposed approach can be dually used to verify if such an attack could be effective for the given system , thus to establish if the system is safe under attack.
Revised:  The proposed approach can be dually used to verify if there exists an harmful attack for the given system , thus to establish if the system is safe under attack.
Edit intent: clarity
Original:  The proposed approach can be dually used to verify if such an attack could be effective for the given system , thus to establish if the system is safe under attack.
Revised:  The proposed approach can be dually used to verify if such an attack could be effective for the given system : this allows one to establish if the system is safe under attack.
Edit intent: clarity
Original: The problem of cyber attacks with bounded sensor reading edits for partially-observed discrete event systems  is considered.
Revised: The problem of state estimation in the setting of partially-observed discrete event systems is considered.
Edit intent: clarity
Original:  An operator observes a plant through an observation mask that hides the occurrence of certain events.
Revised:  An operator observes a plant through a natural projection that hides the occurrence of certain events.
Edit intent: clarity
Original:  The objective of the operator is that of estimating if a state in a given set of critical states is reached .
Revised:  The objective of the operator is that of estimating the current state of the system .
Edit intent: clarity
Original:  The observation is corrupted by an attacker which can insert and erase some sensor readings with the aim of thwarting the effort of the operator.
Revised:  The observation is corrupted by an attacker which can insert and erase some sensor readings with the aim of altering the state estimation of the operator.
Edit intent: clarity
Original:  The proposed approach can be dually used to verify if there exists an harmful attack for the given system: this allows one to establish if the system is safe under attack.
Revised:  The proposed approach can be dually used to verify if there exists a harmful attack for the given system: this allows one to establish if the system is safe under attack.
Edit intent: fluency
Original: Recently, the problem of allocating one resource per agent with initial endowments (house markets )has seen a renewed interest: indeed, while in the general domain Top Trading Cycle is known to be the only procedure guaranteeing Pareto-optimality, individual rationality , and strategy proofness, the situation differs in single-peaked domains.
Revised: Recently, the problem of allocating one resource per agent house markets )has seen a renewed interest: indeed, while in the general domain Top Trading Cycle is known to be the only procedure guaranteeing Pareto-optimality, individual rationality , and strategy proofness, the situation differs in single-peaked domains.
Edit intent: clarity
Original: Recently, the problem of allocating one resource per agent with initial endowments (house markets )has seen a renewed interest: indeed, while in the general domain Top Trading Cycle is known to be the only procedure guaranteeing Pareto-optimality, individual rationality , and strategy proofness, the situation differs in single-peaked domains.
Revised: Recently, the problem of allocating one resource per agent with initial endowments ( )has seen a renewed interest: indeed, while in the general domain Top Trading Cycle is known to be the only procedure guaranteeing Pareto-optimality, individual rationality , and strategy proofness, the situation differs in single-peaked domains.
Edit intent: clarity
Original: Recently, the problem of allocating one resource per agent with initial endowments (house markets )has seen a renewed interest: indeed, while in the general domain Top Trading Cycle is known to be the only procedure guaranteeing Pareto-optimality, individual rationality , and strategy proofness, the situation differs in single-peaked domains.
Revised: Recently, the problem of allocating one resource per agent with initial endowments (house markets )has seen a renewed interest: indeed, while in the general domain Top Trading Cycle (TTC) algorithm is the only procedure guaranteeing Pareto-optimality, individual rationality , and strategy proofness, the situation differs in single-peaked domains.
Edit intent: clarity
Original: Recently, the problem of allocating one resource per agent with initial endowments (house markets )has seen a renewed interest: indeed, while in the general domain Top Trading Cycle is known to be the only procedure guaranteeing Pareto-optimality, individual rationality , and strategy proofness, the situation differs in single-peaked domains.
Revised: Recently, the problem of allocating one resource per agent with initial endowments (house markets )has seen a renewed interest: indeed, while in the general domain Top Trading Cycle is known to be the only procedure satisfying Pareto-optimality, individual rationality , and strategy proofness, the situation differs in single-peaked domains.
Edit intent: clarity
Original:  To further investigate how these different mechanisms compare, we pay special attention to the average and minimum rank of the resource obtained by the agents in the outcome allocation.
Revised:  To further investigate how these different mechanisms compare, we pay special attention to the average and minimum rank of the resources obtained by agents in the outcome allocation.
Edit intent: fluency
Original:  To further investigate how these different mechanisms compare, we pay special attention to the average and minimum rank of the resource obtained by the agents in the outcome allocation.
Revised:  To further investigate how these different mechanisms compare, we pay special attention to the average and minimum rank of the resource obtained by the agents in the final allocation.
Edit intent: clarity
Original:  We provide theoretical bounds on the loss potentially induced by these procedures with respect to these criteria, and complement these results with an extensive experimental study which shows how different variants of swap dynamics behave.
Revised:  We start by providing the price of anarchy of these procedures. Finally, we present an extensive experimental study which shows how different variants of swap dynamics behave.
Edit intent: clarity
Original:  We provide theoretical bounds on the loss potentially induced by these procedures with respect to these criteria, and complement these results with an extensive experimental study which shows how different variants of swap dynamics behave.
Revised:  We provide theoretical bounds on the loss potentially induced by these procedures with respect to these criteria, and complement these results with an extensive experimental study in which different versions of swap dynamics behave.
Edit intent: clarity
Original:  We consider a restricted framework in which all the resources are initially owned by the agents, with exactly one resource per agent (house market ).
Revised:  We consider a specific setting, usually referred to as a housing market, where each agent must receive exactly one resource per agent (house market ).
Edit intent: clarity
Original:  We consider a restricted framework in which all the resources are initially owned by the agents, with exactly one resource per agent (house market ).
Revised:  We consider a restricted framework in which all the resources are initially owned by the agents, with exactly one resource (and initially owns one ).
Edit intent: clarity
Original:  When preferences are single-peaked , the Crawler enjoys the same properties.
Revised:  Under the restriction of single-peaked , the Crawler enjoys the same properties.
Edit intent: clarity
Original:  When preferences are single-peaked , the Crawler enjoys the same properties.
Revised:  When preferences are single-peaked preferences, Crawler enjoys the same properties.
Edit intent: clarity
Original:  These two centralized procedures might  involve long trading cycles.
Revised:  These two centralized procedures might however involve long trading cycles.
Edit intent: coherence
Original:  In this paper we focus instead on a procedure involving the shortest cycles: bilateral swap deals .
Revised:  In this paper we focus instead on procedures involving the shortest cycles: bilateral swap deals .
Edit intent: fluency
Original:  In this paper we focus instead on a procedure involving the shortest cycles: bilateral swap deals .
Revised:  In this paper we focus instead on a procedure involving the shortest cycles: bilateral swap-deals .
Edit intent: fluency
Original:  In such a swap dynamics, the agents perform pairwise mutually improving deals until reaching a swap-stable allocation (no improving swap-deal is possible).
Revised:  In such swap dynamics, the agents perform pairwise mutually improving deals until reaching a swap-stable allocation (no improving swap-deal is possible).
Edit intent: fluency
Original:  We prove that on the single-peaked domain every swap-stable allocation is Pareto-optimal, showing the efficiency of the swap dynamics.
Revised:  We prove that in the single-peaked domain every swap-stable allocation is Pareto-optimal, showing the efficiency of the swap dynamics.
Edit intent: clarity
Original:   Besides, both the outcome of TTC and the Crawler can always be reached by sequences of swaps.
Revised:  Besides, both the outcome of TTC and Crawler can always be reached by sequences of swaps.
Edit intent: fluency
Original:  We further analyze the swap-deal procedure through the study of the average or minimum rank of the resources obtained by agents in the final allocation.
Revised:  We further analyze the outcome of swap dynamics through social welfare notions, in our context the average or minimum rank of the resources obtained by agents in the final allocation.
Edit intent: clarity
Original:  We start by providing the price of anarchy of these procedures.
Revised:  We start by providing a worst-case analysis of these procedures.
Edit intent: clarity
Original:  Finally, we present an extensive experimental study in which different versions of swap dynamics as well as other existing allocation procedures are compared .
Revised:  Finally, we present an extensive experimental study in which different versions of swap dynamics are compared to other existing allocation procedures are compared .
Edit intent: clarity
Original:  Finally, we present an extensive experimental study in which different versions of swap dynamics as well as other existing allocation procedures are compared .
Revised:  Finally, we present an extensive experimental study in which different versions of swap dynamics as well as other existing allocation procedures .
Edit intent: clarity
Original:  We show that swap-deal procedures exhibit good results on average in this domain, under different cultures for generating synthetic data.
Revised:  We show that they exhibit good results on average in this domain, under different cultures for generating synthetic data.
Edit intent: clarity
Original:  The appeal of PQE is that many verification problems, e.g. equivalence checking and model checking, reduce to PQE and the latter is much easier to solve than complete QE.
Revised:  The appeal of PQE is that many verification problems, e.g. equivalence checking and model checking, reduce to PQE and the latter is much easier than complete QE.
Edit intent: clarity
Original:  We address this problem by introducing a modified definition of D-sequents that facilitates their safe reusing.
Revised:  We address this problem by introducing a modified definition of D-sequents to enable their safe reusing.
Edit intent: clarity
Original:   In this paper, we consider leveraging the affective character of news articles for fake news identification  and present evidence that emotion cognizant representations are significantly more suited for the task.
Revised:  In this paper, we consider the utility of the affective character of news articles for fake news identification and present evidence that emotion cognizant representations are significantly more suited for the task.
Edit intent: clarity
Original:  A key challenges is ambiguity, as multiple codes -- or fixes -- can implement the same functionality.
Revised:  A key challenge is ambiguity, as multiple codes -- or fixes -- can implement the same functionality.
Edit intent: fluency
Original:  In addition, dataset by nature fail to capture the variance introduced by such ambiguities.
Revised:  In addition, datasets by nature fail to capture the variance introduced by such ambiguities.
Edit intent: fluency
Original:  Our evaluations on common programming errors show for the first time the generation of diverse fixes and strong improvements over the state-of-the-art approaches by fixing up to 61%DIFDELCMD < \\%%% %DIF < of the mistakes.abstract 
Revised:  Our evaluations on common programming errors show for the first time the generation of diverse fixes and strong improvements over the state-of-the-art approaches by fixing up to %DIFDELCMD < \\%%% %DIF < of the mistakes.abstract 
Edit intent: clarity
Original: Automatic program correction is an active topic of research, which holds the potential of dramatically improving  productivity of programmers during the software development process and correctness of software in general.
Revised: Automatic program repair holds the potential of dramatically improving productivity of programmers during the software development process and correctness of software in general.
Edit intent: clarity
Original: Automatic program correction is an active topic of research, which holds the potential of dramatically improving  productivity of programmers during the software development process and correctness of software in general.
Revised: Automatic program correction is an active topic of research, which holds the potential of dramatically improving the productivity of programmers during the software development process and correctness of software in general.
Edit intent: fluency
Original:  Recent advances in machine learning, deep learning  and NLP have rekindled the hope to eventually fully automate the process of repairing programs.
Revised:  Recent advances in machine learning, deep learning , and NLP have rekindled the hope to eventually fully automate the process of repairing programs.
Edit intent: fluency
Original:  Therefore, we propose a deep generative model to automatically correct programming errors by learning a distribution of potential fixes.
Revised:  Therefore, we propose a generative model that learns a distribution over potential fixes.
Edit intent: clarity
Original:  In order to account for ambiguity and inherent lack of representative datasets , we propose a novel regularizer to encourage the model to generate diverse fixes .
Revised:  In order to ensure diverse solutions , we propose a novel regularizer to encourage the model to generate diverse fixes .
Edit intent: clarity
Original:  In order to account for ambiguity and inherent lack of representative datasets , we propose a novel regularizer to encourage the model to generate diverse fixes .
Revised:  In order to account for ambiguity and inherent lack of representative datasets , we propose a novel regularizer that encourages diversity over a semantic embedding space .
Edit intent: clarity
Original: In this paper , a method for non-parallel sequence-to-sequence (seq2seq) voice conversion is presented.
Revised: This paper presents a method of sequence-to-sequence (seq2seq) voice conversion is presented.
Edit intent: clarity
Original:  For learning disentangled linguistic representations , we proposed two strategies.
Revised:  For learning disentangled linguistic representations with two strategies.
Edit intent: clarity
Original:  Second, an adversarial training method is adopted to further wipe out speaker related descriptions from the linguistic embeddings of audio signals . Meanwhile, speaker representations are extracted  by a speaker encoder.
Revised:  Second, an adversarial training strategy is employed to further wipe out speaker related descriptions from the linguistic embeddings of audio signals . Meanwhile, speaker representations are extracted by a speaker encoder.
Edit intent: clarity
Original:  Second, an adversarial training method is adopted to further wipe out speaker related descriptions from the linguistic embeddings of audio signals . Meanwhile, speaker representations are extracted  by a speaker encoder.
Revised:  Second, an adversarial training method is adopted to further wipe out speaker information from the linguistic embeddings of audio signals . Meanwhile, speaker representations are extracted by a speaker encoder.
Edit intent: clarity
Original:  Second, an adversarial training method is adopted to further wipe out speaker related descriptions from the linguistic embeddings of audio signals . Meanwhile, speaker representations are extracted  by a speaker encoder.
Revised:  Second, an adversarial training method is adopted to further wipe out speaker related descriptions from the linguistic representations . Meanwhile, speaker representations are extracted by a speaker encoder.
Edit intent: clarity
Original:  Second, an adversarial training method is adopted to further wipe out speaker related descriptions from the linguistic embeddings of audio signals . Meanwhile, speaker representations are extracted  by a speaker encoder.
Revised:  Second, an adversarial training method is adopted to further wipe out speaker related descriptions from the linguistic embeddings of audio signals . Meanwhile, speaker representations are extracted from audio signals by a speaker encoder.
Edit intent: fluency
Original:  The experimental results showed that our method obtained higher similarity and naturalness compared to the top rank method in Voice Conversion Challenge 2018, which is a non-parallel baseline.
Revised:  The experimental results showed that our method obtained higher similarity and naturalness than the best non-parallel voice conversion method in Voice Conversion Challenge 2018, which is a non-parallel baseline.
Edit intent: clarity
Original:  And the performance of  proposed method was closed to the state-of-art seq2seq based parallel baseline.
Revised:  And the performance of our proposed method was closed to the state-of-art seq2seq based parallel baseline.
Edit intent: fluency
Original:  The model parameters are estimated by two-stage training, including a pre-training stage using a multi-speaker dataset and a fine-tuning stage using the dataset of a specific conversion pair.
Revised:  The model parameters are estimated by two-stage training, including a pretraining stage using a multi-speaker dataset and a fine-tuning stage using the dataset of a specific conversion pair.
Edit intent: clarity
Original:  Here, we study this problem within the context of ``stochastic elasticity'' where the elastic parameters are characterised by probability density functions.
Revised:  Here, we study this problem within the context of "stochastic elasticity" where the constitutive parameters are characterised by probability density functions.
Edit intent: clarity
Original:  Specifically, we consider homogeneous spheres of stochastic neo-Hookean material, composites with two concentric stochastic neo-Hookean phases, and inhomogeneous spheres of neo-Hookean-like material with a radially varying parameter.
Revised:  We consider homogeneous spheres of stochastic neo-Hookean material, composites with two concentric stochastic neo-Hookean phases, and inhomogeneous spheres of neo-Hookean-like material with a radially varying parameter.
Edit intent: coherence