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
 206   207   208   209   210 
Noncontact monitoring of heart rate responses to taste stimuli using a video camera Masnani Bt Mohamed; Makoto Yoshizawa; Norihiro Sugita; Shunsuke Yamaki; Kei Ichiji
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.pp293-300

Abstract

Pleasant or unpleasant feeling stimulated by taste usually expressed to describe the acceptance or rejection of food and beverages intake by a human. Since it stimulates the emotional reactions, therefore it also induces other response such as heart rate variations. Traditional sensory tools used only subjective measurement such as self-report, to estimate the feeling of tasting. This method sometimes failed to show some differences between the pleasant and unpleasant type of feelings unconsciously. Previous unconscious measurement methods used the intrusive technique by placing some sensors in contact with the body, which may affect the results of sensory analysis. This study was conducted to avoid the effects of using contact sensors and validate the contact-less method of monitoring heart rate due to emotional changes by extracting plethysmographic signal from the green component of the video images. The videos were recorded while the subject responded to pleasant, unpleasant and neutral stimuli. The findings indicated that the heart rate was significantly related to taste stimuli that also reflected the subjective feelings. The unpleasant-taste influenced heart rate to increase more compared to pleasant-taste and neutral-taste. This proposed approach can be used to remotely detect the feeling/emotion that not overtly express through facial expression, speech or gestures.
A New Transformer for High Voltage Charging Power Supply Jianming Liu; Meng Wang; Fucai Liu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 2: February 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

In this paper, the authers present a new high-frequency transformer for high-voltage capacitor charging power supply. They also establish a new topology structure and the charging control strategy for the charging power supply. The effects of leakage inductance and distributed capacitance by using the soft switching in the transformer were then analyzed. Finally, the different leakage inductances in the two transformers were tested. The results of the above study provide a theoratical basis for the application of the new high frequency transformer in pulsed power supply. DOI : http://dx.doi.org/10.11591/telkomnika.v12i2.4210
Optimization of Routing Protocol in Wireless Sensor Networks by Improved Ant Colony and Particle Swarm Algorithm Tianshun Huang
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 10: October 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i10.pp7486-7494

Abstract

This paper mainly discusses the analysis and evaluation of routing protocols for Wireless Sensor Networks. Particle swarm algorithm has been proven to be very good solve many global optimization problems. Ant colony algorithm not only uses the positive feedback principle, the evolution process of speeding up to a certain extent, but also can be implemented in parallel in nature and different individuals through continuous information exchange and transmission. The paper presents optimization of routing protocol in wireless sensor networks based on improved ant colony and particle swarm algorithm. Finally, simulation results verify the effectiveness of the improved algorithm, and improve the search for optimal routing.
Pareto Optimal Reconfiguration of Power Distribution Systems with Load Uncertainty and Recloser Placement Simultaneousely Using a Genetic Algorithm Based on NSGA-II Sina Khajeh Ahmad Attari; Mahmoud rReza Shakarami; Farhad Namdari
Indonesian Journal of Electrical Engineering and Computer Science Vol 1, No 3: March 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v1.i3.pp419-430

Abstract

Reconfiguration, by exchanging the functional links between the elements of the system, represents one of the most important measures which can improve the operational performance of a distribution system. Besides, reclosers use to eliminate transient faults, faults isolation, network management and enhance reliability to reduce customer outages. For load uncertainty a new method based on probabilistic interval arithmetic approach is used to incorporate uncertainty in load demand that can forecast reasonably accurate operational conditions of radial system distribution (RDS) with better computational efficiency. In this paper, the optimization process is performed by considering power loss reduction along with reliability index as objective functions. Simulation results on radial 33 buses test system indicates that simultaneous optimization of these two issues has significant impact on system performance.
The Optimization Design of Six-bar Linkage Mechanism Xiaoli Wang
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

At present, multi-bar linkage mechanism is one of the most important directions of mechanical presses’ development. Utilizing the typical multi-linkage drawing mechanism of the plunger slide and compounding its parameters scientifically are a fairly effective way to realize the drawing technology demand. This paper established kinematics mode of the six-bar drawing mechanism by bar-group method, and produced simulated system by Visual Basic, which simulated the actual motion of the mechanism. With the objective function-velocity fluctuation in drawing and drawing depth, using chaos genetic algorithm method, carried out optimization design of the mechanism, and acquired several groups’ data. The optimization results showed that their performance in kinematics was improved greatly and had exceeded the original mechanism. DOI: http://dx.doi.org/10.11591/telkomnika.v11i7.2863 
Preventing Denial-of-service in Next Generation Internet Protocol Mobility Maanasaa Sethuraman; Senthilkumar Mathi
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 1: October 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i1.pp137-146

Abstract

