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 6,301 Documents
 501   502   503   504   505 
Food sales prediction model using machine learning techniques Merdas, Hussam Mezher; Mousa, Ayad Hameed
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp6578-6585

Abstract

Food sales prediction means how to obtain future results of sales of companies. The purpose of this step is to increase the profits of these companies by avoiding spoilage of food products and avoiding buying more quantities than the needs of these companies, which means the accumulation of these products in the warehouses without selling them. Stocked and expired products require a model that guesses the actual future need for these products. In this study, a model for food sales prediction using machine learning algorithms is proposed to achieve two objectives, first: make a comparison between two datasets, one dataset with a high correlation between its features, and another dataset has a low correlation between its features. The second objective is to use several machine learning algorithms for prediction and comparing between these algorithms to find the best three algorithms that give the best prediction. By using the most important metrics such as root mean square error (RMSE) and mean square error (MSE) found the best three algorithms by using the first dataset are support vector machines (SVMs), least absolute shrinkage and selection operator (LASSO), and bagging regressor) and the best three algorithms by using the second dataset are (gradient boosting, random forest regressor, and decision tree).
Low complexity physical layer security approach for 5G internet of things Shanbhag, Kiran Vinayak; Sathish, Dayakshini
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp6466-6475

Abstract

Fifth-generation (5G) massive machine-type communication (mMTC) is expected to support the cellular adaptation of internet of things (IoT) applications for massive connectivity. Due to the massive access nature, IoT is prone to high interception probability and the use of conventional cryptographic techniques in these scenarios is not practical considering the limited computational capabilities of the IoT devices and their power budget. This calls for a lightweight physical layer security scheme which will provide security without much computational overhead and/or strengthen the existing security measures. Here a shift based physical layer security approach is proposed which will provide a low complexity security without much changes in baseline orthogonal frequency division multiple access (OFDMA) architecture as per the low power requirements of IoT by systematically rearranging the subcarriers. While the scheme is compatible with most fast Fourier transform (FFT) based waveform contenders which are being proposed in 5G especially in mMTC and ultra-reliable low latency communication (URLLC), it can also add an additional layer of security at physical layer to enhanced mobile broadband (eMBB).
A module placement scheme for fog-based smart farming applications Mohamed, Baghrous; Abdellatif, Ezzouhairi; Mouhajir, Manal; Zerifi, Manare; Rabah, Yahya; Youssef, Errafik
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp7089-7098

Abstract

As in Industry 4.0 era, the impact of the internet of things (IoT) on the advancement of the agricultural sector is constantly increasing. IoT enables automation, precision, and efficiency in traditional farming methods, opening up new possibilities for agricultural advancement. Furthermore, many IoT-based smart farming systems are designed based on fog and edge architecture. Fog computing provides computing, storage, and networking services to latency-sensitive applications (such as Agribots-agricultural robots-drones, and IoT-based healthcare monitoring systems), instead of sending data to the cloud. However, due to the limited computing and storage resources of fog nodes used in smart farming, designing a modules placement scheme for resources management is a major challenge for fog based smart farming applications. In this paper, our proposed module placement algorithm aims to achieve efficient resource utilization of fog nodes and reduce application delay and network usage in Fog-based smart farming applications. To evaluate the efficacy of our proposal, the simulation was done using iFogSim. Results show that the proposed approach is able to achieve significant reductions in latency and network usage.
Dynamic Hilbert clustering based on convex set for web services aggregation Al-Musawi, Nawras A.; Al-Shammary, Dhiah
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp6654-6662

Abstract

