{"title":"REPRESENTING VARIABILITY IN SOFTWARE ARCHITECTURE: A SYSTEMATIC LITERATURE REVIEW","authors":"Umaima Haider, E. Woods, R. Bashroush","doi":"10.15282/IJSECS.4.2.2018.2.0046","DOIUrl":"https://doi.org/10.15282/IJSECS.4.2.2018.2.0046","url":null,"abstract":"Variability in software \u0000- \u0000intensive systems is the ability of a software artefact (e.g., a \u0000system, subsystem, or component) to be extended, customised or configured for \u0000deployment in a specific context. Software Architecture is \u0000a high \u0000- \u0000level description of a \u0000software \u0000- \u0000intensive system that abstracts the system implementation details allowing the \u0000architect to view the system as a whole. \u0000Although variability in software architecture is \u0000recognised as a challenge in multiple domains, \u0000there has been no formal consensus on \u0000how variability should be captured or represented. The objective of this research was to \u0000provide a snapshot of the state \u0000- \u0000of \u0000- \u0000the \u0000- \u0000art on representing variability in software \u0000architecture while assessing the nature of the \u0000different approaches. To achieve this \u0000objective, a Systematic Literature Review (SLR) was conducted covering literature \u0000produced from January 1991 until June 2016. Then, grounded theory was used to \u0000conduct the analysis and draw conclusions from data, mini \u0000mising threats to validity. In \u0000this paper \u0000, we report on the findings from the study.","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78067202","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":"GUESSING, MODEL CHECKING AND THEOREM PROVING OF STATE MACHINE PROPERTIES – A CASE STUDY ON QLOCK","authors":"M. Aung, T. Nguyen, K. Ogata","doi":"10.15282/IJSECS.4.2.2018.1.0045","DOIUrl":"https://doi.org/10.15282/IJSECS.4.2.2018.1.0045","url":null,"abstract":"It is worth understanding state machines better because various kinds of systems can be formalized as state machines and therefore understanding state machines has something to do with comprehension of systems. Understanding state machines can be interpreted as knowing properties they enjoy and comprehension of systems is interpreted as knowing whether they satisfy requirements. We (mainly the second author) have developed a tool called SMGA that basically takes a finite sequence of states from a state machine and generates a graphical animation of the finite sequence or the state machine. Observing such a graphical animation helps us guess properties of the state machine. We should confirm whether the state machine enjoys the guessed properties because such guessed properties may not be true properties of the state machine. Model checking is one possible technique to do so. If the state machine has a fixed small number of reachable states, model checking is enough. Otherwise, however, it is not. If that is the case, we should use some other techniques to make sure that the system enjoys the guessed properties. Interactive theorem proving is one such technique. The paper reports on a case study in which a mutual exclusion protocol called Qlock is used as an example to exemplify the abovementioned idea or methodology. \u0000Keywords: graphical animations of state machines, model checking, theorem proving, invariant properties","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"42 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80883908","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 REVIEW OF SINGLE AND POPULATION-BASED METAHEURISTIC ALGORITHMS SOLVING MULTI DEPOT VEHICLE ROUTING PROBLEM","authors":"Sherylaidah Samsuddin, M. Othman, L. M. Yusuf","doi":"10.15282/IJSECS.4.2.2018.6.0050","DOIUrl":"https://doi.org/10.15282/IJSECS.4.2.2018.6.0050","url":null,"abstract":"Multi-Depot Vehicle Routing Problem (MDVRP) arises with rapid development in the logistics and transportation field in recent years. This field, mainly, faces challenges in arranging their fleet efficiently to distribute the goods to customers by minimizing distance and cost. Therefore, the decision maker needs to specify the vehicles to reach the particular depot which, serves the customers with the predetermined capacity. Hence, to solve the stated problems, there is a need to apply metaheuristic methods to get minimal transportation costs. This article reviews on single and population-based metaheuristic methods solving MDVRP from the year 2013 until 2018. The methods discussed were simulated annealing (SA), variable neighborhood search (VNS), ant colony algorithm (ACO), particle swarm optimization (PSO) and genetic algorithm (GA). From the previous works, it can be concluded that the application of population based metaheuristic gives better solutions in solving MDVRPs. \u0000Keywords: Metaheuristic, Multi Depot, MDVRP","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75620687","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 DAWN OF METAHEURISTIC ALGORITHMS","authors":"Odili J.B","doi":"10.15282/IJSECS.4.2.2018.4.0048","DOIUrl":"https://doi.org/10.15282/IJSECS.4.2.2018.4.0048","url":null,"abstract":"Optimization has become such a favored area of research in recent times necessitating the need for technical papers and tutorials that will properly analyze and explain the basics of the field. At the heart of efficiency and effectiveness of optimization of engineering, business and industrial processes is metaheuristics, hence the need for proper explanations of the basics of optimization algorithms since the optimization algorithms are the engine room of successful optimization enterprise. This paper presents a foundational discussion on metaheuristic algorithms as a necessary ingredient in successful optimization endeavors and concludes, after analysis of some metaheuristic algorithms that a good metaheuristic algorithm should consist of four components, namely global search, local search, randomization and identification of the best solution at each iteration.","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"49 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80716257","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 SELECTED DISTANCE-BASED AND DISTRIBUTION-BASED CLUSTERING ALGORITHMS","authors":"Ajiboye, A. R. Olufadi","doi":"10.15282/ijsecs.4.2.2018.3.0047","DOIUrl":"https://doi.org/10.15282/ijsecs.4.2.2018.3.0047","url":null,"abstract":"","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"13 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85847095","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":"Managing the Environment for IoT Systems - Toward a \"Smart Hospital\"","authors":"E. Hanada","doi":"10.15344/2456-4451/2018/134","DOIUrl":"https://doi.org/10.15344/2456-4451/2018/134","url":null,"abstract":"","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"52 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88444644","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":"Internet of Things Business Models in Ecosystem Context-Cases of Elevator Services","authors":"Chia Tai Angus Lai, P. Jackson, Wei Jiang","doi":"10.15344/2456-4451/2018/135","DOIUrl":"https://doi.org/10.15344/2456-4451/2018/135","url":null,"abstract":"Companies increasingly have to adapt new technology and design new business models to retain their competitive advantage in highly dynamic environments. The increasing pervasiveness of the Internet of things (IoT) has offered great potential in many different areas of application to lead or complement new business models. However, business models based on largely static, single firm or historical information architectures are facing challenges in today’s more dynamic environment as new ways of creating value arise across industries and between firms, clients and other stakeholders. Embracing the business ecosystem concept is now becoming critical in order to realize business opportunities or business model potential. This paper focuses on the elaboration of the business ecosystem concept in the IoT business model environment, from both academic and practitioners’ perspectives, to analyse how IoT business models are connected to the underlying business ecosystem. We analyse three cases from the elevator industry to explain how different business models are employed in connection with business and IoT ecosystems, as well as their challenges and possible options to overcome these challenges.","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85036923","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}