cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Imam Mukhlash
Contact Email
imamm@matematika.its.ac.id
Phone
+6285648721814
Journal Mail Official
ijcsam.matematika@its.ac.id
Editorial Address
Departemen Matematika, Gedung F Lantai II, Kampus ITS, Keputih, Sukolilo-Surabaya 60111 Jawa Timur, Indonesia Phone: +62 31-5943354 Email:ijcsam.matematika@its.ac.id
Location
Kota surabaya,
Jawa timur
INDONESIA
International Journal of Computing Science and Applied Mathematics-IJCSAM
Published by Institut Teknologi Sepuluh Nopember Surabaya
ISSN : -     EISSN : 24775401     DOI : -
Core Subject : Education,
Mathematics
IJCSAM (International Journal of Computing Science and Applied Mathematics) is an open access journal publishing advanced results in the fields of computations, science and applied mathematics, as mentioned explicitly in the scope of the journal. The journal is geared towards dissemination of original research and practical contributions by both scientists and engineers, from both academia and industry. IJCSAM (International Journal of Computing Science and Applied Mathematics) is a journal published by Pusat Publikasi Ilmiah LPPM, Institut Teknologi Sepuluh Nopember, Surabaya, Indonesia.
Arjuna Subject : Matematika - Matematika Terapan
Articles 6 Documents
 1 
Search results for , issue "Vol. 7 No. 2 (2021)" : 6 Documents clear
An Application of Binary Cuckoo Search Algorithm to Orienteering Problem Giovano Alberto; Alfian Tan
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 7 No. 2 (2021)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

This research applies the cuckoo search metaheuristics model to find solutions to the Orienteering Problem (OP). The OP formulation is useful to model a situation in which someone wants to determine an optimal city route that is subject to a specified time constraint. OP can be categorized into NP Hard Problem which takes a very long time to analytically find the optimal solution as the number of entities involved increases. Therefore, metaheuristics often become an option to deal with this situation. A cuckoo search model based algorithm is developed in this research. An adjustment for discrete combinatorial problem is performed by adopting an idea of binary cuckoo search method. In addition, three types of local search methods are considered to improve the searching performance. This algorithm can eventually find better solutions for some of the 18 cases than two other benchmarked algorithms. Furthermore, experiment on model parameters shows that the worse nest fraction (P_alpha) affects the quality of solutions obtained.
Analysis Mathematical Model of Radicalization S(Susceptible) E(Extremists) R(Recruiters) I(Immunity) with Optimal Control Dauliyatu Achsina; Mardlijah Mardlijah
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 7 No. 2 (2021)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Radicalization is a process when people come to adopt increasingly extreme political or religious ideologies, radicalization almost occurs in almost all countries in the world. Seeing a number of cases in recent times, radicalization has become a major concern for the world, especially in the field of national security. Radicalization has become one of the focuses in the national security sector because it leads to acts of extremism, violence and terrorism. The level of radicalization is high in each year and continues to increase so special supervision is needed to control it because it causes huge financial losses. Therefore a preventive effort is needed to overcome this. Efforts to prevent radical movements have been widely used, ranging from direct or indirect, in addition some things have also been done directly by the government. So far it has not been seen how effective these efforts are. Radicalization is formed because of the influence of extremists and the recruiters group. Many individuals are affected and enter the group because they are influenced by the people in the group who are within their scope. To overcome these problems, a control is needed as an effort to prevent radicalism. Prevention efforts are in the form of strict sanctions given to recruiters. Next to find out how the influence of controls on individual groups of recruiters is needed a tool to represent the tool is a model. The mathematical model that is suitable for representing the appropriate problems of radicalization is the Susceptible (S) , Extremists (E) Recruiters (R), Immunity (I) model.
Accelerated Numerical Method for Singularly Perturbed Differential Difference Equations Habtamu Garoma Debela; Gemechis File Duressa; Masho Jima Kebeto
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 7 No. 2 (2021)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