In recent years, web services run by big corporations and different application-specific data centers have all been embraced by several companies worldwide. Web services provide several benefits when compared to other communication technologies. However, it still suffers from congestion and bottlenecks as well as a significant delay due to the tremendous load caused by a large number of web service requests from end users. Clustering and then aggregating similar web services as one compressed message can potentially achieve network traffic reduction. This paper proposes a dynamic Hilbert clustering as a new model for clustering web services based on convex set similarity. Mathematically, the suggested models compute the degree of similarity between simple object access protocol (SOAP) messages and then cluster them into groups with high similarity. Next, each cluster is aggregated as a compact message that is finally encoded by fixed-length or Huffman. The experiment results have shown the suggested model performs better than the conventional clustering techniques in terms of compression ratio. The suggested model has produced the best results, reaching up to 15 with fixed-length and up to 20 with Huffman
Fault localization on power cables using time delay estimation of partial discharge signals Fern, Chin Kui; Yii, Chai Chang; Bakar, Asfarina Abu; Saad, Ismail; Tze Kin, Kenneth Teo; Ikhsan Megat Hasnan, Megat Muhammad; Mohamad, Nur Aqilah
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp6000-6015

Abstract

Precise localization of partial discharge (PD) sources on power cables is vital to prevent power line failures that can lead to significant economic losses for electrical suppliers. This study proposes four methods to estimate the time delay of PD signals under electromagnetic interference, including white Gaussian noise (WGN) and discrete sinusoidal interference (DSI), using denoised PD signals with signal-to-noise ratios ranging from 10.6 to -7.02 dB. The maximum peak detection (MPD) and cross-correlation (CC) approaches, as well as two new techniques, interpolation cross-correlation (ICC) and envelope cross-correlation (ECC), are evaluated for their effectiveness in PD source localization. The researchers employ the time difference of arrival (TDoA) algorithm to compute PD location using the double-end PD location algorithm, where the PD location precision serves as an indicator of the accuracy of the time delay estimation methods. The study concludes that CC and ICC are the most suitable methods for estimating the time delay of PD signals in the PD location algorithm, as they exhibit the lowest error rates. These results suggest that CC and ICC can be used effectively for precise PD source localization under electromagnetic interference on power cables.
Development of spiral square coils for magnetic labelling detection in microfluidic systems Feddag, Abdelhadi; Mekkakia-Maaza, Nasr-Eddine; Lakhdari, Abdelghani
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp6037-6046

Abstract

Due to the development of microfluidic systems biomedical microelectromechanical systems (BioMEMS) for magnetic labelling detection by magnetic microbeads circling in microfluidic channels, we used the magnetic field created by microcoils. The magnetic field associated with the electric current, but with negatively affects if its value increases too much. Handling bio-species in the microfluidic chip requires that the temperature maintained to keep the cells to prevent their destruction. In this paper we have described the spiral square coil design of different structures to produce an effective magnetic flux density. The simulation of the magnetic flux density is carried out with the help of the COMSOL software. We have presented an optimization of the geometric parameters of the microcoil for a better performance and a miniaturization of the structure with copper wire section S=25 µm2 and inter-wire space a=5 µm. We have also developed this microcoil by adding a ferromagnetic core to the inner center, the results obtained in this work shown that the magnetic flux density increases around 1.07 times in Bx and 1.45 times in Bz. This new approach in designing a microcoil allows to obtaining a fast trapping of the microbeads and a highly sensitive biological element detection and avoiding increase heat ratio in microfluidic systems.
Implementing sharing platform based on ontology using a sequential recommender system Ragala, Zaynabe; Retbi, Asmaâ; Bennani, Samir
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp6754-6763

Abstract

While recommender systems have shown success in many fields, accurate recommendations in industrial settings remain challenging. In maintenance, existing techniques often struggle with the “cold start” problem and fail to consider differences in the target population's characteristics. To address this, additional user information can be incorporated into the recommendation process. This paper proposes a recommender system for recommending repair actions to technicians based on an ontology (knowledge base) and a sequential model. The approach utilizes two ontologies, one representing failure knowledge and the other representing asset attributes. The proposed method involves two steps: i) calculating score similarity based on ontology domain knowledge to make predictions for targeted failures and ii) generating Top-N repair actions through collaborative filtering recommendations for targeted failures. An additional module was implemented to evaluate the recommender system, and results showed improved performance.
An efficient reconfigurable workload balancing scheme for fog computing network using internet of things devices Puttaswamy, Nandini Gowda; Murthy, Anitha Narasimha
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp6525-6537

