Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

143 articles for “algorithm and complexity”
Set a search alert
Research ArticleOpen accessIn the abstractAn Intrusion Detection System Using Optimized Deep Learning for IoT NetworksChempavathy B., Mouleeswaran S. K.In the rapidly evolving landscape of Internet of Things (IoT) networks, assuring security is paramount. Cyber-attacks on IoT networks are evolving in complexity and scale. Intruders employ diverse tactics, including malware, Denial of Service (DoS) attacks, along with unauthorized access. This research aims to propose an optimized Deep Learning (DL) based Intrusion Detection System (IDS) to bolster security within IoT … …Journal of Computer Science, Vol. 21, Issue 8 · 9 Oct 2025 · 3,001 accessesView PDFCite
Research ArticleOpen accessIn the abstractSimulated Annealing Decoder for Linear Block CodesLahcen Niharmine, Hicham Bouzkraoui, Ahmed Azouaoui, Youssef HadiIn this study, we introduce a novel soft decoder, the first of its kind, for linear block codes, based on Simulated Annealing algorithm (SA). The main enhancement in our contribution which let our decoder over performs with large gain (about 3 dB at 710-4) the classical SA approach, is to take the most reliable information set of the received codeword … …Journal of Computer Science, Vol. 14, Issue 8 · 4 Sep 2018 · 7,816 accessesView PDFCite
Case ReportOpen accessIn the abstractQuery Optimization on Distributed Database Dengue Fever by Minimizing Attribute InvolvementSlamet Sudaryanto Nurhendratno, Sudaryanto, Fikri Budiman, Maryani SetyowatiQuery optimization is an important task in a client/server environment of a distributed database, whereas a health epidemiologist data distribution based on DBD data on Geographic Information Systems (GIS). A proper method for a particular query process function is needed to generate query optimization on a distributed database. The query process requires important attention especially in distributed databases because the … …Journal of Computer Science, Vol. 14, Issue 4 · 7 Apr 2018 · 8,333 accessesView PDFCite
Research ArticleOpen accessIn the abstractSegmented Block Cipher Algorithm Based on ASCII-Codes ManeuverShadi Rasheed Masadeh, Hamza Abbass Al-SewadiDue to their complexity, computation time and power requirement, the secure and widely used cryptographic systems such as 3DES and AES may not be considered suitable for applications like mobile and remote sensing of sensitive data. Therefore, secure but less complicated algorithms for data encryption are still sought. This paper suggests a new Segmented Block Cipher Algorithm (SBCA) is a … …Journal of Computer Science, Vol. 13, Issue 12 · 15 Dec 2017 · 6,903 accessesView PDFCite
Research ArticleOpen accessIn the abstractDPSA: Deterministic Parallel Search Algorithm in Large DatabaseSami Qawasmeh, Arwa ZabianThe main goal of parallel processing is to reduce the complexity of finding a solution for a problem. In this study, we consider the problem of searching for multiple items at the same time in a large database. We propose a parallel search algorithm that reduces the searching time in comparison to binary search algorithm saving in that the time … …Journal of Computer Science, Vol. 13, Issue 9 · 6 Sep 2017 · 7,195 accessesView PDFCite
Research NotesOpen accessIn the abstractReal Time Density-Based Clustering (RTDBC) Algorithm for Big DataDr. B. Ravi PrasadDensity Based Spatial Clustering of Applications with Noise (DBSCAN), a well-known Density-Based Clustering Algorithm is a advanced data clustering method with various applications in numerous fields like Satellites images, X-ray crystallography, Anomaly Detection in Temperature Data. But its run time R(n2) complexity draws a major challenge. In this research paper, we propose a new unique algorithm called Real Time Density … …Journal of Computer Science, Vol. 13, Issue 10 · 15 Aug 2017 · 7,304 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimizing {0, 1, 3}-NAF Recoding Algorithm Using Block-Method Technique in Elliptic Curve CryptosystemMohsen Bafandehkar, Sharifah Md Yasin, Ramlan MahmodThe most expensive and time-consuming operation in Elliptic curve cryptosystem is scalar multiplication operation. Optimization of scalar multiplication will substantially enhance the ECC performance. Scalar multiplication can be improved by using an enhanced scalar recoding algorithm that can decrease the number of operations in the scalar representation process. The objective of this research is to introduce an efficient design and … …Journal of Computer Science, Vol. 12, Issue 11 · 30 Dec 2016 · 6,678 accessesView PDFCite
Research ArticleOpen accessIn the abstractIntegrating a Repairing-based Genetic Algorithm-Neighborhood Search Structure in Solving the Course Timetabling ProblemChong-Keat Teoh, Habibollah Haron, Antoni Wibowo, Mohd. Salihin NgadimanThe course timetabling problem is not a trivial task as it is an NP-hard and NP-complete problem and many solutions have been proposed due to its high complexity search landscape. In essence, the nature of the course timetabling problem is to assign a lecturer-course entity to existing teaching venue and timeslot in an academic institution. In this article, the authors … …Journal of Computer Science, Vol. 12, Issue 10 · 15 Dec 2016 · 7,105 accessesView PDFCite
Research ArticleOpen accessIn the abstractCognitively Inspired Algorithm for Imprecise NavigationMelissa Shahrom, Zalilah Abd AzizThis paper presents an algorithm, namely the private navigation algorithm. The aim of this algorithm is to bridge the gap between high quality navigation services and low quality of location information or imprecise data. Generally, the imprecision is due to the poor positioning technology and the algorithms use to protect location privacy. The benefits of the algorithm are at least … …Journal of Computer Science, Vol. 12, Issue 6 · 14 Jul 2016 · 7,102 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Algorithm for Determining the Number of Mixture Components on the Bayesian Mixture Model Averaging for Microarray DataAni Budi Astuti, Nur Iriawan, Irhamah, Heri KuswantoThe major challenges on the statistical analysis of microarray data are the limited availability of samples, large number of measured variables and the complexity of distribution of the data obtained (e.g., multimodal). These phenomena could be considered in Bayesian method, used Bayesian Mixture Model (BMM) methods and Bayesian Model Averaging (BMA) methods. Modeling of Bayesian Mixture Model Averaging (BMMA) for … …Journal of Mathematics and Statistics, Vol. 11, Issue 2 · 28 Sep 2015 · 7,141 accessesView PDFCite