Garuda - Garba Rujukan Digital

Penyandian Super Enkripsi Menggunakan Columnar Transposition dan Modifikasi Hill Cipher dengan Invers Kiri Matriks Persegi Panjang Fika Wahyuni; Muhammad Khudzaifah; Muhammad Nafie Jauhari
Jurnal Riset Mahasiswa Matematika Vol 1, No 2 (2021): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Pada penelitian ini, digunakan algoritma columnar transposition sebagai metode transposisi dan modifikasi algoritma hill cipher dengan invers kiri matriks persegi panjang sebagai metode substitusi. Penyandian pesan menggunakan metode super enkripsi dengan algoritma columnar transposition dan modifikasi algoritma hill cipher dengan invers kiri matriks persegi panjang menghasilkan pesan akhir yang tidak mengubah, menambah maupun mengurangi pesan awal, sehingga dapat di implementasikan pada pesan dengan baik. Penyandian ini melipat gandakan keamanan suatu pesan, dimana keamanan pertama terletak pada enkripsi pesan dengan columnar transposition dan keamanan yang kedua terletak pada algoritma hill cipher yang telah dimodifikasi, sehingga membuat pesan akan semakin sulit untuk dipecahkan. Hasil dari penelitian ini dapat dijadikan sebagai tambahan pustaka mengenai kriptografi serta solusi bagi pihak yang menggunakan teknologi informasi dan komunikasi untuk dapat melakukan pengiriman pesan dengan aman.

Implementasi Algoritma A-Star dalam Menentukan Rute Terpendek Destinasi Wisata Kota Malang Riyan Fahmi Syihabuddin; Mohammad Nafie Jauhari; Muhammad Khudzaifah; Hisyam Fahmi
Jurnal Riset Mahasiswa Matematika Vol 1, No 5 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Traveling is one of the needs of everyone to relax the mind from the busyness that is lived every day. One of the cities in East Java which is a prima donna for traveling is Malang. The city has approximately 43 tourist destinations. Usually, tourists who want to visit not only one place, but several places. generate assistance in deciding which destinations to visit first in order for their trip to be effective. The shortest search process in this study uses the A-Star Algorithm, one of the BFS algorithms which in the process really considers the heuristic value. The process of testing the shortest route is done by selecting a starting point, then selecting several tourist locations. Next, the shortest route will be searched using the A-star algorithm at each destination, then which destination will be visited first. And so on until the final destination. The effectiveness of the route which involves comparison with the route presented by google maps. Based on the results of 30 experiments on several comprehensive destinations, it was found that the average route search using the A-Star algorithm was 44.17% shorter than that presented on google maps. This is due to the uniqueness of the algorithm in which there is a heuristic value and selection for each destination so as to make the route more effective.

Implementasi Fungsi Hash MD5 dan Kriptografi Algoritma RSA pada Pembuatan Tanda Tangan Digital Annisa Hardiningsih HR; Muhammad Khudzaifah; M. Nafie Jauhari
Jurnal Riset Mahasiswa Matematika Vol 1, No 2 (2021): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Pada penelitian ini dibahas penerapan tanda tangan digital sebagai bentuk penjagaan keontentikan suatu dokumen elektronik yang dibuat dengan menggabungkan dua algoritma, yaitu fungsi hash MD5 (Message Digest 5) dan RSA (Rivest Shamir Adleman). Isi dokumen elektronik diberikan fungsi hash MD5 sehingga menghasilkan message digest. Selanjutnya message digest akan dienkripsikan menggunakan algoritma kriptografi RSA sehingga menghasilkan tanda tangan digital. Hasil pengujian menunjukkan bahwa tanda tangan digital yang dihasilkan adalah berbeda-beda dari setiap dokumen elektronik. Dokumen elektronik yang menghasilkan nilai dekripsi tanda tangan digital dan message digest modulo yang sama menunjukkan bahwa dokumen elektronik tidak mengalami perubahan pada isinya. Sebaliknya, dokumen elektronik yang tidak menghasilkan nilai dekripsi dan tanda tangan digital dan message digest modulo yang sama menunjukkan bahwa dokumen elektronik telah mengalami perubahan pada isinya.

