Huu-Noi Doan, Tuan-Anh Nguyen, Beomsu Kim, Min-Cheol Hong
{"title":"Directional hole filling algorithm in new view synthesis for 3D video using local segmentation","authors":"Huu-Noi Doan, Tuan-Anh Nguyen, Beomsu Kim, Min-Cheol Hong","doi":"10.1145/2663761.2664229","DOIUrl":"https://doi.org/10.1145/2663761.2664229","url":null,"abstract":"In this paper, a novel hole filling approach bases on the edge orientation for new view synthesis is presented. The hole pixels after warping processing are generated from the background pixels guided by the direction of edges. To obtain the better visual quality of the generated image at the free view point, the priority of each pixels on hole's boundary is first calculated, then the depth pixels in a local rectangle centered at high-priority pixel are segmented by k-means prior to apply filling process. Thus, the natural textures of virtual view over the hole can be archived in less blur and distortion. The experimental results show that the proposed method provides better performance objectively as well as subjectively.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"28 15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114509374","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":"Chunks and power allocation in OFDMA systems based on transient chaotic neural network","authors":"Haibo Zhang, Kaijian Liu, L. Mu, Fangwei Li","doi":"10.1145/2663761.2664209","DOIUrl":"https://doi.org/10.1145/2663761.2664209","url":null,"abstract":"The issue of dynamic resource allocation in OFDMA downlink system is investigated based on Rate Adaptive (RA) Principle. A two-step adaptive resource allocation algorithm is developed so as to reduce computational complexity. The proposed algorithm consists of chunks (a set of contiguous subcarriers) and power allocation. Firstly, in order to balance the total throughput of system and fairness among users, the number of chunks is allocated proportionally to users according to their service priorities. And under the assumption that power is allocated averagely to each subcarrier, chunks are allocated to each user by transient chaotic neural network (TCNN), which can find the optimal solution of predefined optimization problem through its rich neurodynamics. Secondly, power is reallocated to chunks by classical water-filling algorithm in order to further improve the performance of system. Simulation results show that the proposed algorithm can improve the throughput of system efficiently compared with the chunk-based resource allocation (CRA) and Average power allocation (APA) algorithm.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116507618","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":"Reducing scanning latency in WiMAX enabled VANETs","authors":"Syed Hassan Ahmed, S. Bouk, Dongkyun Kim","doi":"10.1145/2663761.2664190","DOIUrl":"https://doi.org/10.1145/2663761.2664190","url":null,"abstract":"WiMAX offers many promising features such as high data rate, low deployment cost and a wide coverage, which makes it suitable for Vehicular Ad hoc NETworks (VANETs). However, a smooth handover for various real-time applications supported by VANETs is a challenge. In this paper, we therefore propose an efficient network assisted handover scheme which reduces the scanning latency faced by vehicles during handover process. During handover, a serving RSU will perform the selection and pre-authorization of a target RSU for a vehicle based on its velocity. In addition, the serving RSU also provides the vehicle with channel information and estimated time to start scanning in order to get associated with its target RSU. Through NS-2 simulations, it is observed that our proposed scheme efficiently reduces the overall scanning delay and iterations commonly faced by vehicles.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123948493","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":"An effective VM migration scheme for reducing resource fragments in cloud data centers","authors":"Hsueh-Wen Tseng, Ruei-Yu Wu, T. Chang","doi":"10.1145/2663761.2664205","DOIUrl":"https://doi.org/10.1145/2663761.2664205","url":null,"abstract":"Data center is an essential infrastructure in cloud computing which offers different types of resources for the services of cloud computing. An important issue is how to effectively use the resources in data centers. In order to improve resource utilization, virtualization techniques have been widely used in data centers. Several virtual machines (VMs) are concentrated on a server, and resource utilization of server can be promoted effectively. However, server utilization is inefficient in data centers. In this paper, we investigate how to reduce resource fragments and allocated resources in data centers. Hence, we propose a new scheme to estimate VM migration to effectively reduce resource fragments and allocated resources. The scheme improves the server utilization in data centers. Moreover, our proposed scheme can be applied to multiple resources. We use 5800 servers to proceed VM migrations in the simulation experiments. The simulation results show our scheme reduces 8% resource fragments and 3% allocated resources.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124211606","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":"Investigating gesture-based password: usability and vulnerability to shoulder-surfing attacks","authors":"Lakshmidevi Sreeramareddy, Sheng Miao, Jinjuan Feng","doi":"10.1145/2663761.2664207","DOIUrl":"https://doi.org/10.1145/2663761.2664207","url":null,"abstract":"The recognition-based password such as graphical passwords provides great potential to reduce the memory load for the user. In addition, graphical passwords provide a security benefit over dictionary attacks compared to traditional alphanumeric passwords. However, the graphical passwords inhibit several well-known limitations such as vulnerability to shoulder-surfing attacks. We developed a gesture-based password and conducted a user study to evaluate the usability of this password as well as the impact of shoulder-surfing attacks. The result suggests that users can easily learn the new password method. Although difference was detected between authenticated entries and unauthenticated entries in features such as confidence scores, the classification accuracy of the preliminary machine learning analysis is not high. We will include more features and explore other machine learning techniques in our future studies.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122303493","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":"Adaptive cache compression for non-volatile memories in embedded system","authors":"J. Choi, Jong Wook Kwak, S. Jhang, C. Jhon","doi":"10.1145/2663761.2663764","DOIUrl":"https://doi.org/10.1145/2663761.2663764","url":null,"abstract":"Cache compression has been studied to increase the effective cache size by storing the cache blocks in a compressed form in the cache. However, it also generates additional write operations during the compressing and compacting of cache blocks. Since increasing the write operations leads to a surging of dynamic energy consumption and a shortening of the lifetime of the cache in the Non-Volatile Memory (NVM) based Last-Level Cache (LLC), it is needed to balance the extra write operations against the performance improvement. In this paper, we identify that cache compression is not always efficient for NVM-based LLC. In light of the analysis, we propose Adaptive Cache Compression for NVM (ACCNVM) whose cache block is only compressed when cache compression is efficient. The result shows that our proposal achieves a 16.4% energy savings and a 19.1% lifetime extension with respect to the cache, which uses a state-of-the-art cache compression scheme.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"s1-12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127192789","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}
Paul Moulema, Wei Yu, Guobin Xu, D. Griffith, N. Golmie, Chao Lu, D. Su
{"title":"On simulation study of mesh-based protocols for smart grid communication networks","authors":"Paul Moulema, Wei Yu, Guobin Xu, D. Griffith, N. Golmie, Chao Lu, D. Su","doi":"10.1145/2513228.2513255","DOIUrl":"https://doi.org/10.1145/2513228.2513255","url":null,"abstract":"The smart grid requires a reliable, efficient and cost effective two-way communication network that meets performance requirements. Due to their cost effectiveness and ubiquitous nature, wireless mesh networks have been considered as a viable solution for smart grid communication networks. In this paper, we first review smart grid communication network requirements using various use cases that enables the design of network models for simulation. Using the ns-3 simulator tool, we then systematically compare the effectiveness of two representative wireless mesh network protocols: Hybrid Wireless Mesh Network Protocol (HWMP) and Ad hoc On-Demand Distance Vector (AODV) Protocol in terms of various performance metrics and network settings. Our evaluation results show that HWMP protocol is suitable for small size mesh grids while AODV performs better for large mesh grids.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117150283","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 boosted SVM based sentiment analysis approach for online opinionated text","authors":"Anuj Sharma, S. Dey","doi":"10.1145/2513228.2513311","DOIUrl":"https://doi.org/10.1145/2513228.2513311","url":null,"abstract":"The opinionated text available on the Internet and Web 2.0 social media has created ample research opportunities related to mining and analyzing public sentiments. At the same time, the large volume of such data poses severe data processing and sentiment extraction related challenges. Different contemporary solutions based on machine learning, dictionary, statistical, and semantic based approaches have been proposed in literature for sentiment analysis of online user-generated data. Recent research studies have proved that supervised machine learning techniques like Naive Bayes (NB) and Support Vector Machines (SVM) are very effective for sentiment based classification of opinionated text. This paper proposes a hybrid sentiment classification model based on Boosted SVM. The proposed model exploits classification performance of two techniques (Boosting and SVM) applied for the task of sentiment based classification of online reviews. The results on movies and hotel review corpora of 2000 reviews have shown that the proposed approach has succeeded in improving performance of SVM when used as a weak learner for sentiment based classification. Specifically, the results show that SVM ensemble with bagging or boosting significantly outperforms a single SVM in terms of accuracy of sentiment based classification.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114184611","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":"Scheduling algorithm with energy-response trade-off considerations for mixed task sets","authors":"Chin-Fu Kuo, Lieng-Cheng Chien, Yung-Feng Lu","doi":"10.1145/2513228.2513236","DOIUrl":"https://doi.org/10.1145/2513228.2513236","url":null,"abstract":"This paper aims to investigate the scheduling problem of a mixed task set consisting of periodic tasks and aperiodic jobs in a real-time system. When a mixed task set is executed, a scheduling algorithm has to consider not only the system energy consumption but also the response time of the aperiodic jobs which do not want to be prolonged seriously. This paper proposes the Ratio Reclaim Algorithm (RRA) that reclaims the unused execution time for periodic jobs based on a user-defined ratio. For the convenience of maintaining effectively unused execution time left by early completed jobs, the earliness-queue is presented to reduce the memory space that the earliness-queue occupies. A series of experiments are conducted to evaluate the proposed algorithm. The experimental results demonstrate that the RRA scheme with a suitable user-defined value has a better performance than the compared scheme.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128593576","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":"Memory hacking analysis in mobile devices for hybrid model of copyright protection for Android apps","authors":"Hoon Lee, H. S. Chung, Sung-Ryul Kim","doi":"10.1145/2513228.2513312","DOIUrl":"https://doi.org/10.1145/2513228.2513312","url":null,"abstract":"Google's Android platform is a widely used operating system for mobile phones and a fully commercial application (App) market has been established. However, because of the easy access to Android internal files, unlicensed Android Apps are widely being distributed. To protect the intellectual property of Android developers, various techniques are being proposed that can prevent the illegal access to Apps [6]. But all current techniques ignore the possibility of memory hacking. We show by example that memory hacking is actually possible on Android devices. In this paper we especially focused on the possibility of memory hacking and show that it is indeed possible, which shows that the memory hacking factor has to be included in the security analysis of current protection systems.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129062294","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}