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
 279   280   281   282   283 
Automated Ground Vehicles Navigation with Genetic Algorithm Alireza Rezaee
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 9: September 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Automated ground vehicles are being used increasingly in automation of factories for material transmitting or other missions. The navigation of these vehicles is a challenge as the configuration of the environment such as factory changes. The path-planning problem has been shown to be NP-hard, thus this problem is often solved using heuristic optimization methods such as genetic algorithms. In this paper a genetic algorithm for path planning of the mobile robots specifically automated ground vehicles with a basic knowledge about navigation area boundaries and configuration of obstacles. The goal in this paper is to travel the shortest path in minimal time while avoiding obstacles in a navigation environment. For this reason, an effective structure for genetic algorithm was implemented. http://dx.doi.org/10.11591/telkomnika.v12i9.6271 
Entropy-based Evaluation Method of Design Scheme for Helicopter Transmission Wang Haiwei; Liu Geng; Yang Zhanduo; Wei Zhongsheng
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 6: June 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

To choose the best design scheme of helicopter transmission, and bring out excellent comprehensive performance for helicopter, technical criteria architecture of helicopter transmission is analyzed. Scheme criteria evaluation matrix is standardized and criteria weight vector of every design scheme is optimized. According to the principle of minimum deviation of design scheme evaluation, single scheme evaluation problem is programmed. Uncertainty factors of criteria weight are analyzed, and entropy is introduced to describe these uncertainties. In addition to the maximum entropy theory, an evaluation model of design schemes is formed, which is solved by constructing a Lagrange function and a nonlinear system of equations. The example demonstrates validity of the proposed evaluation method. DOI: http://dx.doi.org/10.11591/telkomnika.v11i6.2701
Analysis of classification learning algorithms Hana Rashied Esmaeel
Indonesian Journal of Electrical Engineering and Computer Science Vol 17, No 2: February 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v17.i2.pp1029-1039

Abstract

The paper attempts to apply data mining Technique, Five classification algorithms were used to build data they are (ZeroR, SMO, Naive Bayesian, J48 and Random Forest).The analysis implemented using WEKA (3.8.2) Data mining software tool. The information was collected from college of Information Engineering (COIE) In Al Nahrain University within the variety of form using "Referendum" to estimate the teacher performance; it was store in Excel file CSV format then regenerate to ARFF (Attribute Relation File Format). Many criteria like (Time taken to create models, accuracy and average error) was taken to evaluate the algorithms Random forest and , SMO Predicts higher than alternative algorithms ,since  their  accuracy is the highest and have lowest average error compared to others  ,"The teacher clarification and  wanting to be useful  to students " was the strongest attribute. Further removing the bad ranked attributes (10, 11, 12, and 14) that have a lower contact on dataset can increase accuracies of algorithms
Study on Current Sensorless Vector Control Method for Electric Vehicle Drive Motor Jing Lian; Yafu Zhou; Jing Chang; Linhui Li; Xiaoyong Shen
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 1: January 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

With the aggravation of environment pollution and the reduction of petroleum resources, the development of electric vehicle (EV) draws more and more people’s attention. In the EV research field, that seeking for a high efficient and reliable motor control method that suits the operating conditions and characteristics of the vehicle drive motor has become one of the key techniques that need to be broken through urgently. Owing to the problems that the efficient work area is narrow and it leads to over-current phenomenon when traditional motor vector control method is applied to vehicle drive motor, this paper presents a current sensorless vector control technique for electric vehicle drive motor. According to motor speed and command torque which is gained from the speed loop control, this method directly controls the magnitude and phase angle of voltage vector to realize the orientation control of the magnetic field and then achieve the purpose of controlling the motor torque and speed. The feasibility and effectiveness of this method are verified by simulation results and bench test. Moreover, this method can not only improve the efficient work area, but also increase the reliability of motor control system. At the same time, it overcomes the dependence on the current sensor, circumvents the over-current defect caused by traditional motor vector control approach and reduces its cost. So it is a suitable and efficient control method for electric vehicle drive motor. DOI : http://dx.doi.org/10.11591/telkomnika.v12i1.3964 
Architecture of ASIP Crypto-Processor for Dynamic Runtime Security Applications Mahaba Saad; Khalid Youssef; Mohamed Tarek; Hala Abdel-Kader
Indonesian Journal of Electrical Engineering and Computer Science Vol 4, No 2: November 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v4.i2.pp412-423

Abstract