Implementasi Backpropagation Neural Network pada Prediksi Jumlah Penjualan Toyota Avanza di Indonesia Nur Fatin Mufinnun; Hairur Rahman; Mohammad Nafie Jauhari
Jurnal Riset Mahasiswa Matematika Vol 1, No 6 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Prediction is a branch of science that is used to predict events that may occur in the future based on past events. One of the developed prediction methods, Backpropagation Neural Network, a method that has a good level of effectiveness. This study aims to determine the model and the accuracy of the model in predicting the total sales of the Toyota Avanza and to find out the results of sales predictions for the next 12 months by analyzing the number of sales in January 2010 to October 2021. The prediction model for the number of Toyota Avanza sales using the Backpropagation Neural Network is 12-13-1, where there are 12 variables in the input layer, 13 variables in the hidden layer and 1 variable in the output layer with a learning rate value of 0.5 and momentum 0. The predictions for the number of Toyota Avanza sales for 12 months are at an average upper limit of 6215 and an average lower limit of 3415 with a MAPE value of 9,39135%, so that the model can be said to be very good.

Bilangan Kromatik Titik dari Dual Graf Berlian Nurul Hafidhoh Anwar; Mohammad Nafie Jauhari; Dewi Ismiarti
Jurnal Riset Mahasiswa Matematika Vol 1, No 6 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

