wanyu/IteraTeR_v2 huggingface dataset:
Original:  On the other hand, a rather simple argument shows that, when |S|=k, a random linear code achieves essentially optimal communication rate of O( k\cdot H(\mu) ) bits, nearly-matching the communication benchmark in the symmetric case .
Revised:  On the other hand, a rather simple argument shows that, when |S|=k, a random linear code achieves essentially optimal communication rate of O( k\cdot H(\mu) bits .
Edit intent: clarity
Original:  In many cases, the AME including transitivity reinforcement provide accurate predictions of stationary-state disease prevalence and network degree distributions.
Revised:  In many cases, the AME including transitivity reinforcement provides accurate predictions of stationary-state disease prevalence and network degree distributions.
Edit intent: fluency
Original:  In many cases, the AME including transitivity reinforcement provide accurate predictions of stationary-state disease prevalence and network degree distributions.
Revised:  In many cases, the AME including transitivity reinforcement provide accurate predictions of stationary-state disease prevalences and network degree distributions.
Edit intent: fluency
Original:  We show that higher transitivity reinforcement in the model leads to lower levels of infective individuals in the population ;
Revised:  We show that higher transitivity reinforcement in the model leads to lower levels of infective individuals in the population ,
Edit intent: fluency
Original:  when closing a triangle is the only rewiring mechanism.
Revised:  when closing a triangle is the dominant rewiring mechanism.
Edit intent: clarity
Original: We present a systematic study of the notion of surplus invariance, which plays a natural and important role in the theory of risk measures and capital requirements.
Revised: This paper presents a systematic study of the notion of surplus invariance, which plays a natural and important role in the theory of risk measures and capital requirements.
Edit intent: clarity
Original:  So far, this notion has been investigated in the setting of  special spaces of random variables.
Revised:  So far, this notion has been investigated in the setting of some special spaces of random variables.
Edit intent: clarity
Original: A population genetics model based on a multitype branching process, or equivalently a Galton-Watson branching process for multiple alleles, is presented .
Revised: A population genetics model based on a multitype branching process, or equivalently a Galton-Watson branching process for multiple alleles, is pre- sented .
Edit intent: clarity
Original:  This solution has the property that the system undergoes a rapid transition from a perturbation of the model with zero mutation rates to a phase in which the distribution collapses onto the asymptotic stationary distribution.
Revised:  This solution has the property that the system undergoes a rapid transition from a drift-dominated phase to a mutation-dominated phase in which the distribution collapses onto the asymptotic stationary distribution.
Edit intent: clarity
Original:  A new method, which we call the iterative approach, is developed to find subgame perfect Nash equilibriums .
Revised:  A new method, which we call the iterative approach, is developed to find subgame perfect Nash equilibria .
Edit intent: fluency
Original:  However, the PSLQ was only analyzed theoretically for exact input .
Revised:  PSLQ was only analyzed theoretically for exact input .
Edit intent: coherence
Original:  That is, when the algorithm takes empirical data (inexact data with error bounded) instead of exact real numbers as its input, how do we ensure theoretically the output of the algorithm to be an exact integer relation?
Revised:  That is, when the algorithm takes empirical data (inexact data with error bounded) instead of exact real numbers as its input, how do we theoretically ensure the output of the algorithm to be an exact integer relation?
Edit intent: fluency
Original:  First , we give a termination condition for this case.
Revised:  Firstly , we give a termination condition for this case.
Edit intent: fluency
Original:  Secondly  we analyze a perturbation on the hyperplane matrix constructed from the input data and hence disclose a relationship between the accuracy of the input data and the output quality (an upper bound on the absolute value of the inner product of the exact data and the computed integer relation)  .
Revised:  Secondly , we analyze a perturbation on the hyperplane matrix constructed from the input data and hence disclose a relationship between the accuracy of the input data and the output quality (an upper bound on the absolute value of the inner product of the exact data and the computed integer relation) .
Edit intent: fluency
Original:  Further, we also analyze the computational complexity for PSLQ with empirical data.
Revised:  Further, we analyze the complexity bound of the PSLQ algorithm for empirical data.
Edit intent: clarity
Original:  Examples on transcendental numbers and algebraic numbers show the meaningfulness of our error control strategies .
Revised:  Examples on transcendental numbers and algebraic numbers show the meaningfulness of our error control strategy .
Edit intent: fluency
Original:  We show that it cannot be achieved for \lambda < 2 \frac{(1+\rho)^{1+\rho}{\rho^\rho}} {(\rho-1)^{\rho-1}}} +1,  \rho := 2\frac{f+1 , which is tight due to earlier work .
Revised:  We show that this cannot be achieved for \lambda < 2 \frac{(1+\rho)^{1+\rho}{\rho^\rho}} {(\rho-1)^{\rho-1}}} +1, \rho := 2\frac{f+1 , which is tight due to earlier work .
Edit intent: clarity
Original:  We show that it cannot be achieved for \lambda < 2 \frac{(1+\rho)^{1+\rho}{\rho^\rho}} {(\rho-1)^{\rho-1}}} +1,  \rho := 2\frac{f+1 , which is tight due to earlier work .
Revised:  We show that it cannot be achieved for \lambda < 2 \frac{(1+\rho)^{1+\rho}{\rho^\rho}} {(\rho-1)^{\rho-1}}} +1, \rho := \frac{2(f+1) , which is tight due to earlier work .
Edit intent: clarity
Original:  This also gives some better than previously known lower bounds for so-called Byzantine-type faulty robots ( that may actually wrongly report a target ) .
Revised:  This also gives some better than previously known lower bounds for so-called Byzantine-type faulty robots that may actually wrongly report a target ) .
Edit intent: fluency
Original:  Additionally , we show a real-world example to exploit Qualcomm's QSEE.
Revised:  Also , we show a real-world example to exploit Qualcomm's QSEE.
Edit intent: coherence
Original: Biological populations are subject to two types of noise: demographic stochasticity due to fluctuations in the reproductive success of individuals, and environmental variations that affect coherently the relative fitness of all individuals in the same clone .
Revised: Biological populations are subject to two types of noise: demographic stochasticity due to fluctuations in the reproductive success of individuals, and environmental variations that affect coherently the relative fitness of entire populations .
Edit intent: clarity
Original:  The rate in which the average fitness of a population increases has been considered so far using models with pure demographic stochasticity;
Revised:  The rate in which the average fitness of a community increases has been considered so far using models with pure demographic stochasticity;
Edit intent: clarity
Original:  Traders with heterogeneous preferences and risk exposures have motive to behave strategically regarding the level of risk aversion they reveal through the transaction , thereby impacting prices and allocations.
Revised:  Traders with heterogeneous preferences and risk exposures have motive to behave strategically regarding the demand schedules they submit , thereby impacting prices and allocations.
Edit intent: clarity
Original:  We propose Translational Recommender Networks (TransRec ) , a new attentive neural architecture that utilizes the translational principle to model the relationships between user and item pairs .
Revised:  We propose Translational Recommender Networks ( ) , a new attentive neural architecture that utilizes the translational principle to model the relationships between user and item pairs .
Edit intent: clarity
Original:  Our model employs a neural attention mechanism over aLatent Relational Attentive Memory (LRAM) module to learn the latent relations between user-item pairs that best explains the interaction.
Revised:  Our model employs a neural attention mechanism over a (LRAM) module to learn the latent relations between user-item pairs that best explains the interaction.
Edit intent: clarity
Original:  By exploiting adaptive user-item specific translations in vector space, our model also alleviates the geometric inflexibility problem of other metric learning algorithms while enabling greater modeling capability and fine-grained fitting of users and items in vector space.
Revised:  By exploiting adaptive user-item pair. Hence, this can be interpreted as learning an exclusive and optimal relational translation for each user-item interaction.
Edit intent: clarity
Original:  The proposed architecture not only demonstrates the state-of-the-art performance across multiple recommendation benchmarks but also boasts of improved interpretability.
Revised:  The proposed architecture demonstrates the state-of-the-art performance across multiple recommendation benchmarks but also boasts of improved interpretability.
Edit intent: fluency
Original:  We move from a theoretical result that allow uniqueness in \mathcal{A with just four suitably selected X-ray directions.
Revised:  We move from a theoretical result that allows uniqueness of reconstruction in the grid with just four suitably selected X-ray directions.
Edit intent: clarity
Original:  This is exploited in studying the structure of the allowed ghosts in the given lattice grid.
Revised:  In this framework, the structure of the allowed ghosts in the given lattice grid.
Edit intent: clarity
Original:  Results show that it is possible to achieve (i) temporal determinism as strong as with traditional way-based cache partitioning ;
Revised:  The results show that our approach achieves (i) temporal determinism as strong as with traditional way-based cache partitioning ;
Edit intent: clarity
Original:  Results show that it is possible to achieve (i) temporal determinism as strong as with traditional way-based cache partitioning ;
Revised:  Results show that it is possible to achieve (i) the same degree of temporal determinism of traditional way-based cache partitioning ;
Edit intent: clarity
Original:  We therefore propose a new holistic resource management approach driven by a new memory abstraction, which we call Deterministic Memory.
Revised:  We , therefore, propose a new holistic resource management approach driven by a new memory abstraction, which we call Deterministic Memory.
Edit intent: fluency
Original: Poor timing predictability of multicore processors has been a long-standing challenge in the real-time systems community.
Revised: Poor time predictability of multicore processors has been a long-standing challenge in the real-time systems community.
Edit intent: fluency
Original:  We present deterministic memory-aware OS and architecture designs, including OS-level page allocator, hardware-level cache  and DRAM controller designs.
Revised:  We present deterministic memory-aware OS and architecture designs, including OS-level page allocator, hardware-level cache , and DRAM controller designs.
Edit intent: fluency
Original:  These tasks present considerable difficulties for reinforcement learning approaches, since the natural reward function for such goal-oriented tasks is sparse and prohibitive amounts of exploration are required to reach the goal and receive a learning signal.
Revised:  These goal-oriented tasks present a considerable challenge for reinforcement learning approaches, since the natural reward function for such goal-oriented tasks is sparse and prohibitive amounts of exploration are required to reach the goal and receive a learning signal.
Edit intent: clarity
Original:  These tasks present considerable difficulties for reinforcement learning approaches, since the natural reward function for such goal-oriented tasks is sparse and prohibitive amounts of exploration are required to reach the goal and receive a learning signal.
Revised:  These tasks present considerable difficulties for reinforcement learning , since their natural reward function for such goal-oriented tasks is sparse and prohibitive amounts of exploration are required to reach the goal and receive a learning signal.
Edit intent: clarity
Original:  These tasks present considerable difficulties for reinforcement learning approaches, since the natural reward function for such goal-oriented tasks is sparse and prohibitive amounts of exploration are required to reach the goal and receive a learning signal.
Revised:  These tasks present considerable difficulties for reinforcement learning approaches, since the natural reward function is sparse and prohibitive amounts of exploration are required to reach the goal and receive a learning signal.
Edit intent: clarity
Original:  These tasks present considerable difficulties for reinforcement learning approaches, since the natural reward function for such goal-oriented tasks is sparse and prohibitive amounts of exploration are required to reach the goal and receive a learning signal.
Revised:  These tasks present considerable difficulties for reinforcement learning approaches, since the natural reward function for such goal-oriented tasks is sparse and prohibitive amounts of exploration are required to reach the goal and receive some learning signal.
Edit intent: clarity
Original:  Past approaches tackle these problems by  manually designing a task-specific reward shaping function to help guide the learning  .
Revised:  Past approaches tackle these problems by manually designing a task-specific reward shaping function to guide the learning .
Edit intent: clarity
Original:  Past approaches tackle these problems by  manually designing a task-specific reward shaping function to help guide the learning  .
Revised:  Past approaches tackle these problems by manually designing a task-specific reward shaping function to help guide the learning agent .
Edit intent: clarity
Original:  Instead, we propose a method to learn these tasks without requiring any prior task knowledge other than obtaining a single state in which the task is achieved.
Revised:  Instead, we propose a method to learn these tasks without requiring any prior knowledge other than obtaining a single state in which the task is achieved.
Edit intent: clarity
Original:  The robot is trained in "reverse" , gradually learning to reach the goal from a set of starting positions increasingly far from the goal.
Revised:  The robot is trained in reverse , gradually learning to reach the goal from a set of starting positions increasingly far from the goal.
Edit intent: fluency
Original:  The robot is trained in "reverse" , gradually learning to reach the goal from a set of starting positions increasingly far from the goal.
Revised:  The robot is trained in "reverse" , gradually learning to reach the goal from a set of start states increasingly far from the goal.
Edit intent: clarity
Original:  Our method automatically generates a curriculum of starting positions that adapts to the agent's performance, leading to efficient training on such tasks.
Revised:  Our method automatically generates a curriculum of start states that adapts to the agent's performance, leading to efficient training on such tasks.
Edit intent: clarity
Original:  Our method automatically generates a curriculum of starting positions that adapts to the agent's performance, leading to efficient training on such tasks.
Revised:  Our method automatically generates a curriculum of starting positions that adapts to the agent's performance, leading to efficient training on goal-oriented tasks.
Edit intent: clarity
Original: Electronic medical records contain multi-format electronic medical data that consist of  abundance of medical knowledge.
Revised: Electronic medical records contain multi-format electronic medical data that consist of an abundance of medical knowledge.
Edit intent: fluency
Original:  In this paper, we aim to capture these relationships by constructing a big and high-quality heterogenous graph linking patients, diseases, and drugs (PDD) in EMRs.
Revised:  In this paper, we aim to capture these relationships by constructing a large and high-quality heterogenous graph linking patients, diseases, and drugs (PDD) in EMRs.
Edit intent: fluency
Original: We study the coordination and control problem of distributed discrete-event systems with synchronous communication, in the presence of subsystems whose sensors and/or actuators may be affected by unexpected failures .
Revised: We investigate the coordination and control problem of distributed discrete-event systems with synchronous communication, in the presence of subsystems whose sensors and/or actuators may be affected by unexpected failures .
Edit intent: coherence
Original: We study the coordination and control problem of distributed discrete-event systems with synchronous communication, in the presence of subsystems whose sensors and/or actuators may be affected by unexpected failures .
Revised: We study the coordination and control problems of distributed discrete event systems that are composed of multiple subsystems subject to potential actuator and/or actuators may be affected by unexpected failures .
Edit intent: clarity
Original: We study the coordination and control problem of distributed discrete-event systems with synchronous communication, in the presence of subsystems whose sensors and/or actuators may be affected by unexpected failures .
Revised: We study the coordination and control problem of distributed discrete-event systems with synchronous communication, in the presence of subsystems whose sensors and/or sensor faults .
Edit intent: clarity
Original:  In the present article, we suggest a linguistic model of classifying VKontakte pages by interests of their followers and test its effectiveness with such classifiers as Naive Bayes, SVM and some other .
Revised:  In the present article, we suggest a linguistic model of classifying VKontakte pages by interests of their followers and test its effectiveness with such classifiers as Naive Bayes, and some other .
Edit intent: clarity
Original:  Optimizing network architecture by reducing the supply variance over all network tubes, we identify patterns of tube dilation or contraction that rescue sub-optimal supply for the case of too low or too high inflow rate .
Revised:  Optimizing network architecture by reducing the supply variance over all network tubes, we identify patterns of tube dilation or contraction that compensate sub-optimal supply for the case of too low or too high inflow rate .
Edit intent: clarity
Original: The neuronal paradigm of studying the brain has left us with major limitations in both our understanding of how neurons process information to achieve biological intelligence and how such knowledge can be translated into artificial intelligence  .
Revised: The neuronal paradigm of studying the brain has left us with limitations in both our understanding of how neurons process information to achieve biological intelligence and how such knowledge can be translated into artificial intelligence .
Edit intent: clarity
Original: The neuronal paradigm of studying the brain has left us with major limitations in both our understanding of how neurons process information to achieve biological intelligence and how such knowledge can be translated into artificial intelligence  .
Revised: The neuronal paradigm of studying the brain has left us with major limitations in both our understanding of how neurons process information to achieve biological intelligence and how such knowledge may be translated into artificial intelligence .
Edit intent: clarity
Original:  Overturning our fundamental assumptions of how the brain works, the recent exploration of glia is revealing that these long-neglected brain cells , and in particular astrocytes, dynamically contribute to and regulate neuronal activity by interacting with neurons at the synaptic level.
Revised:  Overturning our fundamental assumptions of how the brain works, the recent exploration of astrocytes is revealing that these long-neglected brain cells , and in particular astrocytes, dynamically contribute to and regulate neuronal activity by interacting with neurons at the synaptic level.
Edit intent: clarity
Original:  Overturning our fundamental assumptions of how the brain works, the recent exploration of glia is revealing that these long-neglected brain cells , and in particular astrocytes, dynamically contribute to and regulate neuronal activity by interacting with neurons at the synaptic level.
Revised:  Overturning our fundamental assumptions of how the brain works, the recent exploration of glia is revealing that these long-neglected brain cells dynamically regulate learning by interacting with neurons at the synaptic level.
Edit intent: clarity
Original:  Overturning our fundamental assumptions of how the brain works, the recent exploration of glia is revealing that these long-neglected brain cells , and in particular astrocytes, dynamically contribute to and regulate neuronal activity by interacting with neurons at the synaptic level.
Revised:  Overturning our fundamental assumptions of how the brain works, the recent exploration of glia is revealing that these long-neglected brain cells , and in particular astrocytes, dynamically contribute to and regulate neuronal activity by interacting with neuronal activity at the synaptic level.
Edit intent: fluency
Original:  Following recent glial-specific in vivo calcium imaging studies, we built a biologically-constrained model of an astrocytic-neural network and analyzed the dynamics of the astrocyte-neural interaction .
Revised:  Following recent glial-specific in vivo calcium imaging studies, we built a biologically-constrained model of an astrocytic-neural network and analyzed the dynamics of the interaction between neurons and astrocytes .
Edit intent: clarity
Original:  We show that the inclusion of astrocytes was sufficient to trigger transitions between learned states in a Hopfield-type model of memory.
Revised:  We show that astrocytes were sufficient to trigger transitions between learned states in a Hopfield-type model of memory.
Edit intent: clarity
Original:  The timing of the transitions  was governed by the dynamics of the calcium-dependent slow-currents in the astrocytic processes ensheathing the synapses.
Revised:  The timing of the transitions that was governed by the dynamics of the calcium-dependent slow-currents in the astrocytic processes ensheathing the synapses.
Edit intent: fluency
Original:  Scientists' work , however, may not be limited to data, but can also include code, provenance, documents, etc .
Revised:  An experiment , however, may not be limited to data, but can also include code, provenance, documents, etc .
Edit intent: clarity
Original:  Scientists' work , however, may not be limited to data, but can also include code, provenance, documents, etc .
Revised:  Scientists' work , however, seldom includes only datasets, but more often includes software, its past execution, provenance, and associated documentation .
Edit intent: clarity
Original:  In this paper, we present the sciunit, a reusable research object whose contents can be re-computed, and thus measured .
Revised:  In this paper, we present the sciunit, a reusable research object in which aggregated content is recomputable .
Edit intent: clarity
Original:  We describe how to efficiently create, store, and repeat computational work with sciunits.
Revised:  We describe a Git-like client that efficiently creates, stores, and repeats sciunits.
Edit intent: clarity
Original:  We show through experiments that sciunits can replicate and re-run computational applications with minimal storage and processing overhead.
Revised:  We show through analysis that sciunits repeat computational experiments with minimal storage and processing overhead.
Edit intent: clarity