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,850 Documents
 56   57   58   59   60 
Analisis Performa Jaringan Sensor Nirkabel Berdasarkan Penentuan Lokasi Node Yang Telah Diimplementasikan Dengan Algoritma Genetika Irma Asri Kartika Sandy; Mochammad Hannats Hanafi Ichsan; Gembong Edhi Setyawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 10 (2018): Oktober 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The critical success factor of communication in a wireless sensor network is the connectivity of the sensor nodes in the network. Connectivity of the sensor nodes depends on the position of the sensor nodes, so in the design of wireless sensor network need to pay attention to the laying of sensor nodes in order to improve the performance of sensor networks. Genetic Algorithm is a method that has a bending property that can be used to determine the position of the node. There are studies using genetic algorithms to determine the best position that has not been implemented. Therefore, the implementation and analysis on the performance of wireless sensor networks that laying the node has been implemented with genetic algorithm. Analysis is done by analyzing the value of quality of service (delay, jitter, throughput) from communication between nodes to user's computer, and by analyzing test result from 5 channel flame sensor coverage area. And to make the previous system become dynamic, the feature is added. The result of the analysis shows the value of quality of service delay of 7.66 s. The value of jitter is 1.01 and the value of throughput is 77.01. Analysis of the 5 channel flame sensor test results is the sensor can cover with a distance of more than 100 cm with medium or large fire volume. Test results from the system to be more dynamic has a 100% success, that is by adding features of the radius input section of the sensor and the room width according to user needs.
Sistem Pendukung Keputusan Penentuan Tingkat Keparahan Autis Menggunakan Metode Fuzzy K-Nearest Neighbor Robbiyatul Munawarah; Muhammad Tanzil Furqon; Lailil Muflikhah
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 7 (2017): Juli 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Autistic or Autistic Spectrum Disorders (ASD) is a general term referring to a neurodevelopmental disorder that is well known among Indonesian. Many researches on autism detection have been done by designing artificial intelligence systems with a variety of techniques used to make it easier for society to predict this kind of disorder. However, we hardly ever seen a system that can determine the severity of autism. In fact, the progress of the research in this field is no longer focused on whether a child is autistic individual or not, but rather to questioning about “Is there anything in autistic children that makes them different from one another?” as the ‘severity' label appear to give them spesific class under certain behaviour they shown. To make it easier to determine the severity of autism, decision support system will be designed using one of data mining method called Fuzzy K-Nearest Neighbor (FK-NN). Fuzzy K-Nearest Neighbor (FK-NN) is K-Nearest Neighbor method combine with Fuzzy theory that gives value of membership on every predicted data.. There are 14 symptoms and 3 types of severity used as a parameter in the development of the system. The output of this decision support system is autism severity level. The results of the system shows that the average maximum accuracy is 90.83% while the average minimum accuracy is 82.50%. Based on those results, the uses of Fuzzy K-Nearest Neighbor (FK-NN) method can be implemented in our daily life.
Evaluasi Usability Pada Aplikasi Uber Menggunakan Pengujian Usability Muhammad Yosa Alfiqie; Ismiarta Aknuranda; Niken Hendrakusma Wardani
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 9 (2018): September 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

UBER is one of the apps that provides online transportation based in Indonesia. UBER user are getting bigger these day, with total download reaching 100 million times. But there are still some users who have a complain regarding the app, they stated that the GPS is not showing the user's location, then some of them confused how to choose the payment method, and there are even some of them who already paid but not written in the application. From this feedback, it is necessary to identify further what are the problems exist in UBER application, and using usability level measurement to find out the extent of ease, rate of speed, error rate, and level of satisfaction. In this study provides evaluation results to determine the usability problems and levels by using the usability testing method. The result that we get after the evaluation shows the usability problems that exist in UBER application, such as the maps in the application is less accurate, users are confused with the start screen because its lead straight to the maps, users are confused which one is their driver, and there are confusions because the application are using English. The usability level results that consists of the level of ease of the users in completing the task given is 100%, the level of time needed by users when finding the necessary information is 0.0116 goals/sec, the user's error rate is 0,13, and the level of the user satisfaction is between 40%-50%.
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.
Implementasi Naive Bayes Dengan Certainty Factor Untuk Diagnosis Penyakit Anjing Desy Setya Rositasari; Nurul Hidayat; Fitra A. Bachtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 11 (2018): November 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The interest of Indonesians in having dog as pets is high. Dogs become favorite pets because dogs have funny and adorable habits. In addition, taking care of dogs is quite easy. Prevention and detection of diseases that infect dogs is necessary, so the infected dogs can be taken care of immediately to prevent transmission of the disease to other dogs and to human. Diagnosing the diseases could be a bit difficult sometimes because some diseases have similar symptoms. Another problem is that there are not many veterinary clinics that open for 24 hours so it would be difficult for dog owners if they found out that their dog was sick outside of the clinics' working hours. The system of dog diseases diagnosis is made to assist veterinarians in diagnosing dog diseases, in addition the system is expected to assist the community in making an initial diagnosis of their dogs. This system is Android-based and applies the method of Naive Bayes and Certainty Factor. The Naive Bayes method is used to classify dog diseases based on the usual pattern of symptoms, while the Certainty Factor method is used to determine the value of certainty of classification results from the Naive Bayes method. Based on the accuracy test that was done for five times, the average accuracy value obtained was 97.2%.
Sistem Pakar Identifikasi Penyakit Tanaman Kacang Tanah Menggunakan Metode Fuzzy Mamdani Berbasis Android Arifandi Wahyu Widianto; Nurul Hidayat; Moch. Cholil Mahfud
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 (1250.23 KB)

