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
 6   7   8   9   10 
Simulation of a Mathematical Model of Proteins Interaction on GLUT4 Translocation Ari Kusumastuti; Mohammad Isa Irawan; Kistosil Fahim; Nurul Anggraeni Hidayati; Anindita Sharkar
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 10 No. 2 (2024)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.ijcsam.v10i2.4606

Abstract

Glucose is the energy source of cells. Glucose absorption into muscle cells is regulated by Insulin by involving the interaction of several proteins in a specific system. The system works for the translocation of GLUT4 to the cell membrane. GLUT4 is a transporter protein owned by every muscle cell, as an entry gate for glucose and an Insulin partner in maintaining homeostasis of blood glucose levels. After the Insulin activation occurs in the Insulin Receptor Substrate (IRS), it is followed by the activation of several proteins to regulate GLUT4 translocation, namely IRS, phosphatidylinositol 3-kinase (P13K), 3-phosphoinositide-dependent protein kinase-1 (PDK1/2) and serine/threonine-protein kinase (AKT). This study describes these processes in a mathematical model as a system of ordinary differential equations. The specific process modeled is the Insulin signal pathway that regulates GLUT4 translocation, which can be accessed on Kegg.jp. Moreover, string.db.org analysis results are used as a reference to prove the type of protein interaction. The formulated model is directed to coherently explain the flux changes of each protein involved in the system and stimulate easily. The simulation provides an overview of the protein dynamics in the system over time. Finally, the mathematical models and simulations will complement the basic understanding of the effect of glucose absorption on the translocation of GLUT4.
On The Lagrange Interpolation of Fibonacci Sequence Muhammad Syifa'ul Mufid; Tahiyatul Asfihani; Lukman Hanafi
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 2 No. 3 (2016)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Fibonacci sequence is one of the most common sequences in mathematics. It was first introduced by Leonardo Pisa in his book Liber Abaci (1202). From the first n + 1 terms of Fibonacci sequence, a polynomial of degree at most n can be constructed using Lagrange interpolation. In this paper, we show that this Fibonacci Lagrange Interpolation Polynomial (FLIP) can be obtained both recursively and implicitly.
An Inventory Model for Deteriorated Item with Time- and Inventory-dependent Demand and Backorder Dharma Lesmono; Taufik Limansyah; Ignatius A. Sandy
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 10 No. 2 (2024)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.ijcsam.v10i2.4609

Abstract

The paper focuses on developing an inventory model for deteriorated item when demand is time- and inventorydependent. Deteriorated items can usually be found in items such as vegetables, fruit, milk, chemical product, pharmaceutical and it needs special attention in managing this kind of inventory. We model the inventory control for these items by a mathematical model involving time- and inventory-dependent demand and considering the backorder policy in handling shortages. The developed model aims to find the optimal time between replenishment and when inventory drops to zero, which minimizes the total inventory cost. The total inventory cost consists of the purchase cost, the order cost, the holding cost, and the shortage cost. Sensitivity analysis is performed to analyse the effect of changing the parameters’ values to the time between replenishment, when inventory drops to zero, the order quantity, and the total inventory cost. The finding shows that changing the parameters’ values of deterioration rate, demand, unit holding cost, unit holding cost and unit shortage cost will have an impact on the time between replenishment, time when inventory drops to zero, order quantity, and inventory cost.
Effect of Major Axis Length to the Pressure on Ellips Chairul Imron; Erna Apriliani
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 2 No. 3 (2016)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Fluid concept has been widely applied to solve problems of daily life, one example is the problem of fluid flow around an elliptical cylinder. We have a goal to solve the problem of fluid flow through three cylindrical ellipses using side-by-side configuration. The equation we use to solve the problem is the Navier-Stokes equations, incompressible, viscous and unsteady. We use the finite difference method with a uniform grid and SIMPLE (Semi Implicit Method for Pressure-Linked Equations) algorithms. Results of this study were used to obtain the amount of pressure that is received by an ellipse in the middle and to construct mathematical models. The profile of the fluid flow is simulated by varying the length of the major axis of the ellipse in the middle where K/5a = 1.0; 1.1; 1.2; 1.3; 1.4 and 1.5 and Reynolds Re = 3.000 and the distance between the ellipse is 3.
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.
Empowering New Capital Zones: East Kalimantan’s Economic District Outlooks Using Location Quotient and Cluster Analysis Mega Silfiani; Diana Nurlaily; Irma Fitria
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 10 No. 2 (2024)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.ijcsam.v10i2.4613

