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,850 Documents
Klasifikasi Risiko Hipertensi Menggunakan Fuzzy Decision Tree Iterative Dichotomiser 3 (ID3) Mochamad Rafli Andriansyah; Edy Santoso; Sutrisno Sutrisno
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Hypertension is a disease where the heart and the arteries have abnormalities which is indicated by the increase of blood pressure. Hypertension can be controlled if it's handled from the early stage, however, several number of patients only earn the knowledge right after there's a complication of failures of the organs. Considering that hypertension is one of the very lethal diseases, the researchers have done researches about the classification of hypertension, one of them used Fuzzy Decision Tree with ID3 algorithm. To solve the problem about hypertension based on the available factors, the study use Fuzzy Decision Tree ID3 method to classify the risks of hypertension that have initialization stages of Fuzzy values, the calculation of Fuzzy enthropy values, and the values of information gain, as well as defuzzification to determine the result of the classification. The testing that has been carried out could result in the highest accuration value, which is 80%, derived from the testing of 30 training data dan 20 testing data, as well as the combination of the FCT and LDT value. The conclusion of the research that has been accomplished is that Fuzzy Decision Tree ID3 can solve the problems in the classification of hypertension risks quite well.
Analisis dan Perancangan Sistem Informasi Pemesanan Barang (Studi Kasus: PT. Trivia Nusantara) Afifahlya Alif Rizyomi; Mochamad Chandra Saputra; Welly Purnomo
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Trivia Nusantara is a business in advertising and retail of office stationery. After doing an observation, there is a problem in ordering products process. Which lack of information system support causes the process of ordering products to be longer and takes a lot of cost in communication. Growth of technology impact on the increasingly business competition, this trigger PT. Trivia Nusantara to build an information system in order to support the company's operations. Due to PT. Trivia Nusantara also does not have an IT expert so the company's leader plans to build an information system by working with vendors. Based on the concept of SDLC (Software Development Life Cycle) the initial thing required is a documented requirements analysis and system design. Analysis and design performed using Ripple methodology in the initial 4 phases. Genesis phase and requirement phase used to requirements analysis. While the system design in the analysis phase and design phase. The importance of evaluating the requirements in this study using 2 evaluation, consistency analysis and correctness. In consistency analysis method proved have a 100% percentage value consistent. And the correctness test proving that system requirements with system design is include in correctness category.
Perbandingan Kinerja Hbase dan MongoDB Sebagai Backend IoT Data Storage Niki Yuniar Wicaksono; Eko Sakti Pramukantoro; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

