Claim Missing Document
Check
Articles

Found 27 Documents
Search

Alternative Strategies to Eradicate Corruption in Indonesia with Numerical Simulation of 4th Order Runge Kutta Method on Mathematical Models Rahmadi, Deddy; Rahayu, Pipit Pratiwi
Mathematical Journal of Modelling and Forecasting Vol. 2 No. 2 (2024): December 2024
Publisher : Universitas Negeri Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24036/mjmf.v2i2.31

Abstract

Corruption remains a critical issue hindering Indonesia's development across various sectors, necessitating innovative approaches to combat it. This study explores alternative strategies to eradicate corruption by leveraging mathematical modeling and numerical simulations. A dynamic system representing corruption propagation is formulated, considering key variables such as enforcement intensity, public awareness, and policy effectiveness. The 4th-order Runge Kutta method simulates the model and analyzes the impact of various strategic interventions over time. The results show that the difference in initial conditions significantly affects the level of corruption, which increases or decreases in a specific time. These findings provide valuable insights for policymakers and stakeholders in designing effective, data-driven anti-corruption strategies, emphasizing the integration of rigorous mathematical tools with socio-political frameworks. The study highlights the potential of numerical simulations as a complementary approach to traditional qualitative analyses in addressing complex societal challenges like corruption.
Optimalisasi Jaringan Jalan Antar Kecamatan dengan Minimum Spanning Tree dan Algoritma Prim di Kabupaten Ngawi Ahsanti, Amalia; Insyafilla, Asyanada; Fatimah, Nadhifa Nur; Wahyuni, Winda Cahya Dwi; Rahmadi, Deddy
Basis : Jurnal Ilmiah Matematika Vol. 4 No. 1 (2025): BASIS: Jurnal Ilmiah Matematika
Publisher : Universitas Mulawarman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30872/basis.v4i1.1451

Abstract

Penelitian ini mengoptimalkan jaringan jalan antar kecamatan di Kabupaten Ngawi dengan pendekatan Minimum Spanning Tree (MST) menggunakan Algoritma Prim untuk menentukan jalur terpendek. Jaringan jalan direpresentasikan sebagai graf berbobot, memungkinkan pemilihan jalur minimum tanpa siklus. Dengan menerapkan Algoritma Prim, diperoleh pohon merentang minimum dengan total jarak 146 km yang menghubungkan 19 kecamatan di kabupaten Ngawi secara efisien. Hasil penelitian menunjukkan bahwa pendekatan ini dapat menghasilkan rekomendasi optimalisasi jaringan transportasi yang lebih efisien. Implementasi MST berkontribusi pada penghematan biaya dan peningkatan aksesibilitas, mendukung distribusi barang dan layanan secara merata di Kabupaten Ngawi.
Optimasi Pemasangan Kabel Internet Antar Daerah Kabupaten Sleman Menggunakan Minimum Spanning Tree Deddy Rahmadi; Nabila Putri Maharani; Muhammad Rejaus Syifa; Sulthon Aqthoris Sama; Galih Fathurahman Ardiansyah
Journal of Mathematics Theory and Applications Vol. 2 No. 2 (2024): Edisi April 2024
Publisher : Program Studi Matematika, Universitas Timor

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32938/j-math.v2i2.6153

Abstract

Currently, many internet providers use various types of internet cables. Cable Internet uses cable network infrastructure from ISPs such as Biznet, First Media, or Indie Home, while other alternatives use cellular or satellite Internet. One of the advantages of Internet cables compared to these two alternatives is speed, especially fiber optic cables. However, one of the weaknesses of Internet cables is their high price. Therefore, to optimize the costs incurred, it is necessary to find the shortest route to reducing costs. Using the Kruskal algorithm method, the author determines a minimum route of 106 km.
Masalah Aliran Maksimum dalam Sebaran Jaringan Rute Trans Jogja dari Halte Rumah Sakit Bathesda ke Halte Malioboro 1 Deddy Rahmadi; Hakim Adidarma; Erika Putri; Ni'ma Ajrul Amilin; Dela Nuraini Safinka
Journal of Mathematics Theory and Applications Vol. 3 No. 2 (2025): Edisi April 2025
Publisher : Program Studi Matematika, Universitas Timor

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32938/j-math.v3i2.8862

