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
 275   276   277   278   279 
Impact analysis of SYN flood DDOS attack on HAPROXY and NLB cluster-base web servers Subhi Rafeeq Zeebaree; Karwan Fahmi Jacksi; Rizgar Ramadhan Zebari
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.pp505-512

Abstract

In recent, the high available internet service is main demand of the most people. However, online services occasionally become inaccessible due to various threats and attacks. Synchronization (SYN) flood Distributed Denial of Service (DDoS) is the most used and has a serious effect on the public network services. Hence, the outcome of this attack on the commonly utilized cluster-based web servers is systematically illustrated in this paper. Moreover, performance of Internet Information Service 10.0 (IIS 10.0) on Windows server 2016 and Apache 2 on Linux Ubuntu 16.04 server is evaluated efficiently. The performance measuring process is done on both Network Load Balancing (NLB) and High Available Proxy (HAProxy) in Windows and Linux environments respectively as methods for web server load balancing.  Furthermore, stability, efficiency and responsiveness of the web servers are depended as the study evaluation metrics. Additionally, average CPU usage and throughput of the both mechanisms are measured in the proposed system. The results show that the IIS 10.0 cluster-based web servers are more responsiveness, efficiency and stable with and without SYN flood DDoS attack. Also, the performance of IIS 10.0 web server is better than of the Apache 2 in term of the average CPU usage and throughput.
An Efficient Approach based on Hierarchal Ontology for Service Discovery in Cloud Computing Naji Hasan.A.H; Gao Shu; AL-Gabri Malek; Jiang Zi-Long
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 service providers publish their web services in clouds environment, selecting the most appropriate service among these clouds becomes a very difficult challenge. This paper proposes an efficient approach based on hierarchal ontology to facilitate service discovery in cloud computing. Concepts of services and their relations, which describe services semantically, are distributed in a hierarchal ontology. In addition a matching mechanism for matching these concepts in order to match services in clouds is proposed. The matching results will be evaluated by the QoS of services to select the appropriate service among matched services. A case study is presented to prove the efficiency of our approach. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4850
An investigation on apportion of mathematical loss in transmission loss/cost allocation approach Shafeeque Ahmed Kalavai; Prabhakar Karthikeyan Shanmugam
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.pp1-8

Abstract

Cost allocation of highly non-linear transmission loss is complex and essential in competitive electricity market. In most of the existing transmission loss/cost allocation approaches, real power loss depends on selection of slack bus and hence the cost of transmission losses which are allocated to the generators and the loads also varies. In this paper, a complete analysis on the impact of slack bus selection on transmission loss allocation with and without mathematical loss is made. One of the existing approaches, proportional generation and proportional load (PGPL) method is taken to illustrate the impact. Mathematical loss is the loss without generation and load in the network and can be obtained from power flow solution by taking generation and load as zero. The cost incurred for this mathematical loss is allocated to the transmission lines while the cost of transmission loss due to bilateral contracts is allocated among the sources and the consumers. These loss/cost allocations with and without considering mathematical loss is shown using an IEEE 30 bus, 57 bus, 75 bus and 118 bus systems. The simulation results are obtained using MATLAB R2014a.
Three-Dimensional Application-Specific Protocol Architecture for Wireless Sensor Networks Mostafa Baghouri; Abderrahmane Hajraoui; Saad Chakkor
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.pp352-360

Abstract

Many researchers assume that the distribution of the nodes is done in a two-dimensional environment in the reason that the height of this network is negligible compared to its width and length. However, in the reality, three-dimensional (3D) deployment of the wireless sensor networks is used. Therefore, many applications require 3D architecture such as underwater, space communications, atmospheric, forest or building. Unfortunately, the energy consumption and throughput in the 3D environment decreases considerably compared to 2D in which we can’t neglect them in some applications. In his paper we applied the 3D architecture in LEACH protocol and we prove by computer simulation how this 2D approximation is not reasonable since the lifetime of 3D WSN decrease by about 21% over than 2D WSN.
A Calibrated Charge Pump for Mismatch Reduction in PLL Hao Liu; Zixuan Wang; Chuang Li; Jianhui Wu
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 | DOI: 10.11591/ijeecs.v10.i8.pp2304-2308

Abstract

