In this paper, we propose an incremental algorithm for web ranking in the Peer-to-Peer (P2P) environments. Not the same as the non-incremental algorithm, the proposed algorithm can partition the web link graphs, the graphs represented the connectivity structure among the web pages, into the changed sub graphs, and the unchanged sub graphs. Subsequently, the algorithm processes only the necessary data in order to compute the ranking. The experiments have been conducted to evaluate the efficiency of the algorithm, comparing with the non-incremental algorithm in various P2P environments. We report the efficiency in terms of both computational and communication costs. It has been found that in terms of communication cost, the proposed algorithm can out perform the traditional one in all configurations. For the computational cost, the proposed algorithm can out perform the traditional one in all P2P network sizes but it has slightly higher computational cost when the web link graph size is large.
{"title":"A P2P-Based Incremental Web Ranking Algorithm","authors":"S. Sangamuang, P. Boonma, J. Natwichai","doi":"10.1109/3PGCIC.2011.28","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.28","url":null,"abstract":"In this paper, we propose an incremental algorithm for web ranking in the Peer-to-Peer (P2P) environments. Not the same as the non-incremental algorithm, the proposed algorithm can partition the web link graphs, the graphs represented the connectivity structure among the web pages, into the changed sub graphs, and the unchanged sub graphs. Subsequently, the algorithm processes only the necessary data in order to compute the ranking. The experiments have been conducted to evaluate the efficiency of the algorithm, comparing with the non-incremental algorithm in various P2P environments. We report the efficiency in terms of both computational and communication costs. It has been found that in terms of communication cost, the proposed algorithm can out perform the traditional one in all configurations. For the computational cost, the proposed algorithm can out perform the traditional one in all P2P network sizes but it has slightly higher computational cost when the web link graph size is large.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115507949","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 wireless ad-hoc networks where there is no continuous end-to-end path we move into the area of opportunistic networks. Forwarding messages via any encountered nodes, such as the mobile devices that many users already carry. Normally we are looking for the most efficient method of passing these messages across the network, but how do we evaluate the different methods. We propose to develop a framework that will allow us to evaluate how efficiently provisioning has been performed. This has been explored with the use of a case study and two benchmark protocols, Epidemic and PRoPHET. We present the results of this analysis and describe an approach to the validation of this through simulation.
{"title":"Towards a Framework for the Evaluation of Efficient Provisioning in Opportunistic Ad Hoc Networks","authors":"Anthony Smith, Richard Hill","doi":"10.1109/3PGCIC.2011.15","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.15","url":null,"abstract":"In wireless ad-hoc networks where there is no continuous end-to-end path we move into the area of opportunistic networks. Forwarding messages via any encountered nodes, such as the mobile devices that many users already carry. Normally we are looking for the most efficient method of passing these messages across the network, but how do we evaluate the different methods. We propose to develop a framework that will allow us to evaluate how efficiently provisioning has been performed. This has been explored with the use of a case study and two benchmark protocols, Epidemic and PRoPHET. We present the results of this analysis and describe an approach to the validation of this through simulation.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121998613","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}
Cloud Systems provide computing resources in a flexible manner. There are several key requirements that need to be addressed regarding the resource allocation in Clouds and the most important of them is providing on demand elasticity. This paper focuses on adding new features to the Cloud resource allocation mechanism that enhance on demand elasticity. Most of the resource managers that are now on the market use static allocation. We propose a novel solution that uses dynamic allocation, based on well defined policies. Moreover, the proposed solution offers authentication and accountability for the actions of the users which is very important for the commercial aspect of public clouds.
{"title":"Policy Based Resource Allocation in Cloud Systems","authors":"E. Apostol, C. Leordeanu, V. Cristea","doi":"10.1109/3PGCIC.2011.51","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.51","url":null,"abstract":"Cloud Systems provide computing resources in a flexible manner. There are several key requirements that need to be addressed regarding the resource allocation in Clouds and the most important of them is providing on demand elasticity. This paper focuses on adding new features to the Cloud resource allocation mechanism that enhance on demand elasticity. Most of the resource managers that are now on the market use static allocation. We propose a novel solution that uses dynamic allocation, based on well defined policies. Moreover, the proposed solution offers authentication and accountability for the actions of the users which is very important for the commercial aspect of public clouds.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117026955","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}
This work deals with the modeling and simulation of shock absorbing shells for ballistic vests and helmets to achieve optimal protection. Shock absorbing shell is modeled as a circular membrane with clamped edge. Symmetrical loading patterns were considered as follows: uniformly distributed pressure over the entire surface of the shell, uniformly distributed pressure over a part of the shell's surface, for bullets with button and truncated cone nose, as well as centric concentrated force, for bullets with conical and tangential ogive nose. Depth and volume of the back face signature, as well as the shell stiffness were evaluated. Then, the influence of force eccentricity was considered. Ballistic vests and helmets offer the lowest degree of protection for loading by concentrated centric forces, since they produce the largest back face signatures. Increased protection is achieved if the bullet contacts the shell unit at a certain eccentricity, and if the bullet's impact force is spread over a larger area. Based on such models one explains the experimentally observed armor strengthening by silica colloidal pads placed on the outer or inner face of the shell unit.
{"title":"Modeling and Simulation of a Shock Absorbing Shell for Ballistic Vests and Helmets to Achieve Optimal Protection","authors":"C. V. Suciu, Shuuhei Fukui, Yuuta Kimura","doi":"10.1109/3PGCIC.2011.73","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.73","url":null,"abstract":"This work deals with the modeling and simulation of shock absorbing shells for ballistic vests and helmets to achieve optimal protection. Shock absorbing shell is modeled as a circular membrane with clamped edge. Symmetrical loading patterns were considered as follows: uniformly distributed pressure over the entire surface of the shell, uniformly distributed pressure over a part of the shell's surface, for bullets with button and truncated cone nose, as well as centric concentrated force, for bullets with conical and tangential ogive nose. Depth and volume of the back face signature, as well as the shell stiffness were evaluated. Then, the influence of force eccentricity was considered. Ballistic vests and helmets offer the lowest degree of protection for loading by concentrated centric forces, since they produce the largest back face signatures. Increased protection is achieved if the bullet contacts the shell unit at a certain eccentricity, and if the bullet's impact force is spread over a larger area. Based on such models one explains the experimentally observed armor strengthening by silica colloidal pads placed on the outer or inner face of the shell unit.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124098601","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}
Y. Gotoh, T. Yoshihisa, H. Taniguchi, M. Kanazawa, J. Rahayu, Yi-Ping Phoebe Chen
Due to the recent popularization of digital broadcasting systems, selective contents broadcasting depending on viewers' preference, have attracted attention. For example, in a quiz program, a user selects his answer and watches the video content for the answer. When the server deliver programs reflecting users' preferences, clients have to wait until their selected contents start playing. Therefore, we have proposed a scheduling method to reduce the waiting time. However, we have not considered the case that clients play contents with fast-forwarding. In this paper, we propose a method to reduce the waiting time for selective contents broadcasting considering fast-forwarding. In our proposed method, by separating parts for double playing speed and normal playing speed and scheduling the effective schedule, we effectively reduce the waiting time.
{"title":"A Scheduling Method for Selective Contents Broadcasting with Fast-Forwarding","authors":"Y. Gotoh, T. Yoshihisa, H. Taniguchi, M. Kanazawa, J. Rahayu, Yi-Ping Phoebe Chen","doi":"10.1109/3PGCIC.2011.65","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.65","url":null,"abstract":"Due to the recent popularization of digital broadcasting systems, selective contents broadcasting depending on viewers' preference, have attracted attention. For example, in a quiz program, a user selects his answer and watches the video content for the answer. When the server deliver programs reflecting users' preferences, clients have to wait until their selected contents start playing. Therefore, we have proposed a scheduling method to reduce the waiting time. However, we have not considered the case that clients play contents with fast-forwarding. In this paper, we propose a method to reduce the waiting time for selective contents broadcasting considering fast-forwarding. In our proposed method, by separating parts for double playing speed and normal playing speed and scheduling the effective schedule, we effectively reduce the waiting time.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127669372","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 Internet is a huge repository of information. Web search engines are a basic tool for finding and accessing all this information. However, these tools might also be a threat for the privacy of their users. This happens because users frequently reveal private information in their queries. Web search engines gather this personal data, store it during a large period of time and use it to improve their search results and to increase their economical benefits. In order to avoid this situation, it is necessary to provide web search methods that preserve the privacy of the users. Current proposals in the literature increase significantly the query delay. This is the time that users have to wait in order to obtain the search results for their queries. In this paper, we propose a modification of the Useless User Profile (UUP) protocol. The resulting scheme has been tested in an open environment and the results show that it achieves the lowest query delay which has been reported in the literature. In addition to that, it incentivizes users to follow the protocol in order to protect their privacy.
{"title":"Improving Query Delay in Private Web Search","authors":"Cristina Romero-Tris, Alexandre Viejo, Jordi Castellà-Roca","doi":"10.1109/3PGCIC.2011.61","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.61","url":null,"abstract":"The Internet is a huge repository of information. Web search engines are a basic tool for finding and accessing all this information. However, these tools might also be a threat for the privacy of their users. This happens because users frequently reveal private information in their queries. Web search engines gather this personal data, store it during a large period of time and use it to improve their search results and to increase their economical benefits. In order to avoid this situation, it is necessary to provide web search methods that preserve the privacy of the users. Current proposals in the literature increase significantly the query delay. This is the time that users have to wait in order to obtain the search results for their queries. In this paper, we propose a modification of the Useless User Profile (UUP) protocol. The resulting scheme has been tested in an open environment and the results show that it achieves the lowest query delay which has been reported in the literature. In addition to that, it incentivizes users to follow the protocol in order to protect their privacy.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131451525","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 paper presents a comparative analysis between the Multicore and the Grid execution of SWAT hydrological model. We try to emphasize the advantages brought by the Grid infrastructure, especially for large scale applications which require large number of executions and huge data resources. We use as a case study a large scale hydrological model, built using the Arc SWAT program, which covers the Danube River Basin and we draw the conclusions derived from these experiments, pointing out the benefits brought by the Grid architecture.
{"title":"Comparative Analysis of Multicore and Grid Based Execution of SWAT Model","authors":"Diana-Denisa Rodila, V. Bâcu, D. Gorgan","doi":"10.1109/3PGCIC.2011.49","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.49","url":null,"abstract":"The paper presents a comparative analysis between the Multicore and the Grid execution of SWAT hydrological model. We try to emphasize the advantages brought by the Grid infrastructure, especially for large scale applications which require large number of executions and huge data resources. We use as a case study a large scale hydrological model, built using the Arc SWAT program, which covers the Danube River Basin and we draw the conclusions derived from these experiments, pointing out the benefits brought by the Grid architecture.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132702631","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}
Usual vehicle suspensions employ hydro-pneumatic absorbers (e.g., oil, colloidal and air dampers) mounted in parallel with compression helical springs. Although the damping coefficient of the vehicle suspension is changing versus the excitation frequency, conventional design method is based on simplified models that assume for constant damping and elastic properties. In this work, three types of suspensions were considered and modeled as follows: oil damper mounted in parallel with a compression helical spring, for which a Kelvin-Voigt model, consisted of a dashpot and an elastic element connected in parallel is considered, colloidal damper without attached compression helical spring, for which a Maxwell model, consisted of a dashpot and an elastic element connected in series is considered, and colloidal damper mounted in parallel with a compression helical spring, for which a standard linear model, consisted of a Maxwell unit connected in parallel with an elastic element is considered. Firstly, the vibration transmissibility from the rough road to the vehicle's body for all these suspensions was determined under the constraint that damping varies versus the excitation frequency. Then, the optimal damping and stiffness ratios were decided in order to minimize the transmissibility of vibration from the rough pavement to the vehicle's body. Such results are useful to improve the vehicle's ride-comfort.
{"title":"Modeling and Simulation of a Vehicle Suspension with Variable Damping and Elastic Properties versus the Excitation Frequency","authors":"C. V. Suciu, Tsubasa Tobiishi, Ryouta Mouri","doi":"10.1109/3PGCIC.2011.75","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.75","url":null,"abstract":"Usual vehicle suspensions employ hydro-pneumatic absorbers (e.g., oil, colloidal and air dampers) mounted in parallel with compression helical springs. Although the damping coefficient of the vehicle suspension is changing versus the excitation frequency, conventional design method is based on simplified models that assume for constant damping and elastic properties. In this work, three types of suspensions were considered and modeled as follows: oil damper mounted in parallel with a compression helical spring, for which a Kelvin-Voigt model, consisted of a dashpot and an elastic element connected in parallel is considered, colloidal damper without attached compression helical spring, for which a Maxwell model, consisted of a dashpot and an elastic element connected in series is considered, and colloidal damper mounted in parallel with a compression helical spring, for which a standard linear model, consisted of a Maxwell unit connected in parallel with an elastic element is considered. Firstly, the vibration transmissibility from the rough road to the vehicle's body for all these suspensions was determined under the constraint that damping varies versus the excitation frequency. Then, the optimal damping and stiffness ratios were decided in order to minimize the transmissibility of vibration from the rough pavement to the vehicle's body. Such results are useful to improve the vehicle's ride-comfort.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134502806","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 novel batch system for high throughput computing is presented. The system is specifically designed to leverage virtualization and web technology to facilitate deployment on cloud and other ephemeral resources. In particular, it implements a security model suited for forming collaborations on demand, across organizational boundaries. Other features include firewall-friendliness, integrated software provisioning and virtual machine management. We describe the design and architecture of Grid Factory and four applications that utilize it. Moreover, we compare the performance of Grid Factory in different deployment scenarios.
{"title":"GridFactory: Distributed Computing on Ephemeral Resources","authors":"F. Orellana, Marko Niinimäki","doi":"10.1109/3PGCIC.2011.14","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.14","url":null,"abstract":"A novel batch system for high throughput computing is presented. The system is specifically designed to leverage virtualization and web technology to facilitate deployment on cloud and other ephemeral resources. In particular, it implements a security model suited for forming collaborations on demand, across organizational boundaries. Other features include firewall-friendliness, integrated software provisioning and virtual machine management. We describe the design and architecture of Grid Factory and four applications that utilize it. Moreover, we compare the performance of Grid Factory in different deployment scenarios.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123664028","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 scale, complexity and worldwide geographical spread of the LHC computing and data analysis problems are unprecedented in scientific research. The complexity of processing and accessing this data is increased substantially by the size and global span of the major experiments, combined with the limited wide area network bandwidth available. We present the latest generation of the MONARC (Models of Networked Analysis at Regional Centers) simulation framework, as a design and modeling tool for large scale distributed systems applied to HEP experiments. We present simulation experiments designed to evaluate the capabilities of the current real-world distributed infrastructure to support existing physics analysis processes and the means by which the experiments bands together to meet the technical challenges posed by the storage, access and computing requirements of LHC data analysis within the CMS experiment.
{"title":"Simulation Analysis of CMS Data Replication and Production Activities","authors":"C. Dobre, V. Cristea","doi":"10.1109/3PGCIC.2011.70","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.70","url":null,"abstract":"The scale, complexity and worldwide geographical spread of the LHC computing and data analysis problems are unprecedented in scientific research. The complexity of processing and accessing this data is increased substantially by the size and global span of the major experiments, combined with the limited wide area network bandwidth available. We present the latest generation of the MONARC (Models of Networked Analysis at Regional Centers) simulation framework, as a design and modeling tool for large scale distributed systems applied to HEP experiments. We present simulation experiments designed to evaluate the capabilities of the current real-world distributed infrastructure to support existing physics analysis processes and the means by which the experiments bands together to meet the technical challenges posed by the storage, access and computing requirements of LHC data analysis within the CMS experiment.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"3 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132982511","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
扫码关注我们
求助内容：
应助结果提醒方式：