wanyu/IteraTeR_v2 huggingface dataset:
Original: Whether the goal is to estimate the number of people that live in a congressional district, to estimate the number of individuals that have died in an armed conflict, or to disambiguate individual authors using bibliographic data, all these applications have a common theme - integrating information from multiple sources.
Revised: Whether the goal is to estimate the number of people that live in a congressional district, to estimate the number of individuals that have died in an armed conflict, or to disambiguate individual authors using bibliographic data, all these applications have a common theme -- integrating information from multiple sources.
Edit intent: fluency
Original:  Before such questions can be answered, databases must be cleaned and integrated in a systematic and accurate way, commonly known as record linkage, de-duplication , or entity resolution .
Revised:  Before such questions can be answered, databases must be cleaned and integrated in a systematic and accurate way, commonly known as record linkage, de-duplication ) .
Edit intent: clarity
Original:  By learning from these works, this study proposes a novelty inter-blockchain communication framework that provides secure interoperability for each blockchain .
Revised:  By learning from these works, this study proposes a novel solution that provides secure interoperability for each blockchain .
Edit intent: clarity
Original:  The result of these tasks will peg to all other blockchains through the blockchain's terminated branch transferred in a gossip network.
Revised:  The result of tasks is bound with the system, hence can be anchored to all other blockchains through the blockchain's terminated branch transferred in a gossip network.
Edit intent: clarity
Original:  The result of these tasks will peg to all other blockchains through the blockchain's terminated branch transferred in a gossip network.
Revised:  The result of these tasks will peg to all other blockchain systems through the gossip network.
Edit intent: clarity
Original:  Finally, we confirm that high-resolution, low-resolution and NMR-determined structures inhabit a common feature space, and thus provide a theoretical basis for mapping between domains to boost resolution .
Revised:  Finally, we confirm that high-resolution, low-resolution and NMR-determined structures inhabit a common feature space, and thus provide a theoretical foundation for boosting with single-image super-resolution .
Edit intent: clarity
Original:  For example, congestion pricing in New York City would impact travelers' departure times and mode choices, among other decisions.
Edit intent: coherence
Original:  The simulation-based virtual test bed is loaded with an 8M+ synthetic 2016 population calibrated in a prior study to fit ride-hail services and bike-share .
Revised:  The simulation-based virtual test bed is loaded with an 8M+ synthetic 2016 population calibrated in a prior study .
Edit intent: clarity
Original:  The model was used to evaluate a congestion pricing plan proposed by the Regional Plan Association and suggested a much higher (127K) car trip reduction compared to their report (59K).
Revised:  The model is used to evaluate a congestion pricing plan proposed by the Regional Plan Association and suggested a much higher (127K) car trip reduction compared to their report (59K).
Edit intent: fluency
Original:  The model was used to evaluate a congestion pricing plan proposed by the Regional Plan Association and suggested a much higher (127K) car trip reduction compared to their report (59K).
Revised:  The model was used to evaluate a congestion pricing plan proposed by the Regional Plan Association and suggests a much higher (127K) car trip reduction compared to their report (59K).
Edit intent: fluency
Original: In this paper we study the verification of parameterised multi-agent system (MASs), and in particular the task of verifying whether unwanted states, characterised as a given state formula, are reachable in a given MAS, i.e., whether the MAS is unsafe.
Revised: In this paper we study the verification of parameterised multi-agent systems (MASs), and in particular the task of verifying whether unwanted states, characterised as a given state formula, are reachable in a given MAS, i.e., whether the MAS is unsafe.
Edit intent: fluency
Original:  We solve this problem via infinite-state model checking based on satisfiability modulo theories (SMT), relying on the theory of array-based systems: we present parameterised MASs as particular array-based systems, under two execution semantics for the parameterised MAS, which we call concurrent and interleaved.
Revised:  We solve this problem via infinite-state model checking based on satisfiability modulo theories (SMT), relying on the theory of array-based systems: we present parameterised MASs as particular array-based systems, under two execution semantics for the MAS, which we call concurrent and interleaved.
Edit intent: fluency
Original:  We prove our decidability results under these assumptions and illustrate our implementation approach, called `` SAFE: the Swarm Safety Detector '' , based on the third-party model checker MCMT, which we evaluate experimentally.
Revised:  We prove our decidability results under these assumptions and illustrate our implementation approach, called SAFE: the Swarm Safety Detector '' , based on the third-party model checker MCMT, which we evaluate experimentally.
Edit intent: fluency
Original:  We prove our decidability results under these assumptions and illustrate our implementation approach, called `` SAFE: the Swarm Safety Detector '' , based on the third-party model checker MCMT, which we evaluate experimentally.
Revised:  We prove our decidability results under these assumptions and illustrate our implementation approach, called `` SAFE: the Swarm Safety Detector , based on the third-party model checker MCMT, which we evaluate experimentally.
Edit intent: fluency
Original:  In maize, there are two types of post-embryonic roots - subterranean nodal roots (crown roots) and aerial nodal roots (brace roots ).
Revised:  In maize, two types of post-embryonic roots - subterranean nodal roots (crown roots) and aerial nodal roots (brace roots ).
Edit intent: coherence
Original:  In maize, there are two types of post-embryonic roots - subterranean nodal roots (crown roots) and aerial nodal roots (brace roots ).
Revised:  In maize, there are two types of nodal roots-subterranean crown and aerial brace roots - subterranean nodal roots (crown roots) and aerial nodal roots (brace roots ).
Edit intent: clarity
Original:  The limited knowledge of brace root development and function  in other members of Poaceae  .
Revised:  Brace root development and function in other members of Poaceae .
Edit intent: clarity
Original:  Networks remain the de facto standard, however, as relational datasets often fail to record higher-order interactions.
Revised:  Networks remain the de facto standard, however, as relational datasets often fail to include higher-order interactions.
Edit intent: clarity
Original:  To address this gap, we here introduce a Bayesian approach to reconstruct the higher-order interactions  from pairwise network data.
Revised:  Here, we introduce a Bayesian approach to reconstruct the higher-order interactions from pairwise network data.
Edit intent: coherence
Original:  To address this gap, we here introduce a Bayesian approach to reconstruct the higher-order interactions  from pairwise network data.
Revised:  To address this gap, we here introduce a Bayesian approach to reconstruct these missing higher-order interactions from pairwise network data.
Edit intent: clarity
Original:  To address this gap, we here introduce a Bayesian approach to reconstruct the higher-order interactions  from pairwise network data.
Revised:  To address this gap, we here introduce a Bayesian approach to reconstruct the higher-order interactions , from pairwise network data.
Edit intent: fluency
Original:  Our method is based on the principle of parsimony and does not reconstruct higher-order structures when there is scant statistical evidence .
Revised:  Our method is based on the principle of parsimony and only includes higher-order structures when there is scant statistical evidence .
Edit intent: clarity
Original:  Here, we introduce a Bayesian approach to reconstruct these missing higher-order interactions , from pairwise network data.
Revised:  Here, we introduce a Bayesian approach to reconstruct latent higher-order interactions , from pairwise network data.
Edit intent: clarity
Original:  Here, we introduce a Bayesian approach to reconstruct these missing higher-order interactions , from pairwise network data.
Revised:  Here, we introduce a Bayesian approach to reconstruct these missing higher-order interactions from ordinary pairwise network data.
Edit intent: clarity
Original:  We also study the impact of TL with varying amount of training data ranging from 50 hours to 1000 hours and show the efficacy of TL for languages with a very small amount of training data.
Revised:  We also study the impact of TL with varying amount of training data ranging from 50 hours to 1000 hours and show the efficacy of TL for languages with small amount of training data.
Edit intent: clarity
Original: Analysis shows that the existing algorithms for skyline cannot adapt to big data well.
Revised: The existing algorithms for skyline cannot adapt to big data well.
Edit intent: coherence
Original: Analysis shows that the existing algorithms for skyline cannot adapt to big data well.
Revised: Analysis shows that the existing algorithms for processing skyline queries cannot adapt to big data well.
Edit intent: clarity
Original:  It is found that the expected representative ratio of the result nearly isn't affected by the data volume , and the variance is relatively small.
Revised:  It is found that the expected representative ratio of the result nearly isn't affected by the data volume , and the standard deviation is relatively small.
Edit intent: clarity
Original:  The paper proposed two approximate skyline algorithms based on sampling.
Revised:  This paper proposes two approximate skyline algorithms based on sampling.
Edit intent: fluency
Original:  The first algorithm obtains a size m sample and computes the approximate skyline on the sample.
Revised:  The first algorithm obtains a fixed size sample and computes the approximate skyline on the sample.
Edit intent: clarity
Original:  The running time of the algorithm is O(m\log^{d-2 almost independent of the relation size, and the standard deviation is relatively small.
Revised:  The running time of the algorithm is almost independent of the relation size, and the standard deviation is relatively small.
Edit intent: coherence
Original:  Furthermore, assuming another hypothesis called Non-Uniform NSETH (NUNSETH), one cannot use a even a randomized SETH-based reduction to rule out the existence of such algorithms.
Edit intent: coherence
Original:  We make the same characterization for randomized SETH-based reductions, assuming NUNSETH.
Edit intent: coherence
Original:  Starting with the statistical analysis in Google's demonstration, which we explain, we offer improvements on their estimator of the fidelity, and different approaches to testing the distributions generated by the quantum computer.
Revised:  Starting with the statistical analysis in Google's demonstration, which we explain, we study various estimators of the fidelity, and different approaches to testing the distributions generated by the quantum computer.
Edit intent: clarity
Original: After decades of research,  Internet of Things (IoT) is finally permeating real-life and helps improve the efficiency of infrastructures and processes as well as our health.
Revised: After decades of research, the Internet of Things (IoT) is finally permeating real-life and helps improve the efficiency of infrastructures and processes as well as our health.
Edit intent: fluency
Original:  As  massive number of IoT devices are deployed, they naturally incurs great operational costs to ensure intended operations.
Revised:  As a massive number of IoT devices are deployed, they naturally incurs great operational costs to ensure intended operations.
Edit intent: fluency
Original:  As  massive number of IoT devices are deployed, they naturally incurs great operational costs to ensure intended operations.
Revised:  As massive number of IoT devices are deployed, they naturally incur great operational costs to ensure intended operations.
Edit intent: fluency
Original:  i) automatically generated features using autoencoders significantly outperform the non-encoded representations and can improve F1 score up to 500\% and ii) among the best performing models based on F1 score, supervised ML models outperform the unsupervised counterpart models with about 18\% on averagefor anomaly types SuddenDand SuddenR, and this trend also applies to SlowDand InstaD anomalies, albeit with a tiny margin .
Revised:  i) selected supervised approaches are able to detect anomalies with F1 score up to 500\% and ii) among the best performing models based on F1 score, supervised ML models outperform the unsupervised counterpart models with about 18\% on averagefor anomaly types SuddenDand SuddenR, and this trend also applies to SlowDand InstaD anomalies, albeit with a tiny margin .
Edit intent: clarity
Original:  We investigate the solution accuracy requirement on the inner least squares problems and give a reliable stopping tolerance of the LSQR for iteratively solving the inner least squares problems .
Revised:  In this paper, we give a detailed investigation on the solution accuracy requirement on the inner least squares problems and give a reliable stopping tolerance of the LSQR for iteratively solving the inner least squares problems .
Edit intent: clarity
Original:  We investigate the solution accuracy requirement on the inner least squares problems and give a reliable stopping tolerance of the LSQR for iteratively solving the inner least squares problems .
Revised:  We investigate the solution accuracy requirement on the inner least squares problems and propose a practical stopping criterion for inner iterations .
Edit intent: clarity
Original:  Being socially isolated and the experience of loneliness is not only experienced by older adults, but also by younger people who live alone and cannot communicate with others or get involved in social situations as they used to.
Revised:  Social isolation and loneliness are not only experienced by older adults, but also by younger people who live alone and cannot communicate with others or get involved in social situations as they used to.
Edit intent: clarity
Original: We show that the shuffle and iterated shuffle of the commutative closure of a group language is regular, and derive state bounds for resulting automata .
Revised: We show that the commutative closure combined with the iterative shuffle is a regularity-preserving operation on group languages .
Edit intent: clarity
Original:  In particular, for commutative group languages  the iterated shuffle is a regularity preserving operation.
Revised:  In particular, for commutative group languages , the iterated shuffle is a regularity preserving operation.
Edit intent: fluency
Original: We show that the commutative closure combined with the iterative shuffle is a regularity-preserving operation on group languages.
Revised: We show that the commutative closure combined with the iterated shuffle is a regularity-preserving operation on group languages.
Edit intent: fluency
Original:  In this paper, under appropriate conditions, we prove the convergence of deep fictitious play (DFP) to the true Nash equilibrium.
Revised:  In this paper, we prove the convergence of deep fictitious play (DFP) to the true Nash equilibrium.
Edit intent: coherence
Original:  However, in many applications, such as targeted vulnerability assessment or clinical therapies, one aspires to affect a targeted subset of a network, while limiting the impact on the rest  .
Revised:  However, in many applications, such as cybersecurity, an attacker may want to attack a targeted subgraph of a network, while limiting the impact on the rest .
Edit intent: clarity
Original:  In addition, we present a condition for certifying  a targeted subgraph as immune to targeted diffusion .
Revised:  In addition, we present a condition for certifying that a targeted subgraph as immune to targeted diffusion .
Edit intent: fluency
Original:  In addition, we present a condition for certifying  a targeted subgraph as immune to targeted diffusion .
Revised:  In addition, we present a condition for certifying a targeted subgraph is immune to such attacks .
Edit intent: clarity
Original:  Finally, we demonstrate the effectiveness of our approach through extensive experiments on real and synthetic networks.
Revised:  Finally, we demonstrate the effectiveness of our approach through experiments on real and synthetic networks.
Edit intent: clarity
Original:  This is established by analyzing linear-size cuts using techniques of Jagannath and Sen \mbox{ jagannath2017unbalanced derived from ideas from statistical physics and analyzing small cuts via martingale inequalities.
Revised:  This is established by analyzing linear-size cuts using techniques of Jagannath-Sen '17 derived from ideas from statistical physics and analyzing small cuts via martingale inequalities.
Edit intent: clarity
Original:  We also prove that every spectral sparsifier of the clique having average degree d and a certain high "pseudo-girth" property has an approximation error that is at least the "Ramanujan bound" (2-o_{n,d}(1))/\sqrt d, which is met by d-regular Ramanujan graphs, generalizing a lower bound of Srivastava and Trevisan \mbox{ ST18 Together, these results imply a separation between spectral sparsification and cut sparsification.
Revised:  We also prove that every spectral sparsifier of the clique having average degree d and a certain high "pseudo-girth" property has an approximation error that is at least the "Ramanujan bound" (2-o_{n,d}(1))/\sqrt d, which is met by d-regular Ramanujan graphs, generalizing a lower bound of Srivastava-Trevisan '18. Together, these results imply a separation between spectral sparsification and cut sparsification.
Edit intent: coherence
Original:  This is established by analyzing linear-size cuts using techniques of Jagannath-Sen '17 derived from ideas from statistical physics and analyzing small cuts via martingale inequalities.
Revised:  This is established by analyzing linear-size cuts using techniques of Jagannath and Sen derived from ideas from statistical physics and analyzing small cuts via martingale inequalities.
Edit intent: clarity
Original:  This is established by analyzing linear-size cuts using techniques of Jagannath-Sen '17 derived from ideas from statistical physics and analyzing small cuts via martingale inequalities.
Revised:  This is established by analyzing linear-size cuts using techniques of Jagannath-Sen '17 derived from ideas in statistical physics, and analyzing small cuts via martingale inequalities.
Edit intent: fluency
Original:  We also prove that every spectral sparsifier of the clique having average degree d and a certain high "pseudo-girth" property has an approximation error that is at least the "Ramanujan bound " (2-o_{n,d}(1))/\sqrt d, which is met by d-regular Ramanujan graphs, generalizing a(1))/\sqrt d;
Revised:  We also prove that every spectral sparsifier of the clique having average degree d , we prove that the approximation error is at least the "Ramanujan bound " (2-o_{n,d}(1))/\sqrt d, which is met by d-regular Ramanujan graphs, generalizing a(1))/\sqrt d;
Edit intent: clarity
Original:  We also prove that every spectral sparsifier of the clique having average degree d and a certain high "pseudo-girth" property has an approximation error that is at least the "Ramanujan bound " (2-o_{n,d}(1))/\sqrt d, which is met by d-regular Ramanujan graphs, generalizing a(1))/\sqrt d;
Revised:  We also prove that every spectral sparsifier of the clique having average degree d and a certain high "pseudo-girth" property has an approximation error that is at least the "Ramanujan bound '' (2-o_{n,d}(1))/\sqrt d, which is met by d-regular Ramanujan graphs, generalizing a(1))/\sqrt d;
Edit intent: fluency
Original:  The JPEG standard allows  customized quantization table to be used ;
Revised:  The JPEG standard allows to use customized quantization table to be used ;
Edit intent: coherence
Original:  The JPEG standard allows  customized quantization table to be used ;
Revised:  The JPEG standard allows customized quantization table ;
Edit intent: clarity
Original:  however, it's still a challenging problem to find an optimal quantization table with acceptable computational cost.
Revised:  however, it's still a challenging problem to find an optimal quantization table within acceptable computational cost.
Edit intent: clarity
Original:  Instead of optimizing a single image or a set of representative images, the simulated annealing technique is applied to texture mosaic images to search for an optimal quantization table for each texture category.
Revised:  Instead of optimizing a single image or a collection of representative images, the simulated annealing technique is applied to texture mosaic images to search for an optimal quantization table for each texture category.
Edit intent: clarity
Original:  A deep CNN model is used to learn those texture features and predict the new image's texture distribution, then aggregate texture optimal tables to come out  an image specific optimal quantization table.
Revised:  A deep CNN model is used to learn those texture features and predict the new image's texture distribution, then fuse optimal texture tables to come out an image specific optimal quantization table.
Edit intent: clarity
Original:  A deep CNN model is used to learn those texture features and predict the new image's texture distribution, then aggregate texture optimal tables to come out  an image specific optimal quantization table.
Revised:  A deep CNN model is used to learn those texture features and predict the new image's texture distribution, then aggregate texture optimal tables to come out with an image specific optimal quantization table.
Edit intent: coherence
Original: This paper improves guaranteed error control for the Stokes problem with a focus on pressure-robustness, i.e. for discretisations that compute a discrete velocity that is independent of the exact pressure.
Revised: This paper aims to improve guaranteed error control for the Stokes problem with a focus on pressure-robustness, i.e. for discretisations that compute a discrete velocity that is independent of the exact pressure.
Edit intent: clarity
Original:  Moreover, a provably efficient local design of the equilibrated fluxes is presented that reduces the numerical costsof the error estimator.
Revised:  The second main result is a provably efficient local design of the equilibrated fluxes is presented that reduces the numerical costsof the error estimator.
Edit intent: coherence
Original:  All theoretical findings are verified by numerical examples which also show that the efficiency indices of our novel guaranteed upper bounds for the velocity error are close to 1.
Revised:  All theoretical findings are verified by numerical examples which also show that the efficiency indices of our novel guaranteed upper bounds are close to 1.
Edit intent: clarity
Original:  All theoretical findings are verified by numerical examples which also show that the efficiency indices of our novel guaranteed upper bounds for the velocity error are close to 1.
Revised:  All theoretical findings are verified by numerical examples which also show that the efficiency indices of our novel guaranteed upper bounds for the velocity error are close to one.
Edit intent: fluency