Article Per Year (5 Year)
p-Index From 2020 - 2025
0.92
P-Index
This Author published in this journals
All Journal Desimal: Jurnal Matematika Jurnal Abdi Insani InPrime: Indonesian Journal Of Pure And Applied Mathematics Jurnal Teknik Informatika (JUTIF)
Notiragayu, Notiragayu
Unknown Affiliation
Agriculture, Biological Sciences & Forestry Civil Engineering, Building, Construction & Architecture Computer Science & IT Economics, Econometrics & Finance Education Engineering Environmental Science Health Professions Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Mathematics Social Sciences

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

Found 5 Documents
Search

 1 
The Locating Chromatic Number for Amalgamation of Some Complete Graphs Yulianti, Amanah; Asmiati, Asmiati; Hamzah, Nur; Notiragayu, Notiragayu
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol 6, No 1 (2024)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v6i1.38711

Abstract

The locating chromatic number of a graph is a combination of partition dimension and vertex coloring, where every two adjacent vertices are in different color classes, and all vertices have a unique color code. The amalgamation of a ≥ 2 complete graphs (K_n, n≥ 3) denoted by aK_n is obtained by identifying one vertex from each complete graph. In this paper, we present a novel study, a topic that has not been extensively explored in previous research, on locating chromatic numbers for the amalgamation of complete graphs aK_n for 2 ≤ a ≤ 6 and n≥ 3.Keywords: locating chromatic number, partition dimension, vertex coloring, color code, amalgamation of  complete graph. AbstrakBilangan kromatik lokasi graf merupakan penggabungan dari  dimensi partisi  dan pewarnaan titik, yang mana setiap dua titik bertetangga berada dalam kelas warna yang berbeda dan semua titik mempunyai kode warna yang unik. Amalgamasi dari a ≥ 2 buah graf lengkap (K_n, n≥ 3) dinotasikan dengan aK_n  diperoleh dengan cara menyatukan satu titik dari setiap graf lengkap . Pada paper ini didiskusikan hasil yang belum ada sebelumnya, yaitu bilangan kromatik lokasi amalgamasi graf lengkap aK_n untuk 2 ≤ a ≤ 6 dan n≥ 3 .Kata Kunci: bilangan kromatik lokasi, dimensi partisi, pewarnaan titik, kode warna, amalgamasi graf lengkap. 2020MSC: 05C12, 05C15
CLASSIFICATION MODELS FOR ACADEMIC PERFORMANCE: A COMPARATIVE STUDY OF NAÏVE BAYES AND RANDOM FOREST ALGORITHMS IN ANALYZING UNIVERSITY OF LAMPUNG STUDENT GRADES Kurniasari, Dian; Hidayah, Rekti Nurul; Notiragayu, Notiragayu; Warsono, Warsono; Nisa, Rizki Khoirun
Jurnal Teknik Informatika (Jutif) Vol. 5 No. 5 (2024): JUTIF Volume 5, Number 5, Oktober 2024
Publisher : Informatika, Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52436/1.jutif.2024.5.5.2066

Abstract

At the university, students are provided with a comprehensive assessment of their academic achievements for each course completed at the end of every semester. This study aimed to compare the effectiveness of two classification methods, the Naïve Bayes and the Random Forest methods, in classifying student learning outcomes. The research process is segmented into various stages: data selection, data preparation, model building and testing, and model evaluation. The findings indicated that the Naïve Bayes and Random Forest approaches exhibited superior accuracy levels when employing data splitting strategies, in contrast to k-fold cross-validation. Based on the examination, the Random Forest approach demonstrated superiority in identifying the scores of University of Lampung students, achieving an accuracy percentage of 99.38%. Notably, both techniques showed a substantial performance improvement using Gradient Boosting. The Naïve Bayes method attained an accuracy rate of 99.89%, while the Random Forest method reached 99.45%. The results demonstrate that employing the Random Forest classification method consistently leads to superior performance in identifying and classifying student grades. Furthermore, using Gradient Boosting in the boosting process has demonstrated its efficacy in enhancing the classification methods' accuracy. These findings significantly contribute to the comprehension and advancement of evaluation systems for assessing student learning outcomes in the university environment.
The comparison of the effectiveness of the lowest supply lowest cost (LSLC) algorithm and the exponential approach algorithm in transportation problems Purba, Tresya Carmela; Notiragayu, Notiragayu; Fitriani, Fitriani; Azis, Dorrah
Desimal: Jurnal Matematika Vol. 4 No. 2 (2021): Desimal: Jurnal Matematika
Publisher : Universitas Islam Negeri Raden Intan Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24042/djm.v4i2.9179

