cover
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
ISSN : 20888708     EISSN : 27222578     DOI : -
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.
Articles 6,301 Documents
Performance of compliant mechanisms applied to a modified shape accelerometer of single and double layer Margarita Tecpoyotl-Torres; Ramon Cabello-Ruiz; Pedro Vargas-Chable; Jose Gerardo Vera-Dimas; Alejandra Ocampo-Diaz
International Journal of Electrical and Computer Engineering (IJECE) Vol 9, No 6: December 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (691.518 KB) | DOI: 10.11591/ijece.v9i6.pp4675-4683

Abstract

Accelerometers are widely used in several mechanisms of high sensitivity. They are employed for example in tilt-control in spacecraft, inertial navigation, oil exploration, seismic monitoring, etc. In order to improve the sensitivity of the measurements, implementation of Displacement-amplifying Compliant Mechanisms (DaCMs) in a capacitive accelerometer have been reported in the literature. In this paper, a system composed of two elements; capacitive accelerometer with extended beams (CAEB) and a DaCM geometry, of single and souble layer, are analysed. Three materials were considered, in the case, for the second layer. The DaCM implementation improves the operation frequency and displacement sensitivity, under different proportions, at the same time. Furthermore, three sweeps were performed: a range of thickness from 25 µm up to 30 µm (to determine the appropriate silicon mass value, using SOI technology), a range of second layer thickness (to choose the more appropriate material and its thickness) and a range of gravity values (to determine the maximum normal stress in the beams, which defines the superior value of the g operation range). The in-plane mode (y-axis) was considered in all analysed cases. This characterization was developed using the Finite Element Method. Structural and modal analysis responses were under study.
Detection of Proximal Caries at The Molar Teeth Using Edge Enhancement Algorithm Jufriadif Na'am; Johan Harlan; Sarifuddin Madenda; Julius Santony; Catur Suharinto
International Journal of Electrical and Computer Engineering (IJECE) Vol 8, No 5: October 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (269.732 KB) | DOI: 10.11591/ijece.v8i5.pp3259-3266

Abstract

Panoramic X-Ray produces produces the most common oral digital radiographic image that it used in dentistry practice. The image can further improve accuracy compared to analog one. This study aims to establish proximal caries edge on enhancement images so they can be easily recognized. The images were obtained from the Department of Radiology, General Hospital of M. Djamil Padang Indonesia. Total file of images to be tested were 101. Firstly, the images are analyzed by dentists who practiced at Segment Padang Hospital Indonesia. They concluded that there is proximal caries in 30 molar teeth. Furthermore, the images were processed using Matlab software with the following steps, i.e. cropping, enhancement, edge detection, and edge enhancement. The accuracy rate of detection of edge enhancement images being compared with that of dentist analysis was 73.3%. In the edge enhancement images proximal caries edge can be found conclusively in 22 teeth and dubiously in eight teeth. The results of this study convinced that edge enhancement images can be recommended to assist dentists in detecting proximal caries. 
Optimal remote access trojans detection based on network behavior Khin Swe Yin; May Aye Khine
International Journal of Electrical and Computer Engineering (IJECE) Vol 9, No 3: June 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (370.276 KB) | DOI: 10.11591/ijece.v9i3.pp2177-2184

Abstract

RAT is one of the most infected malware in the hyper-connected world. Data is being leaked or disclosed every day because new remote access Trojans are emerging and they are used to steal confidential data from target hosts. Network behavior-based detection has been used to provide an effective detection model for Remote Access Trojans. However, there is still short comings: to detect as early as possible, some False Negative Rate and accuracy that may vary depending on ratio of normal and malicious RAT sessions. As typical network contains large amount of normal traffic and small amount of malicious traffic, the detection model was built based on the different ratio of normal and malicious sessions in previous works. At that time false negative rate is less than 2%, and it varies depending on different ratio of normal and malicious instances. An unbalanced dataset will bias the prediction model towards the more common class. In this paper, each RAT is run many times in order to capture variant behavior of a Remote Access Trojan in the early stage, and balanced instances of normal applications and Remote Access Trojans are used for detection model. Our approach achieves 99 % accuracy and 0.3% False Negative Rate by Random Forest Algorithm.
Feasibility of Substitution of the Conventional Street Lighting Installation by the Photovoltaic Case Study on a Municipality in Agadir in Morocco Fatima Outferdine; Lahoussine Bouhouch; Mustapha Kourchi; Mohamed Ajaamoum; Ali Moudden
International Journal of Electrical and Computer Engineering (IJECE) Vol 7, No 5: October 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1007.418 KB) | DOI: 10.11591/ijece.v7i5.pp2287-2299

