wanyu/IteraTeR_v2 huggingface dataset:
Original:  Given these limitations, we developed and tested PlexusNet for histologic evaluation using a single GPU by a batch dimension of 16x512x512x3 .
Revised:  Given these limitations, we introduced a novel architecture (termed PlexusNet) .
Edit intent: clarity
Original:  The dice coefficient (DSC) was evaluated for each model . PlexusNet delivered comparable classification performance ( DSC at patch level: 0.89) for H E whole-slice images in distinguishing prostate cancer from normal tissues.
Revised:  The dice coefficient (DSC) was evaluated for each model . PlexusNet delivered comparable classification performance ( E whole-slice images in distinguishing prostate cancer from normal tissues.
Edit intent: clarity
Original:  As conclusion, PlexusNet represents a novel model architecture for histological image analysis that achieves classification performance comparable to the base models while providing orders-of-magnitude memory savings .
Revised:  As conclusion, PlexusNet represents a novel model architecture for histological image analysis that achieves classification performance comparable to other models while providing orders-of-magnitude memory savings .
Edit intent: clarity
Original:  As conclusion, PlexusNet represents a novel model architecture for histological image analysis that achieves classification performance comparable to the base models while providing orders-of-magnitude memory savings .
Revised:  As conclusion, PlexusNet represents a novel model architecture for histological image analysis that achieves classification performance comparable to the base models while providing orders-of-magnitude parameter reduction .
Edit intent: clarity
Original:  More precisely, only a partial subset of the source domain is assumed to be in correspondence with a subset of the target domain .
Revised:  More precisely, only a partial subset of the source surface is assumed to be in correspondence with a subset of the target domain .
Edit intent: clarity
Original:  More precisely, only a partial subset of the source domain is assumed to be in correspondence with a subset of the target domain .
Revised:  More precisely, only a partial subset of the source domain is assumed to be in correspondence with a subset of the target surface .
Edit intent: clarity
Original:  This problem is challenging as the corresponding regions on each surfaces and a meaningful bijection between them have to be simultaneously determined.
Revised:  This problem is challenging as the corresponding regions on each surface and a meaningful bijection between them have to be simultaneously determined.
Edit intent: fluency
Original:  In this paper, we propose a variational model to solve the inconsistent surface registration problem by minimizing mapping distortions.
Revised:  In this paper, we propose a variational model to solve the ISR problem by minimizing mapping distortions.
Edit intent: clarity
Original:  Registration is then guided by feature landmarks and/or intensities, such as curvatures, defined on each surfaces .
Revised:  Registration is then guided by feature landmarks and/or intensities, such as curvatures, defined on each surface .
Edit intent: fluency
Original:  In many applications, a sentinel character  is added to mark the end of the string, and thus the BWT of a string ending with  contains exactly one character.
Revised:  In many applications, a sentinel character dollar is added to mark the end of the string, and thus the BWT of a string ending with contains exactly one character.
Edit intent: fluency
Original:  We ask, given a string w,  in which positions, if any, can the -character be inserted to turn w into the BWT image of a word ending with the sentinel character .
Revised:  We ask, given a string w, we ask in which positions, if any, can the -character be inserted to turn w into the BWT image of a word ending with the sentinel character .
Edit intent: fluency
Original:  We ask, given a string w,  in which positions, if any, can the -character be inserted to turn w into the BWT image of a word ending with the sentinel character .
Revised:  We ask, given a string w, in which positions, if any, the dollar-character can be inserted to turn w into the BWT image of a word ending with the sentinel character .
Edit intent: fluency
Original:  We also give a combinatorial characterization of such positions and develop bounds on their number and value.  ]
Revised:  We also give a combinatorial characterization of such positions and develop bounds on their number and value. ].
Edit intent: fluency
Original:  While most of the existing methods deal with edges as pairwise relations , only a few studies have been proposed for hyper-networks to capture more complicated tuplewise relationships among multiple nodes.
Revised:  While most of the existing methods deal with edges as pairwise relationships , only a few studies have been proposed for hyper-networks to capture more complicated tuplewise relationships among multiple nodes.
Edit intent: fluency
Original:  Modern TSP heuristics are very successful at identifying the most promising edges to be used in k-opt moves, and experiments show that very good global solutions can already be reached using only the top-O(1) most promising edges incident to each vertex.
Revised:  Modern TSP heuristics show that very good global solutions can already be reached using only the top-O(1) most promising edges incident to each vertex.
Edit intent: coherence
Original:  We show that the aforementioned ETH lower bound also holds for graphs of maximum degree three, but that in bounded-degree graphs the best improving k-move can be found in time O(n^{ (23 /135+ \epsilon_k) k  }).
Revised:  We show that the aforementioned ETH lower bound also holds for graphs of maximum degree three, but that in bounded-degree graphs the best improving k-move can be found in time O(n^{ (23 /135+ \epsilon_k) k ) }).
Edit intent: fluency
Original:  After a possible semi-discretization in space, the class of problems under consideration are modeled by a system of ordinary differential equations where the right-hand side is a summation of two component functions, each corresponding to a given set of physical processes.
Revised:  After a possible semi-discretization in space, the class of problems under consideration is modeled by a system of ordinary differential equations where the right-hand side is a summation of two component functions, each corresponding to a given set of physical processes.
Edit intent: fluency
Original: Urban spatial networksare complex systems with interdependent roles of neighborhoods and methods of transportation between them .
Revised: In urban spatial networks, there is an interdependency between neighborhood roles and the transportation methods between neighborhoods .
Edit intent: clarity
Original:  In this paper, we classify docking stations in bicycle-sharing networks to gain insight into the spatial delineations of three major United States cities from human mobility dynamics .
Revised:  In this paper, we classify docking stations in bicycle-sharing networks to gain insight into the human mobility patterns of three major United States cities from human mobility dynamics .
Edit intent: clarity
Original:  In this paper, we classify docking stations in bicycle-sharing networks to gain insight into the spatial delineations of three major United States cities from human mobility dynamics .
Revised:  In this paper, we classify docking stations in bicycle-sharing networks to gain insight into the spatial delineations of three major United States cities .
Edit intent: clarity
Original:  We propose novel time-dependent stochastic block models  , with degree-heterogeneous blocks and either mixed or discrete block membership, which  (1) detect the roles served by bicycle-sharing docking stations and (2) describe the traffic within and between blocks of stations over the course of a day.
Revised:  We propose novel time-dependent stochastic block models (SBMs) , with degree-heterogeneous blocks and either mixed or discrete block membership, which (1) detect the roles served by bicycle-sharing docking stations and (2) describe the traffic within and between blocks of stations over the course of a day.
Edit intent: clarity
Original:  We propose novel time-dependent stochastic block models  , with degree-heterogeneous blocks and either mixed or discrete block membership, which  (1) detect the roles served by bicycle-sharing docking stations and (2) describe the traffic within and between blocks of stations over the course of a day.
Revised:  We propose novel time-dependent stochastic block models , with degree-heterogeneous blocks and either mixed or discrete block membership, which (1) detect the roles of bicycle-sharing docking stations and (2) describe the traffic within and between blocks of stations over the course of a day.
Edit intent: clarity
Original:  They successfully uncover work and homedistricts, and they also reveal dynamics of such districts that are particular to each city.
Revised:  They successfully uncover work , home, and other districts; they also reveal dynamics of such districts that are particular to each city.
Edit intent: clarity
Original:  They successfully uncover work and homedistricts, and they also reveal dynamics of such districts that are particular to each city.
Revised:  They successfully uncover work and homedistricts, and they also reveal activity patterns in these districts that are particular to each city.
Edit intent: clarity
Original:  In this paper, we propose realistic ZDA variations where the attacker is aware of this topology-switching strategy, and hence employs the following policies to avoid detection: (i) "pause( update and resume ) attack" before (after) topology switching to evade detection ;
Revised:  In this paper, we propose realistic ZDA variations where the attacker is aware of this topology-switching strategy, and hence employs the following policies to avoid detection: (i) pause, update and resume ) attack" before (after) topology switching to evade detection ;
Edit intent: fluency
Original:  In this paper, we propose realistic ZDA variations where the attacker is aware of this topology-switching strategy, and hence employs the following policies to avoid detection: (i) "pause( update and resume ) attack" before (after) topology switching to evade detection ;
Revised:  In this paper, we propose realistic ZDA variations where the attacker is aware of this topology-switching strategy, and hence employs the following policies to avoid detection: (i) "pause( update and resume ZDA according to the knowledge of switching topologies ;
Edit intent: clarity
Original:   Numerical simulations demonstrate the effectiveness of the proposed methods and algorithm for different scenarios.
Revised:  Numerical simulations demonstrate the effectiveness of the proposed methods for different scenarios.
Edit intent: clarity
Original: A point-of-interest (POI) recommendation system plays an important role in location-based services (LBS) because it can help people to explore new locations and promote advertisers to launch ads to target users.
Revised: A point-of-interest (POI) recommendation system performs an important role in location-based services (LBS) because it can help people to explore new locations and promote advertisers to launch ads to target users.
Edit intent: clarity
Original: A point-of-interest (POI) recommendation system plays an important role in location-based services (LBS) because it can help people to explore new locations and promote advertisers to launch ads to target users.
Revised: A point-of-interest (POI) recommendation system plays an important role in location-based services because it can help people to explore new locations and promote advertisers to launch ads to target users.
Edit intent: clarity
Original:  SPIREL employs two types of sources from users' check-in history  : a transition pattern between two POIs and visiting counts of POIs.
Revised:  SPIREL employs two types of information derived from the check-in history : a transition pattern between two POIs and visiting counts of POIs.
Edit intent: clarity
Original:  SPIREL employs two types of sources from users' check-in history  : a transition pattern between two POIs and visiting counts of POIs.
Revised:  SPIREL employs two types of sources from users' check-in history : a transition pattern between two POIs and the visit counts of POIs.
Edit intent: fluency
Original:  We further propose two privacy-preserving mechanisms to train our recommendation system . Experiments using two public datasets demonstrate that SPIREL achieves better POI recommendation quality while preserving stronger privacy for check-in history .
Revised:  We further propose two privacy-preserving mechanisms to train our recommendation system . Experiments using two public datasets demonstrate that SPIREL achieves better POI recommendation quality while accomplishing stronger privacy protection .
Edit intent: clarity
Original: The research in the emerging space industry is becoming more and more attractive , given the increasing number of space-related applications.
Revised: Given the increasing number of space-related applications, research in the emerging space industry is becoming more and more attractive , given the increasing number of space-related applications.
Edit intent: coherence
Original:  One primary entity of current space research is the design of miniaturized satellites, known as CubeSats, due to their numerous applications and low design and deployment cost.
Revised:  One primary entity of current space research is the design of miniaturized satellites, known as CubeSats, which are enticing because of their numerous applications and low design and deployment cost.
Edit intent: coherence
Original:  One primary entity of current space research is the design of miniaturized satellites, known as CubeSats, due to their numerous applications and low design and deployment cost.
Revised:  One primary entity of current space research is the design of miniaturized satellites, known as CubeSats, due to their numerous applications and low design-and-deployment cost.
Edit intent: fluency
Original:  The new paradigm of connected space through CubeSats enables a wide range of applications  such as Earth remote sensing, space exploration, and rural connectivity.
Revised:  The new paradigm of connected space through CubeSats makes possible a wide range of applications such as Earth remote sensing, space exploration, and rural connectivity.
Edit intent: clarity
Original:  The new paradigm of connected space through CubeSats enables a wide range of applications  such as Earth remote sensing, space exploration, and rural connectivity.
Revised:  The new paradigm of connected space through CubeSats enables a wide range of applications , such as Earth remote sensing, space exploration, and rural connectivity.
Edit intent: fluency
Original:  CubeSats further provide a complimentary connectivity solution to the pervasive Internet of things (IoT) networks, leading to a globally connected cyber-physical system.
Revised:  CubeSats further provide a complementary connectivity solution to the pervasive Internet of things (IoT) networks, leading to a globally connected cyber-physical system.
Edit intent: fluency
Original:  CubeSats further provide a complimentary connectivity solution to the pervasive Internet of things (IoT) networks, leading to a globally connected cyber-physical system.
Revised:  CubeSats further provide a complimentary connectivity solution to the pervasive Internet of Things (IoT) networks, leading to a globally connected cyber-physical system.
Edit intent: fluency
Original:  This paper presents a holistic overview of different aspects of CubeSat missions , and provides a thorough review on the topic , both from academic and industrial perspectives.
Revised:  This paper presents a holistic overview of various aspects of CubeSat missions , and provides a thorough review on the topic , both from academic and industrial perspectives.
Edit intent: fluency
Original:  This paper presents a holistic overview of different aspects of CubeSat missions , and provides a thorough review on the topic , both from academic and industrial perspectives.
Revised:  This paper presents a holistic overview of different aspects of CubeSat missions and provides a thorough review on the topic , both from academic and industrial perspectives.
Edit intent: fluency
Original:  This paper presents a holistic overview of different aspects of CubeSat missions , and provides a thorough review on the topic , both from academic and industrial perspectives.
Revised:  This paper presents a holistic overview of different aspects of CubeSat missions , and provides a thorough review of the topic from both academic and industrial perspectives.
Edit intent: fluency
Original:  We further present the recent advances in the area of CubeSats communications with an emphasis on constellation and coverage issues, channel modeling, modulation and coding, and networking.
Revised:  We further present recent advances in the area of CubeSats communications with an emphasis on constellation and coverage issues, channel modeling, modulation and coding, and networking.
Edit intent: fluency
Original:  We further present the recent advances in the area of CubeSats communications with an emphasis on constellation and coverage issues, channel modeling, modulation and coding, and networking.
Revised:  We further present the recent advances in the area of CubeSat communications, with an emphasis on constellation and coverage issues, channel modeling, modulation and coding, and networking.
Edit intent: fluency
Original:  We further present the recent advances in the area of CubeSats communications with an emphasis on constellation and coverage issues, channel modeling, modulation and coding, and networking.
Revised:  We further present the recent advances in the area of CubeSats communications with an emphasis on constellation-and-coverage issues, channel modeling, modulation and coding, and networking.
Edit intent: fluency
Original:  The paper finally identifies several future research directions on CubeSats communications, namely Internet of space things, low power long range networks, machine learning for resource allocation in CubeSats, etc .
Revised:  Finally, we identify several future research directions on CubeSats communications, namely Internet of space things, low power long range networks, machine learning for resource allocation in CubeSats, etc .
Edit intent: clarity
Original:  The paper finally identifies several future research directions on CubeSats communications, namely Internet of space things, low power long range networks, machine learning for resource allocation in CubeSats, etc .
Revised:  The paper finally identifies several future research directions for CubeSat communications, including Internet of space things, low power long range networks, machine learning for resource allocation in CubeSats, etc .
Edit intent: clarity
Original:  The paper finally identifies several future research directions on CubeSats communications, namely Internet of space things, low power long range networks, machine learning for resource allocation in CubeSats, etc .
Revised:  The paper finally identifies several future research directions on CubeSats communications, namely Internet of space things, low-power long-range networks, and machine learning for resource allocation in CubeSats, etc .
Edit intent: fluency
Original:  The paper finally identifies several future research directions on CubeSats communications, namely Internet of space things, low power long range networks, machine learning for resource allocation in CubeSats, etc .
Revised:  The paper finally identifies several future research directions on CubeSats communications, namely Internet of space things, low power long range networks, machine learning for CubeSat resource allocation .
Edit intent: clarity
Original:  Moreover, to deal with challenges of computation on such unconventional substrates, several lines of potential solutions are presented based on advances in other computational approaches in machine learning. keywords : Analog Microchips, FPGA, Memristors, Neuromorphic Architectures, Reservoir Computing
Revised:  Moreover, to deal with challenges of computation on such unconventional substrates, several lines of potential solutions are presented based on advances in other computational approaches in machine learning. Keywords : Analog Microchips, FPGA, Memristors, Neuromorphic Architectures, Reservoir Computing
Edit intent: fluency
Original:  Our argument is based on the expander mixing lemma , which entails that the results are strongest for Ramanujan graphs, which asymptotically maximize the spectral gap.
Revised:  Our argument is based on the Expander Mixing Lemma , which entails that the results are strongest for Ramanujan graphs, which asymptotically maximize the spectral gap.
Edit intent: fluency
Original: With the advent of increasingly larger graphs, we need to find a quick and reliable method to measure the distance between a pair of nodes  .
Revised: With the advent of increasingly large graphs, we need to find a quick and reliable method to measure the distance between a pair of nodes .
Edit intent: fluency
Original:  There are already algorithms for measuring this distance using the concept of random walk on graphs.
Edit intent: coherence
Original:  However, the implementation of that algorithm is expensive due to the use of Monte Carlo simulations  .
Revised:  However, most of the implementations of random walk algorithms are computationally expensive due to the use of Monte Carlo simulations .
Edit intent: clarity
Original:  Here, we propose an alternative measure of the distance between any two nodes that are connected to each other via a path on the graph, a distance which we call the hitting time of random walks on graph .
Revised:  Here, we propose an alternative measure of the distance between any pair of nodes on a connected and undirected graph using the notion of hitting time for a random walk .
Edit intent: clarity
Original:  We also give an analytical solution to the hitting time  of a random walk on a connected and undirected graph.
Revised:  We also give an analytical solution to the hitting time of a random walk on a graph.
Edit intent: clarity
Original:  This analytical solution , which can be conveniently implemented using numerical linear algebra packages, is more time-saving and more accurate than the Monte Carlo simulation results .
Revised:  This analytical method , which can be conveniently implemented using numerical linear algebra packages, is more time-saving and more accurate than the Monte Carlo simulation results .
Edit intent: clarity
Original:  This analytical solution , which can be conveniently implemented using numerical linear algebra packages, is more time-saving and more accurate than the Monte Carlo simulation results .
Revised:  This analytical solution , which can be conveniently implemented using numerical linear algebra packages, is more time-saving to run and yields more accurate results than that obtained via Monte Carlo simulations .
Edit intent: clarity
Original: We consider certain analytical features of the "Kill the Winner" model which is a stochastic model that can explain among other things competition among species and simultaneous predation on the competing species  .
Revised: We consider certain analytical features of a stochastic model that can explain among other things competition among species and simultaneous predation on the competing species .
Edit intent: coherence
Original:  The model equations are shown to admit a Jacobi Last Multiplier which in turns allows for the construction of a Lagrangian.
Revised:  The model equations are shown to admit a Jacobi Last Multiplier which in turn allows for the construction of a Lagrangian.
Edit intent: fluency
Original:  Many solutions exist, but often suffer from problems such as high computational cost or causing false negative or false positive detections.
Revised:  Many collision detection approaches exist, but often suffer from problems such as high computational cost or causing false negative or false positive detections.
Edit intent: clarity