Abstract

Peanut (Arachis hypogaea L.) is one of important plant commodities after corn and soybean crops. In addition, peanut production in not sufficient needs and often experience crop failure. One of the causes of it is the disease in the peanut itself. To overcome the problem of disease in peanuts done by making disease identification system, thus facilitating the control. The method used is fuzzy mamdani logic and forward chaining, fuzzy logic of Mamdani to determine the value and result of disease diagnosis of the phenomenon, while forward chaining is used for weighting value. After the implementation and testing, obtained the accuracy between experts with the system of 90.00%. From these results can be concluded that the results of the system and experts are aligned and have a positive accuracy.
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.
Implementasi Robot Lengan Pemindah Barang 3 DOF Menggunakan Metode Inverse Kinematics Rimas Oktama; Rizal Maulana; Gembong Edhi Setyawan
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 (1044.203 KB)

Abstract

Moving object process from one place to another is usually done with the conventional way using human power, then it can certainly getting heavy objects and the farther the distance of displacement, manpower required objects are also getting bigger. It is judged ineffective considering the limitations of human capability in the shift of weight and time limitations of humans in the work. Based on these problems required a robot arm that is able to moving an object from one place to another. The robot arm was designed to have 3 DOF (Degree of Freedom) and the whole joint is revolute and implemented using servo dynamixel AX-12A. Input from this robot is initial coordinates and final coordinates are then computing by the method of inverse kinematics with an output in the form of large angle of each joint required in order for the robot arm reaches the point coordinates. Results from research that has been done, the robot is able to move the object from one point coordinate to another within an average period of 6 to 7 seconds as well as the level error that occurred in the achievement of the desired angle of 0.64%. Based on the results of the implementation system of the arm robot assessed transporter 3DOF using inverse kinematics method is very effective in carrying out its functions to move an object.
Clustering Titik Panas Bumi Menggunakan Algoritme Affinity Propagation Barik Kresna Amijaya; Muhammad Tanzil Furqon; Candra Dewi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 10 (2018): Oktober 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Forest and land fires are catastrophic and can disrupt the activity of living things around the fire location. Forest and land fires should be prevented by knowing the cause of the fire. One of the ways of fire prevention is to monitor the hotspot. The hotspot is an area where the temperature is relatively higher compared to the area around which the satellite is detected. The area is represented in a point that has certain coordinates. hotspot needs to be grouped or clustered to know the similarity of each point and easy to do monitoring. Clustering is the process of grouping data into clusters, so that objects that exist within a cluster have a high similarity with each other and very different from the objects that exist in other clusters. Affinity Propagation method is a method used to perform data grouping by specifying the exemplar as data centers. Affinity Propagation performs clustering by searching for responsibility value and availability of each data to find the right exemplar. In this research has done clustering using Affinity Propagation with the best silhouette coefficient value that is 0.317818 with 125 data and formed 44 clusters.
Analisis Pengiriman Data Di Daerah Terpencil Menggunakan Dua Node Bergerak Berbasis Delay Tolerant Network (DTN) Dengan Algoritme Flooding Bella Aulia Rahmataufany; Rakhmadhany Primananda; Aswin Suharsono
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 9 (2018): September 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Abstract With the development of information technology today, the exchange of data and information becomes a necessity, not least in remote areas. Remote areas have their own characteristics, such as geographical conditions difficult to reach by the network. Due to these circumstances the exchange of information becomes a difficult thing to do. Delay tolerant network (DTN) is a network that can operate at great distances. Internet connections can be present in backward areas though indirectly. Delay tolerant networks can also transmit data packets on networks that have difficult terrain or not continuously available connections. The delay tolerant network architecture implements the method of saving and forwarding messages by using a new protocol layer called bundle layer. One developer of delay tolerant networks is IBR-DTN. IBR-DTN is an efficient software for embedded systems. There are several previous studies related to data transmission based on tolerable network tolerance. However, in this study researchers used the flooding algorithm to conduct research on the analysis of data transmission in remote areas using two moving nodes based on toler tolerance network with flooding algorithm. In this study used two moving nodes to view the broadcast process of the routing flooding algorithm. The two nodes are used to see the effect on time, which is required when sending data from village to city. There are three tests for predefined scenarios, including data transmission with two moving nodes, data transmission with one node moving disconnected, sending data using multiple files. The test results obtained are simulations built to make data transmission with the state there are two moving nodes or there is only one moving node. Despite having longer required data transfer, if the data is small (not more than 5 files, with a size of 1 to 5 Mb) with one intermediate node, the probability of data reaching the destination is smaller than the two moving nodes.

Page 58 of 685 | Total Record : 6850

 56   57   58   59   60 

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