cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Windarto
Contact Email
windarto@fst.unair.ac.id
Phone
+62315936501
Journal Mail Official
conmatha@fst.unair.ac.id
Editorial Address
Study Program of Mathematics, Department of Mathematics, Faculty of Science and Technology, Universitas Airlangga, Indonesia Kampus C UNAIR Jl. Mulyorejo Surabaya, Jawa Timur 60115
Location
Kota surabaya,
Jawa timur
INDONESIA
Contemporary Mathematics and Applications (ConMathA)
Published by Universitas Airlangga
ISSN : -     EISSN : 26865564     DOI : https://doi.org/10.20473/conmatha
Core Subject : Science, Education,
Materials Science & Nanotechnology Mathematics
Contemporary Mathematics and Applications welcome research articles in the area of mathematical analysis, algebra, optimization, mathematical modeling and its applications include but are not limited to the following topics: general mathematics, mathematical physics, numerical analysis, combinatorics, optimization and control, operation research, statistical modeling, mathematical finance and computational mathematics.
Arjuna Subject : Matematika - Matematika (Lain-Lain)
Articles 5 Documents
 1 
Search results for , issue "Vol. 2 No. 2 (2020)" : 5 Documents clear
Analisis dan Strategi Pengendalian Model Matematika Interaksi Sel Kanker Leukemia Mielositik Kronis dan Sel Imunitas Nanda Amalia Rahma; Cicik Alfiniyah; Windarto Windarto
Contemporary Mathematics and Applications (ConMathA) Vol. 2 No. 2 (2020)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v2i2.23853

Abstract

Leukemia is a disease in the classification of cancer in the blood that is characterized by abnormal growth of blood cells in the bone marrow or lymphoid tissue, and generally occurs in leukocytes or white blood cells. White blood cells that look for types of pathogenic diseases that harm the human body and then damage it are the task of the immune system. This thesis analyzes the mathematical model of chronic myelocytic leukemia cancer cell interactions and immune cells to determine the rate of increase in the population of chronic myelocytic leukemia cancer cells to the effect of immune cells. Based on the analysis of the model obtained two equilibrium points namely the equilibrium point of the extinction of chronic myelocytic leukemia cancer cells (E0) and the equilibrium point of the coexistence of chronic myelocytic leukemia cancer cells (E1). The equilibrium point of extinction will be asymptotically stable, whereas the equilibrium point of coexistence tends to be asymptotically stable using phase fields with the help of MATLAB software. Numerical simulation results show that there is an increase in the number of chronic myelocytic leukemia cancer cell populations and a decrease in the number of vulnerable blood cell populations. When immune cells increase in population, chronic myelocytic leukemia in cancer cells decreases in population but is not significant.
Hybrid Crow Search Algorithm - Simulated Annealing untuk Menyelesaikan Vehicle Routing Problem with Time Windows Bella Pristianisa Subari; Asri Bekti Pratiwi; Herry Suprajitno
Contemporary Mathematics and Applications (ConMathA) Vol. 2 No. 2 (2020)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v2i2.23854

Abstract

Penulisan artikel ini bertujuan untuk menyelesaikan permasalahan Vehicle Routing Problem with Time Windows (VRPTW) dengan menggunakan Hybrid Crow Search Algorithm (CSA) dengan Simulated Annealing (SA). Hybrid CSA dengan SA adalah gabungan dari kedua algoritma dengan cara melakukan proses CSA kemudian hasil terburuknya diperbaiki dengan proses SA untuk sepuluh iterasi pertama. Proses algoritma ini dimulai dengan inisialisasi parameter, membangkitkan posisi dan memori awal, menghitung fungsi tujuan, memperbarui posisi gagak, menghitung fungsi tujuan posisi baru gagak, update memori gagak, menentukan solusi terburuk dari posisi gagak kemudian dilakukan modifikasi, hasil modifikasi dengan SA menggantikan solusi terburuk pada posisi gagak, proses berlanjut sampai maksimal iterasi dipenuhi dan menentukan solusi terbaik dari memori gagak. Berdasarkan hasil implementasi pada tiga tipe data dapat disimpulkan  bahwa semakin banyak jumlah iterasi, jumlah gagak, dan proses Simulated Annealing maka nilai fungsi tujuan yang diperoleh cenderung semakin baik, sedangkan nilai probabilitas kewaspadaan (AP) tidak memberikan pengaruh pada solusi permasalahan.
Encryption and Decryption Application on Images with Hybrid Algorithm Vigenere and RSA Radifan Darari; Edi Winarko; Auli Damayanti
Contemporary Mathematics and Applications (ConMathA) Vol. 2 No. 2 (2020)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v2i2.23855

Abstract

