wanyu/IteraTeR_v2 huggingface dataset:
Original:  To deal with such problem, robust adaptive steganography is proposed to enable the receiver to extract the secret message from the damaged stego image . Previous works utilise reverse engineering and compression-resistant domain constructing to implement robust adaptive steganography.
Revised:  To deal with such problem, robust adaptive steganography is proposed to enable the receiver to extract the secret message from the damaged stego image . Previous works utilize reverse engineering and compression-resistant domain constructing to implement robust adaptive steganography.
Edit intent: fluency
Original:  In this paper, we adopt modification with re-compression in embedding scheme to improve the robustness of stego sequences  .
Revised:  In this paper, we adopt modification with re-compression scheme to improve the robustness of stego sequences .
Edit intent: clarity
Original:  In this paper, we adopt modification with re-compression in embedding scheme to improve the robustness of stego sequences  .
Revised:  In this paper, we adopt modification with re-compression in embedding scheme to improve the robustness of stego sequences in stego images .
Edit intent: clarity
Original:  In addition, we add an additional check code to further reduce the average extraction error rate based on the framework of E-DMAS (Enhancing Dither Modulation based robust Adaptive Steganography).
Revised:  In addition, we add additional check codes to further reduce the average extraction error rate based on the framework of E-DMAS (Enhancing Dither Modulation based robust Adaptive Steganography).
Edit intent: fluency
Original:  Compared with GMAS (Generalized dither Modulation based robust Adaptive Steganography) and E-DMAS, Experiments show that our scheme can achieve strong robustness and improve the security of robust adaptive steganography greatly when the channel quality factor is known.
Revised:  Compared with GMAS (Generalized dither Modulation based robust Adaptive Steganography) and E-DMAS, experiment results show that our scheme can achieve strong robustness and improve the security of robust adaptive steganography greatly when the channel quality factor is known.
Edit intent: clarity
Original: The present manuscript concerns the design of structure-preserving discretization methods for the solution of systems of boundary controlled Partial Differential Equations (PDEs) thanks to the port- Hamiltonian formalism.
Revised: We consider the design of structure-preserving discretization methods for the solution of systems of boundary controlled Partial Differential Equations (PDEs) thanks to the port- Hamiltonian formalism.
Edit intent: clarity
Original: The present manuscript concerns the design of structure-preserving discretization methods for the solution of systems of boundary controlled Partial Differential Equations (PDEs) thanks to the port- Hamiltonian formalism.
Revised: The present manuscript concerns the design of structure-preserving discretization methods for the solution of systems of boundary controlled Partial Differential Equations (PDEs) thanks to the port-Hamiltonian formalism.
Edit intent: fluency
Original:  The proposed strategy is particularised to abstract multidimensional linear hyperbolic and parabolic systems of PDEs.
Revised:  The proposed strategy is applied to abstract multidimensional linear hyperbolic and parabolic systems of PDEs.
Edit intent: clarity
Original:  As additional support, companion interactive Jupyter notebooks are provided .
Revised:  As additional support, companion interactive Jupyter notebooks are available .
Edit intent: clarity
Original: An investigation of hanging nodes in the context of AFC schemes have been proposed.
Revised: In this work, we propose an investigation of hanging nodes in the context of AFC schemes have been proposed.
Edit intent: clarity
Original:  Results for the handling of grids with hanging nodes have been presented for higher-order Lagrange elements.
Revised:  Results for the handling of grids with hanging nodes for higher-order Lagrange elements.
Edit intent: clarity
Original: In this work, we propose an investigation of hanging nodes in the context of a posteriori error estimator for algebraic flux-corrected (AFC) schemes for stationary convection-diffusion equations.
Revised: In this work, we investigate hanging nodes in the context of a posteriori error estimator for algebraic flux-corrected (AFC) schemes for stationary convection-diffusion equations.
Edit intent: coherence
Original: In this work, we propose an investigation of hanging nodes in the context of a posteriori error estimator for algebraic flux-corrected (AFC) schemes for stationary convection-diffusion equations.
Revised: In this work, we propose an investigation of hanging nodes in the context of a posteriori error estimators for algebraic flux-correction (AFC) schemes for stationary convection-diffusion equations.
Edit intent: fluency
Original:  Numerical simulation illustrating the satisfaction and the violation of  discrete maximum principle (DMP) for the BJK limiter and the Kuzmin limiter, respectively have been presented in two dimensions.
Revised:  Numerical simulation illustrating the satisfaction and the violation of the discrete maximum principle (DMP) for the BJK limiter and the Kuzmin limiter, respectively have been presented in two dimensions.
Edit intent: fluency
Original:  Numerical simulation illustrating the satisfaction and the violation of  discrete maximum principle (DMP) for the BJK limiter and the Kuzmin limiter, respectively have been presented in two dimensions.
Revised:  Numerical simulation illustrating the satisfaction and the violation of discrete maximum principle (DMP) for the BJK limiter and the Kuzmin limiter, respectively , are presented in two dimensions.
Edit intent: clarity
Original:  We leverage steganography techniques to watermark GAN training dataset, transfer the watermark from the dataset to GAN models, and then verify the watermark from generated images.
Revised:  We leverage steganography techniques to watermark GAN training dataset, transfer the watermark from dataset to GAN models, and then verify the watermark from generated images.
Edit intent: fluency
Original:  We validate that our watermark verification is robust in wide ranges against several image perturbations . Critically, our solution treats GAN models as an independent component: watermark embedding is agnostic to GAN details and watermark verification relies only on accessing the APIs of black-box GANs.
Revised:  We validate that our watermark verification is robust in wide ranges against several image and model perturbation attacks . Critically, our solution treats GAN models as an independent component: watermark embedding is agnostic to GAN details and watermark verification relies only on accessing the APIs of black-box GANs.
Edit intent: clarity
Original: Photorealistic image generation is progressing rapidly and has reached a new level of quality , thanks to the invention and breakthroughs of generative adversarial networks (GANs).
Revised: Photorealistic image generation has reached a new level of quality , thanks to the invention and breakthroughs of generative adversarial networks (GANs).
Edit intent: coherence
Original: Photorealistic image generation is progressing rapidly and has reached a new level of quality , thanks to the invention and breakthroughs of generative adversarial networks (GANs).
Revised: Photorealistic image generation is progressing rapidly and has reached a new level of quality due to the breakthroughs of generative adversarial networks (GANs).
Edit intent: clarity
Original:  Yet  the dark side of such deepfakes, the malicious use of generated media, never stops raising concerns of visual misinformation.
Revised:  Yet , the dark side of such deepfakes, the malicious use of generated media, never stops raising concerns of visual misinformation.
Edit intent: fluency
Original:  Yet  the dark side of such deepfakes, the malicious use of generated media, never stops raising concerns of visual misinformation.
Revised:  Yet the dark side of such deepfakes, the malicious use of generated media, raises concerns about visual misinformation.
Edit intent: clarity
Original:  Existing research works on deepfake detection demonstrate impressive accuracy, while it is accompanied by adversarial iterations on detection countermeasure techniques.
Revised:  While existing research work on deepfake detection demonstrate impressive accuracy, while it is accompanied by adversarial iterations on detection countermeasure techniques.
Edit intent: fluency
Original:  In order to lead this arms race to the end, we investigate a fundamental solution on deepfake detection,  agnostic to the evolution of GANs in order to enable a responsible disclosure or regulation of such double-edged techniques.
Revised:  Thus, we seek a proactive and sustainable solution on deepfake detection, agnostic to the evolution of GANs in order to enable a responsible disclosure or regulation of such double-edged techniques.
Edit intent: clarity
Original:  In order to lead this arms race to the end, we investigate a fundamental solution on deepfake detection,  agnostic to the evolution of GANs in order to enable a responsible disclosure or regulation of such double-edged techniques.
Revised:  In order to lead this arms race to the end, we investigate a fundamental solution on deepfake detection, that is agnostic to the evolution of GANs in order to enable a responsible disclosure or regulation of such double-edged techniques.
Edit intent: coherence
Original:  We propose to embed artificial fingerprints into GAN training data, and show a surprising discovery on the transferability of such fingerprints from training data to GAN models, which in turn enables reliable detection and attribution of deepfakes.
Revised:  We propose to embed artificial fingerprints into GAN training data, we then show a surprising discovery on the transferability of such fingerprints from training data to GAN models, which in turn enables reliable detection and attribution of deepfakes.
Edit intent: coherence
Original:  Our empirical study shows that our fingerprinting technique (1) holds for different state-of-the-art GAN configurations, (2) turns more effective along with the development of GAN techniques, (3) has a negligible side effect on the generation quality, and (4) stays robust against image-level and model-level perturbations.
Revised:  Our empirical study shows that our fingerprinting technique (1) holds for different state-of-the-art GAN configurations, (2) gets more effective along with the development of GAN techniques, (3) has a negligible side effect on the generation quality, and (4) stays robust against image-level and model-level perturbations.
Edit intent: clarity
Original:  As a result, we are able to evidence accurate deepfake detection/attribution using our fingerprint decoder, which makes this solution stand out from the current arms race.
Revised:  As a result, we are able to evidence accurate deepfake detection/attribution using our fingerprint decoder, which makes this solution independent of the current arms race.
Edit intent: clarity
Original:  While existing research work on deepfake detection demonstrates high accuracy, it is subject to advances in generation technologies and the adversarial iterations on detection countermeasure techniques.
Revised:  While existing research work on deepfake detection demonstrates high accuracy, it is subject to advances in generation techniques and adversarial iterations on detection countermeasure techniques.
Edit intent: fluency
Original:  Thus, we seek a proactive and sustainable solution on deepfake detection, that is agnostic to the evolution of GANs , by introducing artificial fingerprints into the generated images .
Revised:  Thus, we seek a proactive and sustainable solution on deepfake detection, that is agnostic to the evolution of generative models , by introducing artificial fingerprints into the generated images .
Edit intent: clarity
Original:  Thus, we seek a proactive and sustainable solution on deepfake detection, that is agnostic to the evolution of GANs , by introducing artificial fingerprints into the generated images .
Revised:  Thus, we seek a proactive and sustainable solution on deepfake detection, that is agnostic to the evolution of GANs , by introducing artificial fingerprints into the models .
Edit intent: clarity
Original:  Our approach first embeds fingerprints into the training data, we then show a surprising discovery on the transferability of such fingerprints from training data to GAN models, which in turn enables reliable detection and attribution of deepfakes.
Revised:  Our approach first embeds fingerprints into the training data, then validate a surprising discovery on the transferability of such fingerprints from training data to GAN models, which in turn enables reliable detection and attribution of deepfakes.
Edit intent: clarity
Original:  Our approach first embeds fingerprints into the training data, we then show a surprising discovery on the transferability of such fingerprints from training data to GAN models, which in turn enables reliable detection and attribution of deepfakes.
Revised:  Our approach first embeds fingerprints into the training data, we then show a surprising discovery on the transferability of such fingerprints from training data to generative models, which in turn enables reliable detection and attribution of deepfakes.
Edit intent: clarity
Original:  Our empirical study shows that our fingerprinting technique (1) holds for different state-of-the-art GAN configurations , (2) gets more effective along with the development of GAN techniques, (3) has a negligible side effect on the generation quality, and (4 ) stays robust against image-level and model-level perturbations  .
Revised:  Our empirical study shows that our fingerprinting solution (1) holds for different state-of-the-art GAN configurations , (2) gets more effective along with the development of GAN techniques, (3) has a negligible side effect on the generation quality, and (4 ) stays robust against image-level and model-level perturbations .
Edit intent: clarity
Original:  Our empirical study shows that our fingerprinting technique (1) holds for different state-of-the-art GAN configurations , (2) gets more effective along with the development of GAN techniques, (3) has a negligible side effect on the generation quality, and (4 ) stays robust against image-level and model-level perturbations  .
Revised:  Our empirical study shows that our fingerprinting technique (1) holds for a variety of cutting-edge generative models , (2) gets more effective along with the development of GAN techniques, (3) has a negligible side effect on the generation quality, and (4 ) stays robust against image-level and model-level perturbations .
Edit intent: clarity
Original:  Our empirical study shows that our fingerprinting technique (1) holds for different state-of-the-art GAN configurations , (2) gets more effective along with the development of GAN techniques, (3) has a negligible side effect on the generation quality, and (4 ) stays robust against image-level and model-level perturbations  .
Revised:  Our empirical study shows that our fingerprinting technique (1) holds for different state-of-the-art GAN configurations , (2) leads to a negligible side effect on the generation quality, and (4 ) stays robust against image-level and model-level perturbations .
Edit intent: clarity
Original:  Our empirical study shows that our fingerprinting technique (1) holds for different state-of-the-art GAN configurations , (2) gets more effective along with the development of GAN techniques, (3) has a negligible side effect on the generation quality, and (4 ) stays robust against image-level and model-level perturbations  .
Revised:  Our empirical study shows that our fingerprinting technique (1) holds for different state-of-the-art GAN configurations , (2) gets more effective along with the development of GAN techniques, (3) has a negligible side effect on generation quality, and (4 ) stays robust against image-level and model-level perturbations .
Edit intent: clarity
Original:  Our empirical study shows that our fingerprinting technique (1) holds for different state-of-the-art GAN configurations , (2) gets more effective along with the development of GAN techniques, (3) has a negligible side effect on the generation quality, and (4 ) stays robust against image-level and model-level perturbations  .
Revised:  Our empirical study shows that our fingerprinting technique (1) holds for different state-of-the-art GAN configurations , (2) gets more effective along with the development of GAN techniques, (3) has a negligible side effect on the generation quality, (3 ) stays robust against image-level and model-level perturbations .
Edit intent: coherence
Original:  Our solution enables the responsible disclosure and regulation of such double-edged techniques and introduces a sustainable margin between real data and deepfakes , which makes this solution independent of the current arms race.
Revised:  Our solution closes the responsibility loop between publishing pre-trained generative model inventions and their possible misuses , which makes this solution independent of the current arms race.
Edit intent: clarity
Original:  Our solution enables the responsible disclosure and regulation of such double-edged techniques and introduces a sustainable margin between real data and deepfakes , which makes this solution independent of the current arms race.
Revised:  Our solution enables the responsible disclosure and regulation of such double-edged techniques and introduces a sustainable margin between real data and deepfakes , which makes it independent of the current arms race.
Edit intent: clarity
Original: We consider normal-form games with n players and two strategies for each player  where the payoffs are Bernoulli random variables .
Revised: We consider normal-form games with n players and two strategies for each player , where the payoffs are Bernoulli random variables .
Edit intent: fluency
Original:  Under these conditions we examine the asymptotic behavior of the average social utilities that correspond to the optimum , to the best and to the worst pure Nash equilibria .
Revised:  Under these conditions we examine the asymptotic behavior of the average social utilities that correspond to the optimum , to the best and worst pure Nash equilibria .
Edit intent: fluency
Original: We present a deterministic algorithm  solving discounted games with n nodes in strongly n^{O(1)}\cdot (2 + 2)^n-time.
Revised: We present a deterministic algorithm , solving discounted games with n nodes in strongly n^{O(1)}\cdot (2 + 2)^n-time.
Edit intent: fluency
Original: We present a deterministic algorithm  solving discounted games with n nodes in strongly n^{O(1)}\cdot (2 + 2)^n-time.
Revised: We present a deterministic algorithm solving discounted games with n nodes in n^{O(1)}\cdot (2 + 2)^n-time.
Edit intent: clarity
Original:  For a special case of bipartite discounted games our algorithm runs in n^{O(1)}\cdot 2^n-time.
Revised:  For bipartite discounted games our algorithm runs in n^{O(1)}\cdot 2^n-time.
Edit intent: clarity
Original:  We iterate the points on the border of this polyhedron by moving each time along a carefully chosen shift as far as possible.
Revised:  We iterate points on the border of this polyhedron by moving each time along a carefully chosen shift as far as possible.
Edit intent: fluency
Original: Cloud applications are increasingly relying on hundreds of loosely-coupled microservices to complete user requests that meet an application end-to-end QoS requirements.
Revised: Cloud applications are increasingly relying on hundreds of loosely-coupled microservices to complete user requests that meet an applications end-to-end QoS requirements.
Edit intent: fluency
Original:  In this work , we present our early work on Dagger, a hardware acceleration platform for networking, designed specifically with the unique qualities of microservices in mind.
Revised:  This work presents our early work on Dagger, a hardware acceleration platform for networking, designed specifically with the unique qualities of microservices in mind.
Edit intent: fluency
Original:  Unlike the traditional cloud systems with PCIe links as the de facto NIC I/O interface, which lack the efficiency needed for fine-grained microservices and add non-negligible overheads, we leverage memory-interconnected FPGAs as networking devices to make I/Os more efficient, transparent and programmable .
Revised:  Unlike the traditional cloud systems that use PCIe links as the de facto NIC I/O interface, which lack the efficiency needed for fine-grained microservices and add non-negligible overheads, we leverage memory-interconnected FPGAs as networking devices to make I/Os more efficient, transparent and programmable .
Edit intent: fluency
Original:  Unlike the traditional cloud systems with PCIe links as the de facto NIC I/O interface, which lack the efficiency needed for fine-grained microservices and add non-negligible overheads, we leverage memory-interconnected FPGAs as networking devices to make I/Os more efficient, transparent and programmable .
Revised:  Unlike the traditional cloud systems with PCIe links as the NIC I/O interface, which lack the efficiency needed for fine-grained microservices and add non-negligible overheads, we leverage memory-interconnected FPGAs as networking devices to make I/Os more efficient, transparent and programmable .
Edit intent: clarity
Original:  Unlike the traditional cloud systems with PCIe links as the de facto NIC I/O interface, which lack the efficiency needed for fine-grained microservices and add non-negligible overheads, we leverage memory-interconnected FPGAs as networking devices to make I/Os more efficient, transparent and programmable .
Revised:  Unlike the traditional cloud systems with PCIe links as the de facto NIC I/O interface, we leverage memory-interconnected FPGAs as networking devices to make I/Os more efficient, transparent and programmable .
Edit intent: coherence
Original:  Unlike the traditional cloud systems with PCIe links as the de facto NIC I/O interface, which lack the efficiency needed for fine-grained microservices and add non-negligible overheads, we leverage memory-interconnected FPGAs as networking devices to make I/Os more efficient, transparent and programmable .
Revised:  Unlike the traditional cloud systems with PCIe links as the de facto NIC I/O interface, which lack the efficiency needed for fine-grained microservices and add non-negligible overheads, we leverage memory-interconnected FPGAs as networking devices to provide the efficiency, transparency, and programmability needed for fine-grained microservices .
Edit intent: clarity
Original:  We show that this considerably improves CPU utilization , performance, and RPC scalability in cloud microservices .
Revised:  We show that this considerably improves CPU utilization and performance for cloud RPCs .
Edit intent: clarity
Original:  The approximation error is measured in the norm of the isotropic Sobolev space W^{1,p \mathbb I%DIFDELCMD < }%%% ^d).
Revised:  The approximation error is measured in the norm of isotropic Sobolev space W^{1,p \mathbb I%DIFDELCMD < }%%% ^d).
Edit intent: fluency
Original:  Moreover, we show that under a certain restriction the curse of dimensionality can be avoided in the approximations by sparse-grid sampling recovery and deep ReLU neural networks .
Revised:  The proof of these results are in particular, relied on the approximation by sparse-grid sampling recovery and deep ReLU neural networks .
Edit intent: clarity
Original: In 12%DIFDELCMD < ]%%% , the authors introduce an adaptive, stabilized finite element method (FEM), which solves a stable saddle-point problem .
Revised:  12%DIFDELCMD < ]%%% , the authors introduce an adaptive, stabilized finite element method (FEM), which solves a stable saddle-point problem .
Edit intent: coherence