wanyu/IteraTeR_v2 huggingface dataset:
Original:  Furthermore, when long-range and spatially constrained graphs are paired, ring vaccination occurs on the spatial graph , which describes partial diffusion due to dormant, surrounding nodes.
Revised:  Furthermore, when long-range and spatially constrained graphs are paired, ring vaccination occurs on the spatial graph and produces partial diffusion, due to dormant, surrounding nodes.
Edit intent: clarity
Original:  In this paper, we consider the more general problem of subset selection for matrices that allows a block is fixed at the beginning.
Revised:  In this paper, we consider a more general problem of subset selection for matrices that allows a block is fixed at the beginning.
Edit intent: fluency
Original:  In this paper, we consider the more general problem of subset selection for matrices that allows a block is fixed at the beginning.
Revised:  In this paper, we consider the more general problem of subset selection for matrices that allows a block to be fixed at the beginning.
Edit intent: fluency
Original:  We also present a bound for both the Frobenius and the spectral matrix norms of the pseudoinverse of the sampled matrix with showing that the bound is asymptotically optimal.
Revised:  We also present a bound for both the Frobenius and spectral norms of the pseudoinverse of the sampled matrix with showing that the bound is asymptotically optimal.
Edit intent: fluency
Original:  We also present a bound for both the Frobenius and the spectral matrix norms of the pseudoinverse of the sampled matrix with showing that the bound is asymptotically optimal.
Revised:  We also present a bound for both the Frobenius and the spectral matrix norms of the pseudoinverse of the sampled matrix , showing that the bound is asymptotically optimal.
Edit intent: fluency
Original:  The main technology for proving this result is the interlacing families of polynomials which is developed by Marcus, Spielman  and Srivastava.
Revised:  The main technology for proving this result is the interlacing families of polynomials developed by Marcus, Spielman and Srivastava.
Edit intent: coherence
Original:  The main technology for proving this result is the interlacing families of polynomials which is developed by Marcus, Spielman  and Srivastava.
Revised:  The main technology for proving this result is the interlacing families of polynomials which is developed by Marcus, Spielman , and Srivastava.
Edit intent: fluency
Original:  In this paper, we expand the Fourier detection techniques for the binary alphabet to any finite field F_q, and give, roughly speaking, an O(n^{0.8k})-time learning algorithm for k-juntas over F_q. Note that our algorithm is the first non-trivial (i.e., non-brute force) algorithm for such a class even in the case where q=3 and we give an affirmative answer to the question posed in MOS04 . Our algorithm consists of two reductions:
Revised:  In this paper, we expand the Fourier detection techniques for the binary alphabet to any finite field F_q, and give, roughly speaking, an O(n^{0.8k})-time learning algorithm for k-juntas over F_q. Note that our algorithm is the first non-trivial (i.e., non-brute force) algorithm for such a class even in the case where q=3 and we give an affirmative answer to the question posed MOS04 . Our algorithm consists of two reductions:
Edit intent: fluency
Original:  (1) from learning juntas to LDME which is a variant of the learning with errors (LWE) problems introduced by Reg05 , and (2) from LDME to the light bulb problem (LBP) introduced by Val88 . Since the reduced problem (i.e., LBP) is a kind of binary problem regardless of the alphabet size of the original problem (i.e., learning juntas), we can directly apply the techniques for the binary case in the previous work such as in Val15, KKK18 .
Revised:  (1) from learning juntas to LDME which is a variant of the learning with errors (LWE) problems introduced by Reg05 , and (2) from LDME to the light bulb problem (LBP) introduced by . Since the reduced problem (i.e., LBP) is a kind of binary problem regardless of the alphabet size of the original problem (i.e., learning juntas), we can directly apply the techniques for the binary case in the previous work such as in Val15, KKK18 .
Edit intent: clarity
Original:  (1) from learning juntas to LDME which is a variant of the learning with errors (LWE) problems introduced by Reg05 , and (2) from LDME to the light bulb problem (LBP) introduced by Val88 . Since the reduced problem (i.e., LBP) is a kind of binary problem regardless of the alphabet size of the original problem (i.e., learning juntas), we can directly apply the techniques for the binary case in the previous work such as in Val15, KKK18 .
Revised:  (1) from learning juntas to LDME which is a variant of the learning with errors (LWE) problems introduced by Reg05 , and (2) from LDME to the light bulb problem (LBP) introduced by Val88 . Since the reduced problem (i.e., LBP) is a kind of binary problem regardless of the alphabet size of the original problem (i.e., learning juntas), we can directly apply the techniques for the binary case in the previous work Val15, KKK18 .
Edit intent: clarity
Original:  There has also been an increase in the number of movies that pass the well-known Bechdel test, a popular---albeit flawed---measure of women in fiction.
Revised:  There has also been an increase in the number of movies that pass the well-known Bechdel test, a popular--albeit flawed--measure of women in fiction.
Edit intent: fluency
Original:  We prove a local existence result for the free-boundary problem and construct travelling-wave solutions.
Revised:  We prove an existence result for the free-boundary problem and construct travelling-wave solutions.
Edit intent: clarity
Original: Imaging nuclei of keratincoytes in the stratified squamous epithelium has been a subject of intense research since nucleus associated cellular atypia is the key criteria for the screening and diagnosis of epithelial cancers and their precursors.
Revised: Imaging nuclei of keratinocytes in the stratified squamous epithelium has been a subject of intense research since nucleus associated cellular atypia is the key criteria for the screening and diagnosis of epithelial cancers and their precursors.
Edit intent: clarity
Original:  We disclose that they are generally low scattering in the core using micro-optical coherence tomography of 1.28 -micrometer axial resolution in vivo;
Revised:  We disclose that they are generally low scattering in the core using micro-optical coherence tomography of 1.28 um axial resolution in vivo;
Edit intent: clarity
Original:  those previously reported "high scattering " or "bright " signals from nuclei are likely from the nucleocytoplasmic boundary, and the low-scattering nuclear cores were missed possibly due to insufficient axial resolutions ( ~ 4 micrometer ).
Revised:  those previously reported high scattering or bright signals from nuclei are likely from the nucleocytoplasmic boundary, and the low-scattering nuclear cores were missed possibly due to insufficient axial resolutions ( ~ 4 micrometer ).
Edit intent: fluency
Original:  those previously reported "high scattering " or "bright " signals from nuclei are likely from the nucleocytoplasmic boundary, and the low-scattering nuclear cores were missed possibly due to insufficient axial resolutions ( ~ 4 micrometer ).
Revised:  those previously reported "high scattering " or "bright " signals from nuclei are likely from the nucleocytoplasmic boundary, and the low-scattering nuclear cores were missed possibly due to insufficient axial resolutions ( about 4 micrometer ).
Edit intent: clarity
Original:  those previously reported "high scattering " or "bright " signals from nuclei are likely from the nucleocytoplasmic boundary, and the low-scattering nuclear cores were missed possibly due to insufficient axial resolutions ( ~ 4 micrometer ).
Revised:  those previously reported "high scattering " or "bright " signals from nuclei are likely from the nucleocytoplasmic boundary, and the low-scattering nuclear cores were missed possibly due to insufficient axial resolutions ( ~ 4 um ).
Edit intent: clarity
Original:  To facilitate understanding of this emerging domain, we present the first survey and taxonomy on graph processing on FPGAs.
Revised:  To facilitate understanding of this emerging domain, we present the first survey and taxonomy on graph computations on FPGAs.
Edit intent: clarity
Original:  Finally, we discuss research and engineering challenges to outline the future of graph processing on FPGAs.
Revised:  Finally, we discuss research and engineering challenges to outline the future of graph computations on FPGAs.
Edit intent: clarity
Original: Training complex machine learning models in parallel is an increasingly important workload.
Revised: Training machine learning models in parallel is an increasingly important workload.
Edit intent: clarity
Original:  We co-design the switch processing with the end-host protocols and ML frameworks to provide a robust, efficient solution that speeds up training by up to 300\%, and at least by 20\% for a number of real-world benchmark models.
Revised:  We co-design the switch processing with the end-host protocols and ML frameworks to provide an efficient solution that speeds up training by up to 300\%, and at least by 20\% for a number of real-world benchmark models.
Edit intent: clarity
Original: The \Lambda-Wright--Fisher process describes the type-frequency evolution of an infinite  population.
Revised:  \Lambda-Wright--Fisher process describes the type-frequency evolution of an infinite population.
Edit intent: coherence
Original: The \Lambda-Wright--Fisher process describes the type-frequency evolution of an infinite  population.
Revised: The \Lambda-Wright--Fisher processes provide a robust framework to describe the type-frequency evolution of an infinite population.
Edit intent: clarity
Original:  An appropriate decomposition of the drift allows us to construct a series of Moran-type models that converge under suitable conditions to the solution of the associated stochastic differential equation  .
Revised:  An appropriate decomposition of the drift allows us to approximate the solution of the associated stochastic differential equation .
Edit intent: clarity
Original:  An appropriate decomposition of the drift allows us to construct a series of Moran-type models that converge under suitable conditions to the solution of the associated stochastic differential equation  .
Revised:  An appropriate decomposition of the drift allows us to construct a series of Moran-type models that converge under suitable conditions to the solution of the stochastic differential equation .
Edit intent: clarity
Original:  Second, we demonstrate the homotopic equivalence of a positive \mu-reach set and its offsets.
Revised:  Second, we demonstrate the homotopy equivalence of a positive \mu-reach set and its offsets.
Edit intent: fluency
Original: This paper is devoted to presenting a method to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.
Revised: This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.
Edit intent: clarity
Original:  A circumscribing polygon is a polygonization for G if every edge in E is an edge of P.
Revised:  A circumscribing polygon is a polygonization for G if every edge in E is an edge of P.
Edit intent: fluency
Original:  Given an outerstring graph representation, the Maximum Independent Set (MIS) problem of the underlying graph can be solved in O(s^3) time, where s is the number of segments in the representation (Keil et al., Comput.
Revised:  Given an outerstring graph representation, the Maximum Independent Set (MIS) problem of the underlying graph can be computed in O(s^3) time, where s is the number of segments in the representation (Keil et al., Comput.
Edit intent: clarity
Original:  To this end, we propose a novel approach that evolves a sparse network topology based on the behavior of neurons in the network.
Revised:  To this end, we propose a novel approach that evolves sparse neural networks according to the behavior of neurons in the network.
Edit intent: clarity
Original:  More exactly, the cosine similarities between the activations of any two neurons are used to determine which connections are added to or removed from the network.
Revised:  Concretely, by exploiting the cosine similarity metric to measure the importance of the cosine similarities between the activations of any two neurons are used to determine which connections are added to or removed from the network.
Edit intent: clarity
Original:  Even without optimizing hyperparameters for specific datasets, the experiments show that our proposed training algorithms usually outperform SET and state-of-the-art dense neural network techniques.
Revised:  Even without optimizing hyperparameters for specific datasets, the experiments show that our proposed method outperforms several state-of-the-art dense neural network techniques.
Edit intent: clarity
Original:  We characterise the local structure of the Steiner points in all shortest-length directed networks in the Euclidean plane.
Revised:  We characterize the local structure of the Steiner points in all shortest-length directed networks in the Euclidean plane.
Edit intent: fluency
Original:  This characterisation implies that these networks are constructible by straightedge and compass.
Revised:  This characterization implies that these networks are constructible by straightedge and compass.
Edit intent: fluency
Original: These days usage of mobile applications has become quite a normal part of our lives  , since every day we use our smartphones for communication, entertainment, business and even education.
Revised: Usage of mobile applications has become quite a normal part of our lives , since every day we use our smartphones for communication, entertainment, business and even education.
Edit intent: coherence
Original: These days usage of mobile applications has become quite a normal part of our lives  , since every day we use our smartphones for communication, entertainment, business and even education.
Revised: These days usage of mobile applications has become a part of our lives , since every day we use our smartphones for communication, entertainment, business and even education.
Edit intent: coherence
Original:  A high demand on various apps has led to significant growth of supply . Large number of apps offered, in turn, has led to complications in user's search of the one perfectly suitable application.
Revised:  A high demand on various apps has led to significant growth of supply , yet large offer has caused complications in users search of the one perfectly suitable application.
Edit intent: clarity
Original:  A high demand on various apps has led to significant growth of supply . Large number of apps offered, in turn, has led to complications in user's search of the one perfectly suitable application.
Revised:  A high demand on various apps has led to significant growth of supply . Large number of apps offered, in turn, has led to complications in user's search of the one suitable application.
Edit intent: clarity
Original:  In this paper the authors have made an attempt to solve the problem of facilitating the search in app stores.
Revised:  The authors have made an attempt to solve the problem of facilitating the search in app stores.
Edit intent: clarity
Original:  With the help of a websites crawling software a sample of data was retrieved from one of the well-known mobile app stores and divided into 11 groups by types.
Revised:  With the help of a website crawling software a sample of data was retrieved from one of the well-known mobile app stores and divided into 11 groups by types.
Edit intent: fluency
Original:  Afterwards these groups of data were used to construct a Knowledge Schema - a graphic model of interconnections of data that characterize any mobile app in the selected store.
Revised:  These groups of data were used to construct a Knowledge Schema - a graphic model of interconnections of data that characterize any mobile app in the selected store.
Edit intent: coherence
Original:  This Schema creation is the first step in the process of developing a Knowledge Graph that will perform applications grouping to facilitate users search in app stores.
Revised:  Schema creation is the first step in the process of developing a Knowledge Graph that will perform applications grouping to facilitate users search in app stores.
Edit intent: coherence
Original:  This Schema creation is the first step in the process of developing a Knowledge Graph that will perform applications grouping to facilitate users search in app stores.
Revised:  This Schema creation is the first step in the process of developing a Knowledge Graph that will perform applications clustering to facilitate users search in app stores.
Edit intent: clarity
Original:  Over the next seven years, the NIH Common Fund Human Biomolecular Atlas Program (HuBMAP) aims to develop a widely accessible framework for comprehensively mapping the human body at single-cell resolution by supporting technology development, data acquisition, and detailed spatial mapping.
Revised:  Over the next seven years, the NIH Common Fund Human Biomolecular Atlas Program (HuBMAP) intends to develop a widely accessible framework for comprehensively mapping the human body at single-cell resolution by supporting technology development, data acquisition, and detailed spatial mapping.
Edit intent: clarity
Original:  HuBMAP will integrate its efforts with other funding agencies, programs  , and the biomedical research community at large towards the shared vision of a comprehensive, accessible 3D molecular and cellular atlas of the human body, in health and various disease settings.
Revised:  HuBMAP will integrate its efforts with other funding agencies, programs , consortia , and the biomedical research community at large towards the shared vision of a comprehensive, accessible 3D molecular and cellular atlas of the human body, in health and various disease settings.
Edit intent: clarity
Original:  Here, we review the application of the homogenous rod( worm-like chain ) modelto the mechanics of the triple helix, including bend, twist, and stretch deformations  and the assumption of backbone linearity.
Revised:  Here, we review the application of the homogenous rod( worm-like chain model), twist, and stretch deformations and the assumption of backbone linearity.
Edit intent: clarity
Original:  However, the network decisions are often perceived as being highly non-transparent  making it difficult to apply these algorithms in clinical routine.
Revised:  However, the network decisions are often perceived as being highly non-transparent , making it difficult to apply these algorithms in clinical routine.
Edit intent: fluency
Original:  We conclude that LRP provides a powerful tool for assisting clinicians in finding evidence for AD (and potentially other diseases) in structural MRI data.
Revised:  We conclude that LRP might have a high potential to assist clinicians in explaining neural network decisions for diagnosing AD (and potentially other diseases) in structural MRI data.
Edit intent: clarity
Original:  We conclude that LRP provides a powerful tool for assisting clinicians in finding evidence for AD (and potentially other diseases) in structural MRI data.
Revised:  We conclude that LRP provides a powerful tool for assisting clinicians in finding evidence for AD (and potentially other diseases) based on structural MRI data.
Edit intent: clarity
Original:  We then present an algorithmic framework which---automatically---converts a tree-decomposition-based dynamic programming algorithm for a given combinatorial problem X into a dynamic programming algorithm for the diverse version of X. Surprisingly, our algorithm has a polynomial dependence on the diversity parameter . Going further, we devise a framework to translate kernels of a certain type for a given combinatorial problem X into kernels of a slightly larger size for its diverse version .
Revised:  We then present an algorithmic framework which --automatically-- converts a tree-decomposition-based dynamic programming algorithm for a given combinatorial problem X into a dynamic programming algorithm for the diverse version of X. Surprisingly, our algorithm has a polynomial dependence on the diversity parameter . Going further, we devise a framework to translate kernels of a certain type for a given combinatorial problem X into kernels of a slightly larger size for its diverse version .
Edit intent: fluency
Original:  Processes of this kind characterize both living and artificial systems, making self-organization a concept that is at the basis of several disciplines, from physics to biology to engineering.
Revised:  Processes of this kind characterize both living and artificial systems, making self-organization a concept that is at the basis of several disciplines, from physics to biology and engineering.
Edit intent: clarity
Original:   Finally, we discuss the usefulness of self-organization  within ALife studies, point to perspectives  for future research, and list open questions  .
Revised:  Finally, we discuss the usefulness of self-organization within ALife studies, point to perspectives and challenges for future research, and list open questions .
Edit intent: clarity
Original: We cast new light on the existing models of 1-way deterministic topological automata by introducing a new , convenient model, in which, as each input symbol is read, an interior system of an automaton, known as a configuration, continues to evolve in a topological space by applying continuous transition operators one by one.
Revised: We cast new light on the existing models of one-way deterministic topological automata by introducing a new , convenient model, in which, as each input symbol is read, an interior system of an automaton, known as a configuration, continues to evolve in a topological space by applying continuous transition operators one by one.
Edit intent: fluency
Original:  Such automata naturally generalize 1-way finite automata of various types, including deterministic, probabilistic, quantum, and pushdown automata.
Revised:  Such automata naturally generalize one-way finite automata of various types, including deterministic, probabilistic, quantum, and pushdown automata.
Edit intent: fluency
Original: The different sculpted facial vectors exhibit strong correlations among pairs of facial distances, characterizing the underlying universality and complexity of the cognitive processes, leading to the observed subjectivity .
Revised: The different sculpted facial vectors exhibit strong correlations among pairs of facial distances, characterising the underlying universality and complexity of the cognitive processes, leading to the observed subjectivity .
Edit intent: fluency
Original: We discuss the numerical solution of nonlinear parabolic partial differential equations, exhibiting finite-speed of propagation, via a strongly implicit finite-difference scheme with formal truncation error O\left[(\Delta x)^2 + (\Delta t)^2 \right].
Revised: We discuss the numerical solution of nonlinear parabolic partial differential equations, exhibiting finite speed of propagation, via a strongly implicit finite-difference scheme with formal truncation error O\left[(\Delta x)^2 + (\Delta t)^2 \right].
Edit intent: fluency
Original:  We implement the scheme for problems involving a single spatial dimension (i.e., two-dimensional, axisymmetric or spherically-symmetric three-dimensional currents) on a uniform but staggered grid.
Revised:  We implement the scheme for problems involving a single spatial coordinate (i.e., two-dimensional, axisymmetric or spherically-symmetric three-dimensional currents) on a uniform but staggered grid.
Edit intent: clarity