{"title":"Usability Evaluation Methods for Software Development: A Systematic Mapping Review","authors":"Freddy Paz, J. Pow-Sang","doi":"10.1109/ASEA.2015.8","DOIUrl":"https://doi.org/10.1109/ASEA.2015.8","url":null,"abstract":"Usability is currently one of the most important aspects of software quality. Developers are aware that if a software product does not meet user's expectations regarding usability, the entire project might fail. For this reason, several usability evaluation methods have emerged and nowadays are employed from early phases of the software development process. However, the literature reports a wide range of techniques for this purpose. In this way, the choice of a suitable method for a particular scenario has become a difficult decision. Through a systematic mapping review about the use of usability evaluation methods in software development contexts, we have identified the most commonly used techniques. A total of 228 case studies were selected for this review. We found that (1) Questionnaire, (2) User Testing and (3) Heuristic Evaluation were the most frequent. This study is intended to be a guide for scholars in this area.","PeriodicalId":259240,"journal":{"name":"2015 8th International Conference on Advanced Software Engineering & Its Applications (ASEA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129982889","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":"High Privacy for Data Disclosures Using Tree-EMD","authors":"D. Bhattacharyya, Tai-hoon Kim","doi":"10.1109/ASEA.2015.16","DOIUrl":"https://doi.org/10.1109/ASEA.2015.16","url":null,"abstract":"Now a day's micro data publishing is very useful to the all the organizations that enables the researchers and policy-makers to analyze the data and learn important information. Privacy is a one of the most important factor here. One of the existing methods for privacy measures such as k-anonymity protects against identity disclosures, but it is not providing affective protection against attribute disclosures. Another privacy measure is l-diversity attempts to solve this problem. However, it's neither enough nor economical to forestall attribute disclosures and fails at information utilization. Therefore a base model known as t-closeness and a lot of versatile privacy model known as (n, t)-closeness was developed to archives a decent balance between privacy and utility. The bottom model t-closeness, which needs that the distribution of a sensitive attribute in any equivalence class is near the distribution of the attribute within the overall table (i.e., the space between the 2 distributions ought to be no quite a threshold t). (n, t)-closeness offers higher utility. These closeness measures need likelihood distributions that are assessed victimization Earth Mover's Distance (EMD) measure. We have a tendency to propose to use associate degree economical tree-based rule, Tree-EMD. Tree-EMD exploits the very fact that a basic possible resolution of the simplex algorithm-based problem solver forms a spanning tree. The quantity of unknown variables is reduced to O(N) from O(N2) of the initial EMD. During this paper, we have a tendency to introduce techniques that are implementation of the Tree-EMD and perform advanced experiments to demonstrate its potency.","PeriodicalId":259240,"journal":{"name":"2015 8th International Conference on Advanced Software Engineering & Its Applications (ASEA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114081361","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":"Consideration of Similarity Factors in Integration of FP and SLOC for Software Project Estimation","authors":"B. K. Singh, Akash Punhani, S. Tiwari, A. Misra","doi":"10.1109/ASEA.2015.17","DOIUrl":"https://doi.org/10.1109/ASEA.2015.17","url":null,"abstract":"This research paper includes the use and explanations related to advantages of two \"public domain\" costing methods i.e., Function Point and Source Lines of Codes for size estimation. Research paper demonstrates the effect of deviation between SLOC and FP and use of homogeneous data can provide the acceptable results by reducing deviation as established. It is demonstrated and established that the combination of physical size and functional size using the LOC and function points can affect the productivity. Such estimates are of very high degree of accuracy.","PeriodicalId":259240,"journal":{"name":"2015 8th International Conference on Advanced Software Engineering & Its Applications (ASEA)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129978775","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":"Appraisal for Lokpal Body Using Fuzzy Multicriteria Approach","authors":"P. Srivastava","doi":"10.1109/ASEA.2015.15","DOIUrl":"https://doi.org/10.1109/ASEA.2015.15","url":null,"abstract":"The judicial system needs a revamp and the Lokpal system has been put forward as a solution to all problems pertaining to corruption. However, there is need to ensure that the Lokpal also does not succumb to the same functional shortcomings as the judicial system. To deal with this, this paper proposes a robust appraisal system to evaluate the performance of the employees. Several metrics have been identified and their values will be used to calculate the appraisal value for an employee. This value will be fed in the agent based simulation of the Lokpal model, in order to assess the severity of corruption.","PeriodicalId":259240,"journal":{"name":"2015 8th International Conference on Advanced Software Engineering & Its Applications (ASEA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127870741","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}
Gui-hyun Baek, SungEn Kim, Geon-Chul Shin, KeeHong Ahn, Su-kyoung Kim
{"title":"Semantic Data Process Method Based on RDF for Context Information","authors":"Gui-hyun Baek, SungEn Kim, Geon-Chul Shin, KeeHong Ahn, Su-kyoung Kim","doi":"10.1109/ASEA.2015.11","DOIUrl":"https://doi.org/10.1109/ASEA.2015.11","url":null,"abstract":"This paper suggests the optimization method of RDF Repository. When state data that occurred thing composing context information, this method processes in real-time using ontology technique in IoT environment. It needs to adapt meaning system about state to delivery correct state among different things. In other words, it is important to adapt technique to guarantee Semantic Interoperability. For this, People suggest a method such as SSNO based on ontology. However, techniques were center of modeling to express most things. They have a lack of paper about real-time reasoning engine that processes thing's state and context. Also, ontology reasoning engine based on RDF repository currently optimized static data processing. Due to thisreason, it can not be satisfy real-time processing that request from IoT service. Therefore, thispaper research a method about optimizing RDF repository composition to solve this problem.","PeriodicalId":259240,"journal":{"name":"2015 8th International Conference on Advanced Software Engineering & Its Applications (ASEA)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114936626","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}
Csaba Faragó, Péter Hegedűs, Gergely Ladányi, R. Ferenc
{"title":"Impact of Version History Metrics on Maintainability","authors":"Csaba Faragó, Péter Hegedűs, Gergely Ladányi, R. Ferenc","doi":"10.1109/ASEA.2015.14","DOIUrl":"https://doi.org/10.1109/ASEA.2015.14","url":null,"abstract":"In this study we present how some version control history based metrics affect maintainability of the source code. These metrics cover intensity of modifications, code ownership and code aging. We determine the order of source files based on each analyzed metrics, and compare it with their maintainability based order. As a cross-check we perform a comparison test with post-release defects as well. We performed the analysis on 14 versions of 4 well-known open source software systems. The results show high correlation between the version control metrics and relative maintainability indexes, in each case. The comparison with post-release defects also support the results in most of the cases.","PeriodicalId":259240,"journal":{"name":"2015 8th International Conference on Advanced Software Engineering & Its Applications (ASEA)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115994867","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 Hybrid Harmony Search Algorithm for the Job Shop Scheduling Problems","authors":"Hamed Piroozfard, K. Wong, Ali Derakhshan Asl","doi":"10.1109/ASEA.2015.23","DOIUrl":"https://doi.org/10.1109/ASEA.2015.23","url":null,"abstract":"Machine scheduling is assigning a set of operations of jobs on machines during a time period, taking into account the time, capability, and capacity constraints. In machine scheduling and management science, job shop scheduling is considered as an important problem due to many real-world applications. The job shop scheduling problems are numerically intractable that cannot be solved in polynomial time, unless P = NP, and they are classified as NP-hard. Harmony search algorithm has been successfully implemented in many optimization problems, particularly in scheduling problems, and hybridization is an effective approach for improving the solution quality of the algorithm. This paper proposes an effective hybrid harmony search algorithm for solving the job shop scheduling problems with the objective of minimizing makespan. A set of well-studied benchmarked problems is used to prove the effectiveness and efficiency of the proposed algorithm. The results indicate that the proposed hybrid harmony search algorithm improves the efficiency.","PeriodicalId":259240,"journal":{"name":"2015 8th International Conference on Advanced Software Engineering & Its Applications (ASEA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116663185","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 Hypermedia-Driven Approach for Adapting Processes via Adaptation Processes","authors":"R. Oberhauser","doi":"10.1109/ASEA.2015.22","DOIUrl":"https://doi.org/10.1109/ASEA.2015.22","url":null,"abstract":"In addition to an increasing need for business process management systems (BPMS) to dynamically adapt to situational change, there is increased interest in web service accessibility of BPMS to broaden their integration in enterprises and the cloud. Towards this end, a RESTful hypermedia-driven enactment and adaptation of processes has not been adequately explored. This paper thus investigates a hypermedia extension of our process adaptation approach AProPro we call AProProh (Adapting Processes via Processes using hypermedia) that dynamically provides hypermedia to guide process clients in the navigation, enactment, and adaptation of process instances. Clients of process-aware information systems (PAIS) have hitherto been tied to vendor-specific APIs and lacked a standard web-based API. The AProProh HATEOAS-PAIS middleware enables process clients to be more generic and PAIS-agnostic via REST APIs. Additionally, process clients can dynamically apply valid adaptations or adjust to process model changes utilizing dynamically generated hypermedia. Based on a case study prototype realization supporting dynamic invocation of process adaptation patterns, the initial evaluation results show its feasibility and gauge its performance overhead.","PeriodicalId":259240,"journal":{"name":"2015 8th International Conference on Advanced Software Engineering & Its Applications (ASEA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131383581","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":"Enable Concurrent Byzantine Fault Tolerance Computing with Software Transactional Memory","authors":"Wenbing Zhao, Honglei Zhang, Xiong Luo, Yueqin Zhu","doi":"10.1109/ASEA.2015.20","DOIUrl":"https://doi.org/10.1109/ASEA.2015.20","url":null,"abstract":"Byzantine fault tolerance typically is achieved via state-machine replication, which requires the execution of all requests at the server replicas sequentially in a total order. This could severely limit the system throughput. We have seen tremendous efforts on the partial removal of the constraint on the sequential execution of all requests. Most of them rely on using application semantics to develop customized replication algorithms that could identify independent requests and execute them in parallel. In this paper, we describe concurrency control mechanisms for Byzantine fault tolerance systems using software transactional memory. This is an attractive approach to increasing the system throughput because no application-specific rules are required to determine whether or not two requests are conflicting. We present mechanisms for two common types of software transactional memory implementations, one based on transaction logs with two-phase locking, and the other based on multiversion concurrency control. We show that standard concurrency control mechanisms designed for these types cannot be used directly to ensure one-copy serializability, and introduce our solutions.","PeriodicalId":259240,"journal":{"name":"2015 8th International Conference on Advanced Software Engineering & Its Applications (ASEA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130560016","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 Study on the Modified Estimation Algorithm for Searching Target Position","authors":"Kwan-Hyeong Lee","doi":"10.1109/ASEA.2015.12","DOIUrl":"https://doi.org/10.1109/ASEA.2015.12","url":null,"abstract":"It is important to direction of arrival estimate technology with adaptive array system in wireless spatial. In order to locate desired signal in spatial use many an adaptive array system. Adaptive array system is correctly estimation to remove noise and interference using optimum weight in order to desired signal. High resolution technology of direction of arrival estimation is one of the most challenging problems about searching a target position. High resolution direction of arrival estimation algorithm like MUSIC can be used to overcome this problem in narrowband systems. Through simulation, we show that compare the proposal direction of arrival estimation with gernal direction of arrival algorithm.","PeriodicalId":259240,"journal":{"name":"2015 8th International Conference on Advanced Software Engineering & Its Applications (ASEA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134340983","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}