Article Per Year (5 Year)
p-Index From 2020 - 2025
3.057
P-Index
This Author published in this journals
All Journal M A T H L I N E : Jurnal Matematika dan Pendidikan Matematika JURNAL Al-AZHAR INDONESIA SERI SAINS DAN TEKNOLOGI IJAIT (International Journal of Applied Information Technology) Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP) Majalah Ilmiah Matematika dan Statistika (MIMS) Operations Research: International Conference Series International Journal of Quantitative Research and Modeling Jurnal Matematika Integratif AMMA : Jurnal Pengabdian Masyarakat
Siti Rahmah Nurshiami, Siti Rahmah
Jurusan Matematika FMIPA Universitas Jenderal Soedirman
Humanities Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Engineering Environmental Science Industrial & Manufacturing Engineering Law, Crime, Criminology & Criminal Justice Materials Science & Nanotechnology Mathematics Mechanical Engineering Nursing Physics Public Health Transportation

Published : 27 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 27 Documents
Search

 1   2   3 
KOMPUTASI ENKRIPSI DAN DEKRIPSI MENGGUNAKAN ALGORITMA HILL CIPHER Wardhani, Rara; Nurshiami, Siti Rahmah; Larasati, Niken
Jurnal Ilmiah Matematika dan Pendidikan Matematika Vol 14 No 1 (2022): Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Publisher : Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2022.14.1.5727

Abstract

ABSTRACT. The Hill Cipher algorithm is one of the symmetric cryptographic algorithms that can be used to encrypt and decrypt. The Hill Cipher algorithm is one of the best cryptographic algorithms because it uses modulo and matrix operations. This study discusses encryption and decryption programs using the Hill Cipher Algorithm with the Java programming language. The resulting program is capable of encrypting and decrypting with key 2×2, 3×3, and 4×4.Keywords: Hill Cipher, cryptography, encryption, decryption. ABSTRAK. Algoritma Hill Cipher merupakan salah satu algoritma kriptografi simetris yang dapat digunakan untuk mengenkripsi dan mendekripsi. Algoritma Hill Cipher merupakan salah satu dari algoritma kriptografi yang cukup baik karena menggunakan modulo dan operasi matriks. Penelitian ini membahas program enkripsi dan dekripsi menggunakan Algoritma Hill Cipher dengan bahasa pemrograman Java. Program yang dihasilkan mampu mengenkripsi dan mendekripsi dengan ordo kunci 2×2, 3×3, dan 4×4.Kata kunci: Hill Cipher, kriptografi, enkripsi, dekripsi.
IMPLEMENTASI K-MEANS CLUSTERING DALAM PENGELOMPOKAN KABUPATEN/KOTA DI EKS-KERESIDENAN PEKALONGAN BERDASARKAN VOLUME CAPAIAN TRANSAKSI QRIS MERCHANT Nur Istiqomah, Vina Helmi; Nurshiami, Siti Rahmah; Marulitua Purba, Hotasi Doli
Jurnal Ilmiah Matematika dan Pendidikan Matematika Vol 16 No 1 (2024): Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Publisher : Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2024.16.1.11633

Abstract

ABSTRACT. Technology advances have changed how Indonesia's finances and payment systems are managed. This is supported by the accelerated digitalization of regional financial transactions promoted by the government. UMKM is the largest economic entity group supporting Indonesia's economic activities. The introduction of QRIS for UMKM under the regional digitization program will further digitize transactions. However, according to Bank Indonesia data, the use of QRIS as a form of regional digitalization is not evenly distributed across different regions. Therefore, to provide a fair opportunity for QRIS usage among merchants in each district/city, district/city data based on QRIS transaction volume achieved by merchants using clustering techniques can be used to be grouped into clusters. Clustering techniques can be performed using the K-means method. In this report, clusters are categorized into two characteristics. Cluster 1 has six members with a high average number of transactions in the former Pekalongan residential area, and Cluster 2 has one with a low average number of transactions.Keywords: K-Means Clustering, Merchant, QRIS, Financial Transactions. ABSTRAK. Kemajuan teknologi telah mengubah cara mengelola keuangan dan sistem pembayaran di Indonesia. Hal ini didukung dengan adanya percepatan implementasi digitalisasi transaksi keuangan daerah yang dicanangkan oleh pemerintah. UMKM menjadi kelompok pelaku ekonomi terbesar yang menyokong aktivitas perekonomian Indonesia. Digitalisasi transaksi juga terus didorong dengan diperkenalkannya QRIS pada UMKM dalam program elektronifikasi daerah. Namun, berdasarkan data Bank Indonesia penggunaan QRIS sebagai salah satu bentuk elektronifikasi daerah belum merata di berbagai daerah. Oleh karena itu, pengelompokan dalam cluster menggunakan data kabupaten/kota berdasarkan volume capaian transaksi QRIS pada merchant dengan teknik clustering diperlukan untuk melihat peluang pemerataan penggunaan QRIS pada merchant yang ada di masing-masing kabupaten/kota. Teknik clustering dapat dilakukan dengan metode K-means. Pada laporan ini cluster dibagi menjadi dua dengan karakteristik masing-masing, yaitu cluster 1 memiliki enam anggota dengan transaksi rata-rata tinggi dan cluster 2 memiliki satu anggota dengan transaksi rata-rata rendah di daerah eks-Keresidenan Pekalongan.Kata Kunci: K-Means Clustering, Merchant, QRIS, Transaksi Keuangan.
Spektrum Laplace pada graf kincir angin berarah (Q_k^3) Amaliyanah, Melly; Nurshiami, Siti Rahmah; Triyani, Triyani
Majalah Ilmiah Matematika dan Statistika Vol 22 No 2 (2022): Majalah Ilmiah Matematika dan Statistika
Publisher : Jurusan Matematika FMIPA Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/mims.v22i2.31128

