cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
Indonesian Journal of Electrical Engineering and Computer Science
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 70 Documents
Search results for , issue "Vol 21, No 1: January 2021" : 70 Documents clear
A modified fractal texture image analysis based on grayscale morphology for multi-model views in MR Brain Usha R; Perumal K
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp154-163

Abstract

This paper presents a modified fractal texture feature analysis with the use of grayscale image morphology for automatic image classification of different views in MR brain images into normal and abnormal. This main contribution of this approach is a reduction of the total number of a threshold value, and the number of image decomposition, in which only the number of extract threshold value two or three are enough for tumor region extraction - compared to four or more is required in the previous method of SFTA (segmentation based fractal texture analysis). This is achieved by pre-processing of hierarchical transformation technique (HTT), which make use of morphological image transformations with the desired structural element. From this decomposed images, mean, area, fractal dimension and selective shape features are extracted and fed into KNN and ensemble bagged tree classifiers. Finally, some of the post-processing is handled for tumor region extraction and tumor cells computation. It is found that this proposed approach has superior results in the segmentation of diseased tissue from normal tissue and the prediction of image classes in terms of accuracy with the less number of threshold extraction and image decomposition rather than the SFTA algorithm.
Conventional doped silica/fluoride glass fibers for low loss and minimum dispersion effects Aadel M. Alatwi; Ahmed Nabih Zaki Rashed
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp287-295

Abstract

This paper has clarified the conventional silica doped (SiGeO2) and aluminum fluoride (AlF3) fibers for low loss and minimum dispersion effects for upgrading fiber-optic communication systems. The total dispersion with the total losses are modeled for both fibers. Fiber bandwidth and the power received are estimated based on different dopant ratios. The spectral and thermal effects are applied on both fibers. The study assured the negative effects of increasing ambient temperatures and the positive effects of increasing dopant ratios on the performance of the fibers. 
TYPES AND PROCESS OF RISK MANAGEMENT alsaadat, khalil
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp%p

Abstract

The main objective of risk management is not to dampen swings in corporate cash flows or value, but rather to ensure  protection against the possibility of "costly lower-tail outcomes"-situations that would create financial difficulties or make an organization  unable to achieve  its investment plan .This paper discusses  types and  process of risk management and sheds some lights on the importance of this process on  various aspects of human lives ,environment and society organizations .Up on the discussion a risk management model is presented .
Stamps extraction using local adaptive k- means and ISODATA algorithms Maha A. Rajab; Loay E. George
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp137-145

Abstract

One of the main difficulties facing the certified documents documentary archiving system is checking the stamps system, but, that stamps may be contains complex background and surrounded by unwanted data. Therefore, the main objective of this paper is to isolate background and to remove noise that may be surrounded stamp. Our proposed method comprises of four phases, firstly, we apply k-means algorithm for clustering stamp image into a number of clusters and merged them using ISODATA algorithm. Secondly, we compute mean and standard deviation for each remaining cluster to isolate background cluster from stamp cluster. Thirdly, a region growing algorithm is applied to segment the image and then choosing the connected region to produce a binary mask for the stamp area. Finally, the binary mask is combined with the original image to extract the stamp regions. The results indicate that the number of clusters can be determined dynamically and the largest cluster that has minimum standard deviation (i.e., always the largest cluster is the background cluster). Also, show that the binary mask can be established from more than one segment to cover are all stamp’s disconnected pieces and it can be useful to remove the noise appear with stamp region.
The impact of user involvement in software development process Nouf Bin saif; Mashael Almohawes; Nor Shahida Mohd Jamail
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp354-359

Abstract

In software development process, user can take part in any phase of the process, depending on what model is being applied. Lack of user involvement can result in a poorly designed solution, or even a solution that conflicts with user’s needs. This review paper presents the impact of user involvement in software development process. In this study, different software development processes will be reviewed, show where the user usually gets involved in different models such as: Structural (Waterfall, V-model) and incremental (Scrum-extreme programming XP). As each model differs from the other, each of them has a different perspective of where user should take part and where they should not. This can be an asset that helps project managers, and leaders to develop suitable strategies to follow in their projects.
License plate recognition for campus auto-gate system Nur Liyana Yaacob; Ammar Ahmed Alkahtani; Fuad M. Noman; Ahmad Wafi Mahmood Zuhdi; Dhuha Habeeb
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp128-136

