{"title":"A Message Forward Scheduling Based on a Secretary Problem for Mobile Relay Nodes","authors":"Takuya Tsuruike, K. Tsukamoto, M. Tsuru, Y. Oie","doi":"10.1109/iNCoS.2012.106","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.106","url":null,"abstract":"A store-carry-forward networking is considered in which each message arriving at a wireless access point (AP) from some source is forwarded to a car passing near the AP and is potentially delivered by the car to the destination of the message along the roads. Such network systems exploiting cars as mobile relay nodes are of practical importance because the cars have sufficient power and storage and the traffic volume and mobility pattern of the cars are predictable to some extent. However, while a message is forwarded to a mobile node that potentially relays it, the mobile node may or may not pass near the destination of the message, and the success of the delivery is uncertain. In addition, although forwarding multiple (N) copies of a message to N different mobile nodes may help the success delivery, this naive approach is not always effective when the number of messages that can be forwarded from the AP to a mobile node is limited due to a short contact time and/or a low wireless transmission capacity. In the present paper, therefore, we propose a message forward scheduling to improve the success delivery of messages within a finite lifetime, assuming that (i) the AP can estimate the relative magnitude (rank) of delivery success probability of each mobile node for a message, and (ii) the number of messages forwarded from the AP to a mobile node is restricted. The proposed scheme can select a mobile node with a higher delivery probability by applying the concept of Secretary Problem, an optimal sequential stopping rule without recall which minimizes the expected rank of the selected observation, i.e., a mobile node. The effectiveness of our proposed scheme is investigated through simple numerical simulations.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121477809","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":"Online Cooperative Behavior Planning Using a Tree Search Method in the RoboCup Soccer Simulation","authors":"Hidehisa Akiyama, S. Aramaki, T. Nakashima","doi":"10.1109/iNCoS.2012.83","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.83","url":null,"abstract":"In this paper, we propose a tree search approach to generate and evaluate cooprative behavior online in multiagent systems. It was difficult to apply a tree search methodology to tasks that the state-action space is continuous and requires realtimeness. However, it has become possible to apply such an approach since the computational resources became more powerful today. We applied a tree search method to the Robo Cup soccer 2D simulation and analyzed its effect by evaluating the team performance.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122200449","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 Semantic Framework for Delivery of Context-Aware Ubiquitous Services in Pervasive Environments","authors":"Alba Amato, B. D. Martino, S. Venticinque","doi":"10.1109/iNCoS.2012.111","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.111","url":null,"abstract":"Pervasive environments offer to software applications the possibility to interact with the reality in order to perceive the information surrounding the users and to adapt the environment itself, or to deliver context aware services that improve user's satisfaction. These services are able to respond in a rational way in many different situations choosing the actions with the best expected result, so making environment not just more connected and efficient, but smarter. In order to provide a pervasive environment with advanced smart capabilities services, we integrated those technologies that enable objects of the real world to become part of the Internet of Things. Besides semantic-based techniques have been used to dynamically and efficiently data processing, retrieval and delivery. Here we present a semantic framework that provides the technology for the development of intelligent, context aware services and their delivery in pervasive environments.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121050760","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":"Collection and Classification of Tennis Swings Using a Virtual Racket","authors":"A. Sevcenco, K. F. Li, Kosuke Takano","doi":"10.1109/iNCoS.2012.116","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.116","url":null,"abstract":"Computerized learning systems are popular these days due to the advances in artificial intelligence and decision support. Learning sports using a computer is a new field of research but it requires additional effort in the areas of motion sensing and modeling, and data mining. We are designing a tennis e-learning system using the Nintendo Wii remote as a virtual racket for practicing swings. This work introduces the swing motion data collection process. Classification of the swing data is explored using various techniques such as principal component analysis and K-means clustering. It is evident from the graphical data that different types of tennis swings have dissimilar characteristics in the 3-D space. The distinct envelope shape of the swings can be characterized and differentiated using descriptive statistics. Classification results are presented with emphasis on the swing consistency of tennis learners as well as the similarity of the swing motions which are important in the eventual learning process.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116604787","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 Trusted Authentication Scheme for Wireless Networks Using Direct Anonymous Attestation","authors":"Li Yang, Jianfeng Ma, Zhihong Liu, Ruofan Zheng","doi":"10.1109/iNCoS.2012.62","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.62","url":null,"abstract":"Not only user identities but also the platforms need to be authenticated in wireless networks under trusted computing environment. Based on direct anonymous attestation of trusted computing, a wireless anonymous authentication scheme is proposed, the platform of the mobile node was verified by the foreign network agent and the identity of the mobile node user was authenticated by the home network agent and the foreign network agent together. By using of direct anonymous attestation, temporary identities and one time secret keys, the property of platform anonymity, identity anonymity and domain separation are achieved. The analysis shows that our scheme is secure, reliable, and with higher performance.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125189981","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":"DOA Estimation Using Multiple Kernel Learning SVM Considering Mutual Coupling","authors":"M. Dehghanpour, V. Vakili, A. Farrokhi","doi":"10.1109/iNCoS.2012.112","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.112","url":null,"abstract":"The Knowledge of Direction of Arrival (DOA) of the signal impinging on a smart antenna enables us to reduce the effect of interference. In this paper, we investigate efficiency of multiple kernel learning SVR-based direction of arrival estimation in a smart antenna with mutual coupling effect. Mutual coupling effect can degrade performance of traditional DOA estimation methods such as MUSIC severely especially when the distance between elements is very small, but SVR-based methods such as MKL support vector regression method can deal with this problem very well. In this work, receiving mutual impedance method is used to calculate mutual coupling matrix. This method can deal with mutual coupling effect better than conventional mutual impedance method when the array is in receiving mode and the distance between elements is very small.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132628906","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}
T. Popeea, A. Constantinescu, L. Gheorghe, N. Tapus
{"title":"Inference Detection and Database Security for a Business Environment","authors":"T. Popeea, A. Constantinescu, L. Gheorghe, N. Tapus","doi":"10.1109/iNCoS.2012.95","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.95","url":null,"abstract":"The number of data collections of person-specific information is increasing exponentially. The risks of compromising privacy are also increasing, but can be limited through data anonymity and data security. Security models, developed for databases, differ in many aspects because they focus on different features of the problem, leading to incomplete implementations of the organizational security strategy. Our paper presents a multi-layer approach to data anonymity and database security, covering the entire process from inference detection to secure communication and database integrity. This approach is useful for protecting sensitive data and assuring in-depth mitigation of different possible attacks.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134312970","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 Lightweight Anonymous Authentication Scheme for VANET Based on Bilinear Pairing","authors":"Hui Zhu, We-Shyun Pan, Beishui Liu, Hui Li","doi":"10.1109/iNCoS.2012.63","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.63","url":null,"abstract":"In this paper, we propose a lightweight anonymous scheme based on bilinear pairing to solve the privacy preserving problem of vehicular ad hoc network (VANET). Our scheme can protect drivers' privacy not only among vehicles, but also between vehicles and road side units (RSUs). Meanwhile, our scheme does not request vehicles to conduct any bilinear pairing operations, thus significantly reduces the computational complexity of vehicles. We demonstrate our scheme through security analysis and evaluate its computational performance by simulations. The results show that our scheme performs well in providing secure communications and anonymous authentication among RSUs and vehicles.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125164473","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 Variant of the Cramer-Shoup Leakage-Resilient Public Key Encryption","authors":"Sujuan Li, Futai Zhang, Yinxia Sun, Limin Shen","doi":"10.1109/iNCoS.2012.64","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.64","url":null,"abstract":"We present a new variant of the Cramer-Shoup leakage-resilient public key encryption. The proposed scheme is more computational efficient than the original Cramer-Shoup leakage-resilient public key encryption scheme. It enjoys a shorter (public/secret) key length, and a higher relative leakage ratio. The new scheme is proved semantically secure against adaptive chosen cipher text attack in the standard model under the decisional Diffie-Hellman assumption.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130023284","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 Spiral-In Method for Designing and Connecting Learning Objects","authors":"Evgenios Vlachos","doi":"10.1109/iNCoS.2012.72","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.72","url":null,"abstract":"This work presents a method that provides adaptive support to those engaged in learning activities. It proposes a way for acquiring content knowledge in a specific domain by using Learning Objects (LOs) and suggests a pattern for designing and connecting these LOs for the creation of a course. The Spiral-in Method (SiM) encloses pedagogical and didactic potentials, addresses issues on both the educator and the group learners and implements personalized mechanisms. This methodology structures the design process into four distinct phases, fragmentation, coordination, combination and grouping. The starting point for this conquest to knowledge is estimated through the decomposition of a subject matter, combined with a series of questions that (1) set the goals and the preferences of the learners and (2) extract information about their prior knowledge on the subject matter. According to the answers given, LOs are created and connected in a linear structure, like a spiral. The LOs are grouped together into lessons attempting to satisfy short-term learning outcomes. The spiral has to be fully wrapped for the possession of the subject matter.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122296234","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}