Abstract

Yogyakarta is one of the cities with a fairly high level of transportation use. Transportation itself is one of the most important things in daily life. This study was conducted to identify the maximum flow based on graphs from the available data with several important stages in its completion. The research data used was in the form of the number of currents and capacities of the distribution of the trans Jogja network which had a route where the starting point was at the Bathesda hospital stop and the end point was located at the Malioboro one bus stop .
INOVASI ALAT FILTRASI LIMBAH BATIK: SOLUSI EFEKTIF UNTUK PENGELOLAAN LIMBAH CAIR RAMAH LINGKUNGAN Rahmadi, Deddy; Prasetyani, Elvira; Chaririyah,, Zakiyatul; Putri, Della Hidayana; Abdillah, Nafal Maulana; Najihan, Hizbullah; Camelia, Puspa; Pratiwi, Hanifa Ika Dian; Vanesia, Valentina Aprilia; Khasanah, Aulia Nur; Asiyam, Unzhurna; Hariyani, Febri Dwi; Styo, Anyelir Nurahmaida Nanda
Dharma Pengabdian Perguruan Tinggi (DEPATI) Vol 5 No 1 (2025): Mei 2025
Publisher : Fakultas Sains dan Teknik, Universitas Bangka Belitung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33019/depati.v5i1.6152

Abstract

Batik is one of the world’s cultural heritages. Batik motifs are widely applied to various products, one of which is wood. Desa Wisata Krebet, located in Pajangan Subdistrict, Bantul Regency, Yogyakarta, is one of the producers of wooden batik in Indonesia. The production of wooden batik generates liquid waste from the dyeing process. However, this waste is not yet adequately treated and is directly discharged into the environment, potentially causing pollution. This community engagement project aimed to treat the liquid waste from wooden batik production to prevent environmental contamination, particularly soil pollution, and to ensure the discharged waste complies with applicable wastewater quality standards. The method utilized was based on the principles of coagulation and filtration. These principles were implemented in a waste treatment system consisting of tanks and filtration pipes. Several experiments were conducted to determine the optimal coagulant formulation. Modifications were also made to the filtration pipes to achieve better results. The findings demonstrated a significant reduction in BOD, COD, and TSS levels in the wastewater before and after treatment.
BILANGAN KROMATIK LOKASI PADA GRAF C_n \odot P_1 Rahmadi, Deddy; Kamal, Muhammad Luthfi; Utami, Dhiya Anisah; Rohman, Alvian Nur; Ramadhan, Muhammad Ridho
Jurnal Ilmiah Matematika Vol. 11 No. 1 (2024)
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/jim.v11i1.28401

Abstract

Bilangan kromatik lokasi suatu graf merupakan perluasan dari konsep dimensi partisi dan pewarnaan titik pada suatu graf. Jumlah minimum warna yang diperlukan untuk melakukan pewarnaan lokasi pada graf disebut bilangan kromatik lokasi graf. Penelitian ini merupakan studi literatur yang membahas tentang bilangan kromatik lokasi pada graf C_n \odot P_1. Pendekatan yang digunakan untuk menghitung bilangan kromatik lokasi adalah melibatkan penentuan batas atas dan bawah.
Modeling Network Problem using Metric Dimension: Applied Algorithm on Corona Graph Rahmadi, Deddy; Ramadhani, Ilma Nindita; Dheana, Clarissa Elva; Mustamin, Miftah Aulia
Mathematical Journal of Modelling and Forecasting Vol. 2 No. 1 (2024): June 2024
Publisher : Universitas Negeri Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24036/mjmf.v2i1.21

Abstract

Let G be a graph is a finite set of vertices and edges.  A graph G can be defined as a pair of sets . The minimum cardinality of all distinguishing sets in a graph is called the metric dimension. The metric dimension was first introduced in 1966 by Harary and Melter. The method used in this research is deductive proof. The results obtained from this research are we determine the metric dimension of the graph resulting from the corona operation on  and obtain the result that is 2n.
ON THE EDGE METRIC DIMENSION OF HELM AND CLOSED HELM GRAPH Rahmadi, Deddy; Robiultsani, Muhammad Fauzi Nur; Abrori, Muchammad
Jurnal Matematika UNAND Vol. 14 No. 3 (2025)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.14.3.232-239.2025

