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
 164   165   166   167   168 
Comparative Study of a Three Phase Cascaded H-Bridge Multilevel Inverter for Harmonic Reduction Rosli Omar; Mohammed Rasheed; Marizan Sulaiman; M. R Tamijis
Indonesian Journal of Electrical Engineering and Computer Science Vol 14, No 3: June 2015
Publisher : Institute of Advanced Engineering and Science

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

Abstract

The aim of this research project is to analyze and design of energy storages in electrical distribution system. In this paper presents a comparative study between sinusoidal pulse width modulation (SPWM) and space vector pulse width modulation (SVPWM) technique, based on generate signal five level of cascaded H-bridge for reduction harmonics in the multilevel inverter output. A multilevel inverter is a preferred choice for most medium-voltage and high-power applications, as well as cascaded H-bridge (CHB) five-level inverters due to its advantages such as low cost, light weight and compact size. It is suitable particularly for use in a cascaded H-bridge multilevel inverter due to reduced total harmonic distortion (THD). Harmonic content in three phase multilevel inverter can be investigated by generating (SPWM) and (SVPWM) algorithm signal based on a five-level (CHB). The proposed system is designed using MATLAB/SIMULINK consists of cascaded H-bridge (CHB) multilevel inverter. DOI: http://dx.doi.org/10.11591/telkomnika.v14i3.7949
An Empiric Evaluation of a Real-Time Robot Dancing Framework based on Multi-Modal Events João Lobato Oliveira; Luis Paulo Reis; Brigida Monica Faria; Fabien Gouyon
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

Musical robots have already inspired the creation of worldwide robotic dancing contests, as RoboCup-Junior's Dance, where school teams, formed by children aged eight to eighteen, put their robots in action, performing dance to music in a display that emphasizes creativity of costumes and movement. This paper describes and assesses a framework for robot dancing edutainment applications. The proposed architecture enables the definition of choreographic compositions, which result on a conjunction of reactive dancing motions in real-time response to multi-modal inputs. These inputs are shaped by three rhythmic events (representing soft, medium, and strong musical note-onsets), different dance floor colors, and the awareness of the surrounding obstacles. This layout was applied to a Lego-NXT humanoid robot, built with two Lego-NXT kits, and running on a hand-made dance stage. We report on an empirical evaluation over the overall robot dancing performance made to a group of students after a set of live demonstrations. This evaluation validated the framework's potential application in edutainment and its ability to sustain the interest of the general audience by offering a reasonable compromise between musical-synchrony, animacy and dance performance’s variability. DOI: http://dx.doi.org/10.11591/telkomnika.v10i8.1327
Reliability Estimation based on Step-Stress Accelerated Degradation Testing by Unequal Interval Time Series Analysis Li Wang; Zaiwen Liu; Chongchong Yu
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

This paper proposes a reliability estimation method based on Step-Stress Accelerated Degradation Testing (SSADT) data analysis using unequal interval time series analysis. A Multi-Regression Time Varying Auto-Regressive (MRTVAR) degradation time series model is proposed. Product SSADT data are treated as unequal interval composite time series and described using MRTVAR time series model and utilized to predict long-term trend of degradation. By using the suggested method, product reliability is obtained. An example is presented as a verification of the modeling technique and estimation method. A reasonable estimation of lifetime and reliability of the product is obtained by employing the present method. DOI: http://dx.doi.org/10.11591/telkomnika.v11i10.3402
Development of Photo Forensics Algorithm by Detecting Photoshop Manipulation using Error Level Analysis Teddy Surya Gunawan; Siti Amalina Mohammad Hanafiah; Mira Kartiwi; Nanang Ismail; Nor Farahidah Za'bah; Anis Nurashikin Nordin
Indonesian Journal of Electrical Engineering and Computer Science Vol 7, No 1: July 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v7.i1.pp131-137

Abstract

