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
 208   209   210   211   212 
Novel multiple access for cooperative networks with nakagami-m fading: system model and performance analysis Tu-Trinh Thi Nguyen; Dinh-Thuan Do
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 1: July 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i1.pp233-240

Abstract

This study considers the performances of a downlink non-orthogonal multiple access (NOMA) network over Nakagami-m fading channels. This scheme employs two hop transmission. We first examine the analytical outage probability expression for each user and then these results are verified by Monte Carlo simulations. Based upon the outage probability, the maximal throughput are obtained and analyzed under different parameters. Furthermore, the effects of Nakagami-m channel fading on the probability and throughput are investigated. The results indicate that the performance of the NOMA system is excellent as appropriate selection of simulated parameters. This analysis can be recommended for designing the NOMA systems in the future fifth-generation wireless communication.
Dynamic Data Grid Replication Algorithm Based on Weight and Cost of Replica Zhongping Zhang; Chao Zhang; Mengfei Zuo; Zhiping Wang
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Data Grid is composed of a large number of distributed computation and storage resources to facilitate the management of the huge distributed and sharing data resources efficiently. Dynamic replication can reduce the file storage time and use the grid resources effectively in a Data Grid environment. The Data Grid topology is divided into three layers: Regional level, LAN level, the grid site level. We have improved DHRA algorithm in three areas: replica selection, replica placement, replica replacement. Considering the weight and cost of replica, we propose dynamic Data Grid replication algorithm LWLC Based on Weight and Cost of Replica. At last, we use the OptorSim to prove the effectiveness of the LWLC . DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4737
Identification information sensors of robot systems Igor Parkhomey; Juliy Boiko; Oleksander Eromenko
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.pp1235-1243

Abstract

At the present time, the complexity of identification is to find such a description, in which the image (information) of each class would have identified similar properties. The task is to make the transformed description includes the whole set of input images, united by the similarity class by the given ratio.Using the ordinates of an autocorrelation function is an inseparable shift in the center of gravity of an image, which leads to a change of such description.Nicest, the concept of an invariant description of information arises, this is an autocorrelation function, which is invariant to the description of any displacements of the image in the vertical and horizontal directions.The problem of finding an optimal decision rule arises, which, in a number of cases, can be constructed on the basis of a method, based on the definition of the maximum incomplete coefficient of similarity.Using this method, the solutions, that are almost unintelligible to the errors that arise due to the effects of interference, are found. Therefore, in increments k, this rule passes into the Bayes’ rule.
Recognition of a Face in a Mixed Document Lhoussaine Bouhou; Rachid El Ayachi; Mohamed Fakir; Mohamed Oukessou
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 2: August 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i2.pp301-312

Abstract

Face recognition is the field of great interest in the domaine of research for several applications such as biometry identification, surveillance, and human-machine interaction…This paper exposes a system of face recognition. This system exploits an image document text embedding a color human face image. Initially, the system, in its phase of extraction, exploitis the horizontal and vertical histogram of the document, detects the image which contains the human face. The second task of the system consists of detecting the included face in other to determine, with the help of invariants moments, the characteristics of the face. The third and last task of the system is to determine, via the same invariants moments, the characteristics of each face stored in a database in order to compare them by means of a classification tool (Neural Networks and K nearest neighbors) with the one determined in the second task for the purpose of taking the decision of identification in that database, of the most similar face to the one detected in the input image.
Deformation sensing of colonoscope on FBG sensor net Yi Xinhua; Wang Mingjun; Cheng Xiaomin
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 8: December 2012
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Owing to the complex condition of human intestinal and non-visualization, Loop formation of colonoscope often happens to hurt the patient during the diagnosis of colon. This paper presents a deformation detecting method using fiber brag grating(FBG) sensor net to real-time display the shape of colonoscope that would help the endoscopist how to manipulate the colonoscope into the body. The structure configuration and packing method of a FBG sensor net was described and the relative coefficient matrix between the curvature and shift of wavelength was acquired by experiment calibration. The position of FGB sensor point on the colonoscope relative to the handling part of the colonoscope can be derived by curvature information and the deformation of colonoscope can be reconstructed using curve fitting. Experiment results verified that the deformation sensing method was feasible and accuracy of the tip position can reach 4.5mm of the colonoscope with the length 1200mm. DOI: http://dx.doi.org/10.11591/telkomnika.v10i8.1693
Assessment study of STATCOM's effectiveness in improving transient stability for power system Le Ngoc Giang; Nguyen Thi Dieu Thuy; Tran Thi Ngoat
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 10: October 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Many of papers refers to study of application for FACTS. Especially for using reactive compensators for  500KV power system in order to increase the static voltage stability margin and transient stability enhancement have considered. However the  selection of suitable Var source (STATCOM or SVC)  also need to be considered. The purpose of this paper is to solve the above problems in order to suggest a olution of the appropriate shunt compensator for a reality 500KV power system. All the simulations for the above work have been carried out using MATLAB-SIMULINK environment. DOI: http://dx.doi.org/10.11591/telkomnika.v11i10.2766
An improved fitness function for automated cryptanalysis using genetic algorithm Md. Shafiul Alam Forhad; Md. Sabir Hossain; Mohammad Obaidur Rahman; Md. Mostafizur Rahaman; Md. Mokammel Haque; Md. Kamrul Hossain
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 2: February 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i2.pp643-648

