cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Nizirwan Anwar
Contact Email
nizirwan.anwar@esaunggul.ac.id
Phone
-
Journal Mail Official
telkomnika@ee.uad.ac.id
Editorial Address
Ahmad Yani st. (Southern Ring Road), Tamanan, Banguntapan, Bantul, Yogyakarta 55191, Indonesia
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
TELKOMNIKA (Telecommunication Computing Electronics and Control)
Published by Universitas Ahmad Dahlan
ISSN : 16936930     EISSN : 23029293     DOI : 10.12928
Core Subject : Science,
Computer Science & IT
Submitted papers are evaluated by anonymous referees by single blind peer review for contribution, originality, relevance, and presentation. The Editor shall inform you of the results of the review as soon as possible, hopefully in 10 weeks. Please notice that because of the great number of submissions that TELKOMNIKA has received during the last few months the duration of the review process can be up to 14 weeks. Communication Engineering, Computer Network and System Engineering, Computer Science and Information System, Machine Learning, AI and Soft Computing, Signal, Image and Video Processing, Electronics Engineering, Electrical Power Engineering, Power Electronics and Drives, Instrumentation and Control Engineering, Internet of Things (IoT)
Arjuna Subject : Ilmu Komputer (semua kategori) - Aplikasi Ilmu Komputer
Articles 25 Documents
 1   2   3 
Search results for , issue "Vol 10, No 4: December 2012" : 25 Documents clear
Optimum Design of a Five-phase Permanent Magnet Synchronous Motor for Underwater Vehicles by use of Particle Swarm Optimization Reza Ilka; S. Asghar Gholamian
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 10, No 4: December 2012
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v10i4.860

Abstract

Permanent magnet synchronous motors are efficient motors which have widespread applications in electric industry due to their noticeable features. One of the interesting applications of such motors is in underwater vehicles. In these cases, reaching to minimum volume and high torque of the motor are the major concern. Design optimization can enhance their merits considerably, thus reduce volume and improve performance of motors. In this paper, a new method for optimum design of a five-phase surface-mounted permanent magnet synchronous motor is presented to achieve minimum loss and magnet volume with an increased torque. A multi-objective optimization is performed in search for optimum dimensions of the motor and its permanent magnets using particle swarm optimization. The design optimization results in a motor with great improvement regarding the original motor. Finally, finite element analysis is utilized to validate the accuracy of the design.
An Improved Robot Path Planning Algorithm Xuesong Yan Xuesong Yan; Qinghua Wu Qinghua Wu; Hammin Liu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 10, No 4: December 2012
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v10i4.850

Abstract

Robot path planning is a NP problem. Traditionaloptimization methods are not very effective to solve it. Traditional genetic algorithm trapped into the local minimum easily. Therefore, based on a simple genetic algorithm and combine the base ideology of orthogonal design method then applied it to the population initialization, using the intergenerational elite mechanism, as well as the introduction of adaptive local search operator to prevent trapped into the local minimum and improvethe convergence speed to form a new genetic algorithm. Through the series of numerical experiments, the new algorithm has been proved to be efficiency.We also use the proposed algorithm to solve the robot path planning problem and the experiment results indicated that the new algorithm is efficiency for solving the robot path planning problems and the best path usually can be found.
Effects of Puncturing Patterns on Punctured Convolutional Codes Lydia Sari
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 10, No 4: December 2012
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v10i4.865

Abstract

Punctured convolutional codes are known to have low complexity compared to their non-punctured counterpart, while retaining a good performance. Analyzing the performance of punctured convolutional code can be simplified by using non-punctured equivalent code. In this paper new punctured convolutional codes with rates of 3/8, 3/7 and 3/6 are proposed, and their performances are studied by first constructing non-punctured equivalent codes. Simulations results show that different puncturing patterns will affect the code performances. Further investigations show that puncturing adjacent bits is to be avoided as it tends to degrade the code performance, as indicated by a decrease of the free distance by 9% and 33% below average for code rates 3/7 and 3/6 respectively. On the contrary, dispersed punctured bits will yield good code performance as indicated in the increase of the free distance by 27% and 32.45% above average for code rates 3/7 and 3/6 respectively.
Improved Bacterial Foraging Algorithm for Optimum Economic Emission Dispatch with Wind Power Sajjad Farajianpour; Ali Mohammadi; Saeed Tavakoli; S. Masoud Barakati
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 10, No 4: December 2012
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v10i4.855

Abstract

