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,174 Documents
 576   577   578   579   580 
Parallel extreme gradient boosting classifier for lung cancer detection Rana Dhia’a Abdualjabar; Osama A. Awad
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 3: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i3.pp1610-1617

Abstract

Most lung cancers do not cause symptoms until the disease is in its later stage. That led the lung cancer having a high fatality rate compared to other cancer types. Many scientists try to use artificial intelligence algorithms to produce accurate lung cancer detection. This paper used extreme gradient boosting (XGBoost) models as a base model for its effectiveness. It enhanced lung cancer detection performance by suggesting three stages model; feature stage, XGBooste parallel stage and selection stage. This study used two types of gene expression datasets; RNA-sequence and microarray profiles. The results presented the effectiveness of the proposed model, especially in dealing with imbalanced datasets, by having 100% each of sensitivity, specificity, precision, F1_score, area under curve (AUC), and accuracy metrics when it applied on all of the datasets used in this study.
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.
An ultra-low complexity of 2:1 multiplexer block in QCA technology Ali Hussien Majeed
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 3: March 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i3.pp1341-1346

Abstract

The limitations related to CMOS such as power consumption and parasitic capacitance lead scientists to search for new technologies. Quantum-dot cellular automata (QCA) is a CMOS alternative technology that uses charges instead of voltage level for binary representation. In QCA, many metrics are used for circuit differentiation such as delay, complexity and area. In this work, a new simple block of 2:1 QCA-Multiplexer is proposed. The proposed block is more efficient than previous designs by 0.43%, 0.53%, 50% and 0.72 in terms of area, complexity, delay and cost. QCADesigner software is used to design and verify the proposed circuit.
An approach towards improvement of contiguous memory allocation linux kernel: a review Suryavanshi, Anmol Suresh; Sharma, Sanjeevkumar
Indonesian Journal of Electrical Engineering and Computer Science Vol 25, No 3: March 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v25.i3.pp1607-1614

Abstract

The demand of contiguous memory allocation has been expanded in day-to-day life in all the devices. It is achieved in existing systems by using various reservation techniques. There are various other methods to achieve the goal of contiguous memory allocation in linux kernel such as, input output memory management units (IOMMU’s), scatter/gather direct memory access (DMA) and reserved static memory at boot time. But these solutions have its own drawbacks such as, IOMMU requires hardware. However, the configuration of additional hardware's increases the cost. The power consumption of the system and the reserved static memory in the system goes waste when not in used for specific purpose. It is very difficult to access contiguous memory in low-end devices that are unable to provide real contiguous memory. There is one existing method called contiguous memory allocator (CMA), which provides dynamic contiguous memory. It overcomes most of the problems but CMA itself has some drawbacks, which do not provide the guarantee of failure in future of contiguous memory. The motivation behind this study is to review existing contiguous memory allocation (CMA) method by identifying and removing its drawbacks.
Two-fold complex network approach to discover the impact of word-order in Urdu language Nuzhat Khan; Mohamad Anuar Kamaruddin; Usman Ullah Sheikh; Muhammad Paend Bakht
Indonesian Journal of Electrical Engineering and Computer Science Vol 23, No 2: August 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v23.i2.pp1039-1048

Abstract

This work examines standard Urdu text to confirm impact of word order in the language structure. The complex network approach is used to obtain universal properties of two different word co-occurrence networks. Macro and micro scale two-fold examinations of networks are performed for structure discovery. While preserving the vocabulary size, two networks are generated from same text with and without standard word order. In addition, text networks are benchmarked with a random network to extract global features. Achieved outcomes indicate certain word order in Urdu structure for most of the sentences. The normal and shuffled text networks demonstrated similar large-scale characteristics. The results show that average path length and network diameter is reduced after shuffling. On the other hand, clustering coefficient is increased in shuffled text as compared to normal text. Our results validated that few short sentences in range of three words are fully free order. The observations revealed that long sentences are ambiguous without standard order. Both networks are topologically similar but shuffling caused massive discrepancy in network composition and sentence structure. Inside graph view, grammatical association-based words connectivity exists in normal text network. With this universal approach, impact of word order in Urdu language is confirmed. Meanwhile, this breakthrough directs to uncover language composition by extracting small sentences as motifs.
A novel pipelined carry adder design based on half adder Salah Hasan Alkurwy; Isam Salah Hameed
Indonesian Journal of Electrical Engineering and Computer Science Vol 25, No 2: February 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v25.i2.pp763-770

Abstract

