wanyu/IteraTeR_v2 huggingface dataset:
Original:  Following  recent 3GPP requirements on  the dynamic blockage as well as the temporal consistency of the channel at mmWave frequencies, we in this paper develop a new model for predicting the state of a user in a field of mobile blockers for two representative 3GPP scenarios  : urban micro cell (UMi) street canyon and park/stadium/square.
Revised:  Following recent 3GPP requirements on the dynamic blockage as well as the temporal consistency of the channel at mmWave frequencies, we in this paper develop a new model for predicting the state of a user in a field of mobile blockers for two representative 3GPP scenarios is developed : urban micro cell (UMi) street canyon and park/stadium/square.
Edit intent: coherence
Original:  We demonstrate that the blockage effects produce an alternating renewal process with the exponentially distributed non-blocked intervals  and blocked durations that follow the general distribution.
Revised:  It is demonstrated that the blockage effects produce an alternating renewal process with the exponentially distributed non-blocked intervals and blocked durations that follow the general distribution.
Edit intent: clarity
Original:  We demonstrate that the blockage effects produce an alternating renewal process with the exponentially distributed non-blocked intervals  and blocked durations that follow the general distribution.
Revised:  We demonstrate that the blockage effects produce an alternating renewal process with exponentially distributed non-blocked intervals and blocked durations that follow the general distribution.
Edit intent: fluency
Original:  We demonstrate that the blockage effects produce an alternating renewal process with the exponentially distributed non-blocked intervals  and blocked durations that follow the general distribution.
Revised:  We demonstrate that the blockage effects produce an alternating renewal process with the exponentially distributed non-blocked intervals , and blocked durations that follow the general distribution.
Edit intent: fluency
Original:  We thus derive (i) the mean and the fraction of time spent in blocked/non-blocked state, (ii) the residual blocked/non-blocked time, as well as (iii) the time-dependent conditional probability of having blockage/no blockage at  t1 given that there was blockage/no blockage at time t0.
Revised:  The following metrics are derived (i) the mean and the fraction of time spent in blocked/non-blocked state, (ii) the residual blocked/non-blocked time, as well as (iii) the time-dependent conditional probability of having blockage/no blockage at t1 given that there was blockage/no blockage at time t0.
Edit intent: clarity
Original:  We thus derive (i) the mean and the fraction of time spent in blocked/non-blocked state, (ii) the residual blocked/non-blocked time, as well as (iii) the time-dependent conditional probability of having blockage/no blockage at  t1 given that there was blockage/no blockage at time t0.
Revised:  We thus derive (i) the mean and the fraction of time spent in blocked/non-blocked state, (ii) the residual blocked/non-blocked time, and (iii) the time-dependent conditional probability of having blockage/no blockage at t1 given that there was blockage/no blockage at time t0.
Edit intent: coherence
Original:  We thus derive (i) the mean and the fraction of time spent in blocked/non-blocked state, (ii) the residual blocked/non-blocked time, as well as (iii) the time-dependent conditional probability of having blockage/no blockage at  t1 given that there was blockage/no blockage at time t0.
Revised:  We thus derive (i) the mean and the fraction of time spent in blocked/non-blocked state, (ii) the residual blocked/non-blocked time, as well as (iii) the time-dependent conditional probability of having blockage/no blockage at time t1 given that there was blockage/no blockage at time t0.
Edit intent: fluency
Original:  The latter is a function of arrival intensity , width, and height of moving blockers, distance to the mmWave access point (AP)  as well as  heights of the AP and the user device.
Revised:  The latter is a function of arrival intensity , width, and height of moving blockers, distance to the mmWave access point (AP) , as well as heights of the AP and the user device.
Edit intent: fluency
Original:  The latter is a function of arrival intensity , width, and height of moving blockers, distance to the mmWave access point (AP)  as well as  heights of the AP and the user device.
Revised:  The latter is a function of arrival intensity , width, and height of moving blockers, distance to the mmWave access point (AP) as well as the heights of the AP and the user device.
Edit intent: fluency
Original:  Our proposed model can be applied in system-level characterization of mmWave cellular communications technology with either analytical or simulation-based methods.
Revised:  The proposed model can be applied in system-level characterization of mmWave cellular communications technology with either analytical or simulation-based methods.
Edit intent: fluency
Original:  Our proposed model can be applied in system-level characterization of mmWave cellular communications technology with either analytical or simulation-based methods.
Revised:  Our proposed model can be used for system-level characterization of mmWave cellular communications technology with either analytical or simulation-based methods.
Edit intent: clarity
Original:  In particular, we report on the optimal height and the maximum coverage radius of the mmWave APs  while satisfying the target mean data rate constraint.
Revised:  In particular, we report on the optimal height and the maximum coverage radius of the mmWave APs while satisfying the required mean data rate constraint.
Edit intent: clarity
Original:  Our supportive system-level simulations corroborate that the use of the proposed formulation allows to considerably decrease the overall modeling complexity.
Revised:  The system-level simulations corroborate that the use of the proposed formulation allows to considerably decrease the overall modeling complexity.
Edit intent: clarity
Original:  Our supportive system-level simulations corroborate that the use of the proposed formulation allows to considerably decrease the overall modeling complexity.
Revised:  Our supportive system-level simulations corroborate that the use of the proposed method considerably reduces the modeling complexity.
Edit intent: clarity
Original:  This feature motivated us to design a new method, divide and conquer (D&C), for symbolic regression, in which the target function is divided into a number of sub-functions and the sub-functions are then determined by any GP algorithms available .
Revised:  This feature motivated us to develop a new method, divide and conquer (D&C), for symbolic regression, in which the target function is divided into a number of sub-functions and the sub-functions are then determined by any GP algorithms available .
Edit intent: clarity
Original:  This feature motivated us to design a new method, divide and conquer (D&C), for symbolic regression, in which the target function is divided into a number of sub-functions and the sub-functions are then determined by any GP algorithms available .
Revised:  This feature motivated us to design a new method, divide and conquer (D&C), for symbolic regression, in which the target function is divided into a number of sub-functions and the sub-functions are then determined by any of a GP algorithm .
Edit intent: clarity
Original:  D&C powered GP has been tested on some real-world applications, and the study shows that D&C can help GP to get the target function more rapidly and more reliably .
Revised:  D&C powered GP has been tested on some real-world applications, and the study shows that D&C can help GP to get the target function much more rapidly .
Edit intent: clarity
Original: Multi-task learning is partly motivated by the observation that humans bring to bear what they know about related problems when solving new ones.
Revised: Multi-task learning is motivated by the observation that humans bring to bear what they know about related problems when solving new ones.
Edit intent: clarity
Original:  In machine learning , it is hard to estimate if sharing will lead to improvements ;
Revised:  In machine learning , it is hard to predict if sharing will lead to improvements ;
Edit intent: clarity
Original:  To overcome this, we introduce Sluice Networks, a general framework for multi-task learning where trainable parameters control the amount of sharing -- including which parts of the models to share .
Revised:  To overcome this, we introduce Sluice Networks, a general framework for multi-task learning where trainable parameters control the amount of sharing .
Edit intent: clarity
Original:  Our framework goes beyond and generalizes over previous proposals in enabling hard or soft sharing of all combinations of subspaces, layers, and skip connections.
Revised:  Our framework generalizes previous proposals in enabling hard or soft sharing of all combinations of subspaces, layers, and skip connections.
Edit intent: clarity
Original:  Our framework goes beyond and generalizes over previous proposals in enabling hard or soft sharing of all combinations of subspaces, layers, and skip connections.
Revised:  Our framework goes beyond and generalizes over previous proposals in enabling sharing of all combinations of subspaces, layers, and skip connections.
Edit intent: clarity
Original:  We perform experiments on three task pairs from natural language processing , and across seven different domains, using data from OntoNotes 5.0, and achieve up to 15\% average error reductions over common approaches to multi-task learning.
Revised:  We perform experiments on three task pairs , and across seven different domains, using data from OntoNotes 5.0, and achieve up to 15\% average error reductions over common approaches to multi-task learning.
Edit intent: clarity
Original:  We show that a) label entropy is predictive of gains in sluice networks, confirming findings for hard parameter sharing , and b) while sluice networks easily fit noise, they are robust across domains in practice.
Revised:  We show that a) label entropy is predictive of gains in sluice networks, confirming findings for hard parameter sharing and b) while sluice networks easily fit noise, they are robust across domains in practice.
Edit intent: fluency
Original:  Similarly, deep neural networks can profit from related tasks by sharing parameters with other networks.
Revised:  Similarly, deep neural networks to learn from related tasks by sharing parameters with other networks.
Edit intent: clarity
Original:  In deep sensing , instead of the explicit mathematical modeling of CSS , the optimal strategy for combining the individual sensing results of the SUs is obtained with a CNN based on training sensing samples.
Revised:  In deep sensing , instead of the explicit mathematical modeling of CSS , the optimal strategy for combining the individual sensing results of the SUs is learned with a CNN based on training sensing samples.
Edit intent: clarity
Original:  In deep sensing , instead of the explicit mathematical modeling of CSS , the optimal strategy for combining the individual sensing results of the SUs is obtained with a CNN based on training sensing samples.
Revised:  In deep sensing , instead of the explicit mathematical modeling of CSS , the optimal strategy for combining the individual sensing results of the SUs is obtained with a CNN using training sensing samples.
Edit intent: clarity
Original:  Through simulation, we show that the performance of CSS can be significantly improved by the proposed deep sensing scheme, especially in the low signal-to-noise ratio (SNR) regime, even when the number of training samples is moderate.
Revised:  Through simulation, we show that the performance of CSS can be improved by the proposed deep sensing scheme, especially in the low signal-to-noise ratio (SNR) regime, even when the number of training samples is moderate.
Edit intent: clarity
Original:  Analyzing this data, however, is a computational challenge insofar as the computational costs of the relevant algorithms can grow with quadratic, cubic or higher complexity--leading to the need for leadership scale computing.
Revised:  Analyzing this data, however, is a computational challenge insofar as the computational costs of the relevant algorithms can grow with quadratic, cubic or higher complexity-leading to the need for leadership scale computing.
Edit intent: fluency
Original:  In this paper, by networking stocks of sharing common mutual funds, a new methodology of investigating the the market crash from the perspective of investor behavior is presented.
Revised:  In this paper, by networking stocks of sharing common mutual funds, a new methodology of investigating the market crash is presented.
Edit intent: clarity
Original:  Our findings suggest that the whole picture of portfolio strategy has to be carefully supervised to reshape the stock network and highly connected stocks should be warned at early stages to avoid the market panic .
Revised:  Our findings suggest that the whole picture of portfolio strategy has to be carefully supervised to reshape the stock network .
Edit intent: coherence
Original: We describe a simple and effective technique, the Eigenvector Method for Umbrella Sampling (EMUS) , for accurately estimating small probabilities and expectations with respect to a given target probability density.
Revised: The Eigenvector Method for Umbrella Sampling (EMUS) , for accurately estimating small probabilities and expectations with respect to a given target probability density.
Edit intent: clarity
Original:  We demonstrate by theoretical results and computational examples that EMUS can be dramatically more efficient than direct Markov chain Monte Carlo when the target distribution is multimodal or when the goal is to compute tail probabilities.
Revised:  We demonstrate by theoretical results and computational examples that EMUS can be dramatically more efficient than direct MCMC when the target distribution is multimodal or when the goal is to compute tail probabilities.
Edit intent: clarity
Original:  By theoretical analysis and numerical experiments, we demonstrate that EMUS is an efficient general method for computing averages with respect to arbitrary target distributions.
Revised:  We develop a detailed theoretical analysis of EMUS. Based on this analysis, we show that EMUS is an efficient general method for computing averages with respect to arbitrary target distributions.
Edit intent: clarity
Original:  By theoretical analysis and numerical experiments, we demonstrate that EMUS is an efficient general method for computing averages with respect to arbitrary target distributions.
Revised:  By theoretical analysis and numerical experiments, we demonstrate that EMUS is an efficient general method for computing averages over arbitrary target distributions.
Edit intent: clarity
Original:  We show that EMUS can be dramatically more efficient than direct MCMC when the target distribution is multimodal or when the goal is to compute tail probabilities  .
Revised:  In particular, we show that EMUS can be dramatically more efficient than direct MCMC when the target distribution is multimodal or when the goal is to compute tail probabilities .
Edit intent: coherence
Original:  Edge computing emerges as a new paradigm that decentralizes the communication, computation, control and storage resources from the cloud to the edge of the Internet .
Revised:  Edge computing emerges as a new paradigm that decentralizes the communication, computation, control and storage resources from the cloud to the edge of the network .
Edit intent: clarity
Original:  This paper proposes an edge computing platform where mobile fog nodes are physical devices  where descriptive analytics is deployed to analyze real-time transit data streams.
Revised:  This paper proposes an edge computing platform where mobile fog nodes are physical devices where descriptive analytics is used to uncover meaningful patterns from real-time transit data streams.
Edit intent: clarity
Original:  An application experiment is used to evaluate the advantages and disadvantages of our proposed platform to run descriptive analytics at the mobile fog node and support transit managers with actionable information .
Revised:  An application experiment is used to evaluate the advantages and disadvantages of our proposed platform to support descriptive analytics at the mobile fog node and support transit managers with actionable information .
Edit intent: clarity
Original:  An application experiment is used to evaluate the advantages and disadvantages of our proposed platform to run descriptive analytics at the mobile fog node and support transit managers with actionable information .
Revised:  An application experiment is used to evaluate the advantages and disadvantages of our proposed platform to run descriptive analytics at a mobile edge node and generate actionable information to transit managers .
Edit intent: clarity
Original: Today's embedded and cyber-physical systems are ubiquitous.
Revised: Modern embedded and cyber-physical systems are ubiquitous.
Edit intent: clarity
Original:  The current trend is to connect real-time embedded devices to  the Internet.
Revised:  Recent developments and new functionality requires real-time embedded devices to the Internet.
Edit intent: clarity
Original:  This gives rise to the real-time Internet-of-things (RT-IoT) that promises a better user experience through stronger connectivity and better use of next-generation embedded devices , albeit with safety-critical properties.
Revised:  This gives rise to the real-time Internet-of-things (RT-IoT) that promises a better user experience through stronger connectivity and efficient use of next-generation embedded devices , albeit with safety-critical properties.
Edit intent: clarity
Original:  However RT-IoT are also increasingly becoming targets for cyber-attacks as evident by recent events .
Revised:  However RT-IoT are also increasingly becoming targets for cyber-attacks which is exacerbated by this increased connectivity .
Edit intent: clarity
Original:  This paper gives an introduction to RT-IoT systems, an outlook of current approaches and possible research challenges towards a holistic secure RT-IoT framework .
Revised:  This paper gives an introduction to RT-IoT systems, an outlook of current approaches and possible research challenges towards secure RT- IoT frameworks .
Edit intent: clarity
Original:  Moreover, we conjecture that shellability is preserved by poset fibrations satisfying certain conditions, which would generalise a result of Quillen's showing Cohen-Macaulayness is preserved under similar conditions, and we prove a restricted form of this conjecture.
Edit intent: coherence
Original:  Such applications require low latency and high reliability, and thus, we exploit non-orthogonal multiple access  to reduce the access latency and to improve the packet reception probability.
Revised:  Such applications require low latency and high reliability, and thus, we propose a non-orthogonal multiple access to reduce the access latency and to improve the packet reception probability.
Edit intent: clarity
Original:  Such applications require low latency and high reliability, and thus, we exploit non-orthogonal multiple access  to reduce the access latency and to improve the packet reception probability.
Revised:  Such applications require low latency and high reliability, and thus, we exploit non-orthogonal multiple access scheme to reduce the access latency and to improve the packet reception probability.
Edit intent: clarity
Original:  Such applications require low latency and high reliability, and thus, we exploit non-orthogonal multiple access  to reduce the access latency and to improve the packet reception probability.
Revised:  Such applications require low latency and high reliability, and thus, we exploit non-orthogonal multiple access to reduce the latency and to improve the packet reception probability.
Edit intent: fluency
Original:  In the proposed two-fold scheme, the BS performs  semi-persistent scheduling and allocates time-frequency resources in a non-orthogonal manner while the vehicles autonomously perform distributed power control with iterative signaling control .
Revised:  In the proposed scheme, the BS performs semi-persistent scheduling and allocates time-frequency resources in a non-orthogonal manner while the vehicles autonomously perform distributed power control with iterative signaling control .
Edit intent: clarity
Original:  In the proposed two-fold scheme, the BS performs  semi-persistent scheduling and allocates time-frequency resources in a non-orthogonal manner while the vehicles autonomously perform distributed power control with iterative signaling control .
Revised:  In the proposed two-fold scheme, the BS performs the semi-persistent scheduling and allocates time-frequency resources in a non-orthogonal manner while the vehicles autonomously perform distributed power control with iterative signaling control .
Edit intent: fluency
Original:  In the proposed two-fold scheme, the BS performs  semi-persistent scheduling and allocates time-frequency resources in a non-orthogonal manner while the vehicles autonomously perform distributed power control with iterative signaling control .
Revised:  In the proposed two-fold scheme, the BS performs semi-persistent scheduling and allocates time-frequency resources in a non-orthogonal manner while the vehicles autonomously perform distributed power control .
Edit intent: clarity
Original:  We formulate the centralized scheduling and resource allocation problem as equivalent to a multi-dimensional stable roommate matching problem, in which the users and time/frequency resources are considered as disjoint sets of objects to be matched with each other.
Revised:  We formulate the centralized scheduling and resource allocation problem as equivalent to a multi-dimensional stable roommate matching problem, in which the users and time/frequency resources are considered as disjoint sets of players to be matched with each other.
Edit intent: clarity
Original:  Simulation results show that the proposed scheme outperforms the traditional orthogonal multiple access scheme in terms of the access latency and reliability.
Revised:  Simulation results show that the proposed scheme outperforms the traditional orthogonal multiple access scheme in terms of the latency and reliability.
Edit intent: fluency
Original: We show that estimation of error in the iterative solution can reduce uncertainty in convergence by a factor \sim \kappa(A,x) compared to the case of using the  relative residue as a stopping criterion .
Revised: We present an analysis of the relative residue as a stopping criterion .
Edit intent: clarity
Original:  This makes error estimation as important as preconditioning for efficient and accurate solution of moderate to high condition problems (\kappa(A) > 10) .
Revised:  This makes error estimation as important as preconditioning for efficient and accurate solution of moderate to high conditioned linear systems (\kappa > 10) .
Edit intent: clarity
Original:  Later , an O(k^2)  estimator was described for the GMRES  algorithm which allows for non-symmetric linear systems as well, and here k is the iteration number.
Revised:  Later , an O(k^2) estimator was described for the GMRES algorithm which allows for non-symmetric linear systems as well, where k is the iteration number.
Edit intent: coherence
Original:  Note that computational cost of the estimator is expected to be significantly less than the O(n^2) evaluation at every iteration of these methods in solving problems of dimension n.
Edit intent: coherence
Original:  In this work, we first propose an O(n) error estimator for A-norm and l_{2} norm of the error vector in Bi-CG algorithms that can as well solve non-symmetric linear systems.
Revised:  In this work, we also propose an O(n) error estimator for A-norm and l_{2} norm of the error vector in Bi-CG algorithms that can as well solve non-symmetric linear systems.
Edit intent: clarity