wanyu/IteraTeR_v2 huggingface dataset:
Original:  When compared to the latest such existing study (Jaumard Daryalal, 2016) , our algorithm achieved an accuracy gap of 1\% as opposed to 14.3\% for the previous study, and a running time two orders of magnitude faster on average.
Revised:  When compared to the latest such existing study Daryalal, 2016) , our algorithm achieved an accuracy gap of 1\% as opposed to 14.3\% for the previous study, and a running time two orders of magnitude faster on average.
Edit intent: clarity
Original:  When compared to the latest such existing study (Jaumard Daryalal, 2016) , our algorithm achieved an accuracy gap of 1\% as opposed to 14.3\% for the previous study, and a running time two orders of magnitude faster on average.
Revised:  When compared to the latest such existing study (Jaumard , our algorithm achieved an accuracy gap of 1\% as opposed to 14.3\% for the previous study, and a running time two orders of magnitude faster on average.
Edit intent: clarity
Original:  We test our method on a manufactured solution problem and the cavity flow problem.
Revised:  We test our method on problems having manufactured solutions, as well as on the cavity flow problem.
Edit intent: clarity
Original: The free access to large-scale public databases, together with the fast progress of deep learning techniques, in particular Generative Adversarial Networks, have led to the generation of very realistic fake contents with its corresponding implications towards society in this era of fake news.
Revised: The free access to large-scale public databases, together with the fast progress of deep learning techniques, in particular Generative Adversarial Networks, have led to the generation of very realistic fake content with its corresponding implications towards society in this era of fake news.
Edit intent: fluency
Original:  In particular, four types of facial manipulation are reviewed: i) entire face synthesis, ii) face identity swap (DeepFakes), iii) facial attributes manipulation, and iv) facial expression manipulation .
Revised:  In particular, four types of facial manipulation are reviewed: i) entire face synthesis, ii) identity swap (DeepFakes), iii) facial attributes manipulation, and iv) facial expression manipulation .
Edit intent: fluency
Original:  In particular, four types of facial manipulation are reviewed: i) entire face synthesis, ii) face identity swap (DeepFakes), iii) facial attributes manipulation, and iv) facial expression manipulation .
Revised:  In particular, four types of facial manipulation are reviewed: i) entire face synthesis, ii) face identity swap (DeepFakes), iii) attribute manipulation, and iv) facial expression manipulation .
Edit intent: fluency
Original:  In particular, four types of facial manipulation are reviewed: i) entire face synthesis, ii) face identity swap (DeepFakes), iii) facial attributes manipulation, and iv) facial expression manipulation .
Revised:  In particular, four types of facial manipulation are reviewed: i) entire face synthesis, ii) face identity swap (DeepFakes), iii) facial attributes manipulation, and iv) expression swap .
Edit intent: fluency
Original:  For each manipulation type , we provide details regarding manipulation techniques, existing public databases, and key benchmarks for technology evaluation of fake detection methods, including a summary of results from those evaluations.
Revised:  For each manipulation group , we provide details regarding manipulation techniques, existing public databases, and key benchmarks for technology evaluation of fake detection methods, including a summary of results from those evaluations.
Edit intent: clarity
Original:  Among the different databases available and discussed in the survey, FaceForensics++ is for example one of the most widely used for detecting both face identity swap and facial expression manipulations, with results in the literature in the range of 90-100\% of manipulation detectionaccuracy .
Revised:  Among all the aspects discussed in the survey, FaceForensics++ is for example one of the most widely used for detecting both face identity swap and facial expression manipulations, with results in the literature in the range of 90-100\% of manipulation detectionaccuracy .
Edit intent: clarity
Original:  In addition to the survey information, we also discuss trends and provide an outlook of the ongoing work in this field, e.g., the recently announced DeepFake Detection Challenge (DFDC) .
Revised:  In addition to the survey information, we also discuss open issues and future trends that should be considered to advance in the field .
Edit intent: clarity
Original:  These kind of partitioning problems are NP-hard for series-parallel graphs but can be solved in polynomial time on trees.
Revised:  These kind of partitioning problems are NP-hard in general but polynomial-time solvable on trees.
Edit intent: clarity
Original:  In this paper we present partitioning algorithms for cactus graphs to show that these partition problems are polynomial-time solvable for this graph class as well .
Revised:  In this paper , we present a polynomial-time algorithm for cactus graphs to show that these partition problems are polynomial-time solvable for this graph class as well .
Edit intent: clarity
Original:  The latter are of two types, holes in the populated state and vegetation patches on bare ground, and are organized within distinct snaking bifurcations diagrams.
Revised:  The latter are of two types, holes in the populated state and vegetation patches on bare ground, and are organized within distinct snaking bifurcation diagrams.
Edit intent: fluency
Original:  The remainder of the mutagenesis data is used to validate .
Revised:  The remainder of the data being used for validation. By reliably and rapidly narrowing down target interactions, these in-silico predictions can inform and reduce the time spent on time-consuming in-vitro and in-vivo experimentation .
Edit intent: clarity
Original:  At the interface-scale, the partition function computation usesatlases of selected subassembly landscapes for each interface type and their abbreviatedbar-codes .
Revised:  At the interface-scale, atlases of selected subassembly landscapes for each interface type and their abbreviatedbar-codes .
Edit intent: clarity
Original:  At the interface-scale, the partition function computation usesatlases of selected subassembly landscapes for each interface type and their abbreviatedbar-codes .
Revised:  At the interface-scale, the partition function computation uses of selected subassembly landscapes for each interface type and their abbreviatedbar-codes .
Edit intent: clarity
Original:  At the interface-scale, the partition function computation usesatlases of selected subassembly landscapes for each interface type and their abbreviatedbar-codes .
Revised:  At the interface-scale, the partition function computation usesatlases bar-codes .
Edit intent: clarity
Original:  At the interface-scale, the partition function computation usesatlases of selected subassembly landscapes for each interface type and their abbreviatedbar-codes .
Revised:  At the interface-scale, the partition function computation usesatlases of selected subassembly landscapes for each interface type and their abbreviated .
Edit intent: clarity
Original:  The first (direct) prediction of cruciality of an interaction for successful capsid assembly assumed the interface assembly is essential for capsid assembly.
Revised:  The first (direct) prediction of cruciality of an interface for successful capsid assembly assumed the interface assembly is essential for capsid assembly.
Edit intent: fluency
Original:  Combinatorial entropy is used to define the cruciality of an interface for successful assembly of the capsid.
Revised:  Combinatorial entropy is used to define cruciality of an interface for successful assembly of the capsid.
Edit intent: fluency
Original:  By reliably and rapidly narrowing down target interactions, these in-silico predictions can inform and reduce the time spent on  time-consuming in-vitro and in-vivo experimentation .
Revised:  By reliably and rapidly narrowing down target interactions, our predictions can inform and reduce the time spent on time-consuming in-vitro and in-vivo experimentation .
Edit intent: clarity
Original:  By reliably and rapidly narrowing down target interactions, these in-silico predictions can inform and reduce the time spent on  time-consuming in-vitro and in-vivo experimentation .
Revised:  By reliably and rapidly narrowing down target interactions, these in-silico predictions can inform and reduce the time spent on time-consuming in-vitro and in-vivo experiments .
Edit intent: fluency
Original:  At the interface-scale, we measure cruciality by approximating changes in the capsid free-energy landscape partition function when an interaction is removed.
Revised:  At the interface-scale, we measure cruciality by changes in the capsid free-energy landscape partition function when an interaction is removed.
Edit intent: clarity
Original:  By reliably and rapidly narrowing down target interactions,  our predictions can inform and reduce the time spent on more computationally intensive in-silico analyses, and time-consuming in-vitro and in-vivo experiments  .
Revised:  By reliably and rapidly narrowing down target interactions, our predictions can inform and reduce time-consuming in-vitro and in-vivo experiments .
Edit intent: clarity
Original:  We find parameter regions that lead to interesting behaviour of the coupled system.
Revised:  We find parameter regions that lead to spatio-temporal instabilities of the coupled system.
Edit intent: clarity
Original:  These mutual dependences between deformation and diffusive patterns are of substantial relevance in the study of morphoelastic changes in biomaterials.
Revised:  The mutual dependences between deformation and diffusive patterns are of substantial relevance in the study of morphoelastic changes in biomaterials.
Edit intent: fluency
Original:  Recent reviews in speech have been conducted for ASR, SR, and SER, however, none of these has focused on the representation learning from speech---a gap that our survey aims to bridge.
Revised:  Recent reviews in speech have been conducted for ASR, SR, and SER, however, none of these has focused on the representation learning from speech -- a gap that our survey aims to bridge.
Edit intent: fluency
Original:  This trend towards open science increases the pressure on authors to provide access to the source code and data underlying the computational results in their scientific papers.
Revised:  This trend towards open science increases the pressure on authors to provide access to the source code and data they used to compute the results reported in their scientific papers.
Edit intent: clarity
Original:  Consequently , several projects develop solutions to support the publication of executable analyses alongside articles considering the needs of the aforementioned stakeholders.
Revised:  Consequently , several projects have developed solutions to support the publication of executable analyses alongside articles considering the needs of the aforementioned stakeholders.
Edit intent: fluency
Original:  Consequently , several projects develop solutions to support the publication of executable analyses alongside articles considering the needs of the aforementioned stakeholders.
Revised:  Consequently , several projects develop solutions to support the release of executable analyses alongside articles considering the needs of the aforementioned stakeholders.
Edit intent: clarity
Original: In this paper, we present a mixed-integer linear programming  formulation of a piecewise, polyhedral relaxation (PPR) of a multilinear term using it's convex hull representation.
Revised: In this paper, we present a mixed-integer linear programming formulation of a piecewise, polyhedral relaxation (PPR) of a multilinear term using its convex hull representation.
Edit intent: fluency
Original:  Based on the solution of the PPR, we also present a MIP-based piecewise formulation which restricts the solutions to be feasible for the multilinear term .
Revised:  Based on the solution of the PPR, we also present a MILP formulation whose solutions are feasible for nonconvex, multilinear equations .
Edit intent: clarity
Original:  We then present computational results showing the effectiveness of proposed formulations on instances from the standard Mixed-Integer Nonlinear Programming Library (MINLPLib) and compare the proposed formulation with a  formulation that is built by recursively relaxing bilinear groupings of the multilinear term, typically applied in the literature .
Revised:  We then present computational results showing the effectiveness of proposed formulations on instances of standard benchmarks of nonlinear programs (NLPs) with multilinear terms and compare the proposed formulation with a formulation that is built by recursively relaxing bilinear groupings of the multilinear term, typically applied in the literature .
Edit intent: clarity
Original:  We then present computational results showing the effectiveness of proposed formulations on instances from the standard Mixed-Integer Nonlinear Programming Library (MINLPLib) and compare the proposed formulation with a  formulation that is built by recursively relaxing bilinear groupings of the multilinear term, typically applied in the literature .
Revised:  We then present computational results showing the effectiveness of proposed formulations on instances from the standard Mixed-Integer Nonlinear Programming Library (MINLPLib) and compare the proposed formulation with a formulation that is built by recursively relaxing bilinear groupings of multilinear terms .
Edit intent: coherence
Original: Global unitary transformations (optswaps) that optimally increase the bias of any mixed computation qubit in a quantum system - represented by a diagonal density matrix - towards a particular state of the computational basis which, in effect, increases its purity are presented.
Revised: Global unitary transformations that optimally increase the bias of any mixed computation qubit in a quantum system - represented by a diagonal density matrix - towards a particular state of the computational basis which, in effect, increases its purity are presented.
Edit intent: clarity
Original: Global unitary transformations (optswaps) that optimally increase the bias of any mixed computation qubit in a quantum system - represented by a diagonal density matrix - towards a particular state of the computational basis which, in effect, increases its purity are presented.
Revised: Global unitary transformations (optswaps) that optimally increase the bias of any mixed computation qubit in a quantum system , represented by a diagonal density matrix - towards a particular state of the computational basis which, in effect, increases its purity are presented.
Edit intent: fluency
Original: Global unitary transformations (optswaps) that optimally increase the bias of any mixed computation qubit in a quantum system - represented by a diagonal density matrix - towards a particular state of the computational basis which, in effect, increases its purity are presented.
Revised: Global unitary transformations (optswaps) that optimally increase the bias of any mixed computation qubit in a quantum system - represented by a diagonal density matrix , towards a particular state of the computational basis which, in effect, increases its purity are presented.
Edit intent: fluency
Original:  Quantum circuits that achieve this by implementing the above data compression technique - a generalization of the 3B-Comp [Fernandez, Lloyd, Mor, Roychowdhury (2004);
Revised:  Quantum circuits that achieve this by implementing the above data compression technique , a generalization of the 3B-Comp [Fernandez, Lloyd, Mor, Roychowdhury (2004);
Edit intent: fluency
Original:  arXiv: quant-ph/0401135] used before  are described.
Revised:  arXiv: quant-ph/0401135] used before , are described.
Edit intent: fluency
Original:  Using the optswaps, a practicable new method that algorithmically achieves hierarchy-dependent cooling of qubits to their respective limits in an engineered quantum register opened to the heat-bath in delineated.
Revised:  Using the optswaps, a practicable new method that algorithmically achieves hierarchy-dependent cooling of qubits to their respective limits in an engineered quantum register opened to the heat-bath is delineated.
Edit intent: clarity
Original:  The ability for set- and multiset- oriented neural networks to handle this type of input has been the focus of much work in recent years.
Revised:  The ability for set- and multiset-oriented neural networks to handle this type of input has been the focus of much work in recent years.
Edit intent: fluency
Original:  A Fokker Planck equation has been obtained starting from a Langevin formulation, subject to Gaussian white noise with zero mean  .
Revised:  A Fokker Planck equation has been obtained starting from a Langevin equation subject to correlated Gaussian white noise with zero mean .
Edit intent: clarity
Original:  This allowed to calculate the stationary probability distribution of population size , and thus  discuss the effects of harvesting for a population under Allee effect , subject to Gaussian white noise .
Revised:  This allowed to calculate the stationary probability distributions of populations , and thus discuss the effects of harvesting for a population under Allee effect , subject to Gaussian white noise .
Edit intent: clarity
Original:  This allowed to calculate the stationary probability distribution of population size , and thus  discuss the effects of harvesting for a population under Allee effect , subject to Gaussian white noise .
Revised:  This allowed to calculate the stationary probability distribution of population size , and thus to discuss the effects of harvesting for a population under Allee effect , subject to Gaussian white noise .
Edit intent: fluency
Original: Statistical divergence is widely applied in multimedia processing, basically due to regularity and explainable features displayed in data.
Revised: Statistical divergence is widely applied in multimedia processing, basically due to regularity and interpretable features displayed in data.
Edit intent: clarity
Original:  However, in a broader range of data realm, these advantages may not out-stand , and therefore a more general approach is required.
Revised:  However, in a broader range of data realm, these advantages may no longer be feasible , and therefore a more general approach is required.
Edit intent: clarity
Original:  In data detection, statistical divergence can be used as an similarity measurement based on collective features.
Revised:  In data detection, statistical divergence can be used as a similarity measurement based on collective features.
Edit intent: fluency
Original: Energy trading system takes advantage of varioussources and effectively coordinates the energy to ensure efficientand optimal utilization of the available resources and providesbetter services for energy users .
Revised: Energy trading system takes advantage of various sources and effectively coordinates the energy to ensure efficientand optimal utilization of the available resources and providesbetter services for energy users .
Edit intent: fluency
Original: Energy trading system takes advantage of varioussources and effectively coordinates the energy to ensure efficientand optimal utilization of the available resources and providesbetter services for energy users .
Revised: Energy trading system takes advantage of varioussources and effectively coordinates the energy to ensure optimal utilization of the available resources and providesbetter services for energy users .
Edit intent: clarity
Original: Energy trading system takes advantage of varioussources and effectively coordinates the energy to ensure efficientand optimal utilization of the available resources and providesbetter services for energy users .
Revised: Energy trading system takes advantage of varioussources and effectively coordinates the energy to ensure efficientand optimal utilization of the available resources .
Edit intent: clarity
Original:  It achieves that goal by managingphysical , social and business infrastructures using technologiessuch as Internet of Things (IoT), cloud computing and networksystems, which facilitates both citizens and the policy makers.
Revised:  It achieves that goal by managing physical , social and business infrastructures using technologiessuch as Internet of Things (IoT), cloud computing and networksystems, which facilitates both citizens and the policy makers.
Edit intent: fluency
Original:  It achieves that goal by managingphysical , social and business infrastructures using technologiessuch as Internet of Things (IoT), cloud computing and networksystems, which facilitates both citizens and the policy makers.
Revised:  It achieves that goal by managingphysical , social and business infrastructures using technologies such as Internet of Things (IoT), cloud computing and networksystems, which facilitates both citizens and the policy makers.
Edit intent: fluency
Original:  Thispaper provides an overview of the P2P energy trading and theutilization of blockchain to enhance the efficiency and the overallperformance including the degree of decentralization, scalabilityand the security of the systems.
Revised:  Thispaper provides an overview of the P2P energy trading and the utilization of blockchain to enhance the efficiency and the overallperformance including the degree of decentralization, scalabilityand the security of the systems.
Edit intent: fluency
Original:  Thispaper provides an overview of the P2P energy trading and theutilization of blockchain to enhance the efficiency and the overallperformance including the degree of decentralization, scalabilityand the security of the systems.
Revised:  Thispaper provides an overview of the P2P energy trading and theutilization of blockchain to enhance the efficiency and the overall performance including the degree of decentralization, scalabilityand the security of the systems.
Edit intent: fluency
Original:  Thispaper provides an overview of the P2P energy trading and theutilization of blockchain to enhance the efficiency and the overallperformance including the degree of decentralization, scalabilityand the security of the systems.
Revised:  Thispaper provides an overview of the P2P energy trading and theutilization of blockchain to enhance the efficiency and the overallperformance including the degree of decentralization, scalability and the security of the systems.
Edit intent: fluency
Original:  Moreover, three blockchainbased energy trading models have been proposed to overcomethe technical challenges and market barriers for better adoptionof this disruptive technology .
Revised:  Three blockchain based energy trading models have been proposed to overcomethe technical challenges and market barriers for better adoptionof this disruptive technology .
Edit intent: coherence
Original:  Moreover, three blockchainbased energy trading models have been proposed to overcomethe technical challenges and market barriers for better adoptionof this disruptive technology .
Revised:  Moreover, three blockchainbased energy trading models have been proposed to overcome the technical challenges and market barriers for better adoptionof this disruptive technology .
Edit intent: fluency
Original:  Moreover, three blockchainbased energy trading models have been proposed to overcomethe technical challenges and market barriers for better adoptionof this disruptive technology .
Revised:  Moreover, three blockchainbased energy trading models have been proposed to overcomethe technical challenges and market barriers for better adoption of this disruptive technology .
Edit intent: fluency