Article Per Year (5 Year)
p-Index From 2021 - 2026
3.533
P-Index
This Author published in this journals
All Journal Prosiding SNATIKA Vol 01 (2011) Jurnal Teknologi Informasi dan Ilmu Komputer International Journal of Advances in Intelligent Informatics The Asian Journal of Technology Management (AJTM) JOIV : International Journal on Informatics Visualization Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Network Engineering Research Operation [NERO] Jurnal Abdimas Mahakam Indonesian Journal of Electrical Engineering and Computer Science Frontier Energy System and Power Engineering JOURNAL OF INFORMATION SYSTEM RESEARCH (JOSH) Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika) Jurnal Teknik Informatika (JUTIF) Journal of Applied Data Sciences Jurnal FASILKOM (teknologi inFormASi dan ILmu KOMputer) Prima Abdika: Jurnal Pengabdian Masyarakat Jurnal ilmiah teknologi informasi Asia
Sulistyo, Danang Arbian
Institut Teknologi Dan Bisnis ASIA Malang
Arts Humanities Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Mathematics Public Health Social Sciences Other

Published : 27 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal Teknik Informatika (JUTIF)

 1 
STEMMING IN MADURESE LANGUAGE USING NAZIEF AND ADRIANI ALGORITHM Moh Ashari; Sulistyo, Danang Arbian; Ahda, Fadhli Almu’iini
Jurnal Teknik Informatika (Jutif) Vol. 5 No. 4 (2024): JUTIF Volume 5, Number 4, August 2024 - SENIKO
Publisher : Informatika, Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52436/1.jutif.2024.5.4.2012

Abstract

Madurese is one of the regional languages in Indonesia, which dominates East Java and Madura Island in particular. However, the use of Madurese is declining compared to other regional languages. This is partly due to a sense of prestige and difficulty in learning it. As a result, the future of Madurese as one of the regional languages in Indonesia is increasingly threatened by the decline in its use. In addition, academic literature and scientific publications in Madurese are difficult to find in public and academic libraries, so previous research on Madurese stemming is still very little and needs to be developed further. Therefore, this research aims to find the base word of Madurese language using Nazief & Adriani algorithm based on Madurese language morphology. The Nazief & Adriani method in previous studies has good performance. Stemming can also be developed into a Madurese language translator application into other languages. This research uses 650 words in the form of datasets, consisting of 500 prefix words and 150 suffix words. The resulting accuracy for the whole is 96.61% with 628 correct words, the prefix has 95.6% accuracy, and the suffix has 100% accuracy. Overstemming was found in 22 prefix words and no words experienced Understemming.
ROUTING OPTIMIZATION ON SOFTWARE DEFINED NETWORK ARCHITECTURE USING BREADTH FIRST SEARCH ALGORITHM Armanda, David; Mukti, Fransiska Sisilia; Sulistyo, Danang Arbian
Jurnal Teknik Informatika (Jutif) Vol. 5 No. 4 (2024): JUTIF Volume 5, Number 4, August 2024 - SENIKO
Publisher : Informatika, Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52436/1.jutif.2024.5.4.2000

Abstract

Software Defined Network (SDN) is a network modelling that separates the control plane and data plane. SDN is a new form of paradigm used for large-scale networks, one of which is for routing. Most types of routing used today use single-path routing. Single-path only uses one path as data transmission. This will result in reduced performance on the network which is often referred to as network congestion. In this test, the routing algorithm used is Breadth First Search (BFS) by modifying the path so that congestion on the network can be minimised. The BFS algorithm is implemented using Mininet emulator, Ryu Controller, and fat-tree topology. In the test, 20 scenarios were used with a bandwidth of 50 - 1000 Mbps within 15 seconds. Tests were conducted to measure the performance of the BFS algorithm, namely the path and QOS (Quality Of Service) parameters which include testing delay, packet loss, jitter, and throughput. The data obtained in testing using the conventional BFS algorithm is compared with the modified BFS algorithm data in the same test method. In path testing, the modified BFS algorithm is superior and in parameter testing, it is produced with a degraded percentage value in delay (65%), packet loss (99%), jitter (84%), and throughput has increased by (41%). So the modified BFS algorithm is superior due to the utilisation of path modification for routing optimisation which is more effective in handling network congestion.
Co-Authors A.N. Afandi Achmad Noercholis Aji Prasetya Wibawa Andika Dwiyanto, Felix Andira, Aysza Belia Auly Andrew Nafalski Aripriharta - Armanda, David Didik Dwi Prasetya Fadhli Almu’iini Ahda Fahrudillah, Mochammad Fiqi Farokhah, Lia Fransiska Sisilia Mukti Gunawan Gunawan Hanip Afandi I Nyoman Gede Arya Astawa Ida Wahyuni Lilis Widayanti Machrus Tohir Machrus Tohir Moh Ashari Muhammad Rofiq Muhammad Rofiq Philip Faster Eka Adipraja Pratama, Ficho Pranandasya Andrian Setiadi, Erik Siti Maharani, Farah Shafiyah Suastika Yulia Riska Sulthan Shidqi Sulthan Shidqi Vivi Aida Fitria Wayan Firdaus Mahmudy Yogie Susdyastama Putra