Garuda - Garba Rujukan Digital

Article Per Year (5 Year)

All

International Journal of Electrical and Computer Engineering

IJECE
Website

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 90 Documents

5 6 7 8 9

Search results for , issue "Vol 6, No 6: December 2016" : 90 Documents clear

Model-based Automatic Segmentation of Ascending Aorta from Multimodality Medical Data Noha Seada; Safwat Hamad; Mostafa G. M. Mostafa
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

Automatic Ascending Aorta Segmentation is one of the important steps towards automatic segmentation of the whole cardiac tree. This paper presents a novel approach for the automatic segmentation of the ascending aorta from two imaging modalities: CTA (Computed Tomography Angiography) and PC-MRI (Phase-Contrast Magnetic Resonance Images). The novel approach is an algorithm that works without the need for setting manual seed points or applying preprocessing steps or setting a region of interest. Instead, the proposed algorithm automatically detects and segments the ascending aorta using an ascending aorta model built from its anatomical features. The proposed segmentation algorithm begins with aorta detection through features model fitting augmented with Hough transform, where the ascending aorta is identified from the descending aorta and any other circular structures based on the proposed model. After detection, the whole ascending aorta is segmented up from the aortic arch down to the ostia points using a novel automatic seeded region growing algorithm. The proposed algorithm is fully automatic, works in real-time and robust as parameters used are the same for all the tested datasets. The detection and segmentation of the ascending aorta succeeded in all test cases acquired from the two imaging modalities; proving the robustness of the proposed ascending aorta model and algorithm for the automatic segmentation process even on data from different modalities and different scanner types. The accuracy of the segmentation has a mean Dice Similarity Coefficient (DSC) of 94.72% for CTA datasets and 97.13% for PC-MRI datasets.

A Modified ABC Algorithm for Solving Non-Convex Dynamic Economic Dispatch Problems Hardiansyah Hardiansyah
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

In this paper, a modified artificial bee colony (MABC) algorithm is presented to solve non-convex dynamic economic dispatch (DED) problems considering valve-point effects, the ramp rate limits and transmission losses. Artificial bee colony algorithm is a recent population-based optimization method which has been successfully used in many complex problems. A new mutation strategy inspired from the differential evolution (DE) is introduced in order to improve the exploitation process. The feasibility of the proposed method is validated on 5 and 10 units test system for a 24 h time interval. The results are compared with the results reported in the literature. It is shown that the optimum results can be obtained more economically and quickly using the proposed method in comparison with the earlier methods.

An Integrated Interactive Technique for Image Segmentation using Stack based Seeded Region Growing and Thresholding Sirshendu Hore; Souvik Chakraborty; Sankhadeep Chatterjee; Nilanjan Dey; Amira S. Ashour; Le Van Chung; Dac-Nhuong Le
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

Image segmentation is a challenging process in numerous applications. Region growing is one of the segmentation techniques as a basis for the Seeded Region Growing method. A novel real time integrated method was developed in the current work to locate the segmented region of interest of an image based on the Region Growing segmentation method along with the thresholding supported image segmentation. Through the proposed work, a homogeneity based on pixel intensity was suggested as well as the threshold value can be decided via a variety of schemes such as manual selection, Iterative method, Otsu’s method, local thresholding to obtain the best possible threshold. The experimental results were performed on different images obtained from an Alpert dataset. A comparative study was arried out with the human segmented image, threshold based region growing, and the proposed integrated method. The results established that the proposed integrated method outperformed the region growing method in terms of the recall and F-score. Although, it had comparable recall values with that gained by the human segmented images. It was noted that as the image under test had a dark background with the brighter object, thus the proposed method provided the superior recall value compared to the other methods.

A Cloud Based Secure Voting System using Homomorphic Encryption for Android Platform Manish Ranjan; Ayub Hussain Mondal; Monjul Saikia
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

Cloud based service provider are at its top of its services for various applications, as their services are very much reachable from anywhere anytime in current days. It is responsibility of the company that the Cloud storage is owned and maintained by themselves keeping the data available and accessible, and the physical environment protected and running. Could storage provider seem to be uncertain of confidentiality in many cases, as we need to limit ourselves on trust to a third party. Keeping our sensitive data ready to access any time anywhere with preventing any information leakage is a challenging task. Cryptography in this scenario plays an important role, providing security for information to protect valuable information resources on intranets, Internet and the cloud. In addition, Homomorphic cryptosystem is a form of Cryptography where some specific computation can be performed over the cipher text producing a resultant cipher text which, when decrypted, equals the result of operations carry out on the plaintext. With help of this unique property of homomorphism cryptography we proposed a system to keep sensitive information in encrypted form in the cloud storage/service provider and used those data as whenever we require. The scheme proposed here is designed for a secure online voting system on Android platform and voted information is encrypted and stored those in the cloud.

Reducing Routing Overhead in Random Walk Protocol under MP2P Network Ajay Arunachalam; Ohm Sornil
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

Due to network dynamics in self-organizing networks the resource discovery effort increases. To discover objects in unstructured peer-to-peer network, peers rely on traditional methods like flooding, random walk and probabilistic forwarding methods. With inadequate knowledge of paths, the peers have to flood the query message which creates incredible network traffic and overhead. Many of the previous works based on random walk were done in wired network. In this context random walk was better than flooding. But under MANETs random walk approach behaved differently increasing the overhead, due to frequent link failures incurred by mobility. Decentralized applications based on peer-to-peer computing are best candidates to run over such dynamic network. Issues of P2P service discovery in wired networks have been well addressed in several earlier works. This article evaluates the performance of random walk based resource discovery protocol over P2P Mobile Adhoc Network (MP2P) and suggests an improved scheme to suit MANET. Our version reduces the network overhead, lowers the battery power consumption, minimizes the query delay while providing equally good success rate. The protocol is validated through extensive NS-2 simulations. It is clear from the results that our proposed scheme is an alternative to the existing ones for such highly dynamic mobile network scenario.

