wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Results: We address these limitations by: 1) exploiting well-established graphlet measures via a new network approach for protein classification , 2) introducing novel normalized graphlet measures to remove the bias of PSN size, 3) allowing for integrating multiple PSN measures, and 4) using ordered graphlets to combine the complementary ideas of PSN data and sequence data.
Revised:  Results: We address these limitations by: 1) exploiting well-established graphlet measures via a new network approach for protein classification , 2) introducing novel normalized graphlet measures to remove the bias of PSN size, 3) allowing for integrating multiple PSN measures, and 4) using ordered graphlets to combine the complementary PSN data and sequence data.
Edit intent: clarity
Original:  A relevant issue for such networks is handling cyclic dependencies to prove timing predictability, a key requirement for safety-critical systems , e. g., avionics and automotive. To deal with the performance evaluation of such networks, most relevant existing techniques are based on the Network Calculus framework, and consists in analyzing locally the delay upper bound in each crossed node, resulting in pessimistic end-to-end delay bounds.
Revised:  A relevant issue for such networks is handling cyclic dependencies to prove timing predictability, a key requirement for safety-critical systems . We are interested in this paper in event-triggered ring-based networks, which guarantee high resource utilization efficiency and (re)configuration flexibility, at the cost of increasing the timing analysis complexity. The implementation of such a communication scheme on top of a ring topology actually induces cyclic dependencies, in comparison to time-triggered solutions. To cope with this arising issue of cyclic dependencies, only few techniques have been proposed in the literature, mainly based on Network Calculus framework, and consists in analyzing locally the delay upper bound in each crossed node, resulting in pessimistic end-to-end delay bounds.
Edit intent: meaning-changed
Original:  To deal with the performance evaluation of such networks, most relevant existing techniques are based on the Network Calculus framework, and consists in analyzing locally the delay upper bound in each crossed node, resulting in pessimistic end-to-end delay bounds.
Revised:  To deal with the performance evaluation of such networks, most relevant existing techniques are based on the Network Calculus framework, and consist in analyzing locally the delay upper bound in each crossed node, resulting in pessimistic end-to-end delay bounds.
Edit intent: fluency
Original:  To overcome this limitation, an enhanced global timing analysis , accounting the flow serialization phenomena along the flow path , is proposed in this paper to improve the delay bounds tightness.
Revised:  Hence, the main contribution in this paper is enhancing the delay bounds tightness of such networks, through an innovative global analysis based on Network Calculus , accounting the flow serialization phenomena along the flow path , is proposed in this paper to improve the delay bounds tightness.
Edit intent: meaning-changed
Original:  To overcome this limitation, an enhanced global timing analysis , accounting the flow serialization phenomena along the flow path , is proposed in this paper to improve the delay bounds tightness. The main contribution consists in defining and proving a closed form formula of the guaranteed end-to-end service curve of any flow of interest crossing a FIFO ring-based network.
Revised:  To overcome this limitation, an enhanced global timing analysis , accounting the flow serialization phenomena along the flow path .
Edit intent: coherence
Original:  An extensive analysis of such a proposal has been conducted regarding the tightness of delay bounds and its impact on the system performance, in terms of system scalability and resource-efficiency . Results highlight the proposed approach efficiency to compute tight delay bounds , in comparison with conventional timing analysis and in reference with a worst-case delay lower bound .
Revised:  An extensive analysis of such a proposal has been conducted regarding the tightness of delay bounds and its impact on the system performance, in terms of system scalability and resource-efficiency ; and the results highlight its outperformance , in comparison with conventional timing analysis and in reference with a worst-case delay lower bound .
Edit intent: clarity
Original: The recent research effort towards defining new communication solutions for cyber-physical systems (CPS), to guarantee high availability level with limited cabling costs and complexity, has renewed the interest in ring-based networks. This topology has been recently used for various networked cyber-physical systems (Net-CPS), e.g., avionics and automotive, with the implementation of many Real Time Ethernet (RTE) profiles. A relevant issue for such networks is to prove timing predictability, a key requirement for safety-critical systems. We are interested in this paper in event-triggered ring-based networks, which guarantee high resource utilization efficiency and (re)configuration flexibility, at the cost of increasing the timing analysis complexity. The implementation of such a communication scheme on top of a ring topology actually induces cyclic dependencies, in comparison to time-triggered solutions. To cope with this arising issue of cyclic dependencies, only few techniques have been proposed in the literature, mainly based on Network Calculus framework, and consist in analyzing locally the delay upper bound in each crossed node, resulting in pessimistic end-to-end delay bounds .
Revised: Tightening performance bounds of ring networks with cyclic dependencies is still an open problem in the literature. In this paper, we tackle such a challenging issue based on Network Calculus framework, and consist in analyzing locally the delay upper bound in each crossed node, resulting in pessimistic end-to-end delay bounds .
Edit intent: coherence
Original:  To cope with this arising issue of cyclic dependencies, only few techniques have been proposed in the literature, mainly based on Network Calculus framework, and consist in analyzing locally the delay upper bound in each crossed node, resulting in pessimistic end-to-end delay bounds . Hence, the main contribution in this paper is enhancing the delay bounds tightness of such networks, through an innovative global analysis based on Network Calculus, accounting the flow serialization phenomena along the flow path .
Revised:  To cope with this arising issue of cyclic dependencies, only few techniques have been proposed in the literature, mainly based on Network Calculus . First, we review the conventional timing approaches in the area and identify their main limitations, in terms of delay bounds pessimism. Afterwards, we have introduced a new concept called Pay Multiplexing Only at Convergence points (PMOC) to overcome such limitations. PMOC considers the flow serialization phenomena along the flow path .
Edit intent: meaning-changed
Original:  Hence, the main contribution in this paper is enhancing the delay bounds tightness of such networks, through an innovative global analysis based on Network Calculus, accounting the flow serialization phenomena along the flow path . An extensive analysis of such a proposal is conducted herein regarding the accuracy of delay bounds and its impact on the system performance, i. e., scalability and resource-efficiency;
Revised:  Hence, the main contribution in this paper is enhancing the delay bounds tightness of such networks, through an innovative global analysis based on Network Calculus, accounting the flow serialization phenomena along the flow path , by paying the bursts of interfering flows only at the convergence points. The guaranteed endto- end service curves under such a concept have been defined and proved for mono-ring and its impact on the system performance, i. e., scalability and resource-efficiency;
Edit intent: meaning-changed
Original:  An extensive analysis of such a proposal is conducted herein regarding the accuracy of delay bounds and its impact on the system performance, i. e., scalability and resource-efficiency; and the results highlight its outperformance, in comparison to conventional methods .
Revised:  An extensive analysis of such a proposal is conducted herein regarding the accuracy of delay bounds and multiple-ring networks, as well as under Arbitrary and Fixed Priority multiplexing. A sensitivity analysis of the computed delay bounds for mono and multiple-ring networks is conducted with respect to various flow and network parameters, and their tightness is assessed in comparison with an achievable worst-case delay. A noticeable enhancement of the delay bounds, thus network resource efficiency and scalability, is highlighted under our proposal with reference to conventional approaches. Finally, the efficiency of the PMOC approach to provide timing guarantees is confirmed in the case of a realistic avionics application .
Edit intent: meaning-changed
Original:  These requirements were developed within a working group of the Electrophysiology Task Force in the INCF Program on Standards for Data Sharing  .
Revised:  These requirements were developed within a working group of the Electrophysiology Task Force in the INCF Program on Standards for Data Sharing . While this document describes the requirements of the standard independent of the actual storage technology, the Task Force has recommended basing a standard on HDF5. This is in line with a number of groups who are already using HDF5 to store electrophysiology data, although currently without being based on a standard .
Edit intent: meaning-changed
Original:  We extend this setting by assuming that any such increment belongs to the sum of an element of the solvency set and the family of acceptable positions, e.g. with respect to a dynamic risk measure.
Revised:  We extend this setting in two directions, allowing for convex transaction costs and assuming that increments of the portfolio process belong to the sum of an element of the solvency set and the family of acceptable positions, e.g. with respect to a dynamic risk measure.
Edit intent: meaning-changed
Original:  We extend this setting by assuming that any such increment belongs to the sum of an element of the solvency set and the family of acceptable positions, e.g. with respect to a dynamic risk measure.
Revised:  We extend this setting by assuming that any such increment belongs to the sum of an element of the solvency set and a family of multivariate acceptable positions, e.g. with respect to a dynamic risk measure.
Edit intent: meaning-changed
Original:  If the acceptance sets consist of non-negative random vectors, that is the underlying dynamic risk measure is the conditional essential infimum, we extend many classical no arbitrage conditions in markets with transaction costs and provide their natural geometric interpretation .
Revised:  In the special case when multivariate positions are converted into a single fixed asset, our framework turns into the no good deals setting. However, in general, the possibilities of assessing the risk with respect to any asset or a basket of the assets lead to a decrease of superhedging prices and the no arbitrage conditions in markets with transaction costs and provide their natural geometric interpretation .
Edit intent: meaning-changed
Original: Given the network of interactions underlying a complex system, what can we learn about controlling such a system solely from its structure? Over a century of research in control theory has given us tools to answer this question, which were widely applied in science and engineering. Yet the current tools do not always consider the inherently nonlinear dynamics of real systems and the naturally occurring system states in their definition of "control", a term whose interpretation varies across disciplines.
Revised: Given the network of interactions underlying a complex system, what can we learn about controlling such a system solely from its underlying network structure?
Edit intent: coherence
Original:  This  framework provides realizable node overrides that steer a system towards any of its natural long term dynamic behaviors and which are guaranteed to be effective regardless of the dynamic details and parameters of the underlying system .
Revised:  This feedback-based framework provides realizable node overrides that steer a system towards any of its natural long term dynamic behaviors and which are guaranteed to be effective regardless of the dynamic details and parameters of the underlying system .
Edit intent: meaning-changed
Original:  Finally, we illustrate the applicability of this new frameworkin the field of dynamic models by demonstrating its success in two models of a gene regulatory network and identifying the nodes whose override is necessary for control in the general case, but not in specific model instances.
Revised:  Finally, we demonstrate this framework's applicability in dynamic models of gene regulatory networks and identify nodes whose override is necessary for control in the general case, but not in specific model instances.
Edit intent: clarity
Original: Application of pulling force, under force-clamp conditions, to kinetochore-microtubule attachments {\it in-vitro}  revealed a catch-bond-like behavior.
Revised: Measurement of the life time of attachments formed by a single microtubule (MT) with a single kinetochore (kt) {\it in-vitro} revealed a catch-bond-like behavior.
Edit intent: meaning-changed
Original: Application of pulling force, under force-clamp conditions, to kinetochore-microtubule attachments {\it in-vitro}  revealed a catch-bond-like behavior.
Revised: Application of pulling force, under force-clamp conditions, to kinetochore-microtubule attachments {\it in-vitro} under force-clamp conditions revealed a catch-bond-like behavior.
Edit intent: meaning-changed
Original:  In an earlier paper (%DIFDELCMD < {\it %%% Sharma et al. Phys. Biol. (2014) the physical origin of this apparently counter-intuitive phenomenon was traced to the nature of the force-dependence of the (de-)polymerization kinetics of the microtubules.
Revised:  In an earlier paper (%DIFDELCMD < {\it %%% the physical origin of this apparently counter-intuitive phenomenon was traced to the nature of the force-dependence of the (de-)polymerization kinetics of the microtubules.
Edit intent: coherence
Original:  Phys. Biol. (2014) the physical origin of this apparently counter-intuitive phenomenon was traced to the nature of the force-dependence of the (de-)polymerization kinetics of the microtubules.
Revised:  Phys. Biol. (2014) the past the physical origin of this apparently counter-intuitive phenomenon was traced to the nature of the force-dependence of the (de-)polymerization kinetics of the microtubules.
Edit intent: meaning-changed
Original:  In this brief communication that work is extended to situations where the external forced is ramped up till the attachment gets ruptured . In spite of the fundamental differences in the underlying mechanisms, the trend of variation of the rupture force distribution observed in our model kinetochore-microtubule attachment with the increasing loading rate is qualitatively similar to that displayed by the catch bonds formed in some other ligand-receptor systems.
Revised:  In this brief communication that work is extended to situations where the external forced is ramped up till the attachment gets ruptured ; the trend of variation of the rupture force distribution observed in our model kinetochore-microtubule attachment with the increasing loading rate is qualitatively similar to that displayed by the catch bonds formed in some other ligand-receptor systems.
Edit intent: clarity
Original:  In spite of the fundamental differences in the underlying mechanisms, the trend of variation of the rupture force distribution observed in our model kinetochore-microtubule attachment with the increasing loading rate is qualitatively similar to that displayed by the catch bonds formed in some other ligand-receptor systems.
Revised:  In spite of the fundamental differences in the underlying mechanisms, the trend of variation of the rupture force distribution with increasing loading rate is qualitatively similar to that displayed by the catch bonds formed in some other ligand-receptor systems.
Edit intent: clarity
Original:  In spite of the fundamental differences in the underlying mechanisms, the trend of variation of the rupture force distribution observed in our model kinetochore-microtubule attachment with the increasing loading rate is qualitatively similar to that displayed by the catch bonds formed in some other ligand-receptor systems.
Revised:  In spite of the fundamental differences in the underlying mechanisms, the trend of variation of the rupture force distribution observed in our model kinetochore-microtubule attachment with the increasing loading rate is consistent with that displayed by the catch bonds formed in some other ligand-receptor systems.
Edit intent: clarity
Original:  Our theoretical predictions can be tested experimentally by a straightforward modification of the protocol for controlling the force in the optical trap set up that was used in the original experiments under force-clamp conditions .
Revised:  Our theoretical predictions can be tested experimentally by a straightforward modification of the protocol for controlling the force in the optical trap set up that was used in the original experiments under force-clamp and force-ramp conditions. From numerical studies of the model we predict the trends of variation of the mean life time and mean rupture force with the increasing number of MTs in the bundle. Both the mean life time and the mean rupture force display nontrivial nonlinear dependence on the maximum number of MTs that can attach simultaneously to the same kt .
Edit intent: meaning-changed
Original: Measurement of the life time of attachments formed by a single microtubule (MT) with a single kinetochore (kt) {\it in-vitro} under force-clamp conditions  revealed a catch-bond-like behavior.
Revised: Measurement of the life time of attachments formed by a single microtubule (MT) with a single kinetochore (kt) {\it in-vitro} under force-clamp conditions had earlier revealed a catch-bond-like behavior.
Edit intent: meaning-changed
Original:  Here first the same model kt-MT attachment is subjected to external tension that is ramped up till the attachment gets ruptured; the trend of variation of the rupture force distribution with increasing loading rate is consistent with that displayed by the catch bonds formed in some other ligand-receptor systems{\it  {\it   .
Revised:  Here first the same model kt-MT attachment is subjected to external tension that increases linearly with time until rupture occurs. In our{\it {\it .
Edit intent: meaning-changed
Original:  the trend of variation of the rupture force distribution with increasing loading rate is consistent with that displayed by the catch bonds formed in some other ligand-receptor systems{\it  {\it   .
Revised:  the trend of variation of the rupture force distribution with increasing loading rate is consistent with that displayed by the catch bonds formed in some other ligand-receptor systems{\it {\it , the model displays the well known `mechanical signatures' of a catch-bond probed by molecular force spectroscopy. Exploiting this new evidence, we have further strengthened the analogy between MT-kt attachments and common ligand-receptor bonds in spite of the crucial differences in their underlying physical mechanisms .
Edit intent: meaning-changed
Original:   It was shown that the algorithm gives the investment portfolios that are on average better than portfolios achieved by other methods, as well as than the proposed benchmark . Remark that the algorithm of is based on cumulant tensors up to the 6'th order  , what is the novel idea.
Revised:  To determine incoming crash and provide enter and exit signal for the investment strategy the Hurst exponent was calculated using the local DFA. It was shown that the algorithm gives the investment portfolios that are on average better than portfolios achieved by other methods, as well as than the proposed benchmark . Remark that the algorithm of is based on cumulant tensors up to the 6'th order , what is the novel idea.
Edit intent: meaning-changed
Original:   It was shown that the algorithm gives the investment portfolios that are on average better than portfolios achieved by other methods, as well as than the proposed benchmark . Remark that the algorithm of is based on cumulant tensors up to the 6'th order  , what is the novel idea.
Revised:  It was shown that introduced algorithm is on average better than portfolios achieved by other methods, as well as than the proposed benchmark . Remark that the algorithm of is based on cumulant tensors up to the 6'th order , what is the novel idea.
Edit intent: clarity
Original:   It was shown that the algorithm gives the investment portfolios that are on average better than portfolios achieved by other methods, as well as than the proposed benchmark . Remark that the algorithm of is based on cumulant tensors up to the 6'th order  , what is the novel idea.
Revised:  It was shown that the algorithm gives the investment portfolios that are on average better that benchmark and other portfolio determination methods, but only within examination window determined by low values of the Hurst exponent . Remark that the algorithm of is based on cumulant tensors up to the 6'th order , what is the novel idea.
Edit intent: meaning-changed
Original:   It was shown that the algorithm gives the investment portfolios that are on average better than portfolios achieved by other methods, as well as than the proposed benchmark . Remark that the algorithm of is based on cumulant tensors up to the 6'th order  , what is the novel idea.
Revised:  It was shown that the algorithm gives the investment portfolios that are on average better than portfolios achieved by other methods, as well as than the proposed benchmark . Remark that the algorithm of is based on cumulant tensors up to the 6'th order calculated for a multidimensional random variable , what is the novel idea.
Edit intent: meaning-changed
Original:  We have developed a quadruple-precision version of our linear and nonlinear optimizer MINOS, and a solution procedure (DQQ) involving Double and Quad MINOS that balances efficiency and reliability for ME models.
Revised:  We have developed a quadruple-precision version of our linear and nonlinear optimizer MINOS, and a solution procedure (DQQ) involving Double and Quad MINOS that achieves efficiency and reliability for ME models.
Edit intent: clarity
Original:  The null hypothesis is that breaks in different parameters (either regression coefficients or elements of the covariance matrix of the errors) occur at a common locations or are separated by some positive fraction of the sample size  . Under the alternative hypothesis, the break dates  are not the same and also need not be separated by a positive fraction of the sample size across parameters .
Revised:  The null hypothesis is that breaks in different parameters occur at common locations and are separated by some positive fraction of the sample size . Under the alternative hypothesis, the break dates are not the same and also need not be separated by a positive fraction of the sample size across parameters .
Edit intent: coherence