cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Lyra Yulianti
Contact Email
lyra@sci.unand.ac.id
Phone
-
Journal Mail Official
lyra@si.unand.ac.id
Editorial Address
http://jmua.fmipa.unand.ac.id/index.php/jmua/index
Location
Kota padang,
Sumatera barat
INDONESIA
Jurnal Matematika UNAND
Published by Universitas Andalas
ISSN : 2303291X     EISSN : 27219410     DOI : -
Core Subject : Science, Education,
Computer Science & IT Mathematics
Fokus dan Lingkup dari Jurnal Matematika FMIPA Unand meliputi topik-topik dalam Matematika sebagai berikut : Analisis dan Geometri Aljabar Matematika Terapan Matematika Kombinatorika Statistika dan Teori Peluang.
Arjuna Subject : -
Articles 858 Documents
 82   83   84   85   86 
BOUNDEDNESS OF GENERALIZED FRACTIONAL INTEGRALS ON GENERALIZED WEIGHTED MORREY SPACES OVER METRIC MEASURE SPACES AND APPLICATIONS Ramadana, Yusuf
Jurnal Matematika UNAND Vol. 15 No. 1 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.1.1-16.2026

Abstract

In this paper we investigate the boundedness properties of generalized fractional integral on generalized weighted Morrey spaces over metric measure spaces. The measure used in this paper is a doubling measure which satisfies the growth condition. The results show that the generalized fractional integral is bounded from one generalized weighted Morrey spaces to another generalized weighted Morrey space over metric measure spaces either with the same or with the different parameters. Our results extend the known results for fractional integrals on generalized Morrey spaces. We then investigate the regularity of the solution of Dirichlet problem with the data in generalized weighted Morrey spaces by using the boundedness properties of the generalized fractional integral on generalized weighted Morrey space.
TARIFF ANALYSIS OF MOTOR INSURANCE USING GENERALIZED LINEAR MODEL (GLM) AND GRADIENT BOOSTING MACHINE (GBM) Alsitaningtyas, Yunike Jemis Fifnelavindy; Muhammad, Hubbi; Effendie, Adhitya Ronnie
Jurnal Matematika UNAND Vol. 15 No. 1 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.1.78-94.2026

Abstract

he insurance sector operates by managing the transfer of risk from policyholders to insurance providers, where premiums are charged as compensation for the assumed risk. Traditionally, premium determination in motor vehicle insurance relies on the Generalized Linear Model (GLM), which requires the response variable to follow a distribution from the exponential family and may have limitations in capturing non-linear relationships and complex interactions among rating factors. To address these limitations, this study compares the performance of the Generalized Linear Model (GLM) and the Gradient Boosting Machine (GBM) in modeling claim frequency and claim severity for motor vehicle insurance premiums. The analysis is conducted using an insurance dataset obtained from a public data repository, and both models are evaluated using K-Fold Cross Validation. Model performance is assessed based on the Root Mean Square Error (RMSE), which measures the average magnitude of prediction errors and is commonly used to evaluate predictive accuracy. The results indicate that the GBM consistently produces lower RMSE values than the GLM for both claim frequency and claim severity modeling, indicating superior predictive performance. However, despite its higher accuracy, the GBM model lacks the interpretability inherent in the GLM framework, which remains crucial for transparency and regulatory considerations in insurance premium determination. These findings suggest that while GBM is effective for improving prediction accuracy, GLM remains valuable for interpretability, and a complementary use of both approaches may provide optimal results in actuarial pricing applications
CLASSIFICATION OF GENDER INEQUALITY IN INDONESIA: UNSUPERVISED AND SUPERVISED LEARNING APPROACHES Nurhidayati, Maulida; Yunaita Rahmawati; Ajeng Wahyuni
Jurnal Matematika UNAND Vol. 15 No. 1 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.1.108-122.2026

Abstract

