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 2,614 Documents
 60   61   62   63   64 
Ternary content addressable memory for longest prefix matching based on random access memory on field programmable gate array Ng Shao Kay; M. N. Marsono
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 17, No 4: August 2019
Publisher : Universitas Ahmad Dahlan

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

Abstract

Conventional ternary content addressable memory (TCAM) provides access to stored data, which consists of '0', '1' and ‘don't care’, and outputs the matched address. Content lookup in TCAM can be done in a single cycle, which makes it very important in applications such as address lookup and deep-packet inspection. This paper proposes an improved TCAM architecture with fast update functionality. To support longest prefix matching (LPM), LPM logic are needed to the proposed TCAM. The latency of the proposed LPM logic is dependent on the number of matching addresses in address prefix comparison. In order to improve the throughput, parallel LPM logic is added to improve the throughput by 10× compared to the one without. Although with resource overhead, the cost of throughput per bit is less as compared to the one without parallel LPM logic.
Improvement of voltage profile for large scale power system using soft computing approach Muhammad Abdillah; Herlambang Setiadi; Danang Sulistyo
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 18, No 1: February 2020
Publisher : Universitas Ahmad Dahlan

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

Abstract

In modern power system operation and planning, reactive power is an important part of power system operation to supply electrical load such as an electric motor. However, the reactive current that flows from the generator to load demand can cause voltage drop and active power loss. Hence, it is essential to install a compensating device such as a shunt capacitor close to the load bus to reduce the total power loss of the transmission line and improve the voltage stability of the system. This paper presents the application of a genetic algorithm (GA), particle swarm optimization (PSO), and artificial bee colony (ABC)) to obtain the optimal size of the shunt capacitor where those capacitors are located on the critical bus. To examine the efficacy of the proposed algorithm, Java-Madura-Bali (JAMALI) 500kV power system grid is used as the test system. From the simulation results, the use of PSO and ABC algorithms to obtain the sizing of the capacitor’s capacity can reduce the power loss of around 15.873 MW. Moreover, a different result is showed by the GA approach where the power loss in the JAMALI 500kV power grid can be compressed only up to 15.54 MW or 11.38% from the power system operation without a shunt capacitor. The three soft computing techniques could also maintain the voltage profile within 1.05 p.u and 0.95 p.u.
RPL routing protocol performance under sinkhole and selective forwarding attack: experimental and simulated evaluation Bimal H. Patel; Parth Shah
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 18, No 4: August 2020
Publisher : Universitas Ahmad Dahlan

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

Abstract

To make possible dream of connecting 30 billion smart devices assessable from anywhere, anytime and to fuel the engine growth of Internet of things (IoT) both in terms of physical and virtual things, Internet Engineering Task Force (IETF) came up with a concept of 6LoWPAN possessing characteristics like low power, bandwidth and cost. To bridge the routing gap and to collaborate between low power private area network and the outside world, IETF ROLL group proposed IPv6 based lightweight standard RPL (Routing protocol for low power and lossy networks). Due to large chunks of random data generated on daily basis security either externally or internally always remain bigger threat which may lead to devastation and eventually degrades the quality of service parameters affecting network resources. This paper evaluates and compare the effect of internal attacks like sinkhole and selective forwarding attacks on routing protocol for low power and lossy network topology. Widely known IoT operating system Contiki and Cooja as the simulator are used to analyse different consequences on low power and lossy network.
Palm print verification based deep learning Lubab H. Albak; Raid Rafi Omar Al-Nima; Arwa Hamid Salih
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 19, No 3: June 2021
Publisher : Universitas Ahmad Dahlan

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

Abstract

In this paper, we consider a palm print characteristic which has taken wide attentions in recent studies. We focused on palm print verification problem by designing a deep network called a palm convolutional neural network (PCNN). This network is adapted to deal with two-dimensional palm print images. It is carefully designed and implemented for palm print data. Palm prints from the Hong Kong Polytechnic University Contact-free (PolyUC) 3D/2D hand images dataset are applied and evaluated. The results have reached the accuracy of 97.67%, this performance is superior and it shows that our proposed method is efficient.
Efficient Motion Field Interpolation Method for Wyner-Ziv Video Coding I Made Oka Widyantara; Wirawan Wirawan; Gamantyo Hendrantoro
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 9, No 1: April 2011
Publisher : Universitas Ahmad Dahlan

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

Abstract

