Claim Missing Document
Check
Articles

Found 39 Documents
Search

DESAIN JARINGAN INTERNET INDIHOME DI PERUMAHAN MANGGAR PERMAI AMBULU MENGGUNAKAN ALGORITMA K-MEANS DAN KRUSKAL Reggy Valentinnes Septa Jeniusa; Kiswara Agung Santoso; Kusbudiono Kusbudiono
UNEJ e-Proceeding 2022: E-Prosiding Seminar Nasional Matematika, Geometri, Statistika, dan Komputasi (SeNa-MaGeStiK)
Publisher : UPT Penerbitan Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Based on the survey results of the Association of Indonesian Internet Service Providers, internet users are increasing reaching 196.7 million people. This community need is the driving force for PT. Telkom to overcome the need for internet access, namely the presence of Indihome. The Indihome internet network is distributed to several houses through ODP. The grouping of houses on ODP is based on the closest distance using the k-means algorithm. Meanwhile, minimizing the use of Indihome internet cables using the Kruskal algorithm. The data used in this study are house coordinates data obtained from the Google Earth application. The data is processed using the k-means algorithm, then continued using the Kruskal algorithm. The results of the research are clustering in houses with ODP formed 16 clusters which are processed using the k-means algorithm and stop at the 5th iteration. The ODP used has capacities of 8 and 12. ODP 1, 2, 4, 5, 8, 9, 11, 12, 13, 14, 15, 16 have capacities of 8. While ODP 3, 6, 7, 10 has a capacity of 12. Fiber optic cable between ODP is processed using the Kruskal algorithm and produces a minimum weight of 0.006601782 or ± 735 meters. Keywords: Indihome, K-Means Algorithm, Kruskal Algorithm
PENENTUAN LOKASI ATM BANK SYARIAH INDONESIA DI WILAYAH JEMBER KOTA MENGGUNAKAN K-MEANS CLUSTERING Nila Al Indiani; Kiswara Agung Santoso; Dian Anggraeni
UNEJ e-Proceeding 2022: E-Prosiding Seminar Nasional Matematika, Geometri, Statistika, dan Komputasi (SeNa-MaGeStiK)
Publisher : UPT Penerbitan Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

All transactions are inseparable from the role of the ATM as a supporter the business entity financial improvement. Therefore, the existence of an ATM has now become a general need of modern society. Currently, the population of Jember Regency is 2,568.88 people, and 10 ATM have been established, which means the population ratio and the number of ATM are not balanced, so it is necessary to make a data grouping in order to obtain the location of the ATM establishment that can reach the surrounding villages. This research examined the K-Means Clustering method in the case of determining the location of an ATM based on the distance from the center of the crowd. Calculation of distance using Google Maps K-Means Clustering algorithm was used to group 40 data points for the center of each village into 6 clusters. This research assumed that the centroid is the location of the ATM establishment and the cluster members were the village that can be reached by the centroid. The results of C1-C6 grouping were Tanjung Market, Pakusari Market, MTSN 2 Jember, KUA Arjasa, SMPN 3 Arjasa, and SMAN 4 Jember, sequentially. Keywords: ATM Location, Euclid Distance, K-Means Clustering
PENGAMANAN TEKS MENGGUNAKAN ALGORITMA TRANSPOSISI DAN MODIFIKASI SANDI MORSE Rizki Gangsar Septiono; Kiswara Agung Santoso; Ahmad Kamsyakawuni
UNEJ e-Proceeding 2022: E-Prosiding Seminar Nasional Matematika, Geometri, Statistika, dan Komputasi (SeNa-MaGeStiK)
Publisher : UPT Penerbitan Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Humans as social beings communicate to exchange information. Information has many forms including text data, sound, images, and so on. Not all information is freely accessible. Information security is needed to prevent information from being misused by irresponsible parties. Cryptography studies how to convert information into a form that is unknown except for the sender and recipient of the information. Cryptography is divided into two, classical cryptography and modern cryptography. One form of cryptography that can be found around us is the use of Morse code in scouting. Classical cryptography and modern cryptography can be combined to increase the security of the algorithms used in hiding information. In this article, the transposition algorithm is applied in binary digits. Keys in the form of ASCII characters are converted into binary using modified Morse code and operated with plaintext. The results showed that the combination of transposition algorithm and Morse code modification adds complexity so that the proposed algorithm is difficult for cryptanalysts to solve. Keywords: Cryptography, Morse Code, Transposition Algorithm.
Penerapan Algoritma Dijkstra dalam Pencarian Rute Terpendek Wisata Religi Kiswara Agung Santoso; Zakiyatul Afifah; Ikhsanul Halikin
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
OPTIMASI PRODUKSI SUWAR-SUWIR MENGGUNAKAN METODE GOAL PROGRAMMING (STUDI KASUS : PABRIK SARI RASA, KABUPATEN JEMBER) Nilamsari, Fania Tasya; Santoso, Kiswara Agung; Pradjaningsih, Agustina
Jurnal Ilmiah Matematika dan Pendidikan Matematika Vol 15 No 1 (2023): 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.2023.15.1.7243

