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 50 Documents
 1   2   3   4   5 
Search results for , issue "Vol 1 No 12 (2017): Desember 2017" : 50 Documents clear
Optimasi K-Means untuk Clustering Kinerja Akademik Dosen Menggunakan Algoritme Genetika Budi Santoso; Imam Cholissodin; Budi Darma Setiawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Lecturers are teacher for students, besides teaching, lecturers also have many other activities by utilizing the expertise they have to develop the potential of the lecturer. Some of the characters that each lecturer are so different, such as education, research, dedication, administration, and support. The difficulties faced by the campus, one of them is related to the grouping of assignments to lecturers. The assignment is related to further studies, recommendations, structural related positions, filling an event, commission, etc.So that required a system that can classify the academic performance of lecturers optimally. In this study to classify the academic performance of lecturers using K-Means method is optimized with genetic algorithm. Genetic algorithm acts to optimize the cluster's initial center on K-Means.Data algorithm used in this research is the data of lecturers in UB's Computer Science faculty in 2016. The data obtained from GJM faculty of computer science of Universitas Brawijaya. The result of clustering test of academic performance of lecturer using GA-Kmeans algorithm has higher cluster quality that is 2,74% compared to K-Means algorithm without genetic algorithm, where the cluster quality obtained using Silhouette Coefficient method.
Analisis Perbandingan Performa Algoritma Round Robin dan Least Connection untuk Load Balancing pada Software Defined Network Agung Nugroho; Widhi Yahya; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The development of internet technology whom the users desire for the availaible services anytime tend to be increased following the current development which commonly not always supported by the increasing adequate server services. The highest users demand make the work load in server raised rapidly which cause down server in a short period along with the needs of technology which handle the utilization of complex connections. As a new technology, Software defined network offers scalability and programmability for the using of connections which become complex such as Balancing Web Server. There are some studies concerning with load balancing in Software defined network (SDN) with various algorithm which is applied will resulted difference performance from algorithm, , one of them is Round robin and Least connection. The experiment is done with 3 categories; low, medium, and high. The experiments parameter which is used are Throughput, Response time, and CPU Usage use Httperf and Psutil. Round robin Algorithm is more excellent than Least connection Algorithm in a tiny connection. On the other hand, for the bigger connection, Least connection Algorithm is excellent. The average value of time response shows the superiority of Round robin Algorithm rather than Least connection Algorithm. CPU Usage server with the Round robin Algorithm is more stable in each rate category. On the contrary, Least connection Algorithm is less of load than Round robin Algorithm in spite of the value is raise in each rate category.
Pengembangan Sistem Pembelajaran Pemrograman Java yang Atraktif Berbasis Website Dhanuari Indra Bastari; Fajar Pradana; Bayu Priyambadha
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Basic programming is a knowledge that must be mastered by every FILKOM student, but based on the result of the questionnaire found that 76% of FILKOM students are more interested in other subject. There are several things that cause students to be less interested in the basic programming courses, the limited source of material that can be obtained and learning techniques that are less varied. Therefore, this research will develop an attractive web-based java learning system by adapting the gamification and IOE-Behavior methods. Gamification method wass applied to this learning system through several features, feature that allows user one challenge other user (challenge), reward feature for user reaching certain condition, level feature and experience point. While the IOE-Behavior method was applied to the java code check feature that allows the system to check the java code automatically by comparing input and output results. This system was developed using SDLC method with waterfall model. In the final stages the system was tested using black-box testing and white-box testing methods with 100% valid test results.
Prediksi Volume Impor Beras Nasional dengan Metode Multi-Factors High-Order Fuzzy Time Series Nendiana Putri; Edy Santoso; Sigit Adinugroho
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