A Novel of Repulsive Function on Artificial Potential Field for Robot Path Planning H. H. Triharminto; O. Wahyunggoro; T. B. Adji; A. I. Cahyadi; I. Ardiyanto
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

In this paper, the issue of local minima associated with GNRON (Goal Nonreachable with Obstacles Nearby) has been solved on the Artificial Potential Field (APF) for robot path planning. A novel of repulsive potential function is proposed to solve the problem. The consideration of surrounding repulsive forces gives a trigger to escape from the local mi- nima. Addition of signum function on the repulsive force which considers relative distance between the robot and the goal ensures that the goal position is the global optima of the total potential. Simulation conducted to prove that the proposed algorithm can solve GNRON and local minima problem on APF. Scenario of each simulation set in different type of obs- tacle and goal condition. The results show that the proposed method is able to handle local minima and GNRON problem.

Report on Power Compensation and Total Harmonic Distortion level Analysis Nikita Ramesh Kalaskar; Rajesh Holmukhe
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

In the chart of Indian science based industry, pharmaceutical industry is on top position. So it is essential to fulfil such critical requirement or demand, production should be with high speed. For such high production, using of software based machineries, electronic circuits are been used. By using such electronic based equipment’s and machineries, it is obvious day by day increasing non-linear load of the industry which lead to lagging power factor. In electric system nonlinear load with low power factor draws more current from source. So because of such high current drawn, life of switchgear, wire and other electrical equipment decreases. So due to large equipment and wasted energy, the electrical utilities company usually charge a higher cost to industrial customer for the constant logging power factor. To improving the lagging power factor, industry may prefer to install capacitor bank in series. But installation of capacitor power bank leads to the increment of total harmonics distortion level. In common plant, containing power factor correction capacitor, It is been seen that normal resonant frequency falls normally in the range of 5th to 13th harmonics. So this non-linear load leads to inject current at 5th, 7th, 11th and 13th harmonics. It will usually result on producing the problems with switchgears, damaged capacitor banks and failure to the electrical distribution system.

The Impact of Tunneling on the Subthreshold Swing in Sub-20 nm Asymmetric Double Gate MOSFETs Hak Kee Jung; Sima Dimitrijev
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

This paper analyzes the subthreshold swing in asymmetric double gate MOSFETs with sub-20 nm channel lengths. The analysis of the carrier transport in the subthreshold region of these nano scaled MOSFET includes tunneling as an important additional mechanism to the thermionic emission. It is found that the subthreshold swing is increasing due to tunneling current and that the performance of nano scaled MOSFETs is degraded. The degradation of the subthreshold swing due to tunneling is quantified using analytical potential distribution and Wentzel–Kramers–Brillouin (WKB) approximation in this paper. This analytical approach is verified by two dimensional simulation. It is shown that the degradation of subthreshold swing increases with both reduction of channel length and increase of channel thickness. We also show that the subthreshold swing is increasing in case of different top and bottom gate oxide thicknesses.

Pursuit Algorithm for Robot Trash Can Based on Fuzzy-Cell Decomposition Tatiya Padang Tunggal; Andi Supriyanto; Nur Mukhammad Zaidatur Rochman; Ibnu Faishal; Imam Pambudi; Iswanto Iswanto
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

Scooby Smart Trash can is a trash can equipped with artificial intelligence algorithms that is able to capture and clean up garbages thrown by people who do not care about the environment. The can is called smart because it acts like scoobydoo in a children's cartoon in that the can will react if there is garbage thrown and it catches and cleans them up. This paper presents pursuit algorithm that uses cell decomposition algorithm in which algorithms are used to create a map of the robot's path and fuzzy algorithm as one of the artificial intelligence algorithm for robot path planning. By using the combined algorithms, the robot is able to pursuit and chases the trash carelessly discarded, but it has not been able to find the shortest distance. Therefore, this paper considers a second modification of the algorithm by adding a potential field algorithm used to add weight values on the map, so that the robot can pursue trash by finding the shortest path. The proposed algorithm shows that the robot can avoid obstacles and find the shortest path so that the time required to get to the destination point is fast.

Implementation of Population Algorithms to Minimize Power Losses and Cable Cross-Section in Power Supply System V. Z. Manusov; P. V. Matrenin; E. S. Tretiakova
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

The article dues to the arrangement of the reactive power sources in the power grid to reduce the active power losses in transmission lines and minimize cable cross-sections of the lines. The optimal arrangement is considered from two points of view. In the first case, it is possible to minimize the active power losses only. In the second case, it is possible to change the cross-sections of the supply lines to minimize both the active power losses and the volume of the cable lines. The sum of the financial cost of the active power losses, the capital investment to install the deep reactive power compensation, and cost of the cable volume is introduced as the single optimization criterion. To reduce the losses, the deep compensation of reactive power sources in nodes of the grid are proposed. This optimization problem was solved by the Genetic algorithm and the Particle Swarm optimization algorithm. It was found out that the deep compensation allows minimizing active power losses the cable cross-section. The cost-effectiveness of the suggested method is shown. It was found out that optimal allocation of the reactive power sources allows increasing from 9% to 20% the financial expenses for the enterprise considered.

Page 8 of 9 | Total Record : 90

5 6 7 8 9

Filter by Year

2016 2016

Filter By Issues

All Issue Vol 16, No 1: February 2026 Vol 15, No 6: December 2025 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

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

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

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

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

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