Abstract

ABSTRACT. Production planning is an important thing in maintaining the suistainability of the company. The preparation of production planning is related to the optimization of a company’s production, so that a company can run effective and have low cost production activities. The preparation of production planning need to pay attention at many things because a company has various goals to achieve. Goal programming is a method to model a problem that has many goals so that the optimal solution will be obtained from many targets at once. This study aims to optimize the production of suwar-suwir at the Sari Rasa Factory located in Jember Regency by applying the goal programming method. Existing data will used to create a model using goal programming method to get the optimization results. The goal programming formulation is formed by determining the decision variables, goal constraints, and objective functions. The optimization calculation in the goal programming method will use the LINDO (Linear Interactive Discrete Optimizer) software. The results in this study show that production cost can be minimized from Rp 57.616.000 to Rp 51.782.000, existing raw materials can be minimized from 104 recipes to 94 recipes, and the optimal profit is Rp 18.508.000.Keywords: optimization, production, goal programming. ABSTRAK. Perencanaan produksi merupakan suatu hal yang penting dalam mempertahankan keberlangsungan perusahaan. Penyusunan perencanaan produksi berkaitan dengan optimasi produksi suatu perusahaan, agar suatu perusahaan dapat berjalan secara efektif dan kegiatan produksi tercapai dengan tingkat biaya yang rendah. Penyusunan perencanaan produksi perlu memperhatikan banyak hal karena suatu perusahaan memiliki berbagai tujuan yang ingin dicapai. Goal programming merupakan suatu metode yang dapat digunakan memodelkan suatu masalah yang mempunyai banyak tujuan sehingga akan didapatkan solusi optimal dari banyak target sekaligus. Penelitian ini bertujuan mengoptimalkan produksi suwar-suwir di Pabrik Sari Rasa yang terletak di Kabupaten Jember dengan menerapkan metode goal programming. Data yang didapat dimodelkan dengan metode goal programming untuk diperoleh hasil optimasinya. Formulasi goal programming dibentuk dengan menentukan variabel keputusan, goal constraint, dan fungsi tujuan. Penyelesaian masalah optimasi metode goal programming menggunakan software LINDO (Linear Interactive Discrete Optimizer). Hasil yang diperoleh pada penelitian ini menunjukkan bahwa biaya produksi dapat diminimumkan dari Rp 57.616.000 menjadi Rp 51.782.000, ketersediaan bahan baku dapat diminimumkan dari 104 resep menjadi 94 resep, dan keuntungan yang diperoleh sudah optimal yaitu sebesar Rp 18.508.000. Kata Kunci: optimasi, produksi, goal programming.
DESAIN MOTIF MOZAIK PADA REGULER DECAGON BERBASIS GOLDEN TRIANGLE Rosyadi, Itaniza; Kusno, K; Santoso, Kiswara Agung
Kadikma Vol 3 No 3 (2012): Desember 2012
Publisher : Department of Mathematics Education , University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/kdma.v3i3.1012

Abstract