Abstract

This research focuses on investigating the economy of the new capital buffer zone by identifying and clustering its leading sectors in GRDP (Gross Regional Domestic Product) of East Kalimantan. The identification of a region’s leading sector through LQ (Location Quotient) index has proven to be effective. In addition, k-means clustering and Self-Organizing Maps (SOM) are adopted to provide comprehensive insights. The results show that LQ index quickly identifies the main sectors in each district of East Kalimantan. In addition, the kmeans clustering has better performance than SOM based on the Silhouette coefficient. This meticulous analysis confirms the existence of two distinct clusters, one including eight members and the other consisting of only two. Anticipating future research endeavours, the exploration of various approaches for constructing clusters, encompassing both hierarchical and non-hierarchical approaches, provides the potential to enhance the performance of clusters. By investigating this structure, a more comprehensive comprehension of the economic framework of East Kalimantan can be achieved, as well as its potential role as a buffer for the capital region.
The Fuzzy Lattice of Ideals and Filters of an Almost Distributive Fuzzy Lattice Berhanu Assaye Alaba; Bekalu Tarekegn
(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

In this paper, the concept of fuzzy lattice is discussed. It is proved that a fuzzy poset (IA(L),B) and (FA(L),B) forms a fuzzy lattice, where IA(L) and FA(L) are the set containing all ideals, and the set containing all filters of an Almost Distributive Fuzzy Lattice(ADFL) respectively. In addition we proved that, a fuzzy poset (PIA(L),B) and (PFA(L),B) forms fuzzy distributive lattice, where PIA and PFA(L) denotes the set containing all principal ideals and the set containing all principal filters of an ADFL. Finally, it is proved that for any ideal I and filter F of an ADFL, IiA = {(i]A : i in I} and FfA = {[f)A : f in F} are ideals of a fuzzy distributive lattice (PIA(L),B) and (PFA(L),B) respectively, and FiA = {(f]A : f in F} and IfA = {[i)A : i in I} are filters of a distributive fuzzy lattice (PIA(L),B) and (PFA(L),B) respectively.
Comparison of Numerical Methods on Pricing of European Put Options Lutfi Mardianto; Aditya Putra Pratama; Annisa Rahmita Soemarsono; Amirul Hakam; Endah Rokhmati Merdika Putri
(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

Put option is a contract to sell some underlying assets in the future with a certain price. On European put options, selling only can be exercised at maturity date. Behavior of European put options price can be modeled by using the Black-Scholes model which provide an analytical solution. Numerical approximation such as binomial tree, explicit and implicit finite difference methods also can be used to solve Black-Scholes model. Some numerical methods are applied and compared with the analytical solution to determine the best numerical method. The results show that numerical approximations using the binomial tree is more accurate than explicit and implicit finite difference method in pricing European put options. Moreover when the value of T is higher then the error obtained is also higher, while the error obtained is lower when the value of N is higher. The value of T and N cause the increase of the computation time. When the value of T is higher the computation time is lower, while computation time is higher if the value of N is higher. Overall, the lowest computation time is obtained by using an explicit finite difference method with an exceptional as the value of T is big and the value of N is small. The lowest computation time is obtained by using a binomial tree method.
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.
Second Degree Refinement Jacobi Iteration Method for Solving System of Linear Equation Tesfaye Kebede
(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

Several iterative techniques for the solution of linear system of equations have been proposed in different literature in the past.In this paper, we present a Second degree of refinement Jacobi Iteration method for solving system of linear equation, Ax = b and we consider few numerical examples and spectral radius to show that the effective of the Second degree of refinement Jacobi Iteration Method (SDRJ) in comparison with other methods of First degree Jacobi (FDJ), First degree Refinement Jacobi (FDRJ) and Second degree Jacobi (SDJ) method.

Page 8 of 14 | Total Record : 137

 6   7   8   9   10 

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