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 9,174 Documents
 657   658   659   660   661 
Overlapping clustering with k-median extension algorithm: An effective approach for overlapping clustering Alvincent E. Danganan; Regina P. Arceo
Indonesian Journal of Electrical Engineering and Computer Science Vol 26, No 3: June 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v26.i3.pp1607-1615

Abstract

Most natural world data involves overlapping communities where an object may belong to one or more clusters, referred to as overlapping clustering. However, it is worth mentioning that these algorithms have a significant drawback. Since some of the algorithm uses k-means, it also inherits the characteristics of being noise sensitive due to the arithmetic mean value which noisy data can considerably influence and affects the clustering algorithm by biasing the structure of obtained clusters. This paper proposed a new overlapping clustering algorithm named OCKMEx, which uses k-median to identify overlapping clusters in the presence of outliers. This new method aims to determine the insensitivity of the OCKMEx algorithm in locating data points that overlap even with outliers. An experimental evaluation of the algorithm was conducted wherein synthetic datasets served as a data source, and the F1 measure criterion was applied to assess the OCKMEx algorithm performance. Results indicate that the OCKMEx algorithm implementing the use of k-median performed a higher accuracy rate of 100% in identifying data points that overlap even with outliers compared to the existing k-means algorithm. The algorithm exhibited a promising performance in identifying overlapping clusters and was resistant to outliers.
Orchid conservation development at Mudal River by using remote sensing Baritoadi Buldan Rayaganda Rito; Muhammad Muhajir; Rahmadi Yotenka; Novendri Isra Asriny; R.A. Nurul F.A. Asnawi
Indonesian Journal of Electrical Engineering and Computer Science Vol 26, No 2: May 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v26.i2.pp1009-1017

Abstract

Daerah Istimewa Yogyakarta (DIY) is a district in Yogyakarta that contains various tourist attractions (ODTW) such as the Mudal River, attracting many local and international visitors each year. However, this region must be developed by identifying the best conservation position. Technology is required to explore the geographical aspects in establishing ecotourism in order to complete this process. This study sought to determine the most appropriate new development for the Mudal River, taking into account environmental variables, site area, orchid growing demands, ease of access, and commercialization. This is accomplished by employing a remote sensing technique based on the overlay technique. As a consequence of the investigation, three sites have been identified as the most plausible candidates. The analysis identified three areas that are most likely to be used as conservation sites: an orchid cultivation house, an orchid garden area that may be used as a photo location, and an orchid education garden.
Stereo matching algorithm based on combined matching cost computation and edge preserving filters Madiha Zahari; Rostam Affendi Hamzah; Nurulfajar Abd Manap; Adi Irwan Herman
Indonesian Journal of Electrical Engineering and Computer Science Vol 26, No 3: June 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v26.i3.pp1415-1422

Abstract

The stereo matching process is one of the key areas that impact the stereo vision technologies which are commonly used in the application of three-dimensional reconstructions. The accuracy of the depth information used in three-dimensional reconstruction is directly proportional to the accuracy of the disparity obtained from stereo matching. The challenging issue in the stereo matching process is to determine the accurate corresponding point between the left image and right image, especially for image pairs that have different exposure such as different illumination and image pair with less texture region. In order to increase the accuracy of disparity value, a new stereo matching algorithm is proposed based on the combination of Sum of absolute different and census transform at matching cost computation. guided filter was used in the matching cost aggregation in order to remove noise and preserve the edge of the image. In the optimization step, the winner take all strategy is used to select the minimum matching cost. Finally, a median filter is applied to the initial disparity map for refinement purposes. The experimental results show that the algorithm is effective in reducing the error and improving the accuracy of the disparity map in different illumination regions, less textured regions and different environmental exposure.
Power loss minimization with simultaneous location and sizing of distribution generation units using artificial algae algorithm Vineeta S. Chauhan; Jaydeep Chakravorty
Indonesian Journal of Electrical Engineering and Computer Science Vol 26, No 1: April 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v26.i1.pp28-36

Abstract

