cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Resmawan
Contact Email
resmawan@ung.ac.id
Phone
+6285255230451
Journal Mail Official
info.jjom@ung.ac.d
Editorial Address
Jl. Prof. Dr. Ing. B. J. Habibie, Moutong, Tilongkabila, Kabupaten Bone Bolango, Gorontalo, Indonesia
Location
Kota gorontalo,
Gorontalo
INDONESIA
Jambura Journal of Mathematics
Published by Universitas Negeri Gorontalo
ISSN : 26545616     EISSN : 26561344     DOI : https://doi.org/10.34312/jjom
Core Subject : Education,
Mathematics
Jambura Journal of Mathematics (JJoM) is a peer-reviewed journal published by Department of Mathematics, State University of Gorontalo. This journal is available in print and online and highly respects the publication ethic and avoids any type of plagiarism. JJoM is intended as a communication forum for mathematicians and other scientists from many practitioners who use mathematics in research. The scope of the articles published in this journal deal with a broad range of topics, including: Mathematics; Applied Mathematics; Statistics; Applied Statistics.
Arjuna Subject : -
Articles 165 Documents
 13   14   15   16   17 
Constructing DNA Codes with Larger Distance from Quaternary Words Pradipta, Benediktus Panji; Puspita, Nikken Prima
Jambura Journal of Mathematics Vol 7, No 2: August 2025
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/jjom.v7i2.33132

Abstract

In this work, we propose a novel method to construct DNA codes from quaternary words. The method uses permutation groups that act in the set {1, 2, …, 4n}, representing the coordinate and coordinate value of quaternary words. The DNA code is obtained by finding a clique of the construction graph and mapping it using the bijective map 0 → A, 1 → C, 2 → T, 3 → G. We present a new approach to construct DNA codes with larger Hamming distance and reverse-complement distance compared to previously obtained DNA codes. This is achieved by using a modified construction graph tailored to the desired distance parameter. As a result, we can refine a DNA code to have improved Hamming distance and reverse-complement distance while maintaining the fixed GC-content constraint. This method simplifies the search for DNA codes with large distance parameters.
Performance Comparison of VGG16, MobileNetV2, and InceptionV3 Convolutional Neural Networks in Classifying Facial Dermatological Conditions Nadiyah, Fadilah Karamun Nisaa; Alifah, Nayla Nur; Nurdiati, Sri; Khatizah, Elis; Najib, Mohamad Khoirun
Jambura Journal of Mathematics Vol 7, No 2: August 2025
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/jjom.v7i2.33082

Abstract

This study investigates the performance of three convolutional neural network (CNN) architectures (VGG16, MobileNetV2 and InceptionV3) in classifying two common facial dermatological conditions: acne and dark spots. A dataset of 235 facial skin images was augmented, then used to train and evaluate each model using standard classification metrics such as accuracy, precision, recall, and F1-score. The results demonstrate that MobileNetV2 achieved the highest classification accuracy of 93.13% while maintaining a relatively low computational cost. The model exhibited perfect precision (1.00) for the acne class and a high recall of 0.99 for the dark spots class, indicating its strong capability in accurately and sensitively identifying both lesion types. All three models demonstrated acceptable classification performance for both acne and dark spots classes, as evidenced by their precision, recall, and F1-scores exceeding 70%. This indicates that each model was capable of capturing relevant discriminative features of both lesion types.
Graf Konjugasi dari Hasil Kali Langsung Grup Alternating A4 dan Grup Simetri S3 Muammar, Muhammad Fikri; Faisol, Ahmad; Fitriani, Fitriani
Jambura Journal of Mathematics Vol 7, No 2: August 2025
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/jjom.v7i2.32926

Abstract

This study investigates the structure of conjugacy graphs formed from the conjugacy classes in the alternating group A4, the symmetric group S3, and their direct product A4 × S3. Using Mathematica, the conjugacy classes of each group are determined, and the corresponding conjugacy graphs are constructed to represent the relationships between the classes. The results show that the conjugacy graphs of A4 × S3 form a complete graph Kᵢ×ⱼ, where i and j are the number of conjugacy classes in A4 and S3, respectively. These findings indicate that the conjugacy structure of the direct product exhibits a distinctive combinatorial complexity derived from its component groups.
Optimalitas Rute pada Pengiriman Multiperjalanan dengan Armada Kendaraan Listrik Heterogen Salsabilla, Kamilia; Bakhtiar, Toni; Hanum, Farida
Jambura Journal of Mathematics Vol 6, No 1: February 2024
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/jjom.v6i1.23993

Abstract

Electric vehicles are emerging as a key trend in sustainable mobility, mitigating emissions, and reducing dependence on fossil fuels. The challenge in optimizing route modeling lies in some limitations, such as battery range, charging time, and the diversity of electric vehicle types. This article explores the optimality of routes in a multiple-trip distribution system using a heterogeneous fleet of electric vehicles. The electric vehicle routing problem is formulated as a mixed-integer linear programming aiming to find the most cost-efficient optimal route. A notable feature of the model allows electric vehicle fleets to undertake additional travel to complete distribution tasks, i.e., multiple trips. The model is implemented in two illustrative examples involving the delivery of goods using homogeneous and heterogeneous electric vehicle fleets characterized by loading and battery capacities. Each case includes one depot, 8 and 10 customers, and 2 battery swapping stations, solved using the branch-and-bound method through Lingo 18.0. Simulation results indicate that battery capacity and the presence of battery swapping stations significantly influence the routes selection.
Application of the Laguerre Perturbed Galerkin Analysis Method for Solving Higher-Order Integro-Differential Equations Adebisi, Ajimot Folasade; Ojurongbe, Taiwo Adetola; Okunola, Kazeem Adekunle
Jambura Journal of Mathematics Articles in press
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

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

Abstract

This study presents the development and implementation of a novel numerical method, the Laguerre Perturbed Galerkin (LPG) method, for solving higher-order integro-differential equations. This method leverages the advantages of Laguerre polynomials as basis functions while incorporating Chebyshev polynomials as perturbation terms to enhance accuracy and efficiency. In the LPG method, the solution is approximated using Laguerre polynomials of degree (N), with the residual error minimized via a Galerkin approach. The Chebyshev polynomials serve as perturbation terms to refine the accuracy of the solution. The residual is systematically reduced to an (n+1) system of equations, which is then solved to determine the unknown coefficients of the approximating Laguerre polynomials. Comparative analyses demonstrate that the method achieves superior accuracy and convergence rates compared to existing techniques, particularly for higher-order integro-differential equations. The findings contribute significantly to the advancement of numerical methods in this domain, providing a powerful computational tool for scientists and engineers.

Page 17 of 17 | Total Record : 165

 13   14   15   16   17 

Filter by Year

2019 2025


Reset
Filter By Issues
All Issue Vol 7, No 2: August 2025 Vol 7, No 1: February 2025 Articles in press Vol 6, No 2: August 2024 Vol 6, No 1: February 2024 Vol 5, No 2: August 2023 Vol 5, No 1: February 2023 Vol 4, No 2: July 2022 Vol 4, No 1: January 2022 Vol 3, No 2: July 2021 Vol 3, No 1: January 2021 Vol 2, No 2: Juli 2020 Vol 2, No 1: Januari 2020 Vol 1, No 2: Juli 2019 Vol 1, No 1: Januari 2019 More Issue