wanyu/IteraTeR_v2 huggingface dataset:
Original:  Despite ranging from 13  to 46 hours  , the relative timing of events from cellularization to hatching is constant across all of the species and temperatures examined , suggesting the existence of a previously unrecognized timer controlling embryogenesis progress and tuned by natural selection in response to the thermal environment of each species .
Revised:  Despite ranging from 13 to 46 hours , the relative timing of events from cellularization to hatching is constant across all of the species and temperatures examined , suggesting the existence of a previously unrecognized timer controlling embryogenesis .
Edit intent: clarity
Original: We study the temporal covariance of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes.
Revised: We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes.
Edit intent: clarity
Original:  then they use this oracle to find the optimum among a finite set of critical values.
Revised:  second, they use this oracle to find the optimum among a finite set of critical values.
Edit intent: fluency
Original:  then they use this oracle to find the optimum among a finite set of critical values.
Revised:  then they use this oracle to find the optimum from a finite set of critical values.
Edit intent: clarity
Original:  We demonstrate its strength by presenting a quadratic time algorithm for the Fr\'echet distance between polygonal curves in R^d under polyhedral distance functions , including L_1 and L _infty .
Revised:  This gives the first quadratic time algorithm for the Fr\'echet distance between polygonal curves in R^d under polyhedral distance functions , including L_1 and L _infty .
Edit intent: clarity
Original:  We demonstrate its strength by presenting a quadratic time algorithm for the Fr\'echet distance between polygonal curves in R^d under polyhedral distance functions , including L_1 and L _infty .
Revised:  We demonstrate its strength by presenting a quadratic time algorithm for the Fr\'echet distance between polygonal curves in R^d under polyhedral distance functions (e.g., L_1 and L _infty .
Edit intent: clarity
Original:  For the exact Euclidean case, our framework currently gives an algorithm with running time O(n^2 log ^2 n).
Revised:  For the exact Euclidean case, our framework currently yields an algorithm with running time O(n^2 log ^2 n).
Edit intent: clarity
Original: In this paper we propose a randomized block coordinate non-monotone gradient (RBCNMG ) method for minimizing the sum of a smooth (possibly nonconvex) function and a block-separable (possibly nonconvex nonsmooth) function.
Revised: We propose a randomized block coordinate non-monotone gradient (RBCNMG ) method for minimizing the sum of a smooth (possibly nonconvex) function and a block-separable (possibly nonconvex nonsmooth) function.
Edit intent: clarity
Original:  At each iteration, this method randomly picks a block according to any prescribed probability distribution and typically solves several associated proximal subproblems that usually have a closed-form solution, until a certain sufficient reduction on the objective function is achieved.
Revised:  At each iteration, this method randomly picks a block according to any prescribed probability distribution and solves typically several associated proximal subproblems that usually have a closed-form solution, until a certain sufficient reduction on the objective function is achieved.
Edit intent: fluency
Original:  At each iteration, this method randomly picks a block according to any prescribed probability distribution and typically solves several associated proximal subproblems that usually have a closed-form solution, until a certain sufficient reduction on the objective function is achieved.
Revised:  At each iteration, this method randomly picks a block according to any prescribed probability distribution and typically solves several associated proximal subproblems that usually have a closed-form solution, until a certain progress on objective value is achieved.
Edit intent: clarity
Original:   When the problem under consideration is convex, we further establish that the sequence of expected objective values generated by this method converges to the optimal value of the problem.
Revised:  When the problem under consideration is convex, we show that the expected objective values generated by this method converges to the optimal value of the problem.
Edit intent: clarity
Original:   When the problem under consideration is convex, we further establish that the sequence of expected objective values generated by this method converges to the optimal value of the problem.
Revised:  When the problem under consideration is convex, we further establish that the sequence of expected objective values generated by RNBPG converge to the optimal value of the problem.
Edit intent: clarity
Original:  We also conduct some preliminary experiments to test the performance of our RBCNMG method on the \ell_1-regularized least-squares problem  .
Revised:  We also conduct some preliminary experiments to test the performance of RNBPG on the \ell_1-regularized least-squares problem .
Edit intent: clarity
Original:  The computational results demonstrate that our method substantially outperform the randomized block coordinate descent method proposed in Richtarik and Takac (Math Programming 2012) {\it   .
Revised:  The computational results demonstrate that our method substantially outperforms the randomized block coordinate descent method proposed in Richtarik and Takac (Math Programming 2012) {\it .
Edit intent: fluency
Original:  The computational results demonstrate that our method substantially outperform the randomized block coordinate descent method proposed in Richtarik and Takac (Math Programming 2012) {\it   .
Revised:  The computational results demonstrate that our method substantially outperform the randomized block coordinate {\it .
Edit intent: clarity
Original:  For multiple neurons, the corresponding marginal distributions is coupled to their joint probability distribution using a parametric copula model.
Revised:  For multiple neurons, the corresponding marginal distributions are coupled to their joint probability distribution using a parametric copula model.
Edit intent: fluency
Original:  This way, while the nonparametric component (i.e., the Gaussian process model) provides a flexible framework for modeling the underlying firing rates , the parametric component (i.e., the copula model) allows us to make inference regarding the relationships among neurons  . Using simulated data, we show that our approach could correctly capture temporal dependencies in firing rates and identify synchronous neurons.
Revised:  The advantages of our approach are as follows: the nonparametric component (i.e., the Gaussian process model) provides a flexible framework for modeling the underlying firing rates , the parametric component (i.e., the copula model) allows us to make inference regarding the relationships among neurons . Using simulated data, we show that our approach could correctly capture temporal dependencies in firing rates and identify synchronous neurons.
Edit intent: coherence
Original:  This way, while the nonparametric component (i.e., the Gaussian process model) provides a flexible framework for modeling the underlying firing rates , the parametric component (i.e., the copula model) allows us to make inference regarding the relationships among neurons  . Using simulated data, we show that our approach could correctly capture temporal dependencies in firing rates and identify synchronous neurons.
Revised:  This way, while the nonparametric component (i.e., the Gaussian process model) provides a flexible framework for modeling the underlying firing rates ; the parametric component (i.e., the copula model) allows us to make inference regarding the relationships among neurons . Using simulated data, we show that our approach could correctly capture temporal dependencies in firing rates and identify synchronous neurons.
Edit intent: fluency
Original:  The adversary is restricted by the injection rate, burstiness, and by how many passive stations can be simultaneously activated by injecting packetsinto their empty queues .
Revised:  The adversary is restricted by injection rate, burstiness, and by how many passive stations can be simultaneously activated by injecting packetsinto their empty queues .
Edit intent: fluency
Original:  The adversary is restricted by the injection rate, burstiness, and by how many passive stations can be simultaneously activated by injecting packetsinto their empty queues .
Revised:  The adversary is restricted by the injection rate, burstiness, and by how many passive stations can be simultaneously activated by providing them with packets .
Edit intent: clarity
Original:  The rates of algorithms we present make the increasing sequence  1/3, 3/8 and 1/2, reflecting the additional features of algorithms.
Revised:  The rates of algorithms we present make the increasing sequence consisting of 1/3, 3/8 and 1/2, reflecting the additional features of algorithms.
Edit intent: clarity
Original:  We show that no injection rate greater than 3/4 can be handled with bounded packet latency.
Revised:  We show that injection rate 3/4 can be handled with bounded packet latency.
Edit intent: clarity
Original:  We show that no injection rate greater than 3/4 can be handled with bounded packet latency.
Revised:  We show that no injection rate greater than 3/4 cannot be handled with bounded packet latency.
Edit intent: clarity
Original: We study dynamic broadcasting in multiple access channels in  adversarial settings.
Revised: We study broadcast in multiple access channels in adversarial settings.
Edit intent: clarity
Original:  DCRAM is fully compatible with CMOS technology, can be realized with current fabrication facilities, and therefore can really serve as an alternative to present technology.
Revised:  DCRAM is fully compatible with CMOS technology, can be realized with current fabrication facilities, and therefore can really serve as an alternative to the present computing technology.
Edit intent: clarity
Original:  In this working paper we present some preliminary results from the analysis of the Data Citation Index.
Revised:  In this short note we present some preliminary results from the analysis of the Data Citation Index.
Edit intent: clarity
Original:  Though, several algorithms have been devised to compute the similarity between protein structures.
Revised:  Though, several algorithms have been devised to compute the similarity and dissimilarity among protein structures.
Edit intent: clarity
Original:  But, most of them compare proteins by structural alignment of the protein backbones  .
Revised:  But, these algorithms compare protein structures by structural alignment of the protein backbones .
Edit intent: clarity
Original:  In this paper we attempt to compute the similarities and dissimilarities among 3D protein structures using the fundamental mathematical morphology operation and fractal geometry .
Revised:  In this paper , an attempt has been made to compute the similarities and dissimilarities among 3D protein structures using the fundamental mathematical morphology operation and fractal geometry .
Edit intent: clarity
Original:  In this paper we attempt to compute the similarities and dissimilarities among 3D protein structures using the fundamental mathematical morphology operation and fractal geometry .
Revised:  In this paper we attempt to compute the similarities and dissimilarities among 3D protein structures using the fundamental mathematical morphology operations and fractal geometry .
Edit intent: fluency
Original:  To implement the same we propose two methods one to determine the superficial structural or global similarityand the other to compute the internal or local similarity in atom level of the protein molecules.
Revised:  To implement the same we propose two methods one to determine the superficial structural (global similarity) and local similarity in atom level of the protein molecules.
Edit intent: clarity
Original:  To implement the same we propose two methods one to determine the superficial structural or global similarityand the other to compute the internal or local similarity in atom level of the protein molecules.
Revised:  To implement the same we propose two methods one to determine the superficial structural or global similarityand the other to compute the internal or local similarity in atomic level of the protein molecules.
Edit intent: fluency
Original:  Analyzing and aggregating the results obtained in the two methods mentioned above we ascertain the overall similarity between proteins .
Revised:  This intricate structural difference would provide insight to Biologists to understand the protein structures and their functions more precisely .
Edit intent: coherence
Original:  This paper shows that both effects overamplify the well-known merit-order effect of RES power in-feed beyond a level that can still be explained by the underlying physical realities .
Revised:  We show that both effects overamplify the well-known merit-order effect of RES power in-feed beyond a level that can still be explained by the underlying physical realities .
Edit intent: clarity
Original:  This paper shows that both effects overamplify the well-known merit-order effect of RES power in-feed beyond a level that can still be explained by the underlying physical realities .
Revised:  This paper shows that both effects overamplify the well-known merit-order effect of RES power in-feed beyond a level that is explainable by underlying physical realities .
Edit intent: clarity
Original:   In this paper we analyze the current situation of wind and photovoltaic (PV ) power in-feed in the German electric power system and their effect on the spot market \approx20 .
Revised:  In this paper we analyze the impacts of wind and photovoltaic (PV ) power in-feed in the German electric power system and their effect on the spot market \approx20 .
Edit intent: clarity
Original:   In this paper we analyze the current situation of wind and photovoltaic (PV ) power in-feed in the German electric power system and their effect on the spot market \approx20 .
Revised:  In this paper we analyze the current situation of wind and PV power in-feed in the German electric power system and their effect on the spot market \approx20 .
Edit intent: clarity
Original:   In this paper we analyze the current situation of wind and photovoltaic (PV ) power in-feed in the German electric power system and their effect on the spot market \approx20 .
Revised:  In this paper we analyze the current situation of wind and photovoltaic (PV ) power in-feed on the spot market \approx20 .
Edit intent: clarity
Original:  We show a comparison of the FIT-subsidized renewable energy sources (RES ) energy production volume to the spot market volume and the overall load demand.
Revised:  We show a comparison of the FIT-subsidized RES energy production volume to the spot market volume and the overall load demand.
Edit intent: clarity
Original:  Furthermore, a spot market analysis based on the assumption that renewable energy sources (RES ) units have to feed-in with their assumed true marginal costs, i.e., operation and maintenance costs, is performed.
Revised:  Furthermore, a spot market analysis based on the assumption that RES units have to feed-in with their assumed true marginal costs, i.e., operation and maintenance costs, is performed.
Edit intent: clarity
Original: Reciprocity is a vital feature of social networks, but  little is known about its structure in real world behavior, or the mechanisms underlying its persistence  .
Revised: Reciprocity is a vital feature of social networks, but relatively little is known about its structure in real world behavior, or the mechanisms underlying its persistence .
Edit intent: clarity
Original: Reciprocity is a vital feature of social networks, but  little is known about its structure in real world behavior, or the mechanisms underlying its persistence  .
Revised: Reciprocity is a vital feature of social networks, but little is known about its temporal structure or the mechanisms underlying its persistence .
Edit intent: clarity
Original: Reciprocity is a vital feature of social networks, but  little is known about its structure in real world behavior, or the mechanisms underlying its persistence  .
Revised: Reciprocity is a vital feature of social networks, but little is known about its structure in real world behavior, or the mechanisms underlying its persistence in real world behavior .
Edit intent: fluency
Original:  We find that levels of cooperation seen over the sixteen-week study period can be accounted for on the stationary hypothesis alone .
Revised:  We find that levels of cooperation among close kin can be accounted for on the stationary hypothesis alone .
Edit intent: clarity
Original:  Many combinatorial structures that arise in mathematics and in computer science can be represented naturally as graph homomorphisms and as weighted sums of graph homomorphisms.
Revised:  Many combinatorial structures that arise in mathematics and computer science can be represented naturally as graph homomorphisms and as weighted sums of graph homomorphisms.
Edit intent: fluency
Original:  The complexity of modular counting was introduced by Papadimitriou and Zachos and it has been pioneered by Valiant who famously introduced a problem for which counting modulo 7 is easy where counting modulo 2 is intractable.
Revised:  The complexity of modular counting was introduced by Papadimitriou and Zachos and it has been pioneered by Valiant who famously introduced a problem for which counting modulo 7 is easy but counting modulo 2 is intractable.
Edit intent: clarity
Original:  In this case  the structure of the graph H has a big influence on the complexity of the problem.
Revised:  In this case , the structure of the graph H has a big influence on the complexity of the problem.
Edit intent: fluency
Original:  We show that  for some cactus graphs H, counting homomorphisms to H modulo 2 can be done in polynomial time.
Revised:  We show that , for some cactus graphs H, counting homomorphisms to H modulo 2 can be done in polynomial time.
Edit intent: fluency
Original:  For every other fixed cactus graph H, the problem is complete in the complexity class Parity-P which is a wide complexity class to which every problem in the polynomial hierarchy can be reduced (using randomised reductions).
Revised:  For every other fixed cactus graph H, the problem is complete for the complexity class Parity-P which is a wide complexity class to which every problem in the polynomial hierarchy can be reduced (using randomised reductions).
Edit intent: clarity
Original:  For every other fixed cactus graph H, the problem is complete in the complexity class Parity-P which is a wide complexity class to which every problem in the polynomial hierarchy can be reduced (using randomised reductions).
Revised:  For every other fixed cactus graph H, the problem is complete in the complexity class parity-P which is a wide complexity class to which every problem in the polynomial hierarchy can be reduced (using randomised reductions).
Edit intent: fluency
Original:  For the case of uncoordinated transmission, we present a novel characterization of the optimal throughput along with an achievable strategy using joint decoding.
Revised:  Our main contribution is a novel characterization of the optimal throughput along with an achievable strategy using joint decoding.
Edit intent: clarity
Original:  For the case of uncoordinated transmission, we present a novel characterization of the optimal throughput along with an achievable strategy using joint decoding.
Revised:  For the case of uncoordinated transmission, we present a novel characterization of the optimal throughput for the case of uncoordinated transmission and a strategy for achieving this throughput that relies on overlapping transmissions and joint decoding.
Edit intent: clarity
Original:  We apply this framework to a noise-limited cellular network for evaluating two classes of system-level designs that account for signaling overhead : a one-stage design, where the data payload is communicated over a random access channel, and a conventional two-stage design, where the identity of devices is established over a random access channel and the payload is communicated during a scheduled stage .
Revised:  We apply our framework to evaluate more general system-level designs that account for signaling overhead : a one-stage design, where the data payload is communicated over a random access channel, and a conventional two-stage design, where the identity of devices is established over a random access channel and the payload is communicated during a scheduled stage .
Edit intent: clarity
Original:   P100 is conceptually funded as a new citation-rank approach .  Advantages and disadvantages of this approach are noted.
Revised:  P100 was recently introduced as a new citation-rank approach . Advantages and disadvantages of this approach are noted.
Edit intent: clarity
Original:   P100 is conceptually funded as a new citation-rank approach .  Advantages and disadvantages of this approach are noted.
Revised:  P100 is conceptually funded as a new citation-rank approach . Advantages and disadvantages of citation-rank indicators are noted.
Edit intent: clarity
Original:  Finally, we  DASH-INC, a framework for improved video streaming in caching networks including transcoding and multiple throughput estimation.
Revised:  Finally, we introduce DASH-INC, a framework for improved video streaming in caching networks including transcoding and multiple throughput estimation.
Edit intent: coherence
Original: For most problems in science and engineering we can obtain data  that describe the  system from various perspectives and record the behaviour of its individual components.
Revised: For most problems in science and engineering we can obtain data sets that describe the system from various perspectives and record the behaviour of its individual components.
Edit intent: clarity
Original: For most problems in science and engineering we can obtain data  that describe the  system from various perspectives and record the behaviour of its individual components.
Revised: For most problems in science and engineering we can obtain data that describe the observed system from various perspectives and record the behaviour of its individual components.
Edit intent: clarity
Original: For most problems in science and engineering we can obtain data  that describe the  system from various perspectives and record the behaviour of its individual components.
Revised: For most problems in science and engineering we can obtain data that describe the system from various perspectives and record the behavior of its individual components.
Edit intent: fluency
Original:  Heterogeneous data sources can be collectively mined by data fusion.
Revised:  Heterogeneous data sets can be collectively mined by data fusion.
Edit intent: clarity
Original:  Fusion can focus on a specific target relation and exploit directly associated data together with data on the context or additional constraints.
Revised:  Fusion can focus on a specific target relation and exploit directly associated data together with contextual data and data about system's constraints.
Edit intent: clarity
Original:  The approach can directly consider any data sets that can be expressed in a matrix, including those from attribute-based representations, ontologies, associations and networks.
Revised:  The approach can directly consider any data that can be expressed in a matrix, including those from attribute-based representations, ontologies, associations and networks.
Edit intent: clarity