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 67 Documents
 1   2   3   4   5 
Search results for , issue "Vol 22, No 1: April 2021" : 67 Documents clear
Dispersion compensation of optical systems utilizing fiber Bragg grating at 15 Gbits/s Alaa Hussein Ali; Saad Mutashar; Ali Mahdi Hammadi
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp369-378

Abstract

Nowadays the technological advancement of the information transmission is developing very rapidly and it becomes necessary to achieve a high speed in the transmission of data as well as higher data rate. Developments in optical communication systems address these needs. However, despite all the features and advantages of optical communication systems, the dispersion is still the main challenges. In this paper and to this end, fiber Bragg grating (FBG) is used in order to overcome the dispersion issue in the wavelength division multiplexing (WDM) transmission system. The WDM transmission system is simulated using the advanced tools of Optisystem 13. The simulation program was used at a speed of 15 Gbits/s with 50Km optical fiber length based on the different input design parameters such as input signal power, optical fiber length and attenuation coefficient. In addition, the output performance parameters are discussed in terms of quality factor (Q-factor) and eye diagram. Moreover, a comparison between the proposed design and previous related works is presented.
Measuring information security policy compliance: content validity of questionnaire Angraini Angraini; Rose Alinda Alias; Okfalisa Okfalisa
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp469-475

Abstract

Instruments used to measure compliance with information security policies have been developed by many researchers before, but only a few have conducted validity tests per item, especially for variables selected based on qualitative research. This study aims to validate the questionnaire will be used to measure user compliance with policies of information security. This study began by designing a questionnaire and conducting content validation using content ratio validation (CVR) and content index validation (CVI). As many as eight experts from the university assessed the items given. The results of 72 items submitted a questionnaire, as many as 22 items eliminated, and only 50 items that have CVR and CVI values above 0.75. Also, Kappa statistical calculations show that items have excellent reliability among assessors at the item level. This study revealed that this instrument had obtained an appropriate level of validity to measure compliance with information security policies. 
Increasing transmission control protocol speed by reducing the acknowledgement collision probability Suherman Suherman; Ali Hanafiah Rambe; Norshakila Haris; Anhar Anhar
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp121-128

Abstract

Transmission control protocol (TCP) employs acknowledgement (TCP-ACK) for every transmitted packets to ensure reliable transmission. As a result, it sends the next window packets after receiving the TCP-ACK packet of previous window. This means that the earlier the TCP-ACK packet arrives, the faster the TCP next window transmission and the better the TCP performances. To do so, there should be a special treatment to the transmitted TCP-ACK to fasten next window transmission. This paper proposes a collision probability reduction for the transmitted TCP-ACK packets so that the overall TCP delay reduces. Collision probability reduction can be implemented in many ways. Initially, mathematical analysis is provided to prove that method can work as expected. The mathematic analysis shows that when TCP-ACK collision probability is reduced, the overall TCP delay is also reduced. The proposed method is then implemented in 802.11, 802.16 and complex networks. The NS-2 simulations evaluations for the aforementioned networks and the proposed method proved that collision reductions on TCP-ACK exert average TCP delay reductions about 11.86%, 28.04% and 9.46% subsequently.The proposed method is also applicable for other TCP types.
Efficient TCAM design based on dual port SRAM on FPGA Triet Nguyen; Kiet Ngo; Nguyen Trinh; Bao Bui; Linh Tran; Hoang Trang
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp104-112

Abstract

Ternary content addressable memory (TCAM) is a memory that allows high speed searching for data. Not only it is acknowledged as associative memory/storage but also TCAM can compare input searching content (key) against a collection of accumulated data and return the matching address which compatible with this input search data. SRAM-based TCAM utilizes and allocates blocks RAM to perform application of TCAM on FPGA hardware. This paper presents a design of 480×104 bit SRAM-based TCAM on altera cyclone IV FPGA. Our design achieved lookup rate over 150 millions input search data and update speed at 75 million rules per second. The architecture is configurable, allowing various performance trade-offs to be exploited for different ruleset characteristics.
Attitude on intention to use e-government in Indonesia Dedy Afrizal; MUslimin Wallang
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp435-441

Abstract

The application of information and communication technologies in Indonesia continues to be developed as the government becomes more serious in improving services to its citizen. However, there are still some obstacles to using the service. The purpose of this paper to present a framework improving e-government services to its citizen. The paper opted for using a comprehensive review of the unified theory of acceptance and use of technology (UTAUT). This paper offers ideas to see intention to the community in using e-government, by using the modified UTAUT model where the main construct performance expectancy (PE), effort expectancy (EE), social influence (SI), facilitating conditions (FC) is an important factor. Moderators such as gender, age, experience and voluntariness of use were excluded and using attitude as a mediator. The findings showed that UTAUT’s construct such as performance expectancy, effort expectancy, social influence, facilitating conditions is an important factor appropriate for seeing intention to citizen in using e-government and 9 hypotheses offered in the model are believed to get new findings in the future and increase the development of the UTAUT model and be able to provide concept ideas that are made in seeing the intentions of e-government users.
Clusterization of customer energy usage to detect power shrinkage in an effort to increase the efficiency of electric energy consumption Yessy Asri; Dwina Kuswardani; Efy Yosrita; Ferdinand Hendrik Wullur
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp10-17

Abstract

