2014 IEEE 38th Annual Computer Software and Applications Conference最新文献_第5页

Emergence of Fractals in Social Networks: Analysis of Community Structure and Interaction Locality 社会网络中分形的出现:社区结构与互动局部性分析

2014 IEEE 38th Annual Computer Software and Applications Conference Pub Date : 2014-07-21 DOI: 10.1109/COMPSAC.2014.80

Sho Tsugawa, H. Ohsaki

{"title":"Emergence of Fractals in Social Networks: Analysis of Community Structure and Interaction Locality","authors":"Sho Tsugawa, H. Ohsaki","doi":"10.1109/COMPSAC.2014.80","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.80","url":null,"abstract":"Research on social network analysis (SNA) has been actively pursued. Most SNAs focus on either social relationship networks (e.g., Friendship and trust networks) or social interaction networks (e.g., Email and phone call networks). It is expected that the social relationship network and social interaction network of a group would be closely related to each other. For instance, people in the same community in a social relationship network are expected to communicate with each other more frequently than with people in different communities. To the best of our knowledge, however, there is not yet any empirical evidence to support the existence of such interaction locality in large-scale online social networks. This paper aims to bridge the evidence gap between intuition about interaction locality and confirmation that it occurs. We investigate the strength of interaction locality in large-scale social networks by analyzing several types of data: logs of mobile phone calls, email messages, and message exchanges in a social networking service. Our results show that strong interaction locality is observed equally in the three datasets and suggest that the strength of the interaction locality is fractal, by which we mean that the strength is invariant with regard to the scale of the community.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125149246","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

PF-Miner: A New Paired Functions Mining Method for Android Kernel in Error Paths PF-Miner:一种新的Android内核错误路径配对函数挖掘方法

2014 IEEE 38th Annual Computer Software and Applications Conference Pub Date : 2014-07-21 DOI: 10.1109/COMPSAC.2014.10

Hu-Qiu Liu, Yuping Wang, Lingbo Jiang, Shimin Hu

{"title":"PF-Miner: A New Paired Functions Mining Method for Android Kernel in Error Paths","authors":"Hu-Qiu Liu, Yuping Wang, Lingbo Jiang, Shimin Hu","doi":"10.1109/COMPSAC.2014.10","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.10","url":null,"abstract":"Drivers are significant components of the operating systems(OSs), and they run in kernel mode. Generally, drivers have many errors to handle, and the functions called in the normal execution paths and error handling paths are in pairs, which are named as paired functions. However, some developers do not handle the errors completely as they forget about or are unaware of releasing the acquired resources, thus memory leaks and other potential problems can be easily introduced. Therefore, it is highly valuable to automatically extract paired functions for these problems and detect violations for the programmers. This paper proposes an efficient tool named PF-Miner, which can automatically extract paired functions and detect violations between normal execution paths and error handling paths from the source code of C program with the data mining and statistical methods. We have evaluated PF-Miner on different versions of Android kernel 2.6.39 and 3.10.0, and 81 bugs reported by PF-Miner in 2.6.39 have been fixed before the latest version 3.10.0. PF-Miner only needs about 150 seconds to analyze the source code of 3.10.0, and 983 violations have been detected from 546 paired functions that have been extracted. We have reported the top 51 violations as potential bugs to the developers, and 15 bugs have been confirmed.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120965507","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}

引用次数: 14

A Mutual Information-Based Hybrid Feature Selection Method for Software Cost Estimation Using Feature Clustering 基于特征聚类的基于互信息的混合特征选择方法

2014 IEEE 38th Annual Computer Software and Applications Conference Pub Date : 2014-07-21 DOI: 10.1109/COMPSAC.2014.99

Qin Liu, Shihai Shi, Hongming Zhu, Jiakai Xiao

{"title":"A Mutual Information-Based Hybrid Feature Selection Method for Software Cost Estimation Using Feature Clustering","authors":"Qin Liu, Shihai Shi, Hongming Zhu, Jiakai Xiao","doi":"10.1109/COMPSAC.2014.99","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.99","url":null,"abstract":"Feature selection methods are designed to obtain the optimal feature subset from the original features to give the most accurate prediction. So far, supervised and unsupervised feature selection methods have been discussed and developed separately. However, these two methods can be combined together as a hybrid feature selection method for some data sets. In this paper, we propose a mutual information-based (MI-based) hybrid feature selection method using feature clustering. In the unsupervised learning stage, the original features are grouped into several clusters based on the feature similarity to each other with agglomerative hierarchical clustering. Then in the supervised learning stage, the feature in each cluster that can maximize the feature similarity with the response feature which represents the class label is selected as the representative feature. These representative features compose the feature subset. Our contribution includes 1)the newly proposed feature selection method and 2)the application of feature clustering for software cost estimation. The proposed method employs wrapper approaches, so it can evaluate the prediction performance of each feature subset to determine the optimal one. The experimental results in software cost estimation demonstrate that the proposed method can outperform at least 11.5% and 14.8% than the supervised feature selection method INMIFS and mRMRFS in ISBSG R8 and Desharnais data set in terms of PRED (0.25) value.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131713985","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

An SLA-Driven Cache Optimization Approach for Multi-tenant Application on PaaS PaaS上多租户应用的sla驱动缓存优化方法

2014 IEEE 38th Annual Computer Software and Applications Conference Pub Date : 2014-07-21 DOI: 10.1109/COMPSAC.2014.21

Huihong He, Zhiyi Ma, Hongjie Chen, Dan Wu, Huanhuan Liu, W. Shao

{"title":"An SLA-Driven Cache Optimization Approach for Multi-tenant Application on PaaS","authors":"Huihong He, Zhiyi Ma, Hongjie Chen, Dan Wu, Huanhuan Liu, W. Shao","doi":"10.1109/COMPSAC.2014.21","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.21","url":null,"abstract":"As multi-tenant applications spring up in clouds, more and more people advocate using Service Level Agreement (SLA) in service delivery to fit tenants' non-functional needs e.g. Response time and budget limit. However, most of the present application optimizations based on SLA focuses on virtual machine-based (VM-based) computing service, while other services such as storage and cache are often neglected. In this paper, we propose an SLA-driven application optimization for cache service to help to meet tenants' needs better and improve cost-effectiveness, which can be taken as complementary to the existing work. The proposed approach, built on top of Platform-as-a-Service (PaaS), pays attention to evicted data. It considers both tenant SLA-evaluated status and data performance when weighting the evicted data with re-cache likelihoods, and then adjusts their re-cache priorities. At the beginning of every cycle it predicts tenant status and evicted data performance for the coming cycle by Holt-Winters double exponential smoothing. Our simulation experiments demonstrate the optimization effectiveness in improving cache cost-effectiveness and satisfying tenant SLAs.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126529621","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

A Lightweight Virtual Machine Image Deduplication Backup Approach in Cloud Environment 云环境下轻量级虚拟机映像重复数据删除备份方法

2014 IEEE 38th Annual Computer Software and Applications Conference Pub Date : 2014-07-21 DOI: 10.1109/COMPSAC.2014.73

Jiwei Xu, Wen-bo Zhang, Shiyang Ye, Jun Wei, Tao Huang

{"title":"A Lightweight Virtual Machine Image Deduplication Backup Approach in Cloud Environment","authors":"Jiwei Xu, Wen-bo Zhang, Shiyang Ye, Jun Wei, Tao Huang","doi":"10.1109/COMPSAC.2014.73","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.73","url":null,"abstract":"As most clouds are based on virtualization technology, more and more virtual machine images are created within data centers. Depending on the need of disaster recovery, the storage space used for backup would easily sprawl to a TB or PB level with the growth of images. Unfortunately, different images have a large amount of same data segments. Those duplicated data segments will lead to serious waste of storage resource. Although there is a lot of work focus on deduplication storage and could achieve a good result in removing duplicate copies, they are not very suitable for virtual machine image deduplication in a cloud environment. Because huge resource usage of deduplication operations could lead to serious performance interference to the hosting virtual machines. This paper propose a local deduplication method which can speed up the operation progress of virtual machine image deduplication and reduce the operation time. The method is based on an improved k-means clustering algorithm, which could classify the metadata of backup image to reduce the search space of index lookup and improve the index lookup performance. Experiments show that our approach is robust and effective. It can significantly reduce the performance interference to hosting virtual machine with an acceptable increase in disk space usage.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116895135","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}

引用次数: 21

VertexRank: Importance Rank for Software Network Vertices VertexRank:软件网络顶点的重要性等级

2014 IEEE 38th Annual Computer Software and Applications Conference Pub Date : 2014-07-21 DOI: 10.1109/COMPSAC.2014.34

Huan Luo, Yuan Dong, Yiying Ng, Shengyuan Wang

{"title":"VertexRank: Importance Rank for Software Network Vertices","authors":"Huan Luo, Yuan Dong, Yiying Ng, Shengyuan Wang","doi":"10.1109/COMPSAC.2014.34","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.34","url":null,"abstract":"Finding the critical components of software system is very important for software comprehension, operation and maintenance. We propose Vertex Rank, a method to rank the importance of vertices of software network. The complexity of the algorithm to compute Vertex Rank is proportional to the sum of the number of edges and vertices. And, it converges quickly at an ideal deviation within limited iterations. Vertex Rank captures the essence of software network by utilizing software entry point during calculation. We compare Vertex Rank with widely used ranking measures, degree, betweenness centrality, Page Rank and Component Rank, result shows that it is a more appropriate measure for software network because it better differentiates the various roles that vertices play in network as it utilizes the characteristic of software entry points. It not only finds the most important vertices more accurately, but also makes clear distinction between less important ones and completely excludes the unused ones. We test Vertex Rank on real-world open source software systems and find that the functionality of vertex greatly affect its Vertex Rank value, there is a strong positive correlation between in degree and Vertex Rank, and Vertex Rank ranking highly coincides with reuse.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125270900","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

Cider: An Event-Driven Continuous Integration Server Cider:事件驱动的持续集成服务器

2014 IEEE 38th Annual Computer Software and Applications Conference Pub Date : 2014-07-21 DOI: 10.1109/COMPSAC.2014.53

Ondrej Kupka, F. Zavoral

引用次数: 3

CrowdAdaptor: A Crowd Sourcing Approach toward Adaptive Energy-Efficient Configurations of Virtual Machines Hosting Mobile Applications CrowdAdaptor:面向托管移动应用程序的虚拟机的自适应节能配置的众包方法

2014 IEEE 38th Annual Computer Software and Applications Conference Pub Date : 2014-07-21 DOI: 10.1109/COMPSAC.2014.72

Edward Y. Y. Kan, W. Chan, T. Tse

{"title":"CrowdAdaptor: A Crowd Sourcing Approach toward Adaptive Energy-Efficient Configurations of Virtual Machines Hosting Mobile Applications","authors":"Edward Y. Y. Kan, W. Chan, T. Tse","doi":"10.1109/COMPSAC.2014.72","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.72","url":null,"abstract":"Applications written by end-user programmers are hardly energy-optimized by these programmers. The end users of such applications thus suffer significant energy issues. In this paper, we propose CrowdAdaptor, a novel approach toward locating energy-efficient configurations to execute the applications hosted in virtual machines on handheld devices. CrowdAdaptor innovatively makes use of the development artifacts (test cases) and the very large installation base of the same application to distribute the test executions and performance data collection of the whole test suites against many different virtual machine configurations among these installation bases. It synthesizes these data, continuously discovers better energy-efficient configurations, and makes them available to all the installations of the same applications. We report a multi-subject case study on the ability of the framework to discover energy-efficient configurations in three power models. The results show that Crowd Adaptor can achieve up to 50% of energy savings based on a conservative linear power model.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114828580","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

A Distributed Topic-Based Pub/Sub Method for Exhaust Data Streams towards Scalable Event-Driven Systems 面向可扩展事件驱动系统的基于分布式主题的数据流发布/订阅方法

2014 IEEE 38th Annual Computer Software and Applications Conference Pub Date : 2014-07-21 DOI: 10.1109/COMPSAC.2014.44

Ryohei Banno, Susumu Takeuchi, M. Takemoto, T. Kawano, Takashi Kambayashi, M. Matsuo

{"title":"A Distributed Topic-Based Pub/Sub Method for Exhaust Data Streams towards Scalable Event-Driven Systems","authors":"Ryohei Banno, Susumu Takeuchi, M. Takemoto, T. Kawano, Takashi Kambayashi, M. Matsuo","doi":"10.1109/COMPSAC.2014.44","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.44","url":null,"abstract":"Distributed pub/sub messaging has become indispensable for event-driven systems. There are methods for achieving high scalability regarding topic-based pub/sub by using structured overlay networks. However, these methods waste network resources concerning \"exhaust data,\" which have low or no value most of the time. There are at least two problems: each publisher node continues to forward data to a relay node even if there are no subscribers, and multicast trees are constructed which are excessively large for low value data, namely having a small number of subscribers. In this paper, we formulate the requirements of overlay networks by defining a property called \"strong relay-free\" as an expansion of relay-free property, and propose a practical method satisfying the property by using Skip Graph. The proposed method involves publishers and subscribers composing connected sub graphs to enable detecting the absence of subscribers and autonomously adjusting the tree size. Through simulation experiments, we confirmed that the proposed method can suspend publishing adaptively, and shorten the path length on multicast trees by more than 75% under an experimental condition with 100,000 nodes. The proposed method is competent for decentralized event-driven systems with encouraging the locally produced data to be consumed locally.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114839896","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}

引用次数: 8

Empirically Based Evolution of a Variability Management Approach at UML Class Level 基于经验的UML类级别可变性管理方法的演进

2014 IEEE 38th Annual Computer Software and Applications Conference Pub Date : 2014-07-21 DOI: 10.1109/COMPSAC.2014.58

A. Marcolino, E. Oliveirajr, I. Gimenes, E. Barbosa

引用次数: 15