cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
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 : -
Core Subject : Science, Education, Engineering,
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering
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 30 Documents
 1   2   3 
Search results for , issue "Vol 1 No 9 (2017): September 2017" : 30 Documents clear
Analisis Performa Mekanisme Error Recovery Menggunakan Automatic Repeat Request (ARQ) dan Forward Error Correction (FEC) pada Multi Receiver File Transfer Kusnul Aeni; Mahendra Data; Adhitya Bhawiyuga
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 9 (2017): September 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

File transmission from one to multi receiver has higher probability in packet loss compare with one to one transmission. Error recovery mechanism is needed to overcome packet loss. Error recovery mechanism that common use is ARQ (Automatic Repeat Request) and FEC (Forward Error Correction). This research aim is to compare the error recovery performance of ARQ and FEC mechanism. Example of ARQ application based reliable multicast transfer is UFTP, and the example of FEC application mechanism based on reliable multicast transfer is UDPCast. In this research, testing process was done with text files transmission using WANem (Wide Area Network Emulator) as a network emulator. There are 5 file redundant categories (in percent) added in FEC mechanism that will affect the file transmission. In this research, there are 30 scenarios for testing based on packet loss category and file size to be sent. All file used for testing has the size in the range of 20 MB to 100 MB. The test result indicate that in a good network condition, in general the use of error recovery mechanism, ARQ has better performance than FEC mechanism. Meanwhile, in a poor condition (with 25% packet loss), the used of FEC mechanism is better choice.
Penerapan Fuzzy K-Nearest Neighbor (FK-NN) Dalam Menentukan Status Gizi Balita Satria Dwi Nugraha; Rekyan Regasari Mardi Putri; Randy Cahya Wihandika
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 9 (2017): September 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Infants or so-called children is a group that have an important period in physical growth. Infants itself is categorized as a group of children between age 1 to 3 as a teddler group, and age 3 to 5 as a pre-school group. Some says children has a big role in order to attaining of growth success in the future for human, hence they call it as the golden age of living. Children's growth not only discribing as an increasing of body dimensions but also as the continuity of intake and nutrient needs. An indicator to know the children's health is by determining their nutritional status. Based on SK Minister of Health in Indonesia, they use a method called anthropometry to determining children's nutritonal status. While this method only reviewing 4 internal factors, there're some other factors which influence of children's nutritional status itself such as genetic, disease, education, knowledge, and income. Therefore Fuzzy K-Nearest Neighbor is used in this study as a classifiaction method that can determining children's nutritional status because this method using the data training as the knowledge to clasify and would adjust other factors of nutritional status itself right in the future. From the test results of the study, this system can clasify well with maximum accuracy of 84,37% when using 160 training data with k value = 4.
Optimasi Multiple Travelling Salesman Problem Pada Pendistribusian Air Minum Menggunakan Algoritme Particle Swarm Optimization (Studi Kasus: UD. Tosa Malang) Rinindya Nurtiara Puteri; Agus Wahyu Widodo; Imam Cholissodin
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 9 (2017): September 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

