Yohei Akiyama, Y. Kasai, M. Iwata, E. Takahashi, Fumiaki Sato, M. Murakawa
Solar power generation has attracted significant attention recently as a safe and environmentally friendly renewable energy source. However, generally speaking, since the service lives of solar power systems are relatively long, and since it is difficult to detect anomalies in individual solar panels, such plants tend to operate without much consideration for individual panel anomalies. In order to more comprehensively monitor solar power generation systems, the National Institute of Advanced Industrial Science and Technology (AIST) of Japan has developed a direct current (DC) power line communication system that enables monitoring of each panel in a system. Monitored data are then integrated and uploaded to the cloud. Using this monitored data, we found that the integrated power ratio trends of single panel power output are in accordance with a normal distribution. Therefore, herein, we propose an anomaly detection method that uses a normal distribution. We then describe an experiment using 24 solar panels into which pseudo-faults were induced and show that our proposal makes it possible to detect errors with high accuracy.
{"title":"Anomaly Detection of Solar Power Generation Systems Based on the Normalization of the Amount of Generated Electricity","authors":"Yohei Akiyama, Y. Kasai, M. Iwata, E. Takahashi, Fumiaki Sato, M. Murakawa","doi":"10.1109/AINA.2015.198","DOIUrl":"https://doi.org/10.1109/AINA.2015.198","url":null,"abstract":"Solar power generation has attracted significant attention recently as a safe and environmentally friendly renewable energy source. However, generally speaking, since the service lives of solar power systems are relatively long, and since it is difficult to detect anomalies in individual solar panels, such plants tend to operate without much consideration for individual panel anomalies. In order to more comprehensively monitor solar power generation systems, the National Institute of Advanced Industrial Science and Technology (AIST) of Japan has developed a direct current (DC) power line communication system that enables monitoring of each panel in a system. Monitored data are then integrated and uploaded to the cloud. Using this monitored data, we found that the integrated power ratio trends of single panel power output are in accordance with a normal distribution. Therefore, herein, we propose an anomaly detection method that uses a normal distribution. We then describe an experiment using 24 solar panels into which pseudo-faults were induced and show that our proposal makes it possible to detect errors with high accuracy.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"71 1","pages":"294-301"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85896692","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}
In recent years, cloud environments have emerged as a new paradigm for the execution and the deployment of cost-reduced and optimized business processes. Nevertheless, due to the lack of explicit and formal description of the resource perspective in existing business processes, cloud resources cannot be efficiently and optimally managed. With the aim of formalizing the consumed cloud resources using a shared knowledge base, we propose in this paper a semantic framework for resource-aware business process development in the cloud. Basically, our proposed semantic framework allows for (1) resource description in a formal and unique way, (2) resource allocation management and (3) resource constraints verification. In order to show its feasibility, our approach has been implemented as an extension of Signavio process editor and tested using a real use case study from an industrial partner.
{"title":"Towards Resource-aware Business Process development in the Cloud","authors":"E. Hachicha, Walid Gaaloul","doi":"10.1109/AINA.2015.265","DOIUrl":"https://doi.org/10.1109/AINA.2015.265","url":null,"abstract":"In recent years, cloud environments have emerged as a new paradigm for the execution and the deployment of cost-reduced and optimized business processes. Nevertheless, due to the lack of explicit and formal description of the resource perspective in existing business processes, cloud resources cannot be efficiently and optimally managed. With the aim of formalizing the consumed cloud resources using a shared knowledge base, we propose in this paper a semantic framework for resource-aware business process development in the cloud. Basically, our proposed semantic framework allows for (1) resource description in a formal and unique way, (2) resource allocation management and (3) resource constraints verification. In order to show its feasibility, our approach has been implemented as an extension of Signavio process editor and tested using a real use case study from an industrial partner.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"7 1","pages":"761-768"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72786775","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}
Mahdi Daghmehchi Firoozjaei, Jaegwan Yu, Hyoungshick Kim
As the popularity of location-based services (LBSes) is increasing, the location privacy has become a main concern. Among the rich collection of location privacy techniques, the spatial cloaking is one of the most popular techniques. In this paper, we propose a new spatial cloaking technique to hide a user's location under a cloaking of the serving base station (SeNB) and anonymize SeNB with a group of dummy locations in the neighboring group of another base station as central eNB (CeNB). Unlike the most existing approaches for selecting a dummy location, such as the center of a virtual circle, we select a properly chosen dummy location from real locations of eNBs to minimize side information for an adversary. Our experimental results show that the proposed scheme can achieve a reasonable degree of accuracy (>96%) for nearest neighbor services while providing a high level of location privacy.
{"title":"Privacy Preserving Nearest Neighbor Search Based on Topologies in Cellular Networks","authors":"Mahdi Daghmehchi Firoozjaei, Jaegwan Yu, Hyoungshick Kim","doi":"10.1109/WAINA.2015.22","DOIUrl":"https://doi.org/10.1109/WAINA.2015.22","url":null,"abstract":"As the popularity of location-based services (LBSes) is increasing, the location privacy has become a main concern. Among the rich collection of location privacy techniques, the spatial cloaking is one of the most popular techniques. In this paper, we propose a new spatial cloaking technique to hide a user's location under a cloaking of the serving base station (SeNB) and anonymize SeNB with a group of dummy locations in the neighboring group of another base station as central eNB (CeNB). Unlike the most existing approaches for selecting a dummy location, such as the center of a virtual circle, we select a properly chosen dummy location from real locations of eNBs to minimize side information for an adversary. Our experimental results show that the proposed scheme can achieve a reasonable degree of accuracy (>96%) for nearest neighbor services while providing a high level of location privacy.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"89 1","pages":"146-149"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77022782","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}
Taiki Honda, Makoto Ikeda, S. Ishikawa, L. Barolli
In this paper, we propose a Message Suppression Controller (MSC) for Vehicular Delay Tolerant Networking (VDTN) under highly stressed environment. The simulations for two scenarios are conducted considering obstacles (buildings), where MSC with Road side units (MSCRs) are present or not present. We consider 802.11p standard and send bundle messages in a Manhattan grid scenario. We use the duplicated bundle received, end-to-end delay, number of sent messages, Packet Delivery Ratio (PDR) and storage usage as evaluation metrics. Based on simulation results, we found that our proposed method can reduce the number of sent messages in the network without reducing the PDR.
{"title":"A Message Suppression Controller for Vehicular Delay Tolerant Networking","authors":"Taiki Honda, Makoto Ikeda, S. Ishikawa, L. Barolli","doi":"10.1109/AINA.2015.264","DOIUrl":"https://doi.org/10.1109/AINA.2015.264","url":null,"abstract":"In this paper, we propose a Message Suppression Controller (MSC) for Vehicular Delay Tolerant Networking (VDTN) under highly stressed environment. The simulations for two scenarios are conducted considering obstacles (buildings), where MSC with Road side units (MSCRs) are present or not present. We consider 802.11p standard and send bundle messages in a Manhattan grid scenario. We use the duplicated bundle received, end-to-end delay, number of sent messages, Packet Delivery Ratio (PDR) and storage usage as evaluation metrics. Based on simulation results, we found that our proposed method can reduce the number of sent messages in the network without reducing the PDR.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"52 1","pages":"754-760"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76034605","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}
Use of portable devices receives a tremendous growth in recent years. Such device becomes a universal portal, which connects users and the Web together, in addition to its ordinary built purposes. Users tend to share things via available channels (and/or social media as well) with the convenience brought by the device. This phenomenon, however, brings to the publics an open issue about the management of a vast amount of data, or user generated content as its specific term, and its potential usage. So this research, from a perspective of information seeking, attempts to facilitate the process and achieve high return on information in a ubiquitous environment. Beginning with a computational model to efficient management of user-generated contents, a progressive search algorithm is applied to obtain correlated information in accordance with user contexts. The above mentioned process is meanwhile normalized by a dynamic temporal-spatial model, which is primarily proposed to highlight the significance of timely information that matches the ultimate task of users at specific moment. Experiment results demonstrate the performance of proposed model and algorithm, and also the feasibility of this study.
{"title":"User-Centric Contexts Sensing for Instant Information Seeking Support","authors":"N. Yen, J. C. Hung","doi":"10.1109/AINA.2015.200","DOIUrl":"https://doi.org/10.1109/AINA.2015.200","url":null,"abstract":"Use of portable devices receives a tremendous growth in recent years. Such device becomes a universal portal, which connects users and the Web together, in addition to its ordinary built purposes. Users tend to share things via available channels (and/or social media as well) with the convenience brought by the device. This phenomenon, however, brings to the publics an open issue about the management of a vast amount of data, or user generated content as its specific term, and its potential usage. So this research, from a perspective of information seeking, attempts to facilitate the process and achieve high return on information in a ubiquitous environment. Beginning with a computational model to efficient management of user-generated contents, a progressive search algorithm is applied to obtain correlated information in accordance with user contexts. The above mentioned process is meanwhile normalized by a dynamic temporal-spatial model, which is primarily proposed to highlight the significance of timely information that matches the ultimate task of users at specific moment. Experiment results demonstrate the performance of proposed model and algorithm, and also the feasibility of this study.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"114 1","pages":"310-315"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88014881","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}
Bruce Ndibanje, Hyunho Kim, Young Jin Kang, Young-Sil Lee, Hoon-Jae Lee
This paper presents an efficiency and adaptive cryptographic protocol to ensure users' privacy and data integrity in RFID system. Radio Frequency Identification technology offers more intelligent systems and applications, but privacy and security issues have to be addressed before and after its adoption. The design of the proposed model is based on clustering configuration of the involved tags where they interchange the data with the reader whenever it sends a request. This scheme provides a strong mutual authentication framework that suits for real heterogeneous RFID applications such as in supply-chain management systems, healthcare monitoring and industrial environment. In addition, we contribute with a mathematical analysis to the delay analysis and optimization in a clustering topology tag-based. Finally, a formal security and proof analysis is demonstrated to prove the effectiveness of the proposed protocol and that achieves security and privacy.
{"title":"On Modeling Protocol-Based Clustering Tag in RFID Systems with Formal Security Analysis","authors":"Bruce Ndibanje, Hyunho Kim, Young Jin Kang, Young-Sil Lee, Hoon-Jae Lee","doi":"10.1109/AINA.2015.227","DOIUrl":"https://doi.org/10.1109/AINA.2015.227","url":null,"abstract":"This paper presents an efficiency and adaptive cryptographic protocol to ensure users' privacy and data integrity in RFID system. Radio Frequency Identification technology offers more intelligent systems and applications, but privacy and security issues have to be addressed before and after its adoption. The design of the proposed model is based on clustering configuration of the involved tags where they interchange the data with the reader whenever it sends a request. This scheme provides a strong mutual authentication framework that suits for real heterogeneous RFID applications such as in supply-chain management systems, healthcare monitoring and industrial environment. In addition, we contribute with a mathematical analysis to the delay analysis and optimization in a clustering topology tag-based. Finally, a formal security and proof analysis is demonstrated to prove the effectiveness of the proposed protocol and that achieves security and privacy.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"32 9 1","pages":"498-505"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82824814","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}
H. Maeda, N. Sakuma, Noriyuki Toyomasu, Ryoma Nishi, Daichi Ogata
Propagation and filtering characteristics of two dimensional (2D) pillar-type photonic crystal waveguide with triangular lattice were simulated by CIP method. The simulation results for Y-shaped branch and the cascaded 1X4 Yshaped branch waveguide were compared with measurements by using a scale model in microwave frequency range from 3.6 to 4.2 GHz. The resonant characteristics for cavities with various lengths were observed in good agreement with the experiment. This structure is applicable as a basic filter component in wavelength division multiplexing (WDM) systems in optical or microwave communication systems.
{"title":"Numerical Analysis of 1X4 Branch Waveguide in Two Dimensional Photonic Crystal Structure","authors":"H. Maeda, N. Sakuma, Noriyuki Toyomasu, Ryoma Nishi, Daichi Ogata","doi":"10.1109/WAINA.2015.90","DOIUrl":"https://doi.org/10.1109/WAINA.2015.90","url":null,"abstract":"Propagation and filtering characteristics of two dimensional (2D) pillar-type photonic crystal waveguide with triangular lattice were simulated by CIP method. The simulation results for Y-shaped branch and the cascaded 1X4 Yshaped branch waveguide were compared with measurements by using a scale model in microwave frequency range from 3.6 to 4.2 GHz. The resonant characteristics for cavities with various lengths were observed in good agreement with the experiment. This structure is applicable as a basic filter component in wavelength division multiplexing (WDM) systems in optical or microwave communication systems.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"282 1","pages":"366-369"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86739234","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}
Top-k document retrieval, which returns highly relevant documents relative to a query, is an essential task for many applications. One of the promising index frameworks is built by FM-index and wavelet tree for supporting efficient top-k document retrieval. The index, however, has difficulty on handling document frequency (DF) at search time because indexed terms are all substrings of a document collection. Previous works exhaustively search all the parts of the index, where most of the documents are not relevant, for DF calculation or store recalculated DF values in huge additional space. In this paper, we propose two methods to approximate DF of a query term by exploiting the information obtained from the process of traversing the index structures. Experimental results showed that our methods achieved almost equal effectiveness of exhaustive search while keeping search efficiency that time of our methods are about a half of the exhaustive search.
{"title":"Approximating Document Frequency for Self-Index based Top-k Document Retrieval","authors":"Tokinori Suzuki, Atsushi Fujii","doi":"10.1109/WAINA.2015.68","DOIUrl":"https://doi.org/10.1109/WAINA.2015.68","url":null,"abstract":"Top-k document retrieval, which returns highly relevant documents relative to a query, is an essential task for many applications. One of the promising index frameworks is built by FM-index and wavelet tree for supporting efficient top-k document retrieval. The index, however, has difficulty on handling document frequency (DF) at search time because indexed terms are all substrings of a document collection. Previous works exhaustively search all the parts of the index, where most of the documents are not relevant, for DF calculation or store recalculated DF values in huge additional space. In this paper, we propose two methods to approximate DF of a query term by exploiting the information obtained from the process of traversing the index structures. Experimental results showed that our methods achieved almost equal effectiveness of exhaustive search while keeping search efficiency that time of our methods are about a half of the exhaustive search.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"18 1","pages":"541-546"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79089344","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 presents SkillsRec - a novel teacher guidance based learner skills mining and filtering approach that identifies learner skills for Personal Learning Environment (PLE) based learning scenarios using Latent Semantic Analysis (LSA) technique. Skills Rec is developed on PLE design and development principles of the guided PLEs model [1]. Skills Rec takes teacher competencies/roles [2] and learner interests as input, melds them using LSA, and returns learner skills for the PLE-based learning as output. We compare learner-skill similarity scores of the Skills Rec with those generated through conventional Information Retrieval (IR) and Keywords Matching (KM) techniques. The aim is to report Skills Rec gains over conventional IR techniques. Based on Skills Rec results, this paper also provides top N=8 user-user recommendations most likely to be similar for a given active learner as a testing data.
{"title":"SkillsRec: A Novel Semantic Analysis Driven Learner Skills Mining and Filtering Approach for Personal Learning Environments Based on Teacher Guidance","authors":"Z. A. Shaikh, D. Gillet, S. Khoja","doi":"10.1109/WAINA.2015.112","DOIUrl":"https://doi.org/10.1109/WAINA.2015.112","url":null,"abstract":"This paper presents SkillsRec - a novel teacher guidance based learner skills mining and filtering approach that identifies learner skills for Personal Learning Environment (PLE) based learning scenarios using Latent Semantic Analysis (LSA) technique. Skills Rec is developed on PLE design and development principles of the guided PLEs model [1]. Skills Rec takes teacher competencies/roles [2] and learner interests as input, melds them using LSA, and returns learner skills for the PLE-based learning as output. We compare learner-skill similarity scores of the Skills Rec with those generated through conventional Information Retrieval (IR) and Keywords Matching (KM) techniques. The aim is to report Skills Rec gains over conventional IR techniques. Based on Skills Rec results, this paper also provides top N=8 user-user recommendations most likely to be similar for a given active learner as a testing data.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"39 1","pages":"570-576"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79468535","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}
Memory attacks, inspired by recent realistic physical attacks, have broken many cryptographic schemes which were considered secure. In this paper, we consider the memory leakage resilience in anonymous identity-based encryption schemes. We construct a leakage-resilient anonymous identity based encryption scheme based on dual system encryption. Inspired by Lewko et al.'s techniques, our scheme is built in composite order groups which have four prime order subgroups and blind the public parameters and cipher texts using the random elements of same subgroup to achieve the anonymity. Moreover, we analyze the security of our scheme in the full adaptive-ID model rather than the selective-ID model.
{"title":"Anonymous Identity-Based Encryption with Bounded Leakage Resilience","authors":"Pengtao Liu, Chengyu Hu, Shanqing Guo, Yilei Wang","doi":"10.1109/WAINA.2015.27","DOIUrl":"https://doi.org/10.1109/WAINA.2015.27","url":null,"abstract":"Memory attacks, inspired by recent realistic physical attacks, have broken many cryptographic schemes which were considered secure. In this paper, we consider the memory leakage resilience in anonymous identity-based encryption schemes. We construct a leakage-resilient anonymous identity based encryption scheme based on dual system encryption. Inspired by Lewko et al.'s techniques, our scheme is built in composite order groups which have four prime order subgroups and blind the public parameters and cipher texts using the random elements of same subgroup to achieve the anonymity. Moreover, we analyze the security of our scheme in the full adaptive-ID model rather than the selective-ID model.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"63 3 1","pages":"287-292"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83628945","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
扫码关注我们
求助内容：
应助结果提醒方式：