wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our algorithm can also be applied to any general binary polynomial optimization problem that contains \beta-cycles.
Revised:  Our algorithm can also be applied to any general BPO problem that contains \beta-cycles.
Edit intent: clarity
Original:  In our main result we provide a vast novel class of BPO that can be solved efficiently both from a theoretical and computational perspective.
Revised:  In our main result we provide a novel class of BPO that can be solved efficiently both from a theoretical and computational perspective.
Edit intent: clarity
Original:  In fact, we give a strongly polynomial-time algorithm for instances whose corresponding hypergraph is \beta-acyclic .
Revised:  In fact, we give a strongly polynomial-time algorithm for instances whose corresponding hypergraph is beta-acyclic .
Edit intent: coherence
Original:  We note that the \beta-acyclicity assumption is natural in several applications including relational database schemes and the lifted multicut problem on trees.
Revised:  We note that the beta-acyclicity assumption is natural in several applications including relational database schemes and the lifted multicut problem on trees.
Edit intent: fluency
Original:  Our result completely settles the computational complexity of BPO over acyclic hypergraphs, since the problem is NP-hard on \alpha-acyclic instances.
Revised:  Our result completely settles the computational complexity of BPO over acyclic hypergraphs, since the problem is NP-hard on alpha-acyclic instances.
Edit intent: fluency
Original:  Our algorithm can also be applied to any general BPO problem that contains \beta-cycles .
Revised:  Our algorithm can also be applied to any general BPO problem that contains beta-cycles .
Edit intent: fluency
Original:  The proposed framework is a generalization of the ``Finite Element squared'' method in which a localized portion of the periodic subscale structure -- typically referred to as a Representative Volume Element (RVE) -- is modeled using finite elements.
Revised:  The framework is a generalization of the ``Finite Element squared'' method in which a localized portion of the periodic subscale structure -- typically referred to as a Representative Volume Element (RVE) -- is modeled using finite elements.
Edit intent: clarity
Original:  The proposed framework is a generalization of the ``Finite Element squared'' method in which a localized portion of the periodic subscale structure -- typically referred to as a Representative Volume Element (RVE) -- is modeled using finite elements.
Revised:  The proposed framework is a generalization of the ``Finite Element squared'' method in which a localized portion of the periodic subscale structure is modeled using finite elements.
Edit intent: clarity
Original:  For this purpose, a physics-inspired training regimen involving the utilization of our generalized FE^2 method to simulate a variety of numerical experiments -- including but not limited to uniaxial, biaxial and shear straining of a material coupon -- is proposed as a practical method for data collection.
Revised:  For this purpose, a physics-inspired training regimen in which FE^2 is utilized to simulate a variety of numerical experiments -- including but not limited to uniaxial, biaxial and shear straining of a material coupon -- is proposed as a practical method for data collection.
Edit intent: clarity
Original:  For this purpose, a physics-inspired training regimen involving the utilization of our generalized FE^2 method to simulate a variety of numerical experiments -- including but not limited to uniaxial, biaxial and shear straining of a material coupon -- is proposed as a practical method for data collection.
Revised:  For this purpose, a physics-inspired training regimen involving the utilization of our generalized FE^2 method to simulate a variety of numerical experiments including uniaxial, biaxial and shear straining of a material coupon -- is proposed as a practical method for data collection.
Edit intent: coherence
Original:  The proposed framework is demonstrated for a Mars landing application involving the supersonic inflation of an atmospheric aerodynamic decelerator system that includes a parachute canopy made of a woven fabric.
Revised:  The proposed framework is demonstrated and validated for a realistic Mars landing application involving the supersonic inflation of an atmospheric aerodynamic decelerator system that includes a parachute canopy made of a woven fabric.
Edit intent: clarity
Original:  The proposed framework is demonstrated for a Mars landing application involving the supersonic inflation of an atmospheric aerodynamic decelerator system that includes a parachute canopy made of a woven fabric.
Revised:  The proposed framework is demonstrated for a Mars landing application involving supersonic inflation of an atmospheric aerodynamic decelerator system that includes a parachute canopy made of a woven fabric.
Edit intent: fluency
Original:  The proposed framework is demonstrated for a Mars landing application involving the supersonic inflation of an atmospheric aerodynamic decelerator system that includes a parachute canopy made of a woven fabric.
Revised:  The proposed framework is demonstrated for a Mars landing application involving the supersonic inflation of a parachute canopy made of a woven fabric.
Edit intent: clarity
Original:  For example, physics has the principle of Least Action ;
Revised:  For example, physics has the principle of Least Action ,
Edit intent: fluency
Original:  the principle of Minimum Entropy Generation ;
Revised:  the principle of Minimum Entropy Generation ,
Edit intent: fluency
Original:  This result can partly be explained by the observation that people's ideas tend to be more homogeneous within demographic groups than between demographic groups (P<1e-7).
Revised:  We found that ideas tend to be more homogeneous within demographic groups than between demographic groups (P<1e-7).
Edit intent: clarity
Original:  Our results can inform intelligent intervention possibilities towards maximizing a social system's creative outcomes .
Revised:  Our results can inform intelligent interventions to enhance network-wide creative performances .
Edit intent: clarity
Original:  The presented solver serves as an example for the implementation of tensorial variational formulations in FEniCS, for which the documentation and literature seem to be very sparse.
Revised:  The presented solver serves as an example for implementing tensorial variational formulations in FEniCS, for which the documentation and literature seem to be very sparse.
Edit intent: fluency
Original:  The documented and validated solver is provided publicly.
Revised:  We provide the documented and validated solver is provided publicly.
Edit intent: clarity
Original:  The documented and validated solver is provided publicly.
Revised:  The documented and validated solver publicly.
Edit intent: clarity
Original:  We also identify several key challenges where blockchain is applied in IoV , and describe the related works addressing these challenges .
Revised:  We also investigate several key challenges where blockchain is applied in IoV , and describe the related works addressing these challenges .
Edit intent: clarity
Original:  We also identify several key challenges where blockchain is applied in IoV , and describe the related works addressing these challenges .
Revised:  We also identify several key challenges where blockchain is applied in IoV .
Edit intent: clarity
Original:  Furthermore, we investigate the future opportunities and explore further research directions of IoV as a key enabler of ITS.
Revised:  Furthermore, we present the future opportunities and explore further research directions of IoV as a key enabler of ITS.
Edit intent: clarity
Original: A k-linear coloring of a graph G is an edge coloring of G with k colors so that each color class forms a linear forest---a forest whose each connected component is a path.
Revised: A k-linear coloring of a graph G is an edge coloring of G with k colors so that each color class forms a linear forest -- a forest whose each connected component is a path.
Edit intent: fluency
Original:  The linear arboricity \chi_l'(G) of G is the minimum integer k such that there exists a k-linear coloring of G. Akiyama, Exoo and Harary conjectured in 1980 that for every graph G, \chi_l'(G)\leq \left \lceil \Delta(G)+1{2}\right\rceil where \Delta(G) is the maximum degree of G. We prove the conjecture for 3-degenerate graphs.
Revised:  The linear arboricity \chi_l'(G) of G is the minimum integer k such that there exists a k-linear coloring of G. Akiyama, Exoo and Harary conjectured in 1980 that for every graph G, \chi_l'(G)\leq \left \lceil \Delta(G)+1{2}\right\rceil where \Delta(G) is the maximum degree of G. First, we prove the conjecture for 3-degenerate graphs.
Edit intent: coherence
Original:  Since \chi'_l(G) \geq \left\lceil\Delta(G){2}\right\rceil for any graph G, the partition produced by the algorithm differs in size from the optimum by at most an additive factor of 1.
Revised:  Since \chi'_l(G) = \left\lceil\Delta(G){2}\right\rceil for any graph G, the partition produced by the algorithm differs in size from the optimum by at most an additive factor of 1.
Edit intent: clarity
Original:  Recent articles have claimed that, as the depth of a rectifier neural networkgrows to infinity, the probability of finding a valid initialization decreases to zero .
Revised:  Recent articles have claimed that, as the depth of a rectifier neural networkgrows to infinity, the probability of finding a valid initialization .
Edit intent: clarity
Original:  Contrary to previous claims, we show that it is possible to increase the depth of a network indefinitely, so long as the width increases as well.
Revised:  We show that it is possible to increase the depth of a network indefinitely, so long as the width increases as well.
Edit intent: clarity
Original:  Finally, we develop a practical sign flipping scheme which guarantees with probability one that for a k-layer network, the ratio of living training data points is at least 2^{-k}.
Revised:  Finally, we develop a practical sign flipping scheme which guarantees that the ratio of living training data points is at least 2^{-k}.
Edit intent: clarity
Original:  Finally, we develop a practical sign flipping scheme which guarantees with probability one that for a k-layer network, the ratio of living training data points is at least 2^{-k}.
Revised:  Finally, we develop a practical sign flipping scheme which guarantees with probability one that for a k-layer network, the ratio of living data points in a k-layer network is at least 2^{-k}.
Edit intent: clarity
Original:  We also discuss how neuron death provides a theoretical interpretation for various network design choices such as batch normalization, residual layers and skip connections, and could inform the design of very deep neural networks .
Revised:  We also discuss how neuron death provides a theoretical interpretation for various network design choices such as batch normalization, residual connections, dense networks and skip connections. This suggests that neuron death may provide insight into the efficacy of various model architectures .
Edit intent: clarity
Original:  This study aims towards a behavioral comparison of visual core object recognition  between humans and feedforward neural networks in a classification learning paradigm on an ImageNet data set.
Revised:  This study aims towards a behavioral comparison of visual core object recognition performance between humans and feedforward neural networks in a classification learning paradigm on an ImageNet data set.
Edit intent: clarity
Original:  This  implies a blood type-dependent infection rate.
Revised:  This hypothesis implies a blood type-dependent infection rate.
Edit intent: clarity
Original: Small and medium sized enterprises are considered an essential part of the EU economy, however, highly vulnerable to cyberattacks.
Revised: Small and medium-sized enterprises are considered an essential part of the EU economy, however, highly vulnerable to cyberattacks.
Edit intent: fluency
Original:  To mitigate the SMEs  cybersecurity adoption issues and raise their awareness of cyber threats, we have designed a self paced security assessment and capability improvement method, CYSEC.
Revised:  To mitigate the SMEs ' cybersecurity adoption issues and raise their awareness of cyber threats, we have designed a self paced security assessment and capability improvement method, CYSEC.
Edit intent: fluency
Original:  To mitigate the SMEs  cybersecurity adoption issues and raise their awareness of cyber threats, we have designed a self paced security assessment and capability improvement method, CYSEC.
Revised:  To mitigate the SMEs cybersecurity adoption issues and raise their awareness of cyber threats, we have designed a self-paced security assessment and capability improvement method, CYSEC.
Edit intent: fluency
Original:  CYSEC is a security awareness and training method that utilises self reporting questionnaires to collect companies  information about cybersecurity awareness, practices, and vulnerabilities to generate automated recommendations for counselling.
Revised:  CYSEC is a security awareness and training method that utilises self-reporting questionnaires to collect companies information about cybersecurity awareness, practices, and vulnerabilities to generate automated recommendations for counselling.
Edit intent: fluency
Original:  CYSEC is a security awareness and training method that utilises self reporting questionnaires to collect companies  information about cybersecurity awareness, practices, and vulnerabilities to generate automated recommendations for counselling.
Revised:  CYSEC is a security awareness and training method that utilises self reporting questionnaires to collect companies ' information about cybersecurity awareness, practices, and vulnerabilities to generate automated recommendations for counselling.
Edit intent: fluency
Original:  However, confidentiality concerns about cybersecurity information have an impact on companies  willingness to share their information.
Revised:  However, confidentiality concerns about cybersecurity information have an impact on companies ' willingness to share their information.
Edit intent: fluency
Original:  Security information sharing decreases the risk of incidents and increases users self efficacy in security awareness programs.
Revised:  Security information sharing decreases the risk of incidents and increases users ' self-efficacy in security awareness programs.
Edit intent: fluency
Original:  This paper presents the results of semi structured interviews with seven chief information security officers of SMEs to evaluate the impact of online consent communication on motivation for information sharing.
Revised:  This paper presents the results of semi-structured interviews with seven chief information security officers of SMEs to evaluate the impact of online consent communication on motivation for information sharing.
Edit intent: fluency
Original:  This raises the question whether  approximate vertex enumeration  is easier to realize than exact vertex enumeration.
Revised:  This raises the question whether this problem, called approximate vertex enumeration is easier to realize than exact vertex enumeration.
Edit intent: clarity
Original:  This raises the question whether  approximate vertex enumeration  is easier to realize than exact vertex enumeration.
Revised:  This raises the question whether approximate vertex enumeration , is easier to realize than exact vertex enumeration.
Edit intent: fluency
Original:  Beyond direct potential applications, approximate vertex enumeration could serve as a model to understand numerical problems with floating point implementations of exact methods.
Edit intent: coherence
Original:   It remains open if the conditions are required for dimension larger than 3.
Revised:  It remains open if the latter results can be extended to a dimension larger than 3.
Edit intent: clarity
Original: The remarkable empirical finding that extensive fine-scale diversity is stable on long time scales, despite selective pressures, has spurred the study of several models, which can explain species formationand stability.
Revised: The remarkable empirical finding that extensive fine-scale diversity is stable on long time scales, despite selective pressures, has spurred the study of many models, which can explain species formationand stability.
Edit intent: clarity
Original:  The mathematical framework we have introduced has much larger applicability than the one considered here, possibly including pattern formation in models with very different physical features .
Revised:  The mathematical framework we have introduced has much larger applicability than the model considered here, possibly including pattern formation in models with very different physical features .
Edit intent: clarity
Original:  In this paper, we demonstrate\\%DIF > over subject-specific decoding.
Revised: Objective. In this paper, we demonstrate\\%DIF > over subject-specific decoding.
Edit intent: clarity
Original:  We demonstrate that a neural decoder trained on neural activity signals of one subject can be used to robustly decode the motor intentions of a different subject with high reliability.
Revised:  We demonstrate that a neural decoder trained on neural activity signals of one subject can be used to robustly decode the motor intentions of a different subject with high reliability.
Edit intent: fluency
Original:  Our proposed algorithm for cross-subject mapping of neural activity is based on deep conditional generative models.
Revised:  Significance. The findings reported in this paper are an important step towards the development of cross-subject mapping of neural activity is based on deep conditional generative models.
Edit intent: clarity
Original:  That is, a risk-neutralizing trading strategy cannot be performed.
Revised:  That is, a risk-neutralising trading strategy cannot be performed.
Edit intent: fluency
Original:  This is the case , when one is in need of a risk-free (default-free) discounting, but default protection on funding providers is not traded.
Revised:  This is the case when one needs a risk-free (default-free) discounting, but default protection on funding providers is not traded.
Edit intent: fluency
Original:  For this case, we introduce a default compensation factor (\exp(+%DIFDELCMD < \lambda %%% T)) that describes the present value of a strategy to compensate for default (like buying default protection would do).
Revised:  For this case, we derive a default compensation factor (\exp(+%DIFDELCMD < \lambda %%% T)) that describes the present value of a strategy to compensate for default (like buying default protection would do).
Edit intent: clarity
Original:  For this case, we introduce a default compensation factor (\exp(+%DIFDELCMD < \lambda %%% T)) that describes the present value of a strategy to compensate for default (like buying default protection would do).
Revised:  For this case, we introduce a default compensation factor %DIFDELCMD < \lambda %%% T)) that describes the present value of a strategy to compensate for default (like buying default protection would do).
Edit intent: coherence
Original:  For this case, we introduce a default compensation factor (\exp(+%DIFDELCMD < \lambda %%% T)) that describes the present value of a strategy to compensate for default (like buying default protection would do).
Revised:  For this case, we introduce a default compensation factor (\exp(+%DIFDELCMD < \lambda %%% that describes the present value of a strategy to compensate for default (like buying default protection would do).
Edit intent: clarity
Original:  In a second part  , we introduce a model , where the survival probability  depends on the required notional.
Revised:  In a second part of the paper , we introduce a model , where the survival probability depends on the required notional.
Edit intent: clarity
Original:  In a second part  , we introduce a model , where the survival probability  depends on the required notional.
Revised:  In a second part , we introduce a model where the survival probability depends on the required notional.
Edit intent: fluency
Original:  In a second part  , we introduce a model , where the survival probability  depends on the required notional.
Revised:  In a second part , we introduce a model , where the survival probability depends on the notional.
Edit intent: clarity
Original:  This model is different from the classical modelling of a time-dependent survival probability (\exp(-\lambda T)).
Revised:  This model introduces an effect not present in the classical modelling of a time-dependent survival probability (\exp(-\lambda T)).
Edit intent: clarity
Original:  The model especially allows that large liquidity requirements are instantly more likely do default than small ones.
Revised:  The model especially allows that large liquidity requirements are more likely to default instantly than small ones.
Edit intent: fluency
Original:  Combined the two approaches build a framework in which discounting ( valuation) is non-linear .
Revised:  Combined , the two models build a framework in which discounting ( valuation) is non-linear .
Edit intent: clarity
Original:  Combined the two approaches build a framework in which discounting ( valuation) is non-linear .
Revised:  Combined the two approaches build a framework where discounting (and hence valuation) is non-linear .
Edit intent: clarity
Original: Spreading processes play an increasingly important role in modeling for diffusion networks, information propagation, marketing , and opinion setting.
Revised: Spreading processes play an increasingly important role in modeling for diffusion networks, information propagation, marketing and opinion setting.
Edit intent: fluency
Original:  Recent real-world spreading events further highlight the need for prediction, optimization, and control of diffusion dynamics.
Revised:  We address the problem of learning of a spreading model such that the predictions generated from this model are accurate and could be subsequently used for the optimization, and control of diffusion dynamics.
Edit intent: coherence
Original:  Additionally, full observation of the dynamics is rarely available.
Revised:  Additionally, full observation of the dynamics are rarely available.
Edit intent: fluency
Original:  In this work, we study the popular Independent Cascade model of stochastic diffusion dynamics.
Edit intent: coherence
Original:  Importantly, we show that the resulting model approximates the marginal activation probabilities that can be used for prediction of the spread .
Revised:  We show that tractable inference from the learned model generates a better prediction of marginal probabilities compared to the original model. We develop a systematic procedure for learning a mixture of models which further improves prediction quality of the model .
Edit intent: coherence
Original:  We develop a systematic procedure for learning a mixture of models which further improves prediction quality of the model .
Revised:  We develop a systematic procedure for learning a mixture of models which further improves the prediction quality .
Edit intent: clarity
Original:  HOBFLOPS allows researchers to prototype arbitrary-levels of FP arithmetic precision for CNN accelerators.
Revised:  HOBFLOPS allows researchers to prototype different levels of custom FP precision in the arithmetic of software CNN accelerators.
Edit intent: clarity
Original:  Furthermore, HOBFLOPS fast custom-precision FP CNNs in software may be valuable in cases where memory bandwidth is limited.
Revised:  Furthermore, HOBFLOPS fast custom-precision FP CNNs may be valuable in cases where memory bandwidth is limited.
Edit intent: clarity
Original:  These factors are combined through the use of an adjustable parameter into a general measure that allows for the selection of query terms that independently favor different aspects of retrieval .
Revised:  These factors are combined through the use of an adjustable parameter that allows to favor different aspects of retrieval .
Edit intent: clarity