Article Per Year (5 Year)
p-Index From 2019 - 2024
2.241
P-Index
This Author published in this journals
All Journal Jurnal Ilmu Dasar KADIKMA Prosiding Seminar Matematika dan Pendidikan Matematik UNEJ e-Proceeding BAREKENG: Jurnal Ilmu Matematika dan Terapan JOURNAL OF APPLIED INFORMATICS AND COMPUTING InPrime: Indonesian Journal Of Pure And Applied Mathematics Majalah Ilmiah Matematika dan Statistika (MIMS)
Kiswara Agung Santoso
Jurusan Matematika FMIPA Universitas Jember
Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Education Energy Engineering Mathematics Mechanical Engineering Physics Transportation

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

Found 27 Documents
Search

 1   2   3 
DESAIN MOTIF MOZAIK PADA REGULER DECAGON BERBASIS GOLDEN TRIANGLE Rosyadi, Itaniza; Kusno, K; Santoso, Kiswara Agung
KadikmA Vol 3, No 3: Desember 2012
Publisher : KadikmA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (708.809 KB)

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: Desember 2012
Publisher : KadikmA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (783.38 KB)

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.
Desain Mozaik Pada Interior Persegi Berkarakter Barisan Geometri Murihani, Endang; Kusno, Kusno; Santoso, Kiswara Agung
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1, No 1 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

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

Abstract

Mosaic is a creation that arranging pieces of geometric in a space. This mosaic design which has geometric line character enrich the varieties of mosaic designs more attractive and various. The result of research found that to develop the mosaic design in rectangle interior for geometric line character needed some steps as follows: (1) constructing pieces of rectangle that the size is arranged in geometric line form through spot among each side, (2) fill in each pieces in the result of step (1) with filling curve permanently or exchanging by using the rotation or dilatation, (3) combaining some rectangles as the result of step (2) and coloring the background or filling curve.
Desain Mozaik Pada Interior Persegi Berkarakter Barisan Geometri Murihani, Endang; Kusno, Kusno; Santoso, Kiswara Agung
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1 No 4 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

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

Abstract

Mosaic is a creation that arranging pieces of geometric in a space. This mosaic design which has geometric line character enrich the varieties of mosaic designs more attractive and various. The result of research found that to develop the mosaic design in rectangle interior for geometric line character needed some steps as follows: (1) constructing pieces of rectangle that the size is arranged in geometric line form through spot among each side, (2) fill in each pieces in the result of step (1) with filling curve permanently or exchanging by using the rotation or dilatation, (3) combaining some rectangles as the result of step (2) and coloring the background or filling curve.
VIGENERE CIPHER DENGAN MODIFIKASI PLAINTEXT Gusti, Dwi Rahmasari Kinasih; Santoso, Kiswara Agung; Kamsyakawuni, Ahmad
Majalah Ilmiah Matematika dan Statistika Vol 20 No 1 (2020): 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.v20i1.17219

Abstract

Cryptography is knowledge of encoding messages by observe to security aspects. Cryptography uses two types of keys, namely symmetric keys and asymmetric keys. Vigenere cipher is a technique to encrypt messages by symmetric key. Vigenere cipher can be combined by several patterns and ASCII code. The pattern used can vary as long as the text can be returned to original message (can be decrypted). On this paper, we will modified plaintext before encrypt using vigenere cipher. The way to modified the plaintext are flip and shift rows of bit. The effect of the algorithm changes can be seen based on the renewal value obtained. If the correlation value gets smaller, it means the algorithm is better. The results of this study is the correlation value using vigenere cipher with modified plaintext is better compared to vigenere cipher with original plaintext. Keywords: ASCII, Patterned, Bits, Vigenere Cipher
IMPLEMENTASI ALGORITMA GREY WOLF OPTIMIZER (GWO) DI TOKO CITRA TANI JEMBER Lestari, Vidiyanti; Kamsyakawuni, Ahmad; Santoso, Kiswara Agung
Majalah Ilmiah Matematika dan Statistika Vol 19 No 2 (2019): 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.v19i2.17269

Abstract

Generally, optimization is defined as the process of determining the minimum or maximum value that depends on the function of the goal, even now there are many problems regarding optimization. One of them is the problem regarding the selection of goods to be included in a limited storage medium called Knapsack problem. Knapsack problems have different types and variations. This study will solve the problem of bounded knapsack multiple constraints by implementing the Grey Wolf Optimizer (GWO) algorithm. The problem of bounded knapsack multiple constraints has more than one subject with the items that are inserted into the dimension storage media can be partially or completely inserted, but the number of objects is limited. The aim of this study is to determine the results of using the Grey Wolf Optimizer (GWO) algorithm for solving the problem of multiple constraints bounded knapsack and compare the optimal solutions obtained by the simplex method using the Solver Add-In in Microsoft Excel. The data used in this study is primary data. There are two parameters to be tested, namely population parameters and maximum iteration. The test results of the two parameters show that the population parameters and maximum iterations have the same effect, where the greater the value of the population parameters and the maximum iteration, the results obtained are also getting closer to the optimal value. In addition, based on the results of the final experiment it is known that the comparison of the results of the GWO algorithm and the simplex method has a fairly small percentage deviation which indicates that the GWO algorithm produces results that are close to the optimal value. Keywords: GWO algorithm, Knapsack, Multiple Constraints Bounded Knapsack.
PENERAPAN DRAGONFLY OPTIMIZATION ALGORITHM (DOA) PADA PERMASALAHAN MULTIPLE CONSTRAINTS BOUNDED KNAPSACK Nilasari, Laylatul Febriana; Santoso, Kiswara Agung; Riski, Abduh
Majalah Ilmiah Matematika dan Statistika Vol 19 No 1 (2019): 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.v19i1.17264