Power loss is one of the important pointers used to measure the performance of distributions networks. Many optimization algorithms have been proposed to solve various optimal power flow problems in Electrical Engineering. In this paper, a novel technique, artificial algae algorithm is developed to robustly detect the optimal location and size of distributed generation (DG) units for minimization of total power losses without violating the equality and inequality constraints. The main objective of optimal power flow (OPF) is to maximize or minimize the objective function using various constraint so that steady-state operation point is achieved. The concept of optimal power flow in power system helps to minimize real power loss. In the proposed approach, various control variables like generator bus, voltage magnitudes, and transformer tap settings are considered. The proposed algorithm is simulated in MATLAB and effectiveness is carried on IEEE 33 bus radial distribution system and satisfactory results are achieved when compared with other optimization techniques. A notable improvement in reduction of active power losses with 3 DG operating at different power factors are 65.5%, 42.4%, and 77.8% respectively, were achieved in comparison to the system without DGs and as compared with other research papers.
Design of Wilkinson power divider at 28 GHz for 5G applications Nurfarhana Nabila Ridzuan; Norun Farihah Abdul Malek; Farah Nadia Mohd Isa; Md. Rafiqul Islam; Ku Chui Choon Ivan; Nidal Qasem
Indonesian Journal of Electrical Engineering and Computer Science Vol 26, No 3: June 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v26.i3.pp1444-1450

Abstract

A power divider plays a significant function in antenna’s feeding network. Many types of power divider exist yet there are only a few existing studies of Wilkinson power dividers at high frequencies (28 GHz) for 5G communications systems. This paper presents a tapered 2-way Wilkinson power divider that operates in Malaysia's 5G wireless communication band (28 GHz). CST microwave studio is used to design, simulate, and optimize the tapered 2-way Wilkinson divider. The simulation results show resonance around 23.5-37.9 GHz. The operating frequency of 28 GHz resulted in power division with a 3.2 dB insertion loss and has an isolation of 19.21 dB. The design can be made wideband with equal power division at each output port by adding an extra resistor along the tapered line to reduce output return loss and isolation, as demonstrated in this paper.
A new properties of fuzzy b-metric spaces Mayada N. Mohammed Ali; Raghad I. Sabri; Fatema Ahmad Sadiq
Indonesian Journal of Electrical Engineering and Computer Science Vol 26, No 1: April 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v26.i1.pp221-228

Abstract

Metric spaces are specific types of topological spaces with pleasing “geometric” characteristics and they have a number of appealing properties and are commonly used in both pure and applied sciences. In this work, the structure of cartesian product space in the setting of a fuzzy b-metric space (Fb-M space) framework is introduced, which is an extension allows to create the large-scale structure for the space of the type fuzzy b-metric. The possibility of transferring some of the results and important features related to Fb-M space to this suggested space are discussed and demonstrated. The Cartesian product of two Fb-M spaces is proved as Fb-M space, this allows, to investigate and prove the topological expectation on the fuzzy product b-metric space. Furthermore, certain specific fuzzy b-metrics on F2, and fuzzy Euclidean plane are obtained in this way.
Review on maintenance of photovoltaic systems based on deep learning and internet of things Younes Hammoudi; Idriss Idrissi; Mohammed Boukabous; Youssef Zerguit; Hicham Bouali
Indonesian Journal of Electrical Engineering and Computer Science Vol 26, No 2: May 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v26.i2.pp1060-1072

Abstract

Many solar plants have been installed globally, and they must be continuously protected and supervised to ensure their safety and reliability. Photovoltaic plants are susceptible to many defects and failures, and fault detection technology is used to protect and isolate them. Despite numerous international standards, invisible photovoltaic defects continue to cause major issues. As a result, smart technologies like AI (Artificial Intelligence) and IoT are being developed for remote sensing, problem detection, and diagnosis of photovoltaic systems. Solar plants generate not only green electricity but also a lot of data, such as power output. With AI, a clear picture of electricity yields should be possible. The output of entire solar parks could be monitored and analyzed. The AI could also detect malfunctions within a solar park, according to the research. This would speed up and simplify maintenance work. Deep learning (DL) and IoT applications for photovoltaic plants are discussed. The most advanced techniques, such as DL, are discussed in terms of precision and accuracy. Incorporating DL and IoT approaches for fault detection and diagnosis into simple hardware, such as low-cost chips, maybe cost-effective and technically feasible for photovoltaic facilities located in remote locations.
Design of a compact and miniature band-pass filter for global positioning system applications Amal Kadiri; Abdelali Tajmouati; Jamal Zbitou; Issam Zahraoui; Mohamed Latrach
Indonesian Journal of Electrical Engineering and Computer Science Vol 26, No 3: June 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v26.i3.pp1274-1280

