2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)最新文献

筛选
英文 中文
A Machine Learning Based Web Spam Filtering Approach 基于机器学习的网络垃圾邮件过滤方法
Santosh Kumar, Xiaoying Gao, I. Welch, Masood Mansoori
{"title":"A Machine Learning Based Web Spam Filtering Approach","authors":"Santosh Kumar, Xiaoying Gao, I. Welch, Masood Mansoori","doi":"10.1109/AINA.2016.177","DOIUrl":"https://doi.org/10.1109/AINA.2016.177","url":null,"abstract":"Web spam has the effect of polluting search engine results and decreasing the usefulness of search engines.Web spam can be classified according to the methods used to raise the web page's ranking by subverting web search engine's algorithms used to rank search results. The main types are: content spam, link spam and cloaking spam. There has been little or no work on automatically classifying web spam by type. This paper has two contributions, (i) we propose a Dual-Margin Multi-Class Hypersphere Support Vector Machine (DMMH- SVM) classifier approach to automatically classifying web spam by type, (ii) we introduce novel cloaking-based spam features which help our classifier model to achieve high precision and recall rate, thereby reducing the false positive rates. The effectiveness of the proposed model is justified analytically. Our experimental results demonstrated that DMMH-SVM outperforms existing algorithms with novel cloaking features.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131411545","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}
引用次数: 37
Channel Capacity and SA-BER Performances Evaluation of an OFDM-Based Two-Way Relaying AF-PNC-PLC Systems 基于ofdm的双向中继AF-PNC-PLC系统的信道容量和SA-BER性能评估
S. Ezzine, F. Abdelkefi, J. Cances, V. Meghdadi, A. Bouallègue
{"title":"Channel Capacity and SA-BER Performances Evaluation of an OFDM-Based Two-Way Relaying AF-PNC-PLC Systems","authors":"S. Ezzine, F. Abdelkefi, J. Cances, V. Meghdadi, A. Bouallègue","doi":"10.1109/AINA.2016.150","DOIUrl":"https://doi.org/10.1109/AINA.2016.150","url":null,"abstract":"Since PLC channel is a fading channel whose characteristics vary considerably over long distances and at high frequencies the major challenge for researchers in Smart Grid, is how to supply robust and efficient communication. To overcome these constraints Cooperative communication and Network coding have been demonstrated to be effective. Consequently in this paper, we consider a two-way relaying PLC system in which orthogonal frequency division multiplexing (OFDM) is employed for the source 1-to-source 2, the source 1-to-relay and the relay-to-source 2 links where the relay node performs Amplify and Forward (AF) protocol. We consider a conventional bi directional relaying schema (AF-PLC) and we compare it to a schema in which we include Physical Network Coding (AF-PNC-PLC) for different number of time slots dedicated to exchange data messages between two source nodes S1 and S2 with the assistance of the relay node R. We also derive the channel capacity and sum-average BER (SA-BER) expressions for OFDM-based two-way relaying AF-PLC and AF-PNC-PLC systems without and with cooperative diversity. Moreover, we provide a solution based on sub-carrier pairing technique to further improve the channel capacity and SA-BER performances.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122775502","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}
引用次数: 1
Game-Theoretic Security of Commitment Protocols under a Realistic Cost Model 现实成本模型下承诺协议的博弈论安全性
Tsuyoshi Komatsubara, Yoshifumi Manabe
{"title":"Game-Theoretic Security of Commitment Protocols under a Realistic Cost Model","authors":"Tsuyoshi Komatsubara, Yoshifumi Manabe","doi":"10.1109/AINA.2016.47","DOIUrl":"https://doi.org/10.1109/AINA.2016.47","url":null,"abstract":"This paper considers game-theoretic security of bit commitment protocols under a realistic cost model. Higo et. al (IWSEC 2013) proved equivalence of game-theoretic security and cryptographic security of bit commitment protocols under an ideal cost model. Their model assumes that there is no cost for communication and computation. Under a realistic model that cost for communication and computation is non-negligible, this paper shows that conventional bit commitment protocols are not game-theoretically secure, and abort detection property is necessary for bit commitment protocols to achieve game-theoretic security.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123159340","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
Efficient Broadcast Protocol for the Internet of Things 高效的物联网广播协议
Hicham Lakhlef, M. Raynal, J. Bourgeois
{"title":"Efficient Broadcast Protocol for the Internet of Things","authors":"Hicham Lakhlef, M. Raynal, J. Bourgeois","doi":"10.1109/AINA.2016.50","DOIUrl":"https://doi.org/10.1109/AINA.2016.50","url":null,"abstract":"Internet of Things (IoT) is a network composed of a variety of heterogeneous things and objects such as Connected Wearable Devices (sensors, MEMS, microrobots, PDA, ...), Connected Cars, Connected Homes, Connected Cities, and the Industrial Internet. These things use generally wireless communication to interact and cooperate with each other to reach common services and goals. IoT(T, n) is a wireless network of things composed of T things with n items (information) distributed on it. The aim of the permutation routing is to route to each thing, its items, so it can accomplish its task. In this paper, we present an agent-based broadcast protocol for mobile Internet of Things that uses few communication channels. The main idea is to partition things into groups according to the number of channels. In each group, an agent manages a set of things. This new protocol performs efficiently with respect to the number of broadcast rounds and runs without conflict and collision on the communication channels. We give an estimation of the upper and the lower bounds of the number of broadcast rounds in the worst case. This paper is the first to present efficient broadcast protocol for the internet of things.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123754146","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}
引用次数: 3
Towards a General Architecture for Social Media Data Capture from a Multi-Domain Perspective 多领域视角下的社交媒体数据捕获通用架构
A. Bechini, Davide Gazzè, Andrea Marchetti, M. Tesconi
{"title":"Towards a General Architecture for Social Media Data Capture from a Multi-Domain Perspective","authors":"A. Bechini, Davide Gazzè, Andrea Marchetti, M. Tesconi","doi":"10.1109/AINA.2016.75","DOIUrl":"https://doi.org/10.1109/AINA.2016.75","url":null,"abstract":"Online Social Media (OSM) platforms, such as Facebook or Twitter, are part of everyday life as powerful communication tools. They let users communicate anywhere anytime, and improve their own public image. For this reason, OSM are becoming more and more popular. Social Media data may play a crucial role in various decision-making processes. In this setting, research topics connected to monitoring of Social Media data are becoming increasingly important. The presented work is grounded on direct extensive experiences in data collection from different Social Media sources, and on the different methodologies applied in different reference domains (namely Online Reputation, Social Media Intelligence, and Opinion Mining in tourism). The crawlers developed for these domains provide valuable suggestions to elicit diverse requirements. After lessons learned in such fields, a general architecture for data capture from Social Media sources has been devised, and the interfaces of the composing modules have been defined. The resulting API can be exploited for an orderly re-engineering of crawling tools in the reference domains, thus implementing specific versions of the generic architecture.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121511136","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
Addressing Challenges in Browser Based P2P Content Sharing Framework Using WebRTC 利用WebRTC解决基于浏览器的P2P内容共享框架中的挑战
Shikhar Vashishth, Yash Sinha, K. H. Babu
{"title":"Addressing Challenges in Browser Based P2P Content Sharing Framework Using WebRTC","authors":"Shikhar Vashishth, Yash Sinha, K. H. Babu","doi":"10.1109/AINA.2016.143","DOIUrl":"https://doi.org/10.1109/AINA.2016.143","url":null,"abstract":"Most of the content sharing applications use the client/server model in which all of group managements are done by the server and this sometimes becomes a communication bottleneck. Installing specialized software for different purposes such as file sharing, video conferencing etc., becomes a barrier for the user. Recent technologies like NodeJs and Socket.io have fostered new ideas the ways web browsers can be used. Moreover, the emerging standards of WebRTC open up new paradigm of direct communication channel between web browsers without relaying the data through a web server. But there are certain issues such as lack of full-fledged threading/concurrency support in the JavaScript language, reliance on synchronous loading etc. that restricts modern day browsers to take full advantage of current multiprocessing capabilities. Although, on one hand there are advantages of using web browsers, such as no requirement of specialized software, benefits of emerging technologies etc., the aforementioned issues pose challenges in implementation in certain areas. In this paper, we have tried to couple the benefits of peer-to-peer (P2P) architecture (elimination of centralized dependency, better scalability, shareability etc.) along with the advantages of recent web technologies (NodeJs, WebRTC etc.) by designing and implementing a browser based P2P content sharing framework. We have addressed the aforementioned challenges of a browser based P2P architecture by providing a mechanism to exchange messages asynchronously and facilitating new peer joins via existing peers in the network, thus reducing the dependency on bootstrap server. Our prototypical implementation demonstrates the feasibility, efficiency and scalability of this lightweight framework, on the top of which a variety of applications can be added as a layer of functionality.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125037358","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
Influential Abortion Probability in a Flexible Read-Write Abortion Protocol 柔性读写流产协议的影响流产概率
Shigenari Nakamura, Dilawaer Duolikun, T. Enokido, M. Takizawa
{"title":"Influential Abortion Probability in a Flexible Read-Write Abortion Protocol","authors":"Shigenari Nakamura, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1109/AINA.2016.155","DOIUrl":"https://doi.org/10.1109/AINA.2016.155","url":null,"abstract":"Data in an object may flow into another object if transactions read and write data in the objects. A transaction illegally reads data in an object if the object includes data in other objects which are not allowed to be read. In our previous studies, the flexible read-write-abortion with role sensitivity (FRWA-R), object sensitivity (FRWA-O), and role safety (FRWA-RS) protocols are proposed to prevent illegal information flow. Here, a transaction aborts with some probability once illegally reading data in an object. The abortion probability of a transaction depends on the sensitivities of roles which the transaction holds and objects in which the transaction illegally reads data. The safety of a role and object shows how many transactions which hold the role and illegally read data in the object commit or abort after illegally reading data in the object, respectively. Here, safety of a role which increases and decreases by constant values as a transaction holding the role aborts and commits, respectively. Based on the safety concept, we newly propose an influential abortion probability of a transaction where the abortion probability depends on not only roles held by the transaction but also the previous abortion probability. In this paper, we newly propose an FRWA with the influential abortion probability (FRWA-IAP) protocol. In the evaluation, we show a fewer number of transactions abort in the FRWA-IAP protocol than the RWA and FRWA-RS protocols while transactions are more efficiently performed than the WA protocol.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127102088","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
Energy Considerations for Continuous Group Activity Recognition Using Mobile Devices: The Case of GroupSense 使用移动设备进行连续群体活动识别的能量考虑:GroupSense的案例
A. Abkenar, S. Loke, J. Rahayu, A. Zaslavsky
{"title":"Energy Considerations for Continuous Group Activity Recognition Using Mobile Devices: The Case of GroupSense","authors":"A. Abkenar, S. Loke, J. Rahayu, A. Zaslavsky","doi":"10.1109/AINA.2016.94","DOIUrl":"https://doi.org/10.1109/AINA.2016.94","url":null,"abstract":"Human activity recognition using mobile sensors is becoming increasingly important. Scaling up from individuals to groups, that is, Group Activity Recognition (GAR), has attracted significant attention recently. This paper investigates energy consumption for GAR and proposes a novel distributed middleware called GroupSense for mobile GAR. We implemented and tested GroupSense, which incorporates a protocol for the exchange of information required for GAR. We also investigated the battery drain of continuous activity recognition in a range of simple GAR scenarios. We then conclude with lessons learnt for GAR.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129075629","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}
引用次数: 10
A Method to Describe Student Learning Status for Personalized Computer Programming e-Learning Environment 个性化计算机编程电子学习环境中学生学习状态的描述方法
Yu Yan, Hara Kohei, Nakano Hiroto, Takenobu Kazuma, A. He
{"title":"A Method to Describe Student Learning Status for Personalized Computer Programming e-Learning Environment","authors":"Yu Yan, Hara Kohei, Nakano Hiroto, Takenobu Kazuma, A. He","doi":"10.1109/AINA.2016.38","DOIUrl":"https://doi.org/10.1109/AINA.2016.38","url":null,"abstract":"Personalized e-learning environment is desirable in computer programming education. An important issue on personalized e-learning environment is to know the learning status of each student. This article proposes a method, SKP based Student Learning Status Description(SKP-based SLSD), to help instructors to know student individual's learning status in C programming. SKP-based SLSD focus on the syntactic knowledge called Syntax Knowledge Point(SKP) extracted from program source code. Firstly, it gathers all syntactic knowledge that should be learned by the students by extracting SKP from the source code in teaching materials or exercises' model answers. Then, for each student, it collects his learning activities on each SKP by extracting SKP from the source code the student have read or taught at lectures and wrote at exercises or tests. Finally, for each student, his understanding of each SKP is estimated based on the collected data. Student learning status can be described by his understanding of all SKPs. By SKP-based SLSD, the information used to describe student learning status can be more detail, be better-defined and better-handled by computer systems. We have also conducted experiments and proved that SKP-based SLSD is effective and feasible.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126460915","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
CICPV: A New Academic Expert Search Model CICPV:一个新的学术专家搜索模型
Zhijie Ban, Le Liu
{"title":"CICPV: A New Academic Expert Search Model","authors":"Zhijie Ban, Le Liu","doi":"10.1109/AINA.2016.14","DOIUrl":"https://doi.org/10.1109/AINA.2016.14","url":null,"abstract":"Academic expert search is one of the most important issues for mining academic networks. There exist the different types of information (e.g. papers, authors and citations) in an academic network. Different from the traditional academic expert search models, this paper makes good use of the important data from the citation network, the coauthor network and the papers' content by introducing social network analysis method. Our model can measure an expert's citation influence using the citation ratio, co-citation ratio and authority value of his papers in the citation network. It analyses an expert's centrality from the global and local aspects of the coauthor network, also combining the text mining method to calculate the similarity between the users' query and papers' contents. In order to accurately express a paper, we improve the VSM model by adding the location weights. Moreover, our model uses the BP neural network to decide the ranking of each expert. Experimental results show that our method can improve the performance of academic expert search.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126476576","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}
引用次数: 6
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学术文献互助群
群 号:481959085
Book学术官方微信