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 111 Documents
 1   2   3   4   5 
Search results for , issue "Vol 14, No 2: April 2024" : 111 Documents clear
An algorithm for decomposing variations of 3D model Phuong, Tran Thanh; Hien, Lam Thanh; Duc Vinh, Ngo; Manh Toan, Ha; Nang Toan, Do
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp1928-1936

Abstract

In recent times, there has been an increasing number of people who are concerned about the virtual reality field. Parameterization of deformations of 3D models is a meaningful problem in theoretical research and application development of virtual reality. This paper proposes a technique for conditional decomposition of 3D model variations based on a given set of 3D observations of an object, along with a set of input strain weights. The proposed algorithm is conducted through an optimal iterative process with solving the non-negative least squares problem. The output of the technique is a set of base models corresponding to different types of strain. The result of the proposed technique allows the creation of a new 3D model variant of the object in a simple and visually observable way. The algorithm has been tested and proven effective on data that are 3D face models created from the Japanese Female Facial Expression (JAFFE) dataset with labeled expression weights.
Cloud service ranking with an integration of k-means algorithm and decision-making trail and evaluation laboratory approach Goyal, Pooja; Singh Deora, Sukhvinder
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp1816-1824

Abstract

The present research focuses on ranking cloud services by using the k-means algorithm with multi-criteria decision-making (MCDM) approaches that are the prime factor in the decision-making process and have been used to choose cloud services. The tools offered by MCDM can solve almost any decision-making problem. When faced with a selection challenge in the cloud environment, the trusted party would need to weigh the client’s choice against a predetermined list of criteria. There is a wide range of approaches to evaluating the quality of cloud services. The deep learning model has been considered a branch of artificial intelligence that assesses datasets to perform training and testing and makes decisions accordingly. This paper presents a concise overview of MCDM approaches and discusses some of the most commonly used MCDM methods. Also, a model based on deep learning with the k-means algorithm based decision-making trial and evaluation laboratory (kDE-MATEL) and analytic network process (ANP) is proposed as k-means algorithm based decision-making trial and evaluation laboratory with analytic network process (kD-ANP) for selecting cloud services. The proposed model uses the k-means algorithm and gives different levels of priority and weight to a set of criteria. A traditional model is also compared with a proposed model to reflect the efficiency of the proposed approach.
Efficient wireless power transfer for a moving electric vehicle by digital control of frequency Yamaguchi, Kazuya; Okamura, Ryusei; Yian Kiat, Adrian Wee; Iida, Kenichi
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp1308-1313

Abstract

Recently, demand for electric vehicles has been increasing as a countermeasure against global warming, but they currently face many problems compared to gasoline-powered vehicles. For example, charging takes time, and there are few places where electric vehicles can be charged. If AC power supplies that can transfer energy to electric vehicles wirelessly exist under the lanes where electric vehicles drive, the cruising range will be increased. In this study, assuming wireless power transfer to a moving electric vehicle, an experiment was conducted to light up a light-emitting diode (LED) on a moving electric model car. To improve the efficiency of transfer, the optimal frequency for the position of the electric model car was calculated, and the value was fed back to the power supply to adjust the frequency in real time.
System call frequency analysis-based generative adversarial network model for zero-day detection on mobile devices Chhaybi, Akram; Lazaar, Saiida
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp1969-1978

Abstract

In today's digital age, mobile applications have become essential in connecting people from diverse domains. They play a crucial role in enabling communication, facilitating business transactions, and providing access to a range of services. Mobile communication is widespread due to its portability and ease of use, with an increasing number of mobile devices projected to reach 18.22 billion by the end of 2025. However, this convenience comes at a cost, as cybercriminals are constantly looking for ways to exploit security vulnerabilities in mobile applications. Among the several varieties of malicious applications, zero-day malware is particularly dangerous since it cannot be removed by antivirus software. To detect zero-day Android malware, this paper introduces a novel approach based on generative adversarial networks (GANs), which generates new frequencies of feature vectors from system calls. In the proposed approach, the generator is fed with a mixture of real samples and noise, and then trained to create new samples, while the discriminator model aims to classify these samples as either real or fake. We assess the performance of our model through different measures, including loss functions, the Frechet Inception distance, and the inception score evaluation metrics.
Proposal of a similarity measure for unified modeling language class diagram images using convolutional neural network Jebli, Rhaydae; El Bouhdidi, Jaber; Yassin Chkouri, Mohamed
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp1979-1986

Abstract

The unified modeling language (UML) represents an essential tool for modeling and visualizing software systems. UML diagrams provide a graphical representation of a system's components. Comparing and processing these diagrams, for instance, can be complicated, especially as software projects grow in size and complexity. In such contexts, deep learning techniques have emerged as a promising solution for solving complex problems. One of these crucial problems is the measurement of similarity between images, making it possible to compare and calculate the differences between two given diagrams. The present work intends to build a method for calculating the degree of similarity between two UML class diagrams. With a goal to provide teachers a helpful tool for assessing students' UML class diagrams.
Fuzzy linear programming with the intuitionistic polygonal fuzzy numbers Alrefaei, Mahmoud H.; Tuffaha, Marwa Z.
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp2242-2253

