As the sharable and reusable domain knowledge, domain ontology increasingly serves as a foundation for semantic Web. Personalized management of domain ontologies is to provide personalized views of domain ontologies t...
详细信息
Recently flash-based solid-state drives (SSDs) have been widely deployed as cache devices to boost system performance. However, classical SSD cache algorithms (e.g. LRU) replace the cached data frequently to maintain ...
详细信息
ISBN:
(纸本)9781450333580
Recently flash-based solid-state drives (SSDs) have been widely deployed as cache devices to boost system performance. However, classical SSD cache algorithms (e.g. LRU) replace the cached data frequently to maintain high hit rates. Such aggressive data updating strategies result in too many writing operations on SSDs and make them wear out quickly, which finally leads to high costs of SSDs for enterprise applications. In this paper, we propose a novel Expiration-Time Driven Cache (ETD-Cache) method to solve this problem. In ETD-Cache, an active data eviction mechanism is adopted. An already cached block leaves the SSD cache if and only if there is no access to it for a time longer than a specified expiration time. This mechanism gives more time for the cached contents to wait for their following accesses and limits the admission of newly arrived blocks to generate less SSD writes. In addition, a low-overhead candidate management module is designed to maintain the most popular data in the system for the potential cache replacement. The simulations driven by a series of typical real-world traces indicate that due to the great reduction on data updating frequency, ETD-Cache lowers the total SSD costs by 98.45% compared with LRU under the same cache hit rate. Copyright 2015 ACM.
Sequential pattern mining is an important problem in continuous, fast, dynamic and unlimited stream mining. Recently approximate mining algorithms are proposed which spend too many system resources and can only obtain...
详细信息
Due to the rapid growth of social net services (SNSs), research into SNSs continuance usage has recently emerged as an important issue in information systems adaption. This study develops an integrated model based on ...
详细信息
Despite its success,similarity-based collaborative filtering suffers from some limitations,such as scalability,sparsity and recommendation *** work has shown incorporating trust mechanism into traditional collaborativ...
详细信息
Despite its success,similarity-based collaborative filtering suffers from some limitations,such as scalability,sparsity and recommendation *** work has shown incorporating trust mechanism into traditional collaborative filtering recommender systems can improve these *** argue that trust-based recommender systems are facing novel recommendation attack which is different from the profile injection attacks in traditional recommender *** the best of our knowledge,there has not any prior study on recommendation attack in a trust-based recommender *** analyze the attack problem,and find that "victim" nodes play a significant role in the ***,we propose a data provenance method to trace malicious users and identify the "victim" nodes as distrust users of recommender *** study of the defend method is done with the dataset crawled from Epinions website.
Cell association is a significant research issue in future mobile communication systems due to the unacceptably large computational time of traditional *** article proposes a polynomial-time cell association scheme wh...
详细信息
Cell association is a significant research issue in future mobile communication systems due to the unacceptably large computational time of traditional *** article proposes a polynomial-time cell association scheme which not only completes the association in polynomial time but also fits for a generic optimization objective *** the one hand,traditional cell association as a non-deterministic polynomial(NP)hard problem with a generic utility function is heuristically transformed into a 2-dimensional assignment optimization and solved by a certain polynomial-time algorithm,which significantly saves computational *** the other hand,the scheme jointly considers utility maximization and load balancing among multiple base stations(BSs)by maintaining an experience pool storing a set of weighting factor values and their corresponding *** an association optimization is required,a suitable weighting factor value is taken from the pool to calculate a long square utility matrix and a certain polynomial-time algorithm will be applied for the *** with several representative schemes,the proposed scheme achieves large system capacity and high fairness within a relatively short computational time.
We report our experiment results on the INEX 2012 Linked data Track. We participated in the ad hoc and jeopardy tasks. As the new data collection on INEX 2012 Linked data Track features a combination of unstructured a...
详细信息
We report our experiment results on the INEX 2012 Linked data Track. We participated in the ad hoc and jeopardy tasks. As the new data collection on INEX 2012 Linked data Track features a combination of unstructured and structured data, our first attempt is to investigate different strategies of combining the retrievals over structured and unstructured data, and compare the combined approaches with the traditional unstructured ones. In this paper, we discussed three types of combination strategies and we experimented two of them on the track. The experiment results show that.
Many distributed key-value storage systems employ the simple and effective Raft protocol to ensure data consistency. They usually assume a homogeneous node hardware configuration for the underlying cluster and thus ad...
详细信息
Multi-label stream classification aims to address the challenge of dynamically assigning multiple labels to sequentially-arrived instances. In real situations, only partial labels of instances can be observed due to t...
详细信息
Although there have been many efforts for management of uncertain data, evaluating probabilistic inference queries, a known NP-hard problem, is still a big challenge, especially for querying data with highly correlati...
详细信息
暂无评论