wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Although this is a time consuming process, our approach eventually constructs a simple variation of -O3, which we call -Ocm3, that realizes nearly two thirds of the known available gains on the CM3 architecture (beyond -O3) and significantly outperforms a far more complex state-of-the-art predictive method .
Revised:  Although this is a time consuming process, our approach eventually constructs a simple variation of -O3, which we call -Ocm3, that realizes nearly two thirds of the known available gains on the CM3 and significantly outperforms a far more complex state-of-the-art predictive method .
Edit intent: clarity
Original:  Although this is a time consuming process, our approach eventually constructs a simple variation of -O3, which we call -Ocm3, that realizes nearly two thirds of the known available gains on the CM3 architecture (beyond -O3) and significantly outperforms a far more complex state-of-the-art predictive method .
Revised:  Although this is a time consuming process, our approach eventually constructs a simple variation of -O3, which we call -Ocm3, that realizes nearly two thirds of the known available gains on the CM3 architecture (beyond -O3) and significantly outperforms a more complex state-of-the-art predictive method .
Edit intent: clarity
Original:  Although this is a time consuming process, our approach eventually constructs a simple variation of -O3, which we call -Ocm3, that realizes nearly two thirds of the known available gains on the CM3 architecture (beyond -O3) and significantly outperforms a far more complex state-of-the-art predictive method . Our approach suggests that 26 flags should be removed from -O3 while three other flags should be added. We analyze in detail two of the former and explain why turning them off improves performance on this processor .
Revised:  Although this is a time consuming process, our approach eventually constructs a simple variation of -O3, which we call -Ocm3, that realizes nearly two thirds of the known available gains on the CM3 architecture (beyond -O3) and significantly outperforms a far more complex state-of-the-art predictive method in cross-validation experiments. Finally, we demonstrate our method on additional platforms by constructing two more optimization levels that find even more significant speed-ups on the ARM Cortex-A8 and 8-bit AVR processors .
Edit intent: meaning-changed
Original: We analyze consequences on URLanized pattern formation resulting from modulation of tumbling frequency with stiff response .
Revised: We describe a novel mechanism for pattern formation stemming from the stiffness of chemotactic response relying on a kinetic chemotaxis model which includes a recently discovered formalism for the bacterial chemotaxis. We prove instability both for amicroscopic description in the space-velocity space and for the macroscopic equation, a flux-limited Keller-Segel equation, which has attracted much attention recently .
Edit intent: meaning-changed
Original:  A remarkable property is that the unstable frequencies remain bounded, as it is the case in Turing instability  .
Revised:  A remarkable property is that the unstable frequencies remain bounded, as it is the case in Turing instability . Numerical illustrations based on a powerful Monte Carlo method show that the stationary homogeneous state of population density isdestabilized and periodic patterns are generated in realistic ranges of parameters .
Edit intent: meaning-changed
Original: A classic problem in microbiology is that bacteria display two types of growth behavior when cultured on a mixture of two carbon sources: in certain mixtures the bacteria consume the two carbon sources sequentially (diauxie) and in other mixtures the bacteria consume both sources simultaneously (co-utilization).
Revised: A classic problem in microbiology is that bacteria display two types of growth behavior when cultured on a mixture of two carbon sources: the two sources are sequentially consumed one after another (diauxie) and in other mixtures the bacteria consume both sources simultaneously (co-utilization).
Edit intent: clarity
Original: A classic problem in microbiology is that bacteria display two types of growth behavior when cultured on a mixture of two carbon sources: in certain mixtures the bacteria consume the two carbon sources sequentially (diauxie) and in other mixtures the bacteria consume both sources simultaneously (co-utilization).
Revised: A classic problem in microbiology is that bacteria display two types of growth behavior when cultured on a mixture of two carbon sources: in certain mixtures the bacteria consume the two carbon sources sequentially (diauxie) or they are simultaneously consumed (co-utilization).
Edit intent: clarity
Original:  A model of optimal allocation of protein resources to achieve maximum growth quantitatively explains why and how the cell makes the choice when facing multiple carbon sources .
Revised:  A model of optimal allocation of protein resources to achieve maximum growth quantitatively explains why and how the cell makes the choice . In case of co-utilization, the model predicts the percentage of each carbon source in supplying the amino acid pools, which is quantitatively verified by experiments .
Edit intent: meaning-changed
Original:  In this paper, we consider the case in which, during a preprocessing phase, we assign a label and a routing table to each node. The routing strategy must then decide where to send the package using only the label of the target node  and the routing table of the node the message is currently at.
Revised:  In this paper, we consider the case in which, during a preprocessing phase, we assign a label and a routing table for each vertex of P. Then, we must be able to route a data packet between any two vertices p and q of P, where each step must use only the label of the target node and the routing table of the node the message is currently at.
Edit intent: meaning-changed
Original:  The routing strategy must then decide where to send the package using only the label of the target node  and the routing table of the node the message is currently at. In this paper , we present the first routing scheme for the particular case in which the network is defined by the visibility graph of a polygon with n vertices and h holes.
Revised:  The routing strategy must then decide where to send the package using only the label of the target node and the routing table of the current node. For any fixed \varepsilon > 0 , we present the first routing scheme for the particular case in which the network is defined by the visibility graph of a polygon with n vertices and h holes.
Edit intent: meaning-changed
Original:  In this paper , we present the first routing scheme for the particular case in which the network is defined by the visibility graph of a polygon with n vertices and h holes. For any \varepsilon > 0 the routing scheme provides stretch at most 1 + \varepsilon.
Revised:  In this paper , we present a routing scheme that always achieves a routing path whose length exceeds the shortest path by a factor of at most 1 + \varepsilon.
Edit intent: clarity
Original:  The preprocessing time is O(n^2\log n +(h+1)n^2+\varepsilon^{-1 can be improved to O(n^2 +\varepsilon^{-1 ) for simple polygons.
Revised:  The preprocessing time is O(n^2\log n ). It can be improved to O(n^2 +\varepsilon^{-1 ) for simple polygons.
Edit intent: coherence
Original:  The preprocessing time is O(n^2\log n +(h+1)n^2+\varepsilon^{-1 can be improved to O(n^2 +\varepsilon^{-1 ) for simple polygons.
Revised:  The preprocessing time is O(n^2\log n +(h+1)n^2+\varepsilon^{-1 can be improved to O(n^2 ) for simple polygons.
Edit intent: fluency
Original:  We find that while the speeds of these two mechanisms are roughly the same, the precision of emergent chemotaxis is higher than that of individual-based chemotaxis for one-dimensional cell chains and two-dimensional cell sheets, but not three-dimensional cell clusters.
Revised:  Here we consider collective movement that emerges from cells on the exterior of the precision of emergent chemotaxis is higher than that of individual-based chemotaxis for one-dimensional cell chains and two-dimensional cell sheets, but not three-dimensional cell clusters.
Edit intent: meaning-changed
Original:  We find that while the speeds of these two mechanisms are roughly the same, the precision of emergent chemotaxis is higher than that of individual-based chemotaxis for one-dimensional cell chains and two-dimensional cell sheets, but not three-dimensional cell clusters.
Revised:  We find that while the speeds of these two mechanisms are roughly the same, the collective responding to chemotactic signals, whereas bulk cells remain uninvolved in sensing and directing the collective. We find that the precision of this type of emergent chemotaxis is higher than that of individual-based chemotaxis for one-dimensional cell chains and two-dimensional cell sheets, but not three-dimensional cell clusters.
Edit intent: meaning-changed
Original: A fractal approach to long-only portfolio optimization is proposed. The quantitative system is based on naive risk parity approach.
Revised: For the past two decades investors have observed long memory and highly correlated behavior of asset classes that does not fit into the framework of Modern Portfolio Theory. Custom correlation and standard deviation estimators consider normal distribution of returns and market efficiency hypothesis. It forced investors to search more universal instruments of tail risk protection. One of the possible solutions is a naive risk parity approach.
Edit intent: meaning-changed
Original:  The core of the optimization scheme is a fractal distribution of returns , applied to estimation of the volatility law. Out-of-sample performance data has been represented in ten period of observation with half year and one year horizons. Implementation of fractal estimator of volatility improves all performance metrics of portfolio in comparison to the standard estimator of volatility.
Revised:  The core of the optimization scheme is a fractal distribution of returns as a core. This class of distributions is more general as it does not imply strict limitations on risk evolution. The proposed model allows for modifying a rule for volatility estimation, thus, enhancing its explanatory power. It turns out that the latter improves the performance metrics of portfolio in comparison to the standard estimator of volatility.
Edit intent: meaning-changed
Original:  Implementation of fractal estimator of volatility improves all performance metrics of portfolio in comparison to the standard estimator of volatility. The efficiency of fractal estimator plays a significant protective role for the periods of market abnormal volatility and drawdowns, which allows beating the market in the long term perspective.
Revised:  Implementation of fractal estimator of volatility improves all performance metrics of an investment portfolio over the ten year period. The fractal model of volatility plays a significant protective role for the periods of market abnormal volatility and drawdowns, which allows beating the market in the long term perspective.
Edit intent: clarity
Original:  The efficiency of fractal estimator plays a significant protective role for the periods of market abnormal volatility and drawdowns, which allows beating the market in the long term perspective. The provided results may be useful for a wide range of quantitative investors, including hedge funds, robo-advisors and retail investors .
Revised:  The efficiency of fractal estimator plays a significant protective role for the periods of market abnormal drawdowns. Consequently, it may be useful for a wide range of quantitative investors, including hedge funds, robo-advisors and retail investors .
Edit intent: coherence
Original:  Due to ionizable amino acid residues present on the solvent-exposed surfaces of proteins, the charge on the proteins is not constant but varies with the changes in their environment -- most notably, the pH of the surrounding solution.
Revised:  Due to ionizable amino acid residues present on the solvent-exposed surfaces of proteins, the protein charge is not constant but varies with the changes in their environment -- most notably, the pH of the surrounding solution.
Edit intent: clarity
Original:  Due to ionizable amino acid residues present on the solvent-exposed surfaces of proteins, the charge on the proteins is not constant but varies with the changes in their environment -- most notably, the pH of the surrounding solution.
Revised:  Due to ionizable amino acid residues present on the solvent-exposed surfaces of proteins, the charge on the proteins is not constant but varies with the changes in the environment -- most notably, the pH of the surrounding solution.
Edit intent: clarity
Original:  Focusing on the three lowest-order multipoles -- the total charge, dipole, and quadrupole moment -- we show that the value of pH influences not only their magnitudes, but more notably  also the spatial orientation of their principal axes.
Revised:  Focusing on the three lowest-order multipoles -- the total charge, dipole, and quadrupole moment -- we show that the value of pH influences not only their magnitudes, but more notably and importantly also the spatial orientation of their principal axes.
Edit intent: clarity
Original:  Here, we analyze the dynamics of real interbank networks at a daily temporal resolution. While daily networks have been flexibly changing their structure from day to day, entailing entries and exits of banks, we discover explicit dynamical patterns that have been surprisingly stable over time even amid the global financial crisis. The emergence of these dynamical patterns is accurately reproduced by a model, in which banks' demand for trading follows a random walk .
Revised:  Here, we uncover fundamental dynamics of interbank networks by seeking the patterns of daily transactions between individual banks. We find stable interaction patterns between banks from which distinctive network-scale dynamics emerge. In fact, the dynamical patterns discovered at the local and network scales share common characteristics with social communication patterns of humans. To explain the origin of "social" dynamics in interbank networks, we provide a simple model that allows us to generate a sequence of synthetic daily networks characterized by the observed dynamical properties .
Edit intent: clarity
Original:  We describe a robust statistical approach to identify conserved loci within genes that are  significantly enriched in slowly translated codons  . Surprisingly, we find that domain boundaries can explain only a small fraction of these conserved loci.
Revised:  We describe a robust statistical approach to identify loci within genes that are significantly enriched in slowly translated codons . Surprisingly, we find that domain boundaries can explain only a small fraction of these conserved loci.
Edit intent: fluency
Original:  We describe a robust statistical approach to identify conserved loci within genes that are  significantly enriched in slowly translated codons  . Surprisingly, we find that domain boundaries can explain only a small fraction of these conserved loci.
Revised:  We describe a robust statistical approach to identify conserved loci within genes that are both significantly enriched in slowly translated codons . Surprisingly, we find that domain boundaries can explain only a small fraction of these conserved loci.
Edit intent: meaning-changed
Original:  We describe a robust statistical approach to identify conserved loci within genes that are  significantly enriched in slowly translated codons  . Surprisingly, we find that domain boundaries can explain only a small fraction of these conserved loci.
Revised:  We describe a robust statistical approach to identify conserved loci within genes that are significantly enriched in slowly translated codons and evolutionarily conserved . Surprisingly, we find that domain boundaries can explain only a small fraction of these conserved loci.
Edit intent: meaning-changed
Original:  We present a simple and direct proof of its coherency and aversity . Based on the observation that the MAXVAR measure is a continuous convex combination of the CVAR measure, we provide an explicit formula for the risk envelope of MAXVAR.
Revised:  We present an elementary and direct proof of its coherency and aversity . Based on the observation that the MAXVAR measure is a continuous convex combination of the CVAR measure, we provide an explicit formula for the risk envelope of MAXVAR.
Edit intent: clarity
Original:  We present a simple and direct proof of its coherency and aversity . Based on the observation that the MAXVAR measure is a continuous convex combination of the CVAR measure, we provide an explicit formula for the risk envelope of MAXVAR.
Revised:  We present a simple and direct proof of its coherency and averseness . Based on the observation that the MAXVAR measure is a continuous convex combination of the CVAR measure, we provide an explicit formula for the risk envelope of MAXVAR.
Edit intent: clarity
Original:  We present a simple and direct proof of its coherency and aversity . Based on the observation that the MAXVAR measure is a continuous convex combination of the CVAR measure, we provide an explicit formula for the risk envelope of MAXVAR.
Revised:  We present a simple and direct proof of its coherency and aversity . Based on the observation that the MAXVAR measure is a continuous convex combination of the CVaR measure, we provide an explicit formula for the risk envelope of MAXVAR.
Edit intent: fluency
Original:   This algorithm has several important applications, including Boolean operations over big geometric data, like the detailed geometric modeling of buildings, and the smooth combination of 3D meshes  .
Revised:  We introduce here the idea of arrangement generated by a collection of cellular complexes, producing a cellular decomposition of the embedding space. The algorithm that executes this computation is called Merge of complexes. The arrangements of segment lines in 2D and polygons in 3D are special cases, like the combination of closed triangulated surfaces or meshed models. This algorithm has several important applications, including Boolean operations over big geometric data, like the detailed geometric modeling of buildings, and the smooth combination of 3D meshes .
Edit intent: meaning-changed
Original:   This algorithm has several important applications, including Boolean operations over big geometric data, like the detailed geometric modeling of buildings, and the smooth combination of 3D meshes  .
Revised:  This algorithm has several important applications, including Boolean and other set operations over large geometric models, the extraction of solid models of biomedical structures at the cellular scale, the detailed geometric modeling of buildings, and the smooth combination of 3D meshes .
Edit intent: meaning-changed
Original:  The algorithm operates over the Linear Algebraic Representation (LAR) of argument complexes, i.e., on sparse representation of binary characteristic matrices of d-cell bases, well-suited for implementation in last generation accelerators and GPGPU applications.
Revised:  The algorithm is efficiently implemented using the Linear Algebraic Representation (LAR) of argument complexes, i.e., on sparse representation of binary characteristic matrices of d-cell bases, well-suited for implementation in last generation accelerators and GPGPU applications.
Edit intent: clarity
Original: {\em   We construct a dense point set of n points in the plane with ne^{\Omega\left({\log n}\right)} halving lines.
Revised: {\em if the ratio of the largest and smallest distances among the points is at most \gamma\sqrt{n We construct a dense point set of n points in the plane with ne^{\Omega\left({\log n}\right)} halving lines.
Edit intent: meaning-changed
Original:  We also observe that the upper bound on the maximum number of halving lines of dense point set can be improved to O(n^{7/6 Our construction can be generalized to higher dimensions, for any d we construct a dense point set of n points in R^d with n^{d-1}e^{\Omega\left({\log n}\right)} halving hyperplanes.
Revised:  Our construction can be generalized to higher dimensions, for any d we construct a dense point set of n points in R^d with n^{d-1}e^{\Omega\left({\log n}\right)} halving hyperplanes.
Edit intent: clarity
Original:  However, in many large PDE applications it is not possible to apply such optimisations through a compiler because in larger-scale codes, there are a huge number of options, execution paths and data per grid point, many dependent on run-time parameters, and the code is distributed across a number of different compilation units.
Revised:  However, in many large PDE applications it is not possible to apply such optimisations through compilers because there are many options, execution paths and data per grid point, many dependent on run-time parameters, and the code is distributed across a number of different compilation units.
Edit intent: clarity
Original:  However, in many large PDE applications it is not possible to apply such optimisations through a compiler because in larger-scale codes, there are a huge number of options, execution paths and data per grid point, many dependent on run-time parameters, and the code is distributed across a number of different compilation units.
Revised:  However, in many large PDE applications it is not possible to apply such optimisations through a compiler because in larger-scale codes, there are a huge number of options, execution paths and data per grid point, many dependent on run-time parameters, and the code is distributed across different compilation units.
Edit intent: coherence
Original:  We observe speedups of 2x on the Cloverleaf 2D/3D proxy application, which contain 83/141 loops respectively  .
Revised:  We observe speedups of 2x on the Cloverleaf 2D/3D proxy application, which contain 83/141 loops respectively , 3.5\times on the linear solver TeaLeaf, and 1.7\times on the compressible Navier-Stokes solver OpenSBLI. We demonstrate strong and weak scalability up to 4608 cores of CINECA's Marconi supercomputer. We also evaluate our algorithms on Intel's Knights Landing, demonstrating maintained throughput as the problem size grows beyond 16GB, and we do scaling studies up to 8704 cores .
Edit intent: meaning-changed
Original:  We incorporate a Markovian signal in the optimal trading framework which was initially proposed by Gatheral, Schied, and Slynko [ 20 ] and provide results on the existence and uniqueness of an optimal trading strategy.
Revised:  We incorporate a Markovian signal in the optimal trading framework which was initially proposed by Gatheral, Schied, and Slynko [ 21 ] and provide results on the existence and uniqueness of an optimal trading strategy.
Edit intent: meaning-changed
Original:  This result is compatible with the optimal trading framework which was proposed by Cartea and Jaimungal [10]  .
Revised:  This result is compatible with the optimal trading framework which was proposed by Cartea and Jaimungal [10] . In order to support our models, we analyse nine months of tick by tick data on 13 European stocks from the NASDAQ OMX exchange. We show that orderbook imbalance is a predictor of the future price move and it has some mean-reverting properties. From this data we show that market participants, especially high frequency traders, use this signal in their trading strategies .
Edit intent: meaning-changed
Original: We investigate how and to what extent the Japanese government intervened in the rice futures exchange in Osaka during the interwar period, from the late 1910s to 1939, using a time-varying AR model.
Revised: We investigate how and to what extent the Japanese government intervened in the rice futures market in Osaka during the interwar period, from the late 1910s to 1939, using a time-varying AR model.
Edit intent: clarity