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
 451   452   453   454   455 
A Chaos Cloud Particle Swarm Algorithm Based Available Transfer Capability Su Hongsheng; qi ying
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 1: January 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

A mathematical model for ATC based on optimal power flow was built under the static security constraints, where the maximum of all load nodes in receiving area was considered as aim function. In view of the defects of slow convergence and low accuracy in ATC optimization algorithms, a chaos cloud particle swarm optimization algorithm based on golden section criteria (CCGPSO) was proposed. This method classified the particle swarm into three populations based on golden section judge principles according to fitness level. They are called chaos cloud particles, cloud particles and standard particles respectively. Each population was operated by different processing operations and updating modes. Comparing with other methods, the numerical simulation results of CCGPSO in IEEE-30 bus system demonstrate the higher efficiency and validity in ATC calculation. It is more suitable for solving the large-scale non-linear multi-constraint engineering practical problems.DOI : http://dx.doi.org/10.11591/telkomnika.v12i1.3368 
A wearable antenna based on fabric materials with circular polarization for Body-centric wireless communications Adel Y. I. Ashyap; Z. Z. Abidin; Samsul Haimi Dahlan; Shaharil Mohd Shah; Huda A. Majid; Yee See Khee; Norun Abdul Malek
Indonesian Journal of Electrical Engineering and Computer Science Vol 18, No 1: April 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v18.i1.pp335-342

Abstract

A compact and simple structure antenna for wearable application at 2.4 GHz is presented and studied. The felt fabric material is used in this paper due to its suitable thickness and dielectric constant. This material provides high flexibility which can be easily worn on a body and incorporated into our daily clothes. In view of the fact that the design will work on a moving person, therefore a circularly polarized antenna is desired to optimize the off-body communication link. The Cicular Polarization (CP) is achieved by introducing truncated corners on the patch. The antenna size is 60 × 60 × 2 mm3. The Axial Ratio (AR), the Front to Back Ratio (FRB) and the realized gain are 0.96 dB, 10.5 dB, and 4.62 dB, respectively indicating a good performance of the antenna at the desired frequency. Furthermore, the antenna was investigated when operating near the body. The obtained result shows that the design has performance similar to the case of free space. This is due to the present of the full ground plane that acts as a shielding between the antenna and body. Finally, the Specific Absorption Rate (SAR) is carried out and showed that the antenna has a level less than the limits fixed by the FCC standard. Therefore, the antenna could be useful for wearable applications.
A P2P Traffic Identification Approach Based on SVM and BFA Chunzhi Wang; Zeqi Wang; Zhiwei Ye; Hongwei Chen
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

Nowadays new peer to peer (P2P) traffic with dynamic port and encrypted technology makes the identification of P2P traffic become more and more difficult. As one of the optimal classifiers, support vector machine (SVM) has special advantages with avoiding local optimum, overcoming dimension disaster, resolving small samples and high dimension for P2P classification problems. However, to employ SVM, the parameters selection of SVM should be considered and thus some optimization methods have been put forward to deal with it, still, it is not fully solved. Hence, in the paper, a peer to peer traffic identification approach based on support vector machine and bacterial foraging algorithm is proposed for better identification of P2P network traffic. First, the best parameters for SVM are tuned with bacterial foraging algorithm. Subsequently, SVM set with the best parameters is used to identify P2P traffic. Finally, experimental results show the proposed approach can effectively improve the accuracy of P2P network traffic identification. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4736
DWT Domain Information Hiding Approach Using Detail Sub-band Feature Adjustment Qiudong Sun; Ping Guan; Yongping Qiu; Wenying Yan
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 7: July 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In recent years, many algorithms based on HVS and DWT had been proposed for watermarking. But most of them aimed at the binary iconic watermark. So they are unsuitable for embedding other format watermarks such as the text file, the gray image or even the color image. This paper proposed a multi-format data source file supporting algorithm for watermarking and information hiding. Firstly, the algorithm transformed a source file into a binary watermark sequence and put redundant encoding and random scrambling on it. Then, the algorithm selected two neighboring blocks each time from the Hilbert scanning sequence of the host image blocks, and transformed them by DWT. Lastly, according to the different codes of each two sequential watermark bits, the algorithm chose one of two thresholds of just noticeable difference (JND) to modify the average value features of two corresponding detail sub-bands to insert the watermark into the host image. Extracting hidden information only to need the embedded image without the original host images and the data source file, implemented the blind extraction to improve the security of secret information. The experimental results show that the embedded watermark is invisible, and the algorithm is robust to common image processing operations. DOI: http://dx.doi.org/10.11591/telkomnika.v11i7.2934
Designs of rectangular-shaped planar Inverted-F antennas at mobile operating frequencies with different ground plane techniques Nurul Inshirah Mohd Razali; Norhudah Seman; Tien Han Chua
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 2: August 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i2.pp927-935

Abstract

This article presents the designs of planar inverted-F antennas (PIFAs) at frequencies of 0.835 GHz, 0.9 GHz, 1.8 GHz, 1.9 GHz, 2 GHz, and 2.6 GHz. Initially, the designs of rectangular-shaped PIFAs are determined through the parametric studies concerning the dimensions of the antenna’s patch length, shorting plate, ground plane, and substrate. Afterward, rectangular-shaped slots are introduced into radiating element of two antennas that operate at a lower frequency range of less than 1 GHz, to tune the resonant frequency to the respective 0.835 GHz and 0.9 GHz. Different configurations of partial or full ground plane are implemented to improve the reflection coefficient, S11 performance to be below -10 dB in both simulation and measurement. The proposed six PIFAs have gain that are greater than 2 dB with the nearly omnidirectional radiation patterns. All the designs and analyses are performed using the CST Microwave Studio utilizing Rogers 4003C substrate.
Implementation of DSSS system of image using MATLAB Samir Jasim Mohammed; Kadhim Hassan Kaittan
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 3: September 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i3.pp1358-1366

