2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)最新文献

{"title":"Adaptive Resource Allocation of Multiple Servers for Service-Based Systems in Cloud Computing","authors":"Siqian Gong, Beibei Yin, Wenlong Zhu, K. Cai","doi":"10.1109/COMPSAC.2017.43","DOIUrl":"https://doi.org/10.1109/COMPSAC.2017.43","url":null,"abstract":"Due to the advantages of cloud computing, it has been adopted as deployment platform of SBS (Service-based Systems). It also provides an elastic \"pay-as-you-go\" mode, which creates new resource allocation challenge that satisfying the QoS (Quality of Service) requirements with least resource allocation. There has been much interest in using feedback control to make resource allocation, but these works focus on a single control that does not take the interactions between servers share and compete for the same resource pool. In this paper, we present an adaptive resource allocation approach for SBS in the cloud environment using MIMO (Multi-Input and Multi-Output) control to allocate resource to multiple servers according to multiple workloads. The experimental results show that our approach can ensure the QoS with least resource allocation and increase the resource utilization.","PeriodicalId":6556,"journal":{"name":"2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)","volume":"63 1","pages":"603-608"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86076500","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":"Tele-operation of Robot Teams: A Comparison of Gamepad-, Mobile Device and Hand Tracking-Based User Interfaces","authors":"Stefano Bonaiuto, Alberto Cannavò, Giovanni Piumatti, G. Paravati, F. Lamberti","doi":"10.1109/COMPSAC.2017.278","DOIUrl":"https://doi.org/10.1109/COMPSAC.2017.278","url":null,"abstract":"Due to the continuous advancements made in robot technologies, the development of intuitive and effective user interfaces for human-robot interaction is getting increasingly important. This paper investigates how different types of interfaces can be used for allowing a single operator to remotely control a team of robots endowed with different capabilities. Attention is focused on three user interfaces based on a gamepad, on a mobile device and on hand tracking, respectively. To evaluate pros and cons of the above interfaces, a user study was conducted, in which participants had to combine the capabilities of a rover, a drone and a robotic arm in order to carry out a search and pick task. Based on the experiments, the fastest way to complete the task was to use the mobile device. However, results showed that some of the interfaces could provide better performances for selected robots and associated sub-tasks. It is worth observing that, despite evidences about efficiency, participants rated the gamepad as the preferred interface from the point of view of subjective usability.","PeriodicalId":6556,"journal":{"name":"2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)","volume":"41 1","pages":"555-560"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81504986","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":"Evaluating the Use of Virtual Reality on Professional Robotics Education","authors":"Mauro Cesar Charao dos Santos, Vicenzo Abichequer Sangalli, M. Pinho","doi":"10.1109/COMPSAC.2017.121","DOIUrl":"https://doi.org/10.1109/COMPSAC.2017.121","url":null,"abstract":"This work consists of the study of techniques of robotics and virtual reality to develop a simulator that can be used in robotics schools, having an adequate visualization and a simple and intuitive way of interaction. For this, a 3D virtual environment for robotics was developed. Virtual reality resources have been incorporated to improve the visualization and to facilitate the user interaction with the environment. In order to evaluate the effectivity of the environment, user experiments were carried out on four different hardware configurations. During the simulations, the users had to create trajectories while implicitly defining reference points. From these experiments, automatic reports for the quantitative questions were generated, and questionnaires were filled for the qualitative questions. The results have shown that the use of virtual reality do helps the users in task execution, improving the visualization, reducing the time spent for the tasks and increasing the precision.","PeriodicalId":6556,"journal":{"name":"2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)","volume":"69 1","pages":"448-455"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86744126","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":"Incremental Annotate-Generalize-Search Framework for Interactive Source Code Comprehension","authors":"Ken Nakayama, S. Tano, T. Hashiyama, Eko Sakai","doi":"10.1109/COMPSAC.2017.147","DOIUrl":"https://doi.org/10.1109/COMPSAC.2017.147","url":null,"abstract":"Understanding unfamiliar source code is inherently difficult for a software engineer, despite its importance. Thus, an experienced engineer prefers to guess the intended behavior, rather than to trace it line-by-line, by combining semantic chunks found in the source code. It is, however, still hard for a system to help in this activity, for lack of ways of both representing semantic chunks and of preparing a rich dictionary of chunks. In this paper, an integrated framework for annotating and searching source code is presented. Since the research is still in its early stage, this paper focuses on the framework itself, together with a brief description of our prototype implementation. In the framework, each engineer gathers (annotates) semantic chunks that have the same meaning and interactively generalizes them to get a search pattern. As a result, a dictionary of semantic chunks together with their search patterns is incrementally created through engineer collaboration. To realize this, two representations are used: a tuple of nodes of an abstract syntax tree (AST) for a semantic chunk and a classifier on generative attribute vectors for search patterns.","PeriodicalId":6556,"journal":{"name":"2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)","volume":"50 1","pages":"311-316"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86760019","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 Novel Binarization Scheme for Real-Valued Biometric Feature","authors":"Jialiang Peng, Bian Yang","doi":"10.1109/COMPSAC.2017.26","DOIUrl":"https://doi.org/10.1109/COMPSAC.2017.26","url":null,"abstract":"Biometric binarization is the feature-type transformation that converts a specific feature representation into a binary representation. It is a fundamental issue to transform the real-valued feature vectors to the binary vectors in biometric template protection schemes. The transformed binary vectors should be high for both discriminability and privacy protection when they are employed as the input data for biometric cryptosystems. In this paper, we propose a novel binarization scheme based on random projection and random Support Vector Machine (SVM) to further enhance the security and privacy of biometric binary vectors. The proposed scheme can generate a binary vector of any given length as an ideal input for biometric cryptosystems. In addition, the proposed scheme is independent of the biometric feature data distribution. Several comparative experiments are conducted on multiple biometric databases to show the feasibility and efficiency of the proposed scheme.","PeriodicalId":6556,"journal":{"name":"2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)","volume":"1 1","pages":"724-729"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79727184","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":"HybridFS — A High Performance and Balanced File System Framework with Multiple Distributed File Systems","authors":"Lidong Zhang, Yongwei Wu, Ruini Xue, Tse-Chuan Hsu, Hongji Yang, Yeh-Ching Chung","doi":"10.1109/COMPSAC.2017.140","DOIUrl":"https://doi.org/10.1109/COMPSAC.2017.140","url":null,"abstract":"In the big data era, the distributed file system is getting more and more significant due to the characteristics of its scale-out capability, high availability, and high performance. Different distributed file systems may have different design goals. For example, some of them are designed to have good performance for small file operations, such as GlusterFS, while some of them are designed for large file operations, such as Hadoop distributed file system. With the divergence of big data applications, a distributed file system may provide good performance for some applications but fails for some other applications, that is, there has no universal distributed file system that can produce good performance for all applications. In this paper, we propose a hybrid file system framework, HybridFS, which can deliver satisfactory performance for all applications. HybridFS is composed of multiple distributed file systems with the integration of advantages of these distributed file systems. In HybridFS, on top of multiple distributed file systems, we have designed a metadata management server to perform three functions: file placement, partial metadata store, and dynamic file migration. The file placement is performed based on a decision tree. The partial metadata store is performed for files whose size is less than a few hundred Bytes to increase throughput. The dynamic file migration is performed to balance the storage usage of distributed file systems without throttling performance. We have implemented HybridFS in java on eight nodes and choose Ceph, HDFS, and GlusterFS as designated distributed file systems. The experimental results show that, in the best case, HybridFS can have up to 30% performance improvement of read/write operations over a single distributed file system. In addition, if the difference of storage usage among multiple distributed file systems is less than 40%, the performance of HybridFS is guaranteed, that is, no performance degradation.","PeriodicalId":6556,"journal":{"name":"2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)","volume":"40 1","pages":"796-805"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79978763","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":"DeDuCT: A Data Dependence Based Concern Tagger for Modularity Analysis","authors":"Andrea Fornaia, E. Tramontana","doi":"10.1109/COMPSAC.2017.98","DOIUrl":"https://doi.org/10.1109/COMPSAC.2017.98","url":null,"abstract":"Modularity of a software system can be assessed once responsibilities of each method and class have been determined. Generally, developers attribute responsibilities to methods and classes manually. This can be problematic given that it relies on developers judgement and effort. This paper proposes an approach to automatically attribute concern tags to each instructions. The approach is based on taint analysis to determine which code lines are related to each other by data dependence. Moreover, Java APIs provide the tags used to mark code lines. The automatic concern tagging that we bring about is used to find out how responsibilities are spread in the code, and then to suggest refactoring activities in case tangling occurs.","PeriodicalId":6556,"journal":{"name":"2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)","volume":"24 1","pages":"463-468"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81539078","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 Impact of Database Layer on Auto-Scaling Decisions in a 3-Tier Web Services Cloud Resource Provisioning","authors":"A. Nikravesh, S. Ajila, Chung-Horng Lung","doi":"10.1109/COMPSAC.2017.235","DOIUrl":"https://doi.org/10.1109/COMPSAC.2017.235","url":null,"abstract":"This paper investigates the impact of the database layer on the scaling actions of the business layer of a 3-tier web service system in cloud resource provisioning. The research question is \"What is the impact of the database layer on the business layer auto-scaling decisions?\" In this work two hypotheses are tested: 1) \"Database tier capacity has no effect on the business tier scaling decisions\" and 2) \"Scaling up of a database tier increases Service Level Agreement (SLA) violations.\" To test the hypotheses, an auto-scaling simulation package based on Queuing Network Models (QNM) and Layered Queuing Network Models (LQNM) is developed. The auto-scaling simulation package is used to investigate the database impact on the business tier scaling decisions in the cloud environments with three different workload patterns (growing, periodic, and unpredictable patterns). This paper also provides an analytical investigation that empirically validate the hypotheses. The results suggest that the database tier has no effect on the business tier scaling decisions. However, decreasing the capacity of the database layer increases the rate of the SLA violations.","PeriodicalId":6556,"journal":{"name":"2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)","volume":"45 1","pages":"401-406"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82620479","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 Approach Based on Structural Differences to Expedite Applying OSS Updates to Products","authors":"M. Fukuyori, Ryuichi Umekawa, Hiroshi Fujino, Junya Yamaguchi, Kota Ariyama","doi":"10.1109/COMPSAC.2017.51","DOIUrl":"https://doi.org/10.1109/COMPSAC.2017.51","url":null,"abstract":"Open source software (OSS)-based product development takes advantage of feature updates and bug fixes from OSS communities. However, when we customize the OSS and do not return the changes back to the OSS communities, our customization and the updates sometimes conflict. That makes it difficult to apply forthcoming OSS updates since we need to grasp the software changes appropriately. We propose a method to visualize software's structural differences using call graph. We have applied the method to a product development process and found that our method helps developers to speed up the application of OSS updates and reduce update errors. We have also found that solely providing call graph is insufficient for them to check the differences. They need more detailed information, e.g. data flow, as well as a guide to utilize the difference information to resolve the conflicts.","PeriodicalId":6556,"journal":{"name":"2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)","volume":"28 1","pages":"445-450"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83701945","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":"What Makes Software Energy-Efficient?: Make it Faster","authors":"Hiroyuki Matsuo, S. Matsumoto, S. Kusumoto","doi":"10.1109/COMPSAC.2017.264","DOIUrl":"https://doi.org/10.1109/COMPSAC.2017.264","url":null,"abstract":"In order to reduce software energy consumption, a lot of studies have been carried out focusing on the difference of implementation, such as API and algorithm. However, we hypothesize that there is a strong correlation between total energy consumption of a program and duration of its execution. If this hypothesis is correct, reducing energy consumption is equal to decreasing duration. Experimental results reveal that there is a strong positive correlation between them, and its correlation coefficient is higher than 0.9. We also find that memory usage is weakly correlated with total energy consumption. As a result, we conclude that if developers want to reduce software energy consumption, they should firstly decrease duration of execution, and secondly reduce memory usage.","PeriodicalId":6556,"journal":{"name":"2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)","volume":"72 1","pages":"274-275"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80336720","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}