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,226 Documents
 272   273   274   275   276 
New symmetric key cipher capable of digraph to single letter conversion utilizing binary system Najdavan Abduljawad Kako; Haval Tariq Sadeeq; Araz Rajab Abrahim
Indonesian Journal of Electrical Engineering and Computer Science Vol 18, No 2: May 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v18.i2.pp1028-1034

Abstract

In this paper, a new Playfair cipher built on bits level symmetric key cryptographic was proposed for the purpose of converting pairs of letters (digraphs) into single letters. The proposed algorithm is capable to overcome many of the shortcoming and vulnerabilities that exist in the current classical version of Playfair algorithm. The Playfair cipher is exceedingly complex than a classical substitution cipher, but still simple to hack using automated tactics. It is famous as a digraph cipher because two letters are exchanged by other two letters. This destroys any solo letter occurrence statistics, but the digraph statistics still unaffected (frequencies of two letters). Unluckily letter pairs have a flatter distribution than the one letter frequencies, so this intricacy matters for solving the code using pen and paper procedures. The suggested encryption process is conducted as follows; letters are first arranged in a spiral manner in Polybius square, afterwards, each pair will be replaced utilizing before-after technique if we are arranging pairs horizontally and down-up technique (vertically). The former process produces pairs of Plaintext that will be converted to binary bit stream then will be divided over blocks with stable sizes. Bits of these blocks are taken from pairs then fit them into square matrix of suitable order to put the concept of row-wise and revers row-wise matrix. Bits of this matrix are split into 2x2 square matrixes. The sub-matrixes are formed 8 bits. Here the XNOR operation is taken into consideration for bitwise operation to generate the keys for decryption and produce the cipher-text.
Comparisons of Threshold EZW and SPIHT Wavelets Based Image Compression Methods Xiaofeng Wu; Shigang Hu; Zhiming Li; Zhijun Tang; Jin Li; Jin Zhao
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

Images require substantial storage and transmission resources, thus image compression is advantageous to reduce these requirements. The objective of this paper is to implement the concept of wavelet based image compression to gray scale images using different wavelet techniques. The techniques involved in the comparison process are threshold method, EZW(embedded zerotree wavelet) and SPIHT(set partitioning in hierarchical trees). These techniques are more efficient and provide a better quality in the image.  Matlab is used to be carried out the simu1ation where different wavelet and different methods for image compression are applied. The techniques are compared by using the performance parameters CR (Compression Ratio), PSNR (Peak Signal to Noise Ratio), MSE (Mean Square Error), and BPP (Bits per Pixel). Images obtained with those techniques yield very good results. The results showed that the compression effect of wavelet threshold compression is not good; wavelet decomposition level and wavelet function impact on the compression effect; Wavelet based image compression based on EZW and SPIHT are more efficient. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4437
Study on the Linearly Range of S-Shaped MEMS Planar Micro-spring Guozhong Li; Li Sui; Gengchen Shi
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

For the lack of formula of linear range for S-shaped MEMS planar micro-spring, this paper establishes physical and mathematical model and analysis the material stress-strain angle. The formula is deduced by calculating the strain and rotation of the basic unit of micro-spring tension. Compared with the results of the tests on micro-spring which produced by UV-LIGA process, the formula results is in about 10% higher, providing theoretical guidance for the design and application of S-shaped MEMS planar micro-spring in engineering practice. DOI: http://dx.doi.org/10.11591/telkomnika.v10i6.1427
A Comparison Study of Learning Algorithms for Estimating Fault Location Mimi Nurzilah Hashim; Muhammad Khusairi Osman; Mohammad Nizam Ibrahim; Ahmad Farid Abidin; Ahmad Asri Abd Samat
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.pp464-472

Abstract

Fault location is one of the important scheme in power system protection to locate the exact location of disturbance. Nowadays, artificial neural networks (ANNs) are being used significantly to identify exact fault location on transmission lines. Selection of suitable training algorithm is important in analysis of ANN performance. This paper presents a comparative study of various ANN training algorithm to perform fault location scheme in transmission lines. The features selected into ANN is the time of first peak changes in discrete wavelet transform (DWT) signal by using faulted current signal acted as traveling wave fault location technique. Six types commonly used backpropagation training algorithm were selected including the Levenberg-Marquardt, Bayesian Regulation, Conjugate gradient backpropagation with Powell-Beale restarts, BFGS quasi-Newton, Conjugate gradient backpropagation with Polak-Ribiere updates and Conjugate gradient backpropagation with Fletcher-Reeves updates. The proposed fault location method is tested with varying fault location, fault types, fault resistance and inception angle. The performance of each training algorithm is evaluated by goodness-of-fit (R2), mean square error (MSE) and Percentage prediction error (PPE). Simulation results show that the best of training algorithm for estimating fault location is Bayesian Regulation (R2 = 1.0, MSE = 0.034557 and PPE = 0.014%).
Classification of Prostate Cancer using Wavelet Neural Network Mohanad Najm Abdulwahed
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: December 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i3.pp968-973

Abstract

Prostate cancer is the century disease that endanger the life of men. The earlier to diagnose the disease, the probability of curing this disease is higher. Therefore, new approaches of diagnosis is required to effectively detect the prostate cancer in early stage compared to the traditional methods. Therefore, WNN is a new adopted approach in prostate cancer diagnosis. Morlet function is used as an activation function of wavelet neural network (WNN) and back propagation (BP) is applied to train the Wavelet network. WNN classifies prostate cancer according to three factors: patient age, PSA level, and prostate volume. WNN performance is evaluated based on the percentage of classification and the computational complexity of several cases. The results of the simulation show that WNN has lower mean squared error (MSE) than the Neural Network (NN).
Robust Weighted Measurement Fusion Kalman Predictors with Uncertain Noise Variances Wen-juan Qi; Peng Zhang; Gui-huan Nie; Zi-li Deng
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 6: June 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