IoT (Internet Of Things) is currently evolving as evidenced with many studies that discuss the IoT. IoT consists of two main components of the Internet and interconnected Things, to collect data and information into data storage media that can be processed as needed. However, there are challenges in building IoT data storage media, like a large data volumes, diverse forms and data formats. In previous research has developed a Framework of IoT data storage media from the sensor node. The Framework uses NoSQL MongoDB as its data storage. In this study, proposed an IoT NoSQL Hbase data storage using the MongoDB Framework because it free scema and good writing speed in the performance testing of random writing tests. This study, tested Hbase and MongoDB by testing ability to storage data in data storage. The result of this test is Hbase and MongoDB is able to receive and insert text data and image data. While for testing the Framework of data storage media with Hbase using storage testing For testing the performance of MongoDB, better result test on runtime parameters of 33s, throughput of 1559 ops/s, 48% Usage CPU, 67% Memory Usage, and 4354kb Disk I/O. When testing images the results of differences in slightly different better of MongoDB on Runtime parameters 64s, throughput 90 ops/s, CPU Usage 46%, Memory Usage 84%, while when testing Hbase images superior in Disk I/O parameters of 109.462kb.
Evaluasi Kualitas Sistem Informasi Dosen (SIADO) Oleh Dosen Universitas Brawijaya Dengan Menggunakan Technology Acceptance Model (TAM) Termodifikasi Anita Dwi Puspitasari; Yusi Tyroni Mursityo; Mochamad Chandra Saputra
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The use of Lecturer Information System (SIADO) has been so maximized because some users of lecturers have different perspectives on SIADO, such as SIADO's system quality which still get some complaints from users in 2016 and there has been no decision letter from the Rector of mandating the use of SIADO. This study aims to describe how the factors studied on SIADO user acceptance on five variables, namely user characteristics, system quality, top management & IT support, perceived usefulness, and perceived ease of use using descriptive statistical analysis. Data collection techniques using questionnaires that are distributed offline using paper and designed as attractive as possible, the population in the study is a lecturer in UB with 96 samples used. Data from respondents who have been collected through questionnaires processed by seeing whether the data is valid and reliable. After that descriptive statistical analysis is done to know the level of categories owned on each variable that can provide data information based on centralization and dissemination of data, so that obtained average to be categorized. The results show that the five variables get high category on SIADO acceptance, which indicates the user perceives all the good variables to be used as a consideration tool in receiving the system.
Perancangan Klaster Server Web Dengan Availabilitas Tinggi Menggunakan Teknologi Failover, Load Balancing dan Distributed File System Tiara Erlinda; Mahendra Data; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The developments of World Wide Web (WWW) technology has an impact on the increasing website every day. The use of the web for everyday life is very influential for various aspects of life such as to communicate, entertainment, and education. It takes a system that has a high availability level to operate continuously and ensures no failure so that the system can provide continuous service without interruption to the user. The researcher's solution is to design a high availability web server cluster with failover technology using Keepalived. There is also load balancing technology using Varnish which supports distributing workloads to web servers and distributed file systems using GlusterFS to share files between servers. The study was conducted using LAMP server ie Linux Apache, MySql and PHP. Apache server is assigned as web server. Testing is done in terms of downtime, throughput, CPU usage, memory usage and functional. The results of the research found that the value of downtime with an average of 1 second when the main server is dead. The highest throughput value for the connection is obtained when the number of connections is 40 and the lowest when the number of connections is 100. The usage and memory usage values ​​increase up to 68.3% for CPU and 65.5% for memory depending on the number of connections. The result from functional test proved that the system is running according to its function. Based on these results, this system can be a solution for systems that require high availability.
Implementasi Low Power Mode Berbasis Finite State Machine Pada Sistem Pelacak Lokasi Parkir Mobil Menggunakan GPS Module Dan GSM Module Agung Wismawan Rochmatullah; Dahnial Syauqy; Mochammad Hannats Hanafi Ichsan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Confusion and forget the location of the parking lot is something that usually happen. Especially for car users who park in a large area or in newly visited areas, it is troublesome for the user to find the car. Based on this problem, its needed a system that can help users to find the location of cars that have been parked via an android smartphone. In order to save the power, this system using finite state machine method that aims to apply the principle of low power work by using several states, that is sleep and wake. This system uses GPS Neo 6m which serves to get the coordinate point value of the car being parked, SIM800L serves for sending data to the user's smartphone applications, ATmega328p serves as processing input and output of the system, and the android smartphone applications to display the location to google maps. Based on the tests that have been done, the result obtained the average rating of current savings on the SIM800L components are 0.46A. It is hoped that this research can help cars users who is confused or forgotten about the location of their car park.
Evaluasi Perbandingan Scoring Proposed Value dan Perceived Value Berdasarkan Model UX Honeycomb (Studi Kasus: Traveloka, Tiket.com, Dan Pegi-Pegi) Dina Ayu Musfikasari; Hanifah Muslimah Az-Zahra; Mahardeka Tri Ananta
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In the product which are offered usually have value to proposition that users feel while access or use it. Value proposition design is aimed to fill demand, experience, and desire of user in using it. In that condition, it can be used in development of online application based on Android platform and web-based to order ticket. Some of them for example Traveloka, Tiket.com, and Pegi-pegi. In this research, the writer use UX Honeycomb method to compare the value that system gives with user feel based on UX Honeycomb aspect. The goals of this research are to know result of proposed value analyze and perceived value analyze, and to know the comparison of proposed value and perceived value in Traveloka, Tiket.com, and Pegi-pegi. The methodology of this research is started from reference's study, value analyst, value scoring, taking and processing data to gain perceived value score, comparison of proposed value and perceived value, and making conclusion. Based on the result of analysis and discussion of each application that has done include all of UX Honeycomb aspect, in Traveloka application, the aspect which need to be improved is useful, in Tiket.com, aspect which need to be improved are usable and credible. Whereas in Pegi-pegi application, aspect which need to be improved are usable and desirable.
Pengembangan Sistem Rekomendasi Rute Paling Optimum Dengan Algoritme Voronoi Continuous K Nearest Neighbor (VCKNN), Progressive Incremental Network Expansion (PINE), Voronoi-Based Network Nearest Neighbor (VN3), Berbasis Webgis Fajar Krisna Wicaksono; Fatwa Ramdhani; Mochamad Chandra Saputra
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In daily life, people in Malang often travel from one place to another by considering the efficiency of travel time. Lowokwaru is one of the densely populated sub-districts in Malang City. Therefore, traffic jam often occurs frequently at certain time. Path searching is one of the solutions in handling traffic jam at certain time in Malang. This research uses the Voronoi-Based Continuous K Nearest Neighbor (VCKNN), Progressive Incremental Network Expansion (PINE), Voronoi-Based Network Nearest Neighbor (VN3) algorithms. Every algorithm has different calculation steps and data models, it affects the computing time of every algorithm that affects the response time of the system. In the VCKNN, PINE and VN3 algorithms, the route searching process is divided into two stages, the first stage is searching for the voronoi neighbor to filter the data based on the voronoi polygon, after that, it searches the route on the voronoi polygon. This research was conducted to find out the response time, the number of passed node and the relationship between response time and the number of passed node, so the most efficient algorithm in the problem of route searching was known. From this research it was known that the algorithm with the fastest response time was VCKNN algorithm with 0.071 seconds response time and the algorithm with the lowest number of passed node was PINE algorithm with the number of nodes passed by 17 nodes. From the results of the research, the most efficient algorithm in determining the optimum route was the VCKNN algorithm.
Implementasi Algoritme SPECK dan SHA-3 Pada Database Rekam Medik Hilman Adi Kartika; Ari Kusyanti; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Medical record data has to be protected because the data contains personal data about medical history owned by patients and doctors. However in recent years, many cases of attacks or hacking are found. This study aims to secure data records on the database. To secure the data by applying the SPECK algorithm is implemented to ensure data confidentiality and SHA-3 algorithm to ensure the integrity of the data. SPECK algorithm is applied to the name, address, description, and symptom fields of the patient table, while the SHA-3 algorithm is applied to the user table's password field. Tests conducted in this study are, validation test vector, encryption and decryption validation, performance time of encryption and decryption, system functionality, and non-functionality system. The results of the test shows that test vector, encryption and decryption test are valid. The execute time of encryption and decryption on average is 11,2 milisecond for encryption and 11,295 milisecond for decryption. Functionality of the system runs according to function, and non-functional systems can run well on various web-browsers such as Microsoft Edge, Mozilla Firefox, Google Chrome, and Opera.
Rancang Bangun Alat Pendeteksi Kecelakaan Mobil Menggunakan Sensor Akselerometer dan Sensor 801s Vibration Adnan Mahfuzhon; Tibyani Tibyani; Gembong Edhi Setyawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The improvement of infrastructure, especially road and freeway, will make the transportation service industry more promising. One of them is car rental service business, increases up to 70%. There are several reasons why car rental service becoming the first choice than buying or owing a car, specifically for business world. Besides saving the budget, renting a motorbike also erasing several difficulties, for instances, maintenance, extension for important letters, even decreasing losing the motorbike. Based on the data obtained from the increasing of car rental service business, it is needed to keep the comfort between the service provider with the customer. The important thing to be noticed, when the service provider must maintain the rental cars. Also, the customer must take care of the rented car. From the problem, it is need to conduct a research related to accidental notification for keeping the cars and customer's comfort. The process of collecting the test data manually to be made the input for calculating naive bayes. The data adjustment is set by referring to accelerometer data, if the data is more than 4 grams so it is categorized in accident condition. Collecting the data in the running condition obtained the value of accuracy up to 90%, then when collecting in the sudden stop condition obtained up to 78%, and in accident condition obtained up to 98%. The data test results from the classification results using naive bayes, they are obtained by collecting the test data in each one for 16-time tests in every scenarios. In running condition, it is obtained the value of accuracy up to 98,7%, in the sudden stop condition obtained the value of accuracy up to 87,5% and in the accident condition obtained the value of accuracy up to 98,7%.

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 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