cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
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
Published by Institute of Advanced Engineering and Science
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 66 Documents
 3   4   5   6   7 
Search results for , issue "Vol 21, No 3: March 2021" : 66 Documents clear
A new modification of the quasi-newton method for unconstrained optimization Hamsa Th. Saeed Chilmeran; Huda I. Ahmed; Eman T. Hamed; Abbas Y. Al-Bayati
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 3: March 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i3.pp1683-1691

Abstract

In this work we propose and analyze a hybrid conjugate gradient (CG) method in which the parameter is computed as a linear combination between Hager-Zhang [HZ] and Dai-Liao [DL] parameters. We use this proposed method to modify BFGS method and to prove the positive definiteness and QN-conditions of the matrix. Theoretical trils confirm that the new search directions aredescent directions under some conditions, as well as, the new search directions areglobally convergent using strong Wolfe conditions. The numerical experiments show that the proposed method is promising and outperforms alternative similar CG-methods using Dolan-Mor'e performance profile. 
Secure image hiding in speech signal by steganography-mining and encryption Amal Hameed Khaleel; Iman Qays Abduljaleel
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 3: March 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i3.pp1692-1703

Abstract

Information hiding techniques are constantly evolving due to the increased need for security and confidentiality. This paper proposes a working mechanism in three phases. The first phase includes scrambling the values of the gray image depending on a series of keys that are generated using a quantum chaotic map. The second phase generates hybrid keys by mixing a Zaslavsky and a 3D Hanon map that are used to encrypt the gray image values produced after the scramble. Finally, in the third phase, a new algorithm is suggested to hide the encrypted gray image at random locations within a speech file.  This algorithm includes the LSB algorithm to determine the hidden bits and the zero-crossing K-means algorithm in selecting locations mining in a scattered manner so that hackers cannot easily retrieve the hidden data of any hacked person. Also used a fractional fourier transform to choose magnitude value as specific data to hide encoded image data. The measures MSE, PSNR, NSCR, and UACI are using to measure the work efficiency in the encryption algorithm, and in measuring the efficiency of the hidden algorithm, use the measures SNR, PSNR, and MSE. The results of the paper are encouraging and efficient compared to other algorithms that performed the same work. Hence our results show the larger the image dimensions used, the better the values.
Chaotic systems with pseudorandom number generate to protect the transmitted data of wireless network Heyam A. Marzog; Marwa Jaleel Mohsin; Mohammed Azher Therib
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 3: March 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i3.pp1602-1610

Abstract

Communication techniques have witnessed rapid development in recent years, especially the internet and the mobile network, which led to rapid data transmission. The latest developments, in turn, have come out with advanced decisions to secure information from eavesdropping. Myriad in-depth studies in cryptography. It was implemented with the intention of proposing a revolutionary solution to protect data by encryption techniques, tend maps, and logistics.  This work had proposed a new design to the generator of pseudo-random numbers (GPRN) which had utilized multi chaotic systems. Synchronization of Multi-parameters chaotic arises in many applications, in natural or industrial systems. Many methods have been introduced for using a chaotic system in the encryption of data. Analysis of security of chaotic system had been executed on key sensitivity and keyspace.
Novel method for calculating installed capacity of stand-alone renewable energy systems Tang-Tin Dao; Q. S. Vu; Van-Duc Phan; Minh Tran
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 3: March 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i3.pp1256-1262

Abstract

The use of new energy sources to replace traditional energy sources is the worldwide interest based on its irrefutable advantages, especially in regions where supply systems Power supply cannot reach. The devices installed capacity has a significant effect on the economy as well as on system operation. In this paper, formulate and solve the problem of optimizing installed capacity for devices (generators, charge controllers, storage, inverters) that are used in independent renewable energy systems. In illustrating this method of calculation, we apply it on a standalone system, i.e., it is not connected to the power supply grid.
Binding site identification of COVID-19 main protease 3D structure by homology modeling Marion Adebiyi; Oludayo O. Olugbara
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 3: March 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i3.pp1713-1721

Abstract

The influx of coronavirus in 2019 (COVID-19) from Wuhan of China has led to a global pandemic, undesirable hiatus, and recorded millions of infection cases with several deaths worldwide. The strain of COVID-19 has neither known treatments nor vaccines, but recent studies have shown that a few of its enzymes may have been considered as potential drug target. Since its influx, the virus has been well-studied, but a lot is not known about its protease yet.  The purpose of this work was to identify the binding site in-silico and present 3D structure of COVID-19 main protease (Mpro) by homology modeling through multiple alignment followed by optimization and validation. The modeling was done by Swiss-Model template library and basic local alignment search tool (BLAST). The obtained homotrimer oligo-state model was verified for reliability using structural validation software such as PROCHECK, Verify3D, MolProbity and QMEAN. The HHBlits software was used to determine the structures that matched the target sequence by evolution. Best template, 6u7h.1.A was used to build a tertiary structure for Mpro with ProMod3 3.0.0 on the Swiss-Model workspace. Self-optimized prediction method with alignment (SOPMA) was applied to compute features of the secondary structure. The verification of quality of COVID-19 structure through Ramachandran plot showed an abundance of 99.3% of amino acid residues in allowed regions while 0.1% in disallowed region. The Verify3D rated the structure a 90.87% PASS of residues having an average 3D-1D score of at least 0.2, which validates a good environment profile for the COVID-19 Mpro model. The features of the secondary structure indicated that the modeled 3D structure of Mpro contains 32.05% α-helix and 37.17% random coil with 25.92 extended strand. DeepSite algorithm elucidates the binding site area that captured local patterns in the structure and exposed the surface cavity of the binding pocket of this protein. The main result of this study suggests that blocking expression of the protein may constitute an efficient approach for transmission blockage. Hence, our thought is that Mpro of COVID-19 may be considered a potential drug target. Nevertheless, more experimental analyses, verification and validation experiments will be required as a targeted drug or vaccine design against COVID-19 virus.
Design and simulation of an adaptive beam smart antenna using MATLAB Aaron Don M. Africa; Rica Rizabel M. Tagabuhin; Jan Jayson S. D. Tirados
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 3: March 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i3.pp1584-1593

Abstract

Signals transmitted over a long range of distance may pass through several obstacles and scatter, taking multiple paths to reach the receiver. Beamforming antennas are controlled electronically to adjust the radiation pattern following the first received signal. This allows the antenna to maximize the received signal and consequently, suppress the interfering signals received. A smart antenna should be able to diminish noise, increase the signal to noise ratio, and have better system competence. The adaptive beam makes use of the spacing of the several antennas and the phase of the signal of each antenna array to control the shape and direction of the signal beam. This paper focuses on the use of smart antennas using an adaptive beam method as a better system for the transmission of signals. A simulation between the existing Omnidirectional antenna system and the smart antenna system will be made and compared. The paper will discuss the corresponding advantages that a smart antenna system has compared to the Omnidirectional antenna system.

Page 7 of 7 | Total Record : 66

 3   4   5   6   7 

Filter by Year

2021 2021


Reset
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