An improved charge pump (CP) for phase locked loop (PLL) applications is presented. The proposed charge pump circuitry employs a variable current source in its sink path, which realizes feedback network for calibration. This scheme of charge pump minimizes mismatch between the sourcing current and the sinking current efficiently. The circuit is simulated in 0.18um CMOS technology and the simulation results show that good current matching characteristics can be achieved. The mismatch between the sourcing current and the sinking current can be reduced to less than 0.01% and the range of charge pump output voltage varies from 0.3V to 1.5V.
An Image Sparse Representation for Saliency Detection Jun Yang; Tusheng Lin; Xiaoli Jin
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 presents a novel method for detecting saliency in static images based on image sparse representation. For each color channel, first, the image is partitioned into non-overlapping patches and each patch is represented by the way of sparse coding from a learned dictionary of patches from natural scenes. Then, global saliency and local saliency are calculated and fused to attain saliency of each patch. Local saliency is shown by popping out a patch from its surrounding patches. Global saliency is indicated by the rarity of a patch in the overall patches of the image. The final saliency map is attained by normalizing and fusing local and global saliency maps of all color channels. Experimental results in the benchmark image dataset demonstrate that the proposed method achieves a superior performance compared with most of state-of-the-art methods. Furthermore, both robustness and the low computational complexities make the presented algorithm feasible for subsequent applications. DOI: http://dx.doi.org/10.11591/telkomnika.v11i10.2791
Performance evaluation of flexible cross correlation (FCC) OCDMA code based on radio over fiber (RoF) simulation system Z. Ibrahim; C.B.M. Rashidi; S.A. Aljunaid; A.K. Rahman; M.S. Anuar
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.pp543-550

Abstract

This paper investigates the performance of an elegance code set algorithm known as Flexible Cross Correlation (FCC) code to be run into a simulation test of proposed RoF system. Executing OCDMA Code into RoF framework is seen as a promising technique for enhancing spectral efficiency and meanwhile enhanced the length of fiber optic cable and data bit rate execution while reduce the passive equipment device. This code can efficaciously reduce the results of phase-induced intensity noise (PIIN), it has the multiple access interference (MAI) cancellation belongs to RoF system and at the same time simple and easy within the code construction. Bit error rate (BER) performance is assessed for this proposed simulation system. The evaluation made based on the performance of fiber length, data bit rate, related with Bit Error Rate (BER) and also the complexity of the system. The extensive simulation results reveal FCC code possibly will accomplish sufficiently up to 51 km at BER 10-9 for data rate 155 Mbps as matched to 622 Mbps with exponentially increases at BER 10-12 error floor and it is fit for short haul networking such as FTTH and local area network (LAN).
Quantization Encoding Algorithm Based Satellite Image Compression Anand M; V. Mathivananr
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.pp740-742

Abstract

In the field of digital data there is a demand in bandwidth for the transmission of the videos and images all over the worlds. So in order to reduce the storage space in the field of image applications there is need for the image compression process with lesser transmission bandwidth. So in this paper we are proposing a new image compression technique for the compression of the satellite images by using the Region of Interest (ROI) based on the lossy image technique called the Quantization encoding algorithm for the compression. The performance of our method can be evaluated and analyzing the PSNR values of the output images.
Learning face similarities for face verification using hybrid convolutional neural networks Fadhlan Hafizhelmi Kamaru Zaman; Juliana Johari; Ahmad Ihsan Mohd Yassin
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.pp1333-1342

Abstract

Face verification focuses on the task of determining whether two face images belong to the same identity or not. For unrestricted faces in the wild, this is a very challenging task. Besides significant degradation due to images that have large variations in pose, illumination, expression, aging, and occlusions, it also suffers from large-scale ever-expanding data needed to perform one-to-many recognition task. In this paper, we propose a face verification method by learning face similarities using a Convolutional Neural Networks (ConvNet). Instead of extracting features from each face image separately, our ConvNet model jointly extracts relational visual features from two face images in comparison. We train four hybrid ConvNet models to learn how to distinguish similarities between the face pair of four different face portions and join them at top-layer classifier level. We use binary-class classifier at top-layer level to identify the similarity of face pairs which includes a conventional Multi-Layer Perceptron (MLP), Support Vector Machines (SVM), Native Bayes, and another ConvNet. There are 3 face pairing configurations discussed in this paper. Results from experiments using Labeled face in the Wild (LFW) and CelebA datasets indicate that our hybrid ConvNet increases the face verification accuracy by as much as 27% when compared to individual ConvNet approach. We also found that Lateral face pair configuration yields the best LFW test accuracy on a very strict test protocol without any face alignment using MLP as top-layer classifier at 87.89%, which on-par with the state-of-the-arts. We showed that our approach is more flexible in terms of inferencing the learned models on out-of-sample data by testing LFW and CelebA on either model.
Design of the Coal Mining Transient Electromagnetic Receiver with A Large Dynamic Range Xiaoliang Zheng
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 8: August 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i8.pp5736-5742

Abstract

Considering the influence of the transient process of transient electromagnetic receiving coil on the early signals detection of the secondary field, as well as the great change and the various decay rates in different periods of the secondary field signals, which will affect the secondary field signal collection, we aim at designing a new receiver with the variable stored program control receiving coil, prefixed amplifying circuit, programmable amplifying circuit and high-performance analog-to-digital conversion circuit according to the underground coal mining environment, in which we apply the different sampling interval software and self-adaptive filtering algorithm to eliminate the influence of transient process and filter out the 50Hz power line interference, thus to increase the data collection ability and improve the detection result. The whole device is suitable for underground coal mining environment with a small volume.

Page 277 of 923 | Total Record : 9226

 275   276   277   278   279 

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