wanyu/IteraTeR_v2 huggingface dataset:
Original:  On the one hand, our approach for community detection combines the optimization of a quality function and a spectral clustering of a deformation of the combinatorial Laplacian, the so-called magnetic Laplacian.
Revised:  Our approach for community detection combines the optimization of a quality function and a spectral clustering of a deformation of the combinatorial Laplacian, the so-called magnetic Laplacian.
Edit intent: coherence
Original:  Furthermore, in the spirit of the Markov stability method, an approach for studying communities at different energy scales in the network is put forward, based on a quantum mechanical system at finite temperature.
Revised:  Furthermore, in the spirit of the Markov stability method, an approach for studying communities at different energy levels in the network is put forward, based on a quantum mechanical system at finite temperature.
Edit intent: clarity
Original:  This survey paper presents the design goals and the techniques, which different LPWA technologies exploit to offer wide-area coverage to low-power devices at the expense of low data rates.
Revised:  This review paper presents the design goals and the techniques, which different LPWA technologies exploit to offer wide-area coverage to low-power devices at the expense of low data rates.
Edit intent: clarity
Original:  We further note that LPWA technologies adopt similar approaches, thus sharing the same limitations and challenges.
Revised:  We further note that LPWA technologies adopt similar approaches, thus sharing similar limitations and challenges.
Edit intent: clarity
Original: Information processing in the brain crucially depends on coding properties of single neurons shaped by their intrinsic dynamics.
Revised: Information processing in the brain crucially depends on encoding properties of single neurons shaped by their intrinsic dynamics.
Edit intent: fluency
Original:  This bifurcation maximizes the entrainment range and turns out to be more relevant for spike-based processing than the typically considered Bogdanov-Takens point.
Revised:  As we show, this bifurcation turns out to be more relevant for spike-based processing than the typically considered Bogdanov-Takens point.
Edit intent: clarity
Original:  This bifurcation maximizes the entrainment range and turns out to be more relevant for spike-based processing than the typically considered Bogdanov-Takens point.
Revised:  This bifurcation maximizes the entrainment range and turns out to induce even more drastic changes in spike-based processing than the typically considered Bogdanov-Takens point.
Edit intent: clarity
Original:  Our theory, applied to optical stimulation techniques, reveals that they could manipulate a variety of information processing characteristics in nerve cells beyond pure stimulation .
Revised:  Our theory, applied to optical stimulation techniques, reveals that they could manipulate a variety of information processing characteristics in nerve cells beyond pure activation .
Edit intent: clarity
Original: Estimating parameters of Partial Differential Equations (PDEs) from noisy and indirect measurements requires solutions of ill-posed inverse problems.
Revised: Estimating parameters of Partial Differential Equations (PDEs) from noisy and indirect measurements often requires solving ill-posed inverse problems.
Edit intent: clarity
Original:  These so called parameter estimation or inverse medium problems, are computationally intense since the underlying PDEs need to be solved numerous times until the reconstruction of the parameters is sufficiently accurate.
Revised:  Their solution is computationally intense since the underlying PDEs need to be solved numerous times until the reconstruction of the parameters is sufficiently accurate.
Edit intent: clarity
Original:  Being written in the expressive programing language Julia, jInv is portable, easy to understand and extend, cross-platform tested, and well-documented.
Revised:  Being written in the expressive programming language Julia, jInv is portable, easy to understand and extend, cross-platform tested, and well-documented.
Edit intent: fluency
Original:  It provides  parallelization schemes that exploit the inherent structure in many parameter estimation problems and can be used to solve multiphysics inversion problems as is demonstrated using numerical experiments motivated by geophysical imaging.
Revised:  It provides novel parallelization schemes that exploit the inherent structure in many parameter estimation problems and can be used to solve multiphysics inversion problems as is demonstrated using numerical experiments motivated by geophysical imaging.
Edit intent: clarity
Original:  It provides  parallelization schemes that exploit the inherent structure in many parameter estimation problems and can be used to solve multiphysics inversion problems as is demonstrated using numerical experiments motivated by geophysical imaging.
Revised:  It provides parallelization schemes that exploit the inherent structure of many parameter estimation problems and can be used to solve multiphysics inversion problems as is demonstrated using numerical experiments motivated by geophysical imaging.
Edit intent: fluency
Original: Recurrent neural networks, and in particular long short-term memory networks (LSTMs) , are a remarkably effective tool for sequence modeling that learn a dense black-box hidden representation of their sequential input.
Revised: Recurrent neural networks, and in particular long short-term memory (LSTM) networks , are a remarkably effective tool for sequence modeling that learn a dense black-box hidden representation of their sequential input.
Edit intent: fluency
Original:  In this work, we present LSTMVis a visual analysis tool for recurrent neural networks with a focus on understanding these hidden state dynamics.
Revised:  In this work, we present LSTMVIS, a visual analysis tool for recurrent neural networks with a focus on understanding these hidden state dynamics.
Edit intent: fluency
Original:  The tool allows a user to select a hypothesis input range to focus on local state changes, to match these states changes to similar patterns in a large data set, and to align these results with domain specific structural annotations .
Revised:  The tool allows users to select a hypothesis input range to focus on local state changes, to match these states changes to similar patterns in a large data set, and to align these results with domain specific structural annotations .
Edit intent: fluency
Original:  We further show several use cases of the tool for analyzing specific hidden state properties on datasets containing nesting, phrase structure, and chord progressions, and demonstrate how the tool can be used to isolate patterns for further statistical analysis  .
Revised:  We further show several use cases of the tool for analyzing specific hidden state properties on dataset containing nesting, phrase structure, and chord progressions, and demonstrate how the tool can be used to isolate patterns for further statistical analysis .
Edit intent: fluency
Original:  Recently, a deterministic, continuous-time dynamical system (CTDS) was proposed ( Nature Physics,{\bf 7 (12), 966 (2011)) to solve a representative NP-complete problem, Boolean Satisfiability (SAT).
Revised:  Recently, a deterministic, continuous-time dynamical system (CTDS) was proposed ( Nat.Phys.{\bf 7 (12), 966 (2011)) to solve a representative NP-complete problem, Boolean Satisfiability (SAT).
Edit intent: fluency
Original:  With some modifications to the CTDS equations, here we present a novel analog hardware SAT solver, AC-SAT, implementing the CTDS  . AC-SAT is intended to be used as a co-processor , and with its modular design can be readily extended to different problem sizes .
Revised:  This paper presents a novel analog hardware SAT solver, AC-SAT, implementing the CTDS . AC-SAT is intended to be used as a co-processor , and with its modular design can be readily extended to different problem sizes .
Edit intent: clarity
Original:  For example, for hard problems with N=50 variables and M=212 clauses, solutions are found within from a few ns to a few hundred ns with an average power consumption of 130%DIFDELCMD < } %%% mW .
Revised:  As an example, for hard problems with N=50 variables and M=212 clauses, solutions are found within from a few ns to a few hundred ns with an average power consumption of 130%DIFDELCMD < } %%% mW .
Edit intent: fluency
Original:  For example, for hard problems with N=50 variables and M=212 clauses, solutions are found within from a few ns to a few hundred ns with an average power consumption of 130%DIFDELCMD < } %%% mW .
Revised:  For example, for hard problems with N=50 variables and M=212 clauses, solutions are found within from a few ns to a few hundred ns 130%DIFDELCMD < } %%% mW .
Edit intent: clarity
Original:  For example, for hard problems with N=50 variables and M=212 clauses, solutions are found within from a few ns to a few hundred ns with an average power consumption of 130%DIFDELCMD < } %%% mW .
Revised:  For example, for hard problems with N=50 variables and M=212 clauses, solutions are found within from a few ns to a few hundred ns with an average power consumption of %DIFDELCMD < } %%% mW .
Edit intent: clarity
Original:  For example, for hard problems with N=50 variables and M=212 clauses, solutions are found within from a few ns to a few hundred ns with an average power consumption of 130%DIFDELCMD < } %%% mW .
Revised:  For example, for hard problems with N=50 variables and M=212 clauses, solutions are found within from a few ns to a few hundred ns with an average power consumption of 130%DIFDELCMD < } %%% .
Edit intent: clarity
Original:  First, we use data and models of West African migration to show that EVD does not homogeneously mix, but spreads in a much more predictable manner.
Revised:  First, we use data and models of West African migration to show that EVD does not homogeneously mix, but spreads in a predictable manner.
Edit intent: clarity
Original: That any two persons are separated by a relatively small number of intermediary contacts -- the "small-world" phenomenon -- is a surprising but well established regularity in human social networks.
Revised: In this paper, we investigate the "small-world" phenomenon -- is a surprising but well established regularity in human social networks.
Edit intent: clarity
Original: That any two persons are separated by a relatively small number of intermediary contacts -- the "small-world" phenomenon -- is a surprising but well established regularity in human social networks.
Revised: That any two persons are separated by a relatively small number of intermediary contacts -- the phenomenon -- is a surprising but well established regularity in human social networks.
Edit intent: clarity
Original:  To address this gap in the literature, we explore the phenomenon of "age-specific small worlds" by employing a mobile phone network built from billions of communication events approximating interaction patterns at a societal scale.
Revised:  To address this gap in the literature, we explore the phenomenon of "age-specific small worlds" using data from a large-scale mobile communication network approximating interaction patterns at a societal scale.
Edit intent: clarity
Original:  To address this gap in the literature, we explore the phenomenon of "age-specific small worlds" by employing a mobile phone network built from billions of communication events approximating interaction patterns at a societal scale.
Revised:  To address this gap in the literature, we explore the phenomenon of "age-specific small worlds" by employing a mobile phone network built from billions of communication events approximating interaction patterns at societal scale.
Edit intent: fluency
Original:  More importantly, we show that there is a systematic relationship between age and the average distance connecting that person to others, with some age groups falling below this average quantity while others falling above .
Revised:  More importantly, we show that there is systematic variation in this age-relative small world effect .
Edit intent: clarity
Original:  Young people live in the "smallest world," being separated from other young people and their parent's generation via a comparatively small number of intermediaries .
Revised:  Young people live in the "smallest world," being separated from other young people and their parent's generation via a smaller number of intermediaries .
Edit intent: clarity
Original:  Older people live in the "least small world," being separated from their same age peers and their younger counterparts by a relatively large number of intermediaries.
Revised:  Older people live in the "least small world," being separated from their same age peers and their younger counterparts by a larger number of intermediaries.
Edit intent: clarity
Original:  In all these results demonstrate that age-group heterogeneity of the small world can be traced to well-known social mechanisms affecting the way that age interacts with overall volume of connectivity and the relative prevalence of kin ties and non-kin ties , and may have important implications for our understanding of  information cascades, diffusion phenomena, and the localized spread of fads and fashions.
Revised:  In all these results demonstrate that age-group heterogeneity of the small world can be traced to well-known social mechanisms affecting the way age interacts with overall volume of connectivity and the relative prevalence of kin ties and non-kin ties , and may have important implications for our understanding of information cascades, diffusion phenomena, and the localized spread of fads and fashions.
Edit intent: fluency
Original:  In all these results demonstrate that age-group heterogeneity of the small world can be traced to well-known social mechanisms affecting the way that age interacts with overall volume of connectivity and the relative prevalence of kin ties and non-kin ties , and may have important implications for our understanding of  information cascades, diffusion phenomena, and the localized spread of fads and fashions.
Revised:  In all these results demonstrate that age-group heterogeneity of the small world can be traced to well-known social mechanisms affecting the way that age interacts with network connectivity and the relative prevalence of kin ties and non-kin ties , and may have important implications for our understanding of information cascades, diffusion phenomena, and the localized spread of fads and fashions.
Edit intent: clarity
Original:  In all these results demonstrate that age-group heterogeneity of the small world can be traced to well-known social mechanisms affecting the way that age interacts with overall volume of connectivity and the relative prevalence of kin ties and non-kin ties , and may have important implications for our understanding of  information cascades, diffusion phenomena, and the localized spread of fads and fashions.
Revised:  In all these results demonstrate that age-group heterogeneity of the small world can be traced to well-known social mechanisms affecting the way that age interacts with overall volume of connectivity and the relative prevalence of kin ties and non-kin ties observed in this network. This social pattern has significant implications for our understanding of information cascades, diffusion phenomena, and the localized spread of fads and fashions.
Edit intent: clarity
Original:  In all these results demonstrate that age-group heterogeneity of the small world can be traced to well-known social mechanisms affecting the way that age interacts with overall volume of connectivity and the relative prevalence of kin ties and non-kin ties , and may have important implications for our understanding of  information cascades, diffusion phenomena, and the localized spread of fads and fashions.
Revised:  In all these results demonstrate that age-group heterogeneity of the small world can be traced to well-known social mechanisms affecting the way that age interacts with overall volume of connectivity and the relative prevalence of kin ties and non-kin ties , and may have important implications for our understanding of information cascades, diffusion phenomena, and the spread of fads and fashions.
Edit intent: clarity
Original:  First, given an ill-typed function, we symbolically execute the body to dynamically synthesize witness values that can make the program go wrong.
Revised:  First, given an ill-typed function, we symbolically execute the body to synthesize witness values that can make the program go wrong.
Edit intent: clarity
Original:  First, given an ill-typed function, we symbolically execute the body to dynamically synthesize witness values that can make the program go wrong.
Revised:  First, given an ill-typed function, we symbolically execute the body to dynamically synthesize witness values that make the program go wrong.
Edit intent: clarity
Original:  Second, we show how to extend the above procedure to produce a reduction graph that can be used to interactively visualize and debug witness executions.
Revised:  Second, we show how to extend this procedure to produce a reduction graph that can be used to interactively visualize and debug witness executions.
Edit intent: coherence
Original:  Our technique is able to generate witnesses for 88 \% of the programs, and our reduction graph yields small counterexamples for 81 \% of the witnesses  . Finally, we evaluate the utility of our witnesses in helping students understand and fix type errors, and find that students presented with our witnesses consistently show a greater understanding of type errors than those presented with a standard error message.
Revised:  Our technique is able to generate witnesses for 88 \% of the programs, our reduction graph yields small counterexamples for 81 \% of the witnesses . Finally, we evaluate the utility of our witnesses in helping students understand and fix type errors, and find that students presented with our witnesses consistently show a greater understanding of type errors than those presented with a standard error message.
Edit intent: coherence
Original:  Our technique is able to generate witnesses for 88 \% of the programs, and our reduction graph yields small counterexamples for 81 \% of the witnesses  . Finally, we evaluate the utility of our witnesses in helping students understand and fix type errors, and find that students presented with our witnesses consistently show a greater understanding of type errors than those presented with a standard error message.
Revised:  Our technique is able to generate witnesses for 88 \% of the programs, and our reduction graph yields small counterexamples for 81 \% of the witnesses . Finally, we evaluate whether our witnesses help students understand and fix type errors, and find that students presented with our witnesses consistently show a greater understanding of type errors than those presented with a standard error message.
Edit intent: clarity
Original:  Our technique is able to generate witnesses for 88 \% of the programs, and our reduction graph yields small counterexamples for 81 \% of the witnesses  . Finally, we evaluate the utility of our witnesses in helping students understand and fix type errors, and find that students presented with our witnesses consistently show a greater understanding of type errors than those presented with a standard error message.
Revised:  Our technique is able to generate witnesses for 88 \% of the programs, and our reduction graph yields small counterexamples for 81 \% of the witnesses . Finally, we evaluate the utility of our witnesses in helping students understand and fix type errors, and find that students presented with our witnesses show a greater understanding of type errors than those presented with a standard error message.
Edit intent: clarity
Original: The Novelli--Pak--Stoyanovskii algorithm is a sorting algorithm for Young tableaux of a fixed shape that was originally devised to give a bijective proof of the hook-length formula.
Revised: The Novelli-Pak-Stoyanovskii algorithm is a sorting algorithm for Young tableaux of a fixed shape that was originally devised to give a bijective proof of the hook-length formula.
Edit intent: fluency
Original:  We thereby answer questions posed by Krattenthaler and M \"u%DIFDELCMD < }%%% ller .
Revised:  We thereby answer questions posed by Krattenthaler and \"u%DIFDELCMD < }%%% ller .
Edit intent: fluency
Original:  We thereby answer questions posed by Krattenthaler and M \"u%DIFDELCMD < }%%% ller .
Revised:  We thereby answer questions posed by Krattenthaler and M %DIFDELCMD < }%%% ller .
Edit intent: fluency
Original:  Although analog implementations can be extremely compact, they have been largely supplanted by digital designs, partly because of device mismatch effects due to fabrication .
Revised:  Although analog implementations can be extremely compact, they have been largely supplanted by digital designs, partly because of device mismatch effects due to material and fabrication imperfections .
Edit intent: clarity
Original:  We propose a framework that exploits the power of Deep Learning to compensate for this mismatch by incorporating the measured variations of the devices as constraints in the DNN training process.
Revised:  We propose a framework that exploits the power of deep learning to compensate for this mismatch by incorporating the measured variations of the devices as constraints in the DNN training process.
Edit intent: fluency
Original:  We propose a framework that exploits the power of Deep Learning to compensate for this mismatch by incorporating the measured variations of the devices as constraints in the DNN training process.
Revised:  We propose a framework that exploits the power of Deep Learning to compensate for this mismatch by incorporating the measured device variations as constraints in the DNN training process.
Edit intent: clarity
Original:  We propose a framework that exploits the power of Deep Learning to compensate for this mismatch by incorporating the measured variations of the devices as constraints in the DNN training process.
Revised:  We propose a framework that exploits the power of Deep Learning to compensate for this mismatch by incorporating the measured variations of the devices as constraints in the neural network training process.
Edit intent: clarity
Original:  This eliminates the use of mismatch minimization strategies such as the use of very large transistors, and allows circuit complexity and power-consumption to be reduced to a minimum.
Revised:  This eliminates the need for mismatch minimization strategies such as the use of very large transistors, and allows circuit complexity and power-consumption to be reduced to a minimum.
Edit intent: fluency
Original:  This eliminates the use of mismatch minimization strategies such as the use of very large transistors, and allows circuit complexity and power-consumption to be reduced to a minimum.
Revised:  This eliminates the use of mismatch minimization strategies and allows circuit complexity and power-consumption to be reduced to a minimum.
Edit intent: clarity
Original: In 1990, Alon and Kleitman proposed an elementary argument for the sum-free subset theorem : every set of n nonzero integers contains a subset A of size |A|> n/3, which is sum-free, i. e., there are no a_1, a_2, a_3 in A such that a_1 + a_2 = a_3.
Revised: In 1990, Alon and Kleitman proposed an argument for the sum-free subset theorem : every set of n nonzero integers contains a subset A of size |A|> n/3, which is sum-free, i. e., there are no a_1, a_2, a_3 in A such that a_1 + a_2 = a_3.
Edit intent: clarity
Original: In 1990, Alon and Kleitman proposed an elementary argument for the sum-free subset theorem : every set of n nonzero integers contains a subset A of size |A|> n/3, which is sum-free, i. e., there are no a_1, a_2, a_3 in A such that a_1 + a_2 = a_3.
Revised: In 1990, Alon and Kleitman proposed an elementary argument for the sum-free subset problem : every set of n nonzero integers contains a subset A of size |A|> n/3, which is sum-free, i. e., there are no a_1, a_2, a_3 in A such that a_1 + a_2 = a_3.
Edit intent: clarity