Digital image is digital pictures on a two-dimensional plane which consists of pixels, where every pixels has Red, Green, Blue (RGB) with varying intensity depending on the image. In this thesis digital image is encrypted using hybrid algorithm Vigenere and RSA. Vigenere algorithm is a symmetric key algorithm which is a variety from Caesar algorithm where the similarity is in both of them are based on shifting the index of alphabet letters. RSA algorithm are based on the difficulty of factorizing large numbers that have 2 and only 2 factors (Prime numbers). The encryption process starts with getting the RGB intensity of each pixels from the image, then the RGB values are encrypted using Vigenere algorithm, after that RSA Algorithm encrypt those values, the values of RSA Algorithm encryption are limited so the value can be within the intervals of RGB values and the after limitation the values after being limited become the RGB values in the encrypted image. The decryption process is the inverse of encryption process, which enables the encrypted image to become the initial image before encryption. The program for encrypting and decrypting image are made using Java programming language with Netbeans IDE 8.2 software. The result of this implementation on image file donbass.jpg with the length of Vigenere key of 5 those are k1=144, k2=166 , k3=38 , k4=204 , k5=98, and RSA Algorithm keys are n=2201, e=1139, d=59, the results from the encrypted image is a visually very different image from the initial image. While in the decryption process, the encrypted image is able to be decrypted back to the initial image.
Modeling of Incident Status Dengue Fever in East Nusa Tenggara Using Geographically Weighted Logistic Regression Approach A Meylin; N. A. Aprilianti; D Lestari; Nur Chamidah
Contemporary Mathematics and Applications (ConMathA) Vol. 2 No. 2 (2020)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v2i2.23856

Abstract

Dengue fever is a disease caused by one of the four dengue viruses and this disease is an infectious disease that is spread through the bite of the Aedes Aegypti mosquito. When compared with the number of dengue cases in previous years, East Nusa Tenggara (NTT) was one of the provinces that experienced an increase in the number of dengue cases in the last three years. Previous research states that the transmission of dengue fever is caused by several factors, one of which is environmental factors of geographical location so that spatial aspects need to be involved in this study. A the statistical method that can be used to analyze spatial data in the form of a logistic regression equation that has a binary response variable is the Geographically Weighted Logistic Regression (GWLR) method. This study aims to analyze the factors that influence the high number of dengue fever cases in NTT in 2018 using GWLR approach by weighted the Gaussian kernel function. Based on the results of GWLR analysis, the number of rainy days and the number of health workers partially significantly influence the status of dengue fever events in each regency/city in NTT Province in 2018. Based on the calculation of Press’s Q value, the prediction in this study was accurate with the accuracy of classification was 0.8636 or 86.36%.
Analisis Kestabilan Model Matematika Penyebaran Penyakit Schistosomiasis dengan Saturated Incidence Rate Elda Widya; Miswanto Miswanto; Cicik Alfiniyah
Contemporary Mathematics and Applications (ConMathA) Vol. 2 No. 2 (2020)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v2i2.23851

Abstract

Schistosomiasis is a disease caused by infections of the genus Schistosoma. Schistosomiasis can be transmitted through schistosoma worms that contact human skin. Schistosomiasis is a disease that continues to increase in spread. Saturated incidence rates pay attention to the ability to infect a disease that is limited by an increase in the infected population. This thesis formulates and analyzes a mathematical model of the distribution of schistosomiasis with a saturated incidence rate. Based on the analysis of the model, two equilibrium points are obtained, namely non-endemic equilibrium points (E0) and endemic equilibrium points (E1). Both equilibrium points are conditional asymptotically stable. The nonendemic equilibrium point will be asymptotically stable if rh > dh, rs > ds and R0 < 1, while the endemic equilibrium point will be asymptotically stable if R0 > 1. Sensitivity analysis shows that there are parameters that affect the spread of the disease. Based on numerical simulation results show that when R0 < 1, the number of infected human populations (Hi), the number of infected snail populations (Si), the amount of cercaria density (C) and the amount of miracidia density (M) will tend to decrease until finally extinct. Otherwise at the time R0 > 1, the number of the four populations tends to increase before finally being in a constant state.

Page 1 of 1 | Total Record : 5

 1 

Filter by Year

2020 2020


Reset
Filter By Issues
All Issue Vol. 6 No. 1 (2024) Vol. 5 No. 2 (2023) Vol. 5 No. 1 (2023) Vol. 4 No. 2 (2022) Vol. 4 No. 1 (2022) Vol. 3 No. 2 (2021) Vol. 3 No. 1 (2021) Vol. 2 No. 2 (2020) Vol. 2 No. 1 (2020) Vol. 1 No. 2 (2019) Vol. 1 No. 1 (2019) More Issue