Seamlessly integrating services in a heterogeneous environment is a hot topic in pervasive computing. Given information explosion, it is wise to provide users services of recommending personalized information, although recommendation quality in a P2P network usually can not be compared with that in a centralized environment. In this paper, we introduce a music collaborative filtering system combining centralized and P2P recommendation algorithms together, which aims to provide consistent music recommendation services in a heterogeneous pervasive environment. Instead of bothering users for explicit ratings, we first track their listening behaviors and then extract implicit ratings using a new extraction mechanism. Meanwhile, we adopt a double-criteria strategy for the centralized algorithm, which integrates song recommendation and artist recommendation together. Moreover, we design a novel scalable gossip-based P2P recommendation algorithm that takes advantage of centralized services as much as possible with contexts switching. In addition, we shed some lights on the serendipity problem that is common in most recommendation systems.
{"title":"Consistent Music Recommendation in Heterogeneous Pervasive Environment","authors":"L. Cao, M. Guo","doi":"10.1109/ISPA.2008.67","DOIUrl":"https://doi.org/10.1109/ISPA.2008.67","url":null,"abstract":"Seamlessly integrating services in a heterogeneous environment is a hot topic in pervasive computing. Given information explosion, it is wise to provide users services of recommending personalized information, although recommendation quality in a P2P network usually can not be compared with that in a centralized environment. In this paper, we introduce a music collaborative filtering system combining centralized and P2P recommendation algorithms together, which aims to provide consistent music recommendation services in a heterogeneous pervasive environment. Instead of bothering users for explicit ratings, we first track their listening behaviors and then extract implicit ratings using a new extraction mechanism. Meanwhile, we adopt a double-criteria strategy for the centralized algorithm, which integrates song recommendation and artist recommendation together. Moreover, we design a novel scalable gossip-based P2P recommendation algorithm that takes advantage of centralized services as much as possible with contexts switching. In addition, we shed some lights on the serendipity problem that is common in most recommendation systems.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121822685","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}
Light Detection and Ranging (LiDAR) data has been used to model earth surface in an easy and economic way. As technology is developed the application of LiDAR data is also widely expanded to various areas, such as hydrological modeling, telecommunication service and urban planning. Finding accurate road networks is one of the common applications from massive LiDAR data. A novel algorithm to extract road points has been developed based on both the intensity and height information of data points. First the robustness of the sequential algorithm has been verified with real data points. Then a parallel algorithm has been developed by applying smart area partitioning. The performance of a parallel algorithm showed us a close linear speedup with the use of up to four processors. Experimental results from the parallel algorithm are presented in this paper in detail and demonstrate the robustness of the proposed method.
{"title":"Parallel Algorithm for Road Points Extraction from Massive LiDAR Data","authors":"Jiangtao Li, H. Lee, G. Cho","doi":"10.1109/ISPA.2008.60","DOIUrl":"https://doi.org/10.1109/ISPA.2008.60","url":null,"abstract":"Light Detection and Ranging (LiDAR) data has been used to model earth surface in an easy and economic way. As technology is developed the application of LiDAR data is also widely expanded to various areas, such as hydrological modeling, telecommunication service and urban planning. Finding accurate road networks is one of the common applications from massive LiDAR data. A novel algorithm to extract road points has been developed based on both the intensity and height information of data points. First the robustness of the sequential algorithm has been verified with real data points. Then a parallel algorithm has been developed by applying smart area partitioning. The performance of a parallel algorithm showed us a close linear speedup with the use of up to four processors. Experimental results from the parallel algorithm are presented in this paper in detail and demonstrate the robustness of the proposed method.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127235130","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}
M. Mirto, S. Vicario, D. Tartarini, I. Epicoco, C. Saccone, G. Aloisio
This works presents the porting on the grid of a parallel application of phylogenetic inference, MrBayes, in the LIBI (International Laboratory of Bioinformatics) platform. Moreover a bioinformatic case study about the analysis of 11 phylogenies, including a series of large sequences data sets that represent the nascent barcode reference database for Lepidoptera is also presented. The case study has been tested on the platform and the speedup and efficiency on Itanium HP XC6000 (Intel Itanium 2 processors and Quadrics interconnects) of the SPACI consortium, University of Salento, are described.
这项工作展示了在LIBI(国际生物信息学实验室)平台上并行应用系统发育推断(MrBayes)的网格移植。此外，还介绍了11个系统发育的生物信息学案例分析，包括一系列代表鳞翅目条形码参考数据库的大序列数据集。案例研究在平台上进行了测试，并描述了Salento大学SPACI联盟的Itanium HP XC6000 (Intel Itanium 2处理器和Quadrics互连)的加速和效率。
{"title":"Bayesian Phylogenetic Inference in the LIBI Grid Platform: A Tool to Explore Large Data Sets","authors":"M. Mirto, S. Vicario, D. Tartarini, I. Epicoco, C. Saccone, G. Aloisio","doi":"10.1109/ISPA.2008.137","DOIUrl":"https://doi.org/10.1109/ISPA.2008.137","url":null,"abstract":"This works presents the porting on the grid of a parallel application of phylogenetic inference, MrBayes, in the LIBI (International Laboratory of Bioinformatics) platform. Moreover a bioinformatic case study about the analysis of 11 phylogenies, including a series of large sequences data sets that represent the nascent barcode reference database for Lepidoptera is also presented. The case study has been tested on the platform and the speedup and efficiency on Itanium HP XC6000 (Intel Itanium 2 processors and Quadrics interconnects) of the SPACI consortium, University of Salento, are described.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125848348","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}
A. Murli, V. Boccia, L. Carracciuolo, L. D’Amore, G. Laccetti, M. Lapegna
In this paper we are concerned with improvements and enhancements of a medical imaging grid-enabled infrastructure, named MedIGrid, oriented to the transparent use of resource-intensive applications for managing, processing and visualizing biomedical images. We describe an implementation of the MedIGrid PSE in an LCG/gLite environment. Wepsilall mainly focus on how to exploit the features of the new middleware environment to improve the efficiency and the services reliability of the PSE; further, some comments will be devoted to how to modify, extend and/or improve the underlying numerical components.
{"title":"The MedIGrid PSE in an LCG/gLite environment","authors":"A. Murli, V. Boccia, L. Carracciuolo, L. D’Amore, G. Laccetti, M. Lapegna","doi":"10.1109/ISPA.2008.65","DOIUrl":"https://doi.org/10.1109/ISPA.2008.65","url":null,"abstract":"In this paper we are concerned with improvements and enhancements of a medical imaging grid-enabled infrastructure, named MedIGrid, oriented to the transparent use of resource-intensive applications for managing, processing and visualizing biomedical images. We describe an implementation of the MedIGrid PSE in an LCG/gLite environment. Wepsilall mainly focus on how to exploit the features of the new middleware environment to improve the efficiency and the services reliability of the PSE; further, some comments will be devoted to how to modify, extend and/or improve the underlying numerical components.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126080230","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}
The fundamental technique of vision-based multi-touch technique is the high performance image processing. In this paper, two algorithms are presented to resolve the problems of blob recognition and tracking. Image contour transformation algorithm is adopted to analyze the existence of finger contact area and Minimum Distance First (MDF) algorithm is designed to identify and track the corresponding blob in two sequential images. The result shows that the performance of two algorithms fully meets the requirement of real time multi-touch system.
{"title":"A Robust Blob Recognition and Tracking Method in Vision-Based Multi-touch Technique","authors":"Feng Wang, Xiangshi Ren, Z. Liu","doi":"10.1109/ISPA.2008.129","DOIUrl":"https://doi.org/10.1109/ISPA.2008.129","url":null,"abstract":"The fundamental technique of vision-based multi-touch technique is the high performance image processing. In this paper, two algorithms are presented to resolve the problems of blob recognition and tracking. Image contour transformation algorithm is adopted to analyze the existence of finger contact area and Minimum Distance First (MDF) algorithm is designed to identify and track the corresponding blob in two sequential images. The result shows that the performance of two algorithms fully meets the requirement of real time multi-touch system.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126659893","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}
Communication facilities for vehicles became more and more important over the last years. Most time this involves the usage of wireless technologies for communication between vehicles, between vehicles and the roadside, as well as between the vehicle and systems reachable via Wide Area Networks (WANs) such as the Internet. This paper discusses how Internet technologies can be used for supporting the communication of mobile vehicles, which risks are involved performing this mobile communication, and which security technologies can prevent against these risks.
{"title":"Critical Aspects for a Secure IP Mobility Architecture in Vehicular Area Networks (VANETs)","authors":"W. Fritsche","doi":"10.1109/ISPA.2008.51","DOIUrl":"https://doi.org/10.1109/ISPA.2008.51","url":null,"abstract":"Communication facilities for vehicles became more and more important over the last years. Most time this involves the usage of wireless technologies for communication between vehicles, between vehicles and the roadside, as well as between the vehicle and systems reachable via Wide Area Networks (WANs) such as the Internet. This paper discusses how Internet technologies can be used for supporting the communication of mobile vehicles, which risks are involved performing this mobile communication, and which security technologies can prevent against these risks.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122354192","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}
Mobile ad hoc network (MANET) is an autonomous distributed network which is constructed only with gathered nodes on the spot. In MANET, wide area communication on wireless networks can be realized because a node relays other node's packets by adopting a multi-hop routing protocol. Security is an indispensable issue in MANET because an unknown node may join the network easily. However, the demand for the level of authentication and its response time is different depending on the environment and applications. Thus, we focus on real-time control of the security mechanism for MANET. In this paper, we have established multi-hop communication environment and introduced methods to control secure connections by applying IPsec as an encryption scheme, on top of the general-purpose operating systems with enabled preemption for interruption. Under such conditions, we have measured response time of CPU with or without load of other applications. We have evaluated the influence of streaming as an application load and investigated on a security realization method for MANET.
{"title":"An Evaluation of a Security Mechanism Response Time Using a General Purpose OS for a Multi-hop Network","authors":"Mihoko Uno, M. Oguchi","doi":"10.1109/ISPA.2008.77","DOIUrl":"https://doi.org/10.1109/ISPA.2008.77","url":null,"abstract":"Mobile ad hoc network (MANET) is an autonomous distributed network which is constructed only with gathered nodes on the spot. In MANET, wide area communication on wireless networks can be realized because a node relays other node's packets by adopting a multi-hop routing protocol. Security is an indispensable issue in MANET because an unknown node may join the network easily. However, the demand for the level of authentication and its response time is different depending on the environment and applications. Thus, we focus on real-time control of the security mechanism for MANET. In this paper, we have established multi-hop communication environment and introduced methods to control secure connections by applying IPsec as an encryption scheme, on top of the general-purpose operating systems with enabled preemption for interruption. Under such conditions, we have measured response time of CPU with or without load of other applications. We have evaluated the influence of streaming as an application load and investigated on a security realization method for MANET.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122197546","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}
E. Papadopoulou, S. McBurney, N. Taylor, M. H. Williams
User preferences have an important role to play in decision making in pervasive systems, and most systems incorporate some form of preferences, albeit that different forms and approaches are used in different implementations. It is generally accepted that user preferences need to be context-dependent, although the process of applying user preferences to personalize decision taking in the system tends to be treated as a static process that is carried out at the outset when a service is started and not referred to again unless the user specifically instructs a change. However, there are situations where a more dynamic approach to dealing with user preferences is called for. This has been investigated as part of the Daidalos pervasive system, and this paper reports on the approach used and implemented in this system.
{"title":"A Dynamic Approach to Dealing with User Preferences in a Pervasive System","authors":"E. Papadopoulou, S. McBurney, N. Taylor, M. H. Williams","doi":"10.1109/ISPA.2008.32","DOIUrl":"https://doi.org/10.1109/ISPA.2008.32","url":null,"abstract":"User preferences have an important role to play in decision making in pervasive systems, and most systems incorporate some form of preferences, albeit that different forms and approaches are used in different implementations. It is generally accepted that user preferences need to be context-dependent, although the process of applying user preferences to personalize decision taking in the system tends to be treated as a static process that is carried out at the outset when a service is started and not referred to again unless the user specifically instructs a change. However, there are situations where a more dynamic approach to dealing with user preferences is called for. This has been investigated as part of the Daidalos pervasive system, and this paper reports on the approach used and implemented in this system.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124593186","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}
Chainan Satayapiwat, Ryusuke Egawa, H. Takizawa, Hiroaki Kobayashi
In Grid Computing, harnessing the power of idle resources in a distributed environment is one of the important features. However, to fully benefit from this computing model, an appropriated resource allocation method needs to be carefully chosen and deployed. A number of studies have been done on this area and one of the promising approaches is to adopt a marketing scheme called the auction model, which has been drawing much attention during past several years. In this paper, we propose a new utility-aware resource allocation protocol to make external scheduling decision in Grid. Users and service providers specify one or more weight values, and then, an auctioneer uses these values for calculating both userspsila and service providerspsila utility values which reflect preference upon the matched members in the different group. Then, we map the scheduling problem with these utility values into the problem in a weighted bipartite graph, and propose a new matching algorithm based on the existing SMP (Stable Marriage Problem) matching algorithm. Finally, the performance of this auctionpsilas awarding technique is evaluated.
{"title":"A Utility-Based Double Auction Mechanism for Efficient Grid Resource Allocation","authors":"Chainan Satayapiwat, Ryusuke Egawa, H. Takizawa, Hiroaki Kobayashi","doi":"10.1109/ISPA.2008.103","DOIUrl":"https://doi.org/10.1109/ISPA.2008.103","url":null,"abstract":"In Grid Computing, harnessing the power of idle resources in a distributed environment is one of the important features. However, to fully benefit from this computing model, an appropriated resource allocation method needs to be carefully chosen and deployed. A number of studies have been done on this area and one of the promising approaches is to adopt a marketing scheme called the auction model, which has been drawing much attention during past several years. In this paper, we propose a new utility-aware resource allocation protocol to make external scheduling decision in Grid. Users and service providers specify one or more weight values, and then, an auctioneer uses these values for calculating both userspsila and service providerspsila utility values which reflect preference upon the matched members in the different group. Then, we map the scheduling problem with these utility values into the problem in a weighted bipartite graph, and propose a new matching algorithm based on the existing SMP (Stable Marriage Problem) matching algorithm. Finally, the performance of this auctionpsilas awarding technique is evaluated.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124721840","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}
In Group Communication Systems (GCS), causal message ordering is an essential tool to ensure interaction among group members in a consistent way. In several group-based applications, the exchanged information is often diffused to all members. Using a multicast protocol to ensure this broadcast should make the definition of data structures not optimal for this kind of applications. In this paper, we propose a simple and optimal causal broadcast protocol which copes with the dynamically changing groups in mobile environments. The protocol depends on two simple, yet powerful ideas. The first depends on the use of the immediate dependency relationship in the construction of control information, resulting in O(1) message overhead. When the second original idea depends on considering the join and leave requests as data messages. This ensures a consistent perception of the communication done in the group and makes no need to a coordination phase in the installation of a new view.
{"title":"An Optimal Causal Broadcast Protocol in Mobile Dynamic Groups","authors":"Chafika Benzaid, N. Badache","doi":"10.1109/ISPA.2008.36","DOIUrl":"https://doi.org/10.1109/ISPA.2008.36","url":null,"abstract":"In Group Communication Systems (GCS), causal message ordering is an essential tool to ensure interaction among group members in a consistent way. In several group-based applications, the exchanged information is often diffused to all members. Using a multicast protocol to ensure this broadcast should make the definition of data structures not optimal for this kind of applications. In this paper, we propose a simple and optimal causal broadcast protocol which copes with the dynamically changing groups in mobile environments. The protocol depends on two simple, yet powerful ideas. The first depends on the use of the immediate dependency relationship in the construction of control information, resulting in O(1) message overhead. When the second original idea depends on considering the join and leave requests as data messages. This ensures a consistent perception of the communication done in the group and makes no need to a coordination phase in the installation of a new view.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123333114","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：