Wyner-Ziv video coding has the capability to reduce video encoding complexity by shifting motion estimation procedure from encoder to decoder. Amongst many motion estimation methods, expectation maximization algorithm is the most effective one. Unfortunately, the implementation of block-based motion estimation in this algorithm causes motion field profile bounded by granularity of block size. Nearest-neighbor and bilinear interpolation methods have already applied in multiview image coding to handle similar problem. This paper aims to evaluate performance of both interpolation methods in transform-domain Wyner-Ziv video codec. Results showed that bilinear interpolation effective only for high motion video sequences. In this scenario, it has bitrate saving up to 3.29 %, 0.2 dB higher PSNR, and 12.30 % higher decoding complexity compared to nearest-neighbor. In low motion video content, bitrate saving only gained up to 0.82%, with almost the same PSNR, while decoding complexity increase up to 10.32%.   
Guaranteed Cost Control for Uncertain Neutral Systems with a Minimal Order Observer Erwin Susanto; Junartho Halomoan; Mitsuaki Ishitobi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 2: June 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper presents a design scheme of a minimal order observer-based guaranteed cost controller for uncertain neutral systems, in which some state variables can not be measured. The uncertainties are assumed to be norm-bounded. The initial state is assumed unknown but their mean and covariance are assumed known. A sufficient condition for robust stability analysis and robust stabilization are derived via linear matrix inequalities (LMIs). To show the advantage of the proposed method, a numerical example is given.
A Review on Favourable Maximum Power Point Tracking Systems in Solar Energy Application Awang Jusoh; Tole Sutikno; Tan Kar Guan; Saad Mekhilef
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 1: March 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper reviews different types of maximum power point tracking (MPPT) techniques for solar photovoltaic (PV) application. Since the PV output power is known affected by sun radiation and temperature, it is necessary to search for an effective method for extracting maximum amount of power from PV cell/modules. In this study, a total of seven control algorithms were selected, comprising the most popular methods among the established techniques. A comparison in terms of convergence speed, complexity, as well as the basic concept of each method had been carried out for future reference. Based on the accessible simulation results, modified Perturb and Observe (P&O) method had shown its effectiveness for obtaining actual maximum power point while solving major drawbacks of the conventional P&O. This paper also discusses typical solar MPPT system, including the pros and cons of each part of the system.
Genetic Algorithm of Sliding Mode Control Design for Manipulator Robot Ahmad Riyad Firdaus; Arief Syaichu Rahman
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.852

Abstract

The dynamical model of manipulator robot is represented by equations systems which are nonlinear and strongly coupled. Furthermore, the inertial parameters of manipulator depend on the payload which is often unknown and variable. The sliding mode controller (SMC) provides an effective and robust means of controlling nonlinear plants. The performance of SMC depends on control parameter selection of gain switching (k) and sliding surface constant (s). It is very difficult to obtain the optimal control parameters. In this paper, a control parameter selection algorithm is proposed by genetic algorithm to select the gain switching (k) and sliding surface constant parameter (s) so that the controlled system can achieve a good overall performance in the sliding mode controller design. Testing is done by giving a reference position for joint 1 and joint 2 of the robot manipulator of 45O (degree) with the controller performance indicator is settling time
APLIKASI MOBILE COMMERCE UNTUK SISTEM INFORMASI PEMESANAN SEPEDA MOTOR IMPOR PADA DEALER HRC (HONDA RACING CBU) Dewi Soyusiawaty
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 6, No 2: August 2008
Publisher : Universitas Ahmad Dahlan

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

Abstract

Pada umumnya untuk mendapatkan informasi sepeda motor impor biasanya dilakukan dengan melihat brosur, iklan, browsing internet, bahkan banyak juga yang harus langsung mendatangi dealer sepeda motor impor yang hanya ada di kota-kota besar, sedangkan pihak dealer melakukan promosi produknya dengan membagikan brosur, dan membuat iklan via media massa seperti tabloid atau surat kabar. Cara-cara seperti ini kurang efektif dan efisien dalam hal waktu, biaya dan tenaga. Penelitian ini bertujuan untuk membangun aplikasi mobile commerce untuk sistem informasi pemesanan sepeda motor impor pada dealer HRC (Honda Racing CBU yang dapat diakses melalui handphone. Penelitian ini dimulai dengan menganalisis kebutuhan sistem dengan melakukan pengumpulan dan pengelompokan data yang sesuai dengan jenis dan fungsinya, melakukan perancangan kebutuhan perangkat lunak dengan pemodelan yang mudah dimengerti dan yang terakhir merancang program aplikasi yang diimplementasikan ke dalam perangkat lunak. Setelah program selesai, dilakukan pengujian dengan metode black box test dan alpha test. Berdasarkan hasil uji coba program, maka dapat disimpulkan bahwa program ini dapat di akses melalui telepon seluler (ponsel) dan dapat membantu user dalam mendapatkan informasi, melakukan pemesanan sepeda motor hingga suku cadang secara online dan membantu pihak dealer dalam mempromosikan atau memasarkan produk sepeda motornya.
A Novel Image Segmentation Algorithm Based on Graph Cut Optimization Problem Zhang Guang-hua; Xiong Zhong-yang; Li Kuan; Xing Chang-yuan; Xia Shu-yin
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

Image segmentation, a fundamental task in computer vision, has been widely used in recent years in many fields. Dealing with the graph cut optimization problem obtains the image segmentation results. In this study, a novel algorithm with weighted graphs was constructed to solve the image segmentation problem through minimization of an energy function. A binary vector of the segmentation label was defined to describe both the foreground and the background of an image. To demonstrate the effectiveness of our proposed method, four various types of images were used to construct a series of experiments. Experimental results indicate that compared with other methods, the proposed algorithm can effectively promote the quality of image segmentation under three performance evaluation metrics, namely, misclassification error rate, rate of the number of background pixels, and the ratio of the number of wrongly classified foreground pixels.

Page 62 of 262 | Total Record : 2614

 60   61   62   63   64 

Filter by Year

2004 2022


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