Computer Science 2021-04-15T20:34:22+02:00 Computer Science Journal Open Journal Systems <p><img style="float: left; margin-right: 15px; margin-bottom: 5px;" src="" alt="" />The Computer Science Journal (ISSN: 1508-2806; e-ISSN: 2300-7036) is a quarterly published by the AGH University of Science and Technology, Krakow Poland since 1999.<br />We publish original papers concerning theoretical and applied computer science problems. Main areas of interest of the journal are: theoretical aspects of computer science, soft computing, HPC, cloud and distributed processing and simulation, multimedia systems and computer graphics, natural language processing.</p> <p>Please note: we don't have any article processing charges, our journal is non-profit. The journal is indexed in ESCI Web of Science and SCOPUS.</p> <p> </p> <!-- <p> </p> <p>Our journal is indexed in the following services: <a href="">Google Scholar</a>, <a href="">CrossRef metadata search</a>, <a href="">Directory of Open Access Journals</a>, <a href="">Open Archives Initiative</a>, <a href="">Digital Libraries Federation</a>, <a href="">BazTech</a>, <a href="">Index Copernicus</a>, <a href="">Ulrich's Periodicals Directory</a>, <a href="">EBSCOhost Applied Sciences</a>, <a href="">DBLP</a>, <a href="">ERIH PLUS</a>, <strong><a href="">SCOPUS</a> and Emerging Sources Citation Index - part of Clarivate Web of Science</strong>.</p> <p>This is an open access journal in accordance with the <a href="">BOAI</a>definition of open access. The content of the journal is freely available according to the <a href="">Creative Commons License Attribution 4.0 International (CC BY 4.0)</a></p> <p><a href=""><strong>SUBMISSION PAGE DIRECT LINK</strong></a></p> <p>Please note:</p> <ul> <li><strong>We do not apply any Article Processing Charges. Our journal is a fully non-profit endeavour.</strong></li> <li>The journal is Open Access (also free of charges).</li> <li>First Author of the accepted paper receives one complimentary hardcopy.</li> <li>We accept PDF or DOC/DOCX manuscripts for review.</li> <li>For final typesetting we strongly prefer Latex/Bibtex. If the authors of the accepted paper are unable to prepare the paper in Latex it will be translated to Latex - for the cost of likely significant delay in publishing. </li> <li>You may use our <a href="">Overleaf template</a> to prepare your paper.</li> <li>We review Survey papers - but only if the authors cite in their paper 3 recent papers by themselves, devoted to the area of the survey. We do not accept nor review surveys authored by non-experts.</li> <li>The paper submitted to our journal is expected to be 15-20 pages long.</li> <li>You are free to publish the early version of the paper in Arxiv, Research Gate and similar websites - but the paper should be updated with the final version, after the paper is accepted and published.</li> <li>We speed up the publication process by publishing early birds versions of the paper (with DOI).</li> <li>The submitted paper should follow typical guidelines for scientific publications - see for example this <a href="">Tutorial</a> by Jennifer Widom.</li> <li>We are using <a href="">IThenticate</a> to prevent (self)plagiarism.</li> <li>You can check our position at <a href=";tip=sid&amp;clean=0">Scimago Journal &amp; Country Rank</a>.</li> </ul> --> A Density-Based Method for the Identification of Non-Disjoint Clusters With Arbitrary and Non-Spherical Shapes 2020-12-29T14:33:45+01:00 Chiheb Eddine Ben Ncir <p>Overlapping clustering is an important challenge in unsupervised learning applications while it allows for each data object to belong to more than one group. Several clustering methods were proposed to deal with this requirement by using several usual clustering approaches. Although the ability of these methods to detect non-disjoint partitioning, they fail when data contain groups with arbitrary and non-spherical shapes. We propose in this work a new density based overlapping clustering method, referred to as OC-DD, which is able to detect overlapping clusters even having non-spherical and complex shapes. The proposed method is based on the density and distances to detect dense regions in data while allowing for some data objects to belong to more than one group.<br />Experiments performed on articial and real multi-labeled datasets have shown the effectiveness of the proposed method compared to the existing ones.</p> 2021-04-15T00:00:00+02:00 Copyright (c) 2021 Computer Science A Novel Approach to Automated Behavioral Diagram Assessment using Label Similarity and Subgraph Edit Distance 2021-01-08T23:04:44+01:00 Reza Fauzan Daniel Oranova Siahaan Siti Rochimah Evi Triandini Unified Modelling Language (UML) is one of the standard languages used in modelling software. Therefore, UML is widely taught in many universities. Generally, teachers assign students to build UML diagram designs based on a predetermined project. However, the assessment of such assignments can be challenging and teachers may be inconsistent in assessing students’ answers. Thus, automated UML diagram assessment becomes essential to maintaining assessment consistency. This study uses a behavioral diagram as the object of research since it is a commonly taught UML diagram. The behavioral diagram can show a dynamic view of the software. This study proposes a new approach to automatically assessing the similarity of behaviour diagrams as reliably as experts. We divide the assessment into two portions: semantic assessment and structural assessment. Label similarity is used to calculate semantic assessment, while subgraph edit distance is used to calculate structural assessment. The results suggest that the proposed approach is as reliable as an expert in assessing the similarity between two behaviour diagrams. The observed agreement value suggests strong agreement between the use of experts and the proposed approach. 2021-04-15T00:00:00+02:00 Copyright (c) 2021 Computer Science A UML 2.0 Activity Diagrams/CSP Integrated Approach for Modeling and Verification of Software Systems 2021-01-29T00:03:19+01:00 Raida Elmansouri Said Meghzili Allaoua Chaoui <p>This paper proposes an approach integrating UML 2.0 Activity Diagrams (UML2-AD) and Communicating Sequential Process (CSP) for modeling and verication of software systems. A UML2-AD is used for modeling a software system while CSP is used for verication purposes. The proposed approach consists of another way of transforming UML2-AD models to Communicating Sequential Process (CSP) models. It focuses also on checking the correctness of some properties of the transformation itself. These properties are specified using Linear Temporal Logic (LTL) and verified using the GROOVE model checker. This approach is based on Model Driven Engineering (MDE). The meta-modelling is realized using AToMPM tool while the model transformation and the correctness of its properties are realized using GROOVE tool. Finally, we illustrated this approach through a case study.</p> 2021-04-15T00:00:00+02:00 Copyright (c) 2021 Computer Science A Character Frequency based Approach to Search for Substrings of a Circular Pattern and its Conjugates in an Online Text 2021-02-15T22:45:56+01:00 Vinod Prasad <p>A fundamental problem in computational biology is to deal with circular patterns. The problem consists of finding the least certain length substrings of a pattern and its rotations in the database. In this paper, a novel method is presented to deal with circular patterns. The problem is solved using two incremental steps. First, an algorithm is provided that reports all substrings of a given linear pattern in an online text. Next, without losing efficiency, the algorithm is extended to process all circular rotations of the pattern. For a given pattern <em>P</em> of size <em>M</em>, and a text <em>T</em> of size <em>N</em>, the algorithm reports all locations in the text where a substring of <em>P<sub>c</sub></em> is found, where <em>P<sub>c</sub></em> is one of the rotations of <em>P</em>. For an alphabet size <em>σ</em>, using <em>O(M)</em> space, desired goals are achieved in an average <em>O(MN/σ)</em> time, which is <em>O(N)</em> for all patterns of length <em>M ≤ σ</em>. Traditional string processing algorithms make use of advanced data structures such as suffix trees and automaton. We show that basic data structures such as arrays can be used in the text processing algorithms without compromising the efficiency.</p> 2021-04-15T00:00:00+02:00 Copyright (c) 2021 Computer Science SARED: A Self-Adaptive Active Queue Management Scheme for Improving Quality of Service in Network Systems 2021-02-16T22:17:53+01:00 Aminu Adamu <p>Considering the phenomenal growth of network systems, congestion remains a threat to the quality of service provided in such systems, hence, research on congestion control is still relevant. Internet research community regards Active Queue Management (AQM) as an effective approach to address congestion in network systems. Most of the existing AQM schemes possess static drop patterns and lack self-adaptation mechanism, as such don’t work well for networks where traffic load fluctuates. This paper proposes Self-Adaptive Random Early Detection (SARED) scheme which smartly adapts its drop pattern based on current network’s traffic load in order to maintain better and stable performance. In light to moderate load conditions, SARED operates in nonlinear modes in order to maximize utilization and throughput, while in high load condition, it switches to linear mode in order to avoid forced drops and congestion. Experiments conducted have revealed that regardless of traffic load’s condition, SARED provides optimal performance.</p> 2021-04-15T00:00:00+02:00 Copyright (c) 2021 Computer Science A Reversible Data Hiding Scheme through Encryption using Rotated Stream Cipher 2021-02-27T18:43:21+01:00 V. M. Manikandan The research in the domain of reversible data hiding got much attention in recent years due to its wide applications in medical image transmission and cloud computing. Reversible data hiding during image encryption is a recently emerged framework for hiding secret data into an image during the image encryption process. In this manuscript, we propose a new reversible data hiding through encryption scheme which will ensure a high embedding rate without bringing any additional overhead of key handling. The proposed algorithm can use any secure symmetric encryption scheme, and the encryption and/or decryption key should be shared with the receiver for data extraction and image recovery. As per the proposed scheme, the data hider can hide three-bits of secret message in an image block of size $B\times B$ pixels. The data extraction image recovery will be carried out by analyzing the closeness between adjacent pixels. The simulation of the new scheme on the USC-SIPI dataset shows that the proposed scheme outperforms the well-known existing schemes in embedding rate and bit error rate. 2021-04-15T00:00:00+02:00 Copyright (c) 2021 Computer Science