Claim Missing Document
Check
Articles

Found 39 Documents
Search

Chaotic outbreak in discrete epidemic model with vaccination and quarantine interventions and limited medical resources Fahreza, Faizal Rifky; Hasan, Moh; Santoso, Kiswara Agung
Majalah Ilmiah Matematika dan Statistika Vol. 25 No. 1 (2025): 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.v25i1.53689

Abstract

The spread of infectious diseases can be analyzed dynamically using a discrete dynamic system. The characteristics of the infectious disease phenomenon are interesting to study as parameters considered in a dynamic system. Some of these include vaccination interventions, quarantine, or even an open condition such as limited medical resources. Analysis of a discrete epidemic model system with those three factors can be conducted to understand each of their impacts on the dynamics of disease spread within a population or even to determine the potential for a chaotic outbreak. In this study, an epidemiological model was formulated considering these three factors. Numerical simulations were also conducted to directly observe the influence of these three factors on the dynamics of disease spread. Additionally, efforts to control chaos were also implemented in the system. The limitation of medical resources affects the spread of diseases. Because the coverage of medical resources is limited, it can cause a high surge in cases within the population. This phenomenon of case surges can subsequently be mitigated by vaccination parameters such as vaccine efficacy and the rate of vaccine distribution within the population. Furthermore, the formulated system has the potential to exhibit chaotic behavior when the infection rate increases, in other words, the disease becomes an uncontrollable and unpredictable epidemic. Next, the thing that can be done to suppress this chaotic phenomenon is to directly intervene in the rate of disease spread within the population.
MEDICAL IMAGE ENCRYPTION USING DNA ENCODING AND MODIFIED CIRCULAR SHIFT Santoso, Kiswara Agung; Kamsyakawuni, Ahmad; Seggaf, Muhammad
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 16 No 1 (2022): BAREKENG: Jurnal Ilmu Matematika dan Terapan
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1010.265 KB) | DOI: 10.30598/barekengvol16iss1pp233-240

Abstract

This paper proposes a new encryption method for the encryption of medical images. The method is used to divide the image into several blocks and then scramble the image blocks using DNA chains and then shift the pixels in a circle with certain rules. To provide a more secure result, the input key contains a DNA chain and is equipped with complementary rules, and is converted into a hexadecimal number using a DNA coding table. Experimental results and values of NPCR and UACI show that the scheme achieves good encryption and decryption results.
ANALYTICAL HIERARCHY PROCESS IN DETERMINING LEVEL THE FEASIBILITY OF THE AUTOMATED TELLER MACHINE LOCATION (CASE STUDY BANK SYARIAH INDONESIA JEMBER) Pradjaningsih, Agustina; Anggraeni, Dyan Mei; Santoso, Kiswara Agung
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 16 No 3 (2022): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (476.358 KB) | DOI: 10.30598/barekengvol16iss3pp1115-1122

Abstract

Bank Syariah Indonesia (BSI) is a new Islamic bank resulting from the merger of three Islamic banks that requires development to maximize the feasibility of the Automated Teller Machine (ATM) location. The placement of a proper ATM location can increase the bank's profits. This research was conducted to assist BSI Jember Regency in determining the feasibility level of 10 ATM locations that are already owned based on several criteria that have been selected. This study aims to analyze the results of the feasibility of the BSI ATM location. The method used in this study is the Analytical Hierarchy Process (AHP) method. AHP is a method used to rank an alternative decision best from several criteria that must be met or considered. In this study, four criteria and ten alternatives were used. These criteria are the distance of the ATM from the center of the crowd (X1), the distance of the ATM from the security office (X2), the number of residents (X3), and the number of non-BSI ATMs (X4), while the alternative is 10 BSI ATM locations. This study obtained the results of the feasibility of the location of the establishment of 10 BSI ATMs, with the BSI KKAS UNMUH ATM, which ranked first because it had the most considerable value of 0.1674.
SCHEDULING ANALYSIS BEDUGUL VILLA CONSTRUCTION PROJECT USING PERT AND CPM METHODS Santoso, Kiswara Agung; Yusnita, Ade Ratna; Pradjaningsih, Agustina
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 18 No 1 (2024): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol18iss1pp0105-0116

Abstract

Scheduling in construction projects is necessary so that the planned time to complete the project can be achieved on time. the methods used in optimizing project scheduling are the Project Evaluation Review Technique (PERT) method and the Critical Path Method (CPM) method. Bedugul Villa is one of the projects that has been carried out with a work contract for 175 calendar days and the scheduling of which will be optimized in this study. The optimal duration for scheduling with the PERT method is to produce an optimal duration of 170 calendar days. The duration is 5 days faster than the existing schedule prepared by the project construction contractor, which is 175 calendar days. The probability of completion of the project is 87.7%. Calculations using the CPM method are 168 calendar days or 7 days earlier than the existing schedule made by the contractor.
Pengaman Teks dengan Kombinasi Metode Electronic Code Book (ECB) dan Kode Seven Segment Display santoso, kiswara Agung; Pradjaningsih, Agustina; Delenia, Erick
Jurnal Teknologi Informasi dan Ilmu Komputer Vol 11 No 1: Februari 2024
Publisher : Fakultas Ilmu Komputer, Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25126/jtiik.20241117448