Abstract

Dimensi metrik sisi merupakan kardinalitas himpunan pembeda pada suatu graf. Kumpulan verteks dikatakan himpunan pembeda jika untuk setiap verteks pada suatu graf, terdapat satu verteks yang membedakan setiap edge pada graf tersebut. Dengan kata lain, terdapat satu verteks dalam himpunan pembeda yang jaraknya berbeda terhadap setiap edge pada graf tersebut. Penelitian ini menggunakan metode pendekatan analisis struktur graf dan konsep jarak antara edge dan verteksnya untuk menentukan dimensi metrik sisi pada suatu graf. Graf helm $H_n$ dibangun dari graf roda $W_n$ dengan menambahkan satu verteks anting pada setiap verteks pada $n$ cycle. Graf helm tertutup $CH_n$ dibangun dari graf helm $H_n$ di mana pada setiap verteks antingnya membentuk sebuah cycle. Penelitian ini dapat memberikan landasan teoritis untuk menghitung dimensi metrik sisi pada graf helm dan graf helm tertutup. Diperoleh hasil dimensi metrik sisi pada graf helm $H_n$ untuk $n \geq 3$ dan graf helm tertutup $CH_n$ untuk $n \geq 3$.
AquaInnova: Sistem IoT Kendali Jarak Jauh Pakan Lele via Telegram Ramadhani, Qonita Nadya; Kamal, Ahmad Mushthofa; Rahmadi, Deddy
Digital Transformation Technology Vol. 5 No. 2 (2025): Periode September 2025
Publisher : Information Technology and Science(ITScience)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47709/digitech.v5i2.6998

Abstract

Kebutuhan akan sistem otomatis yang efisien dan mudah digunakan didorong oleh kendala yang timbul dari proses pemberian pakan manual kepada ikan lele. Tujuan penelitian ini adalah untuk mengembangkan dan menerapkan AquaInnova, sebuah sistem pemberi pakan ikan lele otomatis berbasis Internet of Things (IoT) yang dapat dikendalikan secara jarak jauh melalui API Telegram. Penelitian ini dilaksanakan sebagai bagian dari kegiatan Kuliah Kerja Nyata (KKN) Konversi, dengan metode prototyping yang mencakup tahap perencanaan, perancangan, implementasi, dan pengujian. Sistem menggunakan ESP8266, servo MG996R, LED, dan bahan bekas sebagai komponen utama. AquaInnova dapat berfungsi dalam dua mode berbeda yaitu, otomatis setiap 12 jam dan manual melalui perintah Telegram dengan waktu respons rata-rata di bawah 2 detik. Pengujian menunjukkan bahwa sistem berjalan secara real-time, stabil, dan sederhana untuk digunakan. Telegram sebagai media kontrol lebih mudah diakses daripada sistem IoT serupa. Studi ini menunjukkan bahwa AquaInnova dapat menjadi solusi teknologi murah dan mudah digunakan untuk meningkatkan produktivitas budidaya ikan lele di rumah tangga dan komunitas kecil.
Dimensi Metrik pada Graf Theta Rahmadi, Deddy; Albar, Wakhid Fitri
JURNAL DIFERENSIAL Vol 7 No 2 (2025): November 2025
Publisher : Program Studi Matematika, Universitas Nusa Cendana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35508/jd.v7i2.20790

Abstract

Let $ G = (V, E) $ be a connected graph with vertex set $ V(G) $ and edge set $ E(G) $. For any two vertices $ u $ and $ v $ in $ G $, the shortest path distance between $ u $ and $v$ is denoted by $d(u, v)$. If $W = \{w_1, w_2, \dots, w_k\}$ is an ordered set of vertices in the connected graph $G$ , and $v \in V(G)$, then the representation of vertex $v$ with respect to $W$ , denoted as $r(v|W)$, is $r(v|W) = (d(v, w_1), d(v, w_2), \dots, d(v, w_k))$. If $r(v|W)$ is distinct for each vertex $v \in V(G)$, then $W$ is referred to as a resolving set for $G$. The resolving set with the smallest cardinality is called the minimum resolving set, and the cardinality of this set is the metric dimension of $G$, denoted by $\dim(G)$. This paper explores the metric dimension of the theta graphs.