An online upper division undergraduate MIS course has been designed and delivered over consecutive five semesters to a sample of over 200 students. The same course was also delivered in a Web-enhanced version (paperless course with regular classroom lectures). This paper reports on a study, which attempts to answer numerous questions regarding impact of an e-learning format on quality of educational experience. Specifically, in this part of the study we try to find out whether online testing with an open book format is compromising integrity of assessment in e-learning by encouraging cheating among students, and what is the difference in online testing and assessment between students in Web based (fully online) class versus Web enhanced class
{"title":"Integrity of online testing in e-learning: empirical study","authors":"Tom R. Wielicki","doi":"10.1109/PERCOMW.2006.69","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.69","url":null,"abstract":"An online upper division undergraduate MIS course has been designed and delivered over consecutive five semesters to a sample of over 200 students. The same course was also delivered in a Web-enhanced version (paperless course with regular classroom lectures). This paper reports on a study, which attempts to answer numerous questions regarding impact of an e-learning format on quality of educational experience. Specifically, in this part of the study we try to find out whether online testing with an open book format is compromising integrity of assessment in e-learning by encouraging cheating among students, and what is the difference in online testing and assessment between students in Web based (fully online) class versus Web enhanced class","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131537978","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}
Pub Date : 2006-03-13DOI: 10.1109/PERCOMW.2006.151
Kyungmin Lee, Dongman Lee, Insuk Park, Seunghyun Han
This paper presents XVMF, an extensible and versatile matchmaking framework, which supports various service substitution mechanisms in dynamic application adaptation for ubiquitous computing environments. XVMF enables various substitution mechanisms to be easily developed by providing common abstracts for implementing a service substitution mechanism. It also allows an application or a user to select the most appropriate substitution mechanism with respect to its requirements by providing various substitution policies. The current Java implementation of XVMF supports three existing substitution mechanisms
{"title":"XVMF: an extensible and versatile matchmaking framework for supporting dynamic application adaptation in ubiquitous computing environments","authors":"Kyungmin Lee, Dongman Lee, Insuk Park, Seunghyun Han","doi":"10.1109/PERCOMW.2006.151","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.151","url":null,"abstract":"This paper presents XVMF, an extensible and versatile matchmaking framework, which supports various service substitution mechanisms in dynamic application adaptation for ubiquitous computing environments. XVMF enables various substitution mechanisms to be easily developed by providing common abstracts for implementing a service substitution mechanism. It also allows an application or a user to select the most appropriate substitution mechanism with respect to its requirements by providing various substitution policies. The current Java implementation of XVMF supports three existing substitution mechanisms","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130745273","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 paper proposes HELP, a simple and distributed broadcast algorithm for warning delivery services in inter-vehicular ad hoc networks. Assuming that neighborhood location information is available from the routing layer, each node determines whether to re-broadcast the message based on i) the coverage zone of the received message and ii) the estimated position of its neighbors. Investigations are led using a popular microscopic traffic model, in order to ensure realism of the networking performance evaluation. Results show that the algorithm efficiently limits the number of broadcasted messages, which is very close to the optimal. Furthermore, robustness of the results in terms of the number of informed vehicles can also be achieved, provided that a safety error margin is considered in the position estimate
{"title":"Knowing vehicles location HELPS avoiding broadcast packets storm","authors":"R. Fracchia","doi":"10.1109/PERCOMW.2006.71","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.71","url":null,"abstract":"This paper proposes HELP, a simple and distributed broadcast algorithm for warning delivery services in inter-vehicular ad hoc networks. Assuming that neighborhood location information is available from the routing layer, each node determines whether to re-broadcast the message based on i) the coverage zone of the received message and ii) the estimated position of its neighbors. Investigations are led using a popular microscopic traffic model, in order to ensure realism of the networking performance evaluation. Results show that the algorithm efficiently limits the number of broadcasted messages, which is very close to the optimal. Furthermore, robustness of the results in terms of the number of informed vehicles can also be achieved, provided that a safety error margin is considered in the position estimate","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116635958","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}
Pub Date : 2006-03-13DOI: 10.1109/PERCOMW.2006.123
M. Karpinski, A. Senart, V. Cahill
This paper proposes the use of a wireless sensor network of "cat's eye" augmented with embedded processing, communication, and sensing capabilities to monitor vehicle behaviour on augmented roads. The primary goal of the system is to provide drivers with early warning of potentially dangerous situations that may arise. The focus of the paper is on the software architecture needed and the technical challenges to be overcome in order to support this and related applications
{"title":"Sensor networks for smart roads","authors":"M. Karpinski, A. Senart, V. Cahill","doi":"10.1109/PERCOMW.2006.123","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.123","url":null,"abstract":"This paper proposes the use of a wireless sensor network of \"cat's eye\" augmented with embedded processing, communication, and sensing capabilities to monitor vehicle behaviour on augmented roads. The primary goal of the system is to provide drivers with early warning of potentially dangerous situations that may arise. The focus of the paper is on the software architecture needed and the technical challenges to be overcome in order to support this and related applications","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124943066","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}
As mobile ad hoc networks (MANETs) become ever more popular, it also becomes more and more interesting to build distributed network applications (e.g. data storage, etc.) that have been successfully built using DHTs on the Internet in such MANETs. For this purpose, DHT substrates especially designed for the use in MANETs have been recently proposed. In this paper, we demonstrate that such a DHT substrate (MADPastry) can be efficiently used to not only provide indirect, key-based overlay routing, but also conventional direct unicasting. Our simulation results show that DHT-based unicasting can markedly outperform conventional reactive ad hoc routing (AODV) as well as proactive ad hoc routing (OLSR). Therefore, MANET nodes that are already running a DHT substrate for application purposes will no longer have to maintain a separate ad hoc routing protocol in parallel but can use their DHT substrate for conventional point-to-point ad hoc routing as well
{"title":"DHT-based unicast for mobile ad hoc networks","authors":"Thomas Zahn, J. Schiller","doi":"10.1109/PERCOMW.2006.42","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.42","url":null,"abstract":"As mobile ad hoc networks (MANETs) become ever more popular, it also becomes more and more interesting to build distributed network applications (e.g. data storage, etc.) that have been successfully built using DHTs on the Internet in such MANETs. For this purpose, DHT substrates especially designed for the use in MANETs have been recently proposed. In this paper, we demonstrate that such a DHT substrate (MADPastry) can be efficiently used to not only provide indirect, key-based overlay routing, but also conventional direct unicasting. Our simulation results show that DHT-based unicasting can markedly outperform conventional reactive ad hoc routing (AODV) as well as proactive ad hoc routing (OLSR). Therefore, MANET nodes that are already running a DHT substrate for application purposes will no longer have to maintain a separate ad hoc routing protocol in parallel but can use their DHT substrate for conventional point-to-point ad hoc routing as well","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130070252","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 integration of context-aware applications with spatial context models is often done using a common query language. However, algorithms that estimate and reason about spatial context information can benefit from a tighter integration. An object-oriented API makes such integration possible and can help reduce the complexity of algorithms making them easier to maintain and develop. This paper propose an object-oriented API for context models of the physical environment and extensions to a location modeling approach called geometric space trees for it to provide adequate support for location modeling. The utility of the API is evaluated in several real-world cases from an indoor location system, and spans several types of spatial reasoning algorithms
{"title":"An API for integrating spatial context models with spatial reasoning algorithms","authors":"M. Kjærgaard","doi":"10.1109/PERCOMW.2006.19","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.19","url":null,"abstract":"The integration of context-aware applications with spatial context models is often done using a common query language. However, algorithms that estimate and reason about spatial context information can benefit from a tighter integration. An object-oriented API makes such integration possible and can help reduce the complexity of algorithms making them easier to maintain and develop. This paper propose an object-oriented API for context models of the physical environment and extensions to a location modeling approach called geometric space trees for it to provide adequate support for location modeling. The utility of the API is evaluated in several real-world cases from an indoor location system, and spans several types of spatial reasoning algorithms","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128703621","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}
Pub Date : 2006-03-13DOI: 10.1109/PERCOMW.2006.109
A. MacQuire, A. Brampton, Idris A. Rai, L. Mathy
The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes connecting to peer-to-peer networks. However, the characteristics of mobile nodes and limitations of access point coverage often cause mobile nodes to lose connectivity, which can cause many mobile nodes to simultaneously leave the network. Continuous departures and joins due to the mobility of nodes leads to mobility churn, which can often degrade the performance of the underlying peer-to-peer network significantly. In this paper, we use simulations to demonstrate that the stealth distributed hash table (stealth DHT) algorithm is ideally suited for networks with mobile nodes. By avoiding storing state in unreliable nodes, a stealth DHT prevents mobile nodes from being used by other nodes to provide services. Consequently, stealth DHTs eliminates the mobility churn effect and significantly reduce the amount of overhead as compared to a generic DHT
{"title":"Performance analysis of stealth DHT with mobile nodes","authors":"A. MacQuire, A. Brampton, Idris A. Rai, L. Mathy","doi":"10.1109/PERCOMW.2006.109","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.109","url":null,"abstract":"The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes connecting to peer-to-peer networks. However, the characteristics of mobile nodes and limitations of access point coverage often cause mobile nodes to lose connectivity, which can cause many mobile nodes to simultaneously leave the network. Continuous departures and joins due to the mobility of nodes leads to mobility churn, which can often degrade the performance of the underlying peer-to-peer network significantly. In this paper, we use simulations to demonstrate that the stealth distributed hash table (stealth DHT) algorithm is ideally suited for networks with mobile nodes. By avoiding storing state in unreliable nodes, a stealth DHT prevents mobile nodes from being used by other nodes to provide services. Consequently, stealth DHTs eliminates the mobility churn effect and significantly reduce the amount of overhead as compared to a generic DHT","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117104894","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}
We propose a model driven design and development methodology augmented with formal validation and verification (V&V) for the development of mobile health systems. Systems which deliver healthcare services remotely should be developed using robust and trusted engineering technologies. The methodology instantiates steps in the MDA trajectory using formal methods to verify critical properties of models, to test preservation of those properties in the derived implementations and to effect model transformations by correctness preserving transformations. The methodology is described and some initial modelling is reported
{"title":"Model driven development of m-health systems (with a touch of formality)","authors":"V. Jones","doi":"10.1109/PERCOMW.2006.94","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.94","url":null,"abstract":"We propose a model driven design and development methodology augmented with formal validation and verification (V&V) for the development of mobile health systems. Systems which deliver healthcare services remotely should be developed using robust and trusted engineering technologies. The methodology instantiates steps in the MDA trajectory using formal methods to verify critical properties of models, to test preservation of those properties in the derived implementations and to effect model transformations by correctness preserving transformations. The methodology is described and some initial modelling is reported","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121359778","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}
D. Barbosa, Iara Augustin, J. Barbosa, A. Yamin, L. Silva, C. Geyer
The idea of pervasive learning is to create a network of devices, people and situation that allow learning experiences to play out. This idea is attractive, but is not easily implemented. This paper presents a pervasive learning architecture called GlobalEdu which is composed by educational services (ES) and pervasive personal pedagogical agent (P3A) implemented above the ISAM platform. It is a software architecture that manages a large scale pervasive environment. ES expands the ISAM services to educational domain to provide knowledge management, context management, control and communication. P3A is shall always be with the learner, assisting the process of learning, independent of user's device at the moment
{"title":"Learning in a large-scale pervasive environment","authors":"D. Barbosa, Iara Augustin, J. Barbosa, A. Yamin, L. Silva, C. Geyer","doi":"10.1109/PERCOMW.2006.74","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.74","url":null,"abstract":"The idea of pervasive learning is to create a network of devices, people and situation that allow learning experiences to play out. This idea is attractive, but is not easily implemented. This paper presents a pervasive learning architecture called GlobalEdu which is composed by educational services (ES) and pervasive personal pedagogical agent (P3A) implemented above the ISAM platform. It is a software architecture that manages a large scale pervasive environment. ES expands the ISAM services to educational domain to provide knowledge management, context management, control and communication. P3A is shall always be with the learner, assisting the process of learning, independent of user's device at the moment","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122599257","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}
Pub Date : 2006-03-13DOI: 10.1109/PERCOMW.2006.131
F. Lin, Yu Wang, Hongyi Wu
In this paper we present a testbed implementation of delay/fault-tolerant mobile sensor network (DFT-MSN) for pervasive information gathering. We develop a simple and efficient data delivery scheme tailored for DFT-MSN, which consists of two key components for data transmission and queue management, respectively. The former makes decision on when and where to transmit data messages based on the delivery probability, which reflects the likelihood that a sensor can deliver data messages to the sink. The latter decides which messages to transmit or drop based on the fault tolerance, which indicates the importance of the messages. We implement the proposed data delivery scheme and establish a DFT-MSN testbed by using Crossbow sensors. A small scale experiment is carried out, which shows the effectiveness and efficiency of DFT-MSN
{"title":"Testbed implementation of delay/fault-tolerant mobile sensor network (DFT-MSN)","authors":"F. Lin, Yu Wang, Hongyi Wu","doi":"10.1109/PERCOMW.2006.131","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.131","url":null,"abstract":"In this paper we present a testbed implementation of delay/fault-tolerant mobile sensor network (DFT-MSN) for pervasive information gathering. We develop a simple and efficient data delivery scheme tailored for DFT-MSN, which consists of two key components for data transmission and queue management, respectively. The former makes decision on when and where to transmit data messages based on the delivery probability, which reflects the likelihood that a sensor can deliver data messages to the sink. The latter decides which messages to transmit or drop based on the fault tolerance, which indicates the importance of the messages. We implement the proposed data delivery scheme and establish a DFT-MSN testbed by using Crossbow sensors. A small scale experiment is carried out, which shows the effectiveness and efficiency of DFT-MSN","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125786025","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
扫码关注我们
求助内容：
应助结果提醒方式：