A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Refreshment policies for Web content caches
2002
Computer Networks
Preserved Fulltext
We evaluated and compared different policies using trace-based simulations. Ó ...
Thus, the functionality of caches as a latency-reducing mechanism highly depends not only on content availability but also on its freshness. ...
The frequency-based policies FREQ ðj; 0Þ and given that R ECEN CY yielded much worse tradeoffs. ...
doi:10.1016/s1389-1286(01)00300-0
fatcat:h766cwgckzdq5dtj7wsszskfdq
A quantitative study of Web cache replacement strategies using simulation
2011
Simulation (San Diego, Calif.)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The cache replacement strategies implemented in Squid, a widely used proxy cache software, are no longer considered 'good enough' today. Squid's default strategy is Least Recently Used. ...
In this paper, we focus on the cache replacement problem with respect to proxy servers. ...
However, it may be decreasing network latency as it may be giving preference to objects that have high latency/network costs, which is a factor the cost models use. ...
doi:10.1177/0037549711414152
fatcat:gmfkdcjmfredzlkyrybgmpbu4a
A Quantitative Study of Web Cache Replacement Strategies Using Simulation
[chapter]
2012
SpringerBriefs in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The cache replacement strategies implemented in Squid, a widely used proxy cache software, are no longer considered 'good enough' today. Squid's default strategy is Least Recently Used. ...
In this paper, we focus on the cache replacement problem with respect to proxy servers. ...
However, it may be decreasing network latency as it may be giving preference to objects that have high latency/network costs, which is a factor the cost models use. ...
doi:10.1007/978-1-4471-4893-7_4
fatcat:h43c4sfvsffg3hhzaov2lpzw7i
A relevance-scalability-interpretability tradeoff with temporally evolving user personas
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Finally, we show a trade-off between an indispensable trio of guarantees, relevance-scalability-interpretability by using summary information from personas in a CTR (Click through rate) predictive model ...
The current work characterizes the users of a VoD streaming space through user-personas based on a tenure timeline and temporal behavioral features in the absence of explicit user profiles. ...
Recency of Content consumed: We obtain 3 genre clusters based on the count matrices binned as per release year of content to observe characterizations for recency of content. ...
arXiv:1704.07554v2
fatcat:cp5hvc5w4nhczpue2hcorxdize
Multi-objective Tabu Search based topology generation technique for application-specific Network-on-Chip architectures
2011
2011 Design, Automation & Test in Europe
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A new method for contention analysis is presented in this work which makes use of power and performance objectives using a Layered Queuing Network (LQN) contention model. ...
This paper presents a power and performance multiobjective Tabu Search based technique for designing applicationspecific Network-on-Chip architectures. ...
Attributive Long Term Memory: Attributive memory acts as long term memory known as Frequency-Recency based memory (FR-Memory). ...
doi:10.1109/date.2011.5763084
dblp:conf/date/TinoK11
fatcat:243u52nmqbbh5be7d5fb4msumi
Systematic multiresolution and its application to the World Wide Web
1999
Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
It solves these problems by dynamically generating the "required version" of a web object based on client preferences and capabilities. ...
NetBlitz addresses two key problems facing the Web: high latencies and heterogeneity of client resources and requirements. ...
Network BW Latency components
where users can receive different versions of the object based on their resources and preferences. ...
doi:10.1109/icde.1999.754896
dblp:conf/icde/AcharyaKP99
fatcat:vtlyzndvazb4jormullagqfsbq
Top-k publish-subscribe for social annotation of news
2013
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Such top-k pub-sub consumes only a small fraction of the resource cost of alternative solutions, and can be applicable to other large scale content-based publish-subscribe problems. ...
Social content, such as Twitter updates, often have the quickest first-hand reports of news events, as well as numerous commentaries that are indicative of public view of such events. ...
. , Rs n
The recency function Until now we focused on content-based scoring only and ignored the recency score. ...
doi:10.14778/2536336.2536340
fatcat:qmc7y6vgqnabbczw4x44xcz64a
Amnesic cache management for non-volatile memory
2015
2015 31st Symposium on Mass Storage Systems and Technologies (MSST)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
LRU based cache management scheme. ...
In this paper, we take a different approach that makes use of the limited retention capability to our advantage. ...
It considers not only the conventional factors such as recency and frequency but also NVM-related factors such as dirty and clean for replacement decisions. ...
doi:10.1109/msst.2015.7208291
dblp:conf/mss/KangBCLNM15
fatcat:n2kxwmmalffgncq6nr7mzbaxpe
Applying Machine Learning Techniques for Caching in Edge Networks: A Comprehensive Survey
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In next generation edge networks, i.e., 5G and beyond 5G, machine learning techniques can be applied to predict content popularity based on user preferences, cluster users based on similar content interests ...
User mobility, preferences, and content popularity are the dominant dynamic features of edge networks. ...
However, the standard recency-based and frequency-based caching algorithms can not be applied to wireless edge networks due to its non-deterministic properties [110] . ...
arXiv:2006.16864v4
fatcat:fwayzkv5vrghzayqxq5sgfyh2u
A Survey on Mobile Edge Networks: Convergence of Computing, Caching and Communications
2017
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2017 pre-print arXiv:1703.10750v1 fatcat:62h3zhi5tre25hej4qa3gf6eeq
The traditional centralized network architecture cannot accommodate such user demands due to heavy burden on the backhaul links and long latency. ...
Therefore, new architectures which bring network functions and contents to the network edge are proposed, i.e., mobile edge computing and caching. ...
(LFU)
• Least recently used (LRU)
• most popular video (MPV)
User Preference Based
Policies
[82]
• Considering local content popularity
• User's preference toward specific video categories ...
doi:10.1109/access.2017.2685434
fatcat:omhcphk735czrnmjnwkoory6hq
An endogenous distributed model of ordering in serial recall
2002
Psychonomic Bulletin & Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Although other serial order models could be extended to make latency predictions-for example, in OSCAR, latency predictions could be based on the similarity between the correct response and the model's ...
Finally, response suppression has been used to model recency (e.g., Lewandowsky, 1999; Lewandowsky & Li, 1994; Lewandowsky & Murdock, 1989) . ...
This was omitted here because the random cues used in SOB contain no relevant information. ...
doi:10.3758/bf03196257
pmid:12026954
fatcat:u3b2x4iglbghdjimzbhoirvjmm
Efficiently correlating complex events over live and archived data streams
2011
Proceedings of the 5th ACM international conference on Distributed event-based system - DEBS '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we capture the relevant query processing tradeoffs in a cost model. ...
In this paper, we specifically focus on recencybased PCQs and provide clear, useful, and optimizable semantics for them. ...
Recency-based PCQs join live events with archive events based on the recency correlation distance specified in the query, as we define next. ...
doi:10.1145/2002259.2002293
dblp:conf/debs/DindarFST11
fatcat:kaaa7kbafnbctorw7fziwsfyze
Traveling economically through memory space: Characterizing output order in memory for serial order
2009
Memory & Cognition
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Similar distance effects in recognition, using latency rather than accuracy as the primary measure, have been obtained by McKoon and Ratcliff (1980; see also Lewandowsky, 1986 ). ...
Tan and Ward (2007) reported the same preference using a similar unconstrained task but involving written recall, suggesting that recency-first report is a general characteristic of immediate tests. ...
The focus on the first two output positions is particularly warranted in the present experiment, in which the use of short lists rapidly constrained the range of available lags across output positions. ...
doi:10.3758/mc.37.2.181
pmid:19223568
fatcat:fknp3p7uircixpq7ajx5jv7uma
Timely Semantics: A Study of a Stream-Based Ranking System for Entity Relationships
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Using a longitudinal case-study, we demonstrate (i) that low-latency, large-scale entity relationship ranking is feasible using moderate resources and (ii) that stream-based entity ranking improves the ...
This paper presents a study using a real-world stream-processing based implementation of an entity ranking system, to understand the effect of data timeliness on entity rankings. ...
This architecture enabled us to investigate the tradeoff between data recency and relevance in a live setting, where rankings can change every day. ...
doi:10.1007/978-3-319-25010-6_28
fatcat:e63hxpyy6vg2dplm7keb6shnei
AppJoy
2011
Proceedings of the 9th international conference on Mobile systems, applications, and services - MobiSys '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Based on all participants' application usage records, AppJoy employs an item-based collaborative filtering algorithm for individualized recommendations. ...
AppJoy has been available in the Android Market and used by more than 4600 users. ...
There also exist several music recommendation systems with a content-based approach. ...
doi:10.1145/1999995.2000007
dblp:conf/mobisys/YanC11
fatcat:ktqoxqp65fer7lcxgn3tydafoe
« Previous
Showing results 1 — 15 out of 171 results