wanyu/IteraTeR_v2 huggingface dataset:
Original:  Each of these pallets has to contain bins of only one label, bins of different labels have to be placed on different pallets  . After all bins of one label have been removed from the given sequences, the corresponding place becomes available for a pallet of bins of another label.
Revised:  Each of these pallets has to contain bins of only one label, bins of different labels have to be placed on different pallets . After all bins for a pallet have been removed from the given sequences, the corresponding place becomes available for a pallet of bins of another label.
Edit intent: clarity
Original:  In this paper  we show that the FIFO stack-up problem is NP-complete in general, even if the sequences together contain at most 6 bins per pallet.
Revised:  In this paper , we show that the FIFO stack-up problem is NP-complete in general, even if the sequences together contain at most 6 bins per pallet.
Edit intent: fluency
Original:  In this paper  we show that the FIFO stack-up problem is NP-complete in general, even if the sequences together contain at most 6 bins per pallet.
Revised:  In this paper we show that the FIFO stack-up problem is NP-complete in general, even if there are at most 6 bins per pallet.
Edit intent: clarity
Original:  In this paper  we show that the FIFO stack-up problem is NP-complete in general, even if the sequences together contain at most 6 bins per pallet.
Revised:  In this paper we show that the FIFO stack-up problem is NP-complete in general, even if the sequences together contain at most 6 bins for every pallet.
Edit intent: clarity
Original:  The problem can be solved in polynomial time, if the number k of given sequences is fixed, or if the number p of given stack-up places is  fixed.
Revised:  The problem can be solved in polynomial time, if the number k of sequences or the number p of given stack-up places is fixed.
Edit intent: fluency
Original:  The problem can be solved in polynomial time, if the number k of given sequences is fixed, or if the number p of given stack-up places is  fixed.
Revised:  The problem can be solved in polynomial time, if the number k of given sequences is fixed, or if the number p of stack-up places is fixed.
Edit intent: fluency
Original:  The problem can be solved in polynomial time, if the number k of given sequences is fixed, or if the number p of given stack-up places is  fixed.
Revised:  The problem can be solved in polynomial time, if the number k of given sequences is fixed, or if the number p of given stack-up places is assumed to be fixed.
Edit intent: clarity
Original:  In delivery industry, bins have to be stacked-up from conveyor belts onto pallets  . Given k sequences q_1, ..., q_k of labeled bins and a positive integer p, the aim is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto an initially empty pallet  located at one of p stack-up places.
Revised:  In delivery industry, bins have to be stacked-up from conveyor belts onto pallets . Given k sequences q_1, ..., q_k of labeled bins and a positive integer p, the aim is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto an initially empty pallet of unbounded capacity located at one of p stack-up places.
Edit intent: clarity
Original:  The problem can be solved in polynomial time, if the number k of sequences or the number p of stack-up places  is assumed to be fixed.
Revised:  The problem can be solved in polynomial time, if the number p of stack-up places is assumed to be fixed.
Edit intent: clarity
Original: Cost overruns on Dutch transportation infrastructure are substantially lower than in other countries.
Edit intent: coherence
Original:  This is the opposite of worldwide findings where rail has the largest overrun.
Edit intent: coherence
Original:  Worldwide research showed that cost overruns are large for all project sizes.
Edit intent: coherence
Original:  Our implementation and source code are available at URL 
Revised:  Our implementation and source code are available at URL .
Edit intent: fluency
Original: Given a  counting problem, we propose the simple , general scheme of approximating large numbers by floating-point representations ;
Revised: Given a counting problem, we resort to the simple scheme of approximating large numbers by floating-point representations ;
Edit intent: clarity
Original:  the number of bits employed to store their exponent and mantissa will depend on the problem and on the error 0 < \varepsilon \leq 1. Accordingly, we propose the first Fully Polynomial Time Approximation Scheme (FPTAS) with 1 \pm \varepsilon relative error for  generating uniformly at random a labeled DAG with n vertices.
Revised:  the number of bits employed for the exponent and the mantissa will depend on the problem and on the error 0 < \varepsilon \leq 1. Accordingly, we propose the first Fully Polynomial Time Approximation Scheme (FPTAS) with 1 \pm \varepsilon relative error for generating uniformly at random a labeled DAG with n vertices.
Edit intent: clarity
Original:  the number of bits employed to store their exponent and mantissa will depend on the problem and on the error 0 < \varepsilon \leq 1. Accordingly, we propose the first Fully Polynomial Time Approximation Scheme (FPTAS) with 1 \pm \varepsilon relative error for  generating uniformly at random a labeled DAG with n vertices.
Revised:  the number of bits employed to store their exponent and mantissa will depend on the error parameter 0 < \varepsilon \leq 1. Accordingly, we propose the first Fully Polynomial Time Approximation Scheme (FPTAS) with 1 \pm \varepsilon relative error for generating uniformly at random a labeled DAG with n vertices.
Edit intent: clarity
Original:  the number of bits employed to store their exponent and mantissa will depend on the problem and on the error 0 < \varepsilon \leq 1. Accordingly, we propose the first Fully Polynomial Time Approximation Scheme (FPTAS) with 1 \pm \varepsilon relative error for  generating uniformly at random a labeled DAG with n vertices.
Revised:  the number of bits employed to store their exponent and mantissa will depend on the problem and on the error 0 < \varepsilon \leq 1. Accordingly, we propose the first FPTASes with 1 \pm \varepsilon relative error for generating uniformly at random a labeled DAG with n vertices.
Edit intent: clarity
Original:  the number of bits employed to store their exponent and mantissa will depend on the problem and on the error 0 < \varepsilon \leq 1. Accordingly, we propose the first Fully Polynomial Time Approximation Scheme (FPTAS) with 1 \pm \varepsilon relative error for  generating uniformly at random a labeled DAG with n vertices.
Revised:  the number of bits employed to store their exponent and mantissa will depend on the problem and on the error 0 < \varepsilon \leq 1. Accordingly, we propose the first Fully Polynomial Time Approximation Scheme (FPTAS) with 1 \pm \varepsilon relative error for generating uniformly at random a labeled DAG with a given number of vertices.
Edit intent: clarity
Original:  This is accomplished by constructing a recursive deterministic algorithm starting from a simple counting recurrence for DAGs, whose values we approximate by floating-point numbers.
Revised:  This is accomplished starting from a simple counting recurrence for DAGs, whose values we approximate by floating-point numbers.
Edit intent: clarity
Original:  The floating-point approximation method also allows to easily transform the classic pseudo-polynomial algorithm for counting 0/1 Knapsack solutions into a very simple FPTAS with 1 - \varepsilon relative error.
Revised:  The floating-point approximation method to transform the classic pseudo-polynomial algorithm for counting 0/1 Knapsack solutions into a very simple FPTAS with 1 - \varepsilon relative error.
Edit intent: clarity
Original:  On the other hand, it also allows for general upper and lower tail bounds on the hitting time , which were not known before except for the special case of upper bounds in multiplicative drift scenarios.
Revised:  On the other hand, it also allows for general upper and lower tail of the hitting time , which were not known before except for the special case of upper bounds in multiplicative drift scenarios.
Edit intent: clarity
Original:  Particular focus is placed on the unique perspectives of the insurer and policyholder and the unifying relationship.
Revised:  Particular focus is placed on the distinct perspectives of the insurer and policyholder and the unifying relationship.
Edit intent: fluency
Original:  The best previous KDS for all the nearest neighbors in R^d is by Agarwal, Kaplan, and Shari (TALG 2008).
Revised:  The best previous KDS for all the nearest neighbors in R^d is by Agarwal, Kaplan, and Sharir (TALG 2008).
Edit intent: clarity
Original:  Also, their structure and analysis are more complex than ours.
Edit intent: coherence
Original:  For maintaining all the nearest neighbors, neither our KDS nor the KDS by Agarwal  \etal  is local, and furthermore, each event in our KDS and in their KDS is handled in polylogarithmic time in an amortized sense.
Revised:  For maintaining all the nearest neighbors, neither our KDS nor the KDS by Agarwal ~ \etal is local, and furthermore, each event in our KDS and in their KDS is handled in polylogarithmic time in an amortized sense.
Edit intent: fluency
Original:  For maintaining all the nearest neighbors, neither our KDS nor the KDS by Agarwal  \etal  is local, and furthermore, each event in our KDS and in their KDS is handled in polylogarithmic time in an amortized sense.
Revised:  For maintaining all the nearest neighbors, neither our KDS nor the KDS by Agarwal \etal ~ is local, and furthermore, each event in our KDS and in their KDS is handled in polylogarithmic time in an amortized sense.
Edit intent: fluency
Original:  This KDS is local and it handles O(n^2) events, each in worst-case time O(\log^d n) .
Revised:  This KDS is local and it handles O(n^2) events, each in worst-case time .
Edit intent: clarity
Original: A stack-based access control mechanism is to prevent untrusted codes from accessing protected resources in distributed application systems, such as Java-centric web applications and Microsoft .
Revised: The stack-based access control mechanism is to prevent untrusted codes from accessing protected resources in distributed application systems, such as Java-centric web applications and Microsoft .
Edit intent: fluency
Original:  Such an access control mechanism is enforced at runtime by stack inspection that inspects methods in the current call stack for granted permissions .
Revised:  Such an access control mechanism is enforced at runtime by inspecting methods in the current call stack for granted permissions .
Edit intent: clarity
Original:  Nowadays practiced approaches to generating policy files for an application are still manually done by developers based on domain-specific knowledges and testing, due to overwhelming technical challenges involved and engineering efforts in the automation.
Revised:  Nowadays practiced approaches to generating access control policies are still manually done by developers based on domain-specific knowledges and testing, due to overwhelming technical challenges involved and engineering efforts in the automation.
Edit intent: clarity
Original: We address the problem of existence of (nontrivial) perfect codes in the discrete n -simplex \ell^n := \left\{ pmatrix x_0, \ldots, x_n pmatrix : x_i \in Z _+, sum, \sum} _i x_i = \ell \in \mathbb{Z \right\} under \ell_1 metric.
Revised: We study the problem of existence of (nontrivial) perfect codes in the discrete n -simplex \ell^n := \left\{ pmatrix x_0, \ldots, x_n pmatrix : x_i \in Z _+, sum, \sum} _i x_i = \ell \in \mathbb{Z \right\} under \ell_1 metric.
Edit intent: clarity
Original:  The problem is motivated by the so-called multiset codes, recently introduced by the authors  .
Revised:  The problem is motivated by the so-called multiset codes, which have recently been introduced by the authors .
Edit intent: coherence
Original:  Using hydrodynamic theory, we calculate the steady state flows that result from a splayed polarisation of the actin filaments.
Revised:  Using hydrodynamic theory, we calculate the steady state flows that result from a splayed polarisation of the filaments.
Edit intent: fluency
Original:  We relate this to a spherical cell embedded in a 3D environment by imposing a viscous friction at the fixed droplet boundary.
Revised:  We account for the interaction with an arbitrary external medium by imposing a viscous friction at the fixed droplet boundary.
Edit intent: clarity
Original:  We  show that the droplet has non-zero force dipole and quadrupole moments, the latter of which is essential for self-propelled motion of the droplet at low Reynolds' number.
Revised:  We then show that the droplet has non-zero force dipole and quadrupole moments, the latter of which is essential for self-propelled motion of the droplet at low Reynolds' number.
Edit intent: coherence
Original:  Therefore, our model describes a simple mechanism for cell motility in a 3D environment  .
Revised:  Therefore, this calculation describes a simple mechanism for cell motility in a 3D environment .
Edit intent: clarity
Original: In this paper, an emotion transfer framework for color images based on color combinations is proposed.
Revised: In this paper, a color transfer framework to evoke different emotions for images based on color combinations is proposed.
Edit intent: clarity
Original:  The purpose of emotion transfer is to change the "look and feel" of images . Colors are confirmed as the most important factor for "look and feel" of images.
Revised:  The purpose of this color transfer is to change the "look and feel" of images . Colors are confirmed as the most important factor for "look and feel" of images.
Edit intent: clarity
Original:  The purpose of emotion transfer is to change the "look and feel" of images . Colors are confirmed as the most important factor for "look and feel" of images.
Revised:  The purpose of emotion transfer is to change the "look and feel" of images . Colors are confirmed as the most attractive factor in images.
Edit intent: clarity
Original:  In addition, various studies in both art and science areas have concluded that other than single color, color combinations are necessary to delivery specific emotions.
Revised:  In addition, various studies in both art and science areas have concluded that other than single color, color combinations are necessary to evoke specific emotions.
Edit intent: fluency
Original:  Therefore, we propose a novel framework to transfer emotion of images based on color combinations, using a predefined color emotion model.
Revised:  Therefore, we propose a novel framework to transfer color of images based on color combinations, using a predefined color emotion model.
Edit intent: fluency
Original:  Second, because of the usage of color combinations instead of single color for emotions, a new color transfer algorithm that does not require an image library is proposed based on color statistics .
Revised:  Second, because of the usage of color combinations instead of single color for emotions, a new color transfer algorithm that does not require an image library is proposed .
Edit intent: clarity
Original:  Third, again because of the usage of color combinations, artifacts that  normally seen in traditional frameworks using single color are avoided.
Revised:  Third, again because of the usage of color combinations, artifacts that are normally seen in traditional frameworks using single color are avoided.
Edit intent: fluency
Original:  We present encouraging results generated from this new framework and its potential in several possible applications including emotion transfer of photos and paintings and colorization of gray-scale images .
Revised:  We present encouraging results generated from this new framework and its potential in several possible applications including color transfer of photos and paintings and colorization of gray-scale images .
Edit intent: clarity
Original:  We present encouraging results generated from this new framework and its potential in several possible applications including emotion transfer of photos and paintings and colorization of gray-scale images .
Revised:  We present encouraging results generated from this new framework and its potential in several possible applications including emotion transfer of photos and paintings .
Edit intent: clarity
Original:  We show that we can verify whether a given multi-tape Turing machine runs in time at most T(n) iff T(n_0)<  n_0+1 for some non-negative integer n_0 . We prove a very general undecidability result stating that, for any class of functions F that contains arbitrary large constants, we cannot verify whether a given Turing machine runs in time T(n) for some T from F . In particular, we cannot verify whether a Turing machine runs in constant, polynomial or exponential time.
Revised:  We show that we can verify whether a given multi-tape Turing machine runs in time at most T(n) iff T(n_0)< ( n_0+1 for some non-negative integer n_0 . We prove a very general undecidability result stating that, for any class of functions F that contains arbitrary large constants, we cannot verify whether a given Turing machine runs in time T(n) for some T from F . In particular, we cannot verify whether a Turing machine runs in constant, polynomial or exponential time.
Edit intent: fluency
Original:  We show that we can verify whether a given multi-tape Turing machine runs in time at most T(n) iff T(n_0)<  n_0+1 for some non-negative integer n_0 . We prove a very general undecidability result stating that, for any class of functions F that contains arbitrary large constants, we cannot verify whether a given Turing machine runs in time T(n) for some T from F . In particular, we cannot verify whether a Turing machine runs in constant, polynomial or exponential time.
Revised:  We show that we can verify whether a given multi-tape Turing machine runs in time at most T(n) iff T(n_0)< n_0+1 ) for some n_0\in\mathbb{N . We prove a very general undecidability result stating that, for any class of functions F that contains arbitrary large constants, we cannot verify whether a given Turing machine runs in time T(n) for some T from F . In particular, we cannot verify whether a Turing machine runs in constant, polynomial or exponential time.
Edit intent: clarity
Original:  The inherent lack of security measures in the ADS-B protocol has long been a topic in both aviation circles as well as the academic community.
Revised:  The inherent lack of security measures in the ADS-B protocol has long been a topic in both the aviation circles and in the academic community.
Edit intent: fluency
Original:  Thereafter, we survey both the theoretical and practical efforts which have been conducted previously concerning these issues, including possible countermeasures proposed in the literature .
Revised:  Thereafter, it surveys both the theoretical and practical efforts which have been conducted previously concerning these issues, including possible countermeasures proposed in the literature .
Edit intent: clarity
Original:  Thereafter, we survey both the theoretical and practical efforts which have been conducted previously concerning these issues, including possible countermeasures proposed in the literature .
Revised:  Thereafter, we survey both the theoretical and practical efforts which have been previously conducted concerning these issues, including possible countermeasures proposed in the literature .
Edit intent: fluency
Original:  Thereafter, we survey both the theoretical and practical efforts which have been conducted previously concerning these issues, including possible countermeasures proposed in the literature .
Revised:  Thereafter, we survey both the theoretical and practical efforts which have been conducted previously concerning these issues, including possible countermeasures .
Edit intent: clarity
Original: Given any complex Laurent polynomial f we give an efficiently constructible polyhedral approximation, Trop (f) , of the amoeba of f, i.e., the image of the complex zero set of f under the  log absolute value map.
Revised: Given any complex Laurent polynomial f we give an efficiently constructible polyhedral approximation, Trop (f) is the image of the complex zero set of f under the log absolute value map.
Edit intent: clarity
Original:  We then show that deciding whether a given point is in ArchTrop(f) is doable in polynomial-time, for any fixed dimension, unlike the corresponding question for Amoeba(f), which is np-hard already in one variable.
Revised:  We also show that deciding whether a given point is in ArchTrop(f) is doable in polynomial-time, for any fixed dimension, unlike the corresponding question for Amoeba(f), which is np-hard already in one variable.
Edit intent: clarity
Original:  We then show that deciding whether a given point is in ArchTrop(f) is doable in polynomial-time, for any fixed dimension, unlike the corresponding question for Amoeba(f), which is np-hard already in one variable.
Revised:  We then show that deciding whether a given point is in ArchTrop(f) is doable in polynomial-time, for any fixed dimension, unlike the corresponding question for Amoeba(f), which is NP-hard already in one variable.
Edit intent: fluency
Original: Given any complex Laurent polynomial f, Amoeba (f) is the image of the complex zero set of f under the coordinate-wise log absolute value map.
Revised: Given any complex Laurent polynomial f, Amoeba (f) is the image of its complex zero set of f under the coordinate-wise log absolute value map.
Edit intent: clarity
Original: Given any complex Laurent polynomial f, Amoeba (f) is the image of the complex zero set of f under the coordinate-wise log absolute value map.
Revised: Given any complex Laurent polynomial f, Amoeba (f) is the image of the complex zero set under the coordinate-wise log absolute value map.
Edit intent: clarity
Original:  We also show that deciding whether a given point is in ArchTrop (f) is doable in polynomial-time, for any fixed dimension, unlike the corresponding question for Amoeba (f), which is NP-hard already in one variable (f) can thus serve as a canonical low order approximation to start any higher order iterative polynomial system solving algorithm, such as homotopy continuation.
Revised:  We also show that deciding whether a given point lies in \mathrm{ArchTrop (f) is doable in polynomial-time, for any fixed dimension, unlike the corresponding question for Amoeba (f), which is NP-hard already in one variable (f) can thus serve as a canonical low order approximation to start any higher order iterative polynomial system solving algorithm, such as homotopy continuation.
Edit intent: clarity
Original:  We also show that deciding whether a given point is in ArchTrop (f) is doable in polynomial-time, for any fixed dimension, unlike the corresponding question for Amoeba (f), which is NP-hard already in one variable (f) can thus serve as a canonical low order approximation to start any higher order iterative polynomial system solving algorithm, such as homotopy continuation.
Revised:  We also show that deciding whether a given point is in ArchTrop (f) is doable in polynomial-time, for any fixed dimension, unlike the corresponding problem for Amoeba (f), which is NP-hard already in one variable (f) can thus serve as a canonical low order approximation to start any higher order iterative polynomial system solving algorithm, such as homotopy continuation.
Edit intent: clarity
Original:  The main novelty of our work is that the optimal partition is obtained jointly with the selection of the transmit power and constellation size, in order to minimize the energy consumption at the mobile handset, under a latency constraint taking into account transmit time, packet drops, and execution time.
Revised:  The main novelty of our workis th at the optimal partition is obtained jointly with the selection of the transmit power and constellation size, in order to minimize the energy consumption at the mobile handset, under a latency constraint taking into account transmit time, packet drops, and execution time.
Edit intent: fluency