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,480 Documents
 1   2   3   4   5 
Analisis Faktor Penerimaan Pengguna E-Learning SMA Negeri di Kota Blitar Menggunakan Model Unified Theory of Acceptance and Use of Technology (UTAUT) Diah Destaningrum; Suprapto Suprapto; Niken Hendrakusma Wardani
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 2 (2018): Februari 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

E-learning is an internet application that can connect between educators and learners in a online studi room. E-learning Blitar city to facilitate interaction between school tuition in learning process with the teacher especially in Blitar City. Teacher or an instructor can put learning materials and tasks that must be done by school tuition in a particular place in a web for accessed by the school tuition. Based on the results of interviews from one of the development team, since enactment of e-learning Blitar City users namely students and teachers not have been able to accept any information technology of the new. This can be seen in high school Blitar 1, high school Blitar 2, high school Blitar 3, high school Blitar 4 not all the teachers and students use the e-learning. Unknown factor-factor whatever causing a user not accept any e-learning blitar city. This research be useful to know factor-facktor acceptance users state high school e-learning especially in the Blitar City have applied e-learning. To research it will use the model unified theory of acceptance and use of technology (UTAUT) to know factor-factor anything that affects revenue. The model was obtained from previous studies and adapted in accordance with research. The results of the study based on analysis and discussion is the variable performance expectancy (PE), social influence (SI), facilitating condition (FC). Perceive credibility (PC), and anxiety significant to intention to use.
Penentuan Lokasi Pasang Baru Wifi.id Corner Menggunakan Metode AHP dan Algoritma Genetika (Studi Kasus : PT. Telkom Witel Kediri) Figgy Rosaliana; Dian Eka Ratnawati; Mochammad Ali Fauzi
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 (903.438 KB)

Abstract