Abstract

Layanan media sosial merupakan salah satu contoh perkembangan teknologi di bidang informasi. Salah satu cara meningkatkan sistem keamanan yaitu digunakannya ilmu kriptografi. Sudah banyak penelitian yang menghasilkan algoritma kriptografi, mulai dari algoritma yang baru, modifikasi algoritma bahkan kombinasi dari beberapa algoritma. Berdasarkan kebiasaan algoritma tersebut hacker tentu akan mencari celah untuk melakukan dekripsi dengan cara mencari algoritma dasar dari proses enkripsi untuk kemudian melakukan hack. Untuk mengantisipasi hal tersebut peneliti ingin melakukan modifikasi bukan pada algoritma pembentuknya melainkan modifikasi dari konversi system bilangan basis 2 berdasarkan Seven Segment Display. Salah satu metode yang sering digunakan untuk proses enkripsi yaitu metode Electronic Code Book (ECB). Seven Segment Display merupakan sebuah tampilan yang terbentuk dari tujuh kelompok segmen LED (Light Emitting Diode) yang dirangkai sedemikian sehingga membentuk angka–angka dari 0 hingga 9. Segmen LED dinotasikan dengan 1 jika menyala dan 0 jika mati, pola tersebut dapat digunakan untuk memanipulasi bit biner 7 bit khususnya karakter angka 0 hingga 9. Modifikasi terletak pada proses pembentukan bit kunci yang dibangkitkan berdasarkan aturan Seven Segment Display. Aturan ini digunakan untuk mengganti nilai bit, bila pada umumnya nilai bit didapat dari sistem bilangan basis 2 maka disini  nilai bit didapat dari aturan seven segment display dan inilah yang merupakan state of the art dari penelitian ini karena belum pernah digunakan sebelumnya.  Hasil penerapannya menunjukkan bahwa data yang dienkripsi menghasilkan chiperteks acak berupa karakter printable pada ASCII dan chiperteks dapat dikembalikan secara utuh tanpa ada informasi yang hilang. 
Implementasi Metode Goal Programming Untuk Optimasi Produksi Cokelat Pada UMKM Pradjaningsih, Agustina; Andora, Ela; Santoso, Kiswara Agung
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi Volume 12 Issue 2 December 2024
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/euler.v12i2.26904

Abstract

Chocolate is a food made from cocoa beans, namely Theobroma Cacao. Cocoa beans harvested are then processed to prevent rotting, which can reduce their quality. Currently, many chocolate manufacturers produce various variants of chocolate products. Each production company tries to achieve maximum profits with minimal costs. Production optimization problems can be addressed using objective programming, which is a method used to develop mathematical models of optimization problems involving multiple objectives or constraints. In goal programming, each goal is expressed as a goal constraint. Objective programming methods involve determining decision variables, objective constraints, and objective functions. Optimization problems are solved using the objective programming method with the help of Lingo software. Optimization calculations using Lingo software show that the production of each chocolate product has reached optimality. Production after optimization reached Rp. 10,380,000 per month, whereas production costs were only Rp. 10,500,000 per month before optimization. The availability of raw materials needed after optimization reached 85 recipes per month, whereas it was 90 recipes per month before optimization. The profit obtained is also optimal, namely Rp. 4,267,000 in one month.
Penerapan Algoritma Dijkstra dalam Pencarian Rute Terpendek Wisata Religi Santoso, Kiswara Agung; Afifah, Zakiyatul; Halikin, Ikhsanul
Jurnal Ilmiah Pendidikan Matematika Al Qalasadi Vol 7 No 2 (2023): JURNAL ILMIAH PENDIDIKAN MATEMATIKA AL QALASADI
Publisher : Prodi Pendidikan Matematika, Fakultas Tarbiyah dan Ilmu Keguruan IAIN Langsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32505/qalasadi.v7i2.6227

Abstract

