wanyu/IteraTeR_v2 huggingface dataset:
Original:  We then show in numerical procedures how one can design and analyze feasible laboratory experiments that allow the estimation of all of the many parameters and unmeasured dynamical variables, give observations of the somatic voltage V_s(t) alone.
Revised:  We then show in numerical procedures how one can design and analyze feasible laboratory experiments that allow the estimation of all of the many parameters and unmeasured dynamical variables, given observations of the somatic voltage V_s(t) alone.
Edit intent: fluency
Original:  In this paper we aim to investigate one special type of attacks in the discrete-event system framework, where an attack can arbitrarily alter sensor readings after intercepting them from a target system in order to trick a given supervisor to issue control commands improperly, driving the system to an undesirable state.
Revised:  In this paper we aim to investigate one special type of attacks in the discrete-event system framework, where an attacker can arbitrarily alter sensor readings after intercepting them from a target system in order to trick a given supervisor to issue control commands improperly, driving the system to an undesirable state.
Edit intent: fluency
Original:  Automated understanding of the use of linear perspective in landscape photography has a number of real-world applications, including aesthetics assessment, image retrieval, and on-site feedback for photo composition  .
Revised:  Automated understanding of linear perspective in landscape photography has a number of real-world applications, including aesthetics assessment, image retrieval, and on-site feedback for photo composition .
Edit intent: clarity
Original:  Automated understanding of the use of linear perspective in landscape photography has a number of real-world applications, including aesthetics assessment, image retrieval, and on-site feedback for photo composition  .
Revised:  Automated understanding of the use of linear perspective in landscape photography has several real-world applications, including aesthetics assessment, image retrieval, and on-site feedback for photo composition .
Edit intent: fluency
Original:  We address this problem by detecting vanishing points and the associated line structures in photos .
Revised:  We address this problem by detecting the dominant vanishing point and the associated line structures in photos .
Edit intent: clarity
Original:  We address this problem by detecting vanishing points and the associated line structures in photos .
Revised:  We address this problem by detecting vanishing points and the associated line structures in a photo .
Edit intent: fluency
Original:  However, natural landscape scenes pose great technical challenges because there are often inadequate number of strong edges converging to the vanishing points .
Revised:  However, natural landscape scenes pose great technical challenges because often the inadequate number of strong edges converging to the vanishing points .
Edit intent: coherence
Original:  Based on the detection results, we further demonstrate how our approach to linear perspective understanding can be used to provide on-site guidance to amateur photographers on their work through a novel viewpoint-specific image retrieval system.
Revised:  Based on the detection results, we further demonstrate how our approach to linear perspective understanding provides on-site guidance to amateur photographers on their work through a novel viewpoint-specific image retrieval system.
Edit intent: coherence
Original:  Only 7.9 \% (3/38) cases with \\%DIF > (3/39) cases with PFS shorter than 48.27 \% reported significant HR_{OS \\%DIF > reported significant HR_{OS}.
Revised:  Only 7.9 \\%DIF > (3/39) cases with PFS shorter than 48.27 \% reported significant HR_{OS \\%DIF > reported significant HR_{OS}.
Edit intent: clarity
Original:  Only 7.9 \% (3/38) cases with \\%DIF > (3/39) cases with PFS shorter than 48.27 \% reported significant HR_{OS \\%DIF > reported significant HR_{OS}.
Revised:  Only 7.9 \% (3/38) cases with \\%DIF > (3/39) cases with PFS shorter than 48.27 \\%DIF > reported significant HR_{OS}.
Edit intent: fluency
Original:  There  cases with PFS greater than 98.69\% and number of deaths\\%DIF > or more and number of deaths reported as 227 or more -- all of these 5 cases reported significant HR_{OS}.
Revised:  There cases with PFS greater than 98.69\% and number of deaths\\%DIF > or more and number of deaths reported as 227 or more -- of these 5 cases reported significant HR_{OS}.
Edit intent: clarity
Original: Nondominated sorting, or Pareto Depth Analysis (PDA), is widely used in multi-objective optimization and has recently found important applications in multi-criteria anomaly detection.
Revised: Nondominated sorting, also called Pareto Depth Analysis (PDA), is widely used in multi-objective optimization and has recently found important applications in multi-criteria anomaly detection.
Edit intent: clarity
Original:   We propose in this paper a fast real-time streaming version of the PDA algorithm for anomaly detection and classification that exploits the computational advantages of partial differential equation (PDE ) continuum limits.
Revised:  We propose in this paper a fast real-time streaming version of the PDA algorithm for anomaly detection that exploits the computational advantages of partial differential equation (PDE ) continuum limits.
Edit intent: clarity
Original:   We propose in this paper a fast real-time streaming version of the PDA algorithm for anomaly detection and classification that exploits the computational advantages of partial differential equation (PDE ) continuum limits.
Revised:  We propose in this paper a fast real-time streaming version of the PDA algorithm for anomaly detection and classification that exploits the computational advantages of PDE continuum limits.
Edit intent: clarity
Original:  However, these traditional methods were proposed by highlighting one or two structural features of networks, and then use the methods to implement link prediction in different networks.
Revised:  However, these methods only highlight one or two structural features of networks, and then use the methods to implement link prediction in different networks.
Edit intent: clarity
Original:  However, these traditional methods were proposed by highlighting one or two structural features of networks, and then use the methods to implement link prediction in different networks.
Revised:  However, these traditional methods were proposed by highlighting one or two structural features of networks, and then use the methods to predict missing links in different networks.
Edit intent: clarity
Original:  In many cases, the performance is not ideal since each network has its unique underlying structural features.
Revised:  The performances of these existing methods are not always satisfied in all cases since each network has its unique underlying structural features.
Edit intent: clarity
Original:  In this article , by analyzing different real networks, we find that the structural features of different networks are remarkably different.
Revised:  In this paper , by analyzing different real networks, we find that the structural features of different networks are remarkably different.
Edit intent: fluency
Original:  In particular, even in the same networks , their inner structural features are utterly different.
Revised:  In particular, even in the same network , their inner structural features are utterly different.
Edit intent: fluency
Original:   Inspired by these facts, an adaptive link prediction method is proposed to incorporate multiple structural features from the perspective of combination optimization .
Revised:  Inspired by these facts, an adaptive fusion model regarding link prediction is proposed to incorporate multiple structural features from the perspective of combination optimization .
Edit intent: clarity
Original:   Inspired by these facts, an adaptive link prediction method is proposed to incorporate multiple structural features from the perspective of combination optimization .
Revised:  Inspired by these facts, an adaptive link prediction method is proposed to incorporate multiple structural features .
Edit intent: clarity
Original:  In the model,  the weight of each structural feature is adaptively determined by logistic regression but not be artificially given in advance .
Revised:  In the model, the weight of each feature in the logistic function is adaptively determined by logistic regression but not be artificially given in advance .
Edit intent: clarity
Original:  According to our experimental results, we find that the logistic regression based link prediction outperforms other typical similarity indices.
Revised:  According to our experimental results, we find that the performance of our adaptive fusion model is better than many similarity indices.
Edit intent: clarity
Original:  In this work , we exploit ambiguity in the flow of information in measurement-based quantum computation to construct a protocol for hiding  a computation delegated to a remote quantum computer by an entirely classical user .
Revised:  In this work , we exploit ambiguity in the flow of information in measurement-based quantum computing to construct a protocol for hiding a computation delegated to a remote quantum computer by an entirely classical user .
Edit intent: fluency
Original:  In this work , we exploit ambiguity in the flow of information in measurement-based quantum computation to construct a protocol for hiding  a computation delegated to a remote quantum computer by an entirely classical user .
Revised:  In this work , we exploit ambiguity in the flow of information in measurement-based quantum computation to construct a protocol for hiding a computation delegated to a remote quantum computer .
Edit intent: clarity
Original:  To date, such protocols are only known for settings involving at least two quantum devices: either a user with some quantum capabilities and a remote quantum server , or two or more entangled but non-communicating servers.
Revised:  To date, such protocols are only known for settings involving at least two quantum devices: either a user with some quantum capabilities and a remote quantum server or two or more entangled but non-communicating servers.
Edit intent: fluency
Original:  To date, such protocols are only known for settings involving at least two quantum devices: either a user with some quantum capabilities and a remote quantum server , or two or more entangled but non-communicating servers.
Revised:  To date, such protocols are only known for settings involving at least two quantum devices: either a user with some quantum capabilities and a remote quantum server , or two or more entangled but noncommunicating servers.
Edit intent: fluency
Original:  In this work  we take the first step towards the construction of a blind quantum computing protocol with a completely classical client and single quantum server.
Revised:  In this work , we take the first step towards the construction of a blind quantum computing protocol with a completely classical client and single quantum server.
Edit intent: fluency
Original:  The introduced deep neural network, DeepVS, uses the output of a docking program and learns how to extract relevant features from basic data such as atom and amino acid types obtained from protein-ligand complexes.
Revised:  The introduced deep neural network, DeepVS, uses the output of a docking program and learns how to extract relevant features from basic data such as atom and residues types obtained from protein-ligand complexes.
Edit intent: clarity
Original: Sparse representation presents an efficient approach to approximately recover a signal by the linear composition of a few bases from a learnt dictionary, based on which various successful applications have been observed .
Revised: Sparse representation leads to an efficient way to approximately recover a signal by the linear composition of a few bases from a learnt dictionary, based on which various successful applications have been observed .
Edit intent: clarity
Original: Sparse representation presents an efficient approach to approximately recover a signal by the linear composition of a few bases from a learnt dictionary, based on which various successful applications have been observed .
Revised: Sparse representation presents an efficient approach to approximately recover a signal by the linear composition of a few bases from a learnt dictionary, based on which various successful applications have been achieved .
Edit intent: clarity
Original:  Therefore, how to establish an accurate rate model in sparse coding and dictionary learning becomes meaningful, which has been not fully exploited in the context of sparse representation.
Revised:  Therefore, introducing an accurate rate-constraint in sparse coding and dictionary learning becomes meaningful, which has been not fully exploited in the context of sparse representation.
Edit intent: clarity
Original:  Therefore, how to establish an accurate rate model in sparse coding and dictionary learning becomes meaningful, which has been not fully exploited in the context of sparse representation.
Revised:  Therefore, how to establish an accurate rate model in sparse coding and dictionary learning becomes meaningful, which has not been fully exploited in the context of sparse representation.
Edit intent: fluency
Original:  According to the Shannon entropy inequality, the variance of data source bounds its entropy, which can reflect the actual coding bits .
Revised:  According to the Shannon entropy inequality, the variance of data source bounds its entropy, indicating the actual bitrate can be well estimated by its variance .
Edit intent: clarity
Original:  Hence, in this work a Globally Variance-Constrained Sparse Representation (GVCSR) model is proposed  , where a variance-constrained rate model is introduced in the optimization process.
Revised:  Hence, a Globally Variance-Constrained Sparse Representation (GVCSR) model is proposed , where a variance-constrained rate model is introduced in the optimization process.
Edit intent: clarity
Original:  Hence, in this work a Globally Variance-Constrained Sparse Representation (GVCSR) model is proposed  , where a variance-constrained rate model is introduced in the optimization process.
Revised:  Hence, in this work a Globally Variance-Constrained Sparse Representation (GVCSR) model is proposed , where a variance-constrained rate term is introduced to the optimization process.
Edit intent: clarity
Original:  Specifically, we employ the Alternating Direction Method of Multipliers (ADMM) to solve the non-convex optimization problem for sparse coding and dictionary learning, both of which have shown state-of-the-art performance in image representation.
Revised:  Specifically, we employ the Alternating Direction Method of Multipliers (ADMM) to solve the non-convex optimization problem for sparse coding and dictionary learning, both of them have shown the state-of-the-art performance in image representation.
Edit intent: clarity
Original:  Furthermore, we investigate the potential of GVCSR in practical image set compression, where a common dictionary is trained by several key images to represent the whole image set . Experimental results have demonstrated significant performance improvements against the most popular image codecs including JPEG and JPEG2000 .
Revised:  Furthermore, we investigate the potential of applying the GVCSR algorithm in the practical image set compression, where a common dictionary is trained by several key images to represent the whole image set . Experimental results have demonstrated significant performance improvements against the most popular image codecs including JPEG and JPEG2000 .
Edit intent: clarity
Original:  Furthermore, we investigate the potential of GVCSR in practical image set compression, where a common dictionary is trained by several key images to represent the whole image set . Experimental results have demonstrated significant performance improvements against the most popular image codecs including JPEG and JPEG2000 .
Revised:  Furthermore, we investigate the potential of GVCSR in practical image set compression, where the optimized dictionary is trained by several key images to represent the whole image set . Experimental results have demonstrated significant performance improvements against the most popular image codecs including JPEG and JPEG2000 .
Edit intent: clarity
Original:  In this paper, we take a holistic approach for LTE-LAA small cell traffic balancing by jointly optimizing the use of  licensed and unlicensed bands.
Revised:  In this paper, we take a holistic approach for LTE-LAA small cell traffic balancing by jointly optimizing the use of the licensed and unlicensed bands.
Edit intent: fluency
Original:  The motivation for this formulation is for the LTE-LAA small cell to switch between or aggregate licensed and unlicensed bands depending on the interference/traffic level and  number of active users in each band.
Revised:  The motivation for this formulation is for the LTE-LAA small cell to switch between or aggregate licensed and unlicensed bands depending on the interference/traffic level and the number of active users in each band.
Edit intent: fluency
Original:  Through numerical and simulation results, we show that our proposed traffic balancing scheme, besides enabling better LTE-WiFi coexistence , leads to an efficient utilization of the radio resources compared to alternative approaches as it provides a better tradeoff between maximizing the total network throughput and achieving fairness among all network flows  .
Revised:  Through numerical and simulation results, we show that our proposed traffic balancing scheme, besides enabling better LTE-WiFi coexistence and efficient utilization of the radio resources compared to alternative approaches as it provides a better tradeoff between maximizing the total network throughput and achieving fairness among all network flows .
Edit intent: coherence
Original:  Through numerical and simulation results, we show that our proposed traffic balancing scheme, besides enabling better LTE-WiFi coexistence , leads to an efficient utilization of the radio resources compared to alternative approaches as it provides a better tradeoff between maximizing the total network throughput and achieving fairness among all network flows  .
Revised:  Through numerical and simulation results, we show that our proposed traffic balancing scheme, besides enabling better LTE-WiFi coexistence , leads to an efficient utilization of the radio resources relative to the existing traffic balancing scheme, also provides a better tradeoff between maximizing the total network throughput and achieving fairness among all network flows .
Edit intent: clarity
Original:  Through numerical and simulation results, we show that our proposed traffic balancing scheme, besides enabling better LTE-WiFi coexistence , leads to an efficient utilization of the radio resources compared to alternative approaches as it provides a better tradeoff between maximizing the total network throughput and achieving fairness among all network flows  .
Revised:  Through numerical and simulation results, we show that our proposed traffic balancing scheme, besides enabling better LTE-WiFi coexistence , leads to an efficient utilization of the radio resources compared to alternative approaches as it provides a better tradeoff between maximizing the total network throughput and achieving fairness among all network flows compared to alternative approaches .
Edit intent: fluency
Original: When rewards are sparse and efficient exploration essential, deep Q-learning with \epsilon-greedy exploration tends to fail .
Revised: When rewards are sparse and action spaces large, Q-learning with \epsilon-greedy exploration tends to fail .
Edit intent: clarity
Original: When rewards are sparse and efficient exploration essential, deep Q-learning with \epsilon-greedy exploration tends to fail .
Revised: When rewards are sparse and efficient exploration essential, deep Q-learning with \epsilon-greedy exploration can be inefficient .
Edit intent: clarity
Original:  This poses problems for otherwise promising domains such as task-oriented dialog systems, where the primary reward signal, indicating successful completion , typically occurs only at the end of each episode but depends on the entire sequence of utterances.
Revised:  This poses problems for otherwise promising applications such as task-oriented dialog systems, where the primary reward signal, indicating successful completion , typically occurs only at the end of each episode but depends on the entire sequence of utterances.
Edit intent: clarity
Original:  This poses problems for otherwise promising domains such as task-oriented dialog systems, where the primary reward signal, indicating successful completion , typically occurs only at the end of each episode but depends on the entire sequence of utterances.
Revised:  This poses problems for otherwise promising domains such as task-oriented dialogue systems, where the primary reward signal, indicating successful completion , typically occurs only at the end of each episode but depends on the entire sequence of utterances.
Edit intent: fluency
Original:  We present two techniques that significantly improve the efficiency of exploration for deep Q-learning agents in dialog systems.
Revised:  We present two techniques that significantly improve the efficiency of exploration for deep Q-learning agents in dialogue systems.
Edit intent: fluency
Original:  First, we demonstrate that exploration by Thompson sampling, using Monte Carlo samples from a Bayes-by-Backprop neural network, yields marked improvement over standard DQNs with Boltzmann or \epsilon-greedy  exploration.
Revised:  First, we introduce an exploration technique based on Thompson sampling, using Monte Carlo samples from a Bayes-by-Backprop neural network, yields marked improvement over standard DQNs with Boltzmann or \epsilon-greedy exploration.
Edit intent: clarity
Original:  First, we demonstrate that exploration by Thompson sampling, using Monte Carlo samples from a Bayes-by-Backprop neural network, yields marked improvement over standard DQNs with Boltzmann or \epsilon-greedy  exploration.
Revised:  First, we demonstrate that exploration by Thompson sampling, drawing Monte Carlo samples from a Bayes-by-Backprop neural network, yields marked improvement over standard DQNs with Boltzmann or \epsilon-greedy exploration.
Edit intent: clarity
Original:  First, we demonstrate that exploration by Thompson sampling, using Monte Carlo samples from a Bayes-by-Backprop neural network, yields marked improvement over standard DQNs with Boltzmann or \epsilon-greedy  exploration.
Revised:  First, we demonstrate that exploration by Thompson sampling, using Monte Carlo samples from a Bayes-by-backprop neural network, yields marked improvement over standard DQNs with Boltzmann or \epsilon-greedy exploration.
Edit intent: fluency
Original:  First, we demonstrate that exploration by Thompson sampling, using Monte Carlo samples from a Bayes-by-Backprop neural network, yields marked improvement over standard DQNs with Boltzmann or \epsilon-greedy  exploration.
Revised:  First, we demonstrate that exploration by Thompson sampling, using Monte Carlo samples from a Bayes-by-Backprop neural network, demonstrating marked improvement over standard DQNs with Boltzmann or \epsilon-greedy exploration.
Edit intent: clarity
Original:  First, we demonstrate that exploration by Thompson sampling, using Monte Carlo samples from a Bayes-by-Backprop neural network, yields marked improvement over standard DQNs with Boltzmann or \epsilon-greedy  exploration.
Revised:  First, we demonstrate that exploration by Thompson sampling, using Monte Carlo samples from a Bayes-by-Backprop neural network, yields marked improvement over common approaches such as \epsilon-greedy exploration.
Edit intent: clarity