A new design of binary parallel adder circuit is presented in this paper. The pipeline technique is applied to implement a group of a half adder (HA) blocks to architect the proposed adder. The pipelined carry adder (PCA) method is suitable for carrying out the desired adder by using the HA circuits of XOR and AND gates. The applied technique reduces the critical path delay by 27% compared with the ripple carry adder (RCA) and relatively lowers logic gates by 55% compared with the carry look-ahead adder (CLA). The coded design of the proposed circuit is implemented and simulated on the Cyclone IV FPGA kit platform. Results show that the circuit needs a 7.69 ƞ Sec delay time to provide the output values. The suggested PCA circuit is more attractive than the conventional ripple carry adder for future electronic applications. 
Biometric key generation using crow algorithm Zied O. Ahmed; Abbas Akram Khorsheed
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp208-214

Abstract

The researchers have been exploring methods to use biometric characteristics of the user as a replacement for using unforgettable pass-word, in an attempt to build robust cryptographic keys, because, human users detect difficulties to call up long cryptographic keys. Biometric recognition provides an authentic solution to the authentication of the user problem in the identity administration systems. With the extensive utilization of biometric methods in different applications, there is growing concern about the confidentiality and security of the biometric technologies. This paper proposes biometric based key recreation scheme. Since human ears are not correlated. Until now, the encryption keys are generated using a swarm intelligence approach. Collective intelligence of simple groups of autonomous agents have been emerged by swarm intelligence. The crow search algorithm which is known as (CSA) is a new meta-intuitive method assembled by the intelligent group behavior of crows. Despite that CSA demonstrates important features, its search approach poses excessive challenges while faced with great multimodal formularization.
Influence of loopback interference channel in energy harvesting full-duplex relaying network over block rayleigh fading channel: performance analysis Phu Tran Tin; Van-Duc Phan; Le Anh Vu
Indonesian Journal of Electrical Engineering and Computer Science Vol 23, No 1: July 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v23.i1.pp302-307

Abstract

The main idea of this paper is to investigate the system performance (SP) ofenergy harvesting FD relaying network over block rayleigh fading channelunder the influence of the loopback interference channel. In the first stage,we proposed the system modeland analyzed the energy harvesting and theinformation transmission phases. Furthermore, the mathematical form for theoutage probability (OP) is analyzed and derived in two kinds of loopbackinterference: residual self-interference is modeled as AWGN vàresidual self-interference is still a random variable. All the mathematical, analyticalexpressions are verified using the Monte Carlo simulation.
Extracting numerical data from unstructured Arabic texts (ENAT) Abeer K. AL-Mashhadany; Dalal N. Hamood; Ahmed T. Sadiq Al-Obaidi; Waleed K. Al-Mashhsdany
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 3: March 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i3.pp1759-1770

Abstract

Unstructured data becomes challenges because in recent years have observed the ability to gather a massive amount of data from annotated documents. This paper interested with Arabic unstructured text analysis. Manipulating unstructured text and converting it into a form understandable by computer is a high-level aim. An important step to achieve this aim is to understand numerical phrases. This paper aims to extract numerical data from Arabic unstructured text in general. This work attempts to recognize numerical characters phrases, analyze them and then convert them into integer values. The inference engine is based on the Arabic linguistic and morphological rules. The applied method encompasses rules of numerical nouns with Arabic morphological rules, in order to achieve high accurate extraction method. Arithmetic operations are applied to convert the numerical phrase into integer value. The proper operation is determined depending on linguistic and morphological rules. It will be shown that applying Arabic linguistic rules together with arithmetic operations succeeded in extracting numerical data from Arabic unstructured text with high accuracy reaches to 100%.
Computer simulation of water effluent propagation in the reservoirs systems Kurakbayeva, Sevara Dzhumagaliyevna; Umarova, Zhanat Rysbayevna; Kalbayeva, Aizhan Tazhiklhanovna; Kurakbayev, Dzhumagali Salbekovich; Akhmetova, Sabira Tastanovna; Musabekov, Akhmetbek Akhylbekovich
Indonesian Journal of Electrical Engineering and Computer Science Vol 25, No 3: March 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v25.i3.pp1814-1824

Abstract

The task of the research was to build and analyze a model of the dynamics of pollution of a flowing reservoir and systems of communicating reservoirs with and without taking into account water filtration in the soil as a result of external sources (effluents from industrial enterprises). This work was aimed at studying the change in temporal dynamics, taking into account the concentration of impurities in the volumes of three reservoirs during the periods of discharge and completion, lasting 30 days. Numerical experiments were carried out for various flow rates and compositions of filtration coefficients to study the relaxation times of pollution in the system of reservoirs. Also, software was developed that analyzes the change in the concentration of impurities in the system of reservoirs. As a result, it was found that the pollution pattern is more dependent on the topology of the watercourse network.

Page 578 of 918 | Total Record : 9174

 576   577   578   579   580 

Filter by Year

2012 2026


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