wanyu/IteraTeR_v2 huggingface dataset:
Original:  At first, a general signal model is introduced, which includes the possibility of using up to two RISs (one close to the  transmitter and one close to the  receiver) and subsumes both a mono-static and a bi-static radar configuration with or without a line-of-sight (LOS) view of the prospective target.
Revised:  At first, a general signal model is introduced, which includes the possibility of using up to two RISs (one close to the transmitter and one close to the receiver) and subsumes both a monostatic and a bistatic radar configuration with or without a line-of-sight (LOS) view of the prospective target.
Edit intent: clarity
Original:  At first, a general signal model is introduced, which includes the possibility of using up to two RISs (one close to the  transmitter and one close to the  receiver) and subsumes both a mono-static and a bi-static radar configuration with or without a line-of-sight (LOS) view of the prospective target.
Revised:  At first, a general signal model is introduced, which includes the possibility of using up to two RISs (one close to the transmitter and one close to the receiver) and subsumes both a mono-static and a bi-static radar configuration with or without a line-of-sight view of the prospective target.
Edit intent: clarity
Original:  Upon resorting to a generalized likelihood ratio test (GLRT), the design of the RIS phase shifts is formulated as the maximization of the probability of detection in the resolution cell under inspection for a fixed probability of false alarm, and suitable optimization algorithms are proposed and discussed.
Revised:  Upon resorting to a generalized likelihood ratio test (GLRT), the design of the phase shifts introduced by the RIS elements is formulated as the maximization of the probability of detection in the resolution cell under inspection for a fixed probability of false alarm, and suitable optimization algorithms are proposed and discussed.
Edit intent: clarity
Original:  Upon resorting to a generalized likelihood ratio test (GLRT), the design of the RIS phase shifts is formulated as the maximization of the probability of detection in the resolution cell under inspection for a fixed probability of false alarm, and suitable optimization algorithms are proposed and discussed.
Revised:  Upon resorting to a generalized likelihood ratio test (GLRT), the design of the RIS phase shifts is formulated as the maximization of the probability of detection in the location under inspection for a fixed probability of false alarm, and suitable optimization algorithms are proposed and discussed.
Edit intent: clarity
Original:  Both the theoretical and the numerical analysis clearly show the benefits , in terms of the signal-to-noise ratio (SNR) at the radar receiver, granted by the use of the RISs and shed light on the interplay among the key system parameters, such as the radar-RIS distance, the RIS size, and location of the prospective target.
Revised:  Both the theoretical and the numerical analysis clearly show the benefits , in terms of the signal-to-noise ratio (SNR) at the radar receiver, granted by the presence of the RISs and shed light on the interplay among the key system parameters, such as the radar-RIS distance, the RIS size, and location of the prospective target.
Edit intent: clarity
Original:  A major finding is that the RISs should be  deployed in the near-field of the radar transmit/receive array .
Revised:  A major finding is that the RISs should be better deployed in the near-field of the radar transmit/receive array .
Edit intent: clarity
Original:  A major finding is that the RISs should be  deployed in the near-field of the radar transmit/receive array .
Revised:  A major finding is that the RISs should be deployed in the near-field of the radar arrays at both the transmit and the receive side .
Edit intent: clarity
Original:  The paper is then concluded by discussing some open problems and foreseen applications.
Revised:  The paper is concluded by discussing some open problems and foreseen applications.
Edit intent: coherence
Original:  In this paper, we extend the computation of pointlikes to ordered monoids.
Revised:  In this paper, we consider the extension the computation of pointlikes to ordered monoids.
Edit intent: clarity
Original:  We consider a hierarchical network composed of a source, a buffer-aided relay , and another node in a higher level in the hierarchy.
Revised:  We consider a hierarchical network consisting of a source, a buffer-aided relay , and another node in a higher level in the hierarchy.
Edit intent: fluency
Original:  We provide a framework to take into account the  delays in both the transmission and computation buffers  which facilitates the derivation of the expression for the Average Response Time (ART)
Revised:  We provide a framework to take into account the delays in both the transmission and computation buffers , which facilitates the derivation of the expression for the Average Response Time (ART)
Edit intent: fluency
Original:  in the system . Based on that and the system average power consumption in each slot, we introduce the concept of Average Response Energy (ARE) as a novel metric to capture the energy efficiency in MEC  . Accordingly, we propose two offloading schemes with relevant problem formulations, namely the Minimum ART (MART) and the Minimum ARE (MARE) schemes, to optimize the ART or the ARE while keeping the system queues stable.
Revised:  . Based on that and the system average power consumption in each slot, we introduce the concept of Average Response Energy (ARE) as a novel metric to capture the energy efficiency in MEC . Accordingly, we propose two offloading schemes with relevant problem formulations, namely the Minimum ART (MART) and the Minimum ARE (MARE) schemes, to optimize the ART or the ARE while keeping the system queues stable.
Edit intent: clarity
Original:  in the system . Based on that and the system average power consumption in each slot, we introduce the concept of Average Response Energy (ARE) as a novel metric to capture the energy efficiency in MEC  . Accordingly, we propose two offloading schemes with relevant problem formulations, namely the Minimum ART (MART) and the Minimum ARE (MARE) schemes, to optimize the ART or the ARE while keeping the system queues stable.
Revised:  in the system . Based on that and the system average power consumption in each slot, we introduce the concept of Average Response Energy (ARE) as a novel metric to capture the energy efficiency in MEC . Accordingly, we propose two offloading schemes with their respective problem formulations, namely the Minimum ART (MART) and the Minimum ARE (MARE) schemes, to optimize the ART or the ARE while keeping the system queues stable.
Edit intent: clarity
Original:  We analyze the properties of the formulated problems , in terms of the feasible sets and the objective functions and noting them, we propose effective solution methods.
Revised:  We demonstrate the difference of the formulated problems , in terms of the feasible sets and the objective functions and noting them, we propose effective solution methods.
Edit intent: clarity
Original:  We present the first 3D generative model for a drastically different shape representation -- describing a shape as a sequence of computer-aided design (CAD) operations.
Revised:  We present the first 3D generative model for a drastically different shape representation --- describing a shape as a sequence of computer-aided design (CAD) operations.
Edit intent: fluency
Original:  Numerical methods to solve these problems, including embedded/immersed boundary methods, are typically not differentiable and lack of smoothness.
Revised:  Numerical methods to solve these problems, including embedded/immersed boundary methods, are typically not differentiable and lack smoothness.
Edit intent: fluency
Original:  We propose a framework which is built on unscented Kalman filter/inversion to efficiently calibrate and provide uncertainty estimations of such complicated models with noisy observation data.
Revised:  We propose a framework that is built on unscented Kalman filter/inversion to efficiently calibrate and provide uncertainty estimations of such complicated models with noisy observation data.
Edit intent: fluency
Original:  The framework is demonstrated and validated by successfully calibrating the model parameters of a piston problem and identifying  damage field of an airfoil under transonic buffeting.
Revised:  The framework is demonstrated and validated by successfully calibrating the model parameters of a piston problem and identifying the damage field of an airfoil under transonic buffeting.
Edit intent: fluency
Original: With their increasing penetration in power systems, distributed energy resources (DERs) have great potential to enhance their profits by participating in the electricity market via aggregation.
Revised: With increasing distributed energy resoures (DERs) have great potential to enhance their profits by participating in the electricity market via aggregation.
Edit intent: clarity
Original:  Because most DERs are integrated into distribution systems , the strategic bidding behavior of a DER aggregator will have a significant impact on the operation of the distribution system.
Revised:  Because most DERs are integrated into distribution systems , the strategic behavior of a DER aggregator will have a significant impact on the operation of the distribution system.
Edit intent: clarity
Original:  In this paper, a single-leader-multi-follower bi-level optimization model is proposed to investigate the strategic bidding behavior of the price-maker DER aggregatorin day-ahead joint energy and reserve markets .
Revised:  In this paper, the interactions among the DER aggregator, energy and reserve markets .
Edit intent: clarity
Original:  First, a novel linearized power flow model for the distribution system considering the substation transformer tap is developed to simplify the security check problem .
Revised:  First, a novel linearized power flow model .
Edit intent: coherence
Original:  In this paper  we focus on finding small kernels for edge modification problems.
Revised:  In this paper , we focus on finding small kernels for edge modification problems.
Edit intent: fluency
Original:  One of the most studied problems is the Cluster Editing problem, in which the goal is to partition the vertex set into a disjoint union of cliques.
Revised:  One of the most studied problems is the Cluster Editing problem, in which the goal is to partition the vertex set into a disjoint union of cliques.
Edit intent: fluency
Original:  Even if  a 2k kernel exists forCluster Editing ,  this kernel does not reduce the size of the instance in most cases .
Revised:  Even if a 2k kernel Cluster Editing , this kernel does not reduce the size of the instance in most cases .
Edit intent: clarity
Original:  Even if  a 2k kernel exists forCluster Editing ,  this kernel does not reduce the size of the instance in most cases .
Revised:  Even if a 2k kernel exists forCluster Editing , , this kernel does not reduce the size of the instance in most cases .
Edit intent: fluency
Original:  Even if  a 2k kernel exists forCluster Editing ,  this kernel does not reduce the size of the instance in most cases .
Revised:  Even if a 2k kernel exists forCluster Editing , this kernel does not reduce the size of most instances .
Edit intent: clarity
Original:  Namely, we show that Clique + Independent Set Deletion , which is a restriction of Cluster Deletion , admits a kernel of size O(k/\log k).
Revised:  Namely, we show that Clique + Independent Set Deletion , which is a restriction of Cluster Deletion , admits a kernel of size O(k/\log k).
Edit intent: fluency
Original:  We prove that \textsc{Split Addition (and the equivalent \textsc{Split Deletion ) admits a linear kernel, improving the existing quadratic kernel of Ghosh et al.
Revised:  We prove that \textsc{Split Addition (and the equivalent \textsc{Split Deletion ) admits a linear kernel, improving the existing quadratic kernel of Ghosh et al.
Edit intent: fluency
Original: We also prove that }\textsc{Trivially Perfect Addition  admits a quadratic kernel (improving the cubic kernel of Guo \mbox{ \cite{guo2007problem}\hspace{0pt} }  ), and finally prove that its triangle-free version ( \textsc{Starforest Deletion ) admits a linear kernel, which is optimal under ETH.
Revised: We also prove that }\textsc{Trivially Perfect Addition admits a quadratic kernel (improving the cubic kernel of Guo }\hspace{0pt} } ), and finally prove that its triangle-free version ( \textsc{Starforest Deletion ) admits a linear kernel, which is optimal under ETH.
Edit intent: clarity
Original: We also prove that }\textsc{Trivially Perfect Addition  admits a quadratic kernel (improving the cubic kernel of Guo \mbox{ \cite{guo2007problem}\hspace{0pt} }  ), and finally prove that its triangle-free version ( \textsc{Starforest Deletion ) admits a linear kernel, which is optimal under ETH.
Revised: We also prove that }\textsc{Trivially Perfect Addition admits a quadratic kernel (improving the cubic kernel of Guo \mbox{ \cite{guo2007problem}\hspace{0pt} } ), and finally prove that its triangle-free version ( \textsc{Starforest Deletion ) admits a linear kernel, which is optimal under ETH.
Edit intent: fluency
Original:  Conventional training methods overlook these noisy examples, leading to sub-optimal recommendation .
Revised:  Conventional training methods overlook these noisy examples, leading to sub-optimal recommendations .
Edit intent: fluency
Original:  In this work, we propose probabilistic and variational recommendation denoising for implicit feedback.
Revised:  In this work, we propose a novel framework to learn robust recommenders from implicit feedback.
Edit intent: clarity
Original:  Motivated by this observation, we propose denoising with probabilistic inference (DPI ) which aims to minimize the KL-divergence between the real user preference distributions parameterized by two recommendation models while maximize the likelihood of data observation.
Revised:  Motivated by this observation, we propose denoising with probabilistic inference (DPI ) which aims to minimize the KL-divergence between the real user preference distributions parameterized by two recommendation models while maximizing the likelihood of data observation.
Edit intent: fluency
Original:  In this paper, we provide a novel data-driven UIO based on behavioral system theory and the result known as Fundamental Lemma proposed by Willems et al. 1 . We give necessary and sufficient conditions on the data collected from the system for the existence of a UIO providing asymptotically converging state estimates, and propose a purely data-driven algorithm for their computation.
Revised:  In this paper, we provide a novel data-driven UIO based on behavioral system theory and the result known as Fundamental Lemma proposed by 1 . We give necessary and sufficient conditions on the data collected from the system for the existence of a UIO providing asymptotically converging state estimates, and propose a purely data-driven algorithm for their computation.
Edit intent: clarity
Original:  In robotics, emotions are pursued for a long duration, such as recognition, expression, and computational modeling of the basic mechanism behind them.
Revised:  In robotics, the study of emotions has been pursued for a long duration, such as recognition, expression, and computational modeling of the basic mechanism behind them.
Edit intent: clarity
Original:  In robotics, emotions are pursued for a long duration, such as recognition, expression, and computational modeling of the basic mechanism behind them.
Revised:  In robotics, emotions are pursued for a long time, including the study of their recognition, expression, and computational modeling of the basic mechanism behind them.
Edit intent: clarity
Original:  In robotics, emotions are pursued for a long duration, such as recognition, expression, and computational modeling of the basic mechanism behind them.
Revised:  In robotics, emotions are pursued for a long duration, such as recognition, expression, and computational modeling of the basic mechanisms which underlie them.
Edit intent: clarity
Original:  Research has been promoted according to well-known psychological findings, such as category and dimension theories.
Revised:  Research has advanced according to well-known psychological findings, such as category and dimension theories.
Edit intent: clarity
Original:  However, social emotions, also called higher-level emotions, have been studied in psychology.
Revised:  However, social emotions, also referred to as higher-level emotions, have been studied in psychology.
Edit intent: fluency
Original:  We believe that these higher-level emotions are worth pursuing in robotics for next-generation social-aware robots.
Revised:  We believe that these higher-level emotions are worth pursuing in robotics for next-generation , socially aware robots.
Edit intent: fluency
Original:  In this review paper, while summarizing the findings of social emotions in psychology and neuroscience,  studies on social emotions in robotics at present are surveyed .
Revised:  In this review paper, we summarize the findings on social emotions in psychology and neuroscience, studies on social emotions in robotics at present are surveyed .
Edit intent: coherence
Original:  In this review paper, while summarizing the findings of social emotions in psychology and neuroscience,  studies on social emotions in robotics at present are surveyed .
Revised:  In this review paper, while summarizing the findings of social emotions in psychology and neuroscience, along with a survey of the studies on social emotions in robotics at present are surveyed .
Edit intent: coherence
Original:  In this review paper, while summarizing the findings of social emotions in psychology and neuroscience,  studies on social emotions in robotics at present are surveyed .
Revised:  In this review paper, while summarizing the findings of social emotions in psychology and neuroscience, studies on social emotions in robotics that have been conducted to date .
Edit intent: clarity
Original:  Thereafter, research directions towards implementation of social emotions in robots are discussed.
Revised:  Thereafter, research directions toward the implementation of social emotions in robots are discussed.
Edit intent: fluency
Original: The globalization of the electronics supply chain is requiring effective methods to thwart reverse engineering and IP theft.
Revised: The globalization of the electronics supply chain requires effective methods to thwart reverse engineering and IP theft.
Edit intent: coherence
Original:  Logic locking is a promising solution  but there are still several open concerns.
Revised:  Logic locking is a promising solution , but there are still several open concerns.
Edit intent: fluency
Original:  Even when applied at high level of abstraction, logic locking leads to large overhead without guaranteeing that the obfuscation metricis actually maximized .
Revised:  First, even when applied at high level of abstraction, logic locking leads to large overhead without guaranteeing that the obfuscation metricis actually maximized .
Edit intent: fluency
Original:  Even when applied at high level of abstraction, logic locking leads to large overhead without guaranteeing that the obfuscation metricis actually maximized .
Revised:  Even when applied at a higher level of abstraction, logic locking leads to large overhead without guaranteeing that the obfuscation metricis actually maximized .
Edit intent: fluency
Original:  Operating on the chipbehavior, our method is compatible with commercial HLS tools, complementing existing industrial design flows.
Revised:  Operating on the chipbehavior, our method is compatible with all HLS tools, complementing existing industrial design flows.
Edit intent: clarity
Original:  We offer a framework where the designer can implement different meta-heuristics to explore the design space and select where to apply logic locking .
Revised:  We offer a framework where the designer can implement different meta-heuristics to explore the design space and to select points to lock automatically .
Edit intent: clarity
Original: We present an implicit Split-Step explicit Euler type Method (dubbed SSM) for the simulation of McKean-Vlasov Stochastic Differential Equations (MV-SDEs) with drifts of super-linear growth in space, Lipschitz in measure and non-constant Lipschitz diffusion coefficient.
Revised: We present an implicit Split-Step explicit Euler type Method (dubbed SSM) for the simulation of McKean-Vlasov Stochastic Differential Equations (MV-SDEs) with drifts of superlinear growth in space, Lipschitz in measure and non-constant Lipschitz diffusion coefficient.
Edit intent: fluency
Original:  A sufficient condition for the mean-square contractivity of the scheme is presented.
Revised:  A sufficient condition for mean-square contractivity of the scheme is presented.
Edit intent: fluency
Original:  Several numerical examples are presented  including a comparative analysis of other known algorithms for this class ( taming and adaptive time-stepping) across parallel and non-parallel implementations.
Revised:  Several numerical examples are presented , including a comparative analysis of other known algorithms for this class ( taming and adaptive time-stepping) across parallel and non-parallel implementations.
Edit intent: fluency
Original:  Several numerical examples are presented  including a comparative analysis of other known algorithms for this class ( taming and adaptive time-stepping) across parallel and non-parallel implementations.
Revised:  Several numerical examples are presented including a comparative analysis to other known algorithms for this class ( taming and adaptive time-stepping) across parallel and non-parallel implementations.
Edit intent: fluency
Original:  Several numerical examples are presented  including a comparative analysis of other known algorithms for this class ( taming and adaptive time-stepping) across parallel and non-parallel implementations.
Revised:  Several numerical examples are presented including a comparative analysis of other known algorithms for this class ( Taming and Adaptive time-stepping) across parallel and non-parallel implementations.
Edit intent: fluency
Original: This paper presents a user-centered physical interface for collaborative mobile manipulators in industrial manufacturing and logistics applications.
Revised: This paper presents a physical interface for collaborative mobile manipulators in industrial manufacturing and logistics applications.
Edit intent: clarity
Original:  The proposed work builds on our earlier MOCA-MAN interface, through which a mobile manipulator could be physically coupled to the operators to assist them in performing daily activities.
Revised:  The proposed work builds on our earlier MOCA-MAN interface, through which an operator could be physically coupled to the operators to assist them in performing daily activities.
Edit intent: clarity
Original:  The proposed work builds on our earlier MOCA-MAN interface, through which a mobile manipulator could be physically coupled to the operators to assist them in performing daily activities.
Revised:  The proposed work builds on our earlier MOCA-MAN interface, through which a mobile manipulator could be physically coupled to a mobile manipulator to be assisted in performing daily activities.
Edit intent: clarity
Original:  The  new interface instead presents the following additions: i) A simplistic, industrial-like design that allows the worker to couple/decouple easily and to operate mobile manipulators locally;
Revised:  The new interface instead presents the following additions: i) An industrial-like design that allows the worker to couple/decouple easily and to operate mobile manipulators locally;
Edit intent: clarity