wanyu/IteraTeR_v2 huggingface dataset:
Original:  While clients in this protocol are free from disclosing own private data, the overall training process can become inefficient when some clients are with limited computational resources (i.e. , requiring longer update time) or under poor wireless channel conditions (longer upload time).
Revised:  While clients in this protocol are free from disclosing own private data, the overall training process can become inefficient when some clients are with limited computational resources (i.e. requiring longer update time) or under poor wireless channel conditions (longer upload time).
Edit intent: fluency
Original:  This selection strategy results in the server aggregating as many client updates as possible and accelerating performance improvement in ML models (e. g., classification accuracy.)
Revised:  This selection strategy results in the server aggregating as many client updates as possible and to accelerate performance improvement in ML models (e. g., classification accuracy.)
Edit intent: coherence
Original:  This selection strategy results in the server aggregating as many client updates as possible and accelerating performance improvement in ML models (e. g., classification accuracy.)
Revised:  This selection strategy results in the server aggregating as many client updates as possible and accelerating performance improvement in ML models .
Edit intent: clarity
Original:  with short range, non-supportability of high density networks, unreliable broadcast services, signal congestion and connectivity disruptions, Vehicle-to-anything (V2X) communication networks, standardized in 3rd Generation Partnership Project (3GPP) Release 14, have been recently introduced to cover broader vehicular communication scenarios including vehicle-to-vehicle (V2V), vehicle-to-pedestrian (V2P) and vehicle-to-infrastructure/network (V2I/N).
Revised:  with short range, non-supportability of high density networks, unreliable broadcast services, signal congestion and connectivity disruptions, vehicle-to-everything (V2X) communication networks, standardized in 3rd Generation Partnership Project (3GPP) Release 14, have been recently introduced to cover broader vehicular communication scenarios including vehicle-to-vehicle (V2V), vehicle-to-pedestrian (V2P) and vehicle-to-infrastructure/network (V2I/N).
Edit intent: fluency
Original:  Motivated by the stringent connection reliability and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks, where the vehicles can deliver its information via { vehicle-to-base station ( V2B ) communication or directly between vehicles in the sidelink, based on their distances  and the bias factor.
Revised:  Motivated by the stringent connection reliability and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks, where the vehicles can deliver their { vehicle-to-base station ( V2B ) communication or directly between vehicles in the sidelink, based on their distances and the bias factor.
Edit intent: clarity
Original:  Motivated by the stringent connection reliability and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks, where the vehicles can deliver its information via { vehicle-to-base station ( V2B ) communication or directly between vehicles in the sidelink, based on their distances  and the bias factor.
Revised:  Motivated by the stringent connection reliability and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks, where the vehicles can deliver its information via { vehicle-to-base station , V2B ) communication or directly between vehicles in the sidelink, based on their distances and the bias factor.
Edit intent: fluency
Original:  Motivated by the stringent connection reliability and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks, where the vehicles can deliver its information via { vehicle-to-base station ( V2B ) communication or directly between vehicles in the sidelink, based on their distances  and the bias factor.
Revised:  Motivated by the stringent connection reliability and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks, where the vehicles can deliver its information via { vehicle-to-base station ( V2B communication link) or directly between vehicles in the sidelink, based on their distances and the bias factor.
Edit intent: clarity
Original:  Motivated by the stringent connection reliability and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks, where the vehicles can deliver its information via { vehicle-to-base station ( V2B ) communication or directly between vehicles in the sidelink, based on their distances  and the bias factor.
Revised:  Motivated by the stringent connection reliability and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks, where the vehicles can deliver its information via { vehicle-to-base station ( V2B ) communication or directly between vehicles in the sidelink, based on their distances , propagation environments and the bias factor.
Edit intent: clarity
Original:  By practically modeling the vehicles on the roads using the doubly stochastic Cox process and the BSs, we derive new association probability of the V2B communication , new success probabilities of the V2B and V2V communications, and overall success probability of the V2X communication, which are validated by the simulations results.
Revised:  By practically modeling the vehicles on the roads using the doubly stochastic Cox process and the BSs, we derive new association probabilities of V2B communication , new success probabilities of the V2B and V2V communications, and overall success probability of the V2X communication, which are validated by the simulations results.
Edit intent: fluency
Original:  By practically modeling the vehicles on the roads using the doubly stochastic Cox process and the BSs, we derive new association probability of the V2B communication , new success probabilities of the V2B and V2V communications, and overall success probability of the V2X communication, which are validated by the simulations results.
Revised:  By practically modeling the vehicles on the roads using the doubly stochastic Cox process and the BSs, we derive new association probability of the V2B and V2V links , new success probabilities of the V2B and V2V communications, and overall success probability of the V2X communication, which are validated by the simulations results.
Edit intent: clarity
Original: To overcome the limitations of Dedicated Short Range Communications (DSRC ) with short range, non-supportability of high density networks, unreliable broadcast services, signal congestion and connectivity disruptions,  vehicle-to-everything ( V2X)
Revised: To overcome the limitations of DSRC with short range, non-supportability of high density networks, unreliable broadcast services, signal congestion and connectivity disruptions, vehicle-to-everything ( V2X)
Edit intent: clarity
Original: To overcome the limitations of Dedicated Short Range Communications (DSRC ) with short range, non-supportability of high density networks, unreliable broadcast services, signal congestion and connectivity disruptions,  vehicle-to-everything ( V2X)
Revised: To overcome the limitations of Dedicated Short Range Communications (DSRC ) with short range, non-supportability of high density networks, unreliable broadcast services, signal congestion and connectivity disruptions, vehicle-to-everything ( C-V2X)
Edit intent: clarity
Original:   Motivated by the stringent connection reliability  and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks , where the  vehicles can deliver their information via%DIFDELCMD < {%%% V2N/cellular network (vehicle-to-base station, V2B communication link) or directly between vehicles in the sidelink , based on their distances, propagation environments and the bias factor.
Revised:  Motivated by the stringent connection reliability and coverage requirements in C-V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks , where the vehicles can deliver their information via%DIFDELCMD < {%%% V2N/cellular network (vehicle-to-base station, V2B communication link) or directly between vehicles in the sidelink , based on their distances, propagation environments and the bias factor.
Edit intent: clarity
Original:   Motivated by the stringent connection reliability  and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks , where the  vehicles can deliver their information via%DIFDELCMD < {%%% V2N/cellular network (vehicle-to-base station, V2B communication link) or directly between vehicles in the sidelink , based on their distances, propagation environments and the bias factor.
Revised:  Motivated by the stringent connection reliability and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks , where the vehicles can deliver information via%DIFDELCMD < {%%% V2N/cellular network (vehicle-to-base station, V2B communication link) or directly between vehicles in the sidelink , based on their distances, propagation environments and the bias factor.
Edit intent: clarity
Original:   Motivated by the stringent connection reliability  and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks , where the  vehicles can deliver their information via%DIFDELCMD < {%%% V2N/cellular network (vehicle-to-base station, V2B communication link) or directly between vehicles in the sidelink , based on their distances, propagation environments and the bias factor.
Revised:  Motivated by the stringent connection reliability and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks , where the vehicles can deliver their %DIFDELCMD < {%%% V2N/cellular network (vehicle-to-base station, V2B communication link) or directly between vehicles in the sidelink , based on their distances, propagation environments and the bias factor.
Edit intent: clarity
Original:   Motivated by the stringent connection reliability  and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks , where the  vehicles can deliver their information via%DIFDELCMD < {%%% V2N/cellular network (vehicle-to-base station, V2B communication link) or directly between vehicles in the sidelink , based on their distances, propagation environments and the bias factor.
Revised:  Motivated by the stringent connection reliability and coverage requirements in V2X , this paper presents the first comprehensive and tractable analytical framework for the uplink performance of cellular V2X networks , where the vehicles can deliver their information via%DIFDELCMD < {%%% their information via infrastructure or direct mode , based on their distances, propagation environments and the bias factor.
Edit intent: clarity
Original:  By practically modeling the vehicles on the roads using the doubly stochastic Cox process and the BSs , we derive new association probabilitiesof V2B and V2V links , new success probabilities of the V2B and V2V communications , and overall success probability of the V2X communication , which are validated by the simulations results.
Revised:  By practically modeling the vehicles on the roads using the doubly stochastic Cox process and the base-stations , we derive new association probabilitiesof V2B and V2V links , new success probabilities of the V2B and V2V communications , and overall success probability of the V2X communication , which are validated by the simulations results.
Edit intent: clarity
Original:  By practically modeling the vehicles on the roads using the doubly stochastic Cox process and the BSs , we derive new association probabilitiesof V2B and V2V links , new success probabilities of the V2B and V2V communications , and overall success probability of the V2X communication , which are validated by the simulations results.
Revised:  By practically modeling the vehicles on the roads using the doubly stochastic Cox process and the BSs , we derive new association probabilities , new success probabilities of the V2B and V2V communications , and overall success probability of the V2X communication , which are validated by the simulations results.
Edit intent: clarity
Original:  Our results reveal the benefits of V2X communication compared to V2V communication in terms of success probability.
Revised:  Our results reveal the benefits of V2X communication compared to V2V network in terms of success probability.
Edit intent: clarity
Original:  An effective task offloading strategy is needed to utilize the computation resources efficiently.
Revised:  An effective task offloading strategy is needed to utilize the computational resources efficiently.
Edit intent: fluency
Original:  We present a framework for benchmarking heap layout manipulation algorithms, and use it to evaluate our approach on several real-world allocators, showing that pseudo-random black-box search can be highly effective.
Revised:  We present a framework for benchmarking heap layout manipulation algorithms, and use it to evaluate our approach on several real-world allocators, showing that pseudo-random black box search can be highly effective.
Edit intent: fluency
Original:  Specifically, we formally define epidemic processes on single and multilayer networks and discuss in details the main methods used to perform numerical simulations.
Revised:  Specifically, we formally define epidemic processes on single and multilayer networks and discuss in detail the main methods used to perform numerical simulations.
Edit intent: fluency
Original:  Our revision includes the heterogeneous mean-field, the quenched-mean field, and the pair quenched mean-field approaches, as well as their respective simulation techniques, emphasizing similarities and differences among the different techniques.
Revised:  Our revision includes the heterogeneous mean-field, the quenched-mean field, and the pair quenched mean field approaches, as well as their respective simulation techniques, emphasizing similarities and differences among the different techniques.
Edit intent: fluency
Original: It is an open problem whether a classical client (verifier) can delegate quantum computing to a remote quantum server (prover) in such a way that the correctness of quantum computing is somehow guaranteed.
Revised: It is an open problem whether a classical client can delegate quantum computing to a remote quantum server (prover) in such a way that the correctness of quantum computing is somehow guaranteed.
Edit intent: clarity
Original: It is an open problem whether a classical client (verifier) can delegate quantum computing to a remote quantum server (prover) in such a way that the correctness of quantum computing is somehow guaranteed.
Revised: It is an open problem whether a classical client (verifier) can delegate quantum computing to an efficient remote quantum server (prover) in such a way that the correctness of quantum computing is somehow guaranteed.
Edit intent: clarity
Original: It is an open problem whether a classical client (verifier) can delegate quantum computing to a remote quantum server (prover) in such a way that the correctness of quantum computing is somehow guaranteed.
Revised: It is an open problem whether a classical client (verifier) can delegate quantum computing to a remote quantum server in such a way that the correctness of quantum computing is somehow guaranteed.
Edit intent: clarity
Original:  More precisely, we introduce the following protocol.
Revised:  More precisely, we consider the following protocol.
Edit intent: clarity
Original:  The BQP prover first sends the BPP verifier a single bit allegedly equal to the solution of the BQP decision problem that the verifier wants to solve.
Revised:  The server first sends the BPP verifier a single bit allegedly equal to the solution of the BQP decision problem that the verifier wants to solve.
Edit intent: clarity
Original:  The BQP prover first sends the BPP verifier a single bit allegedly equal to the solution of the BQP decision problem that the verifier wants to solve.
Revised:  The BQP prover first sends the client a message allegedly equal to the solution of the BQP decision problem that the verifier wants to solve.
Edit intent: clarity
Original:  The BQP prover first sends the BPP verifier a single bit allegedly equal to the solution of the BQP decision problem that the verifier wants to solve.
Revised:  The BQP prover first sends the BPP verifier a single bit allegedly equal to the solution of the problem that the verifier wants to solve.
Edit intent: clarity
Original:  The BQP prover first sends the BPP verifier a single bit allegedly equal to the solution of the BQP decision problem that the verifier wants to solve.
Revised:  The BQP prover first sends the BPP verifier a single bit allegedly equal to the solution of the BQP decision problem that the client wants to solve.
Edit intent: clarity
Original:  The reward function is constructed in such a way that the rational prover, who wants to maximize the expected profit , has to send the correct bit to the verifier .
Revised:  The reward function is constructed in such a way that the rational prover, who wants to maximize his/her profit therefore has to send the correct bit to the verifier .
Edit intent: clarity
Original:  The reward function is constructed in such a way that the rational prover, who wants to maximize the expected profit , has to send the correct bit to the verifier .
Revised:  The reward function is constructed in such a way that the rational prover, who wants to maximize the expected profit , has to send the correct solution to the client .
Edit intent: clarity
Original: We present a novel algorithm to compute offset surfaces of shapes discretized using a dexel data structure that is both fast and trivially parallel.
Revised: We present an efficient, trivially parallelizable algorithm to compute offset surfaces of shapes discretized using a dexel data structure that is both fast and trivially parallel.
Edit intent: clarity
Original:  We present experimental timings, how they compare with previous approaches, and provide a reference implementation in the supplemental material.
Revised:  We present experimental timings, comparisons with previous approaches, and provide a reference implementation in the supplemental material.
Edit intent: clarity
Original: We present a novel system for sketch-based face image editing, enabling users to edit images in an intuitive manner by sketching a few strokes on a region of interest.
Revised: We present a novel system for sketch-based face image editing, enabling users to edit images intuitively by sketching a few strokes on a region of interest.
Edit intent: clarity
Original:  for example, robot motion control and swarm coordination require update intervals below 100 ms . Low-power wireless is preferred for its flexibility, low cost, and small form factor,  especially if the devices support multi-hop communication.
Revised:  for example, robot motion control and swarm coordination require update intervals below 100 ms . Low-power wireless is preferred for its low cost, and small form factor, especially if the devices support multi-hop communication.
Edit intent: clarity
Original:  for example, robot motion control and swarm coordination require update intervals below 100 ms . Low-power wireless is preferred for its flexibility, low cost, and small form factor,  especially if the devices support multi-hop communication.
Revised:  for example, robot motion control and swarm coordination require update intervals below 100 ms . Low-power wireless is preferred for its flexibility, low cost, small form factor, especially if the devices support multi-hop communication.
Edit intent: fluency
Original:  for example, robot motion control and swarm coordination require update intervals below 100 ms . Low-power wireless is preferred for its flexibility, low cost, and small form factor,  especially if the devices support multi-hop communication.
Revised:  for example, robot motion control and swarm coordination require update intervals below 100 ms . Low-power wireless is preferred for its flexibility, low cost, and small form factor, and flexibility, especially if the devices support multi-hop communication.
Edit intent: coherence
Original:  Thus far, however, closed-loop control over multi-hop low-power wireless has only been demonstrated for update intervals on the order of multiple seconds.
Revised:  Thus far, however, feedback control over multi-hop low-power wireless has only been demonstrated for update intervals on the order of multiple seconds.
Edit intent: clarity
Original:  Thus far, however, closed-loop control over multi-hop low-power wireless has only been demonstrated for update intervals on the order of multiple seconds.
Revised:  Thus far, however, closed-loop control over multi-hop low-power wireless has only been demonstrated for update intervals on the order of seconds.
Edit intent: clarity
Original:  This paper presents a wireless embedded system that tames imperfections impairing control performance such as jitter or packet loss ,
Revised:  This paper presents a wireless embedded system that tames imperfections impairing control performance such as jitter or message losses ,
Edit intent: clarity
Original:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear dynamic systems . Using experiments on a testbed with multiple cart-pole systems, we are the first to demonstrate the feasibility and to assess the performance of closed-loop control and coordination over multi-hop low-power wireless for update intervals from 20 ms to 50 ms .
Revised:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear physical processes . Using experiments on a testbed with multiple cart-pole systems, we are the first to demonstrate the feasibility and to assess the performance of closed-loop control and coordination over multi-hop low-power wireless for update intervals from 20 ms to 50 ms .
Edit intent: clarity
Original:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear dynamic systems . Using experiments on a testbed with multiple cart-pole systems, we are the first to demonstrate the feasibility and to assess the performance of closed-loop control and coordination over multi-hop low-power wireless for update intervals from 20 ms to 50 ms .
Revised:  and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for linear dynamic systems . Using experiments on a testbed with multiple cart-pole systems, we are the first to demonstrate and evaluate feedback control and coordination over multi-hop low-power wireless for update intervals from 20 ms to 50 ms .
Edit intent: clarity