cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Tole Sutikno
Contact Email
ijece@iaesjournal.com
Phone
-
Journal Mail Official
ijece@iaesjournal.com
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
International Journal of Electrical and Computer Engineering
Published by Institute of Advanced Engineering and Science
ISSN : 20888708     EISSN : 27222578     DOI : -
Core Subject : Science, Engineering,
Computer Science & IT Electrical & Electronics Engineering
International Journal of Electrical and Computer Engineering (IJECE, ISSN: 2088-8708, a SCOPUS indexed Journal, SNIP: 1.001; SJR: 0.296; CiteScore: 0.99; SJR & CiteScore Q2 on both of the Electrical & Electronics Engineering, and Computer Science) is the official publication of the Institute of Advanced Engineering and Science (IAES). The journal is open to submission from scholars and experts in the wide areas of electrical, electronics, instrumentation, control, telecommunication and computer engineering from the global world.
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 96 Documents
 6   7   8   9   10 
Search results for , issue "Vol 11, No 3: June 2021" : 96 Documents clear
Solving the order batching and sequencing problem with multiple pickers: A grouped genetic algorithm Jose Alejandro Cano; Pablo Cortés; Emiro Antonio Campo; Alexander Alberto Correa-Espinal
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 3: June 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i3.pp2516-2524

Abstract

This paper introduces a grouped genetic algorithm (GGA) to solve the order batching and sequencing problem with multiple pickers (OBSPMP) with the objective of minimizing total completion time. To the best of our knowledge, for the first time, an OBSPMP is solved by means of GGA considering picking devices with heterogeneous load capacity. For this, an encoding scheme is proposed to represent in a chromosome the orders assigned to batches, and batches assigned to picking devices. Likewise, the operators of the proposed algorithm are adapted to the specific requirements of the OBSPMP. Computational experiments show that the GGA performs much better than six order batching and sequencing heuristics, leading to function objective savings of 18.3% on average. As a conclusion, the proposed algorithm provides feasible solutions for the operations planning in warehouses and distribution centers, improving margins by reducing operating time for order pickers, and improving customer service by reducing picking service times.
Hybrid memristor-CMOS implementation of logic gates design using LTSpice Wan Mohd Hashimi Wan Mohamad Sharif; Mohd Faizul Md Idros; Syed Abdul Mutalib Al-Junid; Fairul Nazmi Osman; Abdul Hadi Abdul Razak; Abdul Karimi Halim; Muhammad Adib Harun
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 3: June 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i3.pp2003-2010

Abstract

In this paper, a hybrid memristor-CMOS implementation of logic gates simulated using LTSpice. Memristors' implementation in computer architecture designs explored in various design structures proposed by researchers from all around the world. However, all prior designs have some drawbacks in terms of applicability, scalability, and performance. In this research, logic gates design based on the hybrid memristor-CMOS structure presented. 2-inputs AND, OR, NAND, NOR, XOR, and XNOR are demonstrated with minimum components requirements. In addition, a 1-bit full adder circuit with high performance and low area consumption is also proposed. The proposed full adder only consists of 4 memristors and 7 CMOS transistors. Half design of the adder base on the memristor component created. Through analysis and simulations, the memristor implementation on designing logic gates using memristor-CMOS structure demonstrated using the generalized metastable switch memristor (MSS) model and LTSpice. In conclusion, the proposed approach improves speed and require less area.
Comparison of mutual information and its point similarity implementation for image registration Wassim El Hajj Chehade; Peter Rogelj
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 3: June 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i3.pp2613-2620

Abstract

Mutual information (MI) is one of the most popular and widely used similarity measures in image registration. In traditional registration processes, MI is computed in each optimization step to measure the similarity between the reference image and the moving image. The presumption is that whenever MI reaches its highest value, this corresponds to the best match. This paper shows that this presumption is not always valid and this leads to registration error. To overcome this problem, we propose to use point similarity measures (PSM) which in contrast to MI allows constant intensity dependence estimates called point similarity functions (PSF). We compare MI and PSM similarity measures in terms of registration misalignment errors. The result of the comparison confirms that the best alignment is not at the highest value of MI but near to it and it shows that PSM performs better than MI if PSF matches the correct intensity dependence between images. This opens a new direction of research towards the improvement of image registration.
A systematic review on sequence-to-sequence learning with neural network and its models Hana Yousuf; Michael Lahzi; Said A. Salloum; Khaled Shaalan
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 3: June 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i3.pp2315-2326

Abstract

We develop a precise writing survey on sequence-to-sequence learning with neural network and its models. The primary aim of this report is to enhance the knowledge of the sequence-to-sequence neural network and to locate the best way to deal with executing it. Three models are mostly used in sequence-to-sequence neural network applications, namely: recurrent neural networks (RNN), connectionist temporal classification (CTC), and attention model. The evidence we adopted in conducting this survey included utilizing the examination inquiries or research questions to determine keywords, which were used to search for bits of peer-reviewed papers, articles, or books at scholastic directories. Through introductory hunts, 790 papers, and scholarly works were found, and with the assistance of choice criteria and PRISMA methodology, the number of papers reviewed decreased to 16. Every one of the 16 articles was categorized by their contribution to each examination question, and they were broken down. At last, the examination papers experienced a quality appraisal where the subsequent range was from 83.3% to 100%. The proposed systematic review enabled us to collect, evaluate, analyze, and explore different approaches of implementing sequence-to-sequence neural network models and pointed out the most common use in machine learning. We followed a methodology that shows the potential of applying these models to real-world applications.
A hybrid objective function with empirical stability aware to improve RPL for IoT applications Abdelhadi Eloudrhiri Hassani; Aicha Sahel; Abdelmajid Badri; El Mourabit Ilham
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 3: June 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i3.pp2350-2359

