{"title":"Human Actions Modelling and Recognition in Low-Dimensional Feature Space","authors":"T. Hachaj, M. Ogiela, Katarzyna Koptyra","doi":"10.1109/BWCCA.2015.15","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.15","url":null,"abstract":"The aim of this paper is to prove that it is possible to model the set of multiple human actions in low-dimensional feature space so they can be nearly unambiguously distinguish with the help of classification algorithm. The most important condition that has to be satisfied to solve this problem is selection of proper features sets that fit to a particular actions group. We evaluate our methodology on the dataset consisted of 16 different Oyama Karate techniques performed by two professional sport (black belt) instructors and masters of Oyama Karate. The dataset consisted of 640 actions samples. As a classification algorithm we have used Gesture Description Language. We have used four different angle-based features sets. With that selection we have made actions descriptions that transformed initial motion capture dataset to 6 or 8 dimensional features space with maximally three keyframes. Beside only one class the recognition rate was at level of 88% to even 100%.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116985386","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":"Design of Secure Mobile Payment System Based on IBC","authors":"Yang Rui-xia","doi":"10.1109/BWCCA.2015.14","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.14","url":null,"abstract":"In this paper, we analysis the security problem in mobile payment system. Based on Identity-Based Cryptography (IBC) which has simpler framework and lower cost, we present a secure mobile payment system to ensure the security and privacy of the transferred data. The algorithms of IBC are implemented in WIS08SD548E which can provide many national arithmetic functions to ensure data security in mobile terminal. Also, we discuss the trading process and analyze the security of the solution in payment transaction.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"08 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120961808","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}
Oluyomi Simpson, Yusuf Abdulkadir, Yichuang Sun, B. Chi
{"title":"Relay-Based Cooperative Spectrum Sensing with Improved Energy Detection In Cognitive Radio","authors":"Oluyomi Simpson, Yusuf Abdulkadir, Yichuang Sun, B. Chi","doi":"10.1109/BWCCA.2015.13","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.13","url":null,"abstract":"Cognitive radio has become an effective technology to solve the underutilisation problem of the spectrum. In recent times, spectrum sensing has been intensively studied as a key technology in realising the cognitive radio. In this paper, we consider an amplify-and-forward relay-based cooperative spectrum sensing using a double threshold energy detector. Each secondary cognitive user takes a local decision on spectrum occupancy based on two energy detection thresholds. If it detects the value out of both thresholds, it makes a decision first, amplifies and forwards the local result to the fusion center. If the detected value falls between the both thresholds, it amplifies and forwards this detected value to the fusion center. Finally, energy fusion and decision fusion are conducted at the fusion center to determine the primary user status. Cooperative probability of detection, probability of missed detection and probability of false alarm are derived theoretically with and without direct communication between the primary user and fusion centre. Simulation results show that the proposed method achieves an improvement in probability of detection.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"166 15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121026457","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}
Shinji Sakamoto, Tetsuya Oda, Makoto Ikeda, L. Barolli, F. Xhafa
{"title":"A PSO-based Simulation System for Node Placement in Wireless Mesh Networks: Evaluation Results for Different Replacement Methods","authors":"Shinji Sakamoto, Tetsuya Oda, Makoto Ikeda, L. Barolli, F. Xhafa","doi":"10.1109/BWCCA.2015.53","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.53","url":null,"abstract":"With the fast development of wireless technologies, Wireless Mesh Networks (WMNs) are becoming an important networking infrastructure due to their low cost and increased high speed wireless Internet connectivity. In this paper, we implement a simulation system based on Particle Swarm Optimization (PSO) in order to solve the problem of mesh router placement in WMNs. We consider 4 replacement methods of mesh routers: Constriction Method (CM), Random Inertia Weight Method (RIWM), Linearly Decreasing Vmax Method (LDVM) and Linearly Decreasing Inertia Weight Method (LDIWM). We use Size of Giant Component (SGC) and Number of Covered Mesh Clients (NCMC) as metrics for optimization. From the simulation results, we found that the CM converges very fast but it has the worst performance among 4 replacement methods. The RIWM converges fast and the performance is good. The LDIWM is a combination of RIWM and LDVM. The LDVM converges after 170 number of phases but has a good performance.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116416797","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":"Color Image Authentication Method Based on Triple-Channel Spiking Cortical Model","authors":"Guangjie Kou, Yunyan Ma","doi":"10.1109/BWCCA.2015.23","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.23","url":null,"abstract":"With the increasingly use of non-secure channels such as the Internet to transmit the digital images, image authentication techniques have recently gained great attention due to its importance for data integrity of multimedia applications. This paper introduces a new digital signature method to content-based color image authentication based on a Triple-Channel Spiking Cortical Model (TSCM), which is inspired by the working principle of mammalian visual cortex neuron model. In this method, we use digital signatures produced by TSCM as color image authentication information. Some juggled images failed to authenticate by using local histogram method or local mean intensity method can be authenticate correctly by this method, because the signature of TSCM includes not only the intensities or color information but also the geometry structures or color distributions of the color images. Experiment results show that this method can not only check the validity and the completeness of the color image, but also locate the juggled areas in the juggled image.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122319673","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":"Data Block Management Scheme Based on Secret Sharing for HDFS","authors":"Su-Hyun Kim, Imyeong Lee","doi":"10.1109/BWCCA.2015.70","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.70","url":null,"abstract":"In the cloud computing environment, data are encrypted to be stored in many distributed servers. Global Internet service providers such as Google and Yahoo recognized the importance of an Internet service platform and have used low-priced commercial-node-based and large-scale cluster-based cloud computing platform technologies through R&D. As various data services have been available in the distributed computing environment, the distributed management of big data has become a major issue. In the various uses of big data, security vulnerability and privacy invasion may occur due to malicious attackers or inner users. In particular, various types of security vulnerability occur in the block access token, which is used for the permission control of the data block in Hadoop. To supplement the security vulnerability, a secret-sharing-based block access token management technique is suggested in this paper.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"374 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122787884","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":"Research on Construction of Tibetan Sentiment Corpus","authors":"Tao Huang, Xiaodong Yan","doi":"10.1109/BWCCA.2015.31","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.31","url":null,"abstract":"Sentiment classification is one of the research hot spots of Natural Language Processing. Compared with English and Chinese, it is hard for Tibetan to do some research of sentiment analysis because of the situation that we lack of related sentiment corpus. In this paper, we construct a Tibetan sentiment corpus by crawling from Tibetan website and artificial Chinese-Tibetan translation. The final corpus we build is basically reaching a experimental requirement. The corpus contains 10,134 Emotion sentences, including 2,025 artificial translation corpus, and 8109 corpus crawl through the network.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"676 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122972485","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":"Application of Neural Networks and Friedman Test for User Identification in Tor Networks","authors":"Taro Ishitaki, Tetsuya Oda, L. Barolli","doi":"10.1109/BWCCA.2015.88","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.88","url":null,"abstract":"Due to the amount of anonymity afforded to users of the Tor infrastructure, Tor has become a useful tool for malicious users. With Tor, the users are able to compromise the non-repudiation principle of computer security. Also, the potentially hackers may launch attacks such as DDoS or identity theft behind Tor. For this reason, there are needed new systems and models to detect or identify the bad behavior users in Tor networks. In this paper, we present the application of Neural Networks (NNs) and Friedman test for user identification in Tor networks. We used the Back-propagation NN and constructed a Tor server, a Deep Web browser (Tor client) and a Surface Web browser. Then, the client sends the data browsing to the Tor server using the Tor network. We used Wireshark Network Analyzer to get the data and then used the Back-propagation NN to make the approximation. We present many simulation results for different number of hidden units considering Tor client and Surface Web client. The simulation results show that our simulation system has a good approximation and can be used for user identification in Tor networks.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114258984","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":"Cluster-RLM: Establishing a Routing Path with Cluster-Based Redundant Link Minimization in Wireless Sensor Networks","authors":"Fang-Yie Leu, Sheng-Chieh Chuang","doi":"10.1109/BWCCA.2015.82","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.82","url":null,"abstract":"In a wireless sensor network, the flooding algorithm is often invoked to establish a routing path between a sensor node and the sink (base station). But this algorithm generates a lot of redundant packets, thus wasting unnecessary network resources and packet delivery energy. Researchers have then presented two solutions, Redundant Link Minimization (RLM for short) and Redundant Link Minimization-Triangle (RLM-T for short), to mitigate the mentioned phenomena. But both algorithms still have their own problems, e.g., many redundant packets still exist, meaning that the established routing-path can be further optimized. Therefore, in this paper, we propose an improved version, called the Cluster-based Redundant Link Minimization scheme (C-RLM for short), with which an event-driven wireless sensor network (EDWSN for short) can build its routing paths with less control packets and lower energy consumption than those of the two. Experimental results show that this method can effectively improve an EDWSN's throughputs and mitigate its packet delivery energy consumption.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129040376","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":"Semantic Data Analysis Algorithms Supporting Decision-Making Processes","authors":"L. Ogiela, M. Ogiela","doi":"10.1109/BWCCA.2015.108","DOIUrl":"https://doi.org/10.1109/BWCCA.2015.108","url":null,"abstract":"In this paper will be described the most important aspects of computer semantic data analysis processes, and theirs role in supporting decision-making tasks as well as intelligent management. Semantic data analysis is one of the most important areas in modern computer science, and may be dedicated for performing data analysis and understanding the meaning of analyzed information in the context of decision-making processes.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130591359","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}