Abstract

In this paper, a novel compact band pass filter (BPF) is proposed for global positioning system (GPS) applications. The proposed filter which is based on a microstrip resonator is mounted on a low cost RO4000 substrate with a dielectric constant εr=3.5, a thickness h=1.542 mm, a loss tangent tan (δ)=0.0027. It has a bandwidth from 1.55 GHz to 1.72 GHz. This filter is optimized and validated by using two electromagnetic solvers. The area occupied by this BPF is 33.6×41.24 mm2. The final circuit is a low cost BPF and can be associated with passive and active circuits due to the miniature dimensions.
Enhancing extreme learning machines classification with moth-flame optimization technique Oyekale Abel Alade; Roselina Sallehuddin; Nor Haizan Mohamed Radzi
Indonesian Journal of Electrical Engineering and Computer Science Vol 26, No 2: May 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v26.i2.pp1027-1035

Abstract

Extreme Learning Machine (ELM) algorithm assigns the input weights and biases in a “one-time stamp” fashion, this method makes the algorithm to be ill-conditioned and reduces its classification accuracy. The contribution of this work is the enhancement of the performance of ELM with the Moth-Flame Optimization (MFO) algorithm to improve classification accuracy. A hybrid of the Moth-Flame Optimization and Extreme Learning Machine (MFO-ELM) algorithm is implemented in MATLAB. MFO ensures a concurrent simulation of exploration and exploitation of the search space to select an optimum candidate solution. The candidate solution is reshaped into input weights and biases for ELM classification. The hybrid algorithm is validated on five life-selected datasets. The performance improvement of MFO-ELM is compared with ELM-optimized Particle Swarm Optimization (PSO-ELM) and Competitive Swarm Optimization (CSO-ELM) algorithms. The improvement rates are qualitatively and quantitatively evaluated to show the improvement of MFO-ELM on ELM and the other meta-heuristic algorithms. MFO-ELM improved the accuracies of the basic ELM in all 100% of the simulations and performed better than the other meta-heuristic algorithms in 80% of the simulations. The performance of MFO-ELM is more competitive, and it is recommended for solving classification problems.
Performance improvement on spectral efficiency and peak to avearge power reduction for 5G system Kavitha Thandapani; Ganesamoorthy Raju; Maniganda Pujali
Indonesian Journal of Electrical Engineering and Computer Science Vol 26, No 2: May 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v26.i2.pp888-894

Abstract

Filter bank multicarrier with offset quadrature amplitude modulation (FMBC/OQAM) system which can offer higher data rate 1 Gbps and improved bandwidth efficiency because of not require of cyclic prefix (CP) to avoid interference from the adjacent channels compared to fourth generation (4G) orthogonal frequency division multiplexing (OFDM) and other wireless systems. Because of these advantages FBMC/OQAM are used in fifth generation (5G) technology. In this FBMC/OQAM system, bandwidth capacity will be further increased by using multiple input multiple output (MIMO) channel. But in our proposed scheme we can use hyper–MIMO channel, in which at base station (BS) more number of transmitting antennas are used that for the improve the spectral efficiency performance better than traditional MIMO channel. But the most important drawback of hyper MIMO FBMC/OQAM is the higher peak to average-power ratio (PAPR) that degrade overall system performance in 5G. In 4G technology, to reduce PAPR a number of techniques are used. In our proposed system we can use mu-law non-linear companding technique and precoding discrete cosine transform (DCT) to reduce PAPR value for multicarrier modulation system compare to other systems.

Page 659 of 918 | Total Record : 9174

 657   658   659   660   661 

Filter by Year

2012 2026


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