wanyu/IteraTeR_v2 huggingface dataset:
Original:  This extends the characterization of spider algebras over sets and relations as disjoint unions of abelian groups.
Revised:  This extends the characterization of spider algebras over sets and relations as disjoint unions of groups.
Edit intent: clarity
Original: "Spider" is a nickname of *special Frobenius algebras* , a fundamental structure from mathematics, physics, and computer science.
Revised: "Spider" is a nickname of special Frobenius algebras , a fundamental structure from mathematics, physics, and computer science.
Edit intent: fluency
Original:  *Pregroups* are a fundamental structure from linguistics.
Revised:  Pregroups are a fundamental structure from linguistics.
Edit intent: fluency
Original:  The other way around  preordered spider algebras in general can be characterized as unions of pregroups.
Revised:  The other way around , preordered spider algebras in general can be characterized as unions of pregroups.
Edit intent: fluency
Original: Triply periodic minimal surface (TPMS) shell-lattices are attracting increasingly attention due to their unique combination of geometric and mechanical properties, and their open-cell topology.
Revised: Triply periodic minimal surface (TPMS) shell lattices are attracting increasingly attention due to their unique combination of geometric and mechanical properties, and their open-cell topology.
Edit intent: fluency
Original:  However, uniform thickness TPMS shell-lattices are usually anisotropic in stiffness, namely having different Young's moduli along different lattice directions.
Revised:  However, uniform thickness TPMS shell lattices are usually anisotropic in stiffness, namely having different Young's moduli along different lattice directions.
Edit intent: coherence
Original:  To reduce the  anisotropy, we propose a family of variable thickness TPMS shell-lattices with isotropic stiffness designed by a strain energy-based optimization algorithm.
Revised:  To reduce the anisotropy, we propose a family of variable thickness TPMS shell lattices with isotropic stiffness designed by a strain energy-based optimization algorithm.
Edit intent: fluency
Original:  The optimization results show that all the five selected types of TPMS lattices can be made to achieve isotropic stiffness by varying the shell thickness, among which N14 and OCTO can maintain over 90\% of the Hashin-Shtrikman upper bound of bulk modulus.
Revised:  The optimization results show that all the five selected types of TPMS lattices can be made to achieve isotropic stiffness by varying the shell thickness, among which N14 can maintain over 90\% of the Hashin-Shtrikman upper bound of bulk modulus.
Edit intent: clarity
Original:  All the optimized shell-lattices exhibit superior stiffness properties and significantly outperform elastically-isotropic truss-lattices . Both uniform and optimized types of N14 shell-lattices along [100], [110] and [111] directions are fabricated by the micro laser powder bed fusion techniques with stainless steel 316L and tested under quasi-static compression loads.
Revised:  All the optimized shell lattices exhibit superior stiffness properties and significantly outperform elastically-isotropic truss-lattices . Both uniform and optimized types of N14 shell-lattices along [100], [110] and [111] directions are fabricated by the micro laser powder bed fusion techniques with stainless steel 316L and tested under quasi-static compression loads.
Edit intent: fluency
Original:  All the optimized shell-lattices exhibit superior stiffness properties and significantly outperform elastically-isotropic truss-lattices . Both uniform and optimized types of N14 shell-lattices along [100], [110] and [111] directions are fabricated by the micro laser powder bed fusion techniques with stainless steel 316L and tested under quasi-static compression loads.
Revised:  All the optimized shell-lattices exhibit superior stiffness properties and significantly outperform elastically-isotropic truss-lattices . Both uniform and optimized types of N14 shell lattices along [100], [110] and [111] directions are fabricated by the micro laser powder bed fusion techniques with stainless steel 316L and tested under quasi-static compression loads.
Edit intent: fluency
Original:  The agents' strategic interactions are captured by an incomplete-information Markov game, in which each agent first selects one environmental signal from multiple signal sources as additional payoff-relevant information and then takes an action.
Revised:  The agents' strategic interactions are captured by a Markov game, in which each agent first selects one environmental signal from multiple signal sources as additional payoff-relevant information and then takes an action.
Edit intent: clarity
Original:  There is a rational information designer (principal) who possesses one signal source and aims to control the equilibrium behaviors of the agents by designing the information structure of her signals sent to the agents.
Revised:  There is a rational information designer (principal) who possesses one signal source and aims to influence the equilibrium behaviors of the agents by designing the information structure of her signals sent to the agents.
Edit intent: clarity
Original:  We will release the code and experimental settings to facilitate the research of modularized universal models or multi-task learning of speech processing tasks.
Revised:  We release the code and experimental settings to facilitate the research of modularized universal models or multi-task learning of speech processing tasks.
Edit intent: coherence
Original:  We will release the code and experimental settings to facilitate the research of modularized universal models or multi-task learning of speech processing tasks.
Revised:  We will release the code and experimental settings to facilitate the research of modularized universal models and multi-task learning of speech processing tasks.
Edit intent: fluency
Original: Jump functions are the most studied non-unimodal benchmark in the theory of randomized search heuristics, in particular, evolutionary algorithms (EAs).
Revised: Jump functions are the most-studied non-unimodal benchmark in the theory of randomized search heuristics, in particular, evolutionary algorithms (EAs).
Edit intent: fluency
Original:  We prove that several previous results extend to this more general class: for all k = o(n^{1/3\le  and \delta < k, the optimal mutation rate for the (1+1)~EA is \delta{n}, and the fast (1+1)~EA runs faster than the classical (1+1)~EA by a factor super-exponential in \delta.
Revised:  We prove that several previous results extend to this more general class: for all k\le and \delta < k, the optimal mutation rate for the (1+1)~EA is \delta{n}, and the fast (1+1)~EA runs faster than the classical (1+1)~EA by a factor super-exponential in \delta.
Edit intent: coherence
Original: Motivated by a serious issue that hospitals in rural areas suffer from  shortage of residents, we study the Hospitals/Residents model in which hospitals are associated with lower quotas and the goal is to satisfy them as much as possible.
Revised: Motivated by the serious problem that hospitals in rural areas suffer from shortage of residents, we study the Hospitals/Residents model in which hospitals are associated with lower quotas and the goal is to satisfy them as much as possible.
Edit intent: clarity
Original: Motivated by a serious issue that hospitals in rural areas suffer from  shortage of residents, we study the Hospitals/Residents model in which hospitals are associated with lower quotas and the goal is to satisfy them as much as possible.
Revised: Motivated by a serious issue that hospitals in rural areas suffer from a shortage of residents, we study the Hospitals/Residents model in which hospitals are associated with lower quotas and the goal is to satisfy them as much as possible.
Edit intent: fluency
Original: Motivated by a serious issue that hospitals in rural areas suffer from  shortage of residents, we study the Hospitals/Residents model in which hospitals are associated with lower quotas and the goal is to satisfy them as much as possible.
Revised: Motivated by a serious issue that hospitals in rural areas suffer from shortage of residents, we study the Hospitals/Residents model in which hospitals are associated with lower quotas and the objective is to satisfy them as much as possible.
Edit intent: clarity
Original:  When preference lists are strict, the number of residents assigned to each hospital is the same in any stable matching due to the famous rural hospitals theorem , so there is no room for algorithmic interventions.
Revised:  When preference lists are strict, the number of residents assigned to each hospital is the same in any stable matching due to the well-known rural hospitals theorem , so there is no room for algorithmic interventions.
Edit intent: fluency
Original:  When preference lists are strict, the number of residents assigned to each hospital is the same in any stable matching due to the famous rural hospitals theorem , so there is no room for algorithmic interventions.
Revised:  When preference lists are strict, the number of residents assigned to each hospital is the same in any stable matching due to the famous rural hospitals theorem ; thus there is no room for algorithmic interventions.
Edit intent: coherence
Original:  However, when ties are introduced in preference lists, this is not the case since the number of residents may vary over stable matchings.
Revised:  However, when ties are introduced in preference lists, this is not the case because the number of residents may vary over stable matchings.
Edit intent: coherence
Original:  Based upon value and policy iteration ideas, we show that the proposed algorithm applies to deterministic problems with arbitrary state and control spaces, arbitrary dynamics, and admits extensions to problems with trajectory constraints, and applications to the exploration of state space, and problems with multiagent structurewith such flexibility.
Revised:  The proposed algorithm is based on value and policy iteration ideas, we show that the proposed algorithm applies to deterministic problems with arbitrary state and control spaces, arbitrary dynamics, and admits extensions to problems with trajectory constraints, and applications to the exploration of state space, and problems with multiagent structurewith such flexibility.
Edit intent: clarity
Original:  Based upon value and policy iteration ideas, we show that the proposed algorithm applies to deterministic problems with arbitrary state and control spaces, arbitrary dynamics, and admits extensions to problems with trajectory constraints, and applications to the exploration of state space, and problems with multiagent structurewith such flexibility.
Revised:  Based upon value and policy iteration ideas, and applies to deterministic problems with arbitrary state and control spaces, arbitrary dynamics, and admits extensions to problems with trajectory constraints, and applications to the exploration of state space, and problems with multiagent structurewith such flexibility.
Edit intent: clarity
Original:  Based upon value and policy iteration ideas, we show that the proposed algorithm applies to deterministic problems with arbitrary state and control spaces, arbitrary dynamics, and admits extensions to problems with trajectory constraints, and applications to the exploration of state space, and problems with multiagent structurewith such flexibility.
Revised:  Based upon value and policy iteration ideas, we show that the proposed algorithm applies to deterministic problems with arbitrary state and control spaces, and arbitrary dynamics. It admits extensions to problems with trajectory constraints, and applications to the exploration of state space, and problems with multiagent structurewith such flexibility.
Edit intent: coherence
Original: The complexity of the quantum state of a multi particle system and the maximum possible accuracy of its quantum description are connected by a relation similar to the coordinate-momentum uncertainty relation.
Revised: The complexity of the quantum state of a multiparticle system and the maximum possible accuracy of its quantum description are connected by a relation similar to the coordinate-momentum uncertainty relation.
Edit intent: fluency
Original:  From this it follows that there is a rich collection of endofunctors to which the new theorem applies, provided one admits a weak form of choice ( the WISCaxiom of van den Berg , Moerdijk, Palmgren and Streicher) that is known to hold , for example, in the internal logic of very many kinds of elementary topos.
Revised:  From this it follows that there is a rich class of endofunctors to which the new theorem applies, provided one admits a weak form of choice ( the WISCaxiom of van den Berg , Moerdijk, Palmgren and Streicher) that is known to hold , for example, in the internal logic of very many kinds of elementary topos.
Edit intent: clarity
Original:  From this it follows that there is a rich collection of endofunctors to which the new theorem applies, provided one admits a weak form of choice ( the WISCaxiom of van den Berg , Moerdijk, Palmgren and Streicher) that is known to hold , for example, in the internal logic of very many kinds of elementary topos.
Revised:  From this it follows that there is a rich collection of endofunctors to which the new theorem applies, provided one admits a weak form of choice ( WISC) due to Streicher , Moerdijk, Palmgren and Streicher) that is known to hold , for example, in the internal logic of very many kinds of elementary topos.
Edit intent: clarity
Original:  From this it follows that there is a rich collection of endofunctors to which the new theorem applies, provided one admits a weak form of choice ( the WISCaxiom of van den Berg , Moerdijk, Palmgren and Streicher) that is known to hold , for example, in the internal logic of very many kinds of elementary topos.
Revised:  From this it follows that there is a rich collection of endofunctors to which the new theorem applies, provided one admits a weak form of choice ( the WISCaxiom of van den Berg , Moerdijk, van den Berg and Palmgren, and which is known to hold , for example, in the internal logic of very many kinds of elementary topos.
Edit intent: coherence
Original:  From this it follows that there is a rich collection of endofunctors to which the new theorem applies, provided one admits a weak form of choice ( the WISCaxiom of van den Berg , Moerdijk, Palmgren and Streicher) that is known to hold , for example, in the internal logic of very many kinds of elementary topos.
Revised:  From this it follows that there is a rich collection of endofunctors to which the new theorem applies, provided one admits a weak form of choice ( the WISCaxiom of van den Berg , Moerdijk, Palmgren and Streicher) that is known to hold in the internal logic of very many kinds of elementary topos.
Edit intent: coherence
Original:  From this it follows that there is a rich collection of endofunctors to which the new theorem applies, provided one admits a weak form of choice ( the WISCaxiom of van den Berg , Moerdijk, Palmgren and Streicher) that is known to hold , for example, in the internal logic of very many kinds of elementary topos.
Revised:  From this it follows that there is a rich collection of endofunctors to which the new theorem applies, provided one admits a weak form of choice ( the WISCaxiom of van den Berg , Moerdijk, Palmgren and Streicher) that is known to hold , for example, in the internal constructive logic of many kinds of elementary topos.
Edit intent: clarity
Original:  Generated summaries are coherent and look impressive at the first glance.
Revised:  Generated summaries are coherent and look impressive at first glance.
Edit intent: fluency
Original:  Visual feature-based loop closure is also performed to supplement loop edges to the global factor graph  .
Revised:  Visual feature-based loop closure is also performed to supplement the global factor graph .
Edit intent: clarity
Original:  When the global factor graph satisfies a condition on spatial diversity, the BA process will be started, and the coordinate transform between UWB and onboard SLAM systems can be estimated .
Revised:  When the global factor graph satisfies a condition on spatial diversity, the BA process will be triggered, which updates the coordinate transform between UWB and onboard SLAM systems can be estimated .
Edit intent: clarity
Original:  When the global factor graph satisfies a condition on spatial diversity, the BA process will be started, and the coordinate transform between UWB and onboard SLAM systems can be estimated .
Revised:  When the global factor graph satisfies a condition on spatial diversity, the BA process will be started, and the coordinate transform between UWB and onboard SLAM systems .
Edit intent: clarity
Original:  When the global factor graph satisfies a condition on spatial diversity, the BA process will be triggered , which updates the coordinate transform between UWB and onboard SLAM systems.
Revised:  When the global factor graph satisfies a condition on spatial diversity, the BA process will be triggered to update the coordinate transform between UWB and onboard SLAM systems.
Edit intent: coherence
Original: The age of acceleration is taking place, driven by the revolutionary digital transformation creating basically a digital version of our physical world and the currency in that digital space is data.
Revised: The digital transformation is creating basically a digital version of our physical world and the currency in that digital space is data.
Edit intent: clarity
Original:  What is more interesting arises when combining both network coding and partial protection and we present insights on how to derive compounding gains in such unique prospect .
Revised:  That it takes two to tango, combining photonic network coding and partial protection and we present insights on how to derive compounding gains in such unique prospect .
Edit intent: clarity
Original:  Time-Sensitive Distributed Systems (TSDS) , such as applications using autonomous drones, achieve goals under possible environment interference (e. g., winds).
Revised:  Time-Sensitive Distributed Systems (TSDS) .
Edit intent: clarity
Original:  We introduce new properties , such as realizability (there exists a good trace) , survivability (where, in addition, all admissible traces are good)  , recoverability (all compliant traces do not reach points-of-no-return) , and reliability (system can always continue functioning using a good trace).
Revised:  We introduce new properties , such as realizability (there exists a good trace) and survivability (where, in addition, all admissible traces are good) , recoverability (all compliant traces do not reach points-of-no-return) , and reliability (system can always continue functioning using a good trace).
Edit intent: coherence
Original:  We introduce new properties , such as realizability (there exists a good trace) , survivability (where, in addition, all admissible traces are good)  , recoverability (all compliant traces do not reach points-of-no-return) , and reliability (system can always continue functioning using a good trace).
Revised:  We introduce new properties , such as realizability (there exists a good trace) , survivability (where, in addition, all admissible traces are good) , recoverability (all compliant traces do not reach points-of-no-return) and reliability (system can always continue functioning using a good trace).
Edit intent: fluency
Original:  We prove that for this class of systems the problems of realizability, recoverability , reliability , and survivability are PSPACE-complete.
Revised:  We prove that for this class of systems the properties of recoverability and reliability coincide and are PSPACE-complete.
Edit intent: clarity
Original: This paper develops a Multiset Rewriting language with explicit time for specifying and analyzing Time-Sensitive Distributed Systems (TSDS).
Revised: This paper develops a Multiset Rewriting language with explicit time for the specification and analysis of Time-Sensitive Distributed Systems (TSDS).
Edit intent: fluency
Original:  A good trace is an infinite trace in which goals are perpetually satisfied , in spite of a possible environment interference .
Revised:  A good trace is an infinite trace in which the goals are satisfied perpetually despite possible interference from the environment .
Edit intent: clarity
Original:  In our previous work (FORMATS 2016)  we discussed two desirable properties of TSDSes, realizability (there exists a good trace) and survivability (where, in addition, all admissible traces are good).
Revised:  In our previous work (FORMATS 2016) , we discussed two desirable properties of TSDSes, realizability (there exists a good trace) and survivability (where, in addition, all admissible traces are good).
Edit intent: fluency
Original:  Here we consider two further properties, recoverability (all compliant traces do not reach points-of-no-return) and reliability (  system can always continue functioning using a good trace).
Revised:  Here we consider two additional properties, recoverability (all compliant traces do not reach points-of-no-return) and reliability ( system can always continue functioning using a good trace).
Edit intent: fluency
Original:  Here we consider two further properties, recoverability (all compliant traces do not reach points-of-no-return) and reliability (  system can always continue functioning using a good trace).
Revised:  Here we consider two further properties, recoverability (all compliant traces do not reach points-of-no-return) and reliability ( the system can always continue functioning using a good trace).
Edit intent: fluency
Original:  Following our previous work (FORMATS 2016), we focus on a class of systems called Progressing Timed Systems (PTS), where intuitively only a finite number of actions can be carried out in a bounded time period.
Revised:  Following (FORMATS 2016), we focus on a class of systems called Progressing Timed Systems (PTS), where intuitively only a finite number of actions can be carried out in a bounded time period.
Edit intent: clarity
Original:  Furthermore , if we impose a bound on time (as in bounded model-checking), we show that for PTS , the reliability property is in the \Delta_2^p class of the polynomial hierarchy, a subclass of PSPACE.
Revised:  Moreover , if we impose a bound on time (as in bounded model-checking), we show that for PTS , the reliability property is in the \Delta_2^p class of the polynomial hierarchy, a subclass of PSPACE.
Edit intent: fluency
Original:  Furthermore , if we impose a bound on time (as in bounded model-checking), we show that for PTS , the reliability property is in the \Delta_2^p class of the polynomial hierarchy, a subclass of PSPACE.
Revised:  Furthermore , if we impose a bound on time (as in bounded model-checking), we show that for PTS the reliability property is in the \Delta_2^p class of the polynomial hierarchy, a subclass of PSPACE.
Edit intent: fluency
Original:  We also show that  bounded survivability is both NP-hard and coNP-hard.
Revised:  We also show that the bounded survivability is both NP-hard and coNP-hard.
Edit intent: fluency
Original:   In contrast to existing engineering shape collections, SimJEB's models are all designed for the same engineering function and thus have consistent structural loads and support conditions.
Revised:  In contrast to existing shape collections, SimJEB's models are all designed for the same engineering function and thus have consistent structural loads and support conditions.
Edit intent: fluency
Original: Making profits in stock market is a challenging task for both professional institutional investors and individual traders  .
Revised: It is a difficult task for both professional institutional investors and individual traders .
Edit intent: clarity
Original: Making profits in stock market is a challenging task for both professional institutional investors and individual traders  .
Revised: Making profits in stock market is a challenging task for both professional investors and individual traders .
Edit intent: clarity