Abstract

The diverse applications of the internet of things (IoT) require adaptable routing protocol able to cope with several constraints. Thus, RPL protocol was designed to meet the needs for IoT networks categorized as low power and lossy networks (LLN). RPL uses an objective function based on specific metrics for preferred parents selection through these packets are sent to root. The single routing metric issue generally doesn’t satisfy all routing performance requirements, whereas some are improved others are degraded. In that purpose, we propose a hybrid objective function with empirical stability aware (HOFESA), implemented in the network layer of the embedded operating system CONTIKI, which combines linearly three weighty metrics namely hop count, RSSI and node energy consumption. Also, To remedy to frequent preferred parents changes problems caused by taking into account more than one metric, our proposal relies on static and empirical thresholds. The designed HOFESA, evaluated under COOJA emulator against Standard-RPL and EC-OF, showed a packet delivery ratio improvement, a decrease in the power consumption, the convergence time and DIO control messages as well as it gives network stability through an adequate churn.
Comparative analysis of multiple classification models to improve PM10 prediction performance Yong-Jin Jung; Kyoung-Woo Cho; Jong-Sung Lee; Chang-Heon Oh
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 3: June 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i3.pp2500-2507

Abstract

With the increasing requirement of high accuracy for particulate matter prediction, various attempts have been made to improve prediction accuracy by applying machine learning algorithms. However, the characteristics of particulate matter and the problem of the occurrence rate by concentration make it difficult to train prediction models, resulting in poor prediction. In order to solve this problem, in this paper, we proposed multiple classification models for predicting particulate matter concentrations required for prediction by dividing them into AQI-based classes. We designed multiple classification models using logistic regression, decision tree, SVM and ensemble among the various machine learning algorithms. The comparison results of the performance of the four classification models through error matrices confirmed the f-score of 0.82 or higher for all the models other than the logistic regression model.

Page 10 of 10 | Total Record : 96

 6   7   8   9   10 

Filter by Year

2021 2021


Reset
Filter By Issues
All Issue Vol 16, No 1: February 2026 Vol 15, No 6: December 2025 Vol 15, No 5: October 2025 Vol 15, No 4: August 2025 Vol 15, No 3: June 2025 Vol 15, No 2: April 2025 Vol 15, No 1: February 2025 Vol 14, No 6: December 2024 Vol 14, No 5: October 2024 Vol 14, No 4: August 2024 Vol 14, No 3: June 2024 Vol 14, No 2: April 2024 Vol 14, No 1: February 2024 Vol 13, No 6: December 2023 Vol 13, No 5: October 2023 Vol 13, No 4: August 2023 Vol 13, No 3: June 2023 Vol 13, No 2: April 2023 Vol 13, No 1: February 2023 Vol 12, No 6: December 2022 Vol 12, No 5: October 2022 Vol 12, No 4: August 2022 Vol 12, No 3: June 2022 Vol 12, No 2: April 2022 Vol 12, No 1: February 2022 Vol 11, No 6: December 2021 Vol 11, No 5: October 2021 Vol 11, No 4: August 2021 Vol 11, No 3: June 2021 Vol 11, No 2: April 2021 Vol 11, No 1: February 2021 Vol 10, No 6: December 2020 Vol 10, No 5: October 2020 Vol 10, No 4: August 2020 Vol 10, No 3: June 2020 Vol 10, No 2: April 2020 Vol 10, No 1: February 2020 Vol 9, No 6: December 2019 Vol 9, No 5: October 2019 Vol 9, No 4: August 2019 Vol 9, No 3: June 2019 Vol 9, No 2: April 2019 Vol 9, No 1: February 2019 Vol 8, No 6: December 2018 Vol 8, No 5: October 2018 Vol 8, No 4: August 2018 Vol 8, No 3: June 2018 Vol 8, No 2: April 2018 Vol 8, No 1: February 2018 Vol 7, No 6: December 2017 Vol 7, No 5: October 2017 Vol 7, No 4: August 2017 Vol 7, No 3: June 2017 Vol 7, No 2: April 2017 Vol 7, No 1: February 2017 Vol 6, No 6: December 2016 Vol 6, No 5: October 2016 Vol 6, No 4: August 2016 Vol 6, No 3: June 2016 Vol 6, No 2: April 2016 Vol 6, No 1: February 2016 Vol 5, No 6: December 2015 Vol 5, No 5: October 2015 Vol 5, No 4: August 2015 Vol 5, No 3: June 2015 Vol 5, No 2: April 2015 Vol 5, No 1: February 2015 Vol 4, No 6: December 2014 Vol 4, No 5: October 2014 Vol 4, No 4: August 2014 Vol 4, No 3: June 2014 Vol 4, No 2: April 2014 Vol 4, No 1: February 2014 Vol 3, No 6: December 2013 Vol 3, No 5: October 2013 Vol 3, No 4: August 2013 Vol 3, No 3: June 2013 Vol 3, No 2: April 2013 Vol 3, No 1: February 2013 Vol 2, No 6: December 2012 Vol 2, No 5: October 2012 Vol 2, No 4: August 2012 Vol 2, No 3: June 2012 Vol 2, No 2: April 2012 Vol 2, No 1: February 2012 Vol 1, No 2: December 2011 Vol 1, No 1: September 2011 More Issue