{"title":"Mega analysis: Distance learning education impact on self-discipline","authors":"Chin-Hung Lin, S. Yang","doi":"10.1109/JCPC.2009.5420074","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420074","url":null,"abstract":"The influence of technology on teaching and learning is becoming more and more evident in educational institutions. Distance learning refers to the teaching and learning situation in which the instructor and learner are engaging in interactive instructional settings when they are separated geographically and by time and place[5][6][10]. Distance learning takes advantage of currently available technologies to achieve two main objectives: (a) providing equitable access to quality education and (b) meeting the unique learning needs and styles of individuals [1]. Both the instructor and student rely on electronic devices and print material to deliver and receive instruction. This paper presents the relationship between distance learning and self-discipline and how it can be implied in practice.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"24 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":"131888572","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}
Yun Cheng, Lin Yang, Zhiwen Fang, Hailiang Hou, Ganxin Chen
{"title":"A fast motion estimation algorithm based on Diamond and Hexagon Search patterns","authors":"Yun Cheng, Lin Yang, Zhiwen Fang, Hailiang Hou, Ganxin Chen","doi":"10.1109/JCPC.2009.5420113","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420113","url":null,"abstract":"Based on the directional characteristic of SAD(Sum of Absolute Difference) distribution and the center-biased characteristic of motion vectors, a fast BMA(block-matching motion estimation algorithm), DHS(Diamond and Hexagon Search), is proposed in this paper. DHS employs HP to locate the best matching block with large motion vector, and diamond search pattern(DP) to refine the motion vector. Although the proposed DHS may also be trapped in local minima, the experimental results show that it is faster than UMHexagonS(Unsymmetrical-cross multi-hexagon-grid Search), while its encoding efficiency is better than DS and it is almost the same as that of UMHexagonS.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"41 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":"130478970","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}
Chenyang Zhao, Yi Yang, Shoubo Li, Jiazao Lin, Li Liu, Lian Li
{"title":"A novel Publish/Subscribe System based on Agent Center in e-Science environment","authors":"Chenyang Zhao, Yi Yang, Shoubo Li, Jiazao Lin, Li Liu, Lian Li","doi":"10.1109/jcpc.2009.5420133","DOIUrl":"https://doi.org/10.1109/jcpc.2009.5420133","url":null,"abstract":"","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"37 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":"116446258","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":"Advanced approaches to speaker diarization of audio documents","authors":"K. Markov","doi":"10.1109/JCPC.2009.5420194","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420194","url":null,"abstract":"Speaker diarization is the process of annotating an audio document with information about the speaker identity of speech segments along with their start and end time. Assuming that audio input consists of speech only or that non-speech segments have been already identified by another method, the task of speaker diarization is to find “who spoke when”. Since there is no prior information about the number of speakers, the main approach is to apply segment clustering. According to the clustering algorithm used, speaker diarization systems can be divided into two groups: 1) based on agglomerative clustering, and 2) based on on-line clustering. Agglomerative clustering is an off-line approach and is used in most of the current systems because it gives accurate results and can be fine tuned by performing several processing passes over the data. This, however, comes at the cost of high computational load which increases exponentially with the number of segments and the requirement of having the whole audio document available in advance. In contrast, on-line clustering based systems have almost constant computational load, work on-line in real time with small latency, but are generally less accurate than off-line systems. As we show in this paper, when using advanced on-line learning methods and original design, on-line systems can make less errors than off-line systems and can even work faster than real time with very low latency.","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":"130800868","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":"Overview of research on finding semantic meanings from low-level features in content-based image retrieval","authors":"Sagarmay Deb","doi":"10.1109/JCPC.2009.5420190","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420190","url":null,"abstract":"Content-based image retrieval is a bottleneck of research in multimedia systems. The research has proved extremely difficult because of the inherent problems in proper automated analysis and feature extraction of the image to facilitate proper classification of various objects. An image may contain more than one objects and to segment the image in line with object features to extract meaningful objects and then classify it in high-level like table, chair, car and so on has become a challenge to the researchers in the field. Until we win over these challenges, the efficient processing and retrieval of information from images will be difficult to achieve. In this paper we take stock of the current situation and suggest some future directions in the resolution of the problem of extracting high-level definitions from low-level features like color, texture, shape and spatial relations.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"23 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":"131074040","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 new type diameter-transmission mechanism based on distributed authorization signaling","authors":"Ma Wenjing, Song Junde, Wu Jianqing, Song Mei","doi":"10.1109/JCPC.2009.5420104","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420104","url":null,"abstract":"In this paper, we propose an optimal authorization mechanism to solve complex access control problem of wireless network. To avoid the trouble of traditional centralized management and authorization mechanisms, we take distributed structure into consideration. According to this optimal diameter mechanism we give an effective solution to transmit diameter avp loading with saml assertion and accomplish integrated diameter mechanism with saml control. Final test proves its feasibility.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"103 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":"134409680","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":"Discovery of services in context using rough sets","authors":"Lian Yu, Shan Luo","doi":"10.1109/JCPC.2009.5420171","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420171","url":null,"abstract":"In pervasive computing environment, service discovery plays an important role for automatically locating and executing the most suitable services according to related contextual information to fulfill user requirements. Current service discovery mechanisms rarely take context into consideration, leading to poor user experiences. In this paper, we propose an approach to service discovery that makes a good use of contextual information from both user query and service advertisement to offer better quality of service. Based on selected services that functionally satisfy a user query, the rough set theory is applied to further deal with contextual properties for decision on invoking the best service. An ontology-based model of context is constructed to enable knowledge sharing, and semantic matchmaking, and an evaluation model is set up for service ranking during the discovery process.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"102 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":"132162927","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 distributed cross-entropy ANT algorithm for network-aware grid scheduling","authors":"Hu Yi, Gong Bin","doi":"10.1109/JCPC.2009.5420182","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420182","url":null,"abstract":"Grid scheduling is one of optimally assigning jobs to resources to achieve maximizing the utilization of resources. We propose a distributed ant colony algorithm based on cross-entropy for multi-constraints scheduling. This is an extremely robust rare event simulation technique which may be employed to solve difficult combinatorial optimization problems. We tailor the CE-ANT method for the requirements of network-aware grid scheduling problem. It shows how the task response time can be improved by distinguishing between data-intensive and compute-intensive jobs and scheduling these jobs based on both computational resources and network load. The simulation result demonstrates that the proposed approach succeeds in minimizing the total processing time by at least 10% as compared to its counterpart (Min-Min), and quickly finding the optimal solutions with respect to overhead and speed of convergence compared with ACO. It is highly scalable both in terms of grid site and the number of tasks, indeed it provides superior performance over existing algorithms as the number increase.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"30 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":"132416739","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 multi-tenant oriented performance monitoring, detecting and scheduling architecture based on SLA","authors":"Xuying Cheng, Yuliang Shi, Qingzhong Li","doi":"10.1109/JCPC.2009.5420114","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420114","url":null,"abstract":"Software as a Service (SaaS) is thriving as a new mode of service delivery and operation with the development of network technology and the maturity of application software. SaaS application providers offer services for multiple tenants through the “single-instance multi-tenancy” model, which can effectively reduce service costs due to scale effect. Meanwhile, the providers allocate resources according to the SLA signed with tenants to meet the different needs of service quality. However, the service quality of some tenants will be affected by some abnormal consumption of system resources since both hardware and software resources are shared by tenants. In order to deal with this issue, we proposed a multi-tenant oriented monitoring, detecting and scheduling architecture based on SLA for performance isolation. It would monitor service quality of per tenant, discover abnormal status and dynamically adjust the use of resources based on quantization of SLA parameters to ensure the full realization of SLA tasks.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"26 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":"133441054","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":"What digital divide factors matter in the motivation to use technology to learn English? A case of low SES young learners in Taiwan","authors":"Hsueh‐Hua Chuang, Yu-Feng Yang, Han-Chin Liu","doi":"10.1109/JCPC.2009.5420090","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420090","url":null,"abstract":"This quantitative study investigated the impact of digital divide factors on perceived motivation to utilize technology to learn English. Four latent digital divide related constructs were determined by factor analysis. They are a) perceived computer and Internet skills, b) school-related Internet use, c) computer and Internet resources outside the home, and d) gaming/leisure use of the Internet. In addition, stepwise regression revealed that the dependent measure (perceived motivation to utilize technology to learn English) could be predicted by two digital divide factors: school-related Internet use and computer and Internet resources outside the home. A negative significant correlation coefficient was found between the length of time spent online per week and perceived motivation to utilize technology to learn English. Results of this study have implications for researchers and practitioners in bridging the digital divide, and the article discussed what may be critical in the development of EFL E-learning for low-SES young learners.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"40 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":"132780155","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}