A good self-sufficient of rice support is needed to save some foreign exchange reserves that used to import rice. An accurate rice import volume prediction is needed to make a strategic plans for keeping management of rice support stability. Fuzzy time series is one of prediction methods which use past data pattern to projects data in the future. There are some fuzzy time series method's models, one of those models is multi-factors high-order time series model. This method distributes data into several subintervals with different length, depending on centroids that came from clustering process with fuzzy C-Means method. Advantage from using multi-factors high-order time series model is this model uses more than one order and antecedent factor to build a fuzzy logic relationship. Antecedent factors that used in this case are rice productions and consumption factors that affect Indonesia's rice import volume. Minimum value of Normalised Root Mean Squared Error (NRMSE) obtained 0.298 in this study. NRMSE value which is almost zero shows that multi-factors high-order fuzzy time series method is a good method for rice import volume prediction.
Peringkasan Teks Ekstraktif Kepustakaan Ilmu Komputer Bahasa Indonesia Menggunakan Metode Normalized Google Distance dan K-means Dhimas Anjar Prabowo; Mochammad Ali Fauzi; Yuita Arum Sari
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The yearly rapid increase of digital data surface a problem for a person to be able to read every information that was served. One example of its data was a textual data document, which could be in a form of research document. This problem urges for a solution that is a technique to present all of the information in a clear and concise form, and one of its solution is a text summarization technique. This research proposed a text summarization technique using Normalized Google Distance (NGD) and K-means as its extractive algorithm, with a textual data that is a research document based on computer science studies in an Indonesian language as its research object. NGD will be used as an algorithm to derive sentences that was related to its document's title, and K-means will be used as an algorithm to obtain important sentences by its several topics that occurs in the document. The experiment result showed that this research possess an average best of precision, recall, and relative utility measures scores by 0.27, 0.43, and 0.45 respectively. In the other hand, the experiment result also showed that this research possess an average of kappa measure score by 0.41 or moderate.
Penerapan Algoritma Hybrid Pathfinding A* dan Boids untuk Game Pesawat Tempur Firdaus Rahmat Prasetyo; Eriq M. Adams Jonemaro; Muhammad Aminul Akbar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The A* and Boids hybrid pathfinding algorithms can be used as a way of tracking the flying paths of aircraft games. In hybrid pathfinding, A* algorithm is used as the shortest path finding and avoid static obstacles while the Boids algorithm is used as a flyweeker in groups and avoids dynamic obstacles .Grid used for path search using A* algorithm is driven according to A* agent position that it does not increase number of nodes because in aircraft game the map size is so large. Pathfinding using A* algorithm will only be call when grid touch static obstacle, so pathfinding doesn't take a long time. This is proven when the agent uses an A* algorithm, the average of execution time increase by 4.24% and the average of FPS decreases by 11.59% compared with not using the A * algorithm. While the use of Boids algorithm is continuously on the aircraft so that the aircraft does not collide with each other. This algorithm is chosen because it has a time complexity that is not too high. This is also proven when there is dynamic obstacles in map, the average of execution time increase is only 6.21%.The average FPS on all maps is 75.91 which is above of the FPS limit that can trick the eye by 20. The average execution time of all maps is 102.79 ms. The average path length of all maps is 445.56. The average number of actors destroyed from all maps is 107.
Optimasi Penjadwalan Mata Pelajaran Pada Kurikulum 2013 Dengan Algoritme Genetika (Studi Kasus: SMA Negeri 3 Surakarta) Radita Noer Pratiwi; Imam Cholissodin; Putra Pandu Adikara
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Scheduling is one of the most difficult computing problems to solve. Problems in scheduling also occur in SMA Negeri 3 Surakarta which has implemented the 2013 curriculum with the system of university credit unit which for the implementation consists of two courses, namely 4 semester program and 6 semester program. Genetic algorithm is a search method that can be used to obtain optimal solution. Representation of chromosome in the research is divided into two segments, those ares chromosome length 748 for 6 semester program and 86 4 semester program. The optimal solution is obtained from the test that conducted 10 times and obtained the optimal parameter value of population size 600 individuals, the number of generations 1000 times, the value of cr 0.5 and the value mr 0.5. The results of the optimal solution in the form of course schedules for the 6 semester program and 4 semester program obtained from the highest fitness value of 0.16208. The result of the solution obtained from the highest fitness value is not optimal because there are still violations on the constraint in the scheduling of the courses in SMA Negeri 3 Surakarta.
Perancangan Website Unit Kegiatan Mahasiswa dengan Metodologi User Centered Design Deni Kusuma Fajri; Agi Putra Kharisma; Ratih Kartika Dewi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Brawijaya University has no less than 44 Student Activity Units, but those 44 units still do not have publication facilities that complement, especially the Student Activity Unit of Merpati Putih. After the researcher conducted a survey to the Student Activity Unit of Merpati Putih of Brawijaya university, currently it only has a blog with a free domain, a very simple and less attractive appearance, and there were some features perceived less by the board and members, Therefore, it needs another means to obtain information about the Student Activity Units that can be freely or cheaply accessed anytime and anywhere. In this case, a website became a very appropriate solution to be realized in solving this problem. UCD is an acknowledged method of effectiveness and efficiency, so it is very appropriate to apply in designing websites of Student Activity Unit. From the application of these methods, the obtained test results on prospective visitors with the level of both effectiveness and efficiency got a value of 100%, the level of user satisfaction got a value of 80%, and usability rate got a value of 93.3%. More over, the results of this study tested to prospective administrators got 100% for the value of effectiveness and efficiency, 90% for the value of satisfaction, and 96.7% for the usability testing of prospective administrators.
Pengaruh Kualitas Layanan Terhadap Kepuasan, Kepercayaan dan Loyalitas Pelanggan Pada E-Commerce (Studi Kasus : Berrybenka) Rika Mardatilla; Ari Kusyanti; Himawat Aryadita
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