Wifi.id corner is a location provided by Telkom Corporation to access @wifi.id network. Determining new location of wifi.id corner needs consideration and right decision. Several criterias are used to this study such as Fiber Optic network availability, level of crowdedness, location type and density level of wifi.id corner location. Analytical Hyrarchy Process (AHP) method and Genetic Algorithm are applied to solve those problems. Genetic Algorithm will optimize the weight of AHP process. This algorithm uses real code chromosome representation with length of 6 genes, each gene represent element of weighted matrix value. The Reproduction uses crossover intermediate and random mutation. In the evaluation, AHP process determine feasibility of location then will be calculated its fitness by using accuracy formula. Selection method uses elllism s election. From the result of study, optimal parameter obtained in population size of 80, number of generation 85, combination of cr 0.4 and mr 0.2 with average fitness value 0.700 or accuracy of 70%. Location feasibility will be shown to users as the final result of the system.
Analisis Kinerja Protokol Ad Hoc On-Demand Distance Vector (AODV) dan Fisheye State Routing (FSR) pada Mobile Ad Hoc Network Desy Ulina Purba; Rakhmadhany Primananda; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 7 (2018): Juli 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The development of ad-hoc network technology is Mobile Ad-Hoc Network (MANET). MANET is formed from a collection of nodes that use wireless interfaces to be able to communicate between nodes with other nodes. Each node has the same position, so it takes a routing protocol that able to cover the exchange of data to be able to provide an optimal routing path. In this research, routing protocols used are AODV and FSR. AODV routing protocol establishes a route from one source node to the destination node based on the request of the source node. FSR routing protocol, each node stores a table containing route information on each node that it knows, route information will be updated regularly in case of link changes. Parameters of routing protocol performance measured in the form of packet delivery ratio, end to end delay, throughput and packet loss using Network Simulator 2.35. The results obtained in this research are FSR protocols best at the value of throughput parameters with an average value of 108,435 kbps and end to end delay with an average value of 16.06575 m/s. AODV protocol, best at the value of packet delivery ratio with an average value of 98.95 % and packet loss with an average value of 1.05 %. AODV protocol routing and FSR protocols have their respective advantages over each protocol based on Quality of Service (QoS) performance values ​​on the addition of nodes and packet size variations.
Peramalan Produksi Gula Menggunakan Metode Jaringan Syaraf Tiruan Backpropagation Pada PG Candi Baru Sidoarjo Adi Sukarno Rachman; Imam Cholissodin; Mochammad Ali Fauzi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 4 (2018): April 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Sugar is a staple that is routinely used by the people of Indonesia. Sugar is often used in the food and beverage industry, food processing and preservation industries. Sugar needs increased supported by the lifestyle of Indonesian people, especially in daily life. PG Candi Baru is a sugar faktory that was built in 1832 and is a sugar-producing company SHS I (Superior Hooft Suiker) or White Crystal I (GKP). Since 2004 PG Candi Baru has greatly improved the company's performance and made changes through technological breakthroughs in the field of on farm and off farm. This research uses Artificial Neural Network backpropagation with network architecture design in the form of 4 input layer neurons, 3 hidden layers, and 1 output layer. Based on testing the maximum number of iterations obtained the lowest MAPE value of 17.85% with the number of iteration 800. And in the test of learning rate obtained the lowest MAPE value of 17.38% with the value of learning rate 0.4. If the maximum iteration value of 800 and the value of learning rate 0.4 will result in MAPE value of 16.98%.
Optimasi Penjadwalan Mata Pelajaran Menggunakan Algoritme Genetika (Studi Kasus: SMK Negeri 2 Kediri) Muhammad Fuad Efendi; Imam Cholissodin; Edy Santoso
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 10 (2017): Oktober 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The process of drafting schedules manually felt less efficient because it takes a long time. The problem of drafting the schedule will be complex if the number of components is more large amount of data from each component. The expected schedule is not just a schedule that does not clash, but a schedule that can adapt to some constraints that must be met within the schedule. Genetic Algorithms are algorithms that are iterative, self-adjusting and probabilistic algorithms in search for global optimization. The process of chromosome initialization generated from teacher assignment data by integer representation of each gene containing randomly generated assignment codes. Each chromosome with the highest fitness value is a representation of the subject schedule solution. From the testing process that has been done, has obtained the parameters of Genetic Algorithm is the best population number is 90, the value of the combination of Cr and Mr is 0.5 and 0.5, and the number of generations as much as 40000. The process of finding solutions using these parameters obtained the value of fitness that is 0,8451.
Analisis Pengujian Usability untuk Membandingkan Kemudahan Transaksi pada BukaLapak dengan Lazada Tegar Wahyudi; Fitri A. Bachtiar; Mochammad Chandra Saputra
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 5 (2018): Mei 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Lazada and BukaLapak are e-commerce that have been applying mobile application technology. Lazada and BukaLapak have reting and highest downloader compared to its competitors. But earlier in the year 2017 Lazada has received many complaints in reference to problems of Usability. This research use theory of McCall in which Usability has 3 matrix, namely: Operability, Communicativeness and Training. Operability matrix is to see the extent to which users can operate an application, Communicativeness matrix is to see the suitability of data input with output data seen from the users. Training matrix is to see the extent to which new users can operte application. The research began with the making of instruments, data collection, and continued with the statistical testing. In the making of the instruments the questions are based on the article belong to McCall. Data collection questionnaire used to measure Operability and Communicativeness, whereas the task used to measure Training. Statistical test using independent t test to see a comparison between the Lazada and BukaLapak. From the results of the comparison of the three matrix such that for Operability, Communicativeness and Training there is no difference between BukaLapak and Lazada.
Analisis Perbandingan Dampak Serangan Black Hole pada Peformansi Protokol Routing OLSR dan AODV di Jaringan Wireless Mesh Network Wian Virgi; Adhitya Bhawiyuga; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 3 (2018): Maret 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Wireless Mesh network (WMN) is a set of wirelessly connected nodes forming a mesh topology. Over the WMN, the process of transmitting data information requires a path to get to the destination node, namely reactive protocol and proactive protocol. Security wise, routing protocols are still vulnerable to various forms of attack, especially against active attacks that can destroy, modify and deleting not only data but also the information within. Based on the said problems, the writer decided to make a research called Comparative Impact Analysis of Black Hole Attack on the Performance of OLSR and AODV routing Protocols in Wireless Mesh Network's Network. The results obtained in this study is that the black hole attack does affects the performance of AODV and OLSR routing protocols. The test was done using OMNET++ with three test scenarios, that is to say, without-attack; with multiple-attack nodes; and with big-probability of attack. Test parameters include throughput, end-to-end delay, packet loss and packet delivery ratio. The result of research using 18 nodes of attacker showed that packet loss on OLSR is higher than AODV which is proved by the highest packet loss result in AODV that only has 99.33% while OLSR has 99,50%.
Implementasi Fuzzy Time Series Pada Prediksi Harga Daging Di Pasar Kabupaten Malang Frans Agum Gumelar; Rekyan Regasari Mardi Putri; Indriati Indriati
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 8 (2018): Agustus 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Beef is one of the staples that are always consumed by the people of Indonesia. The scarcity of local beef is one of the causes of rising prices. Stabilize the price of beef is the duty of DISPERINDAG. DISPERINDAG spreads almost in every region of Indonesia, one of them is in Malang. Its population is increasing annually so that the demand of food especially beef also increasing. Rising demand of beef also affects the rise in beef prices. So DISPERINDAG should control the increase of beef prices as action to anticipate the increasing price. Therefore, one of the efforts that can be done is to forecast increasing price of beef. So that DISPERINDAG can consider the next month price based on forecast result.The forecasting process is based on historical data. This forecasting that is used is called time series data forecasting. The relations between data are emphasized in time series forecasting. The method used for forecasting is the Fuzzy Time Series (FTS). Based on the results of the test using 21 data of meat prices in Malang Regency in 2016 and 2017, the accuracy obtained from forecasting of 57%. With the smallest error value lies in june 2017 of 16,129 and the biggest error value lies in march 2016 of 65,610,000.
Analisis Fail Path Pada Arsitektur Software Defined Network Menggunakan Dijkstra Algorithm Eka Putri Aprilianingsih; Rakhmadhany Primananda; Aswin Suharsono
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 3 (2017): Maret 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Software Defined Network is a new concept that is used to fix traditional network's issues by making the separation between the control plane and the data plane in many different network devices vendor. The communication between control plane and data plane use the OpenFlow Protocol. SDN has some abilitiesin many network technology methods, and has been widely implemented such as network routing. There are some problems in routing, for example is file path. When there is a fail path arises, the system will look for another shortest paths by using Dijkstra Dlgorithm. Dijkstra Algorithm will be implemented using SDN then will be analyzed. Implementation uses a mesh topology and Pyretic as the controller. Then algorithms will be tested with 3 scenarios. In these scenarios, there are 4 tests: the testing topology, throughput, latency and convergence. Tests conducted topology to generate the shortest path. Scenario 1, is h1, h4, h3, h7 with cost 10. Scenario 2, is h1, h2, h3, h7 with cost 13. Scenario 3, is h1, h4, h6, h7 with cost 18. The purpose of throughput testing is to count packets arrive at the destination side. Scenario 1 had maximum throughput at 12.0 Gbits / sec. Scenario 2 is 9.56 Gbits / sec. Scenario 3 is 9.68 Gbits / sec. Latency test is to calculate the time taken from a package to its destination. Scenario 1 produced the highest latency at 0.162ms. Scenario 2 is 0.190ms. Scenario 3 is 0.150ms. Convergence test is to determine the changes in the time required when fail path. Scenario 1 has no file path so there were no results in convergence. Scenario 2 is 2.009ms. Scenario 3 is 3.01ms.
Rancang Bangun Aplikasi Augmented Reality Pengelolaan Rambu-Rambu Lalu Lintas Menggunakan Global Positioning System (GPS) pada Android Mohammad Fatoni Anggris; Mahardeka Tri Ananta; Hanifah Muslimah Az-Zahra
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 8 (2018): Agustus 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The traffic signs are a symbol of traffic order useful as warning, prohibition, command and directions. The management signs by the division of Rekayasa Lalu Lintas (RLL) get some obstacles in collecting data that have been installed. Data collection which done by the officers still using manual guide. Every survey have been conducted by surveyor, returned to office for result and need long time. Meanwhile, field officers also get some problems in determining route and position of signs that will be installed. The solution to simplify sign management is to build an integrated system between mobile application and web application. Web application which as server is a web service based to process exchanging sign data. Mobile application as client by doing CRUD process and based AR and GPS to facilitate installation positioning signs. The result of application is able to perform the process of signs management well. Result of validation test results have occupied functional requirements and result of usability testing obtained 79.5 SUS score from field officer and 80.5 SUS score from surveyor. Meanwhile results of compatibility testing get 100% valid results and result of GPS accuracy approach testing obtained highest result is 4.039m and lowest is 1.812m.

Page 2 of 648 | Total Record : 6480

 1   2   3   4   5 

Filter by Year

2017 2025


Reset
Filter By Issues
All Issue Vol 9 No 13 (2025): Publikasi Khusus Tahun 2025 Vol 9 No 11 (2025): November 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