{"title":"A pricing scheme to maximize social welfare in communication networks","authors":"J. Estévez, H. Xiong, Q. Gao, E. Guerrero","doi":"10.1117/12.855553","DOIUrl":"https://doi.org/10.1117/12.855553","url":null,"abstract":"In this paper, we analyze switching from the current flat-rate Internet pricing to adopt usage-based pricing schemes. Even if flat rate pricing is one of the main reasons for the success of the Internet, the only way to prevent network congestion, differentiate services and maximizes social welfare is to adopt usage-based pricing schemes. Our scheme is highly related to an optimal congestion and cost-sharing pricing scheme for multiclass services applied to communication networks developed by Yezekael Hayel, Bruno Tuffin and design a pricing scheme that maximizes the social welfare which is the total gross value minus the total expected delay cost.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116000431","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}
{"title":"The study and application of IMS Learning Design specifications in a mobile context","authors":"John Loewen, Kinshuk","doi":"10.1109/JCPC.2009.5420215","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420215","url":null,"abstract":"Current learning systems are frequently criticized for their predominant focus on explicit, and in particular, written representation of knowledge. There are communities around the world where verbal knowledge is more pervasive than written knowledge. This paper presents a study of how such knowledge can be accessed anywhere/anytime, in a form that may be used and understood in a standardized format, so as to make the knowledge easily transferable within those communities and across the community boundaries. While doing so, this research also looks at a more general problem of lack of standardization in existing learning systems. The majority of the existing learning systems do not store content and interactive activities in any standard format, and because of this, there is little or no portability of these materials between implementations. With the increase in mobile technology usage as a medium of access, there is a growing concern that the lack of standardization will become even more of an issue as it adds another layer of non-standardization to the mix. This paper describes a prototype system for mobile learning that conforms to the IMS Learning Design specification, drawing from local knowledge concepts to ensure that the content is relevant for specific contextual cultural learning needs.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115502560","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}
{"title":"Modeling and analysis of the performance and security for anonymous communication","authors":"Ming Yang, Junzhou Luo, Wenjia Wu","doi":"10.1109/JCPC.2009.5420156","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420156","url":null,"abstract":"Anonymous Routing Algorithm determines the performance and security of an anonymous communication system directly, which are two conflicting considerable factors for the practicality of the whole system. Most of existing anonymous routing algorithms care little about the tradeoff between performance and anonymity. Some algorithms aim to achieve better performance, while others aim to acquire higher security. To analyze the performance and anonymity provided by a certain anonymous system, a unified performance model employing throughput metric is established and a security measuring method is also proposed from attackers' view. Based on the experiment results on two typical anonymous routing algorithms, the relationship between the two properties are analyzed, which will guide the design of new anonymous routing algorithms.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117217705","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}
{"title":"A migrating DNA computing technique for grid clustering","authors":"Xiyu Liu, Hao Tang","doi":"10.1109/JCPC.2009.5420181","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420181","url":null,"abstract":"Spatial clustering is an important cluster problem with basic computing model by traditional von Neumann's architecture. Meanwhile, the possibility of using DNA as a computing technique arouses wide interests in recent years with huge built-in parallel computing nature and ability to solve NP complete problems. The purpose of this paper is to integrate these two techniques. We propose a migrating DNA computing model with built-in DNA computing engine to cluster analysis. This new technique will apply for large scale, high parallel clustering problems potentially.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121366346","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}
{"title":"On the design of contribution-aware P2P streaming networks","authors":"Yu-Wei Chan, Yeh-Ching Chung","doi":"10.1109/JCPC.2009.5420076","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420076","url":null,"abstract":"P2P live streaming networks recently become an emerging research topic. In such multimedia steaming networks, autonomous users cooperate with each other to provide a distributed, scalable, and cost-efficient transmission environment. However, since each user is self-interested such that they want to receive high-quality video with minimum upload bandwidth, full cooperation and stable playback quality can not be guaranteed. This paper proposes the design of a two-phase, contribution-aware mechanism for P2P live streaming networks. We first propose our two-layered system architecture and the problem statements. Then, we propose a contribution-aware mechanism for identifying the stable peers. We also propose the method concept of stimulating peer cooperation in such a hybrid push-pull P2P streaming platform.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123268948","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}
Ying Yang, Xiangdong Wang, Yueliang Qian, Shouxun Lin
{"title":"Accurate and real-time lip contour extraction based on constrained contour growing","authors":"Ying Yang, Xiangdong Wang, Yueliang Qian, Shouxun Lin","doi":"10.1109/JCPC.2009.5420116","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420116","url":null,"abstract":"In this paper, a novel method for accurate and real-time lip contour extraction in gray-level images is presented. The main idea is to grow the contour from some key points based on constraints of parabola fitting and gradient maximum which are combined using D-S theory. This approach can accurately extract continuous lip contour by simultaneously taking color and shape information into consideration, and achieve real-time performance using less computation without iteration and modeling, which can provide high efficiency to meet the need of real-time application. Furthermore, this method is applied in a real-time lipreading system using visual features constructed from lip contour information extracted by the proposed method. Experimental results show that both the lip contour extraction and lipreading system achieved good performance, which demonstrates the effectiveness and efficiency of the proposed method.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125496946","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}
{"title":"Agent-based task scheduling in shared context pervasive environment","authors":"Zhang Xiaohe","doi":"10.1109/JCPC.2009.5420170","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420170","url":null,"abstract":"Efficient task scheduling in shared context pervasive environment to collaborate to achieve application requirements, especially real time efficiency, becomes a major issue in recent pervasive applications. In a number of scenarios based on shared context, tasks do have dependency with each other, that we can explore their relationship to implement parallel execution maximization. In this paper, we propose an agent-based solution, called Common Parallelism Approach based on Agents (CPAA) to maximize the task execution in parallel. We further explore the task flow in pervasive applications based on data dependent relationships between tasks. We present CPAA to parallelize three kinds of task flow models based on shared context -- sequence, branch and loop, by agents.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122659747","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}
{"title":"Towards context-aware task recommendation","authors":"C. Vo, T. Torabi, S. Loke","doi":"10.1109/JCPC.2009.5420173","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420173","url":null,"abstract":"Pervasive computing environments can provide a diverse range of computing capabilities. But they are overwhelming for us as we attempt to accomplish our daily tasks. We need to know what resources are at hand and what tasks a PCE supports. Our ongoing research aims to minimise this overload by proposing a context-aware task recommender system named TASKREC which can recommend or automatically accomplish feasible and relevant tasks for users according to user's situation and environment capabilities. This paper formalises the problem of task recommendation, presents a system architecture for TASKREC, and an early prototype implementation. Finally, we suggest open opportunities for future research on adaptation techniques for context-aware systems.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116828777","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}
{"title":"MBMF: A framework for macroprogramming data-centric sensor network applications using the Bird-Meertens Formalism","authors":"S. Loke, S. Nadarajah","doi":"10.1109/JCPC.2009.5420159","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420159","url":null,"abstract":"Often, the dependency of sensor network applications on sensor node hardware architecture and sensor network topology restricts their portability. That is, when the application is ported to a different architecture, the program would often need to be changed in order to adapt to the new architecture. By providing a higher level of abstraction using the Bird-Meertens Formalism, the portability of programs across different hardware architecture and network topology can be achieved. This paper proposes a new methodology for sensor network application development using the parallel programming model called MapReduce based on the BMF.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"47 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116854344","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}
{"title":"Head pose estimation based on nonlinear interpolative mapping","authors":"Hwei-Jen Lin, Chen-Wei Chang, I-Chun Pai","doi":"10.1109/JCPC.2009.5420207","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420207","url":null,"abstract":"The performance of face recognition systems depends on conditions being consistent, including lighting, pose and facial expression. To solve the problem produced by pose variation it is suggested to pre-estimate the pose orientation of the given head image before it is recognized. In this paper, we propose a head pose estimation method that is an improvement on the one proposed by N. Hu et al. [1]. The proposed method trains in a supervised manner a nonlinear interpolative mapping function that maps input images to predicted pose angles. This mapping function is a linear combination of some Radial Basis Functions (RBF). The experimental results show that our proposed method has a better performance than the method proposed by Nan Hu et al. in terms of both time efficiency and estimation accuracy.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128802363","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}