wanyu/IteraTeR_v2 huggingface dataset:
Original:  This is of importance because subsequent analysis steps are performed on each time series entailing that these should follow an approximate normal distribution.
Revised:  This is of importance because many subsequent analyses either assume or perform better when the time series have stable variance or adheres to an approximate Gaussian distribution.
Edit intent: clarity
Original:  In this paper, using simulations and analysis of resting-state fMRI data,  the effect of  different variance stabilization strategies on connectivity time-series , namely the Fisher transform, the Box Cox transform and a combined approach .
Revised:  In this paper, using simulations and analysis of resting-state fMRI data, we analyze the effect of different variance stabilization strategies on connectivity time-series , namely the Fisher transform, the Box Cox transform and a combined approach .
Edit intent: clarity
Original:  In this paper, using simulations and analysis of resting-state fMRI data,  the effect of  different variance stabilization strategies on connectivity time-series , namely the Fisher transform, the Box Cox transform and a combined approach .
Revised:  In this paper, using simulations and analysis of resting-state fMRI data, the effect of applying different variance stabilization strategies on connectivity time-series , namely the Fisher transform, the Box Cox transform and a combined approach .
Edit intent: clarity
Original:  In this paper, using simulations and analysis of resting-state fMRI data,  the effect of  different variance stabilization strategies on connectivity time-series , namely the Fisher transform, the Box Cox transform and a combined approach .
Revised:  In this paper, using simulations and analysis of resting-state fMRI data, the effect of different variance stabilization strategies on connectivity time-series . We here focus our investigation on the Fisher transform, the Box Cox transform and a combined approach .
Edit intent: clarity
Original:  If the intention of stabilizing the variance is , as often is the case, to quantify the fluctuations of each brain connectivity time series by sampling fluctuations from a normal distribution , we show that the usage of the Fisher transform is not optimal and may even skew a time series away from normality .
Revised:  If the intention of stabilizing the variance is , as often is the case, to quantify the fluctuations of each brain connectivity time series by sampling fluctuations from a normal distribution , we show that the usage of the Fisher transform is not optimal and may even skew connectivity time series away from normality .
Edit intent: fluency
Original:  Further, we show  the suboptimal performance of the Fisher transform can be substantially improved by including an additional Box-Cox transformation after the dFC time series has been Fisher transformed .
Revised:  Further, we show that the suboptimal performance of the Fisher transform can be substantially improved by including an additional Box-Cox transformation after the dFC time series has been Fisher transformed .
Edit intent: fluency
Original:  Large noise will dominate the noise-free gradient and allow stochastic gradient descent to be moreexploratory .
Revised:  Large noise will dominate the noise-free gradient and allow stochastic gradient descent to explore more .
Edit intent: clarity
Original:  By adding noise only to the problematic parts of the activation function  we allow the optimization procedure to explore the boundary between the degenerate (saturating) and the well-behaved parts of the activation function.
Revised:  By adding noise only to the problematic parts of the activation function , we allow the optimization procedure to explore the boundary between the degenerate (saturating) and the well-behaved parts of the activation function.
Edit intent: fluency
Original:  We find experimentally that replacing such saturating activation functions by by noisy variants helps training in many contexts, yielding state-of-the-art results on several datasets , especially when training seems to be the most difficult, e.g., when curriculum learning is necessary to obtain good results.
Revised:  We find experimentally that replacing such saturating activation functions by noisy variants helps training in many contexts, yielding state-of-the-art results on several datasets , especially when training seems to be the most difficult, e.g., when curriculum learning is necessary to obtain good results.
Edit intent: fluency
Original:  We find experimentally that replacing such saturating activation functions by by noisy variants helps training in many contexts, yielding state-of-the-art results on several datasets , especially when training seems to be the most difficult, e.g., when curriculum learning is necessary to obtain good results.
Revised:  We find experimentally that replacing such saturating activation functions by by noisy variants helps training in many contexts, yielding state-of-the-art or competitive results on different datasets and task , especially when training seems to be the most difficult, e.g., when curriculum learning is necessary to obtain good results.
Edit intent: clarity
Original: Common  activation functions used in neural networks can yield to training difficulties due to the saturation behavior of the activation function, which may hide dependencies which are not visible to vanilla-SGD (using first order gradients only).
Revised: Common activation functions used in neural networks can cause training difficulties due to the saturation behavior of the activation function, which may hide dependencies which are not visible to vanilla-SGD (using first order gradients only).
Edit intent: clarity
Original: Common  activation functions used in neural networks can yield to training difficulties due to the saturation behavior of the activation function, which may hide dependencies which are not visible to vanilla-SGD (using first order gradients only).
Revised: Common activation functions used in neural networks can yield to training difficulties due to the saturation behavior of the activation function, which may hide dependencies that are not visible to vanilla-SGD (using first order gradients only).
Edit intent: fluency
Original:  We propose to exploit the injection of appropriate noise so that some gradients may sometimes flow , even if the noiseless application of the activation function would yield zero gradient.
Revised:  We propose to exploit the injection of appropriate noise so that the gradients may flow easily , even if the noiseless application of the activation function would yield zero gradient.
Edit intent: clarity
Original:  Large noise will dominate the noise-free gradient and allow stochastic gradient descent to explore more.
Revised:  Large noise will dominate the noise-free gradient and allow stochastic gradient descent toexplore more.
Edit intent: fluency
Original:  Using the Lagrangian approach along with a two-patch model, our results, via simulation, shows that short term mobility could be beneficial in the control of a Zv outbreak when used in combination with other control measures, but it could be detrimental when the reproductive number is too high  .
Revised:  Using a Lagrangian modeling approach in a two-patch model, our results, via simulation, shows that short term mobility could be beneficial in the control of a Zv outbreak when used in combination with other control measures, but it could be detrimental when the reproductive number is too high .
Edit intent: clarity
Original:  Using the Lagrangian approach along with a two-patch model, our results, via simulation, shows that short term mobility could be beneficial in the control of a Zv outbreak when used in combination with other control measures, but it could be detrimental when the reproductive number is too high  .
Revised:  Using the Lagrangian approach along with a two-patch setting, it is shown via simulations that short term mobility could be beneficial in the control of a Zv outbreak when used in combination with other control measures, but it could be detrimental when the reproductive number is too high .
Edit intent: clarity
Original:  Using the Lagrangian approach along with a two-patch model, our results, via simulation, shows that short term mobility could be beneficial in the control of a Zv outbreak when used in combination with other control measures, but it could be detrimental when the reproductive number is too high  .
Revised:  Using the Lagrangian approach along with a two-patch model, our results, via simulation, shows that short term mobility may be beneficial in the control of a Zv outbreak when used in combination with other control measures, but it could be detrimental when the reproductive number is too high .
Edit intent: fluency
Original:  The orientation of the curvature is modified to align with the direction in which the growth differential is maximal .
Revised:  The orientation of the curvature along the main axis of the organ aligns with the direction in which the growth differential is maximal .
Edit intent: clarity
Original:  This allows to criticize established measurement where the movement of the apical tip is taken as a marker of the growth dynamics.
Revised:  This allows to criticize established measurement where the movement of the apical tip as markers of growth dynamics.
Edit intent: clarity
Original:  Despite its validity under certain set of hypotheses, this measurement is not sufficient to decipher the specific role of each mechanism.
Revised:  We show that though this relation is correct under certain conditions, it does not generally hold, and is not sufficient to decipher the specific role of each mechanism.
Edit intent: clarity
Original:  Despite its validity under certain set of hypotheses, this measurement is not sufficient to decipher the specific role of each mechanism.
Revised:  Despite its validity under certain set of hypotheses, this measurement is not sufficient to uncover the specific role of each mechanism.
Edit intent: clarity
Original:  In particular, in the case of a model driven by a Wishart process,  we derive a closed-form pricing formula for caplets.
Revised:  In particular, in the case of a model driven by a Wishart process, for which we derive a closed-form pricing formula for caplets.
Edit intent: clarity
Original:  Given an expression in the hierarchy, we prove that it  undecidable to check if there is a language equivalent expression at lower levels.
Revised:  Given an expression in the hierarchy, we prove that it is undecidable to check if there is a language equivalent expression at lower levels.
Edit intent: fluency
Original: Galor discovered many mysteries of growth .
Revised: Galor discovered many mysteries of the growth process .
Edit intent: clarity
Original:  He created them by his habitually crude or distorted presentation of data and by failing to carry out their scientific analysis .
Revised:  He created them by his habitually distorted presentation of data and by failing to carry out their scientific analysis .
Edit intent: clarity
Original:  He created them by his habitually crude or distorted presentation of data and by failing to carry out their scientific analysis .
Revised:  He created them by his habitually crude or distorted presentation of data .
Edit intent: clarity
Original:  The sudden spurt never happened.
Revised:  This sudden spurt never happened.
Edit intent: clarity
Original:  We show that this sudden spurt is also of his own creation .
Revised:  We show that this sudden spurt was also created by the distorted presentation of data .
Edit intent: clarity
Original:  The resulting unlimited-vocabulary and affix aware source word embeddings are tested in a state-of-the-art neural MT based on an attention-based bidirectional recurrent neural network.
Revised:  The resulting unlimited-vocabulary and affix-aware source word embeddings are tested in a state-of-the-art neural MT based on an attention-based bidirectional recurrent neural network.
Edit intent: fluency
Original:  The proposed MT scheme completely avoids the problem of unknown source words and provides improved results even when the source language is not morphologically rich .
Revised:  The proposed MT scheme provides improved results even when the source language is not morphologically rich .
Edit intent: clarity
Original: Single-molecule magnetic tweezers experiments performed in the past few years report a clear deviation of the effective torsional stiffness of DNA from the predictions of the twistable worm-like chain model.
Revised: Recent magnetic tweezers experiments performed in the past few years report a clear deviation of the effective torsional stiffness of DNA from the predictions of the twistable worm-like chain model.
Edit intent: clarity
Original: Single-molecule magnetic tweezers experiments performed in the past few years report a clear deviation of the effective torsional stiffness of DNA from the predictions of the twistable worm-like chain model.
Revised: Single-molecule magnetic tweezers experiments have reported systematic deviations of the twist response of double-stranded DNA from the predictions of the twistable worm-like chain model.
Edit intent: clarity
Original:  Here we show that this discrepancy can be resolved if a coupling term between bending and twisting is introduced.
Revised:  Here we show that this discrepancy can be resolved if a coupling between twist and bend is introduced.
Edit intent: clarity
Original:  \pm  Although the existence of such an interaction was predicted more than two decades ago (Marko and Siggia, Macromol.
Revised:  \pm Although the existence of such an interaction was predicted more than two decades ago (Marko and Siggia, Macromolecules
Edit intent: clarity
Original:  27, 981 (1994)), its effect on the static and dynamical properties of DNA has been largely unexplored.
Revised:  27, 981 (1994)), its effects on the mechanical properties of DNA has been largely unexplored.
Edit intent: clarity
Original:  27, 981 (1994)), its effect on the static and dynamical properties of DNA has been largely unexplored.
Revised:  27, 981 (1994)), its effect on the static and dynamical properties of DNA have been so far largely unexplored.
Edit intent: clarity
Original:  For 2-dimensional CAT(0) polyhedral complexes, we give polynomial-time algorithms for computing convex hulls using linear programming and for answering shortest path queries from a given source point.
Revised:  For 2-dimensional CAT(0) polyhedral complexes, we give efficient algorithms for computing convex hulls using linear programming and for answering shortest path queries from a given source point.
Edit intent: clarity
Original:  These spaces have unique shortest paths and are composed of Euclidean polyhedra, yet many properties of convex hulls in Euclidean space fail to transfer over.
Revised:  These spaces have unique shortest paths and are composed of Euclidean polyhedra, yet many algorithms and properties of shortest paths and convex hulls in Euclidean space fail to transfer over.
Edit intent: clarity
Original:  We give an algorithm for computing convex hulls using linear programming for 2-dimensional CAT(0) polyhedral complexes with a single vertex.
Revised:  We give an algorithm , using linear programming for 2-dimensional CAT(0) polyhedral complexes with a single vertex.
Edit intent: clarity
Original:  We give an algorithm for computing convex hulls using linear programming for 2-dimensional CAT(0) polyhedral complexes with a single vertex.
Revised:  We give an algorithm for computing convex hulls using linear programming for 2-dimensional CAT(0) polyhedral complex with a single vertex.
Edit intent: fluency
Original:  We explore using shortest path maps to answer single-source shortest path queries in 2-dimensional CAT(0) polyhedral complexes, and we improve and unify solutions for 2-manifold and rectangular cases.
Revised:  We explore the use of shortest path maps to answer single-source shortest path queries in 2-dimensional CAT(0) polyhedral complexes, and we improve and unify solutions for 2-manifold and rectangular cases.
Edit intent: fluency
Original:  We explore using shortest path maps to answer single-source shortest path queries in 2-dimensional CAT(0) polyhedral complexes, and we improve and unify solutions for 2-manifold and rectangular cases.
Revised:  We explore using shortest path maps to answer single-source shortest path queries in 2-dimensional CAT(0) polyhedral complexes, and we unify efficient solutions for 2-manifold and rectangular cases.
Edit intent: clarity
Original:  Group hunting sailfish (Istiophorus platypterus) alternate attacks  on their schooling prey (Sardinella aurita).
Revised:  Individual sailfish (Istiophorus platypterus) alternate attacks on their schooling prey (Sardinella aurita).
Edit intent: clarity
Original:  While only 23 \% of attacks result in prey capture, multiple prey are injured in 95\% of attacks, resulting in an increase of injured fish in the school with the number of attacks.
Revised:  While only 24 \% of attacks result in prey capture, multiple prey are injured in 95\% of attacks, resulting in an increase of injured fish in the school with the number of attacks.
Edit intent: fluency
Original:  Such 'proto-cooperation' may be the pre-cursor to more complex group-hunting strategies.
Revised:  Such "porto-cooperation" may be the pre-cursor to more complex group-hunting strategies.
Edit intent: fluency
Original:  Such " porto-cooperation " may be the pre-cursor to more complex group-hunting strategies.
Revised:  Such " proto-cooperation " may be the pre-cursor to more complex group-hunting strategies.
Edit intent: fluency
Original:  Denote by \mathcal L_k the family of all vectors \mathbf v from \{0,\pm 1\}^n such that \langle\mathbf v,\mathbf v\rangle = k. For any k and l and sufficiently large n we determine the maximal size of the family \mathcal V\subset \mathcal L_k such that for any \mathbf v,\mathbf w\in \mathcal V we have \langle \mathbf v,\mathbf w\rangle\ge l.
Revised:  Denote by \mathcal L_k the family of all vectors \mathbf v from \{0,\pm 1\}^n such that \langle\mathbf v,\mathbf v\rangle = k. For any k , most l and sufficiently large n we determine the maximal size of the family \mathcal V\subset \mathcal L_k such that for any \mathbf v,\mathbf w\in \mathcal V we have \langle \mathbf v,\mathbf w\rangle\ge l.
Edit intent: clarity
Original: The possibility of detecting which camera has been used to shoot a specific picture is of paramount importance for many forensics tasks.
Revised: Detecting the camera model used to shoot a specific picture is of paramount importance for many forensics tasks.
Edit intent: clarity
Original:  Indeed , we propose a data-driven algorithm based on convolutional neural networks, which learns features characterizing each camera  directly from the acquired pictures.
Revised:  Specifically , we propose a data-driven algorithm based on convolutional neural networks, which learns features characterizing each camera directly from the acquired pictures.
Edit intent: fluency
Original:  Indeed , we propose a data-driven algorithm based on convolutional neural networks, which learns features characterizing each camera  directly from the acquired pictures.
Revised:  Indeed , we propose a data-driven algorithm based on convolutional neural networks, which learns features characterizing each camera model directly from the acquired pictures.
Edit intent: clarity
Original:  In Routing Open Shop, the jobs are located in the vertices of an edge-weighted graph G=(V,E)  whose edge weights determine the time needed for the machines to travel between jobs.
Revised:  In Routing Open Shop, the jobs are located in the vertices of an edge-weighted graph G=(V,E) , whose edge weights determine the time needed for the machines to travel between jobs.
Edit intent: fluency
Original: Open Shop is a classical scheduling problem : given a set J of jobs and a set M of machines, find a minimum-makespan schedule to process each job J_i \in J on each machine M_q \in M for a given amount p_{iq time such that  each machine processes only one job at a time and each job is processed by only one machineat a time.
Revised: The open shop problem is to find a minimum makespan schedule to process each job J_i \in J on each machine M_q \in M for a given amount p_{iq time such that each machine processes only one job at a time and each job is processed by only one machineat a time.
Edit intent: clarity
Original: Open Shop is a classical scheduling problem : given a set J of jobs and a set M of machines, find a minimum-makespan schedule to process each job J_i \in J on each machine M_q \in M for a given amount p_{iq time such that  each machine processes only one job at a time and each job is processed by only one machineat a time.
Revised: Open Shop is a classical scheduling problem : given a set J of jobs and a set M of machines, find a minimum-makespan schedule to process each job J_i on each machine M_q \in M for a given amount p_{iq time such that each machine processes only one job at a time and each job is processed by only one machineat a time.
Edit intent: fluency
Original: Open Shop is a classical scheduling problem : given a set J of jobs and a set M of machines, find a minimum-makespan schedule to process each job J_i \in J on each machine M_q \in M for a given amount p_{iq time such that  each machine processes only one job at a time and each job is processed by only one machineat a time.
Revised: Open Shop is a classical scheduling problem : given a set J of jobs and a set M of machines, find a minimum-makespan schedule to process each job J_i \in J on each machine M_q for p_{iq time such that each machine processes only one job at a time and each job is processed by only one machineat a time.
Edit intent: clarity
Original: Open Shop is a classical scheduling problem : given a set J of jobs and a set M of machines, find a minimum-makespan schedule to process each job J_i \in J on each machine M_q \in M for a given amount p_{iq time such that  each machine processes only one job at a time and each job is processed by only one machineat a time.
Revised: Open Shop is a classical scheduling problem : given a set J of jobs and a set M of machines, find a minimum-makespan schedule to process each job J_i \in J on each machine M_q \in M for a given amount p_{iq time such that each machine processes at most one job and each job is processed by only one machineat a time.
Edit intent: clarity
Original:  In Routing Open Shop, the jobs are located in the vertices of an edge-weighted graph G=(V,E), whose edge weights determine the time needed for the machines to travel between jobs .
Revised:  In Routing Open Shop, the jobs are located in the vertices of an edge-weighted graph . The weights determine the time needed for the machines to travel between jobs .
Edit intent: clarity
Original:  For the special case with unit processing times p_{iq is solvable in 2^{O( |V||M| ^2\log |V||M| )} \cdot\mathrm{poly + |M|. Various upper bounds shown using the schedule completion theorem suggest it to be likewise beneficial for the development of approximation algorithms .
Revised:  For the special case with unit processing times p_{iq is solvable in 2^{O( |V||M| ^2\log |V||M| )} + |M|. Various upper bounds shown using the schedule completion theorem suggest it to be likewise beneficial for the development of approximation algorithms .
Edit intent: coherence
Original:  While the classic theory of epidemics is useful to formulate and estimate this parameter for diseases with initial exponential spread, methods to characterize and estimate the reproduction number for epidemics that exhibit early sub-exponential (i.e.  polynomial) growth dynamics are lacking.
Revised:  While the classic theory of epidemics is useful to formulate and estimate this parameter for diseases with initial exponential spread, methods to characterize and estimate the reproduction number for epidemics that exhibit early sub-exponential (i.e. , polynomial) growth dynamics are lacking.
Edit intent: fluency