wanyu/IteraTeR_v2 huggingface dataset:
Original:  Sensing the dynamic molecular spectrum, i.e., multiplexed detection of the concentration of multiple ligand types of similar properties co-existing in the MC channel, provides opportunities for eliminating molecular interference resulting from external sources in crowded physiological environments, and multi-user interference (MUI)
Revised:  Sensing the dynamic molecular spectrum, i.e., multiplexed detection of the concentration of multiple ligand types of similar properties co-existing in the MC channel, provides opportunities for eliminating interference of external molecular sources and multi-user interference (MUI)
Edit intent: clarity
Original:  in nanonetworks, and adopting cognitive radio techniques for medium access in MC . In this paper, we develop a practical and low-complexity spectrum sensing method that can simultaneously estimate the individual concentrations of multiple types of ligands with single type of receptors by exploiting the amount of time the receptors stay bound and unbound in ligand-receptor binding reaction .
Revised:  , and developing new multiple access techniques for MC nanonetworks . In this paper, we develop a practical and low-complexity spectrum sensing method that can simultaneously estimate the individual concentrations of multiple types of ligands with single type of receptors by exploiting the amount of time the receptors stay bound and unbound in ligand-receptor binding reaction .
Edit intent: clarity
Original:  in nanonetworks, and adopting cognitive radio techniques for medium access in MC . In this paper, we develop a practical and low-complexity spectrum sensing method that can simultaneously estimate the individual concentrations of multiple types of ligands with single type of receptors by exploiting the amount of time the receptors stay bound and unbound in ligand-receptor binding reaction .
Revised:  in nanonetworks, and adopting cognitive radio techniques for medium access in MC . In this paper, we investigate channel sensing methods that use only a single type of receptors by exploiting the amount of time the receptors stay bound and unbound in ligand-receptor binding reaction .
Edit intent: clarity
Original:  in nanonetworks, and adopting cognitive radio techniques for medium access in MC . In this paper, we develop a practical and low-complexity spectrum sensing method that can simultaneously estimate the individual concentrations of multiple types of ligands with single type of receptors by exploiting the amount of time the receptors stay bound and unbound in ligand-receptor binding reaction .
Revised:  in nanonetworks, and adopting cognitive radio techniques for medium access in MC . In this paper, we develop a practical and low-complexity spectrum sensing method that can simultaneously estimate the individual concentrations of multiple types of ligands with single type of receptors and exploit the amount of time the receptors stay bound and unbound in ligand-receptor binding reaction .
Edit intent: coherence
Original:  in nanonetworks, and adopting cognitive radio techniques for medium access in MC . In this paper, we develop a practical and low-complexity spectrum sensing method that can simultaneously estimate the individual concentrations of multiple types of ligands with single type of receptors by exploiting the amount of time the receptors stay bound and unbound in ligand-receptor binding reaction .
Revised:  in nanonetworks, and adopting cognitive radio techniques for medium access in MC . In this paper, we develop a practical and low-complexity spectrum sensing method that can simultaneously estimate the individual concentrations of multiple types of ligands with single type of receptors by exploiting the amount of time receptors stay bound and unbound in ligand-receptor binding reaction .
Edit intent: fluency
Original:  in nanonetworks, and adopting cognitive radio techniques for medium access in MC . In this paper, we develop a practical and low-complexity spectrum sensing method that can simultaneously estimate the individual concentrations of multiple types of ligands with single type of receptors by exploiting the amount of time the receptors stay bound and unbound in ligand-receptor binding reaction .
Revised:  in nanonetworks, and adopting cognitive radio techniques for medium access in MC . In this paper, we develop a practical and low-complexity spectrum sensing method that can simultaneously estimate the individual concentrations of multiple types of ligands with single type of receptors by exploiting the amount of time the receptors stay bound and unbound during ligand-receptor binding reaction .
Edit intent: clarity
Original:  We analyze its performance in terms of normalized mean squared error (NMSE) for varying number of co-existing ligand types, number of samples, similarity between ligands, and ligand concentration distribution, and show that it is possible to estimate the concentration of ligands up to 10 different types with an average NMSE far below 10^{-2}.
Revised:  We analyze its performance in terms of normalized mean squared error (NMSE) , and show that they can efficiently estimate the concentration of ligands up to 10 different types with an average NMSE far below 10^{-2}.
Edit intent: clarity
Original:  Additionally, for the transduction of receptor unbound and bound time durations into intracellular molecular signals for further processing, we propose a synthetic receptor design based on modified kinetic proofreading (KPR) scheme . Lastly, we discuss the implementation challenges of the estimator in engineered bacteria with synthetic analog computation tools in living cells.
Revised:  Lastly, we propose a synthetic receptor design based on modified kinetic proofreading (KPR) scheme . Lastly, we discuss the implementation challenges of the estimator in engineered bacteria with synthetic analog computation tools in living cells.
Edit intent: coherence
Original:  Additionally, for the transduction of receptor unbound and bound time durations into intracellular molecular signals for further processing, we propose a synthetic receptor design based on modified kinetic proofreading (KPR) scheme . Lastly, we discuss the implementation challenges of the estimator in engineered bacteria with synthetic analog computation tools in living cells.
Revised:  Additionally, for the transduction of receptor unbound and bound time durations into intracellular molecular signals for further processing, we propose a synthetic receptor design based on modified kinetic proofreading (KPR) scheme to sample the unbound and bound time durations, and a Chemical Reaction Network (CRN) to perform the required computations in synthetic cells.
Edit intent: clarity
Original:   As a byproduct we prove that if planar graphs have bounded queue-number (which is an open problem) , then graphs of Euler genus g have queue-number O(g).
Revised:  As a byproduct we prove that if planar graphs have bounded queue-number , then graphs of Euler genus g have queue-number O(g).
Edit intent: coherence
Original:  We show that ^+_m \sim (d! m)^{1/d} \sim ^-_m almost surely and that W_{T_m} / \ln m converges in probability to 1 - d^{-1};
Revised:  We show that F^+_{T_m \sim (d! m)^{1/d} \sim ^-_m almost surely and that W_{T_m} / \ln m converges in probability to 1 - d^{-1};
Edit intent: clarity
Original: We propose to employ scale spaces of mathematical morphology to hierarchically simplify fracture surfaces of complementarily fitting archaeological fragments.
Revised: We propose to employ scale spaces of mathematical morphology to hierarchically simplify fracture surfaces of complementarity fitting archaeological fragments.
Edit intent: fluency
Original:  This representation preserves contact and is insensitive to different kinds of abrasion affecting the exact complementarity of the original fragments.
Revised:  This representation preserves complementarity and is insensitive to different kinds of abrasion affecting the exact complementarity of the original fragments.
Edit intent: clarity
Original:  This representation preserves contact and is insensitive to different kinds of abrasion affecting the exact complementarity of the original fragments.
Revised:  This representation preserves contact and is insensitive to different kinds of abrasion affecting the exact fitting of the original fragments.
Edit intent: clarity
Original: In today's blockchain system, designing a secure and high throughput  on par with  centralized payment system is a difficulty task.
Revised: In today's blockchain system, designing a secure and high throughput on par with a centralized payment system is a difficulty task.
Edit intent: fluency
Original: In today's blockchain system, designing a secure and high throughput  on par with  centralized payment system is a difficulty task.
Revised: In today's blockchain system, designing a secure and high throughput on par with centralized payment system is a difficult task.
Edit intent: fluency
Original:  Sharding is one of the most worth expecting technologies to improve the system throughput when maintain high security level.
Revised:  Sharding is one of the most worthwhile emerging technologies for improving the system throughput when maintain high security level.
Edit intent: clarity
Original:  Sharding is one of the most worth expecting technologies to improve the system throughput when maintain high security level.
Revised:  Sharding is one of the most worth expecting technologies to improve the system throughput while maintain high security level.
Edit intent: clarity
Original:  However, the previous works have two main limitations: Firstly, the throughput of their random-based sharding system is not high enough due to not leveraging the heterogeneity among validators.
Revised:  However, previous sharding related designs have two main limitations: Firstly, the throughput of their random-based sharding system is not high enough due to not leveraging the heterogeneity among validators.
Edit intent: clarity
Original:  However, the previous works have two main limitations: Firstly, the throughput of their random-based sharding system is not high enough due to not leveraging the heterogeneity among validators.
Revised:  However, the previous works have two main limitations: Firstly, the throughput of their random-based sharding system is not high enough as they did not leverage the heterogeneity among validators.
Edit intent: clarity
Original:  Secondly, the incentive mechanism can be a huge overhead on their system without an appropriate scheme.
Revised:  Secondly, to design an incentive mechanism to promote cooperation could incur a huge overhead on their system without an appropriate scheme.
Edit intent: clarity
Original:  We propose RepChain, a reputation-based secure , high incentive and fast blockchain system via sharding  . RepChain utilizes reputation to explicitly characterize the heterogeneity among the validators and lay the foundation for the incentive mechanism.
Revised:  We propose RepChain, a reputation-based secure and fast blockchain system via sharding . RepChain utilizes reputation to explicitly characterize the heterogeneity among the validators and lay the foundation for the incentive mechanism.
Edit intent: clarity
Original:  We novelly propose the double-chain architecture that including transaction chain and reputation chain.
Revised:  We propose a new double-chain architecture that including transaction chain and reputation chain.
Edit intent: clarity
Original:  We novelly propose the double-chain architecture that including transaction chain and reputation chain.
Revised:  We novelly propose the double-chain architecture which includes transaction chain and reputation chain.
Edit intent: fluency
Original:  For transaction chain, a Raft-based Byzantine fault tolerant synchronous consensus with high resiliency and high throughput has been presented.
Revised:  For transaction chain, a Raft-based synchronous consensus that can achieve high throughput has been presented.
Edit intent: clarity
Original:  For reputation chain, the  collective signing has been utilized to achieve consensus on the reputation score and support the high throughput transaction chain with moderate generation speed.
Revised:  For reputation chain, the collective signing has been utilized to achieve a consensus on both reputation score and support the high throughput transaction chain with moderate generation speed.
Edit intent: clarity
Original:  Moreover, we propose a reputation based sharding and leader selection scheme.
Revised:  Moreover, we propose a reputation-based sharding and leader selection scheme.
Edit intent: fluency
Original:  Further more , we implement and evaluate RepChain on  Amazon Web Service platform.
Revised:  Furthermore , we implement and evaluate RepChain on Amazon Web Service platform.
Edit intent: coherence
Original:  Further more , we implement and evaluate RepChain on  Amazon Web Service platform.
Revised:  Further more , we implement and evaluate RepChain on the Amazon Web Service platform.
Edit intent: fluency
Original:  We reformulate the ad-hoc retrieval problem as a document retrieval of their fusion graph , which we propose as a new unified representation model capable of merging multiple ranks and expressing inter-relationships of retrieval results automatically.
Revised:  We reformulate the ad-hoc retrieval problem as a document retrieval based on fusion graphs , which we propose as a new unified representation model capable of merging multiple ranks and expressing inter-relationships of retrieval results automatically.
Edit intent: clarity
Original:  Another contribution is that our graph-based aggregation formulation, unlike existing approaches, allows for encapsulating contextual information encoded from multiple ranks, which can be directly used for ranking, without further computations and processing steps over the graphs.
Revised:  Another contribution is that our graph-based aggregation formulation, unlike existing approaches, allows for encapsulating contextual information encoded from multiple ranks, which can be directly used for ranking, without further computations and post-processing steps over the graphs.
Edit intent: clarity
Original:  Performed experiments demonstrate that our method reaches top performance, yielding better effectiveness scores than state-of-the-art baseline methods and promoting large gains over the rankers being fused, thus showing the successful capability of the proposal in representing queries based on a unified graph-based model of rank fusions.
Revised:  Performed experiments demonstrate that our method reaches top performance, yielding better effectiveness scores than state-of-the-art baseline methods and promoting large gains over the rankers being fused, thus demonstrating the successful capability of the proposal in representing queries based on a unified graph-based model of rank fusions.
Edit intent: fluency
Original:   We illustrate the subtlety of our reasoning using a spin lock and a CLH lock, and prove soundness .
Revised:  We illustrate the subtlety of our specifications and reasoning on some paradigmatic examples .
Edit intent: clarity
Original: We introduce TaDA Live, a  separation logic for reasoning compositionally about the termination of blocking fine-grained concurrent programs.
Revised: We present TaDA Live, a separation logic for reasoning compositionally about the termination of blocking fine-grained concurrent programs.
Edit intent: clarity
Original:  We illustrate the subtlety of our specifications and reasoning on some paradigmatic examples .
Revised:  We illustrate the subtlety of our specifications and reasoning is illustrated using several case studies .
Edit intent: clarity
Original: The advent of miniaturized biologging devices has provided ecologists with unparalleled opportunities to record animal movement across scales, and led to the collection of ever-increasing quantities of tracking data.
Revised: The advent of miniaturized biologging devices has provided ecologists with unprecedented opportunities to record animal movement across scales, and led to the collection of ever-increasing quantities of tracking data.
Edit intent: fluency
Original:  In parallel, sophisticated tools  to process, visualize and analyze tracking data have been developed in abundance.
Revised:  In parallel, sophisticated tools have been developed to process, visualize and analyze tracking data have been developed in abundance.
Edit intent: fluency
Original:  Finally, we provide recommendations for users to choose packages, and for developers to maximize  usefulness of their contribution and strengthen the links between the programming community.
Revised:  Finally, we provide recommendations for users when choosing packages, and for developers to maximize usefulness of their contribution and strengthen the links between the programming community.
Edit intent: clarity
Original:  Finally, we provide recommendations for users to choose packages, and for developers to maximize  usefulness of their contribution and strengthen the links between the programming community.
Revised:  Finally, we provide recommendations for users to choose packages, and for developers to maximize the usefulness of their contribution and strengthen the links between the programming community.
Edit intent: fluency
Original:  Finally, we provide recommendations for users to choose packages, and for developers to maximize  usefulness of their contribution and strengthen the links between the programming community.
Revised:  Finally, we provide recommendations for users to choose packages, and for developers to maximize usefulness of their contribution and strengthen the links within the programming community.
Edit intent: clarity
Original:  Their primary goal is apparently to conduct information warfare operations to manipulate public opinionusing accounts disguised as " normal " people.
Revised:  Their primary goal is apparently to conduct information warfare operations to manipulate public opinionusing accounts disguised as " regular " people.
Edit intent: clarity
Original:  More specifically , we analyze the content of the images , as well as the posting activityof the accounts.
Revised:  More specifically , we analyze the content of the images as well as the posting activityof the accounts.
Edit intent: fluency
Original:  Among other things, we find that image posting activity of Russian trolls is tightly coupled with real-world events , and that their targets , as well as the content shared, changed over time.
Revised:  Among other things, we find that image posting activity of Russian trolls coincides with real-world events , and that their targets , as well as the content shared, changed over time.
Edit intent: clarity
Original: We propose a new deep learning algorithm for multiple microtubule (MT) segmentation in time-lapse images using the recurrent attention.
Revised: We propose a new method of instance-level microtubule (MT) segmentation in time-lapse images using the recurrent attention.
Edit intent: clarity
Original: We propose a new deep learning algorithm for multiple microtubule (MT) segmentation in time-lapse images using the recurrent attention.
Revised: We propose a new deep learning algorithm for multiple microtubule (MT) tracking in time-lapse images using the recurrent attention.
Edit intent: clarity
Original: We propose a new deep learning algorithm for multiple microtubule (MT) segmentation in time-lapse images using the recurrent attention.
Revised: We propose a new deep learning algorithm for multiple microtubule (MT) segmentation in time-lapse image series using recurrent attention.
Edit intent: clarity
Original:   Segmentation results from each pair of succeeding frames are being fed into a Hungarian algorithm to assign correspondences among MTs to generate a distinct path  through the frames.
Revised:  Segmentation results from successive frames are used to assign correspondences among MTs to generate a distinct path through the frames.
Edit intent: clarity
Original:   Segmentation results from each pair of succeeding frames are being fed into a Hungarian algorithm to assign correspondences among MTs to generate a distinct path  through the frames.
Revised:  Segmentation results from each pair of succeeding frames are being fed into a Hungarian algorithm to assign correspondences among MTs . This ultimately generates a distinct path through the frames.
Edit intent: clarity
Original:   Segmentation results from each pair of succeeding frames are being fed into a Hungarian algorithm to assign correspondences among MTs to generate a distinct path  through the frames.
Revised:  Segmentation results from each pair of succeeding frames are being fed into a Hungarian algorithm to assign correspondences among MTs to generate a distinct path trajectory for each MT through the frames.
Edit intent: clarity
Original:  Based on the obtained trajectories, we calculate MT velocities.
Revised:  Based on these trajectories, we calculate MT velocities.
Edit intent: clarity
Original:  Based on the obtained trajectories, we calculate MT velocities.
Revised:  Based on the obtained trajectories, we estimate MT velocities.
Edit intent: fluency
Original:  Results of this work is expected to help biologists to characterize MT behaviors as well as their potential interactions.
Edit intent: coherence
Original:  To validate our  technique, we first use the statistics derived from the real time-lapse series of MT gliding assays to produce a large set of simulated data.
Revised:  To validate our proposed technique, we first use the statistics derived from the real time-lapse series of MT gliding assays to produce a large set of simulated data.
Edit intent: clarity
Original:  To validate our  technique, we first use the statistics derived from the real time-lapse series of MT gliding assays to produce a large set of simulated data.
Revised:  To validate our technique, we conduct experiments using real and simulated data. We use statistics derived from the real time-lapse series of MT gliding assays to produce a large set of simulated data.
Edit intent: clarity
Original:  To validate our  technique, we first use the statistics derived from the real time-lapse series of MT gliding assays to produce a large set of simulated data.
Revised:  To validate our technique, we first use the statistics derived from real time-lapse series of MT gliding assays to produce a large set of simulated data.
Edit intent: fluency
Original:  To validate our  technique, we first use the statistics derived from the real time-lapse series of MT gliding assays to produce a large set of simulated data.
Revised:  To validate our technique, we first use the statistics derived from the real time-lapse series of MT gliding assays to simulate realistic MT time-lapse image series in our simulated data.
Edit intent: clarity
Original:  We also demonstrate how the injection of temporal information into our  network can reduce the false negative rates from 67.8\% (baseline) down to 28.7\% (proposed)  .
Revised:  We also demonstrate how the inclusion of temporal information into our network can reduce the false negative rates from 67.8\% (baseline) down to 28.7\% (proposed) .
Edit intent: clarity
Original:  The work of this method is illustrated by calculation of multipoint Pad\'e approximation  a new formula for calculation of this best rational approximation.
Revised:  The work of this method is illustrated by calculation of multipoint Pad\'e approximation by a new formula for calculation of this best rational approximation.
Edit intent: clarity