wanyu/IteraTeR_v2 huggingface dataset:
Original:  However, by using canonical duality theory we proved that the upper-level 0-1 programming problem in topology optimization can be solved analytically to obtain exact integer solution.
Revised:  However, by using canonical duality theory , this well-known problem can be solved analytically to obtain exact integer solution.
Edit intent: clarity
Original:  Since sampling from Boltzmann distributions of a DBM is not classically feasible, this is evidence of supremacy of a non-Turing sampling oracle.
Revised:  Since sampling from Boltzmann distributions of a DBM is not classically feasible, this is evidence of advantage of a non-Turing sampling oracle.
Edit intent: clarity
Original:  The latter method further improves the reinforcement learning method using DBMs.
Revised:  This further improves the reinforcement learning method using DBMs.
Edit intent: coherence
Original:  In absence of a transverse field, our simulations show that DBMs train more effectively than restricted Boltzmann machines (RBM) with the same number of weights.
Revised:  In absence of a transverse field, our simulations show that DBMs are trained more effectively than restricted Boltzmann machines (RBM) with the same number of weights.
Edit intent: clarity
Original:  This further improves the reinforcement learning method using DBMs .
Revised:  This method also outperforms the reinforcement learning method using DBMs .
Edit intent: clarity
Original:  This further improves the reinforcement learning method using DBMs .
Revised:  This further improves the reinforcement learning method that uses RBMs .
Edit intent: clarity
Original:  Not only does this constrain a researcher's base of knowledge to build upon, it likewise limits the researcher's ability to publish original research in appropriate venues .
Revised:  A solution is needed, therefore, whereby researchers can identify information dissemination pathways in order to both access and contribute to an existing body of knowledge .
Edit intent: clarity
Original:  We conducted analytical experiments on this system and found that the academic social network studied can effectively recommend scholarly venues and that the proposed rating outperforms the baselinevenue recommendation in terms of accuracy and ranking quality .
Revised:  We present a way to recommend relevant, specialized scholarly venues using these implicit ratings that can provide quick results, even for new researchers without a publication history and for emerging scholarly venues that do not yet have an impact factor. We performed a large-scale experiment with real data to evaluate the current scholarly recommendation system and showed that our proposed system achieves better results than the baseline. The results provide important up-to-the-minute signals that compared with post-publication usage-based metrics represent a closer reflection of a researcher's interests .
Edit intent: clarity
Original: Diffusion MRI (dMRI) can reconstruct neuronal fibers in the brain, in vivo , by measuring water diffusion along angular gradient directions in q-space.
Revised: Diffusion MRI (dMRI) provides the ability to reconstruct neuronal fibers in the brain, in vivo , by measuring water diffusion along angular gradient directions in q-space.
Edit intent: clarity
Original: Diffusion MRI (dMRI) can reconstruct neuronal fibers in the brain, in vivo , by measuring water diffusion along angular gradient directions in q-space.
Revised: Diffusion MRI (dMRI) can reconstruct neuronal fibers in the brain, in vivo , by measuring water diffusion along angular gradient directions in q-space.
Edit intent: fluency
Original:  The sparser the representation, the fewer samples are needed to reconstruct a high resolution signal with limited information loss and so a focus of much dMRI research has been finding the sparsest possible dictionary representation .
Revised:  The sparser the representation, the fewer samples are needed to reconstruct a high resolution signal with limited information loss , and so an important area of research has focused on finding the sparsest possible dictionary representation .
Edit intent: clarity
Original:  All prior methods , however, rely on an angular model of q-space signals in each voxel which fundamentally limits the global sparsity level since at least one dictionary atom is needed for each voxel.
Revised:  All prior methods , however, rely on an angular representation
Edit intent: clarity
Original: \textit{  In contrast, we formulate a global spatial-angular representation of dMRI that will allow us to sparsely model an entire dMRI brain signal below the limit of one atom per voxel using joint spatial-angular sparse coding.
Revised: \textit{ In contrast, we propose a joint spatial-angular representation of dMRI that will allow us to sparsely model an entire dMRI brain signal below the limit of one atom per voxel using joint spatial-angular sparse coding.
Edit intent: clarity
Original:  But a main challengeis optimizing over large-scale dMRI data .
Revised:  But a main challengeis optimizing over large-scale dMRI .
Edit intent: clarity
Original:  In this work, we present extensions to a number of sparse coding algorithms that are better suited for  large-scale problems by exploiting the separable Kronecker structure of our global spatial-angular dictionary.
Revised:  In this work, we present novel adaptations of popular sparse coding algorithms that are better suited for large-scale problems by exploiting the separable Kronecker structure of our global spatial-angular dictionary.
Edit intent: clarity
Original:  In this work, we present extensions to a number of sparse coding algorithms that are better suited for  large-scale problems by exploiting the separable Kronecker structure of our global spatial-angular dictionary.
Revised:  In this work, we present extensions to a number of sparse coding algorithms that become better suited for large-scale problems by exploiting the separable Kronecker structure of our global spatial-angular dictionary.
Edit intent: clarity
Original:  In this work, we present extensions to a number of sparse coding algorithms that are better suited for  large-scale problems by exploiting the separable Kronecker structure of our global spatial-angular dictionary.
Revised:  In this work, we present extensions to a number of sparse coding algorithms that are better suited for solving large-scale problems by exploiting the separable Kronecker structure of our global spatial-angular dictionary.
Edit intent: clarity
Original:  In this work, we present extensions to a number of sparse coding algorithms that are better suited for  large-scale problems by exploiting the separable Kronecker structure of our global spatial-angular dictionary.
Revised:  In this work, we present extensions to a number of sparse coding algorithms that are better suited for large-scale problems by exploiting spatial-angular dictionary.
Edit intent: clarity
Original:  With great efficiency our method achieves significantly sparser HARDI representations than the state-of-the-art which has the potential achieve new levels of HARDI acceleration within a unified (k,q)-CS framework .
Revised:  With great efficiency our method achieves significantly sparser representations of HARDI than the state-of-the-art which has the potential achieve new levels of HARDI acceleration within a unified (k,q)-CS framework .
Edit intent: fluency
Original:  With great efficiency our method achieves significantly sparser HARDI representations than the state-of-the-art which has the potential achieve new levels of HARDI acceleration within a unified (k,q)-CS framework .
Revised:  With great efficiency our method achieves significantly sparser HARDI representations than the state-of-the-art which has the potential to increase HARDI acceleration to new levels .
Edit intent: clarity
Original:  High angular resolution diffusion imaging (HARDI) can produce better estimates of fiber orientation than the popularly used diffusion tensor imaging, but the high number of samples needed to estimate diffusivity requires lengthy patient scan times.
Revised:  High angular resolution diffusion imaging (HARDI) can produce better estimates of fiber orientation than the popularly used diffusion tensor imaging, but the high number of samples needed to estimate diffusivity requires longer patient scan times.
Edit intent: clarity
Original:  Current reconstruction methods however, rely on an angular representation \textit{per voxel} with added spatial regularization, and so,  the global level of sparsity can be no less than the number of voxels.
Revised:  Current reconstruction methods however, rely on an angular representation \textit{per voxel} with added spatial regularization, and so, the global level of sparsity must be greater than the number of voxels.
Edit intent: clarity
Original:  Therefore, state-of-the-art dMRI CS frameworks may have a fundamental limit to the rate acceleration that can be achieved.
Edit intent: coherence
Original:  Our experiments show that our method achieves significantly sparser representations of HARDI than the state-of-the-art which has the potential to increase HARDI acceleration to new levels .
Revised:  Our experiments show that our method achieves significantly sparser representations of HARDI than is possible by the state of the art .
Edit intent: clarity
Original: The immersed boundary (IB) method is an approach to fluid-structure interaction (FSI) that uses a Lagrangian description of the structural deformations, stresses, and forces along with an Eulerian description of the momentum, viscosity, and incompressibility of the fluid-structure system.
Revised: The immersed boundary method is an approach to fluid-structure interaction (FSI) that uses a Lagrangian description of the structural deformations, stresses, and forces along with an Eulerian description of the momentum, viscosity, and incompressibility of the fluid-structure system.
Edit intent: clarity
Original: The immersed boundary (IB) method is an approach to fluid-structure interaction (FSI) that uses a Lagrangian description of the structural deformations, stresses, and forces along with an Eulerian description of the momentum, viscosity, and incompressibility of the fluid-structure system.
Revised: The immersed boundary (IB) method is an approach to fluid-structure interaction that uses a Lagrangian description of the structural deformations, stresses, and forces along with an Eulerian description of the momentum, viscosity, and incompressibility of the fluid-structure system.
Edit intent: clarity
Original:  Originally, the IB method for FSI described the immersed structure using systems of elastic fibersdiscretized as collections of points connected by springs and beams.
Revised:  The original immersed boundary methods described immersed elastic structures using systems of elastic fibersdiscretized as collections of points connected by springs and beams.
Edit intent: clarity
Original:  This work introduces a novel coupling scheme for IB methods that employ an FE discretization of the structure while retaining a finite difference scheme for the Eulerian variables.
Revised:  This work introduces a coupling scheme for IB methods that employ an FE discretization of the structure while retaining a finite difference scheme for the Eulerian variables.
Edit intent: clarity
Original:  This approach to linking the  Lagrangian and Eulerian variables  facilitates independent spatial discretizations for the structure and background grid.
Revised:  This approach to linking the Lagrangian and Eulerian variables that facilitates independent spatial discretizations for the structure and background grid.
Edit intent: fluency
Original:  By comparison, most existing IB methods require Lagrangian meshes that are finer than the Eulerian grid .
Revised:  This approach employs a finite element discretization of the structure while retaining a finite difference scheme for the Eulerian variables .
Edit intent: clarity
Original:  Our tests include cases in which, for a given Eulerian mesh spacing, coarser Lagrangian structural discretizations yield substantially lower discretization errors than finer structural discretizations .
Revised:  Our tests include cases in which, for a fixed Eulerian grid spacing, coarser Lagrangian structural discretizations yield substantially lower discretization errors than finer structural discretizations .
Edit intent: clarity
Original:  Our tests include cases in which, for a given Eulerian mesh spacing, coarser Lagrangian structural discretizations yield substantially lower discretization errors than finer structural discretizations .
Revised:  Our tests include cases in which, for a given Eulerian mesh spacing, coarser Lagrangian structural meshes yield discretization errors that are as much as several orders of magnitude smaller than errors obtained using finer structural meshes .
Edit intent: clarity
Original: We show that there exists an empirical linkage between  nominal financial networks and the underlying economic fundamentals across countries.
Revised: We demonstrate the existence of an empirical linkage between nominal financial networks and the underlying economic fundamentals across countries.
Edit intent: clarity
Original: We show that there exists an empirical linkage between  nominal financial networks and the underlying economic fundamentals across countries.
Revised: We show that there exists an empirical linkage between the nominal financial networks and the underlying economic fundamentals across countries.
Edit intent: fluency
Original:  We construct the nominal return correlation networks from daily data to encapsulate sector-level dynamics and calculate the relative importance of the sectors in the nominal network through centrality measure and clustering algorithms.
Revised:  We construct the nominal return correlation networks from daily data to encapsulate sector-level dynamics and figure the relative importance of the sectors in the nominal network through centrality measure and clustering algorithms.
Edit intent: clarity
Original:  We construct the nominal return correlation networks from daily data to encapsulate sector-level dynamics and calculate the relative importance of the sectors in the nominal network through centrality measure and clustering algorithms.
Revised:  We construct the nominal return correlation networks from daily data to encapsulate sector-level dynamics and calculate the relative importance of the sectors in the nominal network through a measure of centrality and clustering algorithms.
Edit intent: fluency
Original:  The centrality measure robustly identifies the backbone of the minimum spanning trees defined on the return networks  .
Revised:  The centrality measure robustly identifies the backbone of the minimum spanning tree defined on the return networks .
Edit intent: fluency
Original: We show that the conjugacy problem in a wreath product A \wr B is uniform-TC^0-Turing-reducible to the conjugacy problem in the factors A and B and the power problem in B. Moreover, if B is torsion free, the power problem for B can be replaced by the slightly weaker cyclic submonoid membership problem for B , which itself turns out to be uniform- \mathsf{TC conjugacy problem in A \wr B if A is non-abelian .
Revised: We show that the conjugacy problem in a wreath product A \wr B is uniform-TC^0-Turing-reducible to the conjugacy problem in the factors A and B and the power problem in B. If B is torsion free, the power problem for B can be replaced by the slightly weaker cyclic submonoid membership problem for B , which itself turns out to be uniform- \mathsf{TC conjugacy problem in A \wr B if A is non-abelian .
Edit intent: coherence
Original:  Together with our first result, this yields a uniform TC^0 solution to the conjugacy problem in iterated wreath products of abelian groups - and, by the Magnus embedding, also for free solvable groups.
Revised:  Together with our first result, this yields a uniform TC^0 solution to the conjugacy problem in iterated wreath products of abelian groups - and, by the Magnus embedding, also in free solvable groups.
Edit intent: coherence
Original:  However, performing feature extraction or classification directly on the end-nodes poses security concerns, as valuable data , "distilled" with application knowledge, is stored or sent over the network at various stages of the analytics pipeline.
Revised:  However, performing feature extraction or classification directly on the end-nodes poses security concerns, as valuable data is stored or sent over the network at various stages of the analytics pipeline.
Edit intent: clarity
Original:  Several websites publish lists with thousands of free proxies organized by country, anonymity level, and performance.
Revised:  Several websites publish lists of free proxies organized by country, anonymity level, and performance.
Edit intent: clarity
Original:  It is fair to say that little is known about the free proxy ecosystem .
Revised:  It is fair to say that little is known .
Edit intent: clarity
Original:  In this paper we shed light on this ecosystem via ProxyTorrent, a distributed measurement system that leverages both active and passive measurements.
Revised:  In this paper we shed light on this ecosystem via ProxyTorrent, a distributed measurement platform that leverages both active and passive measurements.
Edit intent: clarity
Original:  Active measurements discover free proxies, assess their performance  and detect potential malicious activities.
Revised:  Active measurements discover free proxies, assess their performance , and detect potential malicious activities.
Edit intent: fluency
Original:  Passive measurements run at user premises (via a Chrome plugin) and collect statistics about proxy usage and performance in the wild  . ProxyTorrent has been running since January 2017, monitoring up to 160 ,000 free proxies per day and totalling more than 1500 users.
Revised:  Passive measurements relate to proxy performance and usage in the wild . ProxyTorrent has been running since January 2017, monitoring up to 160 ,000 free proxies per day and totalling more than 1500 users.
Edit intent: clarity
Original: Interestingly, malicious proxies are the ones that show the best performance , supporting the common belief that free proxies are "free for a reason".
Revised: Interestingly, malicious proxies are the best performance , supporting the common belief that free proxies are "free for a reason".
Edit intent: clarity
Original:  Using the recently available World Input-Output Database , we modeled the evolving world economic network ( from 1995 to 2011 ) with a series of time-homogeneous finite Markov chains.
Revised:  Using the recently available World Input-Output Database , we modeled the evolving world economic network ( from 1995 to 2011 ) with a series of finite Markov chains.
Edit intent: clarity
Original:  Next, we investigated different aspects of the world economic network via different properties of the Markov chains including mixing time, Kemeny constant, steady state probabilities and perturbation analysis of the transition matrices.
Revised:  We assessed different aspects of the world economic network via different properties of the Markov chains including mixing time, Kemeny constant, steady state probabilities and perturbation analysis of the transition matrices.
Edit intent: clarity
Original:  Next, we investigated different aspects of the world economic network via different properties of the Markov chains including mixing time, Kemeny constant, steady state probabilities and perturbation analysis of the transition matrices.
Revised:  Next, we investigated different aspects of this evolving system via different properties of the Markov chains including mixing time, Kemeny constant, steady state probabilities and perturbation analysis of the transition matrices.
Edit intent: clarity
Original:  Next, we investigated different aspects of the world economic network via different properties of the Markov chains including mixing time, Kemeny constant, steady state probabilities and perturbation analysis of the transition matrices.
Revised:  Next, we investigated different aspects of the world economic network via different properties of the Markov chains such as mixing time, Kemeny constant, steady state probabilities and perturbation analysis of the transition matrices.
Edit intent: clarity
Original:  We showed how the time series of mixing times and Kemeny constants could be used as an aggregate index of globalization.
Revised:  First, we showed how the time series of mixing times and Kemeny constants could be used as an aggregate index of globalization.
Edit intent: coherence
Original:  Next, we focused on the steady state probabilities as a measure of structural power of the economies that are comparable to GDP shares of economies as the traditional index of economies welfare .
Revised:  Next, we focused on the steady state probabilities as a measure of structural power of the economies that are comparable to GDP shares of economies as the traditional index of economies .
Edit intent: clarity
Original:  Next, we showed that the sum of systemic fragility values of all the nodes as an aggregate measure of network fragility could be used as a predictive risk measure of the whole economic network.
Edit intent: coherence
Original:  We create a large training set of game instances and solutions, by randomly selecting the private information probabilities, and present algorithms that learn from the training instances in order to perform well in games with unseen information distributions.
Revised:  We create a large training set of game instances and solutions, by randomly selecting the information probabilities, and present algorithms that learn from the training instances in order to perform well in games with unseen information distributions.
Edit intent: clarity
Original:  This approach produces low test error and could be easily implemented by humans since it only requires memorizing a small number of "if-then" rules .
Revised:  This approach produces low test error and could be easily implemented by humans .
Edit intent: clarity
Original:  Previous publications limited their interpretation largely on the centrality (inter-connectedness) of nodes in network structures, where nodes with the highest centrality may be the best targets for interventions .
Revised:  Previous publications limited their interpretation largely on the centrality (inter-connectedness) of nodes in network structures, where nodes with the highest centrality is likely to be the node that is determined most by its neighboring nodes .
Edit intent: clarity
Original:  Here we provide a solution for this problem by introducing the absolute metric predictability - the extent to which a node is determined by all its neighborsin the network - and estimate the predictability of all nodes in 17 prior empirical network papers on psychopathology  .
Revised:  Here we provide a solution for this problem by introducing the absolute metric predictability - the extent to which it is determined by all its neighborsin the network - and estimate the predictability of all nodes in 17 prior empirical network papers on psychopathology .
Edit intent: fluency
Original:  Here we provide a solution for this problem by introducing the absolute metric predictability - the extent to which a node is determined by all its neighborsin the network - and estimate the predictability of all nodes in 17 prior empirical network papers on psychopathology  .
Revised:  Here we provide a solution for this problem by introducing the absolute metric predictability - the extent to which a node is determined by its neighbors. Here we provide an absolute measure of determination (or controllability) of a node - and estimate the predictability of all nodes in 17 prior empirical network papers on psychopathology .
Edit intent: clarity
Original:  We fit state-of-the-art regularized partial correlation networks to all datasets, and computed the predictability of all nodes.
Revised:  We fit state-of-the-art net- work models to all datasets, and computed the predictability of all nodes.
Edit intent: clarity