{"title":"Motivating by Examples: An Empirical Study of Teaching an Introductory Software Engineering Course in Brazil","authors":"Rasha Osman, A. C. Dias-Neto","doi":"10.1109/COMPSAC.2014.33","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.33","url":null,"abstract":"Educators in emerging and developing countries face the challenge of conveying international software engineering concepts within their local contexts, cultures and environments. In Brazil, where the local software industry is domestically focused, this becomes a factor in the development and expansion of the local software industries. This paper investigates the issue of localization of software engineering education in the context of using localized examples in the teaching of an introductory software engineering course in Brazil. Results from student questionnaires illustrate that the use of examples familiar to the students' environment increased student motivation, participation and general positive perception and attitudes towards the teaching material and the learning experience. This paper contributes empirical evidence to justify further research into contextualization and localization of software engineering education.","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":"130680694","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}
Hirokazu Hasegawa, Yukiko Yamaguchi, Hajime Shimada, H. Takakura
{"title":"A Countermeasure Recommendation System against Targeted Attacks with Preserving Continuity of Internal Networks","authors":"Hirokazu Hasegawa, Yukiko Yamaguchi, Hajime Shimada, H. Takakura","doi":"10.1109/COMPSAC.2014.63","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.63","url":null,"abstract":"Recently, the sophistication of targeted cyber attacks makes conventional countermeasures useless to defend our network. Proper network design, i.e., Moderate segmentation and adequate access control, is one of the most effective countermeasures to prevent stealth activities of the attacks inside the network. By paying attention to the violation of the control, we can be aware of the existence of the attacks. In case that suspicious activities are found, we should adopt more strict design for further analysis and mitigation of damage. However, an organization must assume that its network administrators have full knowledge of its business and enough information of its network structure for selecting the most suitable design. This paper discusses a recommendation system to enhance the ability of a semi-automatic network design system previously proposed by us. Our new system evaluates on the viewpoint of two criteria, the effectiveness against malicious activities and the impact on business. The former takes the infection probability and hazardousness of communication into account and the latter considers the impact of the countermeasure which affects the organization's activities. By reviewing the candidate of the countermeasures with these criteria, the most suitable one to the organization can be selected.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"17 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":"126909593","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":"Adoption of Free Libre Open Source Software (FLOSS): A Risk Management Perspective","authors":"Ron S. Kenett, Xavier Franch, A. Susi, N. Galanis","doi":"10.1109/COMPSAC.2014.25","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.25","url":null,"abstract":"Free Libre Open Source Software (FLOSS) has become a strategic asset in software development, and open source communities behind FLOSS are a key player in the field. The analysis of open source community dynamics is a key capability in risk management practices focused on the integration of FLOSS in all types of organizations. We are conducting research in developing methodologies for managing risks of FLOSS adoption and deployment in various application domains. This paper is about the ability to systematically capture, filter, analyze, reason about, and build theories upon, the behavior of an open source community in combination with the structured elicitation of expert opinions on potential organizational business risk. The novel methodology presented here blends together qualitative and quantitative information as part of a wider analytics platform. The approach combines big data analytics with automatic scripting of scenarios that permits experts to assess risk indicators and business risks in focused tactical and strategic workshops. These workshops generate data that is used to construct Bayesian networks that map data from community risk drivers into statistical distributions that are feeding the platform risk management dashboard. A special feature of this model is that the dynamics of an open source community are tracked using social network metrics that capture the structure of unstructured chat data. The method is illustrated with a running example based on experience gained in implementing our approach in an academic smart environment setting including Mood bile, a Mobile Learning for Moodle (www.moodbile.org). This example is the first in a series of planned experiences in the domain of smart environments with the ultimate goal of deriving a complete risk model in that field.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"162 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":"122268741","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}
Saleh Almugrin, Waleed Albattah, Omar Alaql, Musaad Alzahrani, A. Melton
{"title":"Instability and Abstractness Metrics Based on Responsibility","authors":"Saleh Almugrin, Waleed Albattah, Omar Alaql, Musaad Alzahrani, A. Melton","doi":"10.1109/COMPSAC.2014.59","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.59","url":null,"abstract":"Over the last few decades, a lot of research has been done to measure software quality including using high-level design metrics to measure the quality of the design. R. C. Martin's metrics are some of the best-known software package metrics. Martin began with a set of object oriented design principles and designed his metrics based on these principles. In this paper we begin with Martin's principles and use them to modify his instability and abstractness metrics which were defined to identify poorly designed packages which are hard to maintain and reuse. We modify Martin's metrics based on the concept of responsibility, our motivation is that packages with different levels of responsibility should have different weights with respect to the instability and abstraction metrics. We present a case study to validate the modified metrics, the comparative study shows the differences between the proposed metrics and Martin's metrics. We found that the proposed instability and abstractness metrics are very promising and lead to improved results.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"56 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":"120991109","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":"The Issues of Solving Staffing and Scheduling Problems in Software Development Projects","authors":"D. C. Peixoto, G. Mateus, R. F. Resende","doi":"10.1109/COMPSAC.2014.96","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.96","url":null,"abstract":"Search-Based Software Engineering (SBSE) applies search-based optimization techniques in order to solve complex Software Engineering problems. In the recent years there has been a dramatic increase in the number of SBSE applications in areas such as Software Test, Requirements Engineering, and Project Planning. Our focus is on the analysis of the literature in Project Planning, specifically the researches conducted in software project scheduling and resource allocation. SBSE project scheduling and resource allocation solutions basically use optimization algorithms. Considering the results of a previous Systematic Literature Review, in this work, we analyze the issues of adopting these optimization algorithms in what is considered typical settings found in software development organizations. We found few evidence signaling that the expectations of software development organizations are being attended.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"18 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":"116576760","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":"Counterexample-Guided Abstraction Refinement for Component-Based Systems","authors":"Lianyi Zhang, Qingdi Meng, G. Luo","doi":"10.1109/COMPSAC.2014.28","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.28","url":null,"abstract":"Compositional verification of invariants is a technique for alleviating the state explosion problem in component-based verification. The efficiency of these methods depends on abstraction, which leads to verification incompleteness. In this paper, we present a unified framework that combines compositional abstraction and counterexample-guided abstraction refinement (CEGAR) to address this incompleteness problem. We propose two refinement approaches: invariant strengthening and state partitioning. In the case of a spurious counterexample, our proposed invariant strengthening approach refines the abstraction by eliminating the infeasible states. The state partitioning approach exploits the semantics of component based systems and obtains a more precise system. Any safety property that holds on the abstraction is guaranteed to hold on the model refined by the state partitioning approach. The examples and experiments in this paper show that our verification method can achieve conclusive results in the verification of safety properties with deadlock freedom in component-based systems.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"270 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":"134034910","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":"Comparing Control Flow Graphs of Binary Programs through Match Propagation","authors":"Hyun-il Lim","doi":"10.1109/COMPSAC.2014.84","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.84","url":null,"abstract":"In this paper, we present an approach to comparing control flow graphs of binary programs by matching their basic blocks. We first set up an initial match and propagate it to reach a stable state. We consider the matched pairs to identify overall similarities. To evaluate the proposed method, we perform experiments on real-world Java applications, and compare their performance with previous structural matching method. In the experimental results, the proposed method shows more reliable results than previous method at distinguishing similar control flow graphs.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"108 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":"117279696","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":"Trimming Test Suites with Coincidentally Correct Test Cases for Enhancing Fault Localizations","authors":"Xiaozhen Xue, Yulei Pang, A. Namin","doi":"10.1109/COMPSAC.2014.32","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.32","url":null,"abstract":"Although empirical studies have demonstrated the usefulness of statistical fault localizations based on code coverage, the effectiveness of these techniques may be deteriorated due to the presence of some undesired circumstances such as the existence of coincidental correctness where one or more passing test cases exercise a faulty statement and thus causing some confusion to decide whether the underlying exercised statement is faulty or not. Fault localizations based on coverage can be improved if all possible instances of coincidental correctness are identified and proper strategies are employed to deal with these troublesome test cases. We introduce a technique to effectively identify coincidentally correct test cases. The proposed technique combines support vector machines and ensemble learning to detect mislabeled test cases, i.e. Coincidentally correct test cases. The ensemble-based support vector machine then can be used to trim a test suite or flip the test status of the coincidental correctness test cases and thus improving the effectiveness of fault localizations.","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":"115107555","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":"Performance Evaluation of Reconfigurable TCP Communication on Wi-Fi Network Using GE Channel Model","authors":"N. Oguchi, S. Abe","doi":"10.1109/COMPSAC.2014.77","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.77","url":null,"abstract":"Recently, many commercial cloud-computing services have rapidly evolved to process and back up large volumes of data. With wireless broadband networks also gaining popularity, users increasingly access cloud services using mobile devices and wearable devices for interactive communication, such as remote desktops and augmented reality (AR) applications. In many cases, interactive applications use the TCP protocol between a server and a mobile device. However, end-to-end TCP sessions are easily influenced by packet losses in wireless networks and long delays on international lines, which may degrade communication quality. To cope with these problems, we propose a dynamic TCP communication method that improves the response for interactive communication by dynamically changing congestion control algorithms in accordance with changes in network quality and application characteristics. In this paper, we implement the proposed method on the NS-3 network simulator and evaluate it by using the GE (Gilbert-Eliott) channel model, assuming that the method is applied to a Wi-Fi network. We find that our method improves response time for interactive communication with a remote desktop to the level where users will not feel uncomfortable.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"33 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":"124825309","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":"Exploratory Performance Analysis of Microbot Swarm in Three-Dimensional Field","authors":"Shota Agemura, H. Ohsaki","doi":"10.1109/COMPSAC.2014.43","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.43","url":null,"abstract":"In the last decade, research and development of microbots, whose sizes are in the range between a few millimeters to centimeters, have been actively performed. One of promising applications of microbots is survivor discovery in disaster areas. Contrary to high expectations to many microbot applications, in the literature, exploratory performance with microbots and requirements on microbot functionalities have not been fully discussed. In this paper, we therefore analyze the exploratory performance of microbot swarm (i.e., A great number of autonomous and independent microbot) in a three-dimensional field where every microbot independently searches for target objects. We derive the target discovery ratio as well as the optimal dropping avoidance probability of microbots, with which each microbot probabilistically prevents itself to fall onto the lower layer using an edge-detection sensor. Moreover, through several numerical examples, we investigate how the exploratory performance of microbot swarm is affected by several system parameters such as the number of microbots, the area of a layer, the density of openings in the layer, and the dropping avoidance probability a microbot.","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":"123144038","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}