Gender inequality in Indonesia is a multidimensional problem that has a wide impact on human development. This study aims to model and classify the level of gender inequality between provinces in Indonesia with a combined approach of unsupervised and supervised learning. Secondary data from 38 provinces in 2024 were analyzed using five methods: K-Means, Self-Organizing Map (SOM), hybrid SOM-KMeans, Support Vector Machine (SVM), and Logistic Regression. In the unsupervised approach, the SOM and SOM-KMeans methods show better cluster coherence than K-Means. In the supervised approach, the SVM method provides better classification performance compared to logistic regression. Overall, SVM was obtained with the highest accuracy, which was 89.47%, surpassing other methods. This research makes a methodological contribution to the use of machine learning for spatial-based gender inequality risk mapping, as well as implications for more precise and adaptive data-based policymaking.
Optimizing Classroom Allocation using Markov Chain Model for Shifted Lecture Schedules Hayati, Nahrul; Sulistyono, Eko; Utami, Bulan Purnama
Jurnal Matematika UNAND Vol. 15 No. 1 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.1.17-29.2026

Abstract

This study aims to optimize classroom allocation for shift lecture schedules at the Batam Institut of Technology (ITEBA) using a Markov chain model. Classroom utilization data from the Odd and EVen Semesters of the 2024/2025 Academic Year were analyzed by defining four classroom usage states: occupied in the morning shift and vacant in the evening shift (OV), vacant in the morning shift and occupied in the evening shift (VO), occupied in both morning and evening shifts (OO), and vacant in both morning and evening shifts (VV). State transition analysis revealed patterns in classroom allocation dynamics between semesters, while steady-state analysis projected long term utilization. The results show a steady-state probability of 74.04% for the OO state (optimal utilization), but 15.48% of classrooms remain in the VV state (chronic underutilization). Based on these findings, the study recommends a classroom consolidation strategy based on complementary patterns, implementation of a digital reservation system, and optimization of single shift usage. This study concludes that the Markov chain model provides a scientific basis for strategic decision making in educational facility management.
A KINEMATIC ANALYSIS OF MECHANUM WHEEL WITH THE TAYLOR SERIES APPROXIMATION AT DIFFERENT ORDERS: Kinematics Analysis Haripamyu, Haripamyu; Rahmatullah Siregar, Fauzi; Syafwan, Mahdhivan
Jurnal Matematika UNAND Vol. 15 No. 1 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.1.30-43.2026

Abstract

The mecanum wheel is an essential component in omnidirectional robotic systems, enabling free movement in any direction without changing orientation. The complexity of its kinematics requires a mathematical model that is both accurate and efficient. This study analyzes the contact point velocity equations of a mecanum wheel by considering all velocity components, then simplifies them using first-, second-, and third-order Taylor series approximations. The model is numerically simulated for different numbers of rollers (N = 6, 8, 12) with predefined geometric and motion parameters. Simulation results show that the first-order approach produces relatively large errors, especially with fewer rollers. The second-order approach significantly reduces the Root Mean Square (RMS) error compared to the first order, while the third order provides no notable improvement over the second. Increasing the number of rollers also results in smoother and more accurate velocity curves. In conclusion, the second-order Taylor series approximation is sufficient to efficiently model mecanum wheel kinematics withhigh accuracy, making it suitable for mobile robot control applications.
ON INCLUSIVE TOTAL DISTANCE IRREGULARITY STRENGTH OF JOINT PRODUCT GRAPHS Dian Eka Wijayanti; Diari Indriati; Husin, Mohamad Nazri; Slamin
Jurnal Matematika UNAND Vol. 15 No. 1 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.1.44-56.2026

Abstract

Graph theory is one of the branches of mathematics that is rapidly developing due to its applications in solving various problems, including electronic networks, communication network models, transportation systems, and carbon reserve networks. The topology of these networks is simply represented using the concept of graphs. Specifically, graph labeling is widely used to address issues such as radio frequency assignment, computer network coding, data transfer optimization, and marketing distribution. Thus, conducting research to develop graph labeling methods is highly significant. Let $G=\left(V_G,E_G\right)$, be a simple connected graph, and $\lambda\ :V_G\cup E_G\rightarrow{1,\ 2,\ \ldots,\ k}$ be a labeling function on $G$. The inclusive weight of a vertex $v\in G$ is defined as the sum of the labels of $v$, all vertices in the $v$ neighborhood, and its incident edges. If all vertices in $V_G$ have a distinct inclusive weight, then $\lambda$ is called an inclusive distance vertex irregular total $k$-labeling of $G$ . The total distance vertex irregularity strength of $G$, denoted by $\widehat{tdis}\left(G\right)$, is the minimum $k$ for which such a labeling exists. This paper investigates the inclusive distance vertex irregular total $k$-labeling for certain classes of joint product graphs. Specifically, we determine the inclusive total distance irregularity strength of the joint product of path, cycle, and complete graphs, providing new insights into their structural labeling properties
Inclusive Distance Antimagic Labeling of Shadow Graph of Complete and Circulant Graph Arafah, Siti Hafshah Nurul; Sugeng, Kiki Ariyanti; Haryeni, Debi Oktia
Jurnal Matematika UNAND Vol. 15 No. 1 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.1.57-62.2026