For the multisensor system with uncertain noise variances, using the minimax robust estimation principle, the local and weighted measurement fusion robust time-varying Kalman predictors are presented based on the worst-case conservative system with the conservative upper bound of noise variances. The actual prediction error variances are guaranteed to have a minimal upper bound for all admissible uncertainties of noise variances. A Lyapunov approach is proposed for the robustness analysis and their robust accuracy relations are proved. It is proved that the robust accuracy of weighted measurement robust fuser is higher than that of each local robust Kalman predictor. Specially, the corresponding steady-state robust local and weighted measurement fusion Kalman predictors are also proposed and the convergence in a realization between time-varying and steady-state Kalman predictors is proved by the dynamic error system analysis (DESA) method. A Monte-Carlo simulation example shows the effectiveness of the robustness and accuracy relations. DOI : http://dx.doi.org/10.11591/telkomnika.v12i6.5453
Analysis on Service Life of Hot-end Components of Gas Turbine Using Equivalent Operation Taixing Wang; Xiaoqing Lv
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

The reliability of the gas turbine depends on the technical status and the maintenance level of the hot-end components in a large part.The three main factors influencing on the service life of the hot-end components of the gas turbine were analyzed first.On this basis,various common service life assessment methods for gas turbine were discussed in detail.Aiming at the features of the M701F gas-steam combined cycle unit in Huizhou LNG power plant,a gas turbine life assessment method based on equivalent operation time analysis was put forward.The calculation result of an example shows that the equivalent operation time analysis method is a simple and practical assessment method. DOI: http://dx.doi.org/10.11591/telkomnika.v11i3.2229
Unit commitment based reliability analysis with contingency constraint Raheema Syed; P. Srinivasa Varma; R. B. R Prakash; Ch. Rami Reddy
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 1: October 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i1.pp74-81

Abstract

Unit commitment state’s the strategic choice to be prepared in order to define which of the accessible power plants should be taken into account to supply power. It permits utilities to reduce generation price of power. In this paper, the unit commitment problem is elucidated by taking N-1-1 contingency as a foremost constraint. The standard N-1-1 contingency takes the loss of sequential two components in the network having intervening interval for network modifications in the middle of two losses. The crucial objective to carry out contingency constrictions is to make certain that the operations of power system are adequately strong to unexpected losses of the components of the network. The optimal scheduling/allocation of the generating units is resolved by taking into account the N-1-1 criterion of contingency. By considering the N-1-1 criterion of contingency, the problem results to give an optimised model which is a linear model of mixed integer form. The linear program of mixed integer is a technique of an operational assessment in which restriction is imposed on few variables to be integers. Primarily benders decomposition was considered but for the improvement of results, the algorithm of branch and cut is presented. IEEE 30 bus system is taken into consideration and widespread analysis is accomplished to associate performance of the system under N-1-1 criterion contingency. The computational outcomes determine the value for taking into concern the intervening interval for the adjustments of the system with respect to the cost and robustness of the system. Later to the above model reliability assessment is proposed to calculate the Loss Of Load Expected (LOLE). This model is solved using MATLAB/MATPOWER software.
Featureless EMG pattern recognition based on convolutional neural network Too Jing Wei; Abdul Rahim Bin Abdullah; Norhashimah Binti Mohd Saad; Nursabillilah Binti Mohd Ali; Tengku Nor Shuhada Binti Tengku Zawawi
Indonesian Journal of Electrical Engineering and Computer Science Vol 14, No 3: June 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v14.i3.pp1291-1297

Abstract

In this paper, the performance of featureless EMG pattern recognition in classifying hand and wrist movements are presented. The time-frequency distribution (TFD), spectrogram is employed to transform the raw EMG signals into time-frequency representation (TFR). The TFRs or spectrogram images are then directly fed into convolutional neural network (CNN) for classification. Two CNN models are proposed to learn the features automatically from the images without the need of manual feature extraction. The performance of CNN with different number of convolutional layers is examined. The proposed CNN models are evaluated using the EMG data from 10 intact and 11 amputee subjects through the publicly access NinaPro database. Our results show that CNN classifier offered the best mean classification accuracy of 88.04% in recognizing hand and wrist movements.
Improving Performance of DOM in Semi-structured Data Extraction using WEIDJ Model Ily Amalina Ahmad Sabri; Mustafa Man
Indonesian Journal of Electrical Engineering and Computer Science Vol 9, No 3: March 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v9.i3.pp752-763

Abstract

Web data extraction is the process of extracting user required information from web page. The information consists of semi-structured data not in structured format. The extraction data involves the web documents in html format. Nowadays, most people uses web data extractors because the extraction involve large information which makes the process of manual information extraction takes time and complicated. We present in this paper WEIDJ approach to extract images from the web, whose goal is to harvest images as object from template-based html pages. The WEIDJ (Web Extraction Image using DOM (Document Object Model) and JSON (JavaScript Object Notation)) applies DOM theory in order to build the structure and JSON as environment of programming. The extraction process leverages both the input of web address and the structure of extraction. Then, WEIDJ splits DOM tree into small subtrees and applies searching algorithm by visual blocks for each web page to find images. Our approach focus on three level of extraction; single web page, multiple web page and the whole web page. Extensive experiments on several biodiversity web pages has been done to show the comparison time performance between image extraction using DOM, JSON and WEIDJ for single web page. The experimental results advocate via our model, WEIDJ image extraction can be done fast and effectively.

Page 274 of 923 | Total Record : 9226

 272   273   274   275   276 

Filter by Year

2012 2026


Reset
Filter By Issues
All Issue Vol 42, No 1: April 2026 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