wanyu/IteraTeR_v2 huggingface dataset:
Original:  our aim is to assess the robustness of the model and to distinguish between important and comparatively inconsequential design decisions for sentence classification.
Revised:  our aim is to distinguish between important and comparatively inconsequential design decisions for sentence classification.
Edit intent: clarity
Original:  However, these models require practitioners to specify the exact model architecture and accompanying hyper-parameters, e.g., the choice of filter region size, regularization parameters, and so on.
Revised:  However, these models require practitioners to specify an exact model architecture and accompanying hyper-parameters, e.g., the choice of filter region size, regularization parameters, and so on.
Edit intent: fluency
Original:  However, these models require practitioners to specify the exact model architecture and accompanying hyper-parameters, e.g., the choice of filter region size, regularization parameters, and so on.
Revised:  However, these models require practitioners to specify the exact model architecture and set accompanying hyperparameters, including the filter region size, regularization parameters, and so on.
Edit intent: clarity
Original: We analyze the number of stages  needed to construct n \times n squares and scaled shapes within the staged tile assembly model.
Revised: We analyze the number of stages needed to construct n \times n squares and scaled shapes in the staged tile assembly model.
Edit intent: clarity
Original:  We give constructions that use a number of stages within a small additive factor of optimal for all bin and tile type counts.
Edit intent: coherence
Original:  In particular, given a constraint of at most b bins and t tile types , we present an algorithm for the assembly of any n\times n square with stage complexity O(\log{n - tb - t\log t}{b^2} + \frac{\log b{\log t}) stages, nearly matching our } lower bound of \Omega(\log{n - tb - t\log t}{b^2}) for almost all n.
Revised:  In particular, given a constraint of at most b bins and t tile types assembling an n\times n square with stage complexity O(\log{n - tb - t\log t}{b^2} + \frac{\log b{\log t}) stages, nearly matching our } lower bound of \Omega(\log{n - tb - t\log t}{b^2}) for almost all n.
Edit intent: clarity
Original:  In particular, given a constraint of at most b bins and t tile types , we present an algorithm for the assembly of any n\times n square with stage complexity O(\log{n - tb - t\log t}{b^2} + \frac{\log b{\log t}) stages, nearly matching our } lower bound of \Omega(\log{n - tb - t\log t}{b^2}) for almost all n.
Revised:  In particular, given a constraint of at most b bins and t tile types , we present an algorithm for the assembly of any n\times n square using O(\log{n - tb - t\log t}{b^2} + \frac{\log b{\log t}) stages, nearly matching our } lower bound of \Omega(\log{n - tb - t\log t}{b^2}) for almost all n.
Edit intent: clarity
Original:  In particular, given a constraint of at most b bins and t tile types , we present an algorithm for the assembly of any n\times n square with stage complexity O(\log{n - tb - t\log t}{b^2} + \frac{\log b{\log t}) stages, nearly matching our } lower bound of \Omega(\log{n - tb - t\log t}{b^2}) for almost all n.
Revised:  In particular, given a constraint of at most b bins and t tile types , we present an algorithm for the assembly of any n\times n square with stage complexity O(\log{n - tb - t\log t}{b^2} + \frac{\log \log b{\log t}) stages, nearly matching our } lower bound of \Omega(\log{n - tb - t\log t}{b^2}) for almost all n.
Edit intent: fluency
Original:  For a general shape S, we present bounds of \mathcal{O}(\frac{K(S) - tb - t\log t}{b^2} + \frac{\log b{\log t}} ) and \Omega(\frac{K(S) - tb - t\log t}{b^2}) for the assembly of a scaled version of S, where K(S) denotes the Kolmogorov complexity of S with respect to some universal Turing machine.
Revised:  For a shape S, we present bounds of \mathcal{O}(\frac{K(S) - tb - t\log t}{b^2} + \frac{\log b{\log t}} ) and \Omega(\frac{K(S) - tb - t\log t}{b^2}) for the assembly of a scaled version of S, where K(S) denotes the Kolmogorov complexity of S with respect to some universal Turing machine.
Edit intent: clarity
Original:  For a general shape S, we present bounds of \mathcal{O}(\frac{K(S) - tb - t\log t}{b^2} + \frac{\log b{\log t}} ) and \Omega(\frac{K(S) - tb - t\log t}{b^2}) for the assembly of a scaled version of S, where K(S) denotes the Kolmogorov complexity of S with respect to some universal Turing machine.
Revised:  For a general shape S, we obtain bounds of \mathcal{O}(\frac{K(S) - tb - t\log t}{b^2} + \frac{\log b{\log t}} ) and \Omega(\frac{K(S) - tb - t\log t}{b^2}) for the assembly of a scaled version of S, where K(S) denotes the Kolmogorov complexity of S with respect to some universal Turing machine.
Edit intent: clarity
Original:  For a general shape S, we present bounds of \mathcal{O}(\frac{K(S) - tb - t\log t}{b^2} + \frac{\log b{\log t}} ) and \Omega(\frac{K(S) - tb - t\log t}{b^2}) for the assembly of a scaled version of S, where K(S) denotes the Kolmogorov complexity of S with respect to some universal Turing machine.
Revised:  For a general shape S, we present bounds of \mathcal{O}(\frac{K(S) - tb - t\log t}{b^2} + \frac{\log \log b{\log t}} ) and \Omega(\frac{K(S) - tb - t\log t}{b^2}) for the assembly of a scaled version of S, where K(S) denotes the Kolmogorov complexity of S with respect to some universal Turing machine.
Edit intent: fluency
Original:  Matching results are also obtained when more powerful \emph{flexible} glue functions are permitted.
Revised:  Equally tight bounds are also obtained when more powerful \emph{flexible} glue functions are permitted.
Edit intent: clarity
Original:  The constructions use a common method of encoding information into "binary string" assemblies that uses both sources of system complexity (  tile types and the mixing graph) efficiently .
Revised:  The constructions use a new technique for converting both sources of system complexity ( tile types and the mixing graph) efficiently .
Edit intent: clarity
Original:  The constructions use a common method of encoding information into "binary string" assemblies that uses both sources of system complexity (  tile types and the mixing graph) efficiently .
Revised:  The constructions use a common method of encoding information into "binary string" assemblies that uses both sources of system complexity ( the tile types and the mixing graph) efficiently .
Edit intent: fluency
Original:  The constructions use a common method of encoding information into "binary string" assemblies that uses both sources of system complexity (  tile types and the mixing graph) efficiently .
Revised:  The constructions use a common method of encoding information into "binary string" assemblies that uses both sources of system complexity ( tile types and mixing graph) efficiently .
Edit intent: fluency
Original:  In particular, we prove that there exists a staged system with b bins and t tile types assembling an n \times n square using O(\log{n - tb - t\log t}{b^2} + \log \log b{\log t}) stages , nearly matching our lower bound of \Omega(\log{n - tb - t\log t}{b^2})  for almost all n.
Revised:  For n \times n square using O(\log{n - tb - t\log t}{b^2} + \log \log b{\log t}) stages , nearly matching our lower bound of \Omega(\log{n - tb - t\log t}{b^2}) for almost all n.
Edit intent: coherence
Original:  In particular, we prove that there exists a staged system with b bins and t tile types assembling an n \times n square using O(\log{n - tb - t\log t}{b^2} + \log \log b{\log t}) stages , nearly matching our lower bound of \Omega(\log{n - tb - t\log t}{b^2})  for almost all n.
Revised:  In particular, we prove that there exists a staged system with b bins and t tile types assembling an n \times n squares, we prove O(\log{n - tb - t\log t}{b^2} + \log \log b{\log t}) stages , nearly matching our lower bound of \Omega(\log{n - tb - t\log t}{b^2}) for almost all n.
Edit intent: coherence
Original:  For a shape S , we obtain bounds of O(K(S) - tb - t\log t{b^2} + \log \log b{\log t})  and \Omega(K(S) - tb - t\log t{b^2}) for the assembly of a scaled version of S, where K(S) denotes the Kolmogorov complexity of S with respect to some universal Turing machine.
Revised:  For shapes S with Kolmogorov complexity K(S), we prove O(K(S) - tb - t\log t{b^2} + \log \log b{\log t}) and \Omega(K(S) - tb - t\log t{b^2}) for the assembly of a scaled version of S, where K(S) denotes the Kolmogorov complexity of S with respect to some universal Turing machine.
Edit intent: clarity
Original:  For a shape S , we obtain bounds of O(K(S) - tb - t\log t{b^2} + \log \log b{\log t})  and \Omega(K(S) - tb - t\log t{b^2}) for the assembly of a scaled version of S, where K(S) denotes the Kolmogorov complexity of S with respect to some universal Turing machine.
Revised:  For a shape S , we obtain bounds of O(K(S) - tb - t\log t{b^2} + \log \log b{\log t}) and \Omega(K(S) - tb - t\log t{b^2}) are necessary to assemble a scaled version of S, where K(S) denotes the Kolmogorov complexity of S with respect to some universal Turing machine.
Edit intent: clarity
Original:  Equally tight bounds are also obtained when more powerfulflexible glue functions are permitted.
Revised:  Equally tight bounds are also obtained when more powerful glue functions are permitted.
Edit intent: fluency
Original:  In this paper, we show that a generalization of recognition called partial representation extension is NP-hard even for k= 2, while a quadratic-time algorithm is known for unit interval graphs.
Revised:  In this paper, we show that a generalization of recognition called partial representation extension is NP-hard even for k= 2.
Edit intent: coherence
Original:  We further adapt a technique due to Ben-Or and Cleve in circuit complexity to bring down the complexity to GapL
Edit intent: coherence
Original: Mining itemsets that are the most interesting under a statistical model of the underlying data is a frequently used and well-studied technique for exploratory data analysis .
Revised: Mining itemsets that are the most interesting under a statistical model of the underlying data is a commonly used and well-studied technique for exploratory data analysis .
Edit intent: fluency
Original:  Our approach is theoretically simple, straightforward to implement, trivially parallelizable and exhibits competitive performance as we demonstrate on both synthetic and real-world examples .
Revised:  Our approach is theoretically simple, straightforward to implement, trivially parallelizable and exhibits competitive performance as we demonstrate on several real-world examples .
Edit intent: clarity
Original:  Our approach is theoretically simple, straightforward to implement, trivially parallelizable and exhibits competitive performance as we demonstrate on both synthetic and real-world examples .
Revised:  Our approach is theoretically simple, straightforward to implement, trivially parallelizable and exhibits competitive performance as we demonstrate on both synthetic and real-world datasets .
Edit intent: clarity
Original: Energy efficiency significantly influences user experience of battery-driven devices such as smartphones and tablets.
Revised: Energy efficiency has a significant influence on user experience of battery-driven devices such as smartphones and tablets.
Edit intent: style
Original:  The goal of an energy model of source code is to lay a foundation for  energy-saving techniques from architecture to software development.
Revised:  The goal of an energy model for source code is to lay a foundation for energy-saving techniques from architecture to software development.
Edit intent: fluency
Original:  The goal of an energy model of source code is to lay a foundation for  energy-saving techniques from architecture to software development.
Revised:  The goal of an energy model of source code is to lay a foundation for the application of energy-saving techniques from architecture to software development.
Edit intent: clarity
Original:  The goal of an energy model of source code is to lay a foundation for  energy-saving techniques from architecture to software development.
Revised:  The goal of an energy model of source code is to lay a foundation for energy-saving techniques during software development.
Edit intent: clarity
Original:  The challenge is linking hardware energy consumption to the high-level application source code, considering the complex run-time context , such as thread scheduling, user inputs and the abstraction of the virtual machine.
Revised:  The challenge is to relate hardware energy consumption to the high-level application source code, considering the complex run-time context , such as thread scheduling, user inputs and the abstraction of the virtual machine.
Edit intent: fluency
Original:  The challenge is linking hardware energy consumption to the high-level application source code, considering the complex run-time context , such as thread scheduling, user inputs and the abstraction of the virtual machine.
Revised:  The challenge is linking hardware energy consumption to high-level application source code, considering the complex run-time context , such as thread scheduling, user inputs and the abstraction of the virtual machine.
Edit intent: fluency
Original:  The challenge is linking hardware energy consumption to the high-level application source code, considering the complex run-time context , such as thread scheduling, user inputs and the abstraction of the virtual machine.
Revised:  The challenge is linking hardware energy consumption to the high-level application code, considering the complex run-time context , such as thread scheduling, user inputs and the abstraction of the virtual machine.
Edit intent: clarity
Original:  Traditional energy modeling is bottom-to-top, but this approach faces obstacles when software consists of a number of abstract layers.
Revised:  Traditional energy modeling is bottom-to-top, but this approach faces obstacles when the software stack consists of a number of abstract layers.
Edit intent: clarity
Original:  We focus on identifying valuable information from the source code, which results in the idea of utilizing an intermediate representation, "energy operation " , to capture the energy characteristics.
Revised:  We focus on identifying valuable information from the source code, which is based on "energy operation " , to capture the energy characteristics.
Edit intent: clarity
Original:  We focus on identifying valuable information from the source code, which results in the idea of utilizing an intermediate representation, "energy operation " , to capture the energy characteristics.
Revised:  We focus on identifying valuable information from the source code, which results in the idea of utilizing an intermediate representation, "energy operations " , to capture the energy characteristics.
Edit intent: fluency
Original: A great variety of biologically relevant monolayers present phase coexistence characterized by domains formed by lipids in a long-range ordered phase state dispersed in a continuous, disordered phase.
Revised: A great variety of biologically relevant monolayers present phase coexistence characterized by domains formed by lipids in an ordered phase state dispersed in a continuous, disordered phase.
Edit intent: clarity
Original:  Because of the difference in surface densities the domains possess an excess dipolar density with respect to the surrounding liquid phase .
Revised:  The difference in surface densities the domains possess an excess dipolar density with respect to the surrounding liquid phase .
Edit intent: clarity
Original:  Because of the difference in surface densities the domains possess an excess dipolar density with respect to the surrounding liquid phase .
Revised:  Because of the difference in surface densities between these phases originates inter-domain dipolar interactions, which are relevant for the determination of the spacial distribution of domains, as well as their dynamics .
Edit intent: clarity
Original:  In this work we propose an alternative method to measure the dipolar repulsion for neutral lipid monolayers.
Revised:  In this work , we propose a novel manner of estimating the dipolar repulsion for neutral lipid monolayers.
Edit intent: clarity
Original:  A systematic analysis for experimentally relevant parameter range is given, which may be used as a working curve for obtaining the dipolar repulsion in different systems provided that the experimental g(r) can be calculated from a statistically relevant amount of images .
Revised:  A systematic analysis for experimentally relevant parameter range is given, which may be used as a working curve for obtaining the dipolar repulsion in different systems .
Edit intent: clarity
Original: We propose a new user-centric imagery of the WWW that foregrounds local usage and its shaping forces, in contrast to existing imageries that prioritize Internet infrastructure and technical connectivity .
Revised: We propose a new user-centric imagery of the WWW that foregrounds local usage and its shaping forces, in contrast to existing imageries that prioritize Internet infrastructure .
Edit intent: clarity
Original: This work proposes a novel P2P-DASH architecture that jointly leverages the intrinsic cooperation property of P2P and the flexibility of Dynamic Adaptive Streaming over HTTP (DASH) to deliver videos to a large population of users with heterogeneous streaming requests.
Revised:  Dynamic Adaptive Streaming over HTTP (DASH) to deliver videos to a large population of users with heterogeneous streaming requests.
Edit intent: clarity
Original:  The system is made of several overlays, each distributing a different DASH representation ;
Revised:  The system is made of several swarms, and a different DASH representation ;
Edit intent: clarity
Original:  every peer within the system autonomously enforces a newly devised rate control strategy that steers its movements from one overlay to another, in order to maintain a good viewing quality to the local user and to simultaneously guarantee the successful operation of the P2P overlays .
Revised:  every peer within the system autonomously enforces a newly devised rate control strategy that steers its movements from one overlay to another, in order to maintain a good viewing quality to the local user and to simultaneously guarantee the successful operation of the P2P swarms .
Edit intent: clarity
Original:  Through a comparison with a reference DASH system modeled via the Integer Linear Programming (ILP) approach, it is shown that the new system also outperforms such reference architecture.
Revised:  Through a comparison with a reference DASH system modeled via the Integer Linear Programming (ILP) approach, the new system also outperforms such reference architecture.
Edit intent: coherence
Original:  Through a comparison with a reference DASH system modeled via the Integer Linear Programming (ILP) approach, it is shown that the new system also outperforms such reference architecture.
Revised:  Through a comparison with a reference DASH system modeled via the Integer Linear Programming (ILP) approach, it is shown that the new system is shown to outperform such reference architecture.
Edit intent: clarity
Original: Local caching with device-to-device (D2D) communications has been recently introduced as an effective scheme for reducing the average download time of the mobile terminals (MTs) by first caching the files in their local memories and then exchanging between the MTs via D2D communications.
Revised: Local caching with device-to-device (D2D) communications has been recently introduced as an effective scheme for reducing the average download time of the mobile terminals (MTs) . The MTs first cache the files in their local memories and then exchanging between the MTs via D2D communications.
Edit intent: coherence
Original: Local caching with device-to-device (D2D) communications has been recently introduced as an effective scheme for reducing the average download time of the mobile terminals (MTs) by first caching the files in their local memories and then exchanging between the MTs via D2D communications.
Revised: Local caching with device-to-device (D2D) communications has been recently introduced as an effective scheme for reducing the average download time of the mobile terminals (MTs) by first caching the files in their local memories and then exchange the files with each other within the vincinity via D2D communications.
Edit intent: clarity
Original:  Prior works have largely overlooked MTs' heterogeneity in file preferences and assume unselfish caching behaviors among MTs.
Revised:  Prior works have largely overlooked MTs' heterogeneity in file preferences and assume unselfish caching behaviors of the MTs.
Edit intent: clarity
Original:  In this work, we consider that the MTs are practically divided into different groups according to their  preferences over the files and propose optimal file caching strategies for self-interested MTs to reduce the average file download time.
Revised:  In this work, we practically divide the MTs into different groups according to their preferences over the files and propose optimal file caching strategies for self-interested MTs to reduce the average file download time.
Edit intent: coherence
Original:  Finally, numerical examples are presented to show that the selfish caching of the groups may be detrimental to both themselves and the other  groups.
Revised:  Finally, numerical examples are presented to show that the selfish caching of a group can be detrimental to both themselves and the other groups.
Edit intent: clarity
Original:  Finally, numerical examples are presented to show that the selfish caching of the groups may be detrimental to both themselves and the other  groups.
Revised:  Finally, numerical examples are presented to show that the selfish caching of the groups may be detrimental to both itself and the other groups.
Edit intent: fluency
Original: Local caching with device-to-device (D2D) communications has been recently introduced as an effective scheme for reducing the average download time of the mobile terminals (MTs) .
Revised: Local caching with device-to-device (D2D) caching has been recently introduced as an effective scheme for reducing the average download time of the mobile terminals (MTs) .
Edit intent: clarity
Original: Local caching with device-to-device (D2D) communications has been recently introduced as an effective scheme for reducing the average download time of the mobile terminals (MTs) .
Revised: Local caching with device-to-device (D2D) communications has been recently introduced as an effective scheme for reducing the average download delay of mobile terminals (MTs) .
Edit intent: clarity
Original:  The MTs first cache the files in their local memories  and then exchange the  files with each other within the vincinity via D2D communications  . Prior works have largely overlooked MTs' heterogeneity in file preferences and assume unselfish caching behaviorsof the MTs .
Revised:  The MTs first cache the files in their local memories and then exchange the requested files with each other within the vincinity via D2D communications . Prior works have largely overlooked MTs' heterogeneity in file preferences and assume unselfish caching behaviorsof the MTs .
Edit intent: clarity
Original:  The MTs first cache the files in their local memories  and then exchange the  files with each other within the vincinity via D2D communications  . Prior works have largely overlooked MTs' heterogeneity in file preferences and assume unselfish caching behaviorsof the MTs .
Revised:  The MTs first cache the files in their local memories and then exchange the files with each other in the vicinity via D2D communications . Prior works have largely overlooked MTs' heterogeneity in file preferences and assume unselfish caching behaviorsof the MTs .
Edit intent: clarity