Article Per Year (5 Year)
p-Index From 2020 - 2025
1.556
P-Index
This Author published in this journals
All Journal Explore: Jurnal Sistem Informasi dan Telematika (Telekomunikasi, Multimedia dan Informatika) Science and Technology Indonesia Jurnal Matematika: MANTIK Jurnal Pengabdian Kepada Masyarakat (JPKM) Tabikpun Jurnal Eurekamatika Jurnal Siger Matematika
Muslim Ansori
Universitas Lampung
Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Computer Science & IT Education Environmental Science Health Professions Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mathematics Physics Other

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

Found 8 Documents
Search

 1 
The Implementation of Rough Set on A Group Structure Ananto Adi Nugraha; Fitriani Fitriani; Muslim Ansori; Ahmad Faisol
Jurnal Matematika MANTIK Vol. 8 No. 1 (2022): April - June
Publisher : Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15642/mantik.2022.8.1.45-52

Abstract

Let be a non-empty set and an equivalence relation on . Then, is called an approximation space. The equivalence relation on forms disjoint equivalence classes. If , then we can form a lower approximation and an upper approximation of . If X⊆U, then we can form a lower approximation and an upper approximation of X. In this research, rough group and rough subgroups are constructed in the approximation space for commutative and non-commutative binary operations.
Penentuan Banyaknya Graf Tak Terhubung Berlabel Titik Berorde Tujuh Tanpa Loop Loop Karina Sylfia Dewi; Wamiliana Wamiliana; Muslim Ansori
Jurnal Siger Matematika Vol 2, No 2 (2021): Jurnal Siger Matematika
Publisher : FMIPA Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (398.491 KB) | DOI: 10.23960/jsm.v2i2.2931

Abstract

Graf G disebut graf terhubung jika untuk setiap dua titik yang berbeda di G, terdapat suatu path yang menghubungkan dua titik tersebut, jika tidak ada path yang menghubungannya maka disebut graf tidak terhubung. Graf berlabel adalah graf yang setiap titik atau garisnya diberi nilai atau label.  Suatu garis pada graf yang memiliki titik awal dan titik akhir sama disebut loop, sedangkan dua garis atau lebih disebut garis paralel jika dua garis tersebut menghubungkan dua titik yang sama. Jika diberikan n titik dan m garis maka banyak graf tak terhubung yang dapat dibentuk. Pada artikel ini telah diperoleh rumus untuk menentukan banyaknya graf tak terhubung berlabel titik berorde tujuh tanpa loop dengan m garis dan t garis yang menghubungkan pasangan titik yang berbeda dimana untuk garis-garis yang menghubungkan pasangan titik yang sama dihitung satu.
Peningkatan Kompetensi Guru Matematika dan Pemahaman Siswa SMPN 1 Baradatu dalam Penguasaan Materi Olimpiade Matematika Muslim Ansori; Wamiliana; Amanto; Siti Laelatul Chasanah
Jurnal Pengabdian Kepada Masyarakat (JPKM) TABIKPUN Vol. 3 No. 3 (2022)
Publisher : Faculty of Mathematics and Natural Sciences - Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/jpkmt.v3i3.90

Abstract

Olimpiade matematika menjadi topik yang hangat dibicarakan oleh kalangan siswa maupun pendidik mulai tahun 2003. Akan tetapi, kurangnya pengetahuan guru dan siswa mengenai soal olimpiade matematika mengakibatkan minimnya prestasi yang diperoleh siswa SMP Negeri 1 Baradatu. Kegiatan ini bertujuan untuk meningkatkan pemahaman serta kemampuan guru dan siswa di SMPN 1 Baradatu dalam penguasaan materi olimpiade matematika. Metode yang digunakan adalah metode ceramah, diskusi, dan simulasi. Kegiatan pembinaan berjalan dengan baik. Guru dan siswa antusias dalam memberikan pertanyaan saat diskusi. Kegiatan ini juga mampu meningkatkan kemampuan guru matematika dan siswa. Hal ini terlihat dari rata-rata peningkatan nilai post-test dibandingkan dengan nilai pretest yaitu sebesar 26,24% untuk guru dan 32,40% untuk siswa.
Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges Wamiliana Wamiliana; Amanto Amanto; Mustofa Usman; Muslim Ansori; Fadila Cahya Puri
Science and Technology Indonesia Vol. 5 No. 4 (2020): October
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (2285.683 KB) | DOI: 10.26554/sti.2020.5.4.131-135

