wanyu/IteraTeR_v2 huggingface dataset:
Original:  Despite the success of UNet architectures, the use of upsampling layers can cause checkerboard artefactsor blurring .
Revised:  Despite the success of UNet architectures, the use of upsampling layers can cause artefacts .
Edit intent: clarity
Original:  A new upsampling module is then proposed, based on a novel generalisation of the Guided Image Filter, that provides spectrally consistent outputs when used in a UNet architecture, forming the Guided UNet (GUNet).
Revised:  A new upsampling module is proposed, based on a novel generalisation of the Guided Image Filter, that provides spectrally consistent outputs when used in a UNet architecture, forming the Guided UNet (GUNet).
Edit intent: coherence
Original:  A new upsampling module is then proposed, based on a novel generalisation of the Guided Image Filter, that provides spectrally consistent outputs when used in a UNet architecture, forming the Guided UNet (GUNet).
Revised:  A new upsampling module is then proposed, based on a novel use of the Guided Image Filter, that provides spectrally consistent outputs when used in a UNet architecture, forming the Guided UNet (GUNet).
Edit intent: clarity
Original:  However, high-dimensionality of the datasets produced by simulations makes it difficult for thorough analysis, and further hinders a deeper understanding of the biological system .
Revised:  However, high-dimensionality of the datasets produced by simulations makes it difficult for thorough analysis, and further hinders a deeper understanding of biomacromolecules .
Edit intent: clarity
Original:  To gain more insights into the protein structure-function relations, appropriate dimensionality reduction methods are needed to project simulations to low-dimensional spaces.
Revised:  To gain more insights into the protein structure-function relations, appropriate dimensionality reduction methods are needed to project simulations onto low-dimensional spaces.
Edit intent: fluency
Original:  Linear dimensionality reduction methods, such as principal component analysis (PCA) and time-structure based independent component analysis (t-ICA), fail to preserve enough structural information.
Revised:  Linear dimensionality reduction methods, such as principal component analysis (PCA) and time-structure based independent component analysis (t-ICA), could not preserve sufficient structural information.
Edit intent: clarity
Original:  Moreover, the neuron weights in the hidden layer of supervised ivis framework provide new prospective for deciphering the allosteric process of proteins .
Revised:  Moreover, ivis framework is capable of providing new prospective for deciphering the allosteric process of proteins .
Edit intent: clarity
Original:  This work builds on the confluence of conceptual tools from Gardenfors semantic spaces, categorical compositional linguistics, and applied category theory to present a domain-independent and categorial formalism of 'concept'.
Revised:  This work builds on the confluence of conceptual tools from G\"ardenfors semantic spaces, categorical compositional linguistics, and applied category theory to present a domain-independent and categorial formalism of 'concept'.
Edit intent: fluency
Original:  This work builds on the confluence of conceptual tools from Gardenfors semantic spaces, categorical compositional linguistics, and applied category theory to present a domain-independent and categorial formalism of 'concept'.
Revised:  This work builds on the confluence of conceptual tools from Gardenfors semantic spaces, categorical compositional linguistics, and applied category theory to present a domain-independent and categorical formalism of 'concept'.
Edit intent: fluency
Original: One of the more widely advocated solutions to slowing down the spread of COVID-19 has been automated contact tracing.
Revised: One of the more widely advocated solutions for slowing down the spread of COVID-19 has been automated contact tracing.
Edit intent: fluency
Original:  Since proximity data can be collected by personal mobile devices, the natural proposal has been to use this for contact tracing as this provides a major gain over a manual implementation.
Revised:  Since proximity data can be collected by personal mobile devices, the natural proposal has been to use this for automated contact tracing providing a major gain over a manual implementation.
Edit intent: clarity
Original:  We highlight the infrastructure and social structures required for automated contact tracing to work for the current pandemic .
Revised:  We highlight the infrastructure and social structures required for automated contact tracing to work .
Edit intent: clarity
Original:  We display the vulnerabilities of the strategy to inadequately sample the population, which results in the inability to sufficiently determine significant contact with infected individuals.
Revised:  We display the vulnerabilities of the strategy to inadequate sampling of the population, which results in the inability to sufficiently determine significant contact with infected individuals.
Edit intent: fluency
Original:  We conclude that a strong reliance on contact tracing to contain the spread of the SARS-CoV-2 pandemic can lead to the potential danger of allowing the pandemic to spread unchecked.
Revised:  We conclude that a strong reliance on contact tracing to contain the spread of the SARS-CoV-2 pandemic can be counterproductive and allow the pandemic to spread unchecked.
Edit intent: clarity
Original:  A carefully thought out strategy for controlling the spread of the pandemic along with automated contact tracing can lead to an optimal solution  .
Revised:  The simultaneous implementation of various mitigation methods along with automated contact tracing can lead to an optimal solution .
Edit intent: clarity
Original:  A carefully thought out strategy for controlling the spread of the pandemic along with automated contact tracing can lead to an optimal solution  .
Revised:  A carefully thought out strategy for controlling the spread of the pandemic along with automated contact tracing is necessary for reaching an optimal solution .
Edit intent: clarity
Original:  A carefully thought out strategy for controlling the spread of the pandemic along with automated contact tracing can lead to an optimal solution  .
Revised:  A carefully thought out strategy for controlling the spread of the pandemic along with automated contact tracing can lead to an optimal solution to contain the pandemic .
Edit intent: clarity
Original:  A non-linear system of equations is presented , which is obtained by studying the possibility of building a hybrid solar receiver, and its stability is briefly analyzed, as well as where a possible solution is found and finally it is solved using the fractional pseudo-Newton method.
Revised:  In the nonlinear system mentioned , which is obtained by studying the possibility of building a hybrid solar receiver, and its stability is briefly analyzed, as well as where a possible solution is found and finally it is solved using the fractional pseudo-Newton method.
Edit intent: clarity
Original:  A non-linear system of equations is presented , which is obtained by studying the possibility of building a hybrid solar receiver, and its stability is briefly analyzed, as well as where a possible solution is found and finally it is solved using the fractional pseudo-Newton method.
Revised:  A non-linear system of equations is presented , which is obtained by studying the possibility of building a hybrid solar receiver, its stability is briefly analyzed, as well as where a possible solution is found and finally it is solved using the fractional pseudo-Newton method.
Edit intent: coherence
Original: The following document presents a possible solution  for a nonlinear system that models the construction of a hybrid solar receiver , it is necessary to mention that the solution of the aforementioned system is relatively difficult to obtain by iterative methods since the system is  unstable.
Revised: The following document presents a possible solution for a nonlinear system that models the construction of a hybrid solar receiver ; It is necessary to mention that the solution of the aforementioned system is relatively difficult to obtain by iterative methods since the system is unstable.
Edit intent: fluency
Original: The following document presents a possible solution  for a nonlinear system that models the construction of a hybrid solar receiver , it is necessary to mention that the solution of the aforementioned system is relatively difficult to obtain by iterative methods since the system is  unstable.
Revised: The following document presents a possible solution for a nonlinear system that models the construction of a hybrid solar receiver , it is necessary to mention that the solution of the aforementioned system is relatively difficult to obtain through iterative methods since the system is unstable.
Edit intent: clarity
Original: The following document presents a possible solution  for a nonlinear system that models the construction of a hybrid solar receiver , it is necessary to mention that the solution of the aforementioned system is relatively difficult to obtain by iterative methods since the system is  unstable.
Revised: The following document presents a possible solution for a nonlinear system that models the construction of a hybrid solar receiver , it is necessary to mention that the solution of the aforementioned system is relatively difficult to obtain by iterative methods since the system is apparently unstable.
Edit intent: coherence
Original:  The method described above receives the name of the fractional pseudo-Newton method, which has an order of convergence (at least) linear, but it is easy to implement and it is not necessary to invert some matrix for solving nonlinear systems and linear systems .
Revised:  The method described above has an order of convergence (at least) linear, but it is easy to implement and it is not necessary to invert some matrix for solving nonlinear systems and linear systems .
Edit intent: coherence
Original: One of the many unresolved questions that revolves around the ongoing Covid-19 pandemic is whether local outbreaks can depend on ambient conditions like temperature and relative humidity.
Revised: One of the many unresolved questions that revolves around the Covid-19 pandemic is whether local outbreaks can depend on ambient conditions like temperature and relative humidity.
Edit intent: clarity
Original:  In this paper, we put forward a model that tries to explain and describe the possible temperature and relative humidity dependence of viral outbreaks controlled by transmission of respiratory droplets .
Revised:  In this paper, we develop a model that tries to explain and describe the possible temperature and relative humidity dependence of viral outbreaks controlled by transmission of respiratory droplets .
Edit intent: clarity
Original:  In this paper, we put forward a model that tries to explain and describe the possible temperature and relative humidity dependence of viral outbreaks controlled by transmission of respiratory droplets .
Revised:  In this paper, we put forward a model that tries to explain and describe the temperature and relative humidity dependence of viral outbreaks controlled by transmission of respiratory droplets .
Edit intent: clarity
Original:  In this paper, we put forward a model that tries to explain and describe the possible temperature and relative humidity dependence of viral outbreaks controlled by transmission of respiratory droplets .
Revised:  In this paper, we put forward a model that tries to explain and describe the possible temperature and relative humidity sensitivity of respiratory droplets and their possible connection in determining viral outbreaks .
Edit intent: clarity
Original:  As such, the infection rate constant is  shown to be linearly related to the square of the virus laden droplet lifetime.
Revised:  As such, the infection rate constant is shown to be a function of the respiratory droplet lifetime.
Edit intent: clarity
Original:  The model shows that the overall evaporation/desiccation time is indeed dependent on ambient temperature and relative humidity .
Revised:  Droplet evaporation/desiccation time is indeed dependent on ambient temperature and relative humidity .
Edit intent: clarity
Original:  Since the droplet evaporation time determines the infection rate constant,  temperature and relative humidity are shown to rather strongly impact the outbreak growth rates.
Revised:  Since the droplet evaporation time determines the infection rate constant, ambient temperature and relative humidity are shown to rather strongly impact the outbreak growth rates.
Edit intent: clarity
Original:  Since the droplet evaporation time determines the infection rate constant,  temperature and relative humidity are shown to rather strongly impact the outbreak growth rates.
Revised:  Since the droplet evaporation time determines the infection rate constant, temperature and relative humidity are shown to impact the outbreak growth rates.
Edit intent: clarity
Original:  In Adversarial Environments , the adversaries can be intentional and unintentional based on their needs and motivation.
Revised:  In Adversarial Environments , the adversaries can be intentional or unintentional based on their needs and motivation.
Edit intent: fluency
Original:  In order to mimic the rational decision process of an intelligent agent, we propose a new  Game-Theoretic Utility Tree (GUT) architecture combining the core principles of game theory, utility theory,  probabilistic graphical models , and tree structure decomposing the high-level strategy to executable lower levels.
Revised:  In order to mimic the rational decision process of an intelligent agent, we propose a new Game-Theoretic Utility Tree (GUT) architecture combining the core principles of game theory, utility theory, and probabilistic graphical models , and tree structure decomposing the high-level strategy to executable lower levels.
Edit intent: fluency
Original:  In order to mimic the rational decision process of an intelligent agent, we propose a new  Game-Theoretic Utility Tree (GUT) architecture combining the core principles of game theory, utility theory,  probabilistic graphical models , and tree structure decomposing the high-level strategy to executable lower levels.
Revised:  In order to mimic the rational decision process of an intelligent agent, we propose a new Game-Theoretic Utility Tree (GUT) architecture combining the core principles of game theory, utility theory, probabilistic graphical models , and tree structure decomposing the high-level strategies into executable lower levels.
Edit intent: fluency
Original: Many underlying relationships among multi-agent systems (MAS) in various scenarios, especially agents working on dangerous, hazardous , and risky situations, can be represented in terms of game theory.
Revised: Underlying relationships among multi-agent systems (MAS) in various scenarios, especially agents working on dangerous, hazardous , and risky situations, can be represented in terms of game theory.
Edit intent: clarity
Original: Many underlying relationships among multi-agent systems (MAS) in various scenarios, especially agents working on dangerous, hazardous , and risky situations, can be represented in terms of game theory.
Revised: Many underlying relationships among multi-agent systems (MAS) in hazardous scenarios can be represented in terms of game theory.
Edit intent: clarity
Original:  Our experimental results demonstrate that the GUT significantly enhances cooperation among MAS to successfully complete the assigned tasks with lower costs and higher winning probabilities against adversaries .
Revised:  Our experimental results demonstrate that the GUT significantly enhances cooperation among MAS to successfully complete the assigned tasks with lower costs and a higher winning rate .
Edit intent: clarity
Original: We develop two novel classes of  energy-preserving algorithms for the sine-Gordon (SG) equation subject to Neumann boundary conditions.
Revised: We present two novel classes of energy-preserving algorithms for the sine-Gordon (SG) equation subject to Neumann boundary conditions.
Edit intent: clarity
Original: We develop two novel classes of  energy-preserving algorithms for the sine-Gordon (SG) equation subject to Neumann boundary conditions.
Revised: We develop two novel classes of energy-preserving algorithms for the sine-Gordon equation subject to Neumann boundary conditions.
Edit intent: clarity
Original:  The cosine pseudo-spectral method is first employed for spatial discretization under two different meshes to obtain two structure-preserving semi-discrete schemes, which are recast into a finite-dimensional Hamiltonian system and thus admit an energy conservation law .
Revised:  The cosine pseudo-spectral method is first used to develop structure-preserving spatial discretizations under two different meshes to obtain two structure-preserving semi-discrete schemes, which are recast into a finite-dimensional Hamiltonian system and thus admit an energy conservation law .
Edit intent: clarity
Original:  The cosine pseudo-spectral method is first employed for spatial discretization under two different meshes to obtain two structure-preserving semi-discrete schemes, which are recast into a finite-dimensional Hamiltonian system and thus admit an energy conservation law .
Revised:  The cosine pseudo-spectral method is first employed for spatial discretization under two different meshes , which result two finite-dimensional Hamiltonian system and thus admit an energy conservation law .
Edit intent: clarity
Original:  Then we combine a prediction-correction Crank-Nicolson method with an energy projection technique to arrive at fully discrete energy-preserving schemes .
Revised:  Then we combine the prediction-correction Crank-Nicolson method with an energy projection technique to arrive at fully discrete energy-preserving schemes .
Edit intent: fluency
Original:  Then we combine a prediction-correction Crank-Nicolson method with an energy projection technique to arrive at fully discrete energy-preserving schemes .
Revised:  Then we combine a prediction-correction Crank-Nicolson scheme with the projection approach to arrive at fully discrete energy-preserving schemes .
Edit intent: clarity
Original:  Then we combine a prediction-correction Crank-Nicolson method with an energy projection technique to arrive at fully discrete energy-preserving schemes .
Revised:  Then we combine a prediction-correction Crank-Nicolson method with an energy projection technique to arrive at fully discrete energy-preserving methods .
Edit intent: clarity
Original:  Alternatively, we introduce a supplementary variable to transform the SG model into a relaxation system, which is named the supplementary variable method (SVM). Furthermore, we apply the cosine pseudo-spectral method in space and the prediction-correction Crank-Nicolson scheme in time to derive a new class of energy-preserving schemes.
Revised:  Alternatively, we introduce a supplementary variable to transform the initial model into a relaxation system, which is named the supplementary variable method (SVM). Furthermore, we apply the cosine pseudo-spectral method in space and the prediction-correction Crank-Nicolson scheme in time to derive a new class of energy-preserving schemes.
Edit intent: coherence
Original:  Some benchmark examples  are presented to demonstrate the accuracy and efficiency of the proposed schemes .
Revised:  Some benchmark examples are presented to demonstrate the accuracy , efficiency and superiority of the proposed schemes .
Edit intent: clarity
Original:  The new acquisition function combines the probability that a solution lies at the boundary between feasible and infeasible spaces  representing exploitation) as well as the entropy in predictions (representing exploration).
Revised:  The new acquisition function combines the probability that a solution lies at the boundary between feasible and infeasible spaces ( representing exploitation) as well as the entropy in predictions (representing exploration).
Edit intent: fluency
Original:  The new acquisition function combines the probability that a solution lies at the boundary between feasible and infeasible spaces  representing exploitation) as well as the entropy in predictions (representing exploration).
Revised:  The new acquisition function combines the probability that a solution lies at the boundary between feasible and infeasible spaces representing exploitation) and the entropy in predictions (representing exploration).
Edit intent: coherence
Original:  In our experiments, the best classifier has a median informedness of at least 97.95%DIFDELCMD < \\%%% %DIF < across five of the G problems.abstract 
Revised:  %DIFDELCMD < \\%%% %DIF < across five of the G problems.abstract 
Edit intent: coherence
Original: In this paper we extend the deterministic sublinear FFT algorithm  for fast reconstruction of M-sparse vectors  of length N= 2^J considered\mathbf x } }  }  } } in Plonka et al. (2018)  .
Revised: In this paper we extend the deterministic sublinear FFT algorithm for fast reconstruction of M-sparse vectors \mathbf x of length N= 2^J considered\mathbf x } } } } } in Plonka et al. (2018) .
Edit intent: fluency
Original:  Our numerical experiences show that our modification has a huge impact on the stability of the algorithm , while the runtime of the algorithm is still \mathcal O (M^2 \, \log N).
Revised:  Our numerical experiments show that our modification has a huge impact on the stability of the algorithm , while the runtime of the algorithm is still \mathcal O (M^2 \, \log N).
Edit intent: clarity
Original:  Our numerical experiences show that our modification has a huge impact on the stability of the algorithm , while the runtime of the algorithm is still \mathcal O (M^2 \, \log N).
Revised:  Our numerical experiences show that our modification has a huge impact on the stability of the algorithm , while the runtime of the algorithm is still (M^2 \, \log N).
Edit intent: clarity
Original: In this paper we derive optimal rank-1  approximations with Hankel or Toeplitz structure with regard to two different matrix norms, the Frobenius norm and the spectral norm .
Revised: We characterize optimal rank-1 approximations with Hankel or Toeplitz structure with regard to two different matrix norms, the Frobenius norm and the spectral norm .
Edit intent: clarity
Original: In this paper we derive optimal rank-1  approximations with Hankel or Toeplitz structure with regard to two different matrix norms, the Frobenius norm and the spectral norm .
Revised: In this paper we derive optimal rank-1 matrix approximations with Hankel or Toeplitz structure with regard to two different matrix norms, the Frobenius norm and the spectral norm .
Edit intent: fluency
Original: In this paper we derive optimal rank-1  approximations with Hankel or Toeplitz structure with regard to two different matrix norms, the Frobenius norm and the spectral norm .
Revised: In this paper we derive optimal rank-1 approximations with Hankel or Toeplitz structure with regard to two different norms, the Frobenius norm and the spectral norm .
Edit intent: clarity
Original:  We also show that the often used Cadzow algorithm for structured low-rank approximations always converges to a fixed point in the rank-1 case , however, it usually does not converge to the optimal solution -- neither with regard to the Frobenius norm nor the spectral norm.
Revised:  We also prove that the Cadzow algorithm for structured low-rank approximations always converges to a fixed point in the rank-1 case , however, it usually does not converge to the optimal solution -- neither with regard to the Frobenius norm nor the spectral norm.
Edit intent: clarity