cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Tole Sutikno
Contact Email
ijece@iaesjournal.com
Phone
-
Journal Mail Official
ijece@iaesjournal.com
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
International Journal of Electrical and Computer Engineering
Published by Institute of Advanced Engineering and Science
ISSN : 20888708     EISSN : 27222578     DOI : -
Core Subject : Science, Engineering,
Computer Science & IT Electrical & Electronics Engineering
International Journal of Electrical and Computer Engineering (IJECE, ISSN: 2088-8708, a SCOPUS indexed Journal, SNIP: 1.001; SJR: 0.296; CiteScore: 0.99; SJR & CiteScore Q2 on both of the Electrical & Electronics Engineering, and Computer Science) is the official publication of the Institute of Advanced Engineering and Science (IAES). The journal is open to submission from scholars and experts in the wide areas of electrical, electronics, instrumentation, control, telecommunication and computer engineering from the global world.
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 64 Documents
 3   4   5   6   7 
Search results for , issue "Vol 7, No 1: February 2017" : 64 Documents clear
Comparative Analysis of Metaheuristic Approaches for Makespan Minimization for No Wait Flow Shop Scheduling Problem Laxmi A. Bewoor; V. Chandra Prakash; Sagar U. Sapkal
International Journal of Electrical and Computer Engineering (IJECE) Vol 7, No 1: February 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (499.508 KB) | DOI: 10.11591/ijece.v7i1.pp417-423

Abstract

This paper provides comparative analysis of various metaheuristic approaches for m-machine no wait flow shop scheduling (NWFSS) problem with makespan as an optimality criterion. NWFSS problem is NP hard and brute force method unable to find the solutions so approximate solutions are found with metaheuristic algorithms. The objective is to find out the scheduling sequence of jobs to minimize total completion time. In order to meet the objective criterion, existing metaheuristic techniques viz. Tabu Search (TS), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are implemented for small and large sized problems and effectiveness of these techniques are measured with statistical metric.
Study of Wind Turbine based Variable Reluctance Generator using Hybrid FEMM-MATLAB Modeling Tariq Benamimour; Amar Bentounsi; Hind Djeghloud
International Journal of Electrical and Computer Engineering (IJECE) Vol 7, No 1: February 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (19.49 KB) | DOI: 10.11591/ijece.v7i1.pp1-11

Abstract

Based on exhaustive review of the state of the art of the electric generators fitted to Wind Energy Conversion System (WECS), this study is focused on an innovative machine that is a Variable Reluctance Generator (VRG). Indeed, its simple and rugged structure (low cost), its high torque at low speed (gearless), its fault-tolerance (lowest maintenance), allow it to be a potential candidate for a small wind power application at variable wind speed. For better accuracy, a finite element model of a studied doubly salient VRG is developed using open source software FEMM to identify the electromagnetic characteristics such as linkage flux, torque or inductance versus rotor position and stator excitation. The obtained data are then transferred into  look-up tables of MATLAB/Simulink to perform various simulations. Performance of the proposed wind power system is analyzed for several parameters and results are discussed.
Performance Analysis of Post Compensated Long Haul High Speed Coherent Optical OFDM System Divya Dhawan; Neena Gupta
International Journal of Electrical and Computer Engineering (IJECE) Vol 7, No 1: February 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (635.612 KB) | DOI: 10.11591/ijece.v7i1.pp160-168

Abstract

This paper addresses the performance analysis of OFDM transmission system based on coherent detection over high speed long haul optical links with high spectral efficiency modulation formats such as Quadrature Amplitude Modulation (QAM) as a mapping method prior to the OFDM multicarrier representation. Post compensation is used to compensate for phase noise effects. Coherent detection for signal transmitted at bit rate of 40 Gbps is successfully achieved up to distance of 3200km. Performance is analyzed in terms of Symbol Error Rate and Error Vector Magnitude by varying Optical Signal to Noise Ratio (OSNR) and varying the length of the fiber i.e transmission distance. Transmission performance is also observed through constellation diagrams at different transmission distances and different OSNRs.
Symmetric Key based Encryption and Decryption using Lissajous Curve Equations Santhosh Kumar B.J.; Kruthika Vijay
International Journal of Electrical and Computer Engineering (IJECE) Vol 7, No 1: February 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1105.102 KB) | DOI: 10.11591/ijece.v7i1.pp285-288

