Claim Missing Document
Check
Articles

Found 25 Documents
Search

ANALISIS SISTEM MENGGUNAKAN METODE SUBSTRAKSI UNTUK MODEL LALU LINTAS KENDARAAN SECARA REALTIME Banjarnahor, Jepri; Giawa, Well Friend; Simamora, Wanda Pratama Putra; Pratiwi, Dina; Rahil, Rafif; Indra, Evta; NK Nababan, Marlince
Jurnal Sistem Informasi dan Ilmu Komputer Vol. 5 No. 1 (2021): JURNAL SISTEM INFROMASI DAN ILMU KOMPUTER PRIMA (JUSIKOMP)
Publisher : Fakultas Teknologi dan Ilmu Komputer Universitas Prima Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34012/jurnalsisteminformasidanilmukomputer.v5i1.1891

Abstract

Pengetahuan tentang teknologi visi komputer semakin maju serta sejalan dengan kebutuhan akan sistem yang terkendali secara terus menerus, menyebabkan penelitian di bidang visi komputer akan terus dilakukan. Kebutuhan akan sistem kendali pengaturan volume kendaraan (TrafikPlan) sudah sangat dibutuhkan pada era sekarang ini dikarenakan tingkat penjualan kendaraan semakin meningkat tetapi peningkatan jalan yang tersedia tidak mencukupi. Penelitian ini mencoba untuk membuat sebuah model lalu lintas dengan beberapa metode pada visi komputer hough transform sebagai batas area yang akan dideteksi serta connected compenent labeling (CCL) dalam penghitungan jumlah kepadatan pada area yang dideteksi memungkinkan pengaturan kendaraan menggunakan sistem secara realtime akan terwujud. Penelitian ini mengambil inputan citra berupa video dan akan dieksekusi pada pengujian program dengan tahapan proses dari segmentasi, deteksi tepi, hough transform, eliminasi, subtraksi, grayscale dan threshold, morfologi, dan CCL. Hasil pengujian akan mendeteksi jumlah kendaraan serta persentase kepadatan jalan yang dilalui apakah sepi, sedang atau padat.
The Influence of Legal Education on Understanding Joint Property in Marriage Among Urban Communities Hidayat, Rahmat; Pratiwi, Dina
Indonesian Journal of Islamic Law Vol. 3 No. 1 (2020): Indonesian Journal of Islamic Law
Publisher : Postgraduate Programme of UIN Kiai Haji Achmad Siddiq Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35719/ijil.v3i1.2028

Abstract

This research aims to explore the influence of legal education on urban society's understanding of joint property in marriage. The research uses mixed methods, namely a quantitative survey of urban communities and in-depth interviews to gain deeper insight. The research results show that legal education, both formal and non-formal, has a significant influence on legal understanding of joint property. Respondents who received legal education had a better understanding of their rights and obligations regarding joint property, and implemented management practices that were more in line with positive law. These findings indicate the need for increased integration of legal material in the formal education curriculum and the development of non-formal legal education programs that are broader and more inclusive. Recommendations from this research emphasize the importance of collaboration between government, educational institutions and civil society organizations to improve access and quality of legal education, in order to create a more just and legally aware society.
PEMERIKSAAN TEKANAN DARAH GRATIS MENGGUNAKAN TENSI DIGITAL PESERTA RAKERDA PDM KABUPATEN TANGERANG Istiyono, Yogi Priyo; Rohimah, Anni; Ghazali, Ahmad Sulton; Rasydy, La Ode Akbar; Pratiwi, Dina; Sulistyo, Suryo; Kuncoro, Banu; Fhatonah, Nuriyatul
Ekalaya: Jurnal Pengabdian Kepada Masyarakat Indonesia Vol. 2 No. 3 (2023): Ekalaya Journal
Publisher : Nindikayla Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.57254/eka.v2i3.93

Abstract

The Muhammadiyah Regional Leadership (Pimpinan Daerah Muhammadiyah or PDM) of Tangerang Regency is committed to improving the welfare of the community in its area. One concrete effort to achieve this goal is by organizing free blood pressure checks using digital blood pressure monitors. This activity aims to provide easily accessible healthcare services to the public and raise awareness about the importance of monitoring blood pressure for maintaining good health. In its implementation, this community service initiative involves experienced medical professionals who conduct blood pressure examinations for participants of the Muhammadiyah Regional Leadership's (PDM) Tangerang Regency event. The examination results are directly communicated to the participants, and they receive information and education about blood pressure and the steps to maintain heart health. Overall, the health examination results, particularly body temperature checks, are very satisfactory, with 100% within the normal range. However, for blood pressure examinations, it was found that 25.37% of the participants had low blood pressure, 32.83% were in the normal range, and 41.84% had high blood pressure. With activities like this, it is hoped that participants can take the necessary preventive actions promptly. Furthermore, free blood pressure checks also serve to educate the community about the importance of a healthy lifestyle and regular health monitoring
PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS Rahmadani, Desi; Aldiansyah, Ardi; Pratiwi, Dina; Yunus, Mahmuddin; Kusumasari, Vita
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 19 No 4 (2025): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol19iss4pp2431-2442