If the distribution application was not run optimally ,it can obstruct the distribution of drinking water process.The tardiness of drinking water transmission become an obstacle in the process and it is also effected by many factors, such as sales ignorance about the shortest path to where the customers are.So this system can lead and make the process easier to determine the shorthest path. In that Distribution obstacle we called it Multiple Travelling Salesman Problem because implicate more than one factor .One of the main purpose from this research is to determine the shortest path for every saleses.This thesis uses Particle Swarm Optimization Algorithm. There were some thesis talked about Multiple Travelling Salesman Problem but to PSO method is scarce. Particle Swarm Optimization is one of the method that solved M-TSP which is that method will gives some effective solutions.Based on the background,researcher choose to use The optimization of Multiple Travelling Salesman Problem application,and in drinking water distribution use Particle Swarm Optimization Algorithm. The result that had been proved show the route sequence that used is better from optimum parameter made 30 iterations and with 90 particle.
Optimasi Komposisi Makanan untuk Penderita Hipertensi Menggunakan Variable Neighborhood Search Aprilia Nur Fauziyah; Wayan Firdaus Mahmudy
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 9 (2017): September 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Hypertension is a major symptom that cause other diseases appear such as noncommunicable diseases, cancer, and diabetes. One of healthy life effort in the patients with hypertension is a healthy food that attentions level of salt in foods. The food composition with attentions level of salt and cost of the food can use Variable Neighborhood Search (VNS) algorithm. The data which are used for this study are 103 data food that consists of staple foods, vegetables, vegetable sources, animal sources and fruits. VNS have 3 stages after generate initial solution, there are shaking, local search and move or not. The results of Kmax and local search's testing show that the average of highest fitness is 0.516848 with Kmax = 13 and the highest average fitness is 0.524301 with 2000 iterations. Kmax and local search iterations that too much not guarantee a solution with great fitness is obtained but many Kmax numbers or local search iterations can give wider search opportunities. The result of this study contains composition of foods with nutrients which are close to the needs of hypertension patients with attentions the natrium and minimal cost within a day.
Integrasi Protokol Sinkronisasi Waktu Reference Broadcast Synchronization (RBS) dan Pengiriman Data Flooding pada Wireless Sensor Node Zhafran Wadiansyah; Sabriansyah Rizqika Akbar; Edita Rosana Widasari
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 9 (2017): September 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Nowdays, technology is already evolve and help human in terms of obatining information. One of the technology that being concern is Wireless Sensor Network (WSN). WSN is a wireless sensor network consisting of multiple nodes connected in one network. WSN technology has several delivery protocols one of which is Flooding Routing. Flooding is sending data by flooding the network with data to be sent.The problems that occur from Flooding is the occurrence a lot of data redundancy that will meet the network.Another problem facing the collision of data at the time of delivery due to local time difference. Therefore there will be data collisions that render the data unacceptable. In this research the author will solve the problems that occur in data transmission in WSN and Flooding by integrating the synchronization reference time synchronization instruction protocol and data flooding transmission. This system will schedule the sending of data to be sent. To support the scheduling the local time of each node must be the same. Therefore, the reference broadcast synchronization protocol is chosen as time synchronization between nodes. Furthermore, scheduling the delivery using Time Division Multiple Access method.Time synchronization and data transmission scheduling will be applied for the delivery of flooding data. Based on the result, each node on the WSN network is able to synchronize its timing according to the RBS method. Furthermore, the scheduling with TDMA method is also capable of being applied. So, between nodes can send data in accordance with the schedule that has been given. The system also capable of implementing the flooding protocol well. Node beacons are also able to overcome the problem of data redundancy that occurs by providing a header on every packet sent. The average packet delivery delay using flood is 1869.2 micro seconds.
Pengukuran Kualitas Layanan Website Dinas Pendidikan Kota Malang Dengan Menggunakan Metode Webqual 4.0 dan IPA Amirah Al Baiti; Suprapto Suprapto; Aditya Rachmadi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 9 (2017): September 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Website is an important part of information technology. We can not deny that the role of thewebsite is essential in almost all aspect of life, especially for an organization or company, including thegovernment. Education Department of Malang is one of many goverment agency that implement awebsite. But since 2008 Education Department of Malang website evaluation has not been done so theydon't have any idea which is the website have a good quality or not and the website get a lot complainabout unattractive design and uneffective feature. This study analyzes and measures the service qualityof Education Department of Malang website from enduser point. User data obtained by distributingquestionnaires based on three dimensions at WebQual 4.0 the dimensions of usability, information andservice interaction. Then the results of the questionnaire were analyzed by Importance PerformanceAnalysis (IPA). The analysis showed that Malang Department of Education website does not complywith the expectations of users with the results of analysis of suitability of 94.43% or <100% and theaverage yield gap analysis of-0.1675 or <0. Priority improvement on this website are the attributes ofnumber 9, 13 and 16, which is an attribute in Quadrant A.
Analisis dan Implementasi Algoritma SHA-1 dan SHA-3 pada Sistem Autentikasi Garuda Training Cost Firlhi Kurniawan; Ari Kusyanti; Heru Nurwarsito
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 9 (2017): September 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Garuda Training Cost is a web application for calculating the training costs for pilots and flight attendants developed in Garuda Indonesia Training Center. This application use SHA-1 hash function algorithm to secure user password in database. However, the weakness and colisions have been found in this algorithm, therefore this algorithm less secure. Hence, in this research authors will replace the SHA-1 with the algorithm successor, SHA-3. This algorithm will be implemented in login process, password change process and adding users process. Both algorithm will be tested and analyzed to determine the performance of the algorithm. There are three types of tests performed. The first is brute-force testing, second is avalanche effect testing and the final test is processing time testing. From the brute-force test result, SHA-3 algorithm much better than SHA-1. From the 30 times testing for 10-character password, the SHA-1 generated hash need average 14 hours 53 minutes and 51 seconds to find the plaintext. While SHA-3 generated hash need average 4 days 13 hours 6 minutes and 6 seconds to find the plaintext. For the avalanche effect testing, SHA-1 algorithm get a percentage change of 100%, while SHA-3 get 95%. For the processing time testing, SHA-1 algorithm is better because of SHA-3 higher complexity. Although two of three test SHA-1 is better, does not mean SHA-3 is not better. Minimum avalanche effect percentage for an algorithm is 50%. And that processing time is still in milliseconds unit, so that user do not feel the impact directly. In conclusion, the three these tests show that the SHA-3 has a higher resistance than the algorithm SHA-1.
Implementasi Metode K-Medoids Clustering Untuk Pengelompokan Data Potensi Kebakaran Hutan/Lahan Berdasarkan Persebaran Titik Panas (Hotspot) Dyang Falila Pramesti; Muhammad Tanzil Furqon; Candra Dewi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 9 (2017): September 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Forest / land wildfire is one of the disasters that occur every year in some countries in the world. This incident got more attention from the government because it caused many losses both in the economic, ecological, and social. Indonesia is a country with a high rate of forest / land wildfire disasters. Indonesia suffered losses of up to Rp 209 trillion by 2015. As a result of losses incurred an early prevention is needed, which one can be done by grouping areas with potential forest fires by utilizing hotspot data. Forest wildfires are marked by the detection of fire spots by satellites indicated as hot spots. This research uses hotspot data with parameter of latitude, longitude, brightness, frp (fire radiative power), and confidence by using K-Medoids method. K-Medoids method is a clustering method that serves to split the dataset into groups. The advantages of this method is able to resolve the weakness of K-Means method that is sensitive to outlier. The result of this research shows that the use of K-Medoids method can be used for the process of hot spot data clustering with the best silhouette coefficient in amount of 0.56745 on the use of 2 clusters by using 7352 data. The results of the clustering analysis showed that using 2 clusters resulted in a group of data with the potential of high potential with an average brightness of 344.470K with average confidence of 87.18% and medium potential with average brightness of 318.800K with Average confidence of 58.73%.
Sistem Klasifikasi Status Gizi Bayi dengan Metode K-Nearest Neighbor Berbasis Sistem Embedded Nanda Epriliana Asmara Putri; Dahnial Syauqy; Mochammad Hannats Hanafi Ichsan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 9 (2017): September 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Infant nutritional status is very important to be known by the parents, because there are still many malnutrition cases of children under five in Indonesia that is unsolved. It considered because malnutrition not only by physical condition that affect. Based on these problems, a system of infant nutrition status have been made using K-Nearest Neighbor method based on embedded system using gender, age and body weight parameters of infant. The value of K that would be applied to the method needs to be tested to get the best value of K for the system. For readings body weight using a HX711 circuit module, a load cell sensor, connected to NodeMCU ESP8266 in order to send the data wirelessly to a computer / PC as a classifier parameter. The input are gender and age as requiredment for classification, if all three parameters are met the nutritional status can be displayed on web and saved in database as the archieve. From the analysis that has conducted, it can be concluded that the functional testing on the weight sensor has 97,23% accuracy, while the functional testing of basis data storage has 100% conformity. K value has the highest percentage of accuracy when K = 5 and k = 6 with 62.50%. While overall testing of the baby's nutritional status classification system yielded 97,14% accuracy.
Optimasi Multiple Travelling Salesman Problem Pada Pendistribusian Air Minum Menggunakan Algoritme Genetika (Studi Kasus: UD. Tosa Malang) Sayyidah Karimah; Agus Wahyu Widodo; Imam Cholissodin
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 9 (2017): September 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

A good distribution is one of the company's strategy to increase the productivity of the company. Distribution strategy is indispensable in bottled drinking water, because bottled water business has increased every year. Distributor of bottled water has a variety of types and brands of goods with different packaging forms. The number of shipping destinations poses many problems in the distribution process, because it takes more time to arrive at different address and distances. This research has a goal to create a system that can help the process of distribution of goods with number of sales more than one, the problem is called Multiple Traveling Salesman Problem (M-TSP). One method to solve M-TSP problem is to use genetic algorithm, so it can determine the route with the shortest distance that will be visited by every sales. The genetic algorithm process uses permutation representations with chromosome length according to many customer orders and the number of orders on each sales, each gene is a number representing the customer number and the number of orders that each salesperson should visit. The test results show that the route sequence generated from the application of the genetic algorithm is better than that applied to the distributor with a total distance of 89.3 km and the fitness difference is 10.656578. The optimal parameters were obtained by generating population size 180, 400 generation and crossover rate 0.6 and mutation rate 0.4.

Page 3 of 3 | Total Record : 30

 1   2   3 

Filter by Year

2017 2017


Reset
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