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 137 Documents
 8   9   10   11   12 
Speed Estimation On Moving Vehicle Based On Digital Image Processing Danang Wahyu Wicaksono; Budi Setiyono
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 3 No. 1 (2017)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Along with the development of information and communication technology, the world urban people now recognize a new term called Smart City. One of Smart City components is smart transportation, known as Intelligent Transportation System (ITS) in which there is transportation management on the highway. Installation of CCTV (Closed Circuit Television) on the streets are now widely performed. It can be used to monitor conditions and detect problems such as traffic jam and vehicle speed limit violation. This research focuses on vehicle speed estimation using image processing from video data and Euclidean distance method with many different camera angles. The first step, video data is extracted into frames and applied preprocessing to extracted frames to minimize shadow effect. Then, using Gaussian Mixture Model (GMM) to extract foreground image. In the next step, the obtained foreground is filtered using median filter, shadow removing, and morphology operation. The detected vehicle object will be tracked to determine the location in each frame to estimate the speed based on its distance between frames. From the obtained results, this system is capable on estimating the speed of moving vehicle with the lowest accuracy is 87.01% and the highest accuracy is 99.38%.
Integration-Based Method as an Alternative Way to Estimate Parameters in the IV Bolus Compartment Model Diny Zulkarnaen; Fadilah Ilahi; Muhammad Syifa Irfani; Dani Suandi
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 10 No. 1 (2024)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

An alternative method of integration-based parameter estimation applied in pharmacokinetics problems is proposed here. The method, introduced by Holder and Rodrigo, is used to estimate the rate of drug elimination and distribution when it enters the body via intravenous bolus. The estimation results are then compared with the classical method, the least squares method for the one-compartment model, and the residual method for the two-compartment model. Graphical simulations of drug concentration versus time are also performed in this article to view not only the dynamics of drug delivery in the body, but also the comparisons between the approximate solutions and the arbitrarily generated data points. Comparisons are also presented when the data points take into account noise in the form of random values. Based on the estimation and simulation results, the integration-based method gives good results and even better than the classical method although when noise is applied to the data points.
Modeling Coffee Price using Jump Diffusion Model: The case of Ethiopia Tesfahun Berhane; Molalign Adam; Guriju Awgichew; Eshetu Haile
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 5 No. 1 (2019)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Ethiopian coffee price has significant effect on the economy of the country and its price is highly fluctuated. In this study, we aim at modeling and forecasting the washed Sidama class A grade 3 (WSDA3) coffee price in Ethiopia to reduce the risks associated with this price fluctuation. We used daily closed price data of Ethiopian WSDA3 coffee recorded in the period 31 May 2011 to 30 March 2018 obtained from Ethiopia commodity exchange (ECX) market to analyse the prices fluctuation. The nature of log-returns of the price is asymmetric (negatively skewed) and exhibits high kurtosis. We used a Jump diffusion model to model and forecast the empirical data. The method of maximum likelihood is used to estimate the parameters. We used the root mean square error (RMSE) to test the goodness of fitting for the model to the data. This test indicates that the model performs well.
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.
Sequence Alignment Using Nature-Inspired Metaheuristic Algorithms Muhammad Luthfi Shahab; Mohammad Isa Irawan
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 3 No. 1 (2017)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

The most basic process in sequence analysis is sequence alignment, usually solved by dynamic programming Needleman-Wunsch algorithm. However, Needleman-Wunsch algorithm has some lack when the length of the sequence which is aligned is big enough. Because of that, sequence alignment is solved by metaheuristic algorithms. In the present, there are a lot of new metaheuristic algorithms based on natural behavior of some species, we usually call them as nature-inspired metaheuristic algorithms. Some of those algorithm that are more efficient are firefly algorithm, cuckoo search, and flower pollination algorithm. In this research, we use those algorithms to solve sequence alignment. The results show that those algorithms can be used to solve sequence alignment with good result and linear time computation.
Elementary Algorithmic Methods for Solving Suguru Puzzles Butrahandisya Butrahandisya; Muhammad Atzaki; Gia Septiana Wulandari
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 10 No. 1 (2024)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

We discuss elementary algorithmic aspects of the Suguru puzzle---a single-player paper-and-pencil puzzle introduced in 2001 and confirmed NP-complete in 2022. We propose a backtracking algorithm with pruning optimizations for solving an $m \times n$ Suguru puzzles containing $R$ regions and $H$ hint cells in $O(R \cdot (mn-H+2)!)$ time. Despite this factorial asymptotic upper bound, a C++ implementation of our proposed algorithm successfully solved all Suguru instances with no more than $100$ cells using a personal computer in less than $0.5$ second. We also prove that any Suguru instance of size $m \times n$ with either $m = 1$ or $n = 1$ can be solved in linear time in terms of the puzzle size. Finally, we provide an upper bound for the number of solutions to such tractable instances.
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.
Object Oriented Design of Software Tool for Finite Abstractions of Max-Plus-Linear Systems using Unified Modeling Language Muhammadun Muhammadun; Dieky Adzkiya; Imam Mukhlash
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 3 No. 1 (2017)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Max-Plus-Linear (MPL) systems are a class of discrete-event systems with a continuous state space characterizing the timing of the underlying sequential discrete events. There is a formal approach to analyze these systems based on finite abstractions. The abstraction algorithms have been in MATLAB using list data structure and in JAVA using tree data structure. The MATLAB implementation requires long computational time, whereas the JAVA one requires larger memory allocation. In this work, we discuss an object oriented design in C++ using tree data structure without recursive functions in the hope of improving the results obtained by the two previous implementations.
Nano-Zagreb Index and Multiplicative Nano-Zagreb Index of Some Graph Operations Akbar Jahanbani; Hajar Shooshtary
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 5 No. 1 (2019)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Let G be a graph with vertex set V(G) and edge set E(G). The Nano-Zagreb and multiplicative Nano-Zagreb indices of G are NZ(G) = \prod_{uv \in E(G)} (d^2(u) - d^2(v)) and N*Z(G) = \prod_{uv \in E(G)} (d^2(u) - d^2(v)), respectively, where d(v) is the degree of the vertex v. In this paper, we define two types of Zagreb indices based on degrees of vertices. Also the Nano-Zagreb index and multiplicative Nano-Zagreb index of the Cartesian product, symmetric difference, composition and disjunction of graphs are computed.
In Search of Dotless Kropki Puzzle Solution Andri Purnama Ramadan
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 10 No. 1 (2024)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Searching all possible solution and finding the minimum number of clues to make uniquely solvable puzzle always been a natural question for puzzle enthusiast. However, the attempt usually provide that as difficult task. In this paper, we attempt to search the solution of Kropki puzzle without dot clues given with graph theory approach, which resulted in a conjectures involving the planarity of graph and cyclicity of latin square.

Page 10 of 14 | Total Record : 137

 8   9   10   11   12 

Filter by Year

2015 2025


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