Article Per Year (5 Year)
p-Index From 2021 - 2026
2.195
P-Index
This Author published in this journals
All Journal Edumatsains BAREKENG: Jurnal Ilmu Matematika dan Terapan International Journal of Applied Sciences and Smart Technologies Indonesian Journal of Data and Science Jurnal ComunitA Servizio Journal of Computing Theories and Applications Jurnal Pengabdian Masyarakat Mandira Cendikia (JPKM-MC) KREATIF: Jurnal Pengabdian Masyarakat Nusantara
Asido Saragih
Institut Teknologi Del
Agriculture, Biological Sciences & Forestry Humanities Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Energy Engineering Health Professions Industrial & Manufacturing Engineering Law, Crime, Criminology & Criminal Justice Library & Information Science Mathematics Mechanical Engineering Nursing Physics Social Sciences Transportation Other

Published : 15 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 15 Documents
Search

 1   2 
Analysis of High School Students' Reasoning Ability in Solving Higher Order Thinking Skill Type Mathematics Problems Ana Muliyana; Asido Saragih; Jaya Santoso
EduMatSains : Jurnal Pendidikan, Matematika dan Sains Vol 10 No 2 (2025): October
Publisher : Fakultas Keguruan dan Ilmu Pendidikan, Universitas Kristen Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33541/edumatsains.v10i2.6923

Abstract

This study investigates the mathematical reasoning abilities of high school students in North Sumatra who participated in the Del Mathematics and Science Competition (DMSC). Prior studies have revealed that students’ reasoning abilities are generally low; however, limited attention has been paid to their performance in competition-based settings. The purpose of this study is to assess the mathematical reasoning skills of students through higher-order thinking problems adapted from National Science Olympiad (OSN) materials. This research employed a qualitative descriptive method. The participants consisted of 25 high school students who reached the final round of the DMSC. The instrument used was a written mathematical reasoning test consisting of five essay questions. Students’ responses were analyzed using descriptive statistics, including mean scores and percentage values based on established scoring rubrics. The results showed that 18 students were categorized as having low reasoning ability and 7 students had a moderate level. The average reasoning score was 63.84%, which falls into the low category. Although students could perform calculations, most of them struggled with argument validation and logical explanation.The findings emphasize the necessity for educators to develop instructional strategies that foster students’ mathematical reasoning, particularly through approaches that stimulate higher-order thinking skills.
Redefining Academic Recruitment Using Fuzzy Tahani Logic: A Multi-Criteria Model for Calculus Teaching Assistants’ Selection Asido Saragih; Febri Sihotang; Jaya Santoso; Ana Muliyana; Ragina Ayunita Tarigan
EduMatSains : Jurnal Pendidikan, Matematika dan Sains Vol 10 No 2 (2025): October
Publisher : Fakultas Keguruan dan Ilmu Pendidikan, Universitas Kristen Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33541/edumatsains.v10i2.7284

Abstract

This study aims to implement the Tahani fuzzy logic method as a decision support system for selecting candidates to become teaching assistants in a Calculus course. The selection process involves evaluating participants based on four test items covering major topics in Calculus: definite integrals, areas between curves, and others. Each participant’s score was fuzzified into three linguistic categories: poor, fair, and good. Membership functions were constructed using triangular distributions, and fuzzified scores were processed using a rule-based inference system. The final recommendation score for each participant was obtained by defuzzifying the fuzzy outputs. Participants with a final score recommendation greater than or equal to 0.5 were classified as eligible. The results show that the fuzzy logic approach offers a flexible and effective way to handle uncertainties in assessment, with 8 participants meeting the passing criteria. This method provides an objective framework for decision-making in academic selection contexts.
Fuzzy Based Evaluation of Digital Connectivity Across Countries Using Mamdani Fuzzy Inference System Saragih, Asido; Jaya Santoso; Ana Muliyana
EduMatSains : Jurnal Pendidikan, Matematika dan Sains Vol 10 No 4 (2026): April
Publisher : Fakultas Keguruan dan Ilmu Pendidikan, Universitas Kristen Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33541/edumatsains.v10i4.8096

Abstract

Digital connectivity plays an important role in supporting economic growth and social inclusion. However, measuring it across countries is not straightforward because it involves several indicators and a certain level of uncertainty. In this study, we applied a Mamdani Fuzzy Inference System (FIS) to assess digital connectivity in 137 countries. The data were taken from the ITU and World Bank (2024), including Internet Users, Fixed Broadband Subscriptions, and Mobile Cellular Subscriptions. We built a rule-based system using five linguistic categories and adjusted the membership functions based on the data distribution. The centroid method was then used to generate a Digital Connectivity Index (DCI) on a scale of 0 to 100. The results indicate a clear gap in global connectivity. A total of 23 countries achieved a Very High DCI (≥ 80), mostly located in Western Europe and East Asia. In contrast, 17 countries fell into the Very Low category (< 20), mainly from Sub-Saharan Africa. The global average DCI was 53.47. Overall, the proposed approach provides a clear and easy-to-understand classification that can support policy analysis and evaluation of digital development.
A Composite Centrality Framework for Evacuation Planning in Meso-Scale Spatial Networks with Semi-Structured Connectivity Jaya Santoso; Ana Muliyana; Asido Saragih; Ridho Pakpahan; Debora Chrisinta
Journal of Computing Theories and Applications Vol. 4 No. 1 (2026): JCTA 4(1) 2026
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.15916