Pilgrimages to the graves of Waliyullah and the spreaders of Islam have become spiritual or religious tourism for Muslims in Java and even almost all Muslims in Indonesia. This opens up opportunities for travel agents to help pilgrims on religious tourism trips. One travel agency that offers religious tour packages is PT Mitra Jaya Group which operates in the Banyuwangi area, East Java. Many travel agencies are trying to increase their competitiveness, to survive competition between travel agencies, especially in improving services and financial management. One way that can be done is to determine the shortest route for religious tourism so that the distance traveled is minimal, where previously the route chosen was not based on proper research. In this paper, the search for the shortest route is carried out by applying the Dijkstra algorithm. The application of the Dijkstra algorithm can provide benefits regarding the shortest distance to religious tourism routes from PT Mitra Jaya Group. From the analysis results, the total shortest distance obtained was 2768.8 kilometers. The resulting shortest route distance is smaller than the distance before using the Dijkstra algorithm, namely 3005.6 kilometers. The difference is 236.8 kilometers and there is a distance saving of 7.87
Application of Genetic Algorithm on Inclusive Labeling of a Graph Santoso, Kiswara Agung; Setiawan, Bagus Arief; Kusbudiono, Kusbudiono
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol. 4 No. 1 (2022)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v4i1.24327

Abstract

As science developed, heuristic methods began to be used in graph coloring. Heuristic methods that have been used for graph coloring include Genetic Algorithm, Tabu Search, and Ant Colony Algorithm. A Genetic Algorithm is a method for solving optimization problems. In this study, the Genetic Algorithm will be used for the issue of labeling irregular vertices of inclusive distances to label any graph inclusively. We restrict an inclusive 1-distance to a simple graph using one-point crossover and mutation. The steps are a generation of random chromosomes, evaluating chromosome fitness values with tournament selection, conducting an evolutionary process consisting of one-point crossover and mutation, repeating the process until the termination criteria are met. The results of implementing the genetic algorithm on inclusive labeling can be determined by the chromatic number based on the adjacency matrix. The results of this labeling can be used as an alternative solution to the problem of inclusive labeling.Keywords: Genetic Algorithm; graph labeling; inclusive labeling. AbstrakSeiring berkembangnya ilmu pengetahuan metode heuristic mulai digunakan dalam pewarnaan graf. Metode heuristic yang telah digunakan untuk pewarnaan graf antara lain Algoritma Genetika, Tabu Search, dan Algoritma Semut (Ant Colony). Algoritma Genetika merupakan metode untuk menyelesaikan masalah optimasi. Pada penelitian ini, Algoritma Genetika digunakan untuk masalah pelabelan titik tak-teratur jarak inclusive agar dapat melabeli sebarang graf secara inclusive. Kami membatasi lingkup penelitian dengan menerapkan jarak inclusive 1 pada graf sederhana, menggunakan crossover satu titik dan mutasi. Metode yang digunakan dalam penelitian ini adalah studi literatur dengan mengkaji penggunaan Algoritma Genetika pada pelabelan titik tak-teratur jarak inclusive suatu graf. Langkah-langkah yang dilakukan adalah: pembangkitan kromosom secara acak, evaluasi nilai fitness kromosom dengan tournament selection, melakukan proses evolusi yang terdiri dari crossover satu titik dan mutasi, perulangan proses sampai kriteria pemerhentian terpenuhi. Hasil implementasi algoritma genetika pada pelabelan inclusive adalah dapat mengetahui bilangan kromatik berdasarkan matriks adjacency. Hasil pelabelan ini dapat dijadikan sebagai salah satu alternatif penyelesaian masalah pelabelan inklusif.Kata Kunci : Algoritma Genetika; pelabelan graf; pelabelan inklusif.
Prediction of Rice Production in Jember Regency Using Adaptive Neuro Fuzzy Inference System (ANFIS) Riski, Abduh; Putriana, Novia Ayu; Fadri, Firda; Kamsyakawuni, Ahmad; Pradjaningsih, Agustina; Santoso, Kiswara Agung; Sari, Merysa Puspita
ILKOM Jurnal Ilmiah Vol 17, No 3 (2025)
Publisher : Prodi Teknik Informatika FIK Universitas Muslim Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33096/ilkom.v17i3.2797.262-275

Abstract

Jember Regency is the fourth largest rice-producing regency/city in East Java, so Jember Regency dramatically contributes to increasing the agricultural sector in East Java Province. However, the level of rice production can fluctuate, which is influenced by other factors such as rainfall. A prediction system is needed to anticipate a decrease in rice production. This research aims to predict rice production in the Jember Regency using the Adaptive Neuro Fuzzy Inference System (ANFIS), highlighting the impact of key variables like rainfall, harvested area, and land productivity. This research consists of three stages: training, testing, and prediction. The input variables used in this research are rainfall (mm), harvested area (Ha.), and land productivity (Kw/Ha.), while the output variable is rice production (tons). The membership functions used are generalized Bell and Gaussian, with several combinations of many membership functions. The best model obtained from this research is a model that uses generalized bell membership functions with three membership functions for rainfall variables and two membership functions for harvest area and land productivity variables. The epoch (iteration) used to achieve minimum error is 100 epochs. The best model achieved high accuracy, producing a MAPE value of 0.080% in training and 1.525% in testing, indicating its strong potential for reliable agricultural production forecasting. The predicted amount of rice production in Jember Regency in 2024 was 922,136.8317 tons.