Internet Protocol version 6 (IPv6) is a next-generation internet protocol that is devised to replace its predecessor, the IPv4. With the benefit of ample address space, flexible header extensions and its many specific features, IPv6 is the future of the Internet and Internetworking. A significant advantage of IPv6 is its capabilities in the domain of security and mobility, where it scores in comparison with its predecessor. One of the many features specific to IPv6, such as the mandatory IPsec messaging or address auto-configuration, is the Neighbor Discovery Protocol (NDP). Even though the concept of security is more pronounced in the IPv6 protocols, there still exist loopholes. These loopholes when exploited target the foundation of the Internetworking. The extensive applications of NDP make it even more necessary to identify and address these gaps to ensure network security. Hence, this paper investigates such loopholes in the applications of NDP in creating a network and analyzes the process of the denial-of-service attacks that endanger the safety of an established network. Also, the paper proposes a new method to mitigate Denial-of-Service (DoS) in network mobility of IPv6 networks. This proposed approach is a hybrid of existing solutions and is capable of overcoming the significant disadvantages of these methods. Also, the paper discusses the comparative analysis among the various existing solutions and illustrates the effect of the proposed method in MIPv6 security.
Text Documents Plagiarism Detection using Rabin-Karp and Jaro-Winkler Distance Algorithms Brinardi Leonardo; Seng Hansun
Indonesian Journal of Electrical Engineering and Computer Science Vol 5, No 2: February 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v5.i2.pp462-471

Abstract

Plagiarism is an act that is considered by the university as a fraud by taking someone ideas or writings without mentioning the references and claimed as his own. Plagiarism detection system is generally implement string matching algorithm in a text document to search for common words between documents. There are some algorithms used for string matching, two of them are Rabin-Karp and Jaro-Winkler Distance algorithms. Rabin-Karp algorithm is one of compatible algorithms to solve the problem of multiple string patterns, while, Jaro-Winkler Distance algorithm has advantages in terms of time. A plagiarism detection application is developed and tested on different types of documents, i.e. doc, docx, pdf and txt. From the experimental results, we obtained that both of these algorithms can be used to perform plagiarism detection of those documents, but in terms of their effectiveness, Rabin-Karp algorithm is much more effective and faster in the process of detecting the document with the size more than 1000 KB.
Denoising performance analysis of adaptive decision based inverse distance weighted interpolation (DBIDWI) algorithm for salt and pepper noise Vorapoj Patanavijit
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.pp804-813

Abstract

Due to its superior performance for denoising an image, which is contaminated by impulsive noise, an adaptive decision based inverse distance weighted interpolation (DBIDWI) algorithm is one of the most dominant and successful denoising algorithm, which is recently proposed in 2017, however this DBIDWI algorithm is not desired for denoising the full dynamic intensity range image, which is comprised of min or max intensity. Consequently, the research article aims to study the performance and its limitation of the DBIDWI algorithm when the DBIDWI algorithm is performed in both general images and the images, which are comprised of min or max intensity. In this simulation experiments, six noisy images (Lena, Mobile, Pepper, Pentagon, Girl and Resolution) under salt&pepper noise are used to evaluate the performance and its limitation of the DBIDWI algorithm in denoised image quality (PSNR) perspective.
Architecture and Fault Identification of Wide-area Protection System Zhenxing Li; Xianggen Yin; Zhe Zhang; Yuxue Wang
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 3: July 2012
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Wide-area protection system (WAPS) is widely studied for the purpose of improvng the performance of conventional backup protection. In this paper, the system architecture of WAPS is proposed and its key technologies are discussed in view of engineering projects. So a mixed structure—centralized-distributed structure which is more suitable for WAPS in limited power grid region, is obtained based on the advantages of the centralized structure and distributed structure. Furthermore, regional distance protection algorithm was taken as an example to illustrate the functions of the constituent units. Faulted components can be detected based on multi-source imformation fuse in the algorithm. And the algorithm cannot only improve the selectivity, the rapidity, and the reliability of relaying protection but also has high fault tolerant capability. A simulation of 220 kV grid systems in Easter Hubei province shows the effectiveness of the wide-area protection system presented by this paper. DOI: http://dx.doi.org/10.11591/telkomnika.v10i3.604
A Virtual Machine Cloning Approach Based on Trusted Computing Wei Ma; Xiaoyong Li; Yong Shi; Yu Guo
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

Cloud computing has become more and more popular and the technology of rapid virtual machine (VM) cloning is widely used in cloud computing environment to implement the fast deployment of VMs to meet the need of bursting computational request. However, the security issue of VM cloning technology is not considered thoroughly in current approaches. This paper proposes a virtual machine cloning approach based on trusted computing which deals with memory and disk of a VM separately. This approach resolves three problems: the identities verification of involved servers; the attestation of source VM and destination VM; the protection of integrity of transmitted data. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.3558

Page 208 of 923 | Total Record : 9226

 206   207   208   209   210 

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