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. 10 No. 1 (2024)" : 6 Documents clear
Bi-Edge Metric Dimension of Graphs Rinurwati Rinurwati; Fadillah Dian Maharani
(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

Given a connected G = (V(G),E(G)) graph. The main problem in graph metric dimensions is calculating the metric dimensions and their characterization. In this research, a new dimension concept is introduced, namely a bi-edge metric dimension of graph which is a development of the concpet of bi-metric graphs with the innovation of bi-metric graph representations to become the bi-edge metric graph representations. In this case, what is meant by bi-edge metric and edge detour. If there is a set in G that causes every edge in G has a different bi-edge metric representation in G, then that set is called the biedge metric resolving set. The minimum cardinality of the bi-edge metric resolving set graphs is called the bi-edge metric dimension of G graph, denoted by edimb(G). The spesific purpose of this research is to apply the concept of bi-edge metric dimensions to special graphs, such as cycle, complete, star and path can be obtained.
Connectivity of The Triple Idempotent Graph of Ring Zn Vika Yugi Kurniawan; Bayu Purboutomo; Sutrima Sutrima; Nughthoh Arfawi Kurdhi
(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

Hybrid ARIMA Modeling with Stochastic Volatility for Forecasting the Value of Non-Oil and Gas Exports in Indonesia Evatia Suryatin; Mustika Hadijati; Zulhan Widya Baskara
(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

Export activities consist of oil and gas exports and non-oil and gas exports. Non-oil and gas exports are one of the sectors that provide the largest foreign exchange contribution to Indonesia, and the movement of non-oil and gas export values has an impact on economic growth. Therefore, the purpose of this research is to create a model used to predict future non-oil and gas export values. One mathematical model that can be to predict Indonesia’s non-oil and gas export values is the combination of the ARIMA model and the stochastic volatility model, also known as Hybrid ARIMA with stochastic volatility. The Hybrid ARIMA with stochastic volatility modeling has advantages in creating models for data with high volatility and is capable of combining linear patterned data and nonlinear patterned data. In this study, the best ARIMA (1,1,1) model was obtained with a MAPE value of 13.2082%. From the residuals of the ARIMA (1,1,1) model, there were signs of heteroscedasticity, so the GARCH model with the best GARCH (0,1) model was used. In the GARCH (0,1) model, it was found that there was an asymmetric influence, so the EGARCH and GJR-GARCH models were used. The comparison of EGARCH and GJR-GARCH models was carried out to address the asymmetric residual data pattern. Based on the research results, the best model used for prediction is the hybrid ARIMA (1,1,1) with EGARCH (1,1) model, with a MAPE value of 9.35158%.
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.
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.
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 1 of 1 | Total Record : 6

 1 

Filter by Year

2024 2024


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