In this paper, accelerated finite difference method for solving singularly perturbed delay reaction-diffusion equations is presented. First, the solution domain is discretized. Then, the derivatives in the given boundary value problem are replaced by finite difference approximations and the numerical scheme that provides algebraic systems of equations is obtained, which can easily be solved by Thomas algorithm. The consistency, stability and convergence of the method have been established. To increase the accuracy of our established scheme we used Richardson's extrapolation techniques. To validate the applicability of the proposed method, four model examples have been considered and solved for different values of perturbation parameters and mesh sizes. The numerical results have been presented in tables and graphs to illustrate; the present method approximates the exact solution very well. Moreover, the present method gives better accuracy than the existing numerical methods mentioned in the literature.
Identification of The Phases of The Spread of Covid-19 in Maluku Province with Richards Curve Nanang Ondi; Yopi Andry Lesnussa; Francis Yunito Rumlawang
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 7 No. 2 (2021)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Richards Curve is an extension of the Logistics Curve which was first discovered in 1959 and is a type of sigmoid curve where in the sigmoid curve there are 3 growth phases, namely the logarithmic phase, the linear phase and the aging phase. This research aims to identify and determine the phase of the spread of COVID-19 in Maluku province with the Richards curve. From the calculation results obtained that the initial phase of the spread occurred on March 23 - July 5 2020, the peak phase of the spread occurred on July 6 - October 22 2020, the final phase of the peak of the spread occurred on October 23, 2020 - April 14, 2021 and began to enter the final phase of the spread on April 15, 2021.
Effect of Fear in Leslie-Gower Predator-Prey Model with Beddington-DeAngelis Functional Response Incorporating Prey Refuge Adin Lazuardy Firdiansyah
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 7 No. 2 (2021)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

In the present paper, we study the effect of antipredator behavior due to fear of predation on a modified Leslie-Gower predator-prey model incorporating prey refuge which predation rate of predators follows Beddington-DeAngelis functional response. The biological justification of the model is demonstrated through non-negativity, boundedness, and permanence. Next, we perform the analysis of equilibrium and local stability. We obtain four equilibrium points where two points are locally asymptotically stable and other points are unstable. Besides, we show the effect of the fear in the model and obtain a conclusion that the increased rate of fear can decrease the density of both populations, and prey populations become extinct. Meanwhile, for the case with a constant rate of fear, the prey refuge helpful to the existence of both populations. However, for the case with the fear effect is large, prey refuge cannot cause the extinction of predators. Several numerical simulations are performed to support our analytical results.
Digital Option Pricing Approach Using A Homotopy Perturbation Method Amirul Hakam; Islachiyatul Ummah; Frida Akbar Rani; Nur Asiyah; Endah RM. Putri
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 7 No. 2 (2021)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

An option is a financial contract between buyers and sellers. The Black-Scholes equation is the most popular mathematical equation used to analyze the option pricing. The exact solution of the Black-Scholes equation can be approached by several approximation methods, one of the method is a Homotopy Perturbation Method (HPM). The simplest type of option, digital options were analyzed using the HPM. The digital option pricing approach using the HPM is in a power series form, which in this paper is presented the solution in the fourth power. This solution is compared with the exact solution of the Black-Scholes equation for digital options. The results show that the approach using HPM is very accurate.

Page 1 of 1 | Total Record : 6

 1 

Filter by Year

2021 2021


Reset
Filter By Issues
All Issue Vol. 11 No. 2 (2025) Vol. 11 No. 1 (2025) Vol. 10 No. 2 (2024) Vol. 10 No. 1 (2024) Vol. 9 No. 2 (2023) Vol. 9 No. 1 (2023) Vol. 8 No. 2 (2022) Vol. 8 No. 1 (2022) Vol. 7 No. 2 (2021) Vol. 7 No. 1 (2021) Vol. 6 No. 2 (2020) Vol. 6 No. 1 (2020) Vol. 5 No. 2 (2019) Vol. 5 No. 1 (2019) Vol. 4 No. 2 (2018) Vol. 4 No. 1 (2018) Vol. 3 No. 2 (2017) Vol. 3 No. 1 (2017) Vol. 2 No. 3 (2016) Vol. 2 No. 2 (2016) Vol. 2 No. 1 (2016) Vol. 1 No. 1 (2015) More Issue