Abstract

Automatic licence plate recognition (LPR) has been a subject of study for the last few decades. Considering the recent advancements in machine learning methods and portable devices, this increasingly attracting researchers’ interest to provide more reliable LPR systems. Several LPR techniques have been reported in the literature in different intelligent transportation applications and surveillance systems, and yet a ropust LPR system remains a challenging research task. Because the performance of current techniques is subject to several factors and local conditions, this paper aims to explore the use of LPR in a specific application; i.e. Automatic plate recognition to monitor the entry and exit of vehicles at the university campus gates. Implementing an auto-gate system is an important application for a smooth control of flowing traffic especially during peak hours. We propose an automated system with the ability to capture, verify and recognize the license plates using image processing-based techniques. The system is aimed to work alongside existing access cards and other gate remote controls. Experimental evaluation of the system reveals a detection accuracy of 91.58%, a successful plate number segmentation rate of 91% and 80% accuracy of plate recognition.
A sustainable procedural method of software design process improvements Khalid T. Al-Sarayreh; Kenza Meridji; Mamdouh Alenezi; Mohammed Zarour; Mohammed D. Al-Majali
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp440-449

Abstract

In practice, the software process is an intermediate phase for enhancement and improvements the design for different types of software products and help developers to converts the specified requirements into prototypes that implement the design into reality. The objective of this paper is to provide software developers, designers and software engineers who work in small companies with a standards-based process improvement using a procedural method technique including detailed steps for designing the small software systems into their companies. The method used in this paper includes 1) analysis four different types of commonly design processes used by industry such as CMMI, conventional or software process in ISO 19759, generic and engineering design processes. 2)  mapping between those four design processes. 3) collect the dispersed design concepts proposed by those four processes. 4) proposed a sustainable procedural method of software design process improvements 5) Illustration of the applicability of the proposed approach using A template-based implementation. The primary result of this study is a guideline procedure with detailed steps for software design process improvements to help and guide developers in small companies to analyze and design a small software scales with limited cost and duration. In conclusion, this paper proposed a method to improve the design process for different kinds of the software systems using a template-based implementation to reduce the cost, effort and time needed in the implementation phase in small companies. The scientific implication behind a template-based implementation helps the system and software engineering to use this template easily in their small companies; because most of the time those engineering developers are responsible for analyzing, designing, implementing and testing their software systems during the whole software life cycle.
Regular clocking scheme based design of cost-efficient comparator in QCA Jayanta Pal; Mojtaba Noorallahzadeh; Jyotirmoy Sil Sharma; Dhrubajyoti Bhowmik; Apu Kumar Saha; Bibhash Sen
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp44-55

Abstract

Quantum-dot cellular automata (QCA) gained a notable attraction in the emerging nanotechnology to get the better of power consumption, density, nano-scale design, the performance of the present CMOS technology. Many designs had been proposed in QCA for an arithmetic circuit like adder, divider, parity checker and comparator etc. Most of the designs have been facing the challenges of cost efficiency, power dissi-pation, device density etc. However, consideration of design automation, underlying clocking layout and integration of the sub modules are the most important which has a direct impact on the fabrication of the design. This work proposed a novel cost ef-fective and power aware comparator design, which is an essential segment in central processing unit (CPU). The noticeable novelty of the design was the use of underlying regular clocking scheme. A new scalable, regular clocking scheme has been utilized in the coplanar design of the comparator which enables regular or uniform cell layout of QCA circuit. It also exhibited the significant improvement over existing counterparts having irregular clocking in terms of area and latency. QCADesigner was used to test and verify the functionality of the circuit and by using QCAPro the power dissipation has been analyzed.
Network size variation of geographical aided routing protocols in MANET Radhwan B. Al-Bayram; Radhwan M. Abdullah
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp420-428

Abstract

