wanyu/IteraTeR_v2 huggingface dataset:
Original:  First we present a protocol  that delivers a proportional solution in less queries than all known algorithms.
Revised:  First we present a protocol that delivers a proportional solution in fewer queries than all known algorithms.
Edit intent: fluency
Original:  We then show that our protocol is  the fastest possible by giving an asymptotically matching lower bound.
Revised:  Then we show that our protocol is the fastest possible by giving an asymptotically matching lower bound.
Edit intent: coherence
Original:  We then show that our protocol is  the fastest possible by giving an asymptotically matching lower bound.
Revised:  We then show that our protocol is the fastest possible by giving a matching lower bound.
Edit intent: clarity
Original:  We describe the responses of the participants to our questions , highlighting common patterns and challenges.
Revised:  We describe the participants' responses to our questions , highlighting common patterns and challenges.
Edit intent: clarity
Original:  We describe the responses of the participants to our questions , highlighting common patterns and challenges.
Revised:  We describe the responses of the participants to our questions highlighting common patterns and challenges.
Edit intent: fluency
Original:  In particular, real-world graphs represent a very diverse range of entities and are often very large, and scalability and visualization are undeniably the most pressing challenges faced by participants  .
Revised:  In particular, real-world graphs represent a very diverse range of entities and are often very large, scalability and visualization are undeniably the most pressing challenges faced by participants .
Edit intent: coherence
Original:  Within this framework , we introduce two models: a generalized Lucia-Schwartz model and a cross-commodity cointegrated market.
Revised:  We apply this framework to two models: a generalized Lucia-Schwartz model and a cross-commodity cointegrated market.
Edit intent: clarity
Original:  This TensorFlow-based infrastructure provides a complete modular deep learning pipeline for a range of medical imaging applications including segmentation, regression, image generation and representation learning applications with data loading, data augmentation, network architectures, loss functions and evaluation metrics that are tailored to, and take advantage of, the idiosyncracies of medical image analysis and computer-assisted interventions .
Revised:  NiftyNet provides a modular deep-learning pipeline for a range of medical imaging applications including segmentation, regression, image generation and representation learning applications with data loading, data augmentation, network architectures, loss functions and evaluation metrics that are tailored to, and take advantage of, the idiosyncracies of medical image analysis and computer-assisted interventions .
Edit intent: clarity
Original:  This TensorFlow-based infrastructure provides a complete modular deep learning pipeline for a range of medical imaging applications including segmentation, regression, image generation and representation learning applications with data loading, data augmentation, network architectures, loss functions and evaluation metrics that are tailored to, and take advantage of, the idiosyncracies of medical image analysis and computer-assisted interventions .
Revised:  This TensorFlow-based infrastructure provides a complete modular deep learning pipeline for a range of medical imaging applications including segmentation, regression, image generation and representation learning applications with data loading, data augmentation, network architectures, loss functions and evaluation metrics are tailored to, and take advantage of, the idiosyncracies of medical image analysis and computer-assisted interventions .
Edit intent: fluency
Original:  The problem is inherently time-inconsistent as the level of distortion of a same event changes over time .
Revised:  The problem is inherently time-inconsistent .
Edit intent: clarity
Original:  Here, we present a game-theoretic extension of the Wright-Fisher process that accounts for demographic stochasticity.
Revised:  Here, we consider evolutionary game dynamics in an extended Wright-Fisher process that accounts for demographic stochasticity.
Edit intent: clarity
Original:  In this study we implement a parallel tensor network contraction program for simulating quantum circuits , including the quantum approximate optimization algorithm (QAOA) applied to Max-Cut .
Revised:  In this study we implement a tensor network contraction program for simulating quantum circuits , including the quantum approximate optimization algorithm (QAOA) applied to Max-Cut .
Edit intent: clarity
Original:  In this study we implement a parallel tensor network contraction program for simulating quantum circuits , including the quantum approximate optimization algorithm (QAOA) applied to Max-Cut .
Revised:  In this study we implement a parallel tensor network contraction program for simulating quantum circuits using multi-core compute nodes .
Edit intent: clarity
Original:  We show simulation results for  3- through 7-regular Max-Cut/QAOAcircuits, even successfully simulating up to 100 qubits.
Revised:  We show simulation results for the Max-Cut problem on 3- through 7-regular Max-Cut/QAOAcircuits, even successfully simulating up to 100 qubits.
Edit intent: clarity
Original:  We show simulation results for  3- through 7-regular Max-Cut/QAOAcircuits, even successfully simulating up to 100 qubits.
Revised:  We show simulation results for 3- through 7-regular graphs using the quantum approximate optimization algorithm (QAOA), successfully simulating up to 100 qubits.
Edit intent: clarity
Original:  This tradeoff occurs when the Max-Cut problem's graph regularity is five or six, suggesting that tensor contraction methods are superior for simulating Max-Cut/QAOA with graphs of regularities approximately five and below.
Revised:  The results in this work suggest that tensor contraction methods are superior for simulating Max-Cut/QAOA with graphs of regularities approximately five and below.
Edit intent: clarity
Original:  This tradeoff occurs when the Max-Cut problem's graph regularity is five or six, suggesting that tensor contraction methods are superior for simulating Max-Cut/QAOA with graphs of regularities approximately five and below.
Revised:  This tradeoff occurs when the Max-Cut problem's graph regularity is five or six, suggesting that tensor contraction methods are superior only when simulating Max-Cut/QAOA with graphs of regularities approximately five and below.
Edit intent: clarity
Original: A multiphasic constitutive model of the skin capturing the process of intrinsic (i.e.  chronological) ageing  is proposed.
Revised: A multiphasic constitutive model of the skin capturing the process of intrinsic (i.e. \ chronological) ageing is proposed.
Edit intent: fluency
Original: We consider the uniqueness of solution (  nonsingularity) of systems of r generalized Sylvester and \star-Sylvester equations with n\times n coefficient matrices . After several reductions, we show that it is sufficient to analyze periodic systems having, at most, one generalized \star-Sylvester equation.
Revised: We consider the uniqueness of solution ( i.e., nonsingularity) of systems of r generalized Sylvester and \star-Sylvester equations with n\times n coefficient matrices . After several reductions, we show that it is sufficient to analyze periodic systems having, at most, one generalized \star-Sylvester equation.
Edit intent: coherence
Original: We consider the uniqueness of solution (  nonsingularity) of systems of r generalized Sylvester and \star-Sylvester equations with n\times n coefficient matrices . After several reductions, we show that it is sufficient to analyze periodic systems having, at most, one generalized \star-Sylvester equation.
Revised: We consider the uniqueness of solution ( nonsingularity) of systems of r generalized Sylvester and \star-Sylvester equations with n\times n coefficients . After several reductions, we show that it is sufficient to analyze periodic systems having, at most, one generalized \star-Sylvester equation.
Edit intent: clarity
Original:  More generally, these translations can be computed for any graph .
Revised:  More generally, these translations are defined on any graph, and can therefore be used to process signals on those graphs .
Edit intent: clarity
Original:  To cope with this issue, we introduce relaxed versions of these operators, and illustrate translation of signals on some random graphs.
Revised:  To cope with this issue, we introduce relaxed versions of these operators, and illustrate translation of signals on random graphs.
Edit intent: clarity
Original: Background: Light microscopy is a standard examination tools in cell biology  .
Revised:  Light microscopy is a standard examination tools in cell biology .
Edit intent: coherence
Original: Background: Light microscopy is a standard examination tools in cell biology  .
Revised: Background: Light microscopy is a standard examination tool in cell biology .
Edit intent: fluency
Original:  We provided a correct set-up of the microscope and , using the approach of information entropy in image processing, we sought a voxel (3D pixel) called an electromagnetic centroid which localizes the information about the object.
Revised:  We provided a correct set-up of the microscope and we sought a voxel (3D pixel) called an electromagnetic centroid which localizes the information about the object.
Edit intent: clarity
Original:  We show the training of RNNs with only linear sequential dependencies can be parallelized over the sequence length using the parallel scan algorithm, leading to rapid training on long sequences  with small minibatch size.
Revised:  We show the training of RNNs with only linear sequential dependencies can be parallelized over the sequence length using the parallel scan algorithm, leading to rapid training on long sequences even with small minibatch size.
Edit intent: clarity
Original:  We abstract prior linear sequence models into a new framework of linear surrogate RNNs and develop a linear surrogate  long short-term memory (LS-LSTM) powered by a parallel linear recurrence CUDA kernel we implemented.
Revised:  We abstract prior linear sequence models into a new framework of linear surrogate RNNs and develop a linear surrogate model for the long short-term memory (LS-LSTM) powered by a parallel linear recurrence CUDA kernel we implemented.
Edit intent: clarity
Original:  The chain maps are constructed using discrete Morse theory for Cech and Delaunay complexes, representing the requisite discrete gradient field implicitly in order to get fast algorithms .
Revised:  Using a combinatorial gradient flow arising from the discrete Morse theory for Cech and Delaunay complexes, representing the requisite discrete gradient field implicitly in order to get fast algorithms .
Edit intent: clarity
Original:  We further argue that for an n-qubit non-maximally entangled state of the form a|0>^{n} + \b |1>^{n}, it is always possible to correct a single error with fewer than 5n qubits, in fact only 3n+2 qubits suffice.
Revised:  We further argue that for an n-qubit non-maximally entangled state of the form a|0>^{n} + b |1>^{n}, it is always possible to correct a single error with fewer than 5n qubits, in fact only 3n+2 qubits suffice.
Edit intent: coherence
Original:  However, a WFA is inherently a linear model.
Edit intent: coherence
Original:  In this paper, we propose a  neural network based nonlinear WFA model along with a learning algorithm.
Revised:  In this paper, we propose a novel model of neural network based nonlinear WFA model along with a learning algorithm.
Edit intent: clarity
Original:  Keeping track of the parental relationshipsof all members of the population we set up a matrix containing the times to the most recent common ancestor (MRCAT) between all pairs of individuals .
Revised:  Keeping track of the parental relationshipsof all members of the population we set up a matrix containing the times to the most recent common ancestor between all pairs of individuals .
Edit intent: clarity
Original:  An extensive experimental evaluation shows that with our approach one can obtain over one hundred hierarchies for the computational cost equivalent to running HDBSCAN* about 2 times , which corresponds to a speedup of more than 60 times, compared to running HDBSCAN* independently that many times .
Revised:  An extensive experimental evaluation shows that with our approach one can obtain over one hundred hierarchies for the computational cost equivalent to running HDBSCAN* about 2 times .
Edit intent: coherence
Original: Graphics Processing Units (GPUs) maintain a large register file to increase thread block occupancy, hence to improve the thread level parallelism (TLP).
Revised: Graphics Processing Units (GPUs) maintain a large register file to increase the thread level parallelism (TLP).
Edit intent: clarity
Original:  However, register files in the GPU dissipate a significant portion of the total leakage power . Leakage power of the register file can be reduced by putting the registers into low power ( SLEEP or OFF) state .
Revised:  However, register files in the GPU dissipate a significant portion of the total leakage power . Leakage power of the register file can be reduced by turning infrequently used registers into low power ( SLEEP or OFF) state .
Edit intent: clarity
Original:  However, one challenge in doing so is the lack of precise register access information for each instruction at run-time .
Revised:  However, one challenge in doing so is the lack of precise register access information .
Edit intent: clarity
Original:  This paper proposes GREENER (GPU REgister file ENErgy Reducer): a tool for minimizing leakage energy of the register file of GPUs.
Revised:  This paper proposes GREENER (GPU REgister file ENErgy Reducer): a system to minimize leakage energy of the register file of GPUs.
Edit intent: clarity
Original:  We propose a new power optimized assembly instruction format that allows GREENER to encode the power state of the registers with its instruction.
Revised:  We propose a power optimized assembly instruction format that allows GREENER to encode the power state of the registers with its instruction.
Edit intent: clarity
Original:  We propose a new power optimized assembly instruction format that allows GREENER to encode the power state of the registers with its instruction.
Revised:  We propose a new power optimized assembly instruction set that allows GREENER to encode the power state of the registers with its instruction.
Edit intent: clarity
Original:  We implemented GREENER in GPGPU-Sim simulator  and used GPUWattch framework to measure the leakage power of register file.
Revised:  We implemented GREENER in GPGPU-Sim simulator , and used GPUWattch framework to measure the leakage power of register file.
Edit intent: fluency
Original:  We propose a joint linear model that captures the coupling between the two systems stemming from the vehicles' charging requirements .
Revised:  We propose a model that captures the coupling between the two systems stemming from the vehicles' charging requirements .
Edit intent: clarity
Original:  We then leverage the linear model to jointly optimize the operation of both systems.
Revised:  We then leverage the model to jointly optimize the operation of both systems.
Edit intent: clarity
Original:  We propose an algorithmic procedure to losslessly reduce the problem size by bundling customer requests, allowing it to be efficiently solved by state-of-the-art linear programming solvers.
Revised:  We devise an algorithmic procedure to losslessly reduce the problem size by bundling customer requests, allowing it to be efficiently solved by state-of-the-art linear programming solvers.
Edit intent: clarity
Original:  We propose an algorithmic procedure to losslessly reduce the problem size by bundling customer requests, allowing it to be efficiently solved by state-of-the-art linear programming solvers.
Revised:  We propose an algorithmic procedure to losslessly reduce the problem size by bundling customer requests, allowing it to be efficiently solved by off-the-shelf linear programming solvers.
Edit intent: clarity
Original:  Finally, we study the implementation of a hypothetical electric-powered AMoD system in Dallas-Fort Worth , and its impact on the Texas power network.
Revised:  Finally, we study the implementation of a hypothetical electric-powered AMoD system in Dallas-Fort Worth and its impact on the Texas power network.
Edit intent: fluency
Original:  We show that coordination between the AMoD system and the power network can reduce the overall energy expenditure compared to the case where no cars are present (despite the increased demand for electricity) and yield savings of 78M /year compared to an uncoordinated scenario.
Revised:  Lack of coordination between the AMoD system and the power network can reduce the overall energy expenditure compared to the case where no cars are present (despite the increased demand for electricity) and yield savings of 78M /year compared to an uncoordinated scenario.
Edit intent: clarity
Original:  Collectively, the results of this paper provide a first-of-a-kind characterization of the interaction between electric-powered AMoD systems and the electric power network, and shed additional light on the economic and societal value of AMoD.
Revised:  Collectively, the results of this paper provide a first-of-a-kind characterization of the interaction between electric-powered AMoD systems and the power network, and shed additional light on the economic and societal value of AMoD.
Edit intent: fluency
Original:  We prove that for all positive integers s , every connected graph on n vertices with minimum degree at least (1{s+3}+o(1))n contains a spanning tree having at most s branch vertices.
Revised:  We prove that , for all s\geq 1 , every connected graph on n vertices with minimum degree at least (1{s+3}+o(1))n contains a spanning tree having at most s branch vertices.
Edit intent: clarity
Original:  The notions of tetra-groups of oligonucleotides and also collective frequencies and collective probabilities of members of the tetra-groups are introduced to study hidden tetra-group regularities in mentioned sequences.
Revised:  The notions of tetra-groups of oligonucleotides and with probabilities of members of the tetra-groups are introduced to study hidden tetra-group regularities in mentioned sequences.
Edit intent: coherence
Original:  The notions of tetra-groups of oligonucleotides and also collective frequencies and collective probabilities of members of the tetra-groups are introduced to study hidden tetra-group regularities in mentioned sequences.
Revised:  The notions of tetra-groups of oligonucleotides and also collective frequencies and collective probabilities of members of these tetra-groups are introduced to study hidden tetra-group regularities in mentioned sequences.
Edit intent: clarity
Original:  The notions of tetra-groups of oligonucleotides and also collective frequencies and collective probabilities of members of the tetra-groups are introduced to study hidden tetra-group regularities in mentioned sequences.
Revised:  The notions of tetra-groups of oligonucleotides and also collective frequencies and collective probabilities of members of the tetra-groups in long DNA-sequences. The tetra-group regularities in mentioned sequences.
Edit intent: clarity
Original: The article is devoted to hidden symmetries in long sequences of oligonucleotides of single stranded DNA . Represented author's results have revealed a new class of symmetries in long DNA-sequences from their representative set.
Revised: The article represents a new class of hidden symmetries in long sequences of oligonucleotides of single stranded DNA . Represented author's results have revealed a new class of symmetries in long DNA-sequences from their representative set.
Edit intent: clarity
Original: The article is devoted to hidden symmetries in long sequences of oligonucleotides of single stranded DNA . Represented author's results have revealed a new class of symmetries in long DNA-sequences from their representative set.
Revised: The article is devoted to hidden symmetries in long sequences of oligonucleotides of single stranded DNA from their representative set.
Edit intent: coherence
Original:  These symmetries are an addition to symmetries described by the second Chargaff's parity rule .
Revised:  These symmetries are an addition to symmetries described by the second parity rule of Chargaff .
Edit intent: clarity
Original:  These new symmetries and their rules are called tetra-group symmetries and rules since they are connected with tetra-groups of oligonucleotides and with probabilities of members of these tetra-groups in long DNA-sequences.
Revised:  These new symmetries and their rules concern collective probabilities of oligonucleotides from special tetra-groups of oligonucleotides and with probabilities of members of these tetra-groups in long DNA-sequences.
Edit intent: clarity
Original:  A quantum informational model of origin of the tetra-group symmetries is proposed taking into account that DNA-texts should obey principles of quantum mechanics and quantum informatics .
Revised:  A quantum-information model of genetic symmetries of these collective probabilities is proposed on the basis of the known quantum-mechanic statement that quantum state of a multicomponent system is defined by the tensor product of quantum states of its subsystems .
Edit intent: clarity
Original:  A model explanation of the second Chargaff's rule from the point of view of quantum informatics is proposed.
Revised:  A model explanation of the second rule of Chargaff from the standpoint of quantum informatics is proposed.
Edit intent: clarity
Original:  A quantum-information model of genetic symmetries of these collective probabilities is proposed on the basis of the known quantum-mechanic statement that quantum state of a multicomponent system is defined by the tensor product of quantum states of its subsystems.
Revised:  A quantum-informational model of genetic symmetries of these collective probabilities is proposed on the basis of the known quantum-mechanic statement that quantum state of a multicomponent system is defined by the tensor product of quantum states of its subsystems.
Edit intent: clarity
Original:  A model explanation of the second rule of Chargaff from the standpoint of quantum informatics is proposed.
Edit intent: coherence
Original:  An important role of resonances, photons and photonic crystals in quantum-information genetics is noted.
Revised:  An important role of resonances, photons and photonic crystals in quantum information genetics is noted.
Edit intent: fluency
Original:  In recent years, the left inferior frontal gyrus ( IFG ) has been identified as critical to this ability.
Revised:  In recent years, the left inferior frontal gyrus ( LIFG ) has been identified as critical to this ability.
Edit intent: clarity
Original:  Despite a recent emphasis on network approaches to understanding language, how the left IFG interacts with the brain's complex networks to facilitate controlled language performance remains unknown.
Revised:  Despite a recent emphasis on network approaches to understanding language, how the LIFG interacts with the brain's complex networks to facilitate controlled language performance remains unknown.
Edit intent: clarity
Original:  Using  anatomical brain network derived from high-resolution diffusion spectrum imaging (DSI), we compute network controllability underlying the site of transcranial magnetic stimulation in the IFG between administrations of two word selection tasks.
Revised:  Using an anatomical brain network derived from high-resolution diffusion spectrum imaging (DSI), we compute network controllability underlying the site of transcranial magnetic stimulation in the IFG between administrations of two word selection tasks.
Edit intent: fluency