wanyu/IteraTeR_v2 huggingface dataset:
Original:  It provides detailed statistics about the fixed-target running times and  fixed-budget results of the benchmarked algorithms  . Performance aggregation over several benchmark problems is also possible, for example in the form of empirical cumulative distribution functions.
Revised:  It provides detailed statistics about the fixed-target running times and fixed-budget performance of the benchmarked algorithms . Performance aggregation over several benchmark problems is also possible, for example in the form of empirical cumulative distribution functions.
Edit intent: clarity
Original:  It provides detailed statistics about the fixed-target running times and  fixed-budget results of the benchmarked algorithms  . Performance aggregation over several benchmark problems is also possible, for example in the form of empirical cumulative distribution functions.
Revised:  It provides detailed statistics about the fixed-target running times and fixed-budget results of the benchmarked algorithms . Performance aggregation over several benchmark problems is possible, for example in the form of empirical cumulative distribution functions.
Edit intent: clarity
Original:  A key advantage of IOHanalyzer over other performance analysis packages is its highly interactive design, which allows the user to specify the performance measures, ranges, and granularity that are most useful for her experiments.
Revised:  Key advantages of IOHanalyzer over other performance analysis packages is its highly interactive design, which allows the user to specify the performance measures, ranges, and granularity that are most useful for her experiments.
Edit intent: clarity
Original:  A key advantage of IOHanalyzer over other performance analysis packages is its highly interactive design, which allows the user to specify the performance measures, ranges, and granularity that are most useful for her experiments.
Revised:  A key advantage of IOHanalyzer over other performance analysis packages are its highly interactive design, which allows the user to specify the performance measures, ranges, and granularity that are most useful for her experiments.
Edit intent: fluency
Original:  A key advantage of IOHanalyzer over other performance analysis packages is its highly interactive design, which allows the user to specify the performance measures, ranges, and granularity that are most useful for her experiments.
Revised:  A key advantage of IOHanalyzer over other performance analysis packages is its highly interactive design, which allows users to specify the performance measures, ranges, and granularity that are most useful for her experiments.
Edit intent: fluency
Original: We investigate the dynamics in the networks of Japanese corporates and its interplay with the appointment of female board members.
Revised: We investigate the dynamics in the networks of Japanese corporates and its interplay with the appointments of female board members.
Edit intent: fluency
Original:  We find that firms with female board members show homophily with respect to gender and often have above average profitability.
Revised:  We find that corporate boards with women show homophily with respect to gender and often have above average profitability.
Edit intent: clarity
Original:  We find that firms with female board members show homophily with respect to gender and often have above average profitability.
Revised:  We find that firms with female board members show homophily with respect to gender while the respective firms often have above average profitability.
Edit intent: clarity
Original: We investigate the dynamics in the networks of Japanese corporates and its interplay with the appointments of female board members.
Revised: We investigate the networks of Japanese corporates and its interplay with the appointments of female board members.
Edit intent: clarity
Original: We investigate the dynamics in the networks of Japanese corporates and its interplay with the appointments of female board members.
Revised: We investigate the dynamics in the networks of Japanese corporate boards and its influence on the appointments of female board members.
Edit intent: clarity
Original:  We find that corporate boards with women show homophily with respect to gender while the respective firms often have above average profitability.
Revised:  We find that corporate boards with women show homophily with respect to gender . The corresponding firms often have above average profitability.
Edit intent: clarity
Original: In this paper we study 2-threshold functions over a two-dimensional rectangular grid also known as intersections of two halfplanes .
Revised: In this paper we study 2-threshold functions over a two-dimensional rectangular grid , i.e. the intersections of two halfplanes .
Edit intent: clarity
Original: In this paper we study 2-threshold functions over a two-dimensional rectangular grid also known as intersections of two halfplanes .
Revised: In this paper we study 2-threshold functions over a two-dimensional rectangular grid also known as intersections of two threshold functions .
Edit intent: clarity
Original:  In this paper we study 2-threshold functions over a two-dimensional rectangular grid , i.e. the intersections of two threshold functions.
Revised:  In this paper we study 2-threshold functions , i.e. the intersections of two threshold functions.
Edit intent: clarity
Original:  In this paper we study 2-threshold functions over a two-dimensional rectangular grid , i.e. the intersections of two threshold functions.
Revised:  In this paper we study 2-threshold functions over a two-dimensional rectangular grid , i.e. functions representable as the conjunction of two threshold functions.
Edit intent: clarity
Original:  We provide a characterization for 2-threshold functions by pairs of oriented prime segments with certain properties, which we call proper.
Revised:  We provide a characterization of 2-threshold functions by pairs of oriented prime segments with certain properties, which we call proper.
Edit intent: fluency
Original:  Rather, the bidding strategy that leads to the maximum revenue is a strategy pursuing the performance lift of showing ads to a specific user.
Revised:  Rather, the bidding strategy that leads to the maximum revenue is a strategy pursuing the performance lift of showing ads to a specific user.
Edit intent: fluency
Original:  In this study, we develop Unbiased Lift-based Bidding System , which maximizes the advertisers' profit by accurately predicting the lift-effect from biased log data.
Revised:  In this study, we develop Unbiased Lift-based Bidding System , which maximizes the advertisers' profit by accurately predicting the lift-effect from biased log data.
Edit intent: fluency
Original:  We validated BS4NN on two popular benchmarks, MNIST and Fashion MNIST , and obtained state-of-the-art accuracies for this sort of networks (97.0\% and 87.3\% respectively) with a negligible accuracy drop with respect to real-valued weights (0.4\% and 0.7\%, respectively).
Revised:  We validated BS4NN on two popular benchmarks, MNIST and Fashion-MNIST , and obtained state-of-the-art accuracies for this sort of networks (97.0\% and 87.3\% respectively) with a negligible accuracy drop with respect to real-valued weights (0.4\% and 0.7\%, respectively).
Edit intent: clarity
Original:  We validated BS4NN on two popular benchmarks, MNIST and Fashion MNIST , and obtained state-of-the-art accuracies for this sort of networks (97.0\% and 87.3\% respectively) with a negligible accuracy drop with respect to real-valued weights (0.4\% and 0.7\%, respectively).
Revised:  We validated BS4NN on two popular benchmarks, MNIST and Fashion MNIST , and obtained reasonable accuracies for this sort of networks (97.0\% and 87.3\% respectively) with a negligible accuracy drop with respect to real-valued weights (0.4\% and 0.7\%, respectively).
Edit intent: clarity
Original:  We validated BS4NN on two popular benchmarks, MNIST and Fashion MNIST , and obtained state-of-the-art accuracies for this sort of networks (97.0\% and 87.3\% respectively) with a negligible accuracy drop with respect to real-valued weights (0.4\% and 0.7\%, respectively).
Revised:  We validated BS4NN on two popular benchmarks, MNIST and Fashion MNIST , and obtained state-of-the-art accuracies for this sort of network (97.0\% and 87.3\% respectively) with a negligible accuracy drop with respect to real-valued weights (0.4\% and 0.7\%, respectively).
Edit intent: fluency
Original: As a technology that can protect the information on the original image of being disclosed and accurately extract the embedded information , the reversible data hiding in encrypted images (RDHEI) has been widely concerned by researchers.
Revised: As a technology that can prevent the information of original image and additional information from being disclosed , the reversible data hiding in encrypted images (RDHEI) has been widely concerned by researchers.
Edit intent: clarity
Original:  One of the current challenges is how to further improve the performance of the RDHEI method.
Revised:  How to further improve the performance of the RDHEI method.
Edit intent: clarity
Original:  In this paper, a high-capacity RDHEI method based on bit plane compression of prediction error is proposed .
Revised:  In this paper, a high-capacity RDHEI method based on bit plane compression of prediction error .
Edit intent: clarity
Original:  Firstly, the image owner calculates the prediction error of the original image , next rearranges and compresses the obtained bit plane of prediction error , so as to reserve the room for embedding information, and then uses the encryption key to encrypt the prediction error after vacating the room .
Revised:  Firstly, to reserve the room for embedding information, the image owner rearranges and compresses the obtained bit plane of prediction error , so as to reserve the room for embedding information, and then uses the encryption key to encrypt the prediction error after vacating the room .
Edit intent: coherence
Original:  Firstly, the image owner calculates the prediction error of the original image , next rearranges and compresses the obtained bit plane of prediction error , so as to reserve the room for embedding information, and then uses the encryption key to encrypt the prediction error after vacating the room .
Revised:  Firstly, the image owner calculates the prediction error of the original image , next rearranges and compresses the bit plane of prediction error , so as to reserve the room for embedding information, and then uses the encryption key to encrypt the prediction error after vacating the room .
Edit intent: clarity
Original:  The information hiding device encrypts the additional information by the information hiding key, and embeds additional information into the encrypted image.
Revised:  The information hiding device embeds the additional information by the information hiding key, and embeds additional information into the encrypted image.
Edit intent: clarity
Original:  This paper makes full use of the correlation between neighboring pixelsand obtains high capacity .
Revised:  This paper makes full use of the correlation between adjacent pixels .
Edit intent: clarity
Original:  Experimental results show that this method can  provide higher embedding capacity than state-of-the-art methods .
Revised:  Experimental results show that this method can provide higher embedding capacity than state-of-the-art works .
Edit intent: clarity
Original: As a technology that can prevent the information of original image and additional information from being disclosed, the reversible data hiding in encrypted images (RDHEI) has been widely concerned by researchers.
Revised: As a technology that can prevent the information from being disclosed, the reversible data hiding in encrypted images (RDHEI) has been widely concerned by researchers.
Edit intent: clarity
Original:  To this end, this work proposes a high-capacity RDHEI method based on bit plane compression of prediction error  .
Revised:  To this end, this work proposes a high-capacity RDHEI method based on bit-plane compression of prediction error .
Edit intent: fluency
Original:  This paper makes full use of the correlation between adjacent pixels . Experimental results show that this method can realize the real reversibility and provide higher embedding capacity than state-of-the-art  works.
Revised:  This paper makes full use of the correlation between adjacent pixels . Experimental results show that the proposed method brings higher embedding capacity than state-of-the-art works.
Edit intent: clarity
Original:  We give two new time-space trade-offs for the problem.
Revised:  We give two time-space trade-offs for the problem.
Edit intent: clarity
Original:    Our first result achieves near-linear space and optimal query time  , and our second result achieves linear space and near optimal query time .
Revised:  . Our first result achieves near-linear space and optimal query time , and our second result achieves linear space and near optimal query time .
Edit intent: fluency
Original:  We then quantify its direct impact on the convergence analysis, namely, the (strong) consistency, discrete coercivity  and boundedness (with h^{\delta}-dependency), and we derive updated error estimates for both discrete energy- and L^{2}-norms.
Revised:  We then quantify its direct impact on the convergence analysis, namely, the (strong) consistency, discrete coercivity , and boundedness (with h^{\delta}-dependency), and we derive updated error estimates for both discrete energy- and L^{2}-norms.
Edit intent: fluency
Original:  The reformulation presented in this paper exploits the underlying functional structure presented in the seminal paper on the Theory of Functional Connections to ease the derivation of these interpolating functionals -- called constrained expressions -- and provides rigorous terminology that lends itself to straightforward derivations of mathematical proofs regarding the properties of these constrained expressions.
Revised:  The reformulation presented in this paper exploits the underlying functional structure presented in the seminal paper on the Theory of Functional Connections to ease the derivation of these interpolating functionals--called constrained expressions--and provides rigorous terminology that lends itself to straightforward derivations of mathematical proofs regarding the properties of these constrained expressions.
Edit intent: fluency
Original:  For a given social distancing individual strategies, we establish the epidemic reproduction number \mathfrak{R _0 which can be used to identify network vulnerability and inform vaccination policies.
Revised:  For a given social distancing individual strategies, we establish the epidemic reproduction number R _0 which can be used to identify network vulnerability and inform vaccination policies.
Edit intent: fluency
Original:  Recently, these logics have been extended to (pre )closure spaces , a generalization of topological spaces covering also the notion of neighbourhood in discrete structures  .
Revised:  Recently, these logics have been extended to (pre )closure spaces are a generalization of topological spaces covering also the notion of neighbourhood in discrete structures .
Edit intent: clarity
Original:  To this end we define the categorical notion of closure (hyper) doctrine, which are doctrines endowed with inflationary operators (and subject to suitable conditions).
Revised:  To this end , we introduce the notion of closure (hyper) doctrine, which are doctrines endowed with inflationary operators (and subject to suitable conditions).
Edit intent: coherence
Original:  To this end we define the categorical notion of closure (hyper) doctrine, which are doctrines endowed with inflationary operators (and subject to suitable conditions).
Revised:  To this end we define the categorical notion of closure (hyper) doctrines, i.e. doctrines endowed with inflationary operators (and subject to suitable conditions).
Edit intent: coherence
Original:  The generality and effectiveness of this notion is demonstrated by many examples arising naturally from topological spaces, fuzzy sets, algebraic structures, coalgebras, and covering at once also known cases such as Kripke frames and probabilistic frames (i.e., Markov chains).
Revised:  The generality and effectiveness of this concept is witnessed by many examples arising naturally from topological spaces, fuzzy sets, algebraic structures, coalgebras, and covering at once also known cases such as Kripke frames and probabilistic frames (i.e., Markov chains).
Edit intent: clarity
Original:  By leveraging general categorical constructions, we provide a first axiomatisation and sound and complete semantics for propositional/regular/first order logics for closure operators.
Revised:  By leveraging general categorical constructions, we provide axiomatisations and sound and complete semantics for propositional/regular/first order logics for closure operators.
Edit intent: clarity
Original:  Therefore, closure hyperdoctrines are useful both for refining and improving the theory of existing spatial logics, but especially for the definition of new spatial logics for various applications.
Revised:  Therefore, closure hyperdoctrines are useful both for refining and improving the theory of existing spatial logics, but especially for the definition of new spatial logics for new applications.
Edit intent: clarity
Original:  We qualitatively discuss some conditions, beyond the scope of simple models, under which a lockdown might increase or decrease the epidemic's final toll in the real world.
Revised:  We qualitatively discuss some conditions, beyond the scope of simple models, but could cause it to increase or decrease the epidemic's final toll in the real world.
Edit intent: clarity
Original:  We qualitatively discuss some conditions, beyond the scope of simple models, under which a lockdown might increase or decrease the epidemic's final toll in the real world.
Revised:  We qualitatively discuss some conditions, beyond the scope of simple models, under which a lockdown might increase or decrease an epidemic's final toll in the real world.
Edit intent: fluency
Original:  Here, we propose an alternative neural network-based method called NPLIC to perform PLIC calculations.
Revised:  Here, we propose an alternative neural network based method called NPLIC to perform PLIC calculations.
Edit intent: fluency
Original:  This  embedding makes it possible to predict which verbs will be applicable to a given object, as captured in human judgments of affordance.
Revised:  This object embedding makes it possible to predict which verbs will be applicable to a given object, as captured in human judgments of affordance.
Edit intent: clarity
Original:  This  embedding makes it possible to predict which verbs will be applicable to a given object, as captured in human judgments of affordance.
Revised:  This embedding makes it possible to predict human judgments of affordance.
Edit intent: clarity
Original:  In this work, we have evaluated top-performing classification models and four different vectorizers, for classifying comments which are a mix of different combinations of English and Malayalam (only English, only Malayalam and Mix of English and Malayalam).
Revised:  In this work, we have evaluated top-performing classification models for classifying comments which are a mix of different combinations of English and Malayalam (only English, only Malayalam and Mix of English and Malayalam).
Edit intent: clarity
Original:  Further, we have also evaluated 3 multilingual sub-types of the novel NLP language model, BERTand compared its performance to the conventional machine learning classification techniques.
Revised:  Further, we have also evaluated 3 multilingual sub-types of the novel NLP language model, BERTand compared its performance to the traditional machine learning classification techniques.
Edit intent: clarity
Original:  XLM was the top-performing BERT model with an accuracy of 67.31. Random Forest with Term Frequency Vectorizer was the best the top-performing model out of all the traditional classification models with an accuracy of 63.59.
Revised:  XLM was the top-performing BERT model with an accuracy of 67.31. Random Forest with Term Frequency Vectorizer was the best performing model out of all the traditional classification models with an accuracy of 63.59.
Edit intent: fluency
Original:  Classical minimum-entropy moment (M_N) closures are a class of reduced models for kinetic equations that conserve many of the fundamental physical properties of the solutions.
Revised:  Classical minimum-entropy moment closures are a class of reduced models for kinetic equations that conserve many of the fundamental physical properties of the solutions.
Edit intent: clarity
Original:  Classical minimum-entropy moment (M_N) closures are a class of reduced models for kinetic equations that conserve many of the fundamental physical properties of the solutions.
Revised:  Classical minimum-entropy moment (M_N) closures are a class of reduced models for kinetic equations that conserve many of the fundamental physical properties of solutions.
Edit intent: fluency
Original:  However, their practical use is limited by their high-computational cost, as an optimization problem has to be solved for every cell in the space-time grid.
Revised:  However, their practical use is limited by their high computational cost, as an optimization problem has to be solved for every cell in the space-time grid.
Edit intent: fluency
Original: Ideal point estimation and dimensionality reduction have long been utilized to simplify and cluster complex, high-dimensional political data(e. g., roll-call votes and surveys) for use in analysis and visualization.
Revised: Scaling methods have long been utilized to simplify and cluster complex, high-dimensional political data(e. g., roll-call votes and surveys) for use in analysis and visualization.
Edit intent: clarity
Original: Ideal point estimation and dimensionality reduction have long been utilized to simplify and cluster complex, high-dimensional political data(e. g., roll-call votes and surveys) for use in analysis and visualization.
Revised: Ideal point estimation and dimensionality reduction have long been utilized to simplify and cluster high-dimensional political data(e. g., roll-call votes and surveys) for use in analysis and visualization.
Edit intent: clarity
Original:  However, these PCs, which usually reflect the left-right political spectrum, are sometimes uninformative in explaining significant differences in the distribution of the data(e. g., how to categorize a set of highly-moderate voters).
Revised:  However, these PCs, which usually reflect the left-right political spectrum, are sometimes uninformative in explaining significant differences in the data.
Edit intent: clarity
Original:  To tackle this  issue, we adopt an emerging analysis approach , called contrastive learning.
Revised:  To tackle this issue, we adopt an emerging analysis approach called contrastive learning.
Edit intent: fluency
Original:  We contribute to the field of contrastive learning by extending it to multiple correspondence analysis (MCA)  to enable an analysis of data often encountered by social scientists---namely binary, ordinal, and nominal variables.
Revised:  We contribute to this emerging field by extending its ideas to multiple correspondence analysis (MCA) to enable an analysis of data often encountered by social scientists---namely binary, ordinal, and nominal variables.
Edit intent: clarity
Original:  We demonstrate the utility of contrastive MCA (cMCA) by analyzing three different surveys : The 2015 Cooperative Congressional Election Study, 2012 UTokyo-Asahi Elite Survey, and 2018 European Social Survey .
Revised:  We demonstrate the utility of contrastive MCA (cMCA) by analyzing three different surveys of voters in Europe, Japan, and the United States .
Edit intent: clarity