Abstract

Nowadays a huge amount of data has been communicated using fog nodes spread throughout smarty cities. the communication process is performed using fog nodes which are co-located with cellular base stations (BSs) that can move the computing resources close to internet of things (IoT) devices. In smart cities, a different type of data flow has been communicated through IoT devices. The communication process performs efficiently using the remote cloud. The IoT devices very close to the BS can communicate data without using fog nodes. Due to these phenomena, workload unbalancing occurs in IoT devices communicating in fog computing networks. Hence, it generates communication and computing latency. The task distribution process between the IoT devices is unbalanced. Hence, congestion and loss of information occur in fog computing network. A proposed reconfigurable load balancing algorithm (RLBA) is efficiently balancing the workload by reconfigurable communication channels and deviates the task with respect to the BS locations, IoT devices density and load IoT devices in each fog nodes in a network to minimize the communication and computing latency. As per the performance analysis, the proposed algorithm shows better performance as compared to conventional methods’ average latency ratio, communication latency ratio, computing load and traffic load.
Interconnecting industrial multi-microgrids using bidirectional hybrid energy links Lourido, Walter Naranjo; Sanz, Fredy Alberto; Rodriguez Umaña, Luis Alfredo
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp5966-5974

Abstract

Sharing and exchange energy among nearby industrial microgrids are crucial, especially with high energy requirements for their production targets and costly energy storage systems that may be oversized for their operations. Facilitating energy exchange can provide an economic advantage for industrial production by utilizing cheaper energy sources and reducing production costs. This manuscript presents an efficient approach for transferring large energy packets with minimal energy losses using high-voltage direct current (HVDC) energy transmission. The manuscript methodology focuses on implementing an industrial multi-microgrid using a modular multilevel converter. This converter utilizes two power link channels: a three-phase AC and an HVDC link, creating a hybrid energy transmission between microgrids. When a substantial amount of energy to transfer, the HVDC method enhances overall efficiency by reducing copper losses and mitigating issues associated with the AC link, such as harmonics and skin effects. The modular multilevel converter topology offers high flexibility and the use of fewer converters. Additionally, the HVDC link eliminates distance restrictions for energy transfer between industrial microgrids. A case study illustrates the functionality of this topology, demonstrating optimized power transfer and decreased energy losses. This methodology allows industrial microgrids to enhance energy efficiency and productivity while minimizing operational costs.
A survey of scan-capture power reduction techniques Sontakke, Vijay; Dickhoff, John
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp6118-6130

Abstract

With the advent of sub-nanometer geometries, integrated circuits (ICs) are required to be checked for newer defects. While scan-based architectures help detect these defects using newer fault models, test data inflation happens, increasing test time and test cost. An automatic test pattern generator (ATPG) exercise’s multiple fault sites simultaneously to reduce test data which causes elevated switching activity during the capture cycle. The switching activity results in an IR drop exceeding the devices under test (DUT) specification. An increase in IR-drop leads to failure of the patterns and may cause good DUTs to fail the test. The problem is severe during at-speed scan testing, which uses a functional rated clock with a high frequency for the capture operation. Researchers have proposed several techniques to reduce capture power. They used various methods, including the reduction of switching activity. This paper reviews the recently proposed techniques. The principle, algorithm, and architecture used in them are discussed, along with key advantages and limitations. In addition, it provides a classification of the techniques based on the method used and its application. The goal is to present a survey of the techniques and prepare a platform for future development in capture power reduction during scan testing.

Page 503 of 631 | Total Record : 6301

 501   502   503   504   505 

Filter by Year

2011 2026


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