E-commerce is one of the development of technology that is very influential in business field where companies are required to have an innovation in online transaction. The advantages of e-commerce can be experienced by both the sellers and cutomers as the customers get the things that they want easily without spending much time and effort. On the other hand, the sellers can also expand their market share quickly. One of the companies that utilizes the sopistication of the technology in Indonesia is Berrybenka.Berrybenka is a fashion e-commerce in Indonesia that is quite popular nowdays. However, at this time there is not yet known who the effect of service quality that can affect customer satisfaction, trust and loyalty to Berrybenka. This research model built on the quality of service will be five dimensions namely, ease of use, web design, responsive, personalization, assurance that affect satisfaction, trust, customer loyalty based on previous research. The completed data were analyzed by using structural equation modeling (SEM). The results of this study indicate that the five dimensional service quality does not affect satisfaction, satisfaction take affect positive and signification trust, and word-of-mounth, but does not affect intention, trust take affect positive and signification intention-mounth, but does not affect word-of-mounth, and customer loyalty will be two dimensions namely, word-of-mounth take affect and signification intention.
Analisis Performa Sistem Pemantauan Suhu Dan Kelembaban Berbasis Wireless Sensor Network Da'imul Royan; Rakhmadhany Primananda; Wijaya Kurniawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Utilization of more adequate technology to support agricultural resources needs to be done. One of the technologies required is a temperature monitoring system and humidity based wireless sensor network environment with good performance to give a comparable value to the observed parameters premises. There are many sensor devices that serve to measure temperature and humidity, accuracy is one of the parameters that can be used to determine it. Once the selected component requires delivery scheduling method with time division to avoid the possibility of data transmission collision, time synchronization is required to support scheduling method. After the facility is formed, it is necessary to conduct performance tests to determine the performance of the system whether in accordance with field conditions. Parameters in system performance testing are system functionality, sensor response to temperature and humidity changes, sensor accuracy comparison in variations of time period of use on farmland, comparison of delivery delay in variation of distance between nodes and RAM usage. From the test results show that all the functionality of the system can work well with a 100% success percentage. DHT11 has a response time of 10.4 seconds - 10.9 seconds each for temperature and humidity measurements, the large range of values influences the temperature reader. DHT11 has a relative error range of 1.2 - 1.5% and 5.6 - 6.3% respectively for temperature and humidity measurements, duration of use has no effect on accuracy. The system has the largest delivery delay at a distance of 70m node is 19μs, the more distant the resulting delay the greater. The largest use of RAM reached 47% when sending messages on sensor nodes.

Page 5 of 5 | Total Record : 50

 1   2   3   4   5 

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