In position-based or geo-casting ad hoc networking applications, the data packets flooded in a limited area of the expected region toward the destination node. In such networks, a multi-hop routing is to followed when the position of the destination node is residing off-range the wireless transmission of the source node. Scientific literature references in this concept have been conducted depended on the diversity of quantitative metrics-tests regarding the size of the assigned networks so that this space is intended to be the variation in the density of the moving nodes (the number of nodes per unit of measurement). In this work, we studied the impact of the change in the size (area) of the ad hoc network with the concept of variation in the network's area while remaining the total number of nodes as a constant volume. In this paper, three of the position-based routing protocols have evaluated in terms of a network size variation. These routing protocols are: locations aided routing LAR, the distance routing effect algorithm for mobility DREAM, and the greedy perimeter stateless routing GPSR. With each simulation test, a quantitative metrics evaluation determined the most efficient protocol and the most efficient accessibility with the network environment changes in terms of actual workspace. 
Classification of a COVID-19 dataset by using labels created from clustering algorithms Layth Rafea; Abdulrahman Ahmed; Wisam D. Abdullah
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp164-173

Abstract

Novel coronavirus (COVID-19) is a newly discovered infectious disease that has received much attention in the literature because of its rapid spread and daily global deaths attributable to such disease. The White House, together with a coalition of leading research groups, has published the freely available COVID-19 Open Research Dataset to help the global research community apply the recent advances in natural language processing and other AI techniques in generating novel insights that can support the ongoing fight against this disease. In this paper, the hierarchical and k-means clustering techniques are used to create a tool for identifying similar articles on COVID-19 and filtering them based on their titles. These articles are classified by applying three data mining techniques, namely, random forest (RF), decision tree (DT) and bagging. By using this tool, specialists can limit the number of articles they need to study and pre-process these articles via data framing, tokenisation, normalisation and term frequency-inverse document frequency. Given its 2D nature, the dimensionality of this dataset is reduced by applying t-SNE. The aforementioned data mining techniques are then cross validated to test the accuracy, precision and recall performance of the proposed tool. Results show that the proposed tool effectively extracts the keywords for each cluster, with RF, DT and bagging achieving optimal accuracies of 98.267%, 97.633% and 97.833%, respectively.

Filter by Year

2021 2021