Abstract

Evacuation planning in spatial networks requires the identification of critical nodes that maintain connectivity, accessibility, and flow distribution during emergency situations. Existing approaches often rely on individual centrality measures, which capture only a single structural dimension of node importance and may therefore produce incomplete or biased prioritization. To address this limitation, this study proposes a Composite Centrality Framework for identifying critical nodes in meso-scale spatial networks with semi-structured connectivity. The network is modeled as a weighted undirected graph, and Degree, Betweenness, and Closeness Centrality are integrated into a unified composite index to capture complementary structural roles. The framework is implemented in MATLAB and evaluated using a real-world campus spatial network consisting of 30 nodes and a synthetic network comprising 16 nodes with comparable structural characteristics. The results reveal a highly uneven distribution of node importance, with a small set of structurally dominant nodes consistently identified across both networks. In the campus network, node P1 achieves the highest composite centrality score (0.2195) and ranks first across the individual centrality measures, indicating its dominant role in maintaining network connectivity, accessibility, and flow distribution. Quantitative evaluation demonstrates strong agreement between the composite ranking and the individual measures, with Spearman rank correlation coefficients of 0.94, 0.89, and 0.91 for Degree, Betweenness, and Closeness Centrality, respectively. However, only one node (P1) appears simultaneously in the top five of all rankings, highlighting the complementary nature of the individual centrality measures and supporting the need for multi-criteria integration. Sensitivity analysis across three weighting scenarios yields rank correlations exceeding 0.97, confirming ranking stability and methodological robustness. Overall, the proposed framework provides a balanced and reliable approach for identifying critical nodes and demonstrates potential applicability to evacuation planning and spatial network analysis in semi-structured environments.
THE METRIC DIMENSION OF CYCLE BOOK GRAPHS B_(C_(m,n) ) FORMED BY A COMMON PATH P_2 Jaya Santoso; Darmaji Darmaji; Ana Muliyana; Asido Saragih
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 20 No 2 (2026): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol20iss2pp1155-1166

Abstract

This paper investigates the metric dimension of a class of graphs known as cycle books, denoted ​, which feature a shared path ​ across multiple cycles. We focus on characterizing the minimum number of vertex subsets required so that each vertex in the graph can be uniquely identified by its distances to those subsets. To support our analysis, we present two propositions and a general theorem that establish the metric dimension for various configurations of cycle book graphs. Specifically, we prove that for , and for , while for . Furthermore, we provide a general result for : the metric dimension is when is odd and , or when is even and ; and when is odd and . These findings contribute to the growing body of knowledge on metric properties in graph theory, particularly in structured and cyclic graph families.This paper investigates the metric dimension of a class of graphs known as cycle books, denoted ​, which feature a shared path ​ across multiple cycles. We focus on characterizing the minimum number of vertex subsets required so that each vertex in the graph can be uniquely identified by its distances to those subsets. To support our analysis, we present two propositions and a general theorem that establish the metric dimension for various configurations of cycle book graphs. Specifically, we prove that for , and for , while for . Furthermore, we provide a general result for : the metric dimension is when is odd and , or when is even and ; and when is odd and . These findings contribute to the growing body of knowledge on metric properties in graph theory, particularly in structured and cyclic graph families.This paper investigates the metric dimension of a class of graphs known as cycle books, denoted ​, which feature a shared path ​ across multiple cycles. We focus on characterizing the minimum number of vertex subsets required so that each vertex in the graph can be uniquely identified by its distances to those subsets. To support our analysis, we present two propositions and a general theorem that establish the metric dimension for various configurations of cycle book graphs. Specifically, we prove that for , and for , while for . Furthermore, we provide a general result for : the metric dimension is when is odd and , or when is even and ; and when is odd and . These findings contribute to the growing body of knowledge on metric properties in graph theory, particularly in structured and cyclic graph families.
Co-Authors Ana Muliyana Ana Muliyana Andrew Rolas Siagian Bambang Susanto Darmaji Darmaji Debora Chrisinta Febri Sihotang Fritz Marpaung Jaya Santoso Jaya Santoso JUNITA AMALIA Lawy Xenna Martgrita, Merry Meryam Purba, Santri Chintia Ragina Ayunita Tarigan REGINA AYUNITA TARIGAN Ridho Pakpahan Rudy Chandra Samuel Sibuea Sari Muthia Sari Sari Muthia Silalahi Tanujaya, Lukhia Britanthia Christina TARIGAN, REGINA AYUNITA Tegar Arifin Prasetyo