Abstract

In direct sequence spread spectrum systems, pseudo sequence random (PN) are used to spreading data bits. There are various type of PN sequences are available with good correlation properties, on mostly are generating pn by linear feedback shift register (LFSR). Will examine in this paper we describe spreading binary random and spreading the image As well as studying probability bit error rate of DSSS system with change of the channel (Add white Gaussian noise channel, Rayleigh fading channel, Rician fading channel). Our study will be performed using MATLAB. Terms of completed my articles in building system developed to security transmitter and receiver the information of theft against communication digital system talk as well as the increase of data rate information. Was this design a way process of his used in applications military and have a major role also in the most applications requiring protect high for many information binary data and image. So that the system designed as fits practice and prevent the overlap the outside after it has become send signals in communication system exhibition penetration and Intentional attacks or other breaches.
A Rate Control Algorithm in JPEG2000 Based on Code Content Prediction Fengmei Liang; Jianqing Xing; Xiaoliang Li
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In order to accelerate the coding process of JPEG2000 and avoid encoding useless codes, a new algorithm is proposed for JPEG2000 rate control. This algorithm is improved by the model prediction algorithm.The code passes transmit the lowest frequency sub-band without distortion after wavelet decomposition. Then the proposed algorithm allocates the rate for the current code block accords to the number of coding passes and the weight of wavelet quantization. At last, it encodes the code block which brings the greatest amount of information preferentially, accords to the code block bit-plane relationship in the sub-band; In addition, the algorithm truncates the code-stream in real time during the encoding procedure. Compared with the PCRD algorithm, the experimental results indicate that the proposed algorithm can greatly reduce the computation operation and encoding time. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.3720
Practical Research of Electronic Transformer Based on Interpolation Algorithm Li Zhenkun; Ji Hui; Fu Yang
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 2: February 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

As a result of the adoption of new photovoltaic technology, electronic transformers have great advantages compared with traditional electromagnetic type, such as anti-saturated, high linearity, compact and lightweight etc. The working principle of sensing head of electronic current/voltage transformers is introduced in the paper. The causes of phase error in electronic transformer are analyzed. And a set of phase compensation methods based on the signal transfer principle of electronic transformer is presented. The phase-difference caused by Rogowski coil and time-delay in signal transferring from high voltage side to merging unit are analyzed, and the higher sampling rate and the method of linear interpolation is used to solve the problem. In the simulation test the phase error compensation effect is very good, and the simulation result shows that the integrated error after compensation is able to meet the requirements of the measurement and protection, and demonstrates the validity of the method. DOI: http://dx.doi.org/10.11591/telkomnika.v11i2.1983
Key Technology on Middleware-based Dynamic Traffic Information Platform Lei Wu; Tai Yang; Licai Yang
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 7: July 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i7.pp5661-5568

Abstract

According to traffic information of multi-source heterogeneity and complexity of information processing, the architecture of the dynamic traffic information platform based on middleware is proposed, which enhanced the system stability, generality, and efficiency depending on the high integration and scalability of middleware. This middleware-based platform unifies and encodes the data from all sorts of detectors, and integrates the multi-mode transmission, data preprocessing, and data fusion. On the publishing stage, this platform realizes the interactions between different publishing devices and traffic database through an independent traffic information publishing middleware. The proposed platform overcomes the data loss and data noise, decreases the data redundancy due to the heterogeneous multi-source data, and ensures the data accuracy with better security and expandability. The performance is efficient, reliable with cross-platform information transmission.
I-OnAR: a rule-based machine learning approach for intelligent assessment in an online learning environment Shaiful Bakhtiar bin Rodzman; Nordin Abu Bakar; Yun-Huoy Choo; Syed Ahmad Aljunid; Normaly Kamal Ismail; Nurazzah Abd Rahman; Marshima Mohd Rosli
Indonesian Journal of Electrical Engineering and Computer Science Vol 17, No 2: February 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v17.i2.pp1021-1028

Abstract

Intelligent systems are created to automate decision making process that is similar to human intelligence. Incorporating intelligent component has achieved promising results in many applications, including in education. Intelligence modules in a tutoring system would bring the application and its capability closer to a human's ability to serve its human users and to solve problems. However, the majority of the online learning provided in the literature review especially in Malaysia, normally only provide the lecture notes, assignments and tests and rarely suggest or give feedbacks on what the students should study or do next in order to fully understand the subjects. Hence, the researchers propose an online learning environment called Intelligent Online Assessment and Revision (I-OnAR). It facilitates the learning process at multiple learning phases such as test creation, materials revision, feedback for improvement and performance analysis. These components are incorporated into the tutoring system to assist self-pace learning at anytime and anywhere. The intelligent agent uses a Rule-based Machine Learning method for the adaptive capabilities such as automated test creation and feedbacks for improvement. The system has been tested on a group of students and found to be useful to support learning process. The results have shown that 60% of the subjects’ performance have improved with the help of the system. The students were given feedbacks on the topic they did poorly as well as how to improve their performance. This proves that the Intelligent Online Assessment and revision (I-OnAR) can be a useful tool to help online students intelligently, systematically and efficiently. For the future works, the researchers would like to apply the usage of other techniques such as Fuzzy Logic to strengthen the analysis and decision of the current system.

Page 453 of 918 | Total Record : 9174

 451   452   453   454   455 

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