Abstract. Decagonal Penrose Mosaic is a decagonal interior design constructed by applying the basic of golden triangle Penrose tile. There are several techniques to design the mosaic, some of them are as follows: (1) constructing Penrose tile on the fifth iterations constructed from isosceles triangles which on each triangle is defined by decagon sector; (2) stating  Penrose symmetry base as the mosaic design base;  (3) dividing each Penrose tile golden triangle into 3 zone; (4) stating Penrose symmetry base to fill in Penrose tile golden triangle in each zone; (5) coloring the interior  Penrose symmetry base and the backgrounds. The formed design has been found several Penrose mosaic models in full symmetry, not fully symmetry, similar and overlap, which each models has natural motive and symmetry characteristics. By using the different coloring techniques it has been formed some coloring pattern on the centre, homogenous distribution, or spreading. This would enrich the varieties of mosaic design forms. Key Words : decagonal golden triangle Penrose tile, Penrose mosaic
DESAIN MOZAIK PADA INTERIOR PERSEGI BERKARAKTER BARISAN GEOMETRI Murihani, Endang; Kusno, K; Susanto, Kiswara Agung
Kadikma Vol 3 No 3 (2012): Desember 2012
Publisher : Department of Mathematics Education , University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/kdma.v3i3.1013

Abstract

Abstract. Mosaic is a creation that arrangs a piece of geometric in a space. This mosaic design which has geometric line character enrichs the-varieties of mosaic designs more attractive and various. The result of research is to develop the mosaic design in rectangle interior for geometric line the character and it needs some steps follows: (1) constructing pieces of rectangle in which the size is arranged in geometric line form through spot among each side, (2) fill each piece with the previous result step (1) fill curve permanently or exchang by using the rotation or dilatation, (3) combains some rectangles with the previous result (2) and colors the background or the filling curve.   Key Words: geometric line, mosaic design.
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.
Text Insertion and Encryption Using The Bit-Swapping Method in Digital Images Santoso, Kiswara Agung; Fakih, Muhammad Fahmil; Kamsyakawuni, Ahmad
Journal of Applied Informatics and Computing Vol. 8 No. 1 (2024): July 2024
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v8i1.7395

Abstract

Communication is an essential aspect of everyday life, involving the transmission of information through various media. Technological advances have made communication easier but have also increased privacy and data security risks. Several efforts are made to maintain the security of digital information, including coding information (cryptography) and hiding information (steganography). In this article, the author secures information through a combination of cryptography and steganography. To secure text data, we encrypt by exchanging bits between adjacent characters. Subsequently, the encrypted text is hidden within an image. The security analysis results show the successful reconstruction of the message from the stego image and the successful restoration of the message to its original form. The use of the bit swapping method in the text message encryption process has been proven to enhance the security level of the ciphertext, as indicated by the lower TPK calculation value of 0.33 compared to the TPK value in previous studies. Additionally, embedding the ciphertext into digital images has been demonstrated to further increase the security level of the message, evidenced by the NPCR calculation value of 0.0000109% and the UACI calculation value of 0.000000555%. These very small values indicate no significant changes.
Comparison Classification Of Tomatoes Ripeness Based On RGB, HSV And CMYK Colors Based On Correlation Coefficient Kiswara Agung Santoso; Kamsyakawuni, Ahmad; Siti Virna Rohmatul Izza
Journal of Computers and Digital Business Vol. 3 No. 3 (2024)
Publisher : PT. Delitekno Media Madiri

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.56427/jcbd.v3i3.410

Abstract

This article discusses the classification of tomato fruit maturity based on color space. Several studies have been conducted to measure maturity levels using RGB and HSV color spaces. In this article, researchers classify the ripeness of tomatoes using the CMYK color space, which researchers have never done before. Next, the classification results of the CMYK color space are compared with the RGB and HSV color spaces. The CMYK color space is a secondary color commonly seen by the human eye. CMYK colors are colors produced from a combination of RGB colors. Comparison of classification results based on CMYK, RGB, and HSV color spaces was carried out using the correlation coefficient and mean square error (MSE). The correlation coefficient is a method that is often used to measure the similarity between 2 images, where the closer to 0 the correlation value, the better