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,199 Documents
 116   117   118   119   120 
Building Integrated Photovoltaic is a Cost Effective and Environmental friendly Solution M T ripathy; P K Sadhu
Indonesian Journal of Electrical Engineering and Computer Science Vol 14, No 1: April 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Building integrated photovoltaic (BIPV) market is under developing stage with a relatively low number of installations worldwide. However, integrating photovoltaic technology into buildings is straight forward as no additional space is required and building materials are simply replaced by PV modules. Although BIPV is considered a promising technology, especially where land for large-scale PV plants is rare, several factors continue to constrain its wide-spread adoption BIPV thus promises to become an attractive alternative for both end users and for national policy makers. In this paper we analyse the investment of BIPV, benefits of BIPV power system and cost of BIPV power system. DOI: http://dx.doi.org/10.11591/telkomnika.v14i1.7729 
Motor Fault Diagnosis Based on Wavelet Transform Lijun Wang; Huijuan Guo; Shenfeng Zhang
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 9: September 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The wavelet transform theory is used to motor fault diagnosis in this paper, considering its characteristics of multi-resolution and stronger feature extraction ability than Fourier. The paper emphasizes de-noising and eliminating the singular value point of the wavelet transform in the non-stationary signal. And it makes a detailed and in-depth analysis about how to detect the frequency components of weak signal by using equivalent power spectrum of reconstruction signal, which is acquired by using the wavelet transform. Through the comparison analysis of the simulation signal and motor vibration signal’s experimental data, the corresponding energy of original signal’s equivalent power spectrum and reconstructing signal’s equivalent power spectrum are compared to determine the fault frequency, so as to accurately find out the motor fault. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3288 
A comparative analysis of classification techniques on predicting flood risk Nazri Mohd Nawi; Mokhairi Makhtar; Mohd Zaki Salikon; Zehan Afizah Afip
Indonesian Journal of Electrical Engineering and Computer Science Vol 18, No 3: June 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v18.i3.pp1342-1350

Abstract

Flood is a temporary overflow of a dry area due to overflow of excess water, runoff surface waters or undermining of shoreline. In Malaysia itself in 2014, the country grieved with the catastrophic flood event in Kuala Krai, Kelantan, which caused of human lives, public assets and money lost. Due to uncertainties in flooding event, it is vital for Malaysia to have pre-warning system that assist related agencies in to categorize land areas that face high risk of flood so preventive actions can be planned in place. This paper conducts a comparative analysis of three classifications in classifying the risk of flood, whether high or low. The classification experiment conducts using three variants of Bayesian approaches, which are Bayesian Networks (BN), Naive Bayes (NB), and Tree Augmented Naive Bayes (TAN). The outcome of this research shows that Tree Augmented Naive Bayes (TAN) has the best algorithms as compared to others algorithms in classifying the risk of flood.
Task view reduction Algorithm based on Rough sets in Gloud Storage Yiyi Xu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Knowledge reduction is one of the important research issues in rough set theory, which applies knowledge reduction theory to reduction the massive task sets in Gloud storage. At first, an equivalence class evolved from subviews will be obtained after task update, Then, a parallel running strategy is designed for large-scale data , and calculate the optimal attributes based on the task set with minimal time overhead, to this end, delete redundant views according to the optimal attribute sets. Finally, the optimized task combination views are obtained. Simulation results shows it has better overall performance in time span, runtime, speed-up ratio and scalability when compared with the original algorithm that under same conditions, the actual examples used in analysis indicate the effectiveness of this method. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4282
Relationship Network Analysis of Manufacturing System Limited by Business Lines CHEN Guorong; DENG Juli; SHI Jinliang; YAN Ping
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 6: October 2012
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

It is a common problem of manufacturing enterprise limited by business line, which optimized its resources allocation to increase productivity, but now the researches are very weak in relationship mapping and network analysis method in the world. Aimed to the demands, proposed a resource allocation method limited by business line of manufacturing system based on the relational mapping of production system, manufacturing model of hierarchical network based on business line and node degree are been established. Defined the data structure of node on hierarchical network, simplified the network computing by dividing it to three parts - orders assignment, accomplish feedback and pure information exchange. Analyzed the distributing of network degree, established an equation of power law which has two limited parameters of node degree and side weight to automatic compute the amounts of resources of new order. Case study shows that the network analysis method limited business line proposed in the paper can give us an important reference frame of resources assignment. DOI: http://dx.doi.org/10.11591/telkomnika.v10i6.1415
Distributed Fast Maximum Power Point Tracking Technique for Mismatched Module Application M.I.M. Zakki; M.N.M. Hussain; I.R. Ibrahim; N.A. Ismail; M.N. Ibrahim
Indonesian Journal of Electrical Engineering and Computer Science Vol 6, No 2: May 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v6.i2.pp225-232

Abstract

