wanyu/IteraTeR_full_sent huggingface dataset:
Original:  However, because mobile hardware, e.g. GPU and memory size, can be very different and limited when compared to  desktop counterpart, it is important to understand the feasibility of this new device-based deep learning inference architecture.
Revised:  However, because mobile hardware, e.g. GPU and memory size, can be very different and limited when compared to desktop counterpart, it is important to understand the feasibility of this new on-device deep learning inference architecture.
Edit intent: clarity
Original:  Based on our application-driven analysis , we have identified several performance bottlenecks for mobile applications powered by on-device deep learning inference .
Revised:  Our measurement and analysis suggest that on-device inference can cost up to two orders of magnitude greater response time and energy when compared to cloud-based inference, and that loading model and computing probability are two performance bottlenecks for mobile applications powered by on-device deep learning inference .
Edit intent: meaning-changed
Original: We  improve our earlier lower bounds on the number of electrical transformations required to reduce an n-vertex plane graph in the worst case [SOCG 2016] in two different directions.
Revised: We strengthen the connections between electrical transformations and homotopy from the planar setting---observed and studied since Steinitz---to arbitrary surfaces with punctures. As a result, we improve our earlier lower bounds on the number of electrical transformations required to reduce an n-vertex plane graph in the worst case [SOCG 2016] in two different directions.
Edit intent: meaning-changed
Original:  First we provide a stronger \Omega(n^2) lower bound when the  graph has two or more terminals, which follows from a quadratic lower bound on the number of homotopy moves in the annulus , described in a companion paper .
Revised:  First we provide a stronger \Omega(n^2) lower bound when the planar graph has two or more terminals, which follows from a quadratic lower bound on the number of homotopy moves in the annulus , described in a companion paper .
Edit intent: meaning-changed
Original:  First we provide a stronger \Omega(n^2) lower bound when the  graph has two or more terminals, which follows from a quadratic lower bound on the number of homotopy moves in the annulus , described in a companion paper .
Revised:  First we provide a stronger \Omega(n^2) lower bound when the graph has two or more terminals, which follows from a quadratic lower bound on the number of homotopy moves in the annulus .
Edit intent: coherence
Original:  Besides providing a unifying perspective on the existing literature, this greater level of generality makes our results applicable to model spaces where a dominating probability is not available, which are becoming increasingly popular in the field of "robust finance". We establish a variety of new results , including structural results for surplus-invariant acceptance sets and powerful dual representations for surplus-invariant risk measures .
Revised:  Besides providing a unifying perspective on the existing literature, we establish a variety of new results , including structural results for surplus-invariant acceptance sets and powerful dual representations for surplus-invariant risk measures .
Edit intent: clarity
Original:  We establish a variety of new results , including structural results for surplus-invariant acceptance sets and powerful dual representations for surplus-invariant risk measures .
Revised:  We establish a variety of new results , including structural results for surplus-invariant acceptance sets . We illustrate the power of the lattice approach by specifying our results to model spaces with a dominating probability, including Orlicz spaces, as well as to robust model spaces without a dominating probability, where the standard topological techniques and exhaustion arguments cannot be applied .
Edit intent: meaning-changed
Original:  For the canonical inhibitory serpin alpha1-antitrypsin  (A1AT), mutations can result in protein deficiencies leading to lung disease and polymerization prone mutants can accumulate in hepatocytes leading to liver disease.
Revised:  For the canonical inhibitory serpin \alpha (A1AT), mutations can result in protein deficiencies leading to lung disease and polymerization prone mutants can accumulate in hepatocytes leading to liver disease.
Edit intent: meaning-changed
Original:  For the canonical inhibitory serpin alpha1-antitrypsin  (A1AT), mutations can result in protein deficiencies leading to lung disease and polymerization prone mutants can accumulate in hepatocytes leading to liver disease.
Revised:  For the canonical inhibitory serpin alpha1-antitrypsin 1-antitrypsin (A1AT), mutations can result in protein deficiencies leading to lung disease and polymerization prone mutants can accumulate in hepatocytes leading to liver disease.
Edit intent: meaning-changed
Original:  For the canonical inhibitory serpin alpha1-antitrypsin  (A1AT), mutations can result in protein deficiencies leading to lung disease and polymerization prone mutants can accumulate in hepatocytes leading to liver disease.
Revised:  For the canonical inhibitory serpin alpha1-antitrypsin (A1AT), mutations can result in protein deficiencies leading to lung disease , and misfolded mutants can accumulate in hepatocytes leading to liver disease.
Edit intent: clarity
Original: We consider thin financial markets involving a finite number of tradeable securities. Traders with heterogeneous preferences and risk exposures have motive to behave strategically regarding the level of risk aversion they reveal through the transaction , thereby impacting prices and allocations.
Revised: We consider thin incomplete financial markets, where traders with heterogeneous preferences and risk exposures have motive to behave strategically regarding the level of risk aversion they reveal through the transaction , thereby impacting prices and allocations.
Edit intent: clarity
Original:  Even though strategic behaviour causes inefficient social allocations, traders with sufficiently high risk tolerance and/or large initial exposure to market risk obtain more utility surplus in the non-competitive equilibrium, when compared to the competitive one.
Revised:  Even though strategic behaviour causes inefficient social allocations, traders with sufficiently high risk tolerance and/or large initial exposure to market risk obtain more utility gain in the noncompetitive equilibrium, when compared to the competitive one.
Edit intent: clarity
Original:  In this paper, we make a case that a fundamental problem that prevents efficient and predictable real-time com- puting on multicore is the lack of a proper memory abstraction to express memory criticality, which cuts across various layers of the system: the application, OS, and hardware.
Revised:  In this paper, we make a case that a fundamental problem that prevents efficient and predictable real-time computing on multicore is the lack of a proper memory abstraction to express memory criticality, which cuts across various layers of the system: the application, OS, and hardware.
Edit intent: fluency
Original:  We present how the two memory abstractions can be realized with small extensions to existing OS and hardware architecture . In particular, we show the potential benefits of our approach in the context of shared cache management, by presenting a deterministic memory-aware cache architecture and its manage- ment scheme. We evaluate the effectiveness of the deterministic memory-aware cache management approach compared with a conventional way-based cache partitioning approach , using a set of synthetic and real benchmarks.
Revised:  We propose to utilize both abstractions to achieve high time predictability but without significantly sacrificing performance. We present deterministic memory-aware OS and architecture designs, including OS-level page allocator, hardware-level cache and DRAM controller designs. We implement the proposed OS and architecture extensions on Linux and gem5 simulator. Our evaluation results , using a set of synthetic and real benchmarks.
Edit intent: meaning-changed
Original:  We evaluate the effectiveness of the deterministic memory-aware cache management approach compared with a conventional way-based cache partitioning approach , using a set of synthetic and real benchmarks. The results show that our approach achieves (i) the same degree of temporal determinism of traditional way-based cache partitioning for deterministic memory, (ii) while freeing up to 49\% of additional cache space, on average, for best-effort memory, and consequently improving the cache hit rate by 39\%, on average, for non-real-time workloads. We also discuss how the deterministic memory abstraction can be leveraged in other parts of the memory hierarchy, particularly in the memory controller .
Revised:  We evaluate the effectiveness of the deterministic memory-aware cache management approach compared with a conventional way-based cache partitioning approach , using a set of synthetic and real-world benchmarks, demonstrate the feasibility and effectiveness of our approach .
Edit intent: clarity
Original:  We then introduce an alternative for gradient formation via the coupling of the proteins within a single cell with a molecule  whose action is similar to that of morphogens in multi-cell assemblies ;
Revised:  We then introduce an alternative for gradient formation via the coupling of the proteins within a single cell with a molecule , that we call a "pronogen", whose action is similar to that of morphogens in multi-cell assemblies ;
Edit intent: meaning-changed
Original:  We then introduce an alternative for gradient formation via the coupling of the proteins within a single cell with a molecule  whose action is similar to that of morphogens in multi-cell assemblies ; the "morphogen" is produced with a fixed flux at one side of the cell.
Revised:  We then introduce an alternative for gradient formation via the coupling of the proteins within a single cell with a molecule whose action is similar to that of morphogens in multi-cell assemblies , the pronogen is produced with a fixed flux at one side of the cell.
Edit intent: coherence
Original:  In this paper we focus on the LRU cache where requests for distinct contents are described by independent stationary and ergodic processes.
Revised: The modeling and analysis of an LRU cache is extremely challenging as exact results for the main performance metrics (e.g. hit rate) are either lacking or cannot be used because of their high computational complexity for large caches. As a result, various approximations have been proposed. The state-of-the-art method is the so-called TTL approximation, first proposed and shown to be asymptotically exact for IRM requests by Fagin. It has been applied to various other workload models and numerically demonstrated to be accurate but without theoretical justification. In this paper we focus on the LRU cache where requests for distinct contents are described by independent stationary and ergodic processes.
Edit intent: meaning-changed
Original:  To validate our approach, we examine the stability of these metric spaces by performing a comparative analysis of topological and metric space features under perturbations. Finally, we conduct several case studies on real world data sets and show how our method can find cyclic patterns, deviations from those patterns, and one-time events in time-varying graphs  .
Revised:  To validate our approach, we conduct several case studies on real world data sets and show how our method can find cyclic patterns, deviations from those patterns, and one-time events in time-varying graphs .
Edit intent: coherence
Original:  Finally, we conduct several case studies on real world data sets and show how our method can find cyclic patterns, deviations from those patterns, and one-time events in time-varying graphs  .
Revised:  Finally, we conduct several case studies on real world data sets and show how our method can find cyclic patterns, deviations from those patterns, and one-time events in time-varying graphs . We also examine whether persistence-based similarity measure as a graph metric satisfies a set of well-established, desirable properties for graph metrics .
Edit intent: meaning-changed
Original:  This approach has partly been used by Ito et al. (2014, 2016a,b), and is proven very efficient because, unlike conventional methods, it does not require the Kalman filtering and smoothing procedures, but yields a smoothed estimate that is identical to the Kalman-smoothed estimate.
Revised:  This approach has partly been used by Ito et al. (2014, 2016a,b), and is proven to be efficient because, unlike conventional methods, it does not require the Kalman filtering and smoothing procedures, but yields a smoothed estimate that is identical to the Kalman-smoothed estimate.
Edit intent: clarity
Original:  This approach has partly been used by Ito et al. (2014, 2016a,b), and is proven very efficient because, unlike conventional methods, it does not require the Kalman filtering and smoothing procedures, but yields a smoothed estimate that is identical to the Kalman-smoothed estimate.
Revised:  This approach has partly been used by Ito et al. (2014, 2016a,b), and is proven very efficient because, unlike conventional methods, it does not require Kalman filtering and smoothing procedures, but yields a smoothed estimate that is identical to the Kalman-smoothed estimate.
Edit intent: fluency
Original:  In addition, this approach enables us to possibly deal with stochastic volatility models and models with a time-dependent variance-covariance matrix  .
Revised:  In addition, this approach enables us to possibly deal with stochastic volatility models and models with a time-dependent variance-covariance matrix , and models with non-Gaussian errors that allow us to deal with abrupt changes or structural breaks in time-varying parameters .
Edit intent: meaning-changed
Original:  (3) There are arbitrarily large point sets R\cup B in general position, with |R| = |B| +1, such that at most r+b-5 points can be K_{1,3}-covered.
Revised:  (3) There are arbitrarily large point sets R\cup B in general position, with r = |B| +1, such that at most r+b-5 points can be K_{1,3}-covered.
Edit intent: clarity
Original:  (3) There are arbitrarily large point sets R\cup B in general position, with |R| = |B| +1, such that at most r+b-5 points can be K_{1,3}-covered.
Revised:  (3) There are arbitrarily large point sets R\cup B in general position, with |R| = b +1, such that at most r+b-5 points can be K_{1,3}-covered.
Edit intent: clarity
Original: We introduce the class of hybrid marked point processes , which incorporate a state process that interacts with past-dependent events.
Revised: We introduce the class of hybrid marked point processes that encompasses and extends continuous-time Markov chains and Hawkes processes. While this flexible class provides a unified treatment of such existing processes, it also contains new processes with complex dynamics. These marked point processes are defined implicitly via their intensity and are endowed with a state process that interacts with past-dependent events.
Edit intent: meaning-changed
Original:  A particular example of a hybrid marked point process is a state-dependent Hawkes process, where events can exhibit self- or cross-excitation effects, like in classical Hawkes processes, but these effects can now also depend on the state process .
Revised:  In fact, this property completely characterises the class of hybrid marked point process is a state-dependent Hawkes process, where events can exhibit self- or cross-excitation effects, like in classical Hawkes processes, but these effects can now also depend on the state process .
Edit intent: meaning-changed
Original:  A particular example of a hybrid marked point process is a state-dependent Hawkes process, where events can exhibit self- or cross-excitation effects, like in classical Hawkes processes, but these effects can now also depend on the state process .
Revised:  A particular example of a hybrid marked point processes. The key example we entertain is an extension of a Hawkes process, where events can exhibit self- or cross-excitation effects, like in classical Hawkes processes, but these effects can now also depend on the state process .
Edit intent: meaning-changed
Original:  A particular example of a hybrid marked point process is a state-dependent Hawkes process, where events can exhibit self- or cross-excitation effects, like in classical Hawkes processes, but these effects can now also depend on the state process . Events of type A will precipitate events of type B only when they move the state process to some critical region, say. In parallel, as each event occurs, the state process transitions to a new value according to transition probabilities that vary with the event type. We prove that such dynamics are equivalent to an intensity processof a specific product form .
Revised:  A particular example of a hybrid marked point process is a state-dependent Hawkes process, a state-dependent Hawkes process that interacts with its state process .
Edit intent: meaning-changed
Original:  The existing strong existence and uniqueness results rely on a Lipschitz condition that the intensity of a hybrid marked point process may fail to satisfy. This motivates us to propose a natural pathwise construction that instead requires only sublinear behaviour of the intensity. Using a domination argument, we are able to verify that this construction yields indeed a solution. As we restrict ourselves to non-explosive marked point processes , we also manage to prove uniqueness without any specific assumptionson the intensity .
Revised:  The existing strong existence and uniqueness results rely on a Lipschitz condition that the intensity of a hybrid marked point processes under very general assumptions, extending the results of Massouli\'e (1998) on interacting point processes .
Edit intent: meaning-changed
Original: In this paper, we develop an effective approach to simplify two-time-scale Markov chains with infinite state spaces by removal of states with fast leaving rates, which improves the simplification method of finite Markov chains.
Revised: Here we develop an effective approach to simplify two-time-scale Markov chains with infinite state spaces by removal of states with fast leaving rates, which improves the simplification method of finite Markov chains.
Edit intent: coherence
Original:  The sources of multifractality are also investigated and it is confirmed that both temporal correlation and the fat-tailed distribution contribute to the multifractality, and the degree of multifractality for the time correlation is stronger than that for the fat-tailed distribution.
Revised:  The sources of multifractality are also investigated and it is confirmed that both temporal correlation and the fat-tailed distribution contribute to the multifractality, and the degree of multifractality for the temporal correlation is stronger than that for the fat-tailed distribution.
Edit intent: fluency
Original:  The sources of multifractality are also investigatedand it is confirmed that both temporal correlation and the fat-tailed distribution contribute to the multifractality, and the degree of multifractality for the temporal correlation is stronger than thatfor the fat-tailed distribution .
Revised:  The sources of multifractality are investigated, confirming that both temporal correlation and the fat-tailed distribution contribute to the multifractality, and the degree of multifractality for the temporal correlation is stronger than thatfor the fat-tailed distribution .
Edit intent: clarity
Original:  The sources of multifractality are also investigatedand it is confirmed that both temporal correlation and the fat-tailed distribution contribute to the multifractality, and the degree of multifractality for the temporal correlation is stronger than thatfor the fat-tailed distribution .
Revised:  The sources of multifractality are also investigatedand it is confirmed that both temporal correlation and the fat-tailed distribution contribute to it. The influence of "Brexit" on June 23, 2016 to GBP--USD exchange rate and Bitcoin is examined in multifractal properties. We find that, while Brexit influenced the GBP--USD exchange rate, Bitcoin was robust to Brexit .
Edit intent: meaning-changed
Original: In this paper we investigate the complexity of model selection and model testing in chemical reaction networks by formulating them as Euclidean distance problems .
Revised: In this paper we investigate the complexity of model selection and model testing in chemical reaction networks . We do this by formulating these tasks as a constrained optimization problem in Euclidean space. This optimization problem is known as a Euclidean distance problem; the complexity of solving this problem is measured by an invariant called the Euclidean distance (ED) degree .
Edit intent: meaning-changed
Original:  We determine closed form expressions for the Euclidean distance degree of the steady state varieties associated to several different families of toric chemical reaction networks with arbitrarily many reaction sites. We show how our results can be used as a metric for the computational cost of solving the model testing and model selection problems.
Revised:  We determine closed form expressions for the Euclidean distance degree of the steady state varieties associated to several different families of toric chemical reaction networks with toric steady states and arbitrarily many reactions. To illustrate the utility of this work we show how the ED degree can be used as a metric for the computational cost of solving the model testing and model selection problems.
Edit intent: clarity
Original: The capital requirements for space settlement are colossal, at least on the order of several trillion dollars. To this end, I propose creation of a venture bank, able to multiply the capital of a venture capital firm by up to 47 times, without requiring access to the Federal Reserve or other central bank apart from settlement.
Revised:  I propose creation of a venture bank, able to multiply the capital of a venture capital firm by up to 47 times, without requiring access to the Federal Reserve or other central bank apart from settlement.
Edit intent: coherence
Original:  That fully-insured version insulates the venture-bank from losses in most situations, and multiplies profitability quite dramatically . There are risks to this method. It also gives up quite a bit of the company. However, this system could take roughly 70 billion dollars and create at least 3 trillion dollars out of it, leaving approximately 280 billion dollars of headroom. This is attainable with the pooled resources of a relative few wealthy individuals .
Revised:  That fully-insured version insulates the venture-bank from losses in most situations, and multiplies profitability quite dramatically in all scenarios. Returns above 10 are attainable. I show that both where the DIN is a minor fraction of investment, and where the DIN insures 100\% of invested funds for the duration, that the DIN underwriting business is either quite profitable or there are small losses in the worst cases .
Edit intent: meaning-changed
Original:   I show that both where the DIN is a minor fraction of investment , and where the DIN insures 100\% of invested funds for the duration, in the normal range of returns the DIN underwriting business is profitable.
Revised:  This proposal solves an old problem in banking, because it matches the term of the loan with the term of the investment. I show that both where the DIN is a minor fraction of investment , and where the DIN insures 100\% of invested funds for the duration, in the normal range of returns the DIN underwriting business is profitable.
Edit intent: meaning-changed