Abstract

Consider a graph $G = (V, E)$ with order $n$. Suppose that we have a bijection $f: V(G) \to \{1, 2, ..., n\}$. A graph $G$ is said to admit an inclusive distance antimagic labeling if every pair of distinct vertices has different weights, with a vertex weight is defined by $w(v) = \sum_{u \in N(v)} f(u) + f(v)$. Furthermore, if the vertex weights form an arithmetic progression with the first term $a$ and the common difference $d$, then $G$ is said to admit an $(a,d)$-inclusive distance antimagic labeling. This paper investigates the inclusive distance antimagic labeling of the shadow graph of the complete and circulant graph.
THE PARTITION DIMENSION OF ROSE GRAPHS AND ITS BARBELL Nurvazly, Dina Eka; Sihombing, Martha Magdalena; Asmiati; Notiragayu
Jurnal Matematika UNAND Vol. 15 No. 1 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.1.63-77.2026

Abstract

The rose graph, denoted by R(C_n), n>=3 constructed by a cycle graph C_n with n isolated vertices that connect every two vertices in the cycle graph with one isolated vertex. The rose barbell graph, denoted by B_{R(C_n)} is a simple graph formed by connecting two rose graphs R(C_n) by edges v_1,v^{'}_1 as a bridge. In this paper, we determined the partition dimension of the rose graph and its barbell

Page 86 of 86 | Total Record : 858

 82   83   84   85   86 

Filter by Year

2012 2026


Reset
Filter By Issues
All Issue Vol. 15 No. 1 (2026) Vol. 14 No. 4 (2025) Vol. 14 No. 3 (2025) Vol. 14 No. 2 (2025) Vol 14, No 1 (2025) Vol. 14 No. 1 (2025) Vol 13, No 4 (2024) Vol. 13 No. 4 (2024) Vol 13, No 3 (2024) Vol. 13 No. 3 (2024) Vol. 13 No. 2 (2024) Vol 13, No 2 (2024) Vol. 13 No. 1 (2024) Vol 13, No 1 (2024) Vol. 12 No. 4 (2023) Vol 12, No 4 (2023) Vol 12, No 3 (2023) Vol. 12 No. 3 (2023) Vol 12, No 2 (2023) Vol. 12 No. 2 (2023) Vol 12, No 1 (2023) Vol 11, No 4 (2022) Vol 11, No 3 (2022) Vol 11, No 2 (2022) Vol 11, No 1 (2022) Vol 10, No 4 (2021) Vol 10, No 3 (2021) Vol 10, No 2 (2021) Vol 10, No 1 (2021) Vol 9, No 4 (2020) Vol 9, No 3 (2020) Vol 9, No 2 (2020) Vol 9, No 1 (2020) Vol 8, No 4 (2019) Vol 8, No 3 (2019) Vol 8, No 2 (2019) Vol 8, No 1 (2019) Vol 7, No 4 (2018) Vol 7, No 3 (2018) Vol 7, No 2 (2018) Vol 7, No 1 (2018) Vol 6, No 4 (2017) Vol 6, No 3 (2017) Vol 6, No 2 (2017) Vol 6, No 1 (2017) Vol 5, No 4 (2016) Vol 5, No 3 (2016) Vol 5, No 2 (2016) Vol 5, No 1 (2016) Vol 4, No 4 (2015) Vol 4, No 3 (2015) Vol 4, No 2 (2015) Vol 4, No 1 (2015) Vol 3, No 4 (2014) Vol 3, No 3 (2014) Vol 3, No 2 (2014) Vol 3, No 1 (2014) Vol 2, No 4 (2013) Vol 2, No 3 (2013) Vol 2, No 2 (2013) Vol 2, No 1 (2013) Vol 1, No 2 (2012) Vol 1, No 1 (2012) Vol 1, No 1 (2012) More Issue