wanyu/IteraTeR_v2 huggingface dataset:
Original:  In our previous work,  parallel tempering Bayeslands was developed as a framework for parameter estimation and uncertainty quantification for the landscape and basin evolution modelling software Badlands . Parallel tempering Bayeslands features high-performance computing with dozens of processing cores running in parallel to enhance computational efficiency.
Revised:  In our previous work, parallel tempering Bayeslands was developed as a framework for parameter estimation and uncertainty quantification for the Badlands landscape evolution model . Parallel tempering Bayeslands features high-performance computing with dozens of processing cores running in parallel to enhance computational efficiency.
Edit intent: clarity
Original:  Although parallel computing is used , the procedure remains computationally challenging since thousands of samples need to be drawn and evaluated.
Revised:  Although we use parallel computing , the procedure remains computationally challenging since thousands of samples need to be drawn and evaluated.
Edit intent: clarity
Original:  Surrogates can speed up parallel tempering Bayeslands by developing computationally inexpensive surrogates to mimic expensive models .
Revised:  Surrogates can speed up parallel tempering Bayeslands by developing computationally inexpensive models to mimic expensive models .
Edit intent: fluency
Original:  Surrogates can speed up parallel tempering Bayeslands by developing computationally inexpensive surrogates to mimic expensive models .
Revised:  Surrogates can speed up parallel tempering Bayeslands by developing computationally inexpensive surrogates to mimic expensive ones .
Edit intent: clarity
Original:  In this paper, we present an application of surrogate-assisted parallel tempering where that surrogate mimics a landscape evolution model including erosion, sediment transport and deposition, by estimating the likelihood function that is given by the model.
Revised:  In this paper, we apply surrogate-assisted parallel tempering where that surrogate mimics a landscape evolution model including erosion, sediment transport and deposition, by estimating the likelihood function that is given by the model.
Edit intent: coherence
Original:  In this paper, we present an application of surrogate-assisted parallel tempering where that surrogate mimics a landscape evolution model including erosion, sediment transport and deposition, by estimating the likelihood function that is given by the model.
Revised:  In this paper, we present an application of surrogate-assisted parallel tempering where that surrogate mimics a landscape evolution model by estimating the likelihood function that is given by the model.
Edit intent: coherence
Original:  In this paper, we present an application of surrogate-assisted parallel tempering where that surrogate mimics a landscape evolution model including erosion, sediment transport and deposition, by estimating the likelihood function that is given by the model.
Revised:  In this paper, we present an application of surrogate-assisted parallel tempering where that surrogate mimics a landscape evolution model including erosion, sediment transport and deposition, by estimating the likelihood function from the model.
Edit intent: clarity
Original:  We give nearly-linear time approximation schemes for each problem.
Revised:  We give nearly linear-time approximation schemes for each problem.
Edit intent: fluency
Original: Multilayer networks are a powerful paradigm to model complex systems, where various relations might occur among the same set of entities.
Revised: Multilayer networks are a powerful paradigm to model complex systems, where multiple relations occur between the same entities.
Edit intent: clarity
Original:  Despite the keen interest in a variety of problems , algorithms, and analysis methods in this type of network, the problem of extracting dense subgraphs has remained largely unexplored .
Revised:  Despite the keen interest in a variety of tasks , algorithms, and analysis methods in this type of network, the problem of extracting dense subgraphs has remained largely unexplored .
Edit intent: clarity
Original:  Despite the keen interest in a variety of problems , algorithms, and analysis methods in this type of network, the problem of extracting dense subgraphs has remained largely unexplored .
Revised:  Despite the keen interest in a variety of problems , algorithms, and analyses in this type of network, the problem of extracting dense subgraphs has remained largely unexplored .
Edit intent: clarity
Original:  Unlike the single-layer counterpart in which cores are all nested into one another, in the multilayer context no total order exists among multilayer cores : they form a lattice whose size is exponential in the number of layers.
Revised:  The multilayer context is much challenging as no total order exists among multilayer cores : they form a lattice whose size is exponential in the number of layers.
Edit intent: coherence
Original:  Unlike the single-layer counterpart in which cores are all nested into one another, in the multilayer context no total order exists among multilayer cores : they form a lattice whose size is exponential in the number of layers.
Revised:  Unlike the single-layer counterpart in which cores are all nested into one another, in the multilayer context no total order exists among multilayer cores ; rather, they form a lattice whose size is exponential in the number of layers.
Edit intent: coherence
Original:  We then study the problem of extracting only the inner-most  cores, i.e., the cores that are not dominated by any other core in terms of their index on all the layers.
Revised:  We then study the problem of extracting the inner-most cores, i.e., the cores that are not dominated by any other core in terms of their index on all the layers.
Edit intent: clarity
Original:  We then study the problem of extracting only the inner-most  cores, i.e., the cores that are not dominated by any other core in terms of their index on all the layers.
Revised:  We then study the problem of extracting only the inner-most cores, i.e., the cores that are not dominated by any other core in terms of their core index in all the layers.
Edit intent: clarity
Original:  As inner-most cores are orders of magnitude less than all the cores , it is desirable to develop algorithms that effectively exploit the maximality property and extract inner-most cores directly, without first computing a complete decomposition.
Revised:  Inner-most cores are typically orders of magnitude less than all the cores , it is desirable to develop algorithms that effectively exploit the maximality property and extract inner-most cores directly, without first computing a complete decomposition.
Edit intent: coherence
Original:  As inner-most cores are orders of magnitude less than all the cores , it is desirable to develop algorithms that effectively exploit the maximality property and extract inner-most cores directly, without first computing a complete decomposition.
Revised:  As inner-most cores are orders of magnitude less than all the cores . Motivated by this, we devise an algorithm that effectively exploits the maximality property and extract inner-most cores directly, without first computing a complete decomposition.
Edit intent: coherence
Original:  As inner-most cores are orders of magnitude less than all the cores , it is desirable to develop algorithms that effectively exploit the maximality property and extract inner-most cores directly, without first computing a complete decomposition.
Revised:  As inner-most cores are orders of magnitude less than all the cores , it is desirable to develop algorithms that effectively exploit the maximality property and extracts inner-most cores directly, without first computing a complete decomposition.
Edit intent: fluency
Original:  Moreover , we showcase an application of the multilayer core-decomposition tool to the problem of densest-subgraph extraction from multilayer networks.
Revised:  Finally , we showcase an application of the multilayer core-decomposition tool to the problem of densest-subgraph extraction from multilayer networks.
Edit intent: fluency
Original:  Moreover , we showcase an application of the multilayer core-decomposition tool to the problem of densest-subgraph extraction from multilayer networks.
Revised:  Moreover , we showcase the multilayer core-decomposition tool to the problem of densest-subgraph extraction from multilayer networks.
Edit intent: clarity
Original:  Moreover , we showcase an application of the multilayer core-decomposition tool to the problem of densest-subgraph extraction from multilayer networks.
Revised:  Moreover , we showcase an application of the multilayer core-decomposition tool to the problem of densest-subgraph extraction in multilayer networks.
Edit intent: clarity
Original:  We introduce a definition of multilayer densest subgraph that trades-off between high density and number of layers in which the high density holds, and show how multilayer core decomposition can be exploited to approximate this problem with quality guarantees.
Revised:  We introduce a definition of multilayer densest subgraph that trades-off between high density and number of layers in which the high density holds, and exploit multilayer core decomposition can be exploited to approximate this problem with quality guarantees.
Edit intent: coherence
Original:  We introduce a definition of multilayer densest subgraph that trades-off between high density and number of layers in which the high density holds, and show how multilayer core decomposition can be exploited to approximate this problem with quality guarantees.
Revised:  We introduce a definition of multilayer densest subgraph that trades-off between high density and number of layers in which the high density holds, and show how multilayer core decomposition to approximate this problem with quality guarantees.
Edit intent: clarity
Original: In a recent work, Alman and Vassilevska Williams FOCS 2018, arXiv:1810.08671%DIFDELCMD < [%%% cs.
Revised: In FOCS 2018, arXiv:1810.08671%DIFDELCMD < [%%% cs.
Edit intent: coherence
Original: In a recent work, Alman and Vassilevska Williams FOCS 2018, arXiv:1810.08671%DIFDELCMD < [%%% cs.
Revised: In a recent work, Alman and Vassilevska Williams %DIFDELCMD < [%%% cs.
Edit intent: coherence
Original: CC proved limitations on designing matrix multiplication algorithms using the Galactic method applied to many tensors of interest, including the family of Coppersmith-Winograd tensors.
Revised: CC this work, we prove limitations on the known methods for designing matrix multiplication algorithms using the Galactic method applied to many tensors of interest, including the family of Coppersmith-Winograd tensors.
Edit intent: clarity
Original:  We describe two sources of formal verification problems: (i) semantic conformance checking of smart contracts against a state-machine and access control based Azure Blockchain Workbench application configuration, and (ii) safety verification for smart contracts implementing the authority governance in Ethereum Proof-of-Authority (PoA) on Azure.
Revised:  We describe two sources of formal verification problems: (i) semantic conformance checkingAzure Blockchain Workbench of smart contracts against a state-machine and access control based Azure Blockchain Workbench application configuration, and (ii) safety verification for smart contracts implementing the authority governance in Ethereum Proof-of-Authority (PoA) on Azure.
Edit intent: clarity
Original:  We describe our experience applying VeriSolto Workbench sample contracts and{\sc  {\it   Proof of Authority governance contracts in Azure, and finding previously unknown bugs in well-tested smart contracts.
Revised:  We describe our experience applying VeriSolto Workbench sample contracts and{\sc {\it Proof of Authority (PoA). We have found previously unknown bugs in well-tested smart contracts.
Edit intent: clarity
Original:  We describe our experience applying VeriSolto Workbench sample contracts and{\sc  {\it   Proof of Authority governance contracts in Azure, and finding previously unknown bugs in well-tested smart contracts.
Revised:  We describe our experience applying VeriSolto Workbench sample contracts and{\sc {\it Proof of Authority governance contracts in Azure, and finding previously unknown bugs in these published smart contracts.
Edit intent: clarity
Original:  We provide push-button unbounded verification for the semantic conformance checking for all the sample contractsshipped in Workbench, once the bugs are fixed{\sc   .
Revised:  After fixing these bugs,{\sc .
Edit intent: clarity
Original: Low power wide area (LPWA) networks , which enable the energy-constraint devices distributed over wide areas to establish affordable connectivity with the Internet , have attracted a lot of attentions in recent years . Among them, Long Range (LoRa) network becomes one of the most promising system and motivates a plethora of applications.
Revised: Low power wide area (LPWA) networks are attracting a lot of attention in recent years because of enabling the energy-constraint devices distributed over wide areas to establish affordable connectivity with the Internet , have attracted a lot of attentions in recent years . Among them, Long Range (LoRa) network becomes one of the most promising system and motivates a plethora of applications.
Edit intent: coherence
Original: Low power wide area (LPWA) networks , which enable the energy-constraint devices distributed over wide areas to establish affordable connectivity with the Internet , have attracted a lot of attentions in recent years . Among them, Long Range (LoRa) network becomes one of the most promising system and motivates a plethora of applications.
Revised: Low power wide area (LPWA) networks , which enable the energy-constraint devices distributed over wide areas to establish affordable connectivity with the Internet . Among them, Long Range (LoRa) network becomes one of the most promising system and motivates a plethora of applications.
Edit intent: coherence
Original:  In order to deal with the challenges of managing various applications and supporting massive LoRa devices, this paper proposes a fleXible LoRa system, i. e., X-LoRa , with the features of  easy deployment and open source.
Revised:  In order to deal with the challenges of managing various applications and supporting massive LoRa devices, this paper proposes a fleXible LoRa system, i. e., X-LoRa is proposed with the features of easy deployment and open source.
Edit intent: clarity
Original:  X-LoRa divides the operations of LoRa network server into several decoupled functional modules according to the microservice design principles.
Revised:  X-LoRa modularizes LoRa network server into several decoupled functional modules according to the microservice design principles.
Edit intent: clarity
Original:  X-LoRa divides the operations of LoRa network server into several decoupled functional modules according to the microservice design principles.
Revised:  X-LoRa divides the operations of LoRa network server into several decoupled modules according to the microservice design principles.
Edit intent: clarity
Original:  Meanwhile , the real-time streaming data pipelines are utilized as message queue for interaction between modules to guarantee the system performance and scalability.
Revised:  Moreover , the real-time streaming data pipelines are utilized as message queue for interaction between modules to guarantee the system performance and scalability.
Edit intent: fluency
Original:  Meanwhile , the real-time streaming data pipelines are utilized as message queue for interaction between modules to guarantee the system performance and scalability.
Revised:  Meanwhile , the real-time streaming data pipelines are utilized for the interaction between modules to guarantee the system performance and scalability.
Edit intent: coherence
Original:  Meanwhile , the real-time streaming data pipelines are utilized as message queue for interaction between modules to guarantee the system performance and scalability.
Revised:  Meanwhile , the real-time streaming data pipelines are utilized as message queue for interaction between modules to guarantee high scalability.
Edit intent: clarity
Original:  The architecture and implementation of X-LoRa is discussed along with the technical features as well as the functionality of each module.
Revised:  The implementation of X-LoRa is discussed along with the technical features as well as the functionality of each module.
Edit intent: clarity
Original:  The architecture and implementation of X-LoRa is discussed along with the technical features as well as the functionality of each module.
Revised:  The architecture and implementation of X-LoRa is presented along with the technical features as well as the functionality of each module.
Edit intent: clarity
Original:  Finally, a few experiments are conducted to demonstrate the good performances of X-LoRa.
Revised:  Finally, a few experiments are conducted to demonstrate the good performance of X-LoRa.
Edit intent: fluency
Original:  Low power wide area (LPWA) networks are attracting a lot of attention in recent years because of enabling the energy-constraint devices distributed over wide areas to establish affordable connectivity with the Internet.
Revised:  Low power wide area (LPWA) networks , since it enables the energy-constraint devices distributed over wide areas to establish affordable connectivity with the Internet.
Edit intent: coherence
Original:  Aiming at providing insight about the improvement of LoRa network server , a fleXible architecture named as X-LoRa is proposed with the features of high performance, easy deployment and open source.
Revised:  Aiming at providing insight about the improvement of LoRa network server architecture named as X-LoRa is proposed with the features of high performance, easy deployment and open source.
Edit intent: clarity
Original:  Aiming at providing insight about the improvement of LoRa network server , a fleXible architecture named as X-LoRa is proposed with the features of high performance, easy deployment and open source.
Revised:  Aiming at providing insight about the improvement of LoRa network server , a fleXible architecture named as X-LoRa with the features of high performance, easy deployment and open source.
Edit intent: clarity
Original:  X-LoRa modularizes LoRa network server into several decoupled modules according to the microservice design principles .
Revised:  LoRa network server into several decoupled modules according to the microservice design principles .
Edit intent: clarity
Original:  Finally, a few experiments are conducted to demonstrate the good performance of X-LoRa  .
Revised:  The extensive experimental results demonstrate that X-LoRa .
Edit intent: clarity
Original: Long Range (LoRa) network is emerging as one of the most promising systems in Low power wide area (LPWA) networks, since it enables the energy-constraint devices distributed over wide areas to establish affordable connectivity.
Revised: Long Range (LoRa) network is emerging as one of the most promising Low Power Wide Area (LPWA) networks, since it enables the energy-constraint devices distributed over wide areas to establish affordable connectivity.
Edit intent: clarity
Original:  Although the LoRa technology itself is quite mature and specific , how to efficiently deploy and manage various applications based on LoRa network so as to support a large massive of LoRa nodes is an open challenge.
Revised:  However , how to efficiently deploy and manage various applications based on LoRa network so as to support a large massive of LoRa nodes is an open challenge.
Edit intent: coherence
Original:  Although the LoRa technology itself is quite mature and specific , how to efficiently deploy and manage various applications based on LoRa network so as to support a large massive of LoRa nodes is an open challenge.
Revised:  Although the LoRa technology itself is quite mature and specific , how to implement a cost-effective and flexible LoRa network is still an open challenge.
Edit intent: clarity
Original:  This paper contributes by proposing a fleXible LoRa network server architecture named as X-LoRa with the features of high performance, easy deployment and open source . LoRa network server is modularized into four modules with different functions according to the microservice principles so as to reduce the coupling between modules and guarantee high scalability.
Revised:  This paper contributes by proposing an improved software architecture of LoRa network server architecture named as X-LoRa with the features of high performance, easy deployment and open source . LoRa network server is modularized into four modules with different functions according to the microservice principles so as to reduce the coupling between modules and guarantee high scalability.
Edit intent: clarity
Original:  Under the proposed architecture, the messaging system based on streaming data is utilized for the interaction between modules , which outperforms in throughput and low-latency delivery.
Revised:  Under the proposed architecture, the messaging system based on streaming data for the interaction between modules , which outperforms in throughput and low-latency delivery.
Edit intent: clarity
Original: We introduce an explicit, adaptive time-stepping scheme for  simulation of SPDEs with non-Lipschitz drift coefficients.
Revised: We introduce an explicit, adaptive time-stepping scheme for the simulation of SPDEs with non-Lipschitz drift coefficients.
Edit intent: fluency
Original:  Strong convergence is proven for the full space-time discretisation with multiplicative  noise by considering the space and time discretisation separately.
Revised:  Strong convergence rates are proven for the full space-time discretisation with multiplicative noise by considering the space and time discretisation separately.
Edit intent: clarity
Original:  Our algorithm runs in linear time using constant workspace for large collections of short strings .
Revised:  Our algorithm runs in linear time using constant additional space for strings from constant alphabets .
Edit intent: clarity
Original: We present a simple algorithm for computing the document array given the string collection and its suffix array as input.
Revised: We present a simple algorithm for computing the document array given a string collection and its suffix array as input.
Edit intent: fluency
Original:  A common approach is to rely on Product Quantization that allows storing large vector databases in memory and also allows efficient distance computations.
Revised:  A common approach is to rely on Product Quantization , which allows the storage of large vector databases in memory and also allows efficient distance computations.
Edit intent: fluency
Original:  A common approach is to rely on Product Quantization that allows storing large vector databases in memory and also allows efficient distance computations.
Revised:  A common approach is to rely on Product Quantization that allows storing large vector databases in memory and efficient distance computations.
Edit intent: coherence
Original:  Quicker ADC contributes additional implementations not limited to m4 codes and relying on AVX-512, the latest revision of SIMD instruction set.
Revised:  Quicker ADC contributes additional implementations not limited to m4 codes and supporting AVX-512, the latest revision of SIMD instruction set.
Edit intent: clarity
Original:  Finally, we  open-source at URL a fork of FAISS that includes Quicker ADC .
Revised:  Finally, we open-source fork of FAISS that includes Quicker ADC .
Edit intent: clarity
Original:  Finally, we  open-source at URL a fork of FAISS that includes Quicker ADC .
Revised:  Finally, we open-source at URL a fork of FAISS enhanced with Quicker ADC at URL
Edit intent: clarity