wanyu/IteraTeR_v2 huggingface dataset:
Original:  By stacking multiple CNN layers , the model could explore long-range dependency of explored features in top layerswith increasing of feature abstraction.
Revised:  By stacking multiple CNN layers , the model can explore the long-range dependency of explored features in top layerswith increasing of feature abstraction.
Edit intent: fluency
Original:  Howeverit is also possible that the discriminative features with short-range dependency which are distributed locally are smooth out in the final representation.
Revised:  Howeverit is also possible that the discriminative features with short-range dependency ) are smoothed out in the final representation.
Edit intent: clarity
Original:  Based on mathematic formulations, we revealed that the conventional residual CNN (ResCNN) model could be explained as a special case of the proposed MSA model, and the MSA model could use the ResCNN as a backbone with an attentive feature weighting in consecutive scales.
Revised:  Based on mathematic formulations, we revealed that the conventional residual CNN (ResCNN) model when the ResCNN is used as a backbone with an attentive feature weighting in consecutive scales.
Edit intent: clarity
Original:  We tested the proposed model on two AEC data corpora, one is for urban acoustic event classification task, the other is for acoustic event detection in smart car environments.
Revised:  We tested the proposed model on two AEC datasets: one is an urban AEC task, and the other is for acoustic event detection in smart car environments.
Edit intent: clarity
Original:  We tested the proposed model on two AEC data corpora, one is for urban acoustic event classification task, the other is for acoustic event detection in smart car environments.
Revised:  We tested the proposed model on two AEC data corpora, one is for urban acoustic event classification task, the other is an AEC task in smart car environments.
Edit intent: clarity
Original:  Our results showed that the proposed MSA model effectively improved the performance on the current state-of-the-art deep learning algorithms.
Revised:  Experimental results show that the proposed MSA model effectively improved the performance on the current state-of-the-art deep learning algorithms.
Edit intent: fluency
Original:  In our implementation, the algorithm is executed on a custom embedded digital processor that accompanies a mixed-signal substrate consisting of spiking neurons and synapse circuits.
Revised:  In our implementation, the algorithm is executed on a custom embedded digital processor located on chip, accompanying the mixed-signal substrate consisting of spiking neurons and synapse circuits.
Edit intent: clarity
Original:  In our implementation, the algorithm is executed on a custom embedded digital processor that accompanies a mixed-signal substrate consisting of spiking neurons and synapse circuits.
Revised:  In our implementation, the algorithm is executed on a custom embedded digital processor that accompanies a mixed-signal substrate of spiking neurons and synapse circuits.
Edit intent: clarity
Original:  We evaluated our proposed algorithm in a simple supervised learning scenario, showing its ability to optimize the network topology with respect to the nature of its training data, as well as its overall computational efficiency.
Revised:  We evaluated our implementation in a simple supervised learning scenario, showing its ability to optimize the network topology with respect to the nature of its training data, as well as its overall computational efficiency.
Edit intent: clarity
Original: Considering the worst-case scenario, junction tree algorithm remains the most efficient and general solution for exact MAP inference on discrete graphical models . Unfortunately, its main tractability assumption requires the treewidth of a corresponding MRF to be bounded strongly limiting the range of admissible applications.
Revised: Considering the worst-case scenario, junction tree algorithm remains the most general solution for exact MAP inference on discrete graphical models . Unfortunately, its main tractability assumption requires the treewidth of a corresponding MRF to be bounded strongly limiting the range of admissible applications.
Edit intent: clarity
Original:  This , however, always results in a fully-connected graph making exact inference by means of this algorithm intractable.
Revised:  That , however, always results in a fully-connected graph making exact inference by means of this algorithm intractable.
Edit intent: fluency
Original:  Nevertheless, depending on the structure of the global factors , we can further relax the conditions for an efficient inference ] ]  . In this paper we reformulate the work in 1%DIFDELCMD < ] %%% and present a better way to establish the theory also extending the set of handleable problem instances for free - since it requires only a simple modification of the originally presented algorithm.
Revised:  Previous work ] ] . In this paper we reformulate the work in 1%DIFDELCMD < ] %%% and present a better way to establish the theory also extending the set of handleable problem instances for free - since it requires only a simple modification of the originally presented algorithm.
Edit intent: clarity
Original:  Nevertheless, depending on the structure of the global factors , we can further relax the conditions for an efficient inference ] ]  . In this paper we reformulate the work in 1%DIFDELCMD < ] %%% and present a better way to establish the theory also extending the set of handleable problem instances for free - since it requires only a simple modification of the originally presented algorithm.
Revised:  Nevertheless, depending on the structure of the global factors , we can further relax the conditions for an efficient inference ]- ] . In this paper we reformulate the work in 1%DIFDELCMD < ] %%% and present a better way to establish the theory also extending the set of handleable problem instances for free - since it requires only a simple modification of the originally presented algorithm.
Edit intent: coherence
Original:  Nevertheless, depending on the structure of the global factors , we can further relax the conditions for an efficient inference ] ]  . In this paper we reformulate the work in 1%DIFDELCMD < ] %%% and present a better way to establish the theory also extending the set of handleable problem instances for free - since it requires only a simple modification of the originally presented algorithm.
Revised:  Nevertheless, depending on the structure of the global factors , we can further relax the conditions for an efficient inference ] ] . In this paper 1%DIFDELCMD < ] %%% and present a better way to establish the theory also extending the set of handleable problem instances for free - since it requires only a simple modification of the originally presented algorithm.
Edit intent: clarity
Original:  Nevertheless, depending on the structure of the global factors , we can further relax the conditions for an efficient inference ] ]  . In this paper we reformulate the work in 1%DIFDELCMD < ] %%% and present a better way to establish the theory also extending the set of handleable problem instances for free - since it requires only a simple modification of the originally presented algorithm.
Revised:  Nevertheless, depending on the structure of the global factors , we can further relax the conditions for an efficient inference ] ] . In this paper we reformulate the work in %DIFDELCMD < ] %%% and present a better way to establish the theory also extending the set of handleable problem instances for free - since it requires only a simple modification of the originally presented algorithm.
Edit intent: coherence
Original:  Only individuals attending randomized pseudonym key signing events obtain such proofs. encointer also features private transactions and scalable, trustless off-chain smart contracts .
Revised:  Only individuals attending randomized pseudonym key signing parties to obtain a proof-of-personhood. Encointer features privacy by design and purchasing-power adjusted transaction fees .
Edit intent: clarity
Original: The perception system of an autonomous vehicle is responsible for mapping sensor observations into a semantic description of the vehicle's environment.
Edit intent: coherence
Original:  3D object detection is a common function within this system and outputs a list of 3D bounding boxes around objects of interest.
Revised:  3D object detection is a common function within the perception system of an autonomous vehicle and outputs a list of 3D bounding boxes around objects of interest.
Edit intent: clarity
Original:  This paper proposes two schemes for cooperative 3D object detection  .
Revised:  This article proposes two schemes for cooperative 3D object detection .
Edit intent: fluency
Original:  In contrast, the late fusion scheme fuses the independently estimated bounding boxes from multiple spatially diverse sensors.
Revised:  In contrast, the late fusion scheme fuses the independently detected bounding boxes from multiple spatially diverse sensors.
Edit intent: clarity
Original:  The evaluation show that the early fusion approach outperforms late fusion by a significant margin at the cost of higher communication bandwidth.
Revised:  The evaluation shows that the early fusion approach outperforms late fusion by a significant margin at the cost of higher communication bandwidth.
Edit intent: fluency
Original:  While parallel programming is easier with frameworks such as OpenMP , the possibility of data races in these programs still persists .
Revised:  While parallel programming is easier with frameworks such as OpenMP is relatively easy, but data races in these programs still persists .
Edit intent: clarity
Original:  We compare our tool with other state-of-the-art data race checkers on a variety of well-established benchmarks.
Revised:  We compare LLOV with other state-of-the-art data race checkers on a variety of well-established benchmarks.
Edit intent: clarity
Original:  We show that the precision, accuracy, and the F1 score of our tool is comparable to other checkers while being orders of magnitude faster.
Revised:  We show that the precision, accuracy, and the F1 score of LLOV is comparable to other checkers while being orders of magnitude faster.
Edit intent: clarity
Original:  To the best of our knowledge, this work is the only tool among the state-of-the-art data race checkers that can verify a  FORTRAN program to be datarace free.
Revised:  To the best of our knowledge, LLOV is the only tool among the state-of-the-art data race checkers that can verify a FORTRAN program to be datarace free.
Edit intent: clarity
Original:  To the best of our knowledge, this work is the only tool among the state-of-the-art data race checkers that can verify a  FORTRAN program to be datarace free.
Revised:  To the best of our knowledge, this work is the only tool among the state-of-the-art data race checkers that can verify a FORTRAN program to be data race free.
Edit intent: fluency
Original:  A SORTE conjugates the classical B\"uhlmann 's notion of an equilibrium risk exchange with a capital allocation principle based on systemic expected utility optimization.
Revised:  A SORTE conjugates the classical B\"uhlmann 's notion of a Risk Exchange Equilibrium with a capital allocation principle based on systemic expected utility optimization.
Edit intent: clarity
Original:  The latter could be either enforced by an external regulator or be agreed on by the participants in the market .
Revised:  The latter could be either enforced by an external regulator or be agreed on by the participants in the game .
Edit intent: clarity
Original:  We prove existence, uniqueness, Pareto optimality and the Nash Equilibrium property of the newly defined Multivariate Systemic Optimal Risk Transfer Equilibrium.
Revised:  We prove existence, uniqueness, and the Nash Equilibrium property of the newly defined Multivariate Systemic Optimal Risk Transfer Equilibrium.
Edit intent: coherence
Original:  A SORTE conjugates the classical B\"{u}hlmann's notion of a Risk Exchange Equilibrium with a capital allocation principle based on systemic expected utility optimization.
Revised:  A SORTE conjugates the classical B\"{u}hlmann's notion of a risk exchange equilibrium with a capital allocation principle based on systemic expected utility optimization.
Edit intent: fluency
Original: We propose the first practical scheme for end-to-end optical backpropagation in neural networks . Using saturable absorption for the nonlinear units, we find that the backward propagating gradients required to train the network can be approximated in a surprisingly simple pump-probe scheme that requires only passive optical elements.
Revised: We propose the first practical scheme for end-to-end optical backpropagation in neural networks . Using saturable absorption for the nonlinear units, we find that the backward propagating gradients required to train the network can be approximated in a pump-probe scheme that requires only passive optical elements.
Edit intent: clarity
Original:  With backpropagation through nonlinear units an outstanding challenge to the field, this work provides a feasible path towards truly all-optical neural networks .
Revised:  This scheme is compatible with leading optical neural network proposals and therefore provides a feasible path towards truly all-optical neural networks .
Edit intent: clarity
Original:  With backpropagation through nonlinear units an outstanding challenge to the field, this work provides a feasible path towards truly all-optical neural networks .
Revised:  With backpropagation through nonlinear units an outstanding challenge to the field, this work provides a feasible path towards end-to-end optical training .
Edit intent: clarity
Original: This paper presents a complete theory of the relationship between the minimal bases and indices of rational matrices and those of their strong linearizations  .
Revised: A complete theory of the relationship between the minimal bases and indices of rational matrices and those of their strong linearizations .
Edit intent: clarity
Original: This paper presents a complete theory of the relationship between the minimal bases and indices of rational matrices and those of their strong linearizations  .
Revised: This paper presents a complete theory of the relationship between the minimal bases and indices of rational matrices and those of their strong linearizations is presented .
Edit intent: clarity
Original:  These first results extend under different assumptions pioneer results obtained by Verghese, Van Dooren and Kailath in 1979-80, which have not been sufficiently recognized in the modern literature in our opinion.
Revised:  This is related to pioneer results obtained by Verghese, Van Dooren and Kailath in 1979-80, which have not been sufficiently recognized in the modern literature in our opinion.
Edit intent: clarity
Original:  Next, it is shown that the definitions of linearizations and strong linearizations do not guarantee any relationship between the minimal bases and indices of the linearizations and the rational matrices in general , since only the total sums of the minimal indices are related to each other in the strong case .
Revised:  Next, it is shown that the definitions of linearizations and strong linearizations do not guarantee any relationship between the minimal bases and indices of the linearizations and the rational matrices in general .
Edit intent: coherence
Original:  We review modern AQC and derive the first algorithm for transformation estimation and point set alignment suitable for AQC.
Revised:  We review AQC and derive the first algorithm for transformation estimation and point set alignment suitable for AQC.
Edit intent: clarity
Original:  Our algorithm has a subquadratic computational complexity of  state preparation.
Revised:  Our algorithm has a subquadratic computational complexity of the state preparation.
Edit intent: fluency
Original:  We perform a systematic experimental analysis of the proposed approach and show several examples of successful point set alignment by simulated sampling .
Revised:  Examples of successful transformation estimation and point set alignment by simulated sampling .
Edit intent: clarity
Original:  Given the abundance of parallel data available (Tiedemann, 2012), we propose a bilingual extension of the CBOW method which leverages sentence-aligned corpora to obtain robust cross-lingual word and sentence representations.
Revised:  We propose a bilingual extension of the CBOW method which leverages sentence-aligned corpora to obtain robust cross-lingual word and sentence representations.
Edit intent: coherence
Original:  Our approach significantly improves cross-lingual sentence retrieval performance over all other approaches , as well as convincingly outscores mapping methods while maintaining parity with jointly trained methods on word-translation.
Revised:  Our approach significantly improves cross-lingual sentence retrieval performance over all other approaches while maintaining parity with jointly trained methods on word-translation.
Edit intent: coherence
Original:  As an additional advantage, our bilingual method also improves the quality of monolingual word vectors despite training on much smaller datasets.
Revised:  As an additional advantage, our bilingual method leads to a much more pronounced improvement in the the quality of monolingual word vectors despite training on much smaller datasets.
Edit intent: clarity
Original:  We establish a connection to the Min-Plus-Convolution problem, which is of particular interest in fine-grained complexity theory and can be solved naively in time O(n^2).
Revised:  We establish a connection to Min-Plus-Convolution problem, which is of particular interest in fine-grained complexity theory and can be solved naively in time O(n^2).
Edit intent: fluency
Original:  We establish a connection to the Min-Plus-Convolution problem, which is of particular interest in fine-grained complexity theory and can be solved naively in time O(n^2).
Revised:  We establish a connection to the Min-Plus-Convolution , a problem that is of particular interest in fine-grained complexity theory and can be solved naively in time O(n^2).
Edit intent: fluency
Original:  Thus, assuming the Min-Plus-Convolution conjecture from fine-grained complexity theory, there are no approximation schemes for Subset Sum with strongly subquadratic dependence on n and 1/\varepsilon.
Revised:  Thus, assuming the Min-Plus-Convolution conjecture from fine-grained complexity theory, there is no approximation scheme for Subset Sum with strongly subquadratic dependence on n and 1/\varepsilon.
Edit intent: fluency
Original: We introduce a model of public opinion expression.
Revised: Modelling efforts in opinion dynamics have to a large extent ignored that opinion exchange between individuals can also have an effect on how willing they are to express their opinion publicly. Here, we introduce a model of public opinion expression.
Edit intent: clarity
Original:  The model identifies structural conditions for public opinion predominance of different groups.
Revised:  The model identifies social-structural conditions for public opinion predominance of different groups.
Edit intent: clarity
Original:  We also show under which circumstances a minority can dominate public discourse .
Revised:  Among other findings, we show under which circumstances a minority can dominate public discourse .
Edit intent: clarity
Original: Dormancy of bacteria can be induced by starvation stress as prolonged lag time, and often contributes to the antibiotic tolerance of bacteria.
Revised: Prolonged lag time can be induced by starvation stress as prolonged lag time, and often contributes to the antibiotic tolerance of bacteria.
Edit intent: clarity
Original: Dormancy of bacteria can be induced by starvation stress as prolonged lag time, and often contributes to the antibiotic tolerance of bacteria.
Revised: Dormancy of bacteria can be induced by starvation contributing to the antibiotic tolerance of bacteria.
Edit intent: clarity
Original:  We analyze the optimal lag time for wake-up from the starvation to survive the iterative and stochastic application of antibiotics.
Revised:  We analyze the optimal lag time to survive and grow the iterative and stochastic application of antibiotics.
Edit intent: clarity
Original:  By using a population dynamics model , we show that the optimal lag time exhibits a discontinuous transition from zero lag time to a finite lag time when the severeness of the application of the antibiotic is increased.
Revised:  A simple model shows that the optimal lag time exhibits a discontinuous transition from zero lag time to a finite lag time when the severeness of the application of the antibiotic is increased.
Edit intent: clarity
Original:  By using a population dynamics model , we show that the optimal lag time exhibits a discontinuous transition from zero lag time to a finite lag time when the severeness of the application of the antibiotic is increased.
Revised:  By using a population dynamics model , we show that the optimal lag time exhibits a discontinuous transition when the severeness of the application of the antibiotic is increased.
Edit intent: clarity
Original:  By using a population dynamics model , we show that the optimal lag time exhibits a discontinuous transition from zero lag time to a finite lag time when the severeness of the application of the antibiotic is increased.
Revised:  By using a population dynamics model , we show that the optimal lag time exhibits a discontinuous transition from zero lag time to a finite lag time when the severeness of the antibiotic is increased.
Edit intent: clarity
Original:   When the bacterial populations are able to split into subpopulations to have two phenotypes with different average lag time , the fraction of the finite lag time population shows continuous transition when changing the severeness of antibiotics application .
Revised:  When the bacterial populations are able to have two phenotypes with different average lag time , the fraction of the finite lag time population shows continuous transition when changing the severeness of antibiotics application .
Edit intent: clarity
Original:  However, they differ in their general architectures (with key details such as the support for the parallel execution of graph updates  , or the incorporated graph data organization), the types of updates and workloads allowed, and many others.
Revised:  However, they differ in their general architectures (with key details such as the support for the concurrent execution of graph updates , or the incorporated graph data organization), the types of updates and workloads allowed, and many others.
Edit intent: clarity
Original:  We focus on identifying the fundamental system designs and on understanding their support for concurrency and parallelism , and for different graph updates as well as analytics workloads.
Revised:  We focus on identifying the fundamental system designs and on understanding their support for concurrency , and for different graph updates as well as analytics workloads.
Edit intent: clarity
Original:  In this work, we provide the first deterministic algorithm using directional persistence diagrams to reconstruct simplicial complexes in arbitrary finite dimension.
Revised:  In this work, we provide the first algorithm using directional persistence diagrams to reconstruct simplicial complexes in arbitrary finite dimension.
Edit intent: clarity
Original: We present a continuous formulation of machine learning, as a problem in the calculus of variations and differential-integral equations, very much in the spirit of classical numerical analysis and statistical physics .
Revised: We present a continuous formulation of machine learning, as a problem in the calculus of variations and differential-integral equations, in the spirit of classical numerical analysis and statistical physics .
Edit intent: coherence