Abstract

Graph labeling is the assigning of labels represented by integers or symbols to graph elements, edges and/or vertices (or both) of a graph. Consider a simple graph with a vertex-set and an edge-set . The order of graph , denoted by , is the number of vertices on . The prime labeling is a bijective function , such that the labels of any two adjacent vertices in G are relatively prime or , for every two adjacent vertices and in . If a graph can be labeled with prime labeling, then the graph can be said to be a prime graph. A flower graph is a graph formed by helm graph by connecting its pendant vertices (the vertices have degree one) to the central vertex of , such a flower graph is denoted as In this research, we employ constructive and analytical methods to investigate prime labelings on specific graph classes. Definitions, lemmas, and theorems are developed as the main results in this research. The amalgamation is a graph formed by taking all by taking all the and identifying their fixed vertices . If , then we write with . In previous research, it has been shown that the flower graphs , for are prime graphs. Continuing the research, we prove that two classes of amalgamation of flower graphs are prime graphs.
Rainbow Connection Number of Octopus Iteration Graphs Rahmadani, Desi; Giyanatta, Adinda Evelyn; Pratiwi, Dina; Yunus, Mahmuddin; Kusumasari, Vita
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol. 6 No. 2 (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.v6i2.41414

Abstract

The rainbow connection number of a graph G denoted by rc(G) is the minimum number of colors used to color the edges in G, such that every pair of vertices is connected by a path with all different colors. In 2008, Chartrand et al. first introduced the concept of rainbow connection numbers. They introduced it as an edge coloring on a graph that refers to the path of each pair of vertices. An octopus graph, with m legs denoted by Om, is a graph constructed from a fan graph Fm and a star graph Sm. The graphs studied in this article are two classes of octopus iteration graphs, namely the octopus chain graph and the octopus ladder graph. The octopus chain graph, denoted by O2(n) is a graph constructed from n copies of O2 and connecting one leg of the i-th copy to the (i+1)-th copy, for every I = 1,2,..., n-1. The octopus ladder graph, denoted by O2'(n) is a graph constructed from graph O2(n) by connecting one of vertex of degree two of the i-th copy to the (i+1)-th copy. In this research, we determine the rainbow connection number of the octopus chain graphs O2(n) and the octopus ladder graphs O2'(n). We obtain that rc(O2(n))=3n, for n >= 1 and rc(O2'(n))=3n-1,  for n >= 2.Keywords: classes of octopus iteration graphs; octopus chain graph; octopus ladder graph; rainbow connection number. AbstrakBilangan terhubung pelangi pada graf G dinotasikan dengan rc(G)  merupakan jumlah warna minimum yang digunakan untuk mewarnai sisi pada G, sehingga setiap pasang titik dihubungkan oleh suatu lintasan dengan warna yang berbeda semua. Pada tahun 2008, Chartrand dkk. pertama kali memperkenalkan konsep bilangan terhubung pelangi. Chartrand dkk. memperkenalkannya sebagai pewarnaan sisi pada graf yang mengacu pada lintasan setiap pasang titiknya. Graf gurita dengan m kaki dinotasikan denganOm  adalah graf yang dikonstruksi dari graf kipas Fm  dan graf bintang Sm. Graf yang dikaji dalam artikel ini merupakan dua kelas graf iterasi gurita, yaitu graf rantai gurita dan graf tangga gurita. Graf rantai gurita yang dinotasikan dengan O2(n) adalah graf yang dikonstruksi dari n copy graf Om dan menghubungkan satu kaki salinan ke-i ke salinan ke-i+1, untuk setiap i = 1,2,...,n. Graf tangga gurita yang dinotasikan dengan O2'(n)  adalah graf yang dibangun dari graf O2(n) dengan menghubungkan salah satu titik berderajat dua salinan dari graph ke-i ke salinan ke-i+1. Pada penelitian ini, ditentukan bilangan terhubung pelangi pada graf rantai gurita O2(n) dan graf tangga gurita O2'(n). Kami memperoleh bahwa rc(O2(n))=3n untuk n>=1 dan rc(O2'(n))=3n-1, untuk n>=2. Kata Kunci: kelas graf iterasi gurita; graf rantai gurita; graf tangga gurita; bilangan terhubung pelangi. 2020MSC: 05C15, 05C40.