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
 38   39   40   41   42 
The Analysis of Rank Fusion Techniques to Improve Query Relevance Diyah Puspitaningrum; Jeri Apriansyah Pagua; Aan Erlansari; Fauzi Fauzi; Rusdi Efendi; Desi Andreswari; I.S.W.B. Prasetya
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.2736

Abstract

Rank fusion meta-search engine algorithms can be used to merge web search results of multiple search engines. In this paper we introduce two variants of the Weighted Borda-Fuse algorithm. The first variant retrieves documents based on popularities of component engines. The second one is based on k user-defined toplist of component engines. In this research, experiments were performed on k={50,100,200} toplist with AND/OR combinations implemented on ‘UNIB Meta Fusion’ meta-search engine prototype which employed 3 out of 5 popular search engines. Both of our two algorithms outperformed other rank fusion algorithms (relevance score is upto 0.76 compare to Google that is 0.27, at P@10). The pseudo-relevance automatic judgement techniques involved are Reciprocal Rank, Borda Count, and Condorcet. The optimal setting was reached for queries with operator "AND" (degree 1) or "AND ... AND" (degree 2) with k=200. The ‘UNIB Meta Fusion’ meta-search engine system was built correctly.
Streaming Audio Using MPEG–7 Audio Spectrum Envelope to Enable Self-similarity within Polyphonic Audio Jonathan Doherty; Kevin Curran; Paul McKevitt
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

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

Abstract

One method overlooked to date, which can work alongside existing audio compression schemes, is that which takes account of the semantics and natural repetition of music through meta-data tagging. Similarity detection within polyphonic audio has presented problematic challenges within the field of Music Information Retrieval.  This paper presents a method (SoFI) for improving the quality of stored audio being broadcast over any wireless medium through meta-data which has a number of market applications all with market value. Our system works at the content level thus rendering it applicable in existing streaming services. Using the MPEG-7 Audio Spectrum Envelope (ASE) gives features for extraction and combined with k-means clustering enables self-similarity to be performed within polyphonic audio. SoFI uses string matching to identify similarity between large sections of clustered audio. Objective evaluations of SoFI give positive results which show that SoFI is shown to detect high levels of similarity on varying lengths of time within an audio file. In a scale between 0 and 1 with 0 the best, a clear correlation between similarly identified sections of 0.2491 shows successful identification.
Breast Mass Segmentation Using a Semi-automatic Procedure Based on Fuzzy C-means Clustering Moustapha Mohamed Saleck; Abdelmajid El Moutaouakkil; Mohammed Moucouf; Maksi Bouchaib; Hani Samira; Jamaldine Zineb
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 2: April 2018
Publisher : Universitas Ahmad Dahlan

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

Abstract

Mammography is the primary modality that helped in the early detection and diagnosis of women breast diseases. Further, the process of extracting the masses in mammogram represents a challenging task facing the radiologists, due to problems such as fuzzy or speculated borders, low contrast and the presence of intensity inhomogeneities. Aims to help the radiologists in the diagnosis of breast cancer, many approaches have been conducted to automatically segment the masses in mammograms. Towards this aim, in this paper, we present a new approach for extraction of tumors from region-of-interest (ROI) using the algorithm of Fuzzy C-Means (FCM) setting two clusters for semi-automated segmentation. The proposed method meant to select as input data the set of pixels that enable to get the meaningful information required to segment the masses with high accuracy. This could be accomplished through eliminating unnecessary pixels, which influence on this process through separating it outside of the input data using an optimal threshold given by monitoring the change of clusters rate during the process of threshold decrementing. The proposed methodology has successfully segmented the masses, with an average sensitivity of 82.02% and specificity of 98.23%.
Measurement of Shear Strain in Map Liquefaction Area for Earthquake Mitigation in Bengkulu City Muhammad Farid; Arif Ismul Hadi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 4: August 2018
Publisher : Universitas Ahmad Dahlan

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

Abstract

Bengkulu city is well-known as a high-risk area for an earthquake. One of the effects of the earthquake is liquefaction, the phenomenon in which the strength and stiffness of the soil are reduced by shock. The researchers measured the quantity of liquefaction by knowing the value of Vs30 values that can be obtained from the United States Geological Survey (USGS). In this study, however, we measured liquefaction based on the shear strain value (γ). Here, the shear strain values could be determined by measuring the seismic vulnerability index and the peak ground acceleration. The vulnerability index was obtained by measuring the resonance of the frequency and the amplification factor using a short period seismometer with 3 components (2 horizontal components and 1 vertical component), whereas the peak ground accelerationα was obtained from the earthquake data that happened in Bengkulu City in 2000. The result showed that Vs30 and shear strain negatively correlated.
A novel key management protocol for vehicular cloud security Nayana Hegde; Sunilkumar S. Manvi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 17, No 2: April 2019
Publisher : Universitas Ahmad Dahlan

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

Abstract

