2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing最新文献

筛选
英文 中文
Bio-inspired Routing in Wireless Sensor Networks 无线传感器网络中的仿生路由
Hamza Fahim, N. Javaid, Z. Khan, U. Qasim, Shumaila Javed, Amir Hayat, Z. Iqbal, Ghazanfar Rehman
{"title":"Bio-inspired Routing in Wireless Sensor Networks","authors":"Hamza Fahim, N. Javaid, Z. Khan, U. Qasim, Shumaila Javed, Amir Hayat, Z. Iqbal, Ghazanfar Rehman","doi":"10.1109/IMIS.2015.16","DOIUrl":"https://doi.org/10.1109/IMIS.2015.16","url":null,"abstract":"In order to increase network life time scalable, efficient and adaptive routing protocols are need of current time. Many energy efficient protocols have been proposed, the Clustering algorithm is also a basic technique used for energy efficiency. In this paper we propose an energy efficient routing protocol that is based on Artificial Bee Colony (ABC) algorithm of Bio Inspired. The presented protocol efficiently utilized characteristics of ABC algorithm such as foraging principle and waggle dance of honey bees. Waggle dance technique is used to find Routing Node (RN) that has maximum energy. Simulation results proves increase network life time and high throughput with minimum delay.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123570870","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}
引用次数: 4
Explore the Development of Social Enterprises in Taiwan from the Dynamic Capabilities Approach 从动态能力视角探讨台湾社会企业的发展
Yen-Tsung Lin, Hsing-Chung Chun, S. Chuang
{"title":"Explore the Development of Social Enterprises in Taiwan from the Dynamic Capabilities Approach","authors":"Yen-Tsung Lin, Hsing-Chung Chun, S. Chuang","doi":"10.1109/IMIS.2015.91","DOIUrl":"https://doi.org/10.1109/IMIS.2015.91","url":null,"abstract":"In recent years, social business has been to be one of the important business developmental trends in Taiwan. The huge pushing power came when Prime Minister Yi-Hua Jiang announced that Taiwan has entered the first year of Social Enterprise from 2014. The single case analysis based on the theory of dynamic capabilities is adopted in this study via direct observation the selected Kung Yuan Social Enterprise Co. Ltd. Which was the first social enterprise company in Taiwan. By means of data collection and analysis, our aims were to explore its rise and developmental process, in order to understand how they built their organization and why they positioned themselves to be non-profit organizations and businesses as well as how they secured the competitive advantages and demonstrating truthful effectiveness. In addition, SWOT model is adopted in this paper for further analyzing their development process and development path. The conclusions and recommendations would be used as references for future researches with similar institutions. Due to the limited resources from which we obtained information, we were unable to understand some of the data about the company's \"business\" and \"social\" characteristics. Others factors such as human resource management, R&D and other issues must wait for additional study in the future.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"313 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122092288","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}
引用次数: 0
Synchronization of Peers in Peer-to-Peer Publish/Subscribe Systems 对等发布/订阅系统中对等体的同步
Hiroki Nakayama, Dilawaer Duolikun, T. Enokido, M. Takizawa
{"title":"Synchronization of Peers in Peer-to-Peer Publish/Subscribe Systems","authors":"Hiroki Nakayama, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1109/IMIS.2015.39","DOIUrl":"https://doi.org/10.1109/IMIS.2015.39","url":null,"abstract":"In distributed systems, a group of multiple processes are cooperating with one another by exchanging messages in networks. In this paper, we consider a peer-to-peer (P2P) model of a topic-based publish/subscribe (P2PPS) system composed of peer processes (peers). Each peer pi can both subscribe a subscription p<sub>i</sub>. S and publish an event message e with a publication e.P, which are specified in terms topics, i.e. Keywords. An event message e is notified to a target peer p<sub>i</sub> whose subscription p<sub>i</sub>.S includes a common keyword with the publication e.P. Each event message e carries a vector e.V = (V<sub>1</sub>, , V<sub>m</sub>) of keywords k<sub>1</sub>, , k<sub>m</sub>. An event message e<sub>1</sub> causally precedes an event message e<sub>2</sub> with respect to a subscription S<sub>i</sub> iff e<sub>1</sub> causally precedes e<sub>2</sub> with respect to the send-receive relation and e<sub>1</sub>.V<sub>h</sub> <; e<sub>2</sub>.V<sub>h</sub> for every keyword k<sub>h</sub> in the publications e<sub>1</sub>.P and e<sub>2</sub>.P and the subscription p<sub>i</sub>.S. If a pair of event messages e<sub>1</sub> and e<sub>2</sub> are ordered so that e<sub>1</sub> precedes e<sub>2</sub> even if e<sub>1</sub> does not causally precede e<sub>2</sub>, the event messages e<sub>1</sub> and e<sub>2</sub> are unnecessarily ordered. In this paper, every pair of messages are causally delivered to every common target peer by using the linear clock and keyword vector to reduce pairs of messages unnecessarily ordered. We evaluate the keyword vectors in terms of number of messages unnecessarily ordered.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127803024","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}
引用次数: 7
A Fuzzy-Based Reliability System for JXTA-Overlay P2P Platform Considering Number of Interaction, Security, Packet Loss and Local Score Parameters 考虑交互数、安全性、丢包率和本地评分参数的jxta覆盖P2P平台模糊可靠性系统
Yi Liu, Shinji Sakamoto, Keita Matsuo, L. Barolli, Makoto Ikeda, F. Xhafa
{"title":"A Fuzzy-Based Reliability System for JXTA-Overlay P2P Platform Considering Number of Interaction, Security, Packet Loss and Local Score Parameters","authors":"Yi Liu, Shinji Sakamoto, Keita Matsuo, L. Barolli, Makoto Ikeda, F. Xhafa","doi":"10.1109/IMIS.2015.38","DOIUrl":"https://doi.org/10.1109/IMIS.2015.38","url":null,"abstract":"In this paper, we propose and evaluate a new fuzzy-based reliability system for Peer-to-Peer (P2P) Communications in JXTA-Overlay platform. In our system, we considered four input parameters: Number of Interactions (NI), Security (S), Packet Loss (PL) and Local Score (LS) to decide the Peer Reliability (PR). We evaluate the proposed system by computer simulations. The simulation results have shown that the proposed system has a good performance and can choose reliable peers to connect in JXTA-Overlay platform.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"45 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132655303","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}
引用次数: 0
IEEE802.11 Based Vehicle-to-Vehicle Delay Tolerant Networks for Road Surveillance System in Local Areas 基于IEEE802.11的局域道路监控系统车对车容延迟网络
Noriki Uchida, Go Hirakawa, Tomoyuki Ishida, Y. Arai, Y. Shibata
{"title":"IEEE802.11 Based Vehicle-to-Vehicle Delay Tolerant Networks for Road Surveillance System in Local Areas","authors":"Noriki Uchida, Go Hirakawa, Tomoyuki Ishida, Y. Arai, Y. Shibata","doi":"10.1109/IMIS.2015.9","DOIUrl":"https://doi.org/10.1109/IMIS.2015.9","url":null,"abstract":"In northern areas, the road conditions during the winter especially in mountain areas are one of the significant safety subjects for the residences and the tourists. In addition, there are some areas that the network services such as LTE or 3G are unavailable to use in mountain areas. For this reason, this paper proposed the Vehicle-to-vehicle (V2V) communication methods with the Delay Tolerant Networks (DTN) for the road surveillance system. In the proposed network system, IEEE802.11b/g/p is supposed for introducing the wireless V2V system, and the observed road condition's data is transmitted with the DTN routings. For the efficiency of the proposed network system, the GIS road maps of Takizawa in Japan are introduced for the computational simulations. Also, various DTN routings such as the Epidemic, the Spray and Wait, and the Maxprop routing are held for the future studies of the V2V based DTN routings of the road surveillance system in local areas during the winter.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116980349","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}
引用次数: 5
Study of e-Business Strategy in Japanese Family Business and Long-Established Companies 日本家族企业和老牌企业的电子商务战略研究
Hidekazu Sone, Mei-Hua Liao
{"title":"Study of e-Business Strategy in Japanese Family Business and Long-Established Companies","authors":"Hidekazu Sone, Mei-Hua Liao","doi":"10.1109/IMIS.2015.80","DOIUrl":"https://doi.org/10.1109/IMIS.2015.80","url":null,"abstract":"This report discusses difficulties in mail-order service, as well as the effects of its introduction, in long-established companies. While previous studies only discussed the merits of e-business, it has surfaced with the progress of research that many companies hesitate to actively introduce mail-order service despite the resulting sales growth. They mentioned as the biggest cause of their hesitation that it would require more employees and make operations complicated. For instance, a long-established sake brewer, which offers mail-order service, deals with a flood of online orders with all employees mobilized on such occasions as Father's Day and toward the year end. A long-standing souvenir shop in Hokkaido, which sells local specialties of Hokkaido through mail-order service, is not active in the service as having trouble in handling orders, despite a 20% sales growth from the mail-order service. These issues will also be discussed.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128372621","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}
引用次数: 0
Analysis of Node Placement in Wireless Mesh Networks Using Friedman Test: A Comparison Study for Tabu Search and Hill Climbing 基于Friedman测试的无线网状网络节点布局分析:禁忌搜索与爬坡的比较研究
Tetsuya Oda, Donald Elmazi, Algenti Lala, Vladi Koliçi, L. Barolli, F. Xhafa
{"title":"Analysis of Node Placement in Wireless Mesh Networks Using Friedman Test: A Comparison Study for Tabu Search and Hill Climbing","authors":"Tetsuya Oda, Donald Elmazi, Algenti Lala, Vladi Koliçi, L. Barolli, F. Xhafa","doi":"10.1109/IMIS.2015.84","DOIUrl":"https://doi.org/10.1109/IMIS.2015.84","url":null,"abstract":"In this paper, we deal with connectivity and coverage problem in Wireless Mesh Networks (WMNs). We used Friedman test to check if we can compare Tabu Search (TS) and Hill Climbing (HC). We found out that TS and HC have differences in their performance. Then, we used the implemented systems WMN-TS and WMN-HC to evaluate and compare the performance of the systems for different distributions of mesh clients in terms of Size of Giant Component (SGC) and Number of Covered Mesh Clients (NCMC). The simulation results show that for Uniform distribution, for small radius of communication distance, the SGC of WMN-TS is better than WMN-HC. For Normal distribution, the WMN-HC performs better than WMN-TS. For Exponential distribution, the WMN-HC performs better than WMN-TS for all radius of communication distances. For Weibull distribution, the WMN-HC has a good performance for big radius of communication distance.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134522975","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}
引用次数: 2
Consideration of the XOR-operation Based Secure Multiparty Computation 基于异或运算的安全多方计算的思考
Yuji Suga
{"title":"Consideration of the XOR-operation Based Secure Multiparty Computation","authors":"Yuji Suga","doi":"10.1109/IMIS.2015.70","DOIUrl":"https://doi.org/10.1109/IMIS.2015.70","url":null,"abstract":"Fast (k, n)-threshold secret sharing schemes with exclusive-OR operations have proposed by Kurihara et al. And Fujii et al. Independently. Their method are ideal that share size is equal to the size of the data to be distributed with the benefits that can be handled very fast for using only XOR operation at distribution and restoration processes. Moreover an author extended these schemes and reported existences of (2,2m) threshold secret sharing schemes with small order. This paper attempts to construct secure multiparty computations by using XOR-based secret sharing schemes.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133123614","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}
引用次数: 2
A Multi-node Renewable Algorithm Based on Charging Range in Large-Scale Wireless Sensor Network 大规模无线传感器网络中基于充电距离的多节点可更新算法
Guowei Wu, Chi Lin, Ying Li, Lin Yao, Ailun Chen
{"title":"A Multi-node Renewable Algorithm Based on Charging Range in Large-Scale Wireless Sensor Network","authors":"Guowei Wu, Chi Lin, Ying Li, Lin Yao, Ailun Chen","doi":"10.1109/IMIS.2015.19","DOIUrl":"https://doi.org/10.1109/IMIS.2015.19","url":null,"abstract":"Recently, wireless energy transfer technologies have emerged as a promising approach to address the power constraint problem in Wireless Sensor Networks. In this paper, we propose an optimized algorithm Multi-node Renewable based on Charging Range (MRCR) in the large-scale WSN, where multiple sensor nodes are charging simultaneously. A mobile charging vehicle (MCV) is responsible for energy supplement of these nodes group by group at specified docking spots. These spots are selected based on charging range of MCV, which not only maximum the charging coverage, but also improve the energy efficiency as the minimum stops and shortest travel path. We organize MCV schedule into rounds and each round is divided into slots: judgment, charging and rest. Finally, extensive experimental results show the proposal of MRCR algorithm can guarantee a short TSP length in every round and all sensor nodes live immorally.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129218076","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}
引用次数: 9
Application of hidden markov models and gesture description language classifiers to Oyama karate techniques recognition 隐马尔可夫模型与手势描述语言分类器在Oyama空手道技术识别中的应用
T. Hachaj, M. Ogiela, Katarzyna Koptyra
{"title":"Application of hidden markov models and gesture description language classifiers to Oyama karate techniques recognition","authors":"T. Hachaj, M. Ogiela, Katarzyna Koptyra","doi":"10.1109/IMIS.2015.7328113","DOIUrl":"https://doi.org/10.1109/IMIS.2015.7328113","url":null,"abstract":"The karate movements classification is extremely challenging task due to the speed of body movements. From the other hand movements patterns are highly repetitive because they are practiced for many years by skilled martial artists. Those two facts make karate techniques classification tasks reliable tests of classifiers potential. Also, nowadays there is a growing interest on commercial market for solutions that are capable to be used in computer entertainment and coaching systems. Those factors motivated us to evaluate our Gesture Description Language (GDL) classifier trained with unsupervised reversed-GDL (R-GDL) method on karate techniques dataset and to compare it with state-of-the-art approach namely multivariate continuous hidden Markov model classifier with Gaussian distribution. The evaluation of capability of R-GDL methodology to karate techniques classification is main novelty of this paper. We have achieved very promising results. Only one class of actions has average recognition rate on the level of 88% while other where between 90% and 100%. GDL has also important advantages over state-of-the-art HMM classier that we will discuss in this paper.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128461749","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}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信