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 6,923 Documents
 170   171   172   173   174 
Klasifikasi Jenis Kanker Berdasarkan Struktur Protein Menggunakan Metode Neighbor Weighted K-Nearest Neighbor (NWKNN) Aldy Satria; Marji Marji; Dian Eka Ratnawati
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Cancer is non-infectious disease with large population in the world. Cancer is ranked on 7th deadliest disease in Indonesia. Mostly cancer happened because of gene mutation that cause changes in protein form,one of them happens in protein 53 (p53). Mutation of gene p53 most commonly found in human cancers. From this case required a system that can classify the types of cancer. One of methods used is Neighbor Weighted K-Nearest Neighbor (NWKNN). Data used in this paper consists of 752 protein sequences data with 393 sequence length. Classification class includes non-cancer, breast cancer, collorectal cancer and lung cancer. NWKNN is improvement of K-Nearest Neighbor (KNN) method with addition of weight class in its classification class scoring calculation. The test is conducted by dividing dataset into training data and testing data with training data and testing data ratio 80%:20%, 70%:30%, 60%:40, 50%:50, 40%:60%, 30%:70%, 20%:80%, 10%:90% from dataset. The result shows that 80%:20% ratio with K=8 and E=3 provided the highest accuracy eate of 80.666%.
Analisis Kinerja Protokol Routing Fisheye State Routing (FSR) dan Ad-Hoc On Demand Multipath Distance Vector (AOMDV) pada Mobile Ad-Hoc Network Bagos Wahyu Suprayugi; Rakhmadhany Primananda; Adhitya Bhawiyuga
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MANET is a set of mobile nodes that exchanges the information from the source to destination nodes by utilizing wireless networks. Each node in MANET can apply as a host or router, wherein each node can determine the path to other nodes on a network. Reactive and proactive protocols are the types of routing protocols which most often used in the scope of MANET network. In this research, researcher used a scenario of variations in the number of nodes, variations in packet size and node speed that would be simulated using Network 2.35 Simulator in MANET areas. The Quality of Service (QoS) parameters used in this study are end to end delay, routing overhead, packet delivery ratio and energy consumption. Based on the result of simulation, indicate that AOMDV has better performance on end to end delay and packet delivery ratio parameters, while FSR has better grade on routing overhead and energy consumption. The average grade of the AOMDV end to end delay and packet delivery ratio is 475,941 s and 38,246%, and the grade of routing overhead and FSR energy consumption are 84151.4 packet and 591.6 joules.
Prediksi Kebangkrutan Menggunakan Metode Backpropagation (Studi Kasus: Perseroan Terbatas Terdaftar Pada Bursa Efek Indonesia) Nanda Alifiya Santoso Putri; Dian Eka Ratnawati; Bayu Rahayudi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 3 (2019): Maret 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Bankruptcy is a condition while a company fails either economic failure or even financial failure. Bankruptcy causes a general seizure of all the assets of a bankrupt Debitor (company) that settled and managed by the Curator (supervisor of Debitor's asset). Because it can causes a severe consequences, several attemps were done as an alternative for bankruptcy prevention. One of those attemps is by predicting the bankruptcy itself. Backpropagation is a method of artificial neural network that widely used in the context of classification or regression datasets, one of the regression problem is prediction, because backpropagation is one of the supervised learning algorithm which the output or input values already known. In this study, backpropagation works for predicting the bankruptcy with Altman's five variabels as inputs and the results of Z-Score calculation as output target. The entire test that has been done produces the best MAPE value with average at 0,062% using learning rate parameter value at 0,2, 1000 iterations and 6 neurons in the hidden layer. This MAPE value is under 10% and close to 0% which included in the criteria of prediction with very good accuracy.
Optimasi Kebutuhan Gizi Untuk Ibu Hamil Dengan Menggunakan Hybrid Algoritma Genetika dan Simulated Annealing Binti Robiyatul Musanah; Wayan Firdaus Mahmudy; Indriati Indriati
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Nutritional needs are very necessary for pregnant women. Good nutrition is balanced nutrition and according to needs. If the needs of pregnant women are not suitable can experience Chronic Energy Deficiency with these problems, a system is needed to fulfill the nutrition of pregnant women who can provide solutions in the form of food ingredients in accordance with the method of Hybrid Genetic Algorithms and Annealing Simulation. In the process of solving this problem at Simulated Annealing or Genetic Algorithm. This hybrid process is in a crossover process using a single intersection, mutation insertion for the mutation process and the use of elits in the selection and simulation of Annealing. The previous test results obtained parameters with the Hybrid GA and SA method obtaining the best parameter value which is equal to 100 (population size) fitness which obtained an average of 0.06268, the value of 105 (generation) obtained by average fitness0. 06823, i 4 with a fitness value of 0.6, the average is 0.06792, and the average temperature with a value of 1 and apha is 0.5 obtained by the best fitness with an average of 0.06800 along with 0.08876. The hybridization suitability of GA and SA reached 0.08804 higher than the average GA suitability value of 0.05519 and SA suitability which was 0.04382 with a specified time of 1 minute and the requirements generated from the system were insufficient for the nutritional needs of the pregnant women.
Pengembangan Permainan Edukasi Pengenalan Chord Gitar Berbasis Virtual Reality Dengan Menggunakan Myo Armband Aditya Yudha Agung N; Tri Afirianto; Issa Arwani
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In learning the guitar, it is necessary to know the basic chords that can be learned through books or the internet. However, the use of print media does not provide real experience to students. Therefore we need an interactive learning media that can provide real experiences to students. By using virtual reality and Myo Armband this research combines the two technologies into interactive learning games so they can provide real experiences to their students. The system built using the MDA Framework, describing the mechanics, dynamics and aesthetics that exist in the game system. The system is tested using the System Usability Scale (SUS) and Task Completion Rate to test User Experience (UX) of the system, Black Box testing to validate functions in the system and pre-test - post-test testing to test the influence of the game on increasing understanding of material. The results showed that the value of the SUS test was 67.5%, which number did not meet the SUS standard of 68%. The black box testing test results get a 100% valid result which indicates that the functional system of the game has been running correctly. The results of task completion testing give an average yield of 91.43% with a standard task completion of 78% which indicates that this system is good in terms of its effectiveness. The pre-test and post-test tests get an average result for the pre-test of 70 and a post-test of 90. From the two values, there are 20 equalizations which indicate that there is an increase in player understanding in other words the game has succeeded as an interactive learning media.
Analisis Kinerja Protokol 6LoWPAN pada Jaringan Sensor Nirkabel dengan Topologi Jaringan Grid dan Topologi Jaringan Random Menggunakan Cooja Simulator Andre Hadi Saputra; Primantara Hari Trisnawan; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

IPv6 over Low Power Wireless Personal Area Network (6LoWPAN), is an IPv6-based protocol that allows devices with small power consumption such as sensors to remain connected and participate in Internet of Things (IoT) with greater scalability. The presence of 6LoWPAN as an Internet protocol for wireless sensor networks that offers extensive scalability and interoperability. In this study a simulation of the use of the 6LoWPAN protocol on the Wireless Sensor Network (WSN) using Cooja simulator. After that, the analysis was carried out using the Wireshark application and the results of the Mote Output were calculated manually by reviewing the Quality of Service (QoS) parameters, such as throughput, delay and jitter to determine the performance of 6LoWPAN. Cooja Simulator is used because building a genuine propagation network is time consuming and costly. From the simulation results using grid topology and random toology that have different number of nodes and Routing Protocol for Low Power and Lossy Network (RPL). The acquisition of delay and jitter is calculated manually except throughput using the Wireshark application. The highest throughput, as well as the lowest delay and jitter, are obtained by grid network topology with the number of nodes 10 in a row which are 435 bps, 174 ms and 1,795 ms. It can be concluded that the performance of the 6LoWPAN protocol on wireless sensor networks with grid topology is better than random topologies.
Analisis Kinerja Algoritme Speck Pada Keamanan File Teks Karmila Dewi Sulistyowati; Ari Kusyanti; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

SPECK published by NSA in 2013 as a new block cipher algorithm. This cipher has 10 variations based on block and key sizes, which it has its own characteristics for its encryption and decryption process. This research aimed to analyze the performance of SPECK to secure text file by performing encryption and decryption processes. There were two experiments conducted, first is to analyzed performance of 3 variations of SPECK, such as SPECK128/128, SPECK128/192 and SPECK128/256. These variations was chosen because of previous research that utilized the AES algorithm to secure data where AES has 3 variations based on key lengths, such as AES-128, AES-192 and AES-256. The results obtained from this experiment were the longer the key used, the faster the encryption and decryption process on the system. Second experiment is to analyzed variations of file sizes, such as 50 KB, 100 KB, 150 KB, 200 KB, 250 KB and 300 KB. The results obtained were the larger the file size used will took longer time to process. Afterwards, the results were put in Kruskal-Wallis and Post Hoc tests to be analyzed and concluded with each change of 50 KB in file size will produce a significant time difference.
Pengembangan Aplikasi Pembelajaran Pengelolaan Sampah Daur Ulang Dengan Menggunakan IBM Cognitive Service Dan Youtube Api Berbasis Android Andri Suranta Ginting; Adam Hendra Brata; Komang Candra Brata
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 3 (2019): Maret 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In the year 2018, the Malang region has produced 659,88 tonnes of waste on a daily basis and the rate gradually increases directly proportional to the number of the local population. Indonesia is ranked the second biggest contributor to the amount of plastic waste produced worldwide, second to China. Plastic waste is usually managed by means of burning, but this leads to fumes that are harmful to humans and wildlife. This research aims to apply a IBM Cognitive Service that able to analyze objects to manage recyclable waste using image recognitions technology. IBM Cognitive Service has ability to caption images with an accuracy rate of 89%. This application uses YouTube API to show users on how to manage recycable waste and to support a content search feature and a playlist that is integrated with IBM Watson Visual Recognitions which has the ability to analyze objects. The testing methods used by this application development is called SUS (System Usability Scale) which uses 10 question to measure the score, whitebox testing method, and blackbox testing method. The results from System Usability Scale (SUS) measure at 79.5. This shows that the application is categorized as acceptable in acceptable ranges, categorized with a B grade in grade scales, and categorized as good in an adjective rating. The results from the whitebox and blackbox testing methods are deemed valid, because they have fulfilled the necessary requirements.
Implementasi Algoritme BLAKE2S pada Protokol MQTT Sandy Ramadhan Wijaya; Ari Kusyanti; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Message Queue Telemetry Transport (MQTT) is a protocol with a publish-subscribe architecture for Internet of Things (IoT) that designed to be a lightweight protocol when applied. MQTT also a protocol with low bandwidth usage because of the small size transmitted data. To secure the integrity of transmitted data from alteration, substitution, and insertion, an integrity checking mechanism of the received data is required. Because the received data could affect the results of data processing like storing data to the database and decision making by the control unit. Although MQTT can be applied using Secure Sockets Layer (SSL), but SSL requires a lot of resources. As an alternative to the SSL's implementation, Message Authentication Code (MAC) is used in this study for an integrity checking mechanism. There is a MAC algorithm that has been widely used, such as the HMAC-MD5 and HMAC-SHA1 algorithms. However, the MD5 and SHA1 algorithms are insecure because they are vulnerable to second preimage and collision attacks. So as an alternative BLAKE2S algorithm is used because it is resistant to second preimage and collision attack attacks. Based on the test result of the implemented BLAKE2S algorithm to systems with the MQTT protocol, the system knows if there is an alteration, substitution, and insertion of the received data with an average of memory usage overhead only 0.0041 MB in the publisher side and 0.0044 MB in the subscriber side.
Pemanfaatan Metode Texture-Based Region Growing Untuk Segmentasi Buah Jeruk Keprok (Citrus Reticulata Blanco) Rr Dea Annisayanti Putri; Agus Wahyu Widodo; Muhammad Arif Rahman
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Indonesia is a producer of “Keprok” and the largest harvest area in ASEAN. In market competition, the most important thing for oranges is quality. The visual technology method can be used to replace the quality determination process that is still manual. One process of determining automatic quality is segmentation. Segmentation is the process of separating objects studied from less important parts. The segmentation process is an important process in determining quality, the results of segmentation must be precise, no under segmentation or no over segmentation. This study uses the region growing method with texture value parameters obtained from contrast, homogeneity, entropy, and energy features in the gray level co-occurrence matrix (GLCM) method. First, the image of oranges is taken. In the image of oranges, pre-processing takes the form of changing the color and size of the image. Then the image of the orange is divided into a collection of pixels called windows, with sizes 10, 20, 50, and 100 pixels. From the window group, one window will be selected which becomes the starting point for region growing. In the initial window and 8 neighbor windows, feature values are taken. The neighboring window is considered to be the orange part if it has a feature value according to the boundary. This study resulted in the best level of segmentation accuracy of 84.7% with a window size of 50x50 pixels, an entropy feature, and a limit value of 5.

Page 172 of 693 | Total Record : 6923

 170   171   172   173   174 

Filter by Year

2017 2026


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