wanyu/IteraTeR_v2 huggingface dataset:
Original: Digital computers store information in the form of bits that can take on one of two values 0 and 1, while quantum computers are based on qubits that are described by a complex wavefunction  whose squared magnitude gives the probability of measuring either a 0 or a 1. Here  we make the case for a probabilistic computer based on p-bits which take on values 0 and 1 with controlled probabilities and can be implemented with specialized compact energy-efficient hardware.
Revised: Digital computers store information in the form of bits that can take on one of two values 0 and 1, while quantum computers are based on qubits that are described by a complex wavefunction whose squared magnitude gives the probability of measuring either 0 or a 1. Here we make the case for a probabilistic computer based on p-bits which take on values 0 and 1 with controlled probabilities and can be implemented with specialized compact energy-efficient hardware.
Edit intent: fluency
Original: Digital computers store information in the form of bits that can take on one of two values 0 and 1, while quantum computers are based on qubits that are described by a complex wavefunction  whose squared magnitude gives the probability of measuring either a 0 or a 1. Here  we make the case for a probabilistic computer based on p-bits which take on values 0 and 1 with controlled probabilities and can be implemented with specialized compact energy-efficient hardware.
Revised: Digital computers store information in the form of bits that can take on one of two values 0 and 1, while quantum computers are based on qubits that are described by a complex wavefunction whose squared magnitude gives the probability of measuring either a 0 or 1. Here we make the case for a probabilistic computer based on p-bits which take on values 0 and 1 with controlled probabilities and can be implemented with specialized compact energy-efficient hardware.
Edit intent: fluency
Original: Digital computers store information in the form of bits that can take on one of two values 0 and 1, while quantum computers are based on qubits that are described by a complex wavefunction  whose squared magnitude gives the probability of measuring either a 0 or a 1. Here  we make the case for a probabilistic computer based on p-bits which take on values 0 and 1 with controlled probabilities and can be implemented with specialized compact energy-efficient hardware.
Revised: Digital computers store information in the form of bits that can take on one of two values 0 and 1, while quantum computers are based on qubits that are described by a complex wavefunction whose squared magnitude gives the probability of measuring either a 0 or a 1. Here , we make the case for a probabilistic computer based on p-bits which take on values 0 and 1 with controlled probabilities and can be implemented with specialized compact energy-efficient hardware.
Edit intent: fluency
Original: Digital computers store information in the form of bits that can take on one of two values 0 and 1, while quantum computers are based on qubits that are described by a complex wavefunction  whose squared magnitude gives the probability of measuring either a 0 or a 1. Here  we make the case for a probabilistic computer based on p-bits which take on values 0 and 1 with controlled probabilities and can be implemented with specialized compact energy-efficient hardware.
Revised: Digital computers store information in the form of bits that can take on one of two values 0 and 1, while quantum computers are based on qubits that are described by a complex wavefunction whose squared magnitude gives the probability of measuring either a 0 or a 1. Here we make the case for a probabilistic computer based on p-bits, which take on values 0 and 1 with controlled probabilities and can be implemented with specialized compact energy-efficient hardware.
Edit intent: fluency
Original:  We propose a generic architecture for such p-computers and show that they can significantly accelerate randomized algorithms used in a wide variety of applications including but not limited to Bayesian networks, optimization, Ising models  and quantum Monte Carlo.
Revised:  We propose a generic architecture for such and show that they can significantly accelerate randomized algorithms used in a wide variety of applications including but not limited to Bayesian networks, optimization, Ising models and quantum Monte Carlo.
Edit intent: clarity
Original:  We propose a generic architecture for such p-computers and show that they can significantly accelerate randomized algorithms used in a wide variety of applications including but not limited to Bayesian networks, optimization, Ising models  and quantum Monte Carlo.
Revised:  We propose a generic architecture for such p-computers and show that they can significantly accelerate randomized algorithms used in a wide variety of applications including but not limited to Bayesian networks, optimization, Ising models , and quantum Monte Carlo.
Edit intent: fluency
Original:  Specifically, we detect characteristics corresponding to the proximity between people, their relative walking speeds, the group size, and interactions between group members.
Revised:  Specifically, we detect characteristics corresponding to proximity between people, their relative walking speeds, the group size, and interactions between group members.
Edit intent: fluency
Original:  We highlight the performance of our social navigation algorithm on a Turtlebot robot and demonstrate its benefits in terms of multiple metrics: freezing rate (57\% decrease), low deviation (35.7\% decrease),  path length of the trajectory(23.2\% decrease).
Revised:  We highlight the performance of our social navigation algorithm on a Turtlebot robot and demonstrate its benefits in terms of multiple metrics: freezing rate (57\% decrease), deviation (35.7\% decrease), path length of the trajectory(23.2\% decrease).
Edit intent: clarity
Original:  We highlight the performance of our social navigation algorithm on a Turtlebot robot and demonstrate its benefits in terms of multiple metrics: freezing rate (57\% decrease), low deviation (35.7\% decrease),  path length of the trajectory(23.2\% decrease).
Revised:  We highlight the performance of our social navigation algorithm on a Turtlebot robot and demonstrate its benefits in terms of multiple metrics: freezing rate (57\% decrease), low deviation (35.7\% decrease), and path length of the trajectory(23.2\% decrease).
Edit intent: coherence
Original:  We propose AMMPERE , an abstract computation model for performing universal privacy-preserving entity resolution. %DIFDELCMD < \amppere %%%  offers abstractions that encapsulate multiple algorithmic and platform-agnostic approaches using variants of Jaccard similarity to perform private data matching and entity resolution.
Revised:  We propose AMMPERE , an abstract computation model for performing universal privacy-preserving entity resolution. %DIFDELCMD < \amppere %%% offers abstractions that encapsulate multiple algorithmic and platform-agnostic approaches using variants of Jaccard similarity to perform private data matching and entity resolution.
Edit intent: fluency
Original:  We present the Reddit Reports of Chronic Pain (RRCP) dataset, which comprises social media textual descriptions and discussion of various forms of chronic pain experiences, as reported from the perspective of different base pathologies .
Revised:  We present the Reddit Reports of Chronic Pain (RRCP) dataset, aimed at being a standard for future research on this underdeveloped area. Methods: Define and validate the RRCP dataset for a set of pathologies related to chronic pain .
Edit intent: clarity
Original:  For each pathology, we identify the main concerns emergent of its consequent experience of chronic pain , as represented by the subset of documents explicitly related to it.
Revised:  For each pathology, identify the main concerns emergent of its consequent experience of chronic pain , as represented by the subset of documents explicitly related to it.
Edit intent: fluency
Original:  For each pathology, we identify the main concerns emergent of its consequent experience of chronic pain , as represented by the subset of documents explicitly related to it.
Revised:  For each pathology, we identify the main qualities emergent of the consequent experience of chronic pain , as represented by the subset of documents explicitly related to it.
Edit intent: clarity
Original:  Finally, we argue that our unsupervised semantic analysis of descriptions of chronic pain echoes clinical research on how different pathologies manifest in terms of the chronic pain experience  .
Revised:  Finally, we argue that our unsupervised semantic analysis of descriptions of chronic pain reflects clinical knowledge on how different pathologies manifest in terms of the chronic pain experience .
Edit intent: clarity
Original:  Experimental results on FL benchmarks show that in most cases our approach provides models with higher accuracy and fairness than state-of-the-art methods.
Revised:  Experimental results on FL benchmarks show that our approach provides models with higher accuracy and fairness than state-of-the-art methods.
Edit intent: clarity
Original:  Thus, we propose a new standardized benchmark dataset  derived from the famous Labeled Faces in the Wild (LFW).
Revised:  Thus, we propose a new standardized benchmark dataset and evaluation protocol derived from the famous Labeled Faces in the Wild (LFW).
Edit intent: clarity
Original:  In contrast to previous derivatives, which focus on pose, age, similarity, and adversarial attacks, our Cross-Quality Labeled Faces in the Wild (XQLFW) dataset maximizes the quality difference.
Revised:  In contrast to previous derivatives, which focus on pose, age, similarity, and adversarial attacks, our Cross-Quality Labeled Faces in the Wild (XQLFW) maximizes the quality difference.
Edit intent: clarity
Original:  Different methods have been proposed to detect face morphing attacks, however, with low generalizability to unexpected post-morphing processes.
Revised:  Various methods have been proposed to detect face morphing attacks, however, with low generalizability to unexpected post-morphing processes.
Edit intent: fluency
Original:  In this work, we address this generalization problem by adapting a pixel-wise supervision approach where we train a network to classify each pixel of the image into an attack or not during the training process , rather than only having one label for the whole image.
Revised:  In this work, we address this generalization problem by adapting a pixel-wise supervision approach where we train a network to classify each pixel of the image into an attack or not , rather than only having one label for the whole image.
Edit intent: clarity
Original:  Our pixel-wise morphing attack detection (PW-MAD) solution performs more accurately than a set of established baselines.
Revised:  Our pixel-wise morphing attack detection (PW-MAD) solution proved to perform more accurately than a set of established baselines.
Edit intent: clarity
Original:  More importantly, our approach shows high generalizability in comparison to related works, when evaluated on unknown re-digitized attacks.
Revised:  More importantly, PW-MAD shows high generalizability in comparison to related works, when evaluated on unknown re-digitized attacks.
Edit intent: clarity
Original:  Additionally to our PW-MAD approach, we create a new face morphing attack dataset with digital and re-digitized attacks and bona fide samples, namely the LMA-DRD dataset that will be made publicly available for research purposes  .
Revised:  Additionally to our PW-MAD approach, we create a new face morphing attack dataset with digital and re-digitized samples, namely the LMA-DRD dataset that will be made publicly available for research purposes .
Edit intent: clarity
Original:  Additionally to our PW-MAD approach, we create a new face morphing attack dataset with digital and re-digitized attacks and bona fide samples, namely the LMA-DRD dataset that will be made publicly available for research purposes  .
Revised:  Additionally to our PW-MAD approach, we create a new face morphing attack dataset with digital and re-digitized attacks and bona fide samples, namely the LMA-DRD dataset that is publicly available for research purposes .
Edit intent: clarity
Original:  Additionally to our PW-MAD approach, we create a new face morphing attack dataset with digital and re-digitized attacks and bona fide samples, namely the LMA-DRD dataset that will be made publicly available for research purposes  .
Revised:  Additionally to our PW-MAD approach, we create a new face morphing attack dataset with digital and re-digitized attacks and bona fide samples, namely the LMA-DRD dataset that will be made publicly available for research purposes upon request .
Edit intent: clarity
Original: We propose a new approach to analyses of musical pieces by using the exceptional musical icosahedra where all the major/minor triads are represented by golden triangles and golden gnomons.
Revised: We propose a new way of analyzing musical pieces by using the exceptional musical icosahedra where all the major/minor triads are represented by golden triangles and golden gnomons.
Edit intent: clarity
Original: We propose a new approach to analyses of musical pieces by using the exceptional musical icosahedra where all the major/minor triads are represented by golden triangles and golden gnomons.
Revised: We propose a new approach to analyses of musical pieces by using the exceptional musical icosahedra where all the major/minor triads are represented by golden triangles or golden gnomons.
Edit intent: fluency
Original:  The golden decomposition is a decomposition of a given harmony into some harmonies constructing the given harmony and represented  the golden figure (a golden triangle, a golden gnomon, or a golden rectangle).
Revised:  The golden decomposition is a decomposition of a given harmony into some harmonies constructing the given harmony and represented by the golden figure (a golden triangle, a golden gnomon, or a golden rectangle).
Edit intent: coherence
Original:  We show results of the golden analysis (analysis by the golden decomposition) of the tertian seventh chords and the mystic chords .
Revised:  We show results of the golden analysis (analysis by the golden decomposition) of the tertian seventh chords and the mystic chord .
Edit intent: fluency
Original:  Last, we apply the golden analysis to the famous prelude in C major by Johan Sebastian Bach (BWV 846).
Revised:  Last, we apply the golden analysis to the famous prelude in C major composed by Johann Sebastian Bach (BWV 846).
Edit intent: clarity
Original: We present an algorithm for maintaining a  3/2 + \epsilon  -approximate maximum matching on fully dynamic graphs in ) and }O(1)  deterministic worst-case update time (\sqrt{n ] ) and O_\epsilon(n) respectively.
Revised: We present deterministic algorithms for maintaining a 3/2 + \epsilon -approximate maximum matching on fully dynamic graphs in ) and }O(1) deterministic worst-case update time (\sqrt{n ] ) and O_\epsilon(n) respectively.
Edit intent: fluency
Original: We present an algorithm for maintaining a  3/2 + \epsilon  -approximate maximum matching on fully dynamic graphs in ) and }O(1)  deterministic worst-case update time (\sqrt{n ] ) and O_\epsilon(n) respectively.
Revised: We present an algorithm for maintaining a ( 3/2 + \epsilon -approximate maximum matching on fully dynamic graphs in ) and }O(1) deterministic worst-case update time (\sqrt{n ] ) and O_\epsilon(n) respectively.
Edit intent: fluency
Original: We present an algorithm for maintaining a  3/2 + \epsilon  -approximate maximum matching on fully dynamic graphs in ) and }O(1)  deterministic worst-case update time (\sqrt{n ] ) and O_\epsilon(n) respectively.
Revised: We present an algorithm for maintaining a 3/2 + \epsilon -approximate maximum matching in a fully dynamic graph with worst-case update times ) and }O(1) deterministic worst-case update time (\sqrt{n ] ) and O_\epsilon(n) respectively.
Edit intent: clarity
Original:  Further we show new deterministic and randomized (against adaptive adversary) reductions from \alpha-approximate dynamic matching algorithms to (\alpha, \delta [ [ [ [ \textbf{ [  )-approximate matching algorithms with%DIFDELCMD < \hat{O}(1) %%% and%DIFDELCMD < \tilde{O}(1) %%% blowup in update time respectively .
Revised:  Further we show new deterministic and randomized (against adaptive adversary) reductions from \alpha-approximate dynamic matching algorithms to (\alpha, \delta [ [ [ [ \textbf{ [ )-approximate %DIFDELCMD < \hat{O}(1) %%% and%DIFDELCMD < \tilde{O}(1) %%% blowup in update time respectively .
Edit intent: fluency
Original:  Further we show new deterministic and randomized (against adaptive adversary) reductions from \alpha-approximate dynamic matching algorithms to (\alpha, \delta [ [ [ [ \textbf{ [  )-approximate matching algorithms with%DIFDELCMD < \hat{O}(1) %%% and%DIFDELCMD < \tilde{O}(1) %%% blowup in update time respectively .
Revised:  Further we show new deterministic and randomized (against adaptive adversary) reductions from \alpha-approximate dynamic matching algorithms to (\alpha, \delta [ [ [ [ \textbf{ [ )-approximate matching algorithms with%DIFDELCMD < \hat{O}(1) %%% %DIFDELCMD < \tilde{O}(1) %%% blowup in update time respectively .
Edit intent: coherence
Original:  We host the results and videos at URL and isaac gym can be download at URL
Revised:  We host the results and videos at URL and isaac gym can be downloaded at URL
Edit intent: fluency
Original:  algorithm is proposed to achieve the best feasible pure strategy NE. Finally, both simulation and hardware testbed are designed, and the results show that the proposed CTRA algorithm can improve the radar total mutual information by 26\%, and the feasibility of the proposed JSCIS is achieved with an acceptable radar ranging accuracy within 0.25 mm , as well as a stable data rate of 2.8 Gbps using the 28 GHz mmWave frequency band.
Revised:  algorithm is proposed to achieve the best feasible pure strategy NE. Finally, both simulation and hardware testbed are designed, and the results show that the proposed CTRA algorithm can improve the radar total mutual information by 26\%, and the feasibility of the proposed JSCIS is achieved with an acceptable radar ranging accuracy within 0.25 m , as well as a stable data rate of 2.8 Gbps using the 28 GHz mmWave frequency band.
Edit intent: fluency
Original: This paper proposes a practical method for the definition of multiple communication modes when antennas operate in the near-field region, by realizing ad-hoc beams exploiting the focusing capability of large antennas.
Revised: This paper proposes a practical method for the definition of communication modes when antennas operate in the near-field region, by realizing ad-hoc beams exploiting the focusing capability of large antennas.
Edit intent: clarity
Original:  The beamspace modeling proposed to define the communication modes is then exploited to derive expressions for the number of communication modes (i.e.,  degrees of freedom) in a generic setup, beyond the traditional paraxial approximation , together with closed-form definitions for the basis set at the transmitting and receiving antennas for several cases of interest, such as for the communication between a large antenna and a small antenna.
Revised:  The beamspace modeling proposed to define the communication modes is then exploited to derive expressions for their number (i.e., degrees of freedom) in a generic setup, beyond the traditional paraxial approximation , together with closed-form definitions for the basis set at the transmitting and receiving antennas for several cases of interest, such as for the communication between a large antenna and a small antenna.
Edit intent: clarity
Original:  The beamspace modeling proposed to define the communication modes is then exploited to derive expressions for the number of communication modes (i.e.,  degrees of freedom) in a generic setup, beyond the traditional paraxial approximation , together with closed-form definitions for the basis set at the transmitting and receiving antennas for several cases of interest, such as for the communication between a large antenna and a small antenna.
Revised:  The beamspace modeling proposed to define the communication modes is then exploited to derive expressions for the number of communication modes (i.e., the degrees of freedom) in a generic setup, beyond the traditional paraxial approximation , together with closed-form definitions for the basis set at the transmitting and receiving antennas for several cases of interest, such as for the communication between a large antenna and a small antenna.
Edit intent: fluency
Original:  The beamspace modeling proposed to define the communication modes is then exploited to derive expressions for the number of communication modes (i.e.,  degrees of freedom) in a generic setup, beyond the traditional paraxial approximation , together with closed-form definitions for the basis set at the transmitting and receiving antennas for several cases of interest, such as for the communication between a large antenna and a small antenna.
Revised:  The beamspace modeling proposed to define the communication modes is then exploited to derive expressions for the number of communication modes (i.e., degrees of freedom) in a generic setup, beyond the traditional paraxial scenario , together with closed-form definitions for the basis set at the transmitting and receiving antennas for several cases of interest, such as for the communication between a large antenna and a small antenna.
Edit intent: clarity
Original:  Numerical results indicate that quasi-optimal communication can be obtained starting from focusing functions.
Revised:  Numerical results show that quasi-optimal communication can be obtained starting from focusing functions.
Edit intent: clarity
Original:  This translates into the possibility of a significant enhancement of the channel capacity even in line-of-sight channel condition  without the need of resorting to optimal but complex phase/amplitude antenna profiles as well as intensive numerical simulations .
Revised:  This translates into the possibility of a significant enhancement of the channel capacity even in line-of-sight channel condition , without the need of resorting to optimal but complex phase/amplitude antenna profiles as well as intensive numerical simulations .
Edit intent: fluency
Original:  This translates into the possibility of a significant enhancement of the channel capacity even in line-of-sight channel condition  without the need of resorting to optimal but complex phase/amplitude antenna profiles as well as intensive numerical simulations .
Revised:  This translates into the possibility of a significant enhancement of the channel capacity even in line-of-sight channel condition without the need of implementing optimal but complex phase/amplitude antenna profiles as well as intensive numerical simulations .
Edit intent: clarity
Original:  This translates into the possibility of a significant enhancement of the channel capacity even in line-of-sight channel condition  without the need of resorting to optimal but complex phase/amplitude antenna profiles as well as intensive numerical simulations .
Revised:  This translates into the possibility of a significant enhancement of the channel capacity even in line-of-sight channel condition without the need of resorting to optimal but complex phase/amplitude profiles on transmitting/receiving antennas as well as intensive numerical simulations .
Edit intent: clarity
Original:  This translates into the possibility of a significant enhancement of the channel capacity even in line-of-sight channel condition  without the need of resorting to optimal but complex phase/amplitude antenna profiles as well as intensive numerical simulations .
Revised:  This translates into the possibility of a significant enhancement of the channel capacity even in line-of-sight channel condition without the need of resorting to optimal but complex phase/amplitude antenna profiles as well as resorting to intensive numerical solutions .
Edit intent: clarity