wanyu/IteraTeR_v2 huggingface dataset:
Original:  Next, we propose a training procedure to further embed the temporal context in existing models : we introduce it in a multi-objective approach to  traditionally time-unaware recommender systems and confirm its advantage via the proposed evaluation protocol.
Revised:  Next, we propose a training procedure to further embed the temporal context in existing models . We use a multi-objective approach to traditionally time-unaware recommender systems and confirm its advantage via the proposed evaluation protocol.
Edit intent: coherence
Original:  Next, we propose a training procedure to further embed the temporal context in existing models : we introduce it in a multi-objective approach to  traditionally time-unaware recommender systems and confirm its advantage via the proposed evaluation protocol.
Revised:  Next, we propose a training procedure to further embed the temporal context in existing models : we introduce it in a multi-objective approach to introduce temporal context into traditionally time-unaware recommender systems and confirm its advantage via the proposed evaluation protocol.
Edit intent: coherence
Original: We investigate two different constructions of robust Orlicz spaces as a generalisation of robust L^p-spaces.
Revised: We investigate robust Orlicz spaces as a generalisation of robust L^p-spaces.
Edit intent: clarity
Original:  Our first construction is top-down and considers the maximal domain of a worst-case Luxemburg norm.
Revised:  Two constructions of such spaces are distinguished, a worst-case Luxemburg norm.
Edit intent: clarity
Original:  We show that separability of such spaces or their subspaces has very strong implications in terms of  dominatedness of the set of priors and thus for applications in the field of robust finance.
Revised:  We show that separability of such spaces or their subspaces has very strong implications in terms of the dominatedness of the set of priors and thus for applications in the field of robust finance.
Edit intent: fluency
Original:  This paper focuses on the study of the effect that the class of the vehicle, leading heavy vehicles in particular, causes on the following vehicle  behavior, specifically in terms of the following bumper-to-bumper distance (gap) that the following vehicle keeps from the lead vehicle .
Revised:  This paper focuses on the study of the impact that the class of the vehicle, leading heavy vehicles in particular, causes on the following vehicle behavior, specifically in terms of the following bumper-to-bumper distance (gap) that the following vehicle keeps from the lead vehicle .
Edit intent: clarity
Original:  This paper focuses on the study of the effect that the class of the vehicle, leading heavy vehicles in particular, causes on the following vehicle  behavior, specifically in terms of the following bumper-to-bumper distance (gap) that the following vehicle keeps from the lead vehicle .
Revised:  This paper focuses on the study of the effect that the class of the vehicle, leading heavy vehicles in particular, causes on the following vehicle 's behavior, specifically in terms of the following bumper-to-bumper distance (gap) that the following vehicle keeps from the lead vehicle .
Edit intent: clarity
Original:  This paper focuses on the study of the effect that the class of the vehicle, leading heavy vehicles in particular, causes on the following vehicle  behavior, specifically in terms of the following bumper-to-bumper distance (gap) that the following vehicle keeps from the lead vehicle .
Revised:  This paper focuses on the study of the effect that the class of the vehicle, leading heavy vehicles in particular, causes on the following vehicle behavior, specifically in terms of the bumper-to-bumper distance (gap) that the following vehicle keeps from the lead vehicle .
Edit intent: fluency
Original:  This paper focuses on the study of the effect that the class of the vehicle, leading heavy vehicles in particular, causes on the following vehicle  behavior, specifically in terms of the following bumper-to-bumper distance (gap) that the following vehicle keeps from the lead vehicle .
Revised:  This paper focuses on the study of the effect that the class of the vehicle, leading heavy vehicles in particular, causes on the following vehicle behavior, specifically in terms of the following bumper-to-bumper distance (gap) between the following and leading vehicles .
Edit intent: clarity
Original:  This was done by extracting and analyzing different car following episodes in the Next Generation Simulation (NGSIM)
Revised:  This was done by extracting and analyzing different car-following episodes from the Next Generation Simulation (NGSIM)
Edit intent: clarity
Original:  dataset for Interstate 80 (I 80) in Emeryville, California, USA. The results of the statistical analysis are compared to that of the synthesized literature of research efforts that have been carried out on the topic, then are further assessed utilizing different calibrated behavioral clusters for the Gazis-Herman-Rothery (GHR) car-following model to address the similarities and differences in car-following behavior between drivers of the same vehicle class .
Revised:  dataset for Interstate 80 (I 80) in Emeryville, California, USA. The results of the statistical analysis are compared to that of the synthesized literature of research efforts that have been conducted on the topic, then are further assessed utilizing different calibrated behavioral clusters for the Gazis-Herman-Rothery (GHR) car-following model to address the similarities and differences in car-following behavior between drivers of the same vehicle class .
Edit intent: clarity
Original:  dataset for Interstate 80 (I 80) in Emeryville, California, USA. The results of the statistical analysis are compared to that of the synthesized literature of research efforts that have been carried out on the topic, then are further assessed utilizing different calibrated behavioral clusters for the Gazis-Herman-Rothery (GHR) car-following model to address the similarities and differences in car-following behavior between drivers of the same vehicle class .
Revised:  dataset for Interstate 80 (I 80) in Emeryville, California, USA. The results of the statistical analysis are compared to that of the synthesized literature of research efforts that have been carried out on the topic, then are further assessed utilizing different behavioral clusters for the Gazis-Herman-Rothery (GHR) car-following model to address the similarities and differences in car-following behavior between drivers of the same vehicle class .
Edit intent: clarity
Original:  The paper also validates the results of the statistical analysis and highlights possible future implementations  .
Revised:  The paper also validates the results of the statistical analysis and highlighting possible future implementations .
Edit intent: fluency
Original:  These problems , each with potential solutions via SP, are: how to overcome the divide between symbolic and non-symbolic kinds of knowledge and processing;
Revised:  These problems are: the need to bridge the divide between symbolic and non-symbolic kinds of knowledge and processing;
Edit intent: clarity
Original:  Our full dataset includes 34,642 radiology reports and 1479 patients of IPV victims and control patients.
Revised:  Our dataset includes 34,642 radiology reports and 1479 patients of IPV victims and control patients.
Edit intent: clarity
Original: Shared caches in modern processors are vulnerable to conflict-based  attacks, whereby an attacker monitors the access pattern of a victim by engineering cache-set conflicts.
Revised: Shared caches in processors are vulnerable to conflict-based attacks, whereby an attacker monitors the access pattern of a victim by engineering cache-set conflicts.
Edit intent: clarity
Original: Shared caches in modern processors are vulnerable to conflict-based  attacks, whereby an attacker monitors the access pattern of a victim by engineering cache-set conflicts.
Revised: Shared caches in modern processors are vulnerable to conflict-based attacks, whereby an attacker can monitor the access pattern of a victim by engineering cache-set conflicts.
Edit intent: clarity
Original:  Unfortunately, such designs continue to select eviction candidates from a small subset of the resident cache lines, which makes such designs vulnerable to algorithms that can quickly identify the conflicting addresses .
Revised:  Unfortunately, such designs continue to select eviction candidates from a small set of conflicting lines .
Edit intent: clarity
Original:  A key challenge in naively adopting such designs for large shared caches (containing tens of thousands of  lines) is  the complexity of cache-lookup, as that can require searching through all the lines resident in the cache in such designs.
Revised:  A key challenge in enabling such a design for large shared caches (containing tens of thousands of lines) is the complexity of cache-lookup, as that can require searching through all the lines resident in the cache in such designs.
Edit intent: clarity
Original:  A key challenge in naively adopting such designs for large shared caches (containing tens of thousands of  lines) is  the complexity of cache-lookup, as that can require searching through all the lines resident in the cache in such designs.
Revised:  A key challenge in naively adopting such designs for large shared caches (containing tens of thousands of lines) is managing the complexity of cache-lookup, as that can require searching through all the lines resident in the cache in such designs.
Edit intent: clarity
Original:  (1) Pointer-based indirection from the tag-store to the data-store , which allows a newly installed address to  evict data of any resident line, (2) Skewed-associative tag-store with extra invalid tags , wherein incoming addresses can be installed without set-conflicts, and (3) Load-aware placement that maximizes the availability of sets with invalid tags , to eliminate set-conflicts .
Revised:  (1) Pointer-based indirection from the tag-store to data-store , which allows a newly installed address to evict data of any resident line, (2) Skewed-associative tag-store with extra invalid tags , wherein incoming addresses can be installed without set-conflicts, and (3) Load-aware placement that maximizes the availability of sets with invalid tags , to eliminate set-conflicts .
Edit intent: fluency
Original:  (1) Pointer-based indirection from the tag-store to the data-store , which allows a newly installed address to  evict data of any resident line, (2) Skewed-associative tag-store with extra invalid tags , wherein incoming addresses can be installed without set-conflicts, and (3) Load-aware placement that maximizes the availability of sets with invalid tags , to eliminate set-conflicts .
Revised:  (1) Pointer-based indirection from the tag-store to the data-store to allow a newly installed address to evict data of any resident line, (2) Skewed-associative tag-store with extra invalid tags , wherein incoming addresses can be installed without set-conflicts, and (3) Load-aware placement that maximizes the availability of sets with invalid tags , to eliminate set-conflicts .
Edit intent: coherence
Original:  (1) Pointer-based indirection from the tag-store to the data-store , which allows a newly installed address to  evict data of any resident line, (2) Skewed-associative tag-store with extra invalid tags , wherein incoming addresses can be installed without set-conflicts, and (3) Load-aware placement that maximizes the availability of sets with invalid tags , to eliminate set-conflicts .
Revised:  (1) Pointer-based indirection from the tag-store to the data-store , which allows a newly installed address to evict data of any random resident line. To eliminate set-conflicts, Mirage provisions extra invalid tags , wherein incoming addresses can be installed without set-conflicts, and (3) Load-aware placement that maximizes the availability of sets with invalid tags , to eliminate set-conflicts .
Edit intent: clarity
Original:  (1) Pointer-based indirection from the tag-store to the data-store , which allows a newly installed address to  evict data of any resident line, (2) Skewed-associative tag-store with extra invalid tags , wherein incoming addresses can be installed without set-conflicts, and (3) Load-aware placement that maximizes the availability of sets with invalid tags , to eliminate set-conflicts .
Revised:  (1) Pointer-based indirection from the tag-store to the data-store , which allows a newly installed address to evict data of any resident line, (2) Skewed-associative tag-store with extra invalid tags and a skewed-associative tag-store design where lines can be installed without set-conflicts, and (3) Load-aware placement that maximizes the availability of sets with invalid tags , to eliminate set-conflicts .
Edit intent: clarity
Original:  (1) Pointer-based indirection from the tag-store to the data-store , which allows a newly installed address to  evict data of any resident line, (2) Skewed-associative tag-store with extra invalid tags , wherein incoming addresses can be installed without set-conflicts, and (3) Load-aware placement that maximizes the availability of sets with invalid tags , to eliminate set-conflicts .
Revised:  (1) Pointer-based indirection from the tag-store to the data-store , which allows a newly installed address to evict data of any resident line, (2) Skewed-associative tag-store with extra invalid tags , wherein incoming addresses can be installed without set-conflict, along with a load-aware skew-selection policy that guarantees the availability of sets with invalid tags , to eliminate set-conflicts .
Edit intent: clarity
Original:  (1) Pointer-based indirection from the tag-store to the data-store , which allows a newly installed address to  evict data of any resident line, (2) Skewed-associative tag-store with extra invalid tags , wherein incoming addresses can be installed without set-conflicts, and (3) Load-aware placement that maximizes the availability of sets with invalid tags , to eliminate set-conflicts .
Revised:  (1) Pointer-based indirection from the tag-store to the data-store , which allows a newly installed address to evict data of any resident line, (2) Skewed-associative tag-store with extra invalid tags , wherein incoming addresses can be installed without set-conflicts, and (3) Load-aware placement that maximizes the availability of sets with invalid tags .
Edit intent: coherence
Original:  Our analysis shows Mirage provides the global-eviction property of a fully-associative cache throughout the system lifetime (violations of full-associativity, i.e set-conflicts, occur less than once in 10^4 to 10^17 years),  offering a principled defense against set-conflict based attacks.
Revised:  Our analysis shows Mirage provides the global eviction property of a fully-associative cache throughout the system lifetime (violations of full-associativity, i.e set-conflicts, occur less than once in 10^4 to 10^17 years), offering a principled defense against set-conflict based attacks.
Edit intent: fluency
Original:  Our analysis shows Mirage provides the global-eviction property of a fully-associative cache throughout the system lifetime (violations of full-associativity, i.e set-conflicts, occur less than once in 10^4 to 10^17 years),  offering a principled defense against set-conflict based attacks.
Revised:  Our analysis shows Mirage provides the global-eviction property of a fully-associative cache throughout system-lifetime (violations of full-associativity, i.e set-conflicts, occur less than once in 10^4 to 10^17 years), offering a principled defense against set-conflict based attacks.
Edit intent: fluency
Original:  Our analysis shows Mirage provides the global-eviction property of a fully-associative cache throughout the system lifetime (violations of full-associativity, i.e set-conflicts, occur less than once in 10^4 to 10^17 years),  offering a principled defense against set-conflict based attacks.
Revised:  Our analysis shows Mirage provides the global-eviction property of a fully-associative cache throughout the system lifetime (violations of full-associativity, i.e set-conflicts, occur less than once in 10^4 to 10^17 years), thus offering a principled defense against set-conflict based attacks.
Edit intent: coherence
Original: Shared caches in processors are vulnerable to conflict-based side-channel attacks, whereby an attacker can monitor the access pattern of a victim by evicting victim cache lines using cache-set conflicts.
Revised: Shared processor caches are vulnerable to conflict-based side-channel attacks, whereby an attacker can monitor the access pattern of a victim by evicting victim cache lines using cache-set conflicts.
Edit intent: clarity
Original: Shared caches in processors are vulnerable to conflict-based side-channel attacks, whereby an attacker can monitor the access pattern of a victim by evicting victim cache lines using cache-set conflicts.
Revised: Shared caches in processors are vulnerable to conflict-based side-channel attacks, where an attacker can monitor the access pattern of a victim by evicting victim cache lines using cache-set conflicts.
Edit intent: clarity
Original: Shared caches in processors are vulnerable to conflict-based side-channel attacks, whereby an attacker can monitor the access pattern of a victim by evicting victim cache lines using cache-set conflicts.
Revised: Shared caches in processors are vulnerable to conflict-based side-channel attacks, whereby an attacker can monitor access patterns of a victim by evicting victim cache lines using cache-set conflicts.
Edit intent: fluency
Original:  Recent mitigations propose a randomized mapping of addresses to cache lines , to obfuscate locations of set-conflicts.
Revised:  Recent mitigations propose randomized mapping of addresses to cache lines , to obfuscate locations of set-conflicts.
Edit intent: fluency
Original:  Recent mitigations propose a randomized mapping of addresses to cache lines , to obfuscate locations of set-conflicts.
Revised:  Recent mitigations propose a randomized mapping of addresses to cache lines to obfuscate the locations of set-conflicts.
Edit intent: fluency
Original:  However, newer attacks are able to discover conflicting addresses despite such mitigations, because these designs select candidates for eviction only from a small set of conflicting lines.
Revised:  However, these are vulnerable to new attacks that discover conflicting sets of addresses despite such mitigations, because these designs select candidates for eviction only from a small set of conflicting lines.
Edit intent: clarity
Original:  However, newer attacks are able to discover conflicting addresses despite such mitigations, because these designs select candidates for eviction only from a small set of conflicting lines.
Revised:  However, newer attacks are able to discover conflicting addresses despite such mitigations, because these designs select eviction-candidates from a small set of conflicting lines.
Edit intent: clarity
Original:  This paper presents Mirage, a practical design for a fully associative cache, wherein eviction candidates are selected randomly from among all the lines resident in the cache, to be immune to set-conflicts.
Revised:  This paper presents Mirage, a practical design for a fully associative cache, wherein eviction candidates are selected randomly from all lines resident in the cache, to be immune to set-conflicts.
Edit intent: clarity
Original:  A key challenge in enabling such a design for large shared caches (containing tens of thousands of resident cache lines) is managing the complexity of cache-lookup, as a naive design can require searching through all the resident lines.
Revised:  A key challenge for enabling such designs in large shared caches (containing tens of thousands of resident cache lines) is managing the complexity of cache-lookup, as a naive design can require searching through all the resident lines.
Edit intent: fluency
Original:  A key challenge in enabling such a design for large shared caches (containing tens of thousands of resident cache lines) is managing the complexity of cache-lookup, as a naive design can require searching through all the resident lines.
Revised:  A key challenge in enabling such a design for large shared caches (containing tens of thousands of cache lines) is managing the complexity of cache-lookup, as a naive design can require searching through all the resident lines.
Edit intent: fluency
Original:  A key challenge in enabling such a design for large shared caches (containing tens of thousands of resident cache lines) is managing the complexity of cache-lookup, as a naive design can require searching through all the resident lines.
Revised:  A key challenge in enabling such a design for large shared caches (containing tens of thousands of resident cache lines) is the complexity of cache-lookup, as a naive design can require searching through all the resident lines.
Edit intent: clarity
Original:  Mirage achieves full-associativity while retaining practical set-associative lookups by decoupling placement and replacement, using pointer-based indirection from tag-store to data-store to allow a newly installed address to globally evict  data of any random resident line.
Revised:  Mirage achieves full-associativity while retaining practical set-associative lookups by decoupling placement and replacement, using pointer-based indirection from tag-store to data-store to allow a newly installed address to globally evict the data of any random resident line.
Edit intent: fluency
Original:  To eliminate set-conflicts, Mirage provisions extra invalid tags and a skewed-associative tag-store design where lines can be installed without set-conflict, along with a load-aware skew-selection policy that guarantees the availability of sets with invalid tags.
Revised:  To eliminate set-conflicts, Mirage provisions extra invalid tags in a skewed-associative tag-store design where lines can be installed without set-conflict, along with a load-aware skew-selection policy that guarantees the availability of sets with invalid tags.
Edit intent: coherence
Original:  Our analysis shows Mirage provides the global eviction property of a fully-associative cache throughout system-lifetime (violations of full-associativity, i.e  set-conflicts, occur less than once in 10^4 to 10^17 years), thus offering a principled defense against any eviction-set discovery and any potential conflict based attacks.
Revised:  Our analysis shows Mirage provides the global eviction property of a fully-associative cache throughout system lifetime (violations of full-associativity, i.e set-conflicts, occur less than once in 10^4 to 10^17 years), thus offering a principled defense against any eviction-set discovery and any potential conflict based attacks.
Edit intent: fluency
Original:  Our analysis shows Mirage provides the global eviction property of a fully-associative cache throughout system-lifetime (violations of full-associativity, i.e  set-conflicts, occur less than once in 10^4 to 10^17 years), thus offering a principled defense against any eviction-set discovery and any potential conflict based attacks.
Revised:  Our analysis shows Mirage provides the global eviction property of a fully-associative cache throughout system-lifetime (violations of full-associativity, i.e . set-conflicts, occur less than once in 10^4 to 10^17 years), thus offering a principled defense against any eviction-set discovery and any potential conflict based attacks.
Edit intent: fluency
Original:  Multi-Aspect Rating Prediction (MARP ), where the goal is to predict the ratings  from a review at an individual aspect level, has become a challenging and an imminent problem.
Revised:  Multi-Aspect Rating Prediction (MARP ), where the goal is to predict the ratings from a review at an individual aspect level, has become a challenging and imminent problem.
Edit intent: fluency
Original:  As opposed to the previous studies, which make use of hand-crafted keywords to determine aspects in sentiment predictions, our model does not suffer from human bias issues since aspect keywords are automatically detected through a self-attention mechanism.
Edit intent: coherence