In this paper, an improved bacterial foraging algorithm (IBFA) is employed to solve economic-emission dispatch (EED) problem. Regarding to more interest to renewable energy sources especially wind energy in recent years, it is necessary to use of incorporate wind power plants into EED problem. To consider realistic conditions, EED is included bi-objective of cost and NOx emission. The problems encountered with BFA are ineffective bacteria elimination resulted in poor performance. To overcome this, a modified BFA is proposed in reproduction step termed as Improved Baterial Foraging Algorithm (IBFA). EED is solved, with wind power plant and without it, subjected to couple of constraintsusing BFA an BFA in a comparative manner.Simulation results show enhancement in convergence accuracy with IBFA rather than conventional BFA.
Securing E-Mail Communication Using Hybrid Cryptosystem on Android-based Mobile Devices Teddy Mantoro; Andri Zakariya
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 10, No 4: December 2012
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v10i4.870

Abstract

One of the most popular internet services is electronic mail (e-mail). By using mobile devices with internet connection, e-mail can be widely used by anyone to exchange information anywhere and anytime whether public or confidential. Unfortunately, there are some security issues with email communication; e-mail is sent in over open networks and e-mail is stored on potentially insecure mail servers. Moreover, e-mail has no integrity protection so the body can be undectected altered in transit or on the e-mail server. E-mail also has no data origin authentication, so people cannot be sure that the emails they receive are from the e-mail address owner. In order to solve this problem, this study proposes a secure method of e-mail communication on Android-based mobile devices using a hybrid cryptosystem which combines symmetric encryption, asymmetric encryption and hash function. The experimental results show that the proposed method succeeded in meeting those aspects of information security including confidentiality, data integrity, authentication, and non-repudiation.

Page 3 of 3 | Total Record : 25

 1   2   3 

Filter by Year

2012 2012


Reset
Filter By Issues
All Issue Vol 20, No 3: June 2022 Vol 20, No 2: April 2022 Vol 20, No 1: February 2022 Vol 19, No 6: December 2021 Vol 19, No 5: October 2021 Vol 19, No 4: August 2021 Vol 19, No 3: June 2021 Vol 19, No 2: April 2021 Vol 19, No 1: February 2021 Vol 18, No 6: December 2020 Vol 18, No 5: October 2020 Vol 18, No 4: August 2020 Vol 18, No 3: June 2020 Vol 18, No 2: April 2020 Vol 18, No 1: February 2020 Vol 17, No 6: December 2019 Vol 17, No 5: October 2019 Vol 17, No 4: August 2019 Vol 17, No 3: June 2019 Vol 17, No 2: April 2019 Vol 17, No 1: February 2019 Vol 16, No 6: December 2018 Vol 16, No 5: October 2018 Vol 16, No 4: August 2018 Vol 16, No 3: June 2018 Vol 16, No 2: April 2018 Vol 16, No 1: February 2018 Vol 15, No 4: December 2017 Vol 15, No 3: September 2017 Vol 15, No 2: June 2017 Vol 15, No 1: March 2017 Vol 14, No 4: December 2016 Vol 14, No 3: September 2016 Vol 14, No 2: June 2016 Vol 14, No 1: March 2016 Vol 13, No 4: December 2015 Vol 13, No 3: September 2015 Vol 13, No 2: June 2015 Vol 13, No 1: March 2015 Vol 12, No 4: December 2014 Vol 12, No 3: September 2014 Vol 12, No 2: June 2014 Vol 12, No 1: March 2014 Vol 11, No 4: December 2013 Vol 11, No 3: September 2013 Vol 11, No 2: June 2013 Vol 11, No 1: March 2013 Vol 10, No 4: December 2012 Vol 10, No 3: September 2012 Vol 10, No 2: June 2012 Vol 10, No 1: March 2012 Vol 9, No 3: December 2011 Vol 9, No 2: August 2011 Vol 9, No 1: April 2011 Vol 8, No 3: December 2010 Vol 8, No 2: August 2010 Vol 8, No 1: April 2010 Vol 7, No 3: December 2009 Vol 7, No 2: August 2009 Vol 7, No 1: April 2009 Vol 6, No 3: December 2008 Vol 6, No 2: August 2008 Vol 6, No 1: April 2008 Vol 5, No 3: December 2007 Vol 5, No 2: August 2007 Vol 5, No 1: April 2007 Vol 4, No 3: December 2006 Vol 4, No 2: August 2006 Vol 4, No 1: April 2006 Vol 3, No 3: December 2005 Vol 3, No 2: August 2005 Vol 3, No 1: April 2005 Vol 2, No 1: April 2004 More Issue