Abstract

A Graph G (V, E) is said to be a connected graph if for every two vertices on the graph there exist at least a path connecting them, otherwise, the graph is disconnected. Two edges or more that connect the same pair of vertices are called parallel edges, and an edge that starts and ends at the same vertex is called a loop. A graph is called simple if it containing no loops nor parallel edges. Given n vertices and m edges, m ≥ 1, there are many graphs that can be formed, either connected or disconnected. In this research, we will discuss how to calculate the number of connected vertices labeled graphs of order six (isomorphism graphs are counted as one), with a maximum loop of ten without parallel edges.
Kinerja Naive Nayes Classifier Pada Penyaringan Short Message Service (SMS) Spam Putri Apricia; Khoirin Nisa; Netti Herawati; Muslim Ansori
Jurnal Siger Matematika Vol 4, No 2 (2023): Jurnal Siger Matematika
Publisher : FMIPA Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/jsm.v4i2.12541

Abstract

Currently short messages or known as SMS (short message service) is one of the communication media that is often used by some irresponsible people to commit criminal acts of fraud. This type of SMS that is abused is called spam. To overcome this problem, SMS operators need to filter the type of incoming SMS to clients using a classification algorithm. One of the classification methods that can be used is the Naïve Bayes method. The Naïve Bayes method is a classification method in machine learning that involves the concept of probability. This method is a simple Bayes algorithm model and it can be used to classify text or document data. In this paper the Naïve Bayes method is applied for SMS data classification analysis. This method is used to classify the type of SMS whether it is "spam" or not spam (called "ham"). Based on the results of the analysis by trying several proportions of the distribution of training data and testing data, the best accuracy results were obtained at 97% using a training-testing data ratio of 60: 40.
Penentuan Lintasan Terpendek Perjalanan Pengiriman Barang Menggunakan Algoritma Cheapest Insertion Heuristic (Studi Kasus PT. Indah Logistik Cargo Bandar Lampung) Ahya Shofa Ananda; Notiragayu Notiragayu; Wamiliana Wamiliana; Muslim Ansori
Jurnal EurekaMatika Vol 11, No 2 (2023): Jurnal Eurekamatika
Publisher : Universitas Pendidikan Indonesia (UPI)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17509/jem.v11i2.63723

Abstract

The growth in the number of online shop members has caused the value of e-commerce transactions in Indonesia to increase. This resulted in increased distribution of goods at PT. Indah Logistik Cargo. One of the constraints at PT. Indah Logistik Cargo is inefficient routes the distribution of packages. Distribution problem at this delivery service company include the Traveling Salesman Problem (TSP), which can be solved using the Cheapest Insertion Heuristic (CIH) algorithm. In this paper, the solution is carried out manually and also utilizes the Python programming language to optimize the delivery service travel path. Factual data owned by PT. Indah Logistik Cargo states that the total distance for delivering goods is 51.600 meters. Meanwhile, based on the results of manual calculations using the CIH algorithm, a total distance of 51.550 meters was obtained, which is smaller by a difference of 50 meters from the factual data. Furthermore, the results of calculations using the Python programming obtained 47.150 meters, or a difference of 4.450 meters. Therefore, the use of the CIH algorithm is proven to provide a path with a smaller total distance traveled.Keywords: CIH Algorithm, Goods Delivery, Shortest Path.AbstrakPeningkatan jumlah anggota online shop membuat nilai transaksi e-commerce di Indonesia mengalami kenaikan. Hal ini mengakibatkan meningkatnya pendistribusian barang pada PT. Indah Logistik Cargo. Kendala pada PT. Indah Logistik Cargo adalah keterlambatan penyaluran paket ke para konsumen akibat jalur lintasan yang tidak efisien. Permasalahan pendistribusian pada perusahaan jasa pengiriman ini termasuk permasalahan Travelling Salesman Problem (TSP) yang dapat diselesaikan menggunakan Algoritma Cheapest Insertion Heuristic (CIH). Pada tulisan ini, penyelesaian masalah tersebut dilakukan secara manual dan juga menggunakan bahasa pemrograman Python. Data faktual yang dimiliki PT. Indah Logistik Cargo bahwa total jarak pengiriman barang yaitu 51.600 meter. Sementara, berdasarkan hasil perhitungan dengan algoritma CIH secara manual diperoleh total jarak 51.550 meter, yang lebih kecil dengan selisih 50 meter dari data faktual. Sedangkan, hasil perhitungan dengan bahasa pemrograman Python diperoleh 47.150 meter, atau mempunyai selisih 4.450 meter. Oleh karena itu, penggunaan algoritma CIH terbukti memberikan lintasan dengan total jarak tempuh yang lebih kecil.
Pelatihan Penguasaan dan Pemahaman Materi Olimpiade Matematika Bagi Siswa dan Guru SMAN 13 Bandar Lampung Muslim Ansori; Wamiliana Wamiliana; Dina Eka Nurvazly; Siti Laelatul Chasanah
Jurnal Pengabdian Kepada Masyarakat (JPKM) TABIKPUN Vol. 4 No. 3 (2023)
Publisher : Faculty of Mathematics and Natural Sciences - Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/jpkmt.v4i3.126