A vertex coloring of a graph , is an assigments of colors to the vertices of , such that no two adjacent vertices are assigned the same color. The least number of colors needed for an vertices coloring of a graph is the chromatic number, denoted by . A graph is said to be planar if it can be drawn in the plane so that no edges crossing except at endpoints. A dual graph is constructed from the planar graph. Each region in planar graph can be represented by a vertex of the dual graph. Two vertices are connected if the region represented by these vertices are neugbours and have a common border. A diamond graph denoted by , can be used to model structure networks. In this study, it is shown that the chromatic number of dual diamond graph is χ(〖Br_n〗^* )={█(3,n=2 and n≥4@4,n=3.)┤

Implementasi Algoritma Floyd Warshall dalam Pencarian Rute Terpendek Lokasi Tower Base Transceiver Station (BTS) pada PT Citra Akses Indonusa Bella Nafa Savitri; Mohammad Nafie Jauhari; Evawati Alisah; Hisyam Fahmi
Jurnal Riset Mahasiswa Matematika Vol 2, No 4 (2023): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v2i4.16811

PT Citra Akes Indonusa is a company that operates on the expertise of information technology services in Banten Province. One of the services provided by the company requires the construction of a Base Transceiver Station (BTS) tower. The tower requires maintenance if there is damage to the network signal. As a result, the shortest route is needed to make it easier for employees to reach the tower location to be more effective. There are eight BTS tower locations in Tangerang Regency and three BTS tower locations in Tangerang City. The process of finding the shortest route in this study uses the Floyd Warshall algorithm, which is unique in finding the shortest route by comparing each edge of all edges that are passed. The process of testing the shortest route is done by selecting the starting point, then selecting several BTS tower locations. Next, the shortest route will be searched using the Floyd Warshall algorithm from each point of destination for the BTS tower location, then the BTS tower location will be selected first and so on until the last destination. The effectiveness of this shortest route search involves a comparison of the routes presented by Google Maps. Based on the results of 30 randomized trials on BTS tower locations, the average shortest route effectiveness was 25.54% compared to the route generated by Google Maps. This is due to the selection at each BTS tower destination location so as to make the route more effective.

Penerapan Metode Fuzzy Simple Additive Weigting Pada Interpretasi Hasil Penilaian Promosi Jabatan Pegawai Negeri Sipil Tre Hayu Ria Reta; Evawati Alisah; Mohammad Nafie Jauhari
Jurnal Riset Mahasiswa Matematika Vol 2, No 5 (2023): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v2i5.22004

The Fuzzy Simple Additive Weighting (FSAW) method is a mechanism that can be used to support decision making. This method was chosen because a ranking process was carried out to determine the weight value of each attribute, which would select employees who were worthy of occupying the promoted position. This study aims to determine the results of the application of the FSAW method in the assessment of civil servant promotion at the Malang City Education and Culture Office to increase objectivity and fairness in the assessment of employee promotion. Some problems that often occur in employee evaluation are the employee evaluation process which is still conventional so that it is less effective in calculation. The solution to overcome this problem is to use a Fuzzy Multi Attribute Decision Making (FMADM) decision support system with the FSAW method. This method requires a process to normalize the decision matrix (X) against a scale that can be compared with all available alternative values. After each attribute has been determined its weight value, the ranking process is used to select the best alternative for this study. The criteria used in this decision support system are SKP score, length of service, class, and education. The membership function used is the Triangular Fuzzy Number (TFN) representation. The results of the ranking calculation or the best value show the highest value, namely 1 from alternative 1 (employee 1) who is entitled to a promotion. It is expected that by using the FSAW method, the task of selectors will be able to more quickly and precisely identify employees who are worthy of occupying positions promoted based on the desired conditions.

Implementasi Fuzzy Associative Memory (FAM) untuk Mengestimasi Curah Hujan di Kota Malang Lestari, Qhonita Guruh Dwi; Jauhari, Mohammad Nafie
Jurnal Riset Mahasiswa Matematika Vol 3, No 3 (2024): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v3i3.23302

The Fuzzy Associative Memory (FAM) method is a combination of fuzzy logic and artificial neural networks. The combination of fuzzy logic and artificial neural networks in FAM has the advantage of applying human expertise, tolerant of errors, and can be applied in the real world. This study aims to determine the accuracy of the results of the implementation of the FAM method in estimating rainfall in Malang City. The problem that occurs is that the results of rainfall estimates are different from reality. Therefore, it is necessary to have a planning tool that can estimate rainfall for a particular location and time. The solution to overcome these problems is to use a combination of fuzzy logic and artificial neural networks, namely FAM. This method requires a process to determine the membership function. After the membership function is formed, input matrix and output matrix are formed where the elements of the matrix are the membership degree of the input variable for input matrix and the membership degree of the output variable for output matrix . After that, to form a FAM system, it is necessary to invert the input A and output B matrices. So, the number of system FAM rules is as much as the data used. Then data testing is carried out on the system FAM rules obtained and the maximum value in the new matrix B is the best solution. The variables used in this study are temperature, humidity, air pressure, and wind speed. The results of the rainfall forecast using FAM have a large MAPE percentage error of 15% which means the forecasting results are good. It is expected that using the FAM method can estimate rainfall sometime in the future.

Penyandian Super Enkripsi Menggunakan Columnar Transposition dan Modifikasi Hill Cipher dengan Invers Kiri Matriks Persegi Panjang Wahyuni, Fika; Khudzaifah, Muhammad; Jauhari, Muhammad Nafie
Jurnal Riset Mahasiswa Matematika Vol 1, No 2 (2021): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v1i2.14224

Pada penelitian ini, digunakan algoritma columnar transposition sebagai metode transposisi dan modifikasi algoritma hill cipher dengan invers kiri matriks persegi panjang sebagai metode substitusi. Penyandian pesan menggunakan metode super enkripsi dengan algoritma columnar transposition dan modifikasi algoritma hill cipher dengan invers kiri matriks persegi panjang menghasilkan pesan akhir yang tidak mengubah, menambah maupun mengurangi pesan awal, sehingga dapat di implementasikan pada pesan dengan baik. Penyandian ini melipat gandakan keamanan suatu pesan, dimana keamanan pertama terletak pada enkripsi pesan dengan columnar transposition dan keamanan yang kedua terletak pada algoritma hill cipher yang telah dimodifikasi, sehingga membuat pesan akan semakin sulit untuk dipecahkan. Hasil dari penelitian ini dapat dijadikan sebagai tambahan pustaka mengenai kriptografi serta solusi bagi pihak yang menggunakan teknologi informasi dan komunikasi untuk dapat melakukan pengiriman pesan dengan aman.

Implementasi Algoritma A-Star dalam Menentukan Rute Terpendek Destinasi Wisata Kota Malang Syihabuddin, Riyan Fahmi; Jauhari, Mohammad Nafie; Khudzaifah, Muhammad; Fahmi, Hisyam
Jurnal Riset Mahasiswa Matematika Vol 1, No 5 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v1i5.14497

Traveling is one of the needs of everyone to relax the mind from the busyness that is lived every day. One of the cities in East Java which is a prima donna for traveling is Malang. The city has approximately 43 tourist destinations. Usually, tourists who want to visit not only one place, but several places. generate assistance in deciding which destinations to visit first in order for their trip to be effective. The shortest search process in this study uses the A-Star Algorithm, one of the BFS algorithms which in the process really considers the heuristic value. The process of testing the shortest route is done by selecting a starting point, then selecting several tourist locations. Next, the shortest route will be searched using the A-star algorithm at each destination, then which destination will be visited first. And so on until the final destination. The effectiveness of the route which involves comparison with the route presented by google maps. Based on the results of 30 experiments on several comprehensive destinations, it was found that the average route search using the A-Star algorithm was 44.17% shorter than that presented on google maps. This is due to the uniqueness of the algorithm in which there is a heuristic value and selection for each destination so as to make the route more effective.

Title

Found 25 Documents
Search
Journal : Jurnal Riset Mahasiswa Matematika

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 25 Documents Search Journal : Jurnal Riset Mahasiswa Matematika

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 25 Documents
Search
Journal : Jurnal Riset Mahasiswa Matematika