cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota malang,
Jawa timur
INDONESIA
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer
Published by Universitas Brawijaya
ISSN : -     EISSN : -     DOI : -
Jurnal Pengembangan Teknlogi Informasi dan Ilmu Komputer (J-PTIIK) Universitas Brawijaya merupakan jurnal keilmuan dibidang komputer yang memuat tulisan ilmiah hasil dari penelitian mahasiswa-mahasiswa Fakultas Ilmu Komputer Universitas Brawijaya. Jurnal ini diharapkan dapat mengembangkan penelitian dan memberikan kontribusi yang berarti untuk meningkatkan sumber daya penelitian dalam Teknologi Informasi dan Ilmu Komputer.
Arjuna Subject : -
Articles 6,923 Documents
Analisis Sentimen Evaluasi Kinerja Dosen menggunakan Term Frequency-Inverse Document Frequency dan Naive Bayes Classifier Sri Wulan Utami Vitandy; Ahmad Afif Supianto; Fitra Abdurrachman Bachtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 6 (2019): Juni 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (560.926 KB)

Abstract

Effective and efficient in teaching can help students achieve maximum results. An evaluation is needed to improve the quality of learning and academic standardization, also it can improve the quality of the student. Therefore, the Information Systems Department always evaluates performance using questionnaires and filled by students at the end of each semester. The results of the suggestion column can be sentiment analysis to find out whether the suggestion is positive, negative or neutral. The classifier is a method that can classify data into several classes. Naive Bayes Classifier can be used to classify opinions into positive, negative and neutral classes. The comment data was collected 3502 comments which were divided into 3 semesters. Then, this comment data processed in preprocessing, weighting TF-IDF and classification using Naive Bayes Classifier. The test result on 4 parameters resulted in an accuracy of 80,1%, Precision 80,3%, Recall 80,3% and F1-Score 80%. The results of Usability testing obtained an average value of SUS Score of 75. So it can be concluded that the Dashboard is included in the Acceptance category and in the rating of "Good"
Analisis Kinerja Protokol LoRaWAN untuk Transmisi Data pada Skenario Urban Area Fathan Muhammad; Adhitya Bhawiyuga; Dany Primanita Kartikasari
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 9 (2019): September 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (261.205 KB)

Abstract

Long Range Wide Area Network (LoRaWAN) is a type of network for wireless telecommunication area designed to enable remote communication with long distance communication and low bit rate. LoRaWAN can be used on communication networks that have a wide range using end devices. LoRaWAN offers a wide range of advantages to the challenge of IoT implementation, but the current implementation of LoRaWAN technology is still very limited, requiring feasibility testing and analysis to what extent LoRaWAN technology is capable of being implemented in urban areas in Indonesia. In this research, an analysis of the performance of the LoRaWAN protocol for data transmission with urban area scenarios in Malang City is carried out. The method used in this study is to simulates LoRaWAN protocol in Network Simulator 3 (NS-3) application by changing the parameters to determine the effect on the the number of end devices, radius of the gateway range, and data sending period to the parameters throughput and packet loss. From the results of research proved that for the use of protocol LoRaWAN in urban areas, the more end devices used, the greater the throughput value and the greater the value of packet loss obtained. In addition, the wider the area needed, the throughput and packet loss obtained are constant. And then, the larger the period of data transmission, the smaller the throughput value is obtained and the smaller the value of packet loss obtained.
Implementasi Routing pada OpenFlow Software-Defined Network dengan Algoritme Depth-First Search dan Breadth-First Search Aprilia Kartika Sriastunti; Rakhmadhany Primananda; Widhy Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 8 (2019): Agustus 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (684.952 KB)

Abstract

