wanyu/IteraTeR_v2 huggingface dataset:
Original:  A suite of computational fluid dynamics (CFD) simulations geared towards chemical process equipment modelling has been developed and validated with experimental results from the literature.
Revised:  A suite of computational fluid dynamics (CFD) simulations geared towards chemical process equipment modeling has been developed and validated with experimental results from the literature.
Edit intent: fluency
Original:  Various regression based active learning strategies are explored with these CFD simulators in-the-loop under the constraints of a limited function evaluation budget.
Revised:  Various regression-based active learning strategies are explored with these CFD simulators in-the-loop under the constraints of a limited function evaluation budget.
Edit intent: fluency
Original:  The test cases and tools are available with an open-source license , to ensure reproducibility and engage the wider research community in contributing to both the CFD models and developing and benchmarking new improved algorithms tailored to this field.
Revised:  The test cases and tools are available with an open-source license to ensure reproducibility and engage the wider research community in contributing to both the CFD models and developing and benchmarking new improved algorithms tailored to this field.
Edit intent: fluency
Original:  Experiments with a real autonomous vehicle at an industrial testing ground support our hypotheses that (i) formal simulation can be effective at identifying test cases to run on the track, and (ii) the gap between simulated and real worlds can be systematically evaluated and bridged.
Revised:  Experiments with a real autonomous vehicle at an industrial testing facility support our hypotheses that (i) formal simulation can be effective at identifying test cases to run on the track, and (ii) the gap between simulated and real worlds can be systematically evaluated and bridged.
Edit intent: clarity
Original:  This study surveys 23 recent embedding-based entity alignment approaches and categorizes them based on their techniques and characteristics.
Revised:  We survey 23 recent embedding-based entity alignment approaches and categorizes them based on their techniques and characteristics.
Edit intent: clarity
Original:  This study surveys 23 recent embedding-based entity alignment approaches and categorizes them based on their techniques and characteristics.
Revised:  This study surveys 23 recent embedding-based entity alignment approaches and categorize them based on their techniques and characteristics.
Edit intent: fluency
Original:  This study also produces an open-source library , which includes 12 representative embedding-based entity alignment approaches .
Revised:  We develop an open-source library , which includes 12 representative embedding-based entity alignment approaches .
Edit intent: clarity
Original:  This study also produces an open-source library , which includes 12 representative embedding-based entity alignment approaches .
Revised:  This study also produces an open-source library including 12 representative embedding-based entity alignment approaches .
Edit intent: coherence
Original:  We extensively evaluate these approaches on the generated datasets , to understand their strengths and limitations.
Revised:  We extensively evaluate these approaches , to understand their strengths and limitations.
Edit intent: clarity
Original:  The aim of the graph burning problem is to burn all the vertices in a given graph in the least amount of time steps.
Revised:  The aim is to burn all the vertices in a given graph in the least amount of time steps.
Edit intent: clarity
Original:  The aim of the graph burning problem is to burn all the vertices in a given graph in the least amount of time steps.
Revised:  The aim of the graph burning problem is to burn all the vertices in a given graph in the least number of time steps.
Edit intent: clarity
Original:  The least number of required time steps is known to be the burning number of the graph.
Revised:  This number is known to be the burning number of the graph.
Edit intent: clarity
Original:  The less the burning number, the quick the spread.
Revised:  The less the burning number, the faster the spread.
Edit intent: clarity
Original:  It has already been proved that burning of path forests, spider graphs, and trees with maximum degree three are NP-Complete.
Revised:  It has already been proved that burning of path forests, spider graphs, and trees with maximum degree three is already known to be NP-Complete.
Edit intent: clarity
Original:  This paper presents a critical view of current thinking and major use cases for NDE 4.0 - both Industry 4.0 for NDE and NDE 4.0 for Industry;
Revised:  This paper presents a critical view of current thinking and major use cases for NDE 4.0 - both Industry 4.0 for Industry;
Edit intent: clarity
Original:  We introduce a Deep Neural Network architecture taking advantage of a self-attention mechanism which yields less than 0.005\% tracking error rate and less than 0.03\% segmentation error rate.
Revised:  We introduce a Deep Neural Network architecture taking advantage of a self-attention mechanism which yields less than 0.005\% tracking error rate and segmentation error rate.
Edit intent: clarity
Original:  In some settings, this provides an alternative spectral algorithm to achieve constant factor approximation for  survivable network design  , and partially answers a question of Bansal about survivable network design with concentration property.
Revised:  In some settings, this provides an alternative spectral algorithm to achieve constant factor approximation for survivable network design problem , and partially answers a question of Bansal about survivable network design with concentration property.
Edit intent: clarity
Original:  We also show that the spectral rounding results have many other applications , including weighted experimental design and additive spectral sparsification.
Revised:  We also show many other applications of the spectral rounding results have many other applications , including weighted experimental design and additive spectral sparsification.
Edit intent: clarity
Original:  We also show that the spectral rounding results have many other applications , including weighted experimental design and additive spectral sparsification.
Revised:  We also show that the spectral rounding results , including weighted experimental design and additive spectral sparsification.
Edit intent: clarity
Original:  With regard to this 4 \% quantile of genes, pairs of localizations share between 314 and 1889 genescharacterizing the tumor state.
Revised:  With regard to this 4 ) The tumor state.
Edit intent: clarity
Original:  At the time of writing  , the number of fatalities in Italy is expected to be 6000, and the crisis ends before April 15  , 2020.
Revised:  At the time of writing , the number of fatalities in Italy was expected to be 6000, and the crisis ends before April 15 , 2020.
Edit intent: fluency
Original:  At the time of writing  , the number of fatalities in Italy is expected to be 6000, and the crisis ends before April 15  , 2020.
Revised:  At the time of writing , the number of fatalities in Italy is expected to be 6000, and the predicted end of the crisis was April 15 , 2020.
Edit intent: clarity
Original: Researching the conditions for the emergence of life -- not necessarily as it is, but as it could be -- is one of the main goals of Artificial Life.
Revised: An explanatory model for the emergence of life -- not necessarily as it is, but as it could be -- is one of the main goals of Artificial Life.
Edit intent: clarity
Original:  The dynamics of this system comprise very few rules, it is initialized with an elementary tabula rasa state, and features conservation laws replicating natural resource constraints.
Revised:  The dynamics of this system comprise very few rules, it is initialised with an elementary tabula rasa state, and features conservation laws replicating natural resource constraints.
Edit intent: fluency
Original:  Our experiments show that a single run of this dynamical system  discovers a wide range of emergent patterns with no external intervention .
Revised:  Our experiments show that a single run of this dynamical system with no external intervention discovers a wide range of emergent patterns with no external intervention .
Edit intent: fluency
Original:  Our experiments show that a single run of this dynamical system  discovers a wide range of emergent patterns with no external intervention .
Revised:  Our experiments show that a single run of this dynamical system discovers a wide range of emergent patterns .
Edit intent: clarity
Original:  These patterns involve autopoietic structures that maintain their organisation, recursive ones that grow in linear chains or binary-branching trees, and most notably, patterns able to reproduce themselves, duplicating their number at each generation.
Revised:  These patterns include autopoietic structures that maintain their organisation, recursive ones that grow in linear chains or binary-branching trees, and most notably, patterns able to reproduce themselves, duplicating their number at each generation.
Edit intent: fluency
Original: It seems surprising that when generating one million random numbers on modern architectures, one obtains, on average,  116 ties .
Revised: It seems surprising that when generating one million random numbers on modern architectures, one obtains, on average, about 116 ties .
Edit intent: coherence
Original:  This article explains why, how to mathematically compute this number, why it cannot be evaluated in a straightforward way, how to numerically compute it in a robust way and, among other things, what would need to be changed to bring this number below 1.  All computations are carried out in R and are reproducible with the code included in the article.
Revised:  This article explains why, how to mathematically compute such a number, why it cannot be evaluated in a straightforward way, how to numerically compute it in a robust way and, among other things, what would need to be changed to bring this number below 1. All computations are carried out in R and are reproducible with the code included in the article.
Edit intent: clarity
Original:  This article explains why, how to mathematically compute this number, why it cannot be evaluated in a straightforward way, how to numerically compute it in a robust way and, among other things, what would need to be changed to bring this number below 1.  All computations are carried out in R and are reproducible with the code included in the article.
Revised:  This article explains why, how to mathematically compute this number, why it cannot be evaluated in a straightforward way, how to numerically compute them in a robust way and, among other things, what would need to be changed to bring this number below 1. All computations are carried out in R and are reproducible with the code included in the article.
Edit intent: clarity
Original:  This article explains why, how to mathematically compute this number, why it cannot be evaluated in a straightforward way, how to numerically compute it in a robust way and, among other things, what would need to be changed to bring this number below 1.  All computations are carried out in R and are reproducible with the code included in the article.
Revised:  This article explains why, how to mathematically compute this number, why it cannot be evaluated in a straightforward way, how to numerically compute it in a robust way and, among other things, what would need to be changed to bring this number below 1. All computations are carried out in R and are reproducible with the code included in this article.
Edit intent: fluency
Original:  We also give an algorithm ALBA to compute the first-order correspondents of sabotage Sahlqvist formulas.
Revised:  We also give an algorithm to compute the first-order correspondents of sabotage Sahlqvist formulas.
Edit intent: clarity
Original:  The classically troublesome case of singular corners is handled by combining expansions from all corners and an expansion from an interior point.
Revised:  The classically troublesome case of singular corners is handled by combining expansions at all corners and an expansion from an interior point.
Edit intent: clarity
Original: It has been well known that naively combining polymorphic effects and polymorphic type assignment breaks type safety.
Revised: The naive combination of polymorphic effects and polymorphic type assignment breaks type safety.
Edit intent: clarity
Original: It has been well known that naively combining polymorphic effects and polymorphic type assignment breaks type safety.
Revised: It has been well known that naively combining polymorphic effects and polymorphic type assignment has been well known to break type safety.
Edit intent: clarity
Original:  This work explores a new approach to  the safety of polymorphic effects in polymorphic type assignment.
Revised:  This work explores a new approach to ensuring the safety of polymorphic effects in polymorphic type assignment.
Edit intent: clarity
Original:  We also develop a type-and-effect system to enable the use of both operations that follow and do not follow signature restriction in a single program.
Revised:  We also develop a type-and-effect system to enable the use of both operations that satisfy and do not follow signature restriction in a single program.
Edit intent: clarity
Original:  We also develop a type-and-effect system to enable the use of both operations that follow and do not follow signature restriction in a single program.
Revised:  We also develop a type-and-effect system to enable the use of both operations that follow and do not satisfy the signature restriction in a single program.
Edit intent: clarity
Original: Protein-ligand interaction is one of the fundamental molecular interactions of living systems.
Revised: Protein-ligand interactions are one of the fundamental molecular interactions of living systems.
Edit intent: fluency
Original: Protein-ligand interaction is one of the fundamental molecular interactions of living systems.
Revised: Protein-ligand interaction is one of the fundamental types of molecular interactions in living systems.
Edit intent: clarity
Original:  Proteins are the building blocks of functions in life at the molecular level.
Edit intent: coherence
Original:  Ligands are small molecules that interact with proteins at specific regions on the surface of proteins called binding sites.
Revised:  Ligands are small molecules that interact with protein molecules at specific regions on the surface of proteins called binding sites.
Edit intent: clarity
Original:  Ligands are small molecules that interact with proteins at specific regions on the surface of proteins called binding sites.
Revised:  Ligands are small molecules that interact with proteins at specific regions on their surfaces called binding sites.
Edit intent: clarity
Original:  We report in this study, development of Site2Vec , a novel machine learning-based method for reference frame invariant ligand-independent vector embedding of the 3D structure of a protein-ligand binding site.
Revised:  We report in this study, development of Site2Vec that derives reference frame invariant ligand-independent vector embedding of the 3D structure of a protein-ligand binding site.
Edit intent: clarity
Original:  We report in this study, development of Site2Vec , a novel machine learning-based method for reference frame invariant ligand-independent vector embedding of the 3D structure of a protein-ligand binding site.
Revised:  We report in this study, development of Site2Vec , a novel machine learning-based method for reference frame invariant vector embedding of the 3D structure of a protein-ligand binding site.
Edit intent: clarity
Original:  We report in this study, development of Site2Vec , a novel machine learning-based method for reference frame invariant ligand-independent vector embedding of the 3D structure of a protein-ligand binding site.
Revised:  We report in this study, development of Site2Vec , a novel machine learning-based method for reference frame invariant ligand-independent vector embedding of a protein-ligand binding site.
Edit intent: clarity
Original: An outbreak of respiratory disease caused by a novel coronavirus is ongoing till December 2019.
Revised: An outbreak of respiratory disease caused by a novel coronavirus is ongoing from December 2019.
Edit intent: clarity
Original:  As of March 16 2020, It has caused an epidemic outbreak with more than 1,79,073 confirmed infections and 7,074 reported deaths worldwide.
Revised:  As of March 16 2020, it has caused an epidemic outbreak with more than 1,79,073 confirmed infections and 7,074 reported deaths worldwide.
Edit intent: fluency
Original:  Our findings suggest that independent self-sustaining human-to-human spread (R_0>1, R_c>1) is already present in all the five provinces .
Revised:  Our findings suggest that independent self-sustaining human-to-human spread (R_0>1, R_c>1) is already present .
Edit intent: clarity
Original: Architecture-based heat dissipation analyses allows us to reveal fundamental sources of inefficiency in a given processor and thereby provide us with roadmaps to design less dissipative computing schemes independent of technology-bases used to implement the processor .
Revised: Architecture-based heat dissipation analyses allow us to reveal fundamental sources of inefficiency in a given processor and thereby provide us with roadmaps to design less dissipative computing schemes independent of technology-bases used to implement the processor .
Edit intent: fluency
Original: Architecture-based heat dissipation analyses allows us to reveal fundamental sources of inefficiency in a given processor and thereby provide us with roadmaps to design less dissipative computing schemes independent of technology-bases used to implement the processor .
Revised: Architecture-based heat dissipation analyses allows us to reveal fundamental sources of inefficiency in a given processor and thereby provide us with road-maps to design less dissipative computing schemes independent of technology-bases used to implement the processor .
Edit intent: fluency
Original: Architecture-based heat dissipation analyses allows us to reveal fundamental sources of inefficiency in a given processor and thereby provide us with roadmaps to design less dissipative computing schemes independent of technology-bases used to implement the processor .
Revised: Architecture-based heat dissipation analyses allows us to reveal fundamental sources of inefficiency in a given processor and thereby provide us with roadmaps to design less dissipative computing schemes independent of technology-base used to implement the processor .
Edit intent: fluency
Original: Architecture-based heat dissipation analyses allows us to reveal fundamental sources of inefficiency in a given processor and thereby provide us with roadmaps to design less dissipative computing schemes independent of technology-bases used to implement the processor .
Revised: Architecture-based heat dissipation analyses allows us to reveal fundamental sources of inefficiency in a given processor and thereby provide us with roadmaps to design less dissipative computing schemes independent of technology-bases used to implement them .
Edit intent: clarity
Original:  In this work, we study architectural-level contributions to energy dissipation in  Artificial Neural Network (ANN)-based processors that are trained to perform edge detection task.
Revised:  In this work, we study architectural-level contributions to energy dissipation in an Artificial Neural Network (ANN)-based processors that are trained to perform edge detection task.
Edit intent: fluency
Original:  In this work, we study architectural-level contributions to energy dissipation in  Artificial Neural Network (ANN)-based processors that are trained to perform edge detection task.
Revised:  In this work, we study architectural-level contributions to energy dissipation in Artificial Neural Network (ANN)-based processor that is trained to perform edge detection task.
Edit intent: fluency
Original:  In this work, we study architectural-level contributions to energy dissipation in  Artificial Neural Network (ANN)-based processors that are trained to perform edge detection task.
Revised:  In this work, we study architectural-level contributions to energy dissipation in Artificial Neural Network (ANN)-based processors that are trained to perform edge-detection task.
Edit intent: fluency
Original:  We compare the training and information processing cost ofANNs to that of conventional architectures and algorithms using 64-pixel binary image.
Revised:  We compare the training and information processing cost of ANN to that of conventional architectures and algorithms using 64-pixel binary image.
Edit intent: clarity
Original:  Our results reveal the inherent efficiency advantages of ANN networks trained for specific tasks over general purpose processors based on von Neumann architecture.
Revised:  Our results reveal the inherent efficiency advantages of an ANN network trained for specific tasks over general purpose processors based on von Neumann architecture.
Edit intent: fluency
Original:  Our results reveal the inherent efficiency advantages of ANN networks trained for specific tasks over general purpose processors based on von Neumann architecture.
Revised:  Our results reveal the inherent efficiency advantages of ANN networks trained for specific tasks over general-purpose processors based on von Neumann architecture.
Edit intent: fluency
Original:  Lastly, we calculate the change in dissipation as a result of change in input data structure and show the effect of randomness on energetic cost of information processing.
Revised:  Lastly, we calculate the change in dissipation as a result of input data structure and show the effect of randomness on energetic cost of information processing.
Edit intent: fluency
Original:  The results we obtain provide a basis for comparison for task-based fundamental energy efficiency analyses for a range of processors and therefore contribute to the study of architecture-level descriptions of processors and thermodynamic cost calculations based on physics of computation.
Revised:  The results we obtained provide a basis for comparison for task-based fundamental energy efficiency analyses for a range of processors and therefore contribute to the study of architecture-level descriptions of processors and thermodynamic cost calculations based on physics of computation.
Edit intent: fluency
Original: Manacher's algorithm is optimal for the longest palindromic substring problem.
Revised: Manacher's algorithm has been shown to be optimal to the longest palindromic substring problem.
Edit intent: clarity
Original:  The implementation of this algorithm traditionally requires in-memory construction of an augmented string that is twice as long as the original string.
Revised:  Many of the existing implementations of this algorithm, however, unanimously required in-memory construction of an augmented string that is twice as long as the original string.
Edit intent: clarity
Original:  Although the string-augmentation preprocessing has found widespread use for the implementation Manacher's algorithm, this is neither economic nor necessary.
Revised:  Although it has found widespread use for the implementation Manacher's algorithm, this is neither economic nor necessary.
Edit intent: clarity
Original:  Although the string-augmentation preprocessing has found widespread use for the implementation Manacher's algorithm, this is neither economic nor necessary.
Revised:  Although the string-augmentation preprocessing has found widespread use , we found that this preprocessing is neither economic nor necessary.
Edit intent: clarity
Original:  In this article, a readable implementation of Manacher's algorithm based on index mapping is developed which does away with the string augmentation  .
Revised:  We present a more efficient implementation of Manacher's algorithm based on index mapping is developed which does away with the string augmentation .
Edit intent: clarity