wanyu/IteraTeR_v2 huggingface dataset:
Original:  The problem has similar structure to blind deconvolution, except binary constraints are present in the formulation and enforced in our approach.
Revised:  The problem has similar structure to blind deconvolution, except for the presence of binary constraints, which we enforce in our approach.
Edit intent: clarity
Original:  We evaluate the potential and limitations of our framework in silico using synthetic  data with available ground truth .
Revised:  We evaluate the potential and limitations of our framework in silico using synthetic data with available ground truths .
Edit intent: fluency
Original:  Specific properties of these patterns , such as local phase synchronization, can be predicted from the parameters of the reaction and of the Mexican Hat coupling .
Revised:  Specific properties of these patterns are controlled by the parameters of the reaction and of the Mexican Hat coupling .
Edit intent: clarity
Original: We propose a new class-optimal algorithm for the distributed computation of Wasserstein Barycenters over networks.
Revised: We propose a new algorithm for the distributed computation of Wasserstein Barycenters over networks.
Edit intent: clarity
Original:  Assuming that each node in a graph has a probability distribution, we prove that every node is able to reach the barycenter of all distributions held in the network by using local interactions compliant with the topology of the graph.
Revised:  Assuming that each node in a graph has a probability distribution, we prove that every node can reach the barycenter of all distributions held in the network by using local interactions compliant with the topology of the graph.
Edit intent: clarity
Original:  We show the minimum number of communication rounds required for the proposed method to achieve arbitrary relative precision both in the optimality of the solution and the consensus among all agents for undirected fixed networks.
Revised:  We provide an estimate for the minimum number of communication rounds required for the proposed method to achieve arbitrary relative precision both in the optimality of the solution and the consensus among all agents for undirected fixed networks.
Edit intent: clarity
Original:  The main contributions of this thesis have been: (i) to provide a model for the existence of transcription factories characterized in vivo with fluorescence microscopy;
Revised:  The main contributions of this thesis have been: (i) to provide a model for the existence of transcription factories characterized in vivo with fluorescence microscopy;
Edit intent: fluency
Original: Finding graph indices which are unbiased to network size is of high importance both within a given field and across fields for enhancing the comparability over the cornucopia of modern network science studies as well as in subnetwork comparisons of the same network .
Revised: Finding graph indices which are unbiased to network size is of high importance both within a given field and across fields for enhancing comparability over the cornucopia of modern network science studies as well as in subnetwork comparisons of the same network .
Edit intent: fluency
Original: Finding graph indices which are unbiased to network size is of high importance both within a given field and across fields for enhancing the comparability over the cornucopia of modern network science studies as well as in subnetwork comparisons of the same network .
Revised: Finding graph indices which are unbiased to network size is of high importance both within a given field and across fields for enhancing the comparability over the cornucopia of modern network science studies . This is also important within studies for comparability of subnetworks within a given network, for example .
Edit intent: coherence
Original: Finding graph indices which are unbiased to network size  is of high importance both within a given field and across fields for enhancing comparability over the cornucopia of modern network science studies.
Revised: Finding graph indices which are unbiased to network size is of high importance both within a given field and across fields for enhancing comparability of modern network science studies.
Edit intent: clarity
Original:  This is also important within studies for comparability of subnetworks within a given network, for example.
Edit intent: coherence
Original:  The degree variance is an important metric for characterising graph heterogeneity and hub dominance, however this clearly depends on the largest and smallest degrees of the graph which depends on network size .
Revised:  The degree variance is an important metric for characterising network heterogeneity .
Edit intent: clarity
Original:  We illustrate its enhanced appropriateness for assessing hierarchical spread of degrees in weighted random networks, random geometric networks , resting-state brain networks and the US airport network .
Revised:  We illustrate its enhanced appropriateness for assessing hierarchical spread of degrees in weighted random networks, random geometric networks and resting-state brain networks and the US airport network .
Edit intent: fluency
Original:  We strengthen these results with model observations in weighted random networks, random geometric networks and resting-state brain networks, showing that the proposed normalisation is unbiased to both network size and density  .
Revised:  We strengthen these results with model observations in random networks, random geometric networks and resting-state brain networks, showing that the proposed normalisation is unbiased to both network size and density .
Edit intent: clarity
Original:  We strengthen these results with model observations in weighted random networks, random geometric networks and resting-state brain networks, showing that the proposed normalisation is unbiased to both network size and density  .
Revised:  We strengthen these results with model observations in weighted random networks, random geometric networks and resting-state brain networks, showing that the proposed normalisation is less affected by both network size and density .
Edit intent: clarity
Original:  The degree variance is an important metric for characterising network  heterogeneity.
Revised:  The degree variance is an important metric for characterising network degree heterogeneity.
Edit intent: fluency
Original:  We strengthen these results with model observations in random networks , random geometric networks and resting-state brain networks, showing that the proposed normalisation is  less affected by both network size and density than previous normalisation attempts.
Revised:  We strengthen these results with model observations in random networks , random geometric networks and resting-state brain networks, showing that the proposed normalisation is generally less affected by both network size and density than previous normalisation attempts.
Edit intent: coherence
Original:  We provide a rational for this, based on a simple birth-proportional growth-death model previously introduced to describe  firms, cities, webpages, etc.
Revised:  We provide a rationale for this, based on a simple birth-proportional growth-death model previously introduced to describe firms, cities, webpages, etc.
Edit intent: fluency
Original:  We provide a rational for this, based on a simple birth-proportional growth-death model previously introduced to describe  firms, cities, webpages, etc.
Revised:  We provide a rational for this, based on a simple proportional growth with birth firms, cities, webpages, etc.
Edit intent: clarity
Original: Designing RNA sequences that fold into specific structures and perform desired biological functions is an emerging field in bioengineering with broad applications from intracellular chemical catalysis to cancer therapy via selective gene silencing.
Revised: Designing RNA sequences that fold into specific structures and perform desired biological functions is an emerging field in bioengineering with a broad range of applications from reaction catalysis to cancer therapy via selective gene silencing.
Edit intent: clarity
Original:  Although significant progress has been made in developing computational algorithmsfor this purpose , current approaches are ineffective at designing sequences for complex targets, limiting their utility in real-world applications.
Revised:  Although significant progress has been made in developing computational algorithmsfor this purpose , current approaches still have difficulty designing sequences for complex targets, limiting their utility in real-world applications.
Edit intent: clarity
Original:  Through this approach, we observe SentRNA can learn and apply human-like design strategies to solve several complex targets previously unsolvable by any computational approach .
Revised:  Through this approach, SentRNA can solve complex targets previously unsolvable by any computational approach .
Edit intent: coherence
Original:  We thus demonstrate that incorporating a prior of human design strategies into a computational agent can significantly boost its performance , and suggests a new paradigm for machine-based RNA design.
Revised:  We thus demonstrate that incorporating human design strategies into a computational agent can significantly boost its performance , and suggests a new paradigm for machine-based RNA design.
Edit intent: clarity
Original:  We thus demonstrate that incorporating a prior of human design strategies into a computational agent can significantly boost its performance , and suggests a new paradigm for machine-based RNA design.
Revised:  We thus demonstrate that incorporating a prior of human design strategies into a design algorithm can significantly boost its performance , and suggests a new paradigm for machine-based RNA design.
Edit intent: clarity
Original:  We thus demonstrate that incorporating a prior of human design strategies into a computational agent can significantly boost its performance , and suggests a new paradigm for machine-based RNA design.
Revised:  We thus demonstrate that incorporating a prior of human design strategies into a computational agent can significantly boost machine performance and suggests a new paradigm for machine-based RNA design.
Edit intent: clarity
Original:  We focus on a homogeneous microbial population of fixed size subjected to a periodic alternation of phases of absence and presence of an antimicrobial that stops growth.
Revised:  We consider a homogeneous microbial population of fixed size subjected to a periodic alternation of phases of absence and presence of an antimicrobial that stops growth.
Edit intent: clarity
Original:  We focus on a homogeneous microbial population of fixed size subjected to a periodic alternation of phases of absence and presence of an antimicrobial that stops growth.
Revised:  We focus on a homogeneous microbial population of fixed size subjected to periodic alternations of phases of absence and presence of an antimicrobial that stops growth.
Edit intent: fluency
Original:  Combining analytical approaches and stochastic simulations, we quantify how the time necessary for fit resistant bacteria to take over the microbial population depends on the period of the alternations .
Revised:  Combining analytical approaches and stochastic simulations, we quantify how the time necessary for fit resistant bacteria to take over the microbial population depends on the alternation period .
Edit intent: clarity
Original:  We demonstrate that fast alternations strongly accelerate the evolution of resistance, and that a plateau is reached once the period gets sufficiently small . Besides, the acceleration of resistance evolution is stronger for larger populations.
Revised:  We demonstrate that fast alternations strongly accelerate the evolution of resistance, reaching a plateau for sufficiently small periods. Furthermore, this acceleration is stronger in larger populations.
Edit intent: clarity
Original:  For asymmetric alternations, featuring a different duration of the phases with and without antimicrobial, we shed light on the existence of a broad minimum of the time taken by the population to fully evolve resistance.
Revised:  For asymmetric alternations, featuring a different duration of the phases with and without antimicrobial, we shed light on the existence of a minimum for the time taken by the population to fully evolve resistance.
Edit intent: clarity
Original:  This dramatic acceleration of the evolution of antimicrobial resistance likely occurs in realistic situations, and can have an important impact both in clinical and experimental situations.
Revised:  This dramatic acceleration of the evolution of antimicrobial resistance likely occurs in realistic situations, and may have an important impact both in clinical and experimental situations.
Edit intent: clarity
Original: We study the problem of fair classification within the versatile framework of Dwork et al. [ITCS 2012 ], which assumes the existence of a metric that measures similarity between pairs of individuals.
Revised: We study the problem of fair classification within the versatile framework of Dwork et al. [ITCS '12 ], which assumes the existence of a metric that measures similarity between pairs of individuals.
Edit intent: clarity
Original:  Unlike previous works on metric-based fairness , we do not assume that the entire metric is known to the learning algorithm .
Revised:  Unlike earlier work , we do not assume that the entire metric is known to the learning algorithm .
Edit intent: clarity
Original:  We study the sample complexity and time complexity of learning a metric multifair hypothesis (providing rather tight upper and lower bounds) by connecting it to the task of learning the class {\cal C} . In particular, if the class%DIFDELCMD < {\cal %%% C admits an efficient agnostic learner, then we can learn such a metric multifair hypothesis efficiently .
Revised:  We study the sample complexity and time complexity of learning a metric multifair hypothesis (providing rather tight upper and lower bounds) by connecting it to the task of learning the class {\cal C} %DIFDELCMD < {\cal %%% C admits an efficient agnostic learner, then we can learn such a metric multifair hypothesis efficiently .
Edit intent: coherence
Original:  We study the sample complexity and time complexity of learning a metric multifair hypothesis (providing rather tight upper and lower bounds) by connecting it to the task of learning the class {\cal C} . In particular, if the class%DIFDELCMD < {\cal %%% C admits an efficient agnostic learner, then we can learn such a metric multifair hypothesis efficiently .
Revised:  We study the sample complexity and time complexity of learning a metric multifair hypothesis (providing rather tight upper and lower bounds) by connecting it to the task of learning the class {\cal C} . In particular, if the class%DIFDELCMD < {\cal %%% admits an efficient agnostic learner, then we can learn such a metric multifair hypothesis efficiently .
Edit intent: fluency
Original:  We study the sample complexity and time complexity of learning a metric multifair hypothesis (providing rather tight upper and lower bounds) by connecting it to the task of learning the class {\cal C} . In particular, if the class%DIFDELCMD < {\cal %%% C admits an efficient agnostic learner, then we can learn such a metric multifair hypothesis efficiently .
Revised:  We study the sample complexity and time complexity of learning a metric multifair hypothesis (providing rather tight upper and lower bounds) by connecting it to the task of learning the class {\cal C} . In particular, if the class%DIFDELCMD < {\cal %%% C .
Edit intent: coherence
Original:  We perform Monte Carlo analysis of minimum Poisson-disk blue noise scatterers in infinite and semi-infinite configurations and show that our reciprocal formulation of correlated transport is more accurate than alternative proposals .
Revised:  We compare predictions of our proposal to Monte Carlo simulation of multiple scattering from negatively-correlated suspensions of monodispersive hard spheres in bounded two-dimensional domains and demonstrate improved performance relative to previous work .
Edit intent: clarity
Original:  We also derive new  exact, recriprocal  single-scattering solutions for plane-parallel half-spaces over a variety of non-exponential media types.
Revised:  We also derive new , exact, recriprocal single-scattering solutions for plane-parallel half-spaces over a variety of non-exponential media types.
Edit intent: fluency
Original:  We also derive new  exact, recriprocal  single-scattering solutions for plane-parallel half-spaces over a variety of non-exponential media types.
Revised:  We also derive new exact, recriprocal , single-scattering solutions for plane-parallel half-spaces over a variety of non-exponential media types.
Edit intent: fluency
Original:  We distinguish between the free-path-length distributions between correlated medium particles and the free-path-lengths beginning at locations not correlated to medium particles, such as boundary surfaces, imbedded occlusions and uncorrelated emitters.
Revised:  We distinguish between the free-path-length statistics between correlated medium particles and the free-path-lengths beginning at locations not correlated to medium particles, such as boundary surfaces, imbedded occlusions and uncorrelated emitters.
Edit intent: clarity
Original:  We distinguish between the free-path-length distributions between correlated medium particles and the free-path-lengths beginning at locations not correlated to medium particles, such as boundary surfaces, imbedded occlusions and uncorrelated emitters.
Revised:  We distinguish between the free-path-length distributions between correlated medium particles and the free-path-length statistics beginning at locations not correlated to medium particles, such as boundary surfaces, imbedded occlusions and uncorrelated emitters.
Edit intent: clarity
Original:  We compare predictions of our proposal to Monte Carlo simulation of multiple scattering from negatively-correlated suspensions of monodispersive hard spheres in bounded two-dimensional domains and demonstrate improved performance relative to previous work.
Revised:  We compare predictions of this approach to Monte Carlo simulation of multiple scattering from negatively-correlated suspensions of monodispersive hard spheres in bounded two-dimensional domains and demonstrate improved performance relative to previous work.
Edit intent: clarity
Original:  We distinguish between the free-path-length statistics between correlated medium particles and the free-path-length statistics beginning at locations not correlated to medium particles, such as boundary surfaces, imbedded occlusions and uncorrelated emitters . Reciprocity requires that the uncorrelated free-path distributions are simply the normalized extinction of the correlated free-path distributions.
Revised:  We distinguish between the free-path-length statistics between correlated medium particles and the free-path-length statistics beginning at locations not correlated to medium particles, such as boundary surfaces, inclusions and uncorrelated sources . Reciprocity requires that the uncorrelated free-path distributions are simply the normalized extinction of the correlated free-path distributions.
Edit intent: clarity
Original:  The combination enables an equilibrium imbedding of a previously derived generalized transport equation into bounded domains.
Revised:  The combination leads to an equilibrium imbedding of a previously derived generalized transport equation into bounded domains.
Edit intent: clarity
Original:  Reciprocity requires that the uncorrelated free-path distributions are simply the normalized extinction of the correlated free-path distributions.
Revised:  Reciprocity requires that the uncorrelated free-path distributions are simply the normalized transmittance of the correlated free-path distributions.
Edit intent: clarity
Original:  We also derive new, exact, recriprocal , single-scattering solutions for plane-parallel half-spaces over a variety of non-exponential media types.
Revised:  We also derive new, exact, reciprocal , single-scattering solutions for plane-parallel half-spaces over a variety of non-exponential media types.
Edit intent: fluency
Original:  Our system is implemented over TensorFlow and requires no changes in the model or developer inputs.
Revised:  Our system is implemented over TensorFlow and requires no changes to the model or developer inputs.
Edit intent: fluency
Original:  Our system improves the throughput by up to 82\% in inference and 20\% in training, while also reducing\\%DIF > in inference and 19.
Revised:  TicTac improves the throughput by up to 82\% in inference and 20\% in training, while also reducing\\%DIF > in inference and 19.
Edit intent: clarity
Original:  We show that hydrodynamics tends to stabilize spherical droplets but that droplet division occurs for sufficiently strong chemical driving, sufficiently large droplet viscosity or sufficiently small surface tension.
Revised:  We show that hydrodynamics tends to stabilize spherical shapes but that droplet division occurs for sufficiently strong chemical driving, sufficiently large droplet viscosity or sufficiently small surface tension.
Edit intent: clarity
Original:  Our work suggests that chemically driven droplet division could be observable in soft colloidal systems with low surface tension such as RNA-protein dropletsin vitro or inside cells .
Revised:  Our work suggests that chemically driven droplet division could be observable in chemically active colloidal droplets .
Edit intent: clarity
Original:  We identify nearly 16 million individual authors from all publications covered in the Web of Science for the 2008-2015 period.
Revised:  We identify nearly 16 million individual authors from publications covered in the Web of Science for the 2008-2015 period.
Edit intent: clarity
Original:  Based on the information provided across individuals' publication record , we propose a general classification by which to analyze scientific mobility via institutional affiliation changes.
Revised:  Based on the information provided across individuals' publication records , we propose a general classification by which to analyze scientific mobility via institutional affiliation changes.
Edit intent: fluency
Original:  Based on the information provided across individuals' publication record , we propose a general classification by which to analyze scientific mobility via institutional affiliation changes.
Revised:  Based on the information provided across individuals' publication record , we propose a general classification for analyzing scientific mobility using institutional affiliation changes.
Edit intent: clarity
Original:  We distinguish between migrants - those who have ruptures with their country of origin - and travelers - those who gain additional affiliations while maintaining affiliation with the country of origin.
Revised:  We distinguish between migrants--authors who have ruptures with their country of origin - and travelers - those who gain additional affiliations while maintaining affiliation with the country of origin.
Edit intent: clarity
Original:  We distinguish between migrants - those who have ruptures with their country of origin - and travelers - those who gain additional affiliations while maintaining affiliation with the country of origin.
Revised:  We distinguish between migrants - those who have ruptures with their country of origin--and travelers--authors who gain additional affiliations while maintaining affiliation with the country of origin.
Edit intent: clarity
Original:  We distinguish between migrants - those who have ruptures with their country of origin - and travelers - those who gain additional affiliations while maintaining affiliation with the country of origin.
Revised:  We distinguish between migrants - those who have ruptures with their country of origin - and travelers - those who gain additional affiliations while maintaining affiliation with their country of origin.
Edit intent: fluency