Article Per Year (5 Year)
p-Index From 2021 - 2026
2.248
P-Index
This Author published in this journals
All Journal JTAM (Jurnal Teori dan Aplikasi Matematika) Zero : Jurnal Sains, Matematika, dan Terapan JURNAL MathEdu (Mathematic Education Journal) Sainmatika: Jurnal Ilmiah Matematika dan Ilmu Pengetahuan Alam Jambura Journal of Mathematics Abdimas: Jurnal Pengabdian Masyarakat Universitas Merdeka Malang JPK: Jurnal Proteksi Kesehatan Journal of Artificial Intelligence and Engineering Applications (JAIEA) Jurnal Ilmiah Teknik Informatika dan Komunikasi Regress: Journal of Economics & Management Innovative: Journal Of Social Science Research GEMBIRA (Pengabdian Kepada Masyarakat)
Kartika, Dinda
Unknown Affiliation
Religion Agriculture, Biological Sciences & Forestry Humanities Automotive Engineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Education Electrical & Electronics Engineering Health Professions Law, Crime, Criminology & Criminal Justice Mathematics Medicine & Pharmacology Nursing Physics Public Health Social Sciences Other

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

Found 14 Documents
Search

 1   2 
The (Strong) Rainbow Connection Number of Join Of Ladder and Trivial Graph Kartika, Dinda; Febrian, Didi; Surbakti, Nurul Maulida
JTAM (Jurnal Teori dan Aplikasi Matematika) Vol 7, No 1 (2023): January
Publisher : Universitas Muhammadiyah Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31764/jtam.v7i1.11704

Abstract

Let G = (V,E) be a nontrivial, finite, and connected graph. A function c from E to {1,2,...,k},k ∈ N, can be considered as a rainbow k-coloring if every two vertices x and y in G has an x- y path. Therefore, no two path's edges receive the same color; this condition is called a “rainbow path”. The smallest positive integer k, designated by rc(G), is the G rainbow connection number. Thus, G has a rainbow k-coloring. Meanwhile, the c function is considered as a strong rainbow k-coloring within the condition for every two vertices x and y in G have an x - y rainbow path whose length is the distance between x and y. The smallest positive integer k, such as G, has a strong rainbow k-coloring; such a condition is called a strong rainbow connection number of G, denoted by src(G). In this research, the rainbow connection number and strong rainbow connection number are determined from the graph resulting from the join operation between the ladder graph and the trivial graph, denoted by rc(L_n∨K_1) and src(L_n∨K_1) respectively. So, rc (L_n∨K_1 )= src (L_n∨K_1 )=2,"for" 3≤n≤4 and rc (L_n∨K_1 )=3, while src(L_n∨K_1 )=⌈n/2⌉,"for" n≥5. 
Development of Malay Deli Songket Motifs Based on Symmetry Groups Mingka, Rizka Annisa; Kartika, Dinda; Suwanto, Fevi Rahmawati
JTAM (Jurnal Teori dan Aplikasi Matematika) Vol 7, No 1 (2023): January
Publisher : Universitas Muhammadiyah Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31764/jtam.v7i1.10279

Abstract

One of the tribes in North Sumatra Province that has a wide variety of art is the Deli Malays, especially the Songket motifs. Songket is a type of traditional Indonesian weaving that should be preserved to maintain Indonesia’s wealth. The motifs in the Malay Deli Songket can be analyzed because of its symmetrical pattern. In this study, the author developed the Malay Deli Songket motif based on the concept of the symmetry group. The motif development was carried out with the Matlab program based on the frieze group pattern and the crystallography group pattern. The Frieze pattern, often called the Frieze Group, is a symmetry group created from one-way translation, forming a linear pattern that repeats one way. The crystallography group has 17 crystallographic patterns formed by a specific transformation from each type of unit lattice. Through the development of motifs, 6 new Songket motifs were obtained based on the Frieze pattern in 11 observed Malay Deli Songket motifs, namely the Moon Orchid motif, the Orchid motif, the Balong Ayam motif, the Coffee Flowers motif, the Tobacco Leaves 1 and 2 motifs, the Corn motif, the Paddy motif, the Tampuk Manggis motif, the Tobacco motif, and the Ulam Raja motif. In 4 previously observed Malay Deli Songket motifs, 11 new Songket motifs were obtained for crystallography patterns: the Deli Tobacco Leaves motif, the Coffee motif, the Tampuk Gelugor motif, and the Undang Kupu-Kupu motif. 
Embedded TinyML for Predicting Soil Moisture Conditions in Rice Fields Using Weather Data Surbakti, Nurul Maulida; Kartika, Dinda; Amry, Zu; Ashari, Muhammad; Pahlawan, Riza
ZERO: Jurnal Sains, Matematika dan Terapan Vol 9, No 2 (2025): Zero: Jurnal Sains Matematika dan Terapan
Publisher : UIN Sumatera Utara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30829/zero.v9i2.26551

