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 46 Documents
 1   2   3   4   5 
Search results for , issue "Vol 12, No 4: December 2014" : 46 Documents clear
Trajectory Tracking of AR.Drone Quadrotor Using Fuzzy Logic Controller Agung Prayitno; Veronica Indrawati; Gabriel Utomo
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 4: December 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

In this paper, Fuzzy Logic Controller (FLC) is implemented in the AR.Drone quadrotor in order to make it follow a given trajectory reference. The distance between the position and angle of the AR.Drone to the reference point is used as the input of FLC. As for the output, pitch value and yaw rate will be the controlling signal for the AR.Drone. The navigation data of the AR.Drone are forward speed (vx), sideward speed (vy), and yaw. These navigation data are going to be used to estimate positions and orientation of the AR.Drone. To compensate the y-position drift, the value of vyis also use as a criterion to determine the roll compensation. The FLC algorithm is implemented to AR.Drone 2.0 Elite Edition using LabVIEW software. Also, the algorithm has been tested in various trajectories such as straight line, a straight line with a perpendicular turn, a rectangular trajectory, and a curved trajectory. The results have shown that AR.Drone can follow a given trajectory with various initial position and orientation quite well.
Complex Optimization problems Using Highly Efficient Particle Swarm Optimizer Kaiyou Lei; Changjiu Pu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 4: December 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

Many  engineering problems are the complex optimization problems with the large numbers of global and local optima, due to its complexity, general particle swarm optimization methods are slow speed on convergence and easy to be trapped in local optima. In this paper, a highly efficient particle swarm optimizer is proposed, which employ the dynamic transition strategy of inertia factor, search space and velocity in each cycle to plan large-scale space global search and refined local search as a whole according to the fitness change of swarm in optimization process of the engineering problems, and to quicken convergence speed, avoid premature problem, economize computational expenses, and obtain global optimum. Several complex benchmark functions are used to testify the new algorithm and the results showed clearly the revised algorithm can rapidly converge at high quality solutions.
A Reliable Web Services Selection Method for Concurrent Requests Guiming Lu; Yan Hai; Yaoyao Sun
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 4: December 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

Current methods of service selection based on quality of service (QoS) usually focus on a single service request at a time, or let the users in a waiting queue wait for Web services when the same functional Web service has more than one requests, and then choose the Web service with the best QoS for the current request according to its own needs. However, there are multiple service requests for the same functional web service at a time in practice and we cannot choose the best service for users every time because of the service’s load. This paper aims at solving the Web Services selection for concurrent requests and developing a global optimal selection method for multiple similar service requesters to optimize the system resources. It proposes the improved social cognitive (ISCO) algorithm which uses genetic algorithm for observational learning and uses deviating degree to evaluate the solution. Furthermore, to enhance the efficiency of ISCO, the elite strategy is used in ISCO algorithm. We evaluate performance of the ISCO algorithm and the selection method through simulations. The simulation results demonstrate that the ISCO is valid for optimization problems with discrete data and more effective than ACO and GA.
A New Algorithm for Detecting Local Community Based on Random Walk Yueping Li; Weikun Zheng
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 4: December 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper presents one new algorithm for local community discovery. It employs a new vertex selection strategy which considers not only the boundary structure of candidate local community but also the probability which the investigated vertex will return to the candidate local community. A local random walk is adopted to compute this return probability which does not require the global information. We choose four algorithms for comparison which are the best ones existed by far. For better evaluation, the datasets include not only the computer generated graphs in standard benchmark but also the real-world networks which are classical ones in global community discovery. The experimental results show our algorithm outperforms the other ones on the computer generated graphs. The performance of our algorithm is approximately the same with the algorithm proposed by Luo, Wang and Promislow on real-world networks.
OWLS-CSM: A Service Profile Based Similarity Framework for Web Service Discovery Naji Hasan.A.H; Gao Shu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 4: December 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper presents OWLS-CSM framework, an OWL-S Service Profile based framework for web service discovery in cloud environment. In the proposed framework, services are presented as advertisements; their concepts are semantically defined and described in a hierarchal ontology to facilitate service matchmaking. In matchmaking process advertisements and query are represented as objects and three levels of similarities are used, based on OWL-S Service Profile, to matching, namely taxonomical similarity, functional similarity and non-functional similarity. Milestone method is adopted in the matchmaking algorithm to match the concepts according to their position in the hierarchal ontology. The results obtained from OWLS-CSM are analyzed and compared with other similar works to prove and evaluate the efficiency of our work. 
Multi-objective Optimization Based on Improved Differential Evolution Algorithm Shuqiang Wang; Jianli Ma
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 4: December 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

On the basis of the fundamental differential evolution (DE), this paper puts forward several improved DE algorithms to find a balance between global and local search and get optimal solutions through rapid convergence. Meanwhile, a random mutation mechanism is adopted to process individuals that show stagnation behaviour. After that, a series of frequently-used benchmark test functions are used to test the performance of the fundamental and improved DE algorithms. After a comparative analysis of several algorithms, the paper realizes its desired effects by applying them to the calculation of single and multiple objective functions.

Page 5 of 5 | Total Record : 46

 1   2   3   4   5 

Filter by Year

2014 2014


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