wanyu/IteraTeR_v2 huggingface dataset:
Original: Neural networks with tightly balanced excitatory and inhibitory coupling show high computational performance.
Revised: Neural networks with equal excitatory and inhibitory coupling show high computational performance.
Edit intent: clarity
Original: Neural networks with tightly balanced excitatory and inhibitory coupling show high computational performance.
Revised: Neural networks with tightly balanced excitatory and inhibitory feedback show high computational performance.
Edit intent: clarity
Original:  Yet,  macaque motor cortex shows very different dynamics with weak fluctuations on macroscopic scales.
Revised:  Yet, in macaque motor cortex shows very different dynamics with weak fluctuations on macroscopic scales.
Edit intent: fluency
Original:  Yet,  macaque motor cortex shows very different dynamics with weak fluctuations on macroscopic scales.
Revised:  Yet, macaque motor cortex we observe very different dynamics with weak fluctuations on macroscopic scales.
Edit intent: clarity
Original:  Here we show the opposite: The large dispersion of correlations across neurons is a signature of a rich dynamical repertoire, hidden from macroscopic brain signals, but essential for high performance in such concepts as reservoir computing.
Revised:  Here we show the opposite: the large dispersion of correlations across neurons is a signature of a rich dynamical repertoire, hidden from macroscopic brain signals, but essential for high performance in such concepts as reservoir computing.
Edit intent: fluency
Original:  Our findings suggest a refinement of the view on criticality in neural systems: network topology and heterogeneity endow the brain with two complementary substrates for critical dynamics of largely different complexity .
Revised:  Our findings suggest a refinement of the view on criticality in neural systems: network topology and heterogeneity endow the brain with two complementary substrates for critical dynamics of largely different complexities .
Edit intent: fluency
Original:  We demonstrate the versatility of our method by accommodating a wide variety of constraints  .
Revised:  We demonstrate the versatility of our method by applying a wide variety of constraints .
Edit intent: clarity
Original: Many application settings involve the analysis of timestamped relations or events between a set of entities, e.g. messages between users of an on-line social network.
Revised: We consider the problem of analyzing timestamped relational events between a set of entities, e.g. messages between users of an on-line social network.
Edit intent: clarity
Original: Many application settings involve the analysis of timestamped relations or events between a set of entities, e.g. messages between users of an on-line social network.
Revised: Many application settings involve the analysis of timestamped relations or events between a set of entities, such as messages between users of an on-line social network.
Edit intent: clarity
Original:  In this paper, we introduce a block point process model (BPPM) for dynamic networks evolving in continuous time in the form of events at irregular time intervals .
Revised:  In this paper, we introduce a block point process model (BPPM) for continuous-time event-based dynamic networks .
Edit intent: clarity
Original:  for static networks and is a simpler version of the recently-proposed Hawkes infinite relational model (IRM)
Revised:  for static networks 
Edit intent: coherence
Original:  . We show that networks generated by the BPPM follow an SBM in the limit of a growing number of nodes and leverage this property to develop an efficient inference procedure for the BPPM . We fit the BPPM to several real network data sets, including a Facebook  network with over 3,500 nodes and 130,000 events , several orders of magnitude larger than the Hawkes IRM and other existing point process network models .
Revised:  . We show that networks generated by the BPPM follow an SBM in the limit of a growing number of nodes . We use this property to develop an efficient inference procedure for the BPPM . We fit the BPPM to several real network data sets, including a Facebook network with over 3,500 nodes and 130,000 events , several orders of magnitude larger than the Hawkes IRM and other existing point process network models .
Edit intent: coherence
Original:  To inform the design of this model , we analyze the properties of power grid graphs derived from the U.S. Eastern Interconnection, Texas Interconnection, and Poland transmission system power grids.
Revised:  To inform the model design , we analyze the properties of power grid graphs derived from the U.S. Eastern Interconnection, Texas Interconnection, and Poland transmission system power grids.
Edit intent: clarity
Original:  Across these datasets, we find subgraphs induced by nodes of the same voltage level exhibit shared structural properties atypical to small-world networks, including low local clustering, large diameter  and large average distance.
Revised:  Across these datasets, we find subgraphs induced by nodes of the same voltage level exhibit shared structural properties atypical to small-world networks, including low local clustering, large diameter , and large average distance.
Edit intent: fluency
Original:  We test the performance of our model by comparing its output across many runs to the aforementioned real data.
Revised:  We test the model's performance by comparing its output across many runs to the aforementioned real data.
Edit intent: clarity
Original:  We also include graph visualization comparisons, as well as a brief analysis of edge-deletion resiliency .
Revised:  We also include graph visualization comparisons, a brief analysis of edge-deletion resiliency .
Edit intent: coherence
Original:  The primary advantages of the algorithm are : 1 ) in achieving consensus in the absence of attacks,  control protocol does not need velocity measurements and the algorithm has no constraint on the magnitude of coupling strength;
Revised:  The primary advantages of the algorithm are : 1 ) in achieving consensus in the absence of attacks, the control protocol does not need velocity measurements and the algorithm has no constraint on the magnitude of coupling strength;
Edit intent: fluency
Original:  2 ) in revealing zero-dynamics attack, the algorithm has no constraint on the size of misbehaving-agent set ;
Revised:  (ii ) in revealing zero-dynamics attack, the algorithm has no constraint on the size of misbehaving-agent set ;
Edit intent: fluency
Original:  3 ) in revealing zero-dynamics attack, if the  Xor graph generated by every two-consecutive topologies has distinct eigenvalues, only one output is enough for the algorithm.
Revised:  3 ) in revealing zero-dynamics attack, if the Xor graph generated by consecutive switching topologies has distinct eigenvalues, only one output is enough for the algorithm.
Edit intent: clarity
Original:  Simulation examples are provided to verify the effectiveness of the strategic topology- switching algorithm.
Revised:  Simulation examples are provided to verify the effectiveness of the strategic topology-switching algorithm.
Edit intent: fluency
Original:  We first study the detectability of zero-dynamics attack for the second-order multi-agent sys- tem under switching topology, which has requirements on the switching times and switching topologies.
Revised:  We first study the detectability of zero-dynamics attack for the second-order multi-agent system under switching topology, which has requirements on the switching times and switching topologies.
Edit intent: fluency
Original:  Its primary advantages are threefold: (i) in achieving consensus in the absence of attacks, the control protocol does not need velocity measurements and the algorithm has no constraint on the magnitude of coupling strength ;
Revised:  Its primary advantages are threefold: (i) in achieving consensus in the absence of attacks, the control protocol does not need velocity measurements and the algorithm has no constraint on the magnitudes of coupling weights ;
Edit intent: clarity
Original:  (ii) in revealing zero-dynamics attack, the algorithm has no constraint on the size of misbehaving-agent set, while it allows the defender or the system operator to have no knowledge of the attack-starting time  ;
Revised:  (ii) in revealing zero-dynamics attack, the algorithm allows the system operator (the defender) to have no knowledge of the attack-starting time ;
Edit intent: clarity
Original:  (ii) in revealing zero-dynamics attack, the algorithm has no constraint on the size of misbehaving-agent set, while it allows the defender or the system operator to have no knowledge of the attack-starting time  ;
Revised:  (ii) in revealing zero-dynamics attack, the algorithm has no constraint on the size of misbehaving-agent set, while it allows the defender or the system operator to have no knowledge of the attack-starting time or the number of misbehaving agents ;
Edit intent: clarity
Original: This two-part paper considers strategic topology switching for  the second-order multi-agent system under attack .
Revised: This two-part paper considers strategic topology switching for the second-order multi-agent system .
Edit intent: clarity
Original:  In Part II, we propose a strategy on switching topologies to reveal zero-dynamics attack  , whose attack-starting time is allowed to be not the initial time of system operation .
Revised:  In Part II, we propose a strategy on switching topologies to detect zero-dynamics attack , whose attack-starting time is allowed to be not the initial time of system operation .
Edit intent: clarity
Original:  In Part II, we propose a strategy on switching topologies to reveal zero-dynamics attack  , whose attack-starting time is allowed to be not the initial time of system operation .
Revised:  In Part II, we propose a strategy on switching topologies to reveal zero-dynamics attack , whose attack-starting time is allowed to be not the initial time .
Edit intent: clarity
Original:  We first study the detectability of zero-dynamics attack for the second-order multi-agent system under switching topology, which has requirements on the switching times and switching topologies . Based on the strategy on switching times proposed in Part I ~\mbox{ YA and the strategy on switching topologies proposed here, a decentralized strategic topology-switching algorithm is derived.
Revised:  We first study the detectability of zero-dynamics attack for the second-order multi-agent system under switching topology, which has requirements on the switching times and switching topologies . Based on the strategy on switching times proposed in Part I and the strategy on switching topologies proposed here, a decentralized strategic topology-switching algorithm is derived.
Edit intent: coherence
Original:  We first study the detectability of zero-dynamics attack for the second-order multi-agent system under switching topology, which has requirements on the switching times and switching topologies . Based on the strategy on switching times proposed in Part I ~\mbox{ YA and the strategy on switching topologies proposed here, a decentralized strategic topology-switching algorithm is derived.
Revised:  We first study the detectability of zero-dynamics attack for the second-order multi-agent system under switching topology, which has requirements on the switching times and switching topologies . Based on the strategy on switching times proposed in Part I ~\mbox{ YA and the strategy on switching topologies proposed here, a strategic topology-switching algorithm is derived.
Edit intent: clarity
Original:  (ii) in revealing zero-dynamics attack, the algorithm allows the system operator (the defender) to have no knowledge of the attack-starting time or the number of misbehaving agents ;
Revised:  (ii) in revealing zero-dynamics attack, the algorithm allows the system operator (the defender) to have no knowledge of the attack-starting time and the number of misbehaving agents ;
Edit intent: fluency
Original: This two-part paper considers  strategic topology switching for the second-order multi-agent system under attack.
Revised: This two-part paper considers the strategic topology switching for the second-order multi-agent system under attack.
Edit intent: fluency
Original: This two-part paper considers  strategic topology switching for the second-order multi-agent system under attack.
Revised: This two-part paper considers strategic topology switching for the second-order multi-agent systems under attack.
Edit intent: fluency
Original:  The control protocol introduced to the multi-agent system is governed only by the relative positions of agents.
Revised:  The control protocol introduced is governed only by the relative positions of agents.
Edit intent: clarity
Original:   The primary advantages of the strategy in achieving the second-order consensus are: 1 ) the control protocol relies only on relative position measurements,  no velocity measurements are needed;
Revised:  The primary advantages of the algorithm in achieving consensus are: 1 ) the control protocol relies only on relative position measurements, no velocity measurements are needed;
Edit intent: clarity
Original:   The primary advantages of the strategy in achieving the second-order consensus are: 1 ) the control protocol relies only on relative position measurements,  no velocity measurements are needed;
Revised:  The primary advantages of the strategy in achieving the second-order consensus are: 1 ) the control protocol relies only on relative position measurements, which means that no velocity measurements are needed;
Edit intent: coherence
Original:  2) the strategy has no constraint on the magnitude of coupling strength.
Revised:  (ii) it has no constraint on the magnitude of coupling strength.
Edit intent: clarity
Original:  Based on the stability of switched linear systems without stable subsystems, and the period of the multi- agent systems under fixed topology, the strategy on dwell time of topology-switching signal is derived.
Revised:  Based on the stability of switched linear systems with unstable subsystems, and the period of the multi- agent systems under fixed topology, the strategy on dwell time of topology-switching signal is derived.
Edit intent: clarity
Original:  Based on the stability of switched linear systems without stable subsystems, and the period of the multi- agent systems under fixed topology, the strategy on dwell time of topology-switching signal is derived.
Revised:  Based on the stability of switched linear systems without stable subsystems, and the property of the multi-agent systems under fixed topology, the strategy on dwell time of topology-switching signal is derived.
Edit intent: clarity
Original:  Employing this strategy and a finite-time consensus algorithm , a decentralized topology- switching algorithm is proposed.
Revised:  Employing this strategy , a decentralized topology- switching algorithm is proposed.
Edit intent: clarity
Original:  The primary advantages of the algorithm in achieving consensus are: (i) the control protocol relies only on relative position measurements , which means that no velocity measurements are needed  ;
Revised:  The primary advantages of the proposed algorithm are: (i) the control protocol relies only on relative position measurements , which means that no velocity measurements are needed ;
Edit intent: clarity
Original:  The primary advantages of the algorithm in achieving consensus are: (i) the control protocol relies only on relative position measurements , which means that no velocity measurements are needed  ;
Revised:  The primary advantages of the algorithm in achieving consensus are: (i) the control protocol relies only on relative position measurements ( no velocity measurements are needed ;
Edit intent: coherence
Original:  The primary advantages of the algorithm in achieving consensus are: (i) the control protocol relies only on relative position measurements , which means that no velocity measurements are needed  ;
Revised:  The primary advantages of the algorithm in achieving consensus are: (i) the control protocol relies only on relative position measurements , which means that no velocity measurements are needed ) ;
Edit intent: fluency
Original:  (ii) it has no constraint on the magnitude of coupling strength.
Revised:  (ii) it does not impose any constraint on the magnitude of coupling strength.
Edit intent: clarity
Original: This two-part paper considers the strategic topology switching for the second-order multi-agent systems under a special class of stealthy attacks, namely the "zero-dynamics" attack  .
Revised: In this two-part paper considers the strategic topology switching for the second-order multi-agent systems under a special class of stealthy attacks, namely the "zero-dynamics" attack .
Edit intent: coherence
Original: This two-part paper considers the strategic topology switching for the second-order multi-agent systems under a special class of stealthy attacks, namely the "zero-dynamics" attack  .
Revised: This two-part paper , we consider strategic topology switching for the second-order multi-agent systems under a special class of stealthy attacks, namely the "zero-dynamics" attack .
Edit intent: clarity
Original: This two-part paper considers the strategic topology switching for the second-order multi-agent systems under a special class of stealthy attacks, namely the "zero-dynamics" attack  .
Revised: This two-part paper considers the strategic topology switching for the second-order multi-agent systems under a special class of stealthy attacks, namely the "zero-dynamics" attack (ZDA) .
Edit intent: clarity
Original:  The main mathematical tool proposed here to prevent such attacks is strategically switching the network topology to detect a possible zero-dynamics attack .
Revised:  The main mathematical tool proposed here is to strategically switch the network topology to detect a possible zero-dynamics attack .
Edit intent: clarity
Original:  The main mathematical tool proposed here to prevent such attacks is strategically switching the network topology to detect a possible zero-dynamics attack .
Revised:  The main mathematical tool proposed here to prevent such attacks is strategically switching the network topology to detect a possible ZDA .
Edit intent: clarity
Original:  However, it is not clear a priori that such a switching strategy will simplify control protocol and still yield consensus , while maintaining the advantages of traditional control protocols, in this switched system  in the normal (un-attacked) operation mode.
Revised:  However, it is not clear a priori that such a switching strategy still yields consensus in this switched system in the normal (un-attacked) operation mode.
Edit intent: clarity
Original:  However, it is not clear a priori that such a switching strategy will simplify control protocol and still yield consensus , while maintaining the advantages of traditional control protocols, in this switched system  in the normal (un-attacked) operation mode.
Revised:  However, it is not clear a priori that such a switching strategy will simplify control protocol and still yield consensus , while maintaining the advantages of traditional control protocols, in this switched system , in the normal (un-attacked) operation mode.
Edit intent: fluency
Original:  In Part I, we propose a strategy on  switching times that enables the strategic topology-switching algorithm proposed in Part II ~\mbox{ mao2017strategic to reach the second-order consensus in the absence of a zero-dynamics attack.
Revised:  In Part I, we propose a strategy on the switching times that enables the strategic topology-switching algorithm proposed in Part II ~\mbox{ mao2017strategic to reach the second-order consensus in the absence of a zero-dynamics attack.
Edit intent: fluency
Original:  In Part I, we propose a strategy on  switching times that enables the strategic topology-switching algorithm proposed in Part II ~\mbox{ mao2017strategic to reach the second-order consensus in the absence of a zero-dynamics attack.
Revised:  In Part I, we propose a strategy on switching times that enables the topology-switching algorithm proposed in Part II ~\mbox{ mao2017strategic to reach the second-order consensus in the absence of a zero-dynamics attack.
Edit intent: clarity
Original:  In Part I, we propose a strategy on  switching times that enables the strategic topology-switching algorithm proposed in Part II ~\mbox{ mao2017strategic to reach the second-order consensus in the absence of a zero-dynamics attack.
Revised:  In Part I, we propose a strategy on switching times that enables the strategic topology-switching algorithm proposed in Part II to reach the second-order consensus in the absence of a zero-dynamics attack.
Edit intent: clarity
Original:  Based on the stability of switched linear systems with unstable subsystems, and the property of the multi-agent systems under fixed topology, the strategy on dwell time of topology-switching signal is derived.
Revised:  Based on the stability of switched linear systems with unstable subsystems, we characterize sufficient conditions for the dwell time of topology-switching signal is derived.
Edit intent: clarity
Original:  The primary advantages of the proposed algorithmare: (i) the control protocol relies only on  relative position measurements ( no velocity measurementsare needed);
Revised:  The primary advantages of the proposed algorithmare: (i) the control protocol relies only on the relative position measurements ( no velocity measurementsare needed);
Edit intent: fluency
Original:  The aforementioned theoretical results are supported by the numerical evidence obtained via simulations .
Revised:  We finally demonstrate our theoretical findings via the numerical simulation results .
Edit intent: clarity
Original:  The problem can be extended by asking whether there are k colliding elements, known as element k-distinctness  .
Revised:  There is an extension which asks whether there are k colliding elements, known as element k-distinctness .
Edit intent: clarity
Original:  The problem can be extended by asking whether there are k colliding elements, known as element k-distinctness  .
Revised:  The problem can be extended by asking whether there are k colliding elements, known as element k-distinctness problem .
Edit intent: clarity
Original:  We show that, when the optimal values of the parameters are used, the algorithm's success probability is 1-O(N^{1/(k+1)}), quickly approaching to 1. 
Revised:  We show that, when the optimal values of the parameters are used, the algorithm's success probability is 1-O(N^{1/(k+1)}), quickly approaching 1. 
Edit intent: clarity
Original:  Our analysis reveals that, the event-level privacy loss of a DP mechanism may increase over time , while the user-level privacy is as expected .
Revised:  Our analysis reveals that, the event-level privacy loss of a DP mechanism may increase over time .
Edit intent: clarity
Original:  We call the unexpected privacy loss temporal privacy leakage (TPL).
Revised:  We call the unexpected privacy loss temporal privacy leakage (TPL).
Edit intent: fluency
Original:  Second, we design efficient algorithms for quantifying TPL.
Edit intent: coherence
Original:   Third, we propose  mechanisms that convert any existing DP mechanism into one against temporal privacy leakage . Experiments confirm that our approach is efficient and effective.
Revised:  Third, we propose mechanisms that convert any existing DP mechanism into one against TPL . Experiments confirm that our approach is efficient and effective.
Edit intent: clarity
Original: In recent years, many research works propose to embed the networked data into a low-dimensional feature space .
Revised: In recent years, many research works propose to embed the network structured data into a low-dimensional feature space .
Edit intent: clarity