Abstract

Optimization is very useful in almost all fields in running a business effectively and efficiently to achieve the desired results. This study solves the problem of multiple constraints bounded knapsack by implementing DOA. The problem of multiple constraints bounded knapsack has more than ones constraint with objects that are entered into the storage media, the dimensions can be partially or completely included, but the number of objects is limited. The purpose of this study is to determine the results of using DOA to solve multiple constraits bounded knapsack and the effectiveness of DOA compared to the results of the Simplex method. The data used in this study are primary data. There are ten parameters to be tested, namely population parameters, maximum iteration, s, a, c, f, e and range. The trial results of the ten parameters show that the best value of the parameters is neither too large nor too small. If the best value is too large then the position of the dragonfly will be randomized so that it is not clear the position of the dragonfly and if it is too small the best value then the change is not visible. In addition, based on the results of the final experiment it can be seen that DOA is less effective in solving multiple constraints bounded knapsack problems, because of many experiments there is no solution similar to Simplex. DOA approach to optimal, seen from a small deviation. Keywords: DOA, Knapsack, Multiple constraints bounded knapsack problem.
POLINOMIAL KROMATIK PADA GRAF KIPAS Maulana, Nur Ridwan; Wijaya, Kristiana; Santoso, Kiswara Agung
Majalah Ilmiah Matematika dan Statistika Vol 18 No 2 (2018): 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.v18i2.17248

Abstract

A chromatic polynomial of a graph G is a special function that describes the number of ways we can achieve a proper coloring on the vertices of G given k colors. In this paper, we determine a chromatic polynomial of a fan graph. Keywords: Proper coloring, chromatic polynomial, fan graph.
Algoritma Elephant Herding Optimization: Permasalahan Multiple Constraints Knapsack 0-1 Regita, Yulia Dewi; Santoso, Kiswara Agung; Kamsyakawuni, Ahmad
Majalah Ilmiah Matematika dan Statistika Vol 18 No 1 (2018): 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.v18i1.17241

Abstract

Optimization problems are often found in everyday life, such as when determining goods to be a limited storage media. This causes the need for the selection of goods in order to obtain profits with the requirements met. This problem in mathematics is usually called a knapsack. Knapsack problem itself has several variations, in this study knapsack type used is multiple constraints knapsack 0-1 which is solved using the Elephant Herding Optimization (EHO) algorithm. The aim of this study is to obtain an optimal solution and study the effectiveness of the algorithm comparing it to the Simplex method in Microsoft Excel. This study uses two data, consisting of primary and secondary data. Based on the results of parameter testing, the proven parameters are nClan, nCi,α,β and MaxGen have a significant effect. The final simulation results have also shown a comparison of the EHO algorithm with the Simplex method having a very small percentage deviation. This shows that the EHO algorithm is effective for completing optimization multiple constraints knapsack 0-1. Keywords: EHO Algorithm, Multiple Constraints Knapsack 0-1 Problem.
PENGAMANAN POLYALPHABETIC DENGAN AFFINE CIPHER BERDASARKAN BARISAN FIBONACCI Astuti, Lestari Fidi; Santoso, Kiswara Agung; Kamsyakawuni, Ahmad
Majalah Ilmiah Matematika dan Statistika Vol 19 No 2 (2019): 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.v19i2.17274

Abstract

Affine cipher is a classic cryptographic algorithm substitution technique. Substitution technique is the encryption process for every character in the plaintext will be subtituted by another character. Affine cipher uses two types of keys. Each character of plaintext to be encrypted substituted by the same key. This research discusses about modify one of the key affine cipher, to produce a different key that will be substituted with each plaintext character. Key modifications are made by the Fibonacci sequence rules. This study also compares affine cipher and key modification affine cipher by finding corelation coeffiecient values. The results obtained from the comparison of the two algorithms, encryption that uses affine cipher key modification is better than affine cipher. Keywords: Cryptography, Affine Cipher, Fibonacci, Correlation Value
Co-Authors Abduh Riski Abduh Riski, Abduh Agustina Pradjaningsih Ahmad Kamsyakawuni Ahmad Tanto Wiraga Asti, Melinda Astuti, Lestari Fidi Bagus Arief Setiawan D. Dafik Dian Anggraeni Djoni Budi Sumarno Dyan Mei Anggraeni Endang Murihani Gusti, Dwi Rahmasari Kinasih Innafajri Insyirah Itaniza Rosyadi Juwitarty, Novita Anggraini K Kusno Kosala Dwidja Purnomo Kristiana Wijaya Kusbudiono Kusbudiono, Kusbudiono Kusno Kusno Lestari, Vidiyanti Maulana, Nur Ridwan Mohammad Hasan Muhammad Seggaf Najah, Maulidyah Lailatun Nila Al Indiani Nilasari, Laylatul Febriana Reggy Valentinnes Septa Jeniusa Regita, Yulia Dewi Rizki Gangsar Septiono Sochif Prasetiya