2009 Fourth International Conference on Digital Information Management最新文献_第3页

Motivations for media sharing among mobile phone users 手机用户媒体分享的动机

2009 Fourth International Conference on Digital Information Management Pub Date : 2009-12-18 DOI: 10.1109/ICDIM.2009.5356782

A. Chua, C. S. Lee, D. Goh, R. Ang

引用次数: 4

A topology-aware load balancing algorithm for P2P systems 基于拓扑感知的P2P系统负载均衡算法

2009 Fourth International Conference on Digital Information Management Pub Date : 2009-12-18 DOI: 10.1109/ICDIM.2009.5356795

Seyed Iman Mirrezaei, Javad Shahparian, M. Ghodsi

{"title":"A topology-aware load balancing algorithm for P2P systems","authors":"Seyed Iman Mirrezaei, Javad Shahparian, M. Ghodsi","doi":"10.1109/ICDIM.2009.5356795","DOIUrl":"https://doi.org/10.1109/ICDIM.2009.5356795","url":null,"abstract":"One of the challenges of P2P systems is to perform load balancing efficiently. A distributed hash table (DHT) abstraction, heterogeneous nodes, and non uniform distribution of objects cause load imbalance in structured P2P overlay networks. Several solutions are suggested to solve this problem but they have some restrictions. They assume the homogeneous capabilities of nodes, unawareness of the link latency during transferring load and imposing logical structures to collect and reassign load. This paper presents a distributed load balancing algorithm with topology awareness using the concept of virtual servers. In our proposed approach, each node collects neighborhood load information from physically close nodes and reassigns virtual servers to overlay nodes according to topology of underlying network. Consequently, it provides rapid convergence on load balance and reduces the load transfer cost. Moreover, our parametric algorithm increases the quality of load balancing among close nodes of overlay and also provides a new tradeoff between the quality of load balancing and load transfer cost among all overlay nodes. Our simulations show that our approach reduces the load transfer cost and saves a great network bandwidth.","PeriodicalId":300287,"journal":{"name":"2009 Fourth International Conference on Digital Information Management","volume":"495 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132415629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Human-computer interface design in an e-Learning system for individuals with cognitive and learning disabilities 认知与学习障碍者电子学习系统之人机介面设计

2009 Fourth International Conference on Digital Information Management Pub Date : 2009-12-18 DOI: 10.1109/ICDIM.2009.5356784

Grant D. Fryia, Renata Wachowiak-Smolíkova, M. Wachowiak

引用次数: 10

Quantifying the impact of funded research works 量化受资助研究工作的影响

2009 Fourth International Conference on Digital Information Management Pub Date : 2009-12-18 DOI: 10.1109/ICDIM.2009.5356778

S. Stamou, Paraskevi Tzekou, Nikos Zotos

{"title":"Quantifying the impact of funded research works","authors":"S. Stamou, Paraskevi Tzekou, Nikos Zotos","doi":"10.1109/ICDIM.2009.5356778","DOIUrl":"https://doi.org/10.1109/ICDIM.2009.5356778","url":null,"abstract":"A number of scientific publications discuss works that have been financially supported by agencies that invest in research. We refer to those publications as funded research works. In this paper, we try to capture the impact of funded research works, in order to assist funding agencies evaluate their efficacy in identifying the best research efforts. To accomplish our goal, we firstly need a method that automatically identifies publications that correspond to funded research. Our proposed method leverages NLP techniques in order to identify acknowledgments of financial support in the publications' content. Publications containing acknowledgments of financial support are deemed as funded works. Following the identification of funded research articles, we quantify their impact by considering the number of their citations, their freshness as well as the impact of their publication venue. The application of our method to a number of publications reveals that although funded research articles account to nearly 23% of the scientific publications, their average impact is increased compared to the average impact of non-funded publications. Our findings suggest that investments made on research deliver significant results and that funding agencies are effective in judging the potential impact of research efforts.","PeriodicalId":300287,"journal":{"name":"2009 Fourth International Conference on Digital Information Management","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126523237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Group based access control scheme (GBAC): Keeping information sharing secure in mobile Ad- hoc environment 基于组的访问控制方案(GBAC):保证移动自组织环境下信息共享的安全性

2009 Fourth International Conference on Digital Information Management Pub Date : 2009-12-18 DOI: 10.1109/ICDIM.2009.5356797

Asmidar Abu Bakar, Roslan Ismail, A. Ahmad, J. Manan, J. Jais

引用次数: 9

P2P applied in CMS for advertising P2P应用于CMS广告

2009 Fourth International Conference on Digital Information Management Pub Date : 2009-12-18 DOI: 10.1109/ICDIM.2009.5356799

Oliver Batz, Carsten Kleiner, Arne Koschel

引用次数: 0

Google based name search: Resolving mixed entities on the web 基于Google的名称搜索:解决网络上的混合实体

2009 Fourth International Conference on Digital Information Management Pub Date : 2009-12-18 DOI: 10.1109/ICDIM.2009.5356763

Byung-Won On, Ingyu Lee

{"title":"Google based name search: Resolving mixed entities on the web","authors":"Byung-Won On, Ingyu Lee","doi":"10.1109/ICDIM.2009.5356763","DOIUrl":"https://doi.org/10.1109/ICDIM.2009.5356763","url":null,"abstract":"When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when part of “names” of entities are used as their identifiers, the problem is often referred to as a mixed entity resolution problem, where goal is to sort out the erroneous entities due to name homonyms (e.g., if only last name is used as an identifier, one cannot distinguish “Vannevar Bush” from “George Bush”). Especially, a mixed entity resolution problem is common on the Web data. For instance, to search for a product name (e.g., Oracle) in Google, there exist a mixture of web pages due to the name homonyms (e.g., Oracle Database, Oracle Audio, Oracle Academy, etc.). In this paper, we present a practical system for resolving such mixed entities on the Web. For development of such a system, we propose a web service based interface, an unsu-pervised clustering scheme, and cluster ranking algorithms. In particular, since the correct number of clusters is often unknown, we study a state-of-the-art unsupervised clustering solution based on propagation of pairwise similarities of entities. Our claim is empirically validated via experimentation, showing that our approach outperforms main competing solution.","PeriodicalId":300287,"journal":{"name":"2009 Fourth International Conference on Digital Information Management","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132512508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Power efficient clustering algorithm 节能聚类算法

2009 Fourth International Conference on Digital Information Management Pub Date : 2009-12-18 DOI: 10.1109/ICDIM.2009.5356796

Hasan Al-Hamadi, Maytham Safar, Dariush Ebrahimi

引用次数: 2

Query operations of process-based searches 基于流程的查询操作

2009 Fourth International Conference on Digital Information Management Pub Date : 2009-12-18 DOI: 10.1109/ICDIM.2009.5356786

Yaling Liu, A. Agah

{"title":"Query operations of process-based searches","authors":"Yaling Liu, A. Agah","doi":"10.1109/ICDIM.2009.5356786","DOIUrl":"https://doi.org/10.1109/ICDIM.2009.5356786","url":null,"abstract":"This paper introduces a non-traditional Web search problem, referred to as “process-based search”, and focuses on the query analysis and formulation of this type of search. Traditional information retrieval models were created based on the assumption that one query can be answered by one document. A query needs to properly specify the topic being requested. Recently published work, referred to as subtopic retrieval or aspect retrieval, has relaxed this assumption that a query may contain multiple subtopics and it can be answered by a set of documents, each of which covers one or multiple subtopics. However, the original query was still assumed to explicitly specify the subtopics. Process-based search further relaxes the assumption to facilitate complex Web searches. The subtopics of the query do not have to be explicitly specified, because the user may not be able to do so in the initial search due to the lack of knowledge for the topic. A database of processes is used to discover the subtopics implied by the query. Thus, this type of search is called process-based search. This paper focuses on the algorithms for formulating sub-queries for the process-based search. Experiments on real data sets showed that the needs of process-based searching exist in the real world and the proposed concepts and approaches effectively solve this problem.","PeriodicalId":300287,"journal":{"name":"2009 Fourth International Conference on Digital Information Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131336024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Are SentiWordNet scores suited for multi-domain sentiment classification? SentiWordNet分数适合多领域情感分类吗?

2009 Fourth International Conference on Digital Information Management Pub Date : 2009-12-18 DOI: 10.1109/ICDIM.2009.5356764

K. Denecke

引用次数: 95