Filter By Issues
All Issue Vol 41, No 2: February 2026 Vol 41, No 1: January 2026 Vol 40, No 3: December 2025 Vol 40, No 2: November 2025 Vol 40, No 1: October 2025 Vol 39, No 3: September 2025 Vol 39, No 2: August 2025 Vol 39, No 1: July 2025 Vol 38, No 3: June 2025 Vol 38, No 2: May 2025 Vol 38, No 1: April 2025 Vol 37, No 3: March 2025 Vol 37, No 2: February 2025 Vol 37, No 1: January 2025 Vol 36, No 3: December 2024 Vol 36, No 2: November 2024 Vol 36, No 1: October 2024 Vol 35, No 3: September 2024 Vol 35, No 2: August 2024 Vol 35, No 1: July 2024 Vol 34, No 3: June 2024 Vol 34, No 2: May 2024 Vol 34, No 1: April 2024 Vol 33, No 3: March 2024 Vol 33, No 2: February 2024 Vol 33, No 1: January 2024 Vol 32, No 3: December 2023 Vol 32, No 1: October 2023 Vol 31, No 3: September 2023 Vol 31, No 2: August 2023 Vol 31, No 1: July 2023 Vol 30, No 3: June 2023 Vol 30, No 2: May 2023 Vol 30, No 1: April 2023 Vol 29, No 3: March 2023 Vol 29, No 2: February 2023 Vol 29, No 1: January 2023 Vol 28, No 3: December 2022 Vol 28, No 2: November 2022 Vol 28, No 1: October 2022 Vol 27, No 3: September 2022 Vol 27, No 2: August 2022 Vol 27, No 1: July 2022 Vol 26, No 3: June 2022 Vol 26, No 2: May 2022 Vol 26, No 1: April 2022 Vol 25, No 3: March 2022 Vol 25, No 2: February 2022 Vol 25, No 1: January 2022 Vol 24, No 3: December 2021 Vol 24, No 2: November 2021 Vol 24, No 1: October 2021 Vol 23, No 3: September 2021 Vol 23, No 2: August 2021 Vol 23, No 1: July 2021 Vol 22, No 3: June 2021 Vol 22, No 2: May 2021 Vol 22, No 1: April 2021 Vol 21, No 3: March 2021 Vol 21, No 2: February 2021 Vol 21, No 1: January 2021 Vol 20, No 3: December 2020 Vol 20, No 2: November 2020 Vol 20, No 1: October 2020 Vol 19, No 3: September 2020 Vol 19, No 2: August 2020 Vol 19, No 1: July 2020 Vol 18, No 3: June 2020 Vol 18, No 2: May 2020 Vol 18, No 1: April 2020 Vol 17, No 3: March 2020 Vol 17, No 2: February 2020 Vol 17, No 1: January 2020 Vol 16, No 3: December 2019 Vol 16, No 2: November 2019 Vol 16, No 1: October 2019 Vol 15, No 3: September 2019 Vol 15, No 2: August 2019 Vol 15, No 1: July 2019 Vol 14, No 3: June 2019 Vol 14, No 2: May 2019 Vol 14, No 1: April 2019 Vol 13, No 3: March 2019 Vol 13, No 2: February 2019 Vol 13, No 1: January 2019 Vol 12, No 3: December 2018 Vol 12, No 2: November 2018 Vol 12, No 1: October 2018 Vol 11, No 3: September 2018 Vol 11, No 2: August 2018 Vol 11, No 1: July 2018 Vol 10, No 3: June 2018 Vol 10, No 2: May 2018 Vol 10, No 1: April 2018 Vol 9, No 3: March 2018 Vol 9, No 2: February 2018 Vol 9, No 1: January 2018 Vol 8, No 3: December 2017 Vol 8, No 2: November 2017 Vol 8, No 1: October 2017 Vol 7, No 3: September 2017 Vol 7, No 2: August 2017 Vol 7, No 1: July 2017 Vol 6, No 3: June 2017 Vol 6, No 2: May 2017 Vol 6, No 1: April 2017 Vol 5, No 3: March 2017 Vol 5, No 2: February 2017 Vol 5, No 1: January 2017 Vol 4, No 3: December 2016 Vol 4, No 2: November 2016 Vol 4, No 1: October 2016 Vol 3, No 3: September 2016 Vol 3, No 2: August 2016 Vol 3, No 1: July 2016 Vol 2, No 3: June 2016 Vol 2, No 2: May 2016 Vol 2, No 1: April 2016 Vol 1, No 3: March 2016 Vol 1, No 2: February 2016 Vol 1, No 1: January 2016 Vol 16, No 3: December 2015 Vol 16, No 2: November 2015 Vol 16, No 1: October 2015 Vol 15, No 3: September 2015 Vol 15, No 2: August 2015 Vol 15, No 1: July 2015 Vol 14, No 3: June 2015 Vol 14, No 2: May 2015 Vol 14, No 1: April 2015 Vol 13, No 3: March 2015 Vol 13, No 2: February 2015 Vol 13, No 1: January 2015 Vol 12, No 12: December 2014 Vol 12, No 11: November 2014 Vol 12, No 10: October 2014 Vol 12, No 9: September 2014 Vol 12, No 8: August 2014 Vol 12, No 7: July 2014 Vol 12, No 6: June 2014 Vol 12, No 5: May 2014 Vol 12, No 4: April 2014 Vol 12, No 3: March 2014 Vol 12, No 2: February 2014 Vol 12, No 1: January 2014 Vol 11, No 12: December 2013 Vol 11, No 11: November 2013 Vol 11, No 10: October 2013 Vol 11, No 9: September 2013 Vol 11, No 8: August 2013 Vol 11, No 7: July 2013 Vol 11, No 6: June 2013 Vol 11, No 5: May 2013 Vol 11, No 4: April 2013 Vol 11, No 3: March 2013 Vol 11, No 2: February 2013 Vol 11, No 1: January 2013 Vol 10, No 8: December 2012 Vol 10, No 7: November 2012 Vol 10, No 6: October 2012 Vol 10, No 5: September 2012 Vol 10, No 4: August 2012 Vol 10, No 3: July 2012 More Issue