Abstract

Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements are µ0, µ1, …, µn-1 for the first row, and m(µ0), m(µ1), …, m(µn-1) for the second row. In this paper, we will discuss Laplacian spectrum of the directed windmill graph () with k ≥ 1. The determination of the Laplacian spectrum in this study is to determine the characteristic polynomial of the Laplacian matrix from the directed windmill graph () with k ≥ 1. Keywords: Characteristic polynomial, directed windmill graph, Laplacian matrix, Laplacian spectrum.MSC2020 :05C50
Application of Failure Mode and Effect Analysis and Fault Tree Analysis in Determining Prevention Efforts Failure of The Fire Extinguishing Process Melinda, Jessy; Nurshiami, Siti Rahmah; Triyani, Triyani
Mathline : Jurnal Matematika dan Pendidikan Matematika Vol. 8 No. 3 (2023): Mathline: Jurnal Matematika dan Pendidikan Matematika
Publisher : Universitas Wiralodra

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31943/mathline.v8i3.394

Abstract

Banyumas is one of the regencies that still experiences frequent fires. The fire caused physical or material losses. To minimize fire losses, many efforts can be made to prevent the occurrence of these potential causes, which are the cause of the failure of the firefighting process. This study aims to implement the Failure Mode and Effect Analysis (FMEA) and Fault Tree Analysis (FTA) methods in determining efforts to prevent fire suppression failures. The result of the FMEA is Risk Priority Number (RPN) values to assess critical potential causes that need to be analyzed using FTA. In this research, there are ten important causes of potential, namely burned assets, difficult assets to save, victims panicking, witnesses/owners were not present, officers slipping, water sources being far from the location, victims being rescued too late, victims being trapped, officers being hit by debris, and officers inhaled excess smoke (congested). The result FTA obtained eleven minimum cut sets, which can fail the firefighting process in the Banyumas Regency, namely lack of awareness from related agencies, the protection system is not up to the firefighting standard and lack of maintenance of the fire protection system, lack of knowledge about how to evacuate yourself, the water source is far from the location, the owner does not live in the place (location), the victim has responsibility for the assets saved, high-priority asset value, a witness has not reported because the incident is considered to be handled by the residents, fire smoke is thick and firefighters not using self-contained breathing apparatus (SCBA).
Implementation of Back Tracking Algorithm in The Scheduling of Mathematics Study Program Faculty of MIPA Unsoed Amariesta, Tiara; Wardani, Amelia Kusuma; Adila, Raisa Naura; Nurshiami, Siti Rahmah
Operations Research: International Conference Series Vol. 3 No. 3 (2022): Operations Research International Conference Series (ORICS), September 2022
Publisher : Indonesian Operations Research Association (IORA)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47194/orics.v3i3.129

Abstract