Abstract

Untuk mencapai kesuksesan dalam kompetisi olimpiade matematika diperlukan bimbingan dan persiapan yang baik. Oleh karena itu, kegiatan pelatihan penguasaan dan pemahaman materi olimpiade matematika bagi siswa dan guru SMA Negeri 13 Bandar Lampung diinisiasi untuk memberikan dukungan kepada guru-guru matematika dan para siswa di SMA tersebut. Metode yang digunakan dalam kegiatan ini meliputi ceramah, tanya jawab, dan simulasi. Tujuan dari kegiatan ini adalah untuk menciptakan lingkungan pembelajaran yang lebih efektif di tingkat sekolah menengah atas, memotivasi siswa untuk aktif mengikuti pembinaan, dan membantu mereka memahami materi olimpiade matematika dengan lebih baik. Hasil evaluasi yang dilakukan dari kegiatan ini menyimpulkan bahwa  pemahaman dan keterampilan guru-guru meningkat dalam membimbing siswa untuk menghadapi olimpiade matematika, seperti terlihat dari hasil peningkatan nilai pada post-test para siswa.
The Comparison of Dijsktra’s Algorithm and Flyod Warshall’s Algorithm to Determine The Shortest Path of Traditional Markets in Bandar Lampung City Poetri Hana Nurhandayani; Wamiliana Wamiliana; Misgiyati Misgiyati; Notiragayu Notiragayu; Muslim Ansori
Explore: Jurnal Sistem Informasi dan Telematika (Telekomunikasi, Multimedia dan Informatika) Vol 15, No 1 (2024): Juni
Publisher : Universitas Bandar Lampung (UBL)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36448/jsit.v15i1.3714

Abstract

Determining the shortest path between one location to another location is one of the problems that usually has to be faced in daily life. The shortest path will affect the shorter time needed, less money used, and others. In this study, we will discuss the comparison of Dijsktra’s Algorithm and Floyd Warshal’s Algorithm to determine the shortest path of the biggest and the most famous traditional market in Bandar Lampung City, which is Bambu Kuning traditional market, to 26 other traditional markets in Bandar Lampung city. The Phyton programming language is used to implement both algorithms on the data of 27 traditional markets. The results show that both algorithms give the same solution. However, the processing time of Dijsktra’s Algorithm (0.1063 seconds) is faster than Floyd Warshal’s algorithm (0.1691 seconds)
Co-Authors . Wamiliana Ahmad Faisol Ahya Shofa Ananda Amanto Amanto Amanto Ananto Adi Nugraha Dina Eka Nurvazly Fadila Cahya Puri Fitriani Karina Sylfia Dewi Khoirin Nisa Misgiyati Misgiyati Mustofa Usman Netti Herawati Notiragayu Notiragayu Poetri Hana Nurhandayani Putri Apricia Siti Laelatul Chasanah