p-Index From 2021 - 2026
11.286
P-Index
This Author published in this journals
All Journal Seminar Nasional Aplikasi Teknologi Informasi (SNATI) Prosiding Seminar Nasional Sains Dan Teknologi Fakultas Teknik Prosiding SNATIF JURNAL PASTI (PENELITIAN DAN APLIKASI SISTEM DAN TEKNIK INDUSTRI) Jurnal Edukasi dan Penelitian Informatika (JEPIN) Annual Research Seminar JOIN (Jurnal Online Informatika) Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) RABIT: Jurnal Teknologi dan Sistem Informasi Univrab BAREKENG: Jurnal Ilmu Matematika dan Terapan JITTER (Jurnal Ilmiah Teknologi Informasi Terapan) INTECOMS: Journal of Information Technology and Computer Science Jiko (Jurnal Informatika dan komputer) KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Jurnal Kreativitas PKM JUMANJI (Jurnal Masyarakat Informatika Unjani) MIND (Multimedia Artificial Intelligent Networking Database) Journal Jurnal Manajemen Informatika Jurnal ICT : Information Communication & Technology Building of Informatics, Technology and Science JUTIS : Jurnal Teknik Informatika Jurnal Mnemonic JATI (Jurnal Mahasiswa Teknik Informatika) JOINT (Journal of Information Technology jurnal syntax admiration Tematik : Jurnal Teknologi Informasi Komunikasi Innovation in Research of Informatics (INNOVATICS) Informatics and Digital Expert (INDEX) International Journal of Global Operations Research Jurnal Sosial dan Teknologi Jurnal Ilmiah Wahana Pendidikan Jurnal SAINTIKOM (Jurnal Sains Manajemen Informatika dan Komputer) International Journal of Quantitative Research and Modeling Jurnal Abdimas Kartika Wijayakusuma International Journal of Informatics, Information System and Computer Engineering (INJIISCOM) Journal of Informatics and Communication Technology (JICT) Jurnal Informatika Teknologi dan Sains (Jinteks) Prosiding Seminar Nasional Teknik Elektro, Sistem Informasi, dan Teknik Informatika (SNESTIK) Prosiding Seminar Nasional Sisfotek (Sistem Informasi dan Teknologi Informasi) Jurnal Algoritma IJESPG (International Journal of Engineering, Economic, Social Politic and Government) journal Ranah Research : Journal of Multidisciplinary Research and Development Enrichment: Journal of Multidisciplinary Research and Development Journal of Informatics and Communication Technology (JICT) Malahayati International Journal of Nursing and Health Science Khazanah Informatika : Jurnal Ilmu Komputer dan Informatika
Claim Missing Document
Check
Articles

PENGGUNAAN ALGORITMA GEOSHASHING DALAM PENCARIAN LETAK INFORMASI GEOGRAFIS PENGGANTI KOOORDINAT LATITUDE DAN LONGITUDE Firdaus, Fajar; Hadiana, Asep Id; Ramadhan, Edvin
Rabit : Jurnal Teknologi dan Sistem Informasi Univrab Vol 9 No 2 (2024): Juli
Publisher : LPPM Universitas Abdurrab

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36341/rabit.v9i2.4848

Abstract

Dalam era digital saat pencarian data geografis menjadi semakin penting dalam aplikasi lokasi, termasuk pemetaan, navigasi, dan analisis lingkungan tempat dalam suatu lokasi. algoritma geohashing menawarkan pendekatan yang efisien untuk pengkodekan dan menyimpan data geografis dalam format string,String ini menggunakan alfanumerik yang dihasilkan oleh geohashing dari angka dan huruf dalam pencarian titik lokasi dengan koordinat, hal ini juga dapat menawarkan lapisan akses dari data lokasi yang sensitif. Penelitian ini bertujuan untuk mengeksplorasi penerapan algoritma geohashing dalam manajemen data geografis. algoritma geohashing dalam pencarian letak informasi geografis sebagai alternatif pengganti koordinat latitude dan longitude. Secara khusus, penelitian ini menganalisis efisiensi geohashing dalam kompresi data, akurasi lokalisasi penggunaan geohashing memungkinkan pengelompokan data geografis yang lebih baik, dan mendukung pencarian data spasial seperti pencarian letak lokasi dan pencarian titik koordinat dalam wilayah tertentu. algoritma geohashing diimplementasikan dalam data geografis dan diuji untuk berbagai skenario pencarian. Dari hasil penelitian menunjukkan bahwa geohashing dapat meningkatkan kecepatan pencarian informasi geografis secara signifikan algoritma geohashing membuktikan tindakan sebagai alat yang efektif dalam manajemen dan pencarian data geografis,pada pencarian data koordinat lokasi ini juga dapat memberikan alternatif untuk mendapatkan latitude dan longitude dari suatu lokasi. Hasil penelitian menunjukkan bahwa geohashing dapat meningkatkan kecepatan pencarian informasi geografis secara signifikan, terutama dalam menjangkau suatu lokasi dengan level grid kotak data yang kecil dan besar sesuai karakter string yang dimasukan. Penggunaan geohashing tidak hanya meningkatkan efisiensi dan kecepatan pencarian tetapi juga memberikan manfaat tambahan dalam hal pengelolaan dan perlindungan data geografis.algoritma geohashing adalah metode yang digunakan untuk mengkodekan koordinat geografis yang menghasilkan lokasi acak.Pengujian pada sistem ini dilakukan dengan cara melakukan akses geografis kepada API aplikasi lokasi yang sudah dibuat sesuai permintaan yang diminta untuk mendapatkan informasi data geografis dan titik lokasi.
Sistem Klasterisasi Produktivitas Peternak Sapi dengan Metode Kmeans (Studi Kasus : KPSBU Lembang) Fahrezi, Rizal Febrian; Witanti, Wina; Hadiana, Asep Id
Prosiding Sains Nasional dan Teknologi Vol 11, No 1 (2021): PROSIDING SEMINAR NASIONAL SAINS DAN TEKNOLOGI 11 2021
Publisher : Fakultas Teknik Universitas Wahid Hasyim

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36499/psnst.v1i1.4963

Abstract

Along with the rapid development of information technology, many information technologies are used to help facilitate human work. For example, in the field of animal husbandry, cattle are in great demand for breeding because they have many benefits, one of which is milk. Milk is a processed animal protein product produced by cows. The milk produced by the farmers is then sold to a cooperative called KPSBU Lembang which is a place to store milk for later processing. KPSBU can have many dairy farmers based on different levels of productivity so that a lot of data can be obtained. So a milk grouping system needs to be developed to assist KPSBU in classifying milk data based on similarity of data and provide information if new data is entered. The system was developed by utilizing the K-Means algorithm which is one of the clustering algorithms in data mining to perform a grouping. The grouping carried out in the maximum system is divided into 3 groups, with the variables used are high, medium and low. The result of this research is a clustering system that can help KPSBU in classifying milk based on the similarity of data using the K-Means algorithm so that the productivity data owned can be made into several clusters. These results are an illustration that shows the grouping of farmer areas based on dairy cattle production, namely 17 sub-districts that have high production (cluster1), 2 sub-districts that have medium production potential (cluster2), and 7 sub-districts that have low production (cluster3).
QUESTION BANK SECURITY USING RIVEST SHAMIR ADLEMAN ALGORITHM AND ADVANCED ENCRYPTION STANDARD Monica, Taris; Hadiana, Asep Id; Melina, Melina
JIKO (Jurnal Informatika dan Komputer) Vol 7, No 3 (2024)
Publisher : Universitas Khairun

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33387/jiko.v7i3.8654

Abstract

Data security is essential. Educational question banks at vocational high schools (SMK) contain confidential information that could be misused if not properly secured. This research aims to ensure students question bank data and develop a responsive web platform for Pusdikhubad Cimahi Vocational School by implementing the integration of the Advanced Encryption Standard (AES) and Rivest Shamir Adleman (RSA) cryptographic algorithms through the encryption and decryption process. AES is a symmetric key cryptography algorithm, while RSA is an encryption algorithm based on using public keys to encrypt the keys required by AES-256. The integration of these two algorithms aims to ensure data confidentiality, prevent manipulation, and facilitate access to exam materials by authorized parties. This research shows that the process of encrypting and decrypting question data using a combination of RSA and AES was successfully carried out on the question bank system. Avalanche Effect testing shows that the RSA and AES 256-bit encryption has an Avalanche Effect level of 49.99%. Apart from that, the system feasibility test using black box testing results shows that the SIFILE system has a percentage level of 100%. It is hoped that the results of this research can serve as a data security system at Pusdikhubad Cimahi Vocational School and other educational institutions to secure the question bank from unauthorized access
CUSTOMER CHURN PREDICTION USING THE RANDOM FOREST ALGORITHM Setiawan, Yosep; Hadiana, Asep Id; Umbara, Fajri Rakhmat
JIKO (Jurnal Informatika dan Komputer) Vol 7, No 3 (2024)
Publisher : Universitas Khairun

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33387/jiko.v7i3.8711

Abstract

Customer churn prediction plays a vital role in modern business, accurately influencing strategic and operational decisions that influence customer loyalty to a service. Customer churn focuses on customer retention being more profitable than attracting new customers because long-term customers provide lower profits and costs while losing customers increases the costs and need to attract new customers. However, customer churn still occurs frequently and cannot be predicted. If customer churn is left unchecked, it will endanger the company or banking industry because it can cause loss of income, damage reputation, and decrease market share. Random Forest, a data mining technique, was used in this research because of its ability to predict and handle many variables. This research aims to predict customer churn using the Random Forest method with datasets from Europe, especially France, Spain, and Germany, hoping to benefit the banking industry by identifying customers at high risk of abandoning services. This research is expected to benefit business people from customer churn predictions. Especially in the banking industry, it can help identify customers at high risk of abandoning service. Thus, companies can take appropriate steps to retain these customers, increase customer retention, strengthen customer loyalty and optimize their business performance. The results of this research are an accurate system for predicting customer churn in the future. The research obtained accuracy results of 87% in predicting customer churn using accuracy testing in the form of a confusion matrix.
IMPLEMENTASI DESIGN THINKING PADA APLIKASI OMNICHANNEL UNTUK MENINGKATKAN INTERAKSI PENGGUNA Singgih, Dimas; Id Hadiana, Asep; Yuniarti, Rezki
JATI (Jurnal Mahasiswa Teknik Informatika) Vol. 8 No. 6 (2024): JATI Vol. 8 No. 6
Publisher : Institut Teknologi Nasional Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36040/jati.v8i6.11346

Abstract

Omnichannel merupakan Model operasi sinkron yang menyelaraskan seluruh saluran komunikasi perusahaan memungkinkan perusahaan memberikan "Integrated face" kepada pengguna sekaligus untuk memastikan operasi bisnis yang konsisten. rumusan masalah dalam penelitian ini adalah bagaimana implementasi metode Design Thinking dapat secara efektif meningkatkan interaksi pengguna dalam aplikasi Omnichannel, dengan fokus pada memahami kebutuhan pengguna, merancang solusi yang optimal, dan menguji prototipe untuk mencapai pengalaman pengguna yang lebih efisien. Penelitian ini bertujuan untuk meningkatkan interaksi pengguna pada aplikasi omnichannel dengan meningkatkan antarmuka sistem dan juga fitur agar sesuai dengan kebutuhan pengguna. Metode Design Thinking digunakan untuk pendekatan kreatif dalam memecahkan masalah dan mengembangkan solusi baru yang berfokus pada kebutuhan pengguna akhir, Metode ini terdiri dari lima tahap, yaitu empati, definisi, ideasi, prototipe, dan pengujian. Hasil pengujian System Usability Scale (SUS) pada aplikasi omnichannel menunjukkan peningkatan signifikan dalam usability setelah implementasi Design Thinking. Sebelum implementasi, skor rata-rata SUS adalah 55.38, tergolong "Poor" (D), dengan banyak responden memberikan skor di bawah 55, menandakan ketidakpuasan pengguna. Setelah implementasi Design Thinking, skor rata-rata naik menjadi 70.42, masuk dalam kategori "Good" (B). Distribusi skor juga membaik, dengan lebih banyak responden memberikan skor tinggi, menunjukkan bahwa perbaikan yang dilakukan berhasil meningkatkan pengalaman pengguna secara keseluruhan.
Comparative Analysis of K-Means and K-Medoids Clustering in Retail Store Product Grouping Muthmainah, Sekar Ghaida; Hadiana, Asep Id; Melina, Melina
International Journal of Quantitative Research and Modeling Vol 5, No 3 (2024)
Publisher : Research Collaboration Community (RCC)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46336/ijqrm.v5i3.753

Abstract

The retail business is growing very rapidly with increasing business competition. The application of information technology is one strategy for understanding consumer product purchasing patterns and grouping sales products. This research aims to analyze and compare the K-Means and K-Medoids Clustering techniques for retail data based on the Davies Bouldin Index value and computing time. K-Means is an algorithm that divides data into k clusters based on centroids, while K-Medoids Clustering uses objects with medoids representing clusters as centroid centers. Clustering in both methods produces an optimal number of clusters of 3 clusters. The results of this research show that K-Means produced 358 data in Cluster 1, 292 data in Cluster 2, and 367 data in Cluster 3 with a DBI of 0.7160. Meanwhile, K-Medoids produced 295 data in Cluster 1, 360 data in Cluster 2, and 362 data in Cluster 3 with a DBI of 0.7153. In addition, this study calculated the average computation from 5 experiments, namely K-Means with an average time of 0.024278/s and K-Medoids of 0.05719/s. Based on the lower DBI, K-Medoids have better results in clustering, but the K-Means method is better in terms of computational efficiency. It is hoped that the results of this research will provide valuable insights for retail business people in analyzing sales data.
Securing Network Log Data Using Advance Encryption Standard Algorithm And Twofish With Common Event Format Ali, Moch. Dzikri Azhari; Hadiana, Asep Id; Melina, Melina
International Journal of Quantitative Research and Modeling Vol 5, No 3 (2024)
Publisher : Research Collaboration Community (RCC)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46336/ijqrm.v5i3.757

Abstract

The rapid advancement of information technology demands enhanced security for data exchange in the digital world. Network security threats can arise from various sources, necessitating techniques to protect information transmitted between interconnected networks. Securing network logs is a critical step in strengthening overall network security. Network logs are records of activities within a computer network, including unauthorized access attempts, user activities, and other key events. This research focuses on developing a network log security system by comparing the performance of the Advanced Encryption Standard (AES) and Twofish algorithms, integrated with the Common Event Format (CEF) for encrypting network logs. Tests were conducted on network log datasets to evaluate system functionality and performance. Results indicate that the AES algorithm performs encryption and decryption faster than Twofish. Across five tests with different file sizes, AES took an average of 2.1386 seconds for encryption, while Twofish required 22.8372 seconds. For decryption, AES averaged 2.451 seconds compared to Twofish’s 26.140 seconds. The file sizes after encryption were similar for both algorithms. Regarding CPU usage, AES demonstrated higher efficiency. The average CPU usage during AES encryption was 0.5558%, whereas Twofish used 23.2904%. For decryption, AES consumed 0.4682% of CPU resources, while Twofish required 13.7598%. These findings confirm that AES is not only faster in both encryption and decryption but also more efficient in terms of CPU usage. This research provides valuable insights for optimizing network log security by integrating standardized log formats, like CEF, with appropriate encryption techniques, helping to safeguard against cyber threats.
Enhancing Email Client Security with HMAC and PGP Integration to Mitigate Cyberattack Risks Oktaviani, Ayu Nur; Hadiana, Asep Id; Melina, Melina
International Journal of Quantitative Research and Modeling Vol 5, No 3 (2024)
Publisher : Research Collaboration Community (RCC)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46336/ijqrm.v5i3.758

Abstract

The rapid advancement of technology in the modern era has significantly increased the risk of data breaches and misuse, particularly in email communications. Ensuring data privacy and security is crucial to preventing information theft and mitigating cyberattack risks. This research focuses on enhancing email client security through the integration of Hash-Based Message Authentication Code (HMAC) and Pretty Good Privacy (PGP). HMAC is employed as a message authentication mechanism to ensure the integrity and authenticity of email messages, while PGP is utilized to generate public and private key pairs, enabling secure encryption and decryption processes. By integrating these two security methods into the email client system, we aim to enhance its resilience against cyber threats. The system's effectiveness was evaluated through black-box testing, demonstrating its capability to secure the email delivery process. Additionally, an analysis of key randomness using the entropy method revealed a maximum value of 6 bits, indicating a relatively high level of randomness and further strengthening the encryption process. The results of this study indicate that the combined use of HMAC and PGP provides a robust security solution for enhancing email client security and mitigating potential cyberattack risks.
Enkripsi Data Lokasi Menggunakan Algoritma Rivest Shamir Adleman dan Advanced Encryption Standard pada Location Based Services Yasmina Azzahra; Hadiana, Asep Id; Kasyidi, Fatan
Journal of Informatics and Communication Technology (JICT) Vol. 6 No. 2 (2024)
Publisher : PPM Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Location Based Services atau layanan berbasis lokasi (LBS) telah menjadi bagian penting bagi kehidupan sehari-hari. Keamanan data lokasi pada LBS menjadi perhatian utama karena data tersebut dapat digunakan untuk melacak keberadaan pengguna dan mengungkapkan informasi pribadi. Oleh karena itu, penggunaan algoritma kriptografi sangat penting untuk melindungi data lokasi pada LBS. Dalam penelitian ini, algoritma RSA dan AES digunakan untuk mengenkripsi data lokasi pada LBS. AES digunakan untuk mengenkripsi data lokasi, sedangkan RSA digunakan untuk mengenkripsi secret key AES. Namun, penggunaan RSA dan AES memiliki keuntungan dan kelemahan masing-masing yang perlu dipertimbangkan dalam memilih algoritma yang tepat untuk digunakan pada sistem LBS. Penelitian ini menunjukkan bahwa proses enkripsi dan dekripsi data lokasi menggunakan kombinasi 2 algoritma dapat dilakukan pada database sistem LBS. Hasil pengujian avalanche effect pada AES mendapatkan hasil yang baik dengan rata-rata nilai mencapai 50,78 %, sedangkan pengujian entropy mendapatkan hasil yang kurang baik dimana nilai entropy yang dihasilkan jauh dari nilai entropy yang berkualitas. Pengujian performa sistem juga dilakukan untuk melihat dan membandingkan waktu antara sistem dengan enkripsi dan tanpa enkripsi. Sistem yang diterapkan algoritma kriptografi mengalami peningkatan waktu dengan rata-rata mencapai 1,46 detik.
Perlindungan Privasi Data Lokasi pada Location Based Services menggunakan Advanced Encryption Standard dan Secure Hash Algorithm-3 Nurrokhimah, Siti; Hadiana, Asep Id; Kasyidi, Fatan
Journal of Informatics and Communication Technology (JICT) Vol. 6 No. 2 (2024)
Publisher : PPM Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Dalam era transformasi digital, Layanan Berbasis Lokasi (LBS) kini menjadi krusial dalam berbagai platform digital, termasuk website pengiriman untuk pelacakan lokasi paket secara real-time. Namun, penggunaan LBS membawa risiko keamanan data lokasi. Dalam penggunaannya, website ini mengirimkan data ke server dalam bentuk teks biasa, yang menimbulkan kelemahan dalam keamanan data privasi pengguna. Padahal, kerahasiaan data pribadi termasuk data lokasi diatur dalam Pasal 26 UU ITE Revisi 2016 yang mengatur tentang privasi data pengguna. Berdasar hal tersebut, pada penelitian ini diterapkan algoritma AES dan SHA-3 untuk mengenkripsi dan hashing data lokasi pengguna sebelum dikirimkan ke server. Penelitian ini menunjukkan bahwa proses enkripsi dan hashing data lokasi dengan menggunakan kombinasi dua algoritma dapat diterapkan pada database sistem LBS. Pengujian dilakukan dengan melihat waktu tempuh pengiriman data pada seluruh sistem sebanyak 10 kali dengan variasi jumlah input data berbeda, yang menunjukkan adanya peningkatan waktu proses setelah implementasi Algoritma AES dan SHA-3. Selanjutnya, dari hasil pengujian avalanche effect menunjukkan hasil yang kurang baik sehingga tidak memberikan tingkat keamanan yang maksimal. Pengujian integritas juga dilakukan, dengan memeriksa hasil hashing data menggunakan SHA-3. Dari hasil pengujian tersebut, menunjukkan bahawa aspek integritas data lokasi pengguna terpenuhi sesuai dengan hasil pengujian integritas yang dilakukan.
Co-Authors Abdillah, Fajrul Abidillah, Gunawan Adelia Siti Rukoyah Agri Yodi Prayoga Agus Komarudin Agus Komarudin Agus Komarudin Alawiah, Siti Nurbayanti Alda Amorita Azza Ali, Moch. Dzikri Azhari Ananta Firdaus, Ahnaf Anggoro, Sigit Anggun Titah Islamiyyah Anshori, Siddiq Ahmad Anwar Fauzi, Mochammad Ardiansyah, Diki Arthur Oliviana Zabka Ashaury, Herdi Ashaury, Herdy Azhari, Moch Dzikri Azy Mushofy Anwary Badrujamaludin, Asep Chrisnanto, Yulison H. Dava Maulana, Muhammad Destiyanti, Fitri Dewi Marini Umi Atmaja Dewi Ratnasari DEWI RATNASARI Diah Tri Wahyuni Eddie Khrisna Putra Edvin Ramadhan Eka Purnama Rijaludin, Muhamad Engko M, Galih Yuga Pangestu Eriyadi, Maulidina Norick Fadilah, Vira Hasna Fahrezi, Rizal Febrian Faiza Renaldi Faiza Renaldi Fajar Firdaus, Fajar Fajri Rakhmat Umbara Fajri Rakhmat Umbara Fajri Rakhmat Umbara Fajri Rakhmat Umbara Fajri Rakhmat Umbara Fajri Rakhmat Febriansyah Istianto, Andrian Ferdiansyah Ferdian Ferina Nur Maulidya Firdaus, Syahrul Firman Alamsyah Galih Jatnika Galih Yuga Pangestu Engko M Gestavito, Rio Grace Christian M. Purba Gunawan Abdillah Gunawan Abdillah, Gunawan Gunawan Abidillah Hadi Apryana Hadimas Aprilian, Doni Haikal Muhammad, Husein Hanief Kuswanto, Muhammad Rafi Helsa Hawariyah Herdi Ashaury Herlina Napitupulu Hidayatulah Himawan Hovi Sohibul Wafa Hovi Hovi, Hovi Sohibul Wafa Humaira, Hana Nazla Idham Pratama Putra Illawati, Adinda Rahma Indah Putriani Fajar Sidik Insan Kamil Nurhikmat Ipan Sugiana Iqbal Dwi Nulhakim Iqbal Prayoga Willyana Irma Santikarama Irma Setiawati Ismafiaty, Ismafiaty Julianthy, Denissya Kafi, Moch. Nurul Kania Ningsih, Ade Kasyidi, Fatan Kharisma S, Moh Iqbal Komarudin, Agus Krishna Putra, Eddie Kusumaningtyas, Valentina Adimurti Lestari, Abdila Lugina Masri M. Purba, Grace Christian Melina Melina Melina Melina Melina, Melina Monica, Taris Muhammad Hasan Thoriq Almuwaffaq Thoriq Muhammad Sukma, Rifaz Muhammad, Azri Mulyasari, Cicik Rafka Mushofy Anwary, Azy Muthmainah, Sekar Ghaida Nabilla, Ulya Nizar Septi maulana Norizan Mohamed Nurrokhimah, Siti Nurul Sabrina, Puspita Oktaviani, Ayu Nur Oliviana Zabka, Arthur Prasetyo, Nur Faid Pryma Saputra Ginting Puspita Nurul Sabrina Puspita Nurul Sabrina Puspita Nurul Sabrina Puspita Putra, Eddie Krishna Putri Eka Prakasawati Rafli Firdaus Raflialdy Raksanagara Rahmawati, A Lusi Fitri Raihan Martin Permana Rakhmat Umbara, Fajri Ramdani, Maullidan Alfa Rizki Fikri Rezki Yuniarti Rezky Yuniarti Ria Amelia Junandes Ridwan Ilyas Rifaldi Elpry Rizal Rizal Dwiwahyu Pribadi Rizky Bayu Oktavian Rizky Fauzi Achman Rukoyah, Adelia Siti Salsabila Fajriati Romli Salsabila Salsabila, Mira Salsabila, Salsabila Fajriati Romli Santikarama, Irma Sapari, Albi Mulyadi SETIAWAN, YOSEP Sevty Nourmantana Shisi Prayesti Singgih, Dimas Siti Rohaeni Siti Widiani Sopian, Annisa Mufidah Sudrajat, Risqi Sukono Sukono Susanti, Adisti Dwi Syamsi, Salsa Safira Nur Syechru Denny Irja Gotama Szalfa Saadiatus Sakinah Tacbir Hendro P Tacbir Hendro P Tacbir Hendro P Tacbir Hendro Pudjiantoro Tacbir Hendro Pudjiantoro Tacbir Hendro Pudjiantoro Tacbir Hendro Pudjiantoro Tacbir Pudjiantoro Hendro Tachbir Hendro Taufiq Akbar Herawan Thomas Adi Nugroho Tulus Harry Lamramot Tulus Tulus, Tulus Harry Lamramot Umbara, Fajri Rakhmat Valentina Adimurti Kusumaningtyas Wahyuni Rodiyah Risfianti Widiyantoro, Widiyantoro Wina Witanti Wina Witanti Wina Witanti Wina Witanti Wina Witanti Wina Witanti Wina Witanti Winalia Winalia Winta Witanti Yasmina Azzahra Yudi Setiadi Permana Yulianto Dwi Saptohadi Yulison Herry Chrisnanto Yulita, Rita Fitri Yuswandi Yuswandi, Yuswandi