The complicated case of scheduling courses at the Mathematics and Natural Sciences Faculty of Mathematics Study Program, Universitas Jenderal Soedirman, is a topic that is quite interesting to discuss and find a solution to using a mathematical method. In fact, manual course scheduling without a method is prone to scheduling errors such as class schedule clashes, clashes in the use of lecture rooms and so on, so a more efficient method of scheduling courses is needed. Scheduling lectures with the backtracking algorithm is a systematic and efficient method of scheduling lectures with influencing factors such as the number of courses, number of sessions, number of rooms, and lecture time. Algorithm backtracking is an algorithm based on Depth First Search to find solutions to problems more efficiently. The back tracking algorithm performs a systematic search for solutions to all possible solutions at each node based on recursive Depth First Search. Depth First Search is a search method that is carried out at one node in each level from the far left. If a solution has not been found, then the search continues on the right hand node. And so on until a solution is found or if you find a dead end it will backtrack to the previous position. If a solution is found, the search will stop even if there are nodes that have not been traced. The implementation of the backtracking algorithm pays close attention to the factors that become obstacles in scheduling courses. The course schedule function with the backtracking algorithm can meet every influencing factor such as the number of courses, rooms, classes, and lecture time so that scheduling lectures with this method is very helpful because the method used is more efficient and can avoid errors in scheduling.
PENCARIAN RUTE OPTIMAL TRAVELING SALESMAN PROBLEM DENGAN ALGORITMA ANT COLONY OPTIMIZATION (ACO) Nuraliya, Aliffia Yasya; Nurshiami, Siti Rahmah; Jajang, Jajang
Jurnal Ilmiah Matematika dan Pendidikan Matematika Vol 17 No 1 (2025): Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Publisher : Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2025.17.1.15866

Abstract

The implementation of product distribution requires transportation to deliver products effectively across various locations. Challenges encountered during this process include varying distribution sites, travel distances, time taken for product delivery, transportation costs, and other related factors. To address these challenges, selecting an efficient travel route is crucial. The Traveling Salesman Problem (TSP) serves as a practical application of graph theory in tackling such distribution issues. The Ant Colony Optimization (ACO) algorithm emerges as a viable solution for route optimization, particularly in addressing TSP challenges to derive optimal routes. Results derived from the TSP calculations utilizing ACO, executed through the Matlab R2018a application, employed parameters of
Implementation of Dynamic Programming Algorithm on The Integer Knapsack Problem (0/1) (Case Study: J&T Cargo Agent Purwokerto) Puspitasari, Leni; Sugandha, Agus; Nurshiami, Siti Rahmah
International Journal of Quantitative Research and Modeling Vol. 6 No. 3 (2025): International Journal of Quantitative Research and Modeling (IJQRM)
Publisher : Research Collaboration Community (RCC)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46336/ijqrm.v6i3.1077

Abstract

The pu IDR ose of this research is to solve the 0/1 integer knapsack problem, which is a problem of selecting items from a number of available items where each item has different weights and profits. The delivery of items at J&T Cargo Purwokerto is one of many item selection problems. The delivery of items at J&T Cargo Purwokerto is carried out progressively with higher profit values ​​first, due to the delivery capacity being able to accommodate only 700 kg. In order for J&T Cargo Purwokerto to obtain maximum profit, item selection for delivery must be carried out first. The item selection at J&T Cargo Purwokerto can be solved using the 0/1 integer knapsack problem method with a forward recursive dynamic programming algorithm with the help of Matlab R2021A software. The results of the research indicate that on July 1, 2025, a maximum profit of IDR 3,038,850 was achieved with a weight of 700 kg. On 2nd July 2025, a maximum profit of IDR 4,884,985 was achieved with a weight of 700 kg. On 3rd July 2025, a maximum profit of IDR 7,732,155 was achieved with a weight of 699 kg.
Co-Authors Adila, Raisa Naura Agus Sugandha Alfatah Hidayat Amaliyanah, Melly Amariesta, Tiara Ari Fadli Ari Wardayani Ari Wardayani, Ari Dewi, Priska Sari Eko Murdyantoro Fajar Hoeruddin Hidayat, Alfatah Irham Taufiq Irham Taufiq, Irham Jajang Jajang Kana Hasmi Setiani Marulitua Purba, Hotasi Doli Mashuri Mashuri Mashuri Mashuri Melinda, Jessy Muhammad Okky Ibrohim Mutia Nur Estri Mutia Nur Estri Mutia Nur Estri Mutia Nur Estri, Mutia Nur Niken Larasati Noor Rahmah Sofiyati Nunung Nurhayati Nunung Nurhayati Nur Istiqomah, Vina Helmi Nuraliya, Aliffia Yasya Priska Sari Dewi Puspitasari, Leni Rara Wardhani Renny Renny Renny Rina Reorita Setiani, Kana Hasmi Sri Maryani Suroto Suroto Suroto Suroto Taryana, Acep Triyani Triyani Triyani Triyani Triyani Triyani Wardani, Amelia Kusuma Wardhani, Rara