Abstract

Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This application makes use of all ASCII characters which makes brute force attack impossible.

Page 7 of 7 | Total Record : 64

 3   4   5   6   7 

Filter by Year

2017 2017


Reset
Filter By Issues
All Issue Vol 15, No 5: October 2025 Vol 15, No 4: August 2025 Vol 15, No 3: June 2025 Vol 15, No 2: April 2025 Vol 15, No 1: February 2025 Vol 14, No 6: December 2024 Vol 14, No 5: October 2024 Vol 14, No 4: August 2024 Vol 14, No 3: June 2024 Vol 14, No 2: April 2024 Vol 14, No 1: February 2024 Vol 13, No 6: December 2023 Vol 13, No 5: October 2023 Vol 13, No 4: August 2023 Vol 13, No 3: June 2023 Vol 13, No 2: April 2023 Vol 13, No 1: February 2023 Vol 12, No 6: December 2022 Vol 12, No 5: October 2022 Vol 12, No 4: August 2022 Vol 12, No 3: June 2022 Vol 12, No 2: April 2022 Vol 12, No 1: February 2022 Vol 11, No 6: December 2021 Vol 11, No 5: October 2021 Vol 11, No 4: August 2021 Vol 11, No 3: June 2021 Vol 11, No 2: April 2021 Vol 11, No 1: February 2021 Vol 10, No 6: December 2020 Vol 10, No 5: October 2020 Vol 10, No 4: August 2020 Vol 10, No 3: June 2020 Vol 10, No 2: April 2020 Vol 10, No 1: February 2020 Vol 9, No 6: December 2019 Vol 9, No 5: October 2019 Vol 9, No 4: August 2019 Vol 9, No 3: June 2019 Vol 9, No 2: April 2019 Vol 9, No 1: February 2019 Vol 8, No 6: December 2018 Vol 8, No 5: October 2018 Vol 8, No 4: August 2018 Vol 8, No 3: June 2018 Vol 8, No 2: April 2018 Vol 8, No 1: February 2018 Vol 7, No 6: December 2017 Vol 7, No 5: October 2017 Vol 7, No 4: August 2017 Vol 7, No 3: June 2017 Vol 7, No 2: April 2017 Vol 7, No 1: February 2017 Vol 6, No 6: December 2016 Vol 6, No 5: October 2016 Vol 6, No 4: August 2016 Vol 6, No 3: June 2016 Vol 6, No 2: April 2016 Vol 6, No 1: February 2016 Vol 5, No 6: December 2015 Vol 5, No 5: October 2015 Vol 5, No 4: August 2015 Vol 5, No 3: June 2015 Vol 5, No 2: April 2015 Vol 5, No 1: February 2015 Vol 4, No 6: December 2014 Vol 4, No 5: October 2014 Vol 4, No 4: August 2014 Vol 4, No 3: June 2014 Vol 4, No 2: April 2014 Vol 4, No 1: February 2014 Vol 3, No 6: December 2013 Vol 3, No 5: October 2013 Vol 3, No 4: August 2013 Vol 3, No 3: June 2013 Vol 3, No 2: April 2013 Vol 3, No 1: February 2013 Vol 2, No 6: December 2012 Vol 2, No 5: October 2012 Vol 2, No 4: August 2012 Vol 2, No 3: June 2012 Vol 2, No 2: April 2012 Vol 2, No 1: February 2012 Vol 1, No 2: December 2011 Vol 1, No 1: September 2011 More Issue