{"title":"A neighbor selection method based on network community detection for collaborative filtering","authors":"Lin-Rong Guo, Qinke Peng","doi":"10.1109/ICIS.2014.6912122","DOIUrl":"https://doi.org/10.1109/ICIS.2014.6912122","url":null,"abstract":"The neighbor selection that determines which users are exploited to estimate a target user's ratings has an important influence on the accuracy of recommendations of collaborative filtering based recommender system. Two kinds of ways for neighbor selection: KNN and cluster-based, are lack of specificity which refers to selecting different appropriate neighbors for different given target users, and thus limit the accuracy of recommendation. Therefore, in this paper, firstly, we propose a method that employs the evolutionary algorithm to optimize neighbors for all target users. Secondly, overcoming the high time complexity of the first one, we present another approach in which community detection algorithm is utilized as a preprocessing, and then the evolution algorithm is employed to optimize the neighborhood size for every community. We present experiments on a standard benchmark data-set, and the results show that the two methods both realize the specificity in neighbor selection, and accordingly lead to a higher accuracy of recommendations. Besides, the second one makes a good compromise between the specificity and time complexity.","PeriodicalId":237256,"journal":{"name":"2014 IEEE/ACIS 13th International Conference on Computer and Information Science (ICIS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123937782","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}
Pengcheng Wang, Kang Zhang, Xiao-Xu Song, Tianyi Zhou, Dongwei Gong
{"title":"Geometry based visualization of hierarchical structures","authors":"Pengcheng Wang, Kang Zhang, Xiao-Xu Song, Tianyi Zhou, Dongwei Gong","doi":"10.1109/ICIS.2014.6912178","DOIUrl":"https://doi.org/10.1109/ICIS.2014.6912178","url":null,"abstract":"Hierarchical structures are a common organization of data in the real world. In this paper, we propose a new type of tree structures called diamond tree to present the organization and relationship of hierarchical data. We design a spatial layout using the geometric theory, starting with a simple design and continually improving until the design that makes the best use of the screen estate. Finally, we use the diamond tree method to analyze the structure of Tianjin University website (www.tju.edu.cn).","PeriodicalId":237256,"journal":{"name":"2014 IEEE/ACIS 13th International Conference on Computer and Information Science (ICIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130844787","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":"Simulation of a Semantic Web data sharing system based on NS-3","authors":"Qi Huang, Jing Zhou, Lei Shi, Wei Yan","doi":"10.1109/ICIS.2014.6912168","DOIUrl":"https://doi.org/10.1109/ICIS.2014.6912168","url":null,"abstract":"A recent study came up with an ad-hoc Semantic Web data sharing system. The system was designed for users to share Semantic Web data in an ad-hoc network without any central sharing service. For this purpose, the study proposed the storage format, network structure, and lookup method for the system. In this paper, we demonstrate how to implement a simulation of the Semantic Web data sharing system based on NS3, which is a full-range open-source network simulator, to evaluate the performance at the network level, and to find out certain issues we ought to address in the future for the system.","PeriodicalId":237256,"journal":{"name":"2014 IEEE/ACIS 13th International Conference on Computer and Information Science (ICIS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116933054","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":"Profit-driven resource scheduling for virtualized cloud systems","authors":"Shiyang Ye, Tao Wang, Wen-bo Zhang, Hua Zhong","doi":"10.1109/ICIS.2014.6912145","DOIUrl":"https://doi.org/10.1109/ICIS.2014.6912145","url":null,"abstract":"Virtualized resource renting is a key issue in IaaS (Infrastructure-as-a-Service) cloud systems. Suitable resource allocation improves resource utilization and increases profit for application providers. The application provider will obtain better revenues according to the Service Level Agreement (SLA), if they rent more virtual resources. However, they will invest much more capital for renting these virtual resources. How many resources a provider rents has become a key thing for cloud applications. This paper addresses the reconciliation objectives by proposing a profit-driven resource scheduling method for virtualized cloud systems. Compared with traditional methods, our method aims at maximizing the revenues by introducing SLA and the cost of renting cloud resource, instead of increasing resource utilization or decreasing early finishing time. We model the performance of applications with queueing theory; calculate the revenues according to the SLA and renting cost; adjust the amount of virtual resources to adapt to dynamic workloads in period. We have implemented a framework for scheduling virtual resources, and applied it in our IaaS cloud platform OnceCloud. The experimental results demonstrate that our method has advantages over existing ones in revenues.","PeriodicalId":237256,"journal":{"name":"2014 IEEE/ACIS 13th International Conference on Computer and Information Science (ICIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125721281","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":"Joint speech/audio coding based scalable perceptual audio coding","authors":"Li Gao, R. Hu, Yuhong Yang","doi":"10.1109/ICIS.2014.6912172","DOIUrl":"https://doi.org/10.1109/ICIS.2014.6912172","url":null,"abstract":"With the technical evolution of global mobile communications, various heterogeneous communication environments, frequently fluctuant bandwidth and multiform signals put new challenges to coding technology of multimedia signals. Scalable Audio Coding (SAC) can provide smooth transition between different coding qualities, which is an optimal choice for coding audio signals of different types and can produce more reliable and consistent service quality in multimedia communications. A scalable audio coding system based on joint speech/audio coding method and an auditory perceptual importance model based on bit-plane are proposed here. Both the audio content and the network bandwidth fluctuation will be considered in the system to obtain stable service qualities in mobile multimedia services. Experimental results indicate that with the same bit rates the subjective quality of proposed method is slightly better than G.729.1 and the SNR is improved by 0.3dB.","PeriodicalId":237256,"journal":{"name":"2014 IEEE/ACIS 13th International Conference on Computer and Information Science (ICIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113962535","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}
Jie Zhu, Juanjuan Li, Erikson Hardesty, Hai Jiang, Kuan-Ching Li
{"title":"GPU-in-Hadoop: Enabling MapReduce across distributed heterogeneous platforms","authors":"Jie Zhu, Juanjuan Li, Erikson Hardesty, Hai Jiang, Kuan-Ching Li","doi":"10.1109/ICIS.2014.6912154","DOIUrl":"https://doi.org/10.1109/ICIS.2014.6912154","url":null,"abstract":"As the size of high performance applications increases, four major challenges including heterogeneity, programmability, failure resilience, and energy efficiency have arisen in the underlying distributed systems. To tackle with all of them without sacrificing performance, traditional approaches in resource utilization, task scheduling and programming paradigm should be reconsidered. As Hadoop has handled data-intensive applications well in Clouds, GPU has demonstrated its acceleration effectiveness for computation-intensive ones. This paper intends to integrate Hadoop with CUDA to exploit both CPU and GPU resources. Hadoop will schedule MapReduce's Map and Reduce functions across multiple nodes, whereas CUDA code helps accelerate them further on local GPUs. All available heterogeneous computational power will be utilized. MapReduce in Hadoop will ease the programming task by hiding communication details. Hadoop Distributed File System will help achieve data-level fault resilience. GPU's energy efficiency characteristics help reduce the power consumption of the whole system. To achieve Hadoop and GPU integration, four approaches including Jcuda, JNI, Hadoop Streaming, and Hadoop Pipes, have been accomplished. Experimental results have demonstrated their effectiveness.","PeriodicalId":237256,"journal":{"name":"2014 IEEE/ACIS 13th International Conference on Computer and Information Science (ICIS)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124145384","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":"Automatically generating abstract paintings in Malevich Style","authors":"Wenyuan Tao, Yaxuan Liu, Kang Zhang","doi":"10.1109/ICIS.2014.6912134","DOIUrl":"https://doi.org/10.1109/ICIS.2014.6912134","url":null,"abstract":"This paper presents an approach of automatically generating abstract paintings of Malevich Style. Through parameterized program and flexible production processes, we successfully generated images mimicking the styles of the abstract artist Kazimir Malevich, having classified different styles of his paintings. The generated results using the basic components in Malevich's style based on his art theory are shown and the reason why some colors are chosen are also discussed.","PeriodicalId":237256,"journal":{"name":"2014 IEEE/ACIS 13th International Conference on Computer and Information Science (ICIS)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114650199","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}