cover
Contact Name
Juhari
Contact Email
juhari@uin-malang.ac.id
Phone
+6281336397956
Journal Mail Official
jrmm@uin-malang.ac.id
Editorial Address
Jalan Gajayana 50 Malang, Jawa Timur, Indonesia 65144 Faximile (+62) 341 558933
Location
Kota malang,
Jawa timur
INDONESIA
Jurnal Riset Mahasiswa Matematika
ISSN : 28081552     EISSN : 28084926     DOI : https://doi.org/10.18860/jrmm
Core Subject : Education,
Jurnal Riset Mahasiswa Matematika (JRMM) publishes current research articles in any area of Mathematics Research such as graph labelings, modeling, statistics, actuaria, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics. JRMM is published six times a year, namely in February, April, June, August, October, December JRMM is published by the Association of Indonesian Islamic Religious University Mathematics Lecturers and Department of Mathematics Universitas Islam Negeri Maulana Malik Ibrahim Malang (UIN Malang). All papers will be refereed in the normal manner of mathematical journals to maintain the high standards. JRMM is an open access journal. Full-text access to all papers is available for free. Jurnal Riset Mahasiswa Matematika (JRMM) has been indexed by Google Scholar
Articles 180 Documents
Analisis Dinamik Model Matematika Penyebaran COVID-19 Pada Populasi SEIR Meyliana, Ester; Kusumastuti, Ari; Juhari, Juhari
Jurnal Riset Mahasiswa Matematika Vol 1, No 4 (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.v1i4.14458

Abstract

This study discusses the dynamic analysis of the mathematical model of the spread of COVID-19 using daily cases in Indonesia which are classified into four variables, namely, Susceptible (S), Exposed (E), Infected (I), and Recovered (R) which are then analyzed dynamically by calculate the equilibrium point and look for stability properties. The two equilibrium points of this model are the disease-free equilibrium point  and the endemic equilibrium point . Then, it is linearized around the equilibrium point using the given parameters. Linearization around the equilibrium point  produces four eigenvalues, one of which is positive. Linearization around the equilibrium point  yields two negative real eigenvalues and a pair of complex eigenvalues with negative real parts. Phase portraits and numerical simulations have shown that all variables S, E, I, and R will be asymptotically stable locally towards the equilibrium point, namely the endemic equilibrium point . Thus, based on the dynamic analysis obtained, it is shown that the disease-free equilibrium point  is unstable and the endemic equilibrium point is locally asymptotically stable.
Implementasi Algoritma Floyd Warshall dalam Pencarian Rute Terpendek Lokasi Tower Base Transceiver Station (BTS) pada PT Citra Akses Indonusa Savitri, Bella Nafa; Jauhari, Mohammad Nafie; Alisah, Evawati; Fahmi, Hisyam
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

Abstract

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.
Struktur Dan Sifat-sifat K-Aljabar Ainur Isa, Rafi; Alisah, Evawati
Jurnal Riset Mahasiswa Matematika Vol 3, No 4 (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.v3i4.27187

Abstract

K-Algebra is constructed on a group using binary operations ⊙ on (G,*), so for each x,y∈G defined as x⊙y=x*y^(-1)=xy^(-1) with certain axioms on K-Algebra. K-Group summation is defined as the elements of K that operate summation in K, similar to addition in K itself. Meanwhile, the K-Ring has two basic operations, namely addition and multiplication, both of which must satisfy certain properties and use the K-Field as a scalar field. Finally, the K-Field is described as a special K-Algebra structure in which the multiplication operation is distributive to the addition operation. This research contributes to a deeper understanding of structures and operations in K-Algebra. The next research is that K-Algebra can be applied in sets meaning that it can be applied to sets of numbers, dihedral, and modulo or congruence, which are equipped with theorems, proofs, and examples.
Enkripsi dan Dekripsi Pesan Menggunakan Metode Vigenere Cipher dan Route Cipher Aufia, Zulfatul; Turmudi, Turmudi; Alisah, Evawati
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.14207

Abstract

Kriptografi merupakan ilmu yang mempelajari tentang cara menjaga kerahasiaan pesan. Terdapat dua proses dalam kriptografi yaitu enkripsi dan dekripsi. Enkripsi yaitu merubah pesan asli (plainteks) menjadi pesan acak (cipherteks). Dekripsi merupakan proses merubah pesan acak menjadi pesan asli. Penelitian ini menggunakan metode super enkripsi yang mana merupakan gabungan dari dua metode yang terdiri dari metode subtitusi dan metode transposisi. Metode subtitusi yang digunakan adalah vigenere cipher dan metode transposisi yang digunakan adalah route cipher. Terdapat tiga variasi kunci dari metode vigenere cipher yaitu, full vigenere cipher, auto-key vigenere cipher dan running-key vigenere cipher. Adapun tujuan dari penelitian ini yaitu untuk mengetahui proses beserta hasil dari enkripsi dan dekripsi menggunakan super enkripsi dengan metode vigenere cipher dan route cipher. Adapun proses enkripsi adalah dengan mengenkripsi menggunakan metode vigenere cipher dan selanjutnya dienkripsi lagi menggunakan metode route cipher.  Metode vigenere cipher terdiri dari tiga variasi, sehingga setiap variasinya dienkripsi satu persatu yang kemudian dienkripsi lagi dengan metode route cipher. Adapun proses dekripsi adalah dengan mendekripsi menggunakan metode route cipher dan dilanjut dengan metode vigenere cipher. Hasil dari penelitian ini yaitu didapatkannya cipherteks pada proses enkripsi dan plainteks pada proses dekripsi yang menggunakan metode vigenere cipher dengan 3 variasi dan metode route cipher.
Membangun Super Enkripsi untuk Mengamankan Pesan Agustina, Laura; Sujarwo, Imam; Khudzaifah, Muhammad
Jurnal Riset Mahasiswa Matematika Vol 2, No 3 (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.v2i3.16335

Abstract

The issue of message security or an information is very important. A science that studies about securing the confidentiality of messages using passwords is called cryptography. To enhance security, two algorithms are combined to secure messages. Super encryption is a concept that uses a combination of two or more substitution and permutation (transposition) cryptography techniques to obtain an algorithm that is more difficult to crack. The first thing to do is to encrypt the message using a substitution technique (Cipher Substitution), then re-encrypt it using a permutation technique (Cipher Transposition). In this study, two cryptographic algorithms will be combined to build super encryption using the Vigenere Cipher and Bifid Cipher algorithms to secure messages. The message encryption process is using the Vigenere Cipher algorithm for the first encryption process, then continued using the Bifid Cipher algorithm for the second encryption process. The encryption process is done the other way around, starting from the back of the encryption process. The combination of these two algorithms results in more secure message security.
Metode AHP-Fuzzy untuk Menentukan Tingkat Prioritas Tindak Pidana Penyalahgunaan Narkotika dan Psikotropika Muzafanti, Rahmah Navi'ah; Alisah, Evawati; Rozi, Fachrur
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.22596

Abstract

Analytical Hierarchy Process (AHP) is a method in decision making by analyzing multi-attribute decisions with many criteria and alternatives. these weaknesses, then the incorporation of fuzzy concepts is carried out, because there is a range of values that can cover the uncertainty of decision making in AHP. The merger of the two concepts is known as Analytical Hierarchy Process-Fuzzy or AHP-Fuzzy. The AHP-Fuzzy method uses an extended analysis with a triangular fuzzy membership function or TFN. Meanwhile, there is data on narcotics and psychotropic crimes. The data contains the indictment of each defendant containing the articles violated, prison sentences, and fines. Because it fulfills the AHP-Fuzzy method by having the main criteria. The author takes the formulation of the problem, namely the AHP-Fuzzy method to determine the priority level of criminal acts of narcotics and psychotropic abuse. This research aims to find out how the role of the AHP-Fuzzy method in criminal case data. The adjustment of the method when processing criminal offense data, producing the final result is at the stage of determining the crisp value and weighting. Before entering the crisp value determination stage, first determine the variables and the range of values that adjust the data conditions. Then, the weighting stage contains the results of the multiplication between AHP priority weights and weight vectors in fuzzy concepts. Thus, each of the main criteria has a different percentage priority level. The highest priority level is article 114, followed by article 112, article 111, and article 127. This priority level information can be used as a reference in preventing the spread of narcotics and psychotropic drugs, especially in Malang City.
Simulasi Numerik Model Matematika Vibrasi Dawai Flying Fox Menggunakan Metode Adams-Bashforth-Moulton Utami, Febry Noorfitriana; Kusumastuti, Ari; Juhari, Juhari
Jurnal Riset Mahasiswa Matematika Vol 2, No 1 (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.v2i1.14512

Abstract

This study discusses numerical simulation using the Adams-Bashforth-Moulton (ABM) method of order 4 in the flying fox string mathematical model which is in the form of ordinary differential equations depending on time, consisting of two equations, namely the equation of the flying fox string y(t) and the angular equation of the flying fox string θ(t). This mathematical model is a model that has been constructed by Kusumastuti, et al (2017) and has been validated by comparing analytical solutions to its numerical solutions by Sari (2018). The analysis of the behavior of the Kusumastuti 2017 model conducted by Makfiroh (2020) shows that the phase portrait graph is in the form of a spiral with eigenvectors pointing towards the equilibrium point so that the mathematical model of the flying fox string vibration can be concluded as a valid mathematical model that is close to the actual situation. This study attempts to determine the numerical simulation of the deflection of the flying fox string y(t) and the numerical simulation of the angle of the flying fox string θ(t). The Runge-Kutta method of order 4 was used to generate 3 initial values for order 4 ABM. Next, a comparison of the y(t) and θ(t) solution graphs of order 4 ABM with the solution graph with Runge-Kutta of order 4 was performed in Sari 2018. The first simulation was carried out when h=1, the difference in the value of y(t) of order 4 ABM and Runge-Kutta order 4 fluctuated in the range of [0,0.09] with almost the same graphic profile, and the difference in the value of θ(t) ABM of order 4, and Runge-Kuta order 4 which is quite large with different graphic profiles. The second simulation was carried out when h=0.01, the difference in the value of y(t) of order 4 ABM and Runge-Kutta order 4 was fluctuating which also ranged from [0.0.09] with the same graphic profile, and the difference in the values of θ(t) ABM of order 4 and Runge -Kutta order 4 fluctuates in the range of [0,1] with the same graphic profile. So concluded that when h=0.01 comparison of ABM of order 4 and Runge-Kutta of order 4 is the best for displaying the graph profiles of y(t) and θ(t). Further research can explore numerical solutions using other methods.
Penggabungan Algoritma Hill Cipher dan ElGamal untuk Mengamankan Pesan teks Fadlilah, Siti Nur; Turmudi, Turmudi; Khudzaifah, Muhammad
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.14496

Abstract

Hill Cipher is a one of the symmetric key cryptography algorithm that using an invertible matrix with an order n×n as a key to encrypt and decrypt plaintext. Meanwhile, ElGamal is other asymmetric key cryptography algorithm that use the complexity of discrete logarithms in the encryption and decryption process. In this study, the authors are interest in combine the Hill Cipher and ElGamal algorithms to secure text messages. The author use the matrix as a symmetric key and converts the plaintext in the table of ASCII 256. Then encrypt using the Hill Cipher algorithm which results the ciphertext from messages and ElGamal algorithm results the ciphertext of the symmetric key. In processing decryption using the ElGamal algorithm to determine the symmetric key that will be used as a key in the decryption process with the Hill Cipher algorithm so that the original plaintext is obtained. Then the results obtained are that the combination of the Hill Cipher and ElGamal algorithms to secure text messages can be done it well.
Penerapan Algoritma Floyd-Warshall pada Jalur Evakuasi Korban Kecelakaan di Boyolali Sari, Fitri Nofita; Juhari, Juhari; Herawati, erna
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.22006

Abstract

The Floyd-Warshall algorithm is one of the algorithms that can be used to solve the shoetest route problem and is the easiests to apply because it can find all the shortest routes between each possible pair of position and is part of a dynamic program that is very efficient in solving optimal route promblems. The Floyd-Warshall algorithm works by comparing each possible path on the graph for each node pair and checking the resulting node combination. The problem of the shortest route in daily life is the evacuation of victims of traffic accidents in Boyolali, Central Java. For evacuation to be more effective, a nearby route to the nearest hospital is needed. Based on the results of the research that has been done, it can be concluded that the study produced reference matrix in the form of the shortest trajectory used to determine the shortest route to nearest hospital in Boyolali, Central Java.
Syarat Cukup Ketaksamaan Hӧlder dan Ketaksamaan Minkowski di Perumuman Ruang Morrey Ummah, Nahdliyatul; Rahman, Hairur; Ismiarti, Dewi
Jurnal Riset Mahasiswa Matematika Vol 1, No 3 (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.v1i3.14369

Abstract

The purpose of this research is to show the sufficient condition for Hӧlder inequality and Minkowski inequality in generalization of Morrey space and its weak space, namely generalization of weak Morrey space. This research focuses on the application of Hӧlder inequality and Minkowski inequality in generalization of Morrey space and generalization of weak Morrey space based on the characteristics of the two spaces in the set of n-dimensional real numbers.