This paper propose distributed fast maximum power point tracking (DFMPPT) technique to achieve maximum power point tracking (MPPT). This paper implements the algorithm in distributed MPPT (DMPPT) architecture for mismatched condition with single module, and string connection. The MPPT method uses indirect and direct MPPT method by fractional open-circuit voltage (FOCV) with incremental conductance (INC) for high-speed maximum energy harvesting. This method is proven to be fast for tracking maximum power point (MPP) which achieves the peak power less in 1.7ms via for a single module with efficiency of 99.7% compared to the recent MPPT technique to reach MPP in 1.75ms with 95.8% efficiency. While for string configuration, the efficiency of the whole system is rated by 85.583% by taking 8.675ms to reach global MPP.
A simulation based performance evaluation of optical ethernet switch Dawit Hadush Hailu; Gebrehiwet Gebrekrstos Lema; Gebremichael T. Tesfamariam; Tole Sutikno
Indonesian Journal of Electrical Engineering and Computer Science Vol 17, No 3: March 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v17.i3.pp1639-1646

Abstract

With the advent of several new cloud radio access network (C-RAN) technologies, today’s networking environment is dramatically altered and is experiencing a rapid transformation. One of the most important is ethernet based C-RAN, in support of which many products such as optical Ethernet switches have recently appeared on the market. This paper presents the performance analysis of such switches with respect to packet loss ratio (PLR), latency and packet delay variation (PDV). We employed the Simula based on discrete event modelling on Simula (DEMOS), a context class for discrete event simulation to simulate a cut-through optical ethernet switch under two types of traffics: high priority (HP) traffic and low priority (LP) traffic. In this way, the paper evaluates the optical Ethernet switch performance quantitatively. The results obtained from the simulator showed that the high quality of service was reflected on HP traffic and the low quality of service in LP traffic. Hence, HP traffic can be used for transporting radio over ethernet (RoE) traffic while LP traffic can used for transporting time insensitive application. It is also found that HP traffic experiences a PDV equals to the duration of maximum sized LP traffic in Optical Ethernet switch.
Improved Information Systems Model for Bangladesh Jahangir Alam S.M.; Hu Guoqing; M. Rabiul Alam; Md. Golam Kibria; Md. Abdul Malek
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 7: July 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i7.pp4893-4899

Abstract

In the era of globalization, implementation of e-Government (e-Gov) is very crucial because it modernizes the public and private sector for the well being of people. To build the electronic based automatic governance for improving the quality of public services is the prime measure for implementation of e-Governance in Bangladesh. Interoperability is a key issue in implementing an e-Government system. To create a general platform for sharing and exchanging information among different institutions is essential for interoperability. Grid Computing based service could be a solution for resource sharing and interoperability of e-Gov systems.  It is important to prepare standard policies and guidelines for e-Governance so that the desired expectations of interoperability between central and local government agencies can be achieved. Bangladesh government needs a specific policy which will deal with interoperability and ensure transparency and accountability in the Grid Computing Model. 
Chaotic Prediction for Traffic Flow of Improved BP Neural Network Yue Hou; Yuemei Mai
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 3: March 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

A prediction algorithm for traffic flow prediction of BP neural based on Differential Evolution(DE) is proposed to overcome the problems such as long computing time and easy to fall into local minimum by combing DE and neural network . In the algorithm, DE is used to optimize the thresholds and weights of BP neural network, and the BP neural network is used to search for the optimal solution. The efficiency of the proposed prediction method is tested by the simulation of two typical chaotic time series and real traffic flow. The simulation results show that the proposed method has higher precision compared with the traditional BP neural network，so prove it is feasible and effective in the practical prediction of traffic flow. DOI: http://dx.doi.org/10.11591/telkomnika.v11i3.2324
An adaptive gravitational search algorithm for global optimization Ying-Ying Koay; Jian-Ding Tan; Chin-Wai Lim; Siaw-Paw Koh; Sieh-Kiong Tiong; Kharudin Ali
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 2: November 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i2.pp724-729

Abstract

Optimization algorithm has become one of the most studied branches in the fields of artificial intelligent and soft computing. Many powerful optimization algorithms with global search ability can be found in the literature. Gravitational Search Algorithm (GSA) is one of the relatively new population-based optimization algorithms. In this research, an Adaptive Gravitational Search Algorithm (AGSA) is proposed. The AGSA is enhanced with an adaptive search step local search mechanism. The adaptive search step begins the search with relatively larger step size, and automatically fine-tunes the step size as iterations go. This enhancement grants the algorithm a more powerful exploitation ability, which in turn grants solutions with higher accuracies. The proposed AGSA was tested in a test suit with several well-established optimization test functions. The results showed that the proposed AGSA out-performed other algorithms such as conventional GSA and Genetic Algorithm in the benchmarking of speed and accuracy. It can thus be concluded that the proposed AGSA performs well in solving local and global optimization problems. Applications of the AGSA to solve practical engineering optimization problems can be considered in the future.

Page 118 of 920 | Total Record : 9199

 116   117   118   119   120 

Filter by Year

2012 2026


Reset
Filter By Issues
All Issue Vol 41, No 3: March 2026 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