cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Kiswara Agung Santoso
Contact Email
mims.fmipa@unej.ac.id
Phone
+62331-337643
Journal Mail Official
mims.fmipa@unej.ac.id
Editorial Address
Majalah Ilmiah Matematika dan Statistika Jurusan Matematika FMIPA Universitas Jember Jalan Kalimantan 37 Jember 68121 Telp. 0331-337643 Fax. 0331-330225 Email. MIMS.fmipa@unej.ac.id
Location
Kab. jember,
Jawa timur
INDONESIA
Majalah Ilmiah Matematika dan Statistika (MIMS)
Published by Universitas Jember
ISSN : 14116669     EISSN : 27229866     DOI : https://doi.org/10.19184
Core Subject : Education,
Mathematics
The aim of this publication is to disseminate the conceptual thoughts or ideas and research results that have been achieved in the area of mathematics and statistics. MIMS, focuses on the development areas sciences of mathematics and statistics as follows: 1. Algebra and Geometry; 2. Analysis and Modelling; 3. Graph Theory and Combinatorics; 4. Computer Science and Big Data; 5. Application of Mathematics and Statistics.
Arjuna Subject : Matematika - Matematika (Lain-Lain)
Articles 100 Documents
 1   2   3   4   5 
PENGAMANAN CITRA GRAYSCALE MENGGUNAKAN ALGORITMA AES 128 DENGAN KUNCI CITRA GRAYSCALE Umam, Ahmad Khoirul; Kamsyakawuni, Ahmad; Riski, Abduh
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.17243

Abstract

Cryptography is the science of maintaining or securing an information by scrambling or hiding information so that it is difficult to analyze. The algorithm used in this study is the AES 128 algorithm that has been changed using the grayscale image. The AES algorithm is a modern algorithm that replaces the DES algorithm, and is an algorithm that is chosen to secure a data / message because it is efficient and has strong security. In the process, the grayscale image key is divided into 16 blocks of pixels, pixels are operated on each block with XOR operations so that one character will be obtained for each block. From the XOR process of pixels in 16 blocks, 16 characters or 128 bits long will be obtained. The data used in this study are plain images in the form of grayscale images and keys in the form of grayscale images as well. Grayscale (plain image) images will be encrypted with an image key that is also a grayscale image. Initially, the key will be taken from a grayscale image by dividing 16 blocks to get a 128-bit long key, then generating the key with the key generator in the AES algorithm so that it will get 10 sub-keys. Then encryption is done with 10 subkeys that were obtained using the AES algorithm. The results of the encryption process will produce an encoded image or cipher image that does not contain information from the plain image. The results of this algorithm are fairly safe against attacks because they have varied and sensitive keys. Keywords: Cryptography, AES, Rijndael Algorithm, Grayscale
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 ARTIFICIAL FISH SWARM ALGORITHM (AFSA) PADA MULTIPLE TRAVELLING SALESMAN PROBLEMS (m-TSP) Fismaya, Florencia Wahyu Ganda; Riski, Abduh; 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.17220

Abstract

Selling or trading in the industrial 4.0 era as it can now be done by opening a shop online. Therefore, shopping at this time can also be done online also, so that the online shop owners require orders that do not allow for Cash On Delivery (COD) transactions using package delivery services. This research discusses about finding a solution for good shipping with a minimum total mileage of several couriers at PT. Titipan Kilat District Banyuwangi uses AFSA as a settlement algorithm. The experimental process is carried out by using several parameter values to determine the parameters that affect the final solution. Each parameter will be tested with a maximum of 1000 iterations, then the best results will be tested again with a maximum iteration of 2000, and 5000 and will be compared with the original distance traveled by the couriers. The final solution offered in the form of a delivery route by three couriers with the total distance (Z) of the third courier is 87.28 Km with the smallest iteration value reaching the local minimum in iteration 1169. Keywords: artificial fish swarm algorithm (afsa), multiple travelling salesman problem (m-tsp), route, total mileage.
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.
MODELISASI TIANG TERAS MENGGUNAKAN HASIL DEFORMASI PRISMA SEGIENAM, TABUNG DAN BOLA Henik, Elsha; Juliyanto, Bagus; Kusno, Kusno
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.17242

Abstract

The cup is given to someone as a sign of apreciation and a gift of achievement. In general, the cup consists of the top, the middle, and the base. This research aims to obtain various forms of the design of cup that varied by merging the deformation results of solid geometry objects. This research method is divided into several stages. First, construct some basic objects as constituent components of cup from deformation of prism hexagon, tube, and cone. Second, set some basic objects of the component of cup on three types of modeling axis. Third, arrange program using software Maple 18. The results of this research obtained the procedure for designing various forms of constituent components of cup from the basic object of a prism hexagon, tube, and cone. Furthermore, the procedure for assembling the components of cup from the first procedure results on three types of modeling axis. Keywords: Cup, Defomation, Prism Hexagon, Tube, Cone
PENERAPAN ALGORITMA PENGUINS SEARCH OPTIMIZATION (PeSOA) DAN ALGORITMA MIGRATING BIRDS OPTIMIZATION (MBO) PADA PERMASALAHAN KNAPSACK 0-1 Abdullah, Rinaldy Ahmad; Riski, Abduh; 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.17270

Abstract