Abstract

Genetic Algorithm (GA) is a popular desire for the researchers for creating an automated cryptanalysis system. GA strategy is useful for many problems. Genetic Algorithms try to solve problems by using genetic processes. Different techniques for deciding on fitness function relying on the ciphers have proposed by different researchers. The most necessary component is to set such a fitness function that can evaluate different types of ciphers on the identical scale. In this paper, we have proposed a combined fitness function that is valid for great sorts of ciphers. We use GA to select the fitness function. We have bought the higher result after imposing our proposed method.
Tentative Route Selection aApproach for Irregular Clustered Wireless Sensor Networks Mahendra Sharma; Santhosh Kumar Singh
Indonesian Journal of Electrical Engineering and Computer Science Vol 8, No 3: December 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v8.i3.pp715-718

Abstract

Wireless Sensor Networks (WSNs) assume a crucial part in the field of mechanization and control where detecting of data is the initial step before any automated job could be performed. So as to encourage such perpetual assignments with less vitality utilization proportion, clustering is consolidated everywhere to upgrade the system lifetime. Unequal Cluster-based Routing (UCR) [7] is a standout amongst the most productive answers for draw out the system lifetime and to take care of the hotspot issue that is generally found in equivalent clustering method. In this paper, we propose Tentative Route (TRS) Selection approach for irregular Clustered Wireless Sensor Networks that facilitates in decision an efficient next relay to send the data cumulative by Cluster Heads to the Base Station. Simulation analysis is achieved using the network simulator to demonstrate the effectiveness of the TRS method.
Classification neutral to ground (NG) voltage using levenberg-marquardt neural network (LMNN) Suzaryfazli Kamaruddin; Ahmad Farid Abidin; Mohd Abdul Talib Mat Yusoh
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 3: December 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i3.pp1189-1195

Abstract

In electrical systems nowadays, power quality issues have become a major concern for customers and electrical utilities. The high Neutral to ground (NG) voltage are one of the power quality issues which could cause adverse effect such as malfunction the devices, neutral overheating and electricity shock. Thus, the high NG voltage should be classified in order to perform the mitigation work accurately. This paper presents the classification of neutral to ground voltage using Levenberg-Marquardt Neural Network (LMNN) technique. The Discrete Wavelet Transform (DWT) is applied in this method to extract the features of NG voltage which needed in classification process.  The result shows the LMNN perform accurately in classify the types of NG voltage, where its accuracy result is reach more than 90% accuracy.
Application of Boosting Algorithm in Spam Filtration Wencheng Gu
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.pp5685-5692

Abstract

In order to improve accuracy and effectiveness of junk mail filtration, a filtering method is proposed based on Boosting algorithm, which uses Boosting algorithm to construct a spam filterer to identify junk mail. Besides, reference technical indexes in the field of text classification and information retrieval are used to construct a spam filterer evaluation system, with it, experimental data obtained from simulation were tested and evaluated. The results of test and evaluation proved that, compared with the traditional Bayesian algorithm, the spam filterer based on Boosting algorithm is able to filter junk mails more excellently, and the effectiveness of Boosting algorithm in spam filtering is verified.

Page 210 of 923 | Total Record : 9226

 208   209   210   211   212 

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