Nowadays, demands of data security are increasing, especially after introduction of wireless communications to the masses. Cryptographic algorithms are mainly used to obtain confidentiality and integrity of data in communication. There are a variety of encryption algorithms have been developed. This paper provides quantitative analysis and comparison of some symmetric key cryptographic ciphers (DES, 3DES, AES, Blowfish, RC5, and RC6).  The quantitative analysis approach is a step towards optimizing the security operations for an efficient next generation family of network processors with enhanced speed and power performance. A framework will be proposed as a reference model for quantitative analysis of security algorithm mathematical and logical operations. This paper also provides a dynamic crypto processor used for selected symmetric key cryptographic ciphers   and  provides an implementation of 16bit cryptographic processor that performs logical operations and arithmetic operations like rotate shift left, modular addition 2^16, S_box operation, and key expansion operation  on spartan6 lower power, xc6slx150L-1lfgg676 FPGA. Simulation results show that developed processor working with high Speed, low power, and low delay time. 
Pattern Analysis of Goals Scored in Malaysia Super League 2015 Nazim Razali; Aida Mustapha; Filipe Manuel Clemente; Md Fauzi Ahmad; Mohamad Aizi Salamat
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 2: August 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v11.i2.pp718-724

Abstract

This paper is set to study the pattern of goals scored across 132 matches in 2015 Malaysian Super League (MSL). Despite of well-known researches in European football, no information in Malaysian football teams has been done consistently. To identify the patterns, this research focuses on goals scored based on timing that includes scoring frequency, the impact of first goal achieved by team towards the final match outcome, as well as the impact of having home advantage for matches during MSL 2015.  The findings of this paper will provide useful information on MSL besides helping coaches with fresh insight for creating effective training and tactical plan as the time progressed during match. At the same time, players will also be more prepared for a consistent performance especially when training for matches as the visiting teams.
CFS: An effective statistical texture descriptor Alireza Akoushideh
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.pp553-562

Abstract

Coarseness is an effective description for texture analysis and many approaches capture this property of texture in different methods. In this research, we propose a new texture descriptor (CFS) that works based on coarseness and the fineness similarity score. For tuning of its configuration, we collect coarse and fine textures based on human visual perception at first. After that, we relabel the "coarse" and "fine" categories of the gathered textures during the configuration of the operator in a proposed framework. We concatenated the features of two pyramid representations with the CFS information of the original texture (PCFS). In addition, we combine the PCFS information with our last proposed feature selection approach to improve the efficiency of the CFS. We evaluated the proposed feature extraction method with classification of one of the well-known data set, Outex. Experimental results depict satisfactory performance of the CFS with very low-dimensional feature length.
Based on the RADIUS and AAA Authentication of the Campus Networks Security System Design and Implementation Yuyang Lu; Xiang Zhang Chen; Wenjie Wang; Yong Yang
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

As the work of digital campus construction, the function of network become more and more important . The kernel of digital campus is fast speed, function formidable, resource widely. The campus network is a special network ,which face special user community ,it is thought ,technology of active, and it adopt access layer access ,so the network security is lower, Vulnerable to illegal users and virus attacks. This text use RADIUS and AAA authentication technology in the campus, through user authentication, strengthen the network access restrictions, the log service, campus network management more systematic and safe. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4776 
Crowd behavior analysis using MoDTA approach Savitha C; Dr. Ramesh. D
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 1: July 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i1.pp484-494

Abstract

In order to analyze the behaviors of human, significant extent of work has been carried out in the video surveillance applications. While considering the crowded scenes, the adopted features are crafted manually which have a great side to detect anomaly. It requires prior information and is hard to extract from complex video scenes and also it involves huge computational costs. In this paper, we are proposing multi-observational detection and tracking approach (MoDTA) that is based on observational filter. The MoDTA initially acquires  people location in an image, so that is can detect conviction value at pointed locations which generally increases with respect to people density. In the phase of tracking, MoDTA computes the multiple observed weight values and individual features, also advection particle is used at motion model in order to facilitate the dense scenario tracking. Coefficient of correlation is used as template detector and the function of template detector is to estimate the upcoming object. Our proposed MoDTA is compared with other existing detection and tracking methods in order to evaluate the system performance. 
Modeling and Control Analysis of Wind Turbine of Two Bladed and Three Bladed Wind Turbine Systems L V Suresh Kumar; Chintu Jaganmohanarao; Sai Lakshmi B
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 3: September 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i3.pp478-485

Abstract

The wind power industry is currently the fastest growing renewable energy sector throughout the world. the aim of this paper is to implement the mathematical model and simulations torque control of two bladed and three bladed wind turbine systems by changing power coefficient, tip speed ratio and pitch angle values for different wind speeds.To ensure an economically competitive wind power production, the trend is to increase the turbine size while at the same time minimize material usage. In this paper we have two cases are developed one for two bladed and another for the three bladed wind turbines and compare the simulation results of both cases. The two balade and three blade systems are mathmatically developed and implemented in matlab simulink.

Page 281 of 923 | Total Record : 9226

 279   280   281   282   283 

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