wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper, we focus on the  connection structure and spatial arrangement of the neurons comprising the somatic neuronal network of this organism to understand the key developmental constraints underlying the designof a simple nervous system .
Revised:  In this paper, we focus on the connection structure and spatial arrangement of the neurons comprising the somatic neuronal network of this organism to understand the key developmental constraints underlying its design .
Edit intent: clarity
Original:  Further, neurons coordinating activity across distinct neuronal clusters are seen to appear early which relates the temporal hierarchy imposed by development to the functional role of neurons.
Revised:  Further, the functional identities of neurons appear to dictate the temporal hierarchy imposed by development to the functional role of neurons.
Edit intent: clarity
Original:  By providing a framework for a mechanistic understanding of how developmentshapes a nervous system, our results complement interpretive analysis of how efficiency and optimality govern its design . Providing crucial insights for understanding principles that may be common across many organisms, our study shows how the trajectory in the developmental landscape constrains the eventual spatial and network topological organization of a nervous system.
Revised:  By providing a framework for a mechanistic understanding of how developmentshapes a nervous system, our results complement interpretive analysis of how efficiency and optimality govern its design . Providing crucial insights into principles that may be common across many organisms, our study shows how the trajectory in the developmental landscape constrains the eventual spatial and network topological organization of a nervous system.
Edit intent: fluency
Original:  This work shows empirically that the sample loss over lines in negative gradient direction is mostly convex  and well suited for one-dimensional parabolic approximations.
Revised:  This work shows empirically that the batch loss over lines in negative gradient direction is mostly convex and well suited for one-dimensional parabolic approximations.
Edit intent: clarity
Original:  Exploiting this parabolic property we introduce a simple and robust line search approach, which performs loss-shape dependent update steps.
Revised:  By exploiting this parabolic property we introduce a simple and robust line search approach, which performs loss-shape dependent update steps.
Edit intent: fluency
Original:  It successfully competes with common and state-of-the-art optimization methods on a large variety of experiments without the need of hand-designed step size schedules.
Revised:  It successfully competes with common optimization methods on a large variety of experiments without the need of hand-designed step size schedules.
Edit intent: clarity
Original:  Our excessive evaluation includes multiple comprehensive hyperparameter grid searches on several datasets and architectures.
Revised:  Our extensive evaluation includes multiple comprehensive hyperparameter grid searches on several datasets and architectures.
Edit intent: clarity
Original:  Finally, we give a general investigation of exact line searches in the context of sample losses and exact losses, including their relation to our line search approach.
Revised:  Finally, we provide a general investigation of exact line searches in the context of sample losses and exact losses, including their relation to our line search approach.
Edit intent: fluency
Original:  Finally, we give a general investigation of exact line searches in the context of sample losses and exact losses, including their relation to our line search approach.
Revised:  Finally, we give a general investigation of exact line searches in the context of batch losses and exact losses, including their relation to our line search approach.
Edit intent: clarity
Original:  In this article, we have presented an overview on a unified framework which is called as the Internet of X-things (X-IoT) that will warrant the convergence of emerging use cases of the Internet of Things everywhere around us, i.e., under the ground and oceans and even in the outer space.
Revised:  In this article, we have presented an overview of a unified framework which is called as the Internet of X-things (X-IoT) that will warrant the convergence of emerging use cases of the Internet of Things everywhere around us, i.e., under the ground and oceans and even in the outer space.
Edit intent: fluency
Original:  The effectiveness of these behaviors was evaluated in a survey in which the participants were asked to associate different swarm behaviors with the fundamental emotions.
Revised:  The effectiveness of these behaviors is evaluated in a survey in which the participants were asked to associate different swarm behaviors with the fundamental emotions.
Edit intent: fluency
Original:  The effectiveness of these behaviors was evaluated in a survey in which the participants were asked to associate different swarm behaviors with the fundamental emotions.
Revised:  The effectiveness of these behaviors was evaluated in a survey in which the participants are asked to associate different swarm behaviors with the fundamental emotions.
Edit intent: fluency
Original:  We propose a set of practical distributed algorithms that operate at each user device and each network cache to maximize the overall network utility.
Revised:  We propose practical distributed algorithms that operate at each user device and each network cache to maximize the overall network utility.
Edit intent: clarity
Original:  In addition to proving that our algorithmsindeed achieve the optimal performance , we implement our algorithms as well as several baseline algorithms on ndnSIM, an ns-3 based Named Data Networking simulator.
Revised:  In addition to proving the optimality of our algorithms , we implement our algorithms as well as several baseline algorithms on ndnSIM, an ns-3 based Named Data Networking simulator.
Edit intent: clarity
Original:  Simulation evaluations demonstrate that our algorithms significantly outperform conventional heuristic solutions for adaptive video streaming .
Revised:  Simulation evaluations demonstrate that our algorithms significantly outperform conventional heuristic solutions .
Edit intent: clarity
Original: As the digital world becomes increasingly intelligent, automated and ubiquitous , the flow of data becomes ever more vital.
Revised: Reliable data connectivity is vital for the ever increasingly intelligent, automated and ubiquitous , the flow of data becomes ever more vital.
Edit intent: clarity
Original:  Mobile wireless networks are the data highways , and in a fully connected, intelligent digital world, they will need to connect everything from people, vehicles, sensors, data, cloud resources and even robotic agents.
Revised:  Mobile wireless networks are the data highways and, in a fully connected, intelligent digital world, they will need to connect everything from people, vehicles, sensors, data, cloud resources and even robotic agents.
Edit intent: fluency
Original:  Mobile wireless networks are the data highways , and in a fully connected, intelligent digital world, they will need to connect everything from people, vehicles, sensors, data, cloud resources and even robotic agents.
Revised:  Mobile wireless networks are the data highways , and in a fully connected, intelligent digital world, will need to connect everything from people, vehicles, sensors, data, cloud resources and even robotic agents.
Edit intent: coherence
Original:  Mobile wireless networks are the data highways , and in a fully connected, intelligent digital world, they will need to connect everything from people, vehicles, sensors, data, cloud resources and even robotic agents.
Revised:  Mobile wireless networks are the data highways , and in a fully connected, intelligent digital world, they will need to connect everything , from people to vehicles, sensors, data, cloud resources and even robotic agents.
Edit intent: fluency
Original:  Fifth generation (5G) wireless networks  that are being released soon offer significant advances  , but may be unable to meet the full connectivity demands of emerging systems.
Revised:  Fifth generation (5G) wireless networks ( that are being released soon offer significant advances , but may be unable to meet the full connectivity demands of emerging systems.
Edit intent: fluency
Original:  In particular we consider  Navier-Stokes flow in a channel on a fast scale that influences the movement of the boundary which undergoes a deformation on a slow scale in time.
Revised:  In particular we consider the Navier-Stokes flow in a channel on a fast scale that influences the movement of the boundary which undergoes a deformation on a slow scale in time.
Edit intent: fluency
Original:  A five-dimensional fractional-order financial system is presented by introducing conformable fractional calculus to the integer-order system.
Revised:  A five-dimensional conformable derivative financial system is presented by introducing conformable fractional calculus to the integer-order system.
Edit intent: clarity
Original:  A discretization scheme is proposed to calculate numerical solutions of conformable fractional-order systems.
Revised:  A discretization scheme is proposed to calculate numerical solutions of conformable derivative systems.
Edit intent: clarity
Original: Several approaches are known in literature to develop numerical schemes that preserve global invariants of a given partial differential equation.
Revised: There are several well-established approaches to constructing finite difference schemes that preserve global invariants of a given partial differential equation.
Edit intent: clarity
Original:  However, few known methods preserve more than one conservation law locally.
Revised:  However, few of these methods preserve more than one conservation law locally.
Edit intent: clarity
Original:  A new numeric-symbolic strategy has been recently applied to find finite difference schemes that preserve more than one local conservation laws of scalar PDEs in Kovalevskaya form.
Revised:  A recently-introduced strategy uses symbolic algebra to construct finite difference schemes that preserve more than one local conservation laws of scalar PDEs in Kovalevskaya form.
Edit intent: clarity
Original:  A new numeric-symbolic strategy has been recently applied to find finite difference schemes that preserve more than one local conservation laws of scalar PDEs in Kovalevskaya form.
Revised:  A new numeric-symbolic strategy has been recently applied to find finite difference schemes that preserve more than one local conservation laws of a given scalar PDE in Kovalevskaya form.
Edit intent: clarity
Original:  In this paper we show how this approach can be successfully applied also to PDEs that are not in Kovalevskaya form and to systems of PDEs , by considering the Benjamin-Bona-Mahony equation and  the nonlinear Schroedinger equation .
Revised:  In this paper , we adapt the new strategy to PDEs that are not in Kovalevskaya form and to systems of PDEs , by considering the Benjamin-Bona-Mahony equation and the nonlinear Schroedinger equation .
Edit intent: clarity
Original:  In this paper we show how this approach can be successfully applied also to PDEs that are not in Kovalevskaya form and to systems of PDEs , by considering the Benjamin-Bona-Mahony equation and  the nonlinear Schroedinger equation .
Revised:  In this paper we show how this approach can be successfully applied also to PDEs that are not in Kovalevskaya form and to systems of PDEs . The Benjamin-Bona-Mahony equation and the nonlinear Schroedinger equation .
Edit intent: coherence
Original:  In this paper we show how this approach can be successfully applied also to PDEs that are not in Kovalevskaya form and to systems of PDEs , by considering the Benjamin-Bona-Mahony equation and  the nonlinear Schroedinger equation .
Revised:  In this paper we show how this approach can be successfully applied also to PDEs that are not in Kovalevskaya form and to systems of PDEs , by considering the Benjamin-Bona-Mahony equation and a system equivalent to the nonlinear Schroedinger equation .
Edit intent: clarity
Original:  Some additional capabilities include being MPI-parallelisable on avariety of different geometries, HDF data output and post processing scripts to visualize data, and an actions class that allows users to create code for analysis after each timestep.
Revised:  Some additional capabilities include being MPI-parallelisable on a variety of different geometries, HDF data output and post processing scripts to visualize data, and an actions class that allows users to create code for analysis after each timestep.
Edit intent: fluency
Original: The "edge of chaos" phase transition in artificial neural networks is of renewed interest in the light of recent evidence for criticality in brain dynamics.
Revised: The "edge of chaos" phase transition in artificial neural networks is of renewed interest in light of recent evidence for criticality in brain dynamics.
Edit intent: fluency
Original:  Statistical mechanics traditionally studied this transition with connectivity k as  control parameter and an exactly balanced excitation/inhibition ratio.
Revised:  Statistical mechanics traditionally studied this transition with connectivity k as the control parameter and an exactly balanced excitation/inhibition ratio.
Edit intent: fluency
Original:  Statistical mechanics traditionally studied this transition with connectivity k as  control parameter and an exactly balanced excitation/inhibition ratio.
Revised:  Statistical mechanics traditionally studied this transition with connectivity k as control parameter and an exactly balanced excitation-inhibition ratio.
Edit intent: clarity
Original:  As a result  we observe an additional critical point for networks with large connectivity, regardless of degree distribution, which exhibits low activity levels that compare well with neuronal brain networks.
Revised:  As a result , we observe an additional critical point for networks with large connectivity, regardless of degree distribution, which exhibits low activity levels that compare well with neuronal brain networks.
Edit intent: fluency
Original: We consider a setting where a Bayesian network has been built over a relational database to represent the joint distribution of data attributes and is used to perform approximate query processing or answer predictive queries.
Revised: We consider a setting where a Bayesian network is built over a relational database to represent the joint distribution of data attributes and is used to perform approximate query processing or answer predictive queries.
Edit intent: clarity
Original:  Decomposing the BRT as a combination of cone beam transforms clarifies the extent of data required for global reconstruction . Generalizing the measurement geometry, we describe the BRT as a linear shift-invariant operator.
Revised:  Decomposing the BRT as a combination of cone beam transforms clarifies the extent of data required for global reconstruction by decomposing the BRT as a linear shift-invariant operator.
Edit intent: coherence
Original:  A configuration of {\rm Puz}(G) is a bijection from the set of vertices of a board graph G to the set of vertices of a pebble graph  G. A move of pebbles is defined as exchanging two pebbles which are adjacent on both a board graph and a pebble graph.
Revised:  A configuration of {\rm Puz}(G) is a bijection from the set of vertices of a board graph to the set of vertices of a pebble graph G. A move of pebbles is defined as exchanging two pebbles which are adjacent on both a board graph and a pebble graph.
Edit intent: fluency
Original:  For a pair of configurations f and g, we say that f is equivalent to g if f can be transformed into g by a sequence of finite moves.
Revised:  For a pair of configurations f and g, we say that f is equivalent to g if f can be transformed into g by a finite sequence of moves.
Edit intent: fluency
Original: Core-periphery structures is an emerging property of a wide range of complex systems and indicate the presence of group of actors in the system with an higher number of connections among them and a lower number of connections with a sparsely connected periphery.
Revised: Core-periphery structure is an emerging property of a wide range of complex systems and indicate the presence of group of actors in the system with an higher number of connections among them and a lower number of connections with a sparsely connected periphery.
Edit intent: fluency
Original:  Here, we present a new method that addresses this problem , and demonstrate that it is accurate even for scenarios in which the previous method fails  .
Revised:  Here, we present a new method which addresses this unphysical build up of particles at the boundaries , and demonstrate that it is accurate even for scenarios in which the previous method fails .
Edit intent: clarity
Original: The concept of ``fake news'' has been referenced and thrown around in news reports so much in recent years that it has become a news topic in its own right.
Revised: The concept of `fake news' has been referenced and thrown around in news reports so much in recent years that it has become a news topic in its own right.
Edit intent: fluency
Original:  Are our beliefs justified, or could we become indoctrinated from living in a ``bubble'' ? If the latter is true, how could we even test the limits of said bubble from within its confines?
Revised:  Are our beliefs justified, or could we become indoctrinated from living in a `bubble' ? If the latter is true, how could we even test the limits of said bubble from within its confines?
Edit intent: fluency
Original:  The data gathered on every intermediate step can be queried and analyzed separately, and most notably we already use the set of hyperlinks to and from the various websites we encounter to paint a sort of ``map'' of that particular slice of the web.
Revised:  The data gathered on every intermediate step can be queried and analyzed separately, and most notably we already use the set of hyperlinks to and from the various websites we encounter to paint a sort of `map' of that particular slice of the web.
Edit intent: fluency
Original:  As multiple modal data representing a common object semantically are complementary , many works focus on learning unified binary codes.
Revised:  As multiple modal data depict a common object semantically are complementary , many works focus on learning unified binary codes.
Edit intent: fluency
Original:  As multiple modal data representing a common object semantically are complementary , many works focus on learning unified binary codes.
Revised:  As multiple modal data representing a common object from multiple perspectives , many works focus on learning unified binary codes.
Edit intent: clarity
Original:  In our framework, Locally Linear Embedding and Locality Preserving Projection are introduced to reconstruct the manifold structure of original space in the Hamming space .
Revised:  In our framework, Locally Linear Embedding and Locality Preserving Projection are introduced to reconstruct the manifold structure of the original space .
Edit intent: coherence
Original:  Besides, The L21-norm regularization are imposed on the projection matrices to further exploit the discriminative features for different modalities simultaneously .
Revised:  Besides, The L21-norm regularization are imposed on the projection matrices to explore the discriminative hashing functions .
Edit intent: clarity
Original:  Extensive experiments are performed to evaluate the proposed method, dubbed Unsupervised Concatenation Hashing (UCH), on the three publicly available datasets and the experimental results show the superior performance of UCH outperforming most of state-of-the-art unsupervised hashing models.
Revised:  Extensive experiments are performed on three public datasets and the experimental results show the superior performance of UCH outperforming most of state-of-the-art unsupervised hashing models.
Edit intent: clarity
Original:  Extensive experiments are performed to evaluate the proposed method, dubbed Unsupervised Concatenation Hashing (UCH), on the three publicly available datasets and the experimental results show the superior performance of UCH outperforming most of state-of-the-art unsupervised hashing models.
Revised:  Extensive experiments are performed to evaluate the proposed method, dubbed Unsupervised Concatenation Hashing (UCH), on the three publicly available datasets and the experimental results show that our method outperforms several classic unsupervised hashing models.
Edit intent: clarity
Original:  Besides, The 2,1-norm constraint is imposed on the projection matrices to explore the discriminative hashing functions . Extensive experiments are performed on three public datasets and the experimental results show that our method outperforms several classic unsupervised hashing models .
Revised:  Besides, the 2,1-norm constraint is imposed on the projection matrices to explore the discriminative hashing functions . Extensive experiments are performed on three public datasets and the experimental results show that our method outperforms several classic unsupervised hashing models .
Edit intent: fluency
Original:  Besides, The 2,1-norm constraint is imposed on the projection matrices to explore the discriminative hashing functions . Extensive experiments are performed on three public datasets and the experimental results show that our method outperforms several classic unsupervised hashing models .
Revised:  Besides, The 2,1-norm constraint is imposed on the projection matrices to explore the discriminative hashing functions . Extensive experiments are performed on three public datasets and the experimental results show that the proposed UMH can achieve superior performance over the state-of-the-art methods .
Edit intent: clarity
Original:  In this paper, we proposed a novel unsupervised hashing learning method to cope with the situation where massive unlabeled data is obtained easily for the era of big data.
Revised:  In this paper, we propose a novel unsupervised hashing learning method to cope with the situation where massive unlabeled data is obtained easily for the era of big data.
Edit intent: fluency
Original:  Our method aims to learn the robust hashing functions by solving how to directly preserve the local manifold structure by hash codes .
Revised:  Our method aims to learn the robust hashing functions by solving how to directly preserve the manifold structure by hash codes .
Edit intent: clarity
Original:  Our method aims to learn the robust hashing functions by solving how to directly preserve the local manifold structure by hash codes .
Revised:  Our method aims to learn the robust hashing functions by solving how to directly preserve the local manifold structure by hashing .
Edit intent: clarity
Original:  To address this problem, both the local semantic structure in textual space and the  geometric structure in the visual space is explored to learn compact hash codes . Besides, the \ell_{2,1 constraint is imposed on the projection matrices to select relevant and discriminative features from different modal spaces simultaneously .
Revised:  To address this problem, both the semantic correlation in textual space and the geometric structure in the visual space is explored to learn compact hash codes . Besides, the \ell_{2,1 constraint is imposed on the projection matrices to select relevant and discriminative features from different modal spaces simultaneously .
Edit intent: clarity