Abstract

In this work, we present a technical and economic study of the solar powered street lighting system of a municipality in the south of Morocco. The state of the conventional street lighting system is first analyzed in a substation of street lighting. Then a sizing method is applied to the photovoltaic installation in the testing area. A financial study, by comparison between conventional and PV-based lighting, is carried out showing the feasibility of the PV street lighting.
A predictive model for network intrusion detection using stacking approach Smitha Rajagopal; Poornima Panduranga Kundapur; Hareesh Katiganere Siddaramappa
International Journal of Electrical and Computer Engineering (IJECE) Vol 10, No 3: June 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (505.346 KB) | DOI: 10.11591/ijece.v10i3.pp2734-2741

Abstract

Due to the emerging technological advances, cyber-attacks continue to hamper information systems. The changing dimensionality of cyber threat landscape compel security experts to devise novel approaches to address the problem of network intrusion detection. Machine learning algorithms are extensively used to detect intrusions by dint of their remarkable predictive power. This work presents an ensemble approach for network intrusion detection using a concept called Stacking. As per the popular no free lunch theorem of machine learning, employing single classifier for a problem at hand may not be ideal to achieve generalization. Therefore, the proposed work on network intrusion detection emphasizes upon a combinative approach to improve performance. A robust processing paradigm called Graphlab Create, capable of upholding massive data has been used to implement the proposed methodology. Two benchmark datasets like UNSW NB-15 and UGR’ 16 datasets are considered to demonstrate the validity of predictions. Empirical investigation has illustrated that the performance of the proposed approach has been reasonably good. The contribution of the proposed approach lies in its finesse to generate fewer misclassifications pertaining to various attack vectors considered in the study.
A Zone Based Approach for Classification and Recognition Of Telugu Handwritten Characters N. Shobha Rani; Sanjay Kumar Verma; Anitta Joseph
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 4: August 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (526.041 KB) | DOI: 10.11591/ijece.v6i4.pp1647-1653

Abstract

Realization of high accuracies and efficiencies in South Indian character recognition systems is one of the principle goals to be attempted time after time so as to promote the usage of optical character recognition (OCR) for South Indian languages like Telugu. The process of character recognition comprises pre-processing, segmentation, feature extraction, classification and recognition. The feature extraction stage is meant for uniquely recognizing each character image for the purpose of classifying it. The selection of a feature extraction algorithm is very critical and important for any image processing application and mostly of the times it is directly proportional to the type of the image objects that we have to identify. For optical technologies like South Indian OCR, the feature extraction technique plays a very vital role in accuracy of recognition due to the huge character sets. In this work we mainly focus on evaluating the performance of various feature extraction techniques with respect to Telugu character recognition systems and analyze its efficiencies and accuracies in recognition of Telugu character set.
Fundamental Metrics for Wireless Sensor Networks localization Javad Rezazadeh; Marjan Moradi; Abdul Samad Ismail
International Journal of Electrical and Computer Engineering (IJECE) Vol 2, No 4: August 2012
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (42.991 KB)

Abstract

