wanyu/IteraTeR_v2 huggingface dataset:
Original: While neural networks have been used to classify or embed data into lower dimensional spaces, they are often regarded as black boxes with uninterpretable features.
Revised: While neural networks are powerful approximators used to classify or embed data into lower dimensional spaces, they are often regarded as black boxes with uninterpretable features.
Edit intent: clarity
Original:  Here we propose Graph Spectral Regularization for making hidden layers more interpretable without significantly affecting the performance of their primary task.
Revised:  Here we propose Graph Spectral Regularization for making hidden layers more interpretable without significantly impacting performance on the primary task.
Edit intent: clarity
Original:  We present a system of PDEs coming from Maxwell's equations and for which the solution corresponds to a function  that can be used to correct the FDTD scheme in the vicinity of interfaces (the correction function).
Revised:  We present a system of PDEs coming from Maxwell's equations and for which the solution corresponds to a function (the correction function) that can be used to correct the FDTD scheme in the vicinity of interfaces (the correction function).
Edit intent: fluency
Original:  We show that the CFM's system of PDEs is well-posed and derive a functional that is  minimized in a divergence-free discrete functional space.
Revised:  We show that the CFM's system of PDEs . A functional that is minimized in a divergence-free discrete functional space.
Edit intent: coherence
Original:  The discrete divergence constraint and the stability of the resulting scheme are studied.
Revised:  The discrete divergence constraint , the stability and the error of the resulting scheme are studied.
Edit intent: clarity
Original:  Optimal convergence orders are obtained for a second-order FDTD scheme with the CFM.
Revised:  A second-order convergence is obtained for a second-order FDTD scheme with the CFM.
Edit intent: clarity
Original: We propose a high-order finite-difference time-domain (FDTD ) scheme based on the correction function method (CFM) to treat interfaces with complex geometry .
Revised: We propose a high-order FDTD scheme based on the correction function method (CFM) to treat interfaces with complex geometry .
Edit intent: clarity
Original:  We present a system of PDEs coming from Maxwell's equations and for which the solution corresponds to a function (the correction function) that can be used to correct the FDTD scheme in the vicinity of interfaces.
Revised:  We present a system of PDEs based on Maxwell's equations and for which the solution corresponds to a function (the correction function) that can be used to correct the FDTD scheme in the vicinity of interfaces.
Edit intent: clarity
Original:  A functional that is a square measure of the error satisfying the CFM' s system of PDEs is minimized in a divergence-free discrete functional space.
Revised:  A functional that is a square measure of the error associated with the correction functions' system of PDEs is minimized in a divergence-free discrete functional space.
Edit intent: clarity
Original:  We use a staggered grid in space to enforce the discrete divergence constraints and the fourth-order Runge-Kutta time-stepping method.
Edit intent: coherence
Original:  The discrete divergence constraint , the stability and the error of the resulting scheme are studied.
Revised:  The discrete divergence constraint and the consistency of resulting schemes are studied.
Edit intent: clarity
Original:  Numerical experiments are performed for problems with different geometries of the interface , including one with cusps .
Revised:  Numerical experiments are performed for problems with different geometries of the interface .
Edit intent: clarity
Original:  A second-order convergence is obtained for a second-order FDTD scheme with the CFM.
Revised:  A second-order convergence is obtained for a second-order FDTD scheme corrected using the CFM.
Edit intent: clarity
Original:  High-order convergence is obtained with a  fourth-order FDTD scheme with the CFM . The discontinuities within the solutions are accurately captured without spurious oscillations even around cusps .
Revised:  High-order convergence is obtained with a fourth-order FDTD scheme . The discontinuities within the solutions are accurately captured without spurious oscillations even around cusps .
Edit intent: clarity
Original:  High-order convergence is obtained with a  fourth-order FDTD scheme with the CFM . The discontinuities within the solutions are accurately captured without spurious oscillations even around cusps .
Revised:  High-order convergence is obtained with a fourth-order FDTD scheme with the CFM . The discontinuities within solutions are accurately captured without spurious oscillations even around cusps .
Edit intent: fluency
Original:  High-order convergence is obtained with a  fourth-order FDTD scheme with the CFM . The discontinuities within the solutions are accurately captured without spurious oscillations even around cusps .
Revised:  High-order convergence is obtained with a fourth-order FDTD scheme with the CFM . The discontinuities within the solutions are accurately captured without spurious oscillations .
Edit intent: clarity
Original: Assessing interdisciplinarity is an important and challenging work in bibliometric studies . Previous studies tend to emphasize that the nature and concept of interdisciplinary is ambiguous and uncertain (e. g. Leydesdorff Rafols 2010, Rafols%DIFDELCMD < & %%% Meyer, 2010, Sugimoto Weingart, 2014).
Revised:  Rafols 2010, Rafols%DIFDELCMD < & %%% Meyer, 2010, Sugimoto Weingart, 2014).
Edit intent: coherence
Original: Assessing interdisciplinarity is an important and challenging work in bibliometric studies . Previous studies tend to emphasize that the nature and concept of interdisciplinary is ambiguous and uncertain (e. g. Leydesdorff Rafols 2010, Rafols%DIFDELCMD < & %%% Meyer, 2010, Sugimoto Weingart, 2014).
Revised: Assessing interdisciplinarity is an important and challenging work in bibliometric studies . Previous studies tend to emphasize that the nature and concept of interdisciplinary is ambiguous and uncertain (e. g. Leydesdorff %DIFDELCMD < & %%% Meyer, 2010, Sugimoto Weingart, 2014).
Edit intent: coherence
Original: Assessing interdisciplinarity is an important and challenging work in bibliometric studies . Previous studies tend to emphasize that the nature and concept of interdisciplinary is ambiguous and uncertain (e. g. Leydesdorff Rafols 2010, Rafols%DIFDELCMD < & %%% Meyer, 2010, Sugimoto Weingart, 2014).
Revised: Assessing interdisciplinarity is an important and challenging work in bibliometric studies . Previous studies tend to emphasize that the nature and concept of interdisciplinary is ambiguous and uncertain (e. g. Leydesdorff Rafols 2010, Rafols%DIFDELCMD < & %%% Weingart, 2014).
Edit intent: coherence
Original:  However, few studies have examined the relations between these measures.
Revised:  However, few studies have thoroughly examined the validity and relations between these measures.
Edit intent: clarity
Original:  In this context, this paper aims to systematically review these interdisciplinarity measures , and explore their inherent relations.
Revised:  In this study, we present a systematic review of these interdisciplinarity measures , and explore their inherent relations.
Edit intent: clarity
Original:  In this context, this paper aims to systematically review these interdisciplinarity measures , and explore their inherent relations.
Revised:  In this context, this paper aims to systematically review these interdisciplinarity measures and explore their inherent relations.
Edit intent: fluency
Original:  We examine these measures in relation to the Web of Science (WoS) journal subject categories (SCs), and also an interdisciplinary research center at Aarhus University.
Revised:  We examine these measures in relation to the Web of Science journal subject categories (SCs), and also an interdisciplinary research center at Aarhus University.
Edit intent: clarity
Original:  In line with the conclusion of Digital Science (2016), our results reveal that the current situation of interdisciplinarity measurement in science studies is confusing and unsatisfying.
Revised:  In line with the conclusion of Digital Science (2016), our results reveal that the current measurements of interdisciplinarity in science studies is confusing and unsatisfying.
Edit intent: clarity
Original:  In line with the conclusion of Digital Science (2016), our results reveal that the current situation of interdisciplinarity measurement in science studies is confusing and unsatisfying.
Revised:  In line with the conclusion of Digital Science (2016), our results reveal that the current situation of interdisciplinarity measurement in science studies are both confusing and unsatisfying.
Edit intent: clarity
Original:  We obtained surprisingly dissimilar results with measures that supposedly should measure similar features .
Revised:  We find surprisingly deviant results when comparing measures that supposedly should measure similar features .
Edit intent: clarity
Original:  There is a growing divide in approaches to building systems: using human experts (e.g. programming) on the one hand, and using behavior learned from data (e.g. ML) on the other hand . PVars aim to make ML in programming as easy as `if' statements and with that hybridize ML with programming.
Revised:  There is a growing divide in approaches to building systems: on the one hand, and using behavior learned from data (e.g. ML) on the other hand . PVars aim to make ML in programming as easy as `if' statements and with that hybridize ML with programming.
Edit intent: clarity
Original:  We leverage the existing concept of variables and create a new type , a predicted variable.
Revised:  We leverage the existing concept of a variable and creating a new type , a predicted variable.
Edit intent: fluency
Original:  PVars are akin to native variables with one important distinction: PVars determine their value using ML when evaluated.
Revised:  PVars are akin to native variables with one important distinction: they determine their value using ML when evaluated.
Edit intent: fluency
Original:  We describe PVars and their interface, how they can be used in programming  , and demonstrate the feasibility of our approach on three algorithmic problems: binary search, Quicksort , and caches.
Revised:  We describe PVars and their interface, how they can be used in programming , and demonstrate the feasibility of our approach on three algorithmic problems: binary search, QuickSort , and caches.
Edit intent: fluency
Original:  We show experimentally that PVars are able to improve over the commonly used heuristics and lead to a better performance than the original algorithms .
Revised:  In these three examples, we replace the commonly used heuristics and lead to a better performance than the original algorithms .
Edit intent: clarity
Original:  To learn faster, PVars use the heuristic function, which they are replacing, as an initial function.
Revised:  To learn faster, we use the heuristic function, which they are replacing, as an initial function.
Edit intent: clarity
Original:  We show that PVars quickly pick up the behavior of the initial function and then improve performance beyond that without ever performing substantially worse -- allowing for a safe deployment in critical applications.
Revised:  We show how this initial function can be used to speed up and stabilize learning while providing a safety net that prevents performance to become substantially worse -- allowing for a safe deployment in critical applications.
Edit intent: clarity
Original:  SmartChoices are akin to native variables with one important distinction: they determine their value using ML when evaluated.
Edit intent: coherence
Original:  Our implementation currently relies on standard Reinforcement Learning (RL) methods.
Revised:  Our implementation relies on standard Reinforcement Learning (RL) methods.
Edit intent: clarity
Original:  Crawled data is processed by means of IXA-pipes NLP chain and EliXa sentiment analysis system.
Revised:  Crawled data is processed by means of the EliXa Sentiment Analysis system.
Edit intent: coherence
Original:  A Django powered interface provides data visualization to provide the user analysis of the data.
Revised:  A Django powered interface provides data visualization for a user-based analysis of the data.
Edit intent: clarity
Original:  This paper presents the architecture of the system and describes in detail the different componentsof the system .
Revised:  This paper presents the architecture of the system and describes in detail its different components .
Edit intent: fluency
Original:  To prove the validity of the approach, two real use cases are accounted for , one in the cultural domain and one in the political domain.
Revised:  To prove the validity of the approach, two real use cases are accounted for : one in the cultural domain and one in the political domain.
Edit intent: fluency
Original: We study several quantum versions of the Shannon capacity of graphs and non-commutative graphs.
Revised: We study quantum versions of the Shannon capacity of graphs and non-commutative graphs.
Edit intent: clarity
Original:  We introduce the asymptotic spectrum of graphs with respect to quantum homomorphisms and entanglement-assisted homomorphisms, and we introduce the asymptotic spectrum of non- commutative graphs with respect to entanglement-assisted homomorphisms.
Revised:  We introduce the asymptotic spectrum of graphs with respect to quantum homomorphisms and entanglement-assisted homomorphisms, and we introduce the asymptotic spectrum of non-commutative graphs with respect to entanglement-assisted homomorphisms.
Edit intent: fluency
Original:  Math., 1988) and obtain a dual characterization of the corresponding Shannon capacities and asymptotic preorders in terms of the asymptotic spectra.
Revised:  Math., 1988) and obtain dual characterizations of the corresponding Shannon capacities and asymptotic preorders in terms of the asymptotic spectra.
Edit intent: fluency
Original:  Math., 1988) and obtain a dual characterization of the corresponding Shannon capacities and asymptotic preorders in terms of the asymptotic spectra.
Revised:  Math., 1988) and obtain a dual characterization of the corresponding Shannon capacities and asymptotic preorders in terms of their asymptotic spectra.
Edit intent: clarity
Original:  We introduce the asymptotic spectrum of graphs with respect to quantum homomorphisms and entanglement-assisted homomorphisms, and we introduce the asymptotic spectrum of non-commutative graphs with respect to entanglement-assisted homomorphisms.
Revised:  We introduce the asymptotic spectrum of graphs with respect to quantum and entanglement-assisted homomorphisms, and we introduce the asymptotic spectrum of non-commutative graphs with respect to entanglement-assisted homomorphisms.
Edit intent: clarity
Original:  Math., 1988) and obtain dual characterizations of the corresponding Shannon capacities and asymptotic preorders in terms of their asymptotic spectra.
Revised:  Math., 1988) in order to obtain dual characterizations of the corresponding Shannon capacities and asymptotic preorders in terms of their asymptotic spectra.
Edit intent: coherence
Original:  We study the relations among the three new quantum asymptotic spectra and  the asymptotic spectrum of graphs.
Revised:  We study the relations among the three new quantum asymptotic spectra and discuss their relations with the asymptotic spectrum of graphs.
Edit intent: clarity
Original:  The bounds on the several Shannon capacities that have appeared in the literature we fit into the corresponding quantum asymptotic spectra.
Edit intent: coherence
Original:  In particular, we prove that the (fractional) complex Haemers bound upper bounds the quantum Shannon capacity,  defined as the regularization of the quantum independence number (Mancinska and Roberson, J. Combin.
Revised:  In particular, we prove that the (fractional) complex Haemers bound upper bounds the quantum Shannon capacity, which is defined as the regularization of the quantum independence number (Mancinska and Roberson, J. Combin.
Edit intent: coherence
Original:  Additionally, we show that deciding if a set of vertices of a bipartite graph can be completed into a minimal dominating set is a NP-complete problem .
Revised:  about enumeration in bipartite graphs .
Edit intent: clarity
Original: Deep sleep and anesthesia have contrasting effects on memory , yet at the microscopic scale they appear to produce similar neural network dynamics consisting of slow waves associated with alternating transients of high activity (UP states ) and silence (DOWN states) .
Revised: Sleep slow waves are known to participate in memory consolidation, yet slow waves occurring under anesthetized states present no positive effects on memory .
Edit intent: clarity
Original:  The results show that the strong adaptation found in anesthesia, but not in sleep, can produce a different type of slow oscillations, less sensitive to external inputs, that may prevent memory formation .
Revised:  The results show that the first type of slow-wave dynamics is more sensitive to external inputs, that may prevent memory formation .
Edit intent: clarity
Original: Sleep slow waves are known to participate in memory consolidation, yet slow waves occurring under anesthetized states present no positive effects on memory.
Revised: Sleep slow waves are known to participate in memory consolidation, yet slow waves occurring under anesthesia present no positive effects on memory.
Edit intent: clarity
Original:  Here, we shed light onto this paradox, based on a combination of extracellular recordings in vivo, in vitro  and computational models.
Revised:  Here, we shed light onto this paradox, based on a combination of extracellular recordings in vivo, in vitro , and computational models.
Edit intent: fluency
Original:  The first type of slow waves is seen during sleep, while the second type prevails in anesthetized states .
Revised:  The first type is consistently observed in natural slow-wave sleep, while the second type prevails in anesthetized states .
Edit intent: clarity
Original:  The first type of slow waves is seen during sleep, while the second type prevails in anesthetized states .
Revised:  The first type of slow waves is seen during sleep, while the second is shown to be ubiquitous under anesthesia .
Edit intent: clarity
Original:  Unlike most of its competitors, NB-IoT was not really born from a clean sheet .
Revised:  Unlike most of its competitors, NB-IoT did not emerge from a blank slate .
Edit intent: clarity
Original:  Indeed, it is tightly connected with LTE, from which it inherits many of its features that undoubtedly conditions its behavior.
Revised:  Indeed, it is closely linked to LTE, from which it inherits many of its features that undoubtedly conditions its behavior.
Edit intent: fluency
Original:  Indeed, it is tightly connected with LTE, from which it inherits many of its features that undoubtedly conditions its behavior.
Revised:  Indeed, it is tightly connected with LTE, from which it inherits many of the features that undoubtedly conditions its behavior.
Edit intent: fluency
Original:  Indeed, it is tightly connected with LTE, from which it inherits many of its features that undoubtedly conditions its behavior.
Revised:  Indeed, it is tightly connected with LTE, from which it inherits many of its features that undoubtedly determine its behavior.
Edit intent: clarity
Original:  In this paper, we empirically explore the boundaries of this technology, analyzing critical characteristics, from a user's point of view , such as energy consumption, reliability and delays.
Revised:  In this paper, we empirically explore the boundaries of this technology, analyzing from a user's point of view , such as energy consumption, reliability and delays.
Edit intent: clarity
Original:  In this paper, we empirically explore the boundaries of this technology, analyzing critical characteristics, from a user's point of view , such as energy consumption, reliability and delays.
Revised:  In this paper, we empirically explore the boundaries of this technology, analyzing critical characteristics, from a user's point of view critical characteristics such as energy consumption, reliability and delays.
Edit intent: fluency
Original:  The results show that its performance in terms of energy is comparable , even outperforming on average a LPWAN reference technology such as LoRa, with the added benefit of guaranteed delivery.
Revised:  The results show that its performance in terms of energy is comparable and even outperforms, in some cases, an LPWAN reference technology such as LoRa, with the added benefit of guaranteed delivery.
Edit intent: clarity
Original:  The results show that its performance in terms of energy is comparable , even outperforming on average a LPWAN reference technology such as LoRa, with the added benefit of guaranteed delivery.
Revised:  The results show that its performance in terms of energy is comparable , even outperforming on average a LPWAN reference technology like LoRa, with the added benefit of guaranteed delivery.
Edit intent: fluency
Original:  The results show that its performance in terms of energy is comparable , even outperforming on average a LPWAN reference technology such as LoRa, with the added benefit of guaranteed delivery.
Revised:  The results show that its performance in terms of energy is comparable , even outperforming on average a LPWAN reference technology such as LoRa, with the added benefit of guaranteeing delivery.
Edit intent: fluency
Original:  The block phases are shown to form an arithmetic progression and the complete characterization of the raster scan ambiguities is given, including: First, the periodic raster grid pathology of degrees of freedom proportional to the squared stepsize and, second, a non-periodic, arithmetically progressing phase shift from block to block.
Revised:  The block phases are shown to form an arithmetic progression and the complete characterization of the raster scan ambiguities is given, including: First, the periodic raster grid pathology of degrees of freedom proportional to the squared step size and, second, a non-periodic, arithmetically progressing phase shift from block to block.
Edit intent: fluency
Original:  Uniqueness problem for blind ptychography is analyzed rigorously for the raster scan  } and its variants  .
Revised:  Uniqueness problem for blind ptychography is analyzed rigorously for the raster scan }) and its variants .
Edit intent: fluency
Original:  The block phases are shown to form an arithmetic progression and the complete characterization of the raster scan ambiguities is given, including: First, the periodic raster grid pathology of degrees of freedom proportional to the squared step size  and, second, a non-periodic, arithmetically progressing phase shift from block to block.
Revised:  The block phases are shown to form an arithmetic progression and the complete characterization of the raster scan ambiguities is given, including: First, the periodic raster grid pathology of degrees of freedom proportional to \tau and, second, a non-periodic, arithmetically progressing phase shift from block to block.
Edit intent: clarity
Original:  Finally a simple modification to the raster scan is introduced and demonstrated to remove all ambiguities other than the  scaling factor and the affine phase ambiguity which are inherent to any blind ptychography .
Revised:  Finally a simple modification to the raster scan is introduced and demonstrated to remove all ambiguities other than the inherent ambiguities of the scaling factor and the affine phase ambiguity which are inherent to any blind ptychography .
Edit intent: clarity
Original: The competitive exclusion principle states that a number of species competing for a smaller number of resources cannot coexist.
Revised: In its simplest form, the competitive exclusion principle states that a number of species competing for a smaller number of resources cannot coexist.
Edit intent: clarity