Nowadays, image manipulation is common due to the availability of image processing software, such as Adobe Photoshop or GIMP. The original image captured by digital camera or smartphone normally is saved in the JPEG format due to its popularity. JPEG algorithm works on image grids, compressed independently, having size of 8x8 pixels. For unmodified image, all 8x8 grids should have a similar error level. For resaving operation, each block should degrade at approximately the same rate due to the introduction of similar amount of errors across the entire image. For modified image, the altered blocks should have higher error potential compred to the remaining part of the image. The objective of this paper is to develop a photo forensics algorithm which can detect any photo manipulation. The error level analysis (ELA) was further enhanced using vertical and horizontal histograms of ELA image to pinpoint the exact location of modification. Results showed that our proposed algorithm could identify successfully the modified image as well as showing the exact location of modifications.
University course timetabling model using ant colony optimization algorithm approach Munirah Mazlan; Mokhairi Makhtar; Ahmad Firdaus Khair Ahmad Khairi; Mohamad Afendee Mohamed
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 1: January 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i1.pp72-76

Abstract

Due to the increased number of students and regulations, all educational institutions have renewed their interest to appear in the number of complexity and flexibility since the resources and events are becoming more difficult to be scheduled. Timetabling is the type of problems where the events need to be organized into a number of timeslots to prevent the conflicts in using a given set of resources. Thus in the intervening decades, significant progress has been made in the course timetabling problem monitoring with meta-heuristic adjustment. In this study, ant colony optimization (ACO) algorithm approach has been developed for university course timetabling problem. ACO is believed to be a powerful solution approach for various combinatorial optimization problems. This approach is used according to the data set instances that have been collected. Its performance is presented using the appropriate algorithm. The results are arguably within the best results range from the literature. The performance assessment and results are used to determine whether they are reliable in preparing a qualifying course timetabling process.
Semi-implicit Image Denoising Algorithm for Different Boundary Conditions Yuying Shi; Yonggui Zhu; Jingjing Liu
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 4: April 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

In this paper, the Crank-Nicolson semi-implicit difference scheme in matrix form is applied to discrete the Rudin-Osher-Fatemi model. We also consider different boundary conditions: Dirichlet boundary conditions, periodic boundary conditions, Neumann boundary conditions, antireflective boundary conditions and mean boundary conditions. By comparing the experimental results of Crank-Nicolson semi-implicit scheme and explicit scheme with the proposed boundary conditions, we can get that the semi-implicit scheme can overcome the instability and the number of iterations of the shortcomings that the explicit discrete scheme has, and its recovery effects are better than the explicit discrete scheme. In addition, the antireflective boundary conditions and Neumann boundary conditions can better maintain the continuity of the boundary in image denoising. DOI: http://dx.doi.org/10.11591/telkomnika.v11i4.2384
A secure group based authentication protocol for machine to machine communications in LTE-WLAN interworking architecture Mariya Ouaissa; Abdallah Rhattoy
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.pp848-859

Abstract

Machine to Machine (M2M) communication has been used in applications such as telemetry, industry, automation and health. Support for a large number of devices has been considered an essential requirement in M2M communications. During this time, security is the most important challenge; M2M cannot access secure networks through effective authentication, all relevant M2M applications cannot be accepted. The challenge of M2M research is authentication by the group when a large number of M2M devices simultaneously accessing the network will cause severe authentication signaling congestion. The group based model under an M2M architecture, especially when the Machine Type Communication (MTC) devices belong to the non 3rd Generation Partnership Project (3GPP) network, will face a new challenge of access authentication. In this paper, we propose a group based authentication and key agreement protocol for machine type communications combining Elliptic Curve based Diffie-Hellman (ECDH) on the Extensible Authentication Protocol (EAP). Compared to EAP-AKA and other existing authentication protocols, our solution provides increased security against various malicious activities and better performance in terms of signaling overhead, bandwidth consumption and transmission cost.
Dynamic Error Analysis of CMM Based on Variance Analysis and Improved PLSR Zhang Mei; Cheng Fang; Li Guihua
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.pp5342-5349