During the last decade, Localization in wireless sensor networks (WSNs) is a broad topic that has received considerable attention from the research community. The approaches suggested to estimate location are implemented with different concepts, functionalities, scopes and technologies. This paper introduces a methodological approach to the evaluation of localization algorithms and contains a discussion of evaluation criteria and performance metrics followed by statistical/ empirical simulation models and metrics that affect the performance of the algorithms and hence their assessment. The major contribution of this paper is to analyze and identify relevant metrics to compare different approaches on the evaluation of localization schemes.DOI:http://dx.doi.org/10.11591/ijece.v2i4.247
The Improvement of first Iteration Log Periodic Fractal Koch Antenna with Slot Implementation N. S. M. Yaziz; M. K. A. Rahim; F. Zubir; N. S. Nadzir; R. Dewan; H. A. Majid
International Journal of Electrical and Computer Engineering (IJECE) Vol 8, No 4: August 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (983.518 KB) | DOI: 10.11591/ijece.v8i4.pp2564-2570

Abstract

In this paper, a slotted is introduced at each of the radiating elements on the 1st iteration log periodic fractal Koch antenna (LPFKA). The antenna is designed to testify the appropriate performance at UHF Digital television which operates from 4.0 GHz to 1.0 GHz. The dimension of the conventional 0th iteration LPKFA is successfully reduced by 17% with the implementation of slotted. The results show a good agreement with a stable radiation pattern across the operating bandwidth, stable gain more than 5 dBi and reflection coefficient of below -10 dB over the desired frequency range.
Ontology-based Why-Question Analysis Using Lexico-Syntactic Patterns A.A.I.N. Eka Karyawati; Edi Winarko; Azhari Azhari; Agus Harjoko
International Journal of Electrical and Computer Engineering (IJECE) Vol 5, No 2: April 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (186.282 KB) | DOI: 10.11591/ijece.v5i2.pp318-332

Abstract

This research focuses on developing a method to analyze why-questions.  Some previous researches on the why-question analysis usually used the morphological and the syntactical approach without considering the expected answer types. Moreover, they rarely involved domain ontology to capture the semantic or conceptualization of the content. Consequently, some semantic mismatches occurred and then resulting not appropriate answers. The proposed method considers the expected answer types and involves domain ontology. It adapts the simple, the bag-of-words like model, by using semantic entities (i.e., concepts/entities and relations) instead of words to represent a query. The proposed method expands the question by adding the additional semantic entities got by executing the constructed SPARQL query of the why-question over the domain ontology. The major contribution of this research is in developing an ontology-based why-question analysis method by considering the expected answer types. Some experiments have been conducted to evaluate each phase of the proposed method. The results show good performance for all performance measures used (i.e., precision, recall, undergeneration, and overgeneration). Furthermore, comparison against two baseline methods, the keyword-based ones (i.e., the term-based and the phrase-based method), shows that the proposed method obtained better performance results in terms of MRR and P@10 values.
Implementation of FOAF, AIISO and DOAP ontologies for creating an academic community network using semantic frameworks Himanshu Ahuja; Sivakumar R
International Journal of Electrical and Computer Engineering (IJECE) Vol 9, No 5: October 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1096.835 KB) | DOI: 10.11591/ijece.v9i5.pp4302-4310

Abstract

Web 2.0 delivers the information which is then displayed in human readable content, omitting the crucial information which can be drawn from the data by the applications. Web 3.0 or semantic web is an extension to the current web, with an ambition to determine the drawbacks of the current web. The semantic web has already proven its influence in several communities around the globe, such as social media, music industry, healthcare domain, online blogs or articles, etc.; Among the several tools and technologies, ontologies or vocabularies are the foundation pillar for the semantic web. In this paper, the developed system aims at improving the collaboration and academic relations among staff which is directly related to our education community by providing a better networking platform which lets the agents discuss their achievements, titles, domain interests, and various other activities. Results have been analyzed to show how new facts, information can be implied from the presented knowledge of several agents and help generate a relationship graph by utilizing various semantic tools. The system discussed in this paper processes all the information in a format which can be understood by both humans and the machines, to interpret the underlying meaning about it and provide effective results.

Page 71 of 631 | Total Record : 6301


Filter by Year

2011 2026


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