Abstract

Transportation problems are one of the particular forms that often appear in linear programs, one of which is the distribution of goods. A transportation method is needed to determine the optimal result, namely, the minimum cost from source to destination with all demand and supply fulfilled. There are several methods, one of which is the Lowest Supply Lowest Cost Method (LSLC) and the Exponential Approach Method (PE). Both methods are made in a MATLAB program, generating a script that calculates the algorithm's time complexity. Using the function notation, the Big-O Algorithm complexity of the Lowest Supply Lowest Cost method is more efficient than the Exponential Approach Method algorithm. At the same time, the optimal result for the minimum cost between the two methods is obtained by using the Exponential Approach Method.
The relationship of the formulas for the number of connected vertices labeled graphs with order five and order six without loops Amanto, Amanto; Notiragayu, Notiragayu; Zakaria, La; Wamiliana, Wamiliana
Desimal: Jurnal Matematika Vol. 4 No. 3 (2021): Desimal: Jurnal Matematika
Publisher : Universitas Islam Negeri Raden Intan Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24042/djm.v4i3.10006

Abstract

Given a graph with n points and m lines. If each vertex is labeled, then it can be constructed many graphs, connected, or disconnected graphs. A graph G is called a connected graph if there is at least one path that connects a pair of vertices in G. In addition, the graph formed may be simple or not simple. A simple graph is a graph that does not contain loops or parallel lines. A loop is a line that connects a point to itself, and a parallel line is two or more lines that connect the same pair of points. This paper will discuss the relationship between the formula patterns for calculating the number of connected graphs labeled with vertices of order five and six without loops.
MEMBANGUN DESA MANDIRI ENERGI MELALUI PENGOLAHAN SAMPAH PLASTIK MENJADI BBM ALTERNATIF DI DESA HANURA KECAMATAN TELUK PANDAN PESAWARAN Bahri, Syaiful; Ambarwati, Yuli; Waluyo, Sri; Oktarina, Rasmi Zakiah; Notiragayu, Notiragayu
Jurnal Abdi Insani Vol 11 No 4 (2024): Jurnal Abdi Insani
Publisher : Universitas Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/abdiinsani.v11i4.2025

Abstract

The market in Hanura Village faces serious problems related to rubbish, especially because it is located close to the main beach tourist route which is busy during holidays. Increased activity in markets produces more waste, which is usually simply transferred to landfill, but this method is less effective. Plastic waste is the second biggest problem after organic waste and is difficult to decompose naturally, so other solutions are needed to reduce waste accumulation. To tackle this issue, the Unila community service team proposes a more efficient plastic waste management system. Drawing from Bahri et al., (2019), their research demonstrates that plastic waste can be converted into alternative fuel through a pyrolysis process, utilizing a device known as a pyrolizers. With an abundant supply of plastic waste and Hanura Village’s strategic location, the development and application of this process are being implemented through a community service program based on research dissemination. The result of this activity is a plastic waste processing tool that converts waste into alternative fuel in the form of a pyrolyzer with three condensers. The fuel produced from the pyrolysis of plastic waste is characterized by its chromatogram profile using Gas Chromatography Mass Spectrometry (GCMS), and its calorific value is measured using a bomb calorimeter, while the octane number is determined using an Octane Number Tester.  The results of the community service activity in Hanura Village cognitively show that the residents of Hanura Village were highly enthusiastic about receiving the training, especially related to the processing of plastic waste into fuel, with an overall achievement of specific instructional objectives reaching 53%.
Co-Authors Amanto Amanto Ambarwati, Yuli Asmiati Asmiati Azis, Dorrah Dian Kurniasari Fitriani Hidayah, Rekti Nurul Nisa, Rizki Khoirun Nur Hamzah Oktarina, Rasmi Zakiah Purba, Tresya Carmela Sri Waluyo SYAIFUL BAHRI Wamiliana Wamiliana Warsono Warsono Yulianti, Amanah Zakaria, La