International Journal of Software Engineering and Computer Systems最新文献

{"title":"QR Code: Challenges and Potentials for Services in Pos-Covid Era","authors":"R. Bolzan, Paula Martins, Silvia Fernandes","doi":"10.15344/2456-4451/2020/161","DOIUrl":"https://doi.org/10.15344/2456-4451/2020/161","url":null,"abstract":"The choice of this work arises from the interest in launching innovative services to target people. We sought to integrate a technology that could bring more innovation to a product/ service, namely due to mobile trends. Among some options considered, we chose the QR code technology. With the help of a strategic plan, we evaluate whether there is a market and propensity for its widespread use in Portugal. Then, an interactive prototype of the supporting platform is presented for validation by potential users. Most participants consider the idea interesting and promising. They suggested add-ons such as: more video functions and a greater variety of events and resources to apply it. Given the challenges in society, we forecast its application to the quick request for specialized information and/or resources by critical activities such as in health, tourism, etc. QR Code: Challenges and Potentials for Services in Pos-Covid Era Publication History: Received: December 08, 2020 Accepted: December 28, 2020 Published: December 30, 2020","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74375393","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":"Channel Status Prediction using Auto-regressive and Auto-regressive Integrated Predictors over WLAN Channel","authors":"Yafei Hou, Naoya Hokimoto, S. Denno","doi":"10.15344/2456-4451/2020/159","DOIUrl":"https://doi.org/10.15344/2456-4451/2020/159","url":null,"abstract":"Recently, due to the increase of huge number of wireless devices such as smartphones or sensors, mobile wireless traffic is dramatically expanding each year. Cognitive radio (CR) system has been attracted attention to improve frequency usage efficiency. CR system is a technology that enables to select multiple radio systems, grasps the congestion status of communication and selects the optimum radio system. Till now, there are many researches considering the prediction of channel occupancy ratio (COR: the ration between busy duration length to resolution period T). If the start and end points of busy/idle duration from the sensing channel spectrum can be correctly predicted, it will largely benefit the wireless system design and spectrum efficiency (SE) improvement. In this paper, we will consider such research based on auto-regressive (AR) and auto-regressive integrated (ARI) models using traffic data captured from the wireless channel near a railway station. The major idea is that the busy/idle duration length can be calculated from COR value when the resolution period T is short. The results confirm that our proposal can improve the prediction accuracy.","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"72 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85531023","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":"Sign Language Recognition Using Convexity Defects and Hough Line","authors":"M. Cheok, Z. Omar, M. Jaward","doi":"10.15344/2456-4451/2020/158","DOIUrl":"https://doi.org/10.15344/2456-4451/2020/158","url":null,"abstract":"This paper presents a novel feature extraction framework for sign language recognition application to assist the deaf and speech-impaired in daily communication. Our method extracts visual features from the hand gesture using convexity defects, K-curvature and Hough line which can differentiate visually similar signs. In segmentation stage, Canny edge detection and skin color segmentation with histogram backprojection method are used to extract the hand region from the background. The features to be extracted are categorized into shape, orientation and motion. The shape features of the sign language will then be extracted using convexity defect, K-curvature and Hough line techniques. The orientation feature will be extracted by calculating the palm center to wrist angle. The trajectory motion of the dynamic gesture is extracted using the chain code method. Lastly, Decision Tree classification is employed in classification of both static and dynamic gestures. The proposed framework is carried out in smartphone platform to recognize 26 alphabets, 10 numbers and eight dynamic American Sign Language (ASL). The average accuracy of 29 static ASL achieved is 85.72% and average accuracy of 10 dynamic ASL achieved is 77%. Through this research, it is found that the proposed framework can recognize larger sign languages database as compared with previous convexity defect-based sign language recognition research. *Corresponding Author: Ming Jin Cheok, Universiti Teknologi Malaysia, Skudai, 81300, Malaysia; E-mail: mingjin_91@hotmail.com Citation: Cheok MJ, Omar Z, Jaward MH (2020) Sign Language Recognition Using Convexity Defects and Hough Line. Int J Comput Softw Eng 5: 158. doi: https:// doi.org/10.15344/2456-4451/2020/158 Copyright: © 2020 Cheok et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Some notable appearance-based feature extraction method includes the extraction of Shift-Invariant Feature Transform (SIFT) features from the gesture. For example, in paper [13], SIFT features are extracted from six signs and the features are rotational invariant. Research in [14,15] also extracted SIFT features from the hand gestures, and the features are simplified by first quantizing with K-means clustering and then mapped into Bag-of-Features (BoF). Representing SIFT features using BoF reduces and uniforms the dimensionality of each SIFT features extracted. Speeded Up Robust Feature (SURF) is another notable feature extraction method proposed in [16]. The authors in paper [17] extracted SURF features from a moving hand gestures of consecutive frames, and by analyzing correlation between SURF points, classification of 26 gestures achieves 84.6% accuracy. Computational performance of SIFT and SURF has been compared in paper [15], as the extraction of features is usually a ","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"34 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86524896","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 ANALYSIS AND OPTIMIZATION OF BUFFER SIZES FOR HETEROGENEOUS NETWORK TRAFFICS","authors":"M. A. Ahmad, D. Wisdom, S. Isaac, U. Arinze","doi":"10.15282/ijsecs.6.2.2020.5.0073","DOIUrl":"https://doi.org/10.15282/ijsecs.6.2.2020.5.0073","url":null,"abstract":"We have proposed a  suited buffer size for Heterogeneous network traffics, with an average significant throughput and response delay.","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"111 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77058672","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":"Deriving the COVID-19 Formula from any Graph","authors":"J. Mujica, Ramón A. Mata-Toledo","doi":"10.15344/2456-4451/2020/157","DOIUrl":"https://doi.org/10.15344/2456-4451/2020/157","url":null,"abstract":"Most of the graphics published about the COVID-19 have exponential behavior. A lot of them have been driven with only the data given by government institutions. In this paper, the authors attempt to describe a general procedure to convert any group of data into a graph, where the application of the Least Square Method can provide a mathematical formula that can be used for different situations and purposes including improving the current graphs of the disease. *Corresponding Author: Dr Jose Mujica, Escuela Superior de Audio y Acústica, Caracas, Venezuela; E-mail: jmujica@escuelasuperiordeaudio.com.ve Citation: Mujica J, Mata-Toledo RA (2020) Deriving the COVID-19 Formula from any Graph. Int J Comput Softw Eng 5: 157. doi: https://doi.org/10.15344/24564451/2020/157 Copyright: © 2020 Mujica et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Published on March 13, 2020. The objective is to obtain a graph to which we can apply the LSM to derive a mathematical formula that we can use, as indicated later, for several other purposes including the study of any variable of this or any other disease. As a caveat to the reader, the figures used in this paper are not at a true scale although the values shown are actual measurements; all figures are only used to convey shapes and procedures. Figure 1 illustrates a typical COVID-19 curve profile and its values. Identifying the coordinates The coordinates of the graph were found by measuring the height of the curve at seven different horizontal intervals, as shown in Figure 2. International Journal of Computer & Software Engineering Jose Mujica1,* and Ramon A. Mata-Toledo2 1Escuela Superior de Audio y Acústica, Caracas, Venezuela 2James Madison University, Harrisonburg, Virginia, USA Int J Comput Softw Eng IJCSE, an open access journal ISSN: 2456-4451 Volume 5. 2020. 157 Mujica et al,. Int J Comput Softw Eng 2020, 5: 157 https://doi.org/10.15344/2456-4451/2020/157 Introduction In this article, the authors propose the use of the Least Square Method (LSM) as a procedure that can help us obtain a mathematical formula that can be used to complement, and if possible, better any of the models used so far, particularly, on the area of medicine. The LSM will be used to fit the curve of a graph from which we can generate a mathematical formula. The procedure is a simple three-step process: first, collect the field data. Second, make a graph from the data obtained, and, as the third and last step, use the LSM to generate a mathematical formula. From the plot of this graph, after applying the LSM, we can generate a formula that can be easily taught and used worldwide without the need of having specialized workshops to teach the use and application of the formula. Using the Least Square Method to Find the Equation of Covid-19 Curve Sa","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89460214","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":"TOWARDS DATA PRIVACY AND SECURITY FRAMEWORK IN BIG DATA GOVERNANCE","authors":"Jacentha N.Maniam, Dalbir Singh","doi":"10.15282/ijsecs.6.1.2020.5.0068","DOIUrl":"https://doi.org/10.15282/ijsecs.6.1.2020.5.0068","url":null,"abstract":"Data privacy and security are among the most important aspects to be considered in implementing a data-driven system. A well generated Big Data contains a wealth of information that can reveal personal life that should be kept in private. Although various studies and Big Data analysis are widely documented, the methods and policies to ensure the privacy and security of data in Big Data governance remain unclear. Big Data analytics also seeks to make the affected person disclose new and critical personal information that is not intended for disclosure. Thus, this study focuses on data privacy and security issues in Big Data governance. The objective of this study aims to propose of Big Data governance framework that complements data privacy and security factors. This study uses a qualitative approach in the development of the research framework based on a systematic literature review and evaluated by experts to validate the framework. This study is expected to benefits the public and private sectors where the proposed framework could be applied as a guide to preventing any data leakage or misuse of Big Data.","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"102 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89007463","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":"SEMANTIC SIMILARITY MEASUREMENT FOR MALAY WORDS USING WORDNET BAHASA AND WIKIPEDIA BAHASA MELAYU: ISSUES AND PROPOSED SOLUTIONS","authors":"T. Zakaria, M. J. Aziz, M. Mokhtar, S. Darus","doi":"10.15282/ijsecs.6.1.2020.4.0067","DOIUrl":"https://doi.org/10.15282/ijsecs.6.1.2020.4.0067","url":null,"abstract":"What is the similarity between ‘car’ and ‘automobile’? How many similarities are shared by these two words? This equation can be easily evaluated by humans but not by computers. Human language is very complicated and ambiguous. This ambiguity is a barrier that separates human understanding with computer comprehension. Semantic similarity between words is a very important task and widely practiced in the field of natural language processing. In this article, some issues regarding semantic similarity for Malay language using two Malay lexical resources (WordNet Bahasa and Wikipedia Bahasa Melayu) are discussed. Then, some solutions to solve the arising issues are proposed. An experiment was done to evaluate the performance of WordNet Bahasa and Wikipedia Bahasa Melayu on the coverage of semantic information for 150 Malay translated words (75 word-pairs). The result showed that the WordNet Bahasa and Wikipedia Bahasa Melayu are capable to be adapted to literature techniques. For WordNet Bahasa, we tested the coverage of WordNet Bahasa based on three word-levels (stem level, root level and mix level) to find the most applicable word level as our dataset. This is because WordNet Bahasa is a limited resource and some of the compound words cannot be match with the lemma in its database. The test indicated that the mix level of translated words outperformed the stem level and root level with 86.7% compared to stem level (78.7%) and root level (68.0%). For Wikipedia Bahasa Melayu, we evaluated the coverage of three main features in its article (gloss definitions, hyperlinks and categories) where these features are important in some previous techniques. The result of this test was used to choose the best technique based on the coverage of these features. The results of the experiment revealed that the gloss definition feature gave full coverage (100%) for our 75 word-pairs input compared to hyperlinks and categories (88.0%).","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"73 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86929768","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":"GREEDY SHORTEST SUPERSTRING WITH DELAYED RANDOM CHOICE","authors":"Mutaz Rasmi Abu Sara, M. F. J. Klaib, M. Hasan","doi":"10.15282/ijsecs.6.1.2020.2.0065","DOIUrl":"https://doi.org/10.15282/ijsecs.6.1.2020.2.0065","url":null,"abstract":"The shortest superstring problem for a given set of strings is to find a string of minimum length such that each input string is a substring of the resulting string. This problem is known to be NP-complete. A simple and popular approximation algorithm for this problem is GREEDY, which at each step merges a pair of strings that have maximum overlap. If more than one pair have maximum overlap, it takes a pair in random. In this paper, we modify GREEDY such that instead of taking a pair in random, it takes the pair for which the overlap in the next step is maximum. We analyze our algorithm and compare it with GREEDY for different types of input. We implement both the algorithms and the experimental results show that our algorithm can outperform GREEDY substantially in many cases, and in general our algorithm is same or better than GREEDY.","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"37 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85746718","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":"FRAGMENTATION TECHNIQUES FOR IDEAL PERFORMANCE IN DISTRIBUTED DATABASE – A SURVEY","authors":"Sharifah Hafizah Sy Ahmad Ubaidillah, Noraziah Ahmad","doi":"10.15282/ijsecs.6.1.2020.3.0066","DOIUrl":"https://doi.org/10.15282/ijsecs.6.1.2020.3.0066","url":null,"abstract":"Distributed processing is an operative way to improve the performance of the distributeddatabase systems and thus showing the effectiveness of computational intelligence. Aspecific arrangement of distributed processing through distributed database, where alogically integrated database is physically scattered over several distinct but linkedthrough the computing facilities. Hence, proper fragmentation of data across numeroussites of the network is considered as a significant exploration area in the distributeddatabase environment. Data can be allocated in distinct servers by fragmenting thecomplete or partially database into several pieces with different techniques. Each piece isstored at the different sites. In this paper, an exploration of fragmentation techniques indistributed database is done. Fragmentation techniques had been proved by manyresearches in improving the performance of the distributed database system, increase thedata accessibility, reduce the transfer cost and access time. This paper presents a surveyof numerous fragmentation techniques on distributed database systems.","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"58 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72523704","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":"Understanding Risk in Software Crowdsourcing: A Preliminary Taxonomy","authors":"Daiwei Yu, Ye Yang, Yong Wang","doi":"10.15344/2456-4451/2020/155","DOIUrl":"https://doi.org/10.15344/2456-4451/2020/155","url":null,"abstract":"Software crowdsourcing (SC) is booming as a popular paradigm for rapid solution development. However, unique characteristics of this emerging paradigm, such as external resources and black-box nature of crowdsourced processes, introduce inherent risk to crowdsourcing. This paper aims at developing better understanding towards risk in SC. To that end, we conduct a literature review of 36 relevant articles, and propose a preliminary taxonomy of SC risk including 13 risk types. These 13 risk types are organized with a two-dimensional, processes vs. entities, structure. For each risk, its description and cause / consequence are introduced. Analysis of possible reasons and practical mitigation suggestions are also offered for crowdsourcing practitioners to better cope with risks. The preliminary results will help both requesters and platforms to be alert to risks by understanding them, so as to ensure the achievement of expected benefits of SC. *Corresponding Author: Dr. Yong Wang, Department of Computer Science and Technology, Ocean University of China, 238 Songling Rd, Laoshan Qu, Qingdao Shi, China; E-mail: wangyong@ouc.edu.cn Citation: Yu D, Yang Y, Wang Y (2020) Understanding Risk in Software Crowdsourcing: A Preliminary Taxonomy. Int J Comput Softw Eng 5: 155. doi: https://doi.org/10.15344/2456-4451/2020/155 Copyright: © 2020 Yu et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. On the one hand, SC processes share some common risk factors with traditional software methodologies. For example, requirement risk may occur in both traditional software methodologies and SC, and the common risk factor in requirements is unclarity and ambiguity. On the other hand, SC also exhibits some special risk characteristics. It is constantly subject to uncertain changes due to the loss of control and visibility to individual worker's behaviors. For example, SC tasks are registered by anonymous workers from all over the world, who may submit plagiarized code [28] or poor-quality solutions [22]. Such risks may threaten task success. In addition, there are some common misconceptions among software practitioners. On the optimistic side, some people believe that crowdsourcing is a better way to go without worrying about the risk. On the realistic side, some companies experience pushing back due to low task quality [22], task starvation [10], and employees' reluctance (i.e., turbulence) [9]. Therefore, there is an essential need for a synthesized body of knowledge in order to support more informed risk management in SC practice. To that end, this paper aims at exploring and extracting special risk items and reasons in the context of SC, in order to support managers to discern and manage their SC project risks in a more effective manner. Based on the existing literature review, thi","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"149 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85370144","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}