Vehicular cloud computing (VCC) is a new hybrid technology which has become an outstanding area of research. VCC combines salient features of cloud computing and wireless communication technology to help drivers in network connectivity, storage space availability and applications. VCC is formed by dynamic cloud formation by moving vehicles. Security plays an important role in VCC communication. Key management is one of the important tasks for security of VCC. This paper proposes a novel key management protocol for VCC security. Proposed scheme is based on Elliptical Curve Cryptography (ECC). The simulation results demonstrated that the proposed protocol is efficient compared to existing key management algorithms in terms of key generation time, memory usage and cpu utilization.
Evaluation of the quality of an image encrytion scheme Osemwegie Omoruyi; Chinonso Okereke; Kennedy Okokpujie; Etinosa Noma-Osaghae; Obinna Okoyeigbo; Samuel John
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 17, No 6: December 2019
Publisher : Universitas Ahmad Dahlan

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

Abstract

Encryption systems have been developed for image viewing applications using the Hill Cipher algorithm. This study aims to evaluate the image encryption quality of the Hill Cipher algorithm. Several traditional metrics are used to evaluate the quality of the encryption scheme. Three of such metrics have been selected for this study. These include, the Colour Histogram, the Maximum Deviation (comparing the original image) and the Entropy Analysis of the encrypted image. Encryption quality results from all three schemes using a variety of images show that a plain Hill Cipher approach gives a good result for all kinds of images but is more suited for colour dense images.
IoT-based guppy fish farming monitoring and controlling system Periyadi Periyadi; Gita Indah Hapsari; Zahir Wakid; Sobran Mudopar
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 18, No 3: June 2020
Publisher : Universitas Ahmad Dahlan

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

Abstract

Nowadays, monitoring of guppy fish farming is still done manually. A monitoring and control system is needed to make it easier for guppy fish farmers. This system consists of a sensor module and monitoring module. Sensor module detects the value of pH and salinity of water and send it to the monitoring module. Monitoring is used as a web-based system using IoT technology. This web-based system serves to monitor and control the pH value and only monitor the salinity value. The workings of the monitoring and control system send data on pH and salinity sent by the sensor and then stored and in database hosting. Data on the database will be displayed on the website using wireless media, making it easier for users to view data and information remotely. Beside, farmers are facilitated in knowing the value of pH and salt content dissolved in water. For the value of a dangerous salt content worth less than 160 and more than 210, if for a pH of less than 6.5 and more than 7.5. Farmers are also facilitated to control pH with servo motors through the website, so farmers can prevent if the pH content dissolved in water is dangerous for guppy fish.
A proposed cloud-based billers hub using secured e-payments system Belal Ayyoub; Bilal Zahran; Mahdi A. Nisirat; Farouq M. S. Al-Taweel; Mohammad Al Khawaldah
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 19, No 1: February 2021
Publisher : Universitas Ahmad Dahlan

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

Abstract

Automation of several payment processes from start to end is a challenging task, particularly when multiple payments from online and offline billers are involved. In this paper, we introduced a new aggregator system to combine all billing system types, in which it is possible to pay invoices electronically. The proposed aggregator system was designed to be employed in a cloud-based Billers Hub (CBBH) developed by the central banks. Furthermore, many applications can be realized such as; deposit e-money, withdrawal e-money, and other applications. A Gateway translator is used to apply authentication rules, security, and privacy. The proposed system was employed in the Jordanian payment gateway and successfully fulfills its purpose.
A Self-Adaptive Chaos Particle Swarm Optimization Algorithm Yalin Wu; Shuiping Zhang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 1: March 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

As a new evolutionary algorithm, particle swarm optimization (PSO) achieves integrated evolution through the information between the individuals. All the particles have the ability to adjust their own speed and remember the optimal positions they have experienced. This algorithm has solved many practical engineering problems and achieved better optimization effect. However, PSO can easily get trapped in local extremum, making it fail to get the global optimal solution and reducing its convergence speed. To settle these deficiencies, this paper has proposed an adaptive chaos particle swarm optimization (ACPSO) based on the idea of chaos optimization after analyzing the basic principles of PSO. This algorithm can improve the population diversity and the ergodicity of particle search through the property of chaos; adjust the inertia weight according to the premature convergence of the population and the individual fitness; consider the global optimization and local optimization; effectively avoid premature convergence and improve algorithm efficiency. The experimental simulation has verified its effectiveness and superiority.
Research on Optimization Strategy to Data Clustered Storage of Consistent Hashing Algorithm Ningjia Qiu; Xiaojuan Hu; Peng Wang; Huamin Yang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 3: September 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper has been withdrawed due to has major technical problems.---------------------------------------------------------------------This paper presents a consistent hashing data optimize multiple copy distributed clustered storage placement strategy, using technology to create a virtual node and aliquots storage area to ensure the balanced distribution of data storage. With the speed of data processing accelerated, it is possible for clusters actual required to complete the expansion, and complete the development of adaptive optimization. Experiments show that the execution speed has effectively improved to ensure the load balance. With possible extensions and reducing problems treatment in actual situation, oscillation has little impact on the load balancing, and the execution time is consistent with the proportion of the load trends.

Page 40 of 262 | Total Record : 2614

 38   39   40   41   42 

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