Automatic meter reading (AMR) is a reading system result the measurement of electrical energy consumen, both locally and remotely. The problems faced is the high non-technical shrinkage of AMR customers due to installation, maintenance errors as well as dishonest actions some consumers, this has a major influence on electrical power losses. PT. PLN Disjaya currently faces difficulties having to choose which customers should be checked first, so the field can only find a little damage. The K-means method based on historical electric power usage and determine the most optimal number of groups the davies-bouldin index (DBI) method. Based on the results of testing with 2-6 sets of clusters, the cluster set results are the most optimal is set cluster 4 because it has the smallest DBI value 0.893. The set of 4 clusters has the best performance in data grouping of historical power usage of AMR customers the business class, each centroid of each cluster is used as an attribute and value of the AMR customer power usage business chart. The testing phase is customers who categorized as customers with un-normal usage electricity power. The test is, by determining the distance data testing each centroid in the cluster 4 set.
Comparison of lithium niobate and silicon substrate on phase shift and efficiency performance for mach-zehnder interferometer modulator Nor Hidayah Roslan; Aziati H. Awang; Mohd Hanapiah M. Yusoff; Ahmad Rifqi Md Zain
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp352-360

Abstract

In this study, the low-group velocity slow-light mach-zehnder interferometer (MZI) modulator, low loss and high efficiency for two modulator substrate lithium niobate (LN) and silicon were presented and optimized at 1.55µm operating wavelength. The high power consumption of conventional modulator was the major drawback in the operation of modulators. Therefore, it was a good time for low-power modulator design and development and to compare the LN and Silicon modulator on the phase shifted using the slow-light technique by designing the full MZI modulator consisting of splitter and combiner on both substrates. The phase shift of LN is 2% compared with the silicon 0.09% and higher phase shift give better performance with low power consumption due to the change of modulating voltage of the MZI modulator for LN while the silicon depends on modulating voltage manipulating concentration of charge carrier in doped silicon.
Organizing sports matches with a hybrid monkey search algorithm Ruqaya Zedan Shaban; Isra Natheer Alkallak
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp542-551

Abstract

This academic piece of the paper illustrates an approach of organizing sports matches to be as a tool of sports schedule maker via a proposed hybrid Monkey search algorithm by doubles elimination tournament. Input are a set of teams represented by monkeys. It states that the natural behavior of monkeys and its climbing to obtain (solution) through uphill (climbing), watch-jumping, and somersault process. The parameters in the climb were represented by whether or not sports team won. The distribution of the teams, whether in the upper or the lower half, represented in the watch-jumping by mathematical equations, in addition to representing the variables in somersault process. The consequences behind the suggested algorithm used have tackled steps to reach an optimal schedule for a variety of teams for the same championship. The team cannot play more than two consecutive matches with the condition of starting with a random population of feasible solutions. The performance of the presented algorithm was very well through providing a flexible and easy organization of sports matches without using classic or manual routine. Furthermore, the search space reduced so that can give a guarantee to achieve a globally optimum solution. The software platform was MATLAB m-files.
Multimodal biometrics of fingerprint and signature recognition using multi-level feature fusion and deep learning techniques Arjun Benagatte Channegowda; H N Prakash
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp187-195

Abstract

Providing security in biometrics is the major challenging task in the current situation. A lot of research work is going on in this area. Security can be more tightened by using complex security systems, like by using more than one biometric trait for recognition. In this paper multimodal biometric models are developed to improve the recognition rate of a person. The combination of physiological and behavioral biometrics characteristics is used in this work. Fingerprint and signature biometrics characteristics are used to develop a multimodal recognition system. Histograms of oriented gradients (HOG) features are extracted from biometric traits and for these feature fusions are applied at two levels. Features of fingerprint and signatures are fused using concatenation, sum, max, min, and product rule at multilevel stages, these features are used to train deep learning neural network model. In the proposed work, multi-level feature fusion for multimodal biometrics with a deep learning classifier is used and results are analyzed by a varying number of hidden neurons and hidden layers. Experiments are carried out on SDUMLA-HMT, machine learning and data mining lab, Shandong University fingerprint datasets, and MCYT signature biometric recognition group datasets, and encouraging results were obtained.
Smart ambulance using IoT for blood transfer facilities Mohamed A. Torad; Yahia H. Hossamel-din
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 1: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i1.pp97-103

Abstract

In case of an accident occurrence, ambulance try to transport wounded and injured people to the nearest hospital, but if the injured persons need an urgent blood transfer, the emergency reception (ER) can check the availability of the needed blood type and quantity. If it is available, the emergency reception accepts the injured person, but if it is not available, the reception reroutes the ambulance to the nearest hospital which have the required blood type and quantity. So, a system created that save that wasted time to save injured people life as possible.  So, we create a system that save that wasted time to save injured people life as possible. So, the main contribution in this paper is selecting and determining the nearest hospital that own the proper blood types to save injurjed people lives using dijkstra algorithm. In this study, we use an android application at the ambulance which permit the paramedic to login and select the required blood type and quantity needed after determining the injured person’s blood type and the android application automatically determine the nearest hospital using the best shortest path algorithm (SPA) after checking the database and generate a pin code for the paramedic to deliver it with injured person to the ER and get the needed blood. This process will consequently decrease the used blood quantity from the database.

Page 1 of 7 | Total Record : 67

 1   2   3   4   5 

Filter by Year

2021 2021


Reset
Filter By Issues
All Issue 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