wanyu/IteraTeR_v2 huggingface dataset:
Original:  We study the speech separation problem for far-filed data (more similar to naturalistic audio streams) and develop multi-channel solutions for both frequency and time-domain separators with utilizing spectral, spatial and speaker location information.
Revised:  We study the speech separation problem for far-field data (more similar to naturalistic audio streams) and develop multi-channel solutions for both frequency and time-domain separators with utilizing spectral, spatial and speaker location information.
Edit intent: fluency
Original:  With multi-channel framework as well , we can obtain relatively up to +35.5\% and +46\% improvement in terms of WER and SDR, respectively.
Revised:  Multi-channel framework as well , we can obtain relatively up to +35.5\% and +46\% improvement in terms of WER and SDR, respectively.
Edit intent: coherence
Original:  With multi-channel framework as well , we can obtain relatively up to +35.5\% and +46\% improvement in terms of WER and SDR, respectively.
Revised:  With multi-channel framework as well is shown to improve the single-channel performance relatively up to +35.5\% and +46\% improvement in terms of WER and SDR, respectively.
Edit intent: clarity
Original:  With multi-channel framework as well , we can obtain relatively up to +35.5\% and +46\% improvement in terms of WER and SDR, respectively.
Revised:  With multi-channel framework as well , we can obtain relatively up to +35.5\% and +46\% in terms of WER and SDR, respectively.
Edit intent: clarity
Original:  Finally, we prove the proposed DLMP constitute a competitive equilibrium, which can be leveraged for designing a distribution electricity market, and show that imposing chance constraints on voltage limits distort the equilibrium.
Revised:  Finally, we prove the proposed DLMPs constitute a competitive equilibrium, which can be leveraged for designing a distribution electricity market, and show that imposing chance constraints on voltage limits distort the equilibrium.
Edit intent: fluency
Original:  Finally, we prove the proposed DLMP constitute a competitive equilibrium, which can be leveraged for designing a distribution electricity market, and show that imposing chance constraints on voltage limits distort the equilibrium.
Revised:  Finally, we prove the proposed DLMP constitute a competitive equilibrium, which can be leveraged for designing a distribution electricity market, and show that imposing chance constraints on voltage limits distorts the equilibrium.
Edit intent: fluency
Original: The effects of weather on agriculture in recent years have become a major concern across the globe .
Revised: The effects of weather on agriculture in recent years have become a major global concern .
Edit intent: clarity
Original:  Hence, the need for an effective weather risk management tool (  weather derivatives) for agricultural stakeholders .
Revised:  Hence, the need for an effective weather risk management tool ( i.e., weather derivatives) for agricultural stakeholders .
Edit intent: coherence
Original:  Hence, the need for an effective weather risk management tool (  weather derivatives) for agricultural stakeholders .
Revised:  Hence, the need for an effective weather risk management tool ( weather derivatives) that can hedge crop yields against weather uncertainties .
Edit intent: clarity
Original:  A model with time-varying speed of mean reversion, seasonal mean,  local volatility that depends on the average temperature and time for the contract period is proposed.
Revised:  A model with time-varying speed of mean reversion, seasonal mean, and local volatility that depends on the average temperature and time for the contract period is proposed.
Edit intent: clarity
Original:  Pricing futures on baskets reduces geographical basis risk as buyer's have the opportunity to select the most appropriate weather stations with their desired weight preference.
Revised:  Pricing futures on baskets reduces geographical basis risk , as buyers have the opportunity to select the most appropriate weather stations with their desired weight preference.
Edit intent: fluency
Original:  With these pricing models,  agricultural stakeholders can hedge their crops against the perils of  weather.
Revised:  With these pricing models, farmers and agricultural stakeholders can hedge their crops against the perils of weather.
Edit intent: clarity
Original:  With these pricing models,  agricultural stakeholders can hedge their crops against the perils of  weather.
Revised:  With these pricing models, agricultural stakeholders can hedge their crops against the perils of extreme weather.
Edit intent: clarity
Original:  Here, we leverage multimodal human neuroimaging, genotype, and post-mortem gene expression datasets to determine the form of the genotype-phenotype map of human brain connectivity.
Revised:  Here, we determine the form of the genotype-phenotype map of human brain connectivity.
Edit intent: clarity
Original:  Critically, network analyses of genes and brain connectivity demonstrate that different sets of genes account for the connectivity of different regions in the brain .
Revised:  Critically, network analyses of genes and brain connectivity demonstrate that different sets of genes encode the connectivity of different regions in the brain .
Edit intent: clarity
Original:  The SimPQR method for computing these ``nonlinear DEIM'' (NLDEIM) coordinates is successfully applied to real-world data lying near an inertial manifold in a cylinder wake flow as well as data coming from a viscous Burgers equation with different initial conditions.
Revised:  The SimPQR method for computing these `nonlinear DEIM' (NLDEIM) coordinates is successfully applied to real-world data lying near an inertial manifold in a cylinder wake flow as well as data coming from a viscous Burgers equation with different initial conditions.
Edit intent: fluency
Original: We consider a public content caching system that is shared by a number of proxies.
Revised: We consider a content-caching system thatis shared by a number of proxies.
Edit intent: clarity
Original:  The cache could be located in an edge-cloud datacenter and the the proxies could each serve a large population of mobile end-users.
Revised:  The cache could belocated in an edge-cloud datacenter and the the proxies could each serve a large population of mobile end-users.
Edit intent: fluency
Original:  The cache could be located in an edge-cloud datacenter and the the proxies could each serve a large population of mobile end-users.
Revised:  The cache could be located in an edge-cloud datacenter and the proxies couldeach serve a large population of mobile end-users.
Edit intent: fluency
Original:  The proxies operate their own LRU-list of a certain capacity in the shared cache.
Revised:  Eachproxy operates its own LRU-list of a certain capacity in the shared cache.
Edit intent: clarity
Original:  The proxies operate their own LRU-list of a certain capacity in the shared cache.
Revised:  The proxies operate their own LRU-list of a certain capacity inthe shared cache.
Edit intent: fluency
Original:  We provide a " working set " approximation to quickly approximate the cache-hit probabilities under object sharing.
Revised:  We provide a " working-set " approximation to quickly approximate the cache-hit probabilities under object sharing.
Edit intent: fluency
Original:  We provide a " working set " approximation to quickly approximate the cache-hit probabilities under object sharing.
Revised:  We provide a " working set " approximation for this system to quicklyestimate the cache-hit probabilities under object sharing.
Edit intent: clarity
Original:  We also demonstrate that the constitutive pieces of our bounds are necessary absent additional assumptions and therefore our results provide a natural starting point for further analysis of specific problems  .
Revised:  We also demonstrate that the constitutive pieces of our bounds are necessary absent additional assumptions and , therefore, our results provide a natural starting point for further analysis of specific problems .
Edit intent: fluency
Original:  Such envelope variations are nonlinear and generally unpredictable by the pilot as they are governed by the aircraft  complex dynamics.
Revised:  Such envelope variations are nonlinear and generally unpredictable by the pilot as they are governed by the aircraft 's complex dynamics.
Edit intent: fluency
Original: ExaHyPE ( `` An Exascale Hyperbolic PDE Engine '' ) is a software engine for solving systems of first-order hyperbolic partial differential equations (PDEs).
Revised: ExaHyPE ( " An Exascale Hyperbolic PDE Engine '' ) is a software engine for solving systems of first-order hyperbolic partial differential equations (PDEs).
Edit intent: fluency
Original: ExaHyPE ( `` An Exascale Hyperbolic PDE Engine '' ) is a software engine for solving systems of first-order hyperbolic partial differential equations (PDEs).
Revised: ExaHyPE ( `` An Exascale Hyperbolic PDE Engine " ) is a software engine for solving systems of first-order hyperbolic partial differential equations (PDEs).
Edit intent: fluency
Original:  Applications powered by ExaHyPE can be run on a student's laptop, but are also able to exploit the thousands of processor cores of state-of-the-art supercomputers.
Revised:  Applications powered by ExaHyPE can be run on a student's laptop, but are also able to exploit thousands of processor cores of state-of-the-art supercomputers.
Edit intent: fluency
Original:  Applications powered by ExaHyPE can be run on a student's laptop, but are also able to exploit the thousands of processor cores of state-of-the-art supercomputers.
Revised:  Applications powered by ExaHyPE can be run on a student's laptop, but are also able to exploit the thousands of processor cores on state-of-the-art supercomputers.
Edit intent: fluency
Original:  The engine is able to dynamically adapt the accuracy of the simulation where needed through adaptive mesh refinement  .
Revised:  The engine is able to dynamically increase the accuracy of the simulation where needed through adaptive mesh refinement .
Edit intent: clarity
Original:  The engine is able to dynamically adapt the accuracy of the simulation where needed through adaptive mesh refinement  .
Revised:  The engine is able to dynamically adapt the accuracy of the simulation using adaptive mesh refinement .
Edit intent: clarity
Original:  A complete simulation code for a new hyperbolic PDE can often be realised within a few hours --- a task that, traditionally, can take weeks, months, often years for researchers starting from scratch.
Revised:  A complete simulation code for a new hyperbolic PDE can often be realised within a few hours - a task that, traditionally, can take weeks, months, often years for researchers starting from scratch.
Edit intent: fluency
Original:  Actually  this fundamental principle can be efficiently applicable in Computational Mathematics and Complexity Theory concerning the computational complexity of problems from the class NP, particularly and especially the NP-complete ones.
Revised:  Actually , this fundamental principle can be efficiently applicable in Computational Mathematics and Complexity Theory concerning the computational complexity of problems from the class NP, particularly and especially the NP-complete ones.
Edit intent: fluency
Original:  Actually  this fundamental principle can be efficiently applicable in Computational Mathematics and Complexity Theory concerning the computational complexity of problems from the class NP, particularly and especially the NP-complete ones.
Revised:  Actually this fundamental principle can be efficiently applicable in computational mathematics and complexity theory concerning the computational complexity of problems from the class NP, particularly and especially the NP-complete ones.
Edit intent: fluency
Original:   The open nature of Ethereum, a blockchain-based platform, gives us an unprecedented opportunity for data mining in this area .
Revised:  The open nature of blockchain makes the transaction data on Ethereum completely public, and also brings unprecedented opportunities for the transaction network analysis .
Edit intent: clarity
Original:  By taking the realistic rules and features of transaction networks into consideration, we propose to model the Ethereum transaction network as a Temporal Weighted Multidigraph (TWMDG)  where each node is a unique Ethereum account and each edge represents a transaction weighted by amount and assigned with timestamp.
Revised:  By taking the realistic rules and features of transaction networks into consideration, we first model the Ethereum transaction network as a Temporal Weighted Multidigraph (TWMDG) where each node is a unique Ethereum account and each edge represents a transaction weighted by amount and assigned with timestamp.
Edit intent: clarity
Original:  By taking the realistic rules and features of transaction networks into consideration, we propose to model the Ethereum transaction network as a Temporal Weighted Multidigraph (TWMDG)  where each node is a unique Ethereum account and each edge represents a transaction weighted by amount and assigned with timestamp.
Revised:  By taking the realistic rules and features of transaction networks into consideration, we propose to model the Ethereum transaction network as a Temporal Weighted Multidigraph (TWMDG) , where each node is a unique Ethereum account and each edge represents a transaction weighted by amount and assigned with timestamp.
Edit intent: fluency
Original:  In a TWMDG, we define the problem of Temporal Weighted Multidigraph Embedding (T-EDGE) by incorporating both temporal and weighted information of the edges, the purpose being to capture more comprehensive properties of dynamic transaction networks.
Revised:  Then we define the problem of Temporal Weighted Multidigraph Embedding (T-EDGE) by incorporating both temporal and weighted information of the edges, the purpose being to capture more comprehensive properties of dynamic transaction networks.
Edit intent: clarity
Original:  To evaluate the effectiveness of the proposed embedding method, we conduct experiments of predictive tasks, including temporal link prediction and node classification , on real-world transaction data collected from Ethereum.
Revised:  To evaluate the effectiveness of the proposed embedding method, we conduct experiments of node classification on real-world transaction data collected from Ethereum.
Edit intent: clarity
Original:  In this work, we propose to integrate the user-item interactions --- more specifically the bipartite graph structure --- into the embedding process.
Revised:  In this work, we propose to integrate the user-item interactions -- more specifically the bipartite graph structure --- into the embedding process.
Edit intent: fluency
Original:  In this work, we propose to integrate the user-item interactions --- more specifically the bipartite graph structure --- into the embedding process.
Revised:  In this work, we propose to integrate the user-item interactions --- more specifically the bipartite graph structure -- into the embedding process.
Edit intent: fluency
Original: In this paper, we focus on the design  of timed automata (TA) and introduce a new tool for automating TA construction .
Revised: In this paper, we focus on the design of timed automata (TA) . We introduce a new tool for automating TA construction .
Edit intent: coherence
Original:  Hence, ATAC automates TA construction, which can be very useful especially during the initial phases of the design process and help system designers to avoid erroneous models.
Revised:  Hence, ATAC automates TA construction, which can be very useful especially during the initial phases of the design process and help designers to avoid erroneous models.
Edit intent: clarity
Original:  While several FO protocols have been proposed, their resulting estimations, however, do not satisfy the natural consistency requirement that estimations are non-negative and sum up to 1.
Revised:  While several FO protocols have been proposed, the design goal does not lead to optimal results for answering many queries.
Edit intent: clarity
Original:  In this paper, we study how to add post-processing steps to FO protocols to make them consistent while achieving high accuracy for a wide range of tasks, including frequencies of individual values, frequencies of the most frequent values, and frequencies of subsets of values.
Revised:  In this paper, we show that adding post-processing steps to FO protocols to make them consistent while achieving high accuracy for a wide range of tasks, including frequencies of individual values, frequencies of the most frequent values, and frequencies of subsets of values.
Edit intent: coherence
Original:  We establish theoretical relationships between some of them and conducted extensive experimental evaluations . Among them, we propose to use Norm-Hyb, which keeps estimations above a certain threshold unchanged, and then converts negative estimations to 0 while adding a value (typically negative) to all other estimations to ensure a sum of 1.
Revised:  We establish theoretical relationships between some of them and conducted extensive experimental evaluations to understand which methods should be used for different query tasks.
Edit intent: clarity
Original:  Starting from a CNN yielding state-of-the-art accuracy on this task, we introduce two noise adaptation techniques, respectively integrating short-term ( 60-millisecond ) and long-term ( 30-minute ) context.
Revised:  Starting from a CNN yielding state-of-the-art accuracy on this task, we introduce two noise adaptation techniques, respectively integrating short-term ( 60 milliseconds ) and long-term ( 30-minute ) context.
Edit intent: fluency
Original:  Starting from a CNN yielding state-of-the-art accuracy on this task, we introduce two noise adaptation techniques, respectively integrating short-term ( 60-millisecond ) and long-term ( 30-minute ) context.
Revised:  Starting from a CNN yielding state-of-the-art accuracy on this task, we introduce two noise adaptation techniques, respectively integrating short-term ( 60-millisecond ) and long-term ( 30 minutes ) context.
Edit intent: fluency
Original: Transactional access to databases is an important abstraction allowing programmers to consider blocks of actions ( i.e., transactions) as executing in isolation.
Revised: Transactional access to databases is an important abstraction allowing programmers to consider blocks of actions ( transactions) as executing in isolation.
Edit intent: coherence
Original:  The strongest consistency model in this context is {\em serializability}, which ensures the atomicity abstraction of transactions executing over a sequentially consistent memory.
Revised:  The strongest consistency model is {\em serializability}, which ensures the atomicity abstraction of transactions executing over a sequentially consistent memory.
Edit intent: clarity
Original:  However, certain programs may also be insensitive to consistency relaxations, which means that all their properties holding under serializability are preserved even when they are executed over some weakly consistent database and without additional synchronization.
Revised:  However, certain programs may also be insensitive to consistency relaxations, i.e., all their properties holding under serializability are preserved even when they are executed over some weakly consistent database and without additional synchronization.
Edit intent: coherence
Original:  However, certain programs may also be insensitive to consistency relaxations, which means that all their properties holding under serializability are preserved even when they are executed over some weakly consistent database and without additional synchronization.
Revised:  However, certain programs may also be insensitive to consistency relaxations, which means that all their properties holding under serializability are preserved even when they are executed over a weak consistent database and without additional synchronization.
Edit intent: fluency
Original:  This reduction opens the door to the reuse of the classic verification technology (under sequential consistency) for reasoning about weakly-consistent programs.
Revised:  This reduction opens the door to the reuse of the classic verification technology for reasoning about weakly-consistent programs.
Edit intent: clarity
Original:  Such autonomous vehicles (AVs) entirely rely on the computing system in the car to to interpret the environment and make driving decisions.
Revised:  Such autonomous vehicles (AVs) rely on the computing system in the car to to interpret the environment and make driving decisions.
Edit intent: clarity
Original: For given simple graphs H_{1},H_{2},\ldots,H_{c}, the Ramsey number r(H_{1},H_{2},\ldots,H_{c}) is the smallest positive integer n such that every edge-colored K_{n} with c colors contains a subgraph  isomorphic to H_{i} in color i for some i\in\{1,2,\ldots,c\}.
Revised: Given simple graphs H_{1},H_{2},\ldots,H_{c}, the Ramsey number r(H_{1},H_{2},\ldots,H_{c}) is the smallest positive integer n such that every edge-colored K_{n} with c colors contains a subgraph isomorphic to H_{i} in color i for some i\in\{1,2,\ldots,c\}.
Edit intent: fluency
Original: For given simple graphs H_{1},H_{2},\ldots,H_{c}, the Ramsey number r(H_{1},H_{2},\ldots,H_{c}) is the smallest positive integer n such that every edge-colored K_{n} with c colors contains a subgraph  isomorphic to H_{i} in color i for some i\in\{1,2,\ldots,c\}.
Revised: For given simple graphs H_{1},H_{2},\ldots,H_{c}, the Ramsey number r(H_{1},H_{2},\ldots,H_{c}) is the smallest positive integer n such that every edge-colored K_{n} with c colors contains a subgraph in color i isomorphic to H_{i} in color i for some i\in\{1,2,\ldots,c\}.
Edit intent: fluency
Original: For given simple graphs H_{1},H_{2},\ldots,H_{c}, the Ramsey number r(H_{1},H_{2},\ldots,H_{c}) is the smallest positive integer n such that every edge-colored K_{n} with c colors contains a subgraph  isomorphic to H_{i} in color i for some i\in\{1,2,\ldots,c\}.
Revised: For given simple graphs H_{1},H_{2},\ldots,H_{c}, the Ramsey number r(H_{1},H_{2},\ldots,H_{c}) is the smallest positive integer n such that every edge-colored K_{n} with c colors contains a subgraph isomorphic to H_{i} for some i\in\{1,2,\ldots,c\}.
Edit intent: clarity
Original:  A critical graph of r(H_1,H_2,\ldots,H_c) is an edge-colored complete graph on r(H_1,H_2,\ldots,H_c)-1 vertices with c colors which contains no subgraph isomorphic to H_{i} in color i for any i\in \{1,2,\ldots,c\}.
Revised:  The critical graphs for r(H_1,H_2,\ldots,H_c) is an edge-colored complete graph on r(H_1,H_2,\ldots,H_c)-1 vertices with c colors which contains no subgraph isomorphic to H_{i} in color i for any i\in \{1,2,\ldots,c\}.
Edit intent: clarity
Original:  A critical graph of r(H_1,H_2,\ldots,H_c) is an edge-colored complete graph on r(H_1,H_2,\ldots,H_c)-1 vertices with c colors which contains no subgraph isomorphic to H_{i} in color i for any i\in \{1,2,\ldots,c\}.
Revised:  A critical graph of r(H_1,H_2,\ldots,H_c) are edge-colored complete graph on r(H_1,H_2,\ldots,H_c)-1 vertices with c colors which contains no subgraph isomorphic to H_{i} in color i for any i\in \{1,2,\ldots,c\}.
Edit intent: clarity
Original:  A critical graph of r(H_1,H_2,\ldots,H_c) is an edge-colored complete graph on r(H_1,H_2,\ldots,H_c)-1 vertices with c colors which contains no subgraph isomorphic to H_{i} in color i for any i\in \{1,2,\ldots,c\}.
Revised:  A critical graph of r(H_1,H_2,\ldots,H_c) is an edge-colored complete graphs on r(H_1,H_2,\ldots,H_c)-1 vertices with c colors which contains no subgraph isomorphic to H_{i} in color i for any i\in \{1,2,\ldots,c\}.
Edit intent: fluency