Abstract

This study implements a lightweight TinyML model to classify soil moisture conditions and support irrigation decisions in rice cultivation, chosen over conventional cloud-based ML because it enables low-power, low-latency, fully offline inference on microcontrollers—critical for rural areas with limited connectivity. Trained on 3,021 localized microclimate records from Denai Lama Village (temperature, humidity, rainfall, cloud cover) using logistic regression for its simplicity and interpretability under resource constraints, the model was deployed on an ESP32 for real-time predictions into three classes (underwatered, optimal, overwatered). Experimental results show accuracy = 0.982 and weighted F1 = 0.982 on the validation set (ROC–AUC = 0.997), and on the held-out test set (N = 194) the model achieved 93.4% accuracy, 0.927 weighted F1 (precision 0.914; recall 0.942), and ROC–AUC = 0.988. These findings indicate that TinyML provides a practical, low-cost, and scalable edge-AI pathway for reliable, energy-efficient decision support in precision irrigation without network dependence, offering a deployable template for smallholder farming contexts.
Implementasi Algoritma Kriptografi RSA dalam Proses Enkripsi dan Dekripsi untuk Mengamankan Pesan Singkat pada Aplikasi Chatting Berbasis Web Surbakti, Nurul; Kartika, Dinda; Lestari, Alya Dwi; Puspita, Maysi; Pandiangan , Petra Putri Sarinah; Singarimbun, Riamonda; Suryani, Windi
Jurnal Ilmiah Teknik Informatika dan Komunikasi Vol. 5 No. 3 (2025): November: Jurnal Ilmiah Teknik Informatika dan Komunikasi 
Publisher : Lembaga Pengembangan Kinerja Dosen

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55606/juitik.v5i3.1711

Abstract

The rapid development of information technology, especially in online communication, raises concerns about the security and privacy of transmitted messages. Cryptography serves as a primary alternative to protect information from unauthorized access. This study aims to implement the RSA (Rivest Shamir Adleman) cryptographic algorithm to secure short messages in a web-based chat application. The research method used was a mixed method, combining literature study and application development trials. The designed application uses the Flask framework for the backend, while HTML, CSS, and JavaScript are used for the user interface. The implementation results show that the RSA algorithm successfully converted plaintext messages (e.g., "Haii") into ciphertext (such as [7347,3641,4742,4742]) using a public key and accurately restored them to the original message using a private key, without any loss of information. This application offers an interactive and visual interface, making it easier for users to understand the RSA encryption and decryption process. Testing confirmed a consistency between manual calculations and the application's functions, proving that the system works stably and accurately. It is concluded that the RSA algorithm can be used effectively to protect short messages on web-based chat platforms, serving not only as a secure communication tool but also as an effective learning medium for asymmetric cryptography concepts. For future development, it is recommended to use larger prime numbers to enhance security, as well as to add features such as file sharing and group chats.
Co-Authors Amalia, Sisti Nadia Amry, Zu Ashari, Muhammad Cahaya, Puspa DIdi Febrian Didien Ika Setyaraini Fikri Syahputra Gusmawati Gusmawati, Gusmawati Hermawan Syahputra Hidayat, Finda Hikmah, Muziatun Ida Ayu Putu Sri Widnyani Jamil, Jannatul Kana Saputra S Kundarti, Finta Isti Lasker Pangarapan Sinaga Lestari, Alya Dwi Mardiana, Annisya Marlinda Marlinda Mauliana Mauliana, Mauliana Mediawati, Mika Mingka, Rizka Annisa Naibaho, Debora Elssaday Nainggolan, Agnes Margareta Nasution, Hamidah . Nasution, Muhammad Ibrohim Niska, Debi Yandra Nurhasanah Siregar . Nurul Ain Farhana Nurul Jannah Nurul Maulida Surbakti Pahlawan, Riza Pandiangan , Petra Putri Sarinah Pasaribu, M.Arya Puspita, Maysi Raja, Rinto Manik Ramadhani, Eliza Sadida, Wahyuni Sinaga, Marlina Singarimbun, Riamonda Sri Dewi Surbakti, Nurul Surbakti, Nurul Maulida Suryani, Windi Suwanto, Fevi Rahmawati Talia, Anita Zainuddin, Zainuddin Zulfahmi Indra, Zulfahmi