Abstract

In real world applications, data are subject to ambiguity due to several factors; fuzzy sets and fuzzy numbers propose a great tool to model such ambiguity. In case of hesitation, the complement of a membership value in fuzzy numbers can be different from the non-membership value, in which case we can model using intuitionistic fuzzy numbers as they provide flexibility by defining both a membership and a non-membership functions. In this article, we consider the intuitionistic fuzzy linear programming problem with intuitionistic polygonal fuzzy numbers, which is a generalization of the previous polygonal fuzzy numbers found in the literature. We present a modification of the simplex method that can be used to solve any general intuitionistic fuzzy linear programming problem after approximating the problem by an intuitionistic polygonal fuzzy number with n edges. This method is given in a simple tableau formulation, and then applied on numerical examples for clarity.
Recognition of music symbol notation using convolutional neural network Setyo, Ciara; Kusuma, Gede Putra
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp2055-2067

Abstract

Musical notation is one thing that needs to be learned to play music. This notation has an important role in music because it can help in visualizing instructions for playing musical instruments and singing. Unfortunately, musical symbols that are commonly written in musical notation are difficult for beginners who have just started learning music. This research proposed a solution to create an optical music recognition (OMR) using a deep learning model to classify musical notes more accurately with some of the latest convolutional neural network (CNN) architectures. The research was carried out by implementing vision transformer (ViT), CoAtNet-0, and ConvNeXt-Tiny architecture. The training process was also combined with data augmentation to provide more information for the model to learn. Then the accuracy results of each model were compared to find out the best model for the OMR solution in this research. This experiment uses the Andrea dataset and Attwenger dataset which both get the best result by using the augmentation method and ConvNeXt-Tiny as the model. The best accuracy for the Andrea dataset is 98.15% and for the Attwenger dataset is 98.43%.
Design of storage benchmark kit framework for supporting the file storage retrieval Naazre Vittal Rao, Sanjay Kumar; Munegowda, Keshava
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp1750-1758

Abstract

An open-source software framework called the storage benchmark kit (SBK) is used to store the system benchmarking performance framework. The SBK is designed to perform any storage client or device using any data type as a payload. SBK simultaneously helps number of readers as well as writes to the storage system of large amounts of data as well as allows end-to-end latency benchmarking for multiple writers and readers. The SBK uses standardized performance measures for comparing and evaluating various storage systems and their combinations. Distributed file systems, distributed database systems, single or local node databases, systems of object storage, platforms of distributed streaming and messaging, and systems of key-value storage are the storage solutions supported by SBK. The SBK supports various storage systems like XFS, Kafka streaming storage systems, and Hadoop distributed file system (HDFS) performance benchmarking. The experimental results show that a proposed method achieves execution time of 65.530 s, 40.826 s and 30.351 s for the 100k, 500k and 1000k files respectively which ensures better improvement than the existing methods such as simple data interface and distributed data protection system.
Efficient criticality oriented service brokering policy in cloud datacenters Subramanian, Shanmugapriya; Natarajan, Priya
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp2024-2034

Abstract

Cloud service provider (CSP) offers a huge number of datacenters and virtual servers to the users for processing their workloads in an infrastructure as a service (IaaS) cloud computing environment. Due to the heterogeneous volume of these resources and the immense number of user workloads arriving simultaneously in the cloud, it is necessary to use an effective load distribution technique for scheduling the resources to achieve high performance and high user satisfaction. Service brokering policy and load balancing techniques are the two crucial areas to be focused on while selecting the datacenters and virtual machines, respectively. In this study, we have proposed a dynamic efficient criticality-oriented service brokering policy for load allocations among datacenters by considering task criticality, datacenter proximity, and traffic, the size of the datacenter, its present load and makespan value. The proposed methodology is examined against the current policies in the CloudAnalyst simulation tool and the analysis report confirms that our proposed policy gives priority to processing the urgent loads and chooses the optimum datacenter to diminish the load response time, datacenter processing time, minimizes the cost, achieves optimum resource utilization and workload balancing among resources.
Development of system for generating questions, answers, distractors using transformers Barlybayev, Alibek; Matkarimov, Bakhyt
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 2: April 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i2.pp1851-1863

Abstract

The goal of this article is to develop a multiple-choice questions generation system that has a number of advantages, including quick scoring, consistent grading, and a short exam period. To overcome this difficulty, we suggest treating the problem of question creation as a sequence-to-sequence learning problem, where a sentence from a text passage can directly mapped to a question. Our approach is data-driven, which eliminates the need for manual rule implementation. This strategy is more effective and gets rid of potential errors that could result from incorrect human input. Our work on question generation, particularly the usage of the transformer model, has been impacted by recent developments in a number of domains, including neural machine translation, generalization, and picture captioning.

Page 2 of 12 | Total Record : 111

 1   2   3   4   5 

Filter by Year

2024 2024


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