Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal SemanTIK : Teknik Informasi
Jumadil Nangi
Jurusan Teknik Informatika, Fakultas Teknik Universitas Halu Oleo, Kendari
Computer Science & IT Control & Systems Engineering

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

Found 3 Documents
Search

 1 
APLIKASI FORECASTING JUMLAH FREKUENSI PENUMPANG PESAWAT TERBANG LION AIR PADA BANDAR UDARA HALU OLEO DENGAN MENGGUNAKAN METODE LEAST SQUARE Waode Berlian Ruamiana; Jumadil Nangi; LM Tajidun
semanTIK Vol 4, No 1 (2018): semanTIK
Publisher : Informatics Engineering Department of Halu Oleo University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (583.824 KB) | DOI: 10.55679/semantik.v4i1.4468

Abstract

As the era develops really quickly, the development of technology in transportation also changing rapidly. One of the most transport demands by the public for a long journey today is air transport. Along with the increase of population, the need for air transportation also increased.The airport Halu Oleo is one example of a company that offers its services in the field of aviation. Therefore, the forecast of the number of passengers have become important factors for the company Lion Air, because by knowing the predicted number of passengers in the future of Lion Air can prepare facilities in anticipation of rising passenger numbers.Least Square method (least squares method) or a simple regression analysis is an effective and simple approach to measure the average change in the dependent variable that is related to the increase in the number of units of one or more independent variables. The least squares method is used to determine the linear relationship of the best ways that minimize the number of errors squared data generated by mathematical functions. This method is most often used to predict Y, because the calculation more accurately.Keywords— Lion Air, Least Square method, Forecasting.
PENERAPAN ALGORITMA BRANCH AND BOUND DALAM MENENTUKAN JALUR TERPENDEK UNTUK MELAKUKAN PENCARIAN PENGINAPAN DAN HOTEL DI KOTA KENDARI Restu Hadi Saputra; Jumadil Nangi; LM. Bahtiar Aksara
semanTIK Vol 3, No 1 (2017): semanTIK
Publisher : Informatics Engineering Department of Halu Oleo University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (270.067 KB) | DOI: 10.55679/semantik.v3i1.2651

Abstract

Hotel merupakan sarana yang amat dibutuhkan saat ini. Akan tetapi, tidak semua masyarakat khususnya pendatang mengetahui lokasi hotel yang ada di Kota Kendari. Untuk itu dibutuhkan pencarian hotel beserta rute terpendek untuk mencapai sebuah hotel. Untuk membantu penandaan lokasi maka landmark menjadi suatu penanda suatu lokasi.Untuk melakukan pencarian rute terpendek dibutuhkan algoritma. Algoritma Branch and Bound digunakan untuk memecahkan masalah pencarian rute terpendek. Algoritma Branch and Bound mencari rute terpendek dengan menghitung masing-masing cabang dan membandingkannya hingga ditemukan rute mencapai hotel tujuan dengan jarak yang terkecil.Landamark dipilih berdasarkan tempat yang banyak diketahui karena cirinya.  Data hotel dipilih dari situs pencarian hotel yang tersedia dan observasi langsung kelapangan. Hasil pengujian, algoritma Branch and Bound menemukan nilai terkecil. Banyaknya titik akan mempengaruhi lama proses pencarian.Kata kunci— Algoritma Branch and Bound, Hotel, Kota Kendari, Pencarian Rute Terpendek. 
PERBANDINGAN ALGORITMA HORSPOOL DAN ALGORITMA RAITA PADA APLIKASI ISTILAH PSIKOLOGI BERBASIS ANDROID Mamta Culkari Puding; Jumadil Nangi; Adha Mashur Sajiah
semanTIK Vol 5, No 1 (2019): semanTIK
Publisher : Informatics Engineering Department of Halu Oleo University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (37.065 KB) | DOI: 10.55679/semantik.v5i1.5996

Abstract

The lack of professional health personnel in Indonesia has resulted in many people with mental disorders who have not been treated medically. To make it easier for the mental health workers, especially psychology students to study the term in psychology. It is necessary to have a digital dictionary because a tick printed book dictionary makes it difficult to carry around and the search term desired requires a long time. Based on this, a dictionary application for the psychology term based on Android was made.To make this application implemented the string matching method on the codeword search. String matching has several algorithms, some of which are Horspool algorithm and Raita algorithm.In this research study an analysis of the comparison between the Horspool algorithm and Raita algorithm, to determine the most useful algorithms in the dictionary of psychological terms. The parameter used to compare the two algorithms search time (ms) and complexity algorithms (Big-O).The results of this study show that Raita Algorithm has a faster search than Horspool Algorithm and the complexity of Raita algorithm has faster than  Horspool algorithm. The average total velocity of time for Raita algorithm is 13,60 ms and Horspool algorithm are 14,79 ms.  The complexity of Raita algorithm is T(n) = Ɵ(MN) and the complexity of Horspool algorithm is T(n) = Ɵ(M(N-2)).Keywords—Dictionary, Psychology, String Matching, Horspool Algorithm, Raita AlgorithmDOI : 10.5281/zenodo.3242287
Co-Authors Adha Mashur Sajiah LM Tajidun LM. Bahtiar Aksara Mamta Culkari Puding Restu Hadi Saputra Waode Berlian Ruamiana