Abstract

It is difficult to build an accurate model to predict the dynamic error of CMM by analyzing error sources. An innovative modeling method based on Variance Analysis and Improved Partial Least-square regression (IPLSR) is proposed to avoid analyzing the interaction of error sources and to overcome the multi-collinearity of Ordinary Least-square regression (OLSR). Among many impact factors the most influential parameters are selected as the independents of the model, by means of variance analysis.The proposed modeling method IPLSR can not only avoid the analysis of the error sources and the interactions, but can also solve the problem of multi-collinearity in OLSR. From experimental data the expository capability of this IPLSR model can be calculated as 85.624 percent, and the mean square error is 0.94μm. As comparison, the mean square values of conventional PLSR and OLSR are 1.04μm and 1.39μm, respectively. So IPLSR has higher predicting precision and better expository capability.
Intelligent Packet Delivery in Router Using Structure Optimized Neural Network R. Deebalakshmi; V. L. Jyothi
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 2: May 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v10.i2.pp545-553

Abstract

The Internet itself is a worldwide network connecting millions of computers and less significant networks. Computers communicated by routers. Crucial the role of a router is to our technique of communicating and computing. Routers are situated at gateways, the spaces where two or more networks connect, and are the decisive device that keeps data flow between networks and keeps the networks connected to the Internet. When data is sent between places on one network or from one network to a second network the data is always seen and intended for to the proper place by the router. The router carries out this by using headers and routing tables to establish the best path for routing the data packets. This trim down the effectiveness of edge router only when the path engaged, it will enhanced by classification method, predictable classification methods like port based ,deep packet inspection and  statistical classification are give less precision. In this system structured optimized neural network is used for more precise organization. Classification output forwarded to router dynamically for intellectual packet delivery. The method will improve router competence by greater than before throughput and decreased latency.The Internet itself is a worldwide network connecting millions of computers and less significant networks. Computers communicated by routers. Crucial the role of a router is to our technique of communicating and computing. Routers are situated at gateways, the spaces where two or more networks connect, and are the decisive device that keeps data flow between networks and keeps the networks connected to the Internet. When data is sent between places on one network or from one network to a second network the data is always seen and intended for to the proper place by the router. The router carries out this by using headers and routing tables to establish the best path for routing the data packets. This trim down the effectiveness of edge router only when the path engaged, it will enhanced by classification method, predictable classification methods like port based ,deep packet inspection and  statistical classification are give less precision. In this system structured optimized neural network is used for more precise organization. Classification output forwarded to router dynamically for intellectual packet delivery. The method will improve router competence by greater than before throughput and decreased latency.
Statistical accuracy analysis of different detecting algorithms for surveillance system in smart city Hassan Al-Yassin; Jaafar I. Mousa; Mohammed A. Fadhel; Omran Al-Shamma; Laith Alzubaidi
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.pp979-986

Abstract

Several detecting algorithms are developed for real-time surveillance systems in the smart cities. The most popular algorithms due to its accuracy are: Temporal Differencing, Background Subtraction, and Gaussian Mixture Models. Selecting of which algorithm is the best to be used, based on accuracy, is a good choise, but is not the best. Statistical accuracy anlysis tests are required for achieving a confident decision. This paper presents further analysis of the accuracy by employing four parameters: false recognition, unrecognized, true recognition, and total fragmentation ratios. The results proof that no algorithm is selected as the perfect or suitable for all applications based on the total fragmentation ratio, whereas both false recognition ratio and unrecognized ratio parameters have a significant impact. The mlti-way Analysis of Variate (so-called K-way ANONVA) is used for proofing the results based on SPSS statistics.

Page 166 of 920 | Total Record : 9199

 164   165   166   167   168 

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