wanyu/IteraTeR_v2 huggingface dataset:
Original: Recent works have validated the possibility of energy efficiency improvement in radio access networks ( RAN), depending on dynamically turn on/off some base stations (BSs).
Revised: Recent works have validated the possibility of energy efficiency improvement in radio access networks ( RANs), achieved by dynamically turning on/off some base stations (BSs).
Edit intent: clarity
Original:  In this paper, we extend the research over BS switching operation , which should match up with traffic load variations.
Revised:  In this paper, we extend the research over BS switching operations , which should match up with traffic load variations.
Edit intent: fluency
Original:  However, instead of depending on the predicted traffic loads , which is still quite challenging to precisely forecast, we firstly formulate the traffic variation as a Markov decision process (MDP) . Afterwards, in order to foresightedly minimize the energy consumption of RAN, we adopt the actor-critic algorithm and design a reinforcement learning framework based BS switching operation scheme.
Revised:  Instead of depending on the predicted traffic loads , which is still quite challenging to precisely forecast, we firstly formulate the traffic variation as a Markov decision process (MDP) . Afterwards, in order to foresightedly minimize the energy consumption of RAN, we adopt the actor-critic algorithm and design a reinforcement learning framework based BS switching operation scheme.
Edit intent: coherence
Original:  However, instead of depending on the predicted traffic loads , which is still quite challenging to precisely forecast, we firstly formulate the traffic variation as a Markov decision process (MDP) . Afterwards, in order to foresightedly minimize the energy consumption of RAN, we adopt the actor-critic algorithm and design a reinforcement learning framework based BS switching operation scheme.
Revised:  However, instead of depending on the dynamic traffic loads which are still quite challenging to precisely forecast, we firstly formulate the traffic variation as a Markov decision process (MDP) . Afterwards, in order to foresightedly minimize the energy consumption of RAN, we adopt the actor-critic algorithm and design a reinforcement learning framework based BS switching operation scheme.
Edit intent: clarity
Original:  However, instead of depending on the predicted traffic loads , which is still quite challenging to precisely forecast, we firstly formulate the traffic variation as a Markov decision process (MDP) . Afterwards, in order to foresightedly minimize the energy consumption of RAN, we adopt the actor-critic algorithm and design a reinforcement learning framework based BS switching operation scheme.
Revised:  However, instead of depending on the predicted traffic loads , which is still quite challenging to precisely forecast, we firstly formulate the traffic variations as a Markov decision process (MDP) . Afterwards, in order to foresightedly minimize the energy consumption of RAN, we adopt the actor-critic algorithm and design a reinforcement learning framework based BS switching operation scheme.
Edit intent: fluency
Original:  However, instead of depending on the predicted traffic loads , which is still quite challenging to precisely forecast, we firstly formulate the traffic variation as a Markov decision process (MDP) . Afterwards, in order to foresightedly minimize the energy consumption of RAN, we adopt the actor-critic algorithm and design a reinforcement learning framework based BS switching operation scheme.
Revised:  However, instead of depending on the predicted traffic loads , which is still quite challenging to precisely forecast, we firstly formulate the traffic variation as a Markov decision process . Afterwards, in order to foresightedly minimize the energy consumption of RAN, we adopt the actor-critic algorithm and design a reinforcement learning framework based BS switching operation scheme.
Edit intent: clarity
Original:  However, instead of depending on the predicted traffic loads , which is still quite challenging to precisely forecast, we firstly formulate the traffic variation as a Markov decision process (MDP) . Afterwards, in order to foresightedly minimize the energy consumption of RAN, we adopt the actor-critic algorithm and design a reinforcement learning framework based BS switching operation scheme.
Revised:  However, instead of depending on the predicted traffic loads , which is still quite challenging to precisely forecast, we firstly formulate the traffic variation as a Markov decision process (MDP) . Afterwards, in order to foresightedly minimize the energy consumption of RANs, we design a reinforcement learning framework based BS switching operation scheme.
Edit intent: coherence
Original:  Furthermore, to avoid the underlying curse of dimensionality in reinforcement learning, we propose a transfer actor-critic algorithm (TACT), which utilizes the transferred learning expertise in neighboring regions or historical periods .
Revised:  Furthermore, to avoid the underlying curse of dimensionality in reinforcement learning, a transfer actor-critic algorithm (TACT), which utilizes the transferred learning expertise in neighboring regions or historical periods .
Edit intent: coherence
Original:  The RDME has been shown to have the drawback of losing bimolecular reactions in the continuum limit that the lattice spacing approaches zero (in two or more dimensions).
Revised:  The RDME has been shown to have the drawback of losing bimolecular reactions in the limit that the lattice spacing approaches zero (in two or more dimensions).
Edit intent: clarity
Original:  The RDME has been shown to have the drawback of losing bimolecular reactions in the limit that the lattice spacing approaches zero ( in two or more dimensions ).
Revised:  The RDME has been shown to have the drawback of losing bimolecular reactions in the limit that the lattice spacing approaches zero , in two or more dimensions ).
Edit intent: fluency
Original:  However a straightforward ] implementation of the method yields recurrence relations more suitable for numerical computation  .
Revised:  However a straightforward ]). However an implementation of the method yields recurrence relations more suitable for numerical computation .
Edit intent: coherence
Original:  These goals has the following operational semantics: choose and solve a true disjunct G_i  where i (= \ } 1 or 2)is chosen by the machine.
Revised:  These goals has the following operational semantics: choose the true disjunct G_i where i (= \ } 1 or 2)is chosen by the machine.
Edit intent: clarity
Original: The traditional approach to investigating the stability of a physical system is to linearise the equations about a steady base flow , and to examine the eigenvalues of the linearised operator.
Revised: The traditional approach to investigating the stability of a physical system is to linearise the equations about a steady base solution , and to examine the eigenvalues of the linearised operator.
Edit intent: clarity
Original:  By automating the stability computations, we hope to make these powerful tools a  routine part of computational analysis.
Revised:  By automating the stability computations, we hope to make these powerful tools a more routine part of computational analysis.
Edit intent: clarity
Original:  The efficiency and generality of the framework is demonstrated with applications drawn from geophysical fluid dynamics, phase separation , chemical reaction-diffusion, and quantum mechanics.
Revised:  The efficiency and generality of the framework is demonstrated with applications drawn from geophysical fluid dynamics, phase separation and quantum mechanics.
Edit intent: clarity
Original:  We show that three choices suffice to delay the transition for any k >= 3, and that two choices suffice for all 3 <= k <= 25.
Revised:  We show that three choices suffice to raise the threshold for any k >= 3, and that two choices suffice for all 3 <= k <= 25.
Edit intent: clarity
Original: A major challenge in single particle reconstruction from cryo electron-microscopy is to establish a reliable ab-initio 3D model using 2D images with unknown orientations.
Revised: A major challenge in single particle reconstruction from cryo-electron microscopy is to establish a reliable ab-initio 3D model using 2D images with unknown orientations.
Edit intent: fluency
Original:  Common-lines based methods can determine the orientations of images without additional geometric information.
Revised:  Common-lines based methods estimate the orientations without additional geometric information.
Edit intent: clarity
Original:  First, we introduce another, yet more robust , global self consistency error in an optimization problem that can be solved via semidefinite relaxation.
Revised:  First, we introduce another, yet more robust , global self consistency error and show that the corresponding optimization problem can be solved via semidefinite relaxation.
Edit intent: clarity
Original:  Third, we use alternating direction method or the iteratively reweighted least squares (IRLS) procedureto solve the problem .
Revised:  Third, we use alternating direction method or the iteratively reweighted least squares procedure .
Edit intent: clarity
Original:  Numerical experiments  demonstrate that the proposed method significantly decreases the orientation estimation error when the detection rate of common-lines is low.
Revised:  Numerical experiments demonstrate that the proposed methods significantly reduce the orientation estimation error when the detection rate of common-lines is low.
Edit intent: fluency
Original:  For 0 <\rho<1 we maximize the following quantity: i=1^{k}\mathbb{R^{n}}\mathbb{R^{n}}1_{A_{i}}(x)1_{A_{i}}(x\rho+y1-\rho^{2}) e^{-(x_{1}^{2}+ ...
Revised:  For 0 , we maximize i=1^{k}\mathbb{R^{n}}\mathbb{R^{n}}1_{A_{i}}(x)1_{A_{i}}(x\rho+y1-\rho^{2}) e^{-(x_{1}^{2}+ ...
Edit intent: clarity
Original: Background: Two animals from the same litter are often more alike compared with two animals from separate litters.
Revised: Background: Animals from the same litter are often more alike compared with two animals from separate litters.
Edit intent: fluency
Original: Background: Two animals from the same litter are often more alike compared with two animals from separate litters.
Revised: Background: Two animals from the same litter are often more alike compared with animals from different litters.
Edit intent: clarity
Original:  This litter-to-litter variation (i.e. litter effects) can be either naturally occurring or induced by applying an experimental treatment  to whole litters rather than to the individual offspring.
Revised:  This litter-to-litter variation , or "litter effects", can influence the results in addition to the experimental factors of interest. Furthermore, an experimental treatment to whole litters rather than to the individual offspring.
Edit intent: clarity
Original:  This litter-to-litter variation (i.e. litter effects) can be either naturally occurring or induced by applying an experimental treatment  to whole litters rather than to the individual offspring.
Revised:  This litter-to-litter variation (i.e. litter effects) can be either naturally occurring or induced by applying an experimental treatment can be applied to whole litters rather than to the individual offspring.
Edit intent: clarity
Original:  This litter-to-litter variation (i.e. litter effects) can be either naturally occurring or induced by applying an experimental treatment  to whole litters rather than to the individual offspring.
Revised:  This litter-to-litter variation (i.e. litter effects) can be either naturally occurring or induced by applying an experimental treatment to whole litters rather than to individual offspring.
Edit intent: fluency
Original:  An exampleof the latter is the valproic acid (VPA) model of autism, where the disease phenotype in offspring is caused by giving VPA to pregnant females.
Revised:  For example, in the valproic acid (VPA) model of autism, where the disease phenotype in offspring is caused by giving VPA to pregnant females.
Edit intent: clarity
Original:  An exampleof the latter is the valproic acid (VPA) model of autism, where the disease phenotype in offspring is caused by giving VPA to pregnant females.
Revised:  An exampleof the latter is the valproic acid (VPA) model of autism, VPA is administered to pregnant females thereby inducing the disease phenotype in offspring is caused by giving VPA to pregnant females.
Edit intent: clarity
Original:  In this case, the sample size is the number of pregnant females and not the  number of offspring derived from them .
Revised:  In this case, the sample size is the number of litters and not the number of offspring derived from them .
Edit intent: clarity
Original:  In this case, the sample size is the number of pregnant females and not the  number of offspring derived from them .
Revised:  In this case, the sample size is the number of pregnant females and not the total number of offspring derived from them .
Edit intent: clarity
Original:  In this case, the sample size is the number of pregnant females and not the  number of offspring derived from them .
Revised:  In this case, the sample size is the number of pregnant females and not the number of offspring .
Edit intent: clarity
Original:  If such experiments are not appropriately designed an analysed, the results can be severely biased as well as extremely underpowered.
Revised:  If such experiments are not appropriately designed and analysed, the results can be severely biased as well as extremely underpowered.
Edit intent: fluency
Original:  In addition, litter effects accounted for up to 61\% (p <0.001) of the variation in behavioural outcomes, which was much larger than the treatment effects.
Revised:  In addition, litter effects accounted for up to 61\% (p <0.001) of the variation in behavioural outcomes, which was larger than the treatment effects.
Edit intent: clarity
Original:  Long cycles are examples of graphs of small tree-width but large connected tree-width.
Revised:  Long cycles are examples of graphs that have small tree-width but large connected tree-width.
Edit intent: fluency
Original:  We show that finite graphs have small connected tree-width if and only if they have small tree-width and contain no long geodesic cycle.
Revised:  We show that a graph has small connected tree-width if and only if they have small tree-width and contain no long geodesic cycle.
Edit intent: clarity
Original:  We show that finite graphs have small connected tree-width if and only if they have small tree-width and contain no long geodesic cycle.
Revised:  We show that finite graphs have small connected tree-width if and only if it has small tree-width and contain no long geodesic cycle.
Edit intent: clarity
Original:  We show that finite graphs have small connected tree-width if and only if they have small tree-width and contain no long geodesic cycle.
Revised:  We show that finite graphs have small connected tree-width if and only if they have small tree-width and contains no long geodesic cycle.
Edit intent: fluency
Original:  We further prove a qualitative duality theorem for connected tree-width: a finite graph has small connected tree-width if and only if it has no bramble whose connected covers are all large 3\over2\rfloor .
Revised:  We further prove a qualitative duality theorem for tree-width: a finite graph has small connected tree-width if and only if it has no bramble whose connected covers are all large 3\over2\rfloor .
Edit intent: fluency
Original:  Indeed, the existence of Gurvits's algorithm is why, in their recent work on the hardness of quantum optics, Aaronson and Arkhipov (AA) had to talk about sampling problems rather than ordinary decision problems.
Revised:  Indeed, the existence of Gurvits's algorithm is why, in their recent work on the hardness of quantum optics, Aaronson and Arkhipov (AA) had to talk about sampling problems rather than estimation problems.
Edit intent: clarity
Original: Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their equality ;
Revised: Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their relations ;
Edit intent: clarity
Original:   the fact that they have a well-defined notion of translation , and that they can be endowed with a compact metric .
Revised:  and the fact that they have a well-defined notion of translation , and that they can be endowed with a compact metric .
Edit intent: fluency
Original:   the fact that they have a well-defined notion of translation , and that they can be endowed with a compact metric .
Revised:  the fact that they have a well-defined notion of translation .
Edit intent: clarity
Original:   KEYWORDS: Causal Graph Dynamics, Curtis-Hedlund-Lynden , Dynamical networks, Boolean networks, Generative networks automata, Graph Automata, Graph rewriting automata, Parallel graph transformations, Amalgamated graph transformations, Time-varying graphs, Regge calculus, Local, No-signalling  .
Revised:  KEYWORDS: Causal Graph Dynamics, Curtis-Hedlund-Lyndon , Dynamical networks, Boolean networks, Generative networks automata, Graph Automata, Graph rewriting automata, Parallel graph transformations, Amalgamated graph transformations, Time-varying graphs, Regge calculus, Local, No-signalling .
Edit intent: fluency
Original:   KEYWORDS: Causal Graph Dynamics, Curtis-Hedlund-Lynden , Dynamical networks, Boolean networks, Generative networks automata, Graph Automata, Graph rewriting automata, Parallel graph transformations, Amalgamated graph transformations, Time-varying graphs, Regge calculus, Local, No-signalling  .
Revised:  KEYWORDS: Causal Graph Dynamics, Curtis-Hedlund-Lynden , Dynamical networks, Boolean networks, Generative networks automata, Graph Automata, Graph rewriting automata, L-systems, parallel graph transformations, Amalgamated graph transformations, Time-varying graphs, Regge calculus, Local, No-signalling .
Edit intent: clarity
Original:   KEYWORDS: Causal Graph Dynamics, Curtis-Hedlund-Lynden , Dynamical networks, Boolean networks, Generative networks automata, Graph Automata, Graph rewriting automata, Parallel graph transformations, Amalgamated graph transformations, Time-varying graphs, Regge calculus, Local, No-signalling  .
Revised:  KEYWORDS: Causal Graph Dynamics, Curtis-Hedlund-Lynden , Dynamical networks, Boolean networks, Generative networks automata, Graph Automata, Graph rewriting automata, Parallel graph transformations, Amalgamated graph transformations, Time-varying graphs, Regge calculus, Local, No-signalling , Reversibility .
Edit intent: clarity
Original: Networks of neurons in the brain encode memories via their synaptic connections.
Revised: Networks of neurons in the brain encode preferred patterns of neural activity via their synaptic connections.
Edit intent: clarity
Original:  Despite receiving considerable attention, the precise relationship between network connectivity and encoded activity patterns is still poorly understood.
Revised:  Despite receiving considerable attention, the precise relationship between network connectivity and encoded patterns is still poorly understood.
Edit intent: clarity
Original:  In particular, given a prescribed list of binary patterns, it is not generally known how to arrange the connectivity of a network so that exactly those patterns are encoded, while avoiding unwanted "spurious" states.
Edit intent: coherence
Original:  We introduce a simple encoding rule that selectively turns "on" synapses between neurons that co-appear in one or more patterns.
Revised:  We introduce a simple Encoding Rule that selectively turns "on" synapses between neurons that co-appear in one or more patterns.
Edit intent: fluency
Original:  The synapses are binary, in the sense of having only two states ("on" or "off"), but also graded, with heterogeneous weights drawn from an underlying synaptic strength matrix S.
Revised:  The rule uses synapses that are binary, in the sense of having only two states ("on" or "off"), but also graded, with heterogeneous weights drawn from an underlying synaptic strength matrix S.
Edit intent: clarity
Original:  The synapses are binary, in the sense of having only two states ("on" or "off"), but also graded, with heterogeneous weights drawn from an underlying synaptic strength matrix S.
Revised:  The synapses are binary, in the sense of having only two states ("on" or "off"), but also heterogeneous, with weights drawn from an underlying synaptic strength matrix S.
Edit intent: clarity
Original:  To obtain our results, we use ideas from convex and distance geometry, such as Helly's Theorem and Cayley-Menger determinants, revealing a novel connection between these areas of mathematics and coding properties of neural networks.
Revised:  To obtain our results, we use ideas from convex and distance geometry, such as Cayley-Menger determinants, revealing a novel connection between these areas of mathematics and coding properties of neural networks.
Edit intent: coherence
Original: This article, which begins the serial, is devoted to the properties of the planar triangulations, is the first one in the cycleof the articles that are devoted to the attempt of the strict proof of Four Color Problem.
Revised: The material is devoted to the properties of the planar triangulations, is the first one in the cycleof the articles that are devoted to the attempt of the strict proof of Four Color Problem.
Edit intent: clarity
Original: This article, which begins the serial, is devoted to the properties of the planar triangulations, is the first one in the cycleof the articles that are devoted to the attempt of the strict proof of Four Color Problem.
Revised: This article, which begins the serial, is devoted to the properties of the planar triangulations, is the first one in the cycleof the articles that are devoted to the attempts of the proof of Four Color Problem.
Edit intent: clarity
Original: The material is devoted to the properties of the dual planar triangulations.
Revised: This article is devoted to the properties of the dual planar triangulations.
Edit intent: clarity
Original:  On the base of the properties, which were achieved by other authors, anothe properties of the dual triangulations were proved .
Revised:  On the base of the properties, which were achieved by other authors, anothe properties of the dual triangulations .
Edit intent: clarity
Original:  Also the numeric properties of the dual planar triangulations were examined for the sake of understanding the interdependencies of the cyclomatic numbers of the different dual graphs between themselves  .
Revised:  Also the numeric properties of the dual planar triangulations will be examined for the sake of understanding the interdependencies of the cyclomatic numbers of the different dual graphs between themselves .
Edit intent: clarity
Original:  Also the numeric properties of the dual planar triangulations were examined for the sake of understanding the interdependencies of the cyclomatic numbers of the different dual graphs between themselves  .
Revised:  Also the numeric properties of the dual planar triangulations were examined for the sake of understanding the interdependences of the cyclimatic numbers of different graphs between themselves .
Edit intent: clarity
Original: Almost two decades of research on the use of the mathematical formalism of quantum theory as a modeling tool for entities and their dynamics in domains different from the micro-world has now firmly shown the systematic appearance of quantum structures in aspects of human behavior and thought, such as in cognitive processes of decision-making , and in the way concepts are combined into sentences.
Revised: Almost two decades of research on applications of the mathematical formalism of quantum theory as a modeling tool for entities and their dynamics in domains different from the micro-world has now firmly shown the systematic appearance of quantum structures in aspects of human behavior and thought, such as in cognitive processes of decision-making , and in the way concepts are combined into sentences.
Edit intent: clarity