Every person would want maximum profit with as little as possible resources or capital. One example in everyday life is the problem of limited storage media but is required to get the maximum benefit. From this problem comes the term known as the knapsack problem. One of the problems with Knapsack is knapsack 0- 1, where knapsack 0-1 is a problem of storing goods where the item will be completely inserted or not at all. Completion of knapsack 0-1 problems can be helped using a metaheuristic algorithm. Metaheuristic algorithms include the Penguins Search Optimization (PeSOA) algorithm and the Migration Birds Optimization (MBO) algorithm. This study aims to determine the resolution of knapsack 0-1 problems using the Penguins Search Optimization (PeSOA) algorithm and the Migration Birds Optimization (MBO) algorithm and compare the optimal solutions obtained. This research method is divided into three main parts. First take data that includes the name of the item, the purchase price, the selling price and the weight of each item. The second is applying the Penguins Search Optimization (PeSOA) algorithm and the Migration Birds Optimization algorithm (MBO) on 0-1 knapsack problems. The third program is made to facilitate the calculation of data with the help of Matlab R2015b software. The results of this study found that both algorithms both reached the optimal solution, but the convergence and running time obtained were different. The Migrating Birds Optimization (MBO) algorithm is faster converging than the Penguins Search Optimization (PeSOA) algorithm to get the optimal solution. And also the Migrating Birds Optimization (MBO) algorithm has better running time than the Penguins Search Optimization (PeSOA) algorithm to achieve maximum iteration. Keywords: Whale optimization algorithm, multi knapsack 0-1 problem with multiple constraints.
KAJIAN FRAKTAL i-FIBONACCI WORD GENERALISASI GANJIL DENGAN MENGGUNAKAN L-SYSTEM Umami, Riza; Purnomo, Kosala Dwija; Ubaidillah, Firdaus
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.17258

Abstract

The i-Fibonacci Words are words over {0,1}. The i-Fibonacci Word can be associated with a fractal curve by using odd-even drawing rule and L-System methods, then also known as an i-Fibonacci Word fractal. L-System is one of methods that is used to create objects with repetitive self-similiarity. Framework of L-System consists of axiom and rules. L-System is a parallel rewriting system with existing rules. The purpose of this research is to look for the LSystem rules of i-Fibonacci Word special for odd i, then look how its characteristics. The LSystem rules for i-Fibonacci Word odd i are divided into two types, the rules for i=1 and the others odd i. The characteristic of i-Fibonacci Word fractal is the more generation and i value of fractal, then the more segments and archs of fractal curve. Next, the words of i-Fibonacci Word fractal segments number is a subwords of the i-Fibonacci Word digit numbers. It is also known that the fractal curve will be stretched as the decreased angle. Keywords: Fractal, i-Fibonacci Word, L-System
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.
APLIKASI KURVA BEZIER PADA DESAIN BOTOL MINUMAN Triadi, Muhammad Bagus Firman; Juliyanto, Bagus; Ubaidillah, Firdaus
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.17217

Abstract

The beverage bottle consists of several parts. There are mouth, neck, shoulders and body of the beverage bottle. This study aims to modeled the shape of the beverage bottles use Bezier curves with degrees less than or equal to six (n ≤ 6), for obtain a varied and symmetrical shape of the beverage bottles. This research method are divided into several stages. First, modeled the mouth of the beverage bottle. Second, modeled the neck of the beverage bottle. Third, modeled the body of the beverage bottle. Fifth, combined the parts of the beverage bottle. The results of this study was obtained a procedure for modeled varied and symmetrical beverage bottles using Bezier curves with degrees less than or equal to six (n ≤ 6). Keywords: Beverage Bottle, Bezier Curve, Computer Aided Geometric Design

Page 2 of 10 | Total Record : 100

 1   2   3   4   5 

Filter by Year

2015 2023


Reset
Filter By Issues
All Issue Vol 23 No 2 (2023): Majalah Ilmiah Matematika dan Statistika Vol 23 No 1 (2023): Majalah Ilmiah Matematika dan Statistika Vol 22 No 2 (2022): Majalah Ilmiah Matematika dan Statistika Vol 22 No 1 (2022): Majalah Ilmiah Matematika dan Statistika Vol 21 No 2 (2021): Majalah Ilmiah Matematika dan Statistika Vol 21 No 1 (2021): Majalah Ilmiah Matematika dan Statistika Vol 20 No 2 (2020): Majalah Ilmiah Matematika dan Statistika Vol 20 No 1 (2020): Majalah Ilmiah Matematika dan Statistika Vol 19 No 2 (2019): Majalah Ilmiah Matematika dan Statistika Vol 19 No 1 (2019): Majalah Ilmiah Matematika dan Statistika Vol 18 No 2 (2018): Majalah Ilmiah Matematika dan Statistika Vol 18 No 1 (2018): Majalah Ilmiah Matematika dan Statistika Vol 17 No 2 (2017): Majalah Ilmiah Matematika dan Statistika Vol 17 No 1 (2017): Majalah Ilmiah Matematika dan Statistika Vol 16 No 2 (2016): Majalah Ilmiah Matematika dan Statistika Vol 16 No 1 (2016): Majalah Ilmiah Matematika dan Statistika Vol 15 No 2 (2015): Majalah Ilmiah Matematika dan Statistika More Issue