cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota surabaya,
Jawa timur
INDONESIA
International Journal of Computing Science and Applied Mathematics
Published by Institut Teknologi Sepuluh Nopember Surabaya
ISSN : -     EISSN : 24775401     DOI : -
Core Subject : Science, Education,
Computer Science & IT 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.
Arjuna Subject : -
Articles 121 Documents
 9   10   11   12   13 
Front Cover Vol.8 No.2 2022 Ijcsam Editor
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 8, No 2 (2022)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v8i2.14515

Abstract

Elementary Analysis of the Communication Complexity of Divide-and-Conquer Diffie-Hellman Key Agreement Protocol Muhammad Arzaki
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 8, No 2 (2022)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v8i2.13414

Abstract

We present a rigorous elementary analysis of the communication complexity of the Divide-and-Conquer Diffie-Hellman Key Agreement Protocol (DC-DHKA). The analysis is conducted by first determining the number of transmissions in DC-DHKA and then comparing the resulting communication complexity of this protocol with other variants of Diffie-Hellman key agreement protocols that utilize regular Diffie-Hellman key, namely the ING, GDH.1, GDH.2, and GDH.3 protocols. The mathematical and numerical analyses show that the total number of bits transmitted in the DC-DHKA protocol is always fewer than those of ING, GDH.1, and GDH.2 protocols for a group of N >= 19 participants. In addition, we also prove that the total number of bits required for the entire messages’ transmissions in DC-DHKA protocol for N participants that uses the multiplicative group Fq* is log2(q) 2^(log2(N)) (log2(N) + 1) - 2.
Ijcsam Editors Ijcsam Editor
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 8, No 2 (2022)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v8i2.14516

Abstract

Solving Yin-Yang Puzzles Using Exhaustive Search and Prune-and-Search Algorithms Made Indrayana Putra; Muhammad Arzaki; Gia Septiana Wulandari
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 8, No 2 (2022)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v8i2.13720

Abstract

We investigate some algorithmic and mathematical aspects of Yin-Yang/Shiromaru-Kuromaru puzzles. Specifically, we discuss two algorithms for solving arbitrary Yin-Yang puzzles, namely the exhaustive search approach and the prune-and-search technique. We show that both algorithms have an identical asymptotic running time of O(max{mn, 2^(mn−h)}) for finding all solutions of a Yin-Yang instance with h hints of size m x n. Nevertheless, our experiments show that the practical running time of the prune-and-search technique outperforms the conventional exhaustive search approach.
Optimal Control of HIV-1 Spread in Combination with Nutritional Status and ARV-Treatment Yolanda Norasia; Zulaikha Zulaikha; Mohamad Tafrikan; Mohammad Ghani; Denis Sospeter Mukama
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 8, No 2 (2022)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v8i2.13764

Abstract

HIV-1 is a virulent virus, it has the ability to easily spread the virus. This study aims to optimally control the spread of the HIV-1 virus with SIPA (Susceptible-Infection-PreAIDSAIDS) model by using nutritional status and ARV-treatment. Assessment of nutritional status is carried out on people with HIV/AIDS (ODHA). The results showed that the control in the form of nutritional status and ARV-treatment was able to reduce the infected subpopulation. Routine assessment of nutritional status can form balanced nutrition for ODHA. ARV-treatment works by reducing the amount of HIV viral load, so that HIV infection cannot cause disorders of the immune system.
The Construction of Mathematical Model for the Mechanism of Protein Synthesis Involving mTORC1 from the AMPK Pathway Ari Kusumastuti; Mohammad Jamhuri; Dewi Firdaus; Nurul Anggraeni Hidayati
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 9, No 1 (2023)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v9i1.14351

Abstract

This study discusses the construction of mathematical models for the mechanism of protein synthesis involving the main regulator mTORC1 gene which is described in the singular pathway mTOR of the AMPK pathway. The genes in question include: AMPK, TSC2, Rheb, mTORC1 and S6K. The method used for this research is divided into two stages, namely pathway analysis for the mechanism of protein synthesis and the second is the formulation of mathematical models. Pathway analysis is performed as a reference in describing interactions in the form of kinetic reaction schemes. After the interaction scheme is created, it is then formulated into a mathematical model with the independent variable being time. Mathematical models for the mechanism of protein synthesis involving mTORC1 of the AMPK pathway in the form of ordinary time-dependent differential equations involving independent variables [TSC2], [pAMPK], [pTSC2], [Rheb^{GTP}], [Rheb^{GDP}], [mTORC1], [Raptor], [aRaptor], [Deptor], [PRAS40], [mTOR], [amTORC1], [mLST8], [S6K1] and [pS6K1].
Determine the Solution of Delay Differential Equations using Runge-Kutta Methods with Cubic-Spline Interpolation Agus Dahlia; Rahma Qudsi
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 9, No 1 (2023)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v9i1.6218

Abstract

This paper describes some iterations for term delay in Delay Differential Equation (DDE), which is causing a huge number of iteration calculations. Time-delay was approximated using Cubic-Spline Interpolation, so DDE can rewrite as Differential Equations. Then, Runge-Kutta methods have been used to determine the solution of Differential equations from DDE.
Convergence and Completeness in L_2 (P) with respect to a Partial Metric Annisa Rahmita Soemarsono; Mahmud Yunus; Erna Apriliani; Adam Adam
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 9, No 1 (2023)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v9i1.15064

Abstract

Metric spaces can be generalized to be partial metric spaces. Partial metric spaces have a unique concept related to a distance. In usual case, there is no distance from two same points. But, we can obtain the distance from two same points in partial metric spaces. It means that the distance is not absolutely zero. Using the basic concept of partial metric spaces, we find analogy between metric spaces and partial metric spaces. We define a metric d^p formed by a partial metric p, with applying characteristics of metric and partial metric. At the beginning, we implement the metric d^p to determine sequences in L_2 (P). We then ensure the convergence and completeness in L_2 [a,b] can be established in L_2 (P). In this study, we conclude that the convergence and completeness in L_2 [a,b]  can be established in L_2 (P) by constructing a partial metric p_2 induced by a metric d^p.
On the Reciprocal Sums of Generalized Fibonacci-Like Sequence Musraini M.; Rustam Efendi; Endang Lily; Noor El Goldameir; Verrel Rievaldo Wijaya
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 9, No 1 (2023)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v9i1.7895

Abstract

The Fibonacci and Lucas sequences have been generalized in many ways, some by preserving the initial conditions, and others by preserving the recurrence relation. One of them is defined by the relation B_n = B_{n−1} + B_{n−2}, n >= 2 with the initial condition B_0 = 2s, B_1 = s + 1 where s in Z. In this paper, we consider the reciprocal sums of B_n and B^2_n, with an established result that also involve Bn.
FRONT COVER VOL.9 NO.1 2023 Editor Ijcsam
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 9, No 1 (2023)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v9i1.16077

Abstract

Page 11 of 13 | Total Record : 121

 9   10   11   12   13 

Filter by Year

2015 2023


Reset
Filter By Issues
All Issue 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