{"title":"FECAR: A Feature Selection Framework for Software Defect Prediction","authors":"Shulong Liu, Xiang Chen, Wangshu Liu, Jiaqiang Chen, Qing Gu, Daoxu Chen","doi":"10.1109/COMPSAC.2014.66","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.66","url":null,"abstract":"Software defect prediction can classify new software entities into either buggy or clean. However the effectiveness of existing methods is influenced by irrelevant and redundant features. In this paper, we propose a new feature selection framework FECAR using Feature Clustering And feature Ranking. This framework firstly partitions original features into k clusters based on FF-Correlation measure. Then it selects relevant features from each cluster based on FC-Relevance measure. In empirical study, we choose Symmetric Uncertainty as FF-Correlation measure, and choose Information Gain, Chi-Square, and Relief as three different FC-Relevance measures. Based on some real projects Eclipse and NASA, we implemented our framework and performed empirical studies to investigate the redundancy rate and the performance of the trained defect predictors. Final results verify the effectiveness of our proposed framework and further provide a guideline for achieving cost-effective feature selection when using our framework.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"9 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":"129202511","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":"Optimizing Non-orthogonal Space Distance Using PSO in Software Cost Estimation","authors":"Qin Liu, X. Chu, Jiakai Xiao, Hongming Zhu","doi":"10.1109/COMPSAC.2014.9","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.9","url":null,"abstract":"This paper proposes a method to optimize the Nonorthogonal Space Distance (NoSD) based on the Particle Swarm Optimization (PSO) algorithm so as to increase estimation accuracy in analogy-based software cost estimation. NoSD is a measure of projects similarity that uses a matrix defined based on mutual information to take both feature redundancies and feature weights into distance computation. We assumes that such definition based only on mutual information between features can hardly describe real-life software projects accurately, so we proposes this new method and improves NoSD using optimization techniques. In this proposed method, the matrix in NoSD is optimized by the PSO algorithm with the goal of minimizing estimation error at training stage. Based on this optimized matrix, which better fits real-life software projects, the distance definition can measure projects similarity more accurately and thus can greatly improve the estimation accuracy. Experiments have been conducted on two real-life software projects datasets (Desharnais and ISBSG R8) using the proposed method along with several other widely used methods including Euclidean, Manhattan, Minkowski, Mahalanobis, NoSD, and weighted Euclidean distance. Results show that this method brings notable improvements in estimation accuracy based on three widely used evaluation metrics: MMRE, MdMRE, and PRED(0.25).","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"215 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":"131691860","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":"Security with Privacy -- Opportunities and Challenges: Panel Position Paper","authors":"E. Bertino","doi":"10.1109/COMPSAC.2014.98","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.98","url":null,"abstract":"This paper summarizes opportunities and challenges concerning how we can achieve security while still ensuring privacy. It identifies research directions and includes a number of questions that have been debated by the panel.","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":"115760183","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":"On Architecture for QoS-Aware Packet Aggregation","authors":"Tomoaki Umeki, Y. Kitatsuji","doi":"10.1109/COMPSAC.2014.89","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.89","url":null,"abstract":"We propose a packet aggregation method to meet the QoS demands of packets traversing backbone network. The paper clarifies the requirements of the packet aggregation through a discussion of the future direction of the use of the IP networks for network service providers. The implementable architecture meeting the derived requirements are also proposed.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"73 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":"121615312","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 Low Cost Hierarchy-Awareness Extension of Skip Graph for World-Wide Range Retrievals","authors":"Xun Shao, M. Jibiki, Y. Teranishi, N. Nishinaga","doi":"10.1109/COMPSAC.2014.67","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.67","url":null,"abstract":"The rapid development of crowd sensing and cloud computing makes it possible to build world wide Cyber Physical Systems (CPS). Range queriable P2P overlay technologies are considered as promising candidate for realizing some important functionalities of CPS, for example, retrieval based on the properties of sensors. However, it is difficult to build world wide systems with existing range queriable P2Ps efficiently as the lack of proximity awareness. In this paper, we propose the hierarchical neighbor selection (HNS) mechanism for range queriable P2P overlays, which can integrate the hierarchy of physical Internet into overlay construction and routing to improve the performance. We also implement HNS based on Skip Graph (SG), an efficient range queriable P2P technology. With extensive simulations, we show that HNS based Skip Graph (HSG) can improve the routing latency and locality significantly with little overhead.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"34 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":"125435339","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}
Soshi Hirono, Yukiko Yamaguchi, Hajime Shimada, H. Takakura
{"title":"Development of a Secure Traffic Analysis System to Trace Malicious Activities on Internal Networks","authors":"Soshi Hirono, Yukiko Yamaguchi, Hajime Shimada, H. Takakura","doi":"10.1109/COMPSAC.2014.41","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.41","url":null,"abstract":"In contrast to conventional cyber attacks such as mass infection malware, targeted attacks take a long time to complete their mission. By using a dedicated malware for evading detection at the initial attack, an attacker quietly succeeds in setting up a front-line base in the target organization. Communication between the attacker and the base adopts popular protocols to hide its existence. Because conventional countermeasures deployed on the boundary between the Internet and the internal network will not work adequately, monitoring on the internal network becomes indispensable. In this paper, we propose an integrated sandbox system that deploys a secure and transparent proxy to analyze internal malicious network traffic. The adoption of software defined networking technology makes it possible to redirect any internal traffic from/to a suspicious host to the system for an examination of its insidiousness. When our system finds malicious activity, the traffic is blocked. If the malicious traffic is regarded as mandatory, e.g., For controlled delivery, the system works as a transparent proxy to bypass it. For benign traffic, the system works as a transparent proxy, as well. If binary programs are found in traffic, they are automatically extracted and submitted to a malware analysis module of the sandbox. In this way, we can safely identify the intention of the attackers without making them aware of our surveillance.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"105 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":"124057966","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":"Operation Support System Based on Augmented Reality Technology","authors":"Tatsuya Osawa, J. Shimamura, Y. Taniguchi","doi":"10.1109/COMPSAC.2014.88","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.88","url":null,"abstract":"In this paper, we propose a novel operation support system that utilizes the latest Augmented Reality (AR) technology. Our system consists of a tablet device equipped with a camera. The system automatically recognizes an appliance by reading a QR code captured by the camera and estimates the relative position and orientation between the appliance and the camera in real-time to augment the guidance information to the appliance. Experiments show that our system can stably track camera movement and augment guidance information.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"130 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":"124242920","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 Taxonomy for SLA-Based Monitoring of Cloud Security","authors":"D. Petcu","doi":"10.1109/COMPSAC.2014.50","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.50","url":null,"abstract":"A fast analysis of the state-of-the-art can show that SLA-based Cloud security monitoring services are not yet available. SLA-based Cloud monitoring services are oriented towards performance monitoring, while the current Cloud security monitoring is not SLA-based. In order to design and implement such a service a first step is the identification of the basic requirements. The taxonomies available for the fields of Cloud computing, monitoring, security and SLAs are expected to be used. This short note proposes a visual taxonomy intended to serve the design of an SLA-based Cloud security monitoring.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"10 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":"126437412","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}
Everton T. Guimarães, Alessandro F. Garcia, Yuanfang Cai
{"title":"Exploring Blueprints on the Prioritization of Architecturally Relevant Code Anomalies -- A Controlled Experiment","authors":"Everton T. Guimarães, Alessandro F. Garcia, Yuanfang Cai","doi":"10.1109/COMPSAC.2014.57","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.57","url":null,"abstract":"The progressive insertion of code anomalies in evolving programs may lead to architecture degradation symptoms. Several approaches have been proposed aiming to detect code anomalies in the source code, such as God Class and Shotgun Surgery. However, most of them fail to assist developers on prioritizing code anomalies harmful to the software architecture. These approaches often rely on source code analysis and do not provide developers with useful information to help the prioritization of those anomalies that impact on the architectural design. In this context, this paper presents a controlled experiment aiming at investigating how developers, when supported by architecture blueprints, are able to prioritize different types of code anomalies in terms of their architectural relevance. Our contributions include: (i) quantitative indicators on how the use of blueprints may improve process of prioritizing code anomalies, (ii) a discussion of how blueprints may help on the prioritization processes, (iii) an analysis of whether and to what extent the use of blueprints impacts on the time for revealing architecturally relevant code anomalies, and (iv) a discussion on the main characteristics of false positives and false negatives observed by the actual developers.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"629 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":"131617785","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":"Tackling Incomplete System Specifications Using Natural Deduction in the Paracomplete Setting","authors":"A. Bolotov, V. Shangin","doi":"10.1109/COMPSAC.2014.15","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.15","url":null,"abstract":"In many modern computer applications the significance of specification based verification is well accepted. However, when we deal with such complex processes as the integration of heterogeneous systems, parts of specification may be not known. Therefore it is important to have techniques that are able to cope with such incomplete information. An adequate formal setup is given by so called Para complete logics, where, contrary to the classical framework, for some statements we do not have evidence to conclude if they are true or false. As a consequence, for example, the law of excluded middle is not valid. In this paper we justify how the automated proof search technique for Para complete logic PComp can be efficiently applied to the reasoning about systems with incomplete information. Note that for many researchers, one of the core features of natural deduction, the opportunity to introduce arbitrary formulae as assumptions, has been a point of great scepticism regarding thievery possibility of the automation of the proof search. Here, not only we show the contrary, but we also turned the assumptions management into an advantage showing the applicability of the proposed technique to assume-guarantee reasoning.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"10 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":"133494829","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}