wanyu/IteraTeR_v2 huggingface dataset:
Original:  Specifically, a CPPN can define latent vector GAN inputs as a function of geometry, which provides a way to organize level segments output by a GAN into a complete level .
Revised:  CPPNs define latent vector GAN inputs as a function of geometry, which provides a way to organize level segments output by a GAN into a complete level .
Edit intent: clarity
Original:  Specifically, a CPPN can define latent vector GAN inputs as a function of geometry, which provides a way to organize level segments output by a GAN into a complete level .
Revised:  Specifically, a CPPN can define latent vector GAN inputs as a function of geometry, organizing segments output by a GAN into a complete level .
Edit intent: clarity
Original:  Specifically, a CPPN can define latent vector GAN inputs as a function of geometry, which provides a way to organize level segments output by a GAN into a complete level .
Revised:  Specifically, a CPPN can define latent vector GAN inputs as a function of geometry, which provides a way to organize level segments output by a GAN into complete levels .
Edit intent: fluency
Original:  However, a collection of latent vectors can also be evolved directly, to produce more chaotic levels.
Revised:  However, collections of latent vectors can also be evolved directly, to produce more chaotic levels.
Edit intent: fluency
Original:  However, a collection of latent vectors can also be evolved directly, to produce more chaotic levels.
Revised:  However, a collection of latent vectors can also be evolved directly, producing more chaotic levels.
Edit intent: coherence
Original:  Here, we propose a new hybrid approach that evolves CPPNs first, but allows the latent vectors to evolve later, and combines the benefits of both approaches.
Revised:  We propose a hybrid approach that evolves CPPNs first, but allows the latent vectors to evolve later, and combines the benefits of both approaches.
Edit intent: clarity
Original:  Here, we propose a new hybrid approach that evolves CPPNs first, but allows the latent vectors to evolve later, and combines the benefits of both approaches.
Revised:  Here, we propose a new hybrid approach that evolves CPPNs first, but allows latent vectors to evolve later, and combines the benefits of both approaches.
Edit intent: coherence
Original:  Here, we propose a new hybrid approach that evolves CPPNs first, but allows the latent vectors to evolve later, and combines the benefits of both approaches.
Revised:  Here, we propose a new hybrid approach that evolves CPPNs first, but allows the latent vectors to evolve later, combining the benefits of both approaches.
Edit intent: coherence
Original:  In particular, we show the necessary and sufficient condition such that the binary divergences, which are divergences between probability measures on the same 2-point set, always attain lower bounds.
Revised:  In particular, we show a necessary and sufficient condition such that the binary divergences, which are divergences between probability measures on the same 2-point set, always attain lower bounds.
Edit intent: fluency
Original:  We derive differntial and integral relations between  \alpha-divergences that are generalizations of the relation between the Kullback-Leibler divergence and the \chi^2-divergence.
Revised:  In this paper, we derive differential and integral relations between \alpha-divergences that are generalizations of the relation between the Kullback-Leibler divergence and the \chi^2-divergence.
Edit intent: clarity
Original:  We derive differntial and integral relations between  \alpha-divergences that are generalizations of the relation between the Kullback-Leibler divergence and the \chi^2-divergence.
Revised:  We derive differntial and integral relations between the \alpha-divergences that are generalizations of the relation between the Kullback-Leibler divergence and the \chi^2-divergence.
Edit intent: fluency
Original:  We also show tight lower bounds for  \alpha-divergences under given means and variances.
Revised:  We also show tight lower bounds for the \alpha-divergences under given means and variances.
Edit intent: fluency
Original:  Here, we generalize the theory of randomized SVD to multivariable Gaussian vectors, allowing one to incorporate prior knowledge of A into the algorithm.
Revised:  Here, we generalize the theory of randomized SVD to multivariate Gaussian vectors, allowing one to incorporate prior knowledge of A into the algorithm.
Edit intent: fluency
Original: Generating natural speech with  diverse and smooth prosody pattern is a challenging task.
Revised: Generating natural speech with a diverse and smooth prosody pattern is a challenging task.
Edit intent: fluency
Original:  Although random sampling with phone-level prosody distribution has been investigated to generate different prosody patterns, the diversity of the generated speech is still very limited and far from what can be achieved by human .
Revised:  Although random sampling with phone-level prosody distribution has been investigated to generate different prosody patterns, the diversity of the generated speech is still very limited and far from what can be achieved by humans .
Edit intent: fluency
Original:  In this work, we propose a novel approach that models phone-level prosodies with a GMM-based mixture density network  and then extend it for multi-speaker TTS using speaker adaptation transforms of Gaussian means and variances.
Revised:  In this work, we propose a novel approach that models phone-level prosodies with a GMM-based mixture density network (MDN) and then extend it for multi-speaker TTS using speaker adaptation transforms of Gaussian means and variances.
Edit intent: clarity
Original: Grid-forming and grid-following inverters are recognized as two main types of power electronic converters for integrating renewable energy resources into power systems .
Revised: Power electronic converters for integrating renewable energy resources into power systems .
Edit intent: coherence
Original:  They hold certain similarities, but more differences, which makes their relationship quite subtle and ambiguous .
Revised:  They hold certain similarities, but several important differences, which makes their relationship quite subtle and ambiguous .
Edit intent: clarity
Original:  They hold certain similarities, but more differences, which makes their relationship quite subtle and ambiguous .
Revised:  They hold certain similarities, but more differences, which means that the relationship between them is quite subtle and ambiguous .
Edit intent: clarity
Original:  They hold certain similarities, but more differences, which makes their relationship quite subtle and ambiguous .
Revised:  They hold certain similarities, but more differences, which makes their relationship quite subtle and sometimes obscure .
Edit intent: clarity
Original:  In this article, a new perspective called duality is proposed to overcome this problem, which successfully unifies the grid interfacing characteristics and grid synchronization of them in a very symmetric and graceful form.
Revised:  In this article, a new perspective based on duality is proposed to overcome this problem, which successfully unifies the grid interfacing characteristics and grid synchronization of them in a very symmetric and graceful form.
Edit intent: clarity
Original:  In this article, a new perspective called duality is proposed to overcome this problem, which successfully unifies the grid interfacing characteristics and grid synchronization of them in a very symmetric and graceful form.
Revised:  In this article, a new perspective called duality is proposed to overcome this problem, which successfully unifies the grid interfacing and graceful form.
Edit intent: coherence
Original:  As analyzed, the grid-forming and grid-following inverters are essentially dual to each other , which is further based on the duality of a) synchronization controllers: frequency droop control and phase-locked loop (PLL);
Revised:  As analyzed, the grid-forming and grid-following inverters are duals of each other in several ways including a) synchronization controllers: frequency droop control and phase-locked loop (PLL);
Edit intent: clarity
Original:   e) grid strength  : strong-grid instability and weak-grid instability ;
Revised:  and e) grid strength : strong-grid instability and weak-grid instability ;
Edit intent: fluency
Original:  etc. The detailed swing characteristics are also derived in dual form for both inverters, which reveals the dynamic interaction among grid strength,  synchronization controllers, and  inner-loop controllers , as well as their effects on stability.
Revised:  etc. The detailed swing characteristics are also derived in dual form for two inverter types, which reveal the dynamic interaction among grid strength, synchronization controllers, and inner-loop controllers , as well as their effects on stability.
Edit intent: clarity
Original:  etc. The detailed swing characteristics are also derived in dual form for both inverters, which reveals the dynamic interaction among grid strength,  synchronization controllers, and  inner-loop controllers , as well as their effects on stability.
Revised:  etc. The detailed swing characteristics are also derived in dual form for both inverters, which reveals the dynamic interaction between the grid strength, synchronization controllers, and inner-loop controllers , as well as their effects on stability.
Edit intent: fluency
Original:  etc. The detailed swing characteristics are also derived in dual form for both inverters, which reveals the dynamic interaction among grid strength,  synchronization controllers, and  inner-loop controllers , as well as their effects on stability.
Revised:  etc. The detailed swing characteristics are also derived in dual form for both inverters, which reveals the dynamic interaction among grid strength, the synchronization controllers, and inner-loop controllers , as well as their effects on stability.
Edit intent: fluency
Original:  etc. The detailed swing characteristics are also derived in dual form for both inverters, which reveals the dynamic interaction among grid strength,  synchronization controllers, and  inner-loop controllers , as well as their effects on stability.
Revised:  etc. The detailed swing characteristics are also derived in dual form for both inverters, which reveals the dynamic interaction among grid strength, synchronization controllers, and the inner-loop controllers , as well as their effects on stability.
Edit intent: coherence
Original:  Typical cases , namely single-inverter-infinite-bus systems and  multi-inverter power systems, are studied and simulated to validate the theoretical analysis .
Revised:  Typical cases , namely single-inverter-infinite-bus systems and a multi-inverter power systems, are studied and simulated to validate the theoretical analysis .
Edit intent: fluency
Original:  Typical cases , namely single-inverter-infinite-bus systems and  multi-inverter power systems, are studied and simulated to validate the theoretical analysis .
Revised:  Typical cases , namely single-inverter-infinite-bus systems and multi-inverter power network .
Edit intent: clarity
Original: Simulation of contact mechanics in fractured media is of paramount important in the scope of computational mechanics.
Revised: Simulation of contact mechanics in fractured media is of paramount important in computational mechanics.
Edit intent: clarity
Original:  A series of numerical tests is conducted to study the contact mechanics of single- and multi-crossing fractures.
Revised:  Then, a series of numerical tests is conducted to study the contact mechanics of single- and multi-crossing fractures.
Edit intent: coherence
Original:  Benchmark study is presented to verify the presented numerical method .
Revised:  Benchmark study is performed to verify the presented numerical method .
Edit intent: fluency
Original:  Benchmark study is presented to verify the presented numerical method .
Revised:  Benchmark study is presented to verify the presented mixed-FE scheme .
Edit intent: clarity
Original:  The effects of crossing fractures on the deformation field can be observed in the calculated results , in which the variation of slippage /opening is analyzed by different loading conditions.
Revised:  The effects of crossing fractures on the deformation field are observed in the calculated results , in which the variation of slippage /opening is analyzed by different loading conditions.
Edit intent: clarity
Original:  The effects of crossing fractures on the deformation field can be observed in the calculated results , in which the variation of slippage /opening is analyzed by different loading conditions.
Revised:  The effects of crossing fractures on the deformation field can be observed in the simulation , in which the variation of slippage /opening is analyzed by different loading conditions.
Edit intent: clarity
Original:  Numerical experiments are conducted to demonstrate the advantageous performance of the proposed approach over the state-of-the-art sparse recovery methods .
Revised:  Numerical experiments are conducted to illustrate the improvement provided by the proposed approach over the state-of-the-art sparse recovery methods .
Edit intent: clarity
Original:  Numerical experiments are conducted to demonstrate the advantageous performance of the proposed approach over the state-of-the-art sparse recovery methods .
Revised:  Numerical experiments are conducted to demonstrate the advantageous performance of the proposed approach in various scenarios .
Edit intent: clarity
Original:  In this paper, we investigate one emerging questionif model's equilibrium point can be regarded as the solution of an optimization problem .
Revised:  In this paper, we investigate one emerging questionif model's equilibrium point be regarded as the solution of an optimization problem .
Edit intent: fluency
Original:  and 2) merging the information into the fixed point iteration, which guarantees to choose the desired equilibrium  when the fixed point set is non-singleton.
Revised:  and 2) merging the information into the fixed point iteration, which guarantees to choose the desired equilibrium point when the fixed point set is non-singleton.
Edit intent: fluency
Original:   This work establishes an important first step towards optimization guided design of deep models.
Revised:  This work establishes the first step towards optimization guided design of deep models.
Edit intent: clarity
Original:   This work establishes an important first step towards optimization guided design of deep models.
Revised:  This work establishes an important first step towards the optimization-guided design of deep models.
Edit intent: fluency
Original:  The TNN microarchitecture is embodied in a set of characteristic scaling equations for assessing the gate count, area, delay and power consumption for any TNN design.
Revised:  The proposed microarchitecture is embodied in a set of characteristic scaling equations for assessing the gate count, area, delay and power consumption for any TNN design.
Edit intent: clarity
Original:  The TNN microarchitecture is embodied in a set of characteristic scaling equations for assessing the gate count, area, delay and power consumption for any TNN design.
Revised:  The TNN microarchitecture is embodied in a set of characteristic scaling equations for assessing the gate count, area, delay and power for any TNN design.
Edit intent: clarity
Original:  Furthermore, to enhance the practicability of the algorithm, we design two economical TL-OS preconditioners and prove that the condition number is robust with respect to the model and mesh parameters .
Revised:  Furthermore, to enhance the practicability of the algorithm, we design two economical TL-OS preconditioners and prove the condition number is robust with respect to the model and mesh parameters .
Edit intent: fluency
Original:  Furthermore, to enhance the practicability of the algorithm, we design two economical TL-OS preconditioners and prove that the condition number is robust with respect to the model and mesh parameters .
Revised:  Furthermore, to enhance the practicability of the algorithm, we design two economical TL-OS preconditioners and prove that the condition number estimate .
Edit intent: clarity
Original: Motivation: Bacteriophages (aka phages) are virusesthat infect bacteria and archaea .
Revised: Background: Prokaryotic viruses, which infect bacteria and archaea .
Edit intent: clarity
Original:  In particular, identifying their hosts provides key knowledge for their usages as antibiotics . High-throughput sequencing and its application to the microbiome have offered new opportunities for phage host detection .
Revised:  In particular, identifying their hosts provides key knowledge for their usages as antibiotics . High-throughput sequencing and its application to the microbiome have offered new opportunities for computational approaches for predicting which hosts particular viruses can infect .
Edit intent: clarity
Original:  First, the known phage-host relationships are very limited compared to sequenced phages .
Revised:  First, the known phage-host relationships are very limited .
Edit intent: clarity
Original:  Second, although the sequence similarity between phages and bacteria has been used as a major feature for host prediction, the alignment is either missing or ambiguous for accurate host prediction .
Revised:  Second, although sequence similarity between phages and bacteria has been used as a major feature for host prediction, the alignment is either missing or ambiguous for accurate host prediction .
Edit intent: fluency
Original:  Second, although the sequence similarity between phages and bacteria has been used as a major feature for host prediction, the alignment is either missing or ambiguous for accurate host prediction .
Revised:  Second, although the sequence similarity between viruses and their prokaryote hosts have been used as a major feature for host prediction, the alignment is either missing or ambiguous for accurate host prediction .
Edit intent: clarity
Original:  Second, although the sequence similarity between phages and bacteria has been used as a major feature for host prediction, the alignment is either missing or ambiguous for accurate host prediction .
Revised:  Second, although the sequence similarity between phages and bacteria has been used as a major feature for host prediction, the alignment is either missing or ambiguous in many cases .
Edit intent: clarity
Original:  Results: In this work, we present a semi-supervised learning model, named HostG, to conduct host prediction for novel phages .
Revised:  Results: In this work, we present a semi-supervised learning model, named HostG, to conduct host prediction for novel viruses .
Edit intent: clarity
Original:  We construct a knowledge graph by utilizing both phage-phage protein similarity and phage-host DNA sequence similarity.
Revised:  We construct a knowledge graph by utilizing both phage-phage protein similarity and virus-host DNA sequence similarity.
Edit intent: clarity
Original:  Then graph convolutional network (GCN) is adopted to exploit phages with or without known hosts in training to enhance the learning ability.
Revised:  Then graph convolutional network (GCN) is adopted to exploit viruses with or without known hosts in training to enhance the learning ability.
Edit intent: clarity
Original:  We tested HostG on both simulated and real sequencing data and the results demonstrated that it competes favorably against the state-of-the-art pipelines .
Revised:  We tested HostG on both simulated and real sequencing data and compared its performance with other state-of-the-art pipelines .
Edit intent: clarity
Original:  In this paper, we show that a naive extension using simulations of the zone based reachability algorithm for the control state reachability problem of timed automata is not sound in the presence of a stack.
Revised:  In this paper, we show that a naive extension of the zone based reachability algorithm for the control state reachability problem of timed automata is not sound in the presence of a stack.
Edit intent: clarity
Original:  Using a portfolio of 50, liquid, continuous futures contracts over the period 1990-2020, the addition of the CPD module leads to an improvement in Sharpe ratio of 33%DIFDELCMD < \\%%% %DIF < . Even more notably,  this module is especially beneficial in periods of significant nonstationarity, and in particular, over the most recent years tested (2015-2020)
Revised:  Using a portfolio of 50, liquid, continuous futures contracts over the period 1990-2020, the addition of the CPD module leads to an improvement in Sharpe ratio of %DIFDELCMD < \\%%% %DIF < . Even more notably, this module is especially beneficial in periods of significant nonstationarity, and in particular, over the most recent years tested (2015-2020)
Edit intent: coherence
Original:  the performance boost is approximately 400%DIFDELCMD < \\%%% %DIF < . This is especially interesting as  traditional momentum strategies have been underperforming in this period.
Revised:  the performance boost is approximately %DIFDELCMD < \\%%% %DIF < . This is especially interesting as traditional momentum strategies have been underperforming in this period.
Edit intent: clarity
Original: Given a graph G = (V,E) where every vertex has weak preferences over its neighbors, we consider the problem of computing an optimal matching as per agent preferences.
Revised: Given a graph G = (V,E) where every vertex has a weak ranking over its neighbors, we consider the problem of computing an optimal matching as per agent preferences.
Edit intent: clarity
Original: Labelled networks form a very common and important class of data, naturally appearing in numerous applications in science and engineering.
Revised: Labelled networks are an important class of data, naturally appearing in numerous applications in science and engineering.
Edit intent: clarity
Original:  A typical inference goal is to determine how the vertex labels (or %DIFDELCMD < {\em %%% features ) affect the network's graph structure.
Revised:  A typical inference goal is to determine how the vertex labels (or %DIFDELCMD < {\em %%% features ) affect the network's graph structure.
Edit intent: fluency
Original:  In this work, we introduce a new generative model, the feature-first block model (FFBM), which is more effective at describing vertex-labelled undirected graphs and also facilitates the use of richer queries on labelled networks.
Revised:  In this work, we introduce a new generative model, the feature-first block model (FFBM), that facilitates the use of richer queries on labelled networks.
Edit intent: coherence
Original:  In this work, we introduce a new generative model, the feature-first block model (FFBM), which is more effective at describing vertex-labelled undirected graphs and also facilitates the use of richer queries on labelled networks.
Revised:  In this work, we introduce a new generative model, the feature-first block model (FFBM), which is more effective at describing vertex-labelled undirected graphs and also facilitates the use of rich queries on labelled networks.
Edit intent: fluency
Original:  The FFBM's structure is kept deliberately simple to retain easy interpretability of the parameter values .
Revised:  This allows us to infer if and how the observed vertex-features affect macro-structure .
Edit intent: coherence
Original:  The main advantages of the proposed approach are that the whole feature-space is used automatically , and features can be rank-ordered implicitly according to impact .
Revised:  The main advantages of the proposed approach are that the whole feature-space is used automatically and that features can be rank-ordered implicitly according to impact .
Edit intent: coherence
Original:  A recently developed deep learning model known as normalizing flows is used to generate quantile forecasts of renewable generation .
Revised:  A recently developed deep learning model known as normalizing flows to generate quantile forecasts of renewable generation .
Edit intent: clarity