Routing is the process of determining the path to convey data from source to destination. In conventional network routing configuration is still not flexible and efficient, because they have to configure network devices manually. Software-Defined Network as a new paradigm in network architecture, has the flexibility and efficiency for centralized network configuration. In SDN, the data plane and control plane are connected by the OpenFlow protocol. Routing on the network can be interrupted because of link disruptions such as link failures that result in the system having to find another pathway to keep communicating. In this research, network routing uses DFS and BFS algorithms, because both has simple concept and better complexity than other routing algorithms such as Dijkstra. The testing parameters are path finding, response time, packet loss, and packet traffic. When at link failure, system can still find another path to continue sending data from the source node to the destination node. The results of response time without link failure, both algorithms have been able to search for the best path based on determining the maximum value of the path on the controller. The average value of packet loss when 1 link down on DFS has the same result as BFS when 2 links down, which is 3.62%. In traffic testing, both algorithms have the same average value of the results of packet transmission to another switch, which is 52.67%.
Evaluasi Tata Kelola Teknologi Informasi Dinas Komunikasi, Informatika, Dan Statistik Kota Blitar Menggunakan Framework COBIT 4.1 Domain Plan and Organise (PO) dan Acquire and Implement (AI) Fryda Rizkyta Ardiana; Suprapto Suprapto; Yusi Tyroni Mursityo
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 7 (2019): Juli 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1091.241 KB)

Abstract

DISKOMINFOTIK is one of the government's agency that utilizes technological developments to improve services to public such as information systems, websites, and applications to support DISKOMINFOTIK operations. In its implementation, management deficiencies are still found there is no Standard Operation Procedure (SOP), investment management has not been well managed, doesn't have IT quality management, lack of resources to manage IT investments, its information systems are not updated regularly so that the growth of user needs is not fulfilled, there is no risk identification and risk management, there is no quality measurement regarding the implementation of current IT To get the results that are in conformable, it is necessary to evaluate IT governance to find out whether IT services are in accordance with the vision, mission and objectives and whether planning and implementation are well controlled. Evaluation is carried out so that the implementation of IT governance and runs optimally and in accordance with the expectations of managers of IT at DISKOMINFOTIK by using the COBIT framework 4.1 which focuses on the domain Plan and Organization (PO) and Acquire and Implement (AI). From the results of this study, it can be seen that the average maturity level for PO domains is 1.67 and the AI ​​domain is 1.00. It is necessary to increase the maturity level value to increase the current maturity level value as expected. Then given a number of recommendations that can be applied to DISKOMINFOTIK Blitar City. Some recommendations were generated, such as making SOP documents (Standard Operating Procedures) in all services in each field, training all IT staff to support existing IT processes, and defining and documenting risk management when implementing IT at DISKOMINFOTIK Blitar City.
Evaluasi dan Perbaikan Antarmuka Aplikasi Lembar Kerja Anggaran Investasi PT. PLN (Persero) Area Malang Menggunakan Metode Cognitive Walkthrough dan Heuristic Evaluation Danu Firmansyah Hidayatullah; Retno Indah Rokhmawati; Andi Reza Perdanakusuma
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 7 (2019): Juli 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1205.563 KB)

Abstract

Malang Area LKAI (Investment Budget Worksheet) application is a web based application that can be used by employees in PT. PLN (Persero) Malang Area planning sector to recapitulate data from field surveys related network reinforcement and suppression of distribution programs. Based on the results of interviews conducted LKAI application, problems were found that there were no instructions on how to fill data on the location description modal box, there was no detailed info on the user being logged in, and the size of the job blank is small. The evaluation was conducted to find usability problems using the Cognitive Walkthrough and Heuristic Evaluation methods. In this evaluation involving 3 evaluator subject matter and 3 evaluator usability expert. The evaluation using Cognitive Walkthrough method found 205 usability problems which were then normalized to 22 problems, while 64% of all problems were also found in Heuristic Evaluations. While Heuristic Evaluation method found 20 usability problems, while usability heuristic with the highest number of problems was H-5 (Error prevention) with 5 findings or 25% of the all problems finding. The evaluation results, 30 prototype interface improvements based on the 10 guideline of usability heuristic principles. Then validation on the prototype using the system usability scale obtained a score of 80.83 with the acceptability level depending on the acceptable category, grade scale was in grade B, adjective ranking depends on the excellent category and percentile rank in grade A.
Alat Pengklasifikasi Status Burung Puyuh Berdasarkan Berat Badan Menggunakan Metode K-NN Pada Embeded Sistem Boris Wiyan Pradana; Hurriyatul Fitriyah; Rizal Maulana
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 8 (2019): Agustus 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (857.733 KB)

Abstract

Every year,Quail can producing eggs from 240 until 300 grain each head. With their small body, the result of their egg's production are high enough. For breeder raising quail is a good opportunity to make a profit with the many demands nowadays. The method that used by breeder to improve the quality of quails is to separate the cage according to the age of the quails. Separating cages is also useful for distinguishing feed, and quail's nutrition that needed. In this study, we will use body weight as a parameter to classify the status of quail growth, which in general farmers use age as a parameter to separate cages. Loadcell weight sensors will be used as a medium to measure bird weight. Then Arduino will be used as a microcontroller and LCD to display the results. In classifying quail based in body weight, it requires a method to calculate them. Method that used in this study is the K-nearest neighbor(KNN) method. This system will test several asppects of the system including sensor accuracy, comparison between age and weight classification, and system computation time. For the accuracy of the sensor we got the result of accuracy 96.67%. Then in testing using KNN based on body weight compared to age, get the result of an error of 2.23%. And for testing computation time, obtained an average time of 612ms.
Analisis dan Perancangan Sistem Informasi Pengajuan Cuti Pegawai Menggunakan Pendekatan Object Oriented Analysis and Design (OOAD) (Studi Pada PT. Pos Indonesia Surabaya Kebonrojo) Fiera Arnandya Rani; Satrio Agung Wicaksono; Admaja Dwi Herlambang
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 6 (2019): Juni 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1125.859 KB)

Abstract

PT. POS Indonesia Surabaya Kebonrojo harnesses a plethora of management information systems. According to focus group interviews, there is an untapped need for managing employee leave applications through computerised information systems. Therefore, the focus of this paper aims to solve problems by focusing on analyzing and designing system designs. To answer this question, the Object Oriented Analysis and Design (OOAD) method was undertaken to analyse and design systems which consists of 5 stages: use case modelling, architecture analyzing, use cases analyzing, data elements identifying, and data modeling. This process involved synthesising archived interviews and documented studies to obtain an overview of business processes, analyse user needs, design use cases, state machine diagrams, activity diagrams, sequence diagrams, class diagrams, physical data models, and to interface designs. The testing segment was carried out using the Configuration Structure and Traceability Matrix methods. Results using Configuration Structure method revealed that there was high consistency in defining user requirements (100,00%). The testing segment of study using Traceability Matrix method ceased processes when functional requirements of use cases were consistent with the value of 100,00%.
Analisis Pengaruh Pemasaran melalui Media Sosial terhadap Loyalitas Merek pada Instagram Tomoo Steak Rony Adita Muslim; Niken Hendrakusma Wardani; Satrio Hadi Wijoyo
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 8 (2019): Agustus 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (401.691 KB)

Abstract

Nowdays there are many culinary companies with very tight competition. The focus and target of marketing now has changed, which how companier got new customers, and has changed to how company kept customers to be loyal. One strategy that can be used by company using social media. Tomoo Steak is a culinary company that actively engages in customers relationship in anagement throught social media marketing o gain customers loyalty. Customer loyalty is positively influenced when companies doing advantageous campaigns, relevant content, popular contents, various platforms and applications, frequently updated content on social media (Erdogmus & Cicek, 2012). This study tested the relationship between social media marketing and customer loyalty using multiple linear regression analysis. Respondents from this study are followers Tomoo Steak account in Instagram. The data were collected using simple random sampling technique. Result of f test, show independent variables simultaneously or equally influence brand loyalty. The independent variable used in this study contributed 52,2% to the Tomoo Steak brand loyalty. The relevant content variable has the greatest influence brand loyalty. This is because the Tomoo Steak Instagram account presents content that can attract customers to interact with content companies, various platform.
Klasifikasi Penyakit Kanker Serviks dengan Extreme Learning Machine Uke Rahma Hidayah; Imam Cholissodin; Putra Pandu Adikara
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 7 (2019): Juli 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1054.453 KB)

Abstract

Cervical cancer is the second most common cancer in Indonesia after breast cancer. The number of deaths from cervical cancer in Indonesia continues to increase every year due to delays in making diagnoses and examinations. To detect cervical cancer, a laboratory examination using Visual Inspection with Acetic Acid (IVA) or pap smears is needed which requires specialist internal medicine and several considerations of features to get accurate diagnosis. Sometimes, how to analyze features by doctor with one another produces different results. Therefore, a classification process is needed to make a diagnosis of cervical cancer with high accuracy results so that it is expected to be able to match the diagnosis results of medical personnel. This study uses cervical cancer risk classification data with feature selection based on expert interviews. This study uses the Extreme Learning Machine algorithm to carry out the classification process and measure the results of algorithm performance with accuracy values ​​from the calculation of confusion matrix. Based on the test results obtained the optimal parameters are as many as 11 hidden neurons, the activation function is binary sigmoid, and the fold on training and testing data is fold 1st which produces an accuracy of 91.76%.
Penerapan Procedural Content Generation pada Pembangkit Level Gim Maze Heksagonal Chyntia Savrila Putri; Eriq Muhammad Adams Jonemaro; Muhammad Aminul Akbar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 9 (2019): September 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (580.319 KB)

Abstract

A rapidly increasing demand of game content is the main reason which induced the urgency for a straightforward method for generating new level content that goes hand in hand with the automated technology field. A labyrin based level requires a certain uniqueness without the risk of encumbering the development process in time or budget. With that in mind, the author raises this thesis that proposes the use Binary Tree Algorithm to implement Procedural Content Generation to generate levels in a maze game genre. This algorithm will carve a maze path from two pre-determined directions, this implementation can result in a fast and simple generation. The result of this paper shows an average of 0.435 second to generate three levels with different sizes. The resulting levels are all valid and playable according to the labyrin parameters such as a valid starting and ending point, a path between these two points, and a labyrin that follows the set grid. This algorithm also has a bias for diagonal paths, and a long corridor is usually formed on two sides of the generated maze. The conclusion is that Binary Tree Algorithm is perfectly suitable as a maze level generator in a hexagonal grid with fast generating time and a reliable generated level.

Filter by Year

2017 2026


Filter By Issues
All Issue Vol 10 No 13 (2026): Publikasi Khusus Tahun 2026 Vol 10 No 01 (2026): Januari 2026 Vol 10 No 4 (2026): April 2026 Vol 10 No 3 (2026): Maret 2026 Vol 10 No 2 (2026): Februari 2026 Vol 9 No 13 (2025): Publikasi Khusus Tahun 2025 Vol 9 No 12 (2025): Desember 2025 Vol 9 No 11 (2025): November 2025 Vol 9 No 10 (2025): Oktober 2025 Vol 9 No 9 (2025): September 2025 Vol 9 No 8 (2025): Agustus 2025 Vol 9 No 7 (2025): Juli 2025 Vol 9 No 6 (2025): Juni 2025 Vol 9 No 5 (2025): Mei 2025 Vol 9 No 4 (2025): April 2025 Vol 9 No 3 (2025): Maret 2025 Vol 9 No 2 (2025): Februari 2025 Vol 9 No 1 (2025): Januari 2025 Vol 8 No 13 (2024): Publikasi Khusus Tahun 2024 Vol 8 No 10 (2024): Oktober 2024 Vol 8 No 9 (2024): September 2024 Vol 8 No 8 (2024): Agustus 2024 Vol 8 No 7 (2024): Juli 2024 Vol 8 No 6 (2024): Juni 2024 Vol 8 No 5 (2024): Mei 2024 Vol 8 No 4 (2024): April 2024 Vol 8 No 3 (2024): Maret 2024 Vol 8 No 2 (2024): Februari 2024 Vol 8 No 1 (2024): Januari 2024 Vol 7 No 13 (2023): Publikasi Khusus Tahun 2023 Vol 7 No 9 (2023): September 2023 Vol 7 No 8 (2023): Agustus 2023 Vol 7 No 7 (2023): Juli 2023 Vol 7 No 6 (2023): Juni 2023 Vol 7 No 5 (2023): Mei 2023 Vol 7 No 4 (2023): April 2023 Vol 7 No 3 (2023): Maret 2023 Vol 7 No 2 (2023): Februari 2023 Vol 7 No 1 (2023): Januari 2023 Vol 7 No 14 (2023): Antrian Publikasi Vol 6 No 13 (2022): Publikasi Khusus Tahun 2022 Vol 6 No 12 (2022): Desember 2022 Vol 6 No 11 (2022): November 2022 Vol 6 No 10 (2022): Oktober 2022 Vol 6 No 9 (2022): September 2022 Vol 6 No 8 (2022): Agustus 2022 Vol 6 No 7 (2022): Juli 2022 Vol 6 No 6 (2022): Juni 2022 Vol 6 No 5 (2022): Mei 2022 Vol 6 No 4 (2022): April 2022 Vol 6 No 3 (2022): Mei 2022 Vol 6 No 2 (2022): Februari 2022 Vol 6 No 1 (2022): Januari 2022 Vol 5 No 13 (2021): Publikasi Khusus Tahun 2021 Vol 5 No 12 (2021): Desember 2021 Vol 5 No 11 (2021): November 2021 Vol 5 No 10 (2021): Oktober 2021 Vol 5 No 9 (2021): September 2021 Vol 5 No 8 (2021): Agustus 2021 Vol 5 No 7 (2021): Juli 2021 Vol 5 No 6 (2021): Juni 2021 Vol 5 No 5 (2021): Mei 2021 Vol 5 No 4 (2021): April 2021 Vol 5 No 3 (2021): Maret 2021 Vol 5 No 2 (2021): Februari 2021 Vol 5 No 1 (2021): Januari 2021 Vol 5 No 13 (2021) Vol 4 No 13 (2020): Publikasi Khusus Tahun 2020 Vol 4 No 12 (2020): Desember 2020 Vol 4 No 11 (2020): November 2020 Vol 4 No 10 (2020): Oktober 2020 Vol 4 No 9 (2020): September 2020 Vol 4 No 8 (2020): Agustus 2020 Vol 4 No 7 (2020): Juli 2020 Vol 4 No 6 (2020): Juni 2020 Vol 4 No 5 (2020): Mei 2020 Vol 4 No 4 (2020): April 2020 Vol 4 No 3 (2020): Maret 2020 Vol 4 No 2 (2020): Februari 2020 Vol 4 No 1 (2020): Januari 2020 Vol 3 No 12 (2019): Desember 2019 Vol 3 No 11 (2019): November 2019 Vol 3 No 10 (2019): Oktober 2019 Vol 3 No 9 (2019): September 2019 Vol 3 No 8 (2019): Agustus 2019 Vol 3 No 7 (2019): Juli 2019 Vol 3 No 6 (2019): Juni 2019 Vol 3 No 5 (2019): Mei 2019 Vol 3 No 4 (2019): April 2019 Vol 3 No 3 (2019): Maret 2019 Vol 3 No 2 (2019): Februari 2019 Vol 3 No 1 (2019): Januari 2019 Vol 2 No 12 (2018): Desember 2018 Vol 2 No 11 (2018): November 2018 Vol 2 No 10 (2018): Oktober 2018 Vol 2 No 9 (2018): September 2018 Vol 2 No 8 (2018): Agustus 2018 Vol 2 No 7 (2018): Juli 2018 Vol 2 No 6 (2018): Juni 2018 Vol 2 No 5 (2018): Mei 2018 Vol 2 No 4 (2018): April 2018 Vol 2 No 3 (2018): Maret 2018 Vol 2 No 2 (2018): Februari 2018 Vol 2 No 1 (2018): Januari 2018 Vol 2 No 8 (2018) Vol 2 No 6 (2018) Vol 1 No 12 (2017): Desember 2017 Vol 1 No 11 (2017): November 2017 Vol 1 No 10 (2017): Oktober 2017 Vol 1 No 9 (2017): September 2017 Vol 1 No 8 (2017): Agustus 2017 Vol 1 No 7 (2017): Juli 2017 Vol 1 No 6 (2017): Juni 2017 Vol 1 No 5 (2017): Mei 2017 Vol 1 No 4 (2017): April 2017 Vol 1 No 3 (2017): Maret 2017 Vol 1 